libbpf_probes.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469
  1. // SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause)
  2. /* Copyright (c) 2019 Netronome Systems, Inc. */
  3. #include <errno.h>
  4. #include <fcntl.h>
  5. #include <string.h>
  6. #include <stdlib.h>
  7. #include <unistd.h>
  8. #include <net/if.h>
  9. #include <sys/utsname.h>
  10. #include <linux/btf.h>
  11. #include <linux/filter.h>
  12. #include <linux/kernel.h>
  13. #include <linux/version.h>
  14. #include "bpf.h"
  15. #include "libbpf.h"
  16. #include "libbpf_internal.h"
  17. /* On Ubuntu LINUX_VERSION_CODE doesn't correspond to info.release,
  18. * but Ubuntu provides /proc/version_signature file, as described at
  19. * https://ubuntu.com/kernel, with an example contents below, which we
  20. * can use to get a proper LINUX_VERSION_CODE.
  21. *
  22. * Ubuntu 5.4.0-12.15-generic 5.4.8
  23. *
  24. * In the above, 5.4.8 is what kernel is actually expecting, while
  25. * uname() call will return 5.4.0 in info.release.
  26. */
  27. static __u32 get_ubuntu_kernel_version(void)
  28. {
  29. const char *ubuntu_kver_file = "/proc/version_signature";
  30. __u32 major, minor, patch;
  31. int ret;
  32. FILE *f;
  33. if (faccessat(AT_FDCWD, ubuntu_kver_file, R_OK, AT_EACCESS) != 0)
  34. return 0;
  35. f = fopen(ubuntu_kver_file, "re");
  36. if (!f)
  37. return 0;
  38. ret = fscanf(f, "%*s %*s %u.%u.%u\n", &major, &minor, &patch);
  39. fclose(f);
  40. if (ret != 3)
  41. return 0;
  42. return KERNEL_VERSION(major, minor, patch);
  43. }
  44. /* On Debian LINUX_VERSION_CODE doesn't correspond to info.release.
  45. * Instead, it is provided in info.version. An example content of
  46. * Debian 10 looks like the below.
  47. *
  48. * utsname::release 4.19.0-22-amd64
  49. * utsname::version #1 SMP Debian 4.19.260-1 (2022-09-29)
  50. *
  51. * In the above, 4.19.260 is what kernel is actually expecting, while
  52. * uname() call will return 4.19.0 in info.release.
  53. */
  54. static __u32 get_debian_kernel_version(struct utsname *info)
  55. {
  56. __u32 major, minor, patch;
  57. char *p;
  58. p = strstr(info->version, "Debian ");
  59. if (!p) {
  60. /* This is not a Debian kernel. */
  61. return 0;
  62. }
  63. if (sscanf(p, "Debian %u.%u.%u", &major, &minor, &patch) != 3)
  64. return 0;
  65. return KERNEL_VERSION(major, minor, patch);
  66. }
  67. __u32 get_kernel_version(void)
  68. {
  69. __u32 major, minor, patch, version;
  70. struct utsname info;
  71. /* Check if this is an Ubuntu kernel. */
  72. version = get_ubuntu_kernel_version();
  73. if (version != 0)
  74. return version;
  75. uname(&info);
  76. /* Check if this is a Debian kernel. */
  77. version = get_debian_kernel_version(&info);
  78. if (version != 0)
  79. return version;
  80. if (sscanf(info.release, "%u.%u.%u", &major, &minor, &patch) != 3)
  81. return 0;
  82. return KERNEL_VERSION(major, minor, patch);
  83. }
  84. static int probe_prog_load(enum bpf_prog_type prog_type,
  85. const struct bpf_insn *insns, size_t insns_cnt,
  86. char *log_buf, size_t log_buf_sz)
  87. {
  88. LIBBPF_OPTS(bpf_prog_load_opts, opts,
  89. .log_buf = log_buf,
  90. .log_size = log_buf_sz,
  91. .log_level = log_buf ? 1 : 0,
  92. );
  93. int fd, err, exp_err = 0;
  94. const char *exp_msg = NULL;
  95. char buf[4096];
  96. switch (prog_type) {
  97. case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
  98. opts.expected_attach_type = BPF_CGROUP_INET4_CONNECT;
  99. break;
  100. case BPF_PROG_TYPE_CGROUP_SOCKOPT:
  101. opts.expected_attach_type = BPF_CGROUP_GETSOCKOPT;
  102. break;
  103. case BPF_PROG_TYPE_SK_LOOKUP:
  104. opts.expected_attach_type = BPF_SK_LOOKUP;
  105. break;
  106. case BPF_PROG_TYPE_KPROBE:
  107. opts.kern_version = get_kernel_version();
  108. break;
  109. case BPF_PROG_TYPE_LIRC_MODE2:
  110. opts.expected_attach_type = BPF_LIRC_MODE2;
  111. break;
  112. case BPF_PROG_TYPE_TRACING:
  113. case BPF_PROG_TYPE_LSM:
  114. opts.log_buf = buf;
  115. opts.log_size = sizeof(buf);
  116. opts.log_level = 1;
  117. if (prog_type == BPF_PROG_TYPE_TRACING)
  118. opts.expected_attach_type = BPF_TRACE_FENTRY;
  119. else
  120. opts.expected_attach_type = BPF_MODIFY_RETURN;
  121. opts.attach_btf_id = 1;
  122. exp_err = -EINVAL;
  123. exp_msg = "attach_btf_id 1 is not a function";
  124. break;
  125. case BPF_PROG_TYPE_EXT:
  126. opts.log_buf = buf;
  127. opts.log_size = sizeof(buf);
  128. opts.log_level = 1;
  129. opts.attach_btf_id = 1;
  130. exp_err = -EINVAL;
  131. exp_msg = "Cannot replace kernel functions";
  132. break;
  133. case BPF_PROG_TYPE_SYSCALL:
  134. opts.prog_flags = BPF_F_SLEEPABLE;
  135. break;
  136. case BPF_PROG_TYPE_STRUCT_OPS:
  137. exp_err = -524; /* -ENOTSUPP */
  138. break;
  139. case BPF_PROG_TYPE_UNSPEC:
  140. case BPF_PROG_TYPE_SOCKET_FILTER:
  141. case BPF_PROG_TYPE_SCHED_CLS:
  142. case BPF_PROG_TYPE_SCHED_ACT:
  143. case BPF_PROG_TYPE_TRACEPOINT:
  144. case BPF_PROG_TYPE_XDP:
  145. case BPF_PROG_TYPE_PERF_EVENT:
  146. case BPF_PROG_TYPE_CGROUP_SKB:
  147. case BPF_PROG_TYPE_CGROUP_SOCK:
  148. case BPF_PROG_TYPE_LWT_IN:
  149. case BPF_PROG_TYPE_LWT_OUT:
  150. case BPF_PROG_TYPE_LWT_XMIT:
  151. case BPF_PROG_TYPE_SOCK_OPS:
  152. case BPF_PROG_TYPE_SK_SKB:
  153. case BPF_PROG_TYPE_CGROUP_DEVICE:
  154. case BPF_PROG_TYPE_SK_MSG:
  155. case BPF_PROG_TYPE_RAW_TRACEPOINT:
  156. case BPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE:
  157. case BPF_PROG_TYPE_LWT_SEG6LOCAL:
  158. case BPF_PROG_TYPE_SK_REUSEPORT:
  159. case BPF_PROG_TYPE_FLOW_DISSECTOR:
  160. case BPF_PROG_TYPE_CGROUP_SYSCTL:
  161. break;
  162. case BPF_PROG_TYPE_NETFILTER:
  163. opts.expected_attach_type = BPF_NETFILTER;
  164. break;
  165. default:
  166. return -EOPNOTSUPP;
  167. }
  168. fd = bpf_prog_load(prog_type, NULL, "GPL", insns, insns_cnt, &opts);
  169. err = -errno;
  170. if (fd >= 0)
  171. close(fd);
  172. if (exp_err) {
  173. if (fd >= 0 || err != exp_err)
  174. return 0;
  175. if (exp_msg && !strstr(buf, exp_msg))
  176. return 0;
  177. return 1;
  178. }
  179. return fd >= 0 ? 1 : 0;
  180. }
  181. int libbpf_probe_bpf_prog_type(enum bpf_prog_type prog_type, const void *opts)
  182. {
  183. struct bpf_insn insns[] = {
  184. BPF_MOV64_IMM(BPF_REG_0, 0),
  185. BPF_EXIT_INSN()
  186. };
  187. const size_t insn_cnt = ARRAY_SIZE(insns);
  188. int ret;
  189. if (opts)
  190. return libbpf_err(-EINVAL);
  191. ret = probe_prog_load(prog_type, insns, insn_cnt, NULL, 0);
  192. return libbpf_err(ret);
  193. }
  194. int libbpf__load_raw_btf(const char *raw_types, size_t types_len,
  195. const char *str_sec, size_t str_len,
  196. int token_fd)
  197. {
  198. struct btf_header hdr = {
  199. .magic = BTF_MAGIC,
  200. .version = BTF_VERSION,
  201. .hdr_len = sizeof(struct btf_header),
  202. .type_len = types_len,
  203. .str_off = types_len,
  204. .str_len = str_len,
  205. };
  206. LIBBPF_OPTS(bpf_btf_load_opts, opts,
  207. .token_fd = token_fd,
  208. .btf_flags = token_fd ? BPF_F_TOKEN_FD : 0,
  209. );
  210. int btf_fd, btf_len;
  211. __u8 *raw_btf;
  212. btf_len = hdr.hdr_len + hdr.type_len + hdr.str_len;
  213. raw_btf = malloc(btf_len);
  214. if (!raw_btf)
  215. return -ENOMEM;
  216. memcpy(raw_btf, &hdr, sizeof(hdr));
  217. memcpy(raw_btf + hdr.hdr_len, raw_types, hdr.type_len);
  218. memcpy(raw_btf + hdr.hdr_len + hdr.type_len, str_sec, hdr.str_len);
  219. btf_fd = bpf_btf_load(raw_btf, btf_len, &opts);
  220. free(raw_btf);
  221. return btf_fd;
  222. }
  223. static int load_local_storage_btf(void)
  224. {
  225. const char strs[] = "\0bpf_spin_lock\0val\0cnt\0l";
  226. /* struct bpf_spin_lock {
  227. * int val;
  228. * };
  229. * struct val {
  230. * int cnt;
  231. * struct bpf_spin_lock l;
  232. * };
  233. */
  234. __u32 types[] = {
  235. /* int */
  236. BTF_TYPE_INT_ENC(0, BTF_INT_SIGNED, 0, 32, 4), /* [1] */
  237. /* struct bpf_spin_lock */ /* [2] */
  238. BTF_TYPE_ENC(1, BTF_INFO_ENC(BTF_KIND_STRUCT, 0, 1), 4),
  239. BTF_MEMBER_ENC(15, 1, 0), /* int val; */
  240. /* struct val */ /* [3] */
  241. BTF_TYPE_ENC(15, BTF_INFO_ENC(BTF_KIND_STRUCT, 0, 2), 8),
  242. BTF_MEMBER_ENC(19, 1, 0), /* int cnt; */
  243. BTF_MEMBER_ENC(23, 2, 32),/* struct bpf_spin_lock l; */
  244. };
  245. return libbpf__load_raw_btf((char *)types, sizeof(types),
  246. strs, sizeof(strs), 0);
  247. }
  248. static int probe_map_create(enum bpf_map_type map_type)
  249. {
  250. LIBBPF_OPTS(bpf_map_create_opts, opts);
  251. int key_size, value_size, max_entries;
  252. __u32 btf_key_type_id = 0, btf_value_type_id = 0;
  253. int fd = -1, btf_fd = -1, fd_inner = -1, exp_err = 0, err = 0;
  254. key_size = sizeof(__u32);
  255. value_size = sizeof(__u32);
  256. max_entries = 1;
  257. switch (map_type) {
  258. case BPF_MAP_TYPE_STACK_TRACE:
  259. value_size = sizeof(__u64);
  260. break;
  261. case BPF_MAP_TYPE_LPM_TRIE:
  262. key_size = sizeof(__u64);
  263. value_size = sizeof(__u64);
  264. opts.map_flags = BPF_F_NO_PREALLOC;
  265. break;
  266. case BPF_MAP_TYPE_CGROUP_STORAGE:
  267. case BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE:
  268. key_size = sizeof(struct bpf_cgroup_storage_key);
  269. value_size = sizeof(__u64);
  270. max_entries = 0;
  271. break;
  272. case BPF_MAP_TYPE_QUEUE:
  273. case BPF_MAP_TYPE_STACK:
  274. key_size = 0;
  275. break;
  276. case BPF_MAP_TYPE_SK_STORAGE:
  277. case BPF_MAP_TYPE_INODE_STORAGE:
  278. case BPF_MAP_TYPE_TASK_STORAGE:
  279. case BPF_MAP_TYPE_CGRP_STORAGE:
  280. btf_key_type_id = 1;
  281. btf_value_type_id = 3;
  282. value_size = 8;
  283. max_entries = 0;
  284. opts.map_flags = BPF_F_NO_PREALLOC;
  285. btf_fd = load_local_storage_btf();
  286. if (btf_fd < 0)
  287. return btf_fd;
  288. break;
  289. case BPF_MAP_TYPE_RINGBUF:
  290. case BPF_MAP_TYPE_USER_RINGBUF:
  291. key_size = 0;
  292. value_size = 0;
  293. max_entries = sysconf(_SC_PAGE_SIZE);
  294. break;
  295. case BPF_MAP_TYPE_STRUCT_OPS:
  296. /* we'll get -ENOTSUPP for invalid BTF type ID for struct_ops */
  297. opts.btf_vmlinux_value_type_id = 1;
  298. opts.value_type_btf_obj_fd = -1;
  299. exp_err = -524; /* -ENOTSUPP */
  300. break;
  301. case BPF_MAP_TYPE_BLOOM_FILTER:
  302. key_size = 0;
  303. max_entries = 1;
  304. break;
  305. case BPF_MAP_TYPE_ARENA:
  306. key_size = 0;
  307. value_size = 0;
  308. max_entries = 1; /* one page */
  309. opts.map_extra = 0; /* can mmap() at any address */
  310. opts.map_flags = BPF_F_MMAPABLE;
  311. break;
  312. case BPF_MAP_TYPE_HASH:
  313. case BPF_MAP_TYPE_ARRAY:
  314. case BPF_MAP_TYPE_PROG_ARRAY:
  315. case BPF_MAP_TYPE_PERF_EVENT_ARRAY:
  316. case BPF_MAP_TYPE_PERCPU_HASH:
  317. case BPF_MAP_TYPE_PERCPU_ARRAY:
  318. case BPF_MAP_TYPE_CGROUP_ARRAY:
  319. case BPF_MAP_TYPE_LRU_HASH:
  320. case BPF_MAP_TYPE_LRU_PERCPU_HASH:
  321. case BPF_MAP_TYPE_ARRAY_OF_MAPS:
  322. case BPF_MAP_TYPE_HASH_OF_MAPS:
  323. case BPF_MAP_TYPE_DEVMAP:
  324. case BPF_MAP_TYPE_DEVMAP_HASH:
  325. case BPF_MAP_TYPE_SOCKMAP:
  326. case BPF_MAP_TYPE_CPUMAP:
  327. case BPF_MAP_TYPE_XSKMAP:
  328. case BPF_MAP_TYPE_SOCKHASH:
  329. case BPF_MAP_TYPE_REUSEPORT_SOCKARRAY:
  330. break;
  331. case BPF_MAP_TYPE_INSN_ARRAY:
  332. key_size = sizeof(__u32);
  333. value_size = sizeof(struct bpf_insn_array_value);
  334. break;
  335. case BPF_MAP_TYPE_UNSPEC:
  336. default:
  337. return -EOPNOTSUPP;
  338. }
  339. if (map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS ||
  340. map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
  341. fd_inner = bpf_map_create(BPF_MAP_TYPE_HASH, NULL,
  342. sizeof(__u32), sizeof(__u32), 1, NULL);
  343. if (fd_inner < 0)
  344. goto cleanup;
  345. opts.inner_map_fd = fd_inner;
  346. }
  347. if (btf_fd >= 0) {
  348. opts.btf_fd = btf_fd;
  349. opts.btf_key_type_id = btf_key_type_id;
  350. opts.btf_value_type_id = btf_value_type_id;
  351. }
  352. fd = bpf_map_create(map_type, NULL, key_size, value_size, max_entries, &opts);
  353. err = -errno;
  354. cleanup:
  355. if (fd >= 0)
  356. close(fd);
  357. if (fd_inner >= 0)
  358. close(fd_inner);
  359. if (btf_fd >= 0)
  360. close(btf_fd);
  361. if (exp_err)
  362. return fd < 0 && err == exp_err ? 1 : 0;
  363. else
  364. return fd >= 0 ? 1 : 0;
  365. }
  366. int libbpf_probe_bpf_map_type(enum bpf_map_type map_type, const void *opts)
  367. {
  368. int ret;
  369. if (opts)
  370. return libbpf_err(-EINVAL);
  371. ret = probe_map_create(map_type);
  372. return libbpf_err(ret);
  373. }
  374. int libbpf_probe_bpf_helper(enum bpf_prog_type prog_type, enum bpf_func_id helper_id,
  375. const void *opts)
  376. {
  377. struct bpf_insn insns[] = {
  378. BPF_EMIT_CALL((__u32)helper_id),
  379. BPF_EXIT_INSN(),
  380. };
  381. const size_t insn_cnt = ARRAY_SIZE(insns);
  382. char buf[4096];
  383. int ret;
  384. if (opts)
  385. return libbpf_err(-EINVAL);
  386. /* we can't successfully load all prog types to check for BPF helper
  387. * support, so bail out with -EOPNOTSUPP error
  388. */
  389. switch (prog_type) {
  390. case BPF_PROG_TYPE_TRACING:
  391. case BPF_PROG_TYPE_EXT:
  392. case BPF_PROG_TYPE_LSM:
  393. case BPF_PROG_TYPE_STRUCT_OPS:
  394. return -EOPNOTSUPP;
  395. default:
  396. break;
  397. }
  398. buf[0] = '\0';
  399. ret = probe_prog_load(prog_type, insns, insn_cnt, buf, sizeof(buf));
  400. if (ret < 0)
  401. return libbpf_err(ret);
  402. /* If BPF verifier doesn't recognize BPF helper ID (enum bpf_func_id)
  403. * at all, it will emit something like "invalid func unknown#181".
  404. * If BPF verifier recognizes BPF helper but it's not supported for
  405. * given BPF program type, it will emit "unknown func bpf_sys_bpf#166"
  406. * or "program of this type cannot use helper bpf_sys_bpf#166".
  407. * In both cases, provided combination of BPF program type and BPF
  408. * helper is not supported by the kernel.
  409. * In all other cases, probe_prog_load() above will either succeed (e.g.,
  410. * because BPF helper happens to accept no input arguments or it
  411. * accepts one input argument and initial PTR_TO_CTX is fine for
  412. * that), or we'll get some more specific BPF verifier error about
  413. * some unsatisfied conditions.
  414. */
  415. if (ret == 0 && (strstr(buf, "invalid func ") || strstr(buf, "unknown func ") ||
  416. strstr(buf, "program of this type cannot use helper ")))
  417. return 0;
  418. return 1; /* assume supported */
  419. }