disasm.c 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304
  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_atomic_alu_string[16] = {
  76. [BPF_ADD >> 4] = "add",
  77. [BPF_AND >> 4] = "and",
  78. [BPF_OR >> 4] = "or",
  79. [BPF_XOR >> 4] = "xor",
  80. };
  81. static const char *const bpf_ldst_string[] = {
  82. [BPF_W >> 3] = "u32",
  83. [BPF_H >> 3] = "u16",
  84. [BPF_B >> 3] = "u8",
  85. [BPF_DW >> 3] = "u64",
  86. };
  87. static const char *const bpf_jmp_string[16] = {
  88. [BPF_JA >> 4] = "jmp",
  89. [BPF_JEQ >> 4] = "==",
  90. [BPF_JGT >> 4] = ">",
  91. [BPF_JLT >> 4] = "<",
  92. [BPF_JGE >> 4] = ">=",
  93. [BPF_JLE >> 4] = "<=",
  94. [BPF_JSET >> 4] = "&",
  95. [BPF_JNE >> 4] = "!=",
  96. [BPF_JSGT >> 4] = "s>",
  97. [BPF_JSLT >> 4] = "s<",
  98. [BPF_JSGE >> 4] = "s>=",
  99. [BPF_JSLE >> 4] = "s<=",
  100. [BPF_CALL >> 4] = "call",
  101. [BPF_EXIT >> 4] = "exit",
  102. };
  103. static void print_bpf_end_insn(bpf_insn_print_t verbose,
  104. void *private_data,
  105. const struct bpf_insn *insn)
  106. {
  107. verbose(private_data, "(%02x) r%d = %s%d r%d\n",
  108. insn->code, insn->dst_reg,
  109. BPF_SRC(insn->code) == BPF_TO_BE ? "be" : "le",
  110. insn->imm, insn->dst_reg);
  111. }
  112. void print_bpf_insn(const struct bpf_insn_cbs *cbs,
  113. const struct bpf_insn *insn,
  114. bool allow_ptr_leaks)
  115. {
  116. const bpf_insn_print_t verbose = cbs->cb_print;
  117. u8 class = BPF_CLASS(insn->code);
  118. if (class == BPF_ALU || class == BPF_ALU64) {
  119. if (BPF_OP(insn->code) == BPF_END) {
  120. if (class == BPF_ALU64)
  121. verbose(cbs->private_data, "BUG_alu64_%02x\n", insn->code);
  122. else
  123. print_bpf_end_insn(verbose, cbs->private_data, insn);
  124. } else if (BPF_OP(insn->code) == BPF_NEG) {
  125. verbose(cbs->private_data, "(%02x) %c%d = -%c%d\n",
  126. insn->code, class == BPF_ALU ? 'w' : 'r',
  127. insn->dst_reg, class == BPF_ALU ? 'w' : 'r',
  128. insn->dst_reg);
  129. } else if (BPF_SRC(insn->code) == BPF_X) {
  130. verbose(cbs->private_data, "(%02x) %c%d %s %c%d\n",
  131. insn->code, class == BPF_ALU ? 'w' : 'r',
  132. insn->dst_reg,
  133. bpf_alu_string[BPF_OP(insn->code) >> 4],
  134. class == BPF_ALU ? 'w' : 'r',
  135. insn->src_reg);
  136. } else {
  137. verbose(cbs->private_data, "(%02x) %c%d %s %d\n",
  138. insn->code, class == BPF_ALU ? 'w' : 'r',
  139. insn->dst_reg,
  140. bpf_alu_string[BPF_OP(insn->code) >> 4],
  141. insn->imm);
  142. }
  143. } else if (class == BPF_STX) {
  144. if (BPF_MODE(insn->code) == BPF_MEM)
  145. verbose(cbs->private_data, "(%02x) *(%s *)(r%d %+d) = r%d\n",
  146. insn->code,
  147. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  148. insn->dst_reg,
  149. insn->off, insn->src_reg);
  150. else if (BPF_MODE(insn->code) == BPF_ATOMIC &&
  151. (insn->imm == BPF_ADD || insn->imm == BPF_AND ||
  152. insn->imm == BPF_OR || insn->imm == BPF_XOR)) {
  153. verbose(cbs->private_data, "(%02x) lock *(%s *)(r%d %+d) %s r%d\n",
  154. insn->code,
  155. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  156. insn->dst_reg, insn->off,
  157. bpf_alu_string[BPF_OP(insn->imm) >> 4],
  158. insn->src_reg);
  159. } else if (BPF_MODE(insn->code) == BPF_ATOMIC &&
  160. (insn->imm == (BPF_ADD | BPF_FETCH) ||
  161. insn->imm == (BPF_AND | BPF_FETCH) ||
  162. insn->imm == (BPF_OR | BPF_FETCH) ||
  163. insn->imm == (BPF_XOR | BPF_FETCH))) {
  164. verbose(cbs->private_data, "(%02x) r%d = atomic%s_fetch_%s((%s *)(r%d %+d), r%d)\n",
  165. insn->code, insn->src_reg,
  166. BPF_SIZE(insn->code) == BPF_DW ? "64" : "",
  167. bpf_atomic_alu_string[BPF_OP(insn->imm) >> 4],
  168. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  169. insn->dst_reg, insn->off, insn->src_reg);
  170. } else if (BPF_MODE(insn->code) == BPF_ATOMIC &&
  171. insn->imm == BPF_CMPXCHG) {
  172. verbose(cbs->private_data, "(%02x) r0 = atomic%s_cmpxchg((%s *)(r%d %+d), r0, r%d)\n",
  173. insn->code,
  174. BPF_SIZE(insn->code) == BPF_DW ? "64" : "",
  175. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  176. insn->dst_reg, insn->off,
  177. insn->src_reg);
  178. } else if (BPF_MODE(insn->code) == BPF_ATOMIC &&
  179. insn->imm == BPF_XCHG) {
  180. verbose(cbs->private_data, "(%02x) r%d = atomic%s_xchg((%s *)(r%d %+d), r%d)\n",
  181. insn->code, insn->src_reg,
  182. BPF_SIZE(insn->code) == BPF_DW ? "64" : "",
  183. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  184. insn->dst_reg, insn->off, insn->src_reg);
  185. } else {
  186. verbose(cbs->private_data, "BUG_%02x\n", insn->code);
  187. }
  188. } else if (class == BPF_ST) {
  189. if (BPF_MODE(insn->code) == BPF_MEM) {
  190. verbose(cbs->private_data, "(%02x) *(%s *)(r%d %+d) = %d\n",
  191. insn->code,
  192. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  193. insn->dst_reg,
  194. insn->off, insn->imm);
  195. } else if (BPF_MODE(insn->code) == 0xc0 /* BPF_NOSPEC, no UAPI */) {
  196. verbose(cbs->private_data, "(%02x) nospec\n", insn->code);
  197. } else {
  198. verbose(cbs->private_data, "BUG_st_%02x\n", insn->code);
  199. }
  200. } else if (class == BPF_LDX) {
  201. if (BPF_MODE(insn->code) != BPF_MEM) {
  202. verbose(cbs->private_data, "BUG_ldx_%02x\n", insn->code);
  203. return;
  204. }
  205. verbose(cbs->private_data, "(%02x) r%d = *(%s *)(r%d %+d)\n",
  206. insn->code, insn->dst_reg,
  207. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  208. insn->src_reg, insn->off);
  209. } else if (class == BPF_LD) {
  210. if (BPF_MODE(insn->code) == BPF_ABS) {
  211. verbose(cbs->private_data, "(%02x) r0 = *(%s *)skb[%d]\n",
  212. insn->code,
  213. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  214. insn->imm);
  215. } else if (BPF_MODE(insn->code) == BPF_IND) {
  216. verbose(cbs->private_data, "(%02x) r0 = *(%s *)skb[r%d + %d]\n",
  217. insn->code,
  218. bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
  219. insn->src_reg, insn->imm);
  220. } else if (BPF_MODE(insn->code) == BPF_IMM &&
  221. BPF_SIZE(insn->code) == BPF_DW) {
  222. /* At this point, we already made sure that the second
  223. * part of the ldimm64 insn is accessible.
  224. */
  225. u64 imm = ((u64)(insn + 1)->imm << 32) | (u32)insn->imm;
  226. bool is_ptr = insn->src_reg == BPF_PSEUDO_MAP_FD ||
  227. insn->src_reg == BPF_PSEUDO_MAP_VALUE;
  228. char tmp[64];
  229. if (is_ptr && !allow_ptr_leaks)
  230. imm = 0;
  231. verbose(cbs->private_data, "(%02x) r%d = %s\n",
  232. insn->code, insn->dst_reg,
  233. __func_imm_name(cbs, insn, imm,
  234. tmp, sizeof(tmp)));
  235. } else {
  236. verbose(cbs->private_data, "BUG_ld_%02x\n", insn->code);
  237. return;
  238. }
  239. } else if (class == BPF_JMP32 || class == BPF_JMP) {
  240. u8 opcode = BPF_OP(insn->code);
  241. if (opcode == BPF_CALL) {
  242. char tmp[64];
  243. if (insn->src_reg == BPF_PSEUDO_CALL) {
  244. verbose(cbs->private_data, "(%02x) call pc%s\n",
  245. insn->code,
  246. __func_get_name(cbs, insn,
  247. tmp, sizeof(tmp)));
  248. } else {
  249. strcpy(tmp, "unknown");
  250. verbose(cbs->private_data, "(%02x) call %s#%d\n", insn->code,
  251. __func_get_name(cbs, insn,
  252. tmp, sizeof(tmp)),
  253. insn->imm);
  254. }
  255. } else if (insn->code == (BPF_JMP | BPF_JA)) {
  256. verbose(cbs->private_data, "(%02x) goto pc%+d\n",
  257. insn->code, insn->off);
  258. } else if (insn->code == (BPF_JMP | BPF_EXIT)) {
  259. verbose(cbs->private_data, "(%02x) exit\n", insn->code);
  260. } else if (BPF_SRC(insn->code) == BPF_X) {
  261. verbose(cbs->private_data,
  262. "(%02x) if %c%d %s %c%d goto pc%+d\n",
  263. insn->code, class == BPF_JMP32 ? 'w' : 'r',
  264. insn->dst_reg,
  265. bpf_jmp_string[BPF_OP(insn->code) >> 4],
  266. class == BPF_JMP32 ? 'w' : 'r',
  267. insn->src_reg, insn->off);
  268. } else {
  269. verbose(cbs->private_data,
  270. "(%02x) if %c%d %s 0x%x goto pc%+d\n",
  271. insn->code, class == BPF_JMP32 ? 'w' : 'r',
  272. insn->dst_reg,
  273. bpf_jmp_string[BPF_OP(insn->code) >> 4],
  274. insn->imm, insn->off);
  275. }
  276. } else {
  277. verbose(cbs->private_data, "(%02x) %s\n",
  278. insn->code, bpf_class_string[class]);
  279. }
  280. }