prog.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977
  1. /*
  2. * Copyright (C) 2017-2018 Netronome Systems, Inc.
  3. *
  4. * This software is dual licensed under the GNU General License Version 2,
  5. * June 1991 as shown in the file COPYING in the top-level directory of this
  6. * source tree or the BSD 2-Clause License provided below. You have the
  7. * option to license this software under the complete terms of either license.
  8. *
  9. * The BSD 2-Clause License:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * 1. Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * 2. Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #define _GNU_SOURCE
  34. #include <errno.h>
  35. #include <fcntl.h>
  36. #include <stdarg.h>
  37. #include <stdio.h>
  38. #include <stdlib.h>
  39. #include <string.h>
  40. #include <time.h>
  41. #include <unistd.h>
  42. #include <net/if.h>
  43. #include <sys/types.h>
  44. #include <sys/stat.h>
  45. #include <linux/err.h>
  46. #include <bpf.h>
  47. #include <libbpf.h>
  48. #include "cfg.h"
  49. #include "main.h"
  50. #include "xlated_dumper.h"
  51. static const char * const prog_type_name[] = {
  52. [BPF_PROG_TYPE_UNSPEC] = "unspec",
  53. [BPF_PROG_TYPE_SOCKET_FILTER] = "socket_filter",
  54. [BPF_PROG_TYPE_KPROBE] = "kprobe",
  55. [BPF_PROG_TYPE_SCHED_CLS] = "sched_cls",
  56. [BPF_PROG_TYPE_SCHED_ACT] = "sched_act",
  57. [BPF_PROG_TYPE_TRACEPOINT] = "tracepoint",
  58. [BPF_PROG_TYPE_XDP] = "xdp",
  59. [BPF_PROG_TYPE_PERF_EVENT] = "perf_event",
  60. [BPF_PROG_TYPE_CGROUP_SKB] = "cgroup_skb",
  61. [BPF_PROG_TYPE_CGROUP_SOCK] = "cgroup_sock",
  62. [BPF_PROG_TYPE_LWT_IN] = "lwt_in",
  63. [BPF_PROG_TYPE_LWT_OUT] = "lwt_out",
  64. [BPF_PROG_TYPE_LWT_XMIT] = "lwt_xmit",
  65. [BPF_PROG_TYPE_SOCK_OPS] = "sock_ops",
  66. [BPF_PROG_TYPE_SK_SKB] = "sk_skb",
  67. [BPF_PROG_TYPE_CGROUP_DEVICE] = "cgroup_device",
  68. [BPF_PROG_TYPE_SK_MSG] = "sk_msg",
  69. [BPF_PROG_TYPE_RAW_TRACEPOINT] = "raw_tracepoint",
  70. [BPF_PROG_TYPE_CGROUP_SOCK_ADDR] = "cgroup_sock_addr",
  71. [BPF_PROG_TYPE_LIRC_MODE2] = "lirc_mode2",
  72. [BPF_PROG_TYPE_FLOW_DISSECTOR] = "flow_dissector",
  73. };
  74. static void print_boot_time(__u64 nsecs, char *buf, unsigned int size)
  75. {
  76. struct timespec real_time_ts, boot_time_ts;
  77. time_t wallclock_secs;
  78. struct tm load_tm;
  79. buf[--size] = '\0';
  80. if (clock_gettime(CLOCK_REALTIME, &real_time_ts) ||
  81. clock_gettime(CLOCK_BOOTTIME, &boot_time_ts)) {
  82. perror("Can't read clocks");
  83. snprintf(buf, size, "%llu", nsecs / 1000000000);
  84. return;
  85. }
  86. wallclock_secs = (real_time_ts.tv_sec - boot_time_ts.tv_sec) +
  87. (real_time_ts.tv_nsec - boot_time_ts.tv_nsec + nsecs) /
  88. 1000000000;
  89. if (!localtime_r(&wallclock_secs, &load_tm)) {
  90. snprintf(buf, size, "%llu", nsecs / 1000000000);
  91. return;
  92. }
  93. if (json_output)
  94. strftime(buf, size, "%s", &load_tm);
  95. else
  96. strftime(buf, size, "%FT%T%z", &load_tm);
  97. }
  98. static int prog_fd_by_tag(unsigned char *tag)
  99. {
  100. struct bpf_prog_info info = {};
  101. __u32 len = sizeof(info);
  102. unsigned int id = 0;
  103. int err;
  104. int fd;
  105. while (true) {
  106. err = bpf_prog_get_next_id(id, &id);
  107. if (err) {
  108. p_err("%s", strerror(errno));
  109. return -1;
  110. }
  111. fd = bpf_prog_get_fd_by_id(id);
  112. if (fd < 0) {
  113. p_err("can't get prog by id (%u): %s",
  114. id, strerror(errno));
  115. return -1;
  116. }
  117. err = bpf_obj_get_info_by_fd(fd, &info, &len);
  118. if (err) {
  119. p_err("can't get prog info (%u): %s",
  120. id, strerror(errno));
  121. close(fd);
  122. return -1;
  123. }
  124. if (!memcmp(tag, info.tag, BPF_TAG_SIZE))
  125. return fd;
  126. close(fd);
  127. }
  128. }
  129. int prog_parse_fd(int *argc, char ***argv)
  130. {
  131. int fd;
  132. if (is_prefix(**argv, "id")) {
  133. unsigned int id;
  134. char *endptr;
  135. NEXT_ARGP();
  136. id = strtoul(**argv, &endptr, 0);
  137. if (*endptr) {
  138. p_err("can't parse %s as ID", **argv);
  139. return -1;
  140. }
  141. NEXT_ARGP();
  142. fd = bpf_prog_get_fd_by_id(id);
  143. if (fd < 0)
  144. p_err("get by id (%u): %s", id, strerror(errno));
  145. return fd;
  146. } else if (is_prefix(**argv, "tag")) {
  147. unsigned char tag[BPF_TAG_SIZE];
  148. NEXT_ARGP();
  149. if (sscanf(**argv, BPF_TAG_FMT, tag, tag + 1, tag + 2,
  150. tag + 3, tag + 4, tag + 5, tag + 6, tag + 7)
  151. != BPF_TAG_SIZE) {
  152. p_err("can't parse tag");
  153. return -1;
  154. }
  155. NEXT_ARGP();
  156. return prog_fd_by_tag(tag);
  157. } else if (is_prefix(**argv, "pinned")) {
  158. char *path;
  159. NEXT_ARGP();
  160. path = **argv;
  161. NEXT_ARGP();
  162. return open_obj_pinned_any(path, BPF_OBJ_PROG);
  163. }
  164. p_err("expected 'id', 'tag' or 'pinned', got: '%s'?", **argv);
  165. return -1;
  166. }
  167. static void show_prog_maps(int fd, u32 num_maps)
  168. {
  169. struct bpf_prog_info info = {};
  170. __u32 len = sizeof(info);
  171. __u32 map_ids[num_maps];
  172. unsigned int i;
  173. int err;
  174. info.nr_map_ids = num_maps;
  175. info.map_ids = ptr_to_u64(map_ids);
  176. err = bpf_obj_get_info_by_fd(fd, &info, &len);
  177. if (err || !info.nr_map_ids)
  178. return;
  179. if (json_output) {
  180. jsonw_name(json_wtr, "map_ids");
  181. jsonw_start_array(json_wtr);
  182. for (i = 0; i < info.nr_map_ids; i++)
  183. jsonw_uint(json_wtr, map_ids[i]);
  184. jsonw_end_array(json_wtr);
  185. } else {
  186. printf(" map_ids ");
  187. for (i = 0; i < info.nr_map_ids; i++)
  188. printf("%u%s", map_ids[i],
  189. i == info.nr_map_ids - 1 ? "" : ",");
  190. }
  191. }
  192. static void print_prog_json(struct bpf_prog_info *info, int fd)
  193. {
  194. char *memlock;
  195. jsonw_start_object(json_wtr);
  196. jsonw_uint_field(json_wtr, "id", info->id);
  197. if (info->type < ARRAY_SIZE(prog_type_name))
  198. jsonw_string_field(json_wtr, "type",
  199. prog_type_name[info->type]);
  200. else
  201. jsonw_uint_field(json_wtr, "type", info->type);
  202. if (*info->name)
  203. jsonw_string_field(json_wtr, "name", info->name);
  204. jsonw_name(json_wtr, "tag");
  205. jsonw_printf(json_wtr, "\"" BPF_TAG_FMT "\"",
  206. info->tag[0], info->tag[1], info->tag[2], info->tag[3],
  207. info->tag[4], info->tag[5], info->tag[6], info->tag[7]);
  208. jsonw_bool_field(json_wtr, "gpl_compatible", info->gpl_compatible);
  209. print_dev_json(info->ifindex, info->netns_dev, info->netns_ino);
  210. if (info->load_time) {
  211. char buf[32];
  212. print_boot_time(info->load_time, buf, sizeof(buf));
  213. /* Piggy back on load_time, since 0 uid is a valid one */
  214. jsonw_name(json_wtr, "loaded_at");
  215. jsonw_printf(json_wtr, "%s", buf);
  216. jsonw_uint_field(json_wtr, "uid", info->created_by_uid);
  217. }
  218. jsonw_uint_field(json_wtr, "bytes_xlated", info->xlated_prog_len);
  219. if (info->jited_prog_len) {
  220. jsonw_bool_field(json_wtr, "jited", true);
  221. jsonw_uint_field(json_wtr, "bytes_jited", info->jited_prog_len);
  222. } else {
  223. jsonw_bool_field(json_wtr, "jited", false);
  224. }
  225. memlock = get_fdinfo(fd, "memlock");
  226. if (memlock)
  227. jsonw_int_field(json_wtr, "bytes_memlock", atoi(memlock));
  228. free(memlock);
  229. if (info->nr_map_ids)
  230. show_prog_maps(fd, info->nr_map_ids);
  231. if (!hash_empty(prog_table.table)) {
  232. struct pinned_obj *obj;
  233. jsonw_name(json_wtr, "pinned");
  234. jsonw_start_array(json_wtr);
  235. hash_for_each_possible(prog_table.table, obj, hash, info->id) {
  236. if (obj->id == info->id)
  237. jsonw_string(json_wtr, obj->path);
  238. }
  239. jsonw_end_array(json_wtr);
  240. }
  241. jsonw_end_object(json_wtr);
  242. }
  243. static void print_prog_plain(struct bpf_prog_info *info, int fd)
  244. {
  245. char *memlock;
  246. printf("%u: ", info->id);
  247. if (info->type < ARRAY_SIZE(prog_type_name))
  248. printf("%s ", prog_type_name[info->type]);
  249. else
  250. printf("type %u ", info->type);
  251. if (*info->name)
  252. printf("name %s ", info->name);
  253. printf("tag ");
  254. fprint_hex(stdout, info->tag, BPF_TAG_SIZE, "");
  255. print_dev_plain(info->ifindex, info->netns_dev, info->netns_ino);
  256. printf("%s", info->gpl_compatible ? " gpl" : "");
  257. printf("\n");
  258. if (info->load_time) {
  259. char buf[32];
  260. print_boot_time(info->load_time, buf, sizeof(buf));
  261. /* Piggy back on load_time, since 0 uid is a valid one */
  262. printf("\tloaded_at %s uid %u\n", buf, info->created_by_uid);
  263. }
  264. printf("\txlated %uB", info->xlated_prog_len);
  265. if (info->jited_prog_len)
  266. printf(" jited %uB", info->jited_prog_len);
  267. else
  268. printf(" not jited");
  269. memlock = get_fdinfo(fd, "memlock");
  270. if (memlock)
  271. printf(" memlock %sB", memlock);
  272. free(memlock);
  273. if (info->nr_map_ids)
  274. show_prog_maps(fd, info->nr_map_ids);
  275. if (!hash_empty(prog_table.table)) {
  276. struct pinned_obj *obj;
  277. printf("\n");
  278. hash_for_each_possible(prog_table.table, obj, hash, info->id) {
  279. if (obj->id == info->id)
  280. printf("\tpinned %s\n", obj->path);
  281. }
  282. }
  283. printf("\n");
  284. }
  285. static int show_prog(int fd)
  286. {
  287. struct bpf_prog_info info = {};
  288. __u32 len = sizeof(info);
  289. int err;
  290. err = bpf_obj_get_info_by_fd(fd, &info, &len);
  291. if (err) {
  292. p_err("can't get prog info: %s", strerror(errno));
  293. return -1;
  294. }
  295. if (json_output)
  296. print_prog_json(&info, fd);
  297. else
  298. print_prog_plain(&info, fd);
  299. return 0;
  300. }
  301. static int do_show(int argc, char **argv)
  302. {
  303. __u32 id = 0;
  304. int err;
  305. int fd;
  306. if (show_pinned)
  307. build_pinned_obj_table(&prog_table, BPF_OBJ_PROG);
  308. if (argc == 2) {
  309. fd = prog_parse_fd(&argc, &argv);
  310. if (fd < 0)
  311. return -1;
  312. return show_prog(fd);
  313. }
  314. if (argc)
  315. return BAD_ARG();
  316. if (json_output)
  317. jsonw_start_array(json_wtr);
  318. while (true) {
  319. err = bpf_prog_get_next_id(id, &id);
  320. if (err) {
  321. if (errno == ENOENT) {
  322. err = 0;
  323. break;
  324. }
  325. p_err("can't get next program: %s%s", strerror(errno),
  326. errno == EINVAL ? " -- kernel too old?" : "");
  327. err = -1;
  328. break;
  329. }
  330. fd = bpf_prog_get_fd_by_id(id);
  331. if (fd < 0) {
  332. if (errno == ENOENT)
  333. continue;
  334. p_err("can't get prog by id (%u): %s",
  335. id, strerror(errno));
  336. err = -1;
  337. break;
  338. }
  339. err = show_prog(fd);
  340. close(fd);
  341. if (err)
  342. break;
  343. }
  344. if (json_output)
  345. jsonw_end_array(json_wtr);
  346. return err;
  347. }
  348. static int do_dump(int argc, char **argv)
  349. {
  350. unsigned long *func_ksyms = NULL;
  351. struct bpf_prog_info info = {};
  352. unsigned int *func_lens = NULL;
  353. unsigned int nr_func_ksyms;
  354. unsigned int nr_func_lens;
  355. struct dump_data dd = {};
  356. __u32 len = sizeof(info);
  357. unsigned int buf_size;
  358. char *filepath = NULL;
  359. bool opcodes = false;
  360. bool visual = false;
  361. unsigned char *buf;
  362. __u32 *member_len;
  363. __u64 *member_ptr;
  364. ssize_t n;
  365. int err;
  366. int fd;
  367. if (is_prefix(*argv, "jited")) {
  368. member_len = &info.jited_prog_len;
  369. member_ptr = &info.jited_prog_insns;
  370. } else if (is_prefix(*argv, "xlated")) {
  371. member_len = &info.xlated_prog_len;
  372. member_ptr = &info.xlated_prog_insns;
  373. } else {
  374. p_err("expected 'xlated' or 'jited', got: %s", *argv);
  375. return -1;
  376. }
  377. NEXT_ARG();
  378. if (argc < 2)
  379. usage();
  380. fd = prog_parse_fd(&argc, &argv);
  381. if (fd < 0)
  382. return -1;
  383. if (is_prefix(*argv, "file")) {
  384. NEXT_ARG();
  385. if (!argc) {
  386. p_err("expected file path");
  387. return -1;
  388. }
  389. filepath = *argv;
  390. NEXT_ARG();
  391. } else if (is_prefix(*argv, "opcodes")) {
  392. opcodes = true;
  393. NEXT_ARG();
  394. } else if (is_prefix(*argv, "visual")) {
  395. visual = true;
  396. NEXT_ARG();
  397. }
  398. if (argc) {
  399. usage();
  400. return -1;
  401. }
  402. err = bpf_obj_get_info_by_fd(fd, &info, &len);
  403. if (err) {
  404. p_err("can't get prog info: %s", strerror(errno));
  405. return -1;
  406. }
  407. if (!*member_len) {
  408. p_info("no instructions returned");
  409. close(fd);
  410. return 0;
  411. }
  412. buf_size = *member_len;
  413. buf = malloc(buf_size);
  414. if (!buf) {
  415. p_err("mem alloc failed");
  416. close(fd);
  417. return -1;
  418. }
  419. nr_func_ksyms = info.nr_jited_ksyms;
  420. if (nr_func_ksyms) {
  421. func_ksyms = malloc(nr_func_ksyms * sizeof(__u64));
  422. if (!func_ksyms) {
  423. p_err("mem alloc failed");
  424. close(fd);
  425. goto err_free;
  426. }
  427. }
  428. nr_func_lens = info.nr_jited_func_lens;
  429. if (nr_func_lens) {
  430. func_lens = malloc(nr_func_lens * sizeof(__u32));
  431. if (!func_lens) {
  432. p_err("mem alloc failed");
  433. close(fd);
  434. goto err_free;
  435. }
  436. }
  437. memset(&info, 0, sizeof(info));
  438. *member_ptr = ptr_to_u64(buf);
  439. *member_len = buf_size;
  440. info.jited_ksyms = ptr_to_u64(func_ksyms);
  441. info.nr_jited_ksyms = nr_func_ksyms;
  442. info.jited_func_lens = ptr_to_u64(func_lens);
  443. info.nr_jited_func_lens = nr_func_lens;
  444. err = bpf_obj_get_info_by_fd(fd, &info, &len);
  445. close(fd);
  446. if (err) {
  447. p_err("can't get prog info: %s", strerror(errno));
  448. goto err_free;
  449. }
  450. if (*member_len > buf_size) {
  451. p_err("too many instructions returned");
  452. goto err_free;
  453. }
  454. if (info.nr_jited_ksyms > nr_func_ksyms) {
  455. p_err("too many addresses returned");
  456. goto err_free;
  457. }
  458. if (info.nr_jited_func_lens > nr_func_lens) {
  459. p_err("too many values returned");
  460. goto err_free;
  461. }
  462. if ((member_len == &info.jited_prog_len &&
  463. info.jited_prog_insns == 0) ||
  464. (member_len == &info.xlated_prog_len &&
  465. info.xlated_prog_insns == 0)) {
  466. p_err("error retrieving insn dump: kernel.kptr_restrict set?");
  467. goto err_free;
  468. }
  469. if (filepath) {
  470. fd = open(filepath, O_WRONLY | O_CREAT | O_TRUNC, 0600);
  471. if (fd < 0) {
  472. p_err("can't open file %s: %s", filepath,
  473. strerror(errno));
  474. goto err_free;
  475. }
  476. n = write(fd, buf, *member_len);
  477. close(fd);
  478. if (n != *member_len) {
  479. p_err("error writing output file: %s",
  480. n < 0 ? strerror(errno) : "short write");
  481. goto err_free;
  482. }
  483. if (json_output)
  484. jsonw_null(json_wtr);
  485. } else if (member_len == &info.jited_prog_len) {
  486. const char *name = NULL;
  487. if (info.ifindex) {
  488. name = ifindex_to_bfd_name_ns(info.ifindex,
  489. info.netns_dev,
  490. info.netns_ino);
  491. if (!name)
  492. goto err_free;
  493. }
  494. if (info.nr_jited_func_lens && info.jited_func_lens) {
  495. struct kernel_sym *sym = NULL;
  496. char sym_name[SYM_MAX_NAME];
  497. unsigned char *img = buf;
  498. __u64 *ksyms = NULL;
  499. __u32 *lens;
  500. __u32 i;
  501. if (info.nr_jited_ksyms) {
  502. kernel_syms_load(&dd);
  503. ksyms = (__u64 *) info.jited_ksyms;
  504. }
  505. if (json_output)
  506. jsonw_start_array(json_wtr);
  507. lens = (__u32 *) info.jited_func_lens;
  508. for (i = 0; i < info.nr_jited_func_lens; i++) {
  509. if (ksyms) {
  510. sym = kernel_syms_search(&dd, ksyms[i]);
  511. if (sym)
  512. sprintf(sym_name, "%s", sym->name);
  513. else
  514. sprintf(sym_name, "0x%016llx", ksyms[i]);
  515. } else {
  516. strcpy(sym_name, "unknown");
  517. }
  518. if (json_output) {
  519. jsonw_start_object(json_wtr);
  520. jsonw_name(json_wtr, "name");
  521. jsonw_string(json_wtr, sym_name);
  522. jsonw_name(json_wtr, "insns");
  523. } else {
  524. printf("%s:\n", sym_name);
  525. }
  526. disasm_print_insn(img, lens[i], opcodes, name);
  527. img += lens[i];
  528. if (json_output)
  529. jsonw_end_object(json_wtr);
  530. else
  531. printf("\n");
  532. }
  533. if (json_output)
  534. jsonw_end_array(json_wtr);
  535. } else {
  536. disasm_print_insn(buf, *member_len, opcodes, name);
  537. }
  538. } else if (visual) {
  539. if (json_output)
  540. jsonw_null(json_wtr);
  541. else
  542. dump_xlated_cfg(buf, *member_len);
  543. } else {
  544. kernel_syms_load(&dd);
  545. dd.nr_jited_ksyms = info.nr_jited_ksyms;
  546. dd.jited_ksyms = (__u64 *) info.jited_ksyms;
  547. if (json_output)
  548. dump_xlated_json(&dd, buf, *member_len, opcodes);
  549. else
  550. dump_xlated_plain(&dd, buf, *member_len, opcodes);
  551. kernel_syms_destroy(&dd);
  552. }
  553. free(buf);
  554. free(func_ksyms);
  555. free(func_lens);
  556. return 0;
  557. err_free:
  558. free(buf);
  559. free(func_ksyms);
  560. free(func_lens);
  561. return -1;
  562. }
  563. static int do_pin(int argc, char **argv)
  564. {
  565. int err;
  566. err = do_pin_any(argc, argv, bpf_prog_get_fd_by_id);
  567. if (!err && json_output)
  568. jsonw_null(json_wtr);
  569. return err;
  570. }
  571. struct map_replace {
  572. int idx;
  573. int fd;
  574. char *name;
  575. };
  576. int map_replace_compar(const void *p1, const void *p2)
  577. {
  578. const struct map_replace *a = p1, *b = p2;
  579. return a->idx - b->idx;
  580. }
  581. static int do_load(int argc, char **argv)
  582. {
  583. enum bpf_attach_type expected_attach_type;
  584. struct bpf_object_open_attr attr = {
  585. .prog_type = BPF_PROG_TYPE_UNSPEC,
  586. };
  587. struct map_replace *map_replace = NULL;
  588. unsigned int old_map_fds = 0;
  589. struct bpf_program *prog;
  590. struct bpf_object *obj;
  591. struct bpf_map *map;
  592. const char *pinfile;
  593. unsigned int i, j;
  594. __u32 ifindex = 0;
  595. int idx, err;
  596. if (!REQ_ARGS(2))
  597. return -1;
  598. attr.file = GET_ARG();
  599. pinfile = GET_ARG();
  600. while (argc) {
  601. if (is_prefix(*argv, "type")) {
  602. char *type;
  603. NEXT_ARG();
  604. if (attr.prog_type != BPF_PROG_TYPE_UNSPEC) {
  605. p_err("program type already specified");
  606. goto err_free_reuse_maps;
  607. }
  608. if (!REQ_ARGS(1))
  609. goto err_free_reuse_maps;
  610. /* Put a '/' at the end of type to appease libbpf */
  611. type = malloc(strlen(*argv) + 2);
  612. if (!type) {
  613. p_err("mem alloc failed");
  614. goto err_free_reuse_maps;
  615. }
  616. *type = 0;
  617. strcat(type, *argv);
  618. strcat(type, "/");
  619. err = libbpf_prog_type_by_name(type, &attr.prog_type,
  620. &expected_attach_type);
  621. free(type);
  622. if (err < 0) {
  623. p_err("unknown program type '%s'", *argv);
  624. goto err_free_reuse_maps;
  625. }
  626. NEXT_ARG();
  627. } else if (is_prefix(*argv, "map")) {
  628. char *endptr, *name;
  629. int fd;
  630. NEXT_ARG();
  631. if (!REQ_ARGS(4))
  632. goto err_free_reuse_maps;
  633. if (is_prefix(*argv, "idx")) {
  634. NEXT_ARG();
  635. idx = strtoul(*argv, &endptr, 0);
  636. if (*endptr) {
  637. p_err("can't parse %s as IDX", *argv);
  638. goto err_free_reuse_maps;
  639. }
  640. name = NULL;
  641. } else if (is_prefix(*argv, "name")) {
  642. NEXT_ARG();
  643. name = *argv;
  644. idx = -1;
  645. } else {
  646. p_err("expected 'idx' or 'name', got: '%s'?",
  647. *argv);
  648. goto err_free_reuse_maps;
  649. }
  650. NEXT_ARG();
  651. fd = map_parse_fd(&argc, &argv);
  652. if (fd < 0)
  653. goto err_free_reuse_maps;
  654. map_replace = reallocarray(map_replace, old_map_fds + 1,
  655. sizeof(*map_replace));
  656. if (!map_replace) {
  657. p_err("mem alloc failed");
  658. goto err_free_reuse_maps;
  659. }
  660. map_replace[old_map_fds].idx = idx;
  661. map_replace[old_map_fds].name = name;
  662. map_replace[old_map_fds].fd = fd;
  663. old_map_fds++;
  664. } else if (is_prefix(*argv, "dev")) {
  665. NEXT_ARG();
  666. if (ifindex) {
  667. p_err("offload device already specified");
  668. goto err_free_reuse_maps;
  669. }
  670. if (!REQ_ARGS(1))
  671. goto err_free_reuse_maps;
  672. ifindex = if_nametoindex(*argv);
  673. if (!ifindex) {
  674. p_err("unrecognized netdevice '%s': %s",
  675. *argv, strerror(errno));
  676. goto err_free_reuse_maps;
  677. }
  678. NEXT_ARG();
  679. } else {
  680. p_err("expected no more arguments, 'type', 'map' or 'dev', got: '%s'?",
  681. *argv);
  682. goto err_free_reuse_maps;
  683. }
  684. }
  685. obj = bpf_object__open_xattr(&attr);
  686. if (IS_ERR_OR_NULL(obj)) {
  687. p_err("failed to open object file");
  688. goto err_free_reuse_maps;
  689. }
  690. prog = bpf_program__next(NULL, obj);
  691. if (!prog) {
  692. p_err("object file doesn't contain any bpf program");
  693. goto err_close_obj;
  694. }
  695. bpf_program__set_ifindex(prog, ifindex);
  696. if (attr.prog_type == BPF_PROG_TYPE_UNSPEC) {
  697. const char *sec_name = bpf_program__title(prog, false);
  698. err = libbpf_prog_type_by_name(sec_name, &attr.prog_type,
  699. &expected_attach_type);
  700. if (err < 0) {
  701. p_err("failed to guess program type based on section name %s\n",
  702. sec_name);
  703. goto err_close_obj;
  704. }
  705. }
  706. bpf_program__set_type(prog, attr.prog_type);
  707. bpf_program__set_expected_attach_type(prog, expected_attach_type);
  708. qsort(map_replace, old_map_fds, sizeof(*map_replace),
  709. map_replace_compar);
  710. /* After the sort maps by name will be first on the list, because they
  711. * have idx == -1. Resolve them.
  712. */
  713. j = 0;
  714. while (j < old_map_fds && map_replace[j].name) {
  715. i = 0;
  716. bpf_map__for_each(map, obj) {
  717. if (!strcmp(bpf_map__name(map), map_replace[j].name)) {
  718. map_replace[j].idx = i;
  719. break;
  720. }
  721. i++;
  722. }
  723. if (map_replace[j].idx == -1) {
  724. p_err("unable to find map '%s'", map_replace[j].name);
  725. goto err_close_obj;
  726. }
  727. j++;
  728. }
  729. /* Resort if any names were resolved */
  730. if (j)
  731. qsort(map_replace, old_map_fds, sizeof(*map_replace),
  732. map_replace_compar);
  733. /* Set ifindex and name reuse */
  734. j = 0;
  735. idx = 0;
  736. bpf_map__for_each(map, obj) {
  737. if (!bpf_map__is_offload_neutral(map))
  738. bpf_map__set_ifindex(map, ifindex);
  739. if (j < old_map_fds && idx == map_replace[j].idx) {
  740. err = bpf_map__reuse_fd(map, map_replace[j++].fd);
  741. if (err) {
  742. p_err("unable to set up map reuse: %d", err);
  743. goto err_close_obj;
  744. }
  745. /* Next reuse wants to apply to the same map */
  746. if (j < old_map_fds && map_replace[j].idx == idx) {
  747. p_err("replacement for map idx %d specified more than once",
  748. idx);
  749. goto err_close_obj;
  750. }
  751. }
  752. idx++;
  753. }
  754. if (j < old_map_fds) {
  755. p_err("map idx '%d' not used", map_replace[j].idx);
  756. goto err_close_obj;
  757. }
  758. err = bpf_object__load(obj);
  759. if (err) {
  760. p_err("failed to load object file");
  761. goto err_close_obj;
  762. }
  763. if (do_pin_fd(bpf_program__fd(prog), pinfile))
  764. goto err_close_obj;
  765. if (json_output)
  766. jsonw_null(json_wtr);
  767. bpf_object__close(obj);
  768. for (i = 0; i < old_map_fds; i++)
  769. close(map_replace[i].fd);
  770. free(map_replace);
  771. return 0;
  772. err_close_obj:
  773. bpf_object__close(obj);
  774. err_free_reuse_maps:
  775. for (i = 0; i < old_map_fds; i++)
  776. close(map_replace[i].fd);
  777. free(map_replace);
  778. return -1;
  779. }
  780. static int do_help(int argc, char **argv)
  781. {
  782. if (json_output) {
  783. jsonw_null(json_wtr);
  784. return 0;
  785. }
  786. fprintf(stderr,
  787. "Usage: %s %s { show | list } [PROG]\n"
  788. " %s %s dump xlated PROG [{ file FILE | opcodes | visual }]\n"
  789. " %s %s dump jited PROG [{ file FILE | opcodes }]\n"
  790. " %s %s pin PROG FILE\n"
  791. " %s %s load OBJ FILE [type TYPE] [dev NAME] \\\n"
  792. " [map { idx IDX | name NAME } MAP]\n"
  793. " %s %s help\n"
  794. "\n"
  795. " " HELP_SPEC_MAP "\n"
  796. " " HELP_SPEC_PROGRAM "\n"
  797. " TYPE := { socket | kprobe | kretprobe | classifier | action |\n"
  798. " tracepoint | raw_tracepoint | xdp | perf_event | cgroup/skb |\n"
  799. " cgroup/sock | cgroup/dev | lwt_in | lwt_out | lwt_xmit |\n"
  800. " lwt_seg6local | sockops | sk_skb | sk_msg | lirc_mode2 |\n"
  801. " cgroup/bind4 | cgroup/bind6 | cgroup/post_bind4 |\n"
  802. " cgroup/post_bind6 | cgroup/connect4 | cgroup/connect6 |\n"
  803. " cgroup/sendmsg4 | cgroup/sendmsg6 }\n"
  804. " " HELP_SPEC_OPTIONS "\n"
  805. "",
  806. bin_name, argv[-2], bin_name, argv[-2], bin_name, argv[-2],
  807. bin_name, argv[-2], bin_name, argv[-2], bin_name, argv[-2]);
  808. return 0;
  809. }
  810. static const struct cmd cmds[] = {
  811. { "show", do_show },
  812. { "list", do_show },
  813. { "help", do_help },
  814. { "dump", do_dump },
  815. { "pin", do_pin },
  816. { "load", do_load },
  817. { 0 }
  818. };
  819. int do_prog(int argc, char **argv)
  820. {
  821. return cmd_select(cmds, argc, argv, do_help);
  822. }