This source file includes following definitions.
- bpf_jit_fill_ill_insns
- bpf_flush_icache
- bpf_is_seen_register
- bpf_set_seen_register
- bpf_has_stack_frame
- bpf_jit_stack_local
- bpf_jit_stack_tailcallcnt
- bpf_jit_stack_offsetof
- bpf_jit_build_prologue
- bpf_jit_emit_common_epilogue
- bpf_jit_build_epilogue
- bpf_jit_emit_func_call_hlp
- bpf_jit_emit_func_call_rel
- bpf_jit_emit_tail_call
- bpf_jit_build_body
- bpf_jit_fixup_subprog_calls
- bpf_jit_needs_zext
- bpf_int_jit_compile
- bpf_jit_free
1
2
3
4
5
6
7
8
9
10 #include <linux/moduleloader.h>
11 #include <asm/cacheflush.h>
12 #include <asm/asm-compat.h>
13 #include <linux/netdevice.h>
14 #include <linux/filter.h>
15 #include <linux/if_vlan.h>
16 #include <asm/kprobes.h>
17 #include <linux/bpf.h>
18
19 #include "bpf_jit64.h"
20
21 static void bpf_jit_fill_ill_insns(void *area, unsigned int size)
22 {
23 memset32(area, BREAKPOINT_INSTRUCTION, size/4);
24 }
25
26 static inline void bpf_flush_icache(void *start, void *end)
27 {
28 smp_wmb();
29 flush_icache_range((unsigned long)start, (unsigned long)end);
30 }
31
32 static inline bool bpf_is_seen_register(struct codegen_context *ctx, int i)
33 {
34 return (ctx->seen & (1 << (31 - b2p[i])));
35 }
36
37 static inline void bpf_set_seen_register(struct codegen_context *ctx, int i)
38 {
39 ctx->seen |= (1 << (31 - b2p[i]));
40 }
41
42 static inline bool bpf_has_stack_frame(struct codegen_context *ctx)
43 {
44
45
46
47
48
49
50 return ctx->seen & SEEN_FUNC || bpf_is_seen_register(ctx, BPF_REG_FP);
51 }
52
53
54
55
56
57
58
59
60
61
62
63
64 static int bpf_jit_stack_local(struct codegen_context *ctx)
65 {
66 if (bpf_has_stack_frame(ctx))
67 return STACK_FRAME_MIN_SIZE + ctx->stack_size;
68 else
69 return -(BPF_PPC_STACK_SAVE + 16);
70 }
71
72 static int bpf_jit_stack_tailcallcnt(struct codegen_context *ctx)
73 {
74 return bpf_jit_stack_local(ctx) + 8;
75 }
76
77 static int bpf_jit_stack_offsetof(struct codegen_context *ctx, int reg)
78 {
79 if (reg >= BPF_PPC_NVR_MIN && reg < 32)
80 return (bpf_has_stack_frame(ctx) ?
81 (BPF_PPC_STACKFRAME + ctx->stack_size) : 0)
82 - (8 * (32 - reg));
83
84 pr_err("BPF JIT is asking about unknown registers");
85 BUG();
86 }
87
88 static void bpf_jit_build_prologue(u32 *image, struct codegen_context *ctx)
89 {
90 int i;
91
92
93
94
95
96
97 if (ctx->seen & SEEN_TAILCALL) {
98 PPC_LI(b2p[TMP_REG_1], 0);
99
100 PPC_BPF_STL(b2p[TMP_REG_1], 1, -(BPF_PPC_STACK_SAVE + 8));
101 } else {
102 PPC_NOP();
103 PPC_NOP();
104 }
105
106 #define BPF_TAILCALL_PROLOGUE_SIZE 8
107
108 if (bpf_has_stack_frame(ctx)) {
109
110
111
112
113 if (ctx->seen & SEEN_FUNC) {
114 EMIT(PPC_INST_MFLR | __PPC_RT(R0));
115 PPC_BPF_STL(0, 1, PPC_LR_STKOFF);
116 }
117
118 PPC_BPF_STLU(1, 1, -(BPF_PPC_STACKFRAME + ctx->stack_size));
119 }
120
121
122
123
124
125
126 for (i = BPF_REG_6; i <= BPF_REG_10; i++)
127 if (bpf_is_seen_register(ctx, i))
128 PPC_BPF_STL(b2p[i], 1, bpf_jit_stack_offsetof(ctx, b2p[i]));
129
130
131 if (bpf_is_seen_register(ctx, BPF_REG_FP))
132 PPC_ADDI(b2p[BPF_REG_FP], 1,
133 STACK_FRAME_MIN_SIZE + ctx->stack_size);
134 }
135
136 static void bpf_jit_emit_common_epilogue(u32 *image, struct codegen_context *ctx)
137 {
138 int i;
139
140
141 for (i = BPF_REG_6; i <= BPF_REG_10; i++)
142 if (bpf_is_seen_register(ctx, i))
143 PPC_BPF_LL(b2p[i], 1, bpf_jit_stack_offsetof(ctx, b2p[i]));
144
145
146 if (bpf_has_stack_frame(ctx)) {
147 PPC_ADDI(1, 1, BPF_PPC_STACKFRAME + ctx->stack_size);
148 if (ctx->seen & SEEN_FUNC) {
149 PPC_BPF_LL(0, 1, PPC_LR_STKOFF);
150 PPC_MTLR(0);
151 }
152 }
153 }
154
155 static void bpf_jit_build_epilogue(u32 *image, struct codegen_context *ctx)
156 {
157 bpf_jit_emit_common_epilogue(image, ctx);
158
159
160 PPC_MR(3, b2p[BPF_REG_0]);
161
162 PPC_BLR();
163 }
164
165 static void bpf_jit_emit_func_call_hlp(u32 *image, struct codegen_context *ctx,
166 u64 func)
167 {
168 #ifdef PPC64_ELF_ABI_v1
169
170 PPC_LI64(b2p[TMP_REG_2], func);
171
172 PPC_BPF_LL(b2p[TMP_REG_1], b2p[TMP_REG_2], 0);
173
174 PPC_MTLR(b2p[TMP_REG_1]);
175
176
177
178
179
180
181 PPC_BPF_LL(2, b2p[TMP_REG_2], 8);
182 #else
183
184 PPC_FUNC_ADDR(12, func);
185 PPC_MTLR(12);
186 #endif
187 PPC_BLRL();
188 }
189
190 static void bpf_jit_emit_func_call_rel(u32 *image, struct codegen_context *ctx,
191 u64 func)
192 {
193 unsigned int i, ctx_idx = ctx->idx;
194
195
196 PPC_LI64(12, func);
197
198
199
200
201
202
203
204
205
206
207
208 for (i = ctx->idx - ctx_idx; i < 5; i++)
209 PPC_NOP();
210
211 #ifdef PPC64_ELF_ABI_v1
212
213
214
215
216
217
218 PPC_BPF_LL(2, 12, 8);
219
220 PPC_BPF_LL(12, 12, 0);
221 #endif
222
223 PPC_MTLR(12);
224 PPC_BLRL();
225 }
226
227 static void bpf_jit_emit_tail_call(u32 *image, struct codegen_context *ctx, u32 out)
228 {
229
230
231
232
233
234
235 int b2p_bpf_array = b2p[BPF_REG_2];
236 int b2p_index = b2p[BPF_REG_3];
237
238
239
240
241
242 PPC_LWZ(b2p[TMP_REG_1], b2p_bpf_array, offsetof(struct bpf_array, map.max_entries));
243 PPC_RLWINM(b2p_index, b2p_index, 0, 0, 31);
244 PPC_CMPLW(b2p_index, b2p[TMP_REG_1]);
245 PPC_BCC(COND_GE, out);
246
247
248
249
250
251 PPC_BPF_LL(b2p[TMP_REG_1], 1, bpf_jit_stack_tailcallcnt(ctx));
252 PPC_CMPLWI(b2p[TMP_REG_1], MAX_TAIL_CALL_CNT);
253 PPC_BCC(COND_GT, out);
254
255
256
257
258 PPC_ADDI(b2p[TMP_REG_1], b2p[TMP_REG_1], 1);
259 PPC_BPF_STL(b2p[TMP_REG_1], 1, bpf_jit_stack_tailcallcnt(ctx));
260
261
262 PPC_MULI(b2p[TMP_REG_1], b2p_index, 8);
263 PPC_ADD(b2p[TMP_REG_1], b2p[TMP_REG_1], b2p_bpf_array);
264 PPC_BPF_LL(b2p[TMP_REG_1], b2p[TMP_REG_1], offsetof(struct bpf_array, ptrs));
265
266
267
268
269
270 PPC_CMPLDI(b2p[TMP_REG_1], 0);
271 PPC_BCC(COND_EQ, out);
272
273
274 PPC_BPF_LL(b2p[TMP_REG_1], b2p[TMP_REG_1], offsetof(struct bpf_prog, bpf_func));
275 #ifdef PPC64_ELF_ABI_v1
276
277 PPC_ADDI(b2p[TMP_REG_1], b2p[TMP_REG_1],
278 FUNCTION_DESCR_SIZE + BPF_TAILCALL_PROLOGUE_SIZE);
279 #else
280 PPC_ADDI(b2p[TMP_REG_1], b2p[TMP_REG_1], BPF_TAILCALL_PROLOGUE_SIZE);
281 #endif
282 PPC_MTCTR(b2p[TMP_REG_1]);
283
284
285 bpf_jit_emit_common_epilogue(image, ctx);
286
287 PPC_BCTR();
288
289 }
290
291
292 static int bpf_jit_build_body(struct bpf_prog *fp, u32 *image,
293 struct codegen_context *ctx,
294 u32 *addrs, bool extra_pass)
295 {
296 const struct bpf_insn *insn = fp->insnsi;
297 int flen = fp->len;
298 int i, ret;
299
300
301 u32 exit_addr = addrs[flen];
302
303 for (i = 0; i < flen; i++) {
304 u32 code = insn[i].code;
305 u32 dst_reg = b2p[insn[i].dst_reg];
306 u32 src_reg = b2p[insn[i].src_reg];
307 s16 off = insn[i].off;
308 s32 imm = insn[i].imm;
309 bool func_addr_fixed;
310 u64 func_addr;
311 u64 imm64;
312 u32 true_cond;
313 u32 tmp_idx;
314
315
316
317
318
319 addrs[i] = ctx->idx * 4;
320
321
322
323
324
325
326
327
328
329
330
331
332 if (dst_reg >= BPF_PPC_NVR_MIN && dst_reg < 32)
333 bpf_set_seen_register(ctx, insn[i].dst_reg);
334 if (src_reg >= BPF_PPC_NVR_MIN && src_reg < 32)
335 bpf_set_seen_register(ctx, insn[i].src_reg);
336
337 switch (code) {
338
339
340
341 case BPF_ALU | BPF_ADD | BPF_X:
342 case BPF_ALU64 | BPF_ADD | BPF_X:
343 PPC_ADD(dst_reg, dst_reg, src_reg);
344 goto bpf_alu32_trunc;
345 case BPF_ALU | BPF_SUB | BPF_X:
346 case BPF_ALU64 | BPF_SUB | BPF_X:
347 PPC_SUB(dst_reg, dst_reg, src_reg);
348 goto bpf_alu32_trunc;
349 case BPF_ALU | BPF_ADD | BPF_K:
350 case BPF_ALU | BPF_SUB | BPF_K:
351 case BPF_ALU64 | BPF_ADD | BPF_K:
352 case BPF_ALU64 | BPF_SUB | BPF_K:
353 if (BPF_OP(code) == BPF_SUB)
354 imm = -imm;
355 if (imm) {
356 if (imm >= -32768 && imm < 32768)
357 PPC_ADDI(dst_reg, dst_reg, IMM_L(imm));
358 else {
359 PPC_LI32(b2p[TMP_REG_1], imm);
360 PPC_ADD(dst_reg, dst_reg, b2p[TMP_REG_1]);
361 }
362 }
363 goto bpf_alu32_trunc;
364 case BPF_ALU | BPF_MUL | BPF_X:
365 case BPF_ALU64 | BPF_MUL | BPF_X:
366 if (BPF_CLASS(code) == BPF_ALU)
367 PPC_MULW(dst_reg, dst_reg, src_reg);
368 else
369 PPC_MULD(dst_reg, dst_reg, src_reg);
370 goto bpf_alu32_trunc;
371 case BPF_ALU | BPF_MUL | BPF_K:
372 case BPF_ALU64 | BPF_MUL | BPF_K:
373 if (imm >= -32768 && imm < 32768)
374 PPC_MULI(dst_reg, dst_reg, IMM_L(imm));
375 else {
376 PPC_LI32(b2p[TMP_REG_1], imm);
377 if (BPF_CLASS(code) == BPF_ALU)
378 PPC_MULW(dst_reg, dst_reg,
379 b2p[TMP_REG_1]);
380 else
381 PPC_MULD(dst_reg, dst_reg,
382 b2p[TMP_REG_1]);
383 }
384 goto bpf_alu32_trunc;
385 case BPF_ALU | BPF_DIV | BPF_X:
386 case BPF_ALU | BPF_MOD | BPF_X:
387 if (BPF_OP(code) == BPF_MOD) {
388 PPC_DIVWU(b2p[TMP_REG_1], dst_reg, src_reg);
389 PPC_MULW(b2p[TMP_REG_1], src_reg,
390 b2p[TMP_REG_1]);
391 PPC_SUB(dst_reg, dst_reg, b2p[TMP_REG_1]);
392 } else
393 PPC_DIVWU(dst_reg, dst_reg, src_reg);
394 goto bpf_alu32_trunc;
395 case BPF_ALU64 | BPF_DIV | BPF_X:
396 case BPF_ALU64 | BPF_MOD | BPF_X:
397 if (BPF_OP(code) == BPF_MOD) {
398 PPC_DIVDU(b2p[TMP_REG_1], dst_reg, src_reg);
399 PPC_MULD(b2p[TMP_REG_1], src_reg,
400 b2p[TMP_REG_1]);
401 PPC_SUB(dst_reg, dst_reg, b2p[TMP_REG_1]);
402 } else
403 PPC_DIVDU(dst_reg, dst_reg, src_reg);
404 break;
405 case BPF_ALU | BPF_MOD | BPF_K:
406 case BPF_ALU | BPF_DIV | BPF_K:
407 case BPF_ALU64 | BPF_MOD | BPF_K:
408 case BPF_ALU64 | BPF_DIV | BPF_K:
409 if (imm == 0)
410 return -EINVAL;
411 else if (imm == 1)
412 goto bpf_alu32_trunc;
413
414 PPC_LI32(b2p[TMP_REG_1], imm);
415 switch (BPF_CLASS(code)) {
416 case BPF_ALU:
417 if (BPF_OP(code) == BPF_MOD) {
418 PPC_DIVWU(b2p[TMP_REG_2], dst_reg,
419 b2p[TMP_REG_1]);
420 PPC_MULW(b2p[TMP_REG_1],
421 b2p[TMP_REG_1],
422 b2p[TMP_REG_2]);
423 PPC_SUB(dst_reg, dst_reg,
424 b2p[TMP_REG_1]);
425 } else
426 PPC_DIVWU(dst_reg, dst_reg,
427 b2p[TMP_REG_1]);
428 break;
429 case BPF_ALU64:
430 if (BPF_OP(code) == BPF_MOD) {
431 PPC_DIVDU(b2p[TMP_REG_2], dst_reg,
432 b2p[TMP_REG_1]);
433 PPC_MULD(b2p[TMP_REG_1],
434 b2p[TMP_REG_1],
435 b2p[TMP_REG_2]);
436 PPC_SUB(dst_reg, dst_reg,
437 b2p[TMP_REG_1]);
438 } else
439 PPC_DIVDU(dst_reg, dst_reg,
440 b2p[TMP_REG_1]);
441 break;
442 }
443 goto bpf_alu32_trunc;
444 case BPF_ALU | BPF_NEG:
445 case BPF_ALU64 | BPF_NEG:
446 PPC_NEG(dst_reg, dst_reg);
447 goto bpf_alu32_trunc;
448
449
450
451
452 case BPF_ALU | BPF_AND | BPF_X:
453 case BPF_ALU64 | BPF_AND | BPF_X:
454 PPC_AND(dst_reg, dst_reg, src_reg);
455 goto bpf_alu32_trunc;
456 case BPF_ALU | BPF_AND | BPF_K:
457 case BPF_ALU64 | BPF_AND | BPF_K:
458 if (!IMM_H(imm))
459 PPC_ANDI(dst_reg, dst_reg, IMM_L(imm));
460 else {
461
462 PPC_LI32(b2p[TMP_REG_1], imm);
463 PPC_AND(dst_reg, dst_reg, b2p[TMP_REG_1]);
464 }
465 goto bpf_alu32_trunc;
466 case BPF_ALU | BPF_OR | BPF_X:
467 case BPF_ALU64 | BPF_OR | BPF_X:
468 PPC_OR(dst_reg, dst_reg, src_reg);
469 goto bpf_alu32_trunc;
470 case BPF_ALU | BPF_OR | BPF_K:
471 case BPF_ALU64 | BPF_OR | BPF_K:
472 if (imm < 0 && BPF_CLASS(code) == BPF_ALU64) {
473
474 PPC_LI32(b2p[TMP_REG_1], imm);
475 PPC_OR(dst_reg, dst_reg, b2p[TMP_REG_1]);
476 } else {
477 if (IMM_L(imm))
478 PPC_ORI(dst_reg, dst_reg, IMM_L(imm));
479 if (IMM_H(imm))
480 PPC_ORIS(dst_reg, dst_reg, IMM_H(imm));
481 }
482 goto bpf_alu32_trunc;
483 case BPF_ALU | BPF_XOR | BPF_X:
484 case BPF_ALU64 | BPF_XOR | BPF_X:
485 PPC_XOR(dst_reg, dst_reg, src_reg);
486 goto bpf_alu32_trunc;
487 case BPF_ALU | BPF_XOR | BPF_K:
488 case BPF_ALU64 | BPF_XOR | BPF_K:
489 if (imm < 0 && BPF_CLASS(code) == BPF_ALU64) {
490
491 PPC_LI32(b2p[TMP_REG_1], imm);
492 PPC_XOR(dst_reg, dst_reg, b2p[TMP_REG_1]);
493 } else {
494 if (IMM_L(imm))
495 PPC_XORI(dst_reg, dst_reg, IMM_L(imm));
496 if (IMM_H(imm))
497 PPC_XORIS(dst_reg, dst_reg, IMM_H(imm));
498 }
499 goto bpf_alu32_trunc;
500 case BPF_ALU | BPF_LSH | BPF_X:
501
502 PPC_SLW(dst_reg, dst_reg, src_reg);
503
504 if (insn_is_zext(&insn[i + 1]))
505 addrs[++i] = ctx->idx * 4;
506 break;
507 case BPF_ALU64 | BPF_LSH | BPF_X:
508 PPC_SLD(dst_reg, dst_reg, src_reg);
509 break;
510 case BPF_ALU | BPF_LSH | BPF_K:
511
512 PPC_SLWI(dst_reg, dst_reg, imm);
513 if (insn_is_zext(&insn[i + 1]))
514 addrs[++i] = ctx->idx * 4;
515 break;
516 case BPF_ALU64 | BPF_LSH | BPF_K:
517 if (imm != 0)
518 PPC_SLDI(dst_reg, dst_reg, imm);
519 break;
520 case BPF_ALU | BPF_RSH | BPF_X:
521 PPC_SRW(dst_reg, dst_reg, src_reg);
522 if (insn_is_zext(&insn[i + 1]))
523 addrs[++i] = ctx->idx * 4;
524 break;
525 case BPF_ALU64 | BPF_RSH | BPF_X:
526 PPC_SRD(dst_reg, dst_reg, src_reg);
527 break;
528 case BPF_ALU | BPF_RSH | BPF_K:
529 PPC_SRWI(dst_reg, dst_reg, imm);
530 if (insn_is_zext(&insn[i + 1]))
531 addrs[++i] = ctx->idx * 4;
532 break;
533 case BPF_ALU64 | BPF_RSH | BPF_K:
534 if (imm != 0)
535 PPC_SRDI(dst_reg, dst_reg, imm);
536 break;
537 case BPF_ALU | BPF_ARSH | BPF_X:
538 PPC_SRAW(dst_reg, dst_reg, src_reg);
539 goto bpf_alu32_trunc;
540 case BPF_ALU64 | BPF_ARSH | BPF_X:
541 PPC_SRAD(dst_reg, dst_reg, src_reg);
542 break;
543 case BPF_ALU | BPF_ARSH | BPF_K:
544 PPC_SRAWI(dst_reg, dst_reg, imm);
545 goto bpf_alu32_trunc;
546 case BPF_ALU64 | BPF_ARSH | BPF_K:
547 if (imm != 0)
548 PPC_SRADI(dst_reg, dst_reg, imm);
549 break;
550
551
552
553
554 case BPF_ALU | BPF_MOV | BPF_X:
555 case BPF_ALU64 | BPF_MOV | BPF_X:
556 if (imm == 1) {
557
558 PPC_RLWINM(dst_reg, dst_reg, 0, 0, 31);
559 break;
560 }
561 PPC_MR(dst_reg, src_reg);
562 goto bpf_alu32_trunc;
563 case BPF_ALU | BPF_MOV | BPF_K:
564 case BPF_ALU64 | BPF_MOV | BPF_K:
565 PPC_LI32(dst_reg, imm);
566 if (imm < 0)
567 goto bpf_alu32_trunc;
568 else if (insn_is_zext(&insn[i + 1]))
569 addrs[++i] = ctx->idx * 4;
570 break;
571
572 bpf_alu32_trunc:
573
574 if (BPF_CLASS(code) == BPF_ALU && !fp->aux->verifier_zext)
575 PPC_RLWINM(dst_reg, dst_reg, 0, 0, 31);
576 break;
577
578
579
580
581 case BPF_ALU | BPF_END | BPF_FROM_LE:
582 case BPF_ALU | BPF_END | BPF_FROM_BE:
583 #ifdef __BIG_ENDIAN__
584 if (BPF_SRC(code) == BPF_FROM_BE)
585 goto emit_clear;
586 #else
587 if (BPF_SRC(code) == BPF_FROM_LE)
588 goto emit_clear;
589 #endif
590 switch (imm) {
591 case 16:
592
593 PPC_RLWINM(b2p[TMP_REG_1], dst_reg, 8, 16, 23);
594
595 PPC_RLWIMI(b2p[TMP_REG_1], dst_reg, 24, 24, 31);
596
597 PPC_MR(dst_reg, b2p[TMP_REG_1]);
598 break;
599 case 32:
600
601
602
603
604
605 PPC_RLWINM(b2p[TMP_REG_1], dst_reg, 8, 0, 31);
606
607 PPC_RLWIMI(b2p[TMP_REG_1], dst_reg, 24, 0, 7);
608
609 PPC_RLWIMI(b2p[TMP_REG_1], dst_reg, 24, 16, 23);
610 PPC_MR(dst_reg, b2p[TMP_REG_1]);
611 break;
612 case 64:
613
614
615
616
617
618
619
620
621 PPC_BPF_STL(dst_reg, 1, bpf_jit_stack_local(ctx));
622 PPC_ADDI(b2p[TMP_REG_1], 1, bpf_jit_stack_local(ctx));
623 PPC_LDBRX(dst_reg, 0, b2p[TMP_REG_1]);
624 break;
625 }
626 break;
627
628 emit_clear:
629 switch (imm) {
630 case 16:
631
632 PPC_RLDICL(dst_reg, dst_reg, 0, 48);
633 if (insn_is_zext(&insn[i + 1]))
634 addrs[++i] = ctx->idx * 4;
635 break;
636 case 32:
637 if (!fp->aux->verifier_zext)
638
639 PPC_RLDICL(dst_reg, dst_reg, 0, 32);
640 break;
641 case 64:
642
643 break;
644 }
645 break;
646
647
648
649
650 case BPF_STX | BPF_MEM | BPF_B:
651 case BPF_ST | BPF_MEM | BPF_B:
652 if (BPF_CLASS(code) == BPF_ST) {
653 PPC_LI(b2p[TMP_REG_1], imm);
654 src_reg = b2p[TMP_REG_1];
655 }
656 PPC_STB(src_reg, dst_reg, off);
657 break;
658 case BPF_STX | BPF_MEM | BPF_H:
659 case BPF_ST | BPF_MEM | BPF_H:
660 if (BPF_CLASS(code) == BPF_ST) {
661 PPC_LI(b2p[TMP_REG_1], imm);
662 src_reg = b2p[TMP_REG_1];
663 }
664 PPC_STH(src_reg, dst_reg, off);
665 break;
666 case BPF_STX | BPF_MEM | BPF_W:
667 case BPF_ST | BPF_MEM | BPF_W:
668 if (BPF_CLASS(code) == BPF_ST) {
669 PPC_LI32(b2p[TMP_REG_1], imm);
670 src_reg = b2p[TMP_REG_1];
671 }
672 PPC_STW(src_reg, dst_reg, off);
673 break;
674 case BPF_STX | BPF_MEM | BPF_DW:
675 case BPF_ST | BPF_MEM | BPF_DW:
676 if (BPF_CLASS(code) == BPF_ST) {
677 PPC_LI32(b2p[TMP_REG_1], imm);
678 src_reg = b2p[TMP_REG_1];
679 }
680 PPC_BPF_STL(src_reg, dst_reg, off);
681 break;
682
683
684
685
686
687 case BPF_STX | BPF_XADD | BPF_W:
688
689 PPC_ADDI(b2p[TMP_REG_1], dst_reg, off);
690 tmp_idx = ctx->idx * 4;
691
692 PPC_BPF_LWARX(b2p[TMP_REG_2], 0, b2p[TMP_REG_1], 0);
693
694 PPC_ADD(b2p[TMP_REG_2], b2p[TMP_REG_2], src_reg);
695
696 PPC_BPF_STWCX(b2p[TMP_REG_2], 0, b2p[TMP_REG_1]);
697
698 PPC_BCC_SHORT(COND_NE, tmp_idx);
699 break;
700
701 case BPF_STX | BPF_XADD | BPF_DW:
702 PPC_ADDI(b2p[TMP_REG_1], dst_reg, off);
703 tmp_idx = ctx->idx * 4;
704 PPC_BPF_LDARX(b2p[TMP_REG_2], 0, b2p[TMP_REG_1], 0);
705 PPC_ADD(b2p[TMP_REG_2], b2p[TMP_REG_2], src_reg);
706 PPC_BPF_STDCX(b2p[TMP_REG_2], 0, b2p[TMP_REG_1]);
707 PPC_BCC_SHORT(COND_NE, tmp_idx);
708 break;
709
710
711
712
713
714 case BPF_LDX | BPF_MEM | BPF_B:
715 PPC_LBZ(dst_reg, src_reg, off);
716 if (insn_is_zext(&insn[i + 1]))
717 addrs[++i] = ctx->idx * 4;
718 break;
719
720 case BPF_LDX | BPF_MEM | BPF_H:
721 PPC_LHZ(dst_reg, src_reg, off);
722 if (insn_is_zext(&insn[i + 1]))
723 addrs[++i] = ctx->idx * 4;
724 break;
725
726 case BPF_LDX | BPF_MEM | BPF_W:
727 PPC_LWZ(dst_reg, src_reg, off);
728 if (insn_is_zext(&insn[i + 1]))
729 addrs[++i] = ctx->idx * 4;
730 break;
731
732 case BPF_LDX | BPF_MEM | BPF_DW:
733 PPC_BPF_LL(dst_reg, src_reg, off);
734 break;
735
736
737
738
739
740 case BPF_LD | BPF_IMM | BPF_DW:
741 imm64 = ((u64)(u32) insn[i].imm) |
742 (((u64)(u32) insn[i+1].imm) << 32);
743
744 addrs[++i] = ctx->idx * 4;
745 PPC_LI64(dst_reg, imm64);
746 break;
747
748
749
750
751 case BPF_JMP | BPF_EXIT:
752
753
754
755
756
757 if (i != flen - 1)
758 PPC_JMP(exit_addr);
759
760 break;
761
762
763
764
765 case BPF_JMP | BPF_CALL:
766 ctx->seen |= SEEN_FUNC;
767
768 ret = bpf_jit_get_func_addr(fp, &insn[i], extra_pass,
769 &func_addr, &func_addr_fixed);
770 if (ret < 0)
771 return ret;
772
773 if (func_addr_fixed)
774 bpf_jit_emit_func_call_hlp(image, ctx, func_addr);
775 else
776 bpf_jit_emit_func_call_rel(image, ctx, func_addr);
777
778 PPC_MR(b2p[BPF_REG_0], 3);
779 break;
780
781
782
783
784 case BPF_JMP | BPF_JA:
785 PPC_JMP(addrs[i + 1 + off]);
786 break;
787
788 case BPF_JMP | BPF_JGT | BPF_K:
789 case BPF_JMP | BPF_JGT | BPF_X:
790 case BPF_JMP | BPF_JSGT | BPF_K:
791 case BPF_JMP | BPF_JSGT | BPF_X:
792 case BPF_JMP32 | BPF_JGT | BPF_K:
793 case BPF_JMP32 | BPF_JGT | BPF_X:
794 case BPF_JMP32 | BPF_JSGT | BPF_K:
795 case BPF_JMP32 | BPF_JSGT | BPF_X:
796 true_cond = COND_GT;
797 goto cond_branch;
798 case BPF_JMP | BPF_JLT | BPF_K:
799 case BPF_JMP | BPF_JLT | BPF_X:
800 case BPF_JMP | BPF_JSLT | BPF_K:
801 case BPF_JMP | BPF_JSLT | BPF_X:
802 case BPF_JMP32 | BPF_JLT | BPF_K:
803 case BPF_JMP32 | BPF_JLT | BPF_X:
804 case BPF_JMP32 | BPF_JSLT | BPF_K:
805 case BPF_JMP32 | BPF_JSLT | BPF_X:
806 true_cond = COND_LT;
807 goto cond_branch;
808 case BPF_JMP | BPF_JGE | BPF_K:
809 case BPF_JMP | BPF_JGE | BPF_X:
810 case BPF_JMP | BPF_JSGE | BPF_K:
811 case BPF_JMP | BPF_JSGE | BPF_X:
812 case BPF_JMP32 | BPF_JGE | BPF_K:
813 case BPF_JMP32 | BPF_JGE | BPF_X:
814 case BPF_JMP32 | BPF_JSGE | BPF_K:
815 case BPF_JMP32 | BPF_JSGE | BPF_X:
816 true_cond = COND_GE;
817 goto cond_branch;
818 case BPF_JMP | BPF_JLE | BPF_K:
819 case BPF_JMP | BPF_JLE | BPF_X:
820 case BPF_JMP | BPF_JSLE | BPF_K:
821 case BPF_JMP | BPF_JSLE | BPF_X:
822 case BPF_JMP32 | BPF_JLE | BPF_K:
823 case BPF_JMP32 | BPF_JLE | BPF_X:
824 case BPF_JMP32 | BPF_JSLE | BPF_K:
825 case BPF_JMP32 | BPF_JSLE | BPF_X:
826 true_cond = COND_LE;
827 goto cond_branch;
828 case BPF_JMP | BPF_JEQ | BPF_K:
829 case BPF_JMP | BPF_JEQ | BPF_X:
830 case BPF_JMP32 | BPF_JEQ | BPF_K:
831 case BPF_JMP32 | BPF_JEQ | BPF_X:
832 true_cond = COND_EQ;
833 goto cond_branch;
834 case BPF_JMP | BPF_JNE | BPF_K:
835 case BPF_JMP | BPF_JNE | BPF_X:
836 case BPF_JMP32 | BPF_JNE | BPF_K:
837 case BPF_JMP32 | BPF_JNE | BPF_X:
838 true_cond = COND_NE;
839 goto cond_branch;
840 case BPF_JMP | BPF_JSET | BPF_K:
841 case BPF_JMP | BPF_JSET | BPF_X:
842 case BPF_JMP32 | BPF_JSET | BPF_K:
843 case BPF_JMP32 | BPF_JSET | BPF_X:
844 true_cond = COND_NE;
845
846
847 cond_branch:
848 switch (code) {
849 case BPF_JMP | BPF_JGT | BPF_X:
850 case BPF_JMP | BPF_JLT | BPF_X:
851 case BPF_JMP | BPF_JGE | BPF_X:
852 case BPF_JMP | BPF_JLE | BPF_X:
853 case BPF_JMP | BPF_JEQ | BPF_X:
854 case BPF_JMP | BPF_JNE | BPF_X:
855 case BPF_JMP32 | BPF_JGT | BPF_X:
856 case BPF_JMP32 | BPF_JLT | BPF_X:
857 case BPF_JMP32 | BPF_JGE | BPF_X:
858 case BPF_JMP32 | BPF_JLE | BPF_X:
859 case BPF_JMP32 | BPF_JEQ | BPF_X:
860 case BPF_JMP32 | BPF_JNE | BPF_X:
861
862 if (BPF_CLASS(code) == BPF_JMP32)
863 PPC_CMPLW(dst_reg, src_reg);
864 else
865 PPC_CMPLD(dst_reg, src_reg);
866 break;
867 case BPF_JMP | BPF_JSGT | BPF_X:
868 case BPF_JMP | BPF_JSLT | BPF_X:
869 case BPF_JMP | BPF_JSGE | BPF_X:
870 case BPF_JMP | BPF_JSLE | BPF_X:
871 case BPF_JMP32 | BPF_JSGT | BPF_X:
872 case BPF_JMP32 | BPF_JSLT | BPF_X:
873 case BPF_JMP32 | BPF_JSGE | BPF_X:
874 case BPF_JMP32 | BPF_JSLE | BPF_X:
875
876 if (BPF_CLASS(code) == BPF_JMP32)
877 PPC_CMPW(dst_reg, src_reg);
878 else
879 PPC_CMPD(dst_reg, src_reg);
880 break;
881 case BPF_JMP | BPF_JSET | BPF_X:
882 case BPF_JMP32 | BPF_JSET | BPF_X:
883 if (BPF_CLASS(code) == BPF_JMP) {
884 PPC_AND_DOT(b2p[TMP_REG_1], dst_reg,
885 src_reg);
886 } else {
887 int tmp_reg = b2p[TMP_REG_1];
888
889 PPC_AND(tmp_reg, dst_reg, src_reg);
890 PPC_RLWINM_DOT(tmp_reg, tmp_reg, 0, 0,
891 31);
892 }
893 break;
894 case BPF_JMP | BPF_JNE | BPF_K:
895 case BPF_JMP | BPF_JEQ | BPF_K:
896 case BPF_JMP | BPF_JGT | BPF_K:
897 case BPF_JMP | BPF_JLT | BPF_K:
898 case BPF_JMP | BPF_JGE | BPF_K:
899 case BPF_JMP | BPF_JLE | BPF_K:
900 case BPF_JMP32 | BPF_JNE | BPF_K:
901 case BPF_JMP32 | BPF_JEQ | BPF_K:
902 case BPF_JMP32 | BPF_JGT | BPF_K:
903 case BPF_JMP32 | BPF_JLT | BPF_K:
904 case BPF_JMP32 | BPF_JGE | BPF_K:
905 case BPF_JMP32 | BPF_JLE | BPF_K:
906 {
907 bool is_jmp32 = BPF_CLASS(code) == BPF_JMP32;
908
909
910
911
912
913 if (imm >= 0 && imm < 32768) {
914 if (is_jmp32)
915 PPC_CMPLWI(dst_reg, imm);
916 else
917 PPC_CMPLDI(dst_reg, imm);
918 } else {
919
920 PPC_LI32(b2p[TMP_REG_1], imm);
921
922 if (is_jmp32)
923 PPC_CMPLW(dst_reg,
924 b2p[TMP_REG_1]);
925 else
926 PPC_CMPLD(dst_reg,
927 b2p[TMP_REG_1]);
928 }
929 break;
930 }
931 case BPF_JMP | BPF_JSGT | BPF_K:
932 case BPF_JMP | BPF_JSLT | BPF_K:
933 case BPF_JMP | BPF_JSGE | BPF_K:
934 case BPF_JMP | BPF_JSLE | BPF_K:
935 case BPF_JMP32 | BPF_JSGT | BPF_K:
936 case BPF_JMP32 | BPF_JSLT | BPF_K:
937 case BPF_JMP32 | BPF_JSGE | BPF_K:
938 case BPF_JMP32 | BPF_JSLE | BPF_K:
939 {
940 bool is_jmp32 = BPF_CLASS(code) == BPF_JMP32;
941
942
943
944
945
946 if (imm >= -32768 && imm < 32768) {
947 if (is_jmp32)
948 PPC_CMPWI(dst_reg, imm);
949 else
950 PPC_CMPDI(dst_reg, imm);
951 } else {
952 PPC_LI32(b2p[TMP_REG_1], imm);
953 if (is_jmp32)
954 PPC_CMPW(dst_reg,
955 b2p[TMP_REG_1]);
956 else
957 PPC_CMPD(dst_reg,
958 b2p[TMP_REG_1]);
959 }
960 break;
961 }
962 case BPF_JMP | BPF_JSET | BPF_K:
963 case BPF_JMP32 | BPF_JSET | BPF_K:
964
965 if (imm >= 0 && imm < 32768)
966
967 PPC_ANDI(b2p[TMP_REG_1], dst_reg, imm);
968 else {
969 int tmp_reg = b2p[TMP_REG_1];
970
971 PPC_LI32(tmp_reg, imm);
972 if (BPF_CLASS(code) == BPF_JMP) {
973 PPC_AND_DOT(tmp_reg, dst_reg,
974 tmp_reg);
975 } else {
976 PPC_AND(tmp_reg, dst_reg,
977 tmp_reg);
978 PPC_RLWINM_DOT(tmp_reg, tmp_reg,
979 0, 0, 31);
980 }
981 }
982 break;
983 }
984 PPC_BCC(true_cond, addrs[i + 1 + off]);
985 break;
986
987
988
989
990 case BPF_JMP | BPF_TAIL_CALL:
991 ctx->seen |= SEEN_TAILCALL;
992 bpf_jit_emit_tail_call(image, ctx, addrs[i + 1]);
993 break;
994
995 default:
996
997
998
999
1000
1001 pr_err_ratelimited("eBPF filter opcode %04x (@%d) unsupported\n",
1002 code, i);
1003 return -ENOTSUPP;
1004 }
1005 }
1006
1007
1008 addrs[i] = ctx->idx * 4;
1009
1010 return 0;
1011 }
1012
1013
1014 static int bpf_jit_fixup_subprog_calls(struct bpf_prog *fp, u32 *image,
1015 struct codegen_context *ctx, u32 *addrs)
1016 {
1017 const struct bpf_insn *insn = fp->insnsi;
1018 bool func_addr_fixed;
1019 u64 func_addr;
1020 u32 tmp_idx;
1021 int i, ret;
1022
1023 for (i = 0; i < fp->len; i++) {
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033 if (insn[i].code == (BPF_JMP | BPF_CALL) &&
1034 insn[i].src_reg == BPF_PSEUDO_CALL) {
1035 ret = bpf_jit_get_func_addr(fp, &insn[i], true,
1036 &func_addr,
1037 &func_addr_fixed);
1038 if (ret < 0)
1039 return ret;
1040
1041
1042
1043
1044
1045
1046
1047 tmp_idx = ctx->idx;
1048 ctx->idx = addrs[i] / 4;
1049 bpf_jit_emit_func_call_rel(image, ctx, func_addr);
1050
1051
1052
1053
1054
1055 ctx->idx = tmp_idx;
1056 }
1057 }
1058
1059 return 0;
1060 }
1061
1062 struct powerpc64_jit_data {
1063 struct bpf_binary_header *header;
1064 u32 *addrs;
1065 u8 *image;
1066 u32 proglen;
1067 struct codegen_context ctx;
1068 };
1069
1070 bool bpf_jit_needs_zext(void)
1071 {
1072 return true;
1073 }
1074
1075 struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *fp)
1076 {
1077 u32 proglen;
1078 u32 alloclen;
1079 u8 *image = NULL;
1080 u32 *code_base;
1081 u32 *addrs;
1082 struct powerpc64_jit_data *jit_data;
1083 struct codegen_context cgctx;
1084 int pass;
1085 int flen;
1086 struct bpf_binary_header *bpf_hdr;
1087 struct bpf_prog *org_fp = fp;
1088 struct bpf_prog *tmp_fp;
1089 bool bpf_blinded = false;
1090 bool extra_pass = false;
1091
1092 if (!fp->jit_requested)
1093 return org_fp;
1094
1095 tmp_fp = bpf_jit_blind_constants(org_fp);
1096 if (IS_ERR(tmp_fp))
1097 return org_fp;
1098
1099 if (tmp_fp != org_fp) {
1100 bpf_blinded = true;
1101 fp = tmp_fp;
1102 }
1103
1104 jit_data = fp->aux->jit_data;
1105 if (!jit_data) {
1106 jit_data = kzalloc(sizeof(*jit_data), GFP_KERNEL);
1107 if (!jit_data) {
1108 fp = org_fp;
1109 goto out;
1110 }
1111 fp->aux->jit_data = jit_data;
1112 }
1113
1114 flen = fp->len;
1115 addrs = jit_data->addrs;
1116 if (addrs) {
1117 cgctx = jit_data->ctx;
1118 image = jit_data->image;
1119 bpf_hdr = jit_data->header;
1120 proglen = jit_data->proglen;
1121 alloclen = proglen + FUNCTION_DESCR_SIZE;
1122 extra_pass = true;
1123 goto skip_init_ctx;
1124 }
1125
1126 addrs = kcalloc(flen + 1, sizeof(*addrs), GFP_KERNEL);
1127 if (addrs == NULL) {
1128 fp = org_fp;
1129 goto out_addrs;
1130 }
1131
1132 memset(&cgctx, 0, sizeof(struct codegen_context));
1133
1134
1135 cgctx.stack_size = round_up(fp->aux->stack_depth, 16);
1136
1137
1138 if (bpf_jit_build_body(fp, 0, &cgctx, addrs, false)) {
1139
1140 fp = org_fp;
1141 goto out_addrs;
1142 }
1143
1144
1145
1146
1147
1148
1149 if (cgctx.seen & SEEN_TAILCALL) {
1150 cgctx.idx = 0;
1151 if (bpf_jit_build_body(fp, 0, &cgctx, addrs, false)) {
1152 fp = org_fp;
1153 goto out_addrs;
1154 }
1155 }
1156
1157
1158
1159
1160
1161
1162 bpf_jit_build_prologue(0, &cgctx);
1163 bpf_jit_build_epilogue(0, &cgctx);
1164
1165 proglen = cgctx.idx * 4;
1166 alloclen = proglen + FUNCTION_DESCR_SIZE;
1167
1168 bpf_hdr = bpf_jit_binary_alloc(alloclen, &image, 4,
1169 bpf_jit_fill_ill_insns);
1170 if (!bpf_hdr) {
1171 fp = org_fp;
1172 goto out_addrs;
1173 }
1174
1175 skip_init_ctx:
1176 code_base = (u32 *)(image + FUNCTION_DESCR_SIZE);
1177
1178 if (extra_pass) {
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188 bpf_jit_fixup_subprog_calls(fp, code_base, &cgctx, addrs);
1189
1190
1191 goto skip_codegen_passes;
1192 }
1193
1194
1195 for (pass = 1; pass < 3; pass++) {
1196
1197 cgctx.idx = 0;
1198 bpf_jit_build_prologue(code_base, &cgctx);
1199 bpf_jit_build_body(fp, code_base, &cgctx, addrs, extra_pass);
1200 bpf_jit_build_epilogue(code_base, &cgctx);
1201
1202 if (bpf_jit_enable > 1)
1203 pr_info("Pass %d: shrink = %d, seen = 0x%x\n", pass,
1204 proglen - (cgctx.idx * 4), cgctx.seen);
1205 }
1206
1207 skip_codegen_passes:
1208 if (bpf_jit_enable > 1)
1209
1210
1211
1212
1213 bpf_jit_dump(flen, proglen, pass, code_base);
1214
1215 #ifdef PPC64_ELF_ABI_v1
1216
1217 ((u64 *)image)[0] = (u64)code_base;
1218 ((u64 *)image)[1] = local_paca->kernel_toc;
1219 #endif
1220
1221 fp->bpf_func = (void *)image;
1222 fp->jited = 1;
1223 fp->jited_len = alloclen;
1224
1225 bpf_flush_icache(bpf_hdr, (u8 *)bpf_hdr + (bpf_hdr->pages * PAGE_SIZE));
1226 if (!fp->is_func || extra_pass) {
1227 bpf_prog_fill_jited_linfo(fp, addrs);
1228 out_addrs:
1229 kfree(addrs);
1230 kfree(jit_data);
1231 fp->aux->jit_data = NULL;
1232 } else {
1233 jit_data->addrs = addrs;
1234 jit_data->ctx = cgctx;
1235 jit_data->proglen = proglen;
1236 jit_data->image = image;
1237 jit_data->header = bpf_hdr;
1238 }
1239
1240 out:
1241 if (bpf_blinded)
1242 bpf_jit_prog_release_other(fp, fp == org_fp ? tmp_fp : org_fp);
1243
1244 return fp;
1245 }
1246
1247
1248 void bpf_jit_free(struct bpf_prog *fp)
1249 {
1250 unsigned long addr = (unsigned long)fp->bpf_func & PAGE_MASK;
1251 struct bpf_binary_header *bpf_hdr = (void *)addr;
1252
1253 if (fp->jited)
1254 bpf_jit_binary_free(bpf_hdr);
1255
1256 bpf_prog_unlock_free(fp);
1257 }