disasm.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  1. // SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
  2. /* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
  3. * Copyright (c) 2016 Facebook
  4. */
  5. #include <linux/bpf.h>
  6. #include "disasm.h"
  7. #define __BPF_FUNC_STR_FN(x) [BPF_FUNC_ ## x] = __stringify(bpf_ ## x)
  8. static const char * const func_id_str[] = {
  9. __BPF_FUNC_MAPPER(__BPF_FUNC_STR_FN)
  10. };
  11. #undef __BPF_FUNC_STR_FN
  12. static const char *__func_get_name(const struct bpf_insn_cbs *cbs,
  13. const struct bpf_insn *insn,
  14. char *buff, size_t len)
  15. {
  16. BUILD_BUG_ON(ARRAY_SIZE(func_id_str) != __BPF_FUNC_MAX_ID);
  17. if (!insn->src_reg &&
  18. insn->imm >= 0 && insn->imm < __BPF_FUNC_MAX_ID &&
  19. func_id_str[insn->imm])
  20. return func_id_str[insn->imm];
  21. if (cbs && cbs->cb_call) {
  22. const char *res;
  23. res = cbs->cb_call(cbs->private_data, insn);
  24. if (res)
  25. return res;
  26. }
  27. if (insn->src_reg == BPF_PSEUDO_CALL)
  28. snprintf(buff, len, "%+d", insn->imm);
  29. else if (insn->src_reg == BPF_PSEUDO_KFUNC_CALL)
  30. snprintf(buff, len, "kernel-function");
  31. return buff;
  32. }
  33. static const char *__func_imm_name(const struct bpf_insn_cbs *cbs,
  34. const struct bpf_insn *insn,
  35. u64 full_imm, char *buff, size_t len)
  36. {
  37. if (cbs && cbs->cb_imm)
  38. return cbs->cb_imm(cbs->private_data, insn, full_imm);
  39. snprintf(buff, len, "0x%llx", (unsigned long long)full_imm);
  40. return buff;
  41. }
  42. const char *func_id_name(int id)
  43. {
  44. if (id >= 0 && id < __BPF_FUNC_MAX_ID && func_id_str[id])
  45. return func_id_str[id];
  46. else
  47. return "unknown";
  48. }
  49. const char *const bpf_class_string[8] = {
  50. [BPF_LD] = "ld",
  51. [BPF_LDX] = "ldx",
  52. [BPF_ST] = "st",
  53. [BPF_STX] = "stx",
  54. [BPF_ALU] = "alu",
  55. [BPF_JMP] = "jmp",
  56. [BPF_JMP32] = "jmp32",
  57. [BPF_ALU64] = "alu64",
  58. };
  59. const char *const bpf_alu_string[16] = {
  60. [BPF_ADD >> 4] = "+=",
  61. [BPF_SUB >> 4] = "-=",
  62. [BPF_MUL >> 4] = "*=",
  63. [BPF_DIV >> 4] = "/=",
  64. [BPF_OR >> 4] = "|=",
  65. [BPF_AND >> 4] = "&=",
  66. [BPF_LSH >> 4] = "<<=",
  67. [BPF_RSH >> 4] = ">>=",
  68. [BPF_NEG >> 4] = "neg",
  69. [BPF_MOD >> 4] = "%=",
  70. [BPF_XOR >> 4] = "^=",
  71. [BPF_MOV >> 4] = "=",
  72. [BPF_ARSH >> 4] = "s>>=",
  73. [BPF_END >> 4] = "endian",
  74. };
  75. static const char *const bpf_alu_sign_string[16] = {
  76. [BPF_DIV >> 4] = "s/=",
  77. [BPF_MOD >> 4] = "s%=",
  78. };
  79. static const char *const bpf_movsx_string[4] = {
  80. [0] = "(s8)",
  81. [1] = "(s16)",
  82. [3] = "(s32)",
  83. };
  84. static const char *const bpf_atomic_alu_string[16] = {
  85. [BPF_ADD >> 4] = "add",
  86. [BPF_AND >> 4] = "and",
  87. [BPF_OR >> 4] = "or",
  88. [BPF_XOR >> 4] = "xor",
  89. };
  90. static const char *const bpf_ldst_string[] = {
  91. [BPF_W >> 3] = "u32",
  92. [BPF_H >> 3] = "u16",
  93. [BPF_B >> 3] = "u8",
  94. [BPF_DW >> 3] = "u64",
  95. };
  96. static const char *const bpf_ldsx_string[] = {
  97. [BPF_W >> 3] = "s32",
  98. [BPF_H >> 3] = "s16",
  99. [BPF_B >> 3] = "s8",
  100. };
  101. static const char *const bpf_jmp_string[16] = {
  102. [BPF_JA >> 4] = "jmp",
  103. [BPF_JEQ >> 4] = "==",
  104. [BPF_JGT >> 4] = ">",
  105. [BPF_JLT >> 4] = "<",
  106. [BPF_JGE >> 4] = ">=",
  107. [BPF_JLE >> 4] = "<=",
  108. [BPF_JSET >> 4] = "&",
  109. [BPF_JNE >> 4] = "!=",
  110. [BPF_JSGT >> 4] = "s>",
  111. [BPF_JSLT >> 4] = "s<",
  112. [BPF_JSGE >> 4] = "s>=",
  113. [BPF_JSLE >> 4] = "s<=",
  114. [BPF_CALL >> 4] = "call",
  115. [BPF_EXIT >> 4] = "exit",
  116. };
  117. static void print_bpf_end_insn(bpf_insn_print_t verbose,
  118. void *private_data,
  119. const struct bpf_insn *insn)
  120. {
  121. verbose(private_data, "(%02x) r%d = %s%d r%d\n",
  122. insn->code, insn->dst_reg,
  123. BPF_SRC(insn->code) == BPF_TO_BE ? "be" : "le",
  124. insn->imm, insn->dst_reg);
  125. }
  126. static void print_bpf_bswap_insn(bpf_insn_print_t verbose,
  127. void *private_data,
  128. const struct bpf_insn *insn)
  129. {
  130. verbose(private_data, "(%02x) r%d = bswap%d r%d\n",
  131. insn->code, insn->dst_reg,
  132. insn->imm, insn->dst_reg);
  133. }
  134. static bool is_sdiv_smod(const struct bpf_insn *insn)
  135. {
  136. return (BPF_OP(insn->code) == BPF_DIV || BPF_OP(insn->code) == BPF_MOD) &&
  137. insn->off == 1;
  138. }
  139. static bool is_movsx(const struct bpf_insn *insn)
  140. {
  141. return BPF_OP(insn->code) == BPF_MOV &&
  142. (insn->off == 8 || insn->off == 16 || insn->off == 32);
  143. }
  144. static bool is_addr_space_cast(const struct bpf_insn *insn)
  145. {
  146. return insn->code == (BPF_ALU64 | BPF_MOV | BPF_X) &&
  147. insn->off == BPF_ADDR_SPACE_CAST;
  148. }
  149. /* Special (internal-only) form of mov, used to resolve per-CPU addrs:
  150. * dst_reg = src_reg + <percpu_base_off>
  151. * BPF_ADDR_PERCPU is used as a special insn->off value.
  152. */
  153. #define BPF_ADDR_PERCPU (-1)
  154. static inline bool is_mov_percpu_addr(const struct bpf_insn *insn)
  155. {
  156. return insn->code == (BPF_ALU64 | BPF_MOV | BPF_X) && insn->off == BPF_ADDR_PERCPU;
  157. }
  158. void print_bpf_insn(const struct bpf_insn_cbs *cbs,
  159. const struct bpf_insn *insn,
  160. bool allow_ptr_leaks)
  161. {
  162. const bpf_insn_print_t verbose = cbs->cb_print;
  163. u8 class = BPF_CLASS(insn->code);
  164. if (class == BPF_ALU || class == BPF_ALU64) {
  165. if (BPF_OP(insn->code) == BPF_END) {
  166. if (class == BPF_ALU64)
  167. print_bpf_bswap_insn(verbose, cbs->private_data, insn);
  168. else
  169. print_bpf_end_insn(verbose, cbs->private_data, insn);
  170. } else if (BPF_OP(insn->code) == BPF_NEG) {
  171. verbose(cbs->private_data, "(%02x) %c%d = -%c%d\n",
  172. insn->code, class == BPF_ALU ? 'w' : 'r',
  173. insn->dst_reg, class == BPF_ALU ? 'w' : 'r',
  174. insn->dst_reg);
  175. } else if (is_addr_space_cast(insn)) {
  176. verbose(cbs->private_data, "(%02x) r%d = addr_space_cast(r%d, %d, %d)\n",
  177. insn->code, insn->dst_reg,
  178. insn->src_reg, ((u32)insn->imm) >> 16, (u16)insn->imm);
  179. } else if (is_mov_percpu_addr(insn)) {
  180. verbose(cbs->private_data, "(%02x) r%d = &(void __percpu *)(r%d)\n",
  181. insn->code, insn->dst_reg, insn->src_reg);
  182. } else if (BPF_SRC(insn->code) == BPF_X) {
  183. verbose(cbs->private_data, "(%02x) %c%d %s %s%c%d\n",
  184. insn->code, class == BPF_ALU ? 'w' : 'r',
  185. insn->dst_reg,
  186. is_sdiv_smod(insn) ? bpf_alu_sign_string[BPF_OP(insn->code) >> 4]
  187. : bpf_alu_string[BPF_OP(insn->code) >> 4],
  188. is_movsx(insn) ? bpf_movsx_string[(insn->off >> 3) - 1] : "",
  189. class == BPF_ALU ? 'w' : 'r',
  190. insn->src_reg);
  191. } else {
  192. verbose(cbs->private_data, "(%02x) %c%d %s %d\n",
  193. insn->code, class == BPF_ALU ? 'w' : 'r',
  194. insn->dst_reg,
  195. is_sdiv_smod(insn) ? bpf_alu_sign_string[BPF_OP(insn->code) >> 4]
  196. : bpf_alu_string[BPF_OP(insn->code) >> 4],
  197. insn->imm);
  198. }
  199. } else if (class == BPF_STX) {
  200. if (BPF_MODE(insn->code) == BPF_MEM)
  201. verbose(cbs->private_data, "(%02x) *(%s *)(r%d %+d) = r%d\n",
  202. insn->code,
  203. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  204. insn->dst_reg,
  205. insn->off, insn->src_reg);
  206. else if (BPF_MODE(insn->code) == BPF_ATOMIC &&
  207. (insn->imm == BPF_ADD || insn->imm == BPF_AND ||
  208. insn->imm == BPF_OR || insn->imm == BPF_XOR)) {
  209. verbose(cbs->private_data, "(%02x) lock *(%s *)(r%d %+d) %s r%d\n",
  210. insn->code,
  211. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  212. insn->dst_reg, insn->off,
  213. bpf_alu_string[BPF_OP(insn->imm) >> 4],
  214. insn->src_reg);
  215. } else if (BPF_MODE(insn->code) == BPF_ATOMIC &&
  216. (insn->imm == (BPF_ADD | BPF_FETCH) ||
  217. insn->imm == (BPF_AND | BPF_FETCH) ||
  218. insn->imm == (BPF_OR | BPF_FETCH) ||
  219. insn->imm == (BPF_XOR | BPF_FETCH))) {
  220. verbose(cbs->private_data, "(%02x) r%d = atomic%s_fetch_%s((%s *)(r%d %+d), r%d)\n",
  221. insn->code, insn->src_reg,
  222. BPF_SIZE(insn->code) == BPF_DW ? "64" : "",
  223. bpf_atomic_alu_string[BPF_OP(insn->imm) >> 4],
  224. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  225. insn->dst_reg, insn->off, insn->src_reg);
  226. } else if (BPF_MODE(insn->code) == BPF_ATOMIC &&
  227. insn->imm == BPF_CMPXCHG) {
  228. verbose(cbs->private_data, "(%02x) r0 = atomic%s_cmpxchg((%s *)(r%d %+d), r0, r%d)\n",
  229. insn->code,
  230. BPF_SIZE(insn->code) == BPF_DW ? "64" : "",
  231. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  232. insn->dst_reg, insn->off,
  233. insn->src_reg);
  234. } else if (BPF_MODE(insn->code) == BPF_ATOMIC &&
  235. insn->imm == BPF_XCHG) {
  236. verbose(cbs->private_data, "(%02x) r%d = atomic%s_xchg((%s *)(r%d %+d), r%d)\n",
  237. insn->code, insn->src_reg,
  238. BPF_SIZE(insn->code) == BPF_DW ? "64" : "",
  239. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  240. insn->dst_reg, insn->off, insn->src_reg);
  241. } else {
  242. verbose(cbs->private_data, "BUG_%02x\n", insn->code);
  243. }
  244. } else if (class == BPF_ST) {
  245. if (BPF_MODE(insn->code) == BPF_MEM) {
  246. verbose(cbs->private_data, "(%02x) *(%s *)(r%d %+d) = %d\n",
  247. insn->code,
  248. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  249. insn->dst_reg,
  250. insn->off, insn->imm);
  251. } else if (BPF_MODE(insn->code) == 0xc0 /* BPF_NOSPEC, no UAPI */) {
  252. verbose(cbs->private_data, "(%02x) nospec\n", insn->code);
  253. } else {
  254. verbose(cbs->private_data, "BUG_st_%02x\n", insn->code);
  255. }
  256. } else if (class == BPF_LDX) {
  257. if (BPF_MODE(insn->code) != BPF_MEM && BPF_MODE(insn->code) != BPF_MEMSX) {
  258. verbose(cbs->private_data, "BUG_ldx_%02x\n", insn->code);
  259. return;
  260. }
  261. verbose(cbs->private_data, "(%02x) r%d = *(%s *)(r%d %+d)\n",
  262. insn->code, insn->dst_reg,
  263. BPF_MODE(insn->code) == BPF_MEM ?
  264. bpf_ldst_string[BPF_SIZE(insn->code) >> 3] :
  265. bpf_ldsx_string[BPF_SIZE(insn->code) >> 3],
  266. insn->src_reg, insn->off);
  267. } else if (class == BPF_LD) {
  268. if (BPF_MODE(insn->code) == BPF_ABS) {
  269. verbose(cbs->private_data, "(%02x) r0 = *(%s *)skb[%d]\n",
  270. insn->code,
  271. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  272. insn->imm);
  273. } else if (BPF_MODE(insn->code) == BPF_IND) {
  274. verbose(cbs->private_data, "(%02x) r0 = *(%s *)skb[r%d + %d]\n",
  275. insn->code,
  276. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  277. insn->src_reg, insn->imm);
  278. } else if (BPF_MODE(insn->code) == BPF_IMM &&
  279. BPF_SIZE(insn->code) == BPF_DW) {
  280. /* At this point, we already made sure that the second
  281. * part of the ldimm64 insn is accessible.
  282. */
  283. u64 imm = ((u64)(insn + 1)->imm << 32) | (u32)insn->imm;
  284. bool is_ptr = insn->src_reg == BPF_PSEUDO_MAP_FD ||
  285. insn->src_reg == BPF_PSEUDO_MAP_VALUE;
  286. char tmp[64];
  287. if (is_ptr && !allow_ptr_leaks)
  288. imm = 0;
  289. verbose(cbs->private_data, "(%02x) r%d = %s\n",
  290. insn->code, insn->dst_reg,
  291. __func_imm_name(cbs, insn, imm,
  292. tmp, sizeof(tmp)));
  293. } else {
  294. verbose(cbs->private_data, "BUG_ld_%02x\n", insn->code);
  295. return;
  296. }
  297. } else if (class == BPF_JMP32 || class == BPF_JMP) {
  298. u8 opcode = BPF_OP(insn->code);
  299. if (opcode == BPF_CALL) {
  300. char tmp[64];
  301. if (insn->src_reg == BPF_PSEUDO_CALL) {
  302. verbose(cbs->private_data, "(%02x) call pc%s\n",
  303. insn->code,
  304. __func_get_name(cbs, insn,
  305. tmp, sizeof(tmp)));
  306. } else {
  307. strcpy(tmp, "unknown");
  308. verbose(cbs->private_data, "(%02x) call %s#%d\n", insn->code,
  309. __func_get_name(cbs, insn,
  310. tmp, sizeof(tmp)),
  311. insn->imm);
  312. }
  313. } else if (insn->code == (BPF_JMP | BPF_JA)) {
  314. verbose(cbs->private_data, "(%02x) goto pc%+d\n",
  315. insn->code, insn->off);
  316. } else if (insn->code == (BPF_JMP | BPF_JCOND) &&
  317. insn->src_reg == BPF_MAY_GOTO) {
  318. verbose(cbs->private_data, "(%02x) may_goto pc%+d\n",
  319. insn->code, insn->off);
  320. } else if (insn->code == (BPF_JMP32 | BPF_JA)) {
  321. verbose(cbs->private_data, "(%02x) gotol pc%+d\n",
  322. insn->code, insn->imm);
  323. } else if (insn->code == (BPF_JMP | BPF_EXIT)) {
  324. verbose(cbs->private_data, "(%02x) exit\n", insn->code);
  325. } else if (BPF_SRC(insn->code) == BPF_X) {
  326. verbose(cbs->private_data,
  327. "(%02x) if %c%d %s %c%d goto pc%+d\n",
  328. insn->code, class == BPF_JMP32 ? 'w' : 'r',
  329. insn->dst_reg,
  330. bpf_jmp_string[BPF_OP(insn->code) >> 4],
  331. class == BPF_JMP32 ? 'w' : 'r',
  332. insn->src_reg, insn->off);
  333. } else {
  334. verbose(cbs->private_data,
  335. "(%02x) if %c%d %s 0x%x goto pc%+d\n",
  336. insn->code, class == BPF_JMP32 ? 'w' : 'r',
  337. insn->dst_reg,
  338. bpf_jmp_string[BPF_OP(insn->code) >> 4],
  339. insn->imm, insn->off);
  340. }
  341. } else {
  342. verbose(cbs->private_data, "(%02x) %s\n",
  343. insn->code, bpf_class_string[class]);
  344. }
  345. }