blob: 4a52d34facf95329aeff85c2a02b856afbdded20 [file] [log] [blame]
David S. Miller7a12b502017-04-17 18:44:36 -07001#include <linux/moduleloader.h>
2#include <linux/workqueue.h>
3#include <linux/netdevice.h>
4#include <linux/filter.h>
5#include <linux/bpf.h>
6#include <linux/cache.h>
7#include <linux/if_vlan.h>
8
9#include <asm/cacheflush.h>
10#include <asm/ptrace.h>
11
12#include "bpf_jit_64.h"
13
14int bpf_jit_enable __read_mostly;
15
16static inline bool is_simm13(unsigned int value)
17{
18 return value + 0x1000 < 0x2000;
19}
20
David S. Millere3a724e2017-04-24 15:56:21 -070021static inline bool is_simm10(unsigned int value)
22{
23 return value + 0x200 < 0x400;
24}
25
26static inline bool is_simm5(unsigned int value)
27{
28 return value + 0x10 < 0x20;
29}
30
David S. Miller14933dc2017-04-24 19:42:34 -070031static inline bool is_sethi(unsigned int value)
32{
33 return (value & ~0x3fffff) == 0;
34}
35
David S. Miller7a12b502017-04-17 18:44:36 -070036static void bpf_flush_icache(void *start_, void *end_)
37{
38 /* Cheetah's I-cache is fully coherent. */
39 if (tlb_type == spitfire) {
40 unsigned long start = (unsigned long) start_;
41 unsigned long end = (unsigned long) end_;
42
43 start &= ~7UL;
44 end = (end + 7UL) & ~7UL;
45 while (start < end) {
46 flushi(start);
47 start += 32;
48 }
49 }
50}
51
52#define SEEN_DATAREF 1 /* might call external helpers */
53#define SEEN_XREG 2 /* ebx is used */
54#define SEEN_MEM 4 /* use mem[] for temporary storage */
55
56#define S13(X) ((X) & 0x1fff)
David S. Millere3a724e2017-04-24 15:56:21 -070057#define S5(X) ((X) & 0x1f)
David S. Miller7a12b502017-04-17 18:44:36 -070058#define IMMED 0x00002000
59#define RD(X) ((X) << 25)
60#define RS1(X) ((X) << 14)
61#define RS2(X) ((X))
62#define OP(X) ((X) << 30)
63#define OP2(X) ((X) << 22)
64#define OP3(X) ((X) << 19)
David S. Millere3a724e2017-04-24 15:56:21 -070065#define COND(X) (((X) & 0xf) << 25)
66#define CBCOND(X) (((X) & 0x1f) << 25)
David S. Miller7a12b502017-04-17 18:44:36 -070067#define F1(X) OP(X)
68#define F2(X, Y) (OP(X) | OP2(Y))
69#define F3(X, Y) (OP(X) | OP3(Y))
70#define ASI(X) (((X) & 0xff) << 5)
71
72#define CONDN COND(0x0)
73#define CONDE COND(0x1)
74#define CONDLE COND(0x2)
75#define CONDL COND(0x3)
76#define CONDLEU COND(0x4)
77#define CONDCS COND(0x5)
78#define CONDNEG COND(0x6)
79#define CONDVC COND(0x7)
80#define CONDA COND(0x8)
81#define CONDNE COND(0x9)
82#define CONDG COND(0xa)
83#define CONDGE COND(0xb)
84#define CONDGU COND(0xc)
85#define CONDCC COND(0xd)
86#define CONDPOS COND(0xe)
87#define CONDVS COND(0xf)
88
89#define CONDGEU CONDCC
90#define CONDLU CONDCS
91
92#define WDISP22(X) (((X) >> 2) & 0x3fffff)
93#define WDISP19(X) (((X) >> 2) & 0x7ffff)
94
David S. Millere3a724e2017-04-24 15:56:21 -070095/* The 10-bit branch displacement for CBCOND is split into two fields */
96static u32 WDISP10(u32 off)
97{
98 u32 ret = ((off >> 2) & 0xff) << 5;
99
100 ret |= ((off >> (2 + 8)) & 0x03) << 19;
101
102 return ret;
103}
104
105#define CBCONDE CBCOND(0x09)
106#define CBCONDLE CBCOND(0x0a)
107#define CBCONDL CBCOND(0x0b)
108#define CBCONDLEU CBCOND(0x0c)
109#define CBCONDCS CBCOND(0x0d)
110#define CBCONDN CBCOND(0x0e)
111#define CBCONDVS CBCOND(0x0f)
112#define CBCONDNE CBCOND(0x19)
113#define CBCONDG CBCOND(0x1a)
114#define CBCONDGE CBCOND(0x1b)
115#define CBCONDGU CBCOND(0x1c)
116#define CBCONDCC CBCOND(0x1d)
117#define CBCONDPOS CBCOND(0x1e)
118#define CBCONDVC CBCOND(0x1f)
119
120#define CBCONDGEU CBCONDCC
121#define CBCONDLU CBCONDCS
122
David S. Miller7a12b502017-04-17 18:44:36 -0700123#define ANNUL (1 << 29)
124#define XCC (1 << 21)
125
126#define BRANCH (F2(0, 1) | XCC)
David S. Millere3a724e2017-04-24 15:56:21 -0700127#define CBCOND_OP (F2(0, 3) | XCC)
David S. Miller7a12b502017-04-17 18:44:36 -0700128
129#define BA (BRANCH | CONDA)
130#define BG (BRANCH | CONDG)
131#define BGU (BRANCH | CONDGU)
132#define BLEU (BRANCH | CONDLEU)
133#define BGE (BRANCH | CONDGE)
134#define BGEU (BRANCH | CONDGEU)
135#define BLU (BRANCH | CONDLU)
136#define BE (BRANCH | CONDE)
137#define BNE (BRANCH | CONDNE)
138
139#define SETHI(K, REG) \
140 (F2(0, 0x4) | RD(REG) | (((K) >> 10) & 0x3fffff))
141#define OR_LO(K, REG) \
142 (F3(2, 0x02) | IMMED | RS1(REG) | ((K) & 0x3ff) | RD(REG))
143
144#define ADD F3(2, 0x00)
145#define AND F3(2, 0x01)
146#define ANDCC F3(2, 0x11)
147#define OR F3(2, 0x02)
148#define XOR F3(2, 0x03)
149#define SUB F3(2, 0x04)
150#define SUBCC F3(2, 0x14)
151#define MUL F3(2, 0x0a)
152#define MULX F3(2, 0x09)
153#define UDIVX F3(2, 0x0d)
154#define DIV F3(2, 0x0e)
155#define SLL F3(2, 0x25)
156#define SLLX (F3(2, 0x25)|(1<<12))
157#define SRA F3(2, 0x27)
158#define SRAX (F3(2, 0x27)|(1<<12))
159#define SRL F3(2, 0x26)
160#define SRLX (F3(2, 0x26)|(1<<12))
161#define JMPL F3(2, 0x38)
162#define SAVE F3(2, 0x3c)
163#define RESTORE F3(2, 0x3d)
164#define CALL F1(1)
165#define BR F2(0, 0x01)
166#define RD_Y F3(2, 0x28)
167#define WR_Y F3(2, 0x30)
168
169#define LD32 F3(3, 0x00)
170#define LD8 F3(3, 0x01)
171#define LD16 F3(3, 0x02)
172#define LD64 F3(3, 0x0b)
173#define LD64A F3(3, 0x1b)
174#define ST8 F3(3, 0x05)
175#define ST16 F3(3, 0x06)
176#define ST32 F3(3, 0x04)
177#define ST64 F3(3, 0x0e)
178
179#define CAS F3(3, 0x3c)
180#define CASX F3(3, 0x3e)
181
182#define LDPTR LD64
183#define BASE_STACKFRAME 176
184
185#define LD32I (LD32 | IMMED)
186#define LD8I (LD8 | IMMED)
187#define LD16I (LD16 | IMMED)
188#define LD64I (LD64 | IMMED)
189#define LDPTRI (LDPTR | IMMED)
190#define ST32I (ST32 | IMMED)
191
192struct jit_ctx {
193 struct bpf_prog *prog;
194 unsigned int *offset;
195 int idx;
196 int epilogue_offset;
197 bool tmp_1_used;
198 bool tmp_2_used;
199 bool tmp_3_used;
200 bool saw_ld_abs_ind;
201 bool saw_frame_pointer;
202 bool saw_call;
203 bool saw_tail_call;
204 u32 *image;
205};
206
207#define TMP_REG_1 (MAX_BPF_JIT_REG + 0)
208#define TMP_REG_2 (MAX_BPF_JIT_REG + 1)
209#define SKB_HLEN_REG (MAX_BPF_JIT_REG + 2)
210#define SKB_DATA_REG (MAX_BPF_JIT_REG + 3)
211#define TMP_REG_3 (MAX_BPF_JIT_REG + 4)
212
213/* Map BPF registers to SPARC registers */
214static const int bpf2sparc[] = {
215 /* return value from in-kernel function, and exit value from eBPF */
216 [BPF_REG_0] = O5,
217
218 /* arguments from eBPF program to in-kernel function */
219 [BPF_REG_1] = O0,
220 [BPF_REG_2] = O1,
221 [BPF_REG_3] = O2,
222 [BPF_REG_4] = O3,
223 [BPF_REG_5] = O4,
224
225 /* callee saved registers that in-kernel function will preserve */
226 [BPF_REG_6] = L0,
227 [BPF_REG_7] = L1,
228 [BPF_REG_8] = L2,
229 [BPF_REG_9] = L3,
230
231 /* read-only frame pointer to access stack */
232 [BPF_REG_FP] = L6,
233
234 [BPF_REG_AX] = G7,
235
236 /* temporary register for internal BPF JIT */
237 [TMP_REG_1] = G1,
238 [TMP_REG_2] = G2,
239 [TMP_REG_3] = G3,
240
241 [SKB_HLEN_REG] = L4,
242 [SKB_DATA_REG] = L5,
243};
244
245static void emit(const u32 insn, struct jit_ctx *ctx)
246{
247 if (ctx->image != NULL)
248 ctx->image[ctx->idx] = insn;
249
250 ctx->idx++;
251}
252
253static void emit_call(u32 *func, struct jit_ctx *ctx)
254{
255 if (ctx->image != NULL) {
256 void *here = &ctx->image[ctx->idx];
257 unsigned int off;
258
259 off = (void *)func - here;
260 ctx->image[ctx->idx] = CALL | ((off >> 2) & 0x3fffffff);
261 }
262 ctx->idx++;
263}
264
265static void emit_nop(struct jit_ctx *ctx)
266{
267 emit(SETHI(0, G0), ctx);
268}
269
270static void emit_reg_move(u32 from, u32 to, struct jit_ctx *ctx)
271{
272 emit(OR | RS1(G0) | RS2(from) | RD(to), ctx);
273}
274
275/* Emit 32-bit constant, zero extended. */
276static void emit_set_const(s32 K, u32 reg, struct jit_ctx *ctx)
277{
278 emit(SETHI(K, reg), ctx);
279 emit(OR_LO(K, reg), ctx);
280}
281
282/* Emit 32-bit constant, sign extended. */
283static void emit_set_const_sext(s32 K, u32 reg, struct jit_ctx *ctx)
284{
285 if (K >= 0) {
286 emit(SETHI(K, reg), ctx);
287 emit(OR_LO(K, reg), ctx);
288 } else {
289 u32 hbits = ~(u32) K;
290 u32 lbits = -0x400 | (u32) K;
291
292 emit(SETHI(hbits, reg), ctx);
293 emit(XOR | IMMED | RS1(reg) | S13(lbits) | RD(reg), ctx);
294 }
295}
296
297static void emit_alu(u32 opcode, u32 src, u32 dst, struct jit_ctx *ctx)
298{
299 emit(opcode | RS1(dst) | RS2(src) | RD(dst), ctx);
300}
301
302static void emit_alu3(u32 opcode, u32 a, u32 b, u32 c, struct jit_ctx *ctx)
303{
304 emit(opcode | RS1(a) | RS2(b) | RD(c), ctx);
305}
306
307static void emit_alu_K(unsigned int opcode, unsigned int dst, unsigned int imm,
308 struct jit_ctx *ctx)
309{
310 bool small_immed = is_simm13(imm);
311 unsigned int insn = opcode;
312
313 insn |= RS1(dst) | RD(dst);
314 if (small_immed) {
315 emit(insn | IMMED | S13(imm), ctx);
316 } else {
317 unsigned int tmp = bpf2sparc[TMP_REG_1];
318
319 ctx->tmp_1_used = true;
320
321 emit_set_const_sext(imm, tmp, ctx);
322 emit(insn | RS2(tmp), ctx);
323 }
324}
325
326static void emit_alu3_K(unsigned int opcode, unsigned int src, unsigned int imm,
327 unsigned int dst, struct jit_ctx *ctx)
328{
329 bool small_immed = is_simm13(imm);
330 unsigned int insn = opcode;
331
332 insn |= RS1(src) | RD(dst);
333 if (small_immed) {
334 emit(insn | IMMED | S13(imm), ctx);
335 } else {
336 unsigned int tmp = bpf2sparc[TMP_REG_1];
337
338 ctx->tmp_1_used = true;
339
340 emit_set_const_sext(imm, tmp, ctx);
341 emit(insn | RS2(tmp), ctx);
342 }
343}
344
345static void emit_loadimm32(s32 K, unsigned int dest, struct jit_ctx *ctx)
346{
347 if (K >= 0 && is_simm13(K)) {
348 /* or %g0, K, DEST */
349 emit(OR | IMMED | RS1(G0) | S13(K) | RD(dest), ctx);
350 } else {
351 emit_set_const(K, dest, ctx);
352 }
353}
354
355static void emit_loadimm(s32 K, unsigned int dest, struct jit_ctx *ctx)
356{
357 if (is_simm13(K)) {
358 /* or %g0, K, DEST */
359 emit(OR | IMMED | RS1(G0) | S13(K) | RD(dest), ctx);
360 } else {
361 emit_set_const(K, dest, ctx);
362 }
363}
364
365static void emit_loadimm_sext(s32 K, unsigned int dest, struct jit_ctx *ctx)
366{
367 if (is_simm13(K)) {
368 /* or %g0, K, DEST */
369 emit(OR | IMMED | RS1(G0) | S13(K) | RD(dest), ctx);
370 } else {
371 emit_set_const_sext(K, dest, ctx);
372 }
373}
374
David S. Miller14933dc2017-04-24 19:42:34 -0700375static void analyze_64bit_constant(u32 high_bits, u32 low_bits,
376 int *hbsp, int *lbsp, int *abbasp)
377{
378 int lowest_bit_set, highest_bit_set, all_bits_between_are_set;
379 int i;
380
381 lowest_bit_set = highest_bit_set = -1;
382 i = 0;
383 do {
384 if ((lowest_bit_set == -1) && ((low_bits >> i) & 1))
385 lowest_bit_set = i;
386 if ((highest_bit_set == -1) && ((high_bits >> (32 - i - 1)) & 1))
387 highest_bit_set = (64 - i - 1);
388 } while (++i < 32 && (highest_bit_set == -1 ||
389 lowest_bit_set == -1));
390 if (i == 32) {
391 i = 0;
392 do {
393 if (lowest_bit_set == -1 && ((high_bits >> i) & 1))
394 lowest_bit_set = i + 32;
395 if (highest_bit_set == -1 &&
396 ((low_bits >> (32 - i - 1)) & 1))
397 highest_bit_set = 32 - i - 1;
398 } while (++i < 32 && (highest_bit_set == -1 ||
399 lowest_bit_set == -1));
400 }
401
402 all_bits_between_are_set = 1;
403 for (i = lowest_bit_set; i <= highest_bit_set; i++) {
404 if (i < 32) {
405 if ((low_bits & (1 << i)) != 0)
406 continue;
407 } else {
408 if ((high_bits & (1 << (i - 32))) != 0)
409 continue;
410 }
411 all_bits_between_are_set = 0;
412 break;
413 }
414 *hbsp = highest_bit_set;
415 *lbsp = lowest_bit_set;
416 *abbasp = all_bits_between_are_set;
417}
418
419static unsigned long create_simple_focus_bits(unsigned long high_bits,
420 unsigned long low_bits,
421 int lowest_bit_set, int shift)
422{
423 long hi, lo;
424
425 if (lowest_bit_set < 32) {
426 lo = (low_bits >> lowest_bit_set) << shift;
427 hi = ((high_bits << (32 - lowest_bit_set)) << shift);
428 } else {
429 lo = 0;
430 hi = ((high_bits >> (lowest_bit_set - 32)) << shift);
431 }
432 return hi | lo;
433}
434
435static bool const64_is_2insns(unsigned long high_bits,
436 unsigned long low_bits)
437{
438 int highest_bit_set, lowest_bit_set, all_bits_between_are_set;
439
440 if (high_bits == 0 || high_bits == 0xffffffff)
441 return true;
442
443 analyze_64bit_constant(high_bits, low_bits,
444 &highest_bit_set, &lowest_bit_set,
445 &all_bits_between_are_set);
446
447 if ((highest_bit_set == 63 || lowest_bit_set == 0) &&
448 all_bits_between_are_set != 0)
449 return true;
450
451 if (highest_bit_set - lowest_bit_set < 21)
452 return true;
453
454 return false;
455}
456
457static void sparc_emit_set_const64_quick2(unsigned long high_bits,
458 unsigned long low_imm,
459 unsigned int dest,
460 int shift_count, struct jit_ctx *ctx)
461{
462 emit_loadimm32(high_bits, dest, ctx);
463
464 /* Now shift it up into place. */
465 emit_alu_K(SLLX, dest, shift_count, ctx);
466
467 /* If there is a low immediate part piece, finish up by
468 * putting that in as well.
469 */
470 if (low_imm != 0)
471 emit(OR | IMMED | RS1(dest) | S13(low_imm) | RD(dest), ctx);
472}
473
David S. Miller7a12b502017-04-17 18:44:36 -0700474static void emit_loadimm64(u64 K, unsigned int dest, struct jit_ctx *ctx)
475{
David S. Miller14933dc2017-04-24 19:42:34 -0700476 int all_bits_between_are_set, lowest_bit_set, highest_bit_set;
David S. Miller7a12b502017-04-17 18:44:36 -0700477 unsigned int tmp = bpf2sparc[TMP_REG_1];
David S. Miller14933dc2017-04-24 19:42:34 -0700478 u32 low_bits = (K & 0xffffffff);
479 u32 high_bits = (K >> 32);
David S. Miller7a12b502017-04-17 18:44:36 -0700480
David S. Miller14933dc2017-04-24 19:42:34 -0700481 /* These two tests also take care of all of the one
482 * instruction cases.
483 */
484 if (high_bits == 0xffffffff && (low_bits & 0x80000000))
485 return emit_loadimm_sext(K, dest, ctx);
486 if (high_bits == 0x00000000)
487 return emit_loadimm32(K, dest, ctx);
488
489 analyze_64bit_constant(high_bits, low_bits, &highest_bit_set,
490 &lowest_bit_set, &all_bits_between_are_set);
491
492 /* 1) mov -1, %reg
493 * sllx %reg, shift, %reg
494 * 2) mov -1, %reg
495 * srlx %reg, shift, %reg
496 * 3) mov some_small_const, %reg
497 * sllx %reg, shift, %reg
498 */
499 if (((highest_bit_set == 63 || lowest_bit_set == 0) &&
500 all_bits_between_are_set != 0) ||
501 ((highest_bit_set - lowest_bit_set) < 12)) {
502 int shift = lowest_bit_set;
503 long the_const = -1;
504
505 if ((highest_bit_set != 63 && lowest_bit_set != 0) ||
506 all_bits_between_are_set == 0) {
507 the_const =
508 create_simple_focus_bits(high_bits, low_bits,
509 lowest_bit_set, 0);
510 } else if (lowest_bit_set == 0)
511 shift = -(63 - highest_bit_set);
512
513 emit(OR | IMMED | RS1(G0) | S13(the_const) | RD(dest), ctx);
514 if (shift > 0)
515 emit_alu_K(SLLX, dest, shift, ctx);
516 else if (shift < 0)
517 emit_alu_K(SRLX, dest, -shift, ctx);
518
519 return;
520 }
521
522 /* Now a range of 22 or less bits set somewhere.
523 * 1) sethi %hi(focus_bits), %reg
524 * sllx %reg, shift, %reg
525 * 2) sethi %hi(focus_bits), %reg
526 * srlx %reg, shift, %reg
527 */
528 if ((highest_bit_set - lowest_bit_set) < 21) {
529 unsigned long focus_bits =
530 create_simple_focus_bits(high_bits, low_bits,
531 lowest_bit_set, 10);
532
533 emit(SETHI(focus_bits, dest), ctx);
534
535 /* If lowest_bit_set == 10 then a sethi alone could
536 * have done it.
537 */
538 if (lowest_bit_set < 10)
539 emit_alu_K(SRLX, dest, 10 - lowest_bit_set, ctx);
540 else if (lowest_bit_set > 10)
541 emit_alu_K(SLLX, dest, lowest_bit_set - 10, ctx);
542 return;
543 }
544
545 /* Ok, now 3 instruction sequences. */
546 if (low_bits == 0) {
547 emit_loadimm32(high_bits, dest, ctx);
548 emit_alu_K(SLLX, dest, 32, ctx);
549 return;
550 }
551
552 /* We may be able to do something quick
553 * when the constant is negated, so try that.
554 */
555 if (const64_is_2insns((~high_bits) & 0xffffffff,
556 (~low_bits) & 0xfffffc00)) {
557 /* NOTE: The trailing bits get XOR'd so we need the
558 * non-negated bits, not the negated ones.
559 */
560 unsigned long trailing_bits = low_bits & 0x3ff;
561
562 if ((((~high_bits) & 0xffffffff) == 0 &&
563 ((~low_bits) & 0x80000000) == 0) ||
564 (((~high_bits) & 0xffffffff) == 0xffffffff &&
565 ((~low_bits) & 0x80000000) != 0)) {
566 unsigned long fast_int = (~low_bits & 0xffffffff);
567
568 if ((is_sethi(fast_int) &&
569 (~high_bits & 0xffffffff) == 0)) {
570 emit(SETHI(fast_int, dest), ctx);
571 } else if (is_simm13(fast_int)) {
572 emit(OR | IMMED | RS1(G0) | S13(fast_int) | RD(dest), ctx);
573 } else {
574 emit_loadimm64(fast_int, dest, ctx);
575 }
576 } else {
577 u64 n = ((~low_bits) & 0xfffffc00) |
578 (((unsigned long)((~high_bits) & 0xffffffff))<<32);
579 emit_loadimm64(n, dest, ctx);
580 }
581
582 low_bits = -0x400 | trailing_bits;
583
584 emit(XOR | IMMED | RS1(dest) | S13(low_bits) | RD(dest), ctx);
585 return;
586 }
587
588 /* 1) sethi %hi(xxx), %reg
589 * or %reg, %lo(xxx), %reg
590 * sllx %reg, yyy, %reg
591 */
592 if ((highest_bit_set - lowest_bit_set) < 32) {
593 unsigned long focus_bits =
594 create_simple_focus_bits(high_bits, low_bits,
595 lowest_bit_set, 0);
596
597 /* So what we know is that the set bits straddle the
598 * middle of the 64-bit word.
599 */
600 sparc_emit_set_const64_quick2(focus_bits, 0, dest,
601 lowest_bit_set, ctx);
602 return;
603 }
604
605 /* 1) sethi %hi(high_bits), %reg
606 * or %reg, %lo(high_bits), %reg
607 * sllx %reg, 32, %reg
608 * or %reg, low_bits, %reg
609 */
610 if (is_simm13(low_bits) && ((int)low_bits > 0)) {
611 sparc_emit_set_const64_quick2(high_bits, low_bits,
612 dest, 32, ctx);
613 return;
614 }
615
616 /* Oh well, we tried... Do a full 64-bit decomposition. */
David S. Miller7a12b502017-04-17 18:44:36 -0700617 ctx->tmp_1_used = true;
618
David S. Miller14933dc2017-04-24 19:42:34 -0700619 emit_loadimm32(high_bits, tmp, ctx);
620 emit_loadimm32(low_bits, dest, ctx);
David S. Miller7a12b502017-04-17 18:44:36 -0700621 emit_alu_K(SLLX, tmp, 32, ctx);
622 emit(OR | RS1(dest) | RS2(tmp) | RD(dest), ctx);
623}
624
625static void emit_branch(unsigned int br_opc, unsigned int from_idx, unsigned int to_idx,
626 struct jit_ctx *ctx)
627{
628 unsigned int off = to_idx - from_idx;
629
630 if (br_opc & XCC)
631 emit(br_opc | WDISP19(off << 2), ctx);
632 else
633 emit(br_opc | WDISP22(off << 2), ctx);
634}
635
David S. Millere3a724e2017-04-24 15:56:21 -0700636static void emit_cbcond(unsigned int cb_opc, unsigned int from_idx, unsigned int to_idx,
637 const u8 dst, const u8 src, struct jit_ctx *ctx)
638{
639 unsigned int off = to_idx - from_idx;
640
641 emit(cb_opc | WDISP10(off << 2) | RS1(dst) | RS2(src), ctx);
642}
643
644static void emit_cbcondi(unsigned int cb_opc, unsigned int from_idx, unsigned int to_idx,
645 const u8 dst, s32 imm, struct jit_ctx *ctx)
646{
647 unsigned int off = to_idx - from_idx;
648
649 emit(cb_opc | IMMED | WDISP10(off << 2) | RS1(dst) | S5(imm), ctx);
650}
651
David S. Miller7a12b502017-04-17 18:44:36 -0700652#define emit_read_y(REG, CTX) emit(RD_Y | RD(REG), CTX)
653#define emit_write_y(REG, CTX) emit(WR_Y | IMMED | RS1(REG) | S13(0), CTX)
654
655#define emit_cmp(R1, R2, CTX) \
656 emit(SUBCC | RS1(R1) | RS2(R2) | RD(G0), CTX)
657
658#define emit_cmpi(R1, IMM, CTX) \
David S. Millere3a724e2017-04-24 15:56:21 -0700659 emit(SUBCC | IMMED | RS1(R1) | S13(IMM) | RD(G0), CTX)
David S. Miller7a12b502017-04-17 18:44:36 -0700660
661#define emit_btst(R1, R2, CTX) \
662 emit(ANDCC | RS1(R1) | RS2(R2) | RD(G0), CTX)
663
664#define emit_btsti(R1, IMM, CTX) \
665 emit(ANDCC | IMMED | RS1(R1) | S13(IMM) | RD(G0), CTX)
666
David S. Millere3a724e2017-04-24 15:56:21 -0700667static int emit_compare_and_branch(const u8 code, const u8 dst, u8 src,
668 const s32 imm, bool is_imm, int branch_dst,
669 struct jit_ctx *ctx)
670{
671 bool use_cbcond = (sparc64_elf_hwcap & AV_SPARC_CBCOND) != 0;
672 const u8 tmp = bpf2sparc[TMP_REG_1];
673
674 branch_dst = ctx->offset[branch_dst];
675
676 if (!is_simm10(branch_dst - ctx->idx) ||
677 BPF_OP(code) == BPF_JSET)
678 use_cbcond = false;
679
680 if (is_imm) {
681 bool fits = true;
682
683 if (use_cbcond) {
684 if (!is_simm5(imm))
685 fits = false;
686 } else if (!is_simm13(imm)) {
687 fits = false;
688 }
689 if (!fits) {
690 ctx->tmp_1_used = true;
691 emit_loadimm_sext(imm, tmp, ctx);
692 src = tmp;
693 is_imm = false;
694 }
695 }
696
697 if (!use_cbcond) {
698 u32 br_opcode;
699
700 if (BPF_OP(code) == BPF_JSET) {
701 if (is_imm)
702 emit_btsti(dst, imm, ctx);
703 else
704 emit_btst(dst, src, ctx);
705 } else {
706 if (is_imm)
707 emit_cmpi(dst, imm, ctx);
708 else
709 emit_cmp(dst, src, ctx);
710 }
711 switch (BPF_OP(code)) {
712 case BPF_JEQ:
713 br_opcode = BE;
714 break;
715 case BPF_JGT:
716 br_opcode = BGU;
717 break;
718 case BPF_JGE:
719 br_opcode = BGEU;
720 break;
721 case BPF_JSET:
722 case BPF_JNE:
723 br_opcode = BNE;
724 break;
725 case BPF_JSGT:
726 br_opcode = BG;
727 break;
728 case BPF_JSGE:
729 br_opcode = BGE;
730 break;
731 default:
732 /* Make sure we dont leak kernel information to the
733 * user.
734 */
735 return -EFAULT;
736 }
737 emit_branch(br_opcode, ctx->idx, branch_dst, ctx);
738 emit_nop(ctx);
739 } else {
740 u32 cbcond_opcode;
741
742 switch (BPF_OP(code)) {
743 case BPF_JEQ:
744 cbcond_opcode = CBCONDE;
745 break;
746 case BPF_JGT:
747 cbcond_opcode = CBCONDGU;
748 break;
749 case BPF_JGE:
750 cbcond_opcode = CBCONDGEU;
751 break;
752 case BPF_JNE:
753 cbcond_opcode = CBCONDNE;
754 break;
755 case BPF_JSGT:
756 cbcond_opcode = CBCONDG;
757 break;
758 case BPF_JSGE:
759 cbcond_opcode = CBCONDGE;
760 break;
761 default:
762 /* Make sure we dont leak kernel information to the
763 * user.
764 */
765 return -EFAULT;
766 }
767 cbcond_opcode |= CBCOND_OP;
768 if (is_imm)
769 emit_cbcondi(cbcond_opcode, ctx->idx, branch_dst,
770 dst, imm, ctx);
771 else
772 emit_cbcond(cbcond_opcode, ctx->idx, branch_dst,
773 dst, src, ctx);
774 }
775 return 0;
776}
777
David S. Miller7a12b502017-04-17 18:44:36 -0700778static void load_skb_regs(struct jit_ctx *ctx, u8 r_skb)
779{
780 const u8 r_headlen = bpf2sparc[SKB_HLEN_REG];
781 const u8 r_data = bpf2sparc[SKB_DATA_REG];
782 const u8 r_tmp = bpf2sparc[TMP_REG_1];
783 unsigned int off;
784
785 off = offsetof(struct sk_buff, len);
786 emit(LD32I | RS1(r_skb) | S13(off) | RD(r_headlen), ctx);
787
788 off = offsetof(struct sk_buff, data_len);
789 emit(LD32I | RS1(r_skb) | S13(off) | RD(r_tmp), ctx);
790
791 emit(SUB | RS1(r_headlen) | RS2(r_tmp) | RD(r_headlen), ctx);
792
793 off = offsetof(struct sk_buff, data);
794 emit(LDPTRI | RS1(r_skb) | S13(off) | RD(r_data), ctx);
795}
796
797/* Just skip the save instruction and the ctx register move. */
798#define BPF_TAILCALL_PROLOGUE_SKIP 16
799#define BPF_TAILCALL_CNT_SP_OFF (STACK_BIAS + 128)
800
801static void build_prologue(struct jit_ctx *ctx)
802{
803 s32 stack_needed = BASE_STACKFRAME;
804
805 if (ctx->saw_frame_pointer || ctx->saw_tail_call)
806 stack_needed += MAX_BPF_STACK;
807
808 if (ctx->saw_tail_call)
809 stack_needed += 8;
810
811 /* save %sp, -176, %sp */
812 emit(SAVE | IMMED | RS1(SP) | S13(-stack_needed) | RD(SP), ctx);
813
814 /* tail_call_cnt = 0 */
815 if (ctx->saw_tail_call) {
816 u32 off = BPF_TAILCALL_CNT_SP_OFF;
817
818 emit(ST32 | IMMED | RS1(SP) | S13(off) | RD(G0), ctx);
819 } else {
820 emit_nop(ctx);
821 }
822 if (ctx->saw_frame_pointer) {
823 const u8 vfp = bpf2sparc[BPF_REG_FP];
824
825 emit(ADD | IMMED | RS1(FP) | S13(STACK_BIAS) | RD(vfp), ctx);
826 }
827
828 emit_reg_move(I0, O0, ctx);
829 /* If you add anything here, adjust BPF_TAILCALL_PROLOGUE_SKIP above. */
830
831 if (ctx->saw_ld_abs_ind)
832 load_skb_regs(ctx, bpf2sparc[BPF_REG_1]);
833}
834
835static void build_epilogue(struct jit_ctx *ctx)
836{
837 ctx->epilogue_offset = ctx->idx;
838
839 /* ret (jmpl %i7 + 8, %g0) */
840 emit(JMPL | IMMED | RS1(I7) | S13(8) | RD(G0), ctx);
841
842 /* restore %i5, %g0, %o0 */
843 emit(RESTORE | RS1(bpf2sparc[BPF_REG_0]) | RS2(G0) | RD(O0), ctx);
844}
845
846static void emit_tail_call(struct jit_ctx *ctx)
847{
848 const u8 bpf_array = bpf2sparc[BPF_REG_2];
849 const u8 bpf_index = bpf2sparc[BPF_REG_3];
850 const u8 tmp = bpf2sparc[TMP_REG_1];
851 u32 off;
852
853 ctx->saw_tail_call = true;
854
855 off = offsetof(struct bpf_array, map.max_entries);
856 emit(LD32 | IMMED | RS1(bpf_array) | S13(off) | RD(tmp), ctx);
857 emit_cmp(bpf_index, tmp, ctx);
858#define OFFSET1 17
859 emit_branch(BGEU, ctx->idx, ctx->idx + OFFSET1, ctx);
860 emit_nop(ctx);
861
862 off = BPF_TAILCALL_CNT_SP_OFF;
863 emit(LD32 | IMMED | RS1(SP) | S13(off) | RD(tmp), ctx);
864 emit_cmpi(tmp, MAX_TAIL_CALL_CNT, ctx);
865#define OFFSET2 13
866 emit_branch(BGU, ctx->idx, ctx->idx + OFFSET2, ctx);
867 emit_nop(ctx);
868
869 emit_alu_K(ADD, tmp, 1, ctx);
870 off = BPF_TAILCALL_CNT_SP_OFF;
871 emit(ST32 | IMMED | RS1(SP) | S13(off) | RD(tmp), ctx);
872
873 emit_alu3_K(SLL, bpf_index, 3, tmp, ctx);
874 emit_alu(ADD, bpf_array, tmp, ctx);
875 off = offsetof(struct bpf_array, ptrs);
876 emit(LD64 | IMMED | RS1(tmp) | S13(off) | RD(tmp), ctx);
877
878 emit_cmpi(tmp, 0, ctx);
879#define OFFSET3 5
880 emit_branch(BE, ctx->idx, ctx->idx + OFFSET3, ctx);
881 emit_nop(ctx);
882
883 off = offsetof(struct bpf_prog, bpf_func);
884 emit(LD64 | IMMED | RS1(tmp) | S13(off) | RD(tmp), ctx);
885
886 off = BPF_TAILCALL_PROLOGUE_SKIP;
887 emit(JMPL | IMMED | RS1(tmp) | S13(off) | RD(G0), ctx);
888 emit_nop(ctx);
889}
890
891static int build_insn(const struct bpf_insn *insn, struct jit_ctx *ctx)
892{
893 const u8 code = insn->code;
894 const u8 dst = bpf2sparc[insn->dst_reg];
895 const u8 src = bpf2sparc[insn->src_reg];
896 const int i = insn - ctx->prog->insnsi;
897 const s16 off = insn->off;
898 const s32 imm = insn->imm;
899 u32 *func;
900
901 if (insn->src_reg == BPF_REG_FP)
902 ctx->saw_frame_pointer = true;
903
904 switch (code) {
905 /* dst = src */
906 case BPF_ALU | BPF_MOV | BPF_X:
907 emit_alu3_K(SRL, src, 0, dst, ctx);
908 break;
909 case BPF_ALU64 | BPF_MOV | BPF_X:
910 emit_reg_move(src, dst, ctx);
911 break;
912 /* dst = dst OP src */
913 case BPF_ALU | BPF_ADD | BPF_X:
914 case BPF_ALU64 | BPF_ADD | BPF_X:
915 emit_alu(ADD, src, dst, ctx);
916 goto do_alu32_trunc;
917 case BPF_ALU | BPF_SUB | BPF_X:
918 case BPF_ALU64 | BPF_SUB | BPF_X:
919 emit_alu(SUB, src, dst, ctx);
920 goto do_alu32_trunc;
921 case BPF_ALU | BPF_AND | BPF_X:
922 case BPF_ALU64 | BPF_AND | BPF_X:
923 emit_alu(AND, src, dst, ctx);
924 goto do_alu32_trunc;
925 case BPF_ALU | BPF_OR | BPF_X:
926 case BPF_ALU64 | BPF_OR | BPF_X:
927 emit_alu(OR, src, dst, ctx);
928 goto do_alu32_trunc;
929 case BPF_ALU | BPF_XOR | BPF_X:
930 case BPF_ALU64 | BPF_XOR | BPF_X:
931 emit_alu(XOR, src, dst, ctx);
932 goto do_alu32_trunc;
933 case BPF_ALU | BPF_MUL | BPF_X:
934 emit_alu(MUL, src, dst, ctx);
935 goto do_alu32_trunc;
936 case BPF_ALU64 | BPF_MUL | BPF_X:
937 emit_alu(MULX, src, dst, ctx);
938 break;
939 case BPF_ALU | BPF_DIV | BPF_X:
940 emit_cmp(src, G0, ctx);
941 emit_branch(BE|ANNUL, ctx->idx, ctx->epilogue_offset, ctx);
942 emit_loadimm(0, bpf2sparc[BPF_REG_0], ctx);
943
944 emit_write_y(G0, ctx);
945 emit_alu(DIV, src, dst, ctx);
946 break;
947
948 case BPF_ALU64 | BPF_DIV | BPF_X:
949 emit_cmp(src, G0, ctx);
950 emit_branch(BE|ANNUL, ctx->idx, ctx->epilogue_offset, ctx);
951 emit_loadimm(0, bpf2sparc[BPF_REG_0], ctx);
952
953 emit_alu(UDIVX, src, dst, ctx);
954 break;
955
956 case BPF_ALU | BPF_MOD | BPF_X: {
957 const u8 tmp = bpf2sparc[TMP_REG_1];
958
959 ctx->tmp_1_used = true;
960
961 emit_cmp(src, G0, ctx);
962 emit_branch(BE|ANNUL, ctx->idx, ctx->epilogue_offset, ctx);
963 emit_loadimm(0, bpf2sparc[BPF_REG_0], ctx);
964
965 emit_write_y(G0, ctx);
966 emit_alu3(DIV, dst, src, tmp, ctx);
967 emit_alu3(MULX, tmp, src, tmp, ctx);
968 emit_alu3(SUB, dst, tmp, dst, ctx);
969 goto do_alu32_trunc;
970 }
971 case BPF_ALU64 | BPF_MOD | BPF_X: {
972 const u8 tmp = bpf2sparc[TMP_REG_1];
973
974 ctx->tmp_1_used = true;
975
976 emit_cmp(src, G0, ctx);
977 emit_branch(BE|ANNUL, ctx->idx, ctx->epilogue_offset, ctx);
978 emit_loadimm(0, bpf2sparc[BPF_REG_0], ctx);
979
980 emit_alu3(UDIVX, dst, src, tmp, ctx);
981 emit_alu3(MULX, tmp, src, tmp, ctx);
982 emit_alu3(SUB, dst, tmp, dst, ctx);
983 break;
984 }
985 case BPF_ALU | BPF_LSH | BPF_X:
986 emit_alu(SLL, src, dst, ctx);
987 goto do_alu32_trunc;
988 case BPF_ALU64 | BPF_LSH | BPF_X:
989 emit_alu(SLLX, src, dst, ctx);
990 break;
991 case BPF_ALU | BPF_RSH | BPF_X:
992 emit_alu(SRL, src, dst, ctx);
993 break;
994 case BPF_ALU64 | BPF_RSH | BPF_X:
995 emit_alu(SRLX, src, dst, ctx);
996 break;
997 case BPF_ALU | BPF_ARSH | BPF_X:
998 emit_alu(SRA, src, dst, ctx);
999 goto do_alu32_trunc;
1000 case BPF_ALU64 | BPF_ARSH | BPF_X:
1001 emit_alu(SRAX, src, dst, ctx);
1002 break;
1003
1004 /* dst = -dst */
1005 case BPF_ALU | BPF_NEG:
1006 case BPF_ALU64 | BPF_NEG:
1007 emit(SUB | RS1(0) | RS2(dst) | RD(dst), ctx);
1008 goto do_alu32_trunc;
1009
1010 case BPF_ALU | BPF_END | BPF_FROM_BE:
1011 switch (imm) {
1012 case 16:
1013 emit_alu_K(SLL, dst, 16, ctx);
1014 emit_alu_K(SRL, dst, 16, ctx);
1015 break;
1016 case 32:
1017 emit_alu_K(SRL, dst, 0, ctx);
1018 break;
1019 case 64:
1020 /* nop */
1021 break;
1022
1023 }
1024 break;
1025
1026 /* dst = BSWAP##imm(dst) */
1027 case BPF_ALU | BPF_END | BPF_FROM_LE: {
1028 const u8 tmp = bpf2sparc[TMP_REG_1];
1029 const u8 tmp2 = bpf2sparc[TMP_REG_2];
1030
1031 ctx->tmp_1_used = true;
1032 switch (imm) {
1033 case 16:
1034 emit_alu3_K(AND, dst, 0xff, tmp, ctx);
1035 emit_alu3_K(SRL, dst, 8, dst, ctx);
1036 emit_alu3_K(AND, dst, 0xff, dst, ctx);
1037 emit_alu3_K(SLL, tmp, 8, tmp, ctx);
1038 emit_alu(OR, tmp, dst, ctx);
1039 break;
1040
1041 case 32:
1042 ctx->tmp_2_used = true;
1043 emit_alu3_K(SRL, dst, 24, tmp, ctx); /* tmp = dst >> 24 */
1044 emit_alu3_K(SRL, dst, 16, tmp2, ctx); /* tmp2 = dst >> 16 */
1045 emit_alu3_K(AND, tmp2, 0xff, tmp2, ctx);/* tmp2 = tmp2 & 0xff */
1046 emit_alu3_K(SLL, tmp2, 8, tmp2, ctx); /* tmp2 = tmp2 << 8 */
1047 emit_alu(OR, tmp2, tmp, ctx); /* tmp = tmp | tmp2 */
1048 emit_alu3_K(SRL, dst, 8, tmp2, ctx); /* tmp2 = dst >> 8 */
1049 emit_alu3_K(AND, tmp2, 0xff, tmp2, ctx);/* tmp2 = tmp2 & 0xff */
1050 emit_alu3_K(SLL, tmp2, 16, tmp2, ctx); /* tmp2 = tmp2 << 16 */
1051 emit_alu(OR, tmp2, tmp, ctx); /* tmp = tmp | tmp2 */
1052 emit_alu3_K(AND, dst, 0xff, dst, ctx); /* dst = dst & 0xff */
1053 emit_alu3_K(SLL, dst, 24, dst, ctx); /* dst = dst << 24 */
1054 emit_alu(OR, tmp, dst, ctx); /* dst = dst | tmp */
1055 break;
1056
1057 case 64:
1058 emit_alu3_K(ADD, SP, STACK_BIAS + 128, tmp, ctx);
1059 emit(ST64 | RS1(tmp) | RS2(G0) | RD(dst), ctx);
1060 emit(LD64A | ASI(ASI_PL) | RS1(tmp) | RS2(G0) | RD(dst), ctx);
1061 break;
1062 }
1063 break;
1064 }
1065 /* dst = imm */
1066 case BPF_ALU | BPF_MOV | BPF_K:
1067 emit_loadimm32(imm, dst, ctx);
1068 break;
1069 case BPF_ALU64 | BPF_MOV | BPF_K:
1070 emit_loadimm_sext(imm, dst, ctx);
1071 break;
1072 /* dst = dst OP imm */
1073 case BPF_ALU | BPF_ADD | BPF_K:
1074 case BPF_ALU64 | BPF_ADD | BPF_K:
1075 emit_alu_K(ADD, dst, imm, ctx);
1076 goto do_alu32_trunc;
1077 case BPF_ALU | BPF_SUB | BPF_K:
1078 case BPF_ALU64 | BPF_SUB | BPF_K:
1079 emit_alu_K(SUB, dst, imm, ctx);
1080 goto do_alu32_trunc;
1081 case BPF_ALU | BPF_AND | BPF_K:
1082 case BPF_ALU64 | BPF_AND | BPF_K:
1083 emit_alu_K(AND, dst, imm, ctx);
1084 goto do_alu32_trunc;
1085 case BPF_ALU | BPF_OR | BPF_K:
1086 case BPF_ALU64 | BPF_OR | BPF_K:
1087 emit_alu_K(OR, dst, imm, ctx);
1088 goto do_alu32_trunc;
1089 case BPF_ALU | BPF_XOR | BPF_K:
1090 case BPF_ALU64 | BPF_XOR | BPF_K:
1091 emit_alu_K(XOR, dst, imm, ctx);
1092 goto do_alu32_trunc;
1093 case BPF_ALU | BPF_MUL | BPF_K:
1094 emit_alu_K(MUL, dst, imm, ctx);
1095 goto do_alu32_trunc;
1096 case BPF_ALU64 | BPF_MUL | BPF_K:
1097 emit_alu_K(MULX, dst, imm, ctx);
1098 break;
1099 case BPF_ALU | BPF_DIV | BPF_K:
1100 if (imm == 0)
1101 return -EINVAL;
1102
1103 emit_write_y(G0, ctx);
1104 emit_alu_K(DIV, dst, imm, ctx);
1105 goto do_alu32_trunc;
1106 case BPF_ALU64 | BPF_DIV | BPF_K:
1107 if (imm == 0)
1108 return -EINVAL;
1109
1110 emit_alu_K(UDIVX, dst, imm, ctx);
1111 break;
1112 case BPF_ALU64 | BPF_MOD | BPF_K:
1113 case BPF_ALU | BPF_MOD | BPF_K: {
1114 const u8 tmp = bpf2sparc[TMP_REG_2];
1115 unsigned int div;
1116
1117 if (imm == 0)
1118 return -EINVAL;
1119
1120 div = (BPF_CLASS(code) == BPF_ALU64) ? UDIVX : DIV;
1121
1122 ctx->tmp_2_used = true;
1123
1124 if (BPF_CLASS(code) != BPF_ALU64)
1125 emit_write_y(G0, ctx);
1126 if (is_simm13(imm)) {
1127 emit(div | IMMED | RS1(dst) | S13(imm) | RD(tmp), ctx);
1128 emit(MULX | IMMED | RS1(tmp) | S13(imm) | RD(tmp), ctx);
1129 emit(SUB | RS1(dst) | RS2(tmp) | RD(dst), ctx);
1130 } else {
1131 const u8 tmp1 = bpf2sparc[TMP_REG_1];
1132
1133 ctx->tmp_1_used = true;
1134
1135 emit_set_const_sext(imm, tmp1, ctx);
1136 emit(div | RS1(dst) | RS2(tmp1) | RD(tmp), ctx);
1137 emit(MULX | RS1(tmp) | RS2(tmp1) | RD(tmp), ctx);
1138 emit(SUB | RS1(dst) | RS2(tmp) | RD(dst), ctx);
1139 }
1140 goto do_alu32_trunc;
1141 }
1142 case BPF_ALU | BPF_LSH | BPF_K:
1143 emit_alu_K(SLL, dst, imm, ctx);
1144 goto do_alu32_trunc;
1145 case BPF_ALU64 | BPF_LSH | BPF_K:
1146 emit_alu_K(SLLX, dst, imm, ctx);
1147 break;
1148 case BPF_ALU | BPF_RSH | BPF_K:
1149 emit_alu_K(SRL, dst, imm, ctx);
1150 break;
1151 case BPF_ALU64 | BPF_RSH | BPF_K:
1152 emit_alu_K(SRLX, dst, imm, ctx);
1153 break;
1154 case BPF_ALU | BPF_ARSH | BPF_K:
1155 emit_alu_K(SRA, dst, imm, ctx);
1156 goto do_alu32_trunc;
1157 case BPF_ALU64 | BPF_ARSH | BPF_K:
1158 emit_alu_K(SRAX, dst, imm, ctx);
1159 break;
1160
1161 do_alu32_trunc:
1162 if (BPF_CLASS(code) == BPF_ALU)
1163 emit_alu_K(SRL, dst, 0, ctx);
1164 break;
1165
1166 /* JUMP off */
1167 case BPF_JMP | BPF_JA:
1168 emit_branch(BA, ctx->idx, ctx->offset[i + off], ctx);
1169 emit_nop(ctx);
1170 break;
1171 /* IF (dst COND src) JUMP off */
1172 case BPF_JMP | BPF_JEQ | BPF_X:
1173 case BPF_JMP | BPF_JGT | BPF_X:
1174 case BPF_JMP | BPF_JGE | BPF_X:
1175 case BPF_JMP | BPF_JNE | BPF_X:
1176 case BPF_JMP | BPF_JSGT | BPF_X:
David S. Millere3a724e2017-04-24 15:56:21 -07001177 case BPF_JMP | BPF_JSGE | BPF_X:
1178 case BPF_JMP | BPF_JSET | BPF_X: {
1179 int err;
David S. Miller7a12b502017-04-17 18:44:36 -07001180
David S. Millere3a724e2017-04-24 15:56:21 -07001181 err = emit_compare_and_branch(code, dst, src, 0, false, i + off, ctx);
1182 if (err)
1183 return err;
David S. Miller7a12b502017-04-17 18:44:36 -07001184 break;
1185 }
David S. Miller7a12b502017-04-17 18:44:36 -07001186 /* IF (dst COND imm) JUMP off */
1187 case BPF_JMP | BPF_JEQ | BPF_K:
1188 case BPF_JMP | BPF_JGT | BPF_K:
1189 case BPF_JMP | BPF_JGE | BPF_K:
1190 case BPF_JMP | BPF_JNE | BPF_K:
1191 case BPF_JMP | BPF_JSGT | BPF_K:
1192 case BPF_JMP | BPF_JSGE | BPF_K:
David S. Millere3a724e2017-04-24 15:56:21 -07001193 case BPF_JMP | BPF_JSET | BPF_K: {
1194 int err;
1195
1196 err = emit_compare_and_branch(code, dst, 0, imm, true, i + off, ctx);
1197 if (err)
1198 return err;
1199 break;
1200 }
David S. Miller7a12b502017-04-17 18:44:36 -07001201
1202 /* function call */
1203 case BPF_JMP | BPF_CALL:
1204 {
1205 u8 *func = ((u8 *)__bpf_call_base) + imm;
1206
1207 ctx->saw_call = true;
1208
1209 emit_call((u32 *)func, ctx);
1210 emit_nop(ctx);
1211
1212 emit_reg_move(O0, bpf2sparc[BPF_REG_0], ctx);
1213
1214 if (bpf_helper_changes_pkt_data(func) && ctx->saw_ld_abs_ind)
1215 load_skb_regs(ctx, bpf2sparc[BPF_REG_6]);
1216 break;
1217 }
1218
1219 /* tail call */
Alexei Starovoitov71189fa2017-05-30 13:31:27 -07001220 case BPF_JMP | BPF_TAIL_CALL:
David S. Miller7a12b502017-04-17 18:44:36 -07001221 emit_tail_call(ctx);
1222 break;
1223
1224 /* function return */
1225 case BPF_JMP | BPF_EXIT:
1226 /* Optimization: when last instruction is EXIT,
1227 simply fallthrough to epilogue. */
1228 if (i == ctx->prog->len - 1)
1229 break;
1230 emit_branch(BA, ctx->idx, ctx->epilogue_offset, ctx);
1231 emit_nop(ctx);
1232 break;
1233
1234 /* dst = imm64 */
1235 case BPF_LD | BPF_IMM | BPF_DW:
1236 {
1237 const struct bpf_insn insn1 = insn[1];
1238 u64 imm64;
1239
1240 imm64 = (u64)insn1.imm << 32 | (u32)imm;
1241 emit_loadimm64(imm64, dst, ctx);
1242
1243 return 1;
1244 }
1245
1246 /* LDX: dst = *(size *)(src + off) */
1247 case BPF_LDX | BPF_MEM | BPF_W:
1248 case BPF_LDX | BPF_MEM | BPF_H:
1249 case BPF_LDX | BPF_MEM | BPF_B:
1250 case BPF_LDX | BPF_MEM | BPF_DW: {
1251 const u8 tmp = bpf2sparc[TMP_REG_1];
1252 u32 opcode = 0, rs2;
1253
1254 ctx->tmp_1_used = true;
1255 switch (BPF_SIZE(code)) {
1256 case BPF_W:
1257 opcode = LD32;
1258 break;
1259 case BPF_H:
1260 opcode = LD16;
1261 break;
1262 case BPF_B:
1263 opcode = LD8;
1264 break;
1265 case BPF_DW:
1266 opcode = LD64;
1267 break;
1268 }
1269
1270 if (is_simm13(off)) {
1271 opcode |= IMMED;
1272 rs2 = S13(off);
1273 } else {
1274 emit_loadimm(off, tmp, ctx);
1275 rs2 = RS2(tmp);
1276 }
1277 emit(opcode | RS1(src) | rs2 | RD(dst), ctx);
1278 break;
1279 }
1280 /* ST: *(size *)(dst + off) = imm */
1281 case BPF_ST | BPF_MEM | BPF_W:
1282 case BPF_ST | BPF_MEM | BPF_H:
1283 case BPF_ST | BPF_MEM | BPF_B:
1284 case BPF_ST | BPF_MEM | BPF_DW: {
1285 const u8 tmp = bpf2sparc[TMP_REG_1];
1286 const u8 tmp2 = bpf2sparc[TMP_REG_2];
1287 u32 opcode = 0, rs2;
1288
1289 ctx->tmp_2_used = true;
1290 emit_loadimm(imm, tmp2, ctx);
1291
1292 switch (BPF_SIZE(code)) {
1293 case BPF_W:
1294 opcode = ST32;
1295 break;
1296 case BPF_H:
1297 opcode = ST16;
1298 break;
1299 case BPF_B:
1300 opcode = ST8;
1301 break;
1302 case BPF_DW:
1303 opcode = ST64;
1304 break;
1305 }
1306
1307 if (is_simm13(off)) {
1308 opcode |= IMMED;
1309 rs2 = S13(off);
1310 } else {
1311 ctx->tmp_1_used = true;
1312 emit_loadimm(off, tmp, ctx);
1313 rs2 = RS2(tmp);
1314 }
1315 emit(opcode | RS1(dst) | rs2 | RD(tmp2), ctx);
1316 break;
1317 }
1318
1319 /* STX: *(size *)(dst + off) = src */
1320 case BPF_STX | BPF_MEM | BPF_W:
1321 case BPF_STX | BPF_MEM | BPF_H:
1322 case BPF_STX | BPF_MEM | BPF_B:
1323 case BPF_STX | BPF_MEM | BPF_DW: {
1324 const u8 tmp = bpf2sparc[TMP_REG_1];
1325 u32 opcode = 0, rs2;
1326
1327 switch (BPF_SIZE(code)) {
1328 case BPF_W:
1329 opcode = ST32;
1330 break;
1331 case BPF_H:
1332 opcode = ST16;
1333 break;
1334 case BPF_B:
1335 opcode = ST8;
1336 break;
1337 case BPF_DW:
1338 opcode = ST64;
1339 break;
1340 }
1341 if (is_simm13(off)) {
1342 opcode |= IMMED;
1343 rs2 = S13(off);
1344 } else {
1345 ctx->tmp_1_used = true;
1346 emit_loadimm(off, tmp, ctx);
1347 rs2 = RS2(tmp);
1348 }
1349 emit(opcode | RS1(dst) | rs2 | RD(src), ctx);
1350 break;
1351 }
1352
1353 /* STX XADD: lock *(u32 *)(dst + off) += src */
1354 case BPF_STX | BPF_XADD | BPF_W: {
1355 const u8 tmp = bpf2sparc[TMP_REG_1];
1356 const u8 tmp2 = bpf2sparc[TMP_REG_2];
1357 const u8 tmp3 = bpf2sparc[TMP_REG_3];
1358
1359 ctx->tmp_1_used = true;
1360 ctx->tmp_2_used = true;
1361 ctx->tmp_3_used = true;
1362 emit_loadimm(off, tmp, ctx);
1363 emit_alu3(ADD, dst, tmp, tmp, ctx);
1364
1365 emit(LD32 | RS1(tmp) | RS2(G0) | RD(tmp2), ctx);
1366 emit_alu3(ADD, tmp2, src, tmp3, ctx);
1367 emit(CAS | ASI(ASI_P) | RS1(tmp) | RS2(tmp2) | RD(tmp3), ctx);
1368 emit_cmp(tmp2, tmp3, ctx);
1369 emit_branch(BNE, 4, 0, ctx);
1370 emit_nop(ctx);
1371 break;
1372 }
1373 /* STX XADD: lock *(u64 *)(dst + off) += src */
1374 case BPF_STX | BPF_XADD | BPF_DW: {
1375 const u8 tmp = bpf2sparc[TMP_REG_1];
1376 const u8 tmp2 = bpf2sparc[TMP_REG_2];
1377 const u8 tmp3 = bpf2sparc[TMP_REG_3];
1378
1379 ctx->tmp_1_used = true;
1380 ctx->tmp_2_used = true;
1381 ctx->tmp_3_used = true;
1382 emit_loadimm(off, tmp, ctx);
1383 emit_alu3(ADD, dst, tmp, tmp, ctx);
1384
1385 emit(LD64 | RS1(tmp) | RS2(G0) | RD(tmp2), ctx);
1386 emit_alu3(ADD, tmp2, src, tmp3, ctx);
1387 emit(CASX | ASI(ASI_P) | RS1(tmp) | RS2(tmp2) | RD(tmp3), ctx);
1388 emit_cmp(tmp2, tmp3, ctx);
1389 emit_branch(BNE, 4, 0, ctx);
1390 emit_nop(ctx);
1391 break;
1392 }
1393#define CHOOSE_LOAD_FUNC(K, func) \
1394 ((int)K < 0 ? ((int)K >= SKF_LL_OFF ? func##_negative_offset : func) : func##_positive_offset)
1395
1396 /* R0 = ntohx(*(size *)(((struct sk_buff *)R6)->data + imm)) */
1397 case BPF_LD | BPF_ABS | BPF_W:
1398 func = CHOOSE_LOAD_FUNC(imm, bpf_jit_load_word);
1399 goto common_load;
1400 case BPF_LD | BPF_ABS | BPF_H:
1401 func = CHOOSE_LOAD_FUNC(imm, bpf_jit_load_half);
1402 goto common_load;
1403 case BPF_LD | BPF_ABS | BPF_B:
1404 func = CHOOSE_LOAD_FUNC(imm, bpf_jit_load_byte);
1405 goto common_load;
1406 /* R0 = ntohx(*(size *)(((struct sk_buff *)R6)->data + src + imm)) */
1407 case BPF_LD | BPF_IND | BPF_W:
1408 func = bpf_jit_load_word;
1409 goto common_load;
1410 case BPF_LD | BPF_IND | BPF_H:
1411 func = bpf_jit_load_half;
1412 goto common_load;
1413
1414 case BPF_LD | BPF_IND | BPF_B:
1415 func = bpf_jit_load_byte;
1416 common_load:
1417 ctx->saw_ld_abs_ind = true;
1418
1419 emit_reg_move(bpf2sparc[BPF_REG_6], O0, ctx);
1420 emit_loadimm(imm, O1, ctx);
1421
1422 if (BPF_MODE(code) == BPF_IND)
1423 emit_alu(ADD, src, O1, ctx);
1424
1425 emit_call(func, ctx);
1426 emit_alu_K(SRA, O1, 0, ctx);
1427
1428 emit_reg_move(O0, bpf2sparc[BPF_REG_0], ctx);
1429 break;
1430
1431 default:
1432 pr_err_once("unknown opcode %02x\n", code);
1433 return -EINVAL;
1434 }
1435
1436 return 0;
1437}
1438
1439static int build_body(struct jit_ctx *ctx)
1440{
1441 const struct bpf_prog *prog = ctx->prog;
1442 int i;
1443
1444 for (i = 0; i < prog->len; i++) {
1445 const struct bpf_insn *insn = &prog->insnsi[i];
1446 int ret;
1447
1448 ret = build_insn(insn, ctx);
David S. Miller7a12b502017-04-17 18:44:36 -07001449
1450 if (ret > 0) {
1451 i++;
David S. Millere3bf4c62017-05-01 20:26:02 -07001452 ctx->offset[i] = ctx->idx;
David S. Miller7a12b502017-04-17 18:44:36 -07001453 continue;
1454 }
David S. Millere3bf4c62017-05-01 20:26:02 -07001455 ctx->offset[i] = ctx->idx;
David S. Miller7a12b502017-04-17 18:44:36 -07001456 if (ret)
1457 return ret;
1458 }
1459 return 0;
1460}
1461
1462static void jit_fill_hole(void *area, unsigned int size)
1463{
1464 u32 *ptr;
1465 /* We are guaranteed to have aligned memory. */
1466 for (ptr = area; size >= sizeof(u32); size -= sizeof(u32))
1467 *ptr++ = 0x91d02005; /* ta 5 */
1468}
1469
1470struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog)
1471{
1472 struct bpf_prog *tmp, *orig_prog = prog;
1473 struct bpf_binary_header *header;
1474 bool tmp_blinded = false;
1475 struct jit_ctx ctx;
1476 u32 image_size;
1477 u8 *image_ptr;
1478 int pass;
1479
1480 if (!bpf_jit_enable)
1481 return orig_prog;
1482
1483 tmp = bpf_jit_blind_constants(prog);
1484 /* If blinding was requested and we failed during blinding,
1485 * we must fall back to the interpreter.
1486 */
1487 if (IS_ERR(tmp))
1488 return orig_prog;
1489 if (tmp != prog) {
1490 tmp_blinded = true;
1491 prog = tmp;
1492 }
1493
1494 memset(&ctx, 0, sizeof(ctx));
1495 ctx.prog = prog;
1496
1497 ctx.offset = kcalloc(prog->len, sizeof(unsigned int), GFP_KERNEL);
1498 if (ctx.offset == NULL) {
1499 prog = orig_prog;
1500 goto out;
1501 }
1502
1503 /* Fake pass to detect features used, and get an accurate assessment
1504 * of what the final image size will be.
1505 */
1506 if (build_body(&ctx)) {
1507 prog = orig_prog;
1508 goto out_off;
1509 }
1510 build_prologue(&ctx);
1511 build_epilogue(&ctx);
1512
1513 /* Now we know the actual image size. */
1514 image_size = sizeof(u32) * ctx.idx;
1515 header = bpf_jit_binary_alloc(image_size, &image_ptr,
1516 sizeof(u32), jit_fill_hole);
1517 if (header == NULL) {
1518 prog = orig_prog;
1519 goto out_off;
1520 }
1521
1522 ctx.image = (u32 *)image_ptr;
1523
1524 for (pass = 1; pass < 3; pass++) {
1525 ctx.idx = 0;
1526
1527 build_prologue(&ctx);
1528
1529 if (build_body(&ctx)) {
1530 bpf_jit_binary_free(header);
1531 prog = orig_prog;
1532 goto out_off;
1533 }
1534
1535 build_epilogue(&ctx);
1536
1537 if (bpf_jit_enable > 1)
1538 pr_info("Pass %d: shrink = %d, seen = [%c%c%c%c%c%c%c]\n", pass,
1539 image_size - (ctx.idx * 4),
1540 ctx.tmp_1_used ? '1' : ' ',
1541 ctx.tmp_2_used ? '2' : ' ',
1542 ctx.tmp_3_used ? '3' : ' ',
1543 ctx.saw_ld_abs_ind ? 'L' : ' ',
1544 ctx.saw_frame_pointer ? 'F' : ' ',
1545 ctx.saw_call ? 'C' : ' ',
1546 ctx.saw_tail_call ? 'T' : ' ');
1547 }
1548
1549 if (bpf_jit_enable > 1)
1550 bpf_jit_dump(prog->len, image_size, pass, ctx.image);
1551
1552 bpf_flush_icache(header, (u8 *)header + (header->pages * PAGE_SIZE));
1553
1554 bpf_jit_binary_lock_ro(header);
1555
1556 prog->bpf_func = (void *)ctx.image;
1557 prog->jited = 1;
1558
1559out_off:
1560 kfree(ctx.offset);
1561out:
1562 if (tmp_blinded)
1563 bpf_jit_prog_release_other(prog, prog == orig_prog ?
1564 tmp : orig_prog);
1565 return prog;
1566}