bpf_jit_comp.c 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335
  1. /*
  2. * BPF Jit compiler for s390.
  3. *
  4. * Minimum build requirements:
  5. *
  6. * - HAVE_MARCH_Z196_FEATURES: laal, laalg
  7. * - HAVE_MARCH_Z10_FEATURES: msfi, cgrj, clgrj
  8. * - HAVE_MARCH_Z9_109_FEATURES: alfi, llilf, clfi, oilf, nilf
  9. * - PACK_STACK
  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. #define KMSG_COMPONENT "bpf_jit"
  18. #define pr_fmt(fmt) KMSG_COMPONENT ": " fmt
  19. #include <linux/netdevice.h>
  20. #include <linux/filter.h>
  21. #include <linux/init.h>
  22. #include <linux/bpf.h>
  23. #include <asm/cacheflush.h>
  24. #include <asm/dis.h>
  25. #include "bpf_jit.h"
  26. int bpf_jit_enable __read_mostly;
  27. struct bpf_jit {
  28. u32 seen; /* Flags to remember seen eBPF instructions */
  29. u32 seen_reg[16]; /* Array to remember which registers are used */
  30. u32 *addrs; /* Array with relative instruction addresses */
  31. u8 *prg_buf; /* Start of program */
  32. int size; /* Size of program and literal pool */
  33. int size_prg; /* Size of program */
  34. int prg; /* Current position in program */
  35. int lit_start; /* Start of literal pool */
  36. int lit; /* Current position in literal pool */
  37. int base_ip; /* Base address for literal pool */
  38. int ret0_ip; /* Address of return 0 */
  39. int exit_ip; /* Address of exit */
  40. int tail_call_start; /* Tail call start offset */
  41. int labels[1]; /* Labels for local jumps */
  42. };
  43. #define BPF_SIZE_MAX 0x7ffff /* Max size for program (20 bit signed displ) */
  44. #define SEEN_SKB 1 /* skb access */
  45. #define SEEN_MEM 2 /* use mem[] for temporary storage */
  46. #define SEEN_RET0 4 /* ret0_ip points to a valid return 0 */
  47. #define SEEN_LITERAL 8 /* code uses literals */
  48. #define SEEN_FUNC 16 /* calls C functions */
  49. #define SEEN_TAIL_CALL 32 /* code uses tail calls */
  50. #define SEEN_SKB_CHANGE 64 /* code changes skb data */
  51. #define SEEN_STACK (SEEN_FUNC | SEEN_MEM | SEEN_SKB)
  52. /*
  53. * s390 registers
  54. */
  55. #define REG_W0 (__MAX_BPF_REG+0) /* Work register 1 (even) */
  56. #define REG_W1 (__MAX_BPF_REG+1) /* Work register 2 (odd) */
  57. #define REG_SKB_DATA (__MAX_BPF_REG+2) /* SKB data register */
  58. #define REG_L (__MAX_BPF_REG+3) /* Literal pool register */
  59. #define REG_15 (__MAX_BPF_REG+4) /* Register 15 */
  60. #define REG_0 REG_W0 /* Register 0 */
  61. #define REG_1 REG_W1 /* Register 1 */
  62. #define REG_2 BPF_REG_1 /* Register 2 */
  63. #define REG_14 BPF_REG_0 /* Register 14 */
  64. /*
  65. * Mapping of BPF registers to s390 registers
  66. */
  67. static const int reg2hex[] = {
  68. /* Return code */
  69. [BPF_REG_0] = 14,
  70. /* Function parameters */
  71. [BPF_REG_1] = 2,
  72. [BPF_REG_2] = 3,
  73. [BPF_REG_3] = 4,
  74. [BPF_REG_4] = 5,
  75. [BPF_REG_5] = 6,
  76. /* Call saved registers */
  77. [BPF_REG_6] = 7,
  78. [BPF_REG_7] = 8,
  79. [BPF_REG_8] = 9,
  80. [BPF_REG_9] = 10,
  81. /* BPF stack pointer */
  82. [BPF_REG_FP] = 13,
  83. /* SKB data pointer */
  84. [REG_SKB_DATA] = 12,
  85. /* Work registers for s390x backend */
  86. [REG_W0] = 0,
  87. [REG_W1] = 1,
  88. [REG_L] = 11,
  89. [REG_15] = 15,
  90. };
  91. static inline u32 reg(u32 dst_reg, u32 src_reg)
  92. {
  93. return reg2hex[dst_reg] << 4 | reg2hex[src_reg];
  94. }
  95. static inline u32 reg_high(u32 reg)
  96. {
  97. return reg2hex[reg] << 4;
  98. }
  99. static inline void reg_set_seen(struct bpf_jit *jit, u32 b1)
  100. {
  101. u32 r1 = reg2hex[b1];
  102. if (!jit->seen_reg[r1] && r1 >= 6 && r1 <= 15)
  103. jit->seen_reg[r1] = 1;
  104. }
  105. #define REG_SET_SEEN(b1) \
  106. ({ \
  107. reg_set_seen(jit, b1); \
  108. })
  109. #define REG_SEEN(b1) jit->seen_reg[reg2hex[(b1)]]
  110. /*
  111. * EMIT macros for code generation
  112. */
  113. #define _EMIT2(op) \
  114. ({ \
  115. if (jit->prg_buf) \
  116. *(u16 *) (jit->prg_buf + jit->prg) = op; \
  117. jit->prg += 2; \
  118. })
  119. #define EMIT2(op, b1, b2) \
  120. ({ \
  121. _EMIT2(op | reg(b1, b2)); \
  122. REG_SET_SEEN(b1); \
  123. REG_SET_SEEN(b2); \
  124. })
  125. #define _EMIT4(op) \
  126. ({ \
  127. if (jit->prg_buf) \
  128. *(u32 *) (jit->prg_buf + jit->prg) = op; \
  129. jit->prg += 4; \
  130. })
  131. #define EMIT4(op, b1, b2) \
  132. ({ \
  133. _EMIT4(op | reg(b1, b2)); \
  134. REG_SET_SEEN(b1); \
  135. REG_SET_SEEN(b2); \
  136. })
  137. #define EMIT4_RRF(op, b1, b2, b3) \
  138. ({ \
  139. _EMIT4(op | reg_high(b3) << 8 | reg(b1, b2)); \
  140. REG_SET_SEEN(b1); \
  141. REG_SET_SEEN(b2); \
  142. REG_SET_SEEN(b3); \
  143. })
  144. #define _EMIT4_DISP(op, disp) \
  145. ({ \
  146. unsigned int __disp = (disp) & 0xfff; \
  147. _EMIT4(op | __disp); \
  148. })
  149. #define EMIT4_DISP(op, b1, b2, disp) \
  150. ({ \
  151. _EMIT4_DISP(op | reg_high(b1) << 16 | \
  152. reg_high(b2) << 8, disp); \
  153. REG_SET_SEEN(b1); \
  154. REG_SET_SEEN(b2); \
  155. })
  156. #define EMIT4_IMM(op, b1, imm) \
  157. ({ \
  158. unsigned int __imm = (imm) & 0xffff; \
  159. _EMIT4(op | reg_high(b1) << 16 | __imm); \
  160. REG_SET_SEEN(b1); \
  161. })
  162. #define EMIT4_PCREL(op, pcrel) \
  163. ({ \
  164. long __pcrel = ((pcrel) >> 1) & 0xffff; \
  165. _EMIT4(op | __pcrel); \
  166. })
  167. #define _EMIT6(op1, op2) \
  168. ({ \
  169. if (jit->prg_buf) { \
  170. *(u32 *) (jit->prg_buf + jit->prg) = op1; \
  171. *(u16 *) (jit->prg_buf + jit->prg + 4) = op2; \
  172. } \
  173. jit->prg += 6; \
  174. })
  175. #define _EMIT6_DISP(op1, op2, disp) \
  176. ({ \
  177. unsigned int __disp = (disp) & 0xfff; \
  178. _EMIT6(op1 | __disp, op2); \
  179. })
  180. #define _EMIT6_DISP_LH(op1, op2, disp) \
  181. ({ \
  182. u32 _disp = (u32) disp; \
  183. unsigned int __disp_h = _disp & 0xff000; \
  184. unsigned int __disp_l = _disp & 0x00fff; \
  185. _EMIT6(op1 | __disp_l, op2 | __disp_h >> 4); \
  186. })
  187. #define EMIT6_DISP_LH(op1, op2, b1, b2, b3, disp) \
  188. ({ \
  189. _EMIT6_DISP_LH(op1 | reg(b1, b2) << 16 | \
  190. reg_high(b3) << 8, op2, disp); \
  191. REG_SET_SEEN(b1); \
  192. REG_SET_SEEN(b2); \
  193. REG_SET_SEEN(b3); \
  194. })
  195. #define EMIT6_PCREL_LABEL(op1, op2, b1, b2, label, mask) \
  196. ({ \
  197. int rel = (jit->labels[label] - jit->prg) >> 1; \
  198. _EMIT6(op1 | reg(b1, b2) << 16 | (rel & 0xffff), \
  199. op2 | mask << 12); \
  200. REG_SET_SEEN(b1); \
  201. REG_SET_SEEN(b2); \
  202. })
  203. #define EMIT6_PCREL_IMM_LABEL(op1, op2, b1, imm, label, mask) \
  204. ({ \
  205. int rel = (jit->labels[label] - jit->prg) >> 1; \
  206. _EMIT6(op1 | (reg_high(b1) | mask) << 16 | \
  207. (rel & 0xffff), op2 | (imm & 0xff) << 8); \
  208. REG_SET_SEEN(b1); \
  209. BUILD_BUG_ON(((unsigned long) imm) > 0xff); \
  210. })
  211. #define EMIT6_PCREL(op1, op2, b1, b2, i, off, mask) \
  212. ({ \
  213. /* Branch instruction needs 6 bytes */ \
  214. int rel = (addrs[i + off + 1] - (addrs[i + 1] - 6)) / 2;\
  215. _EMIT6(op1 | reg(b1, b2) << 16 | (rel & 0xffff), op2 | mask); \
  216. REG_SET_SEEN(b1); \
  217. REG_SET_SEEN(b2); \
  218. })
  219. #define _EMIT6_IMM(op, imm) \
  220. ({ \
  221. unsigned int __imm = (imm); \
  222. _EMIT6(op | (__imm >> 16), __imm & 0xffff); \
  223. })
  224. #define EMIT6_IMM(op, b1, imm) \
  225. ({ \
  226. _EMIT6_IMM(op | reg_high(b1) << 16, imm); \
  227. REG_SET_SEEN(b1); \
  228. })
  229. #define EMIT_CONST_U32(val) \
  230. ({ \
  231. unsigned int ret; \
  232. ret = jit->lit - jit->base_ip; \
  233. jit->seen |= SEEN_LITERAL; \
  234. if (jit->prg_buf) \
  235. *(u32 *) (jit->prg_buf + jit->lit) = (u32) val; \
  236. jit->lit += 4; \
  237. ret; \
  238. })
  239. #define EMIT_CONST_U64(val) \
  240. ({ \
  241. unsigned int ret; \
  242. ret = jit->lit - jit->base_ip; \
  243. jit->seen |= SEEN_LITERAL; \
  244. if (jit->prg_buf) \
  245. *(u64 *) (jit->prg_buf + jit->lit) = (u64) val; \
  246. jit->lit += 8; \
  247. ret; \
  248. })
  249. #define EMIT_ZERO(b1) \
  250. ({ \
  251. /* llgfr %dst,%dst (zero extend to 64 bit) */ \
  252. EMIT4(0xb9160000, b1, b1); \
  253. REG_SET_SEEN(b1); \
  254. })
  255. /*
  256. * Fill whole space with illegal instructions
  257. */
  258. static void jit_fill_hole(void *area, unsigned int size)
  259. {
  260. memset(area, 0, size);
  261. }
  262. /*
  263. * Save registers from "rs" (register start) to "re" (register end) on stack
  264. */
  265. static void save_regs(struct bpf_jit *jit, u32 rs, u32 re)
  266. {
  267. u32 off = STK_OFF_R6 + (rs - 6) * 8;
  268. if (rs == re)
  269. /* stg %rs,off(%r15) */
  270. _EMIT6(0xe300f000 | rs << 20 | off, 0x0024);
  271. else
  272. /* stmg %rs,%re,off(%r15) */
  273. _EMIT6_DISP(0xeb00f000 | rs << 20 | re << 16, 0x0024, off);
  274. }
  275. /*
  276. * Restore registers from "rs" (register start) to "re" (register end) on stack
  277. */
  278. static void restore_regs(struct bpf_jit *jit, u32 rs, u32 re)
  279. {
  280. u32 off = STK_OFF_R6 + (rs - 6) * 8;
  281. if (jit->seen & SEEN_STACK)
  282. off += STK_OFF;
  283. if (rs == re)
  284. /* lg %rs,off(%r15) */
  285. _EMIT6(0xe300f000 | rs << 20 | off, 0x0004);
  286. else
  287. /* lmg %rs,%re,off(%r15) */
  288. _EMIT6_DISP(0xeb00f000 | rs << 20 | re << 16, 0x0004, off);
  289. }
  290. /*
  291. * Return first seen register (from start)
  292. */
  293. static int get_start(struct bpf_jit *jit, int start)
  294. {
  295. int i;
  296. for (i = start; i <= 15; i++) {
  297. if (jit->seen_reg[i])
  298. return i;
  299. }
  300. return 0;
  301. }
  302. /*
  303. * Return last seen register (from start) (gap >= 2)
  304. */
  305. static int get_end(struct bpf_jit *jit, int start)
  306. {
  307. int i;
  308. for (i = start; i < 15; i++) {
  309. if (!jit->seen_reg[i] && !jit->seen_reg[i + 1])
  310. return i - 1;
  311. }
  312. return jit->seen_reg[15] ? 15 : 14;
  313. }
  314. #define REGS_SAVE 1
  315. #define REGS_RESTORE 0
  316. /*
  317. * Save and restore clobbered registers (6-15) on stack.
  318. * We save/restore registers in chunks with gap >= 2 registers.
  319. */
  320. static void save_restore_regs(struct bpf_jit *jit, int op)
  321. {
  322. int re = 6, rs;
  323. do {
  324. rs = get_start(jit, re);
  325. if (!rs)
  326. break;
  327. re = get_end(jit, rs + 1);
  328. if (op == REGS_SAVE)
  329. save_regs(jit, rs, re);
  330. else
  331. restore_regs(jit, rs, re);
  332. re++;
  333. } while (re <= 15);
  334. }
  335. /*
  336. * For SKB access %b1 contains the SKB pointer. For "bpf_jit.S"
  337. * we store the SKB header length on the stack and the SKB data
  338. * pointer in REG_SKB_DATA.
  339. */
  340. static void emit_load_skb_data_hlen(struct bpf_jit *jit)
  341. {
  342. /* Header length: llgf %w1,<len>(%b1) */
  343. EMIT6_DISP_LH(0xe3000000, 0x0016, REG_W1, REG_0, BPF_REG_1,
  344. offsetof(struct sk_buff, len));
  345. /* s %w1,<data_len>(%b1) */
  346. EMIT4_DISP(0x5b000000, REG_W1, BPF_REG_1,
  347. offsetof(struct sk_buff, data_len));
  348. /* stg %w1,ST_OFF_HLEN(%r0,%r15) */
  349. EMIT6_DISP_LH(0xe3000000, 0x0024, REG_W1, REG_0, REG_15, STK_OFF_HLEN);
  350. /* lg %skb_data,data_off(%b1) */
  351. EMIT6_DISP_LH(0xe3000000, 0x0004, REG_SKB_DATA, REG_0,
  352. BPF_REG_1, offsetof(struct sk_buff, data));
  353. }
  354. /*
  355. * Emit function prologue
  356. *
  357. * Save registers and create stack frame if necessary.
  358. * See stack frame layout desription in "bpf_jit.h"!
  359. */
  360. static void bpf_jit_prologue(struct bpf_jit *jit, bool is_classic)
  361. {
  362. if (jit->seen & SEEN_TAIL_CALL) {
  363. /* xc STK_OFF_TCCNT(4,%r15),STK_OFF_TCCNT(%r15) */
  364. _EMIT6(0xd703f000 | STK_OFF_TCCNT, 0xf000 | STK_OFF_TCCNT);
  365. } else {
  366. /* j tail_call_start: NOP if no tail calls are used */
  367. EMIT4_PCREL(0xa7f40000, 6);
  368. _EMIT2(0);
  369. }
  370. /* Tail calls have to skip above initialization */
  371. jit->tail_call_start = jit->prg;
  372. /* Save registers */
  373. save_restore_regs(jit, REGS_SAVE);
  374. /* Setup literal pool */
  375. if (jit->seen & SEEN_LITERAL) {
  376. /* basr %r13,0 */
  377. EMIT2(0x0d00, REG_L, REG_0);
  378. jit->base_ip = jit->prg;
  379. }
  380. /* Setup stack and backchain */
  381. if (jit->seen & SEEN_STACK) {
  382. if (jit->seen & SEEN_FUNC)
  383. /* lgr %w1,%r15 (backchain) */
  384. EMIT4(0xb9040000, REG_W1, REG_15);
  385. /* la %bfp,STK_160_UNUSED(%r15) (BPF frame pointer) */
  386. EMIT4_DISP(0x41000000, BPF_REG_FP, REG_15, STK_160_UNUSED);
  387. /* aghi %r15,-STK_OFF */
  388. EMIT4_IMM(0xa70b0000, REG_15, -STK_OFF);
  389. if (jit->seen & SEEN_FUNC)
  390. /* stg %w1,152(%r15) (backchain) */
  391. EMIT6_DISP_LH(0xe3000000, 0x0024, REG_W1, REG_0,
  392. REG_15, 152);
  393. }
  394. if (jit->seen & SEEN_SKB)
  395. emit_load_skb_data_hlen(jit);
  396. if (jit->seen & SEEN_SKB_CHANGE)
  397. /* stg %b1,ST_OFF_SKBP(%r0,%r15) */
  398. EMIT6_DISP_LH(0xe3000000, 0x0024, REG_W1, REG_0, REG_15,
  399. STK_OFF_SKBP);
  400. /* Clear A (%b0) and X (%b7) registers for converted BPF programs */
  401. if (is_classic) {
  402. if (REG_SEEN(BPF_REG_A))
  403. /* lghi %ba,0 */
  404. EMIT4_IMM(0xa7090000, BPF_REG_A, 0);
  405. if (REG_SEEN(BPF_REG_X))
  406. /* lghi %bx,0 */
  407. EMIT4_IMM(0xa7090000, BPF_REG_X, 0);
  408. }
  409. }
  410. /*
  411. * Function epilogue
  412. */
  413. static void bpf_jit_epilogue(struct bpf_jit *jit)
  414. {
  415. /* Return 0 */
  416. if (jit->seen & SEEN_RET0) {
  417. jit->ret0_ip = jit->prg;
  418. /* lghi %b0,0 */
  419. EMIT4_IMM(0xa7090000, BPF_REG_0, 0);
  420. }
  421. jit->exit_ip = jit->prg;
  422. /* Load exit code: lgr %r2,%b0 */
  423. EMIT4(0xb9040000, REG_2, BPF_REG_0);
  424. /* Restore registers */
  425. save_restore_regs(jit, REGS_RESTORE);
  426. /* br %r14 */
  427. _EMIT2(0x07fe);
  428. }
  429. /*
  430. * Compile one eBPF instruction into s390x code
  431. *
  432. * NOTE: Use noinline because for gcov (-fprofile-arcs) gcc allocates a lot of
  433. * stack space for the large switch statement.
  434. */
  435. static noinline int bpf_jit_insn(struct bpf_jit *jit, struct bpf_prog *fp, int i)
  436. {
  437. struct bpf_insn *insn = &fp->insnsi[i];
  438. int jmp_off, last, insn_count = 1;
  439. unsigned int func_addr, mask;
  440. u32 dst_reg = insn->dst_reg;
  441. u32 src_reg = insn->src_reg;
  442. u32 *addrs = jit->addrs;
  443. s32 imm = insn->imm;
  444. s16 off = insn->off;
  445. switch (insn->code) {
  446. /*
  447. * BPF_MOV
  448. */
  449. case BPF_ALU | BPF_MOV | BPF_X: /* dst = (u32) src */
  450. /* llgfr %dst,%src */
  451. EMIT4(0xb9160000, dst_reg, src_reg);
  452. break;
  453. case BPF_ALU64 | BPF_MOV | BPF_X: /* dst = src */
  454. /* lgr %dst,%src */
  455. EMIT4(0xb9040000, dst_reg, src_reg);
  456. break;
  457. case BPF_ALU | BPF_MOV | BPF_K: /* dst = (u32) imm */
  458. /* llilf %dst,imm */
  459. EMIT6_IMM(0xc00f0000, dst_reg, imm);
  460. break;
  461. case BPF_ALU64 | BPF_MOV | BPF_K: /* dst = imm */
  462. /* lgfi %dst,imm */
  463. EMIT6_IMM(0xc0010000, dst_reg, imm);
  464. break;
  465. /*
  466. * BPF_LD 64
  467. */
  468. case BPF_LD | BPF_IMM | BPF_DW: /* dst = (u64) imm */
  469. {
  470. /* 16 byte instruction that uses two 'struct bpf_insn' */
  471. u64 imm64;
  472. imm64 = (u64)(u32) insn[0].imm | ((u64)(u32) insn[1].imm) << 32;
  473. /* lg %dst,<d(imm)>(%l) */
  474. EMIT6_DISP_LH(0xe3000000, 0x0004, dst_reg, REG_0, REG_L,
  475. EMIT_CONST_U64(imm64));
  476. insn_count = 2;
  477. break;
  478. }
  479. /*
  480. * BPF_ADD
  481. */
  482. case BPF_ALU | BPF_ADD | BPF_X: /* dst = (u32) dst + (u32) src */
  483. /* ar %dst,%src */
  484. EMIT2(0x1a00, dst_reg, src_reg);
  485. EMIT_ZERO(dst_reg);
  486. break;
  487. case BPF_ALU64 | BPF_ADD | BPF_X: /* dst = dst + src */
  488. /* agr %dst,%src */
  489. EMIT4(0xb9080000, dst_reg, src_reg);
  490. break;
  491. case BPF_ALU | BPF_ADD | BPF_K: /* dst = (u32) dst + (u32) imm */
  492. if (!imm)
  493. break;
  494. /* alfi %dst,imm */
  495. EMIT6_IMM(0xc20b0000, dst_reg, imm);
  496. EMIT_ZERO(dst_reg);
  497. break;
  498. case BPF_ALU64 | BPF_ADD | BPF_K: /* dst = dst + imm */
  499. if (!imm)
  500. break;
  501. /* agfi %dst,imm */
  502. EMIT6_IMM(0xc2080000, dst_reg, imm);
  503. break;
  504. /*
  505. * BPF_SUB
  506. */
  507. case BPF_ALU | BPF_SUB | BPF_X: /* dst = (u32) dst - (u32) src */
  508. /* sr %dst,%src */
  509. EMIT2(0x1b00, dst_reg, src_reg);
  510. EMIT_ZERO(dst_reg);
  511. break;
  512. case BPF_ALU64 | BPF_SUB | BPF_X: /* dst = dst - src */
  513. /* sgr %dst,%src */
  514. EMIT4(0xb9090000, dst_reg, src_reg);
  515. break;
  516. case BPF_ALU | BPF_SUB | BPF_K: /* dst = (u32) dst - (u32) imm */
  517. if (!imm)
  518. break;
  519. /* alfi %dst,-imm */
  520. EMIT6_IMM(0xc20b0000, dst_reg, -imm);
  521. EMIT_ZERO(dst_reg);
  522. break;
  523. case BPF_ALU64 | BPF_SUB | BPF_K: /* dst = dst - imm */
  524. if (!imm)
  525. break;
  526. /* agfi %dst,-imm */
  527. EMIT6_IMM(0xc2080000, dst_reg, -imm);
  528. break;
  529. /*
  530. * BPF_MUL
  531. */
  532. case BPF_ALU | BPF_MUL | BPF_X: /* dst = (u32) dst * (u32) src */
  533. /* msr %dst,%src */
  534. EMIT4(0xb2520000, dst_reg, src_reg);
  535. EMIT_ZERO(dst_reg);
  536. break;
  537. case BPF_ALU64 | BPF_MUL | BPF_X: /* dst = dst * src */
  538. /* msgr %dst,%src */
  539. EMIT4(0xb90c0000, dst_reg, src_reg);
  540. break;
  541. case BPF_ALU | BPF_MUL | BPF_K: /* dst = (u32) dst * (u32) imm */
  542. if (imm == 1)
  543. break;
  544. /* msfi %r5,imm */
  545. EMIT6_IMM(0xc2010000, dst_reg, imm);
  546. EMIT_ZERO(dst_reg);
  547. break;
  548. case BPF_ALU64 | BPF_MUL | BPF_K: /* dst = dst * imm */
  549. if (imm == 1)
  550. break;
  551. /* msgfi %dst,imm */
  552. EMIT6_IMM(0xc2000000, dst_reg, imm);
  553. break;
  554. /*
  555. * BPF_DIV / BPF_MOD
  556. */
  557. case BPF_ALU | BPF_DIV | BPF_X: /* dst = (u32) dst / (u32) src */
  558. case BPF_ALU | BPF_MOD | BPF_X: /* dst = (u32) dst % (u32) src */
  559. {
  560. int rc_reg = BPF_OP(insn->code) == BPF_DIV ? REG_W1 : REG_W0;
  561. jit->seen |= SEEN_RET0;
  562. /* ltr %src,%src (if src == 0 goto fail) */
  563. EMIT2(0x1200, src_reg, src_reg);
  564. /* jz <ret0> */
  565. EMIT4_PCREL(0xa7840000, jit->ret0_ip - jit->prg);
  566. /* lhi %w0,0 */
  567. EMIT4_IMM(0xa7080000, REG_W0, 0);
  568. /* lr %w1,%dst */
  569. EMIT2(0x1800, REG_W1, dst_reg);
  570. /* dlr %w0,%src */
  571. EMIT4(0xb9970000, REG_W0, src_reg);
  572. /* llgfr %dst,%rc */
  573. EMIT4(0xb9160000, dst_reg, rc_reg);
  574. break;
  575. }
  576. case BPF_ALU64 | BPF_DIV | BPF_X: /* dst = dst / src */
  577. case BPF_ALU64 | BPF_MOD | BPF_X: /* dst = dst % src */
  578. {
  579. int rc_reg = BPF_OP(insn->code) == BPF_DIV ? REG_W1 : REG_W0;
  580. jit->seen |= SEEN_RET0;
  581. /* ltgr %src,%src (if src == 0 goto fail) */
  582. EMIT4(0xb9020000, src_reg, src_reg);
  583. /* jz <ret0> */
  584. EMIT4_PCREL(0xa7840000, jit->ret0_ip - jit->prg);
  585. /* lghi %w0,0 */
  586. EMIT4_IMM(0xa7090000, REG_W0, 0);
  587. /* lgr %w1,%dst */
  588. EMIT4(0xb9040000, REG_W1, dst_reg);
  589. /* dlgr %w0,%dst */
  590. EMIT4(0xb9870000, REG_W0, src_reg);
  591. /* lgr %dst,%rc */
  592. EMIT4(0xb9040000, dst_reg, rc_reg);
  593. break;
  594. }
  595. case BPF_ALU | BPF_DIV | BPF_K: /* dst = (u32) dst / (u32) imm */
  596. case BPF_ALU | BPF_MOD | BPF_K: /* dst = (u32) dst % (u32) imm */
  597. {
  598. int rc_reg = BPF_OP(insn->code) == BPF_DIV ? REG_W1 : REG_W0;
  599. if (imm == 1) {
  600. if (BPF_OP(insn->code) == BPF_MOD)
  601. /* lhgi %dst,0 */
  602. EMIT4_IMM(0xa7090000, dst_reg, 0);
  603. break;
  604. }
  605. /* lhi %w0,0 */
  606. EMIT4_IMM(0xa7080000, REG_W0, 0);
  607. /* lr %w1,%dst */
  608. EMIT2(0x1800, REG_W1, dst_reg);
  609. /* dl %w0,<d(imm)>(%l) */
  610. EMIT6_DISP_LH(0xe3000000, 0x0097, REG_W0, REG_0, REG_L,
  611. EMIT_CONST_U32(imm));
  612. /* llgfr %dst,%rc */
  613. EMIT4(0xb9160000, dst_reg, rc_reg);
  614. break;
  615. }
  616. case BPF_ALU64 | BPF_DIV | BPF_K: /* dst = dst / imm */
  617. case BPF_ALU64 | BPF_MOD | BPF_K: /* dst = dst % imm */
  618. {
  619. int rc_reg = BPF_OP(insn->code) == BPF_DIV ? REG_W1 : REG_W0;
  620. if (imm == 1) {
  621. if (BPF_OP(insn->code) == BPF_MOD)
  622. /* lhgi %dst,0 */
  623. EMIT4_IMM(0xa7090000, dst_reg, 0);
  624. break;
  625. }
  626. /* lghi %w0,0 */
  627. EMIT4_IMM(0xa7090000, REG_W0, 0);
  628. /* lgr %w1,%dst */
  629. EMIT4(0xb9040000, REG_W1, dst_reg);
  630. /* dlg %w0,<d(imm)>(%l) */
  631. EMIT6_DISP_LH(0xe3000000, 0x0087, REG_W0, REG_0, REG_L,
  632. EMIT_CONST_U64(imm));
  633. /* lgr %dst,%rc */
  634. EMIT4(0xb9040000, dst_reg, rc_reg);
  635. break;
  636. }
  637. /*
  638. * BPF_AND
  639. */
  640. case BPF_ALU | BPF_AND | BPF_X: /* dst = (u32) dst & (u32) src */
  641. /* nr %dst,%src */
  642. EMIT2(0x1400, dst_reg, src_reg);
  643. EMIT_ZERO(dst_reg);
  644. break;
  645. case BPF_ALU64 | BPF_AND | BPF_X: /* dst = dst & src */
  646. /* ngr %dst,%src */
  647. EMIT4(0xb9800000, dst_reg, src_reg);
  648. break;
  649. case BPF_ALU | BPF_AND | BPF_K: /* dst = (u32) dst & (u32) imm */
  650. /* nilf %dst,imm */
  651. EMIT6_IMM(0xc00b0000, dst_reg, imm);
  652. EMIT_ZERO(dst_reg);
  653. break;
  654. case BPF_ALU64 | BPF_AND | BPF_K: /* dst = dst & imm */
  655. /* ng %dst,<d(imm)>(%l) */
  656. EMIT6_DISP_LH(0xe3000000, 0x0080, dst_reg, REG_0, REG_L,
  657. EMIT_CONST_U64(imm));
  658. break;
  659. /*
  660. * BPF_OR
  661. */
  662. case BPF_ALU | BPF_OR | BPF_X: /* dst = (u32) dst | (u32) src */
  663. /* or %dst,%src */
  664. EMIT2(0x1600, dst_reg, src_reg);
  665. EMIT_ZERO(dst_reg);
  666. break;
  667. case BPF_ALU64 | BPF_OR | BPF_X: /* dst = dst | src */
  668. /* ogr %dst,%src */
  669. EMIT4(0xb9810000, dst_reg, src_reg);
  670. break;
  671. case BPF_ALU | BPF_OR | BPF_K: /* dst = (u32) dst | (u32) imm */
  672. /* oilf %dst,imm */
  673. EMIT6_IMM(0xc00d0000, dst_reg, imm);
  674. EMIT_ZERO(dst_reg);
  675. break;
  676. case BPF_ALU64 | BPF_OR | BPF_K: /* dst = dst | imm */
  677. /* og %dst,<d(imm)>(%l) */
  678. EMIT6_DISP_LH(0xe3000000, 0x0081, dst_reg, REG_0, REG_L,
  679. EMIT_CONST_U64(imm));
  680. break;
  681. /*
  682. * BPF_XOR
  683. */
  684. case BPF_ALU | BPF_XOR | BPF_X: /* dst = (u32) dst ^ (u32) src */
  685. /* xr %dst,%src */
  686. EMIT2(0x1700, dst_reg, src_reg);
  687. EMIT_ZERO(dst_reg);
  688. break;
  689. case BPF_ALU64 | BPF_XOR | BPF_X: /* dst = dst ^ src */
  690. /* xgr %dst,%src */
  691. EMIT4(0xb9820000, dst_reg, src_reg);
  692. break;
  693. case BPF_ALU | BPF_XOR | BPF_K: /* dst = (u32) dst ^ (u32) imm */
  694. if (!imm)
  695. break;
  696. /* xilf %dst,imm */
  697. EMIT6_IMM(0xc0070000, dst_reg, imm);
  698. EMIT_ZERO(dst_reg);
  699. break;
  700. case BPF_ALU64 | BPF_XOR | BPF_K: /* dst = dst ^ imm */
  701. /* xg %dst,<d(imm)>(%l) */
  702. EMIT6_DISP_LH(0xe3000000, 0x0082, dst_reg, REG_0, REG_L,
  703. EMIT_CONST_U64(imm));
  704. break;
  705. /*
  706. * BPF_LSH
  707. */
  708. case BPF_ALU | BPF_LSH | BPF_X: /* dst = (u32) dst << (u32) src */
  709. /* sll %dst,0(%src) */
  710. EMIT4_DISP(0x89000000, dst_reg, src_reg, 0);
  711. EMIT_ZERO(dst_reg);
  712. break;
  713. case BPF_ALU64 | BPF_LSH | BPF_X: /* dst = dst << src */
  714. /* sllg %dst,%dst,0(%src) */
  715. EMIT6_DISP_LH(0xeb000000, 0x000d, dst_reg, dst_reg, src_reg, 0);
  716. break;
  717. case BPF_ALU | BPF_LSH | BPF_K: /* dst = (u32) dst << (u32) imm */
  718. if (imm == 0)
  719. break;
  720. /* sll %dst,imm(%r0) */
  721. EMIT4_DISP(0x89000000, dst_reg, REG_0, imm);
  722. EMIT_ZERO(dst_reg);
  723. break;
  724. case BPF_ALU64 | BPF_LSH | BPF_K: /* dst = dst << imm */
  725. if (imm == 0)
  726. break;
  727. /* sllg %dst,%dst,imm(%r0) */
  728. EMIT6_DISP_LH(0xeb000000, 0x000d, dst_reg, dst_reg, REG_0, imm);
  729. break;
  730. /*
  731. * BPF_RSH
  732. */
  733. case BPF_ALU | BPF_RSH | BPF_X: /* dst = (u32) dst >> (u32) src */
  734. /* srl %dst,0(%src) */
  735. EMIT4_DISP(0x88000000, dst_reg, src_reg, 0);
  736. EMIT_ZERO(dst_reg);
  737. break;
  738. case BPF_ALU64 | BPF_RSH | BPF_X: /* dst = dst >> src */
  739. /* srlg %dst,%dst,0(%src) */
  740. EMIT6_DISP_LH(0xeb000000, 0x000c, dst_reg, dst_reg, src_reg, 0);
  741. break;
  742. case BPF_ALU | BPF_RSH | BPF_K: /* dst = (u32) dst >> (u32) imm */
  743. if (imm == 0)
  744. break;
  745. /* srl %dst,imm(%r0) */
  746. EMIT4_DISP(0x88000000, dst_reg, REG_0, imm);
  747. EMIT_ZERO(dst_reg);
  748. break;
  749. case BPF_ALU64 | BPF_RSH | BPF_K: /* dst = dst >> imm */
  750. if (imm == 0)
  751. break;
  752. /* srlg %dst,%dst,imm(%r0) */
  753. EMIT6_DISP_LH(0xeb000000, 0x000c, dst_reg, dst_reg, REG_0, imm);
  754. break;
  755. /*
  756. * BPF_ARSH
  757. */
  758. case BPF_ALU64 | BPF_ARSH | BPF_X: /* ((s64) dst) >>= src */
  759. /* srag %dst,%dst,0(%src) */
  760. EMIT6_DISP_LH(0xeb000000, 0x000a, dst_reg, dst_reg, src_reg, 0);
  761. break;
  762. case BPF_ALU64 | BPF_ARSH | BPF_K: /* ((s64) dst) >>= imm */
  763. if (imm == 0)
  764. break;
  765. /* srag %dst,%dst,imm(%r0) */
  766. EMIT6_DISP_LH(0xeb000000, 0x000a, dst_reg, dst_reg, REG_0, imm);
  767. break;
  768. /*
  769. * BPF_NEG
  770. */
  771. case BPF_ALU | BPF_NEG: /* dst = (u32) -dst */
  772. /* lcr %dst,%dst */
  773. EMIT2(0x1300, dst_reg, dst_reg);
  774. EMIT_ZERO(dst_reg);
  775. break;
  776. case BPF_ALU64 | BPF_NEG: /* dst = -dst */
  777. /* lcgr %dst,%dst */
  778. EMIT4(0xb9130000, dst_reg, dst_reg);
  779. break;
  780. /*
  781. * BPF_FROM_BE/LE
  782. */
  783. case BPF_ALU | BPF_END | BPF_FROM_BE:
  784. /* s390 is big endian, therefore only clear high order bytes */
  785. switch (imm) {
  786. case 16: /* dst = (u16) cpu_to_be16(dst) */
  787. /* llghr %dst,%dst */
  788. EMIT4(0xb9850000, dst_reg, dst_reg);
  789. break;
  790. case 32: /* dst = (u32) cpu_to_be32(dst) */
  791. /* llgfr %dst,%dst */
  792. EMIT4(0xb9160000, dst_reg, dst_reg);
  793. break;
  794. case 64: /* dst = (u64) cpu_to_be64(dst) */
  795. break;
  796. }
  797. break;
  798. case BPF_ALU | BPF_END | BPF_FROM_LE:
  799. switch (imm) {
  800. case 16: /* dst = (u16) cpu_to_le16(dst) */
  801. /* lrvr %dst,%dst */
  802. EMIT4(0xb91f0000, dst_reg, dst_reg);
  803. /* srl %dst,16(%r0) */
  804. EMIT4_DISP(0x88000000, dst_reg, REG_0, 16);
  805. /* llghr %dst,%dst */
  806. EMIT4(0xb9850000, dst_reg, dst_reg);
  807. break;
  808. case 32: /* dst = (u32) cpu_to_le32(dst) */
  809. /* lrvr %dst,%dst */
  810. EMIT4(0xb91f0000, dst_reg, dst_reg);
  811. /* llgfr %dst,%dst */
  812. EMIT4(0xb9160000, dst_reg, dst_reg);
  813. break;
  814. case 64: /* dst = (u64) cpu_to_le64(dst) */
  815. /* lrvgr %dst,%dst */
  816. EMIT4(0xb90f0000, dst_reg, dst_reg);
  817. break;
  818. }
  819. break;
  820. /*
  821. * BPF_ST(X)
  822. */
  823. case BPF_STX | BPF_MEM | BPF_B: /* *(u8 *)(dst + off) = src_reg */
  824. /* stcy %src,off(%dst) */
  825. EMIT6_DISP_LH(0xe3000000, 0x0072, src_reg, dst_reg, REG_0, off);
  826. jit->seen |= SEEN_MEM;
  827. break;
  828. case BPF_STX | BPF_MEM | BPF_H: /* (u16 *)(dst + off) = src */
  829. /* sthy %src,off(%dst) */
  830. EMIT6_DISP_LH(0xe3000000, 0x0070, src_reg, dst_reg, REG_0, off);
  831. jit->seen |= SEEN_MEM;
  832. break;
  833. case BPF_STX | BPF_MEM | BPF_W: /* *(u32 *)(dst + off) = src */
  834. /* sty %src,off(%dst) */
  835. EMIT6_DISP_LH(0xe3000000, 0x0050, src_reg, dst_reg, REG_0, off);
  836. jit->seen |= SEEN_MEM;
  837. break;
  838. case BPF_STX | BPF_MEM | BPF_DW: /* (u64 *)(dst + off) = src */
  839. /* stg %src,off(%dst) */
  840. EMIT6_DISP_LH(0xe3000000, 0x0024, src_reg, dst_reg, REG_0, off);
  841. jit->seen |= SEEN_MEM;
  842. break;
  843. case BPF_ST | BPF_MEM | BPF_B: /* *(u8 *)(dst + off) = imm */
  844. /* lhi %w0,imm */
  845. EMIT4_IMM(0xa7080000, REG_W0, (u8) imm);
  846. /* stcy %w0,off(dst) */
  847. EMIT6_DISP_LH(0xe3000000, 0x0072, REG_W0, dst_reg, REG_0, off);
  848. jit->seen |= SEEN_MEM;
  849. break;
  850. case BPF_ST | BPF_MEM | BPF_H: /* (u16 *)(dst + off) = imm */
  851. /* lhi %w0,imm */
  852. EMIT4_IMM(0xa7080000, REG_W0, (u16) imm);
  853. /* sthy %w0,off(dst) */
  854. EMIT6_DISP_LH(0xe3000000, 0x0070, REG_W0, dst_reg, REG_0, off);
  855. jit->seen |= SEEN_MEM;
  856. break;
  857. case BPF_ST | BPF_MEM | BPF_W: /* *(u32 *)(dst + off) = imm */
  858. /* llilf %w0,imm */
  859. EMIT6_IMM(0xc00f0000, REG_W0, (u32) imm);
  860. /* sty %w0,off(%dst) */
  861. EMIT6_DISP_LH(0xe3000000, 0x0050, REG_W0, dst_reg, REG_0, off);
  862. jit->seen |= SEEN_MEM;
  863. break;
  864. case BPF_ST | BPF_MEM | BPF_DW: /* *(u64 *)(dst + off) = imm */
  865. /* lgfi %w0,imm */
  866. EMIT6_IMM(0xc0010000, REG_W0, imm);
  867. /* stg %w0,off(%dst) */
  868. EMIT6_DISP_LH(0xe3000000, 0x0024, REG_W0, dst_reg, REG_0, off);
  869. jit->seen |= SEEN_MEM;
  870. break;
  871. /*
  872. * BPF_STX XADD (atomic_add)
  873. */
  874. case BPF_STX | BPF_XADD | BPF_W: /* *(u32 *)(dst + off) += src */
  875. /* laal %w0,%src,off(%dst) */
  876. EMIT6_DISP_LH(0xeb000000, 0x00fa, REG_W0, src_reg,
  877. dst_reg, off);
  878. jit->seen |= SEEN_MEM;
  879. break;
  880. case BPF_STX | BPF_XADD | BPF_DW: /* *(u64 *)(dst + off) += src */
  881. /* laalg %w0,%src,off(%dst) */
  882. EMIT6_DISP_LH(0xeb000000, 0x00ea, REG_W0, src_reg,
  883. dst_reg, off);
  884. jit->seen |= SEEN_MEM;
  885. break;
  886. /*
  887. * BPF_LDX
  888. */
  889. case BPF_LDX | BPF_MEM | BPF_B: /* dst = *(u8 *)(ul) (src + off) */
  890. /* llgc %dst,0(off,%src) */
  891. EMIT6_DISP_LH(0xe3000000, 0x0090, dst_reg, src_reg, REG_0, off);
  892. jit->seen |= SEEN_MEM;
  893. break;
  894. case BPF_LDX | BPF_MEM | BPF_H: /* dst = *(u16 *)(ul) (src + off) */
  895. /* llgh %dst,0(off,%src) */
  896. EMIT6_DISP_LH(0xe3000000, 0x0091, dst_reg, src_reg, REG_0, off);
  897. jit->seen |= SEEN_MEM;
  898. break;
  899. case BPF_LDX | BPF_MEM | BPF_W: /* dst = *(u32 *)(ul) (src + off) */
  900. /* llgf %dst,off(%src) */
  901. jit->seen |= SEEN_MEM;
  902. EMIT6_DISP_LH(0xe3000000, 0x0016, dst_reg, src_reg, REG_0, off);
  903. break;
  904. case BPF_LDX | BPF_MEM | BPF_DW: /* dst = *(u64 *)(ul) (src + off) */
  905. /* lg %dst,0(off,%src) */
  906. jit->seen |= SEEN_MEM;
  907. EMIT6_DISP_LH(0xe3000000, 0x0004, dst_reg, src_reg, REG_0, off);
  908. break;
  909. /*
  910. * BPF_JMP / CALL
  911. */
  912. case BPF_JMP | BPF_CALL:
  913. {
  914. /*
  915. * b0 = (__bpf_call_base + imm)(b1, b2, b3, b4, b5)
  916. */
  917. const u64 func = (u64)__bpf_call_base + imm;
  918. REG_SET_SEEN(BPF_REG_5);
  919. jit->seen |= SEEN_FUNC;
  920. /* lg %w1,<d(imm)>(%l) */
  921. EMIT6_DISP_LH(0xe3000000, 0x0004, REG_W1, REG_0, REG_L,
  922. EMIT_CONST_U64(func));
  923. /* basr %r14,%w1 */
  924. EMIT2(0x0d00, REG_14, REG_W1);
  925. /* lgr %b0,%r2: load return value into %b0 */
  926. EMIT4(0xb9040000, BPF_REG_0, REG_2);
  927. if (bpf_helper_changes_skb_data((void *)func)) {
  928. jit->seen |= SEEN_SKB_CHANGE;
  929. /* lg %b1,ST_OFF_SKBP(%r15) */
  930. EMIT6_DISP_LH(0xe3000000, 0x0004, BPF_REG_1, REG_0,
  931. REG_15, STK_OFF_SKBP);
  932. emit_load_skb_data_hlen(jit);
  933. }
  934. break;
  935. }
  936. case BPF_JMP | BPF_CALL | BPF_X:
  937. /*
  938. * Implicit input:
  939. * B1: pointer to ctx
  940. * B2: pointer to bpf_array
  941. * B3: index in bpf_array
  942. */
  943. jit->seen |= SEEN_TAIL_CALL;
  944. /*
  945. * if (index >= array->map.max_entries)
  946. * goto out;
  947. */
  948. /* llgf %w1,map.max_entries(%b2) */
  949. EMIT6_DISP_LH(0xe3000000, 0x0016, REG_W1, REG_0, BPF_REG_2,
  950. offsetof(struct bpf_array, map.max_entries));
  951. /* clgrj %b3,%w1,0xa,label0: if %b3 >= %w1 goto out */
  952. EMIT6_PCREL_LABEL(0xec000000, 0x0065, BPF_REG_3,
  953. REG_W1, 0, 0xa);
  954. /*
  955. * if (tail_call_cnt++ > MAX_TAIL_CALL_CNT)
  956. * goto out;
  957. */
  958. if (jit->seen & SEEN_STACK)
  959. off = STK_OFF_TCCNT + STK_OFF;
  960. else
  961. off = STK_OFF_TCCNT;
  962. /* lhi %w0,1 */
  963. EMIT4_IMM(0xa7080000, REG_W0, 1);
  964. /* laal %w1,%w0,off(%r15) */
  965. EMIT6_DISP_LH(0xeb000000, 0x00fa, REG_W1, REG_W0, REG_15, off);
  966. /* clij %w1,MAX_TAIL_CALL_CNT,0x2,label0 */
  967. EMIT6_PCREL_IMM_LABEL(0xec000000, 0x007f, REG_W1,
  968. MAX_TAIL_CALL_CNT, 0, 0x2);
  969. /*
  970. * prog = array->ptrs[index];
  971. * if (prog == NULL)
  972. * goto out;
  973. */
  974. /* sllg %r1,%b3,3: %r1 = index * 8 */
  975. EMIT6_DISP_LH(0xeb000000, 0x000d, REG_1, BPF_REG_3, REG_0, 3);
  976. /* lg %r1,prog(%b2,%r1) */
  977. EMIT6_DISP_LH(0xe3000000, 0x0004, REG_1, BPF_REG_2,
  978. REG_1, offsetof(struct bpf_array, ptrs));
  979. /* clgij %r1,0,0x8,label0 */
  980. EMIT6_PCREL_IMM_LABEL(0xec000000, 0x007d, REG_1, 0, 0, 0x8);
  981. /*
  982. * Restore registers before calling function
  983. */
  984. save_restore_regs(jit, REGS_RESTORE);
  985. /*
  986. * goto *(prog->bpf_func + tail_call_start);
  987. */
  988. /* lg %r1,bpf_func(%r1) */
  989. EMIT6_DISP_LH(0xe3000000, 0x0004, REG_1, REG_1, REG_0,
  990. offsetof(struct bpf_prog, bpf_func));
  991. /* bc 0xf,tail_call_start(%r1) */
  992. _EMIT4(0x47f01000 + jit->tail_call_start);
  993. /* out: */
  994. jit->labels[0] = jit->prg;
  995. break;
  996. case BPF_JMP | BPF_EXIT: /* return b0 */
  997. last = (i == fp->len - 1) ? 1 : 0;
  998. if (last && !(jit->seen & SEEN_RET0))
  999. break;
  1000. /* j <exit> */
  1001. EMIT4_PCREL(0xa7f40000, jit->exit_ip - jit->prg);
  1002. break;
  1003. /*
  1004. * Branch relative (number of skipped instructions) to offset on
  1005. * condition.
  1006. *
  1007. * Condition code to mask mapping:
  1008. *
  1009. * CC | Description | Mask
  1010. * ------------------------------
  1011. * 0 | Operands equal | 8
  1012. * 1 | First operand low | 4
  1013. * 2 | First operand high | 2
  1014. * 3 | Unused | 1
  1015. *
  1016. * For s390x relative branches: ip = ip + off_bytes
  1017. * For BPF relative branches: insn = insn + off_insns + 1
  1018. *
  1019. * For example for s390x with offset 0 we jump to the branch
  1020. * instruction itself (loop) and for BPF with offset 0 we
  1021. * branch to the instruction behind the branch.
  1022. */
  1023. case BPF_JMP | BPF_JA: /* if (true) */
  1024. mask = 0xf000; /* j */
  1025. goto branch_oc;
  1026. case BPF_JMP | BPF_JSGT | BPF_K: /* ((s64) dst > (s64) imm) */
  1027. mask = 0x2000; /* jh */
  1028. goto branch_ks;
  1029. case BPF_JMP | BPF_JSGE | BPF_K: /* ((s64) dst >= (s64) imm) */
  1030. mask = 0xa000; /* jhe */
  1031. goto branch_ks;
  1032. case BPF_JMP | BPF_JGT | BPF_K: /* (dst_reg > imm) */
  1033. mask = 0x2000; /* jh */
  1034. goto branch_ku;
  1035. case BPF_JMP | BPF_JGE | BPF_K: /* (dst_reg >= imm) */
  1036. mask = 0xa000; /* jhe */
  1037. goto branch_ku;
  1038. case BPF_JMP | BPF_JNE | BPF_K: /* (dst_reg != imm) */
  1039. mask = 0x7000; /* jne */
  1040. goto branch_ku;
  1041. case BPF_JMP | BPF_JEQ | BPF_K: /* (dst_reg == imm) */
  1042. mask = 0x8000; /* je */
  1043. goto branch_ku;
  1044. case BPF_JMP | BPF_JSET | BPF_K: /* (dst_reg & imm) */
  1045. mask = 0x7000; /* jnz */
  1046. /* lgfi %w1,imm (load sign extend imm) */
  1047. EMIT6_IMM(0xc0010000, REG_W1, imm);
  1048. /* ngr %w1,%dst */
  1049. EMIT4(0xb9800000, REG_W1, dst_reg);
  1050. goto branch_oc;
  1051. case BPF_JMP | BPF_JSGT | BPF_X: /* ((s64) dst > (s64) src) */
  1052. mask = 0x2000; /* jh */
  1053. goto branch_xs;
  1054. case BPF_JMP | BPF_JSGE | BPF_X: /* ((s64) dst >= (s64) src) */
  1055. mask = 0xa000; /* jhe */
  1056. goto branch_xs;
  1057. case BPF_JMP | BPF_JGT | BPF_X: /* (dst > src) */
  1058. mask = 0x2000; /* jh */
  1059. goto branch_xu;
  1060. case BPF_JMP | BPF_JGE | BPF_X: /* (dst >= src) */
  1061. mask = 0xa000; /* jhe */
  1062. goto branch_xu;
  1063. case BPF_JMP | BPF_JNE | BPF_X: /* (dst != src) */
  1064. mask = 0x7000; /* jne */
  1065. goto branch_xu;
  1066. case BPF_JMP | BPF_JEQ | BPF_X: /* (dst == src) */
  1067. mask = 0x8000; /* je */
  1068. goto branch_xu;
  1069. case BPF_JMP | BPF_JSET | BPF_X: /* (dst & src) */
  1070. mask = 0x7000; /* jnz */
  1071. /* ngrk %w1,%dst,%src */
  1072. EMIT4_RRF(0xb9e40000, REG_W1, dst_reg, src_reg);
  1073. goto branch_oc;
  1074. branch_ks:
  1075. /* lgfi %w1,imm (load sign extend imm) */
  1076. EMIT6_IMM(0xc0010000, REG_W1, imm);
  1077. /* cgrj %dst,%w1,mask,off */
  1078. EMIT6_PCREL(0xec000000, 0x0064, dst_reg, REG_W1, i, off, mask);
  1079. break;
  1080. branch_ku:
  1081. /* lgfi %w1,imm (load sign extend imm) */
  1082. EMIT6_IMM(0xc0010000, REG_W1, imm);
  1083. /* clgrj %dst,%w1,mask,off */
  1084. EMIT6_PCREL(0xec000000, 0x0065, dst_reg, REG_W1, i, off, mask);
  1085. break;
  1086. branch_xs:
  1087. /* cgrj %dst,%src,mask,off */
  1088. EMIT6_PCREL(0xec000000, 0x0064, dst_reg, src_reg, i, off, mask);
  1089. break;
  1090. branch_xu:
  1091. /* clgrj %dst,%src,mask,off */
  1092. EMIT6_PCREL(0xec000000, 0x0065, dst_reg, src_reg, i, off, mask);
  1093. break;
  1094. branch_oc:
  1095. /* brc mask,jmp_off (branch instruction needs 4 bytes) */
  1096. jmp_off = addrs[i + off + 1] - (addrs[i + 1] - 4);
  1097. EMIT4_PCREL(0xa7040000 | mask << 8, jmp_off);
  1098. break;
  1099. /*
  1100. * BPF_LD
  1101. */
  1102. case BPF_LD | BPF_ABS | BPF_B: /* b0 = *(u8 *) (skb->data+imm) */
  1103. case BPF_LD | BPF_IND | BPF_B: /* b0 = *(u8 *) (skb->data+imm+src) */
  1104. if ((BPF_MODE(insn->code) == BPF_ABS) && (imm >= 0))
  1105. func_addr = __pa(sk_load_byte_pos);
  1106. else
  1107. func_addr = __pa(sk_load_byte);
  1108. goto call_fn;
  1109. case BPF_LD | BPF_ABS | BPF_H: /* b0 = *(u16 *) (skb->data+imm) */
  1110. case BPF_LD | BPF_IND | BPF_H: /* b0 = *(u16 *) (skb->data+imm+src) */
  1111. if ((BPF_MODE(insn->code) == BPF_ABS) && (imm >= 0))
  1112. func_addr = __pa(sk_load_half_pos);
  1113. else
  1114. func_addr = __pa(sk_load_half);
  1115. goto call_fn;
  1116. case BPF_LD | BPF_ABS | BPF_W: /* b0 = *(u32 *) (skb->data+imm) */
  1117. case BPF_LD | BPF_IND | BPF_W: /* b0 = *(u32 *) (skb->data+imm+src) */
  1118. if ((BPF_MODE(insn->code) == BPF_ABS) && (imm >= 0))
  1119. func_addr = __pa(sk_load_word_pos);
  1120. else
  1121. func_addr = __pa(sk_load_word);
  1122. goto call_fn;
  1123. call_fn:
  1124. jit->seen |= SEEN_SKB | SEEN_RET0 | SEEN_FUNC;
  1125. REG_SET_SEEN(REG_14); /* Return address of possible func call */
  1126. /*
  1127. * Implicit input:
  1128. * BPF_REG_6 (R7) : skb pointer
  1129. * REG_SKB_DATA (R12): skb data pointer
  1130. *
  1131. * Calculated input:
  1132. * BPF_REG_2 (R3) : offset of byte(s) to fetch in skb
  1133. * BPF_REG_5 (R6) : return address
  1134. *
  1135. * Output:
  1136. * BPF_REG_0 (R14): data read from skb
  1137. *
  1138. * Scratch registers (BPF_REG_1-5)
  1139. */
  1140. /* Call function: llilf %w1,func_addr */
  1141. EMIT6_IMM(0xc00f0000, REG_W1, func_addr);
  1142. /* Offset: lgfi %b2,imm */
  1143. EMIT6_IMM(0xc0010000, BPF_REG_2, imm);
  1144. if (BPF_MODE(insn->code) == BPF_IND)
  1145. /* agfr %b2,%src (%src is s32 here) */
  1146. EMIT4(0xb9180000, BPF_REG_2, src_reg);
  1147. /* basr %b5,%w1 (%b5 is call saved) */
  1148. EMIT2(0x0d00, BPF_REG_5, REG_W1);
  1149. /*
  1150. * Note: For fast access we jump directly after the
  1151. * jnz instruction from bpf_jit.S
  1152. */
  1153. /* jnz <ret0> */
  1154. EMIT4_PCREL(0xa7740000, jit->ret0_ip - jit->prg);
  1155. break;
  1156. default: /* too complex, give up */
  1157. pr_err("Unknown opcode %02x\n", insn->code);
  1158. return -1;
  1159. }
  1160. return insn_count;
  1161. }
  1162. /*
  1163. * Compile eBPF program into s390x code
  1164. */
  1165. static int bpf_jit_prog(struct bpf_jit *jit, struct bpf_prog *fp)
  1166. {
  1167. int i, insn_count;
  1168. jit->lit = jit->lit_start;
  1169. jit->prg = 0;
  1170. bpf_jit_prologue(jit, bpf_prog_was_classic(fp));
  1171. for (i = 0; i < fp->len; i += insn_count) {
  1172. insn_count = bpf_jit_insn(jit, fp, i);
  1173. if (insn_count < 0)
  1174. return -1;
  1175. jit->addrs[i + 1] = jit->prg; /* Next instruction address */
  1176. }
  1177. bpf_jit_epilogue(jit);
  1178. jit->lit_start = jit->prg;
  1179. jit->size = jit->lit;
  1180. jit->size_prg = jit->prg;
  1181. return 0;
  1182. }
  1183. /*
  1184. * Classic BPF function stub. BPF programs will be converted into
  1185. * eBPF and then bpf_int_jit_compile() will be called.
  1186. */
  1187. void bpf_jit_compile(struct bpf_prog *fp)
  1188. {
  1189. }
  1190. /*
  1191. * Compile eBPF program "fp"
  1192. */
  1193. void bpf_int_jit_compile(struct bpf_prog *fp)
  1194. {
  1195. struct bpf_binary_header *header;
  1196. struct bpf_jit jit;
  1197. int pass;
  1198. if (!bpf_jit_enable)
  1199. return;
  1200. memset(&jit, 0, sizeof(jit));
  1201. jit.addrs = kcalloc(fp->len + 1, sizeof(*jit.addrs), GFP_KERNEL);
  1202. if (jit.addrs == NULL)
  1203. return;
  1204. /*
  1205. * Three initial passes:
  1206. * - 1/2: Determine clobbered registers
  1207. * - 3: Calculate program size and addrs arrray
  1208. */
  1209. for (pass = 1; pass <= 3; pass++) {
  1210. if (bpf_jit_prog(&jit, fp))
  1211. goto free_addrs;
  1212. }
  1213. /*
  1214. * Final pass: Allocate and generate program
  1215. */
  1216. if (jit.size >= BPF_SIZE_MAX)
  1217. goto free_addrs;
  1218. header = bpf_jit_binary_alloc(jit.size, &jit.prg_buf, 2, jit_fill_hole);
  1219. if (!header)
  1220. goto free_addrs;
  1221. if (bpf_jit_prog(&jit, fp))
  1222. goto free_addrs;
  1223. if (bpf_jit_enable > 1) {
  1224. bpf_jit_dump(fp->len, jit.size, pass, jit.prg_buf);
  1225. if (jit.prg_buf)
  1226. print_fn_code(jit.prg_buf, jit.size_prg);
  1227. }
  1228. if (jit.prg_buf) {
  1229. set_memory_ro((unsigned long)header, header->pages);
  1230. fp->bpf_func = (void *) jit.prg_buf;
  1231. fp->jited = true;
  1232. }
  1233. free_addrs:
  1234. kfree(jit.addrs);
  1235. }
  1236. /*
  1237. * Free eBPF program
  1238. */
  1239. void bpf_jit_free(struct bpf_prog *fp)
  1240. {
  1241. unsigned long addr = (unsigned long)fp->bpf_func & PAGE_MASK;
  1242. struct bpf_binary_header *header = (void *)addr;
  1243. if (!fp->jited)
  1244. goto free_filter;
  1245. set_memory_rw(addr, header->pages);
  1246. bpf_jit_binary_free(header);
  1247. free_filter:
  1248. bpf_prog_unlock_free(fp);
  1249. }