1 // SPDX-License-Identifier: GPL-2.0
2 /*
3 * BPF Jit compiler for s390.
4 *
5 * Minimum build requirements:
6 *
7 * - HAVE_MARCH_Z196_FEATURES: laal, laalg
8 * - HAVE_MARCH_Z10_FEATURES: msfi, cgrj, clgrj
9 * - HAVE_MARCH_Z9_109_FEATURES: alfi, llilf, clfi, oilf, nilf
10 * - 64BIT
11 *
12 * Copyright IBM Corp. 2012,2015
13 *
14 * Author(s): Martin Schwidefsky <schwidefsky@de.ibm.com>
15 * Michael Holzheu <holzheu@linux.vnet.ibm.com>
16 */
17
18 #define pr_fmt(fmt) "bpf_jit: " fmt
19
20 #include <linux/netdevice.h>
21 #include <linux/filter.h>
22 #include <linux/init.h>
23 #include <linux/bpf.h>
24 #include <linux/mm.h>
25 #include <linux/kernel.h>
26 #include <asm/cacheflush.h>
27 #include <asm/extable.h>
28 #include <asm/dis.h>
29 #include <asm/facility.h>
30 #include <asm/lowcore.h>
31 #include <asm/nospec-branch.h>
32 #include <asm/set_memory.h>
33 #include <asm/text-patching.h>
34 #include <asm/unwind.h>
35
36 struct bpf_jit {
37 u32 seen; /* Flags to remember seen eBPF instructions */
38 u16 seen_regs; /* Mask to remember which registers are used */
39 u32 *addrs; /* Array with relative instruction addresses */
40 u8 *prg_buf; /* Start of program */
41 int size; /* Size of program and literal pool */
42 int size_prg; /* Size of program */
43 int prg; /* Current position in program */
44 int lit32_start; /* Start of 32-bit literal pool */
45 int lit32; /* Current position in 32-bit literal pool */
46 int lit64_start; /* Start of 64-bit literal pool */
47 int lit64; /* Current position in 64-bit literal pool */
48 int base_ip; /* Base address for literal pool */
49 int exit_ip; /* Address of exit */
50 int tail_call_start; /* Tail call start offset */
51 int excnt; /* Number of exception table entries */
52 int prologue_plt_ret; /* Return address for prologue hotpatch PLT */
53 int prologue_plt; /* Start of prologue hotpatch PLT */
54 int kern_arena; /* Pool offset of kernel arena address */
55 u64 user_arena; /* User arena address */
56 u32 frame_off; /* Offset of struct bpf_prog from %r15 */
57 };
58
59 #define SEEN_MEM BIT(0) /* use mem[] for temporary storage */
60 #define SEEN_LITERAL BIT(1) /* code uses literals */
61 #define SEEN_FUNC BIT(2) /* calls C functions */
62 #define SEEN_STACK (SEEN_FUNC | SEEN_MEM)
63
64 #define NVREGS 0xffc0 /* %r6-%r15 */
65
66 /*
67 * s390 registers
68 */
69 #define REG_W0 (MAX_BPF_JIT_REG + 0) /* Work register 1 (even) */
70 #define REG_W1 (MAX_BPF_JIT_REG + 1) /* Work register 2 (odd) */
71 #define REG_L (MAX_BPF_JIT_REG + 2) /* Literal pool register */
72 #define REG_15 (MAX_BPF_JIT_REG + 3) /* Register 15 */
73 #define REG_0 REG_W0 /* Register 0 */
74 #define REG_1 REG_W1 /* Register 1 */
75 #define REG_2 BPF_REG_1 /* Register 2 */
76 #define REG_3 BPF_REG_2 /* Register 3 */
77 #define REG_4 BPF_REG_3 /* Register 4 */
78 #define REG_7 BPF_REG_6 /* Register 7 */
79 #define REG_8 BPF_REG_7 /* Register 8 */
80 #define REG_14 BPF_REG_0 /* Register 14 */
81
82 /*
83 * Mapping of BPF registers to s390 registers
84 */
85 static const int reg2hex[] = {
86 /* Return code */
87 [BPF_REG_0] = 14,
88 /* Function parameters */
89 [BPF_REG_1] = 2,
90 [BPF_REG_2] = 3,
91 [BPF_REG_3] = 4,
92 [BPF_REG_4] = 5,
93 [BPF_REG_5] = 6,
94 /* Call saved registers */
95 [BPF_REG_6] = 7,
96 [BPF_REG_7] = 8,
97 [BPF_REG_8] = 9,
98 [BPF_REG_9] = 10,
99 /* BPF stack pointer */
100 [BPF_REG_FP] = 13,
101 /* Register for blinding */
102 [BPF_REG_AX] = 12,
103 /* Work registers for s390x backend */
104 [REG_W0] = 0,
105 [REG_W1] = 1,
106 [REG_L] = 11,
107 [REG_15] = 15,
108 };
109
reg(u32 dst_reg,u32 src_reg)110 static inline u32 reg(u32 dst_reg, u32 src_reg)
111 {
112 return reg2hex[dst_reg] << 4 | reg2hex[src_reg];
113 }
114
reg_high(u32 reg)115 static inline u32 reg_high(u32 reg)
116 {
117 return reg2hex[reg] << 4;
118 }
119
reg_set_seen(struct bpf_jit * jit,u32 b1)120 static inline void reg_set_seen(struct bpf_jit *jit, u32 b1)
121 {
122 u32 r1 = reg2hex[b1];
123
124 if (r1 >= 6 && r1 <= 15)
125 jit->seen_regs |= (1 << r1);
126 }
127
off_to_pcrel(struct bpf_jit * jit,u32 off)128 static s32 off_to_pcrel(struct bpf_jit *jit, u32 off)
129 {
130 return off - jit->prg;
131 }
132
ptr_to_pcrel(struct bpf_jit * jit,const void * ptr)133 static s64 ptr_to_pcrel(struct bpf_jit *jit, const void *ptr)
134 {
135 if (jit->prg_buf)
136 return (const u8 *)ptr - ((const u8 *)jit->prg_buf + jit->prg);
137 return 0;
138 }
139
140 #define REG_SET_SEEN(b1) \
141 ({ \
142 reg_set_seen(jit, b1); \
143 })
144
145 /*
146 * EMIT macros for code generation
147 */
148
149 #define _EMIT2(op) \
150 ({ \
151 if (jit->prg_buf) \
152 *(u16 *) (jit->prg_buf + jit->prg) = (op); \
153 jit->prg += 2; \
154 })
155
156 #define EMIT2(op, b1, b2) \
157 ({ \
158 _EMIT2((op) | reg(b1, b2)); \
159 REG_SET_SEEN(b1); \
160 REG_SET_SEEN(b2); \
161 })
162
163 #define _EMIT4(op) \
164 ({ \
165 if (jit->prg_buf) \
166 *(u32 *) (jit->prg_buf + jit->prg) = (op); \
167 jit->prg += 4; \
168 })
169
170 #define EMIT4(op, b1, b2) \
171 ({ \
172 _EMIT4((op) | reg(b1, b2)); \
173 REG_SET_SEEN(b1); \
174 REG_SET_SEEN(b2); \
175 })
176
177 #define EMIT4_RRF(op, b1, b2, b3) \
178 ({ \
179 _EMIT4((op) | reg_high(b3) << 8 | reg(b1, b2)); \
180 REG_SET_SEEN(b1); \
181 REG_SET_SEEN(b2); \
182 REG_SET_SEEN(b3); \
183 })
184
185 #define _EMIT4_DISP(op, disp) \
186 ({ \
187 unsigned int __disp = (disp) & 0xfff; \
188 _EMIT4((op) | __disp); \
189 })
190
191 #define EMIT4_DISP(op, b1, b2, disp) \
192 ({ \
193 _EMIT4_DISP((op) | reg_high(b1) << 16 | \
194 reg_high(b2) << 8, (disp)); \
195 REG_SET_SEEN(b1); \
196 REG_SET_SEEN(b2); \
197 })
198
199 #define EMIT4_IMM(op, b1, imm) \
200 ({ \
201 unsigned int __imm = (imm) & 0xffff; \
202 _EMIT4((op) | reg_high(b1) << 16 | __imm); \
203 REG_SET_SEEN(b1); \
204 })
205
206 #define EMIT4_PCREL(op, pcrel) \
207 ({ \
208 long __pcrel = ((pcrel) >> 1) & 0xffff; \
209 _EMIT4((op) | __pcrel); \
210 })
211
212 #define EMIT4_PCREL_RIC(op, mask, target) \
213 ({ \
214 int __rel = off_to_pcrel(jit, target) / 2; \
215 _EMIT4((op) | (mask) << 20 | (__rel & 0xffff)); \
216 })
217
218 #define _EMIT6(op1, op2) \
219 ({ \
220 if (jit->prg_buf) { \
221 *(u32 *) (jit->prg_buf + jit->prg) = (op1); \
222 *(u16 *) (jit->prg_buf + jit->prg + 4) = (op2); \
223 } \
224 jit->prg += 6; \
225 })
226
227 #define _EMIT6_DISP(op1, op2, disp) \
228 ({ \
229 unsigned int __disp = (disp) & 0xfff; \
230 _EMIT6((op1) | __disp, op2); \
231 })
232
233 #define _EMIT6_DISP_LH(op1, op2, disp) \
234 ({ \
235 u32 _disp = (u32) (disp); \
236 unsigned int __disp_h = _disp & 0xff000; \
237 unsigned int __disp_l = _disp & 0x00fff; \
238 _EMIT6((op1) | __disp_l, (op2) | __disp_h >> 4); \
239 })
240
241 #define EMIT6_DISP_LH(op1, op2, b1, b2, b3, disp) \
242 ({ \
243 _EMIT6_DISP_LH((op1) | reg(b1, b2) << 16 | \
244 reg_high(b3) << 8, op2, disp); \
245 REG_SET_SEEN(b1); \
246 REG_SET_SEEN(b2); \
247 REG_SET_SEEN(b3); \
248 })
249
250 #define EMIT6_PCREL_RIEB(op1, op2, b1, b2, mask, target) \
251 ({ \
252 unsigned int rel = off_to_pcrel(jit, target) / 2; \
253 _EMIT6((op1) | reg(b1, b2) << 16 | (rel & 0xffff), \
254 (op2) | (mask) << 12); \
255 REG_SET_SEEN(b1); \
256 REG_SET_SEEN(b2); \
257 })
258
259 #define EMIT6_PCREL_RIEC(op1, op2, b1, imm, mask, target) \
260 ({ \
261 unsigned int rel = off_to_pcrel(jit, target) / 2; \
262 _EMIT6((op1) | (reg_high(b1) | (mask)) << 16 | \
263 (rel & 0xffff), (op2) | ((imm) & 0xff) << 8); \
264 REG_SET_SEEN(b1); \
265 BUILD_BUG_ON(((unsigned long) (imm)) > 0xff); \
266 })
267
268 #define EMIT6_PCREL(op1, op2, b1, b2, i, off, mask) \
269 ({ \
270 int rel = off_to_pcrel(jit, addrs[(i) + (off) + 1]) / 2;\
271 _EMIT6((op1) | reg(b1, b2) << 16 | (rel & 0xffff), (op2) | (mask));\
272 REG_SET_SEEN(b1); \
273 REG_SET_SEEN(b2); \
274 })
275
emit6_pcrel_ril(struct bpf_jit * jit,u32 op,s64 pcrel)276 static void emit6_pcrel_ril(struct bpf_jit *jit, u32 op, s64 pcrel)
277 {
278 u32 pc32dbl = (s32)(pcrel / 2);
279
280 _EMIT6(op | pc32dbl >> 16, pc32dbl & 0xffff);
281 }
282
emit6_pcrel_rilb(struct bpf_jit * jit,u32 op,u8 b,s64 pcrel)283 static void emit6_pcrel_rilb(struct bpf_jit *jit, u32 op, u8 b, s64 pcrel)
284 {
285 emit6_pcrel_ril(jit, op | reg_high(b) << 16, pcrel);
286 REG_SET_SEEN(b);
287 }
288
289 #define EMIT6_PCREL_RILB(op, b, target) \
290 emit6_pcrel_rilb(jit, op, b, off_to_pcrel(jit, target))
291
292 #define EMIT6_PCREL_RILB_PTR(op, b, target_ptr) \
293 emit6_pcrel_rilb(jit, op, b, ptr_to_pcrel(jit, target_ptr))
294
emit6_pcrel_rilc(struct bpf_jit * jit,u32 op,u8 mask,s64 pcrel)295 static void emit6_pcrel_rilc(struct bpf_jit *jit, u32 op, u8 mask, s64 pcrel)
296 {
297 emit6_pcrel_ril(jit, op | mask << 20, pcrel);
298 }
299
300 #define EMIT6_PCREL_RILC(op, mask, target) \
301 emit6_pcrel_rilc(jit, op, mask, off_to_pcrel(jit, target))
302
303 #define EMIT6_PCREL_RILC_PTR(op, mask, target_ptr) \
304 emit6_pcrel_rilc(jit, op, mask, ptr_to_pcrel(jit, target_ptr))
305
306 #define _EMIT6_IMM(op, imm) \
307 ({ \
308 unsigned int __imm = (imm); \
309 _EMIT6((op) | (__imm >> 16), __imm & 0xffff); \
310 })
311
312 #define EMIT6_IMM(op, b1, imm) \
313 ({ \
314 _EMIT6_IMM((op) | reg_high(b1) << 16, imm); \
315 REG_SET_SEEN(b1); \
316 })
317
318 #define _EMIT_CONST_U32(val) \
319 ({ \
320 unsigned int ret; \
321 ret = jit->lit32; \
322 if (jit->prg_buf) \
323 *(u32 *)(jit->prg_buf + jit->lit32) = (u32)(val);\
324 jit->lit32 += 4; \
325 ret; \
326 })
327
328 #define EMIT_CONST_U32(val) \
329 ({ \
330 jit->seen |= SEEN_LITERAL; \
331 _EMIT_CONST_U32(val) - jit->base_ip; \
332 })
333
334 #define _EMIT_CONST_U64(val) \
335 ({ \
336 unsigned int ret; \
337 ret = jit->lit64; \
338 if (jit->prg_buf) \
339 *(u64 *)(jit->prg_buf + jit->lit64) = (u64)(val);\
340 jit->lit64 += 8; \
341 ret; \
342 })
343
344 #define EMIT_CONST_U64(val) \
345 ({ \
346 jit->seen |= SEEN_LITERAL; \
347 _EMIT_CONST_U64(val) - jit->base_ip; \
348 })
349
350 #define EMIT_ZERO(b1) \
351 ({ \
352 if (!fp->aux->verifier_zext) { \
353 /* llgfr %dst,%dst (zero extend to 64 bit) */ \
354 EMIT4(0xb9160000, b1, b1); \
355 REG_SET_SEEN(b1); \
356 } \
357 })
358
359 /*
360 * Return whether this is the first pass. The first pass is special, since we
361 * don't know any sizes yet, and thus must be conservative.
362 */
is_first_pass(struct bpf_jit * jit)363 static bool is_first_pass(struct bpf_jit *jit)
364 {
365 return jit->size == 0;
366 }
367
368 /*
369 * Return whether this is the code generation pass. The code generation pass is
370 * special, since we should change as little as possible.
371 */
is_codegen_pass(struct bpf_jit * jit)372 static bool is_codegen_pass(struct bpf_jit *jit)
373 {
374 return jit->prg_buf;
375 }
376
377 /*
378 * Return whether "rel" can be encoded as a short PC-relative offset
379 */
is_valid_rel(int rel)380 static bool is_valid_rel(int rel)
381 {
382 return rel >= -65536 && rel <= 65534;
383 }
384
385 /*
386 * Return whether "off" can be reached using a short PC-relative offset
387 */
can_use_rel(struct bpf_jit * jit,int off)388 static bool can_use_rel(struct bpf_jit *jit, int off)
389 {
390 return is_valid_rel(off - jit->prg);
391 }
392
393 /*
394 * Return whether given displacement can be encoded using
395 * Long-Displacement Facility
396 */
is_valid_ldisp(int disp)397 static bool is_valid_ldisp(int disp)
398 {
399 return disp >= -524288 && disp <= 524287;
400 }
401
402 /*
403 * Return whether the next 32-bit literal pool entry can be referenced using
404 * Long-Displacement Facility
405 */
can_use_ldisp_for_lit32(struct bpf_jit * jit)406 static bool can_use_ldisp_for_lit32(struct bpf_jit *jit)
407 {
408 return is_valid_ldisp(jit->lit32 - jit->base_ip);
409 }
410
411 /*
412 * Return whether the next 64-bit literal pool entry can be referenced using
413 * Long-Displacement Facility
414 */
can_use_ldisp_for_lit64(struct bpf_jit * jit)415 static bool can_use_ldisp_for_lit64(struct bpf_jit *jit)
416 {
417 return is_valid_ldisp(jit->lit64 - jit->base_ip);
418 }
419
420 /*
421 * Fill whole space with illegal instructions
422 */
jit_fill_hole(void * area,unsigned int size)423 static void jit_fill_hole(void *area, unsigned int size)
424 {
425 memset(area, 0, size);
426 }
427
428 /*
429 * Caller-allocated part of the frame.
430 * Thanks to packed stack, its otherwise unused initial part can be used for
431 * the BPF stack and for the next frame.
432 */
433 struct prog_frame {
434 u64 unused[8];
435 /* BPF stack starts here and grows towards 0 */
436 u32 tail_call_cnt;
437 u32 pad;
438 u64 r6[10]; /* r6 - r15 */
439 u64 backchain;
440 } __packed;
441
442 /*
443 * Save registers from "rs" (register start) to "re" (register end) on stack
444 */
save_regs(struct bpf_jit * jit,u32 rs,u32 re)445 static void save_regs(struct bpf_jit *jit, u32 rs, u32 re)
446 {
447 u32 off = offsetof(struct prog_frame, r6) + (rs - 6) * 8;
448
449 if (rs == re)
450 /* stg %rs,off(%r15) */
451 _EMIT6(0xe300f000 | rs << 20 | off, 0x0024);
452 else
453 /* stmg %rs,%re,off(%r15) */
454 _EMIT6_DISP(0xeb00f000 | rs << 20 | re << 16, 0x0024, off);
455 }
456
457 /*
458 * Restore registers from "rs" (register start) to "re" (register end) on stack
459 */
restore_regs(struct bpf_jit * jit,u32 rs,u32 re)460 static void restore_regs(struct bpf_jit *jit, u32 rs, u32 re)
461 {
462 u32 off = jit->frame_off + offsetof(struct prog_frame, r6) + (rs - 6) * 8;
463
464 if (rs == re)
465 /* lg %rs,off(%r15) */
466 _EMIT6(0xe300f000 | rs << 20 | off, 0x0004);
467 else
468 /* lmg %rs,%re,off(%r15) */
469 _EMIT6_DISP(0xeb00f000 | rs << 20 | re << 16, 0x0004, off);
470 }
471
472 /*
473 * Return first seen register (from start)
474 */
get_start(u16 seen_regs,int start)475 static int get_start(u16 seen_regs, int start)
476 {
477 int i;
478
479 for (i = start; i <= 15; i++) {
480 if (seen_regs & (1 << i))
481 return i;
482 }
483 return 0;
484 }
485
486 /*
487 * Return last seen register (from start) (gap >= 2)
488 */
get_end(u16 seen_regs,int start)489 static int get_end(u16 seen_regs, int start)
490 {
491 int i;
492
493 for (i = start; i < 15; i++) {
494 if (!(seen_regs & (3 << i)))
495 return i - 1;
496 }
497 return (seen_regs & (1 << 15)) ? 15 : 14;
498 }
499
500 #define REGS_SAVE 1
501 #define REGS_RESTORE 0
502 /*
503 * Save and restore clobbered registers (6-15) on stack.
504 * We save/restore registers in chunks with gap >= 2 registers.
505 */
save_restore_regs(struct bpf_jit * jit,int op,u16 extra_regs)506 static void save_restore_regs(struct bpf_jit *jit, int op, u16 extra_regs)
507 {
508 u16 seen_regs = jit->seen_regs | extra_regs;
509 const int last = 15, save_restore_size = 6;
510 int re = 6, rs;
511
512 if (is_first_pass(jit)) {
513 /*
514 * We don't know yet which registers are used. Reserve space
515 * conservatively.
516 */
517 jit->prg += (last - re + 1) * save_restore_size;
518 return;
519 }
520
521 do {
522 rs = get_start(seen_regs, re);
523 if (!rs)
524 break;
525 re = get_end(seen_regs, rs + 1);
526 if (op == REGS_SAVE)
527 save_regs(jit, rs, re);
528 else
529 restore_regs(jit, rs, re);
530 re++;
531 } while (re <= last);
532 }
533
bpf_skip(struct bpf_jit * jit,int size)534 static void bpf_skip(struct bpf_jit *jit, int size)
535 {
536 if (size >= 6 && !is_valid_rel(size)) {
537 /* brcl 0xf,size */
538 EMIT6_PCREL_RILC(0xc0040000, 0xf, size);
539 size -= 6;
540 } else if (size >= 4 && is_valid_rel(size)) {
541 /* brc 0xf,size */
542 EMIT4_PCREL(0xa7f40000, size);
543 size -= 4;
544 }
545 while (size >= 2) {
546 /* bcr 0,%0 */
547 _EMIT2(0x0700);
548 size -= 2;
549 }
550 }
551
552 /*
553 * PLT for hotpatchable calls. The calling convention is the same as for the
554 * ftrace hotpatch trampolines: %r0 is return address, %r1 is clobbered.
555 */
556 struct bpf_plt {
557 char code[16];
558 void *ret;
559 void *target;
560 } __packed;
561 extern const struct bpf_plt bpf_plt;
562 asm(
563 ".pushsection .rodata\n"
564 " .balign 8\n"
565 "bpf_plt:\n"
566 " lgrl %r0,bpf_plt_ret\n"
567 " lgrl %r1,bpf_plt_target\n"
568 " br %r1\n"
569 " .balign 8\n"
570 "bpf_plt_ret: .quad 0\n"
571 "bpf_plt_target: .quad 0\n"
572 " .popsection\n"
573 );
574
bpf_jit_plt(struct bpf_plt * plt,void * ret,void * target)575 static void bpf_jit_plt(struct bpf_plt *plt, void *ret, void *target)
576 {
577 memcpy(plt, &bpf_plt, sizeof(*plt));
578 plt->ret = ret;
579 /*
580 * (target == NULL) implies that the branch to this PLT entry was
581 * patched and became a no-op. However, some CPU could have jumped
582 * to this PLT entry before patching and may be still executing it.
583 *
584 * Since the intention in this case is to make the PLT entry a no-op,
585 * make the target point to the return label instead of NULL.
586 */
587 plt->target = target ?: ret;
588 }
589
590 /*
591 * Emit function prologue
592 *
593 * Save registers and create stack frame if necessary.
594 * Stack frame layout is described by struct prog_frame.
595 */
bpf_jit_prologue(struct bpf_jit * jit,struct bpf_prog * fp)596 static void bpf_jit_prologue(struct bpf_jit *jit, struct bpf_prog *fp)
597 {
598 BUILD_BUG_ON(sizeof(struct prog_frame) != STACK_FRAME_OVERHEAD);
599
600 /* No-op for hotpatching */
601 /* brcl 0,prologue_plt */
602 EMIT6_PCREL_RILC(0xc0040000, 0, jit->prologue_plt);
603 jit->prologue_plt_ret = jit->prg;
604
605 if (!bpf_is_subprog(fp)) {
606 /* Initialize the tail call counter in the main program. */
607 /* xc tail_call_cnt(4,%r15),tail_call_cnt(%r15) */
608 _EMIT6(0xd703f000 | offsetof(struct prog_frame, tail_call_cnt),
609 0xf000 | offsetof(struct prog_frame, tail_call_cnt));
610 } else {
611 /*
612 * Skip the tail call counter initialization in subprograms.
613 * Insert nops in order to have tail_call_start at a
614 * predictable offset.
615 */
616 bpf_skip(jit, 6);
617 }
618 /* Tail calls have to skip above initialization */
619 jit->tail_call_start = jit->prg;
620 if (fp->aux->exception_cb) {
621 /*
622 * Switch stack, the new address is in the 2nd parameter.
623 *
624 * Arrange the restoration of %r6-%r15 in the epilogue.
625 * Do not restore them now, the prog does not need them.
626 */
627 /* lgr %r15,%r3 */
628 EMIT4(0xb9040000, REG_15, REG_3);
629 jit->seen_regs |= NVREGS;
630 } else {
631 /* Save registers */
632 save_restore_regs(jit, REGS_SAVE,
633 fp->aux->exception_boundary ? NVREGS : 0);
634 }
635 /* Setup literal pool */
636 if (is_first_pass(jit) || (jit->seen & SEEN_LITERAL)) {
637 if (!is_first_pass(jit) &&
638 is_valid_ldisp(jit->size - (jit->prg + 2))) {
639 /* basr %l,0 */
640 EMIT2(0x0d00, REG_L, REG_0);
641 jit->base_ip = jit->prg;
642 } else {
643 /* larl %l,lit32_start */
644 EMIT6_PCREL_RILB(0xc0000000, REG_L, jit->lit32_start);
645 jit->base_ip = jit->lit32_start;
646 }
647 }
648 /* Setup stack and backchain */
649 if (is_first_pass(jit) || (jit->seen & SEEN_STACK)) {
650 /* lgr %w1,%r15 (backchain) */
651 EMIT4(0xb9040000, REG_W1, REG_15);
652 /* la %bfp,unused_end(%r15) (BPF frame pointer) */
653 EMIT4_DISP(0x41000000, BPF_REG_FP, REG_15,
654 offsetofend(struct prog_frame, unused));
655 /* aghi %r15,-frame_off */
656 EMIT4_IMM(0xa70b0000, REG_15, -jit->frame_off);
657 /* stg %w1,backchain(%r15) */
658 EMIT6_DISP_LH(0xe3000000, 0x0024, REG_W1, REG_0,
659 REG_15,
660 offsetof(struct prog_frame, backchain));
661 }
662 }
663
664 /*
665 * Jump using a register either directly or via an expoline thunk
666 */
667 #define EMIT_JUMP_REG(reg) do { \
668 if (nospec_uses_trampoline()) \
669 /* brcl 0xf,__s390_indirect_jump_rN */ \
670 EMIT6_PCREL_RILC_PTR(0xc0040000, 0x0f, \
671 __s390_indirect_jump_r ## reg); \
672 else \
673 /* br %rN */ \
674 _EMIT2(0x07f0 | reg); \
675 } while (0)
676
677 /*
678 * Function epilogue
679 */
bpf_jit_epilogue(struct bpf_jit * jit)680 static void bpf_jit_epilogue(struct bpf_jit *jit)
681 {
682 jit->exit_ip = jit->prg;
683 /* Load exit code: lgr %r2,%b0 */
684 EMIT4(0xb9040000, REG_2, BPF_REG_0);
685 /* Restore registers */
686 save_restore_regs(jit, REGS_RESTORE, 0);
687 EMIT_JUMP_REG(14);
688
689 jit->prg = ALIGN(jit->prg, 8);
690 jit->prologue_plt = jit->prg;
691 if (jit->prg_buf)
692 bpf_jit_plt((struct bpf_plt *)(jit->prg_buf + jit->prg),
693 jit->prg_buf + jit->prologue_plt_ret, NULL);
694 jit->prg += sizeof(struct bpf_plt);
695 }
696
ex_handler_bpf(const struct exception_table_entry * x,struct pt_regs * regs)697 bool ex_handler_bpf(const struct exception_table_entry *x, struct pt_regs *regs)
698 {
699 regs->psw.addr = extable_fixup(x);
700 if (x->data != -1)
701 regs->gprs[x->data] = 0;
702 return true;
703 }
704
705 /*
706 * A single BPF probe instruction
707 */
708 struct bpf_jit_probe {
709 int prg; /* JITed instruction offset */
710 int nop_prg; /* JITed nop offset */
711 int reg; /* Register to clear on exception */
712 int arena_reg; /* Register to use for arena addressing */
713 };
714
bpf_jit_probe_init(struct bpf_jit_probe * probe)715 static void bpf_jit_probe_init(struct bpf_jit_probe *probe)
716 {
717 probe->prg = -1;
718 probe->nop_prg = -1;
719 probe->reg = -1;
720 probe->arena_reg = REG_0;
721 }
722
723 /*
724 * Handlers of certain exceptions leave psw.addr pointing to the instruction
725 * directly after the failing one. Therefore, create two exception table
726 * entries and also add a nop in case two probing instructions come directly
727 * after each other.
728 */
bpf_jit_probe_emit_nop(struct bpf_jit * jit,struct bpf_jit_probe * probe)729 static void bpf_jit_probe_emit_nop(struct bpf_jit *jit,
730 struct bpf_jit_probe *probe)
731 {
732 if (probe->prg == -1 || probe->nop_prg != -1)
733 /* The probe is not armed or nop is already emitted. */
734 return;
735
736 probe->nop_prg = jit->prg;
737 /* bcr 0,%0 */
738 _EMIT2(0x0700);
739 }
740
bpf_jit_probe_load_pre(struct bpf_jit * jit,struct bpf_insn * insn,struct bpf_jit_probe * probe)741 static void bpf_jit_probe_load_pre(struct bpf_jit *jit, struct bpf_insn *insn,
742 struct bpf_jit_probe *probe)
743 {
744 if (BPF_MODE(insn->code) != BPF_PROBE_MEM &&
745 BPF_MODE(insn->code) != BPF_PROBE_MEMSX &&
746 BPF_MODE(insn->code) != BPF_PROBE_MEM32 &&
747 BPF_MODE(insn->code) != BPF_PROBE_ATOMIC)
748 return;
749
750 if (BPF_MODE(insn->code) == BPF_PROBE_MEM32 ||
751 BPF_MODE(insn->code) == BPF_PROBE_ATOMIC) {
752 /* lgrl %r1,kern_arena */
753 EMIT6_PCREL_RILB(0xc4080000, REG_W1, jit->kern_arena);
754 probe->arena_reg = REG_W1;
755 }
756 probe->prg = jit->prg;
757 probe->reg = reg2hex[insn->dst_reg];
758 }
759
bpf_jit_probe_store_pre(struct bpf_jit * jit,struct bpf_insn * insn,struct bpf_jit_probe * probe)760 static void bpf_jit_probe_store_pre(struct bpf_jit *jit, struct bpf_insn *insn,
761 struct bpf_jit_probe *probe)
762 {
763 if (BPF_MODE(insn->code) != BPF_PROBE_MEM32 &&
764 BPF_MODE(insn->code) != BPF_PROBE_ATOMIC)
765 return;
766
767 /* lgrl %r1,kern_arena */
768 EMIT6_PCREL_RILB(0xc4080000, REG_W1, jit->kern_arena);
769 probe->arena_reg = REG_W1;
770 probe->prg = jit->prg;
771 }
772
bpf_jit_probe_atomic_pre(struct bpf_jit * jit,struct bpf_insn * insn,struct bpf_jit_probe * probe)773 static void bpf_jit_probe_atomic_pre(struct bpf_jit *jit,
774 struct bpf_insn *insn,
775 struct bpf_jit_probe *probe)
776 {
777 int load_reg;
778
779 if (BPF_MODE(insn->code) != BPF_PROBE_ATOMIC)
780 return;
781
782 /* lgrl %r1,kern_arena */
783 EMIT6_PCREL_RILB(0xc4080000, REG_W1, jit->kern_arena);
784 /* agr %r1,%dst */
785 EMIT4(0xb9080000, REG_W1, insn->dst_reg);
786 probe->arena_reg = REG_W1;
787 probe->prg = jit->prg;
788 /*
789 * A read-modify-write carrying BPF_FETCH reads the old value into
790 * src_reg, or into r0 for a BPF_CMPXCHG. Clear that register on
791 * fault, the remaining atomics only write memory.
792 */
793 load_reg = bpf_atomic_load_reg(insn);
794 if (load_reg >= 0)
795 probe->reg = reg2hex[load_reg];
796 }
797
bpf_jit_probe_post(struct bpf_jit * jit,struct bpf_prog * fp,struct bpf_jit_probe * probe)798 static int bpf_jit_probe_post(struct bpf_jit *jit, struct bpf_prog *fp,
799 struct bpf_jit_probe *probe)
800 {
801 struct exception_table_entry *ex;
802 int i, prg;
803 s64 delta;
804 u8 *insn;
805
806 if (probe->prg == -1)
807 /* The probe is not armed. */
808 return 0;
809 bpf_jit_probe_emit_nop(jit, probe);
810 if (!fp->aux->extable)
811 /* Do nothing during early JIT passes. */
812 return 0;
813 insn = jit->prg_buf + probe->prg;
814 if (WARN_ON_ONCE(probe->prg + insn_length(*insn) != probe->nop_prg))
815 /* JIT bug - gap between probe and nop instructions. */
816 return -1;
817 for (i = 0; i < 2; i++) {
818 if (WARN_ON_ONCE(jit->excnt >= fp->aux->num_exentries))
819 /* Verifier bug - not enough entries. */
820 return -1;
821 ex = &fp->aux->extable[jit->excnt];
822 /* Add extable entries for probe and nop instructions. */
823 prg = i == 0 ? probe->prg : probe->nop_prg;
824 delta = jit->prg_buf + prg - (u8 *)&ex->insn;
825 if (WARN_ON_ONCE(delta < INT_MIN || delta > INT_MAX))
826 /* JIT bug - code and extable must be close. */
827 return -1;
828 ex->insn = delta;
829 /*
830 * Land on the current instruction. Note that the extable
831 * infrastructure ignores the fixup field; it is handled by
832 * ex_handler_bpf().
833 */
834 delta = jit->prg_buf + jit->prg - (u8 *)&ex->fixup;
835 if (WARN_ON_ONCE(delta < INT_MIN || delta > INT_MAX))
836 /* JIT bug - landing pad and extable must be close. */
837 return -1;
838 ex->fixup = delta;
839 ex->type = EX_TYPE_BPF;
840 ex->data = probe->reg;
841 jit->excnt++;
842 }
843 return 0;
844 }
845
emit_ldx(struct bpf_jit * jit,struct bpf_prog * fp,struct bpf_insn * insn)846 static int emit_ldx(struct bpf_jit *jit, struct bpf_prog *fp, struct bpf_insn *insn)
847 {
848 struct bpf_jit_probe probe;
849
850 bpf_jit_probe_init(&probe);
851 bpf_jit_probe_load_pre(jit, insn, &probe);
852
853 switch (BPF_SIZE(insn->code)) {
854 case BPF_B: /* dst = *(u8 *)(ul) (src + off) */
855 /* llgc %dst,off(%src,%arena) */
856 EMIT6_DISP_LH(0xe3000000, 0x0090, insn->dst_reg, insn->src_reg,
857 probe.arena_reg, insn->off);
858 break;
859 case BPF_H: /* dst = *(u16 *)(ul) (src + off) */
860 /* llgh %dst,off(%src,%arena) */
861 EMIT6_DISP_LH(0xe3000000, 0x0091, insn->dst_reg, insn->src_reg,
862 probe.arena_reg, insn->off);
863 break;
864 case BPF_W: /* dst = *(u32 *)(ul) (src + off) */
865 /* llgf %dst,off(%src,%arena) */
866 EMIT6_DISP_LH(0xe3000000, 0x0016, insn->dst_reg, insn->src_reg,
867 probe.arena_reg, insn->off);
868 break;
869 case BPF_DW: /* dst = *(u64 *)(ul) (src + off) */
870 /* lg %dst,off(%src,%arena) */
871 EMIT6_DISP_LH(0xe3000000, 0x0004, insn->dst_reg, insn->src_reg,
872 probe.arena_reg, insn->off);
873 break;
874 }
875
876 return bpf_jit_probe_post(jit, fp, &probe);
877 }
878
emit_stx(struct bpf_jit * jit,struct bpf_prog * fp,struct bpf_insn * insn)879 static int emit_stx(struct bpf_jit *jit, struct bpf_prog *fp, struct bpf_insn *insn)
880 {
881 struct bpf_jit_probe probe;
882
883 bpf_jit_probe_init(&probe);
884 bpf_jit_probe_store_pre(jit, insn, &probe);
885
886 switch (BPF_SIZE(insn->code)) {
887 case BPF_B: /* *(u8 *)(dst + off) = src_reg */
888 /* stcy %src,off(%dst,%arena) */
889 EMIT6_DISP_LH(0xe3000000, 0x0072, insn->src_reg, insn->dst_reg,
890 probe.arena_reg, insn->off);
891 break;
892 case BPF_H: /* (u16 *)(dst + off) = src */
893 /* sthy %src,off(%dst,%arena) */
894 EMIT6_DISP_LH(0xe3000000, 0x0070, insn->src_reg, insn->dst_reg,
895 probe.arena_reg, insn->off);
896 break;
897 case BPF_W: /* *(u32 *)(dst + off) = src */
898 /* sty %src,off(%dst,%arena) */
899 EMIT6_DISP_LH(0xe3000000, 0x0050, insn->src_reg, insn->dst_reg,
900 probe.arena_reg, insn->off);
901 break;
902 case BPF_DW: /* (u64 *)(dst + off) = src */
903 /* stg %src,off(%dst,%arena) */
904 EMIT6_DISP_LH(0xe3000000, 0x0024, insn->src_reg, insn->dst_reg,
905 probe.arena_reg, insn->off);
906 break;
907 }
908
909 return bpf_jit_probe_post(jit, fp, &probe);
910 }
911
912 /*
913 * Sign- or zero-extend the register if necessary
914 */
sign_zero_extend(struct bpf_jit * jit,int r,u8 size,u8 flags)915 static int sign_zero_extend(struct bpf_jit *jit, int r, u8 size, u8 flags)
916 {
917 switch (size) {
918 case 1:
919 if (flags & BTF_FMODEL_SIGNED_ARG)
920 /* lgbr %r,%r */
921 EMIT4(0xb9060000, r, r);
922 else
923 /* llgcr %r,%r */
924 EMIT4(0xb9840000, r, r);
925 return 0;
926 case 2:
927 if (flags & BTF_FMODEL_SIGNED_ARG)
928 /* lghr %r,%r */
929 EMIT4(0xb9070000, r, r);
930 else
931 /* llghr %r,%r */
932 EMIT4(0xb9850000, r, r);
933 return 0;
934 case 4:
935 if (flags & BTF_FMODEL_SIGNED_ARG)
936 /* lgfr %r,%r */
937 EMIT4(0xb9140000, r, r);
938 else
939 /* llgfr %r,%r */
940 EMIT4(0xb9160000, r, r);
941 return 0;
942 case 8:
943 return 0;
944 default:
945 return -1;
946 }
947 }
948
949 /*
950 * Compile one eBPF instruction into s390x code
951 *
952 * NOTE: Use noinline because for gcov (-fprofile-arcs) gcc allocates a lot of
953 * stack space for the large switch statement.
954 */
bpf_jit_insn(struct bpf_jit * jit,struct bpf_prog * fp,int i,bool extra_pass)955 static noinline int bpf_jit_insn(struct bpf_jit *jit, struct bpf_prog *fp,
956 int i, bool extra_pass)
957 {
958 struct bpf_insn *insn = &fp->insnsi[i];
959 s32 branch_oc_off = insn->off;
960 u32 dst_reg = insn->dst_reg;
961 u32 src_reg = insn->src_reg;
962 struct bpf_jit_probe probe;
963 int last, insn_count = 1;
964 u32 *addrs = jit->addrs;
965 s32 imm = insn->imm;
966 s16 off = insn->off;
967 unsigned int mask;
968 int err;
969
970 bpf_jit_probe_init(&probe);
971
972 switch (insn->code) {
973 /*
974 * BPF_MOV
975 */
976 case BPF_ALU | BPF_MOV | BPF_X:
977 switch (insn->off) {
978 case 0: /* DST = (u32) SRC */
979 /* llgfr %dst,%src */
980 EMIT4(0xb9160000, dst_reg, src_reg);
981 if (insn_is_zext(&insn[1]))
982 insn_count = 2;
983 break;
984 case 8: /* DST = (u32)(s8) SRC */
985 /* lbr %dst,%src */
986 EMIT4(0xb9260000, dst_reg, src_reg);
987 /* llgfr %dst,%dst */
988 EMIT4(0xb9160000, dst_reg, dst_reg);
989 break;
990 case 16: /* DST = (u32)(s16) SRC */
991 /* lhr %dst,%src */
992 EMIT4(0xb9270000, dst_reg, src_reg);
993 /* llgfr %dst,%dst */
994 EMIT4(0xb9160000, dst_reg, dst_reg);
995 break;
996 }
997 break;
998 case BPF_ALU64 | BPF_MOV | BPF_X:
999 if (insn_is_cast_user(insn)) {
1000 int patch_brc;
1001
1002 /* ltgr %dst,%src */
1003 EMIT4(0xb9020000, dst_reg, src_reg);
1004 /* brc 8,0f */
1005 patch_brc = jit->prg;
1006 EMIT4_PCREL_RIC(0xa7040000, 8, 0);
1007 /* iihf %dst,user_arena>>32 */
1008 EMIT6_IMM(0xc0080000, dst_reg, jit->user_arena >> 32);
1009 /* 0: */
1010 if (jit->prg_buf)
1011 *(u16 *)(jit->prg_buf + patch_brc + 2) =
1012 (jit->prg - patch_brc) >> 1;
1013 break;
1014 }
1015 switch (insn->off) {
1016 case 0: /* DST = SRC */
1017 /* lgr %dst,%src */
1018 EMIT4(0xb9040000, dst_reg, src_reg);
1019 break;
1020 case 8: /* DST = (s8) SRC */
1021 /* lgbr %dst,%src */
1022 EMIT4(0xb9060000, dst_reg, src_reg);
1023 break;
1024 case 16: /* DST = (s16) SRC */
1025 /* lghr %dst,%src */
1026 EMIT4(0xb9070000, dst_reg, src_reg);
1027 break;
1028 case 32: /* DST = (s32) SRC */
1029 /* lgfr %dst,%src */
1030 EMIT4(0xb9140000, dst_reg, src_reg);
1031 break;
1032 }
1033 break;
1034 case BPF_ALU | BPF_MOV | BPF_K: /* dst = (u32) imm */
1035 /* llilf %dst,imm */
1036 EMIT6_IMM(0xc00f0000, dst_reg, imm);
1037 if (insn_is_zext(&insn[1]))
1038 insn_count = 2;
1039 break;
1040 case BPF_ALU64 | BPF_MOV | BPF_K: /* dst = imm */
1041 /* lgfi %dst,imm */
1042 EMIT6_IMM(0xc0010000, dst_reg, imm);
1043 break;
1044 /*
1045 * BPF_LD 64
1046 */
1047 case BPF_LD | BPF_IMM | BPF_DW: /* dst = (u64) imm */
1048 {
1049 /* 16 byte instruction that uses two 'struct bpf_insn' */
1050 u64 imm64;
1051
1052 imm64 = (u64)(u32) insn[0].imm | ((u64)(u32) insn[1].imm) << 32;
1053 /* lgrl %dst,imm */
1054 EMIT6_PCREL_RILB(0xc4080000, dst_reg, _EMIT_CONST_U64(imm64));
1055 insn_count = 2;
1056 break;
1057 }
1058 /*
1059 * BPF_ADD
1060 */
1061 case BPF_ALU | BPF_ADD | BPF_X: /* dst = (u32) dst + (u32) src */
1062 /* ar %dst,%src */
1063 EMIT2(0x1a00, dst_reg, src_reg);
1064 EMIT_ZERO(dst_reg);
1065 break;
1066 case BPF_ALU64 | BPF_ADD | BPF_X: /* dst = dst + src */
1067 /* agr %dst,%src */
1068 EMIT4(0xb9080000, dst_reg, src_reg);
1069 break;
1070 case BPF_ALU | BPF_ADD | BPF_K: /* dst = (u32) dst + (u32) imm */
1071 if (imm != 0) {
1072 /* alfi %dst,imm */
1073 EMIT6_IMM(0xc20b0000, dst_reg, imm);
1074 }
1075 EMIT_ZERO(dst_reg);
1076 break;
1077 case BPF_ALU64 | BPF_ADD | BPF_K: /* dst = dst + imm */
1078 if (!imm)
1079 break;
1080 /* agfi %dst,imm */
1081 EMIT6_IMM(0xc2080000, dst_reg, imm);
1082 break;
1083 /*
1084 * BPF_SUB
1085 */
1086 case BPF_ALU | BPF_SUB | BPF_X: /* dst = (u32) dst - (u32) src */
1087 /* sr %dst,%src */
1088 EMIT2(0x1b00, dst_reg, src_reg);
1089 EMIT_ZERO(dst_reg);
1090 break;
1091 case BPF_ALU64 | BPF_SUB | BPF_X: /* dst = dst - src */
1092 /* sgr %dst,%src */
1093 EMIT4(0xb9090000, dst_reg, src_reg);
1094 break;
1095 case BPF_ALU | BPF_SUB | BPF_K: /* dst = (u32) dst - (u32) imm */
1096 if (imm != 0) {
1097 /* alfi %dst,-imm */
1098 EMIT6_IMM(0xc20b0000, dst_reg, -imm);
1099 }
1100 EMIT_ZERO(dst_reg);
1101 break;
1102 case BPF_ALU64 | BPF_SUB | BPF_K: /* dst = dst - imm */
1103 if (!imm)
1104 break;
1105 if (imm == -0x80000000) {
1106 /* algfi %dst,0x80000000 */
1107 EMIT6_IMM(0xc20a0000, dst_reg, 0x80000000);
1108 } else {
1109 /* agfi %dst,-imm */
1110 EMIT6_IMM(0xc2080000, dst_reg, -imm);
1111 }
1112 break;
1113 /*
1114 * BPF_MUL
1115 */
1116 case BPF_ALU | BPF_MUL | BPF_X: /* dst = (u32) dst * (u32) src */
1117 /* msr %dst,%src */
1118 EMIT4(0xb2520000, dst_reg, src_reg);
1119 EMIT_ZERO(dst_reg);
1120 break;
1121 case BPF_ALU64 | BPF_MUL | BPF_X: /* dst = dst * src */
1122 /* msgr %dst,%src */
1123 EMIT4(0xb90c0000, dst_reg, src_reg);
1124 break;
1125 case BPF_ALU | BPF_MUL | BPF_K: /* dst = (u32) dst * (u32) imm */
1126 if (imm != 1) {
1127 /* msfi %r5,imm */
1128 EMIT6_IMM(0xc2010000, dst_reg, imm);
1129 }
1130 EMIT_ZERO(dst_reg);
1131 break;
1132 case BPF_ALU64 | BPF_MUL | BPF_K: /* dst = dst * imm */
1133 if (imm == 1)
1134 break;
1135 /* msgfi %dst,imm */
1136 EMIT6_IMM(0xc2000000, dst_reg, imm);
1137 break;
1138 /*
1139 * BPF_DIV / BPF_MOD
1140 */
1141 case BPF_ALU | BPF_DIV | BPF_X:
1142 case BPF_ALU | BPF_MOD | BPF_X:
1143 {
1144 int rc_reg = BPF_OP(insn->code) == BPF_DIV ? REG_W1 : REG_W0;
1145
1146 switch (off) {
1147 case 0: /* dst = (u32) dst {/,%} (u32) src */
1148 /* xr %w0,%w0 */
1149 EMIT2(0x1700, REG_W0, REG_W0);
1150 /* lr %w1,%dst */
1151 EMIT2(0x1800, REG_W1, dst_reg);
1152 /* dlr %w0,%src */
1153 EMIT4(0xb9970000, REG_W0, src_reg);
1154 break;
1155 case 1: /* dst = (u32) ((s32) dst {/,%} (s32) src) */
1156 /* lgfr %r1,%dst */
1157 EMIT4(0xb9140000, REG_W1, dst_reg);
1158 /* dsgfr %r0,%src */
1159 EMIT4(0xb91d0000, REG_W0, src_reg);
1160 break;
1161 }
1162 /* llgfr %dst,%rc */
1163 EMIT4(0xb9160000, dst_reg, rc_reg);
1164 if (insn_is_zext(&insn[1]))
1165 insn_count = 2;
1166 break;
1167 }
1168 case BPF_ALU64 | BPF_DIV | BPF_X:
1169 case BPF_ALU64 | BPF_MOD | BPF_X:
1170 {
1171 int rc_reg = BPF_OP(insn->code) == BPF_DIV ? REG_W1 : REG_W0;
1172
1173 switch (off) {
1174 case 0: /* dst = dst {/,%} src */
1175 /* lghi %w0,0 */
1176 EMIT4_IMM(0xa7090000, REG_W0, 0);
1177 /* lgr %w1,%dst */
1178 EMIT4(0xb9040000, REG_W1, dst_reg);
1179 /* dlgr %w0,%src */
1180 EMIT4(0xb9870000, REG_W0, src_reg);
1181 break;
1182 case 1: /* dst = (s64) dst {/,%} (s64) src */
1183 /* lgr %w1,%dst */
1184 EMIT4(0xb9040000, REG_W1, dst_reg);
1185 /* dsgr %w0,%src */
1186 EMIT4(0xb90d0000, REG_W0, src_reg);
1187 break;
1188 }
1189 /* lgr %dst,%rc */
1190 EMIT4(0xb9040000, dst_reg, rc_reg);
1191 break;
1192 }
1193 case BPF_ALU | BPF_DIV | BPF_K:
1194 case BPF_ALU | BPF_MOD | BPF_K:
1195 {
1196 int rc_reg = BPF_OP(insn->code) == BPF_DIV ? REG_W1 : REG_W0;
1197
1198 if (imm == 1) {
1199 if (BPF_OP(insn->code) == BPF_MOD)
1200 /* lghi %dst,0 */
1201 EMIT4_IMM(0xa7090000, dst_reg, 0);
1202 else
1203 EMIT_ZERO(dst_reg);
1204 break;
1205 }
1206 if (!is_first_pass(jit) && can_use_ldisp_for_lit32(jit)) {
1207 switch (off) {
1208 case 0: /* dst = (u32) dst {/,%} (u32) imm */
1209 /* xr %w0,%w0 */
1210 EMIT2(0x1700, REG_W0, REG_W0);
1211 /* lr %w1,%dst */
1212 EMIT2(0x1800, REG_W1, dst_reg);
1213 /* dl %w0,<d(imm)>(%l) */
1214 EMIT6_DISP_LH(0xe3000000, 0x0097, REG_W0, REG_0,
1215 REG_L, EMIT_CONST_U32(imm));
1216 break;
1217 case 1: /* dst = (s32) dst {/,%} (s32) imm */
1218 /* lgfr %r1,%dst */
1219 EMIT4(0xb9140000, REG_W1, dst_reg);
1220 /* dsgf %r0,<d(imm)>(%l) */
1221 EMIT6_DISP_LH(0xe3000000, 0x001d, REG_W0, REG_0,
1222 REG_L, EMIT_CONST_U32(imm));
1223 break;
1224 }
1225 } else {
1226 switch (off) {
1227 case 0: /* dst = (u32) dst {/,%} (u32) imm */
1228 /* xr %w0,%w0 */
1229 EMIT2(0x1700, REG_W0, REG_W0);
1230 /* lr %w1,%dst */
1231 EMIT2(0x1800, REG_W1, dst_reg);
1232 /* lrl %dst,imm */
1233 EMIT6_PCREL_RILB(0xc40d0000, dst_reg,
1234 _EMIT_CONST_U32(imm));
1235 jit->seen |= SEEN_LITERAL;
1236 /* dlr %w0,%dst */
1237 EMIT4(0xb9970000, REG_W0, dst_reg);
1238 break;
1239 case 1: /* dst = (s32) dst {/,%} (s32) imm */
1240 /* lgfr %w1,%dst */
1241 EMIT4(0xb9140000, REG_W1, dst_reg);
1242 /* lgfrl %dst,imm */
1243 EMIT6_PCREL_RILB(0xc40c0000, dst_reg,
1244 _EMIT_CONST_U32(imm));
1245 jit->seen |= SEEN_LITERAL;
1246 /* dsgr %w0,%dst */
1247 EMIT4(0xb90d0000, REG_W0, dst_reg);
1248 break;
1249 }
1250 }
1251 /* llgfr %dst,%rc */
1252 EMIT4(0xb9160000, dst_reg, rc_reg);
1253 if (insn_is_zext(&insn[1]))
1254 insn_count = 2;
1255 break;
1256 }
1257 case BPF_ALU64 | BPF_DIV | BPF_K:
1258 case BPF_ALU64 | BPF_MOD | BPF_K:
1259 {
1260 int rc_reg = BPF_OP(insn->code) == BPF_DIV ? REG_W1 : REG_W0;
1261
1262 if (imm == 1) {
1263 if (BPF_OP(insn->code) == BPF_MOD)
1264 /* lhgi %dst,0 */
1265 EMIT4_IMM(0xa7090000, dst_reg, 0);
1266 break;
1267 }
1268 if (!is_first_pass(jit) && can_use_ldisp_for_lit64(jit)) {
1269 switch (off) {
1270 case 0: /* dst = dst {/,%} imm */
1271 /* lghi %w0,0 */
1272 EMIT4_IMM(0xa7090000, REG_W0, 0);
1273 /* lgr %w1,%dst */
1274 EMIT4(0xb9040000, REG_W1, dst_reg);
1275 /* dlg %w0,<d(imm)>(%l) */
1276 EMIT6_DISP_LH(0xe3000000, 0x0087, REG_W0, REG_0,
1277 REG_L, EMIT_CONST_U64(imm));
1278 break;
1279 case 1: /* dst = (s64) dst {/,%} (s64) imm */
1280 /* lgr %w1,%dst */
1281 EMIT4(0xb9040000, REG_W1, dst_reg);
1282 /* dsg %w0,<d(imm)>(%l) */
1283 EMIT6_DISP_LH(0xe3000000, 0x000d, REG_W0, REG_0,
1284 REG_L, EMIT_CONST_U64(imm));
1285 break;
1286 }
1287 } else {
1288 switch (off) {
1289 case 0: /* dst = dst {/,%} imm */
1290 /* lghi %w0,0 */
1291 EMIT4_IMM(0xa7090000, REG_W0, 0);
1292 /* lgr %w1,%dst */
1293 EMIT4(0xb9040000, REG_W1, dst_reg);
1294 /* lgrl %dst,imm */
1295 EMIT6_PCREL_RILB(0xc4080000, dst_reg,
1296 _EMIT_CONST_U64(imm));
1297 jit->seen |= SEEN_LITERAL;
1298 /* dlgr %w0,%dst */
1299 EMIT4(0xb9870000, REG_W0, dst_reg);
1300 break;
1301 case 1: /* dst = (s64) dst {/,%} (s64) imm */
1302 /* lgr %w1,%dst */
1303 EMIT4(0xb9040000, REG_W1, dst_reg);
1304 /* lgrl %dst,imm */
1305 EMIT6_PCREL_RILB(0xc4080000, dst_reg,
1306 _EMIT_CONST_U64(imm));
1307 jit->seen |= SEEN_LITERAL;
1308 /* dsgr %w0,%dst */
1309 EMIT4(0xb90d0000, REG_W0, dst_reg);
1310 break;
1311 }
1312 }
1313 /* lgr %dst,%rc */
1314 EMIT4(0xb9040000, dst_reg, rc_reg);
1315 break;
1316 }
1317 /*
1318 * BPF_AND
1319 */
1320 case BPF_ALU | BPF_AND | BPF_X: /* dst = (u32) dst & (u32) src */
1321 /* nr %dst,%src */
1322 EMIT2(0x1400, dst_reg, src_reg);
1323 EMIT_ZERO(dst_reg);
1324 break;
1325 case BPF_ALU64 | BPF_AND | BPF_X: /* dst = dst & src */
1326 /* ngr %dst,%src */
1327 EMIT4(0xb9800000, dst_reg, src_reg);
1328 break;
1329 case BPF_ALU | BPF_AND | BPF_K: /* dst = (u32) dst & (u32) imm */
1330 /* nilf %dst,imm */
1331 EMIT6_IMM(0xc00b0000, dst_reg, imm);
1332 EMIT_ZERO(dst_reg);
1333 break;
1334 case BPF_ALU64 | BPF_AND | BPF_K: /* dst = dst & imm */
1335 if (!is_first_pass(jit) && can_use_ldisp_for_lit64(jit)) {
1336 /* ng %dst,<d(imm)>(%l) */
1337 EMIT6_DISP_LH(0xe3000000, 0x0080,
1338 dst_reg, REG_0, REG_L,
1339 EMIT_CONST_U64(imm));
1340 } else {
1341 /* lgrl %w0,imm */
1342 EMIT6_PCREL_RILB(0xc4080000, REG_W0,
1343 _EMIT_CONST_U64(imm));
1344 jit->seen |= SEEN_LITERAL;
1345 /* ngr %dst,%w0 */
1346 EMIT4(0xb9800000, dst_reg, REG_W0);
1347 }
1348 break;
1349 /*
1350 * BPF_OR
1351 */
1352 case BPF_ALU | BPF_OR | BPF_X: /* dst = (u32) dst | (u32) src */
1353 /* or %dst,%src */
1354 EMIT2(0x1600, dst_reg, src_reg);
1355 EMIT_ZERO(dst_reg);
1356 break;
1357 case BPF_ALU64 | BPF_OR | BPF_X: /* dst = dst | src */
1358 /* ogr %dst,%src */
1359 EMIT4(0xb9810000, dst_reg, src_reg);
1360 break;
1361 case BPF_ALU | BPF_OR | BPF_K: /* dst = (u32) dst | (u32) imm */
1362 /* oilf %dst,imm */
1363 EMIT6_IMM(0xc00d0000, dst_reg, imm);
1364 EMIT_ZERO(dst_reg);
1365 break;
1366 case BPF_ALU64 | BPF_OR | BPF_K: /* dst = dst | imm */
1367 if (!is_first_pass(jit) && can_use_ldisp_for_lit64(jit)) {
1368 /* og %dst,<d(imm)>(%l) */
1369 EMIT6_DISP_LH(0xe3000000, 0x0081,
1370 dst_reg, REG_0, REG_L,
1371 EMIT_CONST_U64(imm));
1372 } else {
1373 /* lgrl %w0,imm */
1374 EMIT6_PCREL_RILB(0xc4080000, REG_W0,
1375 _EMIT_CONST_U64(imm));
1376 jit->seen |= SEEN_LITERAL;
1377 /* ogr %dst,%w0 */
1378 EMIT4(0xb9810000, dst_reg, REG_W0);
1379 }
1380 break;
1381 /*
1382 * BPF_XOR
1383 */
1384 case BPF_ALU | BPF_XOR | BPF_X: /* dst = (u32) dst ^ (u32) src */
1385 /* xr %dst,%src */
1386 EMIT2(0x1700, dst_reg, src_reg);
1387 EMIT_ZERO(dst_reg);
1388 break;
1389 case BPF_ALU64 | BPF_XOR | BPF_X: /* dst = dst ^ src */
1390 /* xgr %dst,%src */
1391 EMIT4(0xb9820000, dst_reg, src_reg);
1392 break;
1393 case BPF_ALU | BPF_XOR | BPF_K: /* dst = (u32) dst ^ (u32) imm */
1394 if (imm != 0) {
1395 /* xilf %dst,imm */
1396 EMIT6_IMM(0xc0070000, dst_reg, imm);
1397 }
1398 EMIT_ZERO(dst_reg);
1399 break;
1400 case BPF_ALU64 | BPF_XOR | BPF_K: /* dst = dst ^ imm */
1401 if (!is_first_pass(jit) && can_use_ldisp_for_lit64(jit)) {
1402 /* xg %dst,<d(imm)>(%l) */
1403 EMIT6_DISP_LH(0xe3000000, 0x0082,
1404 dst_reg, REG_0, REG_L,
1405 EMIT_CONST_U64(imm));
1406 } else {
1407 /* lgrl %w0,imm */
1408 EMIT6_PCREL_RILB(0xc4080000, REG_W0,
1409 _EMIT_CONST_U64(imm));
1410 jit->seen |= SEEN_LITERAL;
1411 /* xgr %dst,%w0 */
1412 EMIT4(0xb9820000, dst_reg, REG_W0);
1413 }
1414 break;
1415 /*
1416 * BPF_LSH
1417 */
1418 case BPF_ALU | BPF_LSH | BPF_X: /* dst = (u32) dst << (u32) src */
1419 /* sll %dst,0(%src) */
1420 EMIT4_DISP(0x89000000, dst_reg, src_reg, 0);
1421 EMIT_ZERO(dst_reg);
1422 break;
1423 case BPF_ALU64 | BPF_LSH | BPF_X: /* dst = dst << src */
1424 /* sllg %dst,%dst,0(%src) */
1425 EMIT6_DISP_LH(0xeb000000, 0x000d, dst_reg, dst_reg, src_reg, 0);
1426 break;
1427 case BPF_ALU | BPF_LSH | BPF_K: /* dst = (u32) dst << (u32) imm */
1428 if (imm != 0) {
1429 /* sll %dst,imm(%r0) */
1430 EMIT4_DISP(0x89000000, dst_reg, REG_0, imm);
1431 }
1432 EMIT_ZERO(dst_reg);
1433 break;
1434 case BPF_ALU64 | BPF_LSH | BPF_K: /* dst = dst << imm */
1435 if (imm == 0)
1436 break;
1437 /* sllg %dst,%dst,imm(%r0) */
1438 EMIT6_DISP_LH(0xeb000000, 0x000d, dst_reg, dst_reg, REG_0, imm);
1439 break;
1440 /*
1441 * BPF_RSH
1442 */
1443 case BPF_ALU | BPF_RSH | BPF_X: /* dst = (u32) dst >> (u32) src */
1444 /* srl %dst,0(%src) */
1445 EMIT4_DISP(0x88000000, dst_reg, src_reg, 0);
1446 EMIT_ZERO(dst_reg);
1447 break;
1448 case BPF_ALU64 | BPF_RSH | BPF_X: /* dst = dst >> src */
1449 /* srlg %dst,%dst,0(%src) */
1450 EMIT6_DISP_LH(0xeb000000, 0x000c, dst_reg, dst_reg, src_reg, 0);
1451 break;
1452 case BPF_ALU | BPF_RSH | BPF_K: /* dst = (u32) dst >> (u32) imm */
1453 if (imm != 0) {
1454 /* srl %dst,imm(%r0) */
1455 EMIT4_DISP(0x88000000, dst_reg, REG_0, imm);
1456 }
1457 EMIT_ZERO(dst_reg);
1458 break;
1459 case BPF_ALU64 | BPF_RSH | BPF_K: /* dst = dst >> imm */
1460 if (imm == 0)
1461 break;
1462 /* srlg %dst,%dst,imm(%r0) */
1463 EMIT6_DISP_LH(0xeb000000, 0x000c, dst_reg, dst_reg, REG_0, imm);
1464 break;
1465 /*
1466 * BPF_ARSH
1467 */
1468 case BPF_ALU | BPF_ARSH | BPF_X: /* ((s32) dst) >>= src */
1469 /* sra %dst,%dst,0(%src) */
1470 EMIT4_DISP(0x8a000000, dst_reg, src_reg, 0);
1471 EMIT_ZERO(dst_reg);
1472 break;
1473 case BPF_ALU64 | BPF_ARSH | BPF_X: /* ((s64) dst) >>= src */
1474 /* srag %dst,%dst,0(%src) */
1475 EMIT6_DISP_LH(0xeb000000, 0x000a, dst_reg, dst_reg, src_reg, 0);
1476 break;
1477 case BPF_ALU | BPF_ARSH | BPF_K: /* ((s32) dst >> imm */
1478 if (imm != 0) {
1479 /* sra %dst,imm(%r0) */
1480 EMIT4_DISP(0x8a000000, dst_reg, REG_0, imm);
1481 }
1482 EMIT_ZERO(dst_reg);
1483 break;
1484 case BPF_ALU64 | BPF_ARSH | BPF_K: /* ((s64) dst) >>= imm */
1485 if (imm == 0)
1486 break;
1487 /* srag %dst,%dst,imm(%r0) */
1488 EMIT6_DISP_LH(0xeb000000, 0x000a, dst_reg, dst_reg, REG_0, imm);
1489 break;
1490 /*
1491 * BPF_NEG
1492 */
1493 case BPF_ALU | BPF_NEG: /* dst = (u32) -dst */
1494 /* lcr %dst,%dst */
1495 EMIT2(0x1300, dst_reg, dst_reg);
1496 EMIT_ZERO(dst_reg);
1497 break;
1498 case BPF_ALU64 | BPF_NEG: /* dst = -dst */
1499 /* lcgr %dst,%dst */
1500 EMIT4(0xb9030000, dst_reg, dst_reg);
1501 break;
1502 /*
1503 * BPF_FROM_BE/LE
1504 */
1505 case BPF_ALU | BPF_END | BPF_FROM_BE:
1506 /* s390 is big endian, therefore only clear high order bytes */
1507 switch (imm) {
1508 case 16: /* dst = (u16) cpu_to_be16(dst) */
1509 /* llghr %dst,%dst */
1510 EMIT4(0xb9850000, dst_reg, dst_reg);
1511 if (insn_is_zext(&insn[1]))
1512 insn_count = 2;
1513 break;
1514 case 32: /* dst = (u32) cpu_to_be32(dst) */
1515 if (!fp->aux->verifier_zext)
1516 /* llgfr %dst,%dst */
1517 EMIT4(0xb9160000, dst_reg, dst_reg);
1518 break;
1519 case 64: /* dst = (u64) cpu_to_be64(dst) */
1520 break;
1521 }
1522 break;
1523 case BPF_ALU | BPF_END | BPF_FROM_LE:
1524 case BPF_ALU64 | BPF_END | BPF_FROM_LE:
1525 switch (imm) {
1526 case 16: /* dst = (u16) cpu_to_le16(dst) */
1527 /* lrvr %dst,%dst */
1528 EMIT4(0xb91f0000, dst_reg, dst_reg);
1529 /* srl %dst,16(%r0) */
1530 EMIT4_DISP(0x88000000, dst_reg, REG_0, 16);
1531 /* llghr %dst,%dst */
1532 EMIT4(0xb9850000, dst_reg, dst_reg);
1533 if (insn_is_zext(&insn[1]))
1534 insn_count = 2;
1535 break;
1536 case 32: /* dst = (u32) cpu_to_le32(dst) */
1537 /* lrvr %dst,%dst */
1538 EMIT4(0xb91f0000, dst_reg, dst_reg);
1539 if (!fp->aux->verifier_zext)
1540 /* llgfr %dst,%dst */
1541 EMIT4(0xb9160000, dst_reg, dst_reg);
1542 break;
1543 case 64: /* dst = (u64) cpu_to_le64(dst) */
1544 /* lrvgr %dst,%dst */
1545 EMIT4(0xb90f0000, dst_reg, dst_reg);
1546 break;
1547 }
1548 break;
1549 /*
1550 * BPF_NOSPEC (speculation barrier)
1551 */
1552 case BPF_ST | BPF_NOSPEC:
1553 break;
1554 /*
1555 * BPF_ST(X)
1556 */
1557 case BPF_STX | BPF_MEM | BPF_B: /* *(u8 *)(dst + off) = src_reg */
1558 case BPF_STX | BPF_PROBE_MEM32 | BPF_B:
1559 case BPF_STX | BPF_MEM | BPF_H: /* (u16 *)(dst + off) = src */
1560 case BPF_STX | BPF_PROBE_MEM32 | BPF_H:
1561 case BPF_STX | BPF_MEM | BPF_W: /* *(u32 *)(dst + off) = src */
1562 case BPF_STX | BPF_PROBE_MEM32 | BPF_W:
1563 case BPF_STX | BPF_MEM | BPF_DW: /* (u64 *)(dst + off) = src */
1564 case BPF_STX | BPF_PROBE_MEM32 | BPF_DW:
1565 err = emit_stx(jit, fp, insn);
1566 if (err < 0)
1567 return err;
1568 jit->seen |= SEEN_MEM;
1569 break;
1570 case BPF_ST | BPF_MEM | BPF_B: /* *(u8 *)(dst + off) = imm */
1571 case BPF_ST | BPF_PROBE_MEM32 | BPF_B:
1572 /* lhi %w0,imm */
1573 EMIT4_IMM(0xa7080000, REG_W0, (u8) imm);
1574 bpf_jit_probe_store_pre(jit, insn, &probe);
1575 /* stcy %w0,off(%dst,%arena) */
1576 EMIT6_DISP_LH(0xe3000000, 0x0072, REG_W0, dst_reg,
1577 probe.arena_reg, off);
1578 err = bpf_jit_probe_post(jit, fp, &probe);
1579 if (err < 0)
1580 return err;
1581 jit->seen |= SEEN_MEM;
1582 break;
1583 case BPF_ST | BPF_MEM | BPF_H: /* (u16 *)(dst + off) = imm */
1584 case BPF_ST | BPF_PROBE_MEM32 | BPF_H:
1585 /* lhi %w0,imm */
1586 EMIT4_IMM(0xa7080000, REG_W0, (u16) imm);
1587 bpf_jit_probe_store_pre(jit, insn, &probe);
1588 /* sthy %w0,off(%dst,%arena) */
1589 EMIT6_DISP_LH(0xe3000000, 0x0070, REG_W0, dst_reg,
1590 probe.arena_reg, off);
1591 err = bpf_jit_probe_post(jit, fp, &probe);
1592 if (err < 0)
1593 return err;
1594 jit->seen |= SEEN_MEM;
1595 break;
1596 case BPF_ST | BPF_MEM | BPF_W: /* *(u32 *)(dst + off) = imm */
1597 case BPF_ST | BPF_PROBE_MEM32 | BPF_W:
1598 /* llilf %w0,imm */
1599 EMIT6_IMM(0xc00f0000, REG_W0, (u32) imm);
1600 bpf_jit_probe_store_pre(jit, insn, &probe);
1601 /* sty %w0,off(%dst,%arena) */
1602 EMIT6_DISP_LH(0xe3000000, 0x0050, REG_W0, dst_reg,
1603 probe.arena_reg, off);
1604 err = bpf_jit_probe_post(jit, fp, &probe);
1605 if (err < 0)
1606 return err;
1607 jit->seen |= SEEN_MEM;
1608 break;
1609 case BPF_ST | BPF_MEM | BPF_DW: /* *(u64 *)(dst + off) = imm */
1610 case BPF_ST | BPF_PROBE_MEM32 | BPF_DW:
1611 /* lgfi %w0,imm */
1612 EMIT6_IMM(0xc0010000, REG_W0, imm);
1613 bpf_jit_probe_store_pre(jit, insn, &probe);
1614 /* stg %w0,off(%dst,%arena) */
1615 EMIT6_DISP_LH(0xe3000000, 0x0024, REG_W0, dst_reg,
1616 probe.arena_reg, off);
1617 err = bpf_jit_probe_post(jit, fp, &probe);
1618 if (err < 0)
1619 return err;
1620 jit->seen |= SEEN_MEM;
1621 break;
1622 /*
1623 * BPF_ATOMIC
1624 */
1625 case BPF_STX | BPF_ATOMIC | BPF_B:
1626 case BPF_STX | BPF_ATOMIC | BPF_H:
1627 case BPF_STX | BPF_ATOMIC | BPF_DW:
1628 case BPF_STX | BPF_ATOMIC | BPF_W:
1629 case BPF_STX | BPF_PROBE_ATOMIC | BPF_B:
1630 case BPF_STX | BPF_PROBE_ATOMIC | BPF_H:
1631 case BPF_STX | BPF_PROBE_ATOMIC | BPF_DW:
1632 case BPF_STX | BPF_PROBE_ATOMIC | BPF_W:
1633 {
1634 bool is32 = BPF_SIZE(insn->code) == BPF_W;
1635
1636 /*
1637 * Unlike loads and stores, s390 atomics have only a base
1638 * register, but no index register. For the non-arena case,
1639 * simply use %dst as a base. For the arena case, use the
1640 * work register %r1: first, load the arena base into it,
1641 * and then add %dst to it.
1642 */
1643 probe.arena_reg = dst_reg;
1644
1645 switch (insn->imm) {
1646 #define EMIT_ATOMIC(op32, op64) do { \
1647 bpf_jit_probe_atomic_pre(jit, insn, &probe); \
1648 /* {op32|op64} {%w0|%src},%src,off(%arena) */ \
1649 EMIT6_DISP_LH(0xeb000000, is32 ? (op32) : (op64), \
1650 (insn->imm & BPF_FETCH) ? src_reg : REG_W0, \
1651 src_reg, probe.arena_reg, off); \
1652 err = bpf_jit_probe_post(jit, fp, &probe); \
1653 if (err < 0) \
1654 return err; \
1655 if (insn->imm & BPF_FETCH) { \
1656 /* bcr 14,0 - see atomic_fetch_{add,and,or,xor}() */ \
1657 _EMIT2(0x07e0); \
1658 if (is32) \
1659 EMIT_ZERO(src_reg); \
1660 } \
1661 } while (0)
1662 case BPF_ADD:
1663 case BPF_ADD | BPF_FETCH:
1664 /* {laal|laalg} */
1665 EMIT_ATOMIC(0x00fa, 0x00ea);
1666 break;
1667 case BPF_AND:
1668 case BPF_AND | BPF_FETCH:
1669 /* {lan|lang} */
1670 EMIT_ATOMIC(0x00f4, 0x00e4);
1671 break;
1672 case BPF_OR:
1673 case BPF_OR | BPF_FETCH:
1674 /* {lao|laog} */
1675 EMIT_ATOMIC(0x00f6, 0x00e6);
1676 break;
1677 case BPF_XOR:
1678 case BPF_XOR | BPF_FETCH:
1679 /* {lax|laxg} */
1680 EMIT_ATOMIC(0x00f7, 0x00e7);
1681 break;
1682 #undef EMIT_ATOMIC
1683 case BPF_XCHG: {
1684 struct bpf_jit_probe load_probe = probe;
1685 int loop_start;
1686
1687 bpf_jit_probe_atomic_pre(jit, insn, &load_probe);
1688 /* {ly|lg} %w0,off(%arena) */
1689 EMIT6_DISP_LH(0xe3000000,
1690 is32 ? 0x0058 : 0x0004, REG_W0, REG_0,
1691 load_probe.arena_reg, off);
1692 bpf_jit_probe_emit_nop(jit, &load_probe);
1693 /* Reuse {ly|lg}'s arena_reg for {csy|csg}. */
1694 if (load_probe.prg != -1) {
1695 probe.prg = jit->prg;
1696 probe.arena_reg = load_probe.arena_reg;
1697 probe.reg = load_probe.reg;
1698 }
1699 loop_start = jit->prg;
1700 /* 0: {csy|csg} %w0,%src,off(%arena) */
1701 EMIT6_DISP_LH(0xeb000000, is32 ? 0x0014 : 0x0030,
1702 REG_W0, src_reg, probe.arena_reg, off);
1703 bpf_jit_probe_emit_nop(jit, &probe);
1704 /* brc 4,0b */
1705 EMIT4_PCREL_RIC(0xa7040000, 4, loop_start);
1706 /* {llgfr|lgr} %src,%w0 */
1707 EMIT4(is32 ? 0xb9160000 : 0xb9040000, src_reg, REG_W0);
1708 /* Both probes should land here on exception. */
1709 err = bpf_jit_probe_post(jit, fp, &load_probe);
1710 if (err < 0)
1711 return err;
1712 err = bpf_jit_probe_post(jit, fp, &probe);
1713 if (err < 0)
1714 return err;
1715 if (is32 && insn_is_zext(&insn[1]))
1716 insn_count = 2;
1717 break;
1718 }
1719 case BPF_CMPXCHG:
1720 bpf_jit_probe_atomic_pre(jit, insn, &probe);
1721 /* 0: {csy|csg} %b0,%src,off(%arena) */
1722 EMIT6_DISP_LH(0xeb000000, is32 ? 0x0014 : 0x0030,
1723 BPF_REG_0, src_reg,
1724 probe.arena_reg, off);
1725 err = bpf_jit_probe_post(jit, fp, &probe);
1726 if (err < 0)
1727 return err;
1728 break;
1729 case BPF_LOAD_ACQ:
1730 /* s390 has strong ordering, just use load */
1731 err = emit_ldx(jit, fp, insn);
1732 if (err < 0)
1733 return err;
1734 break;
1735 case BPF_STORE_REL:
1736 /* s390 has strong ordering, just use store */
1737 err = emit_stx(jit, fp, insn);
1738 if (err < 0)
1739 return err;
1740 break;
1741 default:
1742 pr_err("Unknown atomic operation %02x\n", insn->imm);
1743 return -1;
1744 }
1745
1746 jit->seen |= SEEN_MEM;
1747 break;
1748 }
1749 /*
1750 * BPF_LDX
1751 */
1752 case BPF_LDX | BPF_MEM | BPF_B: /* dst = *(u8 *)(ul) (src + off) */
1753 case BPF_LDX | BPF_PROBE_MEM | BPF_B:
1754 case BPF_LDX | BPF_PROBE_MEM32 | BPF_B:
1755 case BPF_LDX | BPF_MEM | BPF_H: /* dst = *(u16 *)(ul) (src + off) */
1756 case BPF_LDX | BPF_PROBE_MEM | BPF_H:
1757 case BPF_LDX | BPF_PROBE_MEM32 | BPF_H:
1758 case BPF_LDX | BPF_MEM | BPF_W: /* dst = *(u32 *)(ul) (src + off) */
1759 case BPF_LDX | BPF_PROBE_MEM | BPF_W:
1760 case BPF_LDX | BPF_PROBE_MEM32 | BPF_W:
1761 case BPF_LDX | BPF_MEM | BPF_DW: /* dst = *(u64 *)(ul) (src + off) */
1762 case BPF_LDX | BPF_PROBE_MEM | BPF_DW:
1763 case BPF_LDX | BPF_PROBE_MEM32 | BPF_DW:
1764 err = emit_ldx(jit, fp, insn);
1765 if (err < 0)
1766 return err;
1767 jit->seen |= SEEN_MEM;
1768 if (BPF_SIZE(insn->code) != BPF_DW && insn_is_zext(&insn[1]))
1769 insn_count = 2;
1770 break;
1771 case BPF_LDX | BPF_MEMSX | BPF_B: /* dst = *(s8 *)(ul) (src + off) */
1772 case BPF_LDX | BPF_PROBE_MEMSX | BPF_B:
1773 bpf_jit_probe_load_pre(jit, insn, &probe);
1774 /* lgb %dst,off(%src) */
1775 EMIT6_DISP_LH(0xe3000000, 0x0077, dst_reg, src_reg, REG_0, off);
1776 err = bpf_jit_probe_post(jit, fp, &probe);
1777 if (err < 0)
1778 return err;
1779 jit->seen |= SEEN_MEM;
1780 break;
1781 case BPF_LDX | BPF_MEMSX | BPF_H: /* dst = *(s16 *)(ul) (src + off) */
1782 case BPF_LDX | BPF_PROBE_MEMSX | BPF_H:
1783 bpf_jit_probe_load_pre(jit, insn, &probe);
1784 /* lgh %dst,off(%src) */
1785 EMIT6_DISP_LH(0xe3000000, 0x0015, dst_reg, src_reg, REG_0, off);
1786 err = bpf_jit_probe_post(jit, fp, &probe);
1787 if (err < 0)
1788 return err;
1789 jit->seen |= SEEN_MEM;
1790 break;
1791 case BPF_LDX | BPF_MEMSX | BPF_W: /* dst = *(s32 *)(ul) (src + off) */
1792 case BPF_LDX | BPF_PROBE_MEMSX | BPF_W:
1793 bpf_jit_probe_load_pre(jit, insn, &probe);
1794 /* lgf %dst,off(%src) */
1795 jit->seen |= SEEN_MEM;
1796 EMIT6_DISP_LH(0xe3000000, 0x0014, dst_reg, src_reg, REG_0, off);
1797 err = bpf_jit_probe_post(jit, fp, &probe);
1798 if (err < 0)
1799 return err;
1800 break;
1801 /*
1802 * BPF_JMP / CALL
1803 */
1804 case BPF_JMP | BPF_CALL:
1805 {
1806 const struct btf_func_model *m;
1807 bool func_addr_fixed;
1808 int j, ret;
1809 u64 func;
1810
1811 /* Implement helper call to bpf_get_smp_processor_id() inline */
1812 if (insn->src_reg == 0 &&
1813 insn->imm == BPF_FUNC_get_smp_processor_id) {
1814 const u32 *cpu_nr = &get_lowcore()->cpu_nr;
1815
1816 /* llgf %b0, cpu_nr */
1817 EMIT6_DISP_LH(0xe3000000, 0x0016, BPF_REG_0, REG_0, REG_0,
1818 (unsigned long)cpu_nr);
1819 break;
1820 }
1821
1822 /* Implement helper call to bpf_get_current_task/_btf() inline */
1823 if (insn->src_reg == 0 &&
1824 (insn->imm == BPF_FUNC_get_current_task ||
1825 insn->imm == BPF_FUNC_get_current_task_btf)) {
1826 const u64 *current_task =
1827 &get_lowcore()->current_task;
1828
1829 /* lg %b0, current_task */
1830 EMIT6_DISP_LH(0xe3000000, 0x0004, BPF_REG_0, REG_0, REG_0,
1831 (unsigned long)current_task);
1832 break;
1833 }
1834
1835 ret = bpf_jit_get_func_addr(fp, insn, extra_pass,
1836 &func, &func_addr_fixed);
1837 if (ret < 0)
1838 return -1;
1839
1840 REG_SET_SEEN(BPF_REG_5);
1841 jit->seen |= SEEN_FUNC;
1842
1843 /*
1844 * Copy the tail call counter to where the callee expects it.
1845 */
1846
1847 if (insn->src_reg == BPF_PSEUDO_CALL)
1848 /*
1849 * mvc tail_call_cnt(4,%r15),
1850 * frame_off+tail_call_cnt(%r15)
1851 */
1852 _EMIT6(0xd203f000 | offsetof(struct prog_frame,
1853 tail_call_cnt),
1854 0xf000 | (jit->frame_off +
1855 offsetof(struct prog_frame,
1856 tail_call_cnt)));
1857
1858 /* Sign-extend the kfunc arguments. */
1859 if (insn->src_reg == BPF_PSEUDO_KFUNC_CALL) {
1860 m = bpf_jit_find_kfunc_model(fp, insn);
1861 if (!m)
1862 return -1;
1863
1864 for (j = 0; j < m->nr_args; j++) {
1865 if (sign_zero_extend(jit, BPF_REG_1 + j,
1866 m->arg_size[j],
1867 m->arg_flags[j]))
1868 return -1;
1869 }
1870 }
1871
1872 if ((void *)func == arch_bpf_timed_may_goto) {
1873 /*
1874 * arch_bpf_timed_may_goto() has a special ABI: the
1875 * parameters are in BPF_REG_AX and BPF_REG_10; the
1876 * return value is in BPF_REG_AX; and all GPRs except
1877 * REG_W0, REG_W1, and BPF_REG_AX are callee-saved.
1878 */
1879
1880 /* brasl %r0,func */
1881 EMIT6_PCREL_RILB_PTR(0xc0050000, REG_0, (void *)func);
1882 } else {
1883 /* brasl %r14,func */
1884 EMIT6_PCREL_RILB_PTR(0xc0050000, REG_14, (void *)func);
1885 /* lgr %b0,%r2: load return value into %b0 */
1886 EMIT4(0xb9040000, BPF_REG_0, REG_2);
1887 }
1888
1889 /*
1890 * Copy the potentially updated tail call counter back.
1891 */
1892
1893 if (insn->src_reg == BPF_PSEUDO_CALL)
1894 /*
1895 * mvc frame_off+tail_call_cnt(%r15),
1896 * tail_call_cnt(4,%r15)
1897 */
1898 _EMIT6(0xd203f000 | (jit->frame_off +
1899 offsetof(struct prog_frame,
1900 tail_call_cnt)),
1901 0xf000 | offsetof(struct prog_frame,
1902 tail_call_cnt));
1903
1904 break;
1905 }
1906 case BPF_JMP | BPF_TAIL_CALL: {
1907 int patch_1_clrj, patch_2_clij, patch_3_brc;
1908
1909 /*
1910 * Implicit input:
1911 * B1: pointer to ctx
1912 * B2: pointer to bpf_array
1913 * B3: index in bpf_array
1914 *
1915 * if (index >= array->map.max_entries)
1916 * goto out;
1917 */
1918
1919 /* llgf %w1,map.max_entries(%b2) */
1920 EMIT6_DISP_LH(0xe3000000, 0x0016, REG_W1, REG_0, BPF_REG_2,
1921 offsetof(struct bpf_array, map.max_entries));
1922 /* if ((u32)%b3 >= (u32)%w1) goto out; */
1923 /* clrj %b3,%w1,0xa,out */
1924 patch_1_clrj = jit->prg;
1925 EMIT6_PCREL_RIEB(0xec000000, 0x0077, BPF_REG_3, REG_W1, 0xa,
1926 jit->prg);
1927
1928 /*
1929 * if (tail_call_cnt >= MAX_TAIL_CALL_CNT)
1930 * goto out;
1931 *
1932 * tail_call_cnt is read into %w0, which needs to be preserved
1933 * until it's incremented and flushed.
1934 */
1935
1936 off = jit->frame_off +
1937 offsetof(struct prog_frame, tail_call_cnt);
1938 /* ly %w0,off(%r15) */
1939 EMIT6_DISP_LH(0xe3000000, 0x0058, REG_W0, REG_0, REG_15, off);
1940 /* clij %w0,MAX_TAIL_CALL_CNT,0xa,out */
1941 patch_2_clij = jit->prg;
1942 EMIT6_PCREL_RIEC(0xec000000, 0x007f, REG_W0, MAX_TAIL_CALL_CNT,
1943 0xa, jit->prg);
1944
1945 /*
1946 * prog = array->ptrs[index];
1947 * if (prog == NULL)
1948 * goto out;
1949 */
1950
1951 /* llgfr %r1,%b3: %r1 = (u32) index */
1952 EMIT4(0xb9160000, REG_1, BPF_REG_3);
1953 /* sllg %r1,%r1,3: %r1 *= 8 */
1954 EMIT6_DISP_LH(0xeb000000, 0x000d, REG_1, REG_1, REG_0, 3);
1955 /* ltg %r1,prog(%b2,%r1) */
1956 EMIT6_DISP_LH(0xe3000000, 0x0002, REG_1, BPF_REG_2,
1957 REG_1, offsetof(struct bpf_array, ptrs));
1958 /* brc 0x8,out */
1959 patch_3_brc = jit->prg;
1960 EMIT4_PCREL_RIC(0xa7040000, 8, jit->prg);
1961
1962 /* tail_call_cnt++; */
1963 /* ahi %w0,1 */
1964 EMIT4_IMM(0xa70a0000, REG_W0, 1);
1965 /* sty %w0,off(%r15) */
1966 EMIT6_DISP_LH(0xe3000000, 0x0050, REG_W0, REG_0, REG_15, off);
1967
1968 /*
1969 * Restore registers before calling function
1970 */
1971 save_restore_regs(jit, REGS_RESTORE, 0);
1972
1973 /*
1974 * goto *(prog->bpf_func + tail_call_start);
1975 */
1976
1977 /* lg %r1,bpf_func(%r1) */
1978 EMIT6_DISP_LH(0xe3000000, 0x0004, REG_1, REG_1, REG_0,
1979 offsetof(struct bpf_prog, bpf_func));
1980 if (nospec_uses_trampoline()) {
1981 jit->seen |= SEEN_FUNC;
1982 /* aghi %r1,tail_call_start */
1983 EMIT4_IMM(0xa70b0000, REG_1, jit->tail_call_start);
1984 /* brcl 0xf,__s390_indirect_jump_r1 */
1985 EMIT6_PCREL_RILC_PTR(0xc0040000, 0xf,
1986 __s390_indirect_jump_r1);
1987 } else {
1988 /* bc 0xf,tail_call_start(%r1) */
1989 _EMIT4(0x47f01000 + jit->tail_call_start);
1990 }
1991 /* out: */
1992 if (jit->prg_buf) {
1993 *(u16 *)(jit->prg_buf + patch_1_clrj + 2) =
1994 (jit->prg - patch_1_clrj) >> 1;
1995 *(u16 *)(jit->prg_buf + patch_2_clij + 2) =
1996 (jit->prg - patch_2_clij) >> 1;
1997 *(u16 *)(jit->prg_buf + patch_3_brc + 2) =
1998 (jit->prg - patch_3_brc) >> 1;
1999 }
2000 break;
2001 }
2002 case BPF_JMP | BPF_EXIT: /* return b0 */
2003 last = (i == fp->len - 1) ? 1 : 0;
2004 if (last)
2005 break;
2006 if (!is_first_pass(jit) && can_use_rel(jit, jit->exit_ip))
2007 /* brc 0xf, <exit> */
2008 EMIT4_PCREL_RIC(0xa7040000, 0xf, jit->exit_ip);
2009 else
2010 /* brcl 0xf, <exit> */
2011 EMIT6_PCREL_RILC(0xc0040000, 0xf, jit->exit_ip);
2012 break;
2013 /*
2014 * Branch relative (number of skipped instructions) to offset on
2015 * condition.
2016 *
2017 * Condition code to mask mapping:
2018 *
2019 * CC | Description | Mask
2020 * ------------------------------
2021 * 0 | Operands equal | 8
2022 * 1 | First operand low | 4
2023 * 2 | First operand high | 2
2024 * 3 | Unused | 1
2025 *
2026 * For s390x relative branches: ip = ip + off_bytes
2027 * For BPF relative branches: insn = insn + off_insns + 1
2028 *
2029 * For example for s390x with offset 0 we jump to the branch
2030 * instruction itself (loop) and for BPF with offset 0 we
2031 * branch to the instruction behind the branch.
2032 */
2033 case BPF_JMP32 | BPF_JA: /* if (true) */
2034 branch_oc_off = imm;
2035 fallthrough;
2036 case BPF_JMP | BPF_JA: /* if (true) */
2037 mask = 0xf000; /* j */
2038 goto branch_oc;
2039 case BPF_JMP | BPF_JSGT | BPF_K: /* ((s64) dst > (s64) imm) */
2040 case BPF_JMP32 | BPF_JSGT | BPF_K: /* ((s32) dst > (s32) imm) */
2041 mask = 0x2000; /* jh */
2042 goto branch_ks;
2043 case BPF_JMP | BPF_JSLT | BPF_K: /* ((s64) dst < (s64) imm) */
2044 case BPF_JMP32 | BPF_JSLT | BPF_K: /* ((s32) dst < (s32) imm) */
2045 mask = 0x4000; /* jl */
2046 goto branch_ks;
2047 case BPF_JMP | BPF_JSGE | BPF_K: /* ((s64) dst >= (s64) imm) */
2048 case BPF_JMP32 | BPF_JSGE | BPF_K: /* ((s32) dst >= (s32) imm) */
2049 mask = 0xa000; /* jhe */
2050 goto branch_ks;
2051 case BPF_JMP | BPF_JSLE | BPF_K: /* ((s64) dst <= (s64) imm) */
2052 case BPF_JMP32 | BPF_JSLE | BPF_K: /* ((s32) dst <= (s32) imm) */
2053 mask = 0xc000; /* jle */
2054 goto branch_ks;
2055 case BPF_JMP | BPF_JGT | BPF_K: /* (dst_reg > imm) */
2056 case BPF_JMP32 | BPF_JGT | BPF_K: /* ((u32) dst_reg > (u32) imm) */
2057 mask = 0x2000; /* jh */
2058 goto branch_ku;
2059 case BPF_JMP | BPF_JLT | BPF_K: /* (dst_reg < imm) */
2060 case BPF_JMP32 | BPF_JLT | BPF_K: /* ((u32) dst_reg < (u32) imm) */
2061 mask = 0x4000; /* jl */
2062 goto branch_ku;
2063 case BPF_JMP | BPF_JGE | BPF_K: /* (dst_reg >= imm) */
2064 case BPF_JMP32 | BPF_JGE | BPF_K: /* ((u32) dst_reg >= (u32) imm) */
2065 mask = 0xa000; /* jhe */
2066 goto branch_ku;
2067 case BPF_JMP | BPF_JLE | BPF_K: /* (dst_reg <= imm) */
2068 case BPF_JMP32 | BPF_JLE | BPF_K: /* ((u32) dst_reg <= (u32) imm) */
2069 mask = 0xc000; /* jle */
2070 goto branch_ku;
2071 case BPF_JMP | BPF_JNE | BPF_K: /* (dst_reg != imm) */
2072 case BPF_JMP32 | BPF_JNE | BPF_K: /* ((u32) dst_reg != (u32) imm) */
2073 mask = 0x7000; /* jne */
2074 goto branch_ku;
2075 case BPF_JMP | BPF_JEQ | BPF_K: /* (dst_reg == imm) */
2076 case BPF_JMP32 | BPF_JEQ | BPF_K: /* ((u32) dst_reg == (u32) imm) */
2077 mask = 0x8000; /* je */
2078 goto branch_ku;
2079 case BPF_JMP | BPF_JSET | BPF_K: /* (dst_reg & imm) */
2080 case BPF_JMP32 | BPF_JSET | BPF_K: /* ((u32) dst_reg & (u32) imm) */
2081 mask = 0x7000; /* jnz */
2082 if (BPF_CLASS(insn->code) == BPF_JMP32) {
2083 /* llilf %w1,imm (load zero extend imm) */
2084 EMIT6_IMM(0xc00f0000, REG_W1, imm);
2085 /* nr %w1,%dst */
2086 EMIT2(0x1400, REG_W1, dst_reg);
2087 } else {
2088 /* lgfi %w1,imm (load sign extend imm) */
2089 EMIT6_IMM(0xc0010000, REG_W1, imm);
2090 /* ngr %w1,%dst */
2091 EMIT4(0xb9800000, REG_W1, dst_reg);
2092 }
2093 goto branch_oc;
2094
2095 case BPF_JMP | BPF_JSGT | BPF_X: /* ((s64) dst > (s64) src) */
2096 case BPF_JMP32 | BPF_JSGT | BPF_X: /* ((s32) dst > (s32) src) */
2097 mask = 0x2000; /* jh */
2098 goto branch_xs;
2099 case BPF_JMP | BPF_JSLT | BPF_X: /* ((s64) dst < (s64) src) */
2100 case BPF_JMP32 | BPF_JSLT | BPF_X: /* ((s32) dst < (s32) src) */
2101 mask = 0x4000; /* jl */
2102 goto branch_xs;
2103 case BPF_JMP | BPF_JSGE | BPF_X: /* ((s64) dst >= (s64) src) */
2104 case BPF_JMP32 | BPF_JSGE | BPF_X: /* ((s32) dst >= (s32) src) */
2105 mask = 0xa000; /* jhe */
2106 goto branch_xs;
2107 case BPF_JMP | BPF_JSLE | BPF_X: /* ((s64) dst <= (s64) src) */
2108 case BPF_JMP32 | BPF_JSLE | BPF_X: /* ((s32) dst <= (s32) src) */
2109 mask = 0xc000; /* jle */
2110 goto branch_xs;
2111 case BPF_JMP | BPF_JGT | BPF_X: /* (dst > src) */
2112 case BPF_JMP32 | BPF_JGT | BPF_X: /* ((u32) dst > (u32) src) */
2113 mask = 0x2000; /* jh */
2114 goto branch_xu;
2115 case BPF_JMP | BPF_JLT | BPF_X: /* (dst < src) */
2116 case BPF_JMP32 | BPF_JLT | BPF_X: /* ((u32) dst < (u32) src) */
2117 mask = 0x4000; /* jl */
2118 goto branch_xu;
2119 case BPF_JMP | BPF_JGE | BPF_X: /* (dst >= src) */
2120 case BPF_JMP32 | BPF_JGE | BPF_X: /* ((u32) dst >= (u32) src) */
2121 mask = 0xa000; /* jhe */
2122 goto branch_xu;
2123 case BPF_JMP | BPF_JLE | BPF_X: /* (dst <= src) */
2124 case BPF_JMP32 | BPF_JLE | BPF_X: /* ((u32) dst <= (u32) src) */
2125 mask = 0xc000; /* jle */
2126 goto branch_xu;
2127 case BPF_JMP | BPF_JNE | BPF_X: /* (dst != src) */
2128 case BPF_JMP32 | BPF_JNE | BPF_X: /* ((u32) dst != (u32) src) */
2129 mask = 0x7000; /* jne */
2130 goto branch_xu;
2131 case BPF_JMP | BPF_JEQ | BPF_X: /* (dst == src) */
2132 case BPF_JMP32 | BPF_JEQ | BPF_X: /* ((u32) dst == (u32) src) */
2133 mask = 0x8000; /* je */
2134 goto branch_xu;
2135 case BPF_JMP | BPF_JSET | BPF_X: /* (dst & src) */
2136 case BPF_JMP32 | BPF_JSET | BPF_X: /* ((u32) dst & (u32) src) */
2137 {
2138 bool is_jmp32 = BPF_CLASS(insn->code) == BPF_JMP32;
2139
2140 mask = 0x7000; /* jnz */
2141 /* nrk or ngrk %w1,%dst,%src */
2142 EMIT4_RRF((is_jmp32 ? 0xb9f40000 : 0xb9e40000),
2143 REG_W1, dst_reg, src_reg);
2144 goto branch_oc;
2145 branch_ks:
2146 is_jmp32 = BPF_CLASS(insn->code) == BPF_JMP32;
2147 /* cfi or cgfi %dst,imm */
2148 EMIT6_IMM(is_jmp32 ? 0xc20d0000 : 0xc20c0000,
2149 dst_reg, imm);
2150 if (!is_first_pass(jit) &&
2151 can_use_rel(jit, addrs[i + off + 1])) {
2152 /* brc mask,off */
2153 EMIT4_PCREL_RIC(0xa7040000,
2154 mask >> 12, addrs[i + off + 1]);
2155 } else {
2156 /* brcl mask,off */
2157 EMIT6_PCREL_RILC(0xc0040000,
2158 mask >> 12, addrs[i + off + 1]);
2159 }
2160 break;
2161 branch_ku:
2162 /* lgfi %w1,imm (load sign extend imm) */
2163 src_reg = REG_1;
2164 EMIT6_IMM(0xc0010000, src_reg, imm);
2165 goto branch_xu;
2166 branch_xs:
2167 is_jmp32 = BPF_CLASS(insn->code) == BPF_JMP32;
2168 if (!is_first_pass(jit) &&
2169 can_use_rel(jit, addrs[i + off + 1])) {
2170 /* crj or cgrj %dst,%src,mask,off */
2171 EMIT6_PCREL(0xec000000, (is_jmp32 ? 0x0076 : 0x0064),
2172 dst_reg, src_reg, i, off, mask);
2173 } else {
2174 /* cr or cgr %dst,%src */
2175 if (is_jmp32)
2176 EMIT2(0x1900, dst_reg, src_reg);
2177 else
2178 EMIT4(0xb9200000, dst_reg, src_reg);
2179 /* brcl mask,off */
2180 EMIT6_PCREL_RILC(0xc0040000,
2181 mask >> 12, addrs[i + off + 1]);
2182 }
2183 break;
2184 branch_xu:
2185 is_jmp32 = BPF_CLASS(insn->code) == BPF_JMP32;
2186 if (!is_first_pass(jit) &&
2187 can_use_rel(jit, addrs[i + off + 1])) {
2188 /* clrj or clgrj %dst,%src,mask,off */
2189 EMIT6_PCREL(0xec000000, (is_jmp32 ? 0x0077 : 0x0065),
2190 dst_reg, src_reg, i, off, mask);
2191 } else {
2192 /* clr or clgr %dst,%src */
2193 if (is_jmp32)
2194 EMIT2(0x1500, dst_reg, src_reg);
2195 else
2196 EMIT4(0xb9210000, dst_reg, src_reg);
2197 /* brcl mask,off */
2198 EMIT6_PCREL_RILC(0xc0040000,
2199 mask >> 12, addrs[i + off + 1]);
2200 }
2201 break;
2202 branch_oc:
2203 if (!is_first_pass(jit) &&
2204 can_use_rel(jit, addrs[i + branch_oc_off + 1])) {
2205 /* brc mask,off */
2206 EMIT4_PCREL_RIC(0xa7040000,
2207 mask >> 12,
2208 addrs[i + branch_oc_off + 1]);
2209 } else {
2210 /* brcl mask,off */
2211 EMIT6_PCREL_RILC(0xc0040000,
2212 mask >> 12,
2213 addrs[i + branch_oc_off + 1]);
2214 }
2215 break;
2216 }
2217 default: /* too complex, give up */
2218 pr_err("Unknown opcode %02x\n", insn->code);
2219 return -1;
2220 }
2221
2222 return insn_count;
2223 }
2224
2225 /*
2226 * Return whether new i-th instruction address does not violate any invariant
2227 */
bpf_is_new_addr_sane(struct bpf_jit * jit,int i)2228 static bool bpf_is_new_addr_sane(struct bpf_jit *jit, int i)
2229 {
2230 /* On the first pass anything goes */
2231 if (is_first_pass(jit))
2232 return true;
2233
2234 /* The codegen pass must not change anything */
2235 if (is_codegen_pass(jit))
2236 return jit->addrs[i] == jit->prg;
2237
2238 /* Passes in between must not increase code size */
2239 return jit->addrs[i] >= jit->prg;
2240 }
2241
2242 /*
2243 * Update the address of i-th instruction
2244 */
bpf_set_addr(struct bpf_jit * jit,int i)2245 static int bpf_set_addr(struct bpf_jit *jit, int i)
2246 {
2247 int delta;
2248
2249 if (is_codegen_pass(jit)) {
2250 delta = jit->prg - jit->addrs[i];
2251 if (delta < 0)
2252 bpf_skip(jit, -delta);
2253 }
2254 if (WARN_ON_ONCE(!bpf_is_new_addr_sane(jit, i)))
2255 return -1;
2256 jit->addrs[i] = jit->prg;
2257 return 0;
2258 }
2259
2260 /*
2261 * Compile eBPF program into s390x code
2262 */
bpf_jit_prog(struct bpf_jit * jit,struct bpf_prog * fp,bool extra_pass)2263 static int bpf_jit_prog(struct bpf_jit *jit, struct bpf_prog *fp,
2264 bool extra_pass)
2265 {
2266 int i, insn_count, lit32_size, lit64_size;
2267 u64 kern_arena;
2268
2269 jit->lit32 = jit->lit32_start;
2270 jit->lit64 = jit->lit64_start;
2271 jit->prg = 0;
2272 jit->excnt = 0;
2273 if (is_first_pass(jit) || (jit->seen & SEEN_STACK))
2274 jit->frame_off = sizeof(struct prog_frame) -
2275 offsetofend(struct prog_frame, unused) +
2276 round_up(fp->aux->stack_depth, 8);
2277 else
2278 jit->frame_off = 0;
2279
2280 kern_arena = bpf_arena_get_kern_vm_start(fp->aux->arena);
2281 if (kern_arena)
2282 jit->kern_arena = _EMIT_CONST_U64(kern_arena);
2283 jit->user_arena = bpf_arena_get_user_vm_start(fp->aux->arena);
2284
2285 bpf_jit_prologue(jit, fp);
2286 if (bpf_set_addr(jit, 0) < 0)
2287 return -1;
2288 for (i = 0; i < fp->len; i += insn_count) {
2289 insn_count = bpf_jit_insn(jit, fp, i, extra_pass);
2290 if (insn_count < 0)
2291 return -1;
2292 /* Next instruction address */
2293 if (bpf_set_addr(jit, i + insn_count) < 0)
2294 return -1;
2295 }
2296 bpf_jit_epilogue(jit);
2297
2298 lit32_size = jit->lit32 - jit->lit32_start;
2299 lit64_size = jit->lit64 - jit->lit64_start;
2300 jit->lit32_start = jit->prg;
2301 if (lit32_size)
2302 jit->lit32_start = ALIGN(jit->lit32_start, 4);
2303 jit->lit64_start = jit->lit32_start + lit32_size;
2304 if (lit64_size)
2305 jit->lit64_start = ALIGN(jit->lit64_start, 8);
2306 jit->size = jit->lit64_start + lit64_size;
2307 jit->size_prg = jit->prg;
2308
2309 if (WARN_ON_ONCE(fp->aux->extable &&
2310 jit->excnt != fp->aux->num_exentries))
2311 /* Verifier bug - too many entries. */
2312 return -1;
2313
2314 return 0;
2315 }
2316
bpf_jit_needs_zext(void)2317 bool bpf_jit_needs_zext(void)
2318 {
2319 return true;
2320 }
2321
2322 struct s390_jit_data {
2323 struct bpf_binary_header *header;
2324 struct bpf_jit ctx;
2325 int pass;
2326 };
2327
bpf_jit_alloc(struct bpf_jit * jit,struct bpf_prog * fp)2328 static struct bpf_binary_header *bpf_jit_alloc(struct bpf_jit *jit,
2329 struct bpf_prog *fp)
2330 {
2331 struct bpf_binary_header *header;
2332 struct bpf_insn *insn;
2333 u32 extable_size;
2334 u32 code_size;
2335 int i;
2336
2337 for (i = 0; i < fp->len; i++) {
2338 insn = &fp->insnsi[i];
2339
2340 if (BPF_CLASS(insn->code) == BPF_STX &&
2341 BPF_MODE(insn->code) == BPF_PROBE_ATOMIC &&
2342 (BPF_SIZE(insn->code) == BPF_DW ||
2343 BPF_SIZE(insn->code) == BPF_W) &&
2344 insn->imm == BPF_XCHG)
2345 /*
2346 * bpf_jit_insn() emits a load and a compare-and-swap,
2347 * both of which need to be probed.
2348 */
2349 fp->aux->num_exentries += 1;
2350 }
2351 /* We need two entries per insn. */
2352 fp->aux->num_exentries *= 2;
2353
2354 code_size = roundup(jit->size,
2355 __alignof__(struct exception_table_entry));
2356 extable_size = fp->aux->num_exentries *
2357 sizeof(struct exception_table_entry);
2358 header = bpf_jit_binary_alloc(code_size + extable_size, &jit->prg_buf,
2359 8, jit_fill_hole);
2360 if (!header)
2361 return NULL;
2362 fp->aux->extable = (struct exception_table_entry *)
2363 (jit->prg_buf + code_size);
2364 return header;
2365 }
2366
2367 /*
2368 * Compile eBPF program "fp"
2369 */
bpf_int_jit_compile(struct bpf_verifier_env * env,struct bpf_prog * fp)2370 struct bpf_prog *bpf_int_jit_compile(struct bpf_verifier_env *env, struct bpf_prog *fp)
2371 {
2372 struct bpf_binary_header *header;
2373 struct s390_jit_data *jit_data;
2374 bool extra_pass = false;
2375 struct bpf_jit jit;
2376 int pass;
2377
2378 if (!fp->jit_requested)
2379 return fp;
2380
2381 jit_data = fp->aux->jit_data;
2382 if (!jit_data) {
2383 jit_data = kzalloc_obj(*jit_data);
2384 if (!jit_data)
2385 return fp;
2386 fp->aux->jit_data = jit_data;
2387 }
2388 if (jit_data->ctx.addrs) {
2389 jit = jit_data->ctx;
2390 header = jit_data->header;
2391 extra_pass = true;
2392 pass = jit_data->pass + 1;
2393 goto skip_init_ctx;
2394 }
2395
2396 memset(&jit, 0, sizeof(jit));
2397 jit.addrs = kvcalloc(fp->len + 1, sizeof(*jit.addrs), GFP_KERNEL);
2398 if (jit.addrs == NULL)
2399 goto out_err;
2400 /*
2401 * Three initial passes:
2402 * - 1/2: Determine clobbered registers
2403 * - 3: Calculate program size and addrs array
2404 */
2405 for (pass = 1; pass <= 3; pass++) {
2406 if (bpf_jit_prog(&jit, fp, extra_pass))
2407 goto out_err;
2408 }
2409 /*
2410 * Final pass: Allocate and generate program
2411 */
2412 header = bpf_jit_alloc(&jit, fp);
2413 if (!header)
2414 goto out_err;
2415 skip_init_ctx:
2416 if (bpf_jit_prog(&jit, fp, extra_pass)) {
2417 bpf_jit_binary_free(header);
2418 goto out_err;
2419 }
2420 if (bpf_jit_enable > 1) {
2421 bpf_jit_dump(fp->len, jit.size, pass, jit.prg_buf);
2422 print_fn_code(jit.prg_buf, jit.size_prg);
2423 }
2424 if (!fp->is_func || extra_pass) {
2425 if (bpf_jit_binary_lock_ro(header)) {
2426 bpf_jit_binary_free(header);
2427 goto out_err;
2428 }
2429 } else {
2430 jit_data->header = header;
2431 jit_data->ctx = jit;
2432 jit_data->pass = pass;
2433 }
2434 fp->bpf_func = (void *) jit.prg_buf;
2435 fp->jited = 1;
2436 fp->jited_len = jit.size;
2437
2438 if (!fp->is_func || extra_pass) {
2439 bpf_prog_fill_jited_linfo(fp, jit.addrs + 1);
2440 free_addrs:
2441 kvfree(jit.addrs);
2442 kfree(jit_data);
2443 fp->aux->jit_data = NULL;
2444 }
2445
2446 return fp;
2447
2448 out_err:
2449 if (extra_pass) {
2450 fp->bpf_func = NULL;
2451 fp->jited = 0;
2452 fp->jited_len = 0;
2453 }
2454 goto free_addrs;
2455 }
2456
bpf_jit_supports_kfunc_call(void)2457 bool bpf_jit_supports_kfunc_call(void)
2458 {
2459 return true;
2460 }
2461
bpf_jit_supports_far_kfunc_call(void)2462 bool bpf_jit_supports_far_kfunc_call(void)
2463 {
2464 return true;
2465 }
2466
bpf_arch_text_poke(void * ip,enum bpf_text_poke_type old_t,enum bpf_text_poke_type new_t,void * old_addr,void * new_addr)2467 int bpf_arch_text_poke(void *ip, enum bpf_text_poke_type old_t,
2468 enum bpf_text_poke_type new_t, void *old_addr,
2469 void *new_addr)
2470 {
2471 struct bpf_plt expected_plt, current_plt, new_plt, *plt;
2472 struct {
2473 u16 opc;
2474 s32 disp;
2475 } __packed insn;
2476 char *ret;
2477 int err;
2478
2479 /* Verify the branch to be patched. */
2480 err = copy_from_kernel_nofault(&insn, ip, sizeof(insn));
2481 if (err < 0)
2482 return err;
2483 if (insn.opc != (0xc004 | (old_addr ? 0xf0 : 0)))
2484 return -EINVAL;
2485
2486 if ((new_t == BPF_MOD_JUMP || old_t == BPF_MOD_JUMP) &&
2487 insn.disp == ((char *)new_addr - (char *)ip) >> 1) {
2488 /*
2489 * The branch already points to the destination,
2490 * there is no PLT.
2491 */
2492 } else {
2493 /* Verify the PLT. */
2494 plt = ip + (insn.disp << 1);
2495 err = copy_from_kernel_nofault(¤t_plt, plt,
2496 sizeof(current_plt));
2497 if (err < 0)
2498 return err;
2499 ret = (char *)ip + 6;
2500 bpf_jit_plt(&expected_plt, ret, old_addr);
2501 if (memcmp(¤t_plt, &expected_plt, sizeof(current_plt)))
2502 return -EINVAL;
2503 /* Adjust the call address. */
2504 bpf_jit_plt(&new_plt, ret, new_addr);
2505 s390_kernel_write(&plt->target, &new_plt.target,
2506 sizeof(void *));
2507 }
2508
2509 /* Adjust the mask of the branch. */
2510 insn.opc = 0xc004 | (new_addr ? 0xf0 : 0);
2511 s390_kernel_write((char *)ip + 1, (char *)&insn.opc + 1, 1);
2512
2513 /* Make the new code visible to the other CPUs. */
2514 text_poke_sync_lock();
2515
2516 return 0;
2517 }
2518
2519 struct bpf_tramp_jit {
2520 struct bpf_jit common;
2521 int orig_stack_args_off;/* Offset of arguments placed on stack by the
2522 * func_addr's original caller
2523 */
2524 int stack_size; /* Trampoline stack size */
2525 int backchain_off; /* Offset of backchain */
2526 int stack_args_off; /* Offset of stack arguments for calling
2527 * func_addr, has to be at the top
2528 */
2529 int reg_args_off; /* Offset of register arguments for calling
2530 * func_addr
2531 */
2532 int ip_off; /* For bpf_get_func_ip(), has to be at
2533 * (ctx - 16)
2534 */
2535 int func_meta_off; /* For bpf_get_func_arg_cnt()/fsession, has
2536 * to be at (ctx - 8)
2537 */
2538 int bpf_args_off; /* Offset of BPF_PROG context, which consists
2539 * of BPF arguments followed by return value
2540 */
2541 int retval_off; /* Offset of return value (see above) */
2542 int r7_r8_off; /* Offset of saved %r7 and %r8, which are used
2543 * for __bpf_prog_enter() return value and
2544 * func_addr respectively
2545 */
2546 int run_ctx_off; /* Offset of struct bpf_tramp_run_ctx */
2547 int tccnt_off; /* Offset of saved tailcall counter */
2548 int r14_off; /* Offset of saved %r14, has to be at the
2549 * bottom */
2550 int do_fexit; /* do_fexit: label */
2551 };
2552
load_imm64(struct bpf_jit * jit,int dst_reg,u64 val)2553 static void load_imm64(struct bpf_jit *jit, int dst_reg, u64 val)
2554 {
2555 /* llihf %dst_reg,val_hi */
2556 EMIT6_IMM(0xc00e0000, dst_reg, (val >> 32));
2557 /* oilf %rdst_reg,val_lo */
2558 EMIT6_IMM(0xc00d0000, dst_reg, val);
2559 }
2560
emit_store_stack_imm64(struct bpf_jit * jit,int tmp_reg,int stack_off,u64 imm)2561 static void emit_store_stack_imm64(struct bpf_jit *jit, int tmp_reg, int stack_off, u64 imm)
2562 {
2563 load_imm64(jit, tmp_reg, imm);
2564 /* stg %tmp_reg,stack_off(%r15) */
2565 EMIT6_DISP_LH(0xe3000000, 0x0024, tmp_reg, REG_0, REG_15, stack_off);
2566 }
2567
invoke_bpf_prog(struct bpf_tramp_jit * tjit,const struct btf_func_model * m,struct bpf_tramp_node * node,bool save_ret)2568 static int invoke_bpf_prog(struct bpf_tramp_jit *tjit,
2569 const struct btf_func_model *m,
2570 struct bpf_tramp_node *node, bool save_ret)
2571 {
2572 struct bpf_jit *jit = &tjit->common;
2573 int cookie_off = tjit->run_ctx_off +
2574 offsetof(struct bpf_tramp_run_ctx, bpf_cookie);
2575 struct bpf_prog *p = node->link->prog;
2576 int patch;
2577
2578 /*
2579 * run_ctx.cookie = node->cookie;
2580 */
2581
2582 emit_store_stack_imm64(jit, REG_W0, cookie_off, node->cookie);
2583
2584 /*
2585 * if ((start = __bpf_prog_enter(p, &run_ctx)) == 0)
2586 * goto skip;
2587 */
2588
2589 /* %r2 = p */
2590 load_imm64(jit, REG_2, (u64)p);
2591 /* la %r3,run_ctx_off(%r15) */
2592 EMIT4_DISP(0x41000000, REG_3, REG_15, tjit->run_ctx_off);
2593 /* brasl %r14,__bpf_prog_enter */
2594 EMIT6_PCREL_RILB_PTR(0xc0050000, REG_14, bpf_trampoline_enter(p));
2595 /* ltgr %r7,%r2 */
2596 EMIT4(0xb9020000, REG_7, REG_2);
2597 /* brcl 8,skip */
2598 patch = jit->prg;
2599 EMIT6_PCREL_RILC(0xc0040000, 8, 0);
2600
2601 /*
2602 * retval = bpf_func(args, p->insnsi);
2603 */
2604
2605 /* la %r2,bpf_args_off(%r15) */
2606 EMIT4_DISP(0x41000000, REG_2, REG_15, tjit->bpf_args_off);
2607 /* %r3 = p->insnsi */
2608 if (!p->jited)
2609 load_imm64(jit, REG_3, (u64)p->insnsi);
2610 /* brasl %r14,p->bpf_func */
2611 EMIT6_PCREL_RILB_PTR(0xc0050000, REG_14, p->bpf_func);
2612 /* stg %r2,retval_off(%r15) */
2613 if (save_ret) {
2614 if (sign_zero_extend(jit, REG_2, m->ret_size, m->ret_flags))
2615 return -1;
2616 EMIT6_DISP_LH(0xe3000000, 0x0024, REG_2, REG_0, REG_15,
2617 tjit->retval_off);
2618 }
2619
2620 /* skip: */
2621 if (jit->prg_buf)
2622 *(u32 *)&jit->prg_buf[patch + 2] = (jit->prg - patch) >> 1;
2623
2624 /*
2625 * __bpf_prog_exit(p, start, &run_ctx);
2626 */
2627
2628 /* %r2 = p */
2629 load_imm64(jit, REG_2, (u64)p);
2630 /* lgr %r3,%r7 */
2631 EMIT4(0xb9040000, REG_3, REG_7);
2632 /* la %r4,run_ctx_off(%r15) */
2633 EMIT4_DISP(0x41000000, REG_4, REG_15, tjit->run_ctx_off);
2634 /* brasl %r14,__bpf_prog_exit */
2635 EMIT6_PCREL_RILB_PTR(0xc0050000, REG_14, bpf_trampoline_exit(p));
2636
2637 return 0;
2638 }
2639
invoke_bpf(struct bpf_tramp_jit * tjit,const struct btf_func_model * m,struct bpf_tramp_nodes * tn,bool save_ret,u64 func_meta,int cookie_off)2640 static int invoke_bpf(struct bpf_tramp_jit *tjit,
2641 const struct btf_func_model *m,
2642 struct bpf_tramp_nodes *tn, bool save_ret,
2643 u64 func_meta, int cookie_off)
2644 {
2645 int i, cur_cookie = (tjit->bpf_args_off - cookie_off) / sizeof(u64);
2646 struct bpf_jit *jit = &tjit->common;
2647
2648 for (i = 0; i < tn->nr_nodes; i++) {
2649 if (bpf_prog_calls_session_cookie(tn->nodes[i])) {
2650 u64 meta = func_meta | ((u64)cur_cookie << BPF_TRAMP_COOKIE_INDEX_SHIFT);
2651
2652 emit_store_stack_imm64(jit, REG_0, tjit->func_meta_off, meta);
2653 cur_cookie--;
2654 }
2655 if (invoke_bpf_prog(tjit, m, tn->nodes[i], save_ret))
2656 return -EINVAL;
2657 }
2658
2659 return 0;
2660 }
2661
alloc_stack(struct bpf_tramp_jit * tjit,size_t size)2662 static int alloc_stack(struct bpf_tramp_jit *tjit, size_t size)
2663 {
2664 int stack_offset = tjit->stack_size;
2665
2666 tjit->stack_size += size;
2667 return stack_offset;
2668 }
2669
2670 /* ABI uses %r2 - %r6 for parameter passing. */
2671 #define MAX_NR_REG_ARGS 5
2672
2673 /* The "L" field of the "mvc" instruction is 8 bits. */
2674 #define MAX_MVC_SIZE 256
2675 #define MAX_NR_STACK_ARGS (MAX_MVC_SIZE / sizeof(u64))
2676
2677 /* -mfentry generates a 6-byte nop on s390x. */
2678 #define S390X_PATCH_SIZE 6
2679
__arch_prepare_bpf_trampoline(struct bpf_tramp_image * im,struct bpf_tramp_jit * tjit,const struct btf_func_model * m,u32 flags,struct bpf_tramp_nodes * tnodes,void * func_addr)2680 static int __arch_prepare_bpf_trampoline(struct bpf_tramp_image *im,
2681 struct bpf_tramp_jit *tjit,
2682 const struct btf_func_model *m,
2683 u32 flags,
2684 struct bpf_tramp_nodes *tnodes,
2685 void *func_addr)
2686 {
2687 struct bpf_tramp_nodes *fmod_ret = &tnodes[BPF_TRAMP_MODIFY_RETURN];
2688 struct bpf_tramp_nodes *fentry = &tnodes[BPF_TRAMP_FENTRY];
2689 struct bpf_tramp_nodes *fexit = &tnodes[BPF_TRAMP_FEXIT];
2690 int nr_bpf_args, nr_reg_args, nr_stack_args;
2691 int cookie_cnt, cookie_off, fsession_cnt;
2692 struct bpf_jit *jit = &tjit->common;
2693 int arg, bpf_arg_off;
2694 u64 func_meta;
2695 int i, j;
2696
2697 /* Support as many stack arguments as "mvc" instruction can handle. */
2698 nr_reg_args = min_t(int, m->nr_args, MAX_NR_REG_ARGS);
2699 nr_stack_args = m->nr_args - nr_reg_args;
2700 if (nr_stack_args > MAX_NR_STACK_ARGS)
2701 return -ENOTSUPP;
2702
2703 /* Return to %r14 in the struct_ops case. */
2704 if (flags & BPF_TRAMP_F_INDIRECT)
2705 flags |= BPF_TRAMP_F_SKIP_FRAME;
2706
2707 /*
2708 * Compute how many arguments we need to pass to BPF programs.
2709 * BPF ABI mirrors that of x86_64: arguments that are 16 bytes or
2710 * smaller are packed into 1 or 2 registers; larger arguments are
2711 * passed via pointers.
2712 * In s390x ABI, arguments that are 8 bytes or smaller are packed into
2713 * a register; larger arguments are passed via pointers.
2714 * We need to deal with this difference.
2715 */
2716 nr_bpf_args = 0;
2717 for (i = 0; i < m->nr_args; i++) {
2718 if (m->arg_size[i] <= 8)
2719 nr_bpf_args += 1;
2720 else if (m->arg_size[i] <= 16)
2721 nr_bpf_args += 2;
2722 else
2723 return -ENOTSUPP;
2724 }
2725
2726 cookie_cnt = bpf_fsession_cookie_cnt(tnodes);
2727 fsession_cnt = bpf_fsession_cnt(tnodes);
2728
2729 /*
2730 * Calculate the stack layout.
2731 */
2732
2733 /*
2734 * Allocate STACK_FRAME_OVERHEAD bytes for the callees. As the s390x
2735 * ABI requires, put our backchain at the end of the allocated memory.
2736 */
2737 tjit->stack_size = STACK_FRAME_OVERHEAD;
2738 tjit->backchain_off = tjit->stack_size - sizeof(u64);
2739 tjit->stack_args_off = alloc_stack(tjit, nr_stack_args * sizeof(u64));
2740 tjit->reg_args_off = alloc_stack(tjit, nr_reg_args * sizeof(u64));
2741 cookie_off = alloc_stack(tjit, cookie_cnt * sizeof(u64));
2742 tjit->ip_off = alloc_stack(tjit, sizeof(u64));
2743 tjit->func_meta_off = alloc_stack(tjit, sizeof(u64));
2744 tjit->bpf_args_off = alloc_stack(tjit, nr_bpf_args * sizeof(u64));
2745 tjit->retval_off = alloc_stack(tjit, sizeof(u64));
2746 tjit->r7_r8_off = alloc_stack(tjit, 2 * sizeof(u64));
2747 tjit->run_ctx_off = alloc_stack(tjit,
2748 sizeof(struct bpf_tramp_run_ctx));
2749 tjit->tccnt_off = alloc_stack(tjit, sizeof(u64));
2750 tjit->r14_off = alloc_stack(tjit, sizeof(u64) * 2);
2751 /*
2752 * In accordance with the s390x ABI, the caller has allocated
2753 * STACK_FRAME_OVERHEAD bytes for us. 8 of them contain the caller's
2754 * backchain, and the rest we can use.
2755 */
2756 tjit->stack_size -= STACK_FRAME_OVERHEAD - sizeof(u64);
2757 tjit->orig_stack_args_off = tjit->stack_size + STACK_FRAME_OVERHEAD;
2758
2759 /* lgr %r1,%r15 */
2760 EMIT4(0xb9040000, REG_1, REG_15);
2761 /* aghi %r15,-stack_size */
2762 EMIT4_IMM(0xa70b0000, REG_15, -tjit->stack_size);
2763 /* stg %r1,backchain_off(%r15) */
2764 EMIT6_DISP_LH(0xe3000000, 0x0024, REG_1, REG_0, REG_15,
2765 tjit->backchain_off);
2766 /* mvc tccnt_off(4,%r15),stack_size+tail_call_cnt(%r15) */
2767 _EMIT6(0xd203f000 | tjit->tccnt_off,
2768 0xf000 | (tjit->stack_size +
2769 offsetof(struct prog_frame, tail_call_cnt)));
2770 /* stmg %r2,%rN,fwd_reg_args_off(%r15) */
2771 if (nr_reg_args)
2772 EMIT6_DISP_LH(0xeb000000, 0x0024, REG_2,
2773 REG_2 + (nr_reg_args - 1), REG_15,
2774 tjit->reg_args_off);
2775 for (i = 0, j = 0; i < m->nr_args; i++) {
2776 if (i < MAX_NR_REG_ARGS)
2777 arg = REG_2 + i;
2778 else
2779 arg = tjit->orig_stack_args_off +
2780 (i - MAX_NR_REG_ARGS) * sizeof(u64);
2781 bpf_arg_off = tjit->bpf_args_off + j * sizeof(u64);
2782 if (m->arg_size[i] <= 8) {
2783 if (i < MAX_NR_REG_ARGS)
2784 /* stg %arg,bpf_arg_off(%r15) */
2785 EMIT6_DISP_LH(0xe3000000, 0x0024, arg,
2786 REG_0, REG_15, bpf_arg_off);
2787 else
2788 /* mvc bpf_arg_off(8,%r15),arg(%r15) */
2789 _EMIT6(0xd207f000 | bpf_arg_off,
2790 0xf000 | arg);
2791 j += 1;
2792 } else {
2793 if (i < MAX_NR_REG_ARGS) {
2794 /* mvc bpf_arg_off(16,%r15),0(%arg) */
2795 _EMIT6(0xd20ff000 | bpf_arg_off,
2796 reg2hex[arg] << 12);
2797 } else {
2798 /* lg %r1,arg(%r15) */
2799 EMIT6_DISP_LH(0xe3000000, 0x0004, REG_1, REG_0,
2800 REG_15, arg);
2801 /* mvc bpf_arg_off(16,%r15),0(%r1) */
2802 _EMIT6(0xd20ff000 | bpf_arg_off, 0x1000);
2803 }
2804 j += 2;
2805 }
2806 }
2807 /* stmg %r7,%r8,r7_r8_off(%r15) */
2808 EMIT6_DISP_LH(0xeb000000, 0x0024, REG_7, REG_8, REG_15,
2809 tjit->r7_r8_off);
2810 /* stg %r14,r14_off(%r15) */
2811 EMIT6_DISP_LH(0xe3000000, 0x0024, REG_14, REG_0, REG_15, tjit->r14_off);
2812
2813 if (flags & BPF_TRAMP_F_ORIG_STACK) {
2814 /*
2815 * The ftrace trampoline puts the return address (which is the
2816 * address of the original function + S390X_PATCH_SIZE) into
2817 * %r0; see ftrace_shared_hotpatch_trampoline_br and
2818 * ftrace_init_nop() for details.
2819 */
2820
2821 /* lgr %r8,%r0 */
2822 EMIT4(0xb9040000, REG_8, REG_0);
2823 }
2824
2825 /*
2826 * ip = func_addr;
2827 * arg_cnt = m->nr_args;
2828 */
2829
2830 if (flags & BPF_TRAMP_F_IP_ARG)
2831 emit_store_stack_imm64(jit, REG_0, tjit->ip_off, (u64)func_addr);
2832 func_meta = nr_bpf_args;
2833 /* lghi %r0,func_meta */
2834 EMIT4_IMM(0xa7090000, REG_0, func_meta);
2835 /* stg %r0,func_meta_off(%r15) */
2836 EMIT6_DISP_LH(0xe3000000, 0x0024, REG_0, REG_0, REG_15,
2837 tjit->func_meta_off);
2838
2839 if (flags & BPF_TRAMP_F_CALL_ORIG) {
2840 /*
2841 * __bpf_tramp_enter(im);
2842 */
2843
2844 /* %r2 = im */
2845 load_imm64(jit, REG_2, (u64)im);
2846 /* brasl %r14,__bpf_tramp_enter */
2847 EMIT6_PCREL_RILB_PTR(0xc0050000, REG_14, __bpf_tramp_enter);
2848 }
2849
2850 if (fsession_cnt) {
2851 /* Clear all the session cookies' value. */
2852 for (i = 0; i < cookie_cnt; i++)
2853 emit_store_stack_imm64(jit, REG_0, cookie_off + 8 * i, 0);
2854 /* Clear the return value to make sure fentry always gets 0. */
2855 emit_store_stack_imm64(jit, REG_0, tjit->retval_off, 0);
2856 }
2857
2858 if (invoke_bpf(tjit, m, fentry, flags & BPF_TRAMP_F_RET_FENTRY_RET,
2859 func_meta, cookie_off))
2860 return -EINVAL;
2861
2862 if (fmod_ret->nr_nodes) {
2863 /*
2864 * retval = 0;
2865 */
2866
2867 /* xc retval_off(8,%r15),retval_off(%r15) */
2868 _EMIT6(0xd707f000 | tjit->retval_off,
2869 0xf000 | tjit->retval_off);
2870
2871 for (i = 0; i < fmod_ret->nr_nodes; i++) {
2872 if (invoke_bpf_prog(tjit, m, fmod_ret->nodes[i], true))
2873 return -EINVAL;
2874
2875 /*
2876 * if (retval)
2877 * goto do_fexit;
2878 */
2879
2880 /* ltg %r0,retval_off(%r15) */
2881 EMIT6_DISP_LH(0xe3000000, 0x0002, REG_0, REG_0, REG_15,
2882 tjit->retval_off);
2883 /* brcl 7,do_fexit */
2884 EMIT6_PCREL_RILC(0xc0040000, 7, tjit->do_fexit);
2885 }
2886 }
2887
2888 if (flags & BPF_TRAMP_F_CALL_ORIG) {
2889 /*
2890 * retval = func_addr(args);
2891 */
2892
2893 /* lmg %r2,%rN,reg_args_off(%r15) */
2894 if (nr_reg_args)
2895 EMIT6_DISP_LH(0xeb000000, 0x0004, REG_2,
2896 REG_2 + (nr_reg_args - 1), REG_15,
2897 tjit->reg_args_off);
2898 /* mvc stack_args_off(N,%r15),orig_stack_args_off(%r15) */
2899 if (nr_stack_args)
2900 _EMIT6(0xd200f000 |
2901 (nr_stack_args * sizeof(u64) - 1) << 16 |
2902 tjit->stack_args_off,
2903 0xf000 | tjit->orig_stack_args_off);
2904 /* mvc tail_call_cnt(4,%r15),tccnt_off(%r15) */
2905 _EMIT6(0xd203f000 | offsetof(struct prog_frame, tail_call_cnt),
2906 0xf000 | tjit->tccnt_off);
2907 if (flags & BPF_TRAMP_F_ORIG_STACK) {
2908 if (nospec_uses_trampoline())
2909 /* brasl %r14,__s390_indirect_jump_r8 */
2910 EMIT6_PCREL_RILB_PTR(0xc0050000, REG_14,
2911 __s390_indirect_jump_r8);
2912 else
2913 /* basr %r14,%r8 */
2914 EMIT2(0x0d00, REG_14, REG_8);
2915 } else {
2916 /* brasl %r14,func_addr+S390X_PATCH_SIZE */
2917 EMIT6_PCREL_RILB_PTR(0xc0050000, REG_14,
2918 func_addr + S390X_PATCH_SIZE);
2919 }
2920 /* stg %r2,retval_off(%r15) */
2921 EMIT6_DISP_LH(0xe3000000, 0x0024, REG_2, REG_0, REG_15,
2922 tjit->retval_off);
2923 /* mvc tccnt_off(%r15),tail_call_cnt(4,%r15) */
2924 _EMIT6(0xd203f000 | tjit->tccnt_off,
2925 0xf000 | offsetof(struct prog_frame, tail_call_cnt));
2926
2927 im->ip_after_call = jit->prg_buf + jit->prg;
2928
2929 /*
2930 * The following nop will be patched by bpf_tramp_image_put().
2931 */
2932
2933 /* brcl 0,im->ip_epilogue */
2934 EMIT6_PCREL_RILC(0xc0040000, 0, (u64)im->ip_epilogue);
2935 }
2936
2937 /* Set the "is_return" flag for fsession. */
2938 func_meta |= (1ULL << BPF_TRAMP_IS_RETURN_SHIFT);
2939 if (fsession_cnt)
2940 emit_store_stack_imm64(jit, REG_W0, tjit->func_meta_off,
2941 func_meta);
2942
2943 /* do_fexit: */
2944 tjit->do_fexit = jit->prg;
2945 if (invoke_bpf(tjit, m, fexit, false, func_meta, cookie_off))
2946 return -EINVAL;
2947
2948 if (flags & BPF_TRAMP_F_CALL_ORIG) {
2949 im->ip_epilogue = jit->prg_buf + jit->prg;
2950
2951 /*
2952 * __bpf_tramp_exit(im);
2953 */
2954
2955 /* %r2 = im */
2956 load_imm64(jit, REG_2, (u64)im);
2957 /* brasl %r14,__bpf_tramp_exit */
2958 EMIT6_PCREL_RILB_PTR(0xc0050000, REG_14, __bpf_tramp_exit);
2959 }
2960
2961 /* lmg %r2,%rN,reg_args_off(%r15) */
2962 if ((flags & BPF_TRAMP_F_RESTORE_REGS) && nr_reg_args)
2963 EMIT6_DISP_LH(0xeb000000, 0x0004, REG_2,
2964 REG_2 + (nr_reg_args - 1), REG_15,
2965 tjit->reg_args_off);
2966 /* lgr %r1,%r8 */
2967 if (!(flags & BPF_TRAMP_F_SKIP_FRAME) &&
2968 (flags & BPF_TRAMP_F_ORIG_STACK))
2969 EMIT4(0xb9040000, REG_1, REG_8);
2970 /* lmg %r7,%r8,r7_r8_off(%r15) */
2971 EMIT6_DISP_LH(0xeb000000, 0x0004, REG_7, REG_8, REG_15,
2972 tjit->r7_r8_off);
2973 /* lg %r14,r14_off(%r15) */
2974 EMIT6_DISP_LH(0xe3000000, 0x0004, REG_14, REG_0, REG_15, tjit->r14_off);
2975 /* lg %r2,retval_off(%r15) */
2976 if (flags & (BPF_TRAMP_F_CALL_ORIG | BPF_TRAMP_F_RET_FENTRY_RET))
2977 EMIT6_DISP_LH(0xe3000000, 0x0004, REG_2, REG_0, REG_15,
2978 tjit->retval_off);
2979 /* mvc stack_size+tail_call_cnt(4,%r15),tccnt_off(%r15) */
2980 _EMIT6(0xd203f000 | (tjit->stack_size +
2981 offsetof(struct prog_frame, tail_call_cnt)),
2982 0xf000 | tjit->tccnt_off);
2983 /* aghi %r15,stack_size */
2984 EMIT4_IMM(0xa70b0000, REG_15, tjit->stack_size);
2985 if (flags & BPF_TRAMP_F_SKIP_FRAME)
2986 EMIT_JUMP_REG(14);
2987 else if (flags & BPF_TRAMP_F_ORIG_STACK)
2988 EMIT_JUMP_REG(1);
2989 else
2990 /* brcl 0xf,func_addr+S390X_PATCH_SIZE */
2991 EMIT6_PCREL_RILC_PTR(0xc0040000, 0xf,
2992 func_addr + S390X_PATCH_SIZE);
2993 return 0;
2994 }
2995
arch_bpf_trampoline_size(const struct btf_func_model * m,u32 flags,struct bpf_tramp_nodes * tnodes,void * orig_call)2996 int arch_bpf_trampoline_size(const struct btf_func_model *m, u32 flags,
2997 struct bpf_tramp_nodes *tnodes, void *orig_call)
2998 {
2999 struct bpf_tramp_image im;
3000 struct bpf_tramp_jit tjit;
3001 int ret;
3002
3003 memset(&tjit, 0, sizeof(tjit));
3004
3005 ret = __arch_prepare_bpf_trampoline(&im, &tjit, m, flags,
3006 tnodes, orig_call);
3007
3008 return ret < 0 ? ret : tjit.common.prg;
3009 }
3010
arch_prepare_bpf_trampoline(struct bpf_tramp_image * im,void * image,void * image_end,const struct btf_func_model * m,u32 flags,struct bpf_tramp_nodes * tnodes,void * func_addr)3011 int arch_prepare_bpf_trampoline(struct bpf_tramp_image *im, void *image,
3012 void *image_end, const struct btf_func_model *m,
3013 u32 flags, struct bpf_tramp_nodes *tnodes,
3014 void *func_addr)
3015 {
3016 struct bpf_tramp_jit tjit;
3017 int ret;
3018
3019 /* Compute offsets, check whether the code fits. */
3020 memset(&tjit, 0, sizeof(tjit));
3021 ret = __arch_prepare_bpf_trampoline(im, &tjit, m, flags,
3022 tnodes, func_addr);
3023
3024 if (ret < 0)
3025 return ret;
3026 if (tjit.common.prg > (char *)image_end - (char *)image)
3027 /*
3028 * Use the same error code as for exceeding
3029 * BPF_MAX_TRAMP_LINKS.
3030 */
3031 return -E2BIG;
3032
3033 tjit.common.prg = 0;
3034 tjit.common.prg_buf = image;
3035 ret = __arch_prepare_bpf_trampoline(im, &tjit, m, flags,
3036 tnodes, func_addr);
3037
3038 return ret < 0 ? ret : tjit.common.prg;
3039 }
3040
bpf_jit_supports_subprog_tailcalls(void)3041 bool bpf_jit_supports_subprog_tailcalls(void)
3042 {
3043 return true;
3044 }
3045
bpf_jit_supports_arena(void)3046 bool bpf_jit_supports_arena(void)
3047 {
3048 return true;
3049 }
3050
bpf_jit_supports_fsession(void)3051 bool bpf_jit_supports_fsession(void)
3052 {
3053 return true;
3054 }
3055
bpf_jit_supports_insn(struct bpf_insn * insn,bool in_arena)3056 bool bpf_jit_supports_insn(struct bpf_insn *insn, bool in_arena)
3057 {
3058 if (!in_arena)
3059 return true;
3060 switch (insn->code) {
3061 case BPF_LDX | BPF_MEMSX | BPF_B:
3062 case BPF_LDX | BPF_MEMSX | BPF_H:
3063 case BPF_LDX | BPF_MEMSX | BPF_W:
3064 return false;
3065 }
3066 return true;
3067 }
3068
bpf_jit_supports_exceptions(void)3069 bool bpf_jit_supports_exceptions(void)
3070 {
3071 /*
3072 * Exceptions require unwinding support, which is always available,
3073 * because the kernel is always built with backchain.
3074 */
3075 return true;
3076 }
3077
arch_bpf_stack_walk(bool (* consume_fn)(void *,u64,u64,u64),void * cookie)3078 void arch_bpf_stack_walk(bool (*consume_fn)(void *, u64, u64, u64),
3079 void *cookie)
3080 {
3081 unsigned long addr, prev_addr = 0;
3082 struct unwind_state state;
3083
3084 unwind_for_each_frame(&state, NULL, NULL, 0) {
3085 addr = unwind_get_return_address(&state);
3086 if (!addr)
3087 break;
3088 /*
3089 * addr is a return address and state.sp is the value of %r15
3090 * at this address. exception_cb needs %r15 at entry to the
3091 * function containing addr, so take the next state.sp.
3092 *
3093 * There is no bp, and the exception_cb prog does not need one
3094 * to perform a quasi-longjmp. The common code requires a
3095 * non-zero bp, so pass sp there as well.
3096 */
3097 if (prev_addr && !consume_fn(cookie, prev_addr, state.sp,
3098 state.sp))
3099 break;
3100 prev_addr = addr;
3101 }
3102 }
3103
bpf_jit_supports_timed_may_goto(void)3104 bool bpf_jit_supports_timed_may_goto(void)
3105 {
3106 return true;
3107 }
3108
bpf_jit_inlines_helper_call(s32 imm)3109 bool bpf_jit_inlines_helper_call(s32 imm)
3110 {
3111 switch (imm) {
3112 case BPF_FUNC_get_smp_processor_id:
3113 case BPF_FUNC_get_current_task:
3114 case BPF_FUNC_get_current_task_btf:
3115 return true;
3116 default:
3117 return false;
3118 }
3119 }
3120