]> git.proxmox.com Git - mirror_iproute2.git/blame - lib/bpf.c
man: add documentation for json and pretty flags
[mirror_iproute2.git] / lib / bpf.c
CommitLineData
1d129d19 1/*
e4225669 2 * bpf.c BPF common code
1d129d19
JP
3 *
4 * This program is free software; you can distribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
8 *
e4225669 9 * Authors: Daniel Borkmann <daniel@iogearbox.net>
1d129d19 10 * Jiri Pirko <jiri@resnulli.us>
e4225669 11 * Alexei Starovoitov <ast@kernel.org>
1d129d19
JP
12 */
13
14#include <stdio.h>
15#include <stdlib.h>
16#include <unistd.h>
17#include <string.h>
18#include <stdbool.h>
473d7840 19#include <stdint.h>
1d129d19 20#include <errno.h>
11c39b5e
DB
21#include <fcntl.h>
22#include <stdarg.h>
5c5a0f3d 23#include <limits.h>
e4225669 24#include <assert.h>
1d129d19 25
11c39b5e
DB
26#ifdef HAVE_ELF
27#include <libelf.h>
28#include <gelf.h>
29#endif
30
32e93fb7
DB
31#include <sys/types.h>
32#include <sys/stat.h>
33#include <sys/un.h>
34#include <sys/vfs.h>
35#include <sys/mount.h>
36#include <sys/syscall.h>
37#include <sys/sendfile.h>
38#include <sys/resource.h>
39
8187b012
DB
40#include <arpa/inet.h>
41
1d129d19 42#include "utils.h"
bc2d4d83 43#include "json_print.h"
6256f8c9 44
e4225669 45#include "bpf_util.h"
6256f8c9
DB
46#include "bpf_elf.h"
47#include "bpf_scm.h"
48
e4225669
DB
49struct bpf_prog_meta {
50 const char *type;
51 const char *subdir;
52 const char *section;
53 bool may_uds_export;
54};
1d129d19 55
e4225669
DB
56static const enum bpf_prog_type __bpf_types[] = {
57 BPF_PROG_TYPE_SCHED_CLS,
58 BPF_PROG_TYPE_SCHED_ACT,
c7272ca7 59 BPF_PROG_TYPE_XDP,
b15f440e
TG
60 BPF_PROG_TYPE_LWT_IN,
61 BPF_PROG_TYPE_LWT_OUT,
62 BPF_PROG_TYPE_LWT_XMIT,
e4225669 63};
67584e3a 64
e4225669
DB
65static const struct bpf_prog_meta __bpf_prog_meta[] = {
66 [BPF_PROG_TYPE_SCHED_CLS] = {
67 .type = "cls",
68 .subdir = "tc",
69 .section = ELF_SECTION_CLASSIFIER,
70 .may_uds_export = true,
71 },
72 [BPF_PROG_TYPE_SCHED_ACT] = {
73 .type = "act",
74 .subdir = "tc",
75 .section = ELF_SECTION_ACTION,
76 .may_uds_export = true,
77 },
c7272ca7
DB
78 [BPF_PROG_TYPE_XDP] = {
79 .type = "xdp",
80 .subdir = "xdp",
81 .section = ELF_SECTION_PROG,
82 },
b15f440e
TG
83 [BPF_PROG_TYPE_LWT_IN] = {
84 .type = "lwt_in",
85 .subdir = "ip",
86 .section = ELF_SECTION_PROG,
87 },
88 [BPF_PROG_TYPE_LWT_OUT] = {
89 .type = "lwt_out",
90 .subdir = "ip",
91 .section = ELF_SECTION_PROG,
92 },
93 [BPF_PROG_TYPE_LWT_XMIT] = {
94 .type = "lwt_xmit",
95 .subdir = "ip",
96 .section = ELF_SECTION_PROG,
97 },
e4225669
DB
98};
99
100static const char *bpf_prog_to_subdir(enum bpf_prog_type type)
101{
102 assert(type < ARRAY_SIZE(__bpf_prog_meta) &&
103 __bpf_prog_meta[type].subdir);
104 return __bpf_prog_meta[type].subdir;
105}
106
107const char *bpf_prog_to_default_section(enum bpf_prog_type type)
108{
109 assert(type < ARRAY_SIZE(__bpf_prog_meta) &&
110 __bpf_prog_meta[type].section);
111 return __bpf_prog_meta[type].section;
112}
e77fa41d 113
32e93fb7
DB
114#ifdef HAVE_ELF
115static int bpf_obj_open(const char *path, enum bpf_prog_type type,
65fdae3d 116 const char *sec, __u32 ifindex, bool verbose);
32e93fb7
DB
117#else
118static int bpf_obj_open(const char *path, enum bpf_prog_type type,
65fdae3d 119 const char *sec, __u32 ifindex, bool verbose)
32e93fb7
DB
120{
121 fprintf(stderr, "No ELF library support compiled in.\n");
122 errno = ENOSYS;
123 return -1;
124}
125#endif
126
127static inline __u64 bpf_ptr_to_u64(const void *ptr)
128{
129 return (__u64)(unsigned long)ptr;
130}
131
132static int bpf(int cmd, union bpf_attr *attr, unsigned int size)
133{
134#ifdef __NR_bpf
135 return syscall(__NR_bpf, cmd, attr, size);
136#else
137 fprintf(stderr, "No bpf syscall, kernel headers too old?\n");
138 errno = ENOSYS;
139 return -1;
140#endif
141}
142
91d88eeb
DB
143static int bpf_map_update(int fd, const void *key, const void *value,
144 uint64_t flags)
32e93fb7 145{
d17b136f 146 union bpf_attr attr = {};
67584e3a 147
67584e3a
ND
148 attr.map_fd = fd;
149 attr.key = bpf_ptr_to_u64(key);
150 attr.value = bpf_ptr_to_u64(value);
151 attr.flags = flags;
32e93fb7 152
91d88eeb 153 return bpf(BPF_MAP_UPDATE_ELEM, &attr, sizeof(attr));
32e93fb7
DB
154}
155
779525cd
DB
156static int bpf_prog_fd_by_id(uint32_t id)
157{
158 union bpf_attr attr = {};
159
160 attr.prog_id = id;
161
162 return bpf(BPF_PROG_GET_FD_BY_ID, &attr, sizeof(attr));
163}
164
165static int bpf_prog_info_by_fd(int fd, struct bpf_prog_info *info,
166 uint32_t *info_len)
167{
168 union bpf_attr attr = {};
169 int ret;
170
171 attr.info.bpf_fd = fd;
172 attr.info.info = bpf_ptr_to_u64(info);
173 attr.info.info_len = *info_len;
174
175 *info_len = 0;
176 ret = bpf(BPF_OBJ_GET_INFO_BY_FD, &attr, sizeof(attr));
177 if (!ret)
178 *info_len = attr.info.info_len;
179
180 return ret;
181}
182
a0b5b7cf 183int bpf_dump_prog_info(FILE *f, uint32_t id)
779525cd
DB
184{
185 struct bpf_prog_info info = {};
186 uint32_t len = sizeof(info);
a0b5b7cf
DB
187 int fd, ret, dump_ok = 0;
188 SPRINT_BUF(tmp);
779525cd 189
bc2d4d83
DB
190 open_json_object("prog");
191 print_uint(PRINT_ANY, "id", "id %u ", id);
779525cd
DB
192
193 fd = bpf_prog_fd_by_id(id);
194 if (fd < 0)
bc2d4d83 195 goto out;
779525cd
DB
196
197 ret = bpf_prog_info_by_fd(fd, &info, &len);
198 if (!ret && len) {
bc2d4d83
DB
199 int jited = !!info.jited_prog_len;
200
201 print_string(PRINT_ANY, "tag", "tag %s ",
202 hexstring_n2a(info.tag, sizeof(info.tag),
203 tmp, sizeof(tmp)));
204 print_uint(PRINT_JSON, "jited", NULL, jited);
205 if (jited && !is_json_context())
779525cd 206 fprintf(f, "jited ");
a0b5b7cf 207 dump_ok = 1;
779525cd
DB
208 }
209
210 close(fd);
bc2d4d83
DB
211out:
212 close_json_object();
a0b5b7cf 213 return dump_ok;
779525cd
DB
214}
215
32e93fb7
DB
216static int bpf_parse_string(char *arg, bool from_file, __u16 *bpf_len,
217 char **bpf_string, bool *need_release,
218 const char separator)
1d129d19
JP
219{
220 char sp;
221
222 if (from_file) {
223 size_t tmp_len, op_len = sizeof("65535 255 255 4294967295,");
7c87c7fe 224 char *tmp_string, *pos, c_prev = ' ';
1d129d19 225 FILE *fp;
7c87c7fe 226 int c;
1d129d19
JP
227
228 tmp_len = sizeof("4096,") + BPF_MAXINSNS * op_len;
3da3ebfc 229 tmp_string = pos = calloc(1, tmp_len);
1d129d19
JP
230 if (tmp_string == NULL)
231 return -ENOMEM;
232
1d129d19
JP
233 fp = fopen(arg, "r");
234 if (fp == NULL) {
235 perror("Cannot fopen");
236 free(tmp_string);
237 return -ENOENT;
238 }
239
3da3ebfc
PS
240 while ((c = fgetc(fp)) != EOF) {
241 switch (c) {
242 case '\n':
243 if (c_prev != ',')
244 *(pos++) = ',';
7c87c7fe 245 c_prev = ',';
3da3ebfc
PS
246 break;
247 case ' ':
248 case '\t':
249 if (c_prev != ' ')
250 *(pos++) = c;
7c87c7fe 251 c_prev = ' ';
3da3ebfc
PS
252 break;
253 default:
254 *(pos++) = c;
7c87c7fe 255 c_prev = c;
3da3ebfc
PS
256 }
257 if (pos - tmp_string == tmp_len)
258 break;
3da3ebfc
PS
259 }
260
261 if (!feof(fp)) {
1d129d19
JP
262 free(tmp_string);
263 fclose(fp);
3da3ebfc 264 return -E2BIG;
1d129d19
JP
265 }
266
267 fclose(fp);
3da3ebfc 268 *pos = 0;
e4225669 269
1d129d19
JP
270 *need_release = true;
271 *bpf_string = tmp_string;
272 } else {
273 *need_release = false;
274 *bpf_string = arg;
275 }
276
277 if (sscanf(*bpf_string, "%hu%c", bpf_len, &sp) != 2 ||
278 sp != separator) {
279 if (*need_release)
280 free(*bpf_string);
281 return -EINVAL;
282 }
283
284 return 0;
285}
286
32e93fb7
DB
287static int bpf_ops_parse(int argc, char **argv, struct sock_filter *bpf_ops,
288 bool from_file)
1d129d19
JP
289{
290 char *bpf_string, *token, separator = ',';
291 int ret = 0, i = 0;
292 bool need_release;
293 __u16 bpf_len = 0;
294
295 if (argc < 1)
296 return -EINVAL;
297 if (bpf_parse_string(argv[0], from_file, &bpf_len, &bpf_string,
298 &need_release, separator))
299 return -EINVAL;
300 if (bpf_len == 0 || bpf_len > BPF_MAXINSNS) {
301 ret = -EINVAL;
302 goto out;
303 }
304
305 token = bpf_string;
306 while ((token = strchr(token, separator)) && (++token)[0]) {
307 if (i >= bpf_len) {
32a121cb 308 fprintf(stderr, "Real program length exceeds encoded length parameter!\n");
1d129d19
JP
309 ret = -EINVAL;
310 goto out;
311 }
312
313 if (sscanf(token, "%hu %hhu %hhu %u,",
314 &bpf_ops[i].code, &bpf_ops[i].jt,
315 &bpf_ops[i].jf, &bpf_ops[i].k) != 4) {
316 fprintf(stderr, "Error at instruction %d!\n", i);
317 ret = -EINVAL;
318 goto out;
319 }
320
321 i++;
322 }
323
324 if (i != bpf_len) {
afc1a200 325 fprintf(stderr, "Parsed program length is less than encoded length parameter!\n");
1d129d19
JP
326 ret = -EINVAL;
327 goto out;
328 }
329 ret = bpf_len;
1d129d19
JP
330out:
331 if (need_release)
332 free(bpf_string);
333
334 return ret;
335}
336
337void bpf_print_ops(FILE *f, struct rtattr *bpf_ops, __u16 len)
338{
d896797c 339 struct sock_filter *ops = RTA_DATA(bpf_ops);
1d129d19
JP
340 int i;
341
342 if (len == 0)
343 return;
344
345 fprintf(f, "bytecode \'%u,", len);
346
347 for (i = 0; i < len - 1; i++)
348 fprintf(f, "%hu %hhu %hhu %u,", ops[i].code, ops[i].jt,
349 ops[i].jf, ops[i].k);
350
6256f8c9 351 fprintf(f, "%hu %hhu %hhu %u\'", ops[i].code, ops[i].jt,
1d129d19
JP
352 ops[i].jf, ops[i].k);
353}
11c39b5e 354
afc1a200
DB
355static void bpf_map_pin_report(const struct bpf_elf_map *pin,
356 const struct bpf_elf_map *obj)
357{
358 fprintf(stderr, "Map specification differs from pinned file!\n");
359
360 if (obj->type != pin->type)
361 fprintf(stderr, " - Type: %u (obj) != %u (pin)\n",
362 obj->type, pin->type);
363 if (obj->size_key != pin->size_key)
364 fprintf(stderr, " - Size key: %u (obj) != %u (pin)\n",
365 obj->size_key, pin->size_key);
366 if (obj->size_value != pin->size_value)
367 fprintf(stderr, " - Size value: %u (obj) != %u (pin)\n",
368 obj->size_value, pin->size_value);
369 if (obj->max_elem != pin->max_elem)
370 fprintf(stderr, " - Max elems: %u (obj) != %u (pin)\n",
371 obj->max_elem, pin->max_elem);
4dd3f50a
DB
372 if (obj->flags != pin->flags)
373 fprintf(stderr, " - Flags: %#x (obj) != %#x (pin)\n",
374 obj->flags, pin->flags);
afc1a200
DB
375
376 fprintf(stderr, "\n");
377}
378
ecb05c0f
DB
379struct bpf_prog_data {
380 unsigned int type;
381 unsigned int jited;
382};
383
384struct bpf_map_ext {
385 struct bpf_prog_data owner;
386};
387
388static int bpf_derive_elf_map_from_fdinfo(int fd, struct bpf_elf_map *map,
389 struct bpf_map_ext *ext)
9e607f2e 390{
ecb05c0f 391 unsigned int val, owner_type = 0, owner_jited = 0;
9e607f2e 392 char file[PATH_MAX], buff[4096];
9e607f2e
DB
393 FILE *fp;
394
395 snprintf(file, sizeof(file), "/proc/%d/fdinfo/%d", getpid(), fd);
ecb05c0f 396 memset(map, 0, sizeof(*map));
9e607f2e
DB
397
398 fp = fopen(file, "r");
399 if (!fp) {
400 fprintf(stderr, "No procfs support?!\n");
401 return -EIO;
402 }
403
9e607f2e
DB
404 while (fgets(buff, sizeof(buff), fp)) {
405 if (sscanf(buff, "map_type:\t%u", &val) == 1)
ecb05c0f 406 map->type = val;
9e607f2e 407 else if (sscanf(buff, "key_size:\t%u", &val) == 1)
ecb05c0f 408 map->size_key = val;
9e607f2e 409 else if (sscanf(buff, "value_size:\t%u", &val) == 1)
ecb05c0f 410 map->size_value = val;
9e607f2e 411 else if (sscanf(buff, "max_entries:\t%u", &val) == 1)
ecb05c0f 412 map->max_elem = val;
4dd3f50a 413 else if (sscanf(buff, "map_flags:\t%i", &val) == 1)
ecb05c0f 414 map->flags = val;
fb24802b
DB
415 else if (sscanf(buff, "owner_prog_type:\t%i", &val) == 1)
416 owner_type = val;
ecb05c0f
DB
417 else if (sscanf(buff, "owner_jited:\t%i", &val) == 1)
418 owner_jited = val;
9e607f2e
DB
419 }
420
421 fclose(fp);
ecb05c0f
DB
422 if (ext) {
423 memset(ext, 0, sizeof(*ext));
424 ext->owner.type = owner_type;
425 ext->owner.jited = owner_jited;
426 }
427
428 return 0;
429}
430
431static int bpf_map_selfcheck_pinned(int fd, const struct bpf_elf_map *map,
432 struct bpf_map_ext *ext, int length,
433 enum bpf_prog_type type)
434{
435 struct bpf_elf_map tmp, zero = {};
436 int ret;
437
438 ret = bpf_derive_elf_map_from_fdinfo(fd, &tmp, ext);
439 if (ret < 0)
440 return ret;
9e607f2e 441
fb24802b
DB
442 /* The decision to reject this is on kernel side eventually, but
443 * at least give the user a chance to know what's wrong.
444 */
ecb05c0f 445 if (ext->owner.type && ext->owner.type != type)
fb24802b 446 fprintf(stderr, "Program array map owner types differ: %u (obj) != %u (pin)\n",
ecb05c0f 447 type, ext->owner.type);
fb24802b 448
91d88eeb 449 if (!memcmp(&tmp, map, length)) {
9e607f2e
DB
450 return 0;
451 } else {
9e607f2e
DB
452 /* If kernel doesn't have eBPF-related fdinfo, we cannot do much,
453 * so just accept it. We know we do have an eBPF fd and in this
454 * case, everything is 0. It is guaranteed that no such map exists
455 * since map type of 0 is unloadable BPF_MAP_TYPE_UNSPEC.
456 */
91d88eeb 457 if (!memcmp(&tmp, &zero, length))
9e607f2e
DB
458 return 0;
459
afc1a200 460 bpf_map_pin_report(&tmp, map);
9e607f2e
DB
461 return -EINVAL;
462 }
463}
464
91d88eeb
DB
465static int bpf_mnt_fs(const char *target)
466{
467 bool bind_done = false;
468
469 while (mount("", target, "none", MS_PRIVATE | MS_REC, NULL)) {
470 if (errno != EINVAL || bind_done) {
471 fprintf(stderr, "mount --make-private %s failed: %s\n",
472 target, strerror(errno));
473 return -1;
474 }
475
476 if (mount(target, target, "none", MS_BIND, NULL)) {
477 fprintf(stderr, "mount --bind %s %s failed: %s\n",
478 target, target, strerror(errno));
479 return -1;
480 }
481
482 bind_done = true;
483 }
484
e4225669 485 if (mount("bpf", target, "bpf", 0, "mode=0700")) {
91d88eeb
DB
486 fprintf(stderr, "mount -t bpf bpf %s failed: %s\n",
487 target, strerror(errno));
488 return -1;
489 }
490
491 return 0;
492}
493
95ae9a48
DB
494static int bpf_mnt_check_target(const char *target)
495{
496 struct stat sb = {};
497 int ret;
498
499 ret = stat(target, &sb);
500 if (ret) {
501 ret = mkdir(target, S_IRWXU);
502 if (ret) {
503 fprintf(stderr, "mkdir %s failed: %s\n", target,
504 strerror(errno));
505 return ret;
506 }
507 }
508
509 return 0;
510}
511
32e93fb7
DB
512static int bpf_valid_mntpt(const char *mnt, unsigned long magic)
513{
514 struct statfs st_fs;
515
516 if (statfs(mnt, &st_fs) < 0)
517 return -ENOENT;
518 if ((unsigned long)st_fs.f_type != magic)
519 return -ENOENT;
520
521 return 0;
522}
523
95ae9a48
DB
524static const char *bpf_find_mntpt_single(unsigned long magic, char *mnt,
525 int len, const char *mntpt)
526{
527 int ret;
528
529 ret = bpf_valid_mntpt(mntpt, magic);
530 if (!ret) {
18f156bf 531 strlcpy(mnt, mntpt, len);
95ae9a48
DB
532 return mnt;
533 }
534
535 return NULL;
536}
537
32e93fb7
DB
538static const char *bpf_find_mntpt(const char *fstype, unsigned long magic,
539 char *mnt, int len,
540 const char * const *known_mnts)
541{
542 const char * const *ptr;
543 char type[100];
544 FILE *fp;
545
546 if (known_mnts) {
547 ptr = known_mnts;
548 while (*ptr) {
95ae9a48 549 if (bpf_find_mntpt_single(magic, mnt, len, *ptr))
32e93fb7 550 return mnt;
32e93fb7
DB
551 ptr++;
552 }
553 }
554
c3724e4b
PS
555 if (len != PATH_MAX)
556 return NULL;
557
32e93fb7 558 fp = fopen("/proc/mounts", "r");
c3724e4b 559 if (fp == NULL)
32e93fb7
DB
560 return NULL;
561
562 while (fscanf(fp, "%*s %" textify(PATH_MAX) "s %99s %*s %*d %*d\n",
563 mnt, type) == 2) {
564 if (strcmp(type, fstype) == 0)
565 break;
566 }
567
568 fclose(fp);
569 if (strcmp(type, fstype) != 0)
570 return NULL;
571
572 return mnt;
573}
574
575int bpf_trace_pipe(void)
576{
577 char tracefs_mnt[PATH_MAX] = TRACE_DIR_MNT;
578 static const char * const tracefs_known_mnts[] = {
579 TRACE_DIR_MNT,
580 "/sys/kernel/debug/tracing",
581 "/tracing",
582 "/trace",
583 0,
584 };
1b736dc4 585 int fd_in, fd_out = STDERR_FILENO;
32e93fb7
DB
586 char tpipe[PATH_MAX];
587 const char *mnt;
32e93fb7
DB
588
589 mnt = bpf_find_mntpt("tracefs", TRACEFS_MAGIC, tracefs_mnt,
590 sizeof(tracefs_mnt), tracefs_known_mnts);
591 if (!mnt) {
592 fprintf(stderr, "tracefs not mounted?\n");
593 return -1;
594 }
595
596 snprintf(tpipe, sizeof(tpipe), "%s/trace_pipe", mnt);
597
1b736dc4
DB
598 fd_in = open(tpipe, O_RDONLY);
599 if (fd_in < 0)
32e93fb7
DB
600 return -1;
601
602 fprintf(stderr, "Running! Hang up with ^C!\n\n");
603 while (1) {
604 static char buff[4096];
605 ssize_t ret;
606
1b736dc4
DB
607 ret = read(fd_in, buff, sizeof(buff));
608 if (ret > 0 && write(fd_out, buff, ret) == ret)
609 continue;
610 break;
32e93fb7
DB
611 }
612
1b736dc4
DB
613 close(fd_in);
614 return -1;
32e93fb7
DB
615}
616
e4225669 617static int bpf_gen_global(const char *bpf_sub_dir)
91d88eeb 618{
e4225669
DB
619 char bpf_glo_dir[PATH_MAX];
620 int ret;
621
622 snprintf(bpf_glo_dir, sizeof(bpf_glo_dir), "%s/%s/",
623 bpf_sub_dir, BPF_DIR_GLOBALS);
624
625 ret = mkdir(bpf_glo_dir, S_IRWXU);
626 if (ret && errno != EEXIST) {
627 fprintf(stderr, "mkdir %s failed: %s\n", bpf_glo_dir,
628 strerror(errno));
629 return ret;
630 }
631
632 return 0;
633}
634
635static int bpf_gen_master(const char *base, const char *name)
636{
637 char bpf_sub_dir[PATH_MAX];
638 int ret;
639
640 snprintf(bpf_sub_dir, sizeof(bpf_sub_dir), "%s%s/", base, name);
641
642 ret = mkdir(bpf_sub_dir, S_IRWXU);
643 if (ret && errno != EEXIST) {
644 fprintf(stderr, "mkdir %s failed: %s\n", bpf_sub_dir,
645 strerror(errno));
646 return ret;
647 }
648
649 return bpf_gen_global(bpf_sub_dir);
650}
651
652static int bpf_slave_via_bind_mnt(const char *full_name,
653 const char *full_link)
654{
655 int ret;
656
657 ret = mkdir(full_name, S_IRWXU);
658 if (ret) {
659 assert(errno != EEXIST);
660 fprintf(stderr, "mkdir %s failed: %s\n", full_name,
661 strerror(errno));
662 return ret;
663 }
664
665 ret = mount(full_link, full_name, "none", MS_BIND, NULL);
666 if (ret) {
667 rmdir(full_name);
668 fprintf(stderr, "mount --bind %s %s failed: %s\n",
669 full_link, full_name, strerror(errno));
670 }
671
672 return ret;
673}
674
675static int bpf_gen_slave(const char *base, const char *name,
676 const char *link)
677{
678 char bpf_lnk_dir[PATH_MAX];
679 char bpf_sub_dir[PATH_MAX];
680 struct stat sb = {};
681 int ret;
682
683 snprintf(bpf_lnk_dir, sizeof(bpf_lnk_dir), "%s%s/", base, link);
684 snprintf(bpf_sub_dir, sizeof(bpf_sub_dir), "%s%s", base, name);
685
686 ret = symlink(bpf_lnk_dir, bpf_sub_dir);
687 if (ret) {
688 if (errno != EEXIST) {
689 if (errno != EPERM) {
690 fprintf(stderr, "symlink %s failed: %s\n",
691 bpf_sub_dir, strerror(errno));
692 return ret;
693 }
694
695 return bpf_slave_via_bind_mnt(bpf_sub_dir,
696 bpf_lnk_dir);
697 }
698
699 ret = lstat(bpf_sub_dir, &sb);
700 if (ret) {
701 fprintf(stderr, "lstat %s failed: %s\n",
702 bpf_sub_dir, strerror(errno));
703 return ret;
704 }
705
706 if ((sb.st_mode & S_IFMT) != S_IFLNK)
707 return bpf_gen_global(bpf_sub_dir);
708 }
709
710 return 0;
711}
712
713static int bpf_gen_hierarchy(const char *base)
714{
715 int ret, i;
716
717 ret = bpf_gen_master(base, bpf_prog_to_subdir(__bpf_types[0]));
718 for (i = 1; i < ARRAY_SIZE(__bpf_types) && !ret; i++)
719 ret = bpf_gen_slave(base,
720 bpf_prog_to_subdir(__bpf_types[i]),
721 bpf_prog_to_subdir(__bpf_types[0]));
722 return ret;
723}
724
725static const char *bpf_get_work_dir(enum bpf_prog_type type)
726{
727 static char bpf_tmp[PATH_MAX] = BPF_DIR_MNT;
728 static char bpf_wrk_dir[PATH_MAX];
91d88eeb 729 static const char *mnt;
e4225669 730 static bool bpf_mnt_cached;
95ae9a48 731 const char *mnt_env = getenv(BPF_ENV_MNT);
91d88eeb
DB
732 static const char * const bpf_known_mnts[] = {
733 BPF_DIR_MNT,
e4225669 734 "/bpf",
91d88eeb
DB
735 0,
736 };
91d88eeb
DB
737 int ret;
738
e4225669
DB
739 if (bpf_mnt_cached) {
740 const char *out = mnt;
741
51361a9f 742 if (out && type) {
e4225669
DB
743 snprintf(bpf_tmp, sizeof(bpf_tmp), "%s%s/",
744 out, bpf_prog_to_subdir(type));
745 out = bpf_tmp;
746 }
747 return out;
748 }
91d88eeb 749
95ae9a48
DB
750 if (mnt_env)
751 mnt = bpf_find_mntpt_single(BPF_FS_MAGIC, bpf_tmp,
752 sizeof(bpf_tmp), mnt_env);
753 else
754 mnt = bpf_find_mntpt("bpf", BPF_FS_MAGIC, bpf_tmp,
755 sizeof(bpf_tmp), bpf_known_mnts);
91d88eeb 756 if (!mnt) {
95ae9a48
DB
757 mnt = mnt_env ? : BPF_DIR_MNT;
758 ret = bpf_mnt_check_target(mnt);
759 if (!ret)
760 ret = bpf_mnt_fs(mnt);
91d88eeb
DB
761 if (ret) {
762 mnt = NULL;
763 goto out;
764 }
765 }
766
e4225669 767 snprintf(bpf_wrk_dir, sizeof(bpf_wrk_dir), "%s/", mnt);
91d88eeb 768
e4225669
DB
769 ret = bpf_gen_hierarchy(bpf_wrk_dir);
770 if (ret) {
91d88eeb
DB
771 mnt = NULL;
772 goto out;
773 }
774
e4225669 775 mnt = bpf_wrk_dir;
91d88eeb
DB
776out:
777 bpf_mnt_cached = true;
91d88eeb
DB
778 return mnt;
779}
780
e4225669 781static int bpf_obj_get(const char *pathname, enum bpf_prog_type type)
91d88eeb 782{
d17b136f 783 union bpf_attr attr = {};
91d88eeb
DB
784 char tmp[PATH_MAX];
785
786 if (strlen(pathname) > 2 && pathname[0] == 'm' &&
e4225669 787 pathname[1] == ':' && bpf_get_work_dir(type)) {
91d88eeb 788 snprintf(tmp, sizeof(tmp), "%s/%s",
e4225669 789 bpf_get_work_dir(type), pathname + 2);
91d88eeb
DB
790 pathname = tmp;
791 }
792
91d88eeb
DB
793 attr.pathname = bpf_ptr_to_u64(pathname);
794
795 return bpf(BPF_OBJ_GET, &attr, sizeof(attr));
796}
797
21856018
DB
798static int bpf_obj_pinned(const char *pathname, enum bpf_prog_type type)
799{
800 int prog_fd = bpf_obj_get(pathname, type);
801
802 if (prog_fd < 0)
803 fprintf(stderr, "Couldn\'t retrieve pinned program \'%s\': %s\n",
804 pathname, strerror(errno));
805 return prog_fd;
806}
807
3f0b9e62 808static int bpf_do_parse(struct bpf_cfg_in *cfg, const bool *opt_tbl)
32e93fb7 809{
32e93fb7 810 const char *file, *section, *uds_name;
32e93fb7 811 bool verbose = false;
e4225669 812 int i, ret, argc;
91d88eeb
DB
813 char **argv;
814
e4225669
DB
815 argv = cfg->argv;
816 argc = cfg->argc;
91d88eeb
DB
817
818 if (opt_tbl[CBPF_BYTECODE] &&
819 (matches(*argv, "bytecode") == 0 ||
820 strcmp(*argv, "bc") == 0)) {
f20ff2f1 821 cfg->mode = CBPF_BYTECODE;
91d88eeb
DB
822 } else if (opt_tbl[CBPF_FILE] &&
823 (matches(*argv, "bytecode-file") == 0 ||
824 strcmp(*argv, "bcf") == 0)) {
f20ff2f1 825 cfg->mode = CBPF_FILE;
91d88eeb
DB
826 } else if (opt_tbl[EBPF_OBJECT] &&
827 (matches(*argv, "object-file") == 0 ||
828 strcmp(*argv, "obj") == 0)) {
f20ff2f1 829 cfg->mode = EBPF_OBJECT;
91d88eeb
DB
830 } else if (opt_tbl[EBPF_PINNED] &&
831 (matches(*argv, "object-pinned") == 0 ||
832 matches(*argv, "pinned") == 0 ||
833 matches(*argv, "fd") == 0)) {
f20ff2f1 834 cfg->mode = EBPF_PINNED;
32e93fb7
DB
835 } else {
836 fprintf(stderr, "What mode is \"%s\"?\n", *argv);
837 return -1;
838 }
839
840 NEXT_ARG();
841 file = section = uds_name = NULL;
f20ff2f1 842 if (cfg->mode == EBPF_OBJECT || cfg->mode == EBPF_PINNED) {
32e93fb7
DB
843 file = *argv;
844 NEXT_ARG_FWD();
845
658cfebc 846 if (cfg->type == BPF_PROG_TYPE_UNSPEC) {
91d88eeb
DB
847 if (argc > 0 && matches(*argv, "type") == 0) {
848 NEXT_ARG();
e4225669
DB
849 for (i = 0; i < ARRAY_SIZE(__bpf_prog_meta);
850 i++) {
851 if (!__bpf_prog_meta[i].type)
852 continue;
853 if (!matches(*argv,
854 __bpf_prog_meta[i].type)) {
658cfebc 855 cfg->type = i;
e4225669
DB
856 break;
857 }
858 }
859
658cfebc 860 if (cfg->type == BPF_PROG_TYPE_UNSPEC) {
91d88eeb
DB
861 fprintf(stderr, "What type is \"%s\"?\n",
862 *argv);
863 return -1;
864 }
865 NEXT_ARG_FWD();
866 } else {
658cfebc 867 cfg->type = BPF_PROG_TYPE_SCHED_CLS;
91d88eeb
DB
868 }
869 }
870
658cfebc 871 section = bpf_prog_to_default_section(cfg->type);
32e93fb7
DB
872 if (argc > 0 && matches(*argv, "section") == 0) {
873 NEXT_ARG();
874 section = *argv;
875 NEXT_ARG_FWD();
876 }
877
658cfebc 878 if (__bpf_prog_meta[cfg->type].may_uds_export) {
e4225669
DB
879 uds_name = getenv(BPF_ENV_UDS);
880 if (argc > 0 && !uds_name &&
881 matches(*argv, "export") == 0) {
882 NEXT_ARG();
883 uds_name = *argv;
884 NEXT_ARG_FWD();
885 }
32e93fb7
DB
886 }
887
888 if (argc > 0 && matches(*argv, "verbose") == 0) {
889 verbose = true;
890 NEXT_ARG_FWD();
891 }
892
893 PREV_ARG();
894 }
895
3f0b9e62 896 if (cfg->mode == CBPF_BYTECODE || cfg->mode == CBPF_FILE) {
51be7546 897 ret = bpf_ops_parse(argc, argv, cfg->opcodes,
f20ff2f1 898 cfg->mode == CBPF_FILE);
3f0b9e62
JK
899 cfg->n_opcodes = ret;
900 } else if (cfg->mode == EBPF_OBJECT) {
901 ret = 0; /* program will be loaded by load stage */
902 } else if (cfg->mode == EBPF_PINNED) {
658cfebc 903 ret = bpf_obj_pinned(file, cfg->type);
3f0b9e62
JK
904 cfg->prog_fd = ret;
905 } else {
32e93fb7 906 return -1;
3f0b9e62 907 }
32e93fb7 908
e4225669
DB
909 cfg->object = file;
910 cfg->section = section;
911 cfg->uds = uds_name;
912 cfg->argc = argc;
913 cfg->argv = argv;
3f0b9e62 914 cfg->verbose = verbose;
91d88eeb
DB
915
916 return ret;
917}
918
3f0b9e62
JK
919static int bpf_do_load(struct bpf_cfg_in *cfg)
920{
921 if (cfg->mode == EBPF_OBJECT) {
922 cfg->prog_fd = bpf_obj_open(cfg->object, cfg->type,
65fdae3d
JK
923 cfg->section, cfg->ifindex,
924 cfg->verbose);
3f0b9e62
JK
925 return cfg->prog_fd;
926 }
927 return 0;
928}
929
4a847fcb
JK
930int bpf_load_common(struct bpf_cfg_in *cfg, const struct bpf_cfg_ops *ops,
931 void *nl)
91d88eeb 932{
91d88eeb 933 char annotation[256];
91d88eeb
DB
934 int ret;
935
3f0b9e62 936 ret = bpf_do_load(cfg);
91d88eeb
DB
937 if (ret < 0)
938 return ret;
939
f20ff2f1 940 if (cfg->mode == CBPF_BYTECODE || cfg->mode == CBPF_FILE)
3f0b9e62 941 ops->cbpf_cb(nl, cfg->opcodes, cfg->n_opcodes);
f20ff2f1 942 if (cfg->mode == EBPF_OBJECT || cfg->mode == EBPF_PINNED) {
32e93fb7 943 snprintf(annotation, sizeof(annotation), "%s:[%s]",
f20ff2f1 944 basename(cfg->object), cfg->mode == EBPF_PINNED ?
e4225669 945 "*fsobj" : cfg->section);
3f0b9e62 946 ops->ebpf_cb(nl, cfg->prog_fd, annotation);
32e93fb7
DB
947 }
948
91d88eeb
DB
949 return 0;
950}
32e93fb7 951
4a847fcb 952int bpf_parse_common(struct bpf_cfg_in *cfg, const struct bpf_cfg_ops *ops)
e4225669
DB
953{
954 bool opt_tbl[BPF_MODE_MAX] = {};
955
956 if (ops->cbpf_cb) {
957 opt_tbl[CBPF_BYTECODE] = true;
958 opt_tbl[CBPF_FILE] = true;
959 }
960
961 if (ops->ebpf_cb) {
962 opt_tbl[EBPF_OBJECT] = true;
963 opt_tbl[EBPF_PINNED] = true;
964 }
965
4a847fcb
JK
966 return bpf_do_parse(cfg, opt_tbl);
967}
968
969int bpf_parse_and_load_common(struct bpf_cfg_in *cfg,
970 const struct bpf_cfg_ops *ops, void *nl)
971{
972 int ret;
973
974 ret = bpf_parse_common(cfg, ops);
975 if (ret < 0)
976 return ret;
977
978 return bpf_load_common(cfg, ops, nl);
e4225669
DB
979}
980
91d88eeb
DB
981int bpf_graft_map(const char *map_path, uint32_t *key, int argc, char **argv)
982{
91d88eeb 983 const bool opt_tbl[BPF_MODE_MAX] = {
91d88eeb
DB
984 [EBPF_OBJECT] = true,
985 [EBPF_PINNED] = true,
986 };
987 const struct bpf_elf_map test = {
988 .type = BPF_MAP_TYPE_PROG_ARRAY,
989 .size_key = sizeof(int),
990 .size_value = sizeof(int),
991 };
e4225669 992 struct bpf_cfg_in cfg = {
658cfebc 993 .type = BPF_PROG_TYPE_UNSPEC,
e4225669
DB
994 .argc = argc,
995 .argv = argv,
996 };
ecb05c0f 997 struct bpf_map_ext ext = {};
91d88eeb 998 int ret, prog_fd, map_fd;
91d88eeb
DB
999 uint32_t map_key;
1000
3f0b9e62
JK
1001 ret = bpf_do_parse(&cfg, opt_tbl);
1002 if (ret < 0)
1003 return ret;
1004
1005 ret = bpf_do_load(&cfg);
1006 if (ret < 0)
1007 return ret;
1008
1009 prog_fd = cfg.prog_fd;
1010
91d88eeb
DB
1011 if (key) {
1012 map_key = *key;
1013 } else {
e4225669 1014 ret = sscanf(cfg.section, "%*i/%i", &map_key);
91d88eeb 1015 if (ret != 1) {
32a121cb 1016 fprintf(stderr, "Couldn\'t infer map key from section name! Please provide \'key\' argument!\n");
91d88eeb
DB
1017 ret = -EINVAL;
1018 goto out_prog;
1019 }
1020 }
32e93fb7 1021
658cfebc 1022 map_fd = bpf_obj_get(map_path, cfg.type);
91d88eeb
DB
1023 if (map_fd < 0) {
1024 fprintf(stderr, "Couldn\'t retrieve pinned map \'%s\': %s\n",
1025 map_path, strerror(errno));
1026 ret = map_fd;
1027 goto out_prog;
1028 }
1029
ecb05c0f 1030 ret = bpf_map_selfcheck_pinned(map_fd, &test, &ext,
fb24802b 1031 offsetof(struct bpf_elf_map, max_elem),
658cfebc 1032 cfg.type);
91d88eeb
DB
1033 if (ret < 0) {
1034 fprintf(stderr, "Map \'%s\' self-check failed!\n", map_path);
1035 goto out_map;
1036 }
1037
1038 ret = bpf_map_update(map_fd, &map_key, &prog_fd, BPF_ANY);
1039 if (ret < 0)
1040 fprintf(stderr, "Map update failed: %s\n", strerror(errno));
1041out_map:
1042 close(map_fd);
1043out_prog:
1044 close(prog_fd);
1045 return ret;
32e93fb7
DB
1046}
1047
fc4ccce0
DA
1048int bpf_prog_attach_fd(int prog_fd, int target_fd, enum bpf_attach_type type)
1049{
1050 union bpf_attr attr = {};
1051
1052 attr.target_fd = target_fd;
1053 attr.attach_bpf_fd = prog_fd;
1054 attr.attach_type = type;
1055
1056 return bpf(BPF_PROG_ATTACH, &attr, sizeof(attr));
1057}
1058
1059int bpf_prog_detach_fd(int target_fd, enum bpf_attach_type type)
1060{
1061 union bpf_attr attr = {};
1062
1063 attr.target_fd = target_fd;
1064 attr.attach_type = type;
1065
1066 return bpf(BPF_PROG_DETACH, &attr, sizeof(attr));
1067}
1068
65fdae3d
JK
1069static int bpf_prog_load_dev(enum bpf_prog_type type,
1070 const struct bpf_insn *insns, size_t size_insns,
1071 const char *license, __u32 ifindex,
1072 char *log, size_t size_log)
869d889e
DA
1073{
1074 union bpf_attr attr = {};
1075
1076 attr.prog_type = type;
1077 attr.insns = bpf_ptr_to_u64(insns);
1078 attr.insn_cnt = size_insns / sizeof(struct bpf_insn);
1079 attr.license = bpf_ptr_to_u64(license);
65fdae3d 1080 attr.prog_ifindex = ifindex;
869d889e
DA
1081
1082 if (size_log > 0) {
1083 attr.log_buf = bpf_ptr_to_u64(log);
1084 attr.log_size = size_log;
1085 attr.log_level = 1;
1086 }
1087
1088 return bpf(BPF_PROG_LOAD, &attr, sizeof(attr));
1089}
1090
65fdae3d
JK
1091int bpf_prog_load(enum bpf_prog_type type, const struct bpf_insn *insns,
1092 size_t size_insns, const char *license, char *log,
1093 size_t size_log)
1094{
1095 return bpf_prog_load_dev(type, insns, size_insns, license, 0,
1096 log, size_log);
1097}
1098
6256f8c9 1099#ifdef HAVE_ELF
32e93fb7
DB
1100struct bpf_elf_prog {
1101 enum bpf_prog_type type;
1102 const struct bpf_insn *insns;
1103 size_t size;
1104 const char *license;
1105};
1106
f6793eec
DB
1107struct bpf_hash_entry {
1108 unsigned int pinning;
1109 const char *subpath;
1110 struct bpf_hash_entry *next;
1111};
1112
ecb05c0f
DB
1113struct bpf_config {
1114 unsigned int jit_enabled;
1115};
1116
32e93fb7 1117struct bpf_elf_ctx {
ecb05c0f 1118 struct bpf_config cfg;
32e93fb7
DB
1119 Elf *elf_fd;
1120 GElf_Ehdr elf_hdr;
1121 Elf_Data *sym_tab;
1122 Elf_Data *str_tab;
1123 int obj_fd;
1124 int map_fds[ELF_MAX_MAPS];
1125 struct bpf_elf_map maps[ELF_MAX_MAPS];
ecb05c0f 1126 struct bpf_map_ext maps_ext[ELF_MAX_MAPS];
32e93fb7
DB
1127 int sym_num;
1128 int map_num;
e4225669 1129 int map_len;
32e93fb7
DB
1130 bool *sec_done;
1131 int sec_maps;
1132 char license[ELF_MAX_LICENSE_LEN];
1133 enum bpf_prog_type type;
65fdae3d 1134 __u32 ifindex;
32e93fb7
DB
1135 bool verbose;
1136 struct bpf_elf_st stat;
f6793eec 1137 struct bpf_hash_entry *ht[256];
f31645d1
DB
1138 char *log;
1139 size_t log_size;
32e93fb7
DB
1140};
1141
6256f8c9 1142struct bpf_elf_sec_data {
32e93fb7
DB
1143 GElf_Shdr sec_hdr;
1144 Elf_Data *sec_data;
1145 const char *sec_name;
6256f8c9
DB
1146};
1147
1148struct bpf_map_data {
32e93fb7
DB
1149 int *fds;
1150 const char *obj;
1151 struct bpf_elf_st *st;
1152 struct bpf_elf_map *ent;
6256f8c9
DB
1153};
1154
f31645d1
DB
1155static __check_format_string(2, 3) void
1156bpf_dump_error(struct bpf_elf_ctx *ctx, const char *format, ...)
11c39b5e
DB
1157{
1158 va_list vl;
1159
1160 va_start(vl, format);
1161 vfprintf(stderr, format, vl);
1162 va_end(vl);
1163
f31645d1 1164 if (ctx->log && ctx->log[0]) {
afc1a200
DB
1165 if (ctx->verbose) {
1166 fprintf(stderr, "%s\n", ctx->log);
1167 } else {
1168 unsigned int off = 0, len = strlen(ctx->log);
1169
1170 if (len > BPF_MAX_LOG) {
1171 off = len - BPF_MAX_LOG;
1172 fprintf(stderr, "Skipped %u bytes, use \'verb\' option for the full verbose log.\n[...]\n",
1173 off);
1174 }
1175 fprintf(stderr, "%s\n", ctx->log + off);
1176 }
1177
f31645d1
DB
1178 memset(ctx->log, 0, ctx->log_size);
1179 }
1180}
1181
1182static int bpf_log_realloc(struct bpf_elf_ctx *ctx)
1183{
0f74d0f3 1184 const size_t log_max = UINT_MAX >> 8;
f31645d1 1185 size_t log_size = ctx->log_size;
f6a54d72 1186 char *ptr;
f31645d1
DB
1187
1188 if (!ctx->log) {
1189 log_size = 65536;
0f74d0f3 1190 } else if (log_size < log_max) {
f31645d1 1191 log_size <<= 1;
0f74d0f3
TG
1192 if (log_size > log_max)
1193 log_size = log_max;
1194 } else {
1195 return -EINVAL;
d937a74b 1196 }
f31645d1
DB
1197
1198 ptr = realloc(ctx->log, log_size);
1199 if (!ptr)
1200 return -ENOMEM;
1201
f6a54d72 1202 ptr[0] = 0;
f31645d1
DB
1203 ctx->log = ptr;
1204 ctx->log_size = log_size;
1205
1206 return 0;
11c39b5e
DB
1207}
1208
4dd3f50a
DB
1209static int bpf_map_create(enum bpf_map_type type, uint32_t size_key,
1210 uint32_t size_value, uint32_t max_elem,
5691e6bc 1211 uint32_t flags, int inner_fd, uint32_t ifindex)
11c39b5e 1212{
d17b136f 1213 union bpf_attr attr = {};
67584e3a 1214
67584e3a
ND
1215 attr.map_type = type;
1216 attr.key_size = size_key;
612ff099 1217 attr.value_size = inner_fd ? sizeof(int) : size_value;
67584e3a 1218 attr.max_entries = max_elem;
4dd3f50a 1219 attr.map_flags = flags;
612ff099 1220 attr.inner_map_fd = inner_fd;
5691e6bc 1221 attr.map_ifindex = ifindex;
11c39b5e
DB
1222
1223 return bpf(BPF_MAP_CREATE, &attr, sizeof(attr));
1224}
11c39b5e 1225
32e93fb7 1226static int bpf_obj_pin(int fd, const char *pathname)
11c39b5e 1227{
d17b136f 1228 union bpf_attr attr = {};
67584e3a 1229
67584e3a
ND
1230 attr.pathname = bpf_ptr_to_u64(pathname);
1231 attr.bpf_fd = fd;
32e93fb7
DB
1232
1233 return bpf(BPF_OBJ_PIN, &attr, sizeof(attr));
1234}
11c39b5e 1235
32e93fb7
DB
1236static int bpf_obj_hash(const char *object, uint8_t *out, size_t len)
1237{
1238 struct sockaddr_alg alg = {
1239 .salg_family = AF_ALG,
1240 .salg_type = "hash",
1241 .salg_name = "sha1",
1242 };
1243 int ret, cfd, ofd, ffd;
1244 struct stat stbuff;
1245 ssize_t size;
1246
1247 if (!object || len != 20)
1248 return -EINVAL;
1249
1250 cfd = socket(AF_ALG, SOCK_SEQPACKET, 0);
1251 if (cfd < 0) {
1252 fprintf(stderr, "Cannot get AF_ALG socket: %s\n",
1253 strerror(errno));
1254 return cfd;
1255 }
1256
1257 ret = bind(cfd, (struct sockaddr *)&alg, sizeof(alg));
1258 if (ret < 0) {
1259 fprintf(stderr, "Error binding socket: %s\n", strerror(errno));
1260 goto out_cfd;
1261 }
1262
1263 ofd = accept(cfd, NULL, 0);
1264 if (ofd < 0) {
1265 fprintf(stderr, "Error accepting socket: %s\n",
1266 strerror(errno));
1267 ret = ofd;
1268 goto out_cfd;
1269 }
1270
1271 ffd = open(object, O_RDONLY);
1272 if (ffd < 0) {
1273 fprintf(stderr, "Error opening object %s: %s\n",
1274 object, strerror(errno));
1275 ret = ffd;
1276 goto out_ofd;
1277 }
1278
32a121cb 1279 ret = fstat(ffd, &stbuff);
32e93fb7
DB
1280 if (ret < 0) {
1281 fprintf(stderr, "Error doing fstat: %s\n",
1282 strerror(errno));
1283 goto out_ffd;
d937a74b 1284 }
11c39b5e 1285
32e93fb7
DB
1286 size = sendfile(ofd, ffd, NULL, stbuff.st_size);
1287 if (size != stbuff.st_size) {
1288 fprintf(stderr, "Error from sendfile (%zd vs %zu bytes): %s\n",
1289 size, stbuff.st_size, strerror(errno));
1290 ret = -1;
1291 goto out_ffd;
1292 }
1293
1294 size = read(ofd, out, len);
1295 if (size != len) {
1296 fprintf(stderr, "Error from read (%zd vs %zu bytes): %s\n",
1297 size, len, strerror(errno));
1298 ret = -1;
1299 } else {
1300 ret = 0;
1301 }
1302out_ffd:
1303 close(ffd);
1304out_ofd:
1305 close(ofd);
1306out_cfd:
1307 close(cfd);
1308 return ret;
11c39b5e
DB
1309}
1310
32e93fb7 1311static const char *bpf_get_obj_uid(const char *pathname)
11c39b5e 1312{
32a121cb 1313 static bool bpf_uid_cached;
32e93fb7
DB
1314 static char bpf_uid[64];
1315 uint8_t tmp[20];
1316 int ret;
11c39b5e 1317
32e93fb7
DB
1318 if (bpf_uid_cached)
1319 goto done;
11c39b5e 1320
32e93fb7
DB
1321 ret = bpf_obj_hash(pathname, tmp, sizeof(tmp));
1322 if (ret) {
1323 fprintf(stderr, "Object hashing failed!\n");
1324 return NULL;
1325 }
1326
1327 hexstring_n2a(tmp, sizeof(tmp), bpf_uid, sizeof(bpf_uid));
1328 bpf_uid_cached = true;
1329done:
1330 return bpf_uid;
11c39b5e
DB
1331}
1332
32e93fb7
DB
1333static int bpf_init_env(const char *pathname)
1334{
1335 struct rlimit limit = {
1336 .rlim_cur = RLIM_INFINITY,
1337 .rlim_max = RLIM_INFINITY,
1338 };
1339
1340 /* Don't bother in case we fail! */
1341 setrlimit(RLIMIT_MEMLOCK, &limit);
1342
e4225669 1343 if (!bpf_get_work_dir(BPF_PROG_TYPE_UNSPEC)) {
32a121cb 1344 fprintf(stderr, "Continuing without mounted eBPF fs. Too old kernel?\n");
32e93fb7
DB
1345 return 0;
1346 }
1347
1348 if (!bpf_get_obj_uid(pathname))
1349 return -1;
1350
1351 return 0;
6256f8c9
DB
1352}
1353
f6793eec
DB
1354static const char *bpf_custom_pinning(const struct bpf_elf_ctx *ctx,
1355 uint32_t pinning)
1356{
1357 struct bpf_hash_entry *entry;
1358
1359 entry = ctx->ht[pinning & (ARRAY_SIZE(ctx->ht) - 1)];
1360 while (entry && entry->pinning != pinning)
1361 entry = entry->next;
1362
1363 return entry ? entry->subpath : NULL;
1364}
1365
1366static bool bpf_no_pinning(const struct bpf_elf_ctx *ctx,
1367 uint32_t pinning)
11c39b5e 1368{
32e93fb7
DB
1369 switch (pinning) {
1370 case PIN_OBJECT_NS:
1371 case PIN_GLOBAL_NS:
1372 return false;
1373 case PIN_NONE:
32e93fb7 1374 return true;
f6793eec
DB
1375 default:
1376 return !bpf_custom_pinning(ctx, pinning);
32e93fb7
DB
1377 }
1378}
1379
1380static void bpf_make_pathname(char *pathname, size_t len, const char *name,
f6793eec 1381 const struct bpf_elf_ctx *ctx, uint32_t pinning)
32e93fb7
DB
1382{
1383 switch (pinning) {
1384 case PIN_OBJECT_NS:
e4225669
DB
1385 snprintf(pathname, len, "%s/%s/%s",
1386 bpf_get_work_dir(ctx->type),
32e93fb7
DB
1387 bpf_get_obj_uid(NULL), name);
1388 break;
1389 case PIN_GLOBAL_NS:
e4225669
DB
1390 snprintf(pathname, len, "%s/%s/%s",
1391 bpf_get_work_dir(ctx->type),
32e93fb7
DB
1392 BPF_DIR_GLOBALS, name);
1393 break;
f6793eec 1394 default:
e4225669
DB
1395 snprintf(pathname, len, "%s/../%s/%s",
1396 bpf_get_work_dir(ctx->type),
f6793eec
DB
1397 bpf_custom_pinning(ctx, pinning), name);
1398 break;
32e93fb7
DB
1399 }
1400}
1401
f6793eec
DB
1402static int bpf_probe_pinned(const char *name, const struct bpf_elf_ctx *ctx,
1403 uint32_t pinning)
32e93fb7
DB
1404{
1405 char pathname[PATH_MAX];
1406
e4225669 1407 if (bpf_no_pinning(ctx, pinning) || !bpf_get_work_dir(ctx->type))
32e93fb7
DB
1408 return 0;
1409
f6793eec 1410 bpf_make_pathname(pathname, sizeof(pathname), name, ctx, pinning);
e4225669 1411 return bpf_obj_get(pathname, ctx->type);
32e93fb7
DB
1412}
1413
e4225669 1414static int bpf_make_obj_path(const struct bpf_elf_ctx *ctx)
32e93fb7 1415{
f6793eec 1416 char tmp[PATH_MAX];
32e93fb7
DB
1417 int ret;
1418
e4225669 1419 snprintf(tmp, sizeof(tmp), "%s/%s", bpf_get_work_dir(ctx->type),
f6793eec
DB
1420 bpf_get_obj_uid(NULL));
1421
1422 ret = mkdir(tmp, S_IRWXU);
1423 if (ret && errno != EEXIST) {
1424 fprintf(stderr, "mkdir %s failed: %s\n", tmp, strerror(errno));
1425 return ret;
1426 }
1427
1428 return 0;
1429}
1430
e4225669
DB
1431static int bpf_make_custom_path(const struct bpf_elf_ctx *ctx,
1432 const char *todo)
f6793eec
DB
1433{
1434 char tmp[PATH_MAX], rem[PATH_MAX], *sub;
1435 int ret;
1436
e4225669 1437 snprintf(tmp, sizeof(tmp), "%s/../", bpf_get_work_dir(ctx->type));
f6793eec
DB
1438 snprintf(rem, sizeof(rem), "%s/", todo);
1439 sub = strtok(rem, "/");
32e93fb7 1440
f6793eec
DB
1441 while (sub) {
1442 if (strlen(tmp) + strlen(sub) + 2 > PATH_MAX)
1443 return -EINVAL;
1444
1445 strcat(tmp, sub);
1446 strcat(tmp, "/");
32e93fb7 1447
f6793eec 1448 ret = mkdir(tmp, S_IRWXU);
32e93fb7 1449 if (ret && errno != EEXIST) {
f6793eec 1450 fprintf(stderr, "mkdir %s failed: %s\n", tmp,
32e93fb7
DB
1451 strerror(errno));
1452 return ret;
1453 }
f6793eec
DB
1454
1455 sub = strtok(NULL, "/");
32e93fb7
DB
1456 }
1457
f6793eec
DB
1458 return 0;
1459}
1460
1461static int bpf_place_pinned(int fd, const char *name,
1462 const struct bpf_elf_ctx *ctx, uint32_t pinning)
1463{
1464 char pathname[PATH_MAX];
1465 const char *tmp;
1466 int ret = 0;
1467
e4225669 1468 if (bpf_no_pinning(ctx, pinning) || !bpf_get_work_dir(ctx->type))
f6793eec
DB
1469 return 0;
1470
1471 if (pinning == PIN_OBJECT_NS)
e4225669 1472 ret = bpf_make_obj_path(ctx);
f6793eec 1473 else if ((tmp = bpf_custom_pinning(ctx, pinning)))
e4225669 1474 ret = bpf_make_custom_path(ctx, tmp);
f6793eec
DB
1475 if (ret < 0)
1476 return ret;
1477
1478 bpf_make_pathname(pathname, sizeof(pathname), name, ctx, pinning);
32e93fb7
DB
1479 return bpf_obj_pin(fd, pathname);
1480}
1481
f31645d1
DB
1482static void bpf_prog_report(int fd, const char *section,
1483 const struct bpf_elf_prog *prog,
1484 struct bpf_elf_ctx *ctx)
32e93fb7 1485{
afc1a200
DB
1486 unsigned int insns = prog->size / sizeof(struct bpf_insn);
1487
1488 fprintf(stderr, "\nProg section \'%s\' %s%s (%d)!\n", section,
f31645d1
DB
1489 fd < 0 ? "rejected: " : "loaded",
1490 fd < 0 ? strerror(errno) : "",
1491 fd < 0 ? errno : fd);
1492
1493 fprintf(stderr, " - Type: %u\n", prog->type);
afc1a200
DB
1494 fprintf(stderr, " - Instructions: %u (%u over limit)\n",
1495 insns, insns > BPF_MAXINSNS ? insns - BPF_MAXINSNS : 0);
f31645d1
DB
1496 fprintf(stderr, " - License: %s\n\n", prog->license);
1497
1498 bpf_dump_error(ctx, "Verifier analysis:\n\n");
1499}
32e93fb7 1500
f31645d1
DB
1501static int bpf_prog_attach(const char *section,
1502 const struct bpf_elf_prog *prog,
1503 struct bpf_elf_ctx *ctx)
1504{
1505 int tries = 0, fd;
1506retry:
32e93fb7 1507 errno = 0;
65fdae3d
JK
1508 fd = bpf_prog_load_dev(prog->type, prog->insns, prog->size,
1509 prog->license, ctx->ifindex,
1510 ctx->log, ctx->log_size);
f31645d1
DB
1511 if (fd < 0 || ctx->verbose) {
1512 /* The verifier log is pretty chatty, sometimes so chatty
1513 * on larger programs, that we could fail to dump everything
1514 * into our buffer. Still, try to give a debuggable error
1515 * log for the user, so enlarge it and re-fail.
1516 */
1517 if (fd < 0 && (errno == ENOSPC || !ctx->log_size)) {
0f74d0f3 1518 if (tries++ < 10 && !bpf_log_realloc(ctx))
f31645d1
DB
1519 goto retry;
1520
32a121cb 1521 fprintf(stderr, "Log buffer too small to dump verifier log %zu bytes (%d tries)!\n",
f31645d1
DB
1522 ctx->log_size, tries);
1523 return fd;
1524 }
1525
1526 bpf_prog_report(fd, section, prog, ctx);
32e93fb7
DB
1527 }
1528
1529 return fd;
1530}
1531
f31645d1
DB
1532static void bpf_map_report(int fd, const char *name,
1533 const struct bpf_elf_map *map,
612ff099 1534 struct bpf_elf_ctx *ctx, int inner_fd)
f31645d1
DB
1535{
1536 fprintf(stderr, "Map object \'%s\' %s%s (%d)!\n", name,
1537 fd < 0 ? "rejected: " : "loaded",
1538 fd < 0 ? strerror(errno) : "",
1539 fd < 0 ? errno : fd);
1540
1541 fprintf(stderr, " - Type: %u\n", map->type);
1542 fprintf(stderr, " - Identifier: %u\n", map->id);
1543 fprintf(stderr, " - Pinning: %u\n", map->pinning);
1544 fprintf(stderr, " - Size key: %u\n", map->size_key);
612ff099
DB
1545 fprintf(stderr, " - Size value: %u\n",
1546 inner_fd ? (int)sizeof(int) : map->size_value);
4dd3f50a
DB
1547 fprintf(stderr, " - Max elems: %u\n", map->max_elem);
1548 fprintf(stderr, " - Flags: %#x\n\n", map->flags);
f31645d1
DB
1549}
1550
612ff099
DB
1551static int bpf_find_map_id(const struct bpf_elf_ctx *ctx, uint32_t id)
1552{
1553 int i;
1554
1555 for (i = 0; i < ctx->map_num; i++) {
1556 if (ctx->maps[i].id != id)
1557 continue;
1558 if (ctx->map_fds[i] < 0)
1559 return -EINVAL;
1560
1561 return ctx->map_fds[i];
1562 }
1563
1564 return -ENOENT;
1565}
1566
0b5eadc5 1567static void bpf_report_map_in_map(int outer_fd, uint32_t idx)
612ff099
DB
1568{
1569 struct bpf_elf_map outer_map;
1570 int ret;
1571
1572 fprintf(stderr, "Cannot insert map into map! ");
1573
ecb05c0f 1574 ret = bpf_derive_elf_map_from_fdinfo(outer_fd, &outer_map, NULL);
612ff099
DB
1575 if (!ret) {
1576 if (idx >= outer_map.max_elem &&
1577 outer_map.type == BPF_MAP_TYPE_ARRAY_OF_MAPS) {
1578 fprintf(stderr, "Outer map has %u elements, index %u is invalid!\n",
1579 outer_map.max_elem, idx);
1580 return;
1581 }
1582 }
1583
1584 fprintf(stderr, "Different map specs used for outer and inner map?\n");
1585}
1586
1587static bool bpf_is_map_in_map_type(const struct bpf_elf_map *map)
1588{
1589 return map->type == BPF_MAP_TYPE_ARRAY_OF_MAPS ||
1590 map->type == BPF_MAP_TYPE_HASH_OF_MAPS;
1591}
1592
ecb05c0f
DB
1593static int bpf_map_attach(const char *name, struct bpf_elf_ctx *ctx,
1594 const struct bpf_elf_map *map, struct bpf_map_ext *ext,
1595 int *have_map_in_map)
32e93fb7 1596{
612ff099 1597 int fd, ret, map_inner_fd = 0;
32e93fb7 1598
f6793eec 1599 fd = bpf_probe_pinned(name, ctx, map->pinning);
32e93fb7 1600 if (fd > 0) {
ecb05c0f 1601 ret = bpf_map_selfcheck_pinned(fd, map, ext,
91d88eeb 1602 offsetof(struct bpf_elf_map,
fb24802b 1603 id), ctx->type);
9e607f2e
DB
1604 if (ret < 0) {
1605 close(fd);
1606 fprintf(stderr, "Map \'%s\' self-check failed!\n",
1607 name);
1608 return ret;
1609 }
f31645d1 1610 if (ctx->verbose)
32e93fb7
DB
1611 fprintf(stderr, "Map \'%s\' loaded as pinned!\n",
1612 name);
1613 return fd;
1614 }
1615
612ff099
DB
1616 if (have_map_in_map && bpf_is_map_in_map_type(map)) {
1617 (*have_map_in_map)++;
1618 if (map->inner_id)
1619 return 0;
1620 fprintf(stderr, "Map \'%s\' cannot be created since no inner map ID defined!\n",
1621 name);
1622 return -EINVAL;
1623 }
1624
1625 if (!have_map_in_map && bpf_is_map_in_map_type(map)) {
1626 map_inner_fd = bpf_find_map_id(ctx, map->inner_id);
1627 if (map_inner_fd < 0) {
1628 fprintf(stderr, "Map \'%s\' cannot be loaded. Inner map with ID %u not found!\n",
1629 name, map->inner_id);
1630 return -EINVAL;
1631 }
1632 }
1633
32e93fb7
DB
1634 errno = 0;
1635 fd = bpf_map_create(map->type, map->size_key, map->size_value,
5691e6bc
JK
1636 map->max_elem, map->flags, map_inner_fd,
1637 ctx->ifindex);
1638
f31645d1 1639 if (fd < 0 || ctx->verbose) {
612ff099 1640 bpf_map_report(fd, name, map, ctx, map_inner_fd);
32e93fb7
DB
1641 if (fd < 0)
1642 return fd;
1643 }
1644
f6793eec 1645 ret = bpf_place_pinned(fd, name, ctx, map->pinning);
32e93fb7
DB
1646 if (ret < 0 && errno != EEXIST) {
1647 fprintf(stderr, "Could not pin %s map: %s\n", name,
1648 strerror(errno));
1649 close(fd);
1650 return ret;
1651 }
1652
1653 return fd;
1654}
1655
32e93fb7
DB
1656static const char *bpf_str_tab_name(const struct bpf_elf_ctx *ctx,
1657 const GElf_Sym *sym)
1658{
1659 return ctx->str_tab->d_buf + sym->st_name;
1660}
1661
1662static const char *bpf_map_fetch_name(struct bpf_elf_ctx *ctx, int which)
1663{
1664 GElf_Sym sym;
11c39b5e
DB
1665 int i;
1666
32e93fb7
DB
1667 for (i = 0; i < ctx->sym_num; i++) {
1668 if (gelf_getsym(ctx->sym_tab, i, &sym) != &sym)
1669 continue;
1670
5230a2ed
DB
1671 if (GELF_ST_BIND(sym.st_info) != STB_GLOBAL ||
1672 GELF_ST_TYPE(sym.st_info) != STT_NOTYPE ||
32e93fb7 1673 sym.st_shndx != ctx->sec_maps ||
e4225669 1674 sym.st_value / ctx->map_len != which)
32e93fb7
DB
1675 continue;
1676
1677 return bpf_str_tab_name(ctx, &sym);
11c39b5e 1678 }
32e93fb7
DB
1679
1680 return NULL;
11c39b5e
DB
1681}
1682
32e93fb7 1683static int bpf_maps_attach_all(struct bpf_elf_ctx *ctx)
11c39b5e 1684{
612ff099 1685 int i, j, ret, fd, inner_fd, inner_idx, have_map_in_map = 0;
32e93fb7 1686 const char *map_name;
11c39b5e 1687
32e93fb7
DB
1688 for (i = 0; i < ctx->map_num; i++) {
1689 map_name = bpf_map_fetch_name(ctx, i);
1690 if (!map_name)
1691 return -EIO;
11c39b5e 1692
ecb05c0f
DB
1693 fd = bpf_map_attach(map_name, ctx, &ctx->maps[i],
1694 &ctx->maps_ext[i], &have_map_in_map);
612ff099
DB
1695 if (fd < 0)
1696 return fd;
1697
1698 ctx->map_fds[i] = !fd ? -1 : fd;
1699 }
1700
1701 for (i = 0; have_map_in_map && i < ctx->map_num; i++) {
1702 if (ctx->map_fds[i] >= 0)
1703 continue;
1704
1705 map_name = bpf_map_fetch_name(ctx, i);
1706 if (!map_name)
1707 return -EIO;
1708
ecb05c0f
DB
1709 fd = bpf_map_attach(map_name, ctx, &ctx->maps[i],
1710 &ctx->maps_ext[i], NULL);
32e93fb7
DB
1711 if (fd < 0)
1712 return fd;
11c39b5e 1713
32e93fb7 1714 ctx->map_fds[i] = fd;
11c39b5e
DB
1715 }
1716
612ff099
DB
1717 for (i = 0; have_map_in_map && i < ctx->map_num; i++) {
1718 if (!ctx->maps[i].id ||
1719 ctx->maps[i].inner_id ||
1720 ctx->maps[i].inner_idx == -1)
1721 continue;
1722
1723 inner_fd = ctx->map_fds[i];
1724 inner_idx = ctx->maps[i].inner_idx;
1725
1726 for (j = 0; j < ctx->map_num; j++) {
1727 if (!bpf_is_map_in_map_type(&ctx->maps[j]))
1728 continue;
1729 if (ctx->maps[j].inner_id != ctx->maps[i].id)
1730 continue;
1731
1732 ret = bpf_map_update(ctx->map_fds[j], &inner_idx,
1733 &inner_fd, BPF_ANY);
1734 if (ret < 0) {
1735 bpf_report_map_in_map(ctx->map_fds[j],
0b5eadc5 1736 inner_idx);
612ff099
DB
1737 return ret;
1738 }
1739 }
1740 }
1741
11c39b5e 1742 return 0;
11c39b5e
DB
1743}
1744
e4225669
DB
1745static int bpf_map_num_sym(struct bpf_elf_ctx *ctx)
1746{
1747 int i, num = 0;
1748 GElf_Sym sym;
1749
1750 for (i = 0; i < ctx->sym_num; i++) {
1751 if (gelf_getsym(ctx->sym_tab, i, &sym) != &sym)
1752 continue;
1753
1754 if (GELF_ST_BIND(sym.st_info) != STB_GLOBAL ||
1755 GELF_ST_TYPE(sym.st_info) != STT_NOTYPE ||
1756 sym.st_shndx != ctx->sec_maps)
1757 continue;
1758 num++;
1759 }
1760
1761 return num;
1762}
1763
32e93fb7
DB
1764static int bpf_fill_section_data(struct bpf_elf_ctx *ctx, int section,
1765 struct bpf_elf_sec_data *data)
11c39b5e 1766{
32e93fb7 1767 Elf_Data *sec_edata;
11c39b5e
DB
1768 GElf_Shdr sec_hdr;
1769 Elf_Scn *sec_fd;
11c39b5e
DB
1770 char *sec_name;
1771
32e93fb7 1772 memset(data, 0, sizeof(*data));
11c39b5e 1773
32e93fb7 1774 sec_fd = elf_getscn(ctx->elf_fd, section);
11c39b5e
DB
1775 if (!sec_fd)
1776 return -EINVAL;
11c39b5e
DB
1777 if (gelf_getshdr(sec_fd, &sec_hdr) != &sec_hdr)
1778 return -EIO;
1779
32e93fb7 1780 sec_name = elf_strptr(ctx->elf_fd, ctx->elf_hdr.e_shstrndx,
11c39b5e
DB
1781 sec_hdr.sh_name);
1782 if (!sec_name || !sec_hdr.sh_size)
1783 return -ENOENT;
1784
1785 sec_edata = elf_getdata(sec_fd, NULL);
1786 if (!sec_edata || elf_getdata(sec_fd, sec_edata))
1787 return -EIO;
1788
32e93fb7 1789 memcpy(&data->sec_hdr, &sec_hdr, sizeof(sec_hdr));
11c39b5e 1790
32e93fb7
DB
1791 data->sec_name = sec_name;
1792 data->sec_data = sec_edata;
11c39b5e
DB
1793 return 0;
1794}
1795
e4225669
DB
1796struct bpf_elf_map_min {
1797 __u32 type;
1798 __u32 size_key;
1799 __u32 size_value;
1800 __u32 max_elem;
1801};
11c39b5e 1802
e4225669
DB
1803static int bpf_fetch_maps_begin(struct bpf_elf_ctx *ctx, int section,
1804 struct bpf_elf_sec_data *data)
1805{
1806 ctx->map_num = data->sec_data->d_size;
32e93fb7
DB
1807 ctx->sec_maps = section;
1808 ctx->sec_done[section] = true;
11c39b5e 1809
e4225669 1810 if (ctx->map_num > sizeof(ctx->maps)) {
32e93fb7
DB
1811 fprintf(stderr, "Too many BPF maps in ELF section!\n");
1812 return -ENOMEM;
1813 }
11c39b5e 1814
e4225669
DB
1815 memcpy(ctx->maps, data->sec_data->d_buf, ctx->map_num);
1816 return 0;
1817}
1818
1819static int bpf_map_verify_all_offs(struct bpf_elf_ctx *ctx, int end)
1820{
1821 GElf_Sym sym;
1822 int off, i;
1823
1824 for (off = 0; off < end; off += ctx->map_len) {
1825 /* Order doesn't need to be linear here, hence we walk
1826 * the table again.
1827 */
1828 for (i = 0; i < ctx->sym_num; i++) {
1829 if (gelf_getsym(ctx->sym_tab, i, &sym) != &sym)
1830 continue;
1831 if (GELF_ST_BIND(sym.st_info) != STB_GLOBAL ||
1832 GELF_ST_TYPE(sym.st_info) != STT_NOTYPE ||
1833 sym.st_shndx != ctx->sec_maps)
1834 continue;
1835 if (sym.st_value == off)
1836 break;
1837 if (i == ctx->sym_num - 1)
1838 return -1;
1839 }
1840 }
1841
1842 return off == end ? 0 : -1;
1843}
1844
1845static int bpf_fetch_maps_end(struct bpf_elf_ctx *ctx)
1846{
1847 struct bpf_elf_map fixup[ARRAY_SIZE(ctx->maps)] = {};
1848 int i, sym_num = bpf_map_num_sym(ctx);
1849 __u8 *buff;
1850
1851 if (sym_num == 0 || sym_num > ARRAY_SIZE(ctx->maps)) {
1852 fprintf(stderr, "%u maps not supported in current map section!\n",
1853 sym_num);
1854 return -EINVAL;
1855 }
1856
1857 if (ctx->map_num % sym_num != 0 ||
1858 ctx->map_num % sizeof(__u32) != 0) {
1859 fprintf(stderr, "Number BPF map symbols are not multiple of struct bpf_elf_map!\n");
1860 return -EINVAL;
1861 }
1862
1863 ctx->map_len = ctx->map_num / sym_num;
1864 if (bpf_map_verify_all_offs(ctx, ctx->map_num)) {
1865 fprintf(stderr, "Different struct bpf_elf_map in use!\n");
1866 return -EINVAL;
1867 }
1868
1869 if (ctx->map_len == sizeof(struct bpf_elf_map)) {
1870 ctx->map_num = sym_num;
1871 return 0;
1872 } else if (ctx->map_len > sizeof(struct bpf_elf_map)) {
1873 fprintf(stderr, "struct bpf_elf_map not supported, coming from future version?\n");
1874 return -EINVAL;
1875 } else if (ctx->map_len < sizeof(struct bpf_elf_map_min)) {
1876 fprintf(stderr, "struct bpf_elf_map too small, not supported!\n");
1877 return -EINVAL;
1878 }
1879
1880 ctx->map_num = sym_num;
1881 for (i = 0, buff = (void *)ctx->maps; i < ctx->map_num;
1882 i++, buff += ctx->map_len) {
1883 /* The fixup leaves the rest of the members as zero, which
1884 * is fine currently, but option exist to set some other
1885 * default value as well when needed in future.
1886 */
1887 memcpy(&fixup[i], buff, ctx->map_len);
1888 }
1889
1890 memcpy(ctx->maps, fixup, sizeof(fixup));
1891
1892 printf("Note: %zu bytes struct bpf_elf_map fixup performed due to size mismatch!\n",
1893 sizeof(struct bpf_elf_map) - ctx->map_len);
32e93fb7
DB
1894 return 0;
1895}
11c39b5e 1896
32e93fb7
DB
1897static int bpf_fetch_license(struct bpf_elf_ctx *ctx, int section,
1898 struct bpf_elf_sec_data *data)
1899{
1900 if (data->sec_data->d_size > sizeof(ctx->license))
1901 return -ENOMEM;
11c39b5e 1902
32e93fb7
DB
1903 memcpy(ctx->license, data->sec_data->d_buf, data->sec_data->d_size);
1904 ctx->sec_done[section] = true;
1905 return 0;
1906}
11c39b5e 1907
32e93fb7
DB
1908static int bpf_fetch_symtab(struct bpf_elf_ctx *ctx, int section,
1909 struct bpf_elf_sec_data *data)
1910{
1911 ctx->sym_tab = data->sec_data;
1912 ctx->sym_num = data->sec_hdr.sh_size / data->sec_hdr.sh_entsize;
1913 ctx->sec_done[section] = true;
11c39b5e
DB
1914 return 0;
1915}
1916
32e93fb7
DB
1917static int bpf_fetch_strtab(struct bpf_elf_ctx *ctx, int section,
1918 struct bpf_elf_sec_data *data)
11c39b5e 1919{
32e93fb7
DB
1920 ctx->str_tab = data->sec_data;
1921 ctx->sec_done[section] = true;
1922 return 0;
1923}
11c39b5e 1924
afc1a200
DB
1925static bool bpf_has_map_data(const struct bpf_elf_ctx *ctx)
1926{
1927 return ctx->sym_tab && ctx->str_tab && ctx->sec_maps;
1928}
1929
32e93fb7
DB
1930static int bpf_fetch_ancillary(struct bpf_elf_ctx *ctx)
1931{
1932 struct bpf_elf_sec_data data;
1933 int i, ret = -1;
11c39b5e 1934
32e93fb7
DB
1935 for (i = 1; i < ctx->elf_hdr.e_shnum; i++) {
1936 ret = bpf_fill_section_data(ctx, i, &data);
11c39b5e
DB
1937 if (ret < 0)
1938 continue;
1939
cce3d466
DB
1940 if (data.sec_hdr.sh_type == SHT_PROGBITS &&
1941 !strcmp(data.sec_name, ELF_SECTION_MAPS))
e4225669 1942 ret = bpf_fetch_maps_begin(ctx, i, &data);
cce3d466
DB
1943 else if (data.sec_hdr.sh_type == SHT_PROGBITS &&
1944 !strcmp(data.sec_name, ELF_SECTION_LICENSE))
32e93fb7 1945 ret = bpf_fetch_license(ctx, i, &data);
cce3d466
DB
1946 else if (data.sec_hdr.sh_type == SHT_SYMTAB &&
1947 !strcmp(data.sec_name, ".symtab"))
32e93fb7
DB
1948 ret = bpf_fetch_symtab(ctx, i, &data);
1949 else if (data.sec_hdr.sh_type == SHT_STRTAB &&
cce3d466 1950 !strcmp(data.sec_name, ".strtab"))
32e93fb7
DB
1951 ret = bpf_fetch_strtab(ctx, i, &data);
1952 if (ret < 0) {
afc1a200 1953 fprintf(stderr, "Error parsing section %d! Perhaps check with readelf -a?\n",
32a121cb 1954 i);
e4225669 1955 return ret;
11c39b5e 1956 }
32e93fb7
DB
1957 }
1958
afc1a200 1959 if (bpf_has_map_data(ctx)) {
e4225669
DB
1960 ret = bpf_fetch_maps_end(ctx);
1961 if (ret < 0) {
1962 fprintf(stderr, "Error fixing up map structure, incompatible struct bpf_elf_map used?\n");
1963 return ret;
1964 }
1965
32e93fb7
DB
1966 ret = bpf_maps_attach_all(ctx);
1967 if (ret < 0) {
1968 fprintf(stderr, "Error loading maps into kernel!\n");
1969 return ret;
11c39b5e
DB
1970 }
1971 }
1972
1973 return ret;
1974}
1975
e4225669
DB
1976static int bpf_fetch_prog(struct bpf_elf_ctx *ctx, const char *section,
1977 bool *sseen)
11c39b5e 1978{
32e93fb7
DB
1979 struct bpf_elf_sec_data data;
1980 struct bpf_elf_prog prog;
1981 int ret, i, fd = -1;
11c39b5e 1982
32e93fb7
DB
1983 for (i = 1; i < ctx->elf_hdr.e_shnum; i++) {
1984 if (ctx->sec_done[i])
11c39b5e
DB
1985 continue;
1986
32e93fb7 1987 ret = bpf_fill_section_data(ctx, i, &data);
cce3d466
DB
1988 if (ret < 0 ||
1989 !(data.sec_hdr.sh_type == SHT_PROGBITS &&
1990 data.sec_hdr.sh_flags & SHF_EXECINSTR &&
1991 !strcmp(data.sec_name, section)))
11c39b5e
DB
1992 continue;
1993
e4225669
DB
1994 *sseen = true;
1995
32e93fb7
DB
1996 memset(&prog, 0, sizeof(prog));
1997 prog.type = ctx->type;
1998 prog.insns = data.sec_data->d_buf;
1999 prog.size = data.sec_data->d_size;
2000 prog.license = ctx->license;
11c39b5e 2001
f31645d1 2002 fd = bpf_prog_attach(section, &prog, ctx);
32e93fb7 2003 if (fd < 0)
e4225669 2004 return fd;
11c39b5e 2005
32e93fb7 2006 ctx->sec_done[i] = true;
11c39b5e
DB
2007 break;
2008 }
2009
32e93fb7 2010 return fd;
11c39b5e
DB
2011}
2012
ecb05c0f
DB
2013struct bpf_tail_call_props {
2014 unsigned int total;
2015 unsigned int jited;
2016};
2017
32e93fb7
DB
2018static int bpf_apply_relo_data(struct bpf_elf_ctx *ctx,
2019 struct bpf_elf_sec_data *data_relo,
ecb05c0f
DB
2020 struct bpf_elf_sec_data *data_insn,
2021 struct bpf_tail_call_props *props)
11c39b5e 2022{
32e93fb7
DB
2023 Elf_Data *idata = data_insn->sec_data;
2024 GElf_Shdr *rhdr = &data_relo->sec_hdr;
2025 int relo_ent, relo_num = rhdr->sh_size / rhdr->sh_entsize;
2026 struct bpf_insn *insns = idata->d_buf;
2027 unsigned int num_insns = idata->d_size / sizeof(*insns);
11c39b5e 2028
32e93fb7
DB
2029 for (relo_ent = 0; relo_ent < relo_num; relo_ent++) {
2030 unsigned int ioff, rmap;
2031 GElf_Rel relo;
2032 GElf_Sym sym;
2033
2034 if (gelf_getrel(data_relo->sec_data, relo_ent, &relo) != &relo)
2035 return -EIO;
2036
2037 ioff = relo.r_offset / sizeof(struct bpf_insn);
2038 if (ioff >= num_insns ||
a576c6b9 2039 insns[ioff].code != (BPF_LD | BPF_IMM | BPF_DW)) {
32a121cb 2040 fprintf(stderr, "ELF contains relo data for non ld64 instruction at offset %u! Compiler bug?!\n",
a576c6b9
DB
2041 ioff);
2042 if (ioff < num_insns &&
2043 insns[ioff].code == (BPF_JMP | BPF_CALL))
32a121cb 2044 fprintf(stderr, " - Try to annotate functions with always_inline attribute!\n");
32e93fb7 2045 return -EINVAL;
a576c6b9 2046 }
32e93fb7
DB
2047
2048 if (gelf_getsym(ctx->sym_tab, GELF_R_SYM(relo.r_info), &sym) != &sym)
2049 return -EIO;
2486337a 2050 if (sym.st_shndx != ctx->sec_maps) {
32a121cb 2051 fprintf(stderr, "ELF contains non-map related relo data in entry %u pointing to section %u! Compiler bug?!\n",
2486337a
DB
2052 relo_ent, sym.st_shndx);
2053 return -EIO;
2054 }
32e93fb7 2055
e4225669 2056 rmap = sym.st_value / ctx->map_len;
32e93fb7
DB
2057 if (rmap >= ARRAY_SIZE(ctx->map_fds))
2058 return -EINVAL;
2059 if (!ctx->map_fds[rmap])
2060 return -EINVAL;
ecb05c0f
DB
2061 if (ctx->maps[rmap].type == BPF_MAP_TYPE_PROG_ARRAY) {
2062 props->total++;
2063 if (ctx->maps_ext[rmap].owner.jited ||
2064 (ctx->maps_ext[rmap].owner.type == 0 &&
2065 ctx->cfg.jit_enabled))
2066 props->jited++;
2067 }
32e93fb7
DB
2068
2069 if (ctx->verbose)
32a121cb 2070 fprintf(stderr, "Map \'%s\' (%d) injected into prog section \'%s\' at offset %u!\n",
32e93fb7
DB
2071 bpf_str_tab_name(ctx, &sym), ctx->map_fds[rmap],
2072 data_insn->sec_name, ioff);
11c39b5e 2073
32e93fb7
DB
2074 insns[ioff].src_reg = BPF_PSEUDO_MAP_FD;
2075 insns[ioff].imm = ctx->map_fds[rmap];
2076 }
2077
2078 return 0;
2079}
2080
afc1a200 2081static int bpf_fetch_prog_relo(struct bpf_elf_ctx *ctx, const char *section,
e4225669 2082 bool *lderr, bool *sseen)
32e93fb7
DB
2083{
2084 struct bpf_elf_sec_data data_relo, data_insn;
2085 struct bpf_elf_prog prog;
2086 int ret, idx, i, fd = -1;
2087
2088 for (i = 1; i < ctx->elf_hdr.e_shnum; i++) {
ecb05c0f
DB
2089 struct bpf_tail_call_props props = {};
2090
32e93fb7
DB
2091 ret = bpf_fill_section_data(ctx, i, &data_relo);
2092 if (ret < 0 || data_relo.sec_hdr.sh_type != SHT_REL)
11c39b5e
DB
2093 continue;
2094
32e93fb7 2095 idx = data_relo.sec_hdr.sh_info;
e4225669 2096
32e93fb7 2097 ret = bpf_fill_section_data(ctx, idx, &data_insn);
cce3d466
DB
2098 if (ret < 0 ||
2099 !(data_insn.sec_hdr.sh_type == SHT_PROGBITS &&
2100 data_insn.sec_hdr.sh_flags & SHF_EXECINSTR &&
2101 !strcmp(data_insn.sec_name, section)))
11c39b5e 2102 continue;
32e93fb7 2103
e4225669
DB
2104 *sseen = true;
2105
ecb05c0f 2106 ret = bpf_apply_relo_data(ctx, &data_relo, &data_insn, &props);
c9c3720d
DB
2107 if (ret < 0) {
2108 *lderr = true;
e4225669 2109 return ret;
c9c3720d 2110 }
11c39b5e 2111
32e93fb7
DB
2112 memset(&prog, 0, sizeof(prog));
2113 prog.type = ctx->type;
2114 prog.insns = data_insn.sec_data->d_buf;
2115 prog.size = data_insn.sec_data->d_size;
2116 prog.license = ctx->license;
2117
f31645d1 2118 fd = bpf_prog_attach(section, &prog, ctx);
afc1a200
DB
2119 if (fd < 0) {
2120 *lderr = true;
ecb05c0f
DB
2121 if (props.total) {
2122 if (ctx->cfg.jit_enabled &&
2123 props.total != props.jited)
2124 fprintf(stderr, "JIT enabled, but only %u/%u tail call maps in the program have JITed owner!\n",
2125 props.jited, props.total);
2126 if (!ctx->cfg.jit_enabled &&
2127 props.jited)
2128 fprintf(stderr, "JIT disabled, but %u/%u tail call maps in the program have JITed owner!\n",
2129 props.jited, props.total);
2130 }
e4225669 2131 return fd;
afc1a200 2132 }
11c39b5e 2133
32e93fb7
DB
2134 ctx->sec_done[i] = true;
2135 ctx->sec_done[idx] = true;
11c39b5e
DB
2136 break;
2137 }
2138
32e93fb7 2139 return fd;
11c39b5e
DB
2140}
2141
32e93fb7 2142static int bpf_fetch_prog_sec(struct bpf_elf_ctx *ctx, const char *section)
473d7840 2143{
e4225669 2144 bool lderr = false, sseen = false;
473d7840
DB
2145 int ret = -1;
2146
afc1a200 2147 if (bpf_has_map_data(ctx))
e4225669 2148 ret = bpf_fetch_prog_relo(ctx, section, &lderr, &sseen);
afc1a200 2149 if (ret < 0 && !lderr)
e4225669
DB
2150 ret = bpf_fetch_prog(ctx, section, &sseen);
2151 if (ret < 0 && !sseen)
2152 fprintf(stderr, "Program section \'%s\' not found in ELF file!\n",
2153 section);
473d7840
DB
2154 return ret;
2155}
2156
910b543d
DB
2157static int bpf_find_map_by_id(struct bpf_elf_ctx *ctx, uint32_t id)
2158{
2159 int i;
2160
2161 for (i = 0; i < ARRAY_SIZE(ctx->map_fds); i++)
2162 if (ctx->map_fds[i] && ctx->maps[i].id == id &&
2163 ctx->maps[i].type == BPF_MAP_TYPE_PROG_ARRAY)
2164 return i;
2165 return -1;
2166}
2167
ecb05c0f
DB
2168struct bpf_jited_aux {
2169 int prog_fd;
2170 int map_fd;
2171 struct bpf_prog_data prog;
2172 struct bpf_map_ext map;
2173};
2174
2175static int bpf_derive_prog_from_fdinfo(int fd, struct bpf_prog_data *prog)
2176{
2177 char file[PATH_MAX], buff[4096];
2178 unsigned int val;
2179 FILE *fp;
2180
2181 snprintf(file, sizeof(file), "/proc/%d/fdinfo/%d", getpid(), fd);
2182 memset(prog, 0, sizeof(*prog));
2183
2184 fp = fopen(file, "r");
2185 if (!fp) {
2186 fprintf(stderr, "No procfs support?!\n");
2187 return -EIO;
2188 }
2189
2190 while (fgets(buff, sizeof(buff), fp)) {
2191 if (sscanf(buff, "prog_type:\t%u", &val) == 1)
2192 prog->type = val;
2193 else if (sscanf(buff, "prog_jited:\t%u", &val) == 1)
2194 prog->jited = val;
2195 }
2196
2197 fclose(fp);
2198 return 0;
2199}
2200
2201static int bpf_tail_call_get_aux(struct bpf_jited_aux *aux)
2202{
2203 struct bpf_elf_map tmp;
2204 int ret;
2205
2206 ret = bpf_derive_elf_map_from_fdinfo(aux->map_fd, &tmp, &aux->map);
2207 if (!ret)
2208 ret = bpf_derive_prog_from_fdinfo(aux->prog_fd, &aux->prog);
2209
2210 return ret;
2211}
2212
32e93fb7 2213static int bpf_fill_prog_arrays(struct bpf_elf_ctx *ctx)
473d7840 2214{
32e93fb7
DB
2215 struct bpf_elf_sec_data data;
2216 uint32_t map_id, key_id;
910b543d 2217 int fd, i, ret, idx;
473d7840 2218
32e93fb7
DB
2219 for (i = 1; i < ctx->elf_hdr.e_shnum; i++) {
2220 if (ctx->sec_done[i])
473d7840
DB
2221 continue;
2222
32e93fb7 2223 ret = bpf_fill_section_data(ctx, i, &data);
473d7840
DB
2224 if (ret < 0)
2225 continue;
2226
910b543d
DB
2227 ret = sscanf(data.sec_name, "%i/%i", &map_id, &key_id);
2228 if (ret != 2)
32e93fb7 2229 continue;
910b543d
DB
2230
2231 idx = bpf_find_map_by_id(ctx, map_id);
2232 if (idx < 0)
473d7840
DB
2233 continue;
2234
32e93fb7
DB
2235 fd = bpf_fetch_prog_sec(ctx, data.sec_name);
2236 if (fd < 0)
473d7840
DB
2237 return -EIO;
2238
910b543d
DB
2239 ret = bpf_map_update(ctx->map_fds[idx], &key_id,
2240 &fd, BPF_ANY);
afc1a200 2241 if (ret < 0) {
ecb05c0f
DB
2242 struct bpf_jited_aux aux = {};
2243
2244 ret = -errno;
2245 if (errno == E2BIG) {
afc1a200
DB
2246 fprintf(stderr, "Tail call key %u for map %u out of bounds?\n",
2247 key_id, map_id);
ecb05c0f
DB
2248 return ret;
2249 }
2250
2251 aux.map_fd = ctx->map_fds[idx];
2252 aux.prog_fd = fd;
2253
2254 if (bpf_tail_call_get_aux(&aux))
2255 return ret;
2256 if (!aux.map.owner.type)
2257 return ret;
2258
2259 if (aux.prog.type != aux.map.owner.type)
2260 fprintf(stderr, "Tail call map owned by prog type %u, but prog type is %u!\n",
2261 aux.map.owner.type, aux.prog.type);
2262 if (aux.prog.jited != aux.map.owner.jited)
2263 fprintf(stderr, "Tail call map %s jited, but prog %s!\n",
2264 aux.map.owner.jited ? "is" : "not",
2265 aux.prog.jited ? "is" : "not");
2266 return ret;
afc1a200 2267 }
473d7840 2268
32e93fb7 2269 ctx->sec_done[i] = true;
473d7840
DB
2270 }
2271
2272 return 0;
2273}
2274
32e93fb7 2275static void bpf_save_finfo(struct bpf_elf_ctx *ctx)
11c39b5e 2276{
32e93fb7
DB
2277 struct stat st;
2278 int ret;
11c39b5e 2279
32e93fb7 2280 memset(&ctx->stat, 0, sizeof(ctx->stat));
11c39b5e 2281
32e93fb7
DB
2282 ret = fstat(ctx->obj_fd, &st);
2283 if (ret < 0) {
2284 fprintf(stderr, "Stat of elf file failed: %s\n",
2285 strerror(errno));
2286 return;
2287 }
11c39b5e 2288
32e93fb7
DB
2289 ctx->stat.st_dev = st.st_dev;
2290 ctx->stat.st_ino = st.st_ino;
2291}
2292
f6793eec
DB
2293static int bpf_read_pin_mapping(FILE *fp, uint32_t *id, char *path)
2294{
2295 char buff[PATH_MAX];
2296
2297 while (fgets(buff, sizeof(buff), fp)) {
2298 char *ptr = buff;
2299
2300 while (*ptr == ' ' || *ptr == '\t')
2301 ptr++;
2302
2303 if (*ptr == '#' || *ptr == '\n' || *ptr == 0)
2304 continue;
2305
2306 if (sscanf(ptr, "%i %s\n", id, path) != 2 &&
2307 sscanf(ptr, "%i %s #", id, path) != 2) {
2308 strcpy(path, ptr);
2309 return -1;
2310 }
2311
2312 return 1;
2313 }
2314
2315 return 0;
2316}
2317
2318static bool bpf_pinning_reserved(uint32_t pinning)
2319{
2320 switch (pinning) {
2321 case PIN_NONE:
2322 case PIN_OBJECT_NS:
2323 case PIN_GLOBAL_NS:
2324 return true;
2325 default:
2326 return false;
2327 }
2328}
2329
2330static void bpf_hash_init(struct bpf_elf_ctx *ctx, const char *db_file)
2331{
2332 struct bpf_hash_entry *entry;
d17b136f 2333 char subpath[PATH_MAX] = {};
f6793eec
DB
2334 uint32_t pinning;
2335 FILE *fp;
2336 int ret;
2337
2338 fp = fopen(db_file, "r");
2339 if (!fp)
2340 return;
2341
f6793eec
DB
2342 while ((ret = bpf_read_pin_mapping(fp, &pinning, subpath))) {
2343 if (ret == -1) {
2344 fprintf(stderr, "Database %s is corrupted at: %s\n",
2345 db_file, subpath);
2346 fclose(fp);
2347 return;
2348 }
2349
2350 if (bpf_pinning_reserved(pinning)) {
32a121cb
SH
2351 fprintf(stderr, "Database %s, id %u is reserved - ignoring!\n",
2352 db_file, pinning);
f6793eec
DB
2353 continue;
2354 }
2355
2356 entry = malloc(sizeof(*entry));
2357 if (!entry) {
2358 fprintf(stderr, "No memory left for db entry!\n");
2359 continue;
2360 }
2361
2362 entry->pinning = pinning;
2363 entry->subpath = strdup(subpath);
2364 if (!entry->subpath) {
2365 fprintf(stderr, "No memory left for db entry!\n");
2366 free(entry);
2367 continue;
2368 }
2369
2370 entry->next = ctx->ht[pinning & (ARRAY_SIZE(ctx->ht) - 1)];
2371 ctx->ht[pinning & (ARRAY_SIZE(ctx->ht) - 1)] = entry;
2372 }
2373
2374 fclose(fp);
2375}
2376
2377static void bpf_hash_destroy(struct bpf_elf_ctx *ctx)
2378{
2379 struct bpf_hash_entry *entry;
2380 int i;
2381
2382 for (i = 0; i < ARRAY_SIZE(ctx->ht); i++) {
2383 while ((entry = ctx->ht[i]) != NULL) {
2384 ctx->ht[i] = entry->next;
2385 free((char *)entry->subpath);
2386 free(entry);
2387 }
2388 }
2389}
2390
8187b012
DB
2391static int bpf_elf_check_ehdr(const struct bpf_elf_ctx *ctx)
2392{
2393 if (ctx->elf_hdr.e_type != ET_REL ||
e77fa41d
DB
2394 (ctx->elf_hdr.e_machine != EM_NONE &&
2395 ctx->elf_hdr.e_machine != EM_BPF) ||
8187b012
DB
2396 ctx->elf_hdr.e_version != EV_CURRENT) {
2397 fprintf(stderr, "ELF format error, ELF file not for eBPF?\n");
2398 return -EINVAL;
2399 }
2400
2401 switch (ctx->elf_hdr.e_ident[EI_DATA]) {
2402 default:
2403 fprintf(stderr, "ELF format error, wrong endianness info?\n");
2404 return -EINVAL;
2405 case ELFDATA2LSB:
2406 if (htons(1) == 1) {
2407 fprintf(stderr,
2408 "We are big endian, eBPF object is little endian!\n");
2409 return -EIO;
2410 }
2411 break;
2412 case ELFDATA2MSB:
2413 if (htons(1) != 1) {
2414 fprintf(stderr,
2415 "We are little endian, eBPF object is big endian!\n");
2416 return -EIO;
2417 }
2418 break;
2419 }
2420
2421 return 0;
2422}
2423
ecb05c0f
DB
2424static void bpf_get_cfg(struct bpf_elf_ctx *ctx)
2425{
2426 static const char *path_jit = "/proc/sys/net/core/bpf_jit_enable";
2427 int fd;
2428
2429 fd = open(path_jit, O_RDONLY);
2430 if (fd > 0) {
2431 char tmp[16] = {};
2432
2433 if (read(fd, tmp, sizeof(tmp)) > 0)
2434 ctx->cfg.jit_enabled = atoi(tmp);
2435 close(fd);
2436 }
2437}
2438
32e93fb7 2439static int bpf_elf_ctx_init(struct bpf_elf_ctx *ctx, const char *pathname,
65fdae3d
JK
2440 enum bpf_prog_type type, __u32 ifindex,
2441 bool verbose)
32e93fb7
DB
2442{
2443 int ret = -EINVAL;
2444
2445 if (elf_version(EV_CURRENT) == EV_NONE ||
2446 bpf_init_env(pathname))
2447 return ret;
2448
2449 memset(ctx, 0, sizeof(*ctx));
ecb05c0f 2450 bpf_get_cfg(ctx);
32e93fb7
DB
2451 ctx->verbose = verbose;
2452 ctx->type = type;
65fdae3d 2453 ctx->ifindex = ifindex;
32e93fb7
DB
2454
2455 ctx->obj_fd = open(pathname, O_RDONLY);
2456 if (ctx->obj_fd < 0)
2457 return ctx->obj_fd;
2458
2459 ctx->elf_fd = elf_begin(ctx->obj_fd, ELF_C_READ, NULL);
2460 if (!ctx->elf_fd) {
11c39b5e 2461 ret = -EINVAL;
32e93fb7 2462 goto out_fd;
11c39b5e
DB
2463 }
2464
8187b012
DB
2465 if (elf_kind(ctx->elf_fd) != ELF_K_ELF) {
2466 ret = -EINVAL;
2467 goto out_fd;
2468 }
2469
32e93fb7
DB
2470 if (gelf_getehdr(ctx->elf_fd, &ctx->elf_hdr) !=
2471 &ctx->elf_hdr) {
11c39b5e
DB
2472 ret = -EIO;
2473 goto out_elf;
2474 }
2475
8187b012
DB
2476 ret = bpf_elf_check_ehdr(ctx);
2477 if (ret < 0)
2478 goto out_elf;
2479
32e93fb7
DB
2480 ctx->sec_done = calloc(ctx->elf_hdr.e_shnum,
2481 sizeof(*(ctx->sec_done)));
2482 if (!ctx->sec_done) {
11c39b5e
DB
2483 ret = -ENOMEM;
2484 goto out_elf;
2485 }
2486
f31645d1
DB
2487 if (ctx->verbose && bpf_log_realloc(ctx)) {
2488 ret = -ENOMEM;
2489 goto out_free;
2490 }
2491
32e93fb7 2492 bpf_save_finfo(ctx);
f6793eec
DB
2493 bpf_hash_init(ctx, CONFDIR "/bpf_pinning");
2494
32e93fb7 2495 return 0;
f31645d1
DB
2496out_free:
2497 free(ctx->sec_done);
32e93fb7
DB
2498out_elf:
2499 elf_end(ctx->elf_fd);
2500out_fd:
2501 close(ctx->obj_fd);
2502 return ret;
2503}
d937a74b 2504
32e93fb7
DB
2505static int bpf_maps_count(struct bpf_elf_ctx *ctx)
2506{
2507 int i, count = 0;
11c39b5e 2508
32e93fb7
DB
2509 for (i = 0; i < ARRAY_SIZE(ctx->map_fds); i++) {
2510 if (!ctx->map_fds[i])
2511 break;
2512 count++;
2513 }
473d7840 2514
32e93fb7
DB
2515 return count;
2516}
6256f8c9 2517
32e93fb7
DB
2518static void bpf_maps_teardown(struct bpf_elf_ctx *ctx)
2519{
2520 int i;
2521
2522 for (i = 0; i < ARRAY_SIZE(ctx->map_fds); i++) {
2523 if (ctx->map_fds[i])
2524 close(ctx->map_fds[i]);
473d7840 2525 }
32e93fb7
DB
2526}
2527
2528static void bpf_elf_ctx_destroy(struct bpf_elf_ctx *ctx, bool failure)
2529{
2530 if (failure)
2531 bpf_maps_teardown(ctx);
473d7840 2532
f6793eec 2533 bpf_hash_destroy(ctx);
f31645d1 2534
32e93fb7 2535 free(ctx->sec_done);
f31645d1
DB
2536 free(ctx->log);
2537
32e93fb7
DB
2538 elf_end(ctx->elf_fd);
2539 close(ctx->obj_fd);
2540}
6256f8c9 2541
32e93fb7 2542static struct bpf_elf_ctx __ctx;
6256f8c9 2543
32e93fb7 2544static int bpf_obj_open(const char *pathname, enum bpf_prog_type type,
65fdae3d 2545 const char *section, __u32 ifindex, bool verbose)
32e93fb7
DB
2546{
2547 struct bpf_elf_ctx *ctx = &__ctx;
2548 int fd = 0, ret;
6256f8c9 2549
65fdae3d 2550 ret = bpf_elf_ctx_init(ctx, pathname, type, ifindex, verbose);
32e93fb7
DB
2551 if (ret < 0) {
2552 fprintf(stderr, "Cannot initialize ELF context!\n");
2553 return ret;
2554 }
6256f8c9 2555
32e93fb7
DB
2556 ret = bpf_fetch_ancillary(ctx);
2557 if (ret < 0) {
2558 fprintf(stderr, "Error fetching ELF ancillary data!\n");
2559 goto out;
2560 }
2561
2562 fd = bpf_fetch_prog_sec(ctx, section);
2563 if (fd < 0) {
2564 fprintf(stderr, "Error fetching program/map!\n");
2565 ret = fd;
2566 goto out;
2567 }
2568
2569 ret = bpf_fill_prog_arrays(ctx);
2570 if (ret < 0)
2571 fprintf(stderr, "Error filling program arrays!\n");
11c39b5e 2572out:
32e93fb7
DB
2573 bpf_elf_ctx_destroy(ctx, ret < 0);
2574 if (ret < 0) {
2575 if (fd)
2576 close(fd);
2577 return ret;
2578 }
2579
2580 return fd;
6256f8c9 2581}
11c39b5e 2582
6256f8c9 2583static int
4bd62446
DB
2584bpf_map_set_send(int fd, struct sockaddr_un *addr, unsigned int addr_len,
2585 const struct bpf_map_data *aux, unsigned int entries)
6256f8c9 2586{
d17b136f
PS
2587 struct bpf_map_set_msg msg = {
2588 .aux.uds_ver = BPF_SCM_AUX_VER,
2589 .aux.num_ent = entries,
2590 };
6256f8c9
DB
2591 int *cmsg_buf, min_fd;
2592 char *amsg_buf;
2593 int i;
2594
6256f8c9
DB
2595 strncpy(msg.aux.obj_name, aux->obj, sizeof(msg.aux.obj_name));
2596 memcpy(&msg.aux.obj_st, aux->st, sizeof(msg.aux.obj_st));
2597
2598 cmsg_buf = bpf_map_set_init(&msg, addr, addr_len);
2599 amsg_buf = (char *)msg.aux.ent;
2600
4bd62446 2601 for (i = 0; i < entries; i += min_fd) {
6256f8c9
DB
2602 int ret;
2603
4bd62446 2604 min_fd = min(BPF_SCM_MAX_FDS * 1U, entries - i);
6256f8c9
DB
2605 bpf_map_set_init_single(&msg, min_fd);
2606
2607 memcpy(cmsg_buf, &aux->fds[i], sizeof(aux->fds[0]) * min_fd);
2608 memcpy(amsg_buf, &aux->ent[i], sizeof(aux->ent[0]) * min_fd);
2609
2610 ret = sendmsg(fd, &msg.hdr, 0);
2611 if (ret <= 0)
2612 return ret ? : -1;
2613 }
2614
2615 return 0;
11c39b5e
DB
2616}
2617
4bd62446
DB
2618static int
2619bpf_map_set_recv(int fd, int *fds, struct bpf_map_aux *aux,
2620 unsigned int entries)
2621{
2622 struct bpf_map_set_msg msg;
2623 int *cmsg_buf, min_fd;
2624 char *amsg_buf, *mmsg_buf;
2625 unsigned int needed = 1;
2626 int i;
2627
2628 cmsg_buf = bpf_map_set_init(&msg, NULL, 0);
2629 amsg_buf = (char *)msg.aux.ent;
2630 mmsg_buf = (char *)&msg.aux;
2631
2632 for (i = 0; i < min(entries, needed); i += min_fd) {
2633 struct cmsghdr *cmsg;
2634 int ret;
2635
2636 min_fd = min(entries, entries - i);
2637 bpf_map_set_init_single(&msg, min_fd);
2638
2639 ret = recvmsg(fd, &msg.hdr, 0);
2640 if (ret <= 0)
2641 return ret ? : -1;
2642
2643 cmsg = CMSG_FIRSTHDR(&msg.hdr);
2644 if (!cmsg || cmsg->cmsg_type != SCM_RIGHTS)
2645 return -EINVAL;
2646 if (msg.hdr.msg_flags & MSG_CTRUNC)
2647 return -EIO;
2648 if (msg.aux.uds_ver != BPF_SCM_AUX_VER)
2649 return -ENOSYS;
2650
2651 min_fd = (cmsg->cmsg_len - sizeof(*cmsg)) / sizeof(fd);
2652 if (min_fd > entries || min_fd <= 0)
2653 return -EINVAL;
2654
2655 memcpy(&fds[i], cmsg_buf, sizeof(fds[0]) * min_fd);
2656 memcpy(&aux->ent[i], amsg_buf, sizeof(aux->ent[0]) * min_fd);
2657 memcpy(aux, mmsg_buf, offsetof(struct bpf_map_aux, ent));
2658
2659 needed = aux->num_ent;
2660 }
2661
2662 return 0;
2663}
2664
2665int bpf_send_map_fds(const char *path, const char *obj)
6256f8c9 2666{
32e93fb7 2667 struct bpf_elf_ctx *ctx = &__ctx;
d17b136f
PS
2668 struct sockaddr_un addr = { .sun_family = AF_UNIX };
2669 struct bpf_map_data bpf_aux = {
2670 .fds = ctx->map_fds,
2671 .ent = ctx->maps,
2672 .st = &ctx->stat,
2673 .obj = obj,
2674 };
6256f8c9
DB
2675 int fd, ret;
2676
2677 fd = socket(AF_UNIX, SOCK_DGRAM, 0);
2678 if (fd < 0) {
2679 fprintf(stderr, "Cannot open socket: %s\n",
2680 strerror(errno));
2681 return -1;
2682 }
2683
6256f8c9
DB
2684 strncpy(addr.sun_path, path, sizeof(addr.sun_path));
2685
2686 ret = connect(fd, (struct sockaddr *)&addr, sizeof(addr));
2687 if (ret < 0) {
2688 fprintf(stderr, "Cannot connect to %s: %s\n",
2689 path, strerror(errno));
2690 return -1;
2691 }
2692
4bd62446 2693 ret = bpf_map_set_send(fd, &addr, sizeof(addr), &bpf_aux,
32e93fb7 2694 bpf_maps_count(ctx));
6256f8c9 2695 if (ret < 0)
4bd62446
DB
2696 fprintf(stderr, "Cannot send fds to %s: %s\n",
2697 path, strerror(errno));
2698
32e93fb7 2699 bpf_maps_teardown(ctx);
4bd62446
DB
2700 close(fd);
2701 return ret;
2702}
2703
2704int bpf_recv_map_fds(const char *path, int *fds, struct bpf_map_aux *aux,
2705 unsigned int entries)
2706{
d17b136f 2707 struct sockaddr_un addr = { .sun_family = AF_UNIX };
4bd62446
DB
2708 int fd, ret;
2709
2710 fd = socket(AF_UNIX, SOCK_DGRAM, 0);
2711 if (fd < 0) {
2712 fprintf(stderr, "Cannot open socket: %s\n",
2713 strerror(errno));
2714 return -1;
2715 }
2716
4bd62446
DB
2717 strncpy(addr.sun_path, path, sizeof(addr.sun_path));
2718
2719 ret = bind(fd, (struct sockaddr *)&addr, sizeof(addr));
2720 if (ret < 0) {
2721 fprintf(stderr, "Cannot bind to socket: %s\n",
2722 strerror(errno));
2723 return -1;
2724 }
2725
2726 ret = bpf_map_set_recv(fd, fds, aux, entries);
2727 if (ret < 0)
2728 fprintf(stderr, "Cannot recv fds from %s: %s\n",
6256f8c9
DB
2729 path, strerror(errno));
2730
4bd62446 2731 unlink(addr.sun_path);
6256f8c9
DB
2732 close(fd);
2733 return ret;
2734}
11c39b5e 2735#endif /* HAVE_ELF */