libbpf.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125
  1. /*
  2. * Common eBPF ELF object loading operations.
  3. *
  4. * Copyright (C) 2013-2015 Alexei Starovoitov <ast@kernel.org>
  5. * Copyright (C) 2015 Wang Nan <wangnan0@huawei.com>
  6. * Copyright (C) 2015 Huawei Inc.
  7. */
  8. #include <stdlib.h>
  9. #include <stdio.h>
  10. #include <stdarg.h>
  11. #include <inttypes.h>
  12. #include <string.h>
  13. #include <unistd.h>
  14. #include <fcntl.h>
  15. #include <errno.h>
  16. #include <asm/unistd.h>
  17. #include <linux/kernel.h>
  18. #include <linux/bpf.h>
  19. #include <linux/list.h>
  20. #include <libelf.h>
  21. #include <gelf.h>
  22. #include "libbpf.h"
  23. #include "bpf.h"
  24. #define __printf(a, b) __attribute__((format(printf, a, b)))
  25. __printf(1, 2)
  26. static int __base_pr(const char *format, ...)
  27. {
  28. va_list args;
  29. int err;
  30. va_start(args, format);
  31. err = vfprintf(stderr, format, args);
  32. va_end(args);
  33. return err;
  34. }
  35. static __printf(1, 2) libbpf_print_fn_t __pr_warning = __base_pr;
  36. static __printf(1, 2) libbpf_print_fn_t __pr_info = __base_pr;
  37. static __printf(1, 2) libbpf_print_fn_t __pr_debug;
  38. #define __pr(func, fmt, ...) \
  39. do { \
  40. if ((func)) \
  41. (func)("libbpf: " fmt, ##__VA_ARGS__); \
  42. } while (0)
  43. #define pr_warning(fmt, ...) __pr(__pr_warning, fmt, ##__VA_ARGS__)
  44. #define pr_info(fmt, ...) __pr(__pr_info, fmt, ##__VA_ARGS__)
  45. #define pr_debug(fmt, ...) __pr(__pr_debug, fmt, ##__VA_ARGS__)
  46. void libbpf_set_print(libbpf_print_fn_t warn,
  47. libbpf_print_fn_t info,
  48. libbpf_print_fn_t debug)
  49. {
  50. __pr_warning = warn;
  51. __pr_info = info;
  52. __pr_debug = debug;
  53. }
  54. #define STRERR_BUFSIZE 128
  55. #define ERRNO_OFFSET(e) ((e) - __LIBBPF_ERRNO__START)
  56. #define ERRCODE_OFFSET(c) ERRNO_OFFSET(LIBBPF_ERRNO__##c)
  57. #define NR_ERRNO (__LIBBPF_ERRNO__END - __LIBBPF_ERRNO__START)
  58. static const char *libbpf_strerror_table[NR_ERRNO] = {
  59. [ERRCODE_OFFSET(LIBELF)] = "Something wrong in libelf",
  60. [ERRCODE_OFFSET(FORMAT)] = "BPF object format invalid",
  61. [ERRCODE_OFFSET(KVERSION)] = "'version' section incorrect or lost",
  62. [ERRCODE_OFFSET(ENDIAN)] = "Endian missmatch",
  63. [ERRCODE_OFFSET(INTERNAL)] = "Internal error in libbpf",
  64. [ERRCODE_OFFSET(RELOC)] = "Relocation failed",
  65. [ERRCODE_OFFSET(VERIFY)] = "Kernel verifier blocks program loading",
  66. [ERRCODE_OFFSET(PROG2BIG)] = "Program too big",
  67. [ERRCODE_OFFSET(KVER)] = "Incorrect kernel version",
  68. };
  69. int libbpf_strerror(int err, char *buf, size_t size)
  70. {
  71. if (!buf || !size)
  72. return -1;
  73. err = err > 0 ? err : -err;
  74. if (err < __LIBBPF_ERRNO__START) {
  75. int ret;
  76. ret = strerror_r(err, buf, size);
  77. buf[size - 1] = '\0';
  78. return ret;
  79. }
  80. if (err < __LIBBPF_ERRNO__END) {
  81. const char *msg;
  82. msg = libbpf_strerror_table[ERRNO_OFFSET(err)];
  83. snprintf(buf, size, "%s", msg);
  84. buf[size - 1] = '\0';
  85. return 0;
  86. }
  87. snprintf(buf, size, "Unknown libbpf error %d", err);
  88. buf[size - 1] = '\0';
  89. return -1;
  90. }
  91. #define CHECK_ERR(action, err, out) do { \
  92. err = action; \
  93. if (err) \
  94. goto out; \
  95. } while(0)
  96. /* Copied from tools/perf/util/util.h */
  97. #ifndef zfree
  98. # define zfree(ptr) ({ free(*ptr); *ptr = NULL; })
  99. #endif
  100. #ifndef zclose
  101. # define zclose(fd) ({ \
  102. int ___err = 0; \
  103. if ((fd) >= 0) \
  104. ___err = close((fd)); \
  105. fd = -1; \
  106. ___err; })
  107. #endif
  108. #ifdef HAVE_LIBELF_MMAP_SUPPORT
  109. # define LIBBPF_ELF_C_READ_MMAP ELF_C_READ_MMAP
  110. #else
  111. # define LIBBPF_ELF_C_READ_MMAP ELF_C_READ
  112. #endif
  113. /*
  114. * bpf_prog should be a better name but it has been used in
  115. * linux/filter.h.
  116. */
  117. struct bpf_program {
  118. /* Index in elf obj file, for relocation use. */
  119. int idx;
  120. char *section_name;
  121. struct bpf_insn *insns;
  122. size_t insns_cnt;
  123. struct {
  124. int insn_idx;
  125. int map_idx;
  126. } *reloc_desc;
  127. int nr_reloc;
  128. int fd;
  129. struct bpf_object *obj;
  130. void *priv;
  131. bpf_program_clear_priv_t clear_priv;
  132. };
  133. static LIST_HEAD(bpf_objects_list);
  134. struct bpf_object {
  135. char license[64];
  136. u32 kern_version;
  137. void *maps_buf;
  138. size_t maps_buf_sz;
  139. struct bpf_program *programs;
  140. size_t nr_programs;
  141. int *map_fds;
  142. /*
  143. * This field is required because maps_buf will be freed and
  144. * maps_buf_sz will be set to 0 after loaded.
  145. */
  146. size_t nr_map_fds;
  147. bool loaded;
  148. /*
  149. * Information when doing elf related work. Only valid if fd
  150. * is valid.
  151. */
  152. struct {
  153. int fd;
  154. void *obj_buf;
  155. size_t obj_buf_sz;
  156. Elf *elf;
  157. GElf_Ehdr ehdr;
  158. Elf_Data *symbols;
  159. struct {
  160. GElf_Shdr shdr;
  161. Elf_Data *data;
  162. } *reloc;
  163. int nr_reloc;
  164. } efile;
  165. /*
  166. * All loaded bpf_object is linked in a list, which is
  167. * hidden to caller. bpf_objects__<func> handlers deal with
  168. * all objects.
  169. */
  170. struct list_head list;
  171. char path[];
  172. };
  173. #define obj_elf_valid(o) ((o)->efile.elf)
  174. static void bpf_program__unload(struct bpf_program *prog)
  175. {
  176. if (!prog)
  177. return;
  178. zclose(prog->fd);
  179. }
  180. static void bpf_program__exit(struct bpf_program *prog)
  181. {
  182. if (!prog)
  183. return;
  184. if (prog->clear_priv)
  185. prog->clear_priv(prog, prog->priv);
  186. prog->priv = NULL;
  187. prog->clear_priv = NULL;
  188. bpf_program__unload(prog);
  189. zfree(&prog->section_name);
  190. zfree(&prog->insns);
  191. zfree(&prog->reloc_desc);
  192. prog->nr_reloc = 0;
  193. prog->insns_cnt = 0;
  194. prog->idx = -1;
  195. }
  196. static int
  197. bpf_program__init(void *data, size_t size, char *name, int idx,
  198. struct bpf_program *prog)
  199. {
  200. if (size < sizeof(struct bpf_insn)) {
  201. pr_warning("corrupted section '%s'\n", name);
  202. return -EINVAL;
  203. }
  204. bzero(prog, sizeof(*prog));
  205. prog->section_name = strdup(name);
  206. if (!prog->section_name) {
  207. pr_warning("failed to alloc name for prog %s\n",
  208. name);
  209. goto errout;
  210. }
  211. prog->insns = malloc(size);
  212. if (!prog->insns) {
  213. pr_warning("failed to alloc insns for %s\n", name);
  214. goto errout;
  215. }
  216. prog->insns_cnt = size / sizeof(struct bpf_insn);
  217. memcpy(prog->insns, data,
  218. prog->insns_cnt * sizeof(struct bpf_insn));
  219. prog->idx = idx;
  220. prog->fd = -1;
  221. return 0;
  222. errout:
  223. bpf_program__exit(prog);
  224. return -ENOMEM;
  225. }
  226. static int
  227. bpf_object__add_program(struct bpf_object *obj, void *data, size_t size,
  228. char *name, int idx)
  229. {
  230. struct bpf_program prog, *progs;
  231. int nr_progs, err;
  232. err = bpf_program__init(data, size, name, idx, &prog);
  233. if (err)
  234. return err;
  235. progs = obj->programs;
  236. nr_progs = obj->nr_programs;
  237. progs = realloc(progs, sizeof(progs[0]) * (nr_progs + 1));
  238. if (!progs) {
  239. /*
  240. * In this case the original obj->programs
  241. * is still valid, so don't need special treat for
  242. * bpf_close_object().
  243. */
  244. pr_warning("failed to alloc a new program '%s'\n",
  245. name);
  246. bpf_program__exit(&prog);
  247. return -ENOMEM;
  248. }
  249. pr_debug("found program %s\n", prog.section_name);
  250. obj->programs = progs;
  251. obj->nr_programs = nr_progs + 1;
  252. prog.obj = obj;
  253. progs[nr_progs] = prog;
  254. return 0;
  255. }
  256. static struct bpf_object *bpf_object__new(const char *path,
  257. void *obj_buf,
  258. size_t obj_buf_sz)
  259. {
  260. struct bpf_object *obj;
  261. obj = calloc(1, sizeof(struct bpf_object) + strlen(path) + 1);
  262. if (!obj) {
  263. pr_warning("alloc memory failed for %s\n", path);
  264. return ERR_PTR(-ENOMEM);
  265. }
  266. strcpy(obj->path, path);
  267. obj->efile.fd = -1;
  268. /*
  269. * Caller of this function should also calls
  270. * bpf_object__elf_finish() after data collection to return
  271. * obj_buf to user. If not, we should duplicate the buffer to
  272. * avoid user freeing them before elf finish.
  273. */
  274. obj->efile.obj_buf = obj_buf;
  275. obj->efile.obj_buf_sz = obj_buf_sz;
  276. obj->loaded = false;
  277. INIT_LIST_HEAD(&obj->list);
  278. list_add(&obj->list, &bpf_objects_list);
  279. return obj;
  280. }
  281. static void bpf_object__elf_finish(struct bpf_object *obj)
  282. {
  283. if (!obj_elf_valid(obj))
  284. return;
  285. if (obj->efile.elf) {
  286. elf_end(obj->efile.elf);
  287. obj->efile.elf = NULL;
  288. }
  289. obj->efile.symbols = NULL;
  290. zfree(&obj->efile.reloc);
  291. obj->efile.nr_reloc = 0;
  292. zclose(obj->efile.fd);
  293. obj->efile.obj_buf = NULL;
  294. obj->efile.obj_buf_sz = 0;
  295. }
  296. static int bpf_object__elf_init(struct bpf_object *obj)
  297. {
  298. int err = 0;
  299. GElf_Ehdr *ep;
  300. if (obj_elf_valid(obj)) {
  301. pr_warning("elf init: internal error\n");
  302. return -LIBBPF_ERRNO__LIBELF;
  303. }
  304. if (obj->efile.obj_buf_sz > 0) {
  305. /*
  306. * obj_buf should have been validated by
  307. * bpf_object__open_buffer().
  308. */
  309. obj->efile.elf = elf_memory(obj->efile.obj_buf,
  310. obj->efile.obj_buf_sz);
  311. } else {
  312. obj->efile.fd = open(obj->path, O_RDONLY);
  313. if (obj->efile.fd < 0) {
  314. pr_warning("failed to open %s: %s\n", obj->path,
  315. strerror(errno));
  316. return -errno;
  317. }
  318. obj->efile.elf = elf_begin(obj->efile.fd,
  319. LIBBPF_ELF_C_READ_MMAP,
  320. NULL);
  321. }
  322. if (!obj->efile.elf) {
  323. pr_warning("failed to open %s as ELF file\n",
  324. obj->path);
  325. err = -LIBBPF_ERRNO__LIBELF;
  326. goto errout;
  327. }
  328. if (!gelf_getehdr(obj->efile.elf, &obj->efile.ehdr)) {
  329. pr_warning("failed to get EHDR from %s\n",
  330. obj->path);
  331. err = -LIBBPF_ERRNO__FORMAT;
  332. goto errout;
  333. }
  334. ep = &obj->efile.ehdr;
  335. if ((ep->e_type != ET_REL) || (ep->e_machine != 0)) {
  336. pr_warning("%s is not an eBPF object file\n",
  337. obj->path);
  338. err = -LIBBPF_ERRNO__FORMAT;
  339. goto errout;
  340. }
  341. return 0;
  342. errout:
  343. bpf_object__elf_finish(obj);
  344. return err;
  345. }
  346. static int
  347. bpf_object__check_endianness(struct bpf_object *obj)
  348. {
  349. static unsigned int const endian = 1;
  350. switch (obj->efile.ehdr.e_ident[EI_DATA]) {
  351. case ELFDATA2LSB:
  352. /* We are big endian, BPF obj is little endian. */
  353. if (*(unsigned char const *)&endian != 1)
  354. goto mismatch;
  355. break;
  356. case ELFDATA2MSB:
  357. /* We are little endian, BPF obj is big endian. */
  358. if (*(unsigned char const *)&endian != 0)
  359. goto mismatch;
  360. break;
  361. default:
  362. return -LIBBPF_ERRNO__ENDIAN;
  363. }
  364. return 0;
  365. mismatch:
  366. pr_warning("Error: endianness mismatch.\n");
  367. return -LIBBPF_ERRNO__ENDIAN;
  368. }
  369. static int
  370. bpf_object__init_license(struct bpf_object *obj,
  371. void *data, size_t size)
  372. {
  373. memcpy(obj->license, data,
  374. min(size, sizeof(obj->license) - 1));
  375. pr_debug("license of %s is %s\n", obj->path, obj->license);
  376. return 0;
  377. }
  378. static int
  379. bpf_object__init_kversion(struct bpf_object *obj,
  380. void *data, size_t size)
  381. {
  382. u32 kver;
  383. if (size != sizeof(kver)) {
  384. pr_warning("invalid kver section in %s\n", obj->path);
  385. return -LIBBPF_ERRNO__FORMAT;
  386. }
  387. memcpy(&kver, data, sizeof(kver));
  388. obj->kern_version = kver;
  389. pr_debug("kernel version of %s is %x\n", obj->path,
  390. obj->kern_version);
  391. return 0;
  392. }
  393. static int
  394. bpf_object__init_maps(struct bpf_object *obj, void *data,
  395. size_t size)
  396. {
  397. if (size == 0) {
  398. pr_debug("%s doesn't need map definition\n",
  399. obj->path);
  400. return 0;
  401. }
  402. obj->maps_buf = malloc(size);
  403. if (!obj->maps_buf) {
  404. pr_warning("malloc maps failed: %s\n", obj->path);
  405. return -ENOMEM;
  406. }
  407. obj->maps_buf_sz = size;
  408. memcpy(obj->maps_buf, data, size);
  409. pr_debug("maps in %s: %ld bytes\n", obj->path, (long)size);
  410. return 0;
  411. }
  412. static int bpf_object__elf_collect(struct bpf_object *obj)
  413. {
  414. Elf *elf = obj->efile.elf;
  415. GElf_Ehdr *ep = &obj->efile.ehdr;
  416. Elf_Scn *scn = NULL;
  417. int idx = 0, err = 0;
  418. /* Elf is corrupted/truncated, avoid calling elf_strptr. */
  419. if (!elf_rawdata(elf_getscn(elf, ep->e_shstrndx), NULL)) {
  420. pr_warning("failed to get e_shstrndx from %s\n",
  421. obj->path);
  422. return -LIBBPF_ERRNO__FORMAT;
  423. }
  424. while ((scn = elf_nextscn(elf, scn)) != NULL) {
  425. char *name;
  426. GElf_Shdr sh;
  427. Elf_Data *data;
  428. idx++;
  429. if (gelf_getshdr(scn, &sh) != &sh) {
  430. pr_warning("failed to get section header from %s\n",
  431. obj->path);
  432. err = -LIBBPF_ERRNO__FORMAT;
  433. goto out;
  434. }
  435. name = elf_strptr(elf, ep->e_shstrndx, sh.sh_name);
  436. if (!name) {
  437. pr_warning("failed to get section name from %s\n",
  438. obj->path);
  439. err = -LIBBPF_ERRNO__FORMAT;
  440. goto out;
  441. }
  442. data = elf_getdata(scn, 0);
  443. if (!data) {
  444. pr_warning("failed to get section data from %s(%s)\n",
  445. name, obj->path);
  446. err = -LIBBPF_ERRNO__FORMAT;
  447. goto out;
  448. }
  449. pr_debug("section %s, size %ld, link %d, flags %lx, type=%d\n",
  450. name, (unsigned long)data->d_size,
  451. (int)sh.sh_link, (unsigned long)sh.sh_flags,
  452. (int)sh.sh_type);
  453. if (strcmp(name, "license") == 0)
  454. err = bpf_object__init_license(obj,
  455. data->d_buf,
  456. data->d_size);
  457. else if (strcmp(name, "version") == 0)
  458. err = bpf_object__init_kversion(obj,
  459. data->d_buf,
  460. data->d_size);
  461. else if (strcmp(name, "maps") == 0)
  462. err = bpf_object__init_maps(obj, data->d_buf,
  463. data->d_size);
  464. else if (sh.sh_type == SHT_SYMTAB) {
  465. if (obj->efile.symbols) {
  466. pr_warning("bpf: multiple SYMTAB in %s\n",
  467. obj->path);
  468. err = -LIBBPF_ERRNO__FORMAT;
  469. } else
  470. obj->efile.symbols = data;
  471. } else if ((sh.sh_type == SHT_PROGBITS) &&
  472. (sh.sh_flags & SHF_EXECINSTR) &&
  473. (data->d_size > 0)) {
  474. err = bpf_object__add_program(obj, data->d_buf,
  475. data->d_size, name, idx);
  476. if (err) {
  477. char errmsg[STRERR_BUFSIZE];
  478. strerror_r(-err, errmsg, sizeof(errmsg));
  479. pr_warning("failed to alloc program %s (%s): %s",
  480. name, obj->path, errmsg);
  481. }
  482. } else if (sh.sh_type == SHT_REL) {
  483. void *reloc = obj->efile.reloc;
  484. int nr_reloc = obj->efile.nr_reloc + 1;
  485. reloc = realloc(reloc,
  486. sizeof(*obj->efile.reloc) * nr_reloc);
  487. if (!reloc) {
  488. pr_warning("realloc failed\n");
  489. err = -ENOMEM;
  490. } else {
  491. int n = nr_reloc - 1;
  492. obj->efile.reloc = reloc;
  493. obj->efile.nr_reloc = nr_reloc;
  494. obj->efile.reloc[n].shdr = sh;
  495. obj->efile.reloc[n].data = data;
  496. }
  497. }
  498. if (err)
  499. goto out;
  500. }
  501. out:
  502. return err;
  503. }
  504. static struct bpf_program *
  505. bpf_object__find_prog_by_idx(struct bpf_object *obj, int idx)
  506. {
  507. struct bpf_program *prog;
  508. size_t i;
  509. for (i = 0; i < obj->nr_programs; i++) {
  510. prog = &obj->programs[i];
  511. if (prog->idx == idx)
  512. return prog;
  513. }
  514. return NULL;
  515. }
  516. static int
  517. bpf_program__collect_reloc(struct bpf_program *prog,
  518. size_t nr_maps, GElf_Shdr *shdr,
  519. Elf_Data *data, Elf_Data *symbols)
  520. {
  521. int i, nrels;
  522. pr_debug("collecting relocating info for: '%s'\n",
  523. prog->section_name);
  524. nrels = shdr->sh_size / shdr->sh_entsize;
  525. prog->reloc_desc = malloc(sizeof(*prog->reloc_desc) * nrels);
  526. if (!prog->reloc_desc) {
  527. pr_warning("failed to alloc memory in relocation\n");
  528. return -ENOMEM;
  529. }
  530. prog->nr_reloc = nrels;
  531. for (i = 0; i < nrels; i++) {
  532. GElf_Sym sym;
  533. GElf_Rel rel;
  534. unsigned int insn_idx;
  535. struct bpf_insn *insns = prog->insns;
  536. size_t map_idx;
  537. if (!gelf_getrel(data, i, &rel)) {
  538. pr_warning("relocation: failed to get %d reloc\n", i);
  539. return -LIBBPF_ERRNO__FORMAT;
  540. }
  541. insn_idx = rel.r_offset / sizeof(struct bpf_insn);
  542. pr_debug("relocation: insn_idx=%u\n", insn_idx);
  543. if (!gelf_getsym(symbols,
  544. GELF_R_SYM(rel.r_info),
  545. &sym)) {
  546. pr_warning("relocation: symbol %"PRIx64" not found\n",
  547. GELF_R_SYM(rel.r_info));
  548. return -LIBBPF_ERRNO__FORMAT;
  549. }
  550. if (insns[insn_idx].code != (BPF_LD | BPF_IMM | BPF_DW)) {
  551. pr_warning("bpf: relocation: invalid relo for insns[%d].code 0x%x\n",
  552. insn_idx, insns[insn_idx].code);
  553. return -LIBBPF_ERRNO__RELOC;
  554. }
  555. map_idx = sym.st_value / sizeof(struct bpf_map_def);
  556. if (map_idx >= nr_maps) {
  557. pr_warning("bpf relocation: map_idx %d large than %d\n",
  558. (int)map_idx, (int)nr_maps - 1);
  559. return -LIBBPF_ERRNO__RELOC;
  560. }
  561. prog->reloc_desc[i].insn_idx = insn_idx;
  562. prog->reloc_desc[i].map_idx = map_idx;
  563. }
  564. return 0;
  565. }
  566. static int
  567. bpf_object__create_maps(struct bpf_object *obj)
  568. {
  569. unsigned int i;
  570. size_t nr_maps;
  571. int *pfd;
  572. nr_maps = obj->maps_buf_sz / sizeof(struct bpf_map_def);
  573. if (!obj->maps_buf || !nr_maps) {
  574. pr_debug("don't need create maps for %s\n",
  575. obj->path);
  576. return 0;
  577. }
  578. obj->map_fds = malloc(sizeof(int) * nr_maps);
  579. if (!obj->map_fds) {
  580. pr_warning("realloc perf_bpf_map_fds failed\n");
  581. return -ENOMEM;
  582. }
  583. obj->nr_map_fds = nr_maps;
  584. /* fill all fd with -1 */
  585. memset(obj->map_fds, -1, sizeof(int) * nr_maps);
  586. pfd = obj->map_fds;
  587. for (i = 0; i < nr_maps; i++) {
  588. struct bpf_map_def def;
  589. def = *(struct bpf_map_def *)(obj->maps_buf +
  590. i * sizeof(struct bpf_map_def));
  591. *pfd = bpf_create_map(def.type,
  592. def.key_size,
  593. def.value_size,
  594. def.max_entries);
  595. if (*pfd < 0) {
  596. size_t j;
  597. int err = *pfd;
  598. pr_warning("failed to create map: %s\n",
  599. strerror(errno));
  600. for (j = 0; j < i; j++)
  601. zclose(obj->map_fds[j]);
  602. obj->nr_map_fds = 0;
  603. zfree(&obj->map_fds);
  604. return err;
  605. }
  606. pr_debug("create map: fd=%d\n", *pfd);
  607. pfd++;
  608. }
  609. zfree(&obj->maps_buf);
  610. obj->maps_buf_sz = 0;
  611. return 0;
  612. }
  613. static int
  614. bpf_program__relocate(struct bpf_program *prog, int *map_fds)
  615. {
  616. int i;
  617. if (!prog || !prog->reloc_desc)
  618. return 0;
  619. for (i = 0; i < prog->nr_reloc; i++) {
  620. int insn_idx, map_idx;
  621. struct bpf_insn *insns = prog->insns;
  622. insn_idx = prog->reloc_desc[i].insn_idx;
  623. map_idx = prog->reloc_desc[i].map_idx;
  624. if (insn_idx >= (int)prog->insns_cnt) {
  625. pr_warning("relocation out of range: '%s'\n",
  626. prog->section_name);
  627. return -LIBBPF_ERRNO__RELOC;
  628. }
  629. insns[insn_idx].src_reg = BPF_PSEUDO_MAP_FD;
  630. insns[insn_idx].imm = map_fds[map_idx];
  631. }
  632. zfree(&prog->reloc_desc);
  633. prog->nr_reloc = 0;
  634. return 0;
  635. }
  636. static int
  637. bpf_object__relocate(struct bpf_object *obj)
  638. {
  639. struct bpf_program *prog;
  640. size_t i;
  641. int err;
  642. for (i = 0; i < obj->nr_programs; i++) {
  643. prog = &obj->programs[i];
  644. err = bpf_program__relocate(prog, obj->map_fds);
  645. if (err) {
  646. pr_warning("failed to relocate '%s'\n",
  647. prog->section_name);
  648. return err;
  649. }
  650. }
  651. return 0;
  652. }
  653. static int bpf_object__collect_reloc(struct bpf_object *obj)
  654. {
  655. int i, err;
  656. if (!obj_elf_valid(obj)) {
  657. pr_warning("Internal error: elf object is closed\n");
  658. return -LIBBPF_ERRNO__INTERNAL;
  659. }
  660. for (i = 0; i < obj->efile.nr_reloc; i++) {
  661. GElf_Shdr *shdr = &obj->efile.reloc[i].shdr;
  662. Elf_Data *data = obj->efile.reloc[i].data;
  663. int idx = shdr->sh_info;
  664. struct bpf_program *prog;
  665. size_t nr_maps = obj->maps_buf_sz /
  666. sizeof(struct bpf_map_def);
  667. if (shdr->sh_type != SHT_REL) {
  668. pr_warning("internal error at %d\n", __LINE__);
  669. return -LIBBPF_ERRNO__INTERNAL;
  670. }
  671. prog = bpf_object__find_prog_by_idx(obj, idx);
  672. if (!prog) {
  673. pr_warning("relocation failed: no %d section\n",
  674. idx);
  675. return -LIBBPF_ERRNO__RELOC;
  676. }
  677. err = bpf_program__collect_reloc(prog, nr_maps,
  678. shdr, data,
  679. obj->efile.symbols);
  680. if (err)
  681. return err;
  682. }
  683. return 0;
  684. }
  685. static int
  686. load_program(struct bpf_insn *insns, int insns_cnt,
  687. char *license, u32 kern_version, int *pfd)
  688. {
  689. int ret;
  690. char *log_buf;
  691. if (!insns || !insns_cnt)
  692. return -EINVAL;
  693. log_buf = malloc(BPF_LOG_BUF_SIZE);
  694. if (!log_buf)
  695. pr_warning("Alloc log buffer for bpf loader error, continue without log\n");
  696. ret = bpf_load_program(BPF_PROG_TYPE_KPROBE, insns,
  697. insns_cnt, license, kern_version,
  698. log_buf, BPF_LOG_BUF_SIZE);
  699. if (ret >= 0) {
  700. *pfd = ret;
  701. ret = 0;
  702. goto out;
  703. }
  704. ret = -LIBBPF_ERRNO__LOAD;
  705. pr_warning("load bpf program failed: %s\n", strerror(errno));
  706. if (log_buf && log_buf[0] != '\0') {
  707. ret = -LIBBPF_ERRNO__VERIFY;
  708. pr_warning("-- BEGIN DUMP LOG ---\n");
  709. pr_warning("\n%s\n", log_buf);
  710. pr_warning("-- END LOG --\n");
  711. } else {
  712. if (insns_cnt >= BPF_MAXINSNS) {
  713. pr_warning("Program too large (%d insns), at most %d insns\n",
  714. insns_cnt, BPF_MAXINSNS);
  715. ret = -LIBBPF_ERRNO__PROG2BIG;
  716. } else if (log_buf) {
  717. pr_warning("log buffer is empty\n");
  718. ret = -LIBBPF_ERRNO__KVER;
  719. }
  720. }
  721. out:
  722. free(log_buf);
  723. return ret;
  724. }
  725. static int
  726. bpf_program__load(struct bpf_program *prog,
  727. char *license, u32 kern_version)
  728. {
  729. int err, fd;
  730. err = load_program(prog->insns, prog->insns_cnt,
  731. license, kern_version, &fd);
  732. if (!err)
  733. prog->fd = fd;
  734. if (err)
  735. pr_warning("failed to load program '%s'\n",
  736. prog->section_name);
  737. zfree(&prog->insns);
  738. prog->insns_cnt = 0;
  739. return err;
  740. }
  741. static int
  742. bpf_object__load_progs(struct bpf_object *obj)
  743. {
  744. size_t i;
  745. int err;
  746. for (i = 0; i < obj->nr_programs; i++) {
  747. err = bpf_program__load(&obj->programs[i],
  748. obj->license,
  749. obj->kern_version);
  750. if (err)
  751. return err;
  752. }
  753. return 0;
  754. }
  755. static int bpf_object__validate(struct bpf_object *obj)
  756. {
  757. if (obj->kern_version == 0) {
  758. pr_warning("%s doesn't provide kernel version\n",
  759. obj->path);
  760. return -LIBBPF_ERRNO__KVERSION;
  761. }
  762. return 0;
  763. }
  764. static struct bpf_object *
  765. __bpf_object__open(const char *path, void *obj_buf, size_t obj_buf_sz)
  766. {
  767. struct bpf_object *obj;
  768. int err;
  769. if (elf_version(EV_CURRENT) == EV_NONE) {
  770. pr_warning("failed to init libelf for %s\n", path);
  771. return ERR_PTR(-LIBBPF_ERRNO__LIBELF);
  772. }
  773. obj = bpf_object__new(path, obj_buf, obj_buf_sz);
  774. if (IS_ERR(obj))
  775. return obj;
  776. CHECK_ERR(bpf_object__elf_init(obj), err, out);
  777. CHECK_ERR(bpf_object__check_endianness(obj), err, out);
  778. CHECK_ERR(bpf_object__elf_collect(obj), err, out);
  779. CHECK_ERR(bpf_object__collect_reloc(obj), err, out);
  780. CHECK_ERR(bpf_object__validate(obj), err, out);
  781. bpf_object__elf_finish(obj);
  782. return obj;
  783. out:
  784. bpf_object__close(obj);
  785. return ERR_PTR(err);
  786. }
  787. struct bpf_object *bpf_object__open(const char *path)
  788. {
  789. /* param validation */
  790. if (!path)
  791. return NULL;
  792. pr_debug("loading %s\n", path);
  793. return __bpf_object__open(path, NULL, 0);
  794. }
  795. struct bpf_object *bpf_object__open_buffer(void *obj_buf,
  796. size_t obj_buf_sz,
  797. const char *name)
  798. {
  799. char tmp_name[64];
  800. /* param validation */
  801. if (!obj_buf || obj_buf_sz <= 0)
  802. return NULL;
  803. if (!name) {
  804. snprintf(tmp_name, sizeof(tmp_name), "%lx-%lx",
  805. (unsigned long)obj_buf,
  806. (unsigned long)obj_buf_sz);
  807. tmp_name[sizeof(tmp_name) - 1] = '\0';
  808. name = tmp_name;
  809. }
  810. pr_debug("loading object '%s' from buffer\n",
  811. name);
  812. return __bpf_object__open(name, obj_buf, obj_buf_sz);
  813. }
  814. int bpf_object__unload(struct bpf_object *obj)
  815. {
  816. size_t i;
  817. if (!obj)
  818. return -EINVAL;
  819. for (i = 0; i < obj->nr_map_fds; i++)
  820. zclose(obj->map_fds[i]);
  821. zfree(&obj->map_fds);
  822. obj->nr_map_fds = 0;
  823. for (i = 0; i < obj->nr_programs; i++)
  824. bpf_program__unload(&obj->programs[i]);
  825. return 0;
  826. }
  827. int bpf_object__load(struct bpf_object *obj)
  828. {
  829. int err;
  830. if (!obj)
  831. return -EINVAL;
  832. if (obj->loaded) {
  833. pr_warning("object should not be loaded twice\n");
  834. return -EINVAL;
  835. }
  836. obj->loaded = true;
  837. CHECK_ERR(bpf_object__create_maps(obj), err, out);
  838. CHECK_ERR(bpf_object__relocate(obj), err, out);
  839. CHECK_ERR(bpf_object__load_progs(obj), err, out);
  840. return 0;
  841. out:
  842. bpf_object__unload(obj);
  843. pr_warning("failed to load object '%s'\n", obj->path);
  844. return err;
  845. }
  846. void bpf_object__close(struct bpf_object *obj)
  847. {
  848. size_t i;
  849. if (!obj)
  850. return;
  851. bpf_object__elf_finish(obj);
  852. bpf_object__unload(obj);
  853. zfree(&obj->maps_buf);
  854. if (obj->programs && obj->nr_programs) {
  855. for (i = 0; i < obj->nr_programs; i++)
  856. bpf_program__exit(&obj->programs[i]);
  857. }
  858. zfree(&obj->programs);
  859. list_del(&obj->list);
  860. free(obj);
  861. }
  862. struct bpf_object *
  863. bpf_object__next(struct bpf_object *prev)
  864. {
  865. struct bpf_object *next;
  866. if (!prev)
  867. next = list_first_entry(&bpf_objects_list,
  868. struct bpf_object,
  869. list);
  870. else
  871. next = list_next_entry(prev, list);
  872. /* Empty list is noticed here so don't need checking on entry. */
  873. if (&next->list == &bpf_objects_list)
  874. return NULL;
  875. return next;
  876. }
  877. const char *
  878. bpf_object__get_name(struct bpf_object *obj)
  879. {
  880. if (!obj)
  881. return ERR_PTR(-EINVAL);
  882. return obj->path;
  883. }
  884. unsigned int
  885. bpf_object__get_kversion(struct bpf_object *obj)
  886. {
  887. if (!obj)
  888. return 0;
  889. return obj->kern_version;
  890. }
  891. struct bpf_program *
  892. bpf_program__next(struct bpf_program *prev, struct bpf_object *obj)
  893. {
  894. size_t idx;
  895. if (!obj->programs)
  896. return NULL;
  897. /* First handler */
  898. if (prev == NULL)
  899. return &obj->programs[0];
  900. if (prev->obj != obj) {
  901. pr_warning("error: program handler doesn't match object\n");
  902. return NULL;
  903. }
  904. idx = (prev - obj->programs) + 1;
  905. if (idx >= obj->nr_programs)
  906. return NULL;
  907. return &obj->programs[idx];
  908. }
  909. int bpf_program__set_private(struct bpf_program *prog,
  910. void *priv,
  911. bpf_program_clear_priv_t clear_priv)
  912. {
  913. if (prog->priv && prog->clear_priv)
  914. prog->clear_priv(prog, prog->priv);
  915. prog->priv = priv;
  916. prog->clear_priv = clear_priv;
  917. return 0;
  918. }
  919. int bpf_program__get_private(struct bpf_program *prog, void **ppriv)
  920. {
  921. *ppriv = prog->priv;
  922. return 0;
  923. }
  924. const char *bpf_program__title(struct bpf_program *prog, bool needs_copy)
  925. {
  926. const char *title;
  927. title = prog->section_name;
  928. if (needs_copy) {
  929. title = strdup(title);
  930. if (!title) {
  931. pr_warning("failed to strdup program title\n");
  932. return ERR_PTR(-ENOMEM);
  933. }
  934. }
  935. return title;
  936. }
  937. int bpf_program__fd(struct bpf_program *prog)
  938. {
  939. return prog->fd;
  940. }