bpf_jit_comp64.c 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * BPF JIT compiler for PA-RISC (64-bit)
  4. *
  5. * Copyright(c) 2023 Helge Deller <deller@gmx.de>
  6. *
  7. * The code is based on the BPF JIT compiler for RV64 by Björn Töpel.
  8. *
  9. * TODO:
  10. * - check if bpf_jit_needs_zext() is needed (currently enabled)
  11. * - implement arch_prepare_bpf_trampoline(), poke(), ...
  12. */
  13. #include <linux/bitfield.h>
  14. #include <linux/bpf.h>
  15. #include <linux/filter.h>
  16. #include <linux/libgcc.h>
  17. #include "bpf_jit.h"
  18. static const int regmap[] = {
  19. [BPF_REG_0] = HPPA_REG_RET0,
  20. [BPF_REG_1] = HPPA_R(5),
  21. [BPF_REG_2] = HPPA_R(6),
  22. [BPF_REG_3] = HPPA_R(7),
  23. [BPF_REG_4] = HPPA_R(8),
  24. [BPF_REG_5] = HPPA_R(9),
  25. [BPF_REG_6] = HPPA_R(10),
  26. [BPF_REG_7] = HPPA_R(11),
  27. [BPF_REG_8] = HPPA_R(12),
  28. [BPF_REG_9] = HPPA_R(13),
  29. [BPF_REG_FP] = HPPA_R(14),
  30. [BPF_REG_AX] = HPPA_R(15),
  31. };
  32. /*
  33. * Stack layout during BPF program execution (note: stack grows up):
  34. *
  35. * high
  36. * HPPA64 sp => +----------+ <= HPPA64 fp
  37. * | saved sp |
  38. * | saved rp |
  39. * | ... | HPPA64 callee-saved registers
  40. * | curr args|
  41. * | local var|
  42. * +----------+ <= (BPF FP)
  43. * | |
  44. * | ... | BPF program stack
  45. * | |
  46. * | ... | Function call stack
  47. * | |
  48. * +----------+
  49. * low
  50. */
  51. /* Offset from fp for BPF registers stored on stack. */
  52. #define STACK_ALIGN FRAME_SIZE
  53. #define EXIT_PTR_LOAD(reg) hppa64_ldd_im16(-FRAME_SIZE, HPPA_REG_SP, reg)
  54. #define EXIT_PTR_STORE(reg) hppa64_std_im16(reg, -FRAME_SIZE, HPPA_REG_SP)
  55. #define EXIT_PTR_JUMP(reg, nop) hppa_bv(HPPA_REG_ZERO, reg, nop)
  56. static u8 bpf_to_hppa_reg(int bpf_reg, struct hppa_jit_context *ctx)
  57. {
  58. u8 reg = regmap[bpf_reg];
  59. REG_SET_SEEN(ctx, reg);
  60. return reg;
  61. };
  62. static void emit_hppa_copy(const s8 rs, const s8 rd, struct hppa_jit_context *ctx)
  63. {
  64. REG_SET_SEEN(ctx, rd);
  65. if (OPTIMIZE_HPPA && (rs == rd))
  66. return;
  67. REG_SET_SEEN(ctx, rs);
  68. emit(hppa_copy(rs, rd), ctx);
  69. }
  70. static void emit_hppa64_depd(u8 src, u8 pos, u8 len, u8 target, bool no_zero, struct hppa_jit_context *ctx)
  71. {
  72. int c;
  73. pos &= (BITS_PER_LONG - 1);
  74. pos = 63 - pos;
  75. len = 64 - len;
  76. c = (len < 32) ? 0x4 : 0;
  77. c |= (pos >= 32) ? 0x2 : 0;
  78. c |= (no_zero) ? 0x1 : 0;
  79. emit(hppa_t10_insn(0x3c, target, src, 0, c, pos & 0x1f, len & 0x1f), ctx);
  80. }
  81. static void emit_hppa64_shld(u8 src, int num, u8 target, struct hppa_jit_context *ctx)
  82. {
  83. emit_hppa64_depd(src, 63-num, 64-num, target, 0, ctx);
  84. }
  85. static void emit_hppa64_extrd(u8 src, u8 pos, u8 len, u8 target, bool signed_op, struct hppa_jit_context *ctx)
  86. {
  87. int c;
  88. pos &= (BITS_PER_LONG - 1);
  89. len = 64 - len;
  90. c = (len < 32) ? 0x4 : 0;
  91. c |= (pos >= 32) ? 0x2 : 0;
  92. c |= signed_op ? 0x1 : 0;
  93. emit(hppa_t10_insn(0x36, src, target, 0, c, pos & 0x1f, len & 0x1f), ctx);
  94. }
  95. static void emit_hppa64_extrw(u8 src, u8 pos, u8 len, u8 target, bool signed_op, struct hppa_jit_context *ctx)
  96. {
  97. int c;
  98. pos &= (32 - 1);
  99. len = 32 - len;
  100. c = 0x06 | (signed_op ? 1 : 0);
  101. emit(hppa_t10_insn(0x34, src, target, 0, c, pos, len), ctx);
  102. }
  103. #define emit_hppa64_zext32(r, target, ctx) \
  104. emit_hppa64_extrd(r, 63, 32, target, false, ctx)
  105. #define emit_hppa64_sext32(r, target, ctx) \
  106. emit_hppa64_extrd(r, 63, 32, target, true, ctx)
  107. static void emit_hppa64_shrd(u8 src, int num, u8 target, bool signed_op, struct hppa_jit_context *ctx)
  108. {
  109. emit_hppa64_extrd(src, 63-num, 64-num, target, signed_op, ctx);
  110. }
  111. static void emit_hppa64_shrw(u8 src, int num, u8 target, bool signed_op, struct hppa_jit_context *ctx)
  112. {
  113. emit_hppa64_extrw(src, 31-num, 32-num, target, signed_op, ctx);
  114. }
  115. /* Emit variable-length instructions for 32-bit imm */
  116. static void emit_imm32(u8 rd, s32 imm, struct hppa_jit_context *ctx)
  117. {
  118. u32 lower = im11(imm);
  119. REG_SET_SEEN(ctx, rd);
  120. if (OPTIMIZE_HPPA && relative_bits_ok(imm, 14)) {
  121. emit(hppa_ldi(imm, rd), ctx);
  122. return;
  123. }
  124. if (OPTIMIZE_HPPA && lower == imm) {
  125. emit(hppa_ldo(lower, HPPA_REG_ZERO, rd), ctx);
  126. return;
  127. }
  128. emit(hppa_ldil(imm, rd), ctx);
  129. if (OPTIMIZE_HPPA && (lower == 0))
  130. return;
  131. emit(hppa_ldo(lower, rd, rd), ctx);
  132. }
  133. static bool is_32b_int(s64 val)
  134. {
  135. return val == (s32) val;
  136. }
  137. /* Emit variable-length instructions for 64-bit imm */
  138. static void emit_imm(u8 rd, s64 imm, u8 tmpreg, struct hppa_jit_context *ctx)
  139. {
  140. u32 upper32;
  141. /* get lower 32-bits into rd, sign extended */
  142. emit_imm32(rd, imm, ctx);
  143. /* do we have upper 32-bits too ? */
  144. if (OPTIMIZE_HPPA && is_32b_int(imm))
  145. return;
  146. /* load upper 32-bits into lower tmpreg and deposit into rd */
  147. upper32 = imm >> 32;
  148. if (upper32 || !OPTIMIZE_HPPA) {
  149. emit_imm32(tmpreg, upper32, ctx);
  150. emit_hppa64_depd(tmpreg, 31, 32, rd, 1, ctx);
  151. } else
  152. emit_hppa64_depd(HPPA_REG_ZERO, 31, 32, rd, 1, ctx);
  153. }
  154. static int emit_jump(signed long paoff, bool force_far,
  155. struct hppa_jit_context *ctx)
  156. {
  157. unsigned long pc, addr;
  158. /* Note: Use 2 instructions for jumps if force_far is set. */
  159. if (relative_bits_ok(paoff - HPPA_BRANCH_DISPLACEMENT, 22)) {
  160. /* use BL,long branch followed by nop() */
  161. emit(hppa64_bl_long(paoff - HPPA_BRANCH_DISPLACEMENT), ctx);
  162. if (force_far)
  163. emit(hppa_nop(), ctx);
  164. return 0;
  165. }
  166. pc = (uintptr_t) &ctx->insns[ctx->ninsns];
  167. addr = pc + (paoff * HPPA_INSN_SIZE);
  168. /* even the 64-bit kernel runs in memory below 4GB */
  169. if (WARN_ON_ONCE(addr >> 32))
  170. return -E2BIG;
  171. emit(hppa_ldil(addr, HPPA_REG_R31), ctx);
  172. emit(hppa_be_l(im11(addr) >> 2, HPPA_REG_R31, NOP_NEXT_INSTR), ctx);
  173. return 0;
  174. }
  175. static void __build_epilogue(bool is_tail_call, struct hppa_jit_context *ctx)
  176. {
  177. int i;
  178. if (is_tail_call) {
  179. /*
  180. * goto *(t0 + 4);
  181. * Skips first instruction of prologue which initializes tail
  182. * call counter. Assumes t0 contains address of target program,
  183. * see emit_bpf_tail_call.
  184. */
  185. emit(hppa_ldo(1 * HPPA_INSN_SIZE, HPPA_REG_T0, HPPA_REG_T0), ctx);
  186. emit(hppa_bv(HPPA_REG_ZERO, HPPA_REG_T0, EXEC_NEXT_INSTR), ctx);
  187. /* in delay slot: */
  188. emit(hppa_copy(HPPA_REG_TCC, HPPA_REG_TCC_IN_INIT), ctx);
  189. return;
  190. }
  191. /* load epilogue function pointer and jump to it. */
  192. /* exit point is either at next instruction, or the outest TCC exit function */
  193. emit(EXIT_PTR_LOAD(HPPA_REG_RP), ctx);
  194. emit(EXIT_PTR_JUMP(HPPA_REG_RP, NOP_NEXT_INSTR), ctx);
  195. /* NOTE: we are 64-bit and big-endian, so return lower sign-extended 32-bit value */
  196. emit_hppa64_sext32(regmap[BPF_REG_0], HPPA_REG_RET0, ctx);
  197. /* Restore callee-saved registers. */
  198. for (i = 3; i <= 15; i++) {
  199. if (OPTIMIZE_HPPA && !REG_WAS_SEEN(ctx, HPPA_R(i)))
  200. continue;
  201. emit(hppa64_ldd_im16(-REG_SIZE * i, HPPA_REG_SP, HPPA_R(i)), ctx);
  202. }
  203. /* load original return pointer (stored by outest TCC function) */
  204. emit(hppa64_ldd_im16(-2*REG_SIZE, HPPA_REG_SP, HPPA_REG_RP), ctx);
  205. emit(hppa_bv(HPPA_REG_ZERO, HPPA_REG_RP, EXEC_NEXT_INSTR), ctx);
  206. /* in delay slot: */
  207. emit(hppa64_ldd_im5(-REG_SIZE, HPPA_REG_SP, HPPA_REG_SP), ctx);
  208. emit(hppa_nop(), ctx); // XXX WARUM einer zu wenig ??
  209. }
  210. static int emit_branch(u8 op, u8 rd, u8 rs, signed long paoff,
  211. struct hppa_jit_context *ctx)
  212. {
  213. int e, s;
  214. bool far = false;
  215. int off;
  216. if (op == BPF_JSET) {
  217. /*
  218. * BPF_JSET is a special case: it has no inverse so translate
  219. * to and() function and compare against zero
  220. */
  221. emit(hppa_and(rd, rs, HPPA_REG_T0), ctx);
  222. paoff -= 1; /* reduce offset due to hppa_and() above */
  223. rd = HPPA_REG_T0;
  224. rs = HPPA_REG_ZERO;
  225. op = BPF_JNE;
  226. }
  227. /* set start after BPF_JSET */
  228. s = ctx->ninsns;
  229. if (!relative_branch_ok(paoff - HPPA_BRANCH_DISPLACEMENT + 1, 12)) {
  230. op = invert_bpf_cond(op);
  231. far = true;
  232. }
  233. /*
  234. * For a far branch, the condition is negated and we jump over the
  235. * branch itself, and the two instructions from emit_jump.
  236. * For a near branch, just use paoff.
  237. */
  238. off = far ? (2 - HPPA_BRANCH_DISPLACEMENT) : paoff - HPPA_BRANCH_DISPLACEMENT;
  239. switch (op) {
  240. /* IF (dst COND src) JUMP off */
  241. case BPF_JEQ:
  242. emit(hppa_beq(rd, rs, off), ctx);
  243. break;
  244. case BPF_JGT:
  245. emit(hppa_bgtu(rd, rs, off), ctx);
  246. break;
  247. case BPF_JLT:
  248. emit(hppa_bltu(rd, rs, off), ctx);
  249. break;
  250. case BPF_JGE:
  251. emit(hppa_bgeu(rd, rs, off), ctx);
  252. break;
  253. case BPF_JLE:
  254. emit(hppa_bleu(rd, rs, off), ctx);
  255. break;
  256. case BPF_JNE:
  257. emit(hppa_bne(rd, rs, off), ctx);
  258. break;
  259. case BPF_JSGT:
  260. emit(hppa_bgt(rd, rs, off), ctx);
  261. break;
  262. case BPF_JSLT:
  263. emit(hppa_blt(rd, rs, off), ctx);
  264. break;
  265. case BPF_JSGE:
  266. emit(hppa_bge(rd, rs, off), ctx);
  267. break;
  268. case BPF_JSLE:
  269. emit(hppa_ble(rd, rs, off), ctx);
  270. break;
  271. default:
  272. WARN_ON(1);
  273. }
  274. if (far) {
  275. int ret;
  276. e = ctx->ninsns;
  277. /* Adjust for extra insns. */
  278. paoff -= (e - s);
  279. ret = emit_jump(paoff, true, ctx);
  280. if (ret)
  281. return ret;
  282. } else {
  283. /*
  284. * always allocate 2 nops instead of the far branch to
  285. * reduce translation loops
  286. */
  287. emit(hppa_nop(), ctx);
  288. emit(hppa_nop(), ctx);
  289. }
  290. return 0;
  291. }
  292. static void emit_zext_32(u8 reg, struct hppa_jit_context *ctx)
  293. {
  294. emit_hppa64_zext32(reg, reg, ctx);
  295. }
  296. static void emit_bpf_tail_call(int insn, struct hppa_jit_context *ctx)
  297. {
  298. /*
  299. * R1 -> &ctx
  300. * R2 -> &array
  301. * R3 -> index
  302. */
  303. int off;
  304. const s8 arr_reg = regmap[BPF_REG_2];
  305. const s8 idx_reg = regmap[BPF_REG_3];
  306. struct bpf_array bpfa;
  307. struct bpf_prog bpfp;
  308. /* if there is any tail call, we need to save & restore all registers */
  309. REG_SET_SEEN_ALL(ctx);
  310. /* get address of TCC main exit function for error case into rp */
  311. emit(EXIT_PTR_LOAD(HPPA_REG_RP), ctx);
  312. /* max_entries = array->map.max_entries; */
  313. off = offsetof(struct bpf_array, map.max_entries);
  314. BUILD_BUG_ON(sizeof(bpfa.map.max_entries) != 4);
  315. emit(hppa_ldw(off, arr_reg, HPPA_REG_T1), ctx);
  316. /*
  317. * if (index >= max_entries)
  318. * goto out;
  319. */
  320. emit(hppa_bltu(idx_reg, HPPA_REG_T1, 2 - HPPA_BRANCH_DISPLACEMENT), ctx);
  321. emit(EXIT_PTR_JUMP(HPPA_REG_RP, NOP_NEXT_INSTR), ctx);
  322. /*
  323. * if (--tcc < 0)
  324. * goto out;
  325. */
  326. REG_FORCE_SEEN(ctx, HPPA_REG_TCC);
  327. emit(hppa_ldo(-1, HPPA_REG_TCC, HPPA_REG_TCC), ctx);
  328. emit(hppa_bge(HPPA_REG_TCC, HPPA_REG_ZERO, 2 - HPPA_BRANCH_DISPLACEMENT), ctx);
  329. emit(EXIT_PTR_JUMP(HPPA_REG_RP, NOP_NEXT_INSTR), ctx);
  330. /*
  331. * prog = array->ptrs[index];
  332. * if (!prog)
  333. * goto out;
  334. */
  335. BUILD_BUG_ON(sizeof(bpfa.ptrs[0]) != 8);
  336. emit(hppa64_shladd(idx_reg, 3, arr_reg, HPPA_REG_T0), ctx);
  337. off = offsetof(struct bpf_array, ptrs);
  338. BUILD_BUG_ON(off < 16);
  339. emit(hppa64_ldd_im16(off, HPPA_REG_T0, HPPA_REG_T0), ctx);
  340. emit(hppa_bne(HPPA_REG_T0, HPPA_REG_ZERO, 2 - HPPA_BRANCH_DISPLACEMENT), ctx);
  341. emit(EXIT_PTR_JUMP(HPPA_REG_RP, NOP_NEXT_INSTR), ctx);
  342. /*
  343. * tcc = temp_tcc;
  344. * goto *(prog->bpf_func + 4);
  345. */
  346. off = offsetof(struct bpf_prog, bpf_func);
  347. BUILD_BUG_ON(off < 16);
  348. BUILD_BUG_ON(sizeof(bpfp.bpf_func) != 8);
  349. emit(hppa64_ldd_im16(off, HPPA_REG_T0, HPPA_REG_T0), ctx);
  350. /* Epilogue jumps to *(t0 + 4). */
  351. __build_epilogue(true, ctx);
  352. }
  353. static void init_regs(u8 *rd, u8 *rs, const struct bpf_insn *insn,
  354. struct hppa_jit_context *ctx)
  355. {
  356. u8 code = insn->code;
  357. switch (code) {
  358. case BPF_JMP | BPF_JA:
  359. case BPF_JMP | BPF_CALL:
  360. case BPF_JMP | BPF_EXIT:
  361. case BPF_JMP | BPF_TAIL_CALL:
  362. break;
  363. default:
  364. *rd = bpf_to_hppa_reg(insn->dst_reg, ctx);
  365. }
  366. if (code & (BPF_ALU | BPF_X) || code & (BPF_ALU64 | BPF_X) ||
  367. code & (BPF_JMP | BPF_X) || code & (BPF_JMP32 | BPF_X) ||
  368. code & BPF_LDX || code & BPF_STX)
  369. *rs = bpf_to_hppa_reg(insn->src_reg, ctx);
  370. }
  371. static void emit_zext_32_rd_rs(u8 *rd, u8 *rs, struct hppa_jit_context *ctx)
  372. {
  373. emit_hppa64_zext32(*rd, HPPA_REG_T2, ctx);
  374. *rd = HPPA_REG_T2;
  375. emit_hppa64_zext32(*rs, HPPA_REG_T1, ctx);
  376. *rs = HPPA_REG_T1;
  377. }
  378. static void emit_sext_32_rd_rs(u8 *rd, u8 *rs, struct hppa_jit_context *ctx)
  379. {
  380. emit_hppa64_sext32(*rd, HPPA_REG_T2, ctx);
  381. *rd = HPPA_REG_T2;
  382. emit_hppa64_sext32(*rs, HPPA_REG_T1, ctx);
  383. *rs = HPPA_REG_T1;
  384. }
  385. static void emit_zext_32_rd_t1(u8 *rd, struct hppa_jit_context *ctx)
  386. {
  387. emit_hppa64_zext32(*rd, HPPA_REG_T2, ctx);
  388. *rd = HPPA_REG_T2;
  389. emit_zext_32(HPPA_REG_T1, ctx);
  390. }
  391. static void emit_sext_32_rd(u8 *rd, struct hppa_jit_context *ctx)
  392. {
  393. emit_hppa64_sext32(*rd, HPPA_REG_T2, ctx);
  394. *rd = HPPA_REG_T2;
  395. }
  396. static bool is_signed_bpf_cond(u8 cond)
  397. {
  398. return cond == BPF_JSGT || cond == BPF_JSLT ||
  399. cond == BPF_JSGE || cond == BPF_JSLE;
  400. }
  401. static void emit_call(u64 addr, bool fixed, struct hppa_jit_context *ctx)
  402. {
  403. const int offset_sp = 2*FRAME_SIZE;
  404. emit(hppa_ldo(offset_sp, HPPA_REG_SP, HPPA_REG_SP), ctx);
  405. emit_hppa_copy(regmap[BPF_REG_1], HPPA_REG_ARG0, ctx);
  406. emit_hppa_copy(regmap[BPF_REG_2], HPPA_REG_ARG1, ctx);
  407. emit_hppa_copy(regmap[BPF_REG_3], HPPA_REG_ARG2, ctx);
  408. emit_hppa_copy(regmap[BPF_REG_4], HPPA_REG_ARG3, ctx);
  409. emit_hppa_copy(regmap[BPF_REG_5], HPPA_REG_ARG4, ctx);
  410. /* Backup TCC. */
  411. REG_FORCE_SEEN(ctx, HPPA_REG_TCC_SAVED);
  412. if (REG_WAS_SEEN(ctx, HPPA_REG_TCC))
  413. emit(hppa_copy(HPPA_REG_TCC, HPPA_REG_TCC_SAVED), ctx);
  414. /*
  415. * Use ldil() to load absolute address. Don't use emit_imm as the
  416. * number of emitted instructions should not depend on the value of
  417. * addr.
  418. */
  419. WARN_ON(addr >> 32);
  420. /* load function address and gp from Elf64_Fdesc descriptor */
  421. emit(hppa_ldil(addr, HPPA_REG_R31), ctx);
  422. emit(hppa_ldo(im11(addr), HPPA_REG_R31, HPPA_REG_R31), ctx);
  423. emit(hppa64_ldd_im16(offsetof(struct elf64_fdesc, addr),
  424. HPPA_REG_R31, HPPA_REG_RP), ctx);
  425. emit(hppa64_bve_l_rp(HPPA_REG_RP), ctx);
  426. emit(hppa64_ldd_im16(offsetof(struct elf64_fdesc, gp),
  427. HPPA_REG_R31, HPPA_REG_GP), ctx);
  428. /* Restore TCC. */
  429. if (REG_WAS_SEEN(ctx, HPPA_REG_TCC))
  430. emit(hppa_copy(HPPA_REG_TCC_SAVED, HPPA_REG_TCC), ctx);
  431. emit(hppa_ldo(-offset_sp, HPPA_REG_SP, HPPA_REG_SP), ctx);
  432. /* Set return value. */
  433. emit_hppa_copy(HPPA_REG_RET0, regmap[BPF_REG_0], ctx);
  434. }
  435. static void emit_call_libgcc_ll(void *func, const s8 arg0,
  436. const s8 arg1, u8 opcode, struct hppa_jit_context *ctx)
  437. {
  438. u64 func_addr;
  439. if (BPF_CLASS(opcode) == BPF_ALU) {
  440. emit_hppa64_zext32(arg0, HPPA_REG_ARG0, ctx);
  441. emit_hppa64_zext32(arg1, HPPA_REG_ARG1, ctx);
  442. } else {
  443. emit_hppa_copy(arg0, HPPA_REG_ARG0, ctx);
  444. emit_hppa_copy(arg1, HPPA_REG_ARG1, ctx);
  445. }
  446. /* libcgcc overwrites HPPA_REG_RET0, so keep copy in HPPA_REG_TCC_SAVED */
  447. if (arg0 != HPPA_REG_RET0) {
  448. REG_SET_SEEN(ctx, HPPA_REG_TCC_SAVED);
  449. emit(hppa_copy(HPPA_REG_RET0, HPPA_REG_TCC_SAVED), ctx);
  450. }
  451. /* set up stack */
  452. emit(hppa_ldo(FRAME_SIZE, HPPA_REG_SP, HPPA_REG_SP), ctx);
  453. func_addr = (uintptr_t) func;
  454. /* load function func_address and gp from Elf64_Fdesc descriptor */
  455. emit_imm(HPPA_REG_R31, func_addr, arg0, ctx);
  456. emit(hppa64_ldd_im16(offsetof(struct elf64_fdesc, addr),
  457. HPPA_REG_R31, HPPA_REG_RP), ctx);
  458. /* skip the following bve_l instruction if divisor is 0. */
  459. if (BPF_OP(opcode) == BPF_DIV || BPF_OP(opcode) == BPF_MOD) {
  460. if (BPF_OP(opcode) == BPF_DIV)
  461. emit_hppa_copy(HPPA_REG_ZERO, HPPA_REG_RET0, ctx);
  462. else {
  463. emit_hppa_copy(HPPA_REG_ARG0, HPPA_REG_RET0, ctx);
  464. }
  465. emit(hppa_beq(HPPA_REG_ARG1, HPPA_REG_ZERO, 2 - HPPA_BRANCH_DISPLACEMENT), ctx);
  466. }
  467. emit(hppa64_bve_l_rp(HPPA_REG_RP), ctx);
  468. emit(hppa64_ldd_im16(offsetof(struct elf64_fdesc, gp),
  469. HPPA_REG_R31, HPPA_REG_GP), ctx);
  470. emit(hppa_ldo(-FRAME_SIZE, HPPA_REG_SP, HPPA_REG_SP), ctx);
  471. emit_hppa_copy(HPPA_REG_RET0, arg0, ctx);
  472. /* restore HPPA_REG_RET0 */
  473. if (arg0 != HPPA_REG_RET0)
  474. emit(hppa_copy(HPPA_REG_TCC_SAVED, HPPA_REG_RET0), ctx);
  475. }
  476. static void emit_store(const s8 rd, const s8 rs, s16 off,
  477. struct hppa_jit_context *ctx, const u8 size,
  478. const u8 mode)
  479. {
  480. s8 dstreg;
  481. /* need to calculate address since offset does not fit in 14 bits? */
  482. if (relative_bits_ok(off, 14))
  483. dstreg = rd;
  484. else {
  485. /* need to use R1 here, since addil puts result into R1 */
  486. dstreg = HPPA_REG_R1;
  487. emit(hppa_addil(off, rd), ctx);
  488. off = im11(off);
  489. }
  490. switch (size) {
  491. case BPF_B:
  492. emit(hppa_stb(rs, off, dstreg), ctx);
  493. break;
  494. case BPF_H:
  495. emit(hppa_sth(rs, off, dstreg), ctx);
  496. break;
  497. case BPF_W:
  498. emit(hppa_stw(rs, off, dstreg), ctx);
  499. break;
  500. case BPF_DW:
  501. if (off & 7) {
  502. emit(hppa_ldo(off, dstreg, HPPA_REG_R1), ctx);
  503. emit(hppa64_std_im5(rs, 0, HPPA_REG_R1), ctx);
  504. } else if (off >= -16 && off <= 15)
  505. emit(hppa64_std_im5(rs, off, dstreg), ctx);
  506. else
  507. emit(hppa64_std_im16(rs, off, dstreg), ctx);
  508. break;
  509. }
  510. }
  511. int bpf_jit_emit_insn(const struct bpf_insn *insn, struct hppa_jit_context *ctx,
  512. bool extra_pass)
  513. {
  514. bool is64 = BPF_CLASS(insn->code) == BPF_ALU64 ||
  515. BPF_CLASS(insn->code) == BPF_JMP;
  516. int s, e, ret, i = insn - ctx->prog->insnsi;
  517. s64 paoff;
  518. struct bpf_prog_aux *aux = ctx->prog->aux;
  519. u8 rd = -1, rs = -1, code = insn->code;
  520. s16 off = insn->off;
  521. s32 imm = insn->imm;
  522. init_regs(&rd, &rs, insn, ctx);
  523. switch (code) {
  524. /* dst = src */
  525. case BPF_ALU | BPF_MOV | BPF_X:
  526. case BPF_ALU64 | BPF_MOV | BPF_X:
  527. if (imm == 1) {
  528. /* Special mov32 for zext */
  529. emit_zext_32(rd, ctx);
  530. break;
  531. }
  532. if (!is64 && !aux->verifier_zext)
  533. emit_hppa64_zext32(rs, rd, ctx);
  534. else
  535. emit_hppa_copy(rs, rd, ctx);
  536. break;
  537. /* dst = dst OP src */
  538. case BPF_ALU | BPF_ADD | BPF_X:
  539. case BPF_ALU64 | BPF_ADD | BPF_X:
  540. emit(hppa_add(rd, rs, rd), ctx);
  541. if (!is64 && !aux->verifier_zext)
  542. emit_zext_32(rd, ctx);
  543. break;
  544. case BPF_ALU | BPF_SUB | BPF_X:
  545. case BPF_ALU64 | BPF_SUB | BPF_X:
  546. emit(hppa_sub(rd, rs, rd), ctx);
  547. if (!is64 && !aux->verifier_zext)
  548. emit_zext_32(rd, ctx);
  549. break;
  550. case BPF_ALU | BPF_AND | BPF_X:
  551. case BPF_ALU64 | BPF_AND | BPF_X:
  552. emit(hppa_and(rd, rs, rd), ctx);
  553. if (!is64 && !aux->verifier_zext)
  554. emit_zext_32(rd, ctx);
  555. break;
  556. case BPF_ALU | BPF_OR | BPF_X:
  557. case BPF_ALU64 | BPF_OR | BPF_X:
  558. emit(hppa_or(rd, rs, rd), ctx);
  559. if (!is64 && !aux->verifier_zext)
  560. emit_zext_32(rd, ctx);
  561. break;
  562. case BPF_ALU | BPF_XOR | BPF_X:
  563. case BPF_ALU64 | BPF_XOR | BPF_X:
  564. emit(hppa_xor(rd, rs, rd), ctx);
  565. if (!is64 && !aux->verifier_zext && rs != rd)
  566. emit_zext_32(rd, ctx);
  567. break;
  568. case BPF_ALU | BPF_MUL | BPF_K:
  569. case BPF_ALU64 | BPF_MUL | BPF_K:
  570. emit_imm(HPPA_REG_T1, is64 ? (s64)(s32)imm : (u32)imm, HPPA_REG_T2, ctx);
  571. rs = HPPA_REG_T1;
  572. fallthrough;
  573. case BPF_ALU | BPF_MUL | BPF_X:
  574. case BPF_ALU64 | BPF_MUL | BPF_X:
  575. emit_call_libgcc_ll(__muldi3, rd, rs, code, ctx);
  576. if (!is64 && !aux->verifier_zext)
  577. emit_zext_32(rd, ctx);
  578. break;
  579. case BPF_ALU | BPF_DIV | BPF_K:
  580. case BPF_ALU64 | BPF_DIV | BPF_K:
  581. emit_imm(HPPA_REG_T1, is64 ? (s64)(s32)imm : (u32)imm, HPPA_REG_T2, ctx);
  582. rs = HPPA_REG_T1;
  583. fallthrough;
  584. case BPF_ALU | BPF_DIV | BPF_X:
  585. case BPF_ALU64 | BPF_DIV | BPF_X:
  586. emit_call_libgcc_ll(&hppa_div64, rd, rs, code, ctx);
  587. if (!is64 && !aux->verifier_zext)
  588. emit_zext_32(rd, ctx);
  589. break;
  590. case BPF_ALU | BPF_MOD | BPF_K:
  591. case BPF_ALU64 | BPF_MOD | BPF_K:
  592. emit_imm(HPPA_REG_T1, is64 ? (s64)(s32)imm : (u32)imm, HPPA_REG_T2, ctx);
  593. rs = HPPA_REG_T1;
  594. fallthrough;
  595. case BPF_ALU | BPF_MOD | BPF_X:
  596. case BPF_ALU64 | BPF_MOD | BPF_X:
  597. emit_call_libgcc_ll(&hppa_div64_rem, rd, rs, code, ctx);
  598. if (!is64 && !aux->verifier_zext)
  599. emit_zext_32(rd, ctx);
  600. break;
  601. case BPF_ALU | BPF_LSH | BPF_X:
  602. case BPF_ALU64 | BPF_LSH | BPF_X:
  603. emit_hppa64_sext32(rs, HPPA_REG_T0, ctx);
  604. emit(hppa64_mtsarcm(HPPA_REG_T0), ctx);
  605. if (is64)
  606. emit(hppa64_depdz_sar(rd, rd), ctx);
  607. else
  608. emit(hppa_depwz_sar(rd, rd), ctx);
  609. if (!is64 && !aux->verifier_zext)
  610. emit_zext_32(rd, ctx);
  611. break;
  612. case BPF_ALU | BPF_RSH | BPF_X:
  613. case BPF_ALU64 | BPF_RSH | BPF_X:
  614. emit(hppa_mtsar(rs), ctx);
  615. if (is64)
  616. emit(hppa64_shrpd_sar(rd, rd), ctx);
  617. else
  618. emit(hppa_shrpw_sar(rd, rd), ctx);
  619. if (!is64 && !aux->verifier_zext)
  620. emit_zext_32(rd, ctx);
  621. break;
  622. case BPF_ALU | BPF_ARSH | BPF_X:
  623. case BPF_ALU64 | BPF_ARSH | BPF_X:
  624. emit_hppa64_sext32(rs, HPPA_REG_T0, ctx);
  625. emit(hppa64_mtsarcm(HPPA_REG_T0), ctx);
  626. if (is64)
  627. emit(hppa_extrd_sar(rd, rd, 1), ctx);
  628. else
  629. emit(hppa_extrws_sar(rd, rd), ctx);
  630. if (!is64 && !aux->verifier_zext)
  631. emit_zext_32(rd, ctx);
  632. break;
  633. /* dst = -dst */
  634. case BPF_ALU | BPF_NEG:
  635. case BPF_ALU64 | BPF_NEG:
  636. emit(hppa_sub(HPPA_REG_ZERO, rd, rd), ctx);
  637. if (!is64 && !aux->verifier_zext)
  638. emit_zext_32(rd, ctx);
  639. break;
  640. /* dst = BSWAP##imm(dst) */
  641. case BPF_ALU | BPF_END | BPF_FROM_BE:
  642. switch (imm) {
  643. case 16:
  644. /* zero-extend 16 bits into 64 bits */
  645. emit_hppa64_depd(HPPA_REG_ZERO, 63-16, 64-16, rd, 1, ctx);
  646. break;
  647. case 32:
  648. if (!aux->verifier_zext)
  649. emit_zext_32(rd, ctx);
  650. break;
  651. case 64:
  652. /* Do nothing */
  653. break;
  654. }
  655. break;
  656. case BPF_ALU | BPF_END | BPF_FROM_LE:
  657. switch (imm) {
  658. case 16:
  659. emit(hppa_extru(rd, 31 - 8, 8, HPPA_REG_T1), ctx);
  660. emit(hppa_depwz(rd, 23, 8, HPPA_REG_T1), ctx);
  661. emit(hppa_extru(HPPA_REG_T1, 31, 16, rd), ctx);
  662. emit_hppa64_extrd(HPPA_REG_T1, 63, 16, rd, 0, ctx);
  663. break;
  664. case 32:
  665. emit(hppa_shrpw(rd, rd, 16, HPPA_REG_T1), ctx);
  666. emit_hppa64_depd(HPPA_REG_T1, 63-16, 8, HPPA_REG_T1, 1, ctx);
  667. emit(hppa_shrpw(rd, HPPA_REG_T1, 8, HPPA_REG_T1), ctx);
  668. emit_hppa64_extrd(HPPA_REG_T1, 63, 32, rd, 0, ctx);
  669. break;
  670. case 64:
  671. emit(hppa64_permh_3210(rd, HPPA_REG_T1), ctx);
  672. emit(hppa64_hshl(HPPA_REG_T1, 8, HPPA_REG_T2), ctx);
  673. emit(hppa64_hshr_u(HPPA_REG_T1, 8, HPPA_REG_T1), ctx);
  674. emit(hppa_or(HPPA_REG_T2, HPPA_REG_T1, rd), ctx);
  675. break;
  676. default:
  677. pr_err("bpf-jit: BPF_END imm %d invalid\n", imm);
  678. return -1;
  679. }
  680. break;
  681. /* dst = imm */
  682. case BPF_ALU | BPF_MOV | BPF_K:
  683. case BPF_ALU64 | BPF_MOV | BPF_K:
  684. emit_imm(rd, imm, HPPA_REG_T2, ctx);
  685. if (!is64 && !aux->verifier_zext)
  686. emit_zext_32(rd, ctx);
  687. break;
  688. /* dst = dst OP imm */
  689. case BPF_ALU | BPF_ADD | BPF_K:
  690. case BPF_ALU64 | BPF_ADD | BPF_K:
  691. if (relative_bits_ok(imm, 14)) {
  692. emit(hppa_ldo(imm, rd, rd), ctx);
  693. } else {
  694. emit_imm(HPPA_REG_T1, imm, HPPA_REG_T2, ctx);
  695. emit(hppa_add(rd, HPPA_REG_T1, rd), ctx);
  696. }
  697. if (!is64 && !aux->verifier_zext)
  698. emit_zext_32(rd, ctx);
  699. break;
  700. case BPF_ALU | BPF_SUB | BPF_K:
  701. case BPF_ALU64 | BPF_SUB | BPF_K:
  702. if (relative_bits_ok(-imm, 14)) {
  703. emit(hppa_ldo(-imm, rd, rd), ctx);
  704. } else {
  705. emit_imm(HPPA_REG_T1, imm, HPPA_REG_T2, ctx);
  706. emit(hppa_sub(rd, HPPA_REG_T1, rd), ctx);
  707. }
  708. if (!is64 && !aux->verifier_zext)
  709. emit_zext_32(rd, ctx);
  710. break;
  711. case BPF_ALU | BPF_AND | BPF_K:
  712. case BPF_ALU64 | BPF_AND | BPF_K:
  713. emit_imm(HPPA_REG_T1, imm, HPPA_REG_T2, ctx);
  714. emit(hppa_and(rd, HPPA_REG_T1, rd), ctx);
  715. if (!is64 && !aux->verifier_zext)
  716. emit_zext_32(rd, ctx);
  717. break;
  718. case BPF_ALU | BPF_OR | BPF_K:
  719. case BPF_ALU64 | BPF_OR | BPF_K:
  720. emit_imm(HPPA_REG_T1, imm, HPPA_REG_T2, ctx);
  721. emit(hppa_or(rd, HPPA_REG_T1, rd), ctx);
  722. if (!is64 && !aux->verifier_zext)
  723. emit_zext_32(rd, ctx);
  724. break;
  725. case BPF_ALU | BPF_XOR | BPF_K:
  726. case BPF_ALU64 | BPF_XOR | BPF_K:
  727. emit_imm(HPPA_REG_T1, imm, HPPA_REG_T2, ctx);
  728. emit(hppa_xor(rd, HPPA_REG_T1, rd), ctx);
  729. if (!is64 && !aux->verifier_zext)
  730. emit_zext_32(rd, ctx);
  731. break;
  732. case BPF_ALU | BPF_LSH | BPF_K:
  733. case BPF_ALU64 | BPF_LSH | BPF_K:
  734. if (imm != 0) {
  735. emit_hppa64_shld(rd, imm, rd, ctx);
  736. }
  737. if (!is64 && !aux->verifier_zext)
  738. emit_zext_32(rd, ctx);
  739. break;
  740. case BPF_ALU | BPF_RSH | BPF_K:
  741. case BPF_ALU64 | BPF_RSH | BPF_K:
  742. if (imm != 0) {
  743. if (is64)
  744. emit_hppa64_shrd(rd, imm, rd, false, ctx);
  745. else
  746. emit_hppa64_shrw(rd, imm, rd, false, ctx);
  747. }
  748. if (!is64 && !aux->verifier_zext)
  749. emit_zext_32(rd, ctx);
  750. break;
  751. case BPF_ALU | BPF_ARSH | BPF_K:
  752. case BPF_ALU64 | BPF_ARSH | BPF_K:
  753. if (imm != 0) {
  754. if (is64)
  755. emit_hppa64_shrd(rd, imm, rd, true, ctx);
  756. else
  757. emit_hppa64_shrw(rd, imm, rd, true, ctx);
  758. }
  759. if (!is64 && !aux->verifier_zext)
  760. emit_zext_32(rd, ctx);
  761. break;
  762. /* JUMP off */
  763. case BPF_JMP | BPF_JA:
  764. paoff = hppa_offset(i, off, ctx);
  765. ret = emit_jump(paoff, false, ctx);
  766. if (ret)
  767. return ret;
  768. break;
  769. /* IF (dst COND src) JUMP off */
  770. case BPF_JMP | BPF_JEQ | BPF_X:
  771. case BPF_JMP32 | BPF_JEQ | BPF_X:
  772. case BPF_JMP | BPF_JGT | BPF_X:
  773. case BPF_JMP32 | BPF_JGT | BPF_X:
  774. case BPF_JMP | BPF_JLT | BPF_X:
  775. case BPF_JMP32 | BPF_JLT | BPF_X:
  776. case BPF_JMP | BPF_JGE | BPF_X:
  777. case BPF_JMP32 | BPF_JGE | BPF_X:
  778. case BPF_JMP | BPF_JLE | BPF_X:
  779. case BPF_JMP32 | BPF_JLE | BPF_X:
  780. case BPF_JMP | BPF_JNE | BPF_X:
  781. case BPF_JMP32 | BPF_JNE | BPF_X:
  782. case BPF_JMP | BPF_JSGT | BPF_X:
  783. case BPF_JMP32 | BPF_JSGT | BPF_X:
  784. case BPF_JMP | BPF_JSLT | BPF_X:
  785. case BPF_JMP32 | BPF_JSLT | BPF_X:
  786. case BPF_JMP | BPF_JSGE | BPF_X:
  787. case BPF_JMP32 | BPF_JSGE | BPF_X:
  788. case BPF_JMP | BPF_JSLE | BPF_X:
  789. case BPF_JMP32 | BPF_JSLE | BPF_X:
  790. case BPF_JMP | BPF_JSET | BPF_X:
  791. case BPF_JMP32 | BPF_JSET | BPF_X:
  792. paoff = hppa_offset(i, off, ctx);
  793. if (!is64) {
  794. s = ctx->ninsns;
  795. if (is_signed_bpf_cond(BPF_OP(code)))
  796. emit_sext_32_rd_rs(&rd, &rs, ctx);
  797. else
  798. emit_zext_32_rd_rs(&rd, &rs, ctx);
  799. e = ctx->ninsns;
  800. /* Adjust for extra insns */
  801. paoff -= (e - s);
  802. }
  803. if (BPF_OP(code) == BPF_JSET) {
  804. /* Adjust for and */
  805. paoff -= 1;
  806. emit(hppa_and(rs, rd, HPPA_REG_T1), ctx);
  807. emit_branch(BPF_JNE, HPPA_REG_T1, HPPA_REG_ZERO, paoff,
  808. ctx);
  809. } else {
  810. emit_branch(BPF_OP(code), rd, rs, paoff, ctx);
  811. }
  812. break;
  813. /* IF (dst COND imm) JUMP off */
  814. case BPF_JMP | BPF_JEQ | BPF_K:
  815. case BPF_JMP32 | BPF_JEQ | BPF_K:
  816. case BPF_JMP | BPF_JGT | BPF_K:
  817. case BPF_JMP32 | BPF_JGT | BPF_K:
  818. case BPF_JMP | BPF_JLT | BPF_K:
  819. case BPF_JMP32 | BPF_JLT | BPF_K:
  820. case BPF_JMP | BPF_JGE | BPF_K:
  821. case BPF_JMP32 | BPF_JGE | BPF_K:
  822. case BPF_JMP | BPF_JLE | BPF_K:
  823. case BPF_JMP32 | BPF_JLE | BPF_K:
  824. case BPF_JMP | BPF_JNE | BPF_K:
  825. case BPF_JMP32 | BPF_JNE | BPF_K:
  826. case BPF_JMP | BPF_JSGT | BPF_K:
  827. case BPF_JMP32 | BPF_JSGT | BPF_K:
  828. case BPF_JMP | BPF_JSLT | BPF_K:
  829. case BPF_JMP32 | BPF_JSLT | BPF_K:
  830. case BPF_JMP | BPF_JSGE | BPF_K:
  831. case BPF_JMP32 | BPF_JSGE | BPF_K:
  832. case BPF_JMP | BPF_JSLE | BPF_K:
  833. case BPF_JMP32 | BPF_JSLE | BPF_K:
  834. paoff = hppa_offset(i, off, ctx);
  835. s = ctx->ninsns;
  836. if (imm) {
  837. emit_imm(HPPA_REG_T1, imm, HPPA_REG_T2, ctx);
  838. rs = HPPA_REG_T1;
  839. } else {
  840. rs = HPPA_REG_ZERO;
  841. }
  842. if (!is64) {
  843. if (is_signed_bpf_cond(BPF_OP(code)))
  844. emit_sext_32_rd(&rd, ctx);
  845. else
  846. emit_zext_32_rd_t1(&rd, ctx);
  847. }
  848. e = ctx->ninsns;
  849. /* Adjust for extra insns */
  850. paoff -= (e - s);
  851. emit_branch(BPF_OP(code), rd, rs, paoff, ctx);
  852. break;
  853. case BPF_JMP | BPF_JSET | BPF_K:
  854. case BPF_JMP32 | BPF_JSET | BPF_K:
  855. paoff = hppa_offset(i, off, ctx);
  856. s = ctx->ninsns;
  857. emit_imm(HPPA_REG_T1, imm, HPPA_REG_T2, ctx);
  858. emit(hppa_and(HPPA_REG_T1, rd, HPPA_REG_T1), ctx);
  859. /* For jset32, we should clear the upper 32 bits of t1, but
  860. * sign-extension is sufficient here and saves one instruction,
  861. * as t1 is used only in comparison against zero.
  862. */
  863. if (!is64 && imm < 0)
  864. emit_hppa64_sext32(HPPA_REG_T1, HPPA_REG_T1, ctx);
  865. e = ctx->ninsns;
  866. paoff -= (e - s);
  867. emit_branch(BPF_JNE, HPPA_REG_T1, HPPA_REG_ZERO, paoff, ctx);
  868. break;
  869. /* function call */
  870. case BPF_JMP | BPF_CALL:
  871. {
  872. bool fixed_addr;
  873. u64 addr;
  874. ret = bpf_jit_get_func_addr(ctx->prog, insn, extra_pass,
  875. &addr, &fixed_addr);
  876. if (ret < 0)
  877. return ret;
  878. REG_SET_SEEN_ALL(ctx);
  879. emit_call(addr, fixed_addr, ctx);
  880. break;
  881. }
  882. /* tail call */
  883. case BPF_JMP | BPF_TAIL_CALL:
  884. emit_bpf_tail_call(i, ctx);
  885. break;
  886. /* function return */
  887. case BPF_JMP | BPF_EXIT:
  888. if (i == ctx->prog->len - 1)
  889. break;
  890. paoff = epilogue_offset(ctx);
  891. ret = emit_jump(paoff, false, ctx);
  892. if (ret)
  893. return ret;
  894. break;
  895. /* dst = imm64 */
  896. case BPF_LD | BPF_IMM | BPF_DW:
  897. {
  898. struct bpf_insn insn1 = insn[1];
  899. u64 imm64 = (u64)insn1.imm << 32 | (u32)imm;
  900. if (bpf_pseudo_func(insn))
  901. imm64 = (uintptr_t)dereference_function_descriptor((void*)imm64);
  902. emit_imm(rd, imm64, HPPA_REG_T2, ctx);
  903. return 1;
  904. }
  905. /* LDX: dst = *(size *)(src + off) */
  906. case BPF_LDX | BPF_MEM | BPF_B:
  907. case BPF_LDX | BPF_MEM | BPF_H:
  908. case BPF_LDX | BPF_MEM | BPF_W:
  909. case BPF_LDX | BPF_MEM | BPF_DW:
  910. case BPF_LDX | BPF_PROBE_MEM | BPF_B:
  911. case BPF_LDX | BPF_PROBE_MEM | BPF_H:
  912. case BPF_LDX | BPF_PROBE_MEM | BPF_W:
  913. case BPF_LDX | BPF_PROBE_MEM | BPF_DW:
  914. {
  915. u8 srcreg;
  916. /* need to calculate address since offset does not fit in 14 bits? */
  917. if (relative_bits_ok(off, 14))
  918. srcreg = rs;
  919. else {
  920. /* need to use R1 here, since addil puts result into R1 */
  921. srcreg = HPPA_REG_R1;
  922. BUG_ON(rs == HPPA_REG_R1);
  923. BUG_ON(rd == HPPA_REG_R1);
  924. emit(hppa_addil(off, rs), ctx);
  925. off = im11(off);
  926. }
  927. switch (BPF_SIZE(code)) {
  928. case BPF_B:
  929. emit(hppa_ldb(off, srcreg, rd), ctx);
  930. if (insn_is_zext(&insn[1]))
  931. return 1;
  932. break;
  933. case BPF_H:
  934. emit(hppa_ldh(off, srcreg, rd), ctx);
  935. if (insn_is_zext(&insn[1]))
  936. return 1;
  937. break;
  938. case BPF_W:
  939. emit(hppa_ldw(off, srcreg, rd), ctx);
  940. if (insn_is_zext(&insn[1]))
  941. return 1;
  942. break;
  943. case BPF_DW:
  944. if (off & 7) {
  945. emit(hppa_ldo(off, srcreg, HPPA_REG_R1), ctx);
  946. emit(hppa64_ldd_reg(HPPA_REG_ZERO, HPPA_REG_R1, rd), ctx);
  947. } else if (off >= -16 && off <= 15)
  948. emit(hppa64_ldd_im5(off, srcreg, rd), ctx);
  949. else
  950. emit(hppa64_ldd_im16(off, srcreg, rd), ctx);
  951. break;
  952. }
  953. break;
  954. }
  955. /* speculation barrier */
  956. case BPF_ST | BPF_NOSPEC:
  957. break;
  958. /* ST: *(size *)(dst + off) = imm */
  959. /* STX: *(size *)(dst + off) = src */
  960. case BPF_ST | BPF_MEM | BPF_B:
  961. case BPF_ST | BPF_MEM | BPF_H:
  962. case BPF_ST | BPF_MEM | BPF_W:
  963. case BPF_ST | BPF_MEM | BPF_DW:
  964. case BPF_STX | BPF_MEM | BPF_B:
  965. case BPF_STX | BPF_MEM | BPF_H:
  966. case BPF_STX | BPF_MEM | BPF_W:
  967. case BPF_STX | BPF_MEM | BPF_DW:
  968. if (BPF_CLASS(code) == BPF_ST) {
  969. emit_imm(HPPA_REG_T2, imm, HPPA_REG_T1, ctx);
  970. rs = HPPA_REG_T2;
  971. }
  972. emit_store(rd, rs, off, ctx, BPF_SIZE(code), BPF_MODE(code));
  973. break;
  974. case BPF_STX | BPF_ATOMIC | BPF_W:
  975. case BPF_STX | BPF_ATOMIC | BPF_DW:
  976. pr_info_once(
  977. "bpf-jit: not supported: atomic operation %02x ***\n",
  978. insn->imm);
  979. return -EFAULT;
  980. default:
  981. pr_err("bpf-jit: unknown opcode %02x\n", code);
  982. return -EINVAL;
  983. }
  984. return 0;
  985. }
  986. void bpf_jit_build_prologue(struct hppa_jit_context *ctx)
  987. {
  988. int bpf_stack_adjust, stack_adjust, i;
  989. unsigned long addr;
  990. s8 reg;
  991. /*
  992. * stack on hppa grows up, so if tail calls are used we need to
  993. * allocate the maximum stack size
  994. */
  995. if (REG_ALL_SEEN(ctx))
  996. bpf_stack_adjust = MAX_BPF_STACK;
  997. else
  998. bpf_stack_adjust = ctx->prog->aux->stack_depth;
  999. bpf_stack_adjust = round_up(bpf_stack_adjust, STACK_ALIGN);
  1000. stack_adjust = FRAME_SIZE + bpf_stack_adjust;
  1001. stack_adjust = round_up(stack_adjust, STACK_ALIGN);
  1002. /*
  1003. * NOTE: We construct an Elf64_Fdesc descriptor here.
  1004. * The first 4 words initialize the TCC and compares them.
  1005. * Then follows the virtual address of the eBPF function,
  1006. * and the gp for this function.
  1007. *
  1008. * The first instruction sets the tail-call-counter (TCC) register.
  1009. * This instruction is skipped by tail calls.
  1010. * Use a temporary register instead of a caller-saved register initially.
  1011. */
  1012. REG_FORCE_SEEN(ctx, HPPA_REG_TCC_IN_INIT);
  1013. emit(hppa_ldi(MAX_TAIL_CALL_CNT, HPPA_REG_TCC_IN_INIT), ctx);
  1014. /*
  1015. * Skip all initializations when called as BPF TAIL call.
  1016. */
  1017. emit(hppa_ldi(MAX_TAIL_CALL_CNT, HPPA_REG_R1), ctx);
  1018. emit(hppa_beq(HPPA_REG_TCC_IN_INIT, HPPA_REG_R1, 6 - HPPA_BRANCH_DISPLACEMENT), ctx);
  1019. emit(hppa64_bl_long(ctx->prologue_len - 3 - HPPA_BRANCH_DISPLACEMENT), ctx);
  1020. /* store entry address of this eBPF function */
  1021. addr = (uintptr_t) &ctx->insns[0];
  1022. emit(addr >> 32, ctx);
  1023. emit(addr & 0xffffffff, ctx);
  1024. /* store gp of this eBPF function */
  1025. asm("copy %%r27,%0" : "=r" (addr) );
  1026. emit(addr >> 32, ctx);
  1027. emit(addr & 0xffffffff, ctx);
  1028. /* Set up hppa stack frame. */
  1029. emit_hppa_copy(HPPA_REG_SP, HPPA_REG_R1, ctx);
  1030. emit(hppa_ldo(stack_adjust, HPPA_REG_SP, HPPA_REG_SP), ctx);
  1031. emit(hppa64_std_im5 (HPPA_REG_R1, -REG_SIZE, HPPA_REG_SP), ctx);
  1032. emit(hppa64_std_im16(HPPA_REG_RP, -2*REG_SIZE, HPPA_REG_SP), ctx);
  1033. /* Save callee-save registers. */
  1034. for (i = 3; i <= 15; i++) {
  1035. if (OPTIMIZE_HPPA && !REG_WAS_SEEN(ctx, HPPA_R(i)))
  1036. continue;
  1037. emit(hppa64_std_im16(HPPA_R(i), -REG_SIZE * i, HPPA_REG_SP), ctx);
  1038. }
  1039. /* load function parameters; load all if we use tail functions */
  1040. #define LOAD_PARAM(arg, dst) \
  1041. if (REG_WAS_SEEN(ctx, regmap[dst]) || \
  1042. REG_WAS_SEEN(ctx, HPPA_REG_TCC)) \
  1043. emit_hppa_copy(arg, regmap[dst], ctx)
  1044. LOAD_PARAM(HPPA_REG_ARG0, BPF_REG_1);
  1045. LOAD_PARAM(HPPA_REG_ARG1, BPF_REG_2);
  1046. LOAD_PARAM(HPPA_REG_ARG2, BPF_REG_3);
  1047. LOAD_PARAM(HPPA_REG_ARG3, BPF_REG_4);
  1048. LOAD_PARAM(HPPA_REG_ARG4, BPF_REG_5);
  1049. #undef LOAD_PARAM
  1050. REG_FORCE_SEEN(ctx, HPPA_REG_T0);
  1051. REG_FORCE_SEEN(ctx, HPPA_REG_T1);
  1052. REG_FORCE_SEEN(ctx, HPPA_REG_T2);
  1053. /*
  1054. * Now really set the tail call counter (TCC) register.
  1055. */
  1056. if (REG_WAS_SEEN(ctx, HPPA_REG_TCC))
  1057. emit(hppa_ldi(MAX_TAIL_CALL_CNT, HPPA_REG_TCC), ctx);
  1058. /*
  1059. * Save epilogue function pointer for outer TCC call chain.
  1060. * The main TCC call stores the final RP on stack.
  1061. */
  1062. addr = (uintptr_t) &ctx->insns[ctx->epilogue_offset];
  1063. /* skip first two instructions which jump to exit */
  1064. addr += 2 * HPPA_INSN_SIZE;
  1065. emit_imm(HPPA_REG_T2, addr, HPPA_REG_T1, ctx);
  1066. emit(EXIT_PTR_STORE(HPPA_REG_T2), ctx);
  1067. /* Set up BPF frame pointer. */
  1068. reg = regmap[BPF_REG_FP]; /* -> HPPA_REG_FP */
  1069. if (REG_WAS_SEEN(ctx, reg)) {
  1070. emit(hppa_ldo(-FRAME_SIZE, HPPA_REG_SP, reg), ctx);
  1071. }
  1072. }
  1073. void bpf_jit_build_epilogue(struct hppa_jit_context *ctx)
  1074. {
  1075. __build_epilogue(false, ctx);
  1076. }
  1077. bool bpf_jit_supports_kfunc_call(void)
  1078. {
  1079. return true;
  1080. }