1 /* bpf_jit_comp.c : BPF JIT compiler
3 * Copyright (C) 2011-2013 Eric Dumazet (eric.dumazet@gmail.com)
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; version 2
10 #include <linux/moduleloader.h>
11 #include <asm/cacheflush.h>
12 #include <linux/netdevice.h>
13 #include <linux/filter.h>
14 #include <linux/if_vlan.h>
18 * EAX : BPF A accumulator
19 * EBX : BPF X accumulator
20 * RDI : pointer to skb (first argument given to JIT function)
21 * RBP : frame pointer (even if CONFIG_FRAME_POINTER=n)
22 * ECX,EDX,ESI : scratch registers
23 * r9d : skb->len - skb->data_len (headlen)
25 * -8(RBP) : saved RBX value
26 * -16(RBP)..-80(RBP) : BPF_MEMWORDS values
28 int bpf_jit_enable __read_mostly;
31 * assembly code in arch/x86/net/bpf_jit.S
33 extern u8 sk_load_word[], sk_load_half[], sk_load_byte[], sk_load_byte_msh[];
34 extern u8 sk_load_word_positive_offset[], sk_load_half_positive_offset[];
35 extern u8 sk_load_byte_positive_offset[], sk_load_byte_msh_positive_offset[];
36 extern u8 sk_load_word_negative_offset[], sk_load_half_negative_offset[];
37 extern u8 sk_load_byte_negative_offset[], sk_load_byte_msh_negative_offset[];
39 static inline u8 *emit_code(u8 *ptr, u32 bytes, unsigned int len)
52 #define EMIT(bytes, len) do { prog = emit_code(prog, bytes, len); } while (0)
54 #define EMIT1(b1) EMIT(b1, 1)
55 #define EMIT2(b1, b2) EMIT((b1) + ((b2) << 8), 2)
56 #define EMIT3(b1, b2, b3) EMIT((b1) + ((b2) << 8) + ((b3) << 16), 3)
57 #define EMIT4(b1, b2, b3, b4) EMIT((b1) + ((b2) << 8) + ((b3) << 16) + ((b4) << 24), 4)
58 #define EMIT1_off32(b1, off) do { EMIT1(b1); EMIT(off, 4);} while (0)
60 #define CLEAR_A() EMIT2(0x31, 0xc0) /* xor %eax,%eax */
61 #define CLEAR_X() EMIT2(0x31, 0xdb) /* xor %ebx,%ebx */
63 static inline bool is_imm8(int value)
65 return value <= 127 && value >= -128;
68 static inline bool is_near(int offset)
70 return offset <= 127 && offset >= -128;
73 #define EMIT_JMP(offset) \
76 if (is_near(offset)) \
77 EMIT2(0xeb, offset); /* jmp .+off8 */ \
79 EMIT1_off32(0xe9, offset); /* jmp .+off32 */ \
83 /* list of x86 cond jumps opcodes (. + s8)
84 * Add 0x10 (and an extra 0x0f) to generate far jumps (. + s32)
93 #define EMIT_COND_JMP(op, offset) \
95 if (is_near(offset)) \
96 EMIT2(op, offset); /* jxx .+off8 */ \
98 EMIT2(0x0f, op + 0x10); \
99 EMIT(offset, 4); /* jxx .+off32 */ \
103 #define COND_SEL(CODE, TOP, FOP) \
110 #define SEEN_DATAREF 1 /* might call external helpers */
111 #define SEEN_XREG 2 /* ebx is used */
112 #define SEEN_MEM 4 /* use mem[] for temporary storage */
114 static inline void bpf_flush_icache(void *start, void *end)
116 mm_segment_t old_fs = get_fs();
120 flush_icache_range((unsigned long)start, (unsigned long)end);
124 #define CHOOSE_LOAD_FUNC(K, func) \
125 ((int)K < 0 ? ((int)K >= SKF_LL_OFF ? func##_negative_offset : func) : func##_positive_offset)
127 /* Helper to find the offset of pkt_type in sk_buff
128 * We want to make sure its still a 3bit field starting at a byte boundary.
130 #define PKT_TYPE_MAX 7
131 static int pkt_type_offset(void)
133 struct sk_buff skb_probe = {
136 char *ct = (char *)&skb_probe;
139 for (off = 0; off < sizeof(struct sk_buff); off++) {
140 if (ct[off] == PKT_TYPE_MAX)
143 pr_err_once("Please fix pkt_type_offset(), as pkt_type couldn't be found\n");
147 void bpf_jit_compile(struct sk_filter *fp)
151 unsigned int proglen, oldproglen = 0;
153 int t_offset, f_offset;
154 u8 t_op, f_op, seen = 0, pass;
157 int pc_ret0 = -1; /* bpf index of first RET #0 instruction (if any) */
158 unsigned int cleanup_addr; /* epilogue code offset */
160 const struct sock_filter *filter = fp->insns;
166 addrs = kmalloc(flen * sizeof(*addrs), GFP_KERNEL);
170 /* Before first pass, make a rough estimation of addrs[]
171 * each bpf instruction is translated to less than 64 bytes
173 for (proglen = 0, i = 0; i < flen; i++) {
177 cleanup_addr = proglen; /* epilogue address */
179 for (pass = 0; pass < 10; pass++) {
180 u8 seen_or_pass0 = (pass == 0) ? (SEEN_XREG | SEEN_DATAREF | SEEN_MEM) : seen;
181 /* no prologue/epilogue for trivial filters (RET something) */
186 EMIT4(0x55, 0x48, 0x89, 0xe5); /* push %rbp; mov %rsp,%rbp */
187 EMIT4(0x48, 0x83, 0xec, 96); /* subq $96,%rsp */
188 /* note : must save %rbx in case bpf_error is hit */
189 if (seen_or_pass0 & (SEEN_XREG | SEEN_DATAREF))
190 EMIT4(0x48, 0x89, 0x5d, 0xf8); /* mov %rbx, -8(%rbp) */
191 if (seen_or_pass0 & SEEN_XREG)
192 CLEAR_X(); /* make sure we dont leek kernel memory */
195 * If this filter needs to access skb data,
196 * loads r9 and r8 with :
197 * r9 = skb->len - skb->data_len
200 if (seen_or_pass0 & SEEN_DATAREF) {
201 if (offsetof(struct sk_buff, len) <= 127)
202 /* mov off8(%rdi),%r9d */
203 EMIT4(0x44, 0x8b, 0x4f, offsetof(struct sk_buff, len));
205 /* mov off32(%rdi),%r9d */
206 EMIT3(0x44, 0x8b, 0x8f);
207 EMIT(offsetof(struct sk_buff, len), 4);
209 if (is_imm8(offsetof(struct sk_buff, data_len)))
210 /* sub off8(%rdi),%r9d */
211 EMIT4(0x44, 0x2b, 0x4f, offsetof(struct sk_buff, data_len));
213 EMIT3(0x44, 0x2b, 0x8f);
214 EMIT(offsetof(struct sk_buff, data_len), 4);
217 if (is_imm8(offsetof(struct sk_buff, data)))
218 /* mov off8(%rdi),%r8 */
219 EMIT4(0x4c, 0x8b, 0x47, offsetof(struct sk_buff, data));
221 /* mov off32(%rdi),%r8 */
222 EMIT3(0x4c, 0x8b, 0x87);
223 EMIT(offsetof(struct sk_buff, data), 4);
228 switch (filter[0].code) {
231 case BPF_S_ANC_PROTOCOL:
232 case BPF_S_ANC_IFINDEX:
234 case BPF_S_ANC_RXHASH:
236 case BPF_S_ANC_VLAN_TAG:
237 case BPF_S_ANC_VLAN_TAG_PRESENT:
238 case BPF_S_ANC_QUEUE:
239 case BPF_S_ANC_PKTTYPE:
243 /* first instruction sets A register (or is RET 'constant') */
246 /* make sure we dont leak kernel information to user */
247 CLEAR_A(); /* A = 0 */
250 for (i = 0; i < flen; i++) {
251 unsigned int K = filter[i].k;
253 switch (filter[i].code) {
254 case BPF_S_ALU_ADD_X: /* A += X; */
256 EMIT2(0x01, 0xd8); /* add %ebx,%eax */
258 case BPF_S_ALU_ADD_K: /* A += K; */
262 EMIT3(0x83, 0xc0, K); /* add imm8,%eax */
264 EMIT1_off32(0x05, K); /* add imm32,%eax */
266 case BPF_S_ALU_SUB_X: /* A -= X; */
268 EMIT2(0x29, 0xd8); /* sub %ebx,%eax */
270 case BPF_S_ALU_SUB_K: /* A -= K */
274 EMIT3(0x83, 0xe8, K); /* sub imm8,%eax */
276 EMIT1_off32(0x2d, K); /* sub imm32,%eax */
278 case BPF_S_ALU_MUL_X: /* A *= X; */
280 EMIT3(0x0f, 0xaf, 0xc3); /* imul %ebx,%eax */
282 case BPF_S_ALU_MUL_K: /* A *= K */
284 EMIT3(0x6b, 0xc0, K); /* imul imm8,%eax,%eax */
286 EMIT2(0x69, 0xc0); /* imul imm32,%eax */
290 case BPF_S_ALU_DIV_X: /* A /= X; */
292 EMIT2(0x85, 0xdb); /* test %ebx,%ebx */
294 /* addrs[pc_ret0 - 1] is start address of target
295 * (addrs[i] - 4) is the address following this jmp
296 * ("xor %edx,%edx; div %ebx" being 4 bytes long)
298 EMIT_COND_JMP(X86_JE, addrs[pc_ret0 - 1] -
301 EMIT_COND_JMP(X86_JNE, 2 + 5);
303 EMIT1_off32(0xe9, cleanup_addr - (addrs[i] - 4)); /* jmp .+off32 */
305 EMIT4(0x31, 0xd2, 0xf7, 0xf3); /* xor %edx,%edx; div %ebx */
307 case BPF_S_ALU_MOD_X: /* A %= X; */
309 EMIT2(0x85, 0xdb); /* test %ebx,%ebx */
311 /* addrs[pc_ret0 - 1] is start address of target
312 * (addrs[i] - 6) is the address following this jmp
313 * ("xor %edx,%edx; div %ebx;mov %edx,%eax" being 6 bytes long)
315 EMIT_COND_JMP(X86_JE, addrs[pc_ret0 - 1] -
318 EMIT_COND_JMP(X86_JNE, 2 + 5);
320 EMIT1_off32(0xe9, cleanup_addr - (addrs[i] - 6)); /* jmp .+off32 */
322 EMIT2(0x31, 0xd2); /* xor %edx,%edx */
323 EMIT2(0xf7, 0xf3); /* div %ebx */
324 EMIT2(0x89, 0xd0); /* mov %edx,%eax */
326 case BPF_S_ALU_MOD_K: /* A %= K; */
331 EMIT2(0x31, 0xd2); /* xor %edx,%edx */
332 EMIT1(0xb9);EMIT(K, 4); /* mov imm32,%ecx */
333 EMIT2(0xf7, 0xf1); /* div %ecx */
334 EMIT2(0x89, 0xd0); /* mov %edx,%eax */
336 case BPF_S_ALU_DIV_K: /* A /= K */
339 EMIT2(0x31, 0xd2); /* xor %edx,%edx */
340 EMIT1(0xb9);EMIT(K, 4); /* mov imm32,%ecx */
341 EMIT2(0xf7, 0xf1); /* div %ecx */
343 case BPF_S_ALU_AND_X:
345 EMIT2(0x21, 0xd8); /* and %ebx,%eax */
347 case BPF_S_ALU_AND_K:
348 if (K >= 0xFFFFFF00) {
349 EMIT2(0x24, K & 0xFF); /* and imm8,%al */
350 } else if (K >= 0xFFFF0000) {
351 EMIT2(0x66, 0x25); /* and imm16,%ax */
354 EMIT1_off32(0x25, K); /* and imm32,%eax */
359 EMIT2(0x09, 0xd8); /* or %ebx,%eax */
363 EMIT3(0x83, 0xc8, K); /* or imm8,%eax */
365 EMIT1_off32(0x0d, K); /* or imm32,%eax */
367 case BPF_S_ANC_ALU_XOR_X: /* A ^= X; */
368 case BPF_S_ALU_XOR_X:
370 EMIT2(0x31, 0xd8); /* xor %ebx,%eax */
372 case BPF_S_ALU_XOR_K: /* A ^= K; */
376 EMIT3(0x83, 0xf0, K); /* xor imm8,%eax */
378 EMIT1_off32(0x35, K); /* xor imm32,%eax */
380 case BPF_S_ALU_LSH_X: /* A <<= X; */
382 EMIT4(0x89, 0xd9, 0xd3, 0xe0); /* mov %ebx,%ecx; shl %cl,%eax */
384 case BPF_S_ALU_LSH_K:
388 EMIT2(0xd1, 0xe0); /* shl %eax */
390 EMIT3(0xc1, 0xe0, K);
392 case BPF_S_ALU_RSH_X: /* A >>= X; */
394 EMIT4(0x89, 0xd9, 0xd3, 0xe8); /* mov %ebx,%ecx; shr %cl,%eax */
396 case BPF_S_ALU_RSH_K: /* A >>= K; */
400 EMIT2(0xd1, 0xe8); /* shr %eax */
402 EMIT3(0xc1, 0xe8, K);
405 EMIT2(0xf7, 0xd8); /* neg %eax */
413 EMIT1_off32(0xb8, K); /* mov $imm32,%eax */
419 EMIT_JMP(cleanup_addr - addrs[i]);
422 if (seen_or_pass0 & SEEN_XREG)
423 EMIT4(0x48, 0x8b, 0x5d, 0xf8); /* mov -8(%rbp),%rbx */
424 EMIT1(0xc9); /* leaveq */
426 EMIT1(0xc3); /* ret */
428 case BPF_S_MISC_TAX: /* X = A */
430 EMIT2(0x89, 0xc3); /* mov %eax,%ebx */
432 case BPF_S_MISC_TXA: /* A = X */
434 EMIT2(0x89, 0xd8); /* mov %ebx,%eax */
436 case BPF_S_LD_IMM: /* A = K */
440 EMIT1_off32(0xb8, K); /* mov $imm32,%eax */
442 case BPF_S_LDX_IMM: /* X = K */
447 EMIT1_off32(0xbb, K); /* mov $imm32,%ebx */
449 case BPF_S_LD_MEM: /* A = mem[K] : mov off8(%rbp),%eax */
451 EMIT3(0x8b, 0x45, 0xf0 - K*4);
453 case BPF_S_LDX_MEM: /* X = mem[K] : mov off8(%rbp),%ebx */
454 seen |= SEEN_XREG | SEEN_MEM;
455 EMIT3(0x8b, 0x5d, 0xf0 - K*4);
457 case BPF_S_ST: /* mem[K] = A : mov %eax,off8(%rbp) */
459 EMIT3(0x89, 0x45, 0xf0 - K*4);
461 case BPF_S_STX: /* mem[K] = X : mov %ebx,off8(%rbp) */
462 seen |= SEEN_XREG | SEEN_MEM;
463 EMIT3(0x89, 0x5d, 0xf0 - K*4);
465 case BPF_S_LD_W_LEN: /* A = skb->len; */
466 BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, len) != 4);
467 if (is_imm8(offsetof(struct sk_buff, len)))
468 /* mov off8(%rdi),%eax */
469 EMIT3(0x8b, 0x47, offsetof(struct sk_buff, len));
472 EMIT(offsetof(struct sk_buff, len), 4);
475 case BPF_S_LDX_W_LEN: /* X = skb->len; */
477 if (is_imm8(offsetof(struct sk_buff, len)))
478 /* mov off8(%rdi),%ebx */
479 EMIT3(0x8b, 0x5f, offsetof(struct sk_buff, len));
482 EMIT(offsetof(struct sk_buff, len), 4);
485 case BPF_S_ANC_PROTOCOL: /* A = ntohs(skb->protocol); */
486 BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, protocol) != 2);
487 if (is_imm8(offsetof(struct sk_buff, protocol))) {
488 /* movzwl off8(%rdi),%eax */
489 EMIT4(0x0f, 0xb7, 0x47, offsetof(struct sk_buff, protocol));
491 EMIT3(0x0f, 0xb7, 0x87); /* movzwl off32(%rdi),%eax */
492 EMIT(offsetof(struct sk_buff, protocol), 4);
494 EMIT2(0x86, 0xc4); /* ntohs() : xchg %al,%ah */
496 case BPF_S_ANC_IFINDEX:
497 if (is_imm8(offsetof(struct sk_buff, dev))) {
498 /* movq off8(%rdi),%rax */
499 EMIT4(0x48, 0x8b, 0x47, offsetof(struct sk_buff, dev));
501 EMIT3(0x48, 0x8b, 0x87); /* movq off32(%rdi),%rax */
502 EMIT(offsetof(struct sk_buff, dev), 4);
504 EMIT3(0x48, 0x85, 0xc0); /* test %rax,%rax */
505 EMIT_COND_JMP(X86_JE, cleanup_addr - (addrs[i] - 6));
506 BUILD_BUG_ON(FIELD_SIZEOF(struct net_device, ifindex) != 4);
507 EMIT2(0x8b, 0x80); /* mov off32(%rax),%eax */
508 EMIT(offsetof(struct net_device, ifindex), 4);
511 BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, mark) != 4);
512 if (is_imm8(offsetof(struct sk_buff, mark))) {
513 /* mov off8(%rdi),%eax */
514 EMIT3(0x8b, 0x47, offsetof(struct sk_buff, mark));
517 EMIT(offsetof(struct sk_buff, mark), 4);
520 case BPF_S_ANC_RXHASH:
521 BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, rxhash) != 4);
522 if (is_imm8(offsetof(struct sk_buff, rxhash))) {
523 /* mov off8(%rdi),%eax */
524 EMIT3(0x8b, 0x47, offsetof(struct sk_buff, rxhash));
527 EMIT(offsetof(struct sk_buff, rxhash), 4);
530 case BPF_S_ANC_QUEUE:
531 BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, queue_mapping) != 2);
532 if (is_imm8(offsetof(struct sk_buff, queue_mapping))) {
533 /* movzwl off8(%rdi),%eax */
534 EMIT4(0x0f, 0xb7, 0x47, offsetof(struct sk_buff, queue_mapping));
536 EMIT3(0x0f, 0xb7, 0x87); /* movzwl off32(%rdi),%eax */
537 EMIT(offsetof(struct sk_buff, queue_mapping), 4);
542 EMIT4(0x65, 0x8b, 0x04, 0x25); /* mov %gs:off32,%eax */
543 EMIT((u32)(unsigned long)&cpu_number, 4); /* A = smp_processor_id(); */
548 case BPF_S_ANC_VLAN_TAG:
549 case BPF_S_ANC_VLAN_TAG_PRESENT:
550 BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, vlan_tci) != 2);
551 if (is_imm8(offsetof(struct sk_buff, vlan_tci))) {
552 /* movzwl off8(%rdi),%eax */
553 EMIT4(0x0f, 0xb7, 0x47, offsetof(struct sk_buff, vlan_tci));
555 EMIT3(0x0f, 0xb7, 0x87); /* movzwl off32(%rdi),%eax */
556 EMIT(offsetof(struct sk_buff, vlan_tci), 4);
558 BUILD_BUG_ON(VLAN_TAG_PRESENT != 0x1000);
559 if (filter[i].code == BPF_S_ANC_VLAN_TAG) {
560 EMIT3(0x80, 0xe4, 0xef); /* and $0xef,%ah */
562 EMIT3(0xc1, 0xe8, 0x0c); /* shr $0xc,%eax */
563 EMIT3(0x83, 0xe0, 0x01); /* and $0x1,%eax */
566 case BPF_S_ANC_PKTTYPE:
568 int off = pkt_type_offset();
573 /* movzbl off8(%rdi),%eax */
574 EMIT4(0x0f, 0xb6, 0x47, off);
576 /* movbl off32(%rdi),%eax */
577 EMIT3(0x0f, 0xb6, 0x87);
580 EMIT3(0x83, 0xe0, PKT_TYPE_MAX); /* and $0x7,%eax */
584 func = CHOOSE_LOAD_FUNC(K, sk_load_word);
585 common_load: seen |= SEEN_DATAREF;
586 t_offset = func - (image + addrs[i]);
587 EMIT1_off32(0xbe, K); /* mov imm32,%esi */
588 EMIT1_off32(0xe8, t_offset); /* call */
591 func = CHOOSE_LOAD_FUNC(K, sk_load_half);
594 func = CHOOSE_LOAD_FUNC(K, sk_load_byte);
596 case BPF_S_LDX_B_MSH:
597 func = CHOOSE_LOAD_FUNC(K, sk_load_byte_msh);
598 seen |= SEEN_DATAREF | SEEN_XREG;
599 t_offset = func - (image + addrs[i]);
600 EMIT1_off32(0xbe, K); /* mov imm32,%esi */
601 EMIT1_off32(0xe8, t_offset); /* call sk_load_byte_msh */
605 common_load_ind: seen |= SEEN_DATAREF | SEEN_XREG;
606 t_offset = func - (image + addrs[i]);
609 EMIT3(0x8d, 0x73, K); /* lea imm8(%rbx), %esi */
611 EMIT2(0x8d, 0xb3); /* lea imm32(%rbx),%esi */
615 EMIT2(0x89,0xde); /* mov %ebx,%esi */
617 EMIT1_off32(0xe8, t_offset); /* call sk_load_xxx_ind */
621 goto common_load_ind;
624 goto common_load_ind;
626 t_offset = addrs[i + K] - addrs[i];
629 COND_SEL(BPF_S_JMP_JGT_K, X86_JA, X86_JBE);
630 COND_SEL(BPF_S_JMP_JGE_K, X86_JAE, X86_JB);
631 COND_SEL(BPF_S_JMP_JEQ_K, X86_JE, X86_JNE);
632 COND_SEL(BPF_S_JMP_JSET_K,X86_JNE, X86_JE);
633 COND_SEL(BPF_S_JMP_JGT_X, X86_JA, X86_JBE);
634 COND_SEL(BPF_S_JMP_JGE_X, X86_JAE, X86_JB);
635 COND_SEL(BPF_S_JMP_JEQ_X, X86_JE, X86_JNE);
636 COND_SEL(BPF_S_JMP_JSET_X,X86_JNE, X86_JE);
638 cond_branch: f_offset = addrs[i + filter[i].jf] - addrs[i];
639 t_offset = addrs[i + filter[i].jt] - addrs[i];
641 /* same targets, can avoid doing the test :) */
642 if (filter[i].jt == filter[i].jf) {
647 switch (filter[i].code) {
648 case BPF_S_JMP_JGT_X:
649 case BPF_S_JMP_JGE_X:
650 case BPF_S_JMP_JEQ_X:
652 EMIT2(0x39, 0xd8); /* cmp %ebx,%eax */
654 case BPF_S_JMP_JSET_X:
656 EMIT2(0x85, 0xd8); /* test %ebx,%eax */
658 case BPF_S_JMP_JEQ_K:
660 EMIT2(0x85, 0xc0); /* test %eax,%eax */
663 case BPF_S_JMP_JGT_K:
664 case BPF_S_JMP_JGE_K:
666 EMIT3(0x83, 0xf8, K); /* cmp imm8,%eax */
668 EMIT1_off32(0x3d, K); /* cmp imm32,%eax */
670 case BPF_S_JMP_JSET_K:
672 EMIT2(0xa8, K); /* test imm8,%al */
673 else if (!(K & 0xFFFF00FF))
674 EMIT3(0xf6, 0xc4, K >> 8); /* test imm8,%ah */
675 else if (K <= 0xFFFF) {
676 EMIT2(0x66, 0xa9); /* test imm16,%ax */
679 EMIT1_off32(0xa9, K); /* test imm32,%eax */
683 if (filter[i].jt != 0) {
684 if (filter[i].jf && f_offset)
685 t_offset += is_near(f_offset) ? 2 : 5;
686 EMIT_COND_JMP(t_op, t_offset);
691 EMIT_COND_JMP(f_op, f_offset);
694 /* hmm, too complex filter, give up with jit compiler */
699 if (unlikely(proglen + ilen > oldproglen)) {
700 pr_err("bpb_jit_compile fatal error\n");
702 module_free(NULL, image);
705 memcpy(image + proglen, temp, ilen);
711 /* last bpf instruction is always a RET :
712 * use it to give the cleanup instruction(s) addr
714 cleanup_addr = proglen - 1; /* ret */
716 cleanup_addr -= 1; /* leaveq */
717 if (seen_or_pass0 & SEEN_XREG)
718 cleanup_addr -= 4; /* mov -8(%rbp),%rbx */
721 if (proglen != oldproglen)
722 pr_err("bpb_jit_compile proglen=%u != oldproglen=%u\n", proglen, oldproglen);
725 if (proglen == oldproglen) {
726 image = module_alloc(max_t(unsigned int,
728 sizeof(struct work_struct)));
732 oldproglen = proglen;
735 if (bpf_jit_enable > 1)
736 bpf_jit_dump(flen, proglen, pass, image);
739 bpf_flush_icache(image, image + proglen);
740 fp->bpf_func = (void *)image;
747 static void jit_free_defer(struct work_struct *arg)
749 module_free(NULL, arg);
752 /* run from softirq, we must use a work_struct to call
753 * module_free() from process context
755 void bpf_jit_free(struct sk_filter *fp)
757 if (fp->bpf_func != sk_run_filter) {
758 struct work_struct *work = (struct work_struct *)fp->bpf_func;
760 INIT_WORK(work, jit_free_defer);