]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - arch/arm64/net/bpf_jit_comp.c
d68abde52740d7b55f89dea8daf84f3109b0e17c
[mirror_ubuntu-bionic-kernel.git] / arch / arm64 / net / bpf_jit_comp.c
1 /*
2 * BPF JIT compiler for ARM64
3 *
4 * Copyright (C) 2014-2016 Zi Shen Lim <zlim.lnx@gmail.com>
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 as
8 * published by the Free Software Foundation.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
17 */
18
19 #define pr_fmt(fmt) "bpf_jit: " fmt
20
21 #include <linux/bpf.h>
22 #include <linux/filter.h>
23 #include <linux/printk.h>
24 #include <linux/skbuff.h>
25 #include <linux/slab.h>
26
27 #include <asm/byteorder.h>
28 #include <asm/cacheflush.h>
29 #include <asm/debug-monitors.h>
30
31 #include "bpf_jit.h"
32
33 int bpf_jit_enable __read_mostly;
34
35 #define TMP_REG_1 (MAX_BPF_JIT_REG + 0)
36 #define TMP_REG_2 (MAX_BPF_JIT_REG + 1)
37 #define TCALL_CNT (MAX_BPF_JIT_REG + 2)
38
39 /* Map BPF registers to A64 registers */
40 static const int bpf2a64[] = {
41 /* return value from in-kernel function, and exit value from eBPF */
42 [BPF_REG_0] = A64_R(7),
43 /* arguments from eBPF program to in-kernel function */
44 [BPF_REG_1] = A64_R(0),
45 [BPF_REG_2] = A64_R(1),
46 [BPF_REG_3] = A64_R(2),
47 [BPF_REG_4] = A64_R(3),
48 [BPF_REG_5] = A64_R(4),
49 /* callee saved registers that in-kernel function will preserve */
50 [BPF_REG_6] = A64_R(19),
51 [BPF_REG_7] = A64_R(20),
52 [BPF_REG_8] = A64_R(21),
53 [BPF_REG_9] = A64_R(22),
54 /* read-only frame pointer to access stack */
55 [BPF_REG_FP] = A64_R(25),
56 /* temporary registers for internal BPF JIT */
57 [TMP_REG_1] = A64_R(10),
58 [TMP_REG_2] = A64_R(11),
59 /* tail_call_cnt */
60 [TCALL_CNT] = A64_R(26),
61 /* temporary register for blinding constants */
62 [BPF_REG_AX] = A64_R(9),
63 };
64
65 struct jit_ctx {
66 const struct bpf_prog *prog;
67 int idx;
68 int epilogue_offset;
69 int *offset;
70 u32 *image;
71 };
72
73 static inline void emit(const u32 insn, struct jit_ctx *ctx)
74 {
75 if (ctx->image != NULL)
76 ctx->image[ctx->idx] = cpu_to_le32(insn);
77
78 ctx->idx++;
79 }
80
81 static inline void emit_a64_mov_i64(const int reg, const u64 val,
82 struct jit_ctx *ctx)
83 {
84 u64 tmp = val;
85 int shift = 0;
86
87 emit(A64_MOVZ(1, reg, tmp & 0xffff, shift), ctx);
88 tmp >>= 16;
89 shift += 16;
90 while (tmp) {
91 if (tmp & 0xffff)
92 emit(A64_MOVK(1, reg, tmp & 0xffff, shift), ctx);
93 tmp >>= 16;
94 shift += 16;
95 }
96 }
97
98 static inline void emit_a64_mov_i(const int is64, const int reg,
99 const s32 val, struct jit_ctx *ctx)
100 {
101 u16 hi = val >> 16;
102 u16 lo = val & 0xffff;
103
104 if (hi & 0x8000) {
105 if (hi == 0xffff) {
106 emit(A64_MOVN(is64, reg, (u16)~lo, 0), ctx);
107 } else {
108 emit(A64_MOVN(is64, reg, (u16)~hi, 16), ctx);
109 emit(A64_MOVK(is64, reg, lo, 0), ctx);
110 }
111 } else {
112 emit(A64_MOVZ(is64, reg, lo, 0), ctx);
113 if (hi)
114 emit(A64_MOVK(is64, reg, hi, 16), ctx);
115 }
116 }
117
118 static inline int bpf2a64_offset(int bpf_to, int bpf_from,
119 const struct jit_ctx *ctx)
120 {
121 int to = ctx->offset[bpf_to];
122 /* -1 to account for the Branch instruction */
123 int from = ctx->offset[bpf_from] - 1;
124
125 return to - from;
126 }
127
128 static void jit_fill_hole(void *area, unsigned int size)
129 {
130 u32 *ptr;
131 /* We are guaranteed to have aligned memory. */
132 for (ptr = area; size >= sizeof(u32); size -= sizeof(u32))
133 *ptr++ = cpu_to_le32(AARCH64_BREAK_FAULT);
134 }
135
136 static inline int epilogue_offset(const struct jit_ctx *ctx)
137 {
138 int to = ctx->epilogue_offset;
139 int from = ctx->idx;
140
141 return to - from;
142 }
143
144 /* Stack must be multiples of 16B */
145 #define STACK_ALIGN(sz) (((sz) + 15) & ~15)
146
147 #define _STACK_SIZE \
148 (MAX_BPF_STACK \
149 + 4 /* extra for skb_copy_bits buffer */)
150
151 #define STACK_SIZE STACK_ALIGN(_STACK_SIZE)
152
153 #define PROLOGUE_OFFSET 8
154
155 static int build_prologue(struct jit_ctx *ctx)
156 {
157 const u8 r6 = bpf2a64[BPF_REG_6];
158 const u8 r7 = bpf2a64[BPF_REG_7];
159 const u8 r8 = bpf2a64[BPF_REG_8];
160 const u8 r9 = bpf2a64[BPF_REG_9];
161 const u8 fp = bpf2a64[BPF_REG_FP];
162 const u8 tcc = bpf2a64[TCALL_CNT];
163 const int idx0 = ctx->idx;
164 int cur_offset;
165
166 /*
167 * BPF prog stack layout
168 *
169 * high
170 * original A64_SP => 0:+-----+ BPF prologue
171 * |FP/LR|
172 * current A64_FP => -16:+-----+
173 * | ... | callee saved registers
174 * BPF fp register => -64:+-----+ <= (BPF_FP)
175 * | |
176 * | ... | BPF prog stack
177 * | |
178 * +-----+ <= (BPF_FP - MAX_BPF_STACK)
179 * |RSVD | JIT scratchpad
180 * current A64_SP => +-----+ <= (BPF_FP - STACK_SIZE)
181 * | |
182 * | ... | Function call stack
183 * | |
184 * +-----+
185 * low
186 *
187 */
188
189 /* Save FP and LR registers to stay align with ARM64 AAPCS */
190 emit(A64_PUSH(A64_FP, A64_LR, A64_SP), ctx);
191 emit(A64_MOV(1, A64_FP, A64_SP), ctx);
192
193 /* Save callee-saved registers */
194 emit(A64_PUSH(r6, r7, A64_SP), ctx);
195 emit(A64_PUSH(r8, r9, A64_SP), ctx);
196 emit(A64_PUSH(fp, tcc, A64_SP), ctx);
197
198 /* Set up BPF prog stack base register */
199 emit(A64_MOV(1, fp, A64_SP), ctx);
200
201 /* Initialize tail_call_cnt */
202 emit(A64_MOVZ(1, tcc, 0, 0), ctx);
203
204 /* Set up function call stack */
205 emit(A64_SUB_I(1, A64_SP, A64_SP, STACK_SIZE), ctx);
206
207 cur_offset = ctx->idx - idx0;
208 if (cur_offset != PROLOGUE_OFFSET) {
209 pr_err_once("PROLOGUE_OFFSET = %d, expected %d!\n",
210 cur_offset, PROLOGUE_OFFSET);
211 return -1;
212 }
213 return 0;
214 }
215
216 static int out_offset = -1; /* initialized on the first pass of build_body() */
217 static int emit_bpf_tail_call(struct jit_ctx *ctx)
218 {
219 /* bpf_tail_call(void *prog_ctx, struct bpf_array *array, u64 index) */
220 const u8 r2 = bpf2a64[BPF_REG_2];
221 const u8 r3 = bpf2a64[BPF_REG_3];
222
223 const u8 tmp = bpf2a64[TMP_REG_1];
224 const u8 prg = bpf2a64[TMP_REG_2];
225 const u8 tcc = bpf2a64[TCALL_CNT];
226 const int idx0 = ctx->idx;
227 #define cur_offset (ctx->idx - idx0)
228 #define jmp_offset (out_offset - (cur_offset))
229 size_t off;
230
231 /* if (index >= array->map.max_entries)
232 * goto out;
233 */
234 off = offsetof(struct bpf_array, map.max_entries);
235 emit_a64_mov_i64(tmp, off, ctx);
236 emit(A64_LDR32(tmp, r2, tmp), ctx);
237 emit(A64_CMP(0, r3, tmp), ctx);
238 emit(A64_B_(A64_COND_GE, jmp_offset), ctx);
239
240 /* if (tail_call_cnt > MAX_TAIL_CALL_CNT)
241 * goto out;
242 * tail_call_cnt++;
243 */
244 emit_a64_mov_i64(tmp, MAX_TAIL_CALL_CNT, ctx);
245 emit(A64_CMP(1, tcc, tmp), ctx);
246 emit(A64_B_(A64_COND_GT, jmp_offset), ctx);
247 emit(A64_ADD_I(1, tcc, tcc, 1), ctx);
248
249 /* prog = array->ptrs[index];
250 * if (prog == NULL)
251 * goto out;
252 */
253 off = offsetof(struct bpf_array, ptrs);
254 emit_a64_mov_i64(tmp, off, ctx);
255 emit(A64_LDR64(tmp, r2, tmp), ctx);
256 emit(A64_LDR64(prg, tmp, r3), ctx);
257 emit(A64_CBZ(1, prg, jmp_offset), ctx);
258
259 /* goto *(prog->bpf_func + prologue_size); */
260 off = offsetof(struct bpf_prog, bpf_func);
261 emit_a64_mov_i64(tmp, off, ctx);
262 emit(A64_LDR64(tmp, prg, tmp), ctx);
263 emit(A64_ADD_I(1, tmp, tmp, sizeof(u32) * PROLOGUE_OFFSET), ctx);
264 emit(A64_BR(tmp), ctx);
265
266 /* out: */
267 if (out_offset == -1)
268 out_offset = cur_offset;
269 if (cur_offset != out_offset) {
270 pr_err_once("tail_call out_offset = %d, expected %d!\n",
271 cur_offset, out_offset);
272 return -1;
273 }
274 return 0;
275 #undef cur_offset
276 #undef jmp_offset
277 }
278
279 static void build_epilogue(struct jit_ctx *ctx)
280 {
281 const u8 r0 = bpf2a64[BPF_REG_0];
282 const u8 r6 = bpf2a64[BPF_REG_6];
283 const u8 r7 = bpf2a64[BPF_REG_7];
284 const u8 r8 = bpf2a64[BPF_REG_8];
285 const u8 r9 = bpf2a64[BPF_REG_9];
286 const u8 fp = bpf2a64[BPF_REG_FP];
287
288 /* We're done with BPF stack */
289 emit(A64_ADD_I(1, A64_SP, A64_SP, STACK_SIZE), ctx);
290
291 /* Restore fs (x25) and x26 */
292 emit(A64_POP(fp, A64_R(26), A64_SP), ctx);
293
294 /* Restore callee-saved register */
295 emit(A64_POP(r8, r9, A64_SP), ctx);
296 emit(A64_POP(r6, r7, A64_SP), ctx);
297
298 /* Restore FP/LR registers */
299 emit(A64_POP(A64_FP, A64_LR, A64_SP), ctx);
300
301 /* Set return value */
302 emit(A64_MOV(1, A64_R(0), r0), ctx);
303
304 emit(A64_RET(A64_LR), ctx);
305 }
306
307 /* JITs an eBPF instruction.
308 * Returns:
309 * 0 - successfully JITed an 8-byte eBPF instruction.
310 * >0 - successfully JITed a 16-byte eBPF instruction.
311 * <0 - failed to JIT.
312 */
313 static int build_insn(const struct bpf_insn *insn, struct jit_ctx *ctx)
314 {
315 const u8 code = insn->code;
316 const u8 dst = bpf2a64[insn->dst_reg];
317 const u8 src = bpf2a64[insn->src_reg];
318 const u8 tmp = bpf2a64[TMP_REG_1];
319 const u8 tmp2 = bpf2a64[TMP_REG_2];
320 const s16 off = insn->off;
321 const s32 imm = insn->imm;
322 const int i = insn - ctx->prog->insnsi;
323 const bool is64 = BPF_CLASS(code) == BPF_ALU64;
324 const bool isdw = BPF_SIZE(code) == BPF_DW;
325 u8 jmp_cond;
326 s32 jmp_offset;
327
328 #define check_imm(bits, imm) do { \
329 if ((((imm) > 0) && ((imm) >> (bits))) || \
330 (((imm) < 0) && (~(imm) >> (bits)))) { \
331 pr_info("[%2d] imm=%d(0x%x) out of range\n", \
332 i, imm, imm); \
333 return -EINVAL; \
334 } \
335 } while (0)
336 #define check_imm19(imm) check_imm(19, imm)
337 #define check_imm26(imm) check_imm(26, imm)
338
339 switch (code) {
340 /* dst = src */
341 case BPF_ALU | BPF_MOV | BPF_X:
342 case BPF_ALU64 | BPF_MOV | BPF_X:
343 emit(A64_MOV(is64, dst, src), ctx);
344 break;
345 /* dst = dst OP src */
346 case BPF_ALU | BPF_ADD | BPF_X:
347 case BPF_ALU64 | BPF_ADD | BPF_X:
348 emit(A64_ADD(is64, dst, dst, src), ctx);
349 break;
350 case BPF_ALU | BPF_SUB | BPF_X:
351 case BPF_ALU64 | BPF_SUB | BPF_X:
352 emit(A64_SUB(is64, dst, dst, src), ctx);
353 break;
354 case BPF_ALU | BPF_AND | BPF_X:
355 case BPF_ALU64 | BPF_AND | BPF_X:
356 emit(A64_AND(is64, dst, dst, src), ctx);
357 break;
358 case BPF_ALU | BPF_OR | BPF_X:
359 case BPF_ALU64 | BPF_OR | BPF_X:
360 emit(A64_ORR(is64, dst, dst, src), ctx);
361 break;
362 case BPF_ALU | BPF_XOR | BPF_X:
363 case BPF_ALU64 | BPF_XOR | BPF_X:
364 emit(A64_EOR(is64, dst, dst, src), ctx);
365 break;
366 case BPF_ALU | BPF_MUL | BPF_X:
367 case BPF_ALU64 | BPF_MUL | BPF_X:
368 emit(A64_MUL(is64, dst, dst, src), ctx);
369 break;
370 case BPF_ALU | BPF_DIV | BPF_X:
371 case BPF_ALU64 | BPF_DIV | BPF_X:
372 case BPF_ALU | BPF_MOD | BPF_X:
373 case BPF_ALU64 | BPF_MOD | BPF_X:
374 {
375 const u8 r0 = bpf2a64[BPF_REG_0];
376
377 /* if (src == 0) return 0 */
378 jmp_offset = 3; /* skip ahead to else path */
379 check_imm19(jmp_offset);
380 emit(A64_CBNZ(is64, src, jmp_offset), ctx);
381 emit(A64_MOVZ(1, r0, 0, 0), ctx);
382 jmp_offset = epilogue_offset(ctx);
383 check_imm26(jmp_offset);
384 emit(A64_B(jmp_offset), ctx);
385 /* else */
386 switch (BPF_OP(code)) {
387 case BPF_DIV:
388 emit(A64_UDIV(is64, dst, dst, src), ctx);
389 break;
390 case BPF_MOD:
391 emit(A64_UDIV(is64, tmp, dst, src), ctx);
392 emit(A64_MUL(is64, tmp, tmp, src), ctx);
393 emit(A64_SUB(is64, dst, dst, tmp), ctx);
394 break;
395 }
396 break;
397 }
398 case BPF_ALU | BPF_LSH | BPF_X:
399 case BPF_ALU64 | BPF_LSH | BPF_X:
400 emit(A64_LSLV(is64, dst, dst, src), ctx);
401 break;
402 case BPF_ALU | BPF_RSH | BPF_X:
403 case BPF_ALU64 | BPF_RSH | BPF_X:
404 emit(A64_LSRV(is64, dst, dst, src), ctx);
405 break;
406 case BPF_ALU | BPF_ARSH | BPF_X:
407 case BPF_ALU64 | BPF_ARSH | BPF_X:
408 emit(A64_ASRV(is64, dst, dst, src), ctx);
409 break;
410 /* dst = -dst */
411 case BPF_ALU | BPF_NEG:
412 case BPF_ALU64 | BPF_NEG:
413 emit(A64_NEG(is64, dst, dst), ctx);
414 break;
415 /* dst = BSWAP##imm(dst) */
416 case BPF_ALU | BPF_END | BPF_FROM_LE:
417 case BPF_ALU | BPF_END | BPF_FROM_BE:
418 #ifdef CONFIG_CPU_BIG_ENDIAN
419 if (BPF_SRC(code) == BPF_FROM_BE)
420 goto emit_bswap_uxt;
421 #else /* !CONFIG_CPU_BIG_ENDIAN */
422 if (BPF_SRC(code) == BPF_FROM_LE)
423 goto emit_bswap_uxt;
424 #endif
425 switch (imm) {
426 case 16:
427 emit(A64_REV16(is64, dst, dst), ctx);
428 /* zero-extend 16 bits into 64 bits */
429 emit(A64_UXTH(is64, dst, dst), ctx);
430 break;
431 case 32:
432 emit(A64_REV32(is64, dst, dst), ctx);
433 /* upper 32 bits already cleared */
434 break;
435 case 64:
436 emit(A64_REV64(dst, dst), ctx);
437 break;
438 }
439 break;
440 emit_bswap_uxt:
441 switch (imm) {
442 case 16:
443 /* zero-extend 16 bits into 64 bits */
444 emit(A64_UXTH(is64, dst, dst), ctx);
445 break;
446 case 32:
447 /* zero-extend 32 bits into 64 bits */
448 emit(A64_UXTW(is64, dst, dst), ctx);
449 break;
450 case 64:
451 /* nop */
452 break;
453 }
454 break;
455 /* dst = imm */
456 case BPF_ALU | BPF_MOV | BPF_K:
457 case BPF_ALU64 | BPF_MOV | BPF_K:
458 emit_a64_mov_i(is64, dst, imm, ctx);
459 break;
460 /* dst = dst OP imm */
461 case BPF_ALU | BPF_ADD | BPF_K:
462 case BPF_ALU64 | BPF_ADD | BPF_K:
463 emit_a64_mov_i(is64, tmp, imm, ctx);
464 emit(A64_ADD(is64, dst, dst, tmp), ctx);
465 break;
466 case BPF_ALU | BPF_SUB | BPF_K:
467 case BPF_ALU64 | BPF_SUB | BPF_K:
468 emit_a64_mov_i(is64, tmp, imm, ctx);
469 emit(A64_SUB(is64, dst, dst, tmp), ctx);
470 break;
471 case BPF_ALU | BPF_AND | BPF_K:
472 case BPF_ALU64 | BPF_AND | BPF_K:
473 emit_a64_mov_i(is64, tmp, imm, ctx);
474 emit(A64_AND(is64, dst, dst, tmp), ctx);
475 break;
476 case BPF_ALU | BPF_OR | BPF_K:
477 case BPF_ALU64 | BPF_OR | BPF_K:
478 emit_a64_mov_i(is64, tmp, imm, ctx);
479 emit(A64_ORR(is64, dst, dst, tmp), ctx);
480 break;
481 case BPF_ALU | BPF_XOR | BPF_K:
482 case BPF_ALU64 | BPF_XOR | BPF_K:
483 emit_a64_mov_i(is64, tmp, imm, ctx);
484 emit(A64_EOR(is64, dst, dst, tmp), ctx);
485 break;
486 case BPF_ALU | BPF_MUL | BPF_K:
487 case BPF_ALU64 | BPF_MUL | BPF_K:
488 emit_a64_mov_i(is64, tmp, imm, ctx);
489 emit(A64_MUL(is64, dst, dst, tmp), ctx);
490 break;
491 case BPF_ALU | BPF_DIV | BPF_K:
492 case BPF_ALU64 | BPF_DIV | BPF_K:
493 emit_a64_mov_i(is64, tmp, imm, ctx);
494 emit(A64_UDIV(is64, dst, dst, tmp), ctx);
495 break;
496 case BPF_ALU | BPF_MOD | BPF_K:
497 case BPF_ALU64 | BPF_MOD | BPF_K:
498 emit_a64_mov_i(is64, tmp2, imm, ctx);
499 emit(A64_UDIV(is64, tmp, dst, tmp2), ctx);
500 emit(A64_MUL(is64, tmp, tmp, tmp2), ctx);
501 emit(A64_SUB(is64, dst, dst, tmp), ctx);
502 break;
503 case BPF_ALU | BPF_LSH | BPF_K:
504 case BPF_ALU64 | BPF_LSH | BPF_K:
505 emit(A64_LSL(is64, dst, dst, imm), ctx);
506 break;
507 case BPF_ALU | BPF_RSH | BPF_K:
508 case BPF_ALU64 | BPF_RSH | BPF_K:
509 emit(A64_LSR(is64, dst, dst, imm), ctx);
510 break;
511 case BPF_ALU | BPF_ARSH | BPF_K:
512 case BPF_ALU64 | BPF_ARSH | BPF_K:
513 emit(A64_ASR(is64, dst, dst, imm), ctx);
514 break;
515
516 /* JUMP off */
517 case BPF_JMP | BPF_JA:
518 jmp_offset = bpf2a64_offset(i + off, i, ctx);
519 check_imm26(jmp_offset);
520 emit(A64_B(jmp_offset), ctx);
521 break;
522 /* IF (dst COND src) JUMP off */
523 case BPF_JMP | BPF_JEQ | BPF_X:
524 case BPF_JMP | BPF_JGT | BPF_X:
525 case BPF_JMP | BPF_JGE | BPF_X:
526 case BPF_JMP | BPF_JNE | BPF_X:
527 case BPF_JMP | BPF_JSGT | BPF_X:
528 case BPF_JMP | BPF_JSGE | BPF_X:
529 emit(A64_CMP(1, dst, src), ctx);
530 emit_cond_jmp:
531 jmp_offset = bpf2a64_offset(i + off, i, ctx);
532 check_imm19(jmp_offset);
533 switch (BPF_OP(code)) {
534 case BPF_JEQ:
535 jmp_cond = A64_COND_EQ;
536 break;
537 case BPF_JGT:
538 jmp_cond = A64_COND_HI;
539 break;
540 case BPF_JGE:
541 jmp_cond = A64_COND_CS;
542 break;
543 case BPF_JSET:
544 case BPF_JNE:
545 jmp_cond = A64_COND_NE;
546 break;
547 case BPF_JSGT:
548 jmp_cond = A64_COND_GT;
549 break;
550 case BPF_JSGE:
551 jmp_cond = A64_COND_GE;
552 break;
553 default:
554 return -EFAULT;
555 }
556 emit(A64_B_(jmp_cond, jmp_offset), ctx);
557 break;
558 case BPF_JMP | BPF_JSET | BPF_X:
559 emit(A64_TST(1, dst, src), ctx);
560 goto emit_cond_jmp;
561 /* IF (dst COND imm) JUMP off */
562 case BPF_JMP | BPF_JEQ | BPF_K:
563 case BPF_JMP | BPF_JGT | BPF_K:
564 case BPF_JMP | BPF_JGE | BPF_K:
565 case BPF_JMP | BPF_JNE | BPF_K:
566 case BPF_JMP | BPF_JSGT | BPF_K:
567 case BPF_JMP | BPF_JSGE | BPF_K:
568 emit_a64_mov_i(1, tmp, imm, ctx);
569 emit(A64_CMP(1, dst, tmp), ctx);
570 goto emit_cond_jmp;
571 case BPF_JMP | BPF_JSET | BPF_K:
572 emit_a64_mov_i(1, tmp, imm, ctx);
573 emit(A64_TST(1, dst, tmp), ctx);
574 goto emit_cond_jmp;
575 /* function call */
576 case BPF_JMP | BPF_CALL:
577 {
578 const u8 r0 = bpf2a64[BPF_REG_0];
579 const u64 func = (u64)__bpf_call_base + imm;
580
581 emit_a64_mov_i64(tmp, func, ctx);
582 emit(A64_BLR(tmp), ctx);
583 emit(A64_MOV(1, r0, A64_R(0)), ctx);
584 break;
585 }
586 /* tail call */
587 case BPF_JMP | BPF_CALL | BPF_X:
588 if (emit_bpf_tail_call(ctx))
589 return -EFAULT;
590 break;
591 /* function return */
592 case BPF_JMP | BPF_EXIT:
593 /* Optimization: when last instruction is EXIT,
594 simply fallthrough to epilogue. */
595 if (i == ctx->prog->len - 1)
596 break;
597 jmp_offset = epilogue_offset(ctx);
598 check_imm26(jmp_offset);
599 emit(A64_B(jmp_offset), ctx);
600 break;
601
602 /* dst = imm64 */
603 case BPF_LD | BPF_IMM | BPF_DW:
604 {
605 const struct bpf_insn insn1 = insn[1];
606 u64 imm64;
607
608 imm64 = (u64)insn1.imm << 32 | (u32)imm;
609 emit_a64_mov_i64(dst, imm64, ctx);
610
611 return 1;
612 }
613
614 /* LDX: dst = *(size *)(src + off) */
615 case BPF_LDX | BPF_MEM | BPF_W:
616 case BPF_LDX | BPF_MEM | BPF_H:
617 case BPF_LDX | BPF_MEM | BPF_B:
618 case BPF_LDX | BPF_MEM | BPF_DW:
619 emit_a64_mov_i(1, tmp, off, ctx);
620 switch (BPF_SIZE(code)) {
621 case BPF_W:
622 emit(A64_LDR32(dst, src, tmp), ctx);
623 break;
624 case BPF_H:
625 emit(A64_LDRH(dst, src, tmp), ctx);
626 break;
627 case BPF_B:
628 emit(A64_LDRB(dst, src, tmp), ctx);
629 break;
630 case BPF_DW:
631 emit(A64_LDR64(dst, src, tmp), ctx);
632 break;
633 }
634 break;
635
636 /* ST: *(size *)(dst + off) = imm */
637 case BPF_ST | BPF_MEM | BPF_W:
638 case BPF_ST | BPF_MEM | BPF_H:
639 case BPF_ST | BPF_MEM | BPF_B:
640 case BPF_ST | BPF_MEM | BPF_DW:
641 /* Load imm to a register then store it */
642 emit_a64_mov_i(1, tmp2, off, ctx);
643 emit_a64_mov_i(1, tmp, imm, ctx);
644 switch (BPF_SIZE(code)) {
645 case BPF_W:
646 emit(A64_STR32(tmp, dst, tmp2), ctx);
647 break;
648 case BPF_H:
649 emit(A64_STRH(tmp, dst, tmp2), ctx);
650 break;
651 case BPF_B:
652 emit(A64_STRB(tmp, dst, tmp2), ctx);
653 break;
654 case BPF_DW:
655 emit(A64_STR64(tmp, dst, tmp2), ctx);
656 break;
657 }
658 break;
659
660 /* STX: *(size *)(dst + off) = src */
661 case BPF_STX | BPF_MEM | BPF_W:
662 case BPF_STX | BPF_MEM | BPF_H:
663 case BPF_STX | BPF_MEM | BPF_B:
664 case BPF_STX | BPF_MEM | BPF_DW:
665 emit_a64_mov_i(1, tmp, off, ctx);
666 switch (BPF_SIZE(code)) {
667 case BPF_W:
668 emit(A64_STR32(src, dst, tmp), ctx);
669 break;
670 case BPF_H:
671 emit(A64_STRH(src, dst, tmp), ctx);
672 break;
673 case BPF_B:
674 emit(A64_STRB(src, dst, tmp), ctx);
675 break;
676 case BPF_DW:
677 emit(A64_STR64(src, dst, tmp), ctx);
678 break;
679 }
680 break;
681 /* STX XADD: lock *(u32 *)(dst + off) += src */
682 case BPF_STX | BPF_XADD | BPF_W:
683 /* STX XADD: lock *(u64 *)(dst + off) += src */
684 case BPF_STX | BPF_XADD | BPF_DW:
685 emit_a64_mov_i(1, tmp, off, ctx);
686 emit(A64_ADD(1, tmp, tmp, dst), ctx);
687 emit(A64_PRFM(tmp, PST, L1, STRM), ctx);
688 emit(A64_LDXR(isdw, tmp2, tmp), ctx);
689 emit(A64_ADD(isdw, tmp2, tmp2, src), ctx);
690 emit(A64_STXR(isdw, tmp2, tmp, tmp2), ctx);
691 jmp_offset = -3;
692 check_imm19(jmp_offset);
693 emit(A64_CBNZ(0, tmp2, jmp_offset), ctx);
694 break;
695
696 /* R0 = ntohx(*(size *)(((struct sk_buff *)R6)->data + imm)) */
697 case BPF_LD | BPF_ABS | BPF_W:
698 case BPF_LD | BPF_ABS | BPF_H:
699 case BPF_LD | BPF_ABS | BPF_B:
700 /* R0 = ntohx(*(size *)(((struct sk_buff *)R6)->data + src + imm)) */
701 case BPF_LD | BPF_IND | BPF_W:
702 case BPF_LD | BPF_IND | BPF_H:
703 case BPF_LD | BPF_IND | BPF_B:
704 {
705 const u8 r0 = bpf2a64[BPF_REG_0]; /* r0 = return value */
706 const u8 r6 = bpf2a64[BPF_REG_6]; /* r6 = pointer to sk_buff */
707 const u8 fp = bpf2a64[BPF_REG_FP];
708 const u8 r1 = bpf2a64[BPF_REG_1]; /* r1: struct sk_buff *skb */
709 const u8 r2 = bpf2a64[BPF_REG_2]; /* r2: int k */
710 const u8 r3 = bpf2a64[BPF_REG_3]; /* r3: unsigned int size */
711 const u8 r4 = bpf2a64[BPF_REG_4]; /* r4: void *buffer */
712 const u8 r5 = bpf2a64[BPF_REG_5]; /* r5: void *(*func)(...) */
713 int size;
714
715 emit(A64_MOV(1, r1, r6), ctx);
716 emit_a64_mov_i(0, r2, imm, ctx);
717 if (BPF_MODE(code) == BPF_IND)
718 emit(A64_ADD(0, r2, r2, src), ctx);
719 switch (BPF_SIZE(code)) {
720 case BPF_W:
721 size = 4;
722 break;
723 case BPF_H:
724 size = 2;
725 break;
726 case BPF_B:
727 size = 1;
728 break;
729 default:
730 return -EINVAL;
731 }
732 emit_a64_mov_i64(r3, size, ctx);
733 emit(A64_SUB_I(1, r4, fp, STACK_SIZE), ctx);
734 emit_a64_mov_i64(r5, (unsigned long)bpf_load_pointer, ctx);
735 emit(A64_BLR(r5), ctx);
736 emit(A64_MOV(1, r0, A64_R(0)), ctx);
737
738 jmp_offset = epilogue_offset(ctx);
739 check_imm19(jmp_offset);
740 emit(A64_CBZ(1, r0, jmp_offset), ctx);
741 emit(A64_MOV(1, r5, r0), ctx);
742 switch (BPF_SIZE(code)) {
743 case BPF_W:
744 emit(A64_LDR32(r0, r5, A64_ZR), ctx);
745 #ifndef CONFIG_CPU_BIG_ENDIAN
746 emit(A64_REV32(0, r0, r0), ctx);
747 #endif
748 break;
749 case BPF_H:
750 emit(A64_LDRH(r0, r5, A64_ZR), ctx);
751 #ifndef CONFIG_CPU_BIG_ENDIAN
752 emit(A64_REV16(0, r0, r0), ctx);
753 #endif
754 break;
755 case BPF_B:
756 emit(A64_LDRB(r0, r5, A64_ZR), ctx);
757 break;
758 }
759 break;
760 }
761 default:
762 pr_err_once("unknown opcode %02x\n", code);
763 return -EINVAL;
764 }
765
766 return 0;
767 }
768
769 static int build_body(struct jit_ctx *ctx)
770 {
771 const struct bpf_prog *prog = ctx->prog;
772 int i;
773
774 for (i = 0; i < prog->len; i++) {
775 const struct bpf_insn *insn = &prog->insnsi[i];
776 int ret;
777
778 ret = build_insn(insn, ctx);
779 if (ret > 0) {
780 i++;
781 if (ctx->image == NULL)
782 ctx->offset[i] = ctx->idx;
783 continue;
784 }
785 if (ctx->image == NULL)
786 ctx->offset[i] = ctx->idx;
787 if (ret)
788 return ret;
789 }
790
791 return 0;
792 }
793
794 static int validate_code(struct jit_ctx *ctx)
795 {
796 int i;
797
798 for (i = 0; i < ctx->idx; i++) {
799 u32 a64_insn = le32_to_cpu(ctx->image[i]);
800
801 if (a64_insn == AARCH64_BREAK_FAULT)
802 return -1;
803 }
804
805 return 0;
806 }
807
808 static inline void bpf_flush_icache(void *start, void *end)
809 {
810 flush_icache_range((unsigned long)start, (unsigned long)end);
811 }
812
813 struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog)
814 {
815 struct bpf_prog *tmp, *orig_prog = prog;
816 struct bpf_binary_header *header;
817 bool tmp_blinded = false;
818 struct jit_ctx ctx;
819 int image_size;
820 u8 *image_ptr;
821
822 if (!bpf_jit_enable)
823 return orig_prog;
824
825 tmp = bpf_jit_blind_constants(prog);
826 /* If blinding was requested and we failed during blinding,
827 * we must fall back to the interpreter.
828 */
829 if (IS_ERR(tmp))
830 return orig_prog;
831 if (tmp != prog) {
832 tmp_blinded = true;
833 prog = tmp;
834 }
835
836 memset(&ctx, 0, sizeof(ctx));
837 ctx.prog = prog;
838
839 ctx.offset = kcalloc(prog->len, sizeof(int), GFP_KERNEL);
840 if (ctx.offset == NULL) {
841 prog = orig_prog;
842 goto out;
843 }
844
845 /* 1. Initial fake pass to compute ctx->idx. */
846
847 /* Fake pass to fill in ctx->offset. */
848 if (build_body(&ctx)) {
849 prog = orig_prog;
850 goto out_off;
851 }
852
853 if (build_prologue(&ctx)) {
854 prog = orig_prog;
855 goto out_off;
856 }
857
858 ctx.epilogue_offset = ctx.idx;
859 build_epilogue(&ctx);
860
861 /* Now we know the actual image size. */
862 image_size = sizeof(u32) * ctx.idx;
863 header = bpf_jit_binary_alloc(image_size, &image_ptr,
864 sizeof(u32), jit_fill_hole);
865 if (header == NULL) {
866 prog = orig_prog;
867 goto out_off;
868 }
869
870 /* 2. Now, the actual pass. */
871
872 ctx.image = (u32 *)image_ptr;
873 ctx.idx = 0;
874
875 build_prologue(&ctx);
876
877 if (build_body(&ctx)) {
878 bpf_jit_binary_free(header);
879 prog = orig_prog;
880 goto out_off;
881 }
882
883 build_epilogue(&ctx);
884
885 /* 3. Extra pass to validate JITed code. */
886 if (validate_code(&ctx)) {
887 bpf_jit_binary_free(header);
888 prog = orig_prog;
889 goto out_off;
890 }
891
892 /* And we're done. */
893 if (bpf_jit_enable > 1)
894 bpf_jit_dump(prog->len, image_size, 2, ctx.image);
895
896 bpf_flush_icache(header, ctx.image + ctx.idx);
897
898 bpf_jit_binary_lock_ro(header);
899 prog->bpf_func = (void *)ctx.image;
900 prog->jited = 1;
901
902 out_off:
903 kfree(ctx.offset);
904 out:
905 if (tmp_blinded)
906 bpf_jit_prog_release_other(prog, prog == orig_prog ?
907 tmp : orig_prog);
908 return prog;
909 }