bpf_jit_comp.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831
  1. /*
  2. * BPF Jit compiler for s390.
  3. *
  4. * Copyright IBM Corp. 2012
  5. *
  6. * Author(s): Martin Schwidefsky <schwidefsky@de.ibm.com>
  7. */
  8. #include <linux/netdevice.h>
  9. #include <linux/if_vlan.h>
  10. #include <linux/filter.h>
  11. #include <linux/init.h>
  12. #include <asm/cacheflush.h>
  13. #include <asm/facility.h>
  14. #include <asm/dis.h>
  15. /*
  16. * Conventions:
  17. * %r2 = skb pointer
  18. * %r3 = offset parameter
  19. * %r4 = scratch register / length parameter
  20. * %r5 = BPF A accumulator
  21. * %r8 = return address
  22. * %r9 = save register for skb pointer
  23. * %r10 = skb->data
  24. * %r11 = skb->len - skb->data_len (headlen)
  25. * %r12 = BPF X accumulator
  26. * %r13 = literal pool pointer
  27. * 0(%r15) - 63(%r15) scratch memory array with BPF_MEMWORDS
  28. */
  29. int bpf_jit_enable __read_mostly;
  30. /*
  31. * assembly code in arch/x86/net/bpf_jit.S
  32. */
  33. extern u8 sk_load_word[], sk_load_half[], sk_load_byte[], sk_load_byte_msh[];
  34. extern u8 sk_load_word_ind[], sk_load_half_ind[], sk_load_byte_ind[];
  35. struct bpf_jit {
  36. unsigned int seen;
  37. u8 *start;
  38. u8 *prg;
  39. u8 *mid;
  40. u8 *lit;
  41. u8 *end;
  42. u8 *base_ip;
  43. u8 *ret0_ip;
  44. u8 *exit_ip;
  45. unsigned int off_load_word;
  46. unsigned int off_load_half;
  47. unsigned int off_load_byte;
  48. unsigned int off_load_bmsh;
  49. unsigned int off_load_iword;
  50. unsigned int off_load_ihalf;
  51. unsigned int off_load_ibyte;
  52. };
  53. #define BPF_SIZE_MAX 4096 /* Max size for program */
  54. #define SEEN_DATAREF 1 /* might call external helpers */
  55. #define SEEN_XREG 2 /* ebx is used */
  56. #define SEEN_MEM 4 /* use mem[] for temporary storage */
  57. #define SEEN_RET0 8 /* pc_ret0 points to a valid return 0 */
  58. #define SEEN_LITERAL 16 /* code uses literals */
  59. #define SEEN_LOAD_WORD 32 /* code uses sk_load_word */
  60. #define SEEN_LOAD_HALF 64 /* code uses sk_load_half */
  61. #define SEEN_LOAD_BYTE 128 /* code uses sk_load_byte */
  62. #define SEEN_LOAD_BMSH 256 /* code uses sk_load_byte_msh */
  63. #define SEEN_LOAD_IWORD 512 /* code uses sk_load_word_ind */
  64. #define SEEN_LOAD_IHALF 1024 /* code uses sk_load_half_ind */
  65. #define SEEN_LOAD_IBYTE 2048 /* code uses sk_load_byte_ind */
  66. #define EMIT2(op) \
  67. ({ \
  68. if (jit->prg + 2 <= jit->mid) \
  69. *(u16 *) jit->prg = op; \
  70. jit->prg += 2; \
  71. })
  72. #define EMIT4(op) \
  73. ({ \
  74. if (jit->prg + 4 <= jit->mid) \
  75. *(u32 *) jit->prg = op; \
  76. jit->prg += 4; \
  77. })
  78. #define EMIT4_DISP(op, disp) \
  79. ({ \
  80. unsigned int __disp = (disp) & 0xfff; \
  81. EMIT4(op | __disp); \
  82. })
  83. #define EMIT4_IMM(op, imm) \
  84. ({ \
  85. unsigned int __imm = (imm) & 0xffff; \
  86. EMIT4(op | __imm); \
  87. })
  88. #define EMIT4_PCREL(op, pcrel) \
  89. ({ \
  90. long __pcrel = ((pcrel) >> 1) & 0xffff; \
  91. EMIT4(op | __pcrel); \
  92. })
  93. #define EMIT6(op1, op2) \
  94. ({ \
  95. if (jit->prg + 6 <= jit->mid) { \
  96. *(u32 *) jit->prg = op1; \
  97. *(u16 *) (jit->prg + 4) = op2; \
  98. } \
  99. jit->prg += 6; \
  100. })
  101. #define EMIT6_DISP(op1, op2, disp) \
  102. ({ \
  103. unsigned int __disp = (disp) & 0xfff; \
  104. EMIT6(op1 | __disp, op2); \
  105. })
  106. #define EMIT6_IMM(op, imm) \
  107. ({ \
  108. unsigned int __imm = (imm); \
  109. EMIT6(op | (__imm >> 16), __imm & 0xffff); \
  110. })
  111. #define EMIT_CONST(val) \
  112. ({ \
  113. unsigned int ret; \
  114. ret = (unsigned int) (jit->lit - jit->base_ip); \
  115. jit->seen |= SEEN_LITERAL; \
  116. if (jit->lit + 4 <= jit->end) \
  117. *(u32 *) jit->lit = val; \
  118. jit->lit += 4; \
  119. ret; \
  120. })
  121. #define EMIT_FN_CONST(bit, fn) \
  122. ({ \
  123. unsigned int ret; \
  124. ret = (unsigned int) (jit->lit - jit->base_ip); \
  125. if (jit->seen & bit) { \
  126. jit->seen |= SEEN_LITERAL; \
  127. if (jit->lit + 8 <= jit->end) \
  128. *(void **) jit->lit = fn; \
  129. jit->lit += 8; \
  130. } \
  131. ret; \
  132. })
  133. static void bpf_jit_fill_hole(void *area, unsigned int size)
  134. {
  135. /* Fill whole space with illegal instructions */
  136. memset(area, 0, size);
  137. }
  138. static void bpf_jit_prologue(struct bpf_jit *jit)
  139. {
  140. /* Save registers and create stack frame if necessary */
  141. if (jit->seen & SEEN_DATAREF) {
  142. /* stmg %r8,%r15,88(%r15) */
  143. EMIT6(0xeb8ff058, 0x0024);
  144. /* lgr %r14,%r15 */
  145. EMIT4(0xb90400ef);
  146. /* aghi %r15,<offset> */
  147. EMIT4_IMM(0xa7fb0000, (jit->seen & SEEN_MEM) ? -112 : -80);
  148. /* stg %r14,152(%r15) */
  149. EMIT6(0xe3e0f098, 0x0024);
  150. } else if ((jit->seen & SEEN_XREG) && (jit->seen & SEEN_LITERAL))
  151. /* stmg %r12,%r13,120(%r15) */
  152. EMIT6(0xebcdf078, 0x0024);
  153. else if (jit->seen & SEEN_XREG)
  154. /* stg %r12,120(%r15) */
  155. EMIT6(0xe3c0f078, 0x0024);
  156. else if (jit->seen & SEEN_LITERAL)
  157. /* stg %r13,128(%r15) */
  158. EMIT6(0xe3d0f080, 0x0024);
  159. /* Setup literal pool */
  160. if (jit->seen & SEEN_LITERAL) {
  161. /* basr %r13,0 */
  162. EMIT2(0x0dd0);
  163. jit->base_ip = jit->prg;
  164. }
  165. jit->off_load_word = EMIT_FN_CONST(SEEN_LOAD_WORD, sk_load_word);
  166. jit->off_load_half = EMIT_FN_CONST(SEEN_LOAD_HALF, sk_load_half);
  167. jit->off_load_byte = EMIT_FN_CONST(SEEN_LOAD_BYTE, sk_load_byte);
  168. jit->off_load_bmsh = EMIT_FN_CONST(SEEN_LOAD_BMSH, sk_load_byte_msh);
  169. jit->off_load_iword = EMIT_FN_CONST(SEEN_LOAD_IWORD, sk_load_word_ind);
  170. jit->off_load_ihalf = EMIT_FN_CONST(SEEN_LOAD_IHALF, sk_load_half_ind);
  171. jit->off_load_ibyte = EMIT_FN_CONST(SEEN_LOAD_IBYTE, sk_load_byte_ind);
  172. /* Filter needs to access skb data */
  173. if (jit->seen & SEEN_DATAREF) {
  174. /* l %r11,<len>(%r2) */
  175. EMIT4_DISP(0x58b02000, offsetof(struct sk_buff, len));
  176. /* s %r11,<data_len>(%r2) */
  177. EMIT4_DISP(0x5bb02000, offsetof(struct sk_buff, data_len));
  178. /* lg %r10,<data>(%r2) */
  179. EMIT6_DISP(0xe3a02000, 0x0004,
  180. offsetof(struct sk_buff, data));
  181. }
  182. }
  183. static void bpf_jit_epilogue(struct bpf_jit *jit)
  184. {
  185. /* Return 0 */
  186. if (jit->seen & SEEN_RET0) {
  187. jit->ret0_ip = jit->prg;
  188. /* lghi %r2,0 */
  189. EMIT4(0xa7290000);
  190. }
  191. jit->exit_ip = jit->prg;
  192. /* Restore registers */
  193. if (jit->seen & SEEN_DATAREF)
  194. /* lmg %r8,%r15,<offset>(%r15) */
  195. EMIT6_DISP(0xeb8ff000, 0x0004,
  196. (jit->seen & SEEN_MEM) ? 200 : 168);
  197. else if ((jit->seen & SEEN_XREG) && (jit->seen & SEEN_LITERAL))
  198. /* lmg %r12,%r13,120(%r15) */
  199. EMIT6(0xebcdf078, 0x0004);
  200. else if (jit->seen & SEEN_XREG)
  201. /* lg %r12,120(%r15) */
  202. EMIT6(0xe3c0f078, 0x0004);
  203. else if (jit->seen & SEEN_LITERAL)
  204. /* lg %r13,128(%r15) */
  205. EMIT6(0xe3d0f080, 0x0004);
  206. /* br %r14 */
  207. EMIT2(0x07fe);
  208. }
  209. /*
  210. * make sure we dont leak kernel information to user
  211. */
  212. static void bpf_jit_noleaks(struct bpf_jit *jit, struct sock_filter *filter)
  213. {
  214. /* Clear temporary memory if (seen & SEEN_MEM) */
  215. if (jit->seen & SEEN_MEM)
  216. /* xc 0(64,%r15),0(%r15) */
  217. EMIT6(0xd73ff000, 0xf000);
  218. /* Clear X if (seen & SEEN_XREG) */
  219. if (jit->seen & SEEN_XREG)
  220. /* lhi %r12,0 */
  221. EMIT4(0xa7c80000);
  222. /* Clear A if the first register does not set it. */
  223. switch (filter[0].code) {
  224. case BPF_LD | BPF_W | BPF_ABS:
  225. case BPF_LD | BPF_H | BPF_ABS:
  226. case BPF_LD | BPF_B | BPF_ABS:
  227. case BPF_LD | BPF_W | BPF_LEN:
  228. case BPF_LD | BPF_W | BPF_IND:
  229. case BPF_LD | BPF_H | BPF_IND:
  230. case BPF_LD | BPF_B | BPF_IND:
  231. case BPF_LD | BPF_IMM:
  232. case BPF_LD | BPF_MEM:
  233. case BPF_MISC | BPF_TXA:
  234. case BPF_RET | BPF_K:
  235. /* first instruction sets A register */
  236. break;
  237. default: /* A = 0 */
  238. /* lhi %r5,0 */
  239. EMIT4(0xa7580000);
  240. }
  241. }
  242. static int bpf_jit_insn(struct bpf_jit *jit, struct sock_filter *filter,
  243. unsigned int *addrs, int i, int last)
  244. {
  245. unsigned int K;
  246. int offset;
  247. unsigned int mask;
  248. u16 code;
  249. K = filter->k;
  250. code = bpf_anc_helper(filter);
  251. switch (code) {
  252. case BPF_ALU | BPF_ADD | BPF_X: /* A += X */
  253. jit->seen |= SEEN_XREG;
  254. /* ar %r5,%r12 */
  255. EMIT2(0x1a5c);
  256. break;
  257. case BPF_ALU | BPF_ADD | BPF_K: /* A += K */
  258. if (!K)
  259. break;
  260. if (K <= 16383)
  261. /* ahi %r5,<K> */
  262. EMIT4_IMM(0xa75a0000, K);
  263. else if (test_facility(21))
  264. /* alfi %r5,<K> */
  265. EMIT6_IMM(0xc25b0000, K);
  266. else
  267. /* a %r5,<d(K)>(%r13) */
  268. EMIT4_DISP(0x5a50d000, EMIT_CONST(K));
  269. break;
  270. case BPF_ALU | BPF_SUB | BPF_X: /* A -= X */
  271. jit->seen |= SEEN_XREG;
  272. /* sr %r5,%r12 */
  273. EMIT2(0x1b5c);
  274. break;
  275. case BPF_ALU | BPF_SUB | BPF_K: /* A -= K */
  276. if (!K)
  277. break;
  278. if (K <= 16384)
  279. /* ahi %r5,-K */
  280. EMIT4_IMM(0xa75a0000, -K);
  281. else if (test_facility(21))
  282. /* alfi %r5,-K */
  283. EMIT6_IMM(0xc25b0000, -K);
  284. else
  285. /* s %r5,<d(K)>(%r13) */
  286. EMIT4_DISP(0x5b50d000, EMIT_CONST(K));
  287. break;
  288. case BPF_ALU | BPF_MUL | BPF_X: /* A *= X */
  289. jit->seen |= SEEN_XREG;
  290. /* msr %r5,%r12 */
  291. EMIT4(0xb252005c);
  292. break;
  293. case BPF_ALU | BPF_MUL | BPF_K: /* A *= K */
  294. if (K <= 16383)
  295. /* mhi %r5,K */
  296. EMIT4_IMM(0xa75c0000, K);
  297. else if (test_facility(34))
  298. /* msfi %r5,<K> */
  299. EMIT6_IMM(0xc2510000, K);
  300. else
  301. /* ms %r5,<d(K)>(%r13) */
  302. EMIT4_DISP(0x7150d000, EMIT_CONST(K));
  303. break;
  304. case BPF_ALU | BPF_DIV | BPF_X: /* A /= X */
  305. jit->seen |= SEEN_XREG | SEEN_RET0;
  306. /* ltr %r12,%r12 */
  307. EMIT2(0x12cc);
  308. /* jz <ret0> */
  309. EMIT4_PCREL(0xa7840000, (jit->ret0_ip - jit->prg));
  310. /* lhi %r4,0 */
  311. EMIT4(0xa7480000);
  312. /* dlr %r4,%r12 */
  313. EMIT4(0xb997004c);
  314. break;
  315. case BPF_ALU | BPF_DIV | BPF_K: /* A /= K */
  316. if (K == 1)
  317. break;
  318. /* lhi %r4,0 */
  319. EMIT4(0xa7480000);
  320. /* dl %r4,<d(K)>(%r13) */
  321. EMIT6_DISP(0xe340d000, 0x0097, EMIT_CONST(K));
  322. break;
  323. case BPF_ALU | BPF_MOD | BPF_X: /* A %= X */
  324. jit->seen |= SEEN_XREG | SEEN_RET0;
  325. /* ltr %r12,%r12 */
  326. EMIT2(0x12cc);
  327. /* jz <ret0> */
  328. EMIT4_PCREL(0xa7840000, (jit->ret0_ip - jit->prg));
  329. /* lhi %r4,0 */
  330. EMIT4(0xa7480000);
  331. /* dlr %r4,%r12 */
  332. EMIT4(0xb997004c);
  333. /* lr %r5,%r4 */
  334. EMIT2(0x1854);
  335. break;
  336. case BPF_ALU | BPF_MOD | BPF_K: /* A %= K */
  337. if (K == 1) {
  338. /* lhi %r5,0 */
  339. EMIT4(0xa7580000);
  340. break;
  341. }
  342. /* lhi %r4,0 */
  343. EMIT4(0xa7480000);
  344. /* dl %r4,<d(K)>(%r13) */
  345. EMIT6_DISP(0xe340d000, 0x0097, EMIT_CONST(K));
  346. /* lr %r5,%r4 */
  347. EMIT2(0x1854);
  348. break;
  349. case BPF_ALU | BPF_AND | BPF_X: /* A &= X */
  350. jit->seen |= SEEN_XREG;
  351. /* nr %r5,%r12 */
  352. EMIT2(0x145c);
  353. break;
  354. case BPF_ALU | BPF_AND | BPF_K: /* A &= K */
  355. if (test_facility(21))
  356. /* nilf %r5,<K> */
  357. EMIT6_IMM(0xc05b0000, K);
  358. else
  359. /* n %r5,<d(K)>(%r13) */
  360. EMIT4_DISP(0x5450d000, EMIT_CONST(K));
  361. break;
  362. case BPF_ALU | BPF_OR | BPF_X: /* A |= X */
  363. jit->seen |= SEEN_XREG;
  364. /* or %r5,%r12 */
  365. EMIT2(0x165c);
  366. break;
  367. case BPF_ALU | BPF_OR | BPF_K: /* A |= K */
  368. if (test_facility(21))
  369. /* oilf %r5,<K> */
  370. EMIT6_IMM(0xc05d0000, K);
  371. else
  372. /* o %r5,<d(K)>(%r13) */
  373. EMIT4_DISP(0x5650d000, EMIT_CONST(K));
  374. break;
  375. case BPF_ANC | SKF_AD_ALU_XOR_X: /* A ^= X; */
  376. case BPF_ALU | BPF_XOR | BPF_X:
  377. jit->seen |= SEEN_XREG;
  378. /* xr %r5,%r12 */
  379. EMIT2(0x175c);
  380. break;
  381. case BPF_ALU | BPF_XOR | BPF_K: /* A ^= K */
  382. if (!K)
  383. break;
  384. /* x %r5,<d(K)>(%r13) */
  385. EMIT4_DISP(0x5750d000, EMIT_CONST(K));
  386. break;
  387. case BPF_ALU | BPF_LSH | BPF_X: /* A <<= X; */
  388. jit->seen |= SEEN_XREG;
  389. /* sll %r5,0(%r12) */
  390. EMIT4(0x8950c000);
  391. break;
  392. case BPF_ALU | BPF_LSH | BPF_K: /* A <<= K */
  393. if (K == 0)
  394. break;
  395. /* sll %r5,K */
  396. EMIT4_DISP(0x89500000, K);
  397. break;
  398. case BPF_ALU | BPF_RSH | BPF_X: /* A >>= X; */
  399. jit->seen |= SEEN_XREG;
  400. /* srl %r5,0(%r12) */
  401. EMIT4(0x8850c000);
  402. break;
  403. case BPF_ALU | BPF_RSH | BPF_K: /* A >>= K; */
  404. if (K == 0)
  405. break;
  406. /* srl %r5,K */
  407. EMIT4_DISP(0x88500000, K);
  408. break;
  409. case BPF_ALU | BPF_NEG: /* A = -A */
  410. /* lnr %r5,%r5 */
  411. EMIT2(0x1155);
  412. break;
  413. case BPF_JMP | BPF_JA: /* ip += K */
  414. offset = addrs[i + K] + jit->start - jit->prg;
  415. EMIT4_PCREL(0xa7f40000, offset);
  416. break;
  417. case BPF_JMP | BPF_JGT | BPF_K: /* ip += (A > K) ? jt : jf */
  418. mask = 0x200000; /* jh */
  419. goto kbranch;
  420. case BPF_JMP | BPF_JGE | BPF_K: /* ip += (A >= K) ? jt : jf */
  421. mask = 0xa00000; /* jhe */
  422. goto kbranch;
  423. case BPF_JMP | BPF_JEQ | BPF_K: /* ip += (A == K) ? jt : jf */
  424. mask = 0x800000; /* je */
  425. kbranch: /* Emit compare if the branch targets are different */
  426. if (filter->jt != filter->jf) {
  427. if (K <= 16383)
  428. /* chi %r5,<K> */
  429. EMIT4_IMM(0xa75e0000, K);
  430. else if (test_facility(21))
  431. /* clfi %r5,<K> */
  432. EMIT6_IMM(0xc25f0000, K);
  433. else
  434. /* c %r5,<d(K)>(%r13) */
  435. EMIT4_DISP(0x5950d000, EMIT_CONST(K));
  436. }
  437. branch: if (filter->jt == filter->jf) {
  438. if (filter->jt == 0)
  439. break;
  440. /* j <jt> */
  441. offset = addrs[i + filter->jt] + jit->start - jit->prg;
  442. EMIT4_PCREL(0xa7f40000, offset);
  443. break;
  444. }
  445. if (filter->jt != 0) {
  446. /* brc <mask>,<jt> */
  447. offset = addrs[i + filter->jt] + jit->start - jit->prg;
  448. EMIT4_PCREL(0xa7040000 | mask, offset);
  449. }
  450. if (filter->jf != 0) {
  451. /* brc <mask^15>,<jf> */
  452. offset = addrs[i + filter->jf] + jit->start - jit->prg;
  453. EMIT4_PCREL(0xa7040000 | (mask ^ 0xf00000), offset);
  454. }
  455. break;
  456. case BPF_JMP | BPF_JSET | BPF_K: /* ip += (A & K) ? jt : jf */
  457. mask = 0x700000; /* jnz */
  458. /* Emit test if the branch targets are different */
  459. if (filter->jt != filter->jf) {
  460. if (K > 65535) {
  461. /* lr %r4,%r5 */
  462. EMIT2(0x1845);
  463. /* n %r4,<d(K)>(%r13) */
  464. EMIT4_DISP(0x5440d000, EMIT_CONST(K));
  465. } else
  466. /* tmll %r5,K */
  467. EMIT4_IMM(0xa7510000, K);
  468. }
  469. goto branch;
  470. case BPF_JMP | BPF_JGT | BPF_X: /* ip += (A > X) ? jt : jf */
  471. mask = 0x200000; /* jh */
  472. goto xbranch;
  473. case BPF_JMP | BPF_JGE | BPF_X: /* ip += (A >= X) ? jt : jf */
  474. mask = 0xa00000; /* jhe */
  475. goto xbranch;
  476. case BPF_JMP | BPF_JEQ | BPF_X: /* ip += (A == X) ? jt : jf */
  477. mask = 0x800000; /* je */
  478. xbranch: /* Emit compare if the branch targets are different */
  479. if (filter->jt != filter->jf) {
  480. jit->seen |= SEEN_XREG;
  481. /* cr %r5,%r12 */
  482. EMIT2(0x195c);
  483. }
  484. goto branch;
  485. case BPF_JMP | BPF_JSET | BPF_X: /* ip += (A & X) ? jt : jf */
  486. mask = 0x700000; /* jnz */
  487. /* Emit test if the branch targets are different */
  488. if (filter->jt != filter->jf) {
  489. jit->seen |= SEEN_XREG;
  490. /* lr %r4,%r5 */
  491. EMIT2(0x1845);
  492. /* nr %r4,%r12 */
  493. EMIT2(0x144c);
  494. }
  495. goto branch;
  496. case BPF_LD | BPF_W | BPF_ABS: /* A = *(u32 *) (skb->data+K) */
  497. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_WORD;
  498. offset = jit->off_load_word;
  499. goto load_abs;
  500. case BPF_LD | BPF_H | BPF_ABS: /* A = *(u16 *) (skb->data+K) */
  501. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_HALF;
  502. offset = jit->off_load_half;
  503. goto load_abs;
  504. case BPF_LD | BPF_B | BPF_ABS: /* A = *(u8 *) (skb->data+K) */
  505. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_BYTE;
  506. offset = jit->off_load_byte;
  507. load_abs: if ((int) K < 0)
  508. goto out;
  509. call_fn: /* lg %r1,<d(function)>(%r13) */
  510. EMIT6_DISP(0xe310d000, 0x0004, offset);
  511. /* l %r3,<d(K)>(%r13) */
  512. EMIT4_DISP(0x5830d000, EMIT_CONST(K));
  513. /* basr %r8,%r1 */
  514. EMIT2(0x0d81);
  515. /* jnz <ret0> */
  516. EMIT4_PCREL(0xa7740000, (jit->ret0_ip - jit->prg));
  517. break;
  518. case BPF_LD | BPF_W | BPF_IND: /* A = *(u32 *) (skb->data+K+X) */
  519. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_IWORD;
  520. offset = jit->off_load_iword;
  521. goto call_fn;
  522. case BPF_LD | BPF_H | BPF_IND: /* A = *(u16 *) (skb->data+K+X) */
  523. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_IHALF;
  524. offset = jit->off_load_ihalf;
  525. goto call_fn;
  526. case BPF_LD | BPF_B | BPF_IND: /* A = *(u8 *) (skb->data+K+X) */
  527. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_IBYTE;
  528. offset = jit->off_load_ibyte;
  529. goto call_fn;
  530. case BPF_LDX | BPF_B | BPF_MSH:
  531. /* X = (*(u8 *)(skb->data+K) & 0xf) << 2 */
  532. jit->seen |= SEEN_RET0;
  533. if ((int) K < 0) {
  534. /* j <ret0> */
  535. EMIT4_PCREL(0xa7f40000, (jit->ret0_ip - jit->prg));
  536. break;
  537. }
  538. jit->seen |= SEEN_DATAREF | SEEN_LOAD_BMSH;
  539. offset = jit->off_load_bmsh;
  540. goto call_fn;
  541. case BPF_LD | BPF_W | BPF_LEN: /* A = skb->len; */
  542. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, len) != 4);
  543. /* l %r5,<d(len)>(%r2) */
  544. EMIT4_DISP(0x58502000, offsetof(struct sk_buff, len));
  545. break;
  546. case BPF_LDX | BPF_W | BPF_LEN: /* X = skb->len; */
  547. jit->seen |= SEEN_XREG;
  548. /* l %r12,<d(len)>(%r2) */
  549. EMIT4_DISP(0x58c02000, offsetof(struct sk_buff, len));
  550. break;
  551. case BPF_LD | BPF_IMM: /* A = K */
  552. if (K <= 16383)
  553. /* lhi %r5,K */
  554. EMIT4_IMM(0xa7580000, K);
  555. else if (test_facility(21))
  556. /* llilf %r5,<K> */
  557. EMIT6_IMM(0xc05f0000, K);
  558. else
  559. /* l %r5,<d(K)>(%r13) */
  560. EMIT4_DISP(0x5850d000, EMIT_CONST(K));
  561. break;
  562. case BPF_LDX | BPF_IMM: /* X = K */
  563. jit->seen |= SEEN_XREG;
  564. if (K <= 16383)
  565. /* lhi %r12,<K> */
  566. EMIT4_IMM(0xa7c80000, K);
  567. else if (test_facility(21))
  568. /* llilf %r12,<K> */
  569. EMIT6_IMM(0xc0cf0000, K);
  570. else
  571. /* l %r12,<d(K)>(%r13) */
  572. EMIT4_DISP(0x58c0d000, EMIT_CONST(K));
  573. break;
  574. case BPF_LD | BPF_MEM: /* A = mem[K] */
  575. jit->seen |= SEEN_MEM;
  576. /* l %r5,<K>(%r15) */
  577. EMIT4_DISP(0x5850f000,
  578. (jit->seen & SEEN_DATAREF) ? 160 + K*4 : K*4);
  579. break;
  580. case BPF_LDX | BPF_MEM: /* X = mem[K] */
  581. jit->seen |= SEEN_XREG | SEEN_MEM;
  582. /* l %r12,<K>(%r15) */
  583. EMIT4_DISP(0x58c0f000,
  584. (jit->seen & SEEN_DATAREF) ? 160 + K*4 : K*4);
  585. break;
  586. case BPF_MISC | BPF_TAX: /* X = A */
  587. jit->seen |= SEEN_XREG;
  588. /* lr %r12,%r5 */
  589. EMIT2(0x18c5);
  590. break;
  591. case BPF_MISC | BPF_TXA: /* A = X */
  592. jit->seen |= SEEN_XREG;
  593. /* lr %r5,%r12 */
  594. EMIT2(0x185c);
  595. break;
  596. case BPF_RET | BPF_K:
  597. if (K == 0) {
  598. jit->seen |= SEEN_RET0;
  599. if (last)
  600. break;
  601. /* j <ret0> */
  602. EMIT4_PCREL(0xa7f40000, jit->ret0_ip - jit->prg);
  603. } else {
  604. if (K <= 16383)
  605. /* lghi %r2,K */
  606. EMIT4_IMM(0xa7290000, K);
  607. else
  608. /* llgf %r2,<K>(%r13) */
  609. EMIT6_DISP(0xe320d000, 0x0016, EMIT_CONST(K));
  610. /* j <exit> */
  611. if (last && !(jit->seen & SEEN_RET0))
  612. break;
  613. EMIT4_PCREL(0xa7f40000, jit->exit_ip - jit->prg);
  614. }
  615. break;
  616. case BPF_RET | BPF_A:
  617. /* llgfr %r2,%r5 */
  618. EMIT4(0xb9160025);
  619. /* j <exit> */
  620. EMIT4_PCREL(0xa7f40000, jit->exit_ip - jit->prg);
  621. break;
  622. case BPF_ST: /* mem[K] = A */
  623. jit->seen |= SEEN_MEM;
  624. /* st %r5,<K>(%r15) */
  625. EMIT4_DISP(0x5050f000,
  626. (jit->seen & SEEN_DATAREF) ? 160 + K*4 : K*4);
  627. break;
  628. case BPF_STX: /* mem[K] = X : mov %ebx,off8(%rbp) */
  629. jit->seen |= SEEN_XREG | SEEN_MEM;
  630. /* st %r12,<K>(%r15) */
  631. EMIT4_DISP(0x50c0f000,
  632. (jit->seen & SEEN_DATAREF) ? 160 + K*4 : K*4);
  633. break;
  634. case BPF_ANC | SKF_AD_PROTOCOL: /* A = ntohs(skb->protocol); */
  635. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, protocol) != 2);
  636. /* lhi %r5,0 */
  637. EMIT4(0xa7580000);
  638. /* icm %r5,3,<d(protocol)>(%r2) */
  639. EMIT4_DISP(0xbf532000, offsetof(struct sk_buff, protocol));
  640. break;
  641. case BPF_ANC | SKF_AD_IFINDEX: /* if (!skb->dev) return 0;
  642. * A = skb->dev->ifindex */
  643. BUILD_BUG_ON(FIELD_SIZEOF(struct net_device, ifindex) != 4);
  644. jit->seen |= SEEN_RET0;
  645. /* lg %r1,<d(dev)>(%r2) */
  646. EMIT6_DISP(0xe3102000, 0x0004, offsetof(struct sk_buff, dev));
  647. /* ltgr %r1,%r1 */
  648. EMIT4(0xb9020011);
  649. /* jz <ret0> */
  650. EMIT4_PCREL(0xa7840000, jit->ret0_ip - jit->prg);
  651. /* l %r5,<d(ifindex)>(%r1) */
  652. EMIT4_DISP(0x58501000, offsetof(struct net_device, ifindex));
  653. break;
  654. case BPF_ANC | SKF_AD_MARK: /* A = skb->mark */
  655. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, mark) != 4);
  656. /* l %r5,<d(mark)>(%r2) */
  657. EMIT4_DISP(0x58502000, offsetof(struct sk_buff, mark));
  658. break;
  659. case BPF_ANC | SKF_AD_QUEUE: /* A = skb->queue_mapping */
  660. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, queue_mapping) != 2);
  661. /* lhi %r5,0 */
  662. EMIT4(0xa7580000);
  663. /* icm %r5,3,<d(queue_mapping)>(%r2) */
  664. EMIT4_DISP(0xbf532000, offsetof(struct sk_buff, queue_mapping));
  665. break;
  666. case BPF_ANC | SKF_AD_HATYPE: /* if (!skb->dev) return 0;
  667. * A = skb->dev->type */
  668. BUILD_BUG_ON(FIELD_SIZEOF(struct net_device, type) != 2);
  669. jit->seen |= SEEN_RET0;
  670. /* lg %r1,<d(dev)>(%r2) */
  671. EMIT6_DISP(0xe3102000, 0x0004, offsetof(struct sk_buff, dev));
  672. /* ltgr %r1,%r1 */
  673. EMIT4(0xb9020011);
  674. /* jz <ret0> */
  675. EMIT4_PCREL(0xa7840000, jit->ret0_ip - jit->prg);
  676. /* lhi %r5,0 */
  677. EMIT4(0xa7580000);
  678. /* icm %r5,3,<d(type)>(%r1) */
  679. EMIT4_DISP(0xbf531000, offsetof(struct net_device, type));
  680. break;
  681. case BPF_ANC | SKF_AD_RXHASH: /* A = skb->hash */
  682. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, hash) != 4);
  683. /* l %r5,<d(hash)>(%r2) */
  684. EMIT4_DISP(0x58502000, offsetof(struct sk_buff, hash));
  685. break;
  686. case BPF_ANC | SKF_AD_VLAN_TAG:
  687. case BPF_ANC | SKF_AD_VLAN_TAG_PRESENT:
  688. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, vlan_tci) != 2);
  689. BUILD_BUG_ON(VLAN_TAG_PRESENT != 0x1000);
  690. /* lhi %r5,0 */
  691. EMIT4(0xa7580000);
  692. /* icm %r5,3,<d(vlan_tci)>(%r2) */
  693. EMIT4_DISP(0xbf532000, offsetof(struct sk_buff, vlan_tci));
  694. if (code == (BPF_ANC | SKF_AD_VLAN_TAG)) {
  695. /* nill %r5,0xefff */
  696. EMIT4_IMM(0xa5570000, ~VLAN_TAG_PRESENT);
  697. } else {
  698. /* nill %r5,0x1000 */
  699. EMIT4_IMM(0xa5570000, VLAN_TAG_PRESENT);
  700. /* srl %r5,12 */
  701. EMIT4_DISP(0x88500000, 12);
  702. }
  703. break;
  704. case BPF_ANC | SKF_AD_PKTTYPE:
  705. /* lhi %r5,0 */
  706. EMIT4(0xa7580000);
  707. /* ic %r5,<d(pkt_type_offset)>(%r2) */
  708. EMIT4_DISP(0x43502000, PKT_TYPE_OFFSET());
  709. /* srl %r5,5 */
  710. EMIT4_DISP(0x88500000, 5);
  711. break;
  712. case BPF_ANC | SKF_AD_CPU: /* A = smp_processor_id() */
  713. #ifdef CONFIG_SMP
  714. /* l %r5,<d(cpu_nr)> */
  715. EMIT4_DISP(0x58500000, offsetof(struct _lowcore, cpu_nr));
  716. #else
  717. /* lhi %r5,0 */
  718. EMIT4(0xa7580000);
  719. #endif
  720. break;
  721. default: /* too complex, give up */
  722. goto out;
  723. }
  724. addrs[i] = jit->prg - jit->start;
  725. return 0;
  726. out:
  727. return -1;
  728. }
  729. void bpf_jit_compile(struct bpf_prog *fp)
  730. {
  731. struct bpf_binary_header *header = NULL;
  732. unsigned long size, prg_len, lit_len;
  733. struct bpf_jit jit, cjit;
  734. unsigned int *addrs;
  735. int pass, i;
  736. if (!bpf_jit_enable)
  737. return;
  738. addrs = kcalloc(fp->len, sizeof(*addrs), GFP_KERNEL);
  739. if (addrs == NULL)
  740. return;
  741. memset(&jit, 0, sizeof(cjit));
  742. memset(&cjit, 0, sizeof(cjit));
  743. for (pass = 0; pass < 10; pass++) {
  744. jit.prg = jit.start;
  745. jit.lit = jit.mid;
  746. bpf_jit_prologue(&jit);
  747. bpf_jit_noleaks(&jit, fp->insns);
  748. for (i = 0; i < fp->len; i++) {
  749. if (bpf_jit_insn(&jit, fp->insns + i, addrs, i,
  750. i == fp->len - 1))
  751. goto out;
  752. }
  753. bpf_jit_epilogue(&jit);
  754. if (jit.start) {
  755. WARN_ON(jit.prg > cjit.prg || jit.lit > cjit.lit);
  756. if (memcmp(&jit, &cjit, sizeof(jit)) == 0)
  757. break;
  758. } else if (jit.prg == cjit.prg && jit.lit == cjit.lit) {
  759. prg_len = jit.prg - jit.start;
  760. lit_len = jit.lit - jit.mid;
  761. size = prg_len + lit_len;
  762. if (size >= BPF_SIZE_MAX)
  763. goto out;
  764. header = bpf_jit_binary_alloc(size, &jit.start,
  765. 2, bpf_jit_fill_hole);
  766. if (!header)
  767. goto out;
  768. jit.prg = jit.mid = jit.start + prg_len;
  769. jit.lit = jit.end = jit.start + prg_len + lit_len;
  770. jit.base_ip += (unsigned long) jit.start;
  771. jit.exit_ip += (unsigned long) jit.start;
  772. jit.ret0_ip += (unsigned long) jit.start;
  773. }
  774. cjit = jit;
  775. }
  776. if (bpf_jit_enable > 1) {
  777. bpf_jit_dump(fp->len, jit.end - jit.start, pass, jit.start);
  778. if (jit.start)
  779. print_fn_code(jit.start, jit.mid - jit.start);
  780. }
  781. if (jit.start) {
  782. set_memory_ro((unsigned long)header, header->pages);
  783. fp->bpf_func = (void *) jit.start;
  784. fp->jited = true;
  785. }
  786. out:
  787. kfree(addrs);
  788. }
  789. void bpf_jit_free(struct bpf_prog *fp)
  790. {
  791. unsigned long addr = (unsigned long)fp->bpf_func & PAGE_MASK;
  792. struct bpf_binary_header *header = (void *)addr;
  793. if (!fp->jited)
  794. goto free_filter;
  795. set_memory_rw(addr, header->pages);
  796. bpf_jit_binary_free(header);
  797. free_filter:
  798. bpf_prog_unlock_free(fp);
  799. }