bpf_jit_comp.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825
  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/moduleloader.h>
  9. #include <linux/netdevice.h>
  10. #include <linux/if_vlan.h>
  11. #include <linux/filter.h>
  12. #include <asm/cacheflush.h>
  13. #include <asm/processor.h>
  14. #include <asm/facility.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_prologue(struct bpf_jit *jit)
  134. {
  135. /* Save registers and create stack frame if necessary */
  136. if (jit->seen & SEEN_DATAREF) {
  137. /* stmg %r8,%r15,88(%r15) */
  138. EMIT6(0xeb8ff058, 0x0024);
  139. /* lgr %r14,%r15 */
  140. EMIT4(0xb90400ef);
  141. /* ahi %r15,<offset> */
  142. EMIT4_IMM(0xa7fa0000, (jit->seen & SEEN_MEM) ? -112 : -80);
  143. /* stg %r14,152(%r15) */
  144. EMIT6(0xe3e0f098, 0x0024);
  145. } else if ((jit->seen & SEEN_XREG) && (jit->seen & SEEN_LITERAL))
  146. /* stmg %r12,%r13,120(%r15) */
  147. EMIT6(0xebcdf078, 0x0024);
  148. else if (jit->seen & SEEN_XREG)
  149. /* stg %r12,120(%r15) */
  150. EMIT6(0xe3c0f078, 0x0024);
  151. else if (jit->seen & SEEN_LITERAL)
  152. /* stg %r13,128(%r15) */
  153. EMIT6(0xe3d0f080, 0x0024);
  154. /* Setup literal pool */
  155. if (jit->seen & SEEN_LITERAL) {
  156. /* basr %r13,0 */
  157. EMIT2(0x0dd0);
  158. jit->base_ip = jit->prg;
  159. }
  160. jit->off_load_word = EMIT_FN_CONST(SEEN_LOAD_WORD, sk_load_word);
  161. jit->off_load_half = EMIT_FN_CONST(SEEN_LOAD_HALF, sk_load_half);
  162. jit->off_load_byte = EMIT_FN_CONST(SEEN_LOAD_BYTE, sk_load_byte);
  163. jit->off_load_bmsh = EMIT_FN_CONST(SEEN_LOAD_BMSH, sk_load_byte_msh);
  164. jit->off_load_iword = EMIT_FN_CONST(SEEN_LOAD_IWORD, sk_load_word_ind);
  165. jit->off_load_ihalf = EMIT_FN_CONST(SEEN_LOAD_IHALF, sk_load_half_ind);
  166. jit->off_load_ibyte = EMIT_FN_CONST(SEEN_LOAD_IBYTE, sk_load_byte_ind);
  167. /* Filter needs to access skb data */
  168. if (jit->seen & SEEN_DATAREF) {
  169. /* l %r11,<len>(%r2) */
  170. EMIT4_DISP(0x58b02000, offsetof(struct sk_buff, len));
  171. /* s %r11,<data_len>(%r2) */
  172. EMIT4_DISP(0x5bb02000, offsetof(struct sk_buff, data_len));
  173. /* lg %r10,<data>(%r2) */
  174. EMIT6_DISP(0xe3a02000, 0x0004,
  175. offsetof(struct sk_buff, data));
  176. }
  177. }
  178. static void bpf_jit_epilogue(struct bpf_jit *jit)
  179. {
  180. /* Return 0 */
  181. if (jit->seen & SEEN_RET0) {
  182. jit->ret0_ip = jit->prg;
  183. /* lghi %r2,0 */
  184. EMIT4(0xa7290000);
  185. }
  186. jit->exit_ip = jit->prg;
  187. /* Restore registers */
  188. if (jit->seen & SEEN_DATAREF)
  189. /* lmg %r8,%r15,<offset>(%r15) */
  190. EMIT6_DISP(0xeb8ff000, 0x0004,
  191. (jit->seen & SEEN_MEM) ? 200 : 168);
  192. else if ((jit->seen & SEEN_XREG) && (jit->seen & SEEN_LITERAL))
  193. /* lmg %r12,%r13,120(%r15) */
  194. EMIT6(0xebcdf078, 0x0004);
  195. else if (jit->seen & SEEN_XREG)
  196. /* lg %r12,120(%r15) */
  197. EMIT6(0xe3c0f078, 0x0004);
  198. else if (jit->seen & SEEN_LITERAL)
  199. /* lg %r13,128(%r15) */
  200. EMIT6(0xe3d0f080, 0x0004);
  201. /* br %r14 */
  202. EMIT2(0x07fe);
  203. }
  204. /*
  205. * make sure we dont leak kernel information to user
  206. */
  207. static void bpf_jit_noleaks(struct bpf_jit *jit, struct sock_filter *filter)
  208. {
  209. /* Clear temporary memory if (seen & SEEN_MEM) */
  210. if (jit->seen & SEEN_MEM)
  211. /* xc 0(64,%r15),0(%r15) */
  212. EMIT6(0xd73ff000, 0xf000);
  213. /* Clear X if (seen & SEEN_XREG) */
  214. if (jit->seen & SEEN_XREG)
  215. /* lhi %r12,0 */
  216. EMIT4(0xa7c80000);
  217. /* Clear A if the first register does not set it. */
  218. switch (filter[0].code) {
  219. case BPF_S_LD_W_ABS:
  220. case BPF_S_LD_H_ABS:
  221. case BPF_S_LD_B_ABS:
  222. case BPF_S_LD_W_LEN:
  223. case BPF_S_LD_W_IND:
  224. case BPF_S_LD_H_IND:
  225. case BPF_S_LD_B_IND:
  226. case BPF_S_LDX_B_MSH:
  227. case BPF_S_LD_IMM:
  228. case BPF_S_LD_MEM:
  229. case BPF_S_MISC_TXA:
  230. case BPF_S_ANC_PROTOCOL:
  231. case BPF_S_ANC_PKTTYPE:
  232. case BPF_S_ANC_IFINDEX:
  233. case BPF_S_ANC_MARK:
  234. case BPF_S_ANC_QUEUE:
  235. case BPF_S_ANC_HATYPE:
  236. case BPF_S_ANC_RXHASH:
  237. case BPF_S_ANC_CPU:
  238. case BPF_S_ANC_VLAN_TAG:
  239. case BPF_S_ANC_VLAN_TAG_PRESENT:
  240. case BPF_S_RET_K:
  241. /* first instruction sets A register */
  242. break;
  243. default: /* A = 0 */
  244. /* lhi %r5,0 */
  245. EMIT4(0xa7580000);
  246. }
  247. }
  248. static int bpf_jit_insn(struct bpf_jit *jit, struct sock_filter *filter,
  249. unsigned int *addrs, int i, int last)
  250. {
  251. unsigned int K;
  252. int offset;
  253. unsigned int mask;
  254. K = filter->k;
  255. switch (filter->code) {
  256. case BPF_S_ALU_ADD_X: /* A += X */
  257. jit->seen |= SEEN_XREG;
  258. /* ar %r5,%r12 */
  259. EMIT2(0x1a5c);
  260. break;
  261. case BPF_S_ALU_ADD_K: /* A += K */
  262. if (!K)
  263. break;
  264. if (K <= 16383)
  265. /* ahi %r5,<K> */
  266. EMIT4_IMM(0xa75a0000, K);
  267. else if (test_facility(21))
  268. /* alfi %r5,<K> */
  269. EMIT6_IMM(0xc25b0000, K);
  270. else
  271. /* a %r5,<d(K)>(%r13) */
  272. EMIT4_DISP(0x5a50d000, EMIT_CONST(K));
  273. break;
  274. case BPF_S_ALU_SUB_X: /* A -= X */
  275. jit->seen |= SEEN_XREG;
  276. /* sr %r5,%r12 */
  277. EMIT2(0x1b5c);
  278. break;
  279. case BPF_S_ALU_SUB_K: /* A -= K */
  280. if (!K)
  281. break;
  282. if (K <= 16384)
  283. /* ahi %r5,-K */
  284. EMIT4_IMM(0xa75a0000, -K);
  285. else if (test_facility(21))
  286. /* alfi %r5,-K */
  287. EMIT6_IMM(0xc25b0000, -K);
  288. else
  289. /* s %r5,<d(K)>(%r13) */
  290. EMIT4_DISP(0x5b50d000, EMIT_CONST(K));
  291. break;
  292. case BPF_S_ALU_MUL_X: /* A *= X */
  293. jit->seen |= SEEN_XREG;
  294. /* msr %r5,%r12 */
  295. EMIT4(0xb252005c);
  296. break;
  297. case BPF_S_ALU_MUL_K: /* A *= K */
  298. if (K <= 16383)
  299. /* mhi %r5,K */
  300. EMIT4_IMM(0xa75c0000, K);
  301. else if (test_facility(34))
  302. /* msfi %r5,<K> */
  303. EMIT6_IMM(0xc2510000, K);
  304. else
  305. /* ms %r5,<d(K)>(%r13) */
  306. EMIT4_DISP(0x7150d000, EMIT_CONST(K));
  307. break;
  308. case BPF_S_ALU_DIV_X: /* A /= X */
  309. jit->seen |= SEEN_XREG | SEEN_RET0;
  310. /* ltr %r12,%r12 */
  311. EMIT2(0x12cc);
  312. /* jz <ret0> */
  313. EMIT4_PCREL(0xa7840000, (jit->ret0_ip - jit->prg));
  314. /* lhi %r4,0 */
  315. EMIT4(0xa7480000);
  316. /* dr %r4,%r12 */
  317. EMIT2(0x1d4c);
  318. break;
  319. case BPF_S_ALU_DIV_K: /* A = reciprocal_divide(A, K) */
  320. /* m %r4,<d(K)>(%r13) */
  321. EMIT4_DISP(0x5c40d000, EMIT_CONST(K));
  322. /* lr %r5,%r4 */
  323. EMIT2(0x1854);
  324. break;
  325. case BPF_S_ALU_MOD_X: /* A %= X */
  326. jit->seen |= SEEN_XREG | SEEN_RET0;
  327. /* ltr %r12,%r12 */
  328. EMIT2(0x12cc);
  329. /* jz <ret0> */
  330. EMIT4_PCREL(0xa7840000, (jit->ret0_ip - jit->prg));
  331. /* lhi %r4,0 */
  332. EMIT4(0xa7480000);
  333. /* dr %r4,%r12 */
  334. EMIT2(0x1d4c);
  335. /* lr %r5,%r4 */
  336. EMIT2(0x1854);
  337. break;
  338. case BPF_S_ALU_MOD_K: /* A %= K */
  339. /* lhi %r4,0 */
  340. EMIT4(0xa7480000);
  341. /* d %r4,<d(K)>(%r13) */
  342. EMIT4_DISP(0x5d40d000, EMIT_CONST(K));
  343. /* lr %r5,%r4 */
  344. EMIT2(0x1854);
  345. break;
  346. case BPF_S_ALU_AND_X: /* A &= X */
  347. jit->seen |= SEEN_XREG;
  348. /* nr %r5,%r12 */
  349. EMIT2(0x145c);
  350. break;
  351. case BPF_S_ALU_AND_K: /* A &= K */
  352. if (test_facility(21))
  353. /* nilf %r5,<K> */
  354. EMIT6_IMM(0xc05b0000, K);
  355. else
  356. /* n %r5,<d(K)>(%r13) */
  357. EMIT4_DISP(0x5450d000, EMIT_CONST(K));
  358. break;
  359. case BPF_S_ALU_OR_X: /* A |= X */
  360. jit->seen |= SEEN_XREG;
  361. /* or %r5,%r12 */
  362. EMIT2(0x165c);
  363. break;
  364. case BPF_S_ALU_OR_K: /* A |= K */
  365. if (test_facility(21))
  366. /* oilf %r5,<K> */
  367. EMIT6_IMM(0xc05d0000, K);
  368. else
  369. /* o %r5,<d(K)>(%r13) */
  370. EMIT4_DISP(0x5650d000, EMIT_CONST(K));
  371. break;
  372. case BPF_S_ANC_ALU_XOR_X: /* A ^= X; */
  373. case BPF_S_ALU_XOR_X:
  374. jit->seen |= SEEN_XREG;
  375. /* xr %r5,%r12 */
  376. EMIT2(0x175c);
  377. break;
  378. case BPF_S_ALU_XOR_K: /* A ^= K */
  379. if (!K)
  380. break;
  381. /* x %r5,<d(K)>(%r13) */
  382. EMIT4_DISP(0x5750d000, EMIT_CONST(K));
  383. break;
  384. case BPF_S_ALU_LSH_X: /* A <<= X; */
  385. jit->seen |= SEEN_XREG;
  386. /* sll %r5,0(%r12) */
  387. EMIT4(0x8950c000);
  388. break;
  389. case BPF_S_ALU_LSH_K: /* A <<= K */
  390. if (K == 0)
  391. break;
  392. /* sll %r5,K */
  393. EMIT4_DISP(0x89500000, K);
  394. break;
  395. case BPF_S_ALU_RSH_X: /* A >>= X; */
  396. jit->seen |= SEEN_XREG;
  397. /* srl %r5,0(%r12) */
  398. EMIT4(0x8850c000);
  399. break;
  400. case BPF_S_ALU_RSH_K: /* A >>= K; */
  401. if (K == 0)
  402. break;
  403. /* srl %r5,K */
  404. EMIT4_DISP(0x88500000, K);
  405. break;
  406. case BPF_S_ALU_NEG: /* A = -A */
  407. /* lnr %r5,%r5 */
  408. EMIT2(0x1155);
  409. break;
  410. case BPF_S_JMP_JA: /* ip += K */
  411. offset = addrs[i + K] + jit->start - jit->prg;
  412. EMIT4_PCREL(0xa7f40000, offset);
  413. break;
  414. case BPF_S_JMP_JGT_K: /* ip += (A > K) ? jt : jf */
  415. mask = 0x200000; /* jh */
  416. goto kbranch;
  417. case BPF_S_JMP_JGE_K: /* ip += (A >= K) ? jt : jf */
  418. mask = 0xa00000; /* jhe */
  419. goto kbranch;
  420. case BPF_S_JMP_JEQ_K: /* ip += (A == K) ? jt : jf */
  421. mask = 0x800000; /* je */
  422. kbranch: /* Emit compare if the branch targets are different */
  423. if (filter->jt != filter->jf) {
  424. if (K <= 16383)
  425. /* chi %r5,<K> */
  426. EMIT4_IMM(0xa75e0000, K);
  427. else if (test_facility(21))
  428. /* clfi %r5,<K> */
  429. EMIT6_IMM(0xc25f0000, K);
  430. else
  431. /* c %r5,<d(K)>(%r13) */
  432. EMIT4_DISP(0x5950d000, EMIT_CONST(K));
  433. }
  434. branch: if (filter->jt == filter->jf) {
  435. if (filter->jt == 0)
  436. break;
  437. /* j <jt> */
  438. offset = addrs[i + filter->jt] + jit->start - jit->prg;
  439. EMIT4_PCREL(0xa7f40000, offset);
  440. break;
  441. }
  442. if (filter->jt != 0) {
  443. /* brc <mask>,<jt> */
  444. offset = addrs[i + filter->jt] + jit->start - jit->prg;
  445. EMIT4_PCREL(0xa7040000 | mask, offset);
  446. }
  447. if (filter->jf != 0) {
  448. /* brc <mask^15>,<jf> */
  449. offset = addrs[i + filter->jf] + jit->start - jit->prg;
  450. EMIT4_PCREL(0xa7040000 | (mask ^ 0xf00000), offset);
  451. }
  452. break;
  453. case BPF_S_JMP_JSET_K: /* ip += (A & K) ? jt : jf */
  454. mask = 0x700000; /* jnz */
  455. /* Emit test if the branch targets are different */
  456. if (filter->jt != filter->jf) {
  457. if (K > 65535) {
  458. /* lr %r4,%r5 */
  459. EMIT2(0x1845);
  460. /* n %r4,<d(K)>(%r13) */
  461. EMIT4_DISP(0x5440d000, EMIT_CONST(K));
  462. } else
  463. /* tmll %r5,K */
  464. EMIT4_IMM(0xa7510000, K);
  465. }
  466. goto branch;
  467. case BPF_S_JMP_JGT_X: /* ip += (A > X) ? jt : jf */
  468. mask = 0x200000; /* jh */
  469. goto xbranch;
  470. case BPF_S_JMP_JGE_X: /* ip += (A >= X) ? jt : jf */
  471. mask = 0xa00000; /* jhe */
  472. goto xbranch;
  473. case BPF_S_JMP_JEQ_X: /* ip += (A == X) ? jt : jf */
  474. mask = 0x800000; /* je */
  475. xbranch: /* Emit compare if the branch targets are different */
  476. if (filter->jt != filter->jf) {
  477. jit->seen |= SEEN_XREG;
  478. /* cr %r5,%r12 */
  479. EMIT2(0x195c);
  480. }
  481. goto branch;
  482. case BPF_S_JMP_JSET_X: /* ip += (A & X) ? jt : jf */
  483. mask = 0x700000; /* jnz */
  484. /* Emit test if the branch targets are different */
  485. if (filter->jt != filter->jf) {
  486. jit->seen |= SEEN_XREG;
  487. /* lr %r4,%r5 */
  488. EMIT2(0x1845);
  489. /* nr %r4,%r12 */
  490. EMIT2(0x144c);
  491. }
  492. goto branch;
  493. case BPF_S_LD_W_ABS: /* A = *(u32 *) (skb->data+K) */
  494. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_WORD;
  495. offset = jit->off_load_word;
  496. goto load_abs;
  497. case BPF_S_LD_H_ABS: /* A = *(u16 *) (skb->data+K) */
  498. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_HALF;
  499. offset = jit->off_load_half;
  500. goto load_abs;
  501. case BPF_S_LD_B_ABS: /* A = *(u8 *) (skb->data+K) */
  502. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_BYTE;
  503. offset = jit->off_load_byte;
  504. load_abs: if ((int) K < 0)
  505. goto out;
  506. call_fn: /* lg %r1,<d(function)>(%r13) */
  507. EMIT6_DISP(0xe310d000, 0x0004, offset);
  508. /* l %r3,<d(K)>(%r13) */
  509. EMIT4_DISP(0x5830d000, EMIT_CONST(K));
  510. /* basr %r8,%r1 */
  511. EMIT2(0x0d81);
  512. /* jnz <ret0> */
  513. EMIT4_PCREL(0xa7740000, (jit->ret0_ip - jit->prg));
  514. break;
  515. case BPF_S_LD_W_IND: /* A = *(u32 *) (skb->data+K+X) */
  516. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_IWORD;
  517. offset = jit->off_load_iword;
  518. goto call_fn;
  519. case BPF_S_LD_H_IND: /* A = *(u16 *) (skb->data+K+X) */
  520. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_IHALF;
  521. offset = jit->off_load_ihalf;
  522. goto call_fn;
  523. case BPF_S_LD_B_IND: /* A = *(u8 *) (skb->data+K+X) */
  524. jit->seen |= SEEN_DATAREF | SEEN_RET0 | SEEN_LOAD_IBYTE;
  525. offset = jit->off_load_ibyte;
  526. goto call_fn;
  527. case BPF_S_LDX_B_MSH:
  528. /* X = (*(u8 *)(skb->data+K) & 0xf) << 2 */
  529. jit->seen |= SEEN_RET0;
  530. if ((int) K < 0) {
  531. /* j <ret0> */
  532. EMIT4_PCREL(0xa7f40000, (jit->ret0_ip - jit->prg));
  533. break;
  534. }
  535. jit->seen |= SEEN_DATAREF | SEEN_LOAD_BMSH;
  536. offset = jit->off_load_bmsh;
  537. goto call_fn;
  538. case BPF_S_LD_W_LEN: /* A = skb->len; */
  539. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, len) != 4);
  540. /* l %r5,<d(len)>(%r2) */
  541. EMIT4_DISP(0x58502000, offsetof(struct sk_buff, len));
  542. break;
  543. case BPF_S_LDX_W_LEN: /* X = skb->len; */
  544. jit->seen |= SEEN_XREG;
  545. /* l %r12,<d(len)>(%r2) */
  546. EMIT4_DISP(0x58c02000, offsetof(struct sk_buff, len));
  547. break;
  548. case BPF_S_LD_IMM: /* A = K */
  549. if (K <= 16383)
  550. /* lhi %r5,K */
  551. EMIT4_IMM(0xa7580000, K);
  552. else if (test_facility(21))
  553. /* llilf %r5,<K> */
  554. EMIT6_IMM(0xc05f0000, K);
  555. else
  556. /* l %r5,<d(K)>(%r13) */
  557. EMIT4_DISP(0x5850d000, EMIT_CONST(K));
  558. break;
  559. case BPF_S_LDX_IMM: /* X = K */
  560. jit->seen |= SEEN_XREG;
  561. if (K <= 16383)
  562. /* lhi %r12,<K> */
  563. EMIT4_IMM(0xa7c80000, K);
  564. else if (test_facility(21))
  565. /* llilf %r12,<K> */
  566. EMIT6_IMM(0xc0cf0000, K);
  567. else
  568. /* l %r12,<d(K)>(%r13) */
  569. EMIT4_DISP(0x58c0d000, EMIT_CONST(K));
  570. break;
  571. case BPF_S_LD_MEM: /* A = mem[K] */
  572. jit->seen |= SEEN_MEM;
  573. /* l %r5,<K>(%r15) */
  574. EMIT4_DISP(0x5850f000,
  575. (jit->seen & SEEN_DATAREF) ? 160 + K*4 : K*4);
  576. break;
  577. case BPF_S_LDX_MEM: /* X = mem[K] */
  578. jit->seen |= SEEN_XREG | SEEN_MEM;
  579. /* l %r12,<K>(%r15) */
  580. EMIT4_DISP(0x58c0f000,
  581. (jit->seen & SEEN_DATAREF) ? 160 + K*4 : K*4);
  582. break;
  583. case BPF_S_MISC_TAX: /* X = A */
  584. jit->seen |= SEEN_XREG;
  585. /* lr %r12,%r5 */
  586. EMIT2(0x18c5);
  587. break;
  588. case BPF_S_MISC_TXA: /* A = X */
  589. jit->seen |= SEEN_XREG;
  590. /* lr %r5,%r12 */
  591. EMIT2(0x185c);
  592. break;
  593. case BPF_S_RET_K:
  594. if (K == 0) {
  595. jit->seen |= SEEN_RET0;
  596. if (last)
  597. break;
  598. /* j <ret0> */
  599. EMIT4_PCREL(0xa7f40000, jit->ret0_ip - jit->prg);
  600. } else {
  601. if (K <= 16383)
  602. /* lghi %r2,K */
  603. EMIT4_IMM(0xa7290000, K);
  604. else
  605. /* llgf %r2,<K>(%r13) */
  606. EMIT6_DISP(0xe320d000, 0x0016, EMIT_CONST(K));
  607. /* j <exit> */
  608. if (last && !(jit->seen & SEEN_RET0))
  609. break;
  610. EMIT4_PCREL(0xa7f40000, jit->exit_ip - jit->prg);
  611. }
  612. break;
  613. case BPF_S_RET_A:
  614. /* llgfr %r2,%r5 */
  615. EMIT4(0xb9160025);
  616. /* j <exit> */
  617. EMIT4_PCREL(0xa7f40000, jit->exit_ip - jit->prg);
  618. break;
  619. case BPF_S_ST: /* mem[K] = A */
  620. jit->seen |= SEEN_MEM;
  621. /* st %r5,<K>(%r15) */
  622. EMIT4_DISP(0x5050f000,
  623. (jit->seen & SEEN_DATAREF) ? 160 + K*4 : K*4);
  624. break;
  625. case BPF_S_STX: /* mem[K] = X : mov %ebx,off8(%rbp) */
  626. jit->seen |= SEEN_XREG | SEEN_MEM;
  627. /* st %r12,<K>(%r15) */
  628. EMIT4_DISP(0x50c0f000,
  629. (jit->seen & SEEN_DATAREF) ? 160 + K*4 : K*4);
  630. break;
  631. case BPF_S_ANC_PROTOCOL: /* A = ntohs(skb->protocol); */
  632. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, protocol) != 2);
  633. /* lhi %r5,0 */
  634. EMIT4(0xa7580000);
  635. /* icm %r5,3,<d(protocol)>(%r2) */
  636. EMIT4_DISP(0xbf532000, offsetof(struct sk_buff, protocol));
  637. break;
  638. case BPF_S_ANC_IFINDEX: /* if (!skb->dev) return 0;
  639. * A = skb->dev->ifindex */
  640. BUILD_BUG_ON(FIELD_SIZEOF(struct net_device, ifindex) != 4);
  641. jit->seen |= SEEN_RET0;
  642. /* lg %r1,<d(dev)>(%r2) */
  643. EMIT6_DISP(0xe3102000, 0x0004, offsetof(struct sk_buff, dev));
  644. /* ltgr %r1,%r1 */
  645. EMIT4(0xb9020011);
  646. /* jz <ret0> */
  647. EMIT4_PCREL(0xa7840000, jit->ret0_ip - jit->prg);
  648. /* l %r5,<d(ifindex)>(%r1) */
  649. EMIT4_DISP(0x58501000, offsetof(struct net_device, ifindex));
  650. break;
  651. case BPF_S_ANC_MARK: /* A = skb->mark */
  652. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, mark) != 4);
  653. /* l %r5,<d(mark)>(%r2) */
  654. EMIT4_DISP(0x58502000, offsetof(struct sk_buff, mark));
  655. break;
  656. case BPF_S_ANC_QUEUE: /* A = skb->queue_mapping */
  657. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, queue_mapping) != 2);
  658. /* lhi %r5,0 */
  659. EMIT4(0xa7580000);
  660. /* icm %r5,3,<d(queue_mapping)>(%r2) */
  661. EMIT4_DISP(0xbf532000, offsetof(struct sk_buff, queue_mapping));
  662. break;
  663. case BPF_S_ANC_HATYPE: /* if (!skb->dev) return 0;
  664. * A = skb->dev->type */
  665. BUILD_BUG_ON(FIELD_SIZEOF(struct net_device, type) != 2);
  666. jit->seen |= SEEN_RET0;
  667. /* lg %r1,<d(dev)>(%r2) */
  668. EMIT6_DISP(0xe3102000, 0x0004, offsetof(struct sk_buff, dev));
  669. /* ltgr %r1,%r1 */
  670. EMIT4(0xb9020011);
  671. /* jz <ret0> */
  672. EMIT4_PCREL(0xa7840000, jit->ret0_ip - jit->prg);
  673. /* lhi %r5,0 */
  674. EMIT4(0xa7580000);
  675. /* icm %r5,3,<d(type)>(%r1) */
  676. EMIT4_DISP(0xbf531000, offsetof(struct net_device, type));
  677. break;
  678. case BPF_S_ANC_RXHASH: /* A = skb->rxhash */
  679. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, rxhash) != 4);
  680. /* l %r5,<d(rxhash)>(%r2) */
  681. EMIT4_DISP(0x58502000, offsetof(struct sk_buff, rxhash));
  682. break;
  683. case BPF_S_ANC_VLAN_TAG:
  684. case BPF_S_ANC_VLAN_TAG_PRESENT:
  685. BUILD_BUG_ON(FIELD_SIZEOF(struct sk_buff, vlan_tci) != 2);
  686. BUILD_BUG_ON(VLAN_TAG_PRESENT != 0x1000);
  687. /* lhi %r5,0 */
  688. EMIT4(0xa7580000);
  689. /* icm %r5,3,<d(vlan_tci)>(%r2) */
  690. EMIT4_DISP(0xbf532000, offsetof(struct sk_buff, vlan_tci));
  691. if (filter->code == BPF_S_ANC_VLAN_TAG) {
  692. /* nill %r5,0xefff */
  693. EMIT4_IMM(0xa5570000, ~VLAN_TAG_PRESENT);
  694. } else {
  695. /* nill %r5,0x1000 */
  696. EMIT4_IMM(0xa5570000, VLAN_TAG_PRESENT);
  697. /* srl %r5,12 */
  698. EMIT4_DISP(0x88500000, 12);
  699. }
  700. break;
  701. case BPF_S_ANC_CPU: /* A = smp_processor_id() */
  702. #ifdef CONFIG_SMP
  703. /* l %r5,<d(cpu_nr)> */
  704. EMIT4_DISP(0x58500000, offsetof(struct _lowcore, cpu_nr));
  705. #else
  706. /* lhi %r5,0 */
  707. EMIT4(0xa7580000);
  708. #endif
  709. break;
  710. default: /* too complex, give up */
  711. goto out;
  712. }
  713. addrs[i] = jit->prg - jit->start;
  714. return 0;
  715. out:
  716. return -1;
  717. }
  718. void bpf_jit_compile(struct sk_filter *fp)
  719. {
  720. unsigned long size, prg_len, lit_len;
  721. struct bpf_jit jit, cjit;
  722. unsigned int *addrs;
  723. int pass, i;
  724. if (!bpf_jit_enable)
  725. return;
  726. addrs = kmalloc(fp->len * sizeof(*addrs), GFP_KERNEL);
  727. if (addrs == NULL)
  728. return;
  729. memset(addrs, 0, fp->len * sizeof(*addrs));
  730. memset(&jit, 0, sizeof(cjit));
  731. memset(&cjit, 0, sizeof(cjit));
  732. for (pass = 0; pass < 10; pass++) {
  733. jit.prg = jit.start;
  734. jit.lit = jit.mid;
  735. bpf_jit_prologue(&jit);
  736. bpf_jit_noleaks(&jit, fp->insns);
  737. for (i = 0; i < fp->len; i++) {
  738. if (bpf_jit_insn(&jit, fp->insns + i, addrs, i,
  739. i == fp->len - 1))
  740. goto out;
  741. }
  742. bpf_jit_epilogue(&jit);
  743. if (jit.start) {
  744. WARN_ON(jit.prg > cjit.prg || jit.lit > cjit.lit);
  745. if (memcmp(&jit, &cjit, sizeof(jit)) == 0)
  746. break;
  747. } else if (jit.prg == cjit.prg && jit.lit == cjit.lit) {
  748. prg_len = jit.prg - jit.start;
  749. lit_len = jit.lit - jit.mid;
  750. size = max_t(unsigned long, prg_len + lit_len,
  751. sizeof(struct work_struct));
  752. if (size >= BPF_SIZE_MAX)
  753. goto out;
  754. jit.start = module_alloc(size);
  755. if (!jit.start)
  756. goto out;
  757. jit.prg = jit.mid = jit.start + prg_len;
  758. jit.lit = jit.end = jit.start + prg_len + lit_len;
  759. jit.base_ip += (unsigned long) jit.start;
  760. jit.exit_ip += (unsigned long) jit.start;
  761. jit.ret0_ip += (unsigned long) jit.start;
  762. }
  763. cjit = jit;
  764. }
  765. if (bpf_jit_enable > 1) {
  766. pr_err("flen=%d proglen=%lu pass=%d image=%p\n",
  767. fp->len, jit.end - jit.start, pass, jit.start);
  768. if (jit.start) {
  769. printk(KERN_ERR "JIT code:\n");
  770. print_fn_code(jit.start, jit.mid - jit.start);
  771. print_hex_dump(KERN_ERR, "JIT literals:\n",
  772. DUMP_PREFIX_ADDRESS, 16, 1,
  773. jit.mid, jit.end - jit.mid, false);
  774. }
  775. }
  776. if (jit.start)
  777. fp->bpf_func = (void *) jit.start;
  778. out:
  779. kfree(addrs);
  780. }
  781. static void jit_free_defer(struct work_struct *arg)
  782. {
  783. module_free(NULL, arg);
  784. }
  785. /* run from softirq, we must use a work_struct to call
  786. * module_free() from process context
  787. */
  788. void bpf_jit_free(struct sk_filter *fp)
  789. {
  790. struct work_struct *work;
  791. if (fp->bpf_func == sk_run_filter)
  792. return;
  793. work = (struct work_struct *)fp->bpf_func;
  794. INIT_WORK(work, jit_free_defer);
  795. schedule_work(work);
  796. }