tools lib bpf: Check return value of strdup when reading map names
[linux-2.6-block.git] / tools / lib / bpf / libbpf.c
CommitLineData
1b76c13e
WN
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
9#include <stdlib.h>
b3f59d66
WN
10#include <stdio.h>
11#include <stdarg.h>
34090915 12#include <inttypes.h>
b3f59d66 13#include <string.h>
1b76c13e 14#include <unistd.h>
1a5e3fb1
WN
15#include <fcntl.h>
16#include <errno.h>
1b76c13e 17#include <asm/unistd.h>
cb1e5e96 18#include <linux/kernel.h>
1b76c13e 19#include <linux/bpf.h>
9a208eff 20#include <linux/list.h>
1a5e3fb1
WN
21#include <libelf.h>
22#include <gelf.h>
1b76c13e
WN
23
24#include "libbpf.h"
52d3352e 25#include "bpf.h"
b3f59d66
WN
26
27#define __printf(a, b) __attribute__((format(printf, a, b)))
28
29__printf(1, 2)
30static int __base_pr(const char *format, ...)
31{
32 va_list args;
33 int err;
34
35 va_start(args, format);
36 err = vfprintf(stderr, format, args);
37 va_end(args);
38 return err;
39}
40
41static __printf(1, 2) libbpf_print_fn_t __pr_warning = __base_pr;
42static __printf(1, 2) libbpf_print_fn_t __pr_info = __base_pr;
43static __printf(1, 2) libbpf_print_fn_t __pr_debug;
44
45#define __pr(func, fmt, ...) \
46do { \
47 if ((func)) \
48 (func)("libbpf: " fmt, ##__VA_ARGS__); \
49} while (0)
50
51#define pr_warning(fmt, ...) __pr(__pr_warning, fmt, ##__VA_ARGS__)
52#define pr_info(fmt, ...) __pr(__pr_info, fmt, ##__VA_ARGS__)
53#define pr_debug(fmt, ...) __pr(__pr_debug, fmt, ##__VA_ARGS__)
54
55void libbpf_set_print(libbpf_print_fn_t warn,
56 libbpf_print_fn_t info,
57 libbpf_print_fn_t debug)
58{
59 __pr_warning = warn;
60 __pr_info = info;
61 __pr_debug = debug;
62}
1a5e3fb1 63
6371ca3b
WN
64#define STRERR_BUFSIZE 128
65
66#define ERRNO_OFFSET(e) ((e) - __LIBBPF_ERRNO__START)
67#define ERRCODE_OFFSET(c) ERRNO_OFFSET(LIBBPF_ERRNO__##c)
68#define NR_ERRNO (__LIBBPF_ERRNO__END - __LIBBPF_ERRNO__START)
69
70static const char *libbpf_strerror_table[NR_ERRNO] = {
71 [ERRCODE_OFFSET(LIBELF)] = "Something wrong in libelf",
72 [ERRCODE_OFFSET(FORMAT)] = "BPF object format invalid",
73 [ERRCODE_OFFSET(KVERSION)] = "'version' section incorrect or lost",
74 [ERRCODE_OFFSET(ENDIAN)] = "Endian missmatch",
75 [ERRCODE_OFFSET(INTERNAL)] = "Internal error in libbpf",
76 [ERRCODE_OFFSET(RELOC)] = "Relocation failed",
77 [ERRCODE_OFFSET(VERIFY)] = "Kernel verifier blocks program loading",
78 [ERRCODE_OFFSET(PROG2BIG)] = "Program too big",
79 [ERRCODE_OFFSET(KVER)] = "Incorrect kernel version",
80};
81
82int libbpf_strerror(int err, char *buf, size_t size)
83{
84 if (!buf || !size)
85 return -1;
86
87 err = err > 0 ? err : -err;
88
89 if (err < __LIBBPF_ERRNO__START) {
90 int ret;
91
92 ret = strerror_r(err, buf, size);
93 buf[size - 1] = '\0';
94 return ret;
95 }
96
97 if (err < __LIBBPF_ERRNO__END) {
98 const char *msg;
99
100 msg = libbpf_strerror_table[ERRNO_OFFSET(err)];
101 snprintf(buf, size, "%s", msg);
102 buf[size - 1] = '\0';
103 return 0;
104 }
105
106 snprintf(buf, size, "Unknown libbpf error %d", err);
107 buf[size - 1] = '\0';
108 return -1;
109}
110
111#define CHECK_ERR(action, err, out) do { \
112 err = action; \
113 if (err) \
114 goto out; \
115} while(0)
116
117
1a5e3fb1
WN
118/* Copied from tools/perf/util/util.h */
119#ifndef zfree
120# define zfree(ptr) ({ free(*ptr); *ptr = NULL; })
121#endif
122
123#ifndef zclose
124# define zclose(fd) ({ \
125 int ___err = 0; \
126 if ((fd) >= 0) \
127 ___err = close((fd)); \
128 fd = -1; \
129 ___err; })
130#endif
131
132#ifdef HAVE_LIBELF_MMAP_SUPPORT
133# define LIBBPF_ELF_C_READ_MMAP ELF_C_READ_MMAP
134#else
135# define LIBBPF_ELF_C_READ_MMAP ELF_C_READ
136#endif
137
a5b8bd47
WN
138/*
139 * bpf_prog should be a better name but it has been used in
140 * linux/filter.h.
141 */
142struct bpf_program {
143 /* Index in elf obj file, for relocation use. */
144 int idx;
145 char *section_name;
146 struct bpf_insn *insns;
147 size_t insns_cnt;
34090915
WN
148
149 struct {
150 int insn_idx;
151 int map_idx;
152 } *reloc_desc;
153 int nr_reloc;
55cffde2 154
b580563e
WN
155 struct {
156 int nr;
157 int *fds;
158 } instances;
159 bpf_program_prep_t preprocessor;
aa9b1ac3
WN
160
161 struct bpf_object *obj;
162 void *priv;
163 bpf_program_clear_priv_t clear_priv;
a5b8bd47
WN
164};
165
9d759a9b
WN
166struct bpf_map {
167 int fd;
561bbcca 168 char *name;
9d759a9b
WN
169 struct bpf_map_def def;
170 void *priv;
171 bpf_map_clear_priv_t clear_priv;
172};
173
9a208eff
WN
174static LIST_HEAD(bpf_objects_list);
175
1a5e3fb1 176struct bpf_object {
cb1e5e96
WN
177 char license[64];
178 u32 kern_version;
0b3d1efa 179
a5b8bd47
WN
180 struct bpf_program *programs;
181 size_t nr_programs;
9d759a9b
WN
182 struct bpf_map *maps;
183 size_t nr_maps;
184
52d3352e 185 bool loaded;
a5b8bd47 186
1a5e3fb1
WN
187 /*
188 * Information when doing elf related work. Only valid if fd
189 * is valid.
190 */
191 struct {
192 int fd;
6c956392
WN
193 void *obj_buf;
194 size_t obj_buf_sz;
1a5e3fb1
WN
195 Elf *elf;
196 GElf_Ehdr ehdr;
bec7d68c 197 Elf_Data *symbols;
b62f06e8
WN
198 struct {
199 GElf_Shdr shdr;
200 Elf_Data *data;
201 } *reloc;
202 int nr_reloc;
1a5e3fb1 203 } efile;
9a208eff
WN
204 /*
205 * All loaded bpf_object is linked in a list, which is
206 * hidden to caller. bpf_objects__<func> handlers deal with
207 * all objects.
208 */
209 struct list_head list;
1a5e3fb1
WN
210 char path[];
211};
212#define obj_elf_valid(o) ((o)->efile.elf)
213
55cffde2
WN
214static void bpf_program__unload(struct bpf_program *prog)
215{
b580563e
WN
216 int i;
217
55cffde2
WN
218 if (!prog)
219 return;
220
b580563e
WN
221 /*
222 * If the object is opened but the program was never loaded,
223 * it is possible that prog->instances.nr == -1.
224 */
225 if (prog->instances.nr > 0) {
226 for (i = 0; i < prog->instances.nr; i++)
227 zclose(prog->instances.fds[i]);
228 } else if (prog->instances.nr != -1) {
229 pr_warning("Internal error: instances.nr is %d\n",
230 prog->instances.nr);
231 }
232
233 prog->instances.nr = -1;
234 zfree(&prog->instances.fds);
55cffde2
WN
235}
236
a5b8bd47
WN
237static void bpf_program__exit(struct bpf_program *prog)
238{
239 if (!prog)
240 return;
241
aa9b1ac3
WN
242 if (prog->clear_priv)
243 prog->clear_priv(prog, prog->priv);
244
245 prog->priv = NULL;
246 prog->clear_priv = NULL;
247
55cffde2 248 bpf_program__unload(prog);
a5b8bd47
WN
249 zfree(&prog->section_name);
250 zfree(&prog->insns);
34090915
WN
251 zfree(&prog->reloc_desc);
252
253 prog->nr_reloc = 0;
a5b8bd47
WN
254 prog->insns_cnt = 0;
255 prog->idx = -1;
256}
257
258static int
259bpf_program__init(void *data, size_t size, char *name, int idx,
260 struct bpf_program *prog)
261{
262 if (size < sizeof(struct bpf_insn)) {
263 pr_warning("corrupted section '%s'\n", name);
264 return -EINVAL;
265 }
266
267 bzero(prog, sizeof(*prog));
268
269 prog->section_name = strdup(name);
270 if (!prog->section_name) {
271 pr_warning("failed to alloc name for prog %s\n",
272 name);
273 goto errout;
274 }
275
276 prog->insns = malloc(size);
277 if (!prog->insns) {
278 pr_warning("failed to alloc insns for %s\n", name);
279 goto errout;
280 }
281 prog->insns_cnt = size / sizeof(struct bpf_insn);
282 memcpy(prog->insns, data,
283 prog->insns_cnt * sizeof(struct bpf_insn));
284 prog->idx = idx;
b580563e
WN
285 prog->instances.fds = NULL;
286 prog->instances.nr = -1;
a5b8bd47
WN
287
288 return 0;
289errout:
290 bpf_program__exit(prog);
291 return -ENOMEM;
292}
293
294static int
295bpf_object__add_program(struct bpf_object *obj, void *data, size_t size,
296 char *name, int idx)
297{
298 struct bpf_program prog, *progs;
299 int nr_progs, err;
300
301 err = bpf_program__init(data, size, name, idx, &prog);
302 if (err)
303 return err;
304
305 progs = obj->programs;
306 nr_progs = obj->nr_programs;
307
308 progs = realloc(progs, sizeof(progs[0]) * (nr_progs + 1));
309 if (!progs) {
310 /*
311 * In this case the original obj->programs
312 * is still valid, so don't need special treat for
313 * bpf_close_object().
314 */
315 pr_warning("failed to alloc a new program '%s'\n",
316 name);
317 bpf_program__exit(&prog);
318 return -ENOMEM;
319 }
320
321 pr_debug("found program %s\n", prog.section_name);
322 obj->programs = progs;
323 obj->nr_programs = nr_progs + 1;
aa9b1ac3 324 prog.obj = obj;
a5b8bd47
WN
325 progs[nr_progs] = prog;
326 return 0;
327}
328
6c956392
WN
329static struct bpf_object *bpf_object__new(const char *path,
330 void *obj_buf,
331 size_t obj_buf_sz)
1a5e3fb1
WN
332{
333 struct bpf_object *obj;
334
335 obj = calloc(1, sizeof(struct bpf_object) + strlen(path) + 1);
336 if (!obj) {
337 pr_warning("alloc memory failed for %s\n", path);
6371ca3b 338 return ERR_PTR(-ENOMEM);
1a5e3fb1
WN
339 }
340
341 strcpy(obj->path, path);
342 obj->efile.fd = -1;
6c956392
WN
343
344 /*
345 * Caller of this function should also calls
346 * bpf_object__elf_finish() after data collection to return
347 * obj_buf to user. If not, we should duplicate the buffer to
348 * avoid user freeing them before elf finish.
349 */
350 obj->efile.obj_buf = obj_buf;
351 obj->efile.obj_buf_sz = obj_buf_sz;
352
52d3352e 353 obj->loaded = false;
9a208eff
WN
354
355 INIT_LIST_HEAD(&obj->list);
356 list_add(&obj->list, &bpf_objects_list);
1a5e3fb1
WN
357 return obj;
358}
359
360static void bpf_object__elf_finish(struct bpf_object *obj)
361{
362 if (!obj_elf_valid(obj))
363 return;
364
365 if (obj->efile.elf) {
366 elf_end(obj->efile.elf);
367 obj->efile.elf = NULL;
368 }
bec7d68c 369 obj->efile.symbols = NULL;
b62f06e8
WN
370
371 zfree(&obj->efile.reloc);
372 obj->efile.nr_reloc = 0;
1a5e3fb1 373 zclose(obj->efile.fd);
6c956392
WN
374 obj->efile.obj_buf = NULL;
375 obj->efile.obj_buf_sz = 0;
1a5e3fb1
WN
376}
377
378static int bpf_object__elf_init(struct bpf_object *obj)
379{
380 int err = 0;
381 GElf_Ehdr *ep;
382
383 if (obj_elf_valid(obj)) {
384 pr_warning("elf init: internal error\n");
6371ca3b 385 return -LIBBPF_ERRNO__LIBELF;
1a5e3fb1
WN
386 }
387
6c956392
WN
388 if (obj->efile.obj_buf_sz > 0) {
389 /*
390 * obj_buf should have been validated by
391 * bpf_object__open_buffer().
392 */
393 obj->efile.elf = elf_memory(obj->efile.obj_buf,
394 obj->efile.obj_buf_sz);
395 } else {
396 obj->efile.fd = open(obj->path, O_RDONLY);
397 if (obj->efile.fd < 0) {
398 pr_warning("failed to open %s: %s\n", obj->path,
399 strerror(errno));
400 return -errno;
401 }
402
403 obj->efile.elf = elf_begin(obj->efile.fd,
404 LIBBPF_ELF_C_READ_MMAP,
405 NULL);
1a5e3fb1
WN
406 }
407
1a5e3fb1
WN
408 if (!obj->efile.elf) {
409 pr_warning("failed to open %s as ELF file\n",
410 obj->path);
6371ca3b 411 err = -LIBBPF_ERRNO__LIBELF;
1a5e3fb1
WN
412 goto errout;
413 }
414
415 if (!gelf_getehdr(obj->efile.elf, &obj->efile.ehdr)) {
416 pr_warning("failed to get EHDR from %s\n",
417 obj->path);
6371ca3b 418 err = -LIBBPF_ERRNO__FORMAT;
1a5e3fb1
WN
419 goto errout;
420 }
421 ep = &obj->efile.ehdr;
422
423 if ((ep->e_type != ET_REL) || (ep->e_machine != 0)) {
424 pr_warning("%s is not an eBPF object file\n",
425 obj->path);
6371ca3b 426 err = -LIBBPF_ERRNO__FORMAT;
1a5e3fb1
WN
427 goto errout;
428 }
429
430 return 0;
431errout:
432 bpf_object__elf_finish(obj);
433 return err;
434}
435
cc4228d5
WN
436static int
437bpf_object__check_endianness(struct bpf_object *obj)
438{
439 static unsigned int const endian = 1;
440
441 switch (obj->efile.ehdr.e_ident[EI_DATA]) {
442 case ELFDATA2LSB:
443 /* We are big endian, BPF obj is little endian. */
444 if (*(unsigned char const *)&endian != 1)
445 goto mismatch;
446 break;
447
448 case ELFDATA2MSB:
449 /* We are little endian, BPF obj is big endian. */
450 if (*(unsigned char const *)&endian != 0)
451 goto mismatch;
452 break;
453 default:
6371ca3b 454 return -LIBBPF_ERRNO__ENDIAN;
cc4228d5
WN
455 }
456
457 return 0;
458
459mismatch:
460 pr_warning("Error: endianness mismatch.\n");
6371ca3b 461 return -LIBBPF_ERRNO__ENDIAN;
cc4228d5
WN
462}
463
cb1e5e96
WN
464static int
465bpf_object__init_license(struct bpf_object *obj,
466 void *data, size_t size)
467{
468 memcpy(obj->license, data,
469 min(size, sizeof(obj->license) - 1));
470 pr_debug("license of %s is %s\n", obj->path, obj->license);
471 return 0;
472}
473
474static int
475bpf_object__init_kversion(struct bpf_object *obj,
476 void *data, size_t size)
477{
478 u32 kver;
479
480 if (size != sizeof(kver)) {
481 pr_warning("invalid kver section in %s\n", obj->path);
6371ca3b 482 return -LIBBPF_ERRNO__FORMAT;
cb1e5e96
WN
483 }
484 memcpy(&kver, data, sizeof(kver));
485 obj->kern_version = kver;
486 pr_debug("kernel version of %s is %x\n", obj->path,
487 obj->kern_version);
488 return 0;
489}
490
0b3d1efa
WN
491static int
492bpf_object__init_maps(struct bpf_object *obj, void *data,
493 size_t size)
494{
9d759a9b
WN
495 size_t nr_maps;
496 int i;
497
498 nr_maps = size / sizeof(struct bpf_map_def);
499 if (!data || !nr_maps) {
0b3d1efa
WN
500 pr_debug("%s doesn't need map definition\n",
501 obj->path);
502 return 0;
503 }
504
9d759a9b
WN
505 pr_debug("maps in %s: %zd bytes\n", obj->path, size);
506
507 obj->maps = calloc(nr_maps, sizeof(obj->maps[0]));
508 if (!obj->maps) {
509 pr_warning("alloc maps for object failed\n");
0b3d1efa
WN
510 return -ENOMEM;
511 }
9d759a9b
WN
512 obj->nr_maps = nr_maps;
513
514 for (i = 0; i < nr_maps; i++) {
515 struct bpf_map_def *def = &obj->maps[i].def;
0b3d1efa 516
9d759a9b
WN
517 /*
518 * fill all fd with -1 so won't close incorrect
519 * fd (fd=0 is stdin) when failure (zclose won't close
520 * negative fd)).
521 */
522 obj->maps[i].fd = -1;
523
524 /* Save map definition into obj->maps */
525 *def = ((struct bpf_map_def *)data)[i];
526 }
0b3d1efa
WN
527 return 0;
528}
529
973170e6 530static int
561bbcca
WN
531bpf_object__init_maps_name(struct bpf_object *obj, int maps_shndx)
532{
533 int i;
534 Elf_Data *symbols = obj->efile.symbols;
535
536 if (!symbols || maps_shndx < 0)
973170e6 537 return -EINVAL;
561bbcca
WN
538
539 for (i = 0; i < symbols->d_size / sizeof(GElf_Sym); i++) {
540 GElf_Sym sym;
541 size_t map_idx;
542 const char *map_name;
543
544 if (!gelf_getsym(symbols, i, &sym))
545 continue;
546 if (sym.st_shndx != maps_shndx)
547 continue;
548
549 map_name = elf_strptr(obj->efile.elf,
550 obj->efile.ehdr.e_shstrndx,
551 sym.st_name);
552 map_idx = sym.st_value / sizeof(struct bpf_map_def);
553 if (map_idx >= obj->nr_maps) {
554 pr_warning("index of map \"%s\" is buggy: %zu > %zu\n",
555 map_name, map_idx, obj->nr_maps);
556 continue;
557 }
558 obj->maps[map_idx].name = strdup(map_name);
973170e6
WN
559 if (!obj->maps[map_idx].name) {
560 pr_warning("failed to alloc map name\n");
561 return -ENOMEM;
562 }
561bbcca
WN
563 pr_debug("map %zu is \"%s\"\n", map_idx,
564 obj->maps[map_idx].name);
565 }
973170e6 566 return 0;
561bbcca
WN
567}
568
29603665
WN
569static int bpf_object__elf_collect(struct bpf_object *obj)
570{
571 Elf *elf = obj->efile.elf;
572 GElf_Ehdr *ep = &obj->efile.ehdr;
573 Elf_Scn *scn = NULL;
561bbcca 574 int idx = 0, err = 0, maps_shndx = -1;
29603665
WN
575
576 /* Elf is corrupted/truncated, avoid calling elf_strptr. */
577 if (!elf_rawdata(elf_getscn(elf, ep->e_shstrndx), NULL)) {
578 pr_warning("failed to get e_shstrndx from %s\n",
579 obj->path);
6371ca3b 580 return -LIBBPF_ERRNO__FORMAT;
29603665
WN
581 }
582
583 while ((scn = elf_nextscn(elf, scn)) != NULL) {
584 char *name;
585 GElf_Shdr sh;
586 Elf_Data *data;
587
588 idx++;
589 if (gelf_getshdr(scn, &sh) != &sh) {
590 pr_warning("failed to get section header from %s\n",
591 obj->path);
6371ca3b 592 err = -LIBBPF_ERRNO__FORMAT;
29603665
WN
593 goto out;
594 }
595
596 name = elf_strptr(elf, ep->e_shstrndx, sh.sh_name);
597 if (!name) {
598 pr_warning("failed to get section name from %s\n",
599 obj->path);
6371ca3b 600 err = -LIBBPF_ERRNO__FORMAT;
29603665
WN
601 goto out;
602 }
603
604 data = elf_getdata(scn, 0);
605 if (!data) {
606 pr_warning("failed to get section data from %s(%s)\n",
607 name, obj->path);
6371ca3b 608 err = -LIBBPF_ERRNO__FORMAT;
29603665
WN
609 goto out;
610 }
611 pr_debug("section %s, size %ld, link %d, flags %lx, type=%d\n",
612 name, (unsigned long)data->d_size,
613 (int)sh.sh_link, (unsigned long)sh.sh_flags,
614 (int)sh.sh_type);
cb1e5e96
WN
615
616 if (strcmp(name, "license") == 0)
617 err = bpf_object__init_license(obj,
618 data->d_buf,
619 data->d_size);
620 else if (strcmp(name, "version") == 0)
621 err = bpf_object__init_kversion(obj,
622 data->d_buf,
623 data->d_size);
561bbcca 624 else if (strcmp(name, "maps") == 0) {
0b3d1efa
WN
625 err = bpf_object__init_maps(obj, data->d_buf,
626 data->d_size);
561bbcca
WN
627 maps_shndx = idx;
628 } else if (sh.sh_type == SHT_SYMTAB) {
bec7d68c
WN
629 if (obj->efile.symbols) {
630 pr_warning("bpf: multiple SYMTAB in %s\n",
631 obj->path);
6371ca3b 632 err = -LIBBPF_ERRNO__FORMAT;
bec7d68c
WN
633 } else
634 obj->efile.symbols = data;
a5b8bd47
WN
635 } else if ((sh.sh_type == SHT_PROGBITS) &&
636 (sh.sh_flags & SHF_EXECINSTR) &&
637 (data->d_size > 0)) {
638 err = bpf_object__add_program(obj, data->d_buf,
639 data->d_size, name, idx);
640 if (err) {
6371ca3b
WN
641 char errmsg[STRERR_BUFSIZE];
642
a5b8bd47
WN
643 strerror_r(-err, errmsg, sizeof(errmsg));
644 pr_warning("failed to alloc program %s (%s): %s",
645 name, obj->path, errmsg);
646 }
b62f06e8
WN
647 } else if (sh.sh_type == SHT_REL) {
648 void *reloc = obj->efile.reloc;
649 int nr_reloc = obj->efile.nr_reloc + 1;
650
651 reloc = realloc(reloc,
652 sizeof(*obj->efile.reloc) * nr_reloc);
653 if (!reloc) {
654 pr_warning("realloc failed\n");
655 err = -ENOMEM;
656 } else {
657 int n = nr_reloc - 1;
658
659 obj->efile.reloc = reloc;
660 obj->efile.nr_reloc = nr_reloc;
661
662 obj->efile.reloc[n].shdr = sh;
663 obj->efile.reloc[n].data = data;
664 }
bec7d68c 665 }
cb1e5e96
WN
666 if (err)
667 goto out;
29603665 668 }
561bbcca
WN
669
670 if (maps_shndx >= 0)
973170e6 671 err = bpf_object__init_maps_name(obj, maps_shndx);
29603665
WN
672out:
673 return err;
674}
675
34090915
WN
676static struct bpf_program *
677bpf_object__find_prog_by_idx(struct bpf_object *obj, int idx)
678{
679 struct bpf_program *prog;
680 size_t i;
681
682 for (i = 0; i < obj->nr_programs; i++) {
683 prog = &obj->programs[i];
684 if (prog->idx == idx)
685 return prog;
686 }
687 return NULL;
688}
689
690static int
691bpf_program__collect_reloc(struct bpf_program *prog,
692 size_t nr_maps, GElf_Shdr *shdr,
693 Elf_Data *data, Elf_Data *symbols)
694{
695 int i, nrels;
696
697 pr_debug("collecting relocating info for: '%s'\n",
698 prog->section_name);
699 nrels = shdr->sh_size / shdr->sh_entsize;
700
701 prog->reloc_desc = malloc(sizeof(*prog->reloc_desc) * nrels);
702 if (!prog->reloc_desc) {
703 pr_warning("failed to alloc memory in relocation\n");
704 return -ENOMEM;
705 }
706 prog->nr_reloc = nrels;
707
708 for (i = 0; i < nrels; i++) {
709 GElf_Sym sym;
710 GElf_Rel rel;
711 unsigned int insn_idx;
712 struct bpf_insn *insns = prog->insns;
713 size_t map_idx;
714
715 if (!gelf_getrel(data, i, &rel)) {
716 pr_warning("relocation: failed to get %d reloc\n", i);
6371ca3b 717 return -LIBBPF_ERRNO__FORMAT;
34090915
WN
718 }
719
720 insn_idx = rel.r_offset / sizeof(struct bpf_insn);
721 pr_debug("relocation: insn_idx=%u\n", insn_idx);
722
723 if (!gelf_getsym(symbols,
724 GELF_R_SYM(rel.r_info),
725 &sym)) {
726 pr_warning("relocation: symbol %"PRIx64" not found\n",
727 GELF_R_SYM(rel.r_info));
6371ca3b 728 return -LIBBPF_ERRNO__FORMAT;
34090915
WN
729 }
730
731 if (insns[insn_idx].code != (BPF_LD | BPF_IMM | BPF_DW)) {
732 pr_warning("bpf: relocation: invalid relo for insns[%d].code 0x%x\n",
733 insn_idx, insns[insn_idx].code);
6371ca3b 734 return -LIBBPF_ERRNO__RELOC;
34090915
WN
735 }
736
737 map_idx = sym.st_value / sizeof(struct bpf_map_def);
738 if (map_idx >= nr_maps) {
739 pr_warning("bpf relocation: map_idx %d large than %d\n",
740 (int)map_idx, (int)nr_maps - 1);
6371ca3b 741 return -LIBBPF_ERRNO__RELOC;
34090915
WN
742 }
743
744 prog->reloc_desc[i].insn_idx = insn_idx;
745 prog->reloc_desc[i].map_idx = map_idx;
746 }
747 return 0;
748}
749
52d3352e
WN
750static int
751bpf_object__create_maps(struct bpf_object *obj)
752{
753 unsigned int i;
52d3352e 754
9d759a9b
WN
755 for (i = 0; i < obj->nr_maps; i++) {
756 struct bpf_map_def *def = &obj->maps[i].def;
757 int *pfd = &obj->maps[i].fd;
52d3352e 758
9d759a9b
WN
759 *pfd = bpf_create_map(def->type,
760 def->key_size,
761 def->value_size,
762 def->max_entries);
52d3352e
WN
763 if (*pfd < 0) {
764 size_t j;
765 int err = *pfd;
766
767 pr_warning("failed to create map: %s\n",
768 strerror(errno));
769 for (j = 0; j < i; j++)
9d759a9b 770 zclose(obj->maps[j].fd);
52d3352e
WN
771 return err;
772 }
773 pr_debug("create map: fd=%d\n", *pfd);
52d3352e
WN
774 }
775
52d3352e
WN
776 return 0;
777}
778
8a47a6c5 779static int
9d759a9b 780bpf_program__relocate(struct bpf_program *prog, struct bpf_object *obj)
8a47a6c5
WN
781{
782 int i;
783
784 if (!prog || !prog->reloc_desc)
785 return 0;
786
787 for (i = 0; i < prog->nr_reloc; i++) {
788 int insn_idx, map_idx;
789 struct bpf_insn *insns = prog->insns;
790
791 insn_idx = prog->reloc_desc[i].insn_idx;
792 map_idx = prog->reloc_desc[i].map_idx;
793
794 if (insn_idx >= (int)prog->insns_cnt) {
795 pr_warning("relocation out of range: '%s'\n",
796 prog->section_name);
6371ca3b 797 return -LIBBPF_ERRNO__RELOC;
8a47a6c5
WN
798 }
799 insns[insn_idx].src_reg = BPF_PSEUDO_MAP_FD;
9d759a9b 800 insns[insn_idx].imm = obj->maps[map_idx].fd;
8a47a6c5
WN
801 }
802
803 zfree(&prog->reloc_desc);
804 prog->nr_reloc = 0;
805 return 0;
806}
807
808
809static int
810bpf_object__relocate(struct bpf_object *obj)
811{
812 struct bpf_program *prog;
813 size_t i;
814 int err;
815
816 for (i = 0; i < obj->nr_programs; i++) {
817 prog = &obj->programs[i];
818
9d759a9b 819 err = bpf_program__relocate(prog, obj);
8a47a6c5
WN
820 if (err) {
821 pr_warning("failed to relocate '%s'\n",
822 prog->section_name);
823 return err;
824 }
825 }
826 return 0;
827}
828
34090915
WN
829static int bpf_object__collect_reloc(struct bpf_object *obj)
830{
831 int i, err;
832
833 if (!obj_elf_valid(obj)) {
834 pr_warning("Internal error: elf object is closed\n");
6371ca3b 835 return -LIBBPF_ERRNO__INTERNAL;
34090915
WN
836 }
837
838 for (i = 0; i < obj->efile.nr_reloc; i++) {
839 GElf_Shdr *shdr = &obj->efile.reloc[i].shdr;
840 Elf_Data *data = obj->efile.reloc[i].data;
841 int idx = shdr->sh_info;
842 struct bpf_program *prog;
9d759a9b 843 size_t nr_maps = obj->nr_maps;
34090915
WN
844
845 if (shdr->sh_type != SHT_REL) {
846 pr_warning("internal error at %d\n", __LINE__);
6371ca3b 847 return -LIBBPF_ERRNO__INTERNAL;
34090915
WN
848 }
849
850 prog = bpf_object__find_prog_by_idx(obj, idx);
851 if (!prog) {
852 pr_warning("relocation failed: no %d section\n",
853 idx);
6371ca3b 854 return -LIBBPF_ERRNO__RELOC;
34090915
WN
855 }
856
857 err = bpf_program__collect_reloc(prog, nr_maps,
858 shdr, data,
859 obj->efile.symbols);
860 if (err)
6371ca3b 861 return err;
34090915
WN
862 }
863 return 0;
864}
865
55cffde2
WN
866static int
867load_program(struct bpf_insn *insns, int insns_cnt,
868 char *license, u32 kern_version, int *pfd)
869{
870 int ret;
871 char *log_buf;
872
873 if (!insns || !insns_cnt)
874 return -EINVAL;
875
876 log_buf = malloc(BPF_LOG_BUF_SIZE);
877 if (!log_buf)
878 pr_warning("Alloc log buffer for bpf loader error, continue without log\n");
879
880 ret = bpf_load_program(BPF_PROG_TYPE_KPROBE, insns,
881 insns_cnt, license, kern_version,
882 log_buf, BPF_LOG_BUF_SIZE);
883
884 if (ret >= 0) {
885 *pfd = ret;
886 ret = 0;
887 goto out;
888 }
889
6371ca3b 890 ret = -LIBBPF_ERRNO__LOAD;
55cffde2
WN
891 pr_warning("load bpf program failed: %s\n", strerror(errno));
892
6371ca3b
WN
893 if (log_buf && log_buf[0] != '\0') {
894 ret = -LIBBPF_ERRNO__VERIFY;
55cffde2
WN
895 pr_warning("-- BEGIN DUMP LOG ---\n");
896 pr_warning("\n%s\n", log_buf);
897 pr_warning("-- END LOG --\n");
6371ca3b
WN
898 } else {
899 if (insns_cnt >= BPF_MAXINSNS) {
900 pr_warning("Program too large (%d insns), at most %d insns\n",
901 insns_cnt, BPF_MAXINSNS);
902 ret = -LIBBPF_ERRNO__PROG2BIG;
903 } else if (log_buf) {
904 pr_warning("log buffer is empty\n");
905 ret = -LIBBPF_ERRNO__KVER;
906 }
55cffde2
WN
907 }
908
909out:
910 free(log_buf);
911 return ret;
912}
913
914static int
915bpf_program__load(struct bpf_program *prog,
916 char *license, u32 kern_version)
917{
b580563e 918 int err = 0, fd, i;
55cffde2 919
b580563e
WN
920 if (prog->instances.nr < 0 || !prog->instances.fds) {
921 if (prog->preprocessor) {
922 pr_warning("Internal error: can't load program '%s'\n",
923 prog->section_name);
924 return -LIBBPF_ERRNO__INTERNAL;
925 }
55cffde2 926
b580563e
WN
927 prog->instances.fds = malloc(sizeof(int));
928 if (!prog->instances.fds) {
929 pr_warning("Not enough memory for BPF fds\n");
930 return -ENOMEM;
931 }
932 prog->instances.nr = 1;
933 prog->instances.fds[0] = -1;
934 }
935
936 if (!prog->preprocessor) {
937 if (prog->instances.nr != 1) {
938 pr_warning("Program '%s' is inconsistent: nr(%d) != 1\n",
939 prog->section_name, prog->instances.nr);
940 }
941 err = load_program(prog->insns, prog->insns_cnt,
942 license, kern_version, &fd);
943 if (!err)
944 prog->instances.fds[0] = fd;
945 goto out;
946 }
947
948 for (i = 0; i < prog->instances.nr; i++) {
949 struct bpf_prog_prep_result result;
950 bpf_program_prep_t preprocessor = prog->preprocessor;
951
952 bzero(&result, sizeof(result));
953 err = preprocessor(prog, i, prog->insns,
954 prog->insns_cnt, &result);
955 if (err) {
956 pr_warning("Preprocessing the %dth instance of program '%s' failed\n",
957 i, prog->section_name);
958 goto out;
959 }
960
961 if (!result.new_insn_ptr || !result.new_insn_cnt) {
962 pr_debug("Skip loading the %dth instance of program '%s'\n",
963 i, prog->section_name);
964 prog->instances.fds[i] = -1;
965 if (result.pfd)
966 *result.pfd = -1;
967 continue;
968 }
969
970 err = load_program(result.new_insn_ptr,
971 result.new_insn_cnt,
972 license, kern_version, &fd);
973
974 if (err) {
975 pr_warning("Loading the %dth instance of program '%s' failed\n",
976 i, prog->section_name);
977 goto out;
978 }
979
980 if (result.pfd)
981 *result.pfd = fd;
982 prog->instances.fds[i] = fd;
983 }
984out:
55cffde2
WN
985 if (err)
986 pr_warning("failed to load program '%s'\n",
987 prog->section_name);
988 zfree(&prog->insns);
989 prog->insns_cnt = 0;
990 return err;
991}
992
993static int
994bpf_object__load_progs(struct bpf_object *obj)
995{
996 size_t i;
997 int err;
998
999 for (i = 0; i < obj->nr_programs; i++) {
1000 err = bpf_program__load(&obj->programs[i],
1001 obj->license,
1002 obj->kern_version);
1003 if (err)
1004 return err;
1005 }
1006 return 0;
1007}
1008
cb1e5e96
WN
1009static int bpf_object__validate(struct bpf_object *obj)
1010{
1011 if (obj->kern_version == 0) {
1012 pr_warning("%s doesn't provide kernel version\n",
1013 obj->path);
6371ca3b 1014 return -LIBBPF_ERRNO__KVERSION;
cb1e5e96
WN
1015 }
1016 return 0;
1017}
1018
1a5e3fb1 1019static struct bpf_object *
6c956392 1020__bpf_object__open(const char *path, void *obj_buf, size_t obj_buf_sz)
1a5e3fb1
WN
1021{
1022 struct bpf_object *obj;
6371ca3b 1023 int err;
1a5e3fb1
WN
1024
1025 if (elf_version(EV_CURRENT) == EV_NONE) {
1026 pr_warning("failed to init libelf for %s\n", path);
6371ca3b 1027 return ERR_PTR(-LIBBPF_ERRNO__LIBELF);
1a5e3fb1
WN
1028 }
1029
6c956392 1030 obj = bpf_object__new(path, obj_buf, obj_buf_sz);
6371ca3b
WN
1031 if (IS_ERR(obj))
1032 return obj;
1a5e3fb1 1033
6371ca3b
WN
1034 CHECK_ERR(bpf_object__elf_init(obj), err, out);
1035 CHECK_ERR(bpf_object__check_endianness(obj), err, out);
1036 CHECK_ERR(bpf_object__elf_collect(obj), err, out);
1037 CHECK_ERR(bpf_object__collect_reloc(obj), err, out);
1038 CHECK_ERR(bpf_object__validate(obj), err, out);
1a5e3fb1
WN
1039
1040 bpf_object__elf_finish(obj);
1041 return obj;
1042out:
1043 bpf_object__close(obj);
6371ca3b 1044 return ERR_PTR(err);
1a5e3fb1
WN
1045}
1046
1047struct bpf_object *bpf_object__open(const char *path)
1048{
1049 /* param validation */
1050 if (!path)
1051 return NULL;
1052
1053 pr_debug("loading %s\n", path);
1054
6c956392
WN
1055 return __bpf_object__open(path, NULL, 0);
1056}
1057
1058struct bpf_object *bpf_object__open_buffer(void *obj_buf,
acf860ae
WN
1059 size_t obj_buf_sz,
1060 const char *name)
6c956392 1061{
acf860ae
WN
1062 char tmp_name[64];
1063
6c956392
WN
1064 /* param validation */
1065 if (!obj_buf || obj_buf_sz <= 0)
1066 return NULL;
1067
acf860ae
WN
1068 if (!name) {
1069 snprintf(tmp_name, sizeof(tmp_name), "%lx-%lx",
1070 (unsigned long)obj_buf,
1071 (unsigned long)obj_buf_sz);
1072 tmp_name[sizeof(tmp_name) - 1] = '\0';
1073 name = tmp_name;
1074 }
1075 pr_debug("loading object '%s' from buffer\n",
1076 name);
6c956392 1077
acf860ae 1078 return __bpf_object__open(name, obj_buf, obj_buf_sz);
1a5e3fb1
WN
1079}
1080
52d3352e
WN
1081int bpf_object__unload(struct bpf_object *obj)
1082{
1083 size_t i;
1084
1085 if (!obj)
1086 return -EINVAL;
1087
9d759a9b
WN
1088 for (i = 0; i < obj->nr_maps; i++)
1089 zclose(obj->maps[i].fd);
52d3352e 1090
55cffde2
WN
1091 for (i = 0; i < obj->nr_programs; i++)
1092 bpf_program__unload(&obj->programs[i]);
1093
52d3352e
WN
1094 return 0;
1095}
1096
1097int bpf_object__load(struct bpf_object *obj)
1098{
6371ca3b
WN
1099 int err;
1100
52d3352e
WN
1101 if (!obj)
1102 return -EINVAL;
1103
1104 if (obj->loaded) {
1105 pr_warning("object should not be loaded twice\n");
1106 return -EINVAL;
1107 }
1108
1109 obj->loaded = true;
6371ca3b
WN
1110
1111 CHECK_ERR(bpf_object__create_maps(obj), err, out);
1112 CHECK_ERR(bpf_object__relocate(obj), err, out);
1113 CHECK_ERR(bpf_object__load_progs(obj), err, out);
52d3352e
WN
1114
1115 return 0;
1116out:
1117 bpf_object__unload(obj);
1118 pr_warning("failed to load object '%s'\n", obj->path);
6371ca3b 1119 return err;
52d3352e
WN
1120}
1121
1a5e3fb1
WN
1122void bpf_object__close(struct bpf_object *obj)
1123{
a5b8bd47
WN
1124 size_t i;
1125
1a5e3fb1
WN
1126 if (!obj)
1127 return;
1128
1129 bpf_object__elf_finish(obj);
52d3352e 1130 bpf_object__unload(obj);
1a5e3fb1 1131
9d759a9b 1132 for (i = 0; i < obj->nr_maps; i++) {
561bbcca 1133 zfree(&obj->maps[i].name);
9d759a9b
WN
1134 if (obj->maps[i].clear_priv)
1135 obj->maps[i].clear_priv(&obj->maps[i],
1136 obj->maps[i].priv);
1137 obj->maps[i].priv = NULL;
1138 obj->maps[i].clear_priv = NULL;
1139 }
1140 zfree(&obj->maps);
1141 obj->nr_maps = 0;
a5b8bd47
WN
1142
1143 if (obj->programs && obj->nr_programs) {
1144 for (i = 0; i < obj->nr_programs; i++)
1145 bpf_program__exit(&obj->programs[i]);
1146 }
1147 zfree(&obj->programs);
1148
9a208eff 1149 list_del(&obj->list);
1a5e3fb1
WN
1150 free(obj);
1151}
aa9b1ac3 1152
9a208eff
WN
1153struct bpf_object *
1154bpf_object__next(struct bpf_object *prev)
1155{
1156 struct bpf_object *next;
1157
1158 if (!prev)
1159 next = list_first_entry(&bpf_objects_list,
1160 struct bpf_object,
1161 list);
1162 else
1163 next = list_next_entry(prev, list);
1164
1165 /* Empty list is noticed here so don't need checking on entry. */
1166 if (&next->list == &bpf_objects_list)
1167 return NULL;
1168
1169 return next;
1170}
1171
acf860ae
WN
1172const char *
1173bpf_object__get_name(struct bpf_object *obj)
1174{
1175 if (!obj)
6371ca3b 1176 return ERR_PTR(-EINVAL);
acf860ae
WN
1177 return obj->path;
1178}
1179
45825d8a
WN
1180unsigned int
1181bpf_object__get_kversion(struct bpf_object *obj)
1182{
1183 if (!obj)
1184 return 0;
1185 return obj->kern_version;
1186}
1187
aa9b1ac3
WN
1188struct bpf_program *
1189bpf_program__next(struct bpf_program *prev, struct bpf_object *obj)
1190{
1191 size_t idx;
1192
1193 if (!obj->programs)
1194 return NULL;
1195 /* First handler */
1196 if (prev == NULL)
1197 return &obj->programs[0];
1198
1199 if (prev->obj != obj) {
1200 pr_warning("error: program handler doesn't match object\n");
1201 return NULL;
1202 }
1203
1204 idx = (prev - obj->programs) + 1;
1205 if (idx >= obj->nr_programs)
1206 return NULL;
1207 return &obj->programs[idx];
1208}
1209
1210int bpf_program__set_private(struct bpf_program *prog,
1211 void *priv,
1212 bpf_program_clear_priv_t clear_priv)
1213{
1214 if (prog->priv && prog->clear_priv)
1215 prog->clear_priv(prog, prog->priv);
1216
1217 prog->priv = priv;
1218 prog->clear_priv = clear_priv;
1219 return 0;
1220}
1221
1222int bpf_program__get_private(struct bpf_program *prog, void **ppriv)
1223{
1224 *ppriv = prog->priv;
1225 return 0;
1226}
1227
715f8db9 1228const char *bpf_program__title(struct bpf_program *prog, bool needs_copy)
aa9b1ac3
WN
1229{
1230 const char *title;
1231
1232 title = prog->section_name;
715f8db9 1233 if (needs_copy) {
aa9b1ac3
WN
1234 title = strdup(title);
1235 if (!title) {
1236 pr_warning("failed to strdup program title\n");
6371ca3b 1237 return ERR_PTR(-ENOMEM);
aa9b1ac3
WN
1238 }
1239 }
1240
1241 return title;
1242}
1243
1244int bpf_program__fd(struct bpf_program *prog)
1245{
b580563e
WN
1246 return bpf_program__nth_fd(prog, 0);
1247}
1248
1249int bpf_program__set_prep(struct bpf_program *prog, int nr_instances,
1250 bpf_program_prep_t prep)
1251{
1252 int *instances_fds;
1253
1254 if (nr_instances <= 0 || !prep)
1255 return -EINVAL;
1256
1257 if (prog->instances.nr > 0 || prog->instances.fds) {
1258 pr_warning("Can't set pre-processor after loading\n");
1259 return -EINVAL;
1260 }
1261
1262 instances_fds = malloc(sizeof(int) * nr_instances);
1263 if (!instances_fds) {
1264 pr_warning("alloc memory failed for fds\n");
1265 return -ENOMEM;
1266 }
1267
1268 /* fill all fd with -1 */
1269 memset(instances_fds, -1, sizeof(int) * nr_instances);
1270
1271 prog->instances.nr = nr_instances;
1272 prog->instances.fds = instances_fds;
1273 prog->preprocessor = prep;
1274 return 0;
1275}
1276
1277int bpf_program__nth_fd(struct bpf_program *prog, int n)
1278{
1279 int fd;
1280
1281 if (n >= prog->instances.nr || n < 0) {
1282 pr_warning("Can't get the %dth fd from program %s: only %d instances\n",
1283 n, prog->section_name, prog->instances.nr);
1284 return -EINVAL;
1285 }
1286
1287 fd = prog->instances.fds[n];
1288 if (fd < 0) {
1289 pr_warning("%dth instance of program '%s' is invalid\n",
1290 n, prog->section_name);
1291 return -ENOENT;
1292 }
1293
1294 return fd;
aa9b1ac3 1295}
9d759a9b
WN
1296
1297int bpf_map__get_fd(struct bpf_map *map)
1298{
1299 if (!map)
1300 return -EINVAL;
1301
1302 return map->fd;
1303}
1304
1305int bpf_map__get_def(struct bpf_map *map, struct bpf_map_def *pdef)
1306{
1307 if (!map || !pdef)
1308 return -EINVAL;
1309
1310 *pdef = map->def;
1311 return 0;
1312}
1313
561bbcca
WN
1314const char *bpf_map__get_name(struct bpf_map *map)
1315{
1316 if (!map)
1317 return NULL;
1318 return map->name;
1319}
1320
9d759a9b
WN
1321int bpf_map__set_private(struct bpf_map *map, void *priv,
1322 bpf_map_clear_priv_t clear_priv)
1323{
1324 if (!map)
1325 return -EINVAL;
1326
1327 if (map->priv) {
1328 if (map->clear_priv)
1329 map->clear_priv(map, map->priv);
1330 }
1331
1332 map->priv = priv;
1333 map->clear_priv = clear_priv;
1334 return 0;
1335}
1336
1337int bpf_map__get_private(struct bpf_map *map, void **ppriv)
1338{
1339 if (!map)
1340 return -EINVAL;
1341
1342 if (ppriv)
1343 *ppriv = map->priv;
1344 return 0;
1345}
1346
1347struct bpf_map *
1348bpf_map__next(struct bpf_map *prev, struct bpf_object *obj)
1349{
1350 size_t idx;
1351 struct bpf_map *s, *e;
1352
1353 if (!obj || !obj->maps)
1354 return NULL;
1355
1356 s = obj->maps;
1357 e = obj->maps + obj->nr_maps;
1358
1359 if (prev == NULL)
1360 return s;
1361
1362 if ((prev < s) || (prev >= e)) {
1363 pr_warning("error in %s: map handler doesn't belong to object\n",
1364 __func__);
1365 return NULL;
1366 }
1367
1368 idx = (prev - obj->maps) + 1;
1369 if (idx >= obj->nr_maps)
1370 return NULL;
1371 return &obj->maps[idx];
1372}
561bbcca
WN
1373
1374struct bpf_map *
1375bpf_object__get_map_by_name(struct bpf_object *obj, const char *name)
1376{
1377 struct bpf_map *pos;
1378
1379 bpf_map__for_each(pos, obj) {
973170e6 1380 if (pos->name && !strcmp(pos->name, name))
561bbcca
WN
1381 return pos;
1382 }
1383 return NULL;
1384}