1 /* bpf_jit_comp.c : BPF JIT compiler
3 * Copyright (C) 2011-2013 Eric Dumazet (eric.dumazet@gmail.com)
4 * Internal BPF Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; version 2
11 #include <linux/netdevice.h>
12 #include <linux/filter.h>
13 #include <linux/if_vlan.h>
14 #include <asm/cacheflush.h>
15 #include <asm/set_memory.h>
16 #include <asm/nospec-branch.h>
17 #include <linux/bpf.h>
20 * assembly code in arch/x86/net/bpf_jit.S
22 extern u8 sk_load_word[], sk_load_half[], sk_load_byte[];
23 extern u8 sk_load_word_positive_offset[], sk_load_half_positive_offset[];
24 extern u8 sk_load_byte_positive_offset[];
25 extern u8 sk_load_word_negative_offset[], sk_load_half_negative_offset[];
26 extern u8 sk_load_byte_negative_offset[];
28 static u8 *emit_code(u8 *ptr, u32 bytes, unsigned int len)
41 #define EMIT(bytes, len) \
42 do { prog = emit_code(prog, bytes, len); cnt += len; } while (0)
44 #define EMIT1(b1) EMIT(b1, 1)
45 #define EMIT2(b1, b2) EMIT((b1) + ((b2) << 8), 2)
46 #define EMIT3(b1, b2, b3) EMIT((b1) + ((b2) << 8) + ((b3) << 16), 3)
47 #define EMIT4(b1, b2, b3, b4) EMIT((b1) + ((b2) << 8) + ((b3) << 16) + ((b4) << 24), 4)
48 #define EMIT1_off32(b1, off) \
49 do {EMIT1(b1); EMIT(off, 4); } while (0)
50 #define EMIT2_off32(b1, b2, off) \
51 do {EMIT2(b1, b2); EMIT(off, 4); } while (0)
52 #define EMIT3_off32(b1, b2, b3, off) \
53 do {EMIT3(b1, b2, b3); EMIT(off, 4); } while (0)
54 #define EMIT4_off32(b1, b2, b3, b4, off) \
55 do {EMIT4(b1, b2, b3, b4); EMIT(off, 4); } while (0)
57 static bool is_imm8(int value)
59 return value <= 127 && value >= -128;
62 static bool is_simm32(s64 value)
64 return value == (s64) (s32) value;
68 #define EMIT_mov(DST, SRC) \
70 EMIT3(add_2mod(0x48, DST, SRC), 0x89, add_2reg(0xC0, DST, SRC)); \
73 static int bpf_size_to_x86_bytes(int bpf_size)
75 if (bpf_size == BPF_W)
77 else if (bpf_size == BPF_H)
79 else if (bpf_size == BPF_B)
81 else if (bpf_size == BPF_DW)
87 /* list of x86 cond jumps opcodes (. + s8)
88 * Add 0x10 (and an extra 0x0f) to generate far jumps (. + s32)
101 static void bpf_flush_icache(void *start, void *end)
103 mm_segment_t old_fs = get_fs();
107 flush_icache_range((unsigned long)start, (unsigned long)end);
111 #define CHOOSE_LOAD_FUNC(K, func) \
112 ((int)K < 0 ? ((int)K >= SKF_LL_OFF ? func##_negative_offset : func) : func##_positive_offset)
114 /* pick a register outside of BPF range for JIT internal work */
115 #define AUX_REG (MAX_BPF_JIT_REG + 1)
117 /* The following table maps BPF registers to x64 registers.
119 * x64 register r12 is unused, since if used as base address
120 * register in load/store instructions, it always needs an
121 * extra byte of encoding and is callee saved.
123 * r9 caches skb->len - skb->data_len
124 * r10 caches skb->data, and used for blinding (if enabled)
126 static const int reg2hex[] = {
127 [BPF_REG_0] = 0, /* rax */
128 [BPF_REG_1] = 7, /* rdi */
129 [BPF_REG_2] = 6, /* rsi */
130 [BPF_REG_3] = 2, /* rdx */
131 [BPF_REG_4] = 1, /* rcx */
132 [BPF_REG_5] = 0, /* r8 */
133 [BPF_REG_6] = 3, /* rbx callee saved */
134 [BPF_REG_7] = 5, /* r13 callee saved */
135 [BPF_REG_8] = 6, /* r14 callee saved */
136 [BPF_REG_9] = 7, /* r15 callee saved */
137 [BPF_REG_FP] = 5, /* rbp readonly */
138 [BPF_REG_AX] = 2, /* r10 temp register */
139 [AUX_REG] = 3, /* r11 temp register */
142 /* is_ereg() == true if BPF register 'reg' maps to x64 r8..r15
143 * which need extra byte of encoding.
144 * rax,rcx,...,rbp have simpler encoding
146 static bool is_ereg(u32 reg)
148 return (1 << reg) & (BIT(BPF_REG_5) |
157 * is_ereg_8l() == true if BPF register 'reg' is mapped to access x86-64
158 * lower 8-bit registers dil,sil,bpl,spl,r8b..r15b, which need extra byte
159 * of encoding. al,cl,dl,bl have simpler encoding.
161 static bool is_ereg_8l(u32 reg)
163 return is_ereg(reg) ||
164 (1 << reg) & (BIT(BPF_REG_1) |
169 /* add modifiers if 'reg' maps to x64 registers r8..r15 */
170 static u8 add_1mod(u8 byte, u32 reg)
177 static u8 add_2mod(u8 byte, u32 r1, u32 r2)
186 /* encode 'dst_reg' register into x64 opcode 'byte' */
187 static u8 add_1reg(u8 byte, u32 dst_reg)
189 return byte + reg2hex[dst_reg];
192 /* encode 'dst_reg' and 'src_reg' registers into x64 opcode 'byte' */
193 static u8 add_2reg(u8 byte, u32 dst_reg, u32 src_reg)
195 return byte + reg2hex[dst_reg] + (reg2hex[src_reg] << 3);
198 static void jit_fill_hole(void *area, unsigned int size)
200 /* fill whole space with int3 instructions */
201 memset(area, 0xcc, size);
205 int cleanup_addr; /* epilogue code offset */
210 /* maximum number of bytes emitted while JITing one eBPF insn */
211 #define BPF_MAX_INSN_SIZE 128
212 #define BPF_INSN_SAFETY 64
214 #define AUX_STACK_SPACE \
215 (32 /* space for rbx, r13, r14, r15 */ + \
216 8 /* space for skb_copy_bits() buffer */)
218 #define PROLOGUE_SIZE 37
220 /* emit x64 prologue code for BPF program and check it's size.
221 * bpf_tail_call helper will skip it while jumping into another program
223 static void emit_prologue(u8 **pprog, u32 stack_depth)
228 EMIT1(0x55); /* push rbp */
229 EMIT3(0x48, 0x89, 0xE5); /* mov rbp,rsp */
231 /* sub rsp, rounded_stack_depth + AUX_STACK_SPACE */
232 EMIT3_off32(0x48, 0x81, 0xEC,
233 round_up(stack_depth, 8) + AUX_STACK_SPACE);
235 /* sub rbp, AUX_STACK_SPACE */
236 EMIT4(0x48, 0x83, 0xED, AUX_STACK_SPACE);
238 /* all classic BPF filters use R6(rbx) save it */
240 /* mov qword ptr [rbp+0],rbx */
241 EMIT4(0x48, 0x89, 0x5D, 0);
243 /* bpf_convert_filter() maps classic BPF register X to R7 and uses R8
244 * as temporary, so all tcpdump filters need to spill/fill R7(r13) and
245 * R8(r14). R9(r15) spill could be made conditional, but there is only
246 * one 'bpf_error' return path out of helper functions inside bpf_jit.S
247 * The overhead of extra spill is negligible for any filter other
248 * than synthetic ones. Therefore not worth adding complexity.
251 /* mov qword ptr [rbp+8],r13 */
252 EMIT4(0x4C, 0x89, 0x6D, 8);
253 /* mov qword ptr [rbp+16],r14 */
254 EMIT4(0x4C, 0x89, 0x75, 16);
255 /* mov qword ptr [rbp+24],r15 */
256 EMIT4(0x4C, 0x89, 0x7D, 24);
258 /* Clear the tail call counter (tail_call_cnt): for eBPF tail calls
259 * we need to reset the counter to 0. It's done in two instructions,
260 * resetting rax register to 0 (xor on eax gets 0 extended), and
261 * moving it to the counter location.
266 /* mov qword ptr [rbp+32], rax */
267 EMIT4(0x48, 0x89, 0x45, 32);
269 BUILD_BUG_ON(cnt != PROLOGUE_SIZE);
273 /* generate the following code:
274 * ... bpf_tail_call(void *ctx, struct bpf_array *array, u64 index) ...
275 * if (index >= array->map.max_entries)
277 * if (++tail_call_cnt > MAX_TAIL_CALL_CNT)
279 * prog = array->ptrs[index];
282 * goto *(prog->bpf_func + prologue_size);
285 static void emit_bpf_tail_call(u8 **pprog)
288 int label1, label2, label3;
291 /* rdi - pointer to ctx
292 * rsi - pointer to bpf_array
293 * rdx - index in bpf_array
296 /* if (index >= array->map.max_entries)
299 EMIT2(0x89, 0xD2); /* mov edx, edx */
300 EMIT3(0x39, 0x56, /* cmp dword ptr [rsi + 16], edx */
301 offsetof(struct bpf_array, map.max_entries));
302 #define OFFSET1 (41 + RETPOLINE_RAX_BPF_JIT_SIZE) /* number of bytes to jump */
303 EMIT2(X86_JBE, OFFSET1); /* jbe out */
306 /* if (tail_call_cnt > MAX_TAIL_CALL_CNT)
309 EMIT2_off32(0x8B, 0x85, 36); /* mov eax, dword ptr [rbp + 36] */
310 EMIT3(0x83, 0xF8, MAX_TAIL_CALL_CNT); /* cmp eax, MAX_TAIL_CALL_CNT */
311 #define OFFSET2 (30 + RETPOLINE_RAX_BPF_JIT_SIZE)
312 EMIT2(X86_JA, OFFSET2); /* ja out */
314 EMIT3(0x83, 0xC0, 0x01); /* add eax, 1 */
315 EMIT2_off32(0x89, 0x85, 36); /* mov dword ptr [rbp + 36], eax */
317 /* prog = array->ptrs[index]; */
318 EMIT4_off32(0x48, 0x8B, 0x84, 0xD6, /* mov rax, [rsi + rdx * 8 + offsetof(...)] */
319 offsetof(struct bpf_array, ptrs));
324 EMIT3(0x48, 0x85, 0xC0); /* test rax,rax */
325 #define OFFSET3 (8 + RETPOLINE_RAX_BPF_JIT_SIZE)
326 EMIT2(X86_JE, OFFSET3); /* je out */
329 /* goto *(prog->bpf_func + prologue_size); */
330 EMIT4(0x48, 0x8B, 0x40, /* mov rax, qword ptr [rax + 32] */
331 offsetof(struct bpf_prog, bpf_func));
332 EMIT4(0x48, 0x83, 0xC0, PROLOGUE_SIZE); /* add rax, prologue_size */
334 /* now we're ready to jump into next BPF program
335 * rdi == ctx (1st arg)
336 * rax == prog->bpf_func + prologue_size
338 RETPOLINE_RAX_BPF_JIT();
341 BUILD_BUG_ON(cnt - label1 != OFFSET1);
342 BUILD_BUG_ON(cnt - label2 != OFFSET2);
343 BUILD_BUG_ON(cnt - label3 != OFFSET3);
348 static void emit_load_skb_data_hlen(u8 **pprog)
353 /* r9d = skb->len - skb->data_len (headlen)
356 /* mov %r9d, off32(%rdi) */
357 EMIT3_off32(0x44, 0x8b, 0x8f, offsetof(struct sk_buff, len));
359 /* sub %r9d, off32(%rdi) */
360 EMIT3_off32(0x44, 0x2b, 0x8f, offsetof(struct sk_buff, data_len));
362 /* mov %r10, off32(%rdi) */
363 EMIT3_off32(0x4c, 0x8b, 0x97, offsetof(struct sk_buff, data));
367 static int do_jit(struct bpf_prog *bpf_prog, int *addrs, u8 *image,
368 int oldproglen, struct jit_context *ctx)
370 struct bpf_insn *insn = bpf_prog->insnsi;
371 int insn_cnt = bpf_prog->len;
372 bool seen_ld_abs = ctx->seen_ld_abs | (oldproglen == 0);
373 bool seen_ax_reg = ctx->seen_ax_reg | (oldproglen == 0);
374 bool seen_exit = false;
375 u8 temp[BPF_MAX_INSN_SIZE + BPF_INSN_SAFETY];
380 emit_prologue(&prog, bpf_prog->aux->stack_depth);
383 emit_load_skb_data_hlen(&prog);
385 for (i = 0; i < insn_cnt; i++, insn++) {
386 const s32 imm32 = insn->imm;
387 u32 dst_reg = insn->dst_reg;
388 u32 src_reg = insn->src_reg;
389 u8 b1 = 0, b2 = 0, b3 = 0;
392 bool reload_skb_data;
396 if (dst_reg == BPF_REG_AX || src_reg == BPF_REG_AX)
397 ctx->seen_ax_reg = seen_ax_reg = true;
399 switch (insn->code) {
401 case BPF_ALU | BPF_ADD | BPF_X:
402 case BPF_ALU | BPF_SUB | BPF_X:
403 case BPF_ALU | BPF_AND | BPF_X:
404 case BPF_ALU | BPF_OR | BPF_X:
405 case BPF_ALU | BPF_XOR | BPF_X:
406 case BPF_ALU64 | BPF_ADD | BPF_X:
407 case BPF_ALU64 | BPF_SUB | BPF_X:
408 case BPF_ALU64 | BPF_AND | BPF_X:
409 case BPF_ALU64 | BPF_OR | BPF_X:
410 case BPF_ALU64 | BPF_XOR | BPF_X:
411 switch (BPF_OP(insn->code)) {
412 case BPF_ADD: b2 = 0x01; break;
413 case BPF_SUB: b2 = 0x29; break;
414 case BPF_AND: b2 = 0x21; break;
415 case BPF_OR: b2 = 0x09; break;
416 case BPF_XOR: b2 = 0x31; break;
418 if (BPF_CLASS(insn->code) == BPF_ALU64)
419 EMIT1(add_2mod(0x48, dst_reg, src_reg));
420 else if (is_ereg(dst_reg) || is_ereg(src_reg))
421 EMIT1(add_2mod(0x40, dst_reg, src_reg));
422 EMIT2(b2, add_2reg(0xC0, dst_reg, src_reg));
426 case BPF_ALU64 | BPF_MOV | BPF_X:
427 EMIT_mov(dst_reg, src_reg);
431 case BPF_ALU | BPF_MOV | BPF_X:
432 if (is_ereg(dst_reg) || is_ereg(src_reg))
433 EMIT1(add_2mod(0x40, dst_reg, src_reg));
434 EMIT2(0x89, add_2reg(0xC0, dst_reg, src_reg));
438 case BPF_ALU | BPF_NEG:
439 case BPF_ALU64 | BPF_NEG:
440 if (BPF_CLASS(insn->code) == BPF_ALU64)
441 EMIT1(add_1mod(0x48, dst_reg));
442 else if (is_ereg(dst_reg))
443 EMIT1(add_1mod(0x40, dst_reg));
444 EMIT2(0xF7, add_1reg(0xD8, dst_reg));
447 case BPF_ALU | BPF_ADD | BPF_K:
448 case BPF_ALU | BPF_SUB | BPF_K:
449 case BPF_ALU | BPF_AND | BPF_K:
450 case BPF_ALU | BPF_OR | BPF_K:
451 case BPF_ALU | BPF_XOR | BPF_K:
452 case BPF_ALU64 | BPF_ADD | BPF_K:
453 case BPF_ALU64 | BPF_SUB | BPF_K:
454 case BPF_ALU64 | BPF_AND | BPF_K:
455 case BPF_ALU64 | BPF_OR | BPF_K:
456 case BPF_ALU64 | BPF_XOR | BPF_K:
457 if (BPF_CLASS(insn->code) == BPF_ALU64)
458 EMIT1(add_1mod(0x48, dst_reg));
459 else if (is_ereg(dst_reg))
460 EMIT1(add_1mod(0x40, dst_reg));
462 switch (BPF_OP(insn->code)) {
463 case BPF_ADD: b3 = 0xC0; break;
464 case BPF_SUB: b3 = 0xE8; break;
465 case BPF_AND: b3 = 0xE0; break;
466 case BPF_OR: b3 = 0xC8; break;
467 case BPF_XOR: b3 = 0xF0; break;
471 EMIT3(0x83, add_1reg(b3, dst_reg), imm32);
473 EMIT2_off32(0x81, add_1reg(b3, dst_reg), imm32);
476 case BPF_ALU64 | BPF_MOV | BPF_K:
477 /* optimization: if imm32 is positive,
478 * use 'mov eax, imm32' (which zero-extends imm32)
482 /* 'mov rax, imm32' sign extends imm32 */
483 b1 = add_1mod(0x48, dst_reg);
486 EMIT3_off32(b1, b2, add_1reg(b3, dst_reg), imm32);
490 case BPF_ALU | BPF_MOV | BPF_K:
491 /* optimization: if imm32 is zero, use 'xor <dst>,<dst>'
495 if (is_ereg(dst_reg))
496 EMIT1(add_2mod(0x40, dst_reg, dst_reg));
499 EMIT2(b2, add_2reg(b3, dst_reg, dst_reg));
503 /* mov %eax, imm32 */
504 if (is_ereg(dst_reg))
505 EMIT1(add_1mod(0x40, dst_reg));
506 EMIT1_off32(add_1reg(0xB8, dst_reg), imm32);
509 case BPF_LD | BPF_IMM | BPF_DW:
510 /* optimization: if imm64 is zero, use 'xor <dst>,<dst>'
513 if (insn[0].imm == 0 && insn[1].imm == 0) {
514 b1 = add_2mod(0x48, dst_reg, dst_reg);
517 EMIT3(b1, b2, add_2reg(b3, dst_reg, dst_reg));
524 /* movabsq %rax, imm64 */
525 EMIT2(add_1mod(0x48, dst_reg), add_1reg(0xB8, dst_reg));
526 EMIT(insn[0].imm, 4);
527 EMIT(insn[1].imm, 4);
533 /* dst %= src, dst /= src, dst %= imm32, dst /= imm32 */
534 case BPF_ALU | BPF_MOD | BPF_X:
535 case BPF_ALU | BPF_DIV | BPF_X:
536 case BPF_ALU | BPF_MOD | BPF_K:
537 case BPF_ALU | BPF_DIV | BPF_K:
538 case BPF_ALU64 | BPF_MOD | BPF_X:
539 case BPF_ALU64 | BPF_DIV | BPF_X:
540 case BPF_ALU64 | BPF_MOD | BPF_K:
541 case BPF_ALU64 | BPF_DIV | BPF_K:
542 EMIT1(0x50); /* push rax */
543 EMIT1(0x52); /* push rdx */
545 if (BPF_SRC(insn->code) == BPF_X)
546 /* mov r11, src_reg */
547 EMIT_mov(AUX_REG, src_reg);
550 EMIT3_off32(0x49, 0xC7, 0xC3, imm32);
552 /* mov rax, dst_reg */
553 EMIT_mov(BPF_REG_0, dst_reg);
556 * equivalent to 'xor rdx, rdx', but one byte less
560 if (BPF_SRC(insn->code) == BPF_X) {
561 /* if (src_reg == 0) return 0 */
564 EMIT4(0x49, 0x83, 0xFB, 0x00);
566 /* jne .+9 (skip over pop, pop, xor and jmp) */
567 EMIT2(X86_JNE, 1 + 1 + 2 + 5);
568 EMIT1(0x5A); /* pop rdx */
569 EMIT1(0x58); /* pop rax */
570 EMIT2(0x31, 0xc0); /* xor eax, eax */
573 * addrs[i] - 11, because there are 11 bytes
574 * after this insn: div, mov, pop, pop, mov
576 jmp_offset = ctx->cleanup_addr - (addrs[i] - 11);
577 EMIT1_off32(0xE9, jmp_offset);
580 if (BPF_CLASS(insn->code) == BPF_ALU64)
582 EMIT3(0x49, 0xF7, 0xF3);
585 EMIT3(0x41, 0xF7, 0xF3);
587 if (BPF_OP(insn->code) == BPF_MOD)
589 EMIT3(0x49, 0x89, 0xD3);
592 EMIT3(0x49, 0x89, 0xC3);
594 EMIT1(0x5A); /* pop rdx */
595 EMIT1(0x58); /* pop rax */
597 /* mov dst_reg, r11 */
598 EMIT_mov(dst_reg, AUX_REG);
601 case BPF_ALU | BPF_MUL | BPF_K:
602 case BPF_ALU | BPF_MUL | BPF_X:
603 case BPF_ALU64 | BPF_MUL | BPF_K:
604 case BPF_ALU64 | BPF_MUL | BPF_X:
605 EMIT1(0x50); /* push rax */
606 EMIT1(0x52); /* push rdx */
608 /* mov r11, dst_reg */
609 EMIT_mov(AUX_REG, dst_reg);
611 if (BPF_SRC(insn->code) == BPF_X)
612 /* mov rax, src_reg */
613 EMIT_mov(BPF_REG_0, src_reg);
616 EMIT3_off32(0x48, 0xC7, 0xC0, imm32);
618 if (BPF_CLASS(insn->code) == BPF_ALU64)
619 EMIT1(add_1mod(0x48, AUX_REG));
620 else if (is_ereg(AUX_REG))
621 EMIT1(add_1mod(0x40, AUX_REG));
623 EMIT2(0xF7, add_1reg(0xE0, AUX_REG));
626 EMIT_mov(AUX_REG, BPF_REG_0);
628 EMIT1(0x5A); /* pop rdx */
629 EMIT1(0x58); /* pop rax */
631 /* mov dst_reg, r11 */
632 EMIT_mov(dst_reg, AUX_REG);
636 case BPF_ALU | BPF_LSH | BPF_K:
637 case BPF_ALU | BPF_RSH | BPF_K:
638 case BPF_ALU | BPF_ARSH | BPF_K:
639 case BPF_ALU64 | BPF_LSH | BPF_K:
640 case BPF_ALU64 | BPF_RSH | BPF_K:
641 case BPF_ALU64 | BPF_ARSH | BPF_K:
642 if (BPF_CLASS(insn->code) == BPF_ALU64)
643 EMIT1(add_1mod(0x48, dst_reg));
644 else if (is_ereg(dst_reg))
645 EMIT1(add_1mod(0x40, dst_reg));
647 switch (BPF_OP(insn->code)) {
648 case BPF_LSH: b3 = 0xE0; break;
649 case BPF_RSH: b3 = 0xE8; break;
650 case BPF_ARSH: b3 = 0xF8; break;
652 EMIT3(0xC1, add_1reg(b3, dst_reg), imm32);
655 case BPF_ALU | BPF_LSH | BPF_X:
656 case BPF_ALU | BPF_RSH | BPF_X:
657 case BPF_ALU | BPF_ARSH | BPF_X:
658 case BPF_ALU64 | BPF_LSH | BPF_X:
659 case BPF_ALU64 | BPF_RSH | BPF_X:
660 case BPF_ALU64 | BPF_ARSH | BPF_X:
662 /* check for bad case when dst_reg == rcx */
663 if (dst_reg == BPF_REG_4) {
664 /* mov r11, dst_reg */
665 EMIT_mov(AUX_REG, dst_reg);
669 if (src_reg != BPF_REG_4) { /* common case */
670 EMIT1(0x51); /* push rcx */
672 /* mov rcx, src_reg */
673 EMIT_mov(BPF_REG_4, src_reg);
676 /* shl %rax, %cl | shr %rax, %cl | sar %rax, %cl */
677 if (BPF_CLASS(insn->code) == BPF_ALU64)
678 EMIT1(add_1mod(0x48, dst_reg));
679 else if (is_ereg(dst_reg))
680 EMIT1(add_1mod(0x40, dst_reg));
682 switch (BPF_OP(insn->code)) {
683 case BPF_LSH: b3 = 0xE0; break;
684 case BPF_RSH: b3 = 0xE8; break;
685 case BPF_ARSH: b3 = 0xF8; break;
687 EMIT2(0xD3, add_1reg(b3, dst_reg));
689 if (src_reg != BPF_REG_4)
690 EMIT1(0x59); /* pop rcx */
692 if (insn->dst_reg == BPF_REG_4)
693 /* mov dst_reg, r11 */
694 EMIT_mov(insn->dst_reg, AUX_REG);
697 case BPF_ALU | BPF_END | BPF_FROM_BE:
700 /* emit 'ror %ax, 8' to swap lower 2 bytes */
702 if (is_ereg(dst_reg))
704 EMIT3(0xC1, add_1reg(0xC8, dst_reg), 8);
706 /* emit 'movzwl eax, ax' */
707 if (is_ereg(dst_reg))
708 EMIT3(0x45, 0x0F, 0xB7);
711 EMIT1(add_2reg(0xC0, dst_reg, dst_reg));
714 /* emit 'bswap eax' to swap lower 4 bytes */
715 if (is_ereg(dst_reg))
719 EMIT1(add_1reg(0xC8, dst_reg));
722 /* emit 'bswap rax' to swap 8 bytes */
723 EMIT3(add_1mod(0x48, dst_reg), 0x0F,
724 add_1reg(0xC8, dst_reg));
729 case BPF_ALU | BPF_END | BPF_FROM_LE:
732 /* emit 'movzwl eax, ax' to zero extend 16-bit
735 if (is_ereg(dst_reg))
736 EMIT3(0x45, 0x0F, 0xB7);
739 EMIT1(add_2reg(0xC0, dst_reg, dst_reg));
742 /* emit 'mov eax, eax' to clear upper 32-bits */
743 if (is_ereg(dst_reg))
745 EMIT2(0x89, add_2reg(0xC0, dst_reg, dst_reg));
753 /* ST: *(u8*)(dst_reg + off) = imm */
754 case BPF_ST | BPF_MEM | BPF_B:
755 if (is_ereg(dst_reg))
760 case BPF_ST | BPF_MEM | BPF_H:
761 if (is_ereg(dst_reg))
762 EMIT3(0x66, 0x41, 0xC7);
766 case BPF_ST | BPF_MEM | BPF_W:
767 if (is_ereg(dst_reg))
772 case BPF_ST | BPF_MEM | BPF_DW:
773 EMIT2(add_1mod(0x48, dst_reg), 0xC7);
775 st: if (is_imm8(insn->off))
776 EMIT2(add_1reg(0x40, dst_reg), insn->off);
778 EMIT1_off32(add_1reg(0x80, dst_reg), insn->off);
780 EMIT(imm32, bpf_size_to_x86_bytes(BPF_SIZE(insn->code)));
783 /* STX: *(u8*)(dst_reg + off) = src_reg */
784 case BPF_STX | BPF_MEM | BPF_B:
785 /* emit 'mov byte ptr [rax + off], al' */
786 if (is_ereg(dst_reg) || is_ereg_8l(src_reg))
787 /* Add extra byte for eregs or SIL,DIL,BPL in src_reg */
788 EMIT2(add_2mod(0x40, dst_reg, src_reg), 0x88);
792 case BPF_STX | BPF_MEM | BPF_H:
793 if (is_ereg(dst_reg) || is_ereg(src_reg))
794 EMIT3(0x66, add_2mod(0x40, dst_reg, src_reg), 0x89);
798 case BPF_STX | BPF_MEM | BPF_W:
799 if (is_ereg(dst_reg) || is_ereg(src_reg))
800 EMIT2(add_2mod(0x40, dst_reg, src_reg), 0x89);
804 case BPF_STX | BPF_MEM | BPF_DW:
805 EMIT2(add_2mod(0x48, dst_reg, src_reg), 0x89);
806 stx: if (is_imm8(insn->off))
807 EMIT2(add_2reg(0x40, dst_reg, src_reg), insn->off);
809 EMIT1_off32(add_2reg(0x80, dst_reg, src_reg),
813 /* LDX: dst_reg = *(u8*)(src_reg + off) */
814 case BPF_LDX | BPF_MEM | BPF_B:
815 /* emit 'movzx rax, byte ptr [rax + off]' */
816 EMIT3(add_2mod(0x48, src_reg, dst_reg), 0x0F, 0xB6);
818 case BPF_LDX | BPF_MEM | BPF_H:
819 /* emit 'movzx rax, word ptr [rax + off]' */
820 EMIT3(add_2mod(0x48, src_reg, dst_reg), 0x0F, 0xB7);
822 case BPF_LDX | BPF_MEM | BPF_W:
823 /* emit 'mov eax, dword ptr [rax+0x14]' */
824 if (is_ereg(dst_reg) || is_ereg(src_reg))
825 EMIT2(add_2mod(0x40, src_reg, dst_reg), 0x8B);
829 case BPF_LDX | BPF_MEM | BPF_DW:
830 /* emit 'mov rax, qword ptr [rax+0x14]' */
831 EMIT2(add_2mod(0x48, src_reg, dst_reg), 0x8B);
832 ldx: /* if insn->off == 0 we can save one extra byte, but
833 * special case of x86 r13 which always needs an offset
834 * is not worth the hassle
836 if (is_imm8(insn->off))
837 EMIT2(add_2reg(0x40, src_reg, dst_reg), insn->off);
839 EMIT1_off32(add_2reg(0x80, src_reg, dst_reg),
843 /* STX XADD: lock *(u32*)(dst_reg + off) += src_reg */
844 case BPF_STX | BPF_XADD | BPF_W:
845 /* emit 'lock add dword ptr [rax + off], eax' */
846 if (is_ereg(dst_reg) || is_ereg(src_reg))
847 EMIT3(0xF0, add_2mod(0x40, dst_reg, src_reg), 0x01);
851 case BPF_STX | BPF_XADD | BPF_DW:
852 EMIT3(0xF0, add_2mod(0x48, dst_reg, src_reg), 0x01);
853 xadd: if (is_imm8(insn->off))
854 EMIT2(add_2reg(0x40, dst_reg, src_reg), insn->off);
856 EMIT1_off32(add_2reg(0x80, dst_reg, src_reg),
861 case BPF_JMP | BPF_CALL:
862 func = (u8 *) __bpf_call_base + imm32;
863 jmp_offset = func - (image + addrs[i]);
865 reload_skb_data = bpf_helper_changes_pkt_data(func);
866 if (reload_skb_data) {
867 EMIT1(0x57); /* push %rdi */
868 jmp_offset += 22; /* pop, mov, sub, mov */
870 EMIT2(0x41, 0x52); /* push %r10 */
871 EMIT2(0x41, 0x51); /* push %r9 */
872 /* need to adjust jmp offset, since
873 * pop %r9, pop %r10 take 4 bytes after call insn
878 if (!imm32 || !is_simm32(jmp_offset)) {
879 pr_err("unsupported bpf func %d addr %p image %p\n",
883 EMIT1_off32(0xE8, jmp_offset);
885 if (reload_skb_data) {
886 EMIT1(0x5F); /* pop %rdi */
887 emit_load_skb_data_hlen(&prog);
889 EMIT2(0x41, 0x59); /* pop %r9 */
890 EMIT2(0x41, 0x5A); /* pop %r10 */
895 case BPF_JMP | BPF_TAIL_CALL:
896 emit_bpf_tail_call(&prog);
900 case BPF_JMP | BPF_JEQ | BPF_X:
901 case BPF_JMP | BPF_JNE | BPF_X:
902 case BPF_JMP | BPF_JGT | BPF_X:
903 case BPF_JMP | BPF_JLT | BPF_X:
904 case BPF_JMP | BPF_JGE | BPF_X:
905 case BPF_JMP | BPF_JLE | BPF_X:
906 case BPF_JMP | BPF_JSGT | BPF_X:
907 case BPF_JMP | BPF_JSLT | BPF_X:
908 case BPF_JMP | BPF_JSGE | BPF_X:
909 case BPF_JMP | BPF_JSLE | BPF_X:
910 /* cmp dst_reg, src_reg */
911 EMIT3(add_2mod(0x48, dst_reg, src_reg), 0x39,
912 add_2reg(0xC0, dst_reg, src_reg));
915 case BPF_JMP | BPF_JSET | BPF_X:
916 /* test dst_reg, src_reg */
917 EMIT3(add_2mod(0x48, dst_reg, src_reg), 0x85,
918 add_2reg(0xC0, dst_reg, src_reg));
921 case BPF_JMP | BPF_JSET | BPF_K:
922 /* test dst_reg, imm32 */
923 EMIT1(add_1mod(0x48, dst_reg));
924 EMIT2_off32(0xF7, add_1reg(0xC0, dst_reg), imm32);
927 case BPF_JMP | BPF_JEQ | BPF_K:
928 case BPF_JMP | BPF_JNE | BPF_K:
929 case BPF_JMP | BPF_JGT | BPF_K:
930 case BPF_JMP | BPF_JLT | BPF_K:
931 case BPF_JMP | BPF_JGE | BPF_K:
932 case BPF_JMP | BPF_JLE | BPF_K:
933 case BPF_JMP | BPF_JSGT | BPF_K:
934 case BPF_JMP | BPF_JSLT | BPF_K:
935 case BPF_JMP | BPF_JSGE | BPF_K:
936 case BPF_JMP | BPF_JSLE | BPF_K:
937 /* cmp dst_reg, imm8/32 */
938 EMIT1(add_1mod(0x48, dst_reg));
941 EMIT3(0x83, add_1reg(0xF8, dst_reg), imm32);
943 EMIT2_off32(0x81, add_1reg(0xF8, dst_reg), imm32);
945 emit_cond_jmp: /* convert BPF opcode to x86 */
946 switch (BPF_OP(insn->code)) {
955 /* GT is unsigned '>', JA in x86 */
959 /* LT is unsigned '<', JB in x86 */
963 /* GE is unsigned '>=', JAE in x86 */
967 /* LE is unsigned '<=', JBE in x86 */
971 /* signed '>', GT in x86 */
975 /* signed '<', LT in x86 */
979 /* signed '>=', GE in x86 */
983 /* signed '<=', LE in x86 */
986 default: /* to silence gcc warning */
989 jmp_offset = addrs[i + insn->off] - addrs[i];
990 if (is_imm8(jmp_offset)) {
991 EMIT2(jmp_cond, jmp_offset);
992 } else if (is_simm32(jmp_offset)) {
993 EMIT2_off32(0x0F, jmp_cond + 0x10, jmp_offset);
995 pr_err("cond_jmp gen bug %llx\n", jmp_offset);
1001 case BPF_JMP | BPF_JA:
1002 jmp_offset = addrs[i + insn->off] - addrs[i];
1004 /* optimize out nop jumps */
1007 if (is_imm8(jmp_offset)) {
1008 EMIT2(0xEB, jmp_offset);
1009 } else if (is_simm32(jmp_offset)) {
1010 EMIT1_off32(0xE9, jmp_offset);
1012 pr_err("jmp gen bug %llx\n", jmp_offset);
1017 case BPF_LD | BPF_IND | BPF_W:
1018 func = sk_load_word;
1020 case BPF_LD | BPF_ABS | BPF_W:
1021 func = CHOOSE_LOAD_FUNC(imm32, sk_load_word);
1023 ctx->seen_ld_abs = seen_ld_abs = true;
1024 jmp_offset = func - (image + addrs[i]);
1025 if (!func || !is_simm32(jmp_offset)) {
1026 pr_err("unsupported bpf func %d addr %p image %p\n",
1027 imm32, func, image);
1030 if (BPF_MODE(insn->code) == BPF_ABS) {
1031 /* mov %esi, imm32 */
1032 EMIT1_off32(0xBE, imm32);
1034 /* mov %rsi, src_reg */
1035 EMIT_mov(BPF_REG_2, src_reg);
1038 /* add %esi, imm8 */
1039 EMIT3(0x83, 0xC6, imm32);
1041 /* add %esi, imm32 */
1042 EMIT2_off32(0x81, 0xC6, imm32);
1045 /* skb pointer is in R6 (%rbx), it will be copied into
1046 * %rdi if skb_copy_bits() call is necessary.
1047 * sk_load_* helpers also use %r10 and %r9d.
1051 /* r10 = skb->data, mov %r10, off32(%rbx) */
1052 EMIT3_off32(0x4c, 0x8b, 0x93,
1053 offsetof(struct sk_buff, data));
1054 EMIT1_off32(0xE8, jmp_offset); /* call */
1057 case BPF_LD | BPF_IND | BPF_H:
1058 func = sk_load_half;
1060 case BPF_LD | BPF_ABS | BPF_H:
1061 func = CHOOSE_LOAD_FUNC(imm32, sk_load_half);
1063 case BPF_LD | BPF_IND | BPF_B:
1064 func = sk_load_byte;
1066 case BPF_LD | BPF_ABS | BPF_B:
1067 func = CHOOSE_LOAD_FUNC(imm32, sk_load_byte);
1070 case BPF_JMP | BPF_EXIT:
1072 jmp_offset = ctx->cleanup_addr - addrs[i];
1076 /* update cleanup_addr */
1077 ctx->cleanup_addr = proglen;
1078 /* mov rbx, qword ptr [rbp+0] */
1079 EMIT4(0x48, 0x8B, 0x5D, 0);
1080 /* mov r13, qword ptr [rbp+8] */
1081 EMIT4(0x4C, 0x8B, 0x6D, 8);
1082 /* mov r14, qword ptr [rbp+16] */
1083 EMIT4(0x4C, 0x8B, 0x75, 16);
1084 /* mov r15, qword ptr [rbp+24] */
1085 EMIT4(0x4C, 0x8B, 0x7D, 24);
1087 /* add rbp, AUX_STACK_SPACE */
1088 EMIT4(0x48, 0x83, 0xC5, AUX_STACK_SPACE);
1089 EMIT1(0xC9); /* leave */
1090 EMIT1(0xC3); /* ret */
1094 /* By design x64 JIT should support all BPF instructions
1095 * This error will be seen if new instruction was added
1096 * to interpreter, but not to JIT
1097 * or if there is junk in bpf_prog
1099 pr_err("bpf_jit: unknown opcode %02x\n", insn->code);
1104 if (ilen > BPF_MAX_INSN_SIZE) {
1105 pr_err("bpf_jit: fatal insn size error\n");
1111 * When populating the image, assert that:
1113 * i) We do not write beyond the allocated space, and
1114 * ii) addrs[i] did not change from the prior run, in order
1115 * to validate assumptions made for computing branch
1118 if (unlikely(proglen + ilen > oldproglen ||
1119 proglen + ilen != addrs[i])) {
1120 pr_err("bpf_jit: fatal error\n");
1123 memcpy(image + proglen, temp, ilen);
1132 struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog)
1134 struct bpf_binary_header *header = NULL;
1135 struct bpf_prog *tmp, *orig_prog = prog;
1136 int proglen, oldproglen = 0;
1137 struct jit_context ctx = {};
1138 bool tmp_blinded = false;
1144 if (!bpf_jit_enable)
1147 tmp = bpf_jit_blind_constants(prog);
1148 /* If blinding was requested and we failed during blinding,
1149 * we must fall back to the interpreter.
1158 addrs = kmalloc(prog->len * sizeof(*addrs), GFP_KERNEL);
1164 /* Before first pass, make a rough estimation of addrs[]
1165 * each bpf instruction is translated to less than 64 bytes
1167 for (proglen = 0, i = 0; i < prog->len; i++) {
1171 ctx.cleanup_addr = proglen;
1173 /* JITed image shrinks with every pass and the loop iterates
1174 * until the image stops shrinking. Very large bpf programs
1175 * may converge on the last pass. In such case do one more
1176 * pass to emit the final image
1178 for (pass = 0; pass < 20 || image; pass++) {
1179 proglen = do_jit(prog, addrs, image, oldproglen, &ctx);
1184 bpf_jit_binary_free(header);
1189 if (proglen != oldproglen) {
1190 pr_err("bpf_jit: proglen=%d != oldproglen=%d\n",
1191 proglen, oldproglen);
1196 if (proglen == oldproglen) {
1197 header = bpf_jit_binary_alloc(proglen, &image,
1204 oldproglen = proglen;
1208 if (bpf_jit_enable > 1)
1209 bpf_jit_dump(prog->len, proglen, pass + 1, image);
1212 bpf_flush_icache(header, image + proglen);
1213 bpf_jit_binary_lock_ro(header);
1214 prog->bpf_func = (void *)image;
1216 prog->jited_len = proglen;
1225 bpf_jit_prog_release_other(prog, prog == orig_prog ?