libbpf.c 207.1 KB
Newer Older
1
// SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause)
2

3 4 5 6 7 8
/*
 * Common eBPF ELF object loading operations.
 *
 * Copyright (C) 2013-2015 Alexei Starovoitov <ast@kernel.org>
 * Copyright (C) 2015 Wang Nan <wangnan0@huawei.com>
 * Copyright (C) 2015 Huawei Inc.
9
 * Copyright (C) 2017 Nicira, Inc.
10
 * Copyright (C) 2019 Isovalent, Inc.
11 12
 */

13
#ifndef _GNU_SOURCE
14
#define _GNU_SOURCE
15
#endif
16
#include <stdlib.h>
17 18
#include <stdio.h>
#include <stdarg.h>
19
#include <libgen.h>
20
#include <inttypes.h>
21
#include <limits.h>
22
#include <string.h>
23
#include <unistd.h>
24
#include <endian.h>
25 26
#include <fcntl.h>
#include <errno.h>
27
#include <asm/unistd.h>
28
#include <linux/err.h>
29
#include <linux/kernel.h>
30
#include <linux/bpf.h>
31
#include <linux/btf.h>
32
#include <linux/filter.h>
33
#include <linux/list.h>
34
#include <linux/limits.h>
35
#include <linux/perf_event.h>
36
#include <linux/ring_buffer.h>
37
#include <linux/version.h>
A
Andrii Nakryiko 已提交
38
#include <sys/epoll.h>
39
#include <sys/ioctl.h>
A
Andrii Nakryiko 已提交
40
#include <sys/mman.h>
41 42 43
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/vfs.h>
44
#include <sys/utsname.h>
45
#include <sys/resource.h>
46
#include <tools/libc_compat.h>
47 48
#include <libelf.h>
#include <gelf.h>
49
#include <zlib.h>
50 51

#include "libbpf.h"
52
#include "bpf.h"
53
#include "btf.h"
54
#include "str_error.h"
55
#include "libbpf_internal.h"
56
#include "hashmap.h"
57

58 59 60
/* make sure libbpf doesn't use kernel-only integer typedefs */
#pragma GCC poison u8 u16 u32 u64 s8 s16 s32 s64

61 62 63 64
#ifndef EM_BPF
#define EM_BPF 247
#endif

65 66 67 68
#ifndef BPF_FS_MAGIC
#define BPF_FS_MAGIC		0xcafe4a11
#endif

69 70 71 72 73
/* vsprintf() in __base_pr() uses nonliteral format string. It may break
 * compilation if user enables corresponding warning. Disable it explicitly.
 */
#pragma GCC diagnostic ignored "-Wformat-nonliteral"

74 75
#define __printf(a, b)	__attribute__((format(printf, a, b)))

76 77 78 79 80 81
static struct bpf_map *bpf_object__add_map(struct bpf_object *obj);
static struct bpf_program *bpf_object__find_prog_by_idx(struct bpf_object *obj,
							int idx);
static const struct btf_type *
skip_mods_and_typedefs(const struct btf *btf, __u32 id, __u32 *res_id);

S
Stanislav Fomichev 已提交
82 83
static int __base_pr(enum libbpf_print_level level, const char *format,
		     va_list args)
84
{
85 86 87
	if (level == LIBBPF_DEBUG)
		return 0;

S
Stanislav Fomichev 已提交
88
	return vfprintf(stderr, format, args);
89 90
}

S
Stanislav Fomichev 已提交
91
static libbpf_print_fn_t __libbpf_pr = __base_pr;
92

93
libbpf_print_fn_t libbpf_set_print(libbpf_print_fn_t fn)
94
{
95 96
	libbpf_print_fn_t old_print_fn = __libbpf_pr;

97
	__libbpf_pr = fn;
98
	return old_print_fn;
99
}
100

101 102 103 104 105
__printf(2, 3)
void libbpf_print(enum libbpf_print_level level, const char *format, ...)
{
	va_list args;

106 107 108
	if (!__libbpf_pr)
		return;

109
	va_start(args, format);
110
	__libbpf_pr(level, format, args);
111 112 113
	va_end(args);
}

114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129
static void pr_perm_msg(int err)
{
	struct rlimit limit;
	char buf[100];

	if (err != -EPERM || geteuid() != 0)
		return;

	err = getrlimit(RLIMIT_MEMLOCK, &limit);
	if (err)
		return;

	if (limit.rlim_cur == RLIM_INFINITY)
		return;

	if (limit.rlim_cur < 1024)
130
		snprintf(buf, sizeof(buf), "%zu bytes", (size_t)limit.rlim_cur);
131 132 133 134 135 136 137 138 139
	else if (limit.rlim_cur < 1024*1024)
		snprintf(buf, sizeof(buf), "%.1f KiB", (double)limit.rlim_cur / 1024);
	else
		snprintf(buf, sizeof(buf), "%.1f MiB", (double)limit.rlim_cur / (1024*1024));

	pr_warn("permission error while running as root; try raising 'ulimit -l'? current value: %s\n",
		buf);
}

140 141
#define STRERR_BUFSIZE  128

142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161
/* Copied from tools/perf/util/util.h */
#ifndef zfree
# define zfree(ptr) ({ free(*ptr); *ptr = NULL; })
#endif

#ifndef zclose
# define zclose(fd) ({			\
	int ___err = 0;			\
	if ((fd) >= 0)			\
		___err = close((fd));	\
	fd = -1;			\
	___err; })
#endif

#ifdef HAVE_LIBELF_MMAP_SUPPORT
# define LIBBPF_ELF_C_READ_MMAP ELF_C_READ_MMAP
#else
# define LIBBPF_ELF_C_READ_MMAP ELF_C_READ
#endif

162 163 164 165 166
static inline __u64 ptr_to_u64(const void *ptr)
{
	return (__u64) (unsigned long) ptr;
}

167 168 169
struct bpf_capabilities {
	/* v4.14: kernel support for program & map names. */
	__u32 name:1;
170 171
	/* v5.2: kernel support for global data sections. */
	__u32 global_data:1;
172 173 174 175
	/* BTF_KIND_FUNC and BTF_KIND_FUNC_PROTO support */
	__u32 btf_func:1;
	/* BTF_KIND_VAR and BTF_KIND_DATASEC support */
	__u32 btf_datasec:1;
176 177
	/* BPF_F_MMAPABLE is supported for arrays */
	__u32 array_mmap:1;
178 179
	/* BTF_FUNC_GLOBAL is supported */
	__u32 btf_func_global:1;
180 181
};

182 183 184 185 186 187 188 189 190 191 192 193 194 195
enum reloc_type {
	RELO_LD64,
	RELO_CALL,
	RELO_DATA,
	RELO_EXTERN,
};

struct reloc_desc {
	enum reloc_type type;
	int insn_idx;
	int map_idx;
	int sym_off;
};

196 197 198 199 200 201 202
/*
 * bpf_prog should be a better name but it has been used in
 * linux/filter.h.
 */
struct bpf_program {
	/* Index in elf obj file, for relocation use. */
	int idx;
203
	char *name;
204
	int prog_ifindex;
205
	char *section_name;
S
Stanislav Fomichev 已提交
206 207 208 209
	/* section_name with / replaced by _; makes recursive pinning
	 * in bpf_object__pin_programs easier
	 */
	char *pin_name;
210
	struct bpf_insn *insns;
211
	size_t insns_cnt, main_prog_cnt;
212
	enum bpf_prog_type type;
213

214
	struct reloc_desc *reloc_desc;
215
	int nr_reloc;
216
	int log_level;
217

218 219 220 221 222
	struct {
		int nr;
		int *fds;
	} instances;
	bpf_program_prep_t preprocessor;
223 224 225 226

	struct bpf_object *obj;
	void *priv;
	bpf_program_clear_priv_t clear_priv;
227 228

	enum bpf_attach_type expected_attach_type;
229
	__u32 attach_btf_id;
230
	__u32 attach_prog_fd;
231 232
	void *func_info;
	__u32 func_info_rec_size;
233
	__u32 func_info_cnt;
234 235

	struct bpf_capabilities *caps;
236 237 238 239

	void *line_info;
	__u32 line_info_rec_size;
	__u32 line_info_cnt;
240
	__u32 prog_flags;
241 242
};

243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263
struct bpf_struct_ops {
	const char *tname;
	const struct btf_type *type;
	struct bpf_program **progs;
	__u32 *kern_func_off;
	/* e.g. struct tcp_congestion_ops in bpf_prog's btf format */
	void *data;
	/* e.g. struct bpf_struct_ops_tcp_congestion_ops in
	 *      btf_vmlinux's format.
	 * struct bpf_struct_ops_tcp_congestion_ops {
	 *	[... some other kernel fields ...]
	 *	struct tcp_congestion_ops data;
	 * }
	 * kern_vdata-size == sizeof(struct bpf_struct_ops_tcp_congestion_ops)
	 * bpf_map__init_kern_struct_ops() will populate the "kern_vdata"
	 * from "data".
	 */
	void *kern_vdata;
	__u32 type_id;
};

264 265 266
#define DATA_SEC ".data"
#define BSS_SEC ".bss"
#define RODATA_SEC ".rodata"
267
#define KCONFIG_SEC ".kconfig"
268
#define STRUCT_OPS_SEC ".struct_ops"
269

270 271 272 273 274
enum libbpf_map_type {
	LIBBPF_MAP_UNSPEC,
	LIBBPF_MAP_DATA,
	LIBBPF_MAP_BSS,
	LIBBPF_MAP_RODATA,
275
	LIBBPF_MAP_KCONFIG,
276 277 278
};

static const char * const libbpf_type_to_btf_name[] = {
279 280 281
	[LIBBPF_MAP_DATA]	= DATA_SEC,
	[LIBBPF_MAP_BSS]	= BSS_SEC,
	[LIBBPF_MAP_RODATA]	= RODATA_SEC,
282
	[LIBBPF_MAP_KCONFIG]	= KCONFIG_SEC,
283 284
};

285
struct bpf_map {
286
	char *name;
287
	int fd;
288 289
	int sec_idx;
	size_t sec_offset;
290
	int map_ifindex;
291
	int inner_map_fd;
292
	struct bpf_map_def def;
293 294
	__u32 btf_key_type_id;
	__u32 btf_value_type_id;
295
	__u32 btf_vmlinux_value_type_id;
296 297
	void *priv;
	bpf_map_clear_priv_t clear_priv;
298
	enum libbpf_map_type libbpf_type;
299
	void *mmaped;
300
	struct bpf_struct_ops *st_ops;
301 302
	char *pin_path;
	bool pinned;
303
	bool reused;
304 305
};

306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327
enum extern_type {
	EXT_UNKNOWN,
	EXT_CHAR,
	EXT_BOOL,
	EXT_INT,
	EXT_TRISTATE,
	EXT_CHAR_ARR,
};

struct extern_desc {
	const char *name;
	int sym_idx;
	int btf_id;
	enum extern_type type;
	int sz;
	int align;
	int data_off;
	bool is_signed;
	bool is_weak;
	bool is_set;
};

328 329
static LIST_HEAD(bpf_objects_list);

330
struct bpf_object {
331
	char name[BPF_OBJ_NAME_LEN];
332
	char license[64];
333
	__u32 kern_version;
334

335 336
	struct bpf_program *programs;
	size_t nr_programs;
337 338
	struct bpf_map *maps;
	size_t nr_maps;
339
	size_t maps_cap;
340

341
	char *kconfig;
342 343
	struct extern_desc *externs;
	int nr_extern;
344
	int kconfig_map_idx;
345

346
	bool loaded;
347
	bool has_pseudo_calls;
348
	bool relaxed_core_relocs;
349

350 351 352 353 354 355
	/*
	 * Information when doing elf related work. Only valid if fd
	 * is valid.
	 */
	struct {
		int fd;
356
		const void *obj_buf;
357
		size_t obj_buf_sz;
358 359
		Elf *elf;
		GElf_Ehdr ehdr;
360
		Elf_Data *symbols;
361 362 363
		Elf_Data *data;
		Elf_Data *rodata;
		Elf_Data *bss;
364
		Elf_Data *st_ops_data;
365
		size_t strtabidx;
366 367 368
		struct {
			GElf_Shdr shdr;
			Elf_Data *data;
369 370
		} *reloc_sects;
		int nr_reloc_sects;
371
		int maps_shndx;
372
		int btf_maps_shndx;
373
		int text_shndx;
374
		int symbols_shndx;
375 376 377
		int data_shndx;
		int rodata_shndx;
		int bss_shndx;
378
		int st_ops_shndx;
379
	} efile;
380 381 382 383 384 385
	/*
	 * All loaded bpf_object is linked in a list, which is
	 * hidden to caller. bpf_objects__<func> handlers deal with
	 * all objects.
	 */
	struct list_head list;
386

387
	struct btf *btf;
388 389 390 391
	/* Parse and load BTF vmlinux if any of the programs in the object need
	 * it at load time.
	 */
	struct btf *btf_vmlinux;
392
	struct btf_ext *btf_ext;
393

394 395 396
	void *priv;
	bpf_object_clear_priv_t clear_priv;

397 398
	struct bpf_capabilities caps;

399 400 401 402
	char path[];
};
#define obj_elf_valid(o)	((o)->efile.elf)

403
void bpf_program__unload(struct bpf_program *prog)
404
{
405 406
	int i;

407 408 409
	if (!prog)
		return;

410 411 412 413 414 415 416 417
	/*
	 * If the object is opened but the program was never loaded,
	 * it is possible that prog->instances.nr == -1.
	 */
	if (prog->instances.nr > 0) {
		for (i = 0; i < prog->instances.nr; i++)
			zclose(prog->instances.fds[i]);
	} else if (prog->instances.nr != -1) {
418 419
		pr_warn("Internal error: instances.nr is %d\n",
			prog->instances.nr);
420 421 422 423
	}

	prog->instances.nr = -1;
	zfree(&prog->instances.fds);
424 425

	zfree(&prog->func_info);
426
	zfree(&prog->line_info);
427 428
}

429 430 431 432 433
static void bpf_program__exit(struct bpf_program *prog)
{
	if (!prog)
		return;

434 435 436 437 438 439
	if (prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

	prog->priv = NULL;
	prog->clear_priv = NULL;

440
	bpf_program__unload(prog);
441
	zfree(&prog->name);
442
	zfree(&prog->section_name);
S
Stanislav Fomichev 已提交
443
	zfree(&prog->pin_name);
444
	zfree(&prog->insns);
445 446 447
	zfree(&prog->reloc_desc);

	prog->nr_reloc = 0;
448 449 450 451
	prog->insns_cnt = 0;
	prog->idx = -1;
}

S
Stanislav Fomichev 已提交
452 453 454 455 456 457 458 459 460 461 462
static char *__bpf_program__pin_name(struct bpf_program *prog)
{
	char *name, *p;

	name = p = strdup(prog->section_name);
	while ((p = strchr(p, '/')))
		*p = '_';

	return name;
}

463
static int
464 465
bpf_program__init(void *data, size_t size, char *section_name, int idx,
		  struct bpf_program *prog)
466
{
467 468 469
	const size_t bpf_insn_sz = sizeof(struct bpf_insn);

	if (size == 0 || size % bpf_insn_sz) {
470 471
		pr_warn("corrupted section '%s', size: %zu\n",
			section_name, size);
472 473 474
		return -EINVAL;
	}

475
	memset(prog, 0, sizeof(*prog));
476

477
	prog->section_name = strdup(section_name);
478
	if (!prog->section_name) {
479 480
		pr_warn("failed to alloc name for prog under section(%d) %s\n",
			idx, section_name);
481 482 483
		goto errout;
	}

S
Stanislav Fomichev 已提交
484 485
	prog->pin_name = __bpf_program__pin_name(prog);
	if (!prog->pin_name) {
486 487
		pr_warn("failed to alloc pin name for prog under section(%d) %s\n",
			idx, section_name);
S
Stanislav Fomichev 已提交
488 489 490
		goto errout;
	}

491 492
	prog->insns = malloc(size);
	if (!prog->insns) {
493 494
		pr_warn("failed to alloc insns for prog under section %s\n",
			section_name);
495 496
		goto errout;
	}
497 498
	prog->insns_cnt = size / bpf_insn_sz;
	memcpy(prog->insns, data, size);
499
	prog->idx = idx;
500 501
	prog->instances.fds = NULL;
	prog->instances.nr = -1;
502
	prog->type = BPF_PROG_TYPE_UNSPEC;
503 504 505 506 507 508 509 510 511

	return 0;
errout:
	bpf_program__exit(prog);
	return -ENOMEM;
}

static int
bpf_object__add_program(struct bpf_object *obj, void *data, size_t size,
512
			char *section_name, int idx)
513 514 515 516
{
	struct bpf_program prog, *progs;
	int nr_progs, err;

517
	err = bpf_program__init(data, size, section_name, idx, &prog);
518 519 520
	if (err)
		return err;

521
	prog.caps = &obj->caps;
522 523 524
	progs = obj->programs;
	nr_progs = obj->nr_programs;

525
	progs = reallocarray(progs, nr_progs + 1, sizeof(progs[0]));
526 527 528 529 530 531
	if (!progs) {
		/*
		 * In this case the original obj->programs
		 * is still valid, so don't need special treat for
		 * bpf_close_object().
		 */
532 533
		pr_warn("failed to alloc a new program under section '%s'\n",
			section_name);
534 535 536 537 538 539 540
		bpf_program__exit(&prog);
		return -ENOMEM;
	}

	pr_debug("found program %s\n", prog.section_name);
	obj->programs = progs;
	obj->nr_programs = nr_progs + 1;
541
	prog.obj = obj;
542 543 544 545
	progs[nr_progs] = prog;
	return 0;
}

546 547 548 549 550 551 552 553
static int
bpf_object__init_prog_names(struct bpf_object *obj)
{
	Elf_Data *symbols = obj->efile.symbols;
	struct bpf_program *prog;
	size_t pi, si;

	for (pi = 0; pi < obj->nr_programs; pi++) {
554
		const char *name = NULL;
555 556 557 558 559 560 561 562 563 564 565

		prog = &obj->programs[pi];

		for (si = 0; si < symbols->d_size / sizeof(GElf_Sym) && !name;
		     si++) {
			GElf_Sym sym;

			if (!gelf_getsym(symbols, si, &sym))
				continue;
			if (sym.st_shndx != prog->idx)
				continue;
566 567
			if (GELF_ST_BIND(sym.st_info) != STB_GLOBAL)
				continue;
568 569 570 571 572

			name = elf_strptr(obj->efile.elf,
					  obj->efile.strtabidx,
					  sym.st_name);
			if (!name) {
573 574
				pr_warn("failed to get sym name string for prog %s\n",
					prog->section_name);
575 576 577 578
				return -LIBBPF_ERRNO__LIBELF;
			}
		}

579 580 581
		if (!name && prog->idx == obj->efile.text_shndx)
			name = ".text";

582
		if (!name) {
583 584
			pr_warn("failed to find sym for prog %s\n",
				prog->section_name);
585 586
			return -EINVAL;
		}
587

588 589
		prog->name = strdup(name);
		if (!prog->name) {
590 591
			pr_warn("failed to allocate memory for prog sym %s\n",
				name);
592 593 594 595 596 597 598
			return -ENOMEM;
		}
	}

	return 0;
}

599 600 601 602 603 604 605 606 607 608 609
static __u32 get_kernel_version(void)
{
	__u32 major, minor, patch;
	struct utsname info;

	uname(&info);
	if (sscanf(info.release, "%u.%u.%u", &major, &minor, &patch) != 3)
		return 0;
	return KERNEL_VERSION(major, minor, patch);
}

610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639
static const struct btf_member *
find_member_by_offset(const struct btf_type *t, __u32 bit_offset)
{
	struct btf_member *m;
	int i;

	for (i = 0, m = btf_members(t); i < btf_vlen(t); i++, m++) {
		if (btf_member_bit_offset(t, i) == bit_offset)
			return m;
	}

	return NULL;
}

static const struct btf_member *
find_member_by_name(const struct btf *btf, const struct btf_type *t,
		    const char *name)
{
	struct btf_member *m;
	int i;

	for (i = 0, m = btf_members(t); i < btf_vlen(t); i++, m++) {
		if (!strcmp(btf__name_by_offset(btf, m->name_off), name))
			return m;
	}

	return NULL;
}

#define STRUCT_OPS_VALUE_PREFIX "bpf_struct_ops_"
640 641
static int find_btf_by_prefix_kind(const struct btf *btf, const char *prefix,
				   const char *name, __u32 kind);
642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666

static int
find_struct_ops_kern_types(const struct btf *btf, const char *tname,
			   const struct btf_type **type, __u32 *type_id,
			   const struct btf_type **vtype, __u32 *vtype_id,
			   const struct btf_member **data_member)
{
	const struct btf_type *kern_type, *kern_vtype;
	const struct btf_member *kern_data_member;
	__s32 kern_vtype_id, kern_type_id;
	__u32 i;

	kern_type_id = btf__find_by_name_kind(btf, tname, BTF_KIND_STRUCT);
	if (kern_type_id < 0) {
		pr_warn("struct_ops init_kern: struct %s is not found in kernel BTF\n",
			tname);
		return kern_type_id;
	}
	kern_type = btf__type_by_id(btf, kern_type_id);

	/* Find the corresponding "map_value" type that will be used
	 * in map_update(BPF_MAP_TYPE_STRUCT_OPS).  For example,
	 * find "struct bpf_struct_ops_tcp_congestion_ops" from the
	 * btf_vmlinux.
	 */
667 668
	kern_vtype_id = find_btf_by_prefix_kind(btf, STRUCT_OPS_VALUE_PREFIX,
						tname, BTF_KIND_STRUCT);
669
	if (kern_vtype_id < 0) {
670 671
		pr_warn("struct_ops init_kern: struct %s%s is not found in kernel BTF\n",
			STRUCT_OPS_VALUE_PREFIX, tname);
672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687
		return kern_vtype_id;
	}
	kern_vtype = btf__type_by_id(btf, kern_vtype_id);

	/* Find "struct tcp_congestion_ops" from
	 * struct bpf_struct_ops_tcp_congestion_ops {
	 *	[ ... ]
	 *	struct tcp_congestion_ops data;
	 * }
	 */
	kern_data_member = btf_members(kern_vtype);
	for (i = 0; i < btf_vlen(kern_vtype); i++, kern_data_member++) {
		if (kern_data_member->type == kern_type_id)
			break;
	}
	if (i == btf_vlen(kern_vtype)) {
688 689
		pr_warn("struct_ops init_kern: struct %s data is not found in struct %s%s\n",
			tname, STRUCT_OPS_VALUE_PREFIX, tname);
690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849
		return -EINVAL;
	}

	*type = kern_type;
	*type_id = kern_type_id;
	*vtype = kern_vtype;
	*vtype_id = kern_vtype_id;
	*data_member = kern_data_member;

	return 0;
}

static bool bpf_map__is_struct_ops(const struct bpf_map *map)
{
	return map->def.type == BPF_MAP_TYPE_STRUCT_OPS;
}

/* Init the map's fields that depend on kern_btf */
static int bpf_map__init_kern_struct_ops(struct bpf_map *map,
					 const struct btf *btf,
					 const struct btf *kern_btf)
{
	const struct btf_member *member, *kern_member, *kern_data_member;
	const struct btf_type *type, *kern_type, *kern_vtype;
	__u32 i, kern_type_id, kern_vtype_id, kern_data_off;
	struct bpf_struct_ops *st_ops;
	void *data, *kern_data;
	const char *tname;
	int err;

	st_ops = map->st_ops;
	type = st_ops->type;
	tname = st_ops->tname;
	err = find_struct_ops_kern_types(kern_btf, tname,
					 &kern_type, &kern_type_id,
					 &kern_vtype, &kern_vtype_id,
					 &kern_data_member);
	if (err)
		return err;

	pr_debug("struct_ops init_kern %s: type_id:%u kern_type_id:%u kern_vtype_id:%u\n",
		 map->name, st_ops->type_id, kern_type_id, kern_vtype_id);

	map->def.value_size = kern_vtype->size;
	map->btf_vmlinux_value_type_id = kern_vtype_id;

	st_ops->kern_vdata = calloc(1, kern_vtype->size);
	if (!st_ops->kern_vdata)
		return -ENOMEM;

	data = st_ops->data;
	kern_data_off = kern_data_member->offset / 8;
	kern_data = st_ops->kern_vdata + kern_data_off;

	member = btf_members(type);
	for (i = 0; i < btf_vlen(type); i++, member++) {
		const struct btf_type *mtype, *kern_mtype;
		__u32 mtype_id, kern_mtype_id;
		void *mdata, *kern_mdata;
		__s64 msize, kern_msize;
		__u32 moff, kern_moff;
		__u32 kern_member_idx;
		const char *mname;

		mname = btf__name_by_offset(btf, member->name_off);
		kern_member = find_member_by_name(kern_btf, kern_type, mname);
		if (!kern_member) {
			pr_warn("struct_ops init_kern %s: Cannot find member %s in kernel BTF\n",
				map->name, mname);
			return -ENOTSUP;
		}

		kern_member_idx = kern_member - btf_members(kern_type);
		if (btf_member_bitfield_size(type, i) ||
		    btf_member_bitfield_size(kern_type, kern_member_idx)) {
			pr_warn("struct_ops init_kern %s: bitfield %s is not supported\n",
				map->name, mname);
			return -ENOTSUP;
		}

		moff = member->offset / 8;
		kern_moff = kern_member->offset / 8;

		mdata = data + moff;
		kern_mdata = kern_data + kern_moff;

		mtype = skip_mods_and_typedefs(btf, member->type, &mtype_id);
		kern_mtype = skip_mods_and_typedefs(kern_btf, kern_member->type,
						    &kern_mtype_id);
		if (BTF_INFO_KIND(mtype->info) !=
		    BTF_INFO_KIND(kern_mtype->info)) {
			pr_warn("struct_ops init_kern %s: Unmatched member type %s %u != %u(kernel)\n",
				map->name, mname, BTF_INFO_KIND(mtype->info),
				BTF_INFO_KIND(kern_mtype->info));
			return -ENOTSUP;
		}

		if (btf_is_ptr(mtype)) {
			struct bpf_program *prog;

			mtype = skip_mods_and_typedefs(btf, mtype->type, &mtype_id);
			kern_mtype = skip_mods_and_typedefs(kern_btf,
							    kern_mtype->type,
							    &kern_mtype_id);
			if (!btf_is_func_proto(mtype) ||
			    !btf_is_func_proto(kern_mtype)) {
				pr_warn("struct_ops init_kern %s: non func ptr %s is not supported\n",
					map->name, mname);
				return -ENOTSUP;
			}

			prog = st_ops->progs[i];
			if (!prog) {
				pr_debug("struct_ops init_kern %s: func ptr %s is not set\n",
					 map->name, mname);
				continue;
			}

			prog->attach_btf_id = kern_type_id;
			prog->expected_attach_type = kern_member_idx;

			st_ops->kern_func_off[i] = kern_data_off + kern_moff;

			pr_debug("struct_ops init_kern %s: func ptr %s is set to prog %s from data(+%u) to kern_data(+%u)\n",
				 map->name, mname, prog->name, moff,
				 kern_moff);

			continue;
		}

		msize = btf__resolve_size(btf, mtype_id);
		kern_msize = btf__resolve_size(kern_btf, kern_mtype_id);
		if (msize < 0 || kern_msize < 0 || msize != kern_msize) {
			pr_warn("struct_ops init_kern %s: Error in size of member %s: %zd != %zd(kernel)\n",
				map->name, mname, (ssize_t)msize,
				(ssize_t)kern_msize);
			return -ENOTSUP;
		}

		pr_debug("struct_ops init_kern %s: copy %s %u bytes from data(+%u) to kern_data(+%u)\n",
			 map->name, mname, (unsigned int)msize,
			 moff, kern_moff);
		memcpy(kern_mdata, mdata, msize);
	}

	return 0;
}

static int bpf_object__init_kern_struct_ops_maps(struct bpf_object *obj)
{
	struct bpf_map *map;
	size_t i;
	int err;

	for (i = 0; i < obj->nr_maps; i++) {
		map = &obj->maps[i];

		if (!bpf_map__is_struct_ops(map))
			continue;

850 851 852
		err = bpf_map__init_kern_struct_ops(map, obj->btf,
						    obj->btf_vmlinux);
		if (err)
853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951
			return err;
	}

	return 0;
}

static int bpf_object__init_struct_ops_maps(struct bpf_object *obj)
{
	const struct btf_type *type, *datasec;
	const struct btf_var_secinfo *vsi;
	struct bpf_struct_ops *st_ops;
	const char *tname, *var_name;
	__s32 type_id, datasec_id;
	const struct btf *btf;
	struct bpf_map *map;
	__u32 i;

	if (obj->efile.st_ops_shndx == -1)
		return 0;

	btf = obj->btf;
	datasec_id = btf__find_by_name_kind(btf, STRUCT_OPS_SEC,
					    BTF_KIND_DATASEC);
	if (datasec_id < 0) {
		pr_warn("struct_ops init: DATASEC %s not found\n",
			STRUCT_OPS_SEC);
		return -EINVAL;
	}

	datasec = btf__type_by_id(btf, datasec_id);
	vsi = btf_var_secinfos(datasec);
	for (i = 0; i < btf_vlen(datasec); i++, vsi++) {
		type = btf__type_by_id(obj->btf, vsi->type);
		var_name = btf__name_by_offset(obj->btf, type->name_off);

		type_id = btf__resolve_type(obj->btf, vsi->type);
		if (type_id < 0) {
			pr_warn("struct_ops init: Cannot resolve var type_id %u in DATASEC %s\n",
				vsi->type, STRUCT_OPS_SEC);
			return -EINVAL;
		}

		type = btf__type_by_id(obj->btf, type_id);
		tname = btf__name_by_offset(obj->btf, type->name_off);
		if (!tname[0]) {
			pr_warn("struct_ops init: anonymous type is not supported\n");
			return -ENOTSUP;
		}
		if (!btf_is_struct(type)) {
			pr_warn("struct_ops init: %s is not a struct\n", tname);
			return -EINVAL;
		}

		map = bpf_object__add_map(obj);
		if (IS_ERR(map))
			return PTR_ERR(map);

		map->sec_idx = obj->efile.st_ops_shndx;
		map->sec_offset = vsi->offset;
		map->name = strdup(var_name);
		if (!map->name)
			return -ENOMEM;

		map->def.type = BPF_MAP_TYPE_STRUCT_OPS;
		map->def.key_size = sizeof(int);
		map->def.value_size = type->size;
		map->def.max_entries = 1;

		map->st_ops = calloc(1, sizeof(*map->st_ops));
		if (!map->st_ops)
			return -ENOMEM;
		st_ops = map->st_ops;
		st_ops->data = malloc(type->size);
		st_ops->progs = calloc(btf_vlen(type), sizeof(*st_ops->progs));
		st_ops->kern_func_off = malloc(btf_vlen(type) *
					       sizeof(*st_ops->kern_func_off));
		if (!st_ops->data || !st_ops->progs || !st_ops->kern_func_off)
			return -ENOMEM;

		if (vsi->offset + type->size > obj->efile.st_ops_data->d_size) {
			pr_warn("struct_ops init: var %s is beyond the end of DATASEC %s\n",
				var_name, STRUCT_OPS_SEC);
			return -EINVAL;
		}

		memcpy(st_ops->data,
		       obj->efile.st_ops_data->d_buf + vsi->offset,
		       type->size);
		st_ops->tname = tname;
		st_ops->type = type;
		st_ops->type_id = type_id;

		pr_debug("struct_ops init: struct %s(type_id=%u) %s found at offset %u\n",
			 tname, type_id, var_name, vsi->offset);
	}

	return 0;
}

952
static struct bpf_object *bpf_object__new(const char *path,
953
					  const void *obj_buf,
954 955
					  size_t obj_buf_sz,
					  const char *obj_name)
956 957
{
	struct bpf_object *obj;
958
	char *end;
959 960 961

	obj = calloc(1, sizeof(struct bpf_object) + strlen(path) + 1);
	if (!obj) {
962
		pr_warn("alloc memory failed for %s\n", path);
963
		return ERR_PTR(-ENOMEM);
964 965 966
	}

	strcpy(obj->path, path);
967 968 969 970 971 972 973 974 975 976 977
	if (obj_name) {
		strncpy(obj->name, obj_name, sizeof(obj->name) - 1);
		obj->name[sizeof(obj->name) - 1] = 0;
	} else {
		/* Using basename() GNU version which doesn't modify arg. */
		strncpy(obj->name, basename((void *)path),
			sizeof(obj->name) - 1);
		end = strchr(obj->name, '.');
		if (end)
			*end = 0;
	}
978

979
	obj->efile.fd = -1;
980
	/*
981
	 * Caller of this function should also call
982 983 984 985 986 987
	 * bpf_object__elf_finish() after data collection to return
	 * obj_buf to user. If not, we should duplicate the buffer to
	 * avoid user freeing them before elf finish.
	 */
	obj->efile.obj_buf = obj_buf;
	obj->efile.obj_buf_sz = obj_buf_sz;
988
	obj->efile.maps_shndx = -1;
989
	obj->efile.btf_maps_shndx = -1;
990 991 992
	obj->efile.data_shndx = -1;
	obj->efile.rodata_shndx = -1;
	obj->efile.bss_shndx = -1;
993
	obj->efile.st_ops_shndx = -1;
994
	obj->kconfig_map_idx = -1;
995

996
	obj->kern_version = get_kernel_version();
997
	obj->loaded = false;
998 999 1000

	INIT_LIST_HEAD(&obj->list);
	list_add(&obj->list, &bpf_objects_list);
1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012
	return obj;
}

static void bpf_object__elf_finish(struct bpf_object *obj)
{
	if (!obj_elf_valid(obj))
		return;

	if (obj->efile.elf) {
		elf_end(obj->efile.elf);
		obj->efile.elf = NULL;
	}
1013
	obj->efile.symbols = NULL;
1014 1015 1016
	obj->efile.data = NULL;
	obj->efile.rodata = NULL;
	obj->efile.bss = NULL;
1017
	obj->efile.st_ops_data = NULL;
1018

1019 1020
	zfree(&obj->efile.reloc_sects);
	obj->efile.nr_reloc_sects = 0;
1021
	zclose(obj->efile.fd);
1022 1023
	obj->efile.obj_buf = NULL;
	obj->efile.obj_buf_sz = 0;
1024 1025 1026 1027 1028 1029 1030 1031
}

static int bpf_object__elf_init(struct bpf_object *obj)
{
	int err = 0;
	GElf_Ehdr *ep;

	if (obj_elf_valid(obj)) {
1032
		pr_warn("elf init: internal error\n");
1033
		return -LIBBPF_ERRNO__LIBELF;
1034 1035
	}

1036 1037 1038 1039 1040
	if (obj->efile.obj_buf_sz > 0) {
		/*
		 * obj_buf should have been validated by
		 * bpf_object__open_buffer().
		 */
1041
		obj->efile.elf = elf_memory((char *)obj->efile.obj_buf,
1042 1043 1044 1045
					    obj->efile.obj_buf_sz);
	} else {
		obj->efile.fd = open(obj->path, O_RDONLY);
		if (obj->efile.fd < 0) {
1046
			char errmsg[STRERR_BUFSIZE], *cp;
1047

1048 1049
			err = -errno;
			cp = libbpf_strerror_r(err, errmsg, sizeof(errmsg));
1050
			pr_warn("failed to open %s: %s\n", obj->path, cp);
1051
			return err;
1052 1053 1054
		}

		obj->efile.elf = elf_begin(obj->efile.fd,
1055
					   LIBBPF_ELF_C_READ_MMAP, NULL);
1056 1057 1058
	}

	if (!obj->efile.elf) {
1059
		pr_warn("failed to open %s as ELF file\n", obj->path);
1060
		err = -LIBBPF_ERRNO__LIBELF;
1061 1062 1063 1064
		goto errout;
	}

	if (!gelf_getehdr(obj->efile.elf, &obj->efile.ehdr)) {
1065
		pr_warn("failed to get EHDR from %s\n", obj->path);
1066
		err = -LIBBPF_ERRNO__FORMAT;
1067 1068 1069 1070
		goto errout;
	}
	ep = &obj->efile.ehdr;

1071
	/* Old LLVM set e_machine to EM_NONE */
1072 1073
	if (ep->e_type != ET_REL ||
	    (ep->e_machine && ep->e_machine != EM_BPF)) {
1074
		pr_warn("%s is not an eBPF object file\n", obj->path);
1075
		err = -LIBBPF_ERRNO__FORMAT;
1076 1077 1078 1079 1080 1081 1082 1083 1084
		goto errout;
	}

	return 0;
errout:
	bpf_object__elf_finish(obj);
	return err;
}

1085
static int bpf_object__check_endianness(struct bpf_object *obj)
1086
{
1087
#if __BYTE_ORDER == __LITTLE_ENDIAN
1088 1089
	if (obj->efile.ehdr.e_ident[EI_DATA] == ELFDATA2LSB)
		return 0;
1090
#elif __BYTE_ORDER == __BIG_ENDIAN
1091 1092 1093 1094 1095
	if (obj->efile.ehdr.e_ident[EI_DATA] == ELFDATA2MSB)
		return 0;
#else
# error "Unrecognized __BYTE_ORDER__"
#endif
1096
	pr_warn("endianness mismatch.\n");
1097
	return -LIBBPF_ERRNO__ENDIAN;
1098 1099
}

1100
static int
1101
bpf_object__init_license(struct bpf_object *obj, void *data, size_t size)
1102
{
1103
	memcpy(obj->license, data, min(size, sizeof(obj->license) - 1));
1104 1105 1106 1107
	pr_debug("license of %s is %s\n", obj->path, obj->license);
	return 0;
}

1108 1109 1110 1111 1112 1113
static int
bpf_object__init_kversion(struct bpf_object *obj, void *data, size_t size)
{
	__u32 kver;

	if (size != sizeof(kver)) {
1114
		pr_warn("invalid kver section in %s\n", obj->path);
1115 1116 1117 1118 1119 1120 1121 1122
		return -LIBBPF_ERRNO__FORMAT;
	}
	memcpy(&kver, data, sizeof(kver));
	obj->kern_version = kver;
	pr_debug("kernel version of %s is %x\n", obj->path, obj->kern_version);
	return 0;
}

1123 1124 1125 1126 1127 1128 1129 1130
static bool bpf_map_type__is_map_in_map(enum bpf_map_type type)
{
	if (type == BPF_MAP_TYPE_ARRAY_OF_MAPS ||
	    type == BPF_MAP_TYPE_HASH_OF_MAPS)
		return true;
	return false;
}

1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145
static int bpf_object_search_section_size(const struct bpf_object *obj,
					  const char *name, size_t *d_size)
{
	const GElf_Ehdr *ep = &obj->efile.ehdr;
	Elf *elf = obj->efile.elf;
	Elf_Scn *scn = NULL;
	int idx = 0;

	while ((scn = elf_nextscn(elf, scn)) != NULL) {
		const char *sec_name;
		Elf_Data *data;
		GElf_Shdr sh;

		idx++;
		if (gelf_getshdr(scn, &sh) != &sh) {
1146 1147
			pr_warn("failed to get section(%d) header from %s\n",
				idx, obj->path);
1148 1149 1150 1151 1152
			return -EIO;
		}

		sec_name = elf_strptr(elf, ep->e_shstrndx, sh.sh_name);
		if (!sec_name) {
1153 1154
			pr_warn("failed to get section(%d) name from %s\n",
				idx, obj->path);
1155 1156 1157 1158 1159 1160 1161 1162
			return -EIO;
		}

		if (strcmp(name, sec_name))
			continue;

		data = elf_getdata(scn, 0);
		if (!data) {
1163 1164
			pr_warn("failed to get section(%d) data from %s(%s)\n",
				idx, name, obj->path);
1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183
			return -EIO;
		}

		*d_size = data->d_size;
		return 0;
	}

	return -ENOENT;
}

int bpf_object__section_size(const struct bpf_object *obj, const char *name,
			     __u32 *size)
{
	int ret = -ENOENT;
	size_t d_size;

	*size = 0;
	if (!name) {
		return -EINVAL;
1184
	} else if (!strcmp(name, DATA_SEC)) {
1185 1186
		if (obj->efile.data)
			*size = obj->efile.data->d_size;
1187
	} else if (!strcmp(name, BSS_SEC)) {
1188 1189
		if (obj->efile.bss)
			*size = obj->efile.bss->d_size;
1190
	} else if (!strcmp(name, RODATA_SEC)) {
1191 1192
		if (obj->efile.rodata)
			*size = obj->efile.rodata->d_size;
1193 1194 1195
	} else if (!strcmp(name, STRUCT_OPS_SEC)) {
		if (obj->efile.st_ops_data)
			*size = obj->efile.st_ops_data->d_size;
1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226
	} else {
		ret = bpf_object_search_section_size(obj, name, &d_size);
		if (!ret)
			*size = d_size;
	}

	return *size ? 0 : ret;
}

int bpf_object__variable_offset(const struct bpf_object *obj, const char *name,
				__u32 *off)
{
	Elf_Data *symbols = obj->efile.symbols;
	const char *sname;
	size_t si;

	if (!name || !off)
		return -EINVAL;

	for (si = 0; si < symbols->d_size / sizeof(GElf_Sym); si++) {
		GElf_Sym sym;

		if (!gelf_getsym(symbols, si, &sym))
			continue;
		if (GELF_ST_BIND(sym.st_info) != STB_GLOBAL ||
		    GELF_ST_TYPE(sym.st_info) != STT_OBJECT)
			continue;

		sname = elf_strptr(obj->efile.elf, obj->efile.strtabidx,
				   sym.st_name);
		if (!sname) {
1227 1228
			pr_warn("failed to get sym name string for var %s\n",
				name);
1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239
			return -EIO;
		}
		if (strcmp(name, sname) == 0) {
			*off = sym.st_value;
			return 0;
		}
	}

	return -ENOENT;
}

1240
static struct bpf_map *bpf_object__add_map(struct bpf_object *obj)
1241
{
1242 1243 1244 1245 1246 1247 1248
	struct bpf_map *new_maps;
	size_t new_cap;
	int i;

	if (obj->nr_maps < obj->maps_cap)
		return &obj->maps[obj->nr_maps++];

1249
	new_cap = max((size_t)4, obj->maps_cap * 3 / 2);
1250 1251
	new_maps = realloc(obj->maps, new_cap * sizeof(*obj->maps));
	if (!new_maps) {
1252
		pr_warn("alloc maps for object failed\n");
1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271
		return ERR_PTR(-ENOMEM);
	}

	obj->maps_cap = new_cap;
	obj->maps = new_maps;

	/* zero out new maps */
	memset(obj->maps + obj->nr_maps, 0,
	       (obj->maps_cap - obj->nr_maps) * sizeof(*obj->maps));
	/*
	 * fill all fd with -1 so won't close incorrect fd (fd=0 is stdin)
	 * when failure (zclose won't close negative fd)).
	 */
	for (i = obj->nr_maps; i < obj->maps_cap; i++) {
		obj->maps[i].fd = -1;
		obj->maps[i].inner_map_fd = -1;
	}

	return &obj->maps[obj->nr_maps++];
1272 1273
}

1274 1275 1276 1277 1278
static size_t bpf_map_mmap_sz(const struct bpf_map *map)
{
	long page_sz = sysconf(_SC_PAGE_SIZE);
	size_t map_sz;

1279
	map_sz = (size_t)roundup(map->def.value_size, 8) * map->def.max_entries;
1280 1281 1282 1283
	map_sz = roundup(map_sz, page_sz);
	return map_sz;
}

1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298
static char *internal_map_name(struct bpf_object *obj,
			       enum libbpf_map_type type)
{
	char map_name[BPF_OBJ_NAME_LEN];
	const char *sfx = libbpf_type_to_btf_name[type];
	int sfx_len = max((size_t)7, strlen(sfx));
	int pfx_len = min((size_t)BPF_OBJ_NAME_LEN - sfx_len - 1,
			  strlen(obj->name));

	snprintf(map_name, sizeof(map_name), "%.*s%.*s", pfx_len, obj->name,
		 sfx_len, libbpf_type_to_btf_name[type]);

	return strdup(map_name);
}

1299
static int
1300
bpf_object__init_internal_map(struct bpf_object *obj, enum libbpf_map_type type,
1301
			      int sec_idx, void *data, size_t data_sz)
1302
{
1303 1304
	struct bpf_map_def *def;
	struct bpf_map *map;
1305
	int err;
1306 1307 1308 1309

	map = bpf_object__add_map(obj);
	if (IS_ERR(map))
		return PTR_ERR(map);
1310 1311

	map->libbpf_type = type;
1312 1313
	map->sec_idx = sec_idx;
	map->sec_offset = 0;
1314
	map->name = internal_map_name(obj, type);
1315
	if (!map->name) {
1316
		pr_warn("failed to alloc map name\n");
1317 1318 1319
		return -ENOMEM;
	}

1320
	def = &map->def;
1321 1322
	def->type = BPF_MAP_TYPE_ARRAY;
	def->key_size = sizeof(int);
1323
	def->value_size = data_sz;
1324
	def->max_entries = 1;
1325
	def->map_flags = type == LIBBPF_MAP_RODATA || type == LIBBPF_MAP_KCONFIG
1326
			 ? BPF_F_RDONLY_PROG : 0;
1327
	def->map_flags |= BPF_F_MMAPABLE;
1328 1329

	pr_debug("map '%s' (global data): at sec_idx %d, offset %zu, flags %x.\n",
1330
		 map->name, map->sec_idx, map->sec_offset, def->map_flags);
1331

1332 1333 1334 1335 1336 1337 1338 1339 1340
	map->mmaped = mmap(NULL, bpf_map_mmap_sz(map), PROT_READ | PROT_WRITE,
			   MAP_SHARED | MAP_ANONYMOUS, -1, 0);
	if (map->mmaped == MAP_FAILED) {
		err = -errno;
		map->mmaped = NULL;
		pr_warn("failed to alloc map '%s' content buffer: %d\n",
			map->name, err);
		zfree(&map->name);
		return err;
1341 1342
	}

1343
	if (data)
1344 1345
		memcpy(map->mmaped, data, data_sz);

1346
	pr_debug("map %td is \"%s\"\n", map - obj->maps, map->name);
1347 1348 1349
	return 0;
}

1350 1351 1352 1353 1354 1355 1356 1357 1358
static int bpf_object__init_global_data_maps(struct bpf_object *obj)
{
	int err;

	/*
	 * Populate obj->maps with libbpf internal maps.
	 */
	if (obj->efile.data_shndx >= 0) {
		err = bpf_object__init_internal_map(obj, LIBBPF_MAP_DATA,
1359
						    obj->efile.data_shndx,
1360 1361
						    obj->efile.data->d_buf,
						    obj->efile.data->d_size);
1362 1363 1364 1365 1366
		if (err)
			return err;
	}
	if (obj->efile.rodata_shndx >= 0) {
		err = bpf_object__init_internal_map(obj, LIBBPF_MAP_RODATA,
1367
						    obj->efile.rodata_shndx,
1368 1369
						    obj->efile.rodata->d_buf,
						    obj->efile.rodata->d_size);
1370 1371 1372 1373 1374
		if (err)
			return err;
	}
	if (obj->efile.bss_shndx >= 0) {
		err = bpf_object__init_internal_map(obj, LIBBPF_MAP_BSS,
1375
						    obj->efile.bss_shndx,
1376 1377
						    NULL,
						    obj->efile.bss->d_size);
1378 1379 1380 1381 1382 1383
		if (err)
			return err;
	}
	return 0;
}

1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510

static struct extern_desc *find_extern_by_name(const struct bpf_object *obj,
					       const void *name)
{
	int i;

	for (i = 0; i < obj->nr_extern; i++) {
		if (strcmp(obj->externs[i].name, name) == 0)
			return &obj->externs[i];
	}
	return NULL;
}

static int set_ext_value_tri(struct extern_desc *ext, void *ext_val,
			     char value)
{
	switch (ext->type) {
	case EXT_BOOL:
		if (value == 'm') {
			pr_warn("extern %s=%c should be tristate or char\n",
				ext->name, value);
			return -EINVAL;
		}
		*(bool *)ext_val = value == 'y' ? true : false;
		break;
	case EXT_TRISTATE:
		if (value == 'y')
			*(enum libbpf_tristate *)ext_val = TRI_YES;
		else if (value == 'm')
			*(enum libbpf_tristate *)ext_val = TRI_MODULE;
		else /* value == 'n' */
			*(enum libbpf_tristate *)ext_val = TRI_NO;
		break;
	case EXT_CHAR:
		*(char *)ext_val = value;
		break;
	case EXT_UNKNOWN:
	case EXT_INT:
	case EXT_CHAR_ARR:
	default:
		pr_warn("extern %s=%c should be bool, tristate, or char\n",
			ext->name, value);
		return -EINVAL;
	}
	ext->is_set = true;
	return 0;
}

static int set_ext_value_str(struct extern_desc *ext, char *ext_val,
			     const char *value)
{
	size_t len;

	if (ext->type != EXT_CHAR_ARR) {
		pr_warn("extern %s=%s should char array\n", ext->name, value);
		return -EINVAL;
	}

	len = strlen(value);
	if (value[len - 1] != '"') {
		pr_warn("extern '%s': invalid string config '%s'\n",
			ext->name, value);
		return -EINVAL;
	}

	/* strip quotes */
	len -= 2;
	if (len >= ext->sz) {
		pr_warn("extern '%s': long string config %s of (%zu bytes) truncated to %d bytes\n",
			ext->name, value, len, ext->sz - 1);
		len = ext->sz - 1;
	}
	memcpy(ext_val, value + 1, len);
	ext_val[len] = '\0';
	ext->is_set = true;
	return 0;
}

static int parse_u64(const char *value, __u64 *res)
{
	char *value_end;
	int err;

	errno = 0;
	*res = strtoull(value, &value_end, 0);
	if (errno) {
		err = -errno;
		pr_warn("failed to parse '%s' as integer: %d\n", value, err);
		return err;
	}
	if (*value_end) {
		pr_warn("failed to parse '%s' as integer completely\n", value);
		return -EINVAL;
	}
	return 0;
}

static bool is_ext_value_in_range(const struct extern_desc *ext, __u64 v)
{
	int bit_sz = ext->sz * 8;

	if (ext->sz == 8)
		return true;

	/* Validate that value stored in u64 fits in integer of `ext->sz`
	 * bytes size without any loss of information. If the target integer
	 * is signed, we rely on the following limits of integer type of
	 * Y bits and subsequent transformation:
	 *
	 *     -2^(Y-1) <= X           <= 2^(Y-1) - 1
	 *            0 <= X + 2^(Y-1) <= 2^Y - 1
	 *            0 <= X + 2^(Y-1) <  2^Y
	 *
	 *  For unsigned target integer, check that all the (64 - Y) bits are
	 *  zero.
	 */
	if (ext->is_signed)
		return v + (1ULL << (bit_sz - 1)) < (1ULL << bit_sz);
	else
		return (v >> bit_sz) == 0;
}

static int set_ext_value_num(struct extern_desc *ext, void *ext_val,
			     __u64 value)
{
	if (ext->type != EXT_INT && ext->type != EXT_CHAR) {
		pr_warn("extern %s=%llu should be integer\n",
1511
			ext->name, (unsigned long long)value);
1512 1513 1514 1515
		return -EINVAL;
	}
	if (!is_ext_value_in_range(ext, value)) {
		pr_warn("extern %s=%llu value doesn't fit in %d bytes\n",
1516
			ext->name, (unsigned long long)value, ext->sz);
1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530
		return -ERANGE;
	}
	switch (ext->sz) {
		case 1: *(__u8 *)ext_val = value; break;
		case 2: *(__u16 *)ext_val = value; break;
		case 4: *(__u32 *)ext_val = value; break;
		case 8: *(__u64 *)ext_val = value; break;
		default:
			return -EINVAL;
	}
	ext->is_set = true;
	return 0;
}

1531 1532
static int bpf_object__process_kconfig_line(struct bpf_object *obj,
					    char *buf, void *data)
1533 1534
{
	struct extern_desc *ext;
1535
	char *sep, *value;
1536 1537 1538 1539
	int len, err = 0;
	void *ext_val;
	__u64 num;

1540 1541
	if (strncmp(buf, "CONFIG_", 7))
		return 0;
1542

1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584
	sep = strchr(buf, '=');
	if (!sep) {
		pr_warn("failed to parse '%s': no separator\n", buf);
		return -EINVAL;
	}

	/* Trim ending '\n' */
	len = strlen(buf);
	if (buf[len - 1] == '\n')
		buf[len - 1] = '\0';
	/* Split on '=' and ensure that a value is present. */
	*sep = '\0';
	if (!sep[1]) {
		*sep = '=';
		pr_warn("failed to parse '%s': no value\n", buf);
		return -EINVAL;
	}

	ext = find_extern_by_name(obj, buf);
	if (!ext || ext->is_set)
		return 0;

	ext_val = data + ext->data_off;
	value = sep + 1;

	switch (*value) {
	case 'y': case 'n': case 'm':
		err = set_ext_value_tri(ext, ext_val, *value);
		break;
	case '"':
		err = set_ext_value_str(ext, ext_val, value);
		break;
	default:
		/* assume integer */
		err = parse_u64(value, &num);
		if (err) {
			pr_warn("extern %s=%s should be integer\n",
				ext->name, value);
			return err;
		}
		err = set_ext_value_num(ext, ext_val, num);
		break;
1585
	}
1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610
	if (err)
		return err;
	pr_debug("extern %s=%s\n", ext->name, value);
	return 0;
}

static int bpf_object__read_kconfig_file(struct bpf_object *obj, void *data)
{
	char buf[PATH_MAX];
	struct utsname uts;
	int len, err = 0;
	gzFile file;

	uname(&uts);
	len = snprintf(buf, PATH_MAX, "/boot/config-%s", uts.release);
	if (len < 0)
		return -EINVAL;
	else if (len >= PATH_MAX)
		return -ENAMETOOLONG;

	/* gzopen also accepts uncompressed files. */
	file = gzopen(buf, "r");
	if (!file)
		file = gzopen("/proc/config.gz", "r");

1611
	if (!file) {
1612
		pr_warn("failed to open system Kconfig\n");
1613 1614 1615 1616
		return -ENOENT;
	}

	while (gzgets(file, buf, sizeof(buf))) {
1617 1618 1619 1620
		err = bpf_object__process_kconfig_line(obj, buf, data);
		if (err) {
			pr_warn("error parsing system Kconfig line '%s': %d\n",
				buf, err);
1621 1622
			goto out;
		}
1623
	}
1624

1625 1626 1627 1628
out:
	gzclose(file);
	return err;
}
1629

1630 1631 1632 1633 1634 1635
static int bpf_object__read_kconfig_mem(struct bpf_object *obj,
					const char *config, void *data)
{
	char buf[PATH_MAX];
	int err = 0;
	FILE *file;
1636

1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648
	file = fmemopen((void *)config, strlen(config), "r");
	if (!file) {
		err = -errno;
		pr_warn("failed to open in-memory Kconfig: %d\n", err);
		return err;
	}

	while (fgets(buf, sizeof(buf), file)) {
		err = bpf_object__process_kconfig_line(obj, buf, data);
		if (err) {
			pr_warn("error parsing in-memory Kconfig line '%s': %d\n",
				buf, err);
1649 1650 1651 1652
			break;
		}
	}

1653
	fclose(file);
1654 1655 1656
	return err;
}

1657
static int bpf_object__init_kconfig_map(struct bpf_object *obj)
1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668
{
	struct extern_desc *last_ext;
	size_t map_sz;
	int err;

	if (obj->nr_extern == 0)
		return 0;

	last_ext = &obj->externs[obj->nr_extern - 1];
	map_sz = last_ext->data_off + last_ext->sz;

1669
	err = bpf_object__init_internal_map(obj, LIBBPF_MAP_KCONFIG,
1670 1671 1672 1673 1674
					    obj->efile.symbols_shndx,
					    NULL, map_sz);
	if (err)
		return err;

1675
	obj->kconfig_map_idx = obj->nr_maps - 1;
1676 1677 1678 1679

	return 0;
}

1680
static int bpf_object__init_user_maps(struct bpf_object *obj, bool strict)
1681 1682
{
	Elf_Data *symbols = obj->efile.symbols;
1683
	int i, map_def_sz = 0, nr_maps = 0, nr_syms;
1684
	Elf_Data *data = NULL;
1685 1686 1687 1688
	Elf_Scn *scn;

	if (obj->efile.maps_shndx < 0)
		return 0;
1689

E
Eric Leblond 已提交
1690 1691 1692
	if (!symbols)
		return -EINVAL;

1693 1694 1695 1696
	scn = elf_getscn(obj->efile.elf, obj->efile.maps_shndx);
	if (scn)
		data = elf_getdata(scn, NULL);
	if (!scn || !data) {
1697 1698
		pr_warn("failed to get Elf_Data from map section %d\n",
			obj->efile.maps_shndx);
1699
		return -EINVAL;
E
Eric Leblond 已提交
1700
	}
1701

E
Eric Leblond 已提交
1702 1703 1704 1705 1706 1707 1708
	/*
	 * Count number of maps. Each map has a name.
	 * Array of maps is not supported: only the first element is
	 * considered.
	 *
	 * TODO: Detect array of map and report error.
	 */
1709 1710
	nr_syms = symbols->d_size / sizeof(GElf_Sym);
	for (i = 0; i < nr_syms; i++) {
1711
		GElf_Sym sym;
E
Eric Leblond 已提交
1712 1713 1714 1715 1716 1717 1718

		if (!gelf_getsym(symbols, i, &sym))
			continue;
		if (sym.st_shndx != obj->efile.maps_shndx)
			continue;
		nr_maps++;
	}
1719
	/* Assume equally sized map definitions */
1720 1721 1722
	pr_debug("maps in %s: %d maps in %zd bytes\n",
		 obj->path, nr_maps, data->d_size);

1723
	if (!data->d_size || nr_maps == 0 || (data->d_size % nr_maps) != 0) {
1724
		pr_warn("unable to determine map definition size section %s, %d maps in %zd bytes\n",
1725
			obj->path, nr_maps, data->d_size);
1726
		return -EINVAL;
1727
	}
1728
	map_def_sz = data->d_size / nr_maps;
E
Eric Leblond 已提交
1729

1730 1731
	/* Fill obj->maps using data in "maps" section.  */
	for (i = 0; i < nr_syms; i++) {
E
Eric Leblond 已提交
1732
		GElf_Sym sym;
1733
		const char *map_name;
E
Eric Leblond 已提交
1734
		struct bpf_map_def *def;
1735
		struct bpf_map *map;
1736 1737 1738

		if (!gelf_getsym(symbols, i, &sym))
			continue;
1739
		if (sym.st_shndx != obj->efile.maps_shndx)
1740 1741
			continue;

1742 1743 1744 1745 1746
		map = bpf_object__add_map(obj);
		if (IS_ERR(map))
			return PTR_ERR(map);

		map_name = elf_strptr(obj->efile.elf, obj->efile.strtabidx,
1747
				      sym.st_name);
1748
		if (!map_name) {
1749 1750
			pr_warn("failed to get map #%d name sym string for obj %s\n",
				i, obj->path);
1751 1752
			return -LIBBPF_ERRNO__FORMAT;
		}
1753

1754
		map->libbpf_type = LIBBPF_MAP_UNSPEC;
1755 1756 1757 1758
		map->sec_idx = sym.st_shndx;
		map->sec_offset = sym.st_value;
		pr_debug("map '%s' (legacy): at sec_idx %d, offset %zu.\n",
			 map_name, map->sec_idx, map->sec_offset);
1759
		if (sym.st_value + map_def_sz > data->d_size) {
1760 1761
			pr_warn("corrupted maps section in %s: last map \"%s\" too small\n",
				obj->path, map_name);
E
Eric Leblond 已提交
1762
			return -EINVAL;
1763
		}
E
Eric Leblond 已提交
1764

1765 1766
		map->name = strdup(map_name);
		if (!map->name) {
1767
			pr_warn("failed to alloc map name\n");
1768 1769
			return -ENOMEM;
		}
1770
		pr_debug("map %d is \"%s\"\n", i, map->name);
E
Eric Leblond 已提交
1771
		def = (struct bpf_map_def *)(data->d_buf + sym.st_value);
1772 1773 1774 1775 1776 1777 1778
		/*
		 * If the definition of the map in the object file fits in
		 * bpf_map_def, copy it.  Any extra fields in our version
		 * of bpf_map_def will default to zero as a result of the
		 * calloc above.
		 */
		if (map_def_sz <= sizeof(struct bpf_map_def)) {
1779
			memcpy(&map->def, def, map_def_sz);
1780 1781 1782 1783 1784 1785 1786 1787
		} else {
			/*
			 * Here the map structure being read is bigger than what
			 * we expect, truncate if the excess bits are all zero.
			 * If they are not zero, reject this map as
			 * incompatible.
			 */
			char *b;
1788

1789 1790 1791
			for (b = ((char *)def) + sizeof(struct bpf_map_def);
			     b < ((char *)def) + map_def_sz; b++) {
				if (*b != 0) {
1792
					pr_warn("maps section in %s: \"%s\" has unrecognized, non-zero options\n",
1793
						obj->path, map_name);
1794 1795
					if (strict)
						return -EINVAL;
1796 1797
				}
			}
1798
			memcpy(&map->def, def, sizeof(struct bpf_map_def));
1799
		}
1800
	}
1801 1802
	return 0;
}
E
Eric Leblond 已提交
1803

1804 1805
static const struct btf_type *
skip_mods_and_typedefs(const struct btf *btf, __u32 id, __u32 *res_id)
1806 1807
{
	const struct btf_type *t = btf__type_by_id(btf, id);
1808

1809 1810 1811 1812 1813 1814 1815
	if (res_id)
		*res_id = id;

	while (btf_is_mod(t) || btf_is_typedef(t)) {
		if (res_id)
			*res_id = t->type;
		t = btf__type_by_id(btf, t->type);
1816
	}
1817 1818

	return t;
1819 1820
}

1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834
static const struct btf_type *
resolve_func_ptr(const struct btf *btf, __u32 id, __u32 *res_id)
{
	const struct btf_type *t;

	t = skip_mods_and_typedefs(btf, id, NULL);
	if (!btf_is_ptr(t))
		return NULL;

	t = skip_mods_and_typedefs(btf, t->type, res_id);

	return btf_is_func_proto(t) ? t : NULL;
}

1835 1836 1837 1838 1839 1840 1841 1842
/*
 * Fetch integer attribute of BTF map definition. Such attributes are
 * represented using a pointer to an array, in which dimensionality of array
 * encodes specified integer value. E.g., int (*type)[BPF_MAP_TYPE_ARRAY];
 * encodes `type => BPF_MAP_TYPE_ARRAY` key/value pair completely using BTF
 * type definition, while using only sizeof(void *) space in ELF data section.
 */
static bool get_map_field_int(const char *map_name, const struct btf *btf,
1843
			      const struct btf_type *def,
1844 1845
			      const struct btf_member *m, __u32 *res)
{
1846
	const struct btf_type *t = skip_mods_and_typedefs(btf, m->type, NULL);
1847
	const char *name = btf__name_by_offset(btf, m->name_off);
1848 1849
	const struct btf_array *arr_info;
	const struct btf_type *arr_t;
1850

1851
	if (!btf_is_ptr(t)) {
1852 1853
		pr_warn("map '%s': attr '%s': expected PTR, got %u.\n",
			map_name, name, btf_kind(t));
1854 1855
		return false;
	}
1856 1857 1858

	arr_t = btf__type_by_id(btf, t->type);
	if (!arr_t) {
1859 1860
		pr_warn("map '%s': attr '%s': type [%u] not found.\n",
			map_name, name, t->type);
1861 1862
		return false;
	}
1863
	if (!btf_is_array(arr_t)) {
1864 1865
		pr_warn("map '%s': attr '%s': expected ARRAY, got %u.\n",
			map_name, name, btf_kind(arr_t));
1866 1867
		return false;
	}
1868
	arr_info = btf_array(arr_t);
1869
	*res = arr_info->nelems;
1870 1871 1872
	return true;
}

1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893
static int build_map_pin_path(struct bpf_map *map, const char *path)
{
	char buf[PATH_MAX];
	int err, len;

	if (!path)
		path = "/sys/fs/bpf";

	len = snprintf(buf, PATH_MAX, "%s/%s", path, bpf_map__name(map));
	if (len < 0)
		return -EINVAL;
	else if (len >= PATH_MAX)
		return -ENAMETOOLONG;

	err = bpf_map__set_pin_path(map, buf);
	if (err)
		return err;

	return 0;
}

1894 1895 1896
static int bpf_object__init_user_btf_map(struct bpf_object *obj,
					 const struct btf_type *sec,
					 int var_idx, int sec_idx,
1897 1898
					 const Elf_Data *data, bool strict,
					 const char *pin_root_path)
1899 1900 1901 1902 1903 1904 1905 1906 1907
{
	const struct btf_type *var, *def, *t;
	const struct btf_var_secinfo *vi;
	const struct btf_var *var_extra;
	const struct btf_member *m;
	const char *map_name;
	struct bpf_map *map;
	int vlen, i;

1908
	vi = btf_var_secinfos(sec) + var_idx;
1909
	var = btf__type_by_id(obj->btf, vi->type);
1910
	var_extra = btf_var(var);
1911
	map_name = btf__name_by_offset(obj->btf, var->name_off);
1912
	vlen = btf_vlen(var);
1913 1914

	if (map_name == NULL || map_name[0] == '\0') {
1915
		pr_warn("map #%d: empty name.\n", var_idx);
1916 1917 1918
		return -EINVAL;
	}
	if ((__u64)vi->offset + vi->size > data->d_size) {
1919
		pr_warn("map '%s' BTF data is corrupted.\n", map_name);
1920 1921
		return -EINVAL;
	}
1922
	if (!btf_is_var(var)) {
1923 1924
		pr_warn("map '%s': unexpected var kind %u.\n",
			map_name, btf_kind(var));
1925 1926 1927 1928
		return -EINVAL;
	}
	if (var_extra->linkage != BTF_VAR_GLOBAL_ALLOCATED &&
	    var_extra->linkage != BTF_VAR_STATIC) {
1929 1930
		pr_warn("map '%s': unsupported var linkage %u.\n",
			map_name, var_extra->linkage);
1931 1932 1933
		return -EOPNOTSUPP;
	}

1934
	def = skip_mods_and_typedefs(obj->btf, var->type, NULL);
1935
	if (!btf_is_struct(def)) {
1936 1937
		pr_warn("map '%s': unexpected def kind %u.\n",
			map_name, btf_kind(var));
1938 1939 1940
		return -EINVAL;
	}
	if (def->size > vi->size) {
1941
		pr_warn("map '%s': invalid def size.\n", map_name);
1942 1943 1944 1945 1946 1947 1948 1949
		return -EINVAL;
	}

	map = bpf_object__add_map(obj);
	if (IS_ERR(map))
		return PTR_ERR(map);
	map->name = strdup(map_name);
	if (!map->name) {
1950
		pr_warn("map '%s': failed to alloc map name.\n", map_name);
1951 1952 1953 1954 1955 1956 1957 1958 1959
		return -ENOMEM;
	}
	map->libbpf_type = LIBBPF_MAP_UNSPEC;
	map->def.type = BPF_MAP_TYPE_UNSPEC;
	map->sec_idx = sec_idx;
	map->sec_offset = vi->offset;
	pr_debug("map '%s': at sec_idx %d, offset %zu.\n",
		 map_name, map->sec_idx, map->sec_offset);

1960 1961
	vlen = btf_vlen(def);
	m = btf_members(def);
1962 1963 1964 1965
	for (i = 0; i < vlen; i++, m++) {
		const char *name = btf__name_by_offset(obj->btf, m->name_off);

		if (!name) {
1966
			pr_warn("map '%s': invalid field #%d.\n", map_name, i);
1967 1968 1969 1970
			return -EINVAL;
		}
		if (strcmp(name, "type") == 0) {
			if (!get_map_field_int(map_name, obj->btf, def, m,
1971
					       &map->def.type))
1972 1973 1974 1975 1976
				return -EINVAL;
			pr_debug("map '%s': found type = %u.\n",
				 map_name, map->def.type);
		} else if (strcmp(name, "max_entries") == 0) {
			if (!get_map_field_int(map_name, obj->btf, def, m,
1977
					       &map->def.max_entries))
1978 1979 1980 1981 1982
				return -EINVAL;
			pr_debug("map '%s': found max_entries = %u.\n",
				 map_name, map->def.max_entries);
		} else if (strcmp(name, "map_flags") == 0) {
			if (!get_map_field_int(map_name, obj->btf, def, m,
1983
					       &map->def.map_flags))
1984 1985 1986 1987 1988 1989 1990
				return -EINVAL;
			pr_debug("map '%s': found map_flags = %u.\n",
				 map_name, map->def.map_flags);
		} else if (strcmp(name, "key_size") == 0) {
			__u32 sz;

			if (!get_map_field_int(map_name, obj->btf, def, m,
1991
					       &sz))
1992 1993 1994 1995
				return -EINVAL;
			pr_debug("map '%s': found key_size = %u.\n",
				 map_name, sz);
			if (map->def.key_size && map->def.key_size != sz) {
1996 1997
				pr_warn("map '%s': conflicting key size %u != %u.\n",
					map_name, map->def.key_size, sz);
1998 1999 2000 2001 2002 2003 2004 2005
				return -EINVAL;
			}
			map->def.key_size = sz;
		} else if (strcmp(name, "key") == 0) {
			__s64 sz;

			t = btf__type_by_id(obj->btf, m->type);
			if (!t) {
2006 2007
				pr_warn("map '%s': key type [%d] not found.\n",
					map_name, m->type);
2008 2009
				return -EINVAL;
			}
2010
			if (!btf_is_ptr(t)) {
2011 2012
				pr_warn("map '%s': key spec is not PTR: %u.\n",
					map_name, btf_kind(t));
2013 2014 2015 2016
				return -EINVAL;
			}
			sz = btf__resolve_size(obj->btf, t->type);
			if (sz < 0) {
2017 2018
				pr_warn("map '%s': can't determine key size for type [%u]: %zd.\n",
					map_name, t->type, (ssize_t)sz);
2019 2020
				return sz;
			}
2021 2022
			pr_debug("map '%s': found key [%u], sz = %zd.\n",
				 map_name, t->type, (ssize_t)sz);
2023
			if (map->def.key_size && map->def.key_size != sz) {
2024 2025
				pr_warn("map '%s': conflicting key size %u != %zd.\n",
					map_name, map->def.key_size, (ssize_t)sz);
2026 2027 2028 2029 2030 2031 2032 2033
				return -EINVAL;
			}
			map->def.key_size = sz;
			map->btf_key_type_id = t->type;
		} else if (strcmp(name, "value_size") == 0) {
			__u32 sz;

			if (!get_map_field_int(map_name, obj->btf, def, m,
2034
					       &sz))
2035 2036 2037 2038
				return -EINVAL;
			pr_debug("map '%s': found value_size = %u.\n",
				 map_name, sz);
			if (map->def.value_size && map->def.value_size != sz) {
2039 2040
				pr_warn("map '%s': conflicting value size %u != %u.\n",
					map_name, map->def.value_size, sz);
2041 2042 2043 2044 2045 2046 2047 2048
				return -EINVAL;
			}
			map->def.value_size = sz;
		} else if (strcmp(name, "value") == 0) {
			__s64 sz;

			t = btf__type_by_id(obj->btf, m->type);
			if (!t) {
2049 2050
				pr_warn("map '%s': value type [%d] not found.\n",
					map_name, m->type);
2051 2052
				return -EINVAL;
			}
2053
			if (!btf_is_ptr(t)) {
2054 2055
				pr_warn("map '%s': value spec is not PTR: %u.\n",
					map_name, btf_kind(t));
2056 2057 2058 2059
				return -EINVAL;
			}
			sz = btf__resolve_size(obj->btf, t->type);
			if (sz < 0) {
2060 2061
				pr_warn("map '%s': can't determine value size for type [%u]: %zd.\n",
					map_name, t->type, (ssize_t)sz);
2062 2063
				return sz;
			}
2064 2065
			pr_debug("map '%s': found value [%u], sz = %zd.\n",
				 map_name, t->type, (ssize_t)sz);
2066
			if (map->def.value_size && map->def.value_size != sz) {
2067 2068
				pr_warn("map '%s': conflicting value size %u != %zd.\n",
					map_name, map->def.value_size, (ssize_t)sz);
2069 2070 2071 2072
				return -EINVAL;
			}
			map->def.value_size = sz;
			map->btf_value_type_id = t->type;
2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096
		} else if (strcmp(name, "pinning") == 0) {
			__u32 val;
			int err;

			if (!get_map_field_int(map_name, obj->btf, def, m,
					       &val))
				return -EINVAL;
			pr_debug("map '%s': found pinning = %u.\n",
				 map_name, val);

			if (val != LIBBPF_PIN_NONE &&
			    val != LIBBPF_PIN_BY_NAME) {
				pr_warn("map '%s': invalid pinning value %u.\n",
					map_name, val);
				return -EINVAL;
			}
			if (val == LIBBPF_PIN_BY_NAME) {
				err = build_map_pin_path(map, pin_root_path);
				if (err) {
					pr_warn("map '%s': couldn't build pin path.\n",
						map_name);
					return err;
				}
			}
2097 2098
		} else {
			if (strict) {
2099 2100
				pr_warn("map '%s': unknown field '%s'.\n",
					map_name, name);
2101 2102 2103 2104 2105 2106 2107 2108
				return -ENOTSUP;
			}
			pr_debug("map '%s': ignoring unknown field '%s'.\n",
				 map_name, name);
		}
	}

	if (map->def.type == BPF_MAP_TYPE_UNSPEC) {
2109
		pr_warn("map '%s': map type isn't specified.\n", map_name);
2110 2111 2112 2113 2114 2115
		return -EINVAL;
	}

	return 0;
}

2116 2117
static int bpf_object__init_user_btf_maps(struct bpf_object *obj, bool strict,
					  const char *pin_root_path)
2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132
{
	const struct btf_type *sec = NULL;
	int nr_types, i, vlen, err;
	const struct btf_type *t;
	const char *name;
	Elf_Data *data;
	Elf_Scn *scn;

	if (obj->efile.btf_maps_shndx < 0)
		return 0;

	scn = elf_getscn(obj->efile.elf, obj->efile.btf_maps_shndx);
	if (scn)
		data = elf_getdata(scn, NULL);
	if (!scn || !data) {
2133 2134
		pr_warn("failed to get Elf_Data from map section %d (%s)\n",
			obj->efile.maps_shndx, MAPS_ELF_SEC);
2135 2136 2137 2138 2139 2140
		return -EINVAL;
	}

	nr_types = btf__get_nr_types(obj->btf);
	for (i = 1; i <= nr_types; i++) {
		t = btf__type_by_id(obj->btf, i);
2141
		if (!btf_is_datasec(t))
2142 2143 2144 2145 2146 2147 2148 2149 2150
			continue;
		name = btf__name_by_offset(obj->btf, t->name_off);
		if (strcmp(name, MAPS_ELF_SEC) == 0) {
			sec = t;
			break;
		}
	}

	if (!sec) {
2151
		pr_warn("DATASEC '%s' not found.\n", MAPS_ELF_SEC);
2152 2153 2154
		return -ENOENT;
	}

2155
	vlen = btf_vlen(sec);
2156 2157 2158
	for (i = 0; i < vlen; i++) {
		err = bpf_object__init_user_btf_map(obj, sec, i,
						    obj->efile.btf_maps_shndx,
2159 2160
						    data, strict,
						    pin_root_path);
2161 2162 2163 2164 2165 2166 2167
		if (err)
			return err;
	}

	return 0;
}

2168
static int bpf_object__init_maps(struct bpf_object *obj,
2169
				 const struct bpf_object_open_opts *opts)
2170
{
2171 2172
	const char *pin_root_path;
	bool strict;
2173
	int err;
2174

2175 2176
	strict = !OPTS_GET(opts, relaxed_maps, false);
	pin_root_path = OPTS_GET(opts, pin_root_path, NULL);
2177

2178 2179 2180
	err = bpf_object__init_user_maps(obj, strict);
	err = err ?: bpf_object__init_user_btf_maps(obj, strict, pin_root_path);
	err = err ?: bpf_object__init_global_data_maps(obj);
2181
	err = err ?: bpf_object__init_kconfig_map(obj);
2182
	err = err ?: bpf_object__init_struct_ops_maps(obj);
2183 2184 2185 2186
	if (err)
		return err;

	return 0;
2187 2188
}

2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206
static bool section_have_execinstr(struct bpf_object *obj, int idx)
{
	Elf_Scn *scn;
	GElf_Shdr sh;

	scn = elf_getscn(obj->efile.elf, idx);
	if (!scn)
		return false;

	if (gelf_getshdr(scn, &sh) != &sh)
		return false;

	if (sh.sh_flags & SHF_EXECINSTR)
		return true;

	return false;
}

2207 2208
static void bpf_object__sanitize_btf(struct bpf_object *obj)
{
2209
	bool has_func_global = obj->caps.btf_func_global;
2210 2211 2212 2213 2214 2215
	bool has_datasec = obj->caps.btf_datasec;
	bool has_func = obj->caps.btf_func;
	struct btf *btf = obj->btf;
	struct btf_type *t;
	int i, j, vlen;

2216
	if (!obj->btf || (has_func && has_datasec && has_func_global))
2217 2218 2219 2220 2221
		return;

	for (i = 1; i <= btf__get_nr_types(btf); i++) {
		t = (struct btf_type *)btf__type_by_id(btf, i);

2222
		if (!has_datasec && btf_is_var(t)) {
2223 2224
			/* replace VAR with INT */
			t->info = BTF_INFO_ENC(BTF_KIND_INT, 0, 0);
2225 2226 2227 2228 2229 2230
			/*
			 * using size = 1 is the safest choice, 4 will be too
			 * big and cause kernel BTF validation failure if
			 * original variable took less than 4 bytes
			 */
			t->size = 1;
2231
			*(int *)(t + 1) = BTF_INT_ENC(0, 0, 8);
2232
		} else if (!has_datasec && btf_is_datasec(t)) {
2233
			/* replace DATASEC with STRUCT */
2234 2235
			const struct btf_var_secinfo *v = btf_var_secinfos(t);
			struct btf_member *m = btf_members(t);
2236 2237 2238 2239 2240 2241 2242 2243 2244 2245
			struct btf_type *vt;
			char *name;

			name = (char *)btf__name_by_offset(btf, t->name_off);
			while (*name) {
				if (*name == '.')
					*name = '_';
				name++;
			}

2246
			vlen = btf_vlen(t);
2247 2248 2249 2250 2251 2252 2253 2254 2255
			t->info = BTF_INFO_ENC(BTF_KIND_STRUCT, 0, vlen);
			for (j = 0; j < vlen; j++, v++, m++) {
				/* order of field assignments is important */
				m->offset = v->offset * 8;
				m->type = v->type;
				/* preserve variable name as member name */
				vt = (void *)btf__type_by_id(btf, v->type);
				m->name_off = vt->name_off;
			}
2256
		} else if (!has_func && btf_is_func_proto(t)) {
2257
			/* replace FUNC_PROTO with ENUM */
2258
			vlen = btf_vlen(t);
2259 2260
			t->info = BTF_INFO_ENC(BTF_KIND_ENUM, 0, vlen);
			t->size = sizeof(__u32); /* kernel enforced */
2261
		} else if (!has_func && btf_is_func(t)) {
2262 2263
			/* replace FUNC with TYPEDEF */
			t->info = BTF_INFO_ENC(BTF_KIND_TYPEDEF, 0, 0);
2264 2265 2266
		} else if (!has_func_global && btf_is_func(t)) {
			/* replace BTF_FUNC_GLOBAL with BTF_FUNC_STATIC */
			t->info = BTF_INFO_ENC(BTF_KIND_FUNC, 0, 0);
2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281
		}
	}
}

static void bpf_object__sanitize_btf_ext(struct bpf_object *obj)
{
	if (!obj->btf_ext)
		return;

	if (!obj->caps.btf_func) {
		btf_ext__free(obj->btf_ext);
		obj->btf_ext = NULL;
	}
}

2282 2283
static bool bpf_object__is_btf_mandatory(const struct bpf_object *obj)
{
2284
	return obj->efile.btf_maps_shndx >= 0 ||
2285 2286
		obj->efile.st_ops_shndx >= 0 ||
		obj->nr_extern > 0;
2287 2288
}

2289
static int bpf_object__init_btf(struct bpf_object *obj,
2290 2291 2292
				Elf_Data *btf_data,
				Elf_Data *btf_ext_data)
{
2293
	int err = -ENOENT;
2294 2295 2296 2297

	if (btf_data) {
		obj->btf = btf__new(btf_data->d_buf, btf_data->d_size);
		if (IS_ERR(obj->btf)) {
2298 2299
			err = PTR_ERR(obj->btf);
			obj->btf = NULL;
2300 2301
			pr_warn("Error loading ELF section %s: %d.\n",
				BTF_ELF_SEC, err);
2302 2303
			goto out;
		}
2304
		err = 0;
2305 2306 2307 2308 2309 2310 2311 2312 2313 2314
	}
	if (btf_ext_data) {
		if (!obj->btf) {
			pr_debug("Ignore ELF section %s because its depending ELF section %s is not found.\n",
				 BTF_EXT_ELF_SEC, BTF_ELF_SEC);
			goto out;
		}
		obj->btf_ext = btf_ext__new(btf_ext_data->d_buf,
					    btf_ext_data->d_size);
		if (IS_ERR(obj->btf_ext)) {
2315 2316
			pr_warn("Error loading ELF section %s: %ld. Ignored and continue.\n",
				BTF_EXT_ELF_SEC, PTR_ERR(obj->btf_ext));
2317 2318 2319 2320 2321
			obj->btf_ext = NULL;
			goto out;
		}
	}
out:
2322
	if (err && bpf_object__is_btf_mandatory(obj)) {
2323
		pr_warn("BTF is required, but is missing or corrupted.\n");
2324
		return err;
2325
	}
2326 2327 2328
	return 0;
}

2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352
static int bpf_object__finalize_btf(struct bpf_object *obj)
{
	int err;

	if (!obj->btf)
		return 0;

	err = btf__finalize_data(obj, obj->btf);
	if (!err)
		return 0;

	pr_warn("Error finalizing %s: %d.\n", BTF_ELF_SEC, err);
	btf__free(obj->btf);
	obj->btf = NULL;
	btf_ext__free(obj->btf_ext);
	obj->btf_ext = NULL;

	if (bpf_object__is_btf_mandatory(obj)) {
		pr_warn("BTF is required, but is missing or corrupted.\n");
		return -ENOENT;
	}
	return 0;
}

2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387
static inline bool libbpf_prog_needs_vmlinux_btf(struct bpf_program *prog)
{
	if (prog->type == BPF_PROG_TYPE_STRUCT_OPS)
		return true;

	/* BPF_PROG_TYPE_TRACING programs which do not attach to other programs
	 * also need vmlinux BTF
	 */
	if (prog->type == BPF_PROG_TYPE_TRACING && !prog->attach_prog_fd)
		return true;

	return false;
}

static int bpf_object__load_vmlinux_btf(struct bpf_object *obj)
{
	struct bpf_program *prog;
	int err;

	bpf_object__for_each_program(prog, obj) {
		if (libbpf_prog_needs_vmlinux_btf(prog)) {
			obj->btf_vmlinux = libbpf_find_kernel_btf();
			if (IS_ERR(obj->btf_vmlinux)) {
				err = PTR_ERR(obj->btf_vmlinux);
				pr_warn("Error loading vmlinux BTF: %d\n", err);
				obj->btf_vmlinux = NULL;
				return err;
			}
			return 0;
		}
	}

	return 0;
}

2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399
static int bpf_object__sanitize_and_load_btf(struct bpf_object *obj)
{
	int err = 0;

	if (!obj->btf)
		return 0;

	bpf_object__sanitize_btf(obj);
	bpf_object__sanitize_btf_ext(obj);

	err = btf__load(obj->btf);
	if (err) {
2400 2401
		pr_warn("Error loading %s into kernel: %d.\n",
			BTF_ELF_SEC, err);
2402 2403
		btf__free(obj->btf);
		obj->btf = NULL;
2404 2405 2406 2407 2408 2409
		/* btf_ext can't exist without btf, so free it as well */
		if (obj->btf_ext) {
			btf_ext__free(obj->btf_ext);
			obj->btf_ext = NULL;
		}

2410 2411
		if (bpf_object__is_btf_mandatory(obj))
			return err;
2412 2413 2414 2415
	}
	return 0;
}

2416
static int bpf_object__elf_collect(struct bpf_object *obj)
2417 2418 2419
{
	Elf *elf = obj->efile.elf;
	GElf_Ehdr *ep = &obj->efile.ehdr;
2420
	Elf_Data *btf_ext_data = NULL;
2421
	Elf_Data *btf_data = NULL;
2422
	Elf_Scn *scn = NULL;
2423
	int idx = 0, err = 0;
2424 2425 2426

	/* Elf is corrupted/truncated, avoid calling elf_strptr. */
	if (!elf_rawdata(elf_getscn(elf, ep->e_shstrndx), NULL)) {
2427
		pr_warn("failed to get e_shstrndx from %s\n", obj->path);
2428
		return -LIBBPF_ERRNO__FORMAT;
2429 2430 2431 2432 2433 2434 2435 2436 2437
	}

	while ((scn = elf_nextscn(elf, scn)) != NULL) {
		char *name;
		GElf_Shdr sh;
		Elf_Data *data;

		idx++;
		if (gelf_getshdr(scn, &sh) != &sh) {
2438 2439
			pr_warn("failed to get section(%d) header from %s\n",
				idx, obj->path);
2440
			return -LIBBPF_ERRNO__FORMAT;
2441 2442 2443 2444
		}

		name = elf_strptr(elf, ep->e_shstrndx, sh.sh_name);
		if (!name) {
2445 2446
			pr_warn("failed to get section(%d) name from %s\n",
				idx, obj->path);
2447
			return -LIBBPF_ERRNO__FORMAT;
2448 2449 2450 2451
		}

		data = elf_getdata(scn, 0);
		if (!data) {
2452 2453
			pr_warn("failed to get section(%d) data from %s(%s)\n",
				idx, name, obj->path);
2454
			return -LIBBPF_ERRNO__FORMAT;
2455
		}
2456 2457
		pr_debug("section(%d) %s, size %ld, link %d, flags %lx, type=%d\n",
			 idx, name, (unsigned long)data->d_size,
2458 2459
			 (int)sh.sh_link, (unsigned long)sh.sh_flags,
			 (int)sh.sh_type);
2460

2461
		if (strcmp(name, "license") == 0) {
2462 2463 2464
			err = bpf_object__init_license(obj,
						       data->d_buf,
						       data->d_size);
2465 2466
			if (err)
				return err;
2467
		} else if (strcmp(name, "version") == 0) {
2468 2469 2470 2471 2472
			err = bpf_object__init_kversion(obj,
							data->d_buf,
							data->d_size);
			if (err)
				return err;
2473
		} else if (strcmp(name, "maps") == 0) {
2474
			obj->efile.maps_shndx = idx;
2475 2476
		} else if (strcmp(name, MAPS_ELF_SEC) == 0) {
			obj->efile.btf_maps_shndx = idx;
2477 2478
		} else if (strcmp(name, BTF_ELF_SEC) == 0) {
			btf_data = data;
2479
		} else if (strcmp(name, BTF_EXT_ELF_SEC) == 0) {
2480
			btf_ext_data = data;
2481
		} else if (sh.sh_type == SHT_SYMTAB) {
2482
			if (obj->efile.symbols) {
2483 2484
				pr_warn("bpf: multiple SYMTAB in %s\n",
					obj->path);
2485
				return -LIBBPF_ERRNO__FORMAT;
2486
			}
2487
			obj->efile.symbols = data;
2488
			obj->efile.symbols_shndx = idx;
2489
			obj->efile.strtabidx = sh.sh_link;
2490 2491 2492 2493 2494
		} else if (sh.sh_type == SHT_PROGBITS && data->d_size > 0) {
			if (sh.sh_flags & SHF_EXECINSTR) {
				if (strcmp(name, ".text") == 0)
					obj->efile.text_shndx = idx;
				err = bpf_object__add_program(obj, data->d_buf,
2495 2496
							      data->d_size,
							      name, idx);
2497 2498
				if (err) {
					char errmsg[STRERR_BUFSIZE];
2499
					char *cp;
2500

2501 2502
					cp = libbpf_strerror_r(-err, errmsg,
							       sizeof(errmsg));
2503 2504
					pr_warn("failed to alloc program %s (%s): %s",
						name, obj->path, cp);
2505
					return err;
2506
				}
2507
			} else if (strcmp(name, DATA_SEC) == 0) {
2508 2509
				obj->efile.data = data;
				obj->efile.data_shndx = idx;
2510
			} else if (strcmp(name, RODATA_SEC) == 0) {
2511 2512
				obj->efile.rodata = data;
				obj->efile.rodata_shndx = idx;
2513 2514 2515
			} else if (strcmp(name, STRUCT_OPS_SEC) == 0) {
				obj->efile.st_ops_data = data;
				obj->efile.st_ops_shndx = idx;
2516 2517
			} else {
				pr_debug("skip section(%d) %s\n", idx, name);
2518
			}
2519
		} else if (sh.sh_type == SHT_REL) {
2520 2521
			int nr_sects = obj->efile.nr_reloc_sects;
			void *sects = obj->efile.reloc_sects;
2522 2523 2524
			int sec = sh.sh_info; /* points to other section */

			/* Only do relo for section with exec instructions */
2525 2526
			if (!section_have_execinstr(obj, sec) &&
			    strcmp(name, ".rel" STRUCT_OPS_SEC)) {
2527 2528 2529 2530
				pr_debug("skip relo %s(%d) for section(%d)\n",
					 name, idx, sec);
				continue;
			}
2531

2532 2533 2534 2535
			sects = reallocarray(sects, nr_sects + 1,
					     sizeof(*obj->efile.reloc_sects));
			if (!sects) {
				pr_warn("reloc_sects realloc failed\n");
2536 2537
				return -ENOMEM;
			}
2538

2539 2540
			obj->efile.reloc_sects = sects;
			obj->efile.nr_reloc_sects++;
2541

2542 2543
			obj->efile.reloc_sects[nr_sects].shdr = sh;
			obj->efile.reloc_sects[nr_sects].data = data;
2544 2545
		} else if (sh.sh_type == SHT_NOBITS &&
			   strcmp(name, BSS_SEC) == 0) {
2546 2547
			obj->efile.bss = data;
			obj->efile.bss_shndx = idx;
2548 2549
		} else {
			pr_debug("skip section(%d) %s\n", idx, name);
2550
		}
2551
	}
2552

2553
	if (!obj->efile.strtabidx || obj->efile.strtabidx > idx) {
2554
		pr_warn("Corrupted ELF file: index of strtab invalid\n");
2555
		return -LIBBPF_ERRNO__FORMAT;
2556
	}
2557
	return bpf_object__init_btf(obj, btf_data, btf_ext_data);
2558 2559
}

2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742
static bool sym_is_extern(const GElf_Sym *sym)
{
	int bind = GELF_ST_BIND(sym->st_info);
	/* externs are symbols w/ type=NOTYPE, bind=GLOBAL|WEAK, section=UND */
	return sym->st_shndx == SHN_UNDEF &&
	       (bind == STB_GLOBAL || bind == STB_WEAK) &&
	       GELF_ST_TYPE(sym->st_info) == STT_NOTYPE;
}

static int find_extern_btf_id(const struct btf *btf, const char *ext_name)
{
	const struct btf_type *t;
	const char *var_name;
	int i, n;

	if (!btf)
		return -ESRCH;

	n = btf__get_nr_types(btf);
	for (i = 1; i <= n; i++) {
		t = btf__type_by_id(btf, i);

		if (!btf_is_var(t))
			continue;

		var_name = btf__name_by_offset(btf, t->name_off);
		if (strcmp(var_name, ext_name))
			continue;

		if (btf_var(t)->linkage != BTF_VAR_GLOBAL_EXTERN)
			return -EINVAL;

		return i;
	}

	return -ENOENT;
}

static enum extern_type find_extern_type(const struct btf *btf, int id,
					 bool *is_signed)
{
	const struct btf_type *t;
	const char *name;

	t = skip_mods_and_typedefs(btf, id, NULL);
	name = btf__name_by_offset(btf, t->name_off);

	if (is_signed)
		*is_signed = false;
	switch (btf_kind(t)) {
	case BTF_KIND_INT: {
		int enc = btf_int_encoding(t);

		if (enc & BTF_INT_BOOL)
			return t->size == 1 ? EXT_BOOL : EXT_UNKNOWN;
		if (is_signed)
			*is_signed = enc & BTF_INT_SIGNED;
		if (t->size == 1)
			return EXT_CHAR;
		if (t->size < 1 || t->size > 8 || (t->size & (t->size - 1)))
			return EXT_UNKNOWN;
		return EXT_INT;
	}
	case BTF_KIND_ENUM:
		if (t->size != 4)
			return EXT_UNKNOWN;
		if (strcmp(name, "libbpf_tristate"))
			return EXT_UNKNOWN;
		return EXT_TRISTATE;
	case BTF_KIND_ARRAY:
		if (btf_array(t)->nelems == 0)
			return EXT_UNKNOWN;
		if (find_extern_type(btf, btf_array(t)->type, NULL) != EXT_CHAR)
			return EXT_UNKNOWN;
		return EXT_CHAR_ARR;
	default:
		return EXT_UNKNOWN;
	}
}

static int cmp_externs(const void *_a, const void *_b)
{
	const struct extern_desc *a = _a;
	const struct extern_desc *b = _b;

	/* descending order by alignment requirements */
	if (a->align != b->align)
		return a->align > b->align ? -1 : 1;
	/* ascending order by size, within same alignment class */
	if (a->sz != b->sz)
		return a->sz < b->sz ? -1 : 1;
	/* resolve ties by name */
	return strcmp(a->name, b->name);
}

static int bpf_object__collect_externs(struct bpf_object *obj)
{
	const struct btf_type *t;
	struct extern_desc *ext;
	int i, n, off, btf_id;
	struct btf_type *sec;
	const char *ext_name;
	Elf_Scn *scn;
	GElf_Shdr sh;

	if (!obj->efile.symbols)
		return 0;

	scn = elf_getscn(obj->efile.elf, obj->efile.symbols_shndx);
	if (!scn)
		return -LIBBPF_ERRNO__FORMAT;
	if (gelf_getshdr(scn, &sh) != &sh)
		return -LIBBPF_ERRNO__FORMAT;
	n = sh.sh_size / sh.sh_entsize;

	pr_debug("looking for externs among %d symbols...\n", n);
	for (i = 0; i < n; i++) {
		GElf_Sym sym;

		if (!gelf_getsym(obj->efile.symbols, i, &sym))
			return -LIBBPF_ERRNO__FORMAT;
		if (!sym_is_extern(&sym))
			continue;
		ext_name = elf_strptr(obj->efile.elf, obj->efile.strtabidx,
				      sym.st_name);
		if (!ext_name || !ext_name[0])
			continue;

		ext = obj->externs;
		ext = reallocarray(ext, obj->nr_extern + 1, sizeof(*ext));
		if (!ext)
			return -ENOMEM;
		obj->externs = ext;
		ext = &ext[obj->nr_extern];
		memset(ext, 0, sizeof(*ext));
		obj->nr_extern++;

		ext->btf_id = find_extern_btf_id(obj->btf, ext_name);
		if (ext->btf_id <= 0) {
			pr_warn("failed to find BTF for extern '%s': %d\n",
				ext_name, ext->btf_id);
			return ext->btf_id;
		}
		t = btf__type_by_id(obj->btf, ext->btf_id);
		ext->name = btf__name_by_offset(obj->btf, t->name_off);
		ext->sym_idx = i;
		ext->is_weak = GELF_ST_BIND(sym.st_info) == STB_WEAK;
		ext->sz = btf__resolve_size(obj->btf, t->type);
		if (ext->sz <= 0) {
			pr_warn("failed to resolve size of extern '%s': %d\n",
				ext_name, ext->sz);
			return ext->sz;
		}
		ext->align = btf__align_of(obj->btf, t->type);
		if (ext->align <= 0) {
			pr_warn("failed to determine alignment of extern '%s': %d\n",
				ext_name, ext->align);
			return -EINVAL;
		}
		ext->type = find_extern_type(obj->btf, t->type,
					     &ext->is_signed);
		if (ext->type == EXT_UNKNOWN) {
			pr_warn("extern '%s' type is unsupported\n", ext_name);
			return -ENOTSUP;
		}
	}
	pr_debug("collected %d externs total\n", obj->nr_extern);

	if (!obj->nr_extern)
		return 0;

	/* sort externs by (alignment, size, name) and calculate their offsets
	 * within a map */
	qsort(obj->externs, obj->nr_extern, sizeof(*ext), cmp_externs);
	off = 0;
	for (i = 0; i < obj->nr_extern; i++) {
		ext = &obj->externs[i];
		ext->data_off = roundup(off, ext->align);
		off = ext->data_off + ext->sz;
		pr_debug("extern #%d: symbol %d, off %u, name %s\n",
			 i, ext->sym_idx, ext->data_off, ext->name);
	}

2743
	btf_id = btf__find_by_name(obj->btf, KCONFIG_SEC);
2744
	if (btf_id <= 0) {
2745
		pr_warn("no BTF info found for '%s' datasec\n", KCONFIG_SEC);
2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769
		return -ESRCH;
	}

	sec = (struct btf_type *)btf__type_by_id(obj->btf, btf_id);
	sec->size = off;
	n = btf_vlen(sec);
	for (i = 0; i < n; i++) {
		struct btf_var_secinfo *vs = btf_var_secinfos(sec) + i;

		t = btf__type_by_id(obj->btf, vs->type);
		ext_name = btf__name_by_offset(obj->btf, t->name_off);
		ext = find_extern_by_name(obj, ext_name);
		if (!ext) {
			pr_warn("failed to find extern definition for BTF var '%s'\n",
				ext_name);
			return -ESRCH;
		}
		vs->offset = ext->data_off;
		btf_var(t)->linkage = BTF_VAR_GLOBAL_ALLOCATED;
	}

	return 0;
}

2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783
static struct bpf_program *
bpf_object__find_prog_by_idx(struct bpf_object *obj, int idx)
{
	struct bpf_program *prog;
	size_t i;

	for (i = 0; i < obj->nr_programs; i++) {
		prog = &obj->programs[i];
		if (prog->idx == idx)
			return prog;
	}
	return NULL;
}

2784
struct bpf_program *
A
Andrii Nakryiko 已提交
2785 2786
bpf_object__find_program_by_title(const struct bpf_object *obj,
				  const char *title)
2787 2788 2789 2790 2791 2792 2793 2794 2795 2796
{
	struct bpf_program *pos;

	bpf_object__for_each_program(pos, obj) {
		if (pos->section_name && !strcmp(pos->section_name, title))
			return pos;
	}
	return NULL;
}

2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809
struct bpf_program *
bpf_object__find_program_by_name(const struct bpf_object *obj,
				 const char *name)
{
	struct bpf_program *prog;

	bpf_object__for_each_program(prog, obj) {
		if (!strcmp(prog->name, name))
			return prog;
	}
	return NULL;
}

2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820
static bool bpf_object__shndx_is_data(const struct bpf_object *obj,
				      int shndx)
{
	return shndx == obj->efile.data_shndx ||
	       shndx == obj->efile.bss_shndx ||
	       shndx == obj->efile.rodata_shndx;
}

static bool bpf_object__shndx_is_maps(const struct bpf_object *obj,
				      int shndx)
{
2821 2822
	return shndx == obj->efile.maps_shndx ||
	       shndx == obj->efile.btf_maps_shndx;
2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833
}

static enum libbpf_map_type
bpf_object__section_to_libbpf_map_type(const struct bpf_object *obj, int shndx)
{
	if (shndx == obj->efile.data_shndx)
		return LIBBPF_MAP_DATA;
	else if (shndx == obj->efile.bss_shndx)
		return LIBBPF_MAP_BSS;
	else if (shndx == obj->efile.rodata_shndx)
		return LIBBPF_MAP_RODATA;
2834
	else if (shndx == obj->efile.symbols_shndx)
2835
		return LIBBPF_MAP_KCONFIG;
2836 2837 2838 2839
	else
		return LIBBPF_MAP_UNSPEC;
}

2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863
static int bpf_program__record_reloc(struct bpf_program *prog,
				     struct reloc_desc *reloc_desc,
				     __u32 insn_idx, const char *name,
				     const GElf_Sym *sym, const GElf_Rel *rel)
{
	struct bpf_insn *insn = &prog->insns[insn_idx];
	size_t map_idx, nr_maps = prog->obj->nr_maps;
	struct bpf_object *obj = prog->obj;
	__u32 shdr_idx = sym->st_shndx;
	enum libbpf_map_type type;
	struct bpf_map *map;

	/* sub-program call relocation */
	if (insn->code == (BPF_JMP | BPF_CALL)) {
		if (insn->src_reg != BPF_PSEUDO_CALL) {
			pr_warn("incorrect bpf_call opcode\n");
			return -LIBBPF_ERRNO__RELOC;
		}
		/* text_shndx can be 0, if no default "main" program exists */
		if (!shdr_idx || shdr_idx != obj->efile.text_shndx) {
			pr_warn("bad call relo against section %u\n", shdr_idx);
			return -LIBBPF_ERRNO__RELOC;
		}
		if (sym->st_value % 8) {
2864 2865
			pr_warn("bad call relo offset: %zu\n",
				(size_t)sym->st_value);
2866 2867 2868 2869
			return -LIBBPF_ERRNO__RELOC;
		}
		reloc_desc->type = RELO_CALL;
		reloc_desc->insn_idx = insn_idx;
2870
		reloc_desc->sym_off = sym->st_value;
2871 2872 2873 2874 2875
		obj->has_pseudo_calls = true;
		return 0;
	}

	if (insn->code != (BPF_LD | BPF_IMM | BPF_DW)) {
2876
		pr_warn("invalid relo for insns[%d].code 0x%x\n",
2877 2878 2879
			insn_idx, insn->code);
		return -LIBBPF_ERRNO__RELOC;
	}
2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903

	if (sym_is_extern(sym)) {
		int sym_idx = GELF_R_SYM(rel->r_info);
		int i, n = obj->nr_extern;
		struct extern_desc *ext;

		for (i = 0; i < n; i++) {
			ext = &obj->externs[i];
			if (ext->sym_idx == sym_idx)
				break;
		}
		if (i >= n) {
			pr_warn("extern relo failed to find extern for sym %d\n",
				sym_idx);
			return -LIBBPF_ERRNO__RELOC;
		}
		pr_debug("found extern #%d '%s' (sym %d, off %u) for insn %u\n",
			 i, ext->name, ext->sym_idx, ext->data_off, insn_idx);
		reloc_desc->type = RELO_EXTERN;
		reloc_desc->insn_idx = insn_idx;
		reloc_desc->sym_off = ext->data_off;
		return 0;
	}

2904
	if (!shdr_idx || shdr_idx >= SHN_LORESERVE) {
2905 2906
		pr_warn("invalid relo for \'%s\' in special section 0x%x; forgot to initialize global var?..\n",
			name, shdr_idx);
2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930
		return -LIBBPF_ERRNO__RELOC;
	}

	type = bpf_object__section_to_libbpf_map_type(obj, shdr_idx);

	/* generic map reference relocation */
	if (type == LIBBPF_MAP_UNSPEC) {
		if (!bpf_object__shndx_is_maps(obj, shdr_idx)) {
			pr_warn("bad map relo against section %u\n",
				shdr_idx);
			return -LIBBPF_ERRNO__RELOC;
		}
		for (map_idx = 0; map_idx < nr_maps; map_idx++) {
			map = &obj->maps[map_idx];
			if (map->libbpf_type != type ||
			    map->sec_idx != sym->st_shndx ||
			    map->sec_offset != sym->st_value)
				continue;
			pr_debug("found map %zd (%s, sec %d, off %zu) for insn %u\n",
				 map_idx, map->name, map->sec_idx,
				 map->sec_offset, insn_idx);
			break;
		}
		if (map_idx >= nr_maps) {
2931 2932
			pr_warn("map relo failed to find map for sec %u, off %zu\n",
				shdr_idx, (size_t)sym->st_value);
2933 2934 2935 2936 2937
			return -LIBBPF_ERRNO__RELOC;
		}
		reloc_desc->type = RELO_LD64;
		reloc_desc->insn_idx = insn_idx;
		reloc_desc->map_idx = map_idx;
2938
		reloc_desc->sym_off = 0; /* sym->st_value determines map_idx */
2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964
		return 0;
	}

	/* global data map relocation */
	if (!bpf_object__shndx_is_data(obj, shdr_idx)) {
		pr_warn("bad data relo against section %u\n", shdr_idx);
		return -LIBBPF_ERRNO__RELOC;
	}
	for (map_idx = 0; map_idx < nr_maps; map_idx++) {
		map = &obj->maps[map_idx];
		if (map->libbpf_type != type)
			continue;
		pr_debug("found data map %zd (%s, sec %d, off %zu) for insn %u\n",
			 map_idx, map->name, map->sec_idx, map->sec_offset,
			 insn_idx);
		break;
	}
	if (map_idx >= nr_maps) {
		pr_warn("data relo failed to find map for sec %u\n",
			shdr_idx);
		return -LIBBPF_ERRNO__RELOC;
	}

	reloc_desc->type = RELO_DATA;
	reloc_desc->insn_idx = insn_idx;
	reloc_desc->map_idx = map_idx;
2965
	reloc_desc->sym_off = sym->st_value;
2966 2967 2968
	return 0;
}

2969
static int
2970 2971
bpf_program__collect_reloc(struct bpf_program *prog, GElf_Shdr *shdr,
			   Elf_Data *data, struct bpf_object *obj)
2972
{
2973
	Elf_Data *symbols = obj->efile.symbols;
2974
	int err, i, nrels;
2975

2976
	pr_debug("collecting relocating info for: '%s'\n", prog->section_name);
2977 2978 2979 2980
	nrels = shdr->sh_size / shdr->sh_entsize;

	prog->reloc_desc = malloc(sizeof(*prog->reloc_desc) * nrels);
	if (!prog->reloc_desc) {
2981
		pr_warn("failed to alloc memory in relocation\n");
2982 2983 2984 2985 2986
		return -ENOMEM;
	}
	prog->nr_reloc = nrels;

	for (i = 0; i < nrels; i++) {
2987
		const char *name;
2988
		__u32 insn_idx;
2989 2990
		GElf_Sym sym;
		GElf_Rel rel;
2991 2992

		if (!gelf_getrel(data, i, &rel)) {
2993
			pr_warn("relocation: failed to get %d reloc\n", i);
2994
			return -LIBBPF_ERRNO__FORMAT;
2995
		}
2996
		if (!gelf_getsym(symbols, GELF_R_SYM(rel.r_info), &sym)) {
2997 2998
			pr_warn("relocation: symbol %"PRIx64" not found\n",
				GELF_R_SYM(rel.r_info));
2999
			return -LIBBPF_ERRNO__FORMAT;
3000
		}
3001 3002
		if (rel.r_offset % sizeof(struct bpf_insn))
			return -LIBBPF_ERRNO__FORMAT;
3003

3004
		insn_idx = rel.r_offset / sizeof(struct bpf_insn);
3005 3006 3007
		name = elf_strptr(obj->efile.elf, obj->efile.strtabidx,
				  sym.st_name) ? : "<?>";

3008 3009 3010
		pr_debug("relo for shdr %u, symb %zu, value %zu, type %d, bind %d, name %d (\'%s\'), insn %u\n",
			 (__u32)sym.st_shndx, (size_t)GELF_R_SYM(rel.r_info),
			 (size_t)sym.st_value, GELF_ST_TYPE(sym.st_info),
3011 3012
			 GELF_ST_BIND(sym.st_info), sym.st_name, name,
			 insn_idx);
3013

3014 3015 3016 3017
		err = bpf_program__record_reloc(prog, &prog->reloc_desc[i],
						insn_idx, name, &sym, &rel);
		if (err)
			return err;
3018 3019 3020 3021
	}
	return 0;
}

3022
static int bpf_map_find_btf_info(struct bpf_object *obj, struct bpf_map *map)
3023 3024
{
	struct bpf_map_def *def = &map->def;
3025
	__u32 key_type_id = 0, value_type_id = 0;
3026
	int ret;
3027

3028 3029 3030 3031 3032 3033
	/* if it's BTF-defined map, we don't need to search for type IDs.
	 * For struct_ops map, it does not need btf_key_type_id and
	 * btf_value_type_id.
	 */
	if (map->sec_idx == obj->efile.btf_maps_shndx ||
	    bpf_map__is_struct_ops(map))
3034 3035
		return 0;

3036
	if (!bpf_map__is_internal(map)) {
3037
		ret = btf__get_map_kv_tids(obj->btf, map->name, def->key_size,
3038 3039 3040 3041 3042 3043 3044
					   def->value_size, &key_type_id,
					   &value_type_id);
	} else {
		/*
		 * LLVM annotates global data differently in BTF, that is,
		 * only as '.data', '.bss' or '.rodata'.
		 */
3045
		ret = btf__find_by_name(obj->btf,
3046 3047 3048
				libbpf_type_to_btf_name[map->libbpf_type]);
	}
	if (ret < 0)
3049
		return ret;
3050

3051
	map->btf_key_type_id = key_type_id;
3052 3053
	map->btf_value_type_id = bpf_map__is_internal(map) ?
				 ret : value_type_id;
3054 3055 3056
	return 0;
}

J
Jakub Kicinski 已提交
3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072
int bpf_map__reuse_fd(struct bpf_map *map, int fd)
{
	struct bpf_map_info info = {};
	__u32 len = sizeof(info);
	int new_fd, err;
	char *new_name;

	err = bpf_obj_get_info_by_fd(fd, &info, &len);
	if (err)
		return err;

	new_name = strdup(info.name);
	if (!new_name)
		return -errno;

	new_fd = open("/", O_RDONLY | O_CLOEXEC);
3073 3074
	if (new_fd < 0) {
		err = -errno;
J
Jakub Kicinski 已提交
3075
		goto err_free_new_name;
3076
	}
J
Jakub Kicinski 已提交
3077 3078

	new_fd = dup3(fd, new_fd, O_CLOEXEC);
3079 3080
	if (new_fd < 0) {
		err = -errno;
J
Jakub Kicinski 已提交
3081
		goto err_close_new_fd;
3082
	}
J
Jakub Kicinski 已提交
3083 3084

	err = zclose(map->fd);
3085 3086
	if (err) {
		err = -errno;
J
Jakub Kicinski 已提交
3087
		goto err_close_new_fd;
3088
	}
J
Jakub Kicinski 已提交
3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099
	free(map->name);

	map->fd = new_fd;
	map->name = new_name;
	map->def.type = info.type;
	map->def.key_size = info.key_size;
	map->def.value_size = info.value_size;
	map->def.max_entries = info.max_entries;
	map->def.map_flags = info.map_flags;
	map->btf_key_type_id = info.btf_key_type_id;
	map->btf_value_type_id = info.btf_value_type_id;
3100
	map->reused = true;
J
Jakub Kicinski 已提交
3101 3102 3103 3104 3105 3106 3107

	return 0;

err_close_new_fd:
	close(new_fd);
err_free_new_name:
	free(new_name);
3108
	return err;
J
Jakub Kicinski 已提交
3109 3110
}

3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124
int bpf_map__resize(struct bpf_map *map, __u32 max_entries)
{
	if (!map || !max_entries)
		return -EINVAL;

	/* If map already created, its attributes can't be changed. */
	if (map->fd >= 0)
		return -EBUSY;

	map->def.max_entries = max_entries;

	return 0;
}

3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146
static int
bpf_object__probe_name(struct bpf_object *obj)
{
	struct bpf_load_program_attr attr;
	char *cp, errmsg[STRERR_BUFSIZE];
	struct bpf_insn insns[] = {
		BPF_MOV64_IMM(BPF_REG_0, 0),
		BPF_EXIT_INSN(),
	};
	int ret;

	/* make sure basic loading works */

	memset(&attr, 0, sizeof(attr));
	attr.prog_type = BPF_PROG_TYPE_SOCKET_FILTER;
	attr.insns = insns;
	attr.insns_cnt = ARRAY_SIZE(insns);
	attr.license = "GPL";

	ret = bpf_load_program_xattr(&attr, NULL, 0);
	if (ret < 0) {
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
3147 3148
		pr_warn("Error in %s():%s(%d). Couldn't load basic 'r0 = 0' BPF program.\n",
			__func__, cp, errno);
3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164
		return -errno;
	}
	close(ret);

	/* now try the same program, but with the name */

	attr.name = "test";
	ret = bpf_load_program_xattr(&attr, NULL, 0);
	if (ret >= 0) {
		obj->caps.name = 1;
		close(ret);
	}

	return 0;
}

3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187
static int
bpf_object__probe_global_data(struct bpf_object *obj)
{
	struct bpf_load_program_attr prg_attr;
	struct bpf_create_map_attr map_attr;
	char *cp, errmsg[STRERR_BUFSIZE];
	struct bpf_insn insns[] = {
		BPF_LD_MAP_VALUE(BPF_REG_1, 0, 16),
		BPF_ST_MEM(BPF_DW, BPF_REG_1, 0, 42),
		BPF_MOV64_IMM(BPF_REG_0, 0),
		BPF_EXIT_INSN(),
	};
	int ret, map;

	memset(&map_attr, 0, sizeof(map_attr));
	map_attr.map_type = BPF_MAP_TYPE_ARRAY;
	map_attr.key_size = sizeof(int);
	map_attr.value_size = 32;
	map_attr.max_entries = 1;

	map = bpf_create_map_xattr(&map_attr);
	if (map < 0) {
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
3188 3189
		pr_warn("Error in %s():%s(%d). Couldn't create simple array map.\n",
			__func__, cp, errno);
3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210
		return -errno;
	}

	insns[0].imm = map;

	memset(&prg_attr, 0, sizeof(prg_attr));
	prg_attr.prog_type = BPF_PROG_TYPE_SOCKET_FILTER;
	prg_attr.insns = insns;
	prg_attr.insns_cnt = ARRAY_SIZE(insns);
	prg_attr.license = "GPL";

	ret = bpf_load_program_xattr(&prg_attr, NULL, 0);
	if (ret >= 0) {
		obj->caps.global_data = 1;
		close(ret);
	}

	close(map);
	return 0;
}

3211 3212
static int bpf_object__probe_btf_func(struct bpf_object *obj)
{
3213
	static const char strs[] = "\0int\0x\0a";
3214 3215 3216 3217 3218 3219 3220 3221 3222 3223
	/* void x(int a) {} */
	__u32 types[] = {
		/* int */
		BTF_TYPE_INT_ENC(1, BTF_INT_SIGNED, 0, 32, 4),  /* [1] */
		/* FUNC_PROTO */                                /* [2] */
		BTF_TYPE_ENC(0, BTF_INFO_ENC(BTF_KIND_FUNC_PROTO, 0, 1), 0),
		BTF_PARAM_ENC(7, 1),
		/* FUNC x */                                    /* [3] */
		BTF_TYPE_ENC(5, BTF_INFO_ENC(BTF_KIND_FUNC, 0, 0), 2),
	};
3224
	int btf_fd;
3225

3226 3227 3228
	btf_fd = libbpf__load_raw_btf((char *)types, sizeof(types),
				      strs, sizeof(strs));
	if (btf_fd >= 0) {
3229
		obj->caps.btf_func = 1;
3230 3231 3232 3233
		close(btf_fd);
		return 1;
	}

3234 3235 3236
	return 0;
}

3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262
static int bpf_object__probe_btf_func_global(struct bpf_object *obj)
{
	static const char strs[] = "\0int\0x\0a";
	/* static void x(int a) {} */
	__u32 types[] = {
		/* int */
		BTF_TYPE_INT_ENC(1, BTF_INT_SIGNED, 0, 32, 4),  /* [1] */
		/* FUNC_PROTO */                                /* [2] */
		BTF_TYPE_ENC(0, BTF_INFO_ENC(BTF_KIND_FUNC_PROTO, 0, 1), 0),
		BTF_PARAM_ENC(7, 1),
		/* FUNC x BTF_FUNC_GLOBAL */                    /* [3] */
		BTF_TYPE_ENC(5, BTF_INFO_ENC(BTF_KIND_FUNC, 0, BTF_FUNC_GLOBAL), 2),
	};
	int btf_fd;

	btf_fd = libbpf__load_raw_btf((char *)types, sizeof(types),
				      strs, sizeof(strs));
	if (btf_fd >= 0) {
		obj->caps.btf_func_global = 1;
		close(btf_fd);
		return 1;
	}

	return 0;
}

3263 3264
static int bpf_object__probe_btf_datasec(struct bpf_object *obj)
{
3265
	static const char strs[] = "\0x\0.data";
3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276
	/* static int a; */
	__u32 types[] = {
		/* int */
		BTF_TYPE_INT_ENC(0, BTF_INT_SIGNED, 0, 32, 4),  /* [1] */
		/* VAR x */                                     /* [2] */
		BTF_TYPE_ENC(1, BTF_INFO_ENC(BTF_KIND_VAR, 0, 0), 1),
		BTF_VAR_STATIC,
		/* DATASEC val */                               /* [3] */
		BTF_TYPE_ENC(3, BTF_INFO_ENC(BTF_KIND_DATASEC, 0, 1), 4),
		BTF_VAR_SECINFO_ENC(2, 0, 4),
	};
3277
	int btf_fd;
3278

3279 3280 3281
	btf_fd = libbpf__load_raw_btf((char *)types, sizeof(types),
				      strs, sizeof(strs));
	if (btf_fd >= 0) {
3282
		obj->caps.btf_datasec = 1;
3283 3284 3285 3286
		close(btf_fd);
		return 1;
	}

3287 3288 3289
	return 0;
}

3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310
static int bpf_object__probe_array_mmap(struct bpf_object *obj)
{
	struct bpf_create_map_attr attr = {
		.map_type = BPF_MAP_TYPE_ARRAY,
		.map_flags = BPF_F_MMAPABLE,
		.key_size = sizeof(int),
		.value_size = sizeof(int),
		.max_entries = 1,
	};
	int fd;

	fd = bpf_create_map_xattr(&attr);
	if (fd >= 0) {
		obj->caps.array_mmap = 1;
		close(fd);
		return 1;
	}

	return 0;
}

3311 3312 3313
static int
bpf_object__probe_caps(struct bpf_object *obj)
{
3314 3315 3316
	int (*probe_fn[])(struct bpf_object *obj) = {
		bpf_object__probe_name,
		bpf_object__probe_global_data,
3317
		bpf_object__probe_btf_func,
3318
		bpf_object__probe_btf_func_global,
3319
		bpf_object__probe_btf_datasec,
3320
		bpf_object__probe_array_mmap,
3321 3322 3323 3324 3325 3326
	};
	int i, ret;

	for (i = 0; i < ARRAY_SIZE(probe_fn); i++) {
		ret = probe_fn[i](obj);
		if (ret < 0)
3327
			pr_debug("Probe #%d failed with %d.\n", i, ret);
3328 3329 3330
	}

	return 0;
3331 3332
}

3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392
static bool map_is_reuse_compat(const struct bpf_map *map, int map_fd)
{
	struct bpf_map_info map_info = {};
	char msg[STRERR_BUFSIZE];
	__u32 map_info_len;

	map_info_len = sizeof(map_info);

	if (bpf_obj_get_info_by_fd(map_fd, &map_info, &map_info_len)) {
		pr_warn("failed to get map info for map FD %d: %s\n",
			map_fd, libbpf_strerror_r(errno, msg, sizeof(msg)));
		return false;
	}

	return (map_info.type == map->def.type &&
		map_info.key_size == map->def.key_size &&
		map_info.value_size == map->def.value_size &&
		map_info.max_entries == map->def.max_entries &&
		map_info.map_flags == map->def.map_flags);
}

static int
bpf_object__reuse_map(struct bpf_map *map)
{
	char *cp, errmsg[STRERR_BUFSIZE];
	int err, pin_fd;

	pin_fd = bpf_obj_get(map->pin_path);
	if (pin_fd < 0) {
		err = -errno;
		if (err == -ENOENT) {
			pr_debug("found no pinned map to reuse at '%s'\n",
				 map->pin_path);
			return 0;
		}

		cp = libbpf_strerror_r(-err, errmsg, sizeof(errmsg));
		pr_warn("couldn't retrieve pinned map '%s': %s\n",
			map->pin_path, cp);
		return err;
	}

	if (!map_is_reuse_compat(map, pin_fd)) {
		pr_warn("couldn't reuse pinned map at '%s': parameter mismatch\n",
			map->pin_path);
		close(pin_fd);
		return -EINVAL;
	}

	err = bpf_map__reuse_fd(map, pin_fd);
	if (err) {
		close(pin_fd);
		return err;
	}
	map->pinned = true;
	pr_debug("reused pinned map at '%s'\n", map->pin_path);

	return 0;
}

3393 3394 3395
static int
bpf_object__populate_internal_map(struct bpf_object *obj, struct bpf_map *map)
{
3396
	enum libbpf_map_type map_type = map->libbpf_type;
3397 3398 3399
	char *cp, errmsg[STRERR_BUFSIZE];
	int err, zero = 0;

3400 3401
	/* kernel already zero-initializes .bss map. */
	if (map_type == LIBBPF_MAP_BSS)
3402 3403
		return 0;

3404 3405 3406 3407 3408 3409 3410 3411
	err = bpf_map_update_elem(map->fd, &zero, map->mmaped, 0);
	if (err) {
		err = -errno;
		cp = libbpf_strerror_r(err, errmsg, sizeof(errmsg));
		pr_warn("Error setting initial map(%s) contents: %s\n",
			map->name, cp);
		return err;
	}
3412

3413 3414
	/* Freeze .rodata and .kconfig map as read-only from syscall side. */
	if (map_type == LIBBPF_MAP_RODATA || map_type == LIBBPF_MAP_KCONFIG) {
3415 3416
		err = bpf_map_freeze(map->fd);
		if (err) {
3417 3418
			err = -errno;
			cp = libbpf_strerror_r(err, errmsg, sizeof(errmsg));
3419 3420
			pr_warn("Error freezing map(%s) as read-only: %s\n",
				map->name, cp);
3421
			return err;
3422 3423
		}
	}
3424
	return 0;
3425 3426
}

3427 3428 3429
static int
bpf_object__create_maps(struct bpf_object *obj)
{
3430
	struct bpf_create_map_attr create_attr = {};
3431
	int nr_cpus = 0;
3432
	unsigned int i;
3433
	int err;
3434

3435
	for (i = 0; i < obj->nr_maps; i++) {
3436 3437
		struct bpf_map *map = &obj->maps[i];
		struct bpf_map_def *def = &map->def;
3438
		char *cp, errmsg[STRERR_BUFSIZE];
3439 3440
		int *pfd = &map->fd;

3441 3442 3443 3444 3445 3446 3447 3448 3449
		if (map->pin_path) {
			err = bpf_object__reuse_map(map);
			if (err) {
				pr_warn("error reusing pinned map %s\n",
					map->name);
				return err;
			}
		}

J
Jakub Kicinski 已提交
3450 3451 3452 3453 3454 3455
		if (map->fd >= 0) {
			pr_debug("skip map create (preset) %s: fd=%d\n",
				 map->name, map->fd);
			continue;
		}

3456 3457
		if (obj->caps.name)
			create_attr.name = map->name;
3458
		create_attr.map_ifindex = map->map_ifindex;
3459 3460 3461 3462
		create_attr.map_type = def->type;
		create_attr.map_flags = def->map_flags;
		create_attr.key_size = def->key_size;
		create_attr.value_size = def->value_size;
3463 3464 3465 3466 3467
		if (def->type == BPF_MAP_TYPE_PERF_EVENT_ARRAY &&
		    !def->max_entries) {
			if (!nr_cpus)
				nr_cpus = libbpf_num_possible_cpus();
			if (nr_cpus < 0) {
3468 3469
				pr_warn("failed to determine number of system CPUs: %d\n",
					nr_cpus);
3470 3471 3472 3473 3474 3475 3476 3477 3478
				err = nr_cpus;
				goto err_out;
			}
			pr_debug("map '%s': setting size to %d\n",
				 map->name, nr_cpus);
			create_attr.max_entries = nr_cpus;
		} else {
			create_attr.max_entries = def->max_entries;
		}
3479
		create_attr.btf_fd = 0;
3480 3481
		create_attr.btf_key_type_id = 0;
		create_attr.btf_value_type_id = 0;
3482 3483 3484
		if (bpf_map_type__is_map_in_map(def->type) &&
		    map->inner_map_fd >= 0)
			create_attr.inner_map_fd = map->inner_map_fd;
3485 3486 3487
		if (bpf_map__is_struct_ops(map))
			create_attr.btf_vmlinux_value_type_id =
				map->btf_vmlinux_value_type_id;
3488

3489
		if (obj->btf && !bpf_map_find_btf_info(obj, map)) {
3490
			create_attr.btf_fd = btf__fd(obj->btf);
3491 3492
			create_attr.btf_key_type_id = map->btf_key_type_id;
			create_attr.btf_value_type_id = map->btf_value_type_id;
3493 3494 3495
		}

		*pfd = bpf_create_map_xattr(&create_attr);
3496 3497
		if (*pfd < 0 && (create_attr.btf_key_type_id ||
				 create_attr.btf_value_type_id)) {
3498 3499
			err = -errno;
			cp = libbpf_strerror_r(err, errmsg, sizeof(errmsg));
3500 3501
			pr_warn("Error in bpf_create_map_xattr(%s):%s(%d). Retrying without BTF.\n",
				map->name, cp, err);
3502
			create_attr.btf_fd = 0;
3503 3504 3505 3506
			create_attr.btf_key_type_id = 0;
			create_attr.btf_value_type_id = 0;
			map->btf_key_type_id = 0;
			map->btf_value_type_id = 0;
3507 3508 3509
			*pfd = bpf_create_map_xattr(&create_attr);
		}

3510 3511 3512
		if (*pfd < 0) {
			size_t j;

3513
			err = -errno;
3514
err_out:
3515
			cp = libbpf_strerror_r(err, errmsg, sizeof(errmsg));
3516 3517
			pr_warn("failed to create map (name: '%s'): %s(%d)\n",
				map->name, cp, err);
3518
			pr_perm_msg(err);
3519
			for (j = 0; j < i; j++)
3520
				zclose(obj->maps[j].fd);
3521 3522
			return err;
		}
3523 3524 3525 3526 3527 3528 3529 3530 3531

		if (bpf_map__is_internal(map)) {
			err = bpf_object__populate_internal_map(obj, map);
			if (err < 0) {
				zclose(*pfd);
				goto err_out;
			}
		}

3532 3533 3534 3535 3536 3537 3538 3539 3540
		if (map->pin_path && !map->pinned) {
			err = bpf_map__pin(map, NULL);
			if (err) {
				pr_warn("failed to auto-pin map name '%s' at '%s'\n",
					map->name, map->pin_path);
				return err;
			}
		}

3541
		pr_debug("created map %s: fd=%d\n", map->name, *pfd);
3542 3543 3544 3545 3546
	}

	return 0;
}

3547 3548 3549 3550 3551
static int
check_btf_ext_reloc_err(struct bpf_program *prog, int err,
			void *btf_prog_info, const char *info_name)
{
	if (err != -ENOENT) {
3552 3553
		pr_warn("Error in loading %s for sec %s.\n",
			info_name, prog->section_name);
3554 3555 3556 3557 3558 3559 3560 3561
		return err;
	}

	/* err == -ENOENT (i.e. prog->section_name not found in btf_ext) */

	if (btf_prog_info) {
		/*
		 * Some info has already been found but has problem
3562
		 * in the last btf_ext reloc. Must have to error out.
3563
		 */
3564 3565
		pr_warn("Error in relocating %s for sec %s.\n",
			info_name, prog->section_name);
3566 3567 3568
		return err;
	}

3569
	/* Have problem loading the very first info. Ignore the rest. */
3570 3571
	pr_warn("Cannot find %s for main program sec %s. Ignore all %s.\n",
		info_name, prog->section_name, info_name);
3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599
	return 0;
}

static int
bpf_program_reloc_btf_ext(struct bpf_program *prog, struct bpf_object *obj,
			  const char *section_name,  __u32 insn_offset)
{
	int err;

	if (!insn_offset || prog->func_info) {
		/*
		 * !insn_offset => main program
		 *
		 * For sub prog, the main program's func_info has to
		 * be loaded first (i.e. prog->func_info != NULL)
		 */
		err = btf_ext__reloc_func_info(obj->btf, obj->btf_ext,
					       section_name, insn_offset,
					       &prog->func_info,
					       &prog->func_info_cnt);
		if (err)
			return check_btf_ext_reloc_err(prog, err,
						       prog->func_info,
						       "bpf_func_info");

		prog->func_info_rec_size = btf_ext__func_info_rec_size(obj->btf_ext);
	}

3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612
	if (!insn_offset || prog->line_info) {
		err = btf_ext__reloc_line_info(obj->btf, obj->btf_ext,
					       section_name, insn_offset,
					       &prog->line_info,
					       &prog->line_info_cnt);
		if (err)
			return check_btf_ext_reloc_err(prog, err,
						       prog->line_info,
						       "bpf_line_info");

		prog->line_info_rec_size = btf_ext__line_info_rec_size(obj->btf_ext);
	}

3613 3614 3615
	return 0;
}

3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634
#define BPF_CORE_SPEC_MAX_LEN 64

/* represents BPF CO-RE field or array element accessor */
struct bpf_core_accessor {
	__u32 type_id;		/* struct/union type or array element type */
	__u32 idx;		/* field index or array index */
	const char *name;	/* field name or NULL for array accessor */
};

struct bpf_core_spec {
	const struct btf *btf;
	/* high-level spec: named fields and array indices only */
	struct bpf_core_accessor spec[BPF_CORE_SPEC_MAX_LEN];
	/* high-level spec length */
	int len;
	/* raw, low-level spec: 1-to-1 with accessor spec string */
	int raw_spec[BPF_CORE_SPEC_MAX_LEN];
	/* raw spec length */
	int raw_len;
3635 3636
	/* field bit offset represented by spec */
	__u32 bit_offset;
3637 3638 3639 3640 3641 3642 3643
};

static bool str_is_empty(const char *s)
{
	return !s || !s[0];
}

3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658
static bool is_flex_arr(const struct btf *btf,
			const struct bpf_core_accessor *acc,
			const struct btf_array *arr)
{
	const struct btf_type *t;

	/* not a flexible array, if not inside a struct or has non-zero size */
	if (!acc->name || arr->nelems > 0)
		return false;

	/* has to be the last member of enclosing struct */
	t = btf__type_by_id(btf, acc->type_id);
	return acc->idx == btf_vlen(t) - 1;
}

3659
/*
3660
 * Turn bpf_field_reloc into a low- and high-level spec representation,
3661
 * validating correctness along the way, as well as calculating resulting
3662 3663
 * field bit offset, specified by accessor string. Low-level spec captures
 * every single level of nestedness, including traversing anonymous
3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695
 * struct/union members. High-level one only captures semantically meaningful
 * "turning points": named fields and array indicies.
 * E.g., for this case:
 *
 *   struct sample {
 *       int __unimportant;
 *       struct {
 *           int __1;
 *           int __2;
 *           int a[7];
 *       };
 *   };
 *
 *   struct sample *s = ...;
 *
 *   int x = &s->a[3]; // access string = '0:1:2:3'
 *
 * Low-level spec has 1:1 mapping with each element of access string (it's
 * just a parsed access string representation): [0, 1, 2, 3].
 *
 * High-level spec will capture only 3 points:
 *   - intial zero-index access by pointer (&s->... is the same as &s[0]...);
 *   - field 'a' access (corresponds to '2' in low-level spec);
 *   - array element #3 access (corresponds to '3' in low-level spec).
 *
 */
static int bpf_core_spec_parse(const struct btf *btf,
			       __u32 type_id,
			       const char *spec_str,
			       struct bpf_core_spec *spec)
{
	int access_idx, parsed_len, i;
3696
	struct bpf_core_accessor *acc;
3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735
	const struct btf_type *t;
	const char *name;
	__u32 id;
	__s64 sz;

	if (str_is_empty(spec_str) || *spec_str == ':')
		return -EINVAL;

	memset(spec, 0, sizeof(*spec));
	spec->btf = btf;

	/* parse spec_str="0:1:2:3:4" into array raw_spec=[0, 1, 2, 3, 4] */
	while (*spec_str) {
		if (*spec_str == ':')
			++spec_str;
		if (sscanf(spec_str, "%d%n", &access_idx, &parsed_len) != 1)
			return -EINVAL;
		if (spec->raw_len == BPF_CORE_SPEC_MAX_LEN)
			return -E2BIG;
		spec_str += parsed_len;
		spec->raw_spec[spec->raw_len++] = access_idx;
	}

	if (spec->raw_len == 0)
		return -EINVAL;

	/* first spec value is always reloc type array index */
	t = skip_mods_and_typedefs(btf, type_id, &id);
	if (!t)
		return -EINVAL;

	access_idx = spec->raw_spec[0];
	spec->spec[0].type_id = id;
	spec->spec[0].idx = access_idx;
	spec->len++;

	sz = btf__resolve_size(btf, id);
	if (sz < 0)
		return sz;
3736
	spec->bit_offset = access_idx * sz * 8;
3737 3738 3739 3740 3741 3742 3743

	for (i = 1; i < spec->raw_len; i++) {
		t = skip_mods_and_typedefs(btf, id, &id);
		if (!t)
			return -EINVAL;

		access_idx = spec->raw_spec[i];
3744
		acc = &spec->spec[spec->len];
3745 3746 3747

		if (btf_is_composite(t)) {
			const struct btf_member *m;
3748
			__u32 bit_offset;
3749 3750 3751 3752

			if (access_idx >= btf_vlen(t))
				return -EINVAL;

3753 3754
			bit_offset = btf_member_bit_offset(t, access_idx);
			spec->bit_offset += bit_offset;
3755 3756 3757 3758 3759 3760 3761

			m = btf_members(t) + access_idx;
			if (m->name_off) {
				name = btf__name_by_offset(btf, m->name_off);
				if (str_is_empty(name))
					return -EINVAL;

3762 3763 3764
				acc->type_id = id;
				acc->idx = access_idx;
				acc->name = name;
3765 3766 3767 3768 3769 3770
				spec->len++;
			}

			id = m->type;
		} else if (btf_is_array(t)) {
			const struct btf_array *a = btf_array(t);
3771
			bool flex;
3772 3773

			t = skip_mods_and_typedefs(btf, a->type, &id);
3774 3775 3776 3777 3778
			if (!t)
				return -EINVAL;

			flex = is_flex_arr(btf, acc - 1, a);
			if (!flex && access_idx >= a->nelems)
3779 3780 3781 3782 3783 3784 3785 3786 3787
				return -EINVAL;

			spec->spec[spec->len].type_id = id;
			spec->spec[spec->len].idx = access_idx;
			spec->len++;

			sz = btf__resolve_size(btf, id);
			if (sz < 0)
				return sz;
3788
			spec->bit_offset += access_idx * sz * 8;
3789
		} else {
3790 3791
			pr_warn("relo for [%u] %s (at idx %d) captures type [%d] of unexpected kind %d\n",
				type_id, spec_str, i, id, btf_kind(t));
3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888
			return -EINVAL;
		}
	}

	return 0;
}

static bool bpf_core_is_flavor_sep(const char *s)
{
	/* check X___Y name pattern, where X and Y are not underscores */
	return s[0] != '_' &&				      /* X */
	       s[1] == '_' && s[2] == '_' && s[3] == '_' &&   /* ___ */
	       s[4] != '_';				      /* Y */
}

/* Given 'some_struct_name___with_flavor' return the length of a name prefix
 * before last triple underscore. Struct name part after last triple
 * underscore is ignored by BPF CO-RE relocation during relocation matching.
 */
static size_t bpf_core_essential_name_len(const char *name)
{
	size_t n = strlen(name);
	int i;

	for (i = n - 5; i >= 0; i--) {
		if (bpf_core_is_flavor_sep(name + i))
			return i + 1;
	}
	return n;
}

/* dynamically sized list of type IDs */
struct ids_vec {
	__u32 *data;
	int len;
};

static void bpf_core_free_cands(struct ids_vec *cand_ids)
{
	free(cand_ids->data);
	free(cand_ids);
}

static struct ids_vec *bpf_core_find_cands(const struct btf *local_btf,
					   __u32 local_type_id,
					   const struct btf *targ_btf)
{
	size_t local_essent_len, targ_essent_len;
	const char *local_name, *targ_name;
	const struct btf_type *t;
	struct ids_vec *cand_ids;
	__u32 *new_ids;
	int i, err, n;

	t = btf__type_by_id(local_btf, local_type_id);
	if (!t)
		return ERR_PTR(-EINVAL);

	local_name = btf__name_by_offset(local_btf, t->name_off);
	if (str_is_empty(local_name))
		return ERR_PTR(-EINVAL);
	local_essent_len = bpf_core_essential_name_len(local_name);

	cand_ids = calloc(1, sizeof(*cand_ids));
	if (!cand_ids)
		return ERR_PTR(-ENOMEM);

	n = btf__get_nr_types(targ_btf);
	for (i = 1; i <= n; i++) {
		t = btf__type_by_id(targ_btf, i);
		targ_name = btf__name_by_offset(targ_btf, t->name_off);
		if (str_is_empty(targ_name))
			continue;

		targ_essent_len = bpf_core_essential_name_len(targ_name);
		if (targ_essent_len != local_essent_len)
			continue;

		if (strncmp(local_name, targ_name, local_essent_len) == 0) {
			pr_debug("[%d] %s: found candidate [%d] %s\n",
				 local_type_id, local_name, i, targ_name);
			new_ids = realloc(cand_ids->data, cand_ids->len + 1);
			if (!new_ids) {
				err = -ENOMEM;
				goto err_out;
			}
			cand_ids->data = new_ids;
			cand_ids->data[cand_ids->len++] = i;
		}
	}
	return cand_ids;
err_out:
	bpf_core_free_cands(cand_ids);
	return ERR_PTR(err);
}

/* Check two types for compatibility, skipping const/volatile/restrict and
3889
 * typedefs, to ensure we are relocating compatible entities:
3890
 *   - any two STRUCTs/UNIONs are compatible and can be mixed;
3891
 *   - any two FWDs are compatible, if their names match (modulo flavor suffix);
3892
 *   - any two PTRs are always compatible;
3893 3894
 *   - for ENUMs, names should be the same (ignoring flavor suffix) or at
 *     least one of enums should be anonymous;
3895
 *   - for ENUMs, check sizes, names are ignored;
3896
 *   - for INT, size and signedness are ignored;
3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923
 *   - for ARRAY, dimensionality is ignored, element types are checked for
 *     compatibility recursively;
 *   - everything else shouldn't be ever a target of relocation.
 * These rules are not set in stone and probably will be adjusted as we get
 * more experience with using BPF CO-RE relocations.
 */
static int bpf_core_fields_are_compat(const struct btf *local_btf,
				      __u32 local_id,
				      const struct btf *targ_btf,
				      __u32 targ_id)
{
	const struct btf_type *local_type, *targ_type;

recur:
	local_type = skip_mods_and_typedefs(local_btf, local_id, &local_id);
	targ_type = skip_mods_and_typedefs(targ_btf, targ_id, &targ_id);
	if (!local_type || !targ_type)
		return -EINVAL;

	if (btf_is_composite(local_type) && btf_is_composite(targ_type))
		return 1;
	if (btf_kind(local_type) != btf_kind(targ_type))
		return 0;

	switch (btf_kind(local_type)) {
	case BTF_KIND_PTR:
		return 1;
3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938
	case BTF_KIND_FWD:
	case BTF_KIND_ENUM: {
		const char *local_name, *targ_name;
		size_t local_len, targ_len;

		local_name = btf__name_by_offset(local_btf,
						 local_type->name_off);
		targ_name = btf__name_by_offset(targ_btf, targ_type->name_off);
		local_len = bpf_core_essential_name_len(local_name);
		targ_len = bpf_core_essential_name_len(targ_name);
		/* one of them is anonymous or both w/ same flavor-less names */
		return local_len == 0 || targ_len == 0 ||
		       (local_len == targ_len &&
			strncmp(local_name, targ_name, local_len) == 0);
	}
3939
	case BTF_KIND_INT:
3940 3941 3942
		/* just reject deprecated bitfield-like integers; all other
		 * integers are by default compatible between each other
		 */
3943
		return btf_int_offset(local_type) == 0 &&
3944
		       btf_int_offset(targ_type) == 0;
3945 3946 3947 3948 3949
	case BTF_KIND_ARRAY:
		local_id = btf_array(local_type)->type;
		targ_id = btf_array(targ_type)->type;
		goto recur;
	default:
3950 3951
		pr_warn("unexpected kind %d relocated, local [%d], target [%d]\n",
			btf_kind(local_type), local_id, targ_id);
3952 3953 3954 3955 3956 3957 3958 3959
		return 0;
	}
}

/*
 * Given single high-level named field accessor in local type, find
 * corresponding high-level accessor for a target type. Along the way,
 * maintain low-level spec for target as well. Also keep updating target
3960
 * bit offset.
3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998
 *
 * Searching is performed through recursive exhaustive enumeration of all
 * fields of a struct/union. If there are any anonymous (embedded)
 * structs/unions, they are recursively searched as well. If field with
 * desired name is found, check compatibility between local and target types,
 * before returning result.
 *
 * 1 is returned, if field is found.
 * 0 is returned if no compatible field is found.
 * <0 is returned on error.
 */
static int bpf_core_match_member(const struct btf *local_btf,
				 const struct bpf_core_accessor *local_acc,
				 const struct btf *targ_btf,
				 __u32 targ_id,
				 struct bpf_core_spec *spec,
				 __u32 *next_targ_id)
{
	const struct btf_type *local_type, *targ_type;
	const struct btf_member *local_member, *m;
	const char *local_name, *targ_name;
	__u32 local_id;
	int i, n, found;

	targ_type = skip_mods_and_typedefs(targ_btf, targ_id, &targ_id);
	if (!targ_type)
		return -EINVAL;
	if (!btf_is_composite(targ_type))
		return 0;

	local_id = local_acc->type_id;
	local_type = btf__type_by_id(local_btf, local_id);
	local_member = btf_members(local_type) + local_acc->idx;
	local_name = btf__name_by_offset(local_btf, local_member->name_off);

	n = btf_vlen(targ_type);
	m = btf_members(targ_type);
	for (i = 0; i < n; i++, m++) {
3999
		__u32 bit_offset;
4000

4001
		bit_offset = btf_member_bit_offset(targ_type, i);
4002 4003 4004 4005 4006 4007

		/* too deep struct/union/array nesting */
		if (spec->raw_len == BPF_CORE_SPEC_MAX_LEN)
			return -E2BIG;

		/* speculate this member will be the good one */
4008
		spec->bit_offset += bit_offset;
4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036
		spec->raw_spec[spec->raw_len++] = i;

		targ_name = btf__name_by_offset(targ_btf, m->name_off);
		if (str_is_empty(targ_name)) {
			/* embedded struct/union, we need to go deeper */
			found = bpf_core_match_member(local_btf, local_acc,
						      targ_btf, m->type,
						      spec, next_targ_id);
			if (found) /* either found or error */
				return found;
		} else if (strcmp(local_name, targ_name) == 0) {
			/* matching named field */
			struct bpf_core_accessor *targ_acc;

			targ_acc = &spec->spec[spec->len++];
			targ_acc->type_id = targ_id;
			targ_acc->idx = i;
			targ_acc->name = targ_name;

			*next_targ_id = m->type;
			found = bpf_core_fields_are_compat(local_btf,
							   local_member->type,
							   targ_btf, m->type);
			if (!found)
				spec->len--; /* pop accessor */
			return found;
		}
		/* member turned out not to be what we looked for */
4037
		spec->bit_offset -= bit_offset;
4038 4039 4040 4041 4042 4043 4044 4045
		spec->raw_len--;
	}

	return 0;
}

/*
 * Try to match local spec to a target type and, if successful, produce full
4046
 * target spec (high-level, low-level + bit offset).
4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082
 */
static int bpf_core_spec_match(struct bpf_core_spec *local_spec,
			       const struct btf *targ_btf, __u32 targ_id,
			       struct bpf_core_spec *targ_spec)
{
	const struct btf_type *targ_type;
	const struct bpf_core_accessor *local_acc;
	struct bpf_core_accessor *targ_acc;
	int i, sz, matched;

	memset(targ_spec, 0, sizeof(*targ_spec));
	targ_spec->btf = targ_btf;

	local_acc = &local_spec->spec[0];
	targ_acc = &targ_spec->spec[0];

	for (i = 0; i < local_spec->len; i++, local_acc++, targ_acc++) {
		targ_type = skip_mods_and_typedefs(targ_spec->btf, targ_id,
						   &targ_id);
		if (!targ_type)
			return -EINVAL;

		if (local_acc->name) {
			matched = bpf_core_match_member(local_spec->btf,
							local_acc,
							targ_btf, targ_id,
							targ_spec, &targ_id);
			if (matched <= 0)
				return matched;
		} else {
			/* for i=0, targ_id is already treated as array element
			 * type (because it's the original struct), for others
			 * we should find array element type first
			 */
			if (i > 0) {
				const struct btf_array *a;
4083
				bool flex;
4084 4085 4086 4087 4088

				if (!btf_is_array(targ_type))
					return 0;

				a = btf_array(targ_type);
4089 4090
				flex = is_flex_arr(targ_btf, targ_acc - 1, a);
				if (!flex && local_acc->idx >= a->nelems)
4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110
					return 0;
				if (!skip_mods_and_typedefs(targ_btf, a->type,
							    &targ_id))
					return -EINVAL;
			}

			/* too deep struct/union/array nesting */
			if (targ_spec->raw_len == BPF_CORE_SPEC_MAX_LEN)
				return -E2BIG;

			targ_acc->type_id = targ_id;
			targ_acc->idx = local_acc->idx;
			targ_acc->name = NULL;
			targ_spec->len++;
			targ_spec->raw_spec[targ_spec->raw_len] = targ_acc->idx;
			targ_spec->raw_len++;

			sz = btf__resolve_size(targ_btf, targ_id);
			if (sz < 0)
				return sz;
4111
			targ_spec->bit_offset += local_acc->idx * sz * 8;
4112 4113 4114 4115 4116 4117
		}
	}

	return 1;
}

4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128
static int bpf_core_calc_field_relo(const struct bpf_program *prog,
				    const struct bpf_field_reloc *relo,
				    const struct bpf_core_spec *spec,
				    __u32 *val, bool *validate)
{
	const struct bpf_core_accessor *acc = &spec->spec[spec->len - 1];
	const struct btf_type *t = btf__type_by_id(spec->btf, acc->type_id);
	__u32 byte_off, byte_sz, bit_off, bit_sz;
	const struct btf_member *m;
	const struct btf_type *mt;
	bool bitfield;
4129
	__s64 sz;
4130 4131 4132

	/* a[n] accessor needs special handling */
	if (!acc->name) {
4133 4134 4135 4136 4137 4138 4139 4140 4141
		if (relo->kind == BPF_FIELD_BYTE_OFFSET) {
			*val = spec->bit_offset / 8;
		} else if (relo->kind == BPF_FIELD_BYTE_SIZE) {
			sz = btf__resolve_size(spec->btf, acc->type_id);
			if (sz < 0)
				return -EINVAL;
			*val = sz;
		} else {
			pr_warn("prog '%s': relo %d at insn #%d can't be applied to array access\n",
4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172
				bpf_program__title(prog, false),
				relo->kind, relo->insn_off / 8);
			return -EINVAL;
		}
		if (validate)
			*validate = true;
		return 0;
	}

	m = btf_members(t) + acc->idx;
	mt = skip_mods_and_typedefs(spec->btf, m->type, NULL);
	bit_off = spec->bit_offset;
	bit_sz = btf_member_bitfield_size(t, acc->idx);

	bitfield = bit_sz > 0;
	if (bitfield) {
		byte_sz = mt->size;
		byte_off = bit_off / 8 / byte_sz * byte_sz;
		/* figure out smallest int size necessary for bitfield load */
		while (bit_off + bit_sz - byte_off * 8 > byte_sz * 8) {
			if (byte_sz >= 8) {
				/* bitfield can't be read with 64-bit read */
				pr_warn("prog '%s': relo %d at insn #%d can't be satisfied for bitfield\n",
					bpf_program__title(prog, false),
					relo->kind, relo->insn_off / 8);
				return -E2BIG;
			}
			byte_sz *= 2;
			byte_off = bit_off / 8 / byte_sz * byte_sz;
		}
	} else {
4173 4174 4175 4176
		sz = btf__resolve_size(spec->btf, m->type);
		if (sz < 0)
			return -EINVAL;
		byte_sz = sz;
4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224
		byte_off = spec->bit_offset / 8;
		bit_sz = byte_sz * 8;
	}

	/* for bitfields, all the relocatable aspects are ambiguous and we
	 * might disagree with compiler, so turn off validation of expected
	 * value, except for signedness
	 */
	if (validate)
		*validate = !bitfield;

	switch (relo->kind) {
	case BPF_FIELD_BYTE_OFFSET:
		*val = byte_off;
		break;
	case BPF_FIELD_BYTE_SIZE:
		*val = byte_sz;
		break;
	case BPF_FIELD_SIGNED:
		/* enums will be assumed unsigned */
		*val = btf_is_enum(mt) ||
		       (btf_int_encoding(mt) & BTF_INT_SIGNED);
		if (validate)
			*validate = true; /* signedness is never ambiguous */
		break;
	case BPF_FIELD_LSHIFT_U64:
#if __BYTE_ORDER == __LITTLE_ENDIAN
		*val = 64 - (bit_off + bit_sz - byte_off  * 8);
#else
		*val = (8 - byte_sz) * 8 + (bit_off - byte_off * 8);
#endif
		break;
	case BPF_FIELD_RSHIFT_U64:
		*val = 64 - bit_sz;
		if (validate)
			*validate = true; /* right shift is never ambiguous */
		break;
	case BPF_FIELD_EXISTS:
	default:
		pr_warn("prog '%s': unknown relo %d at insn #%d\n",
			bpf_program__title(prog, false),
			relo->kind, relo->insn_off / 8);
		return -EINVAL;
	}

	return 0;
}

4225 4226
/*
 * Patch relocatable BPF instruction.
4227 4228 4229 4230 4231 4232 4233
 *
 * Patched value is determined by relocation kind and target specification.
 * For field existence relocation target spec will be NULL if field is not
 * found.
 * Expected insn->imm value is determined using relocation kind and local
 * spec, and is checked before patching instruction. If actual insn->imm value
 * is wrong, bail out with error.
4234 4235 4236 4237 4238
 *
 * Currently three kinds of BPF instructions are supported:
 * 1. rX = <imm> (assignment with immediate operand);
 * 2. rX += <imm> (arithmetic operations with immediate operand);
 */
4239 4240 4241 4242
static int bpf_core_reloc_insn(struct bpf_program *prog,
			       const struct bpf_field_reloc *relo,
			       const struct bpf_core_spec *local_spec,
			       const struct bpf_core_spec *targ_spec)
4243
{
4244
	bool failed = false, validate = true;
4245
	__u32 orig_val, new_val;
4246
	struct bpf_insn *insn;
4247
	int insn_idx, err;
4248 4249
	__u8 class;

4250 4251 4252 4253
	if (relo->insn_off % sizeof(struct bpf_insn))
		return -EINVAL;
	insn_idx = relo->insn_off / sizeof(struct bpf_insn);

4254
	if (relo->kind == BPF_FIELD_EXISTS) {
4255 4256
		orig_val = 1; /* can't generate EXISTS relo w/o local field */
		new_val = targ_spec ? 1 : 0;
4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268
	} else if (!targ_spec) {
		failed = true;
		new_val = (__u32)-1;
	} else {
		err = bpf_core_calc_field_relo(prog, relo, local_spec,
					       &orig_val, &validate);
		if (err)
			return err;
		err = bpf_core_calc_field_relo(prog, relo, targ_spec,
					       &new_val, NULL);
		if (err)
			return err;
4269
	}
4270 4271 4272 4273

	insn = &prog->insns[insn_idx];
	class = BPF_CLASS(insn->code);

4274 4275 4276
	switch (class) {
	case BPF_ALU:
	case BPF_ALU64:
4277 4278
		if (BPF_SRC(insn->code) != BPF_K)
			return -EINVAL;
4279
		if (!failed && validate && insn->imm != orig_val) {
4280
			pr_warn("prog '%s': unexpected insn #%d (ALU/ALU64) value: got %u, exp %u -> %u\n",
4281 4282
				bpf_program__title(prog, false), insn_idx,
				insn->imm, orig_val, new_val);
4283
			return -EINVAL;
4284 4285
		}
		orig_val = insn->imm;
4286
		insn->imm = new_val;
4287 4288 4289
		pr_debug("prog '%s': patched insn #%d (ALU/ALU64)%s imm %u -> %u\n",
			 bpf_program__title(prog, false), insn_idx,
			 failed ? " w/ failed reloc" : "", orig_val, new_val);
4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312
		break;
	case BPF_LDX:
	case BPF_ST:
	case BPF_STX:
		if (!failed && validate && insn->off != orig_val) {
			pr_warn("prog '%s': unexpected insn #%d (LD/LDX/ST/STX) value: got %u, exp %u -> %u\n",
				bpf_program__title(prog, false), insn_idx,
				insn->off, orig_val, new_val);
			return -EINVAL;
		}
		if (new_val > SHRT_MAX) {
			pr_warn("prog '%s': insn #%d (LD/LDX/ST/STX) value too big: %u\n",
				bpf_program__title(prog, false), insn_idx,
				new_val);
			return -ERANGE;
		}
		orig_val = insn->off;
		insn->off = new_val;
		pr_debug("prog '%s': patched insn #%d (LD/LDX/ST/STX)%s off %u -> %u\n",
			 bpf_program__title(prog, false), insn_idx,
			 failed ? " w/ failed reloc" : "", orig_val, new_val);
		break;
	default:
4313 4314 4315 4316
		pr_warn("prog '%s': trying to relocate unrecognized insn #%d, code:%x, src:%x, dst:%x, off:%x, imm:%x\n",
			bpf_program__title(prog, false),
			insn_idx, insn->code, insn->src_reg, insn->dst_reg,
			insn->off, insn->imm);
4317 4318
		return -EINVAL;
	}
4319

4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342
	return 0;
}

/* Output spec definition in the format:
 * [<type-id>] (<type-name>) + <raw-spec> => <offset>@<spec>,
 * where <spec> is a C-syntax view of recorded field access, e.g.: x.a[3].b
 */
static void bpf_core_dump_spec(int level, const struct bpf_core_spec *spec)
{
	const struct btf_type *t;
	const char *s;
	__u32 type_id;
	int i;

	type_id = spec->spec[0].type_id;
	t = btf__type_by_id(spec->btf, type_id);
	s = btf__name_by_offset(spec->btf, t->name_off);
	libbpf_print(level, "[%u] %s + ", type_id, s);

	for (i = 0; i < spec->raw_len; i++)
		libbpf_print(level, "%d%s", spec->raw_spec[i],
			     i == spec->raw_len - 1 ? " => " : ":");

4343 4344
	libbpf_print(level, "%u.%u @ &x",
		     spec->bit_offset / 8, spec->bit_offset % 8);
4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400

	for (i = 0; i < spec->len; i++) {
		if (spec->spec[i].name)
			libbpf_print(level, ".%s", spec->spec[i].name);
		else
			libbpf_print(level, "[%u]", spec->spec[i].idx);
	}

}

static size_t bpf_core_hash_fn(const void *key, void *ctx)
{
	return (size_t)key;
}

static bool bpf_core_equal_fn(const void *k1, const void *k2, void *ctx)
{
	return k1 == k2;
}

static void *u32_as_hash_key(__u32 x)
{
	return (void *)(uintptr_t)x;
}

/*
 * CO-RE relocate single instruction.
 *
 * The outline and important points of the algorithm:
 * 1. For given local type, find corresponding candidate target types.
 *    Candidate type is a type with the same "essential" name, ignoring
 *    everything after last triple underscore (___). E.g., `sample`,
 *    `sample___flavor_one`, `sample___flavor_another_one`, are all candidates
 *    for each other. Names with triple underscore are referred to as
 *    "flavors" and are useful, among other things, to allow to
 *    specify/support incompatible variations of the same kernel struct, which
 *    might differ between different kernel versions and/or build
 *    configurations.
 *
 *    N.B. Struct "flavors" could be generated by bpftool's BTF-to-C
 *    converter, when deduplicated BTF of a kernel still contains more than
 *    one different types with the same name. In that case, ___2, ___3, etc
 *    are appended starting from second name conflict. But start flavors are
 *    also useful to be defined "locally", in BPF program, to extract same
 *    data from incompatible changes between different kernel
 *    versions/configurations. For instance, to handle field renames between
 *    kernel versions, one can use two flavors of the struct name with the
 *    same common name and use conditional relocations to extract that field,
 *    depending on target kernel version.
 * 2. For each candidate type, try to match local specification to this
 *    candidate target type. Matching involves finding corresponding
 *    high-level spec accessors, meaning that all named fields should match,
 *    as well as all array accesses should be within the actual bounds. Also,
 *    types should be compatible (see bpf_core_fields_are_compat for details).
 * 3. It is supported and expected that there might be multiple flavors
 *    matching the spec. As long as all the specs resolve to the same set of
4401
 *    offsets across all candidates, there is no error. If there is any
4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415
 *    ambiguity, CO-RE relocation will fail. This is necessary to accomodate
 *    imprefection of BTF deduplication, which can cause slight duplication of
 *    the same BTF type, if some directly or indirectly referenced (by
 *    pointer) type gets resolved to different actual types in different
 *    object files. If such situation occurs, deduplicated BTF will end up
 *    with two (or more) structurally identical types, which differ only in
 *    types they refer to through pointer. This should be OK in most cases and
 *    is not an error.
 * 4. Candidate types search is performed by linearly scanning through all
 *    types in target BTF. It is anticipated that this is overall more
 *    efficient memory-wise and not significantly worse (if not better)
 *    CPU-wise compared to prebuilding a map from all local type names to
 *    a list of candidate type names. It's also sped up by caching resolved
 *    list of matching candidates per each local "root" type ID, that has at
4416
 *    least one bpf_field_reloc associated with it. This list is shared
4417 4418 4419
 *    between multiple relocations for the same type ID and is updated as some
 *    of the candidates are pruned due to structural incompatibility.
 */
4420 4421
static int bpf_core_reloc_field(struct bpf_program *prog,
				 const struct bpf_field_reloc *relo,
4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451
				 int relo_idx,
				 const struct btf *local_btf,
				 const struct btf *targ_btf,
				 struct hashmap *cand_cache)
{
	const char *prog_name = bpf_program__title(prog, false);
	struct bpf_core_spec local_spec, cand_spec, targ_spec;
	const void *type_key = u32_as_hash_key(relo->type_id);
	const struct btf_type *local_type, *cand_type;
	const char *local_name, *cand_name;
	struct ids_vec *cand_ids;
	__u32 local_id, cand_id;
	const char *spec_str;
	int i, j, err;

	local_id = relo->type_id;
	local_type = btf__type_by_id(local_btf, local_id);
	if (!local_type)
		return -EINVAL;

	local_name = btf__name_by_offset(local_btf, local_type->name_off);
	if (str_is_empty(local_name))
		return -EINVAL;

	spec_str = btf__name_by_offset(local_btf, relo->access_str_off);
	if (str_is_empty(spec_str))
		return -EINVAL;

	err = bpf_core_spec_parse(local_btf, local_id, spec_str, &local_spec);
	if (err) {
4452 4453 4454
		pr_warn("prog '%s': relo #%d: parsing [%d] %s + %s failed: %d\n",
			prog_name, relo_idx, local_id, local_name, spec_str,
			err);
4455 4456 4457
		return -EINVAL;
	}

4458 4459
	pr_debug("prog '%s': relo #%d: kind %d, spec is ", prog_name, relo_idx,
		 relo->kind);
4460 4461 4462 4463 4464 4465
	bpf_core_dump_spec(LIBBPF_DEBUG, &local_spec);
	libbpf_print(LIBBPF_DEBUG, "\n");

	if (!hashmap__find(cand_cache, type_key, (void **)&cand_ids)) {
		cand_ids = bpf_core_find_cands(local_btf, local_id, targ_btf);
		if (IS_ERR(cand_ids)) {
4466 4467 4468
			pr_warn("prog '%s': relo #%d: target candidate search failed for [%d] %s: %ld",
				prog_name, relo_idx, local_id, local_name,
				PTR_ERR(cand_ids));
4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489
			return PTR_ERR(cand_ids);
		}
		err = hashmap__set(cand_cache, type_key, cand_ids, NULL, NULL);
		if (err) {
			bpf_core_free_cands(cand_ids);
			return err;
		}
	}

	for (i = 0, j = 0; i < cand_ids->len; i++) {
		cand_id = cand_ids->data[i];
		cand_type = btf__type_by_id(targ_btf, cand_id);
		cand_name = btf__name_by_offset(targ_btf, cand_type->name_off);

		err = bpf_core_spec_match(&local_spec, targ_btf,
					  cand_id, &cand_spec);
		pr_debug("prog '%s': relo #%d: matching candidate #%d %s against spec ",
			 prog_name, relo_idx, i, cand_name);
		bpf_core_dump_spec(LIBBPF_DEBUG, &cand_spec);
		libbpf_print(LIBBPF_DEBUG, ": %d\n", err);
		if (err < 0) {
4490 4491
			pr_warn("prog '%s': relo #%d: matching error: %d\n",
				prog_name, relo_idx, err);
4492 4493 4494 4495 4496 4497 4498
			return err;
		}
		if (err == 0)
			continue;

		if (j == 0) {
			targ_spec = cand_spec;
4499
		} else if (cand_spec.bit_offset != targ_spec.bit_offset) {
4500
			/* if there are many candidates, they should all
4501
			 * resolve to the same bit offset
4502
			 */
4503
			pr_warn("prog '%s': relo #%d: offset ambiguity: %u != %u\n",
4504 4505
				prog_name, relo_idx, cand_spec.bit_offset,
				targ_spec.bit_offset);
4506 4507 4508 4509 4510 4511
			return -EINVAL;
		}

		cand_ids->data[j++] = cand_spec.spec[0].type_id;
	}

4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523
	/*
	 * For BPF_FIELD_EXISTS relo or when relaxed CO-RE reloc mode is
	 * requested, it's expected that we might not find any candidates.
	 * In this case, if field wasn't found in any candidate, the list of
	 * candidates shouldn't change at all, we'll just handle relocating
	 * appropriately, depending on relo's kind.
	 */
	if (j > 0)
		cand_ids->len = j;

	if (j == 0 && !prog->obj->relaxed_core_relocs &&
	    relo->kind != BPF_FIELD_EXISTS) {
4524 4525
		pr_warn("prog '%s': relo #%d: no matching targets found for [%d] %s + %s\n",
			prog_name, relo_idx, local_id, local_name, spec_str);
4526 4527 4528
		return -ESRCH;
	}

4529 4530 4531
	/* bpf_core_reloc_insn should know how to handle missing targ_spec */
	err = bpf_core_reloc_insn(prog, relo, &local_spec,
				  j ? &targ_spec : NULL);
4532
	if (err) {
4533 4534
		pr_warn("prog '%s': relo #%d: failed to patch insn at offset %d: %d\n",
			prog_name, relo_idx, relo->insn_off, err);
4535 4536 4537 4538 4539 4540 4541
		return -EINVAL;
	}

	return 0;
}

static int
4542
bpf_core_reloc_fields(struct bpf_object *obj, const char *targ_btf_path)
4543 4544
{
	const struct btf_ext_info_sec *sec;
4545
	const struct bpf_field_reloc *rec;
4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556
	const struct btf_ext_info *seg;
	struct hashmap_entry *entry;
	struct hashmap *cand_cache = NULL;
	struct bpf_program *prog;
	struct btf *targ_btf;
	const char *sec_name;
	int i, err = 0;

	if (targ_btf_path)
		targ_btf = btf__parse_elf(targ_btf_path, NULL);
	else
4557
		targ_btf = libbpf_find_kernel_btf();
4558
	if (IS_ERR(targ_btf)) {
4559
		pr_warn("failed to get target BTF: %ld\n", PTR_ERR(targ_btf));
4560 4561 4562 4563 4564 4565 4566 4567 4568
		return PTR_ERR(targ_btf);
	}

	cand_cache = hashmap__new(bpf_core_hash_fn, bpf_core_equal_fn, NULL);
	if (IS_ERR(cand_cache)) {
		err = PTR_ERR(cand_cache);
		goto out;
	}

4569
	seg = &obj->btf_ext->field_reloc_info;
4570 4571 4572 4573 4574 4575 4576 4577
	for_each_btf_ext_sec(seg, sec) {
		sec_name = btf__name_by_offset(obj->btf, sec->sec_name_off);
		if (str_is_empty(sec_name)) {
			err = -EINVAL;
			goto out;
		}
		prog = bpf_object__find_program_by_title(obj, sec_name);
		if (!prog) {
4578 4579
			pr_warn("failed to find program '%s' for CO-RE offset relocation\n",
				sec_name);
4580 4581 4582 4583 4584 4585 4586 4587
			err = -EINVAL;
			goto out;
		}

		pr_debug("prog '%s': performing %d CO-RE offset relocs\n",
			 sec_name, sec->num_info);

		for_each_btf_ext_rec(seg, sec, i, rec) {
4588 4589
			err = bpf_core_reloc_field(prog, rec, i, obj->btf,
						   targ_btf, cand_cache);
4590
			if (err) {
4591 4592
				pr_warn("prog '%s': relo #%d: failed to relocate: %d\n",
					sec_name, i, err);
4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613
				goto out;
			}
		}
	}

out:
	btf__free(targ_btf);
	if (!IS_ERR_OR_NULL(cand_cache)) {
		hashmap__for_each_entry(cand_cache, entry, i) {
			bpf_core_free_cands(entry->value);
		}
		hashmap__free(cand_cache);
	}
	return err;
}

static int
bpf_object__relocate_core(struct bpf_object *obj, const char *targ_btf_path)
{
	int err = 0;

4614 4615
	if (obj->btf_ext->field_reloc_info.len)
		err = bpf_core_reloc_fields(obj, targ_btf_path);
4616 4617 4618 4619

	return err;
}

4620 4621 4622 4623 4624 4625 4626
static int
bpf_program__reloc_text(struct bpf_program *prog, struct bpf_object *obj,
			struct reloc_desc *relo)
{
	struct bpf_insn *insn, *new_insn;
	struct bpf_program *text;
	size_t new_cnt;
4627
	int err;
4628

4629
	if (prog->idx != obj->efile.text_shndx && prog->main_prog_cnt == 0) {
4630 4631
		text = bpf_object__find_prog_by_idx(obj, obj->efile.text_shndx);
		if (!text) {
4632
			pr_warn("no .text section found yet relo into text exist\n");
4633 4634 4635
			return -LIBBPF_ERRNO__RELOC;
		}
		new_cnt = prog->insns_cnt + text->insns_cnt;
4636
		new_insn = reallocarray(prog->insns, new_cnt, sizeof(*insn));
4637
		if (!new_insn) {
4638
			pr_warn("oom in prog realloc\n");
4639 4640
			return -ENOMEM;
		}
4641
		prog->insns = new_insn;
4642

4643 4644 4645 4646 4647
		if (obj->btf_ext) {
			err = bpf_program_reloc_btf_ext(prog, obj,
							text->section_name,
							prog->insns_cnt);
			if (err)
4648 4649 4650
				return err;
		}

4651 4652 4653 4654
		memcpy(new_insn + prog->insns_cnt, text->insns,
		       text->insns_cnt * sizeof(*insn));
		prog->main_prog_cnt = prog->insns_cnt;
		prog->insns_cnt = new_cnt;
4655 4656 4657
		pr_debug("added %zd insn from %s to prog %s\n",
			 text->insns_cnt, text->section_name,
			 prog->section_name);
4658
	}
4659

4660
	insn = &prog->insns[relo->insn_idx];
4661
	insn->imm += relo->sym_off / 8 + prog->main_prog_cnt - relo->insn_idx;
4662 4663 4664
	return 0;
}

W
Wang Nan 已提交
4665
static int
4666
bpf_program__relocate(struct bpf_program *prog, struct bpf_object *obj)
W
Wang Nan 已提交
4667
{
4668
	int i, err;
W
Wang Nan 已提交
4669

4670 4671 4672
	if (!prog)
		return 0;

4673 4674 4675 4676
	if (obj->btf_ext) {
		err = bpf_program_reloc_btf_ext(prog, obj,
						prog->section_name, 0);
		if (err)
4677 4678 4679 4680
			return err;
	}

	if (!prog->reloc_desc)
W
Wang Nan 已提交
4681 4682 4683
		return 0;

	for (i = 0; i < prog->nr_reloc; i++) {
4684
		struct reloc_desc *relo = &prog->reloc_desc[i];
4685
		struct bpf_insn *insn = &prog->insns[relo->insn_idx];
W
Wang Nan 已提交
4686

4687 4688 4689 4690 4691
		if (relo->insn_idx + 1 >= (int)prog->insns_cnt) {
			pr_warn("relocation out of range: '%s'\n",
				prog->section_name);
			return -LIBBPF_ERRNO__RELOC;
		}
4692

4693 4694 4695 4696 4697 4698 4699 4700
		switch (relo->type) {
		case RELO_LD64:
			insn[0].src_reg = BPF_PSEUDO_MAP_FD;
			insn[0].imm = obj->maps[relo->map_idx].fd;
			break;
		case RELO_DATA:
			insn[0].src_reg = BPF_PSEUDO_MAP_VALUE;
			insn[1].imm = insn[0].imm + relo->sym_off;
4701
			insn[0].imm = obj->maps[relo->map_idx].fd;
4702 4703 4704
			break;
		case RELO_EXTERN:
			insn[0].src_reg = BPF_PSEUDO_MAP_VALUE;
4705
			insn[0].imm = obj->maps[obj->kconfig_map_idx].fd;
4706 4707 4708
			insn[1].imm = relo->sym_off;
			break;
		case RELO_CALL:
4709
			err = bpf_program__reloc_text(prog, obj, relo);
4710 4711
			if (err)
				return err;
4712 4713 4714 4715
			break;
		default:
			pr_warn("relo #%d: bad relo type %d\n", i, relo->type);
			return -EINVAL;
W
Wang Nan 已提交
4716 4717 4718 4719 4720 4721 4722 4723 4724
		}
	}

	zfree(&prog->reloc_desc);
	prog->nr_reloc = 0;
	return 0;
}

static int
4725
bpf_object__relocate(struct bpf_object *obj, const char *targ_btf_path)
W
Wang Nan 已提交
4726 4727 4728 4729 4730
{
	struct bpf_program *prog;
	size_t i;
	int err;

4731 4732 4733
	if (obj->btf_ext) {
		err = bpf_object__relocate_core(obj, targ_btf_path);
		if (err) {
4734 4735
			pr_warn("failed to perform CO-RE relocations: %d\n",
				err);
4736 4737 4738
			return err;
		}
	}
4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756
	/* ensure .text is relocated first, as it's going to be copied as-is
	 * later for sub-program calls
	 */
	for (i = 0; i < obj->nr_programs; i++) {
		prog = &obj->programs[i];
		if (prog->idx != obj->efile.text_shndx)
			continue;

		err = bpf_program__relocate(prog, obj);
		if (err) {
			pr_warn("failed to relocate '%s'\n", prog->section_name);
			return err;
		}
		break;
	}
	/* now relocate everything but .text, which by now is relocated
	 * properly, so we can copy raw sub-program instructions as is safely
	 */
W
Wang Nan 已提交
4757 4758
	for (i = 0; i < obj->nr_programs; i++) {
		prog = &obj->programs[i];
4759 4760
		if (prog->idx == obj->efile.text_shndx)
			continue;
W
Wang Nan 已提交
4761

4762
		err = bpf_program__relocate(prog, obj);
W
Wang Nan 已提交
4763
		if (err) {
4764
			pr_warn("failed to relocate '%s'\n", prog->section_name);
W
Wang Nan 已提交
4765 4766 4767 4768 4769 4770
			return err;
		}
	}
	return 0;
}

4771 4772 4773 4774
static int bpf_object__collect_struct_ops_map_reloc(struct bpf_object *obj,
						    GElf_Shdr *shdr,
						    Elf_Data *data);

4775 4776 4777 4778 4779
static int bpf_object__collect_reloc(struct bpf_object *obj)
{
	int i, err;

	if (!obj_elf_valid(obj)) {
4780
		pr_warn("Internal error: elf object is closed\n");
4781
		return -LIBBPF_ERRNO__INTERNAL;
4782 4783
	}

4784 4785 4786
	for (i = 0; i < obj->efile.nr_reloc_sects; i++) {
		GElf_Shdr *shdr = &obj->efile.reloc_sects[i].shdr;
		Elf_Data *data = obj->efile.reloc_sects[i].data;
4787 4788 4789 4790
		int idx = shdr->sh_info;
		struct bpf_program *prog;

		if (shdr->sh_type != SHT_REL) {
4791
			pr_warn("internal error at %d\n", __LINE__);
4792
			return -LIBBPF_ERRNO__INTERNAL;
4793 4794
		}

4795 4796 4797 4798 4799 4800 4801 4802 4803
		if (idx == obj->efile.st_ops_shndx) {
			err = bpf_object__collect_struct_ops_map_reloc(obj,
								       shdr,
								       data);
			if (err)
				return err;
			continue;
		}

4804 4805
		prog = bpf_object__find_prog_by_idx(obj, idx);
		if (!prog) {
4806
			pr_warn("relocation failed: no section(%d)\n", idx);
4807
			return -LIBBPF_ERRNO__RELOC;
4808 4809
		}

4810
		err = bpf_program__collect_reloc(prog, shdr, data, obj);
4811
		if (err)
4812
			return err;
4813 4814 4815 4816
	}
	return 0;
}

4817
static int
4818
load_program(struct bpf_program *prog, struct bpf_insn *insns, int insns_cnt,
4819
	     char *license, __u32 kern_version, int *pfd)
4820
{
4821
	struct bpf_load_program_attr load_attr;
4822
	char *cp, errmsg[STRERR_BUFSIZE];
4823
	int log_buf_size = BPF_LOG_BUF_SIZE;
4824
	char *log_buf;
4825
	int btf_fd, ret;
4826

4827 4828 4829
	if (!insns || !insns_cnt)
		return -EINVAL;

4830
	memset(&load_attr, 0, sizeof(struct bpf_load_program_attr));
4831 4832
	load_attr.prog_type = prog->type;
	load_attr.expected_attach_type = prog->expected_attach_type;
4833 4834
	if (prog->caps->name)
		load_attr.name = prog->name;
4835 4836 4837
	load_attr.insns = insns;
	load_attr.insns_cnt = insns_cnt;
	load_attr.license = license;
4838 4839
	if (prog->type == BPF_PROG_TYPE_STRUCT_OPS) {
		load_attr.attach_btf_id = prog->attach_btf_id;
4840 4841
	} else if (prog->type == BPF_PROG_TYPE_TRACING ||
		   prog->type == BPF_PROG_TYPE_EXT) {
4842 4843 4844 4845 4846 4847
		load_attr.attach_prog_fd = prog->attach_prog_fd;
		load_attr.attach_btf_id = prog->attach_btf_id;
	} else {
		load_attr.kern_version = kern_version;
		load_attr.prog_ifindex = prog->prog_ifindex;
	}
4848 4849 4850 4851 4852
	/* if .BTF.ext was loaded, kernel supports associated BTF for prog */
	if (prog->obj->btf_ext)
		btf_fd = bpf_object__btf_fd(prog->obj);
	else
		btf_fd = -1;
4853
	load_attr.prog_btf_fd = btf_fd >= 0 ? btf_fd : 0;
4854 4855
	load_attr.func_info = prog->func_info;
	load_attr.func_info_rec_size = prog->func_info_rec_size;
4856
	load_attr.func_info_cnt = prog->func_info_cnt;
4857 4858 4859
	load_attr.line_info = prog->line_info;
	load_attr.line_info_rec_size = prog->line_info_rec_size;
	load_attr.line_info_cnt = prog->line_info_cnt;
4860
	load_attr.log_level = prog->log_level;
4861
	load_attr.prog_flags = prog->prog_flags;
4862

4863 4864
retry_load:
	log_buf = malloc(log_buf_size);
4865
	if (!log_buf)
4866
		pr_warn("Alloc log buffer for bpf loader error, continue without log\n");
4867

4868
	ret = bpf_load_program_xattr(&load_attr, log_buf, log_buf_size);
4869 4870

	if (ret >= 0) {
4871 4872
		if (load_attr.log_level)
			pr_debug("verifier log:\n%s", log_buf);
4873 4874 4875 4876 4877
		*pfd = ret;
		ret = 0;
		goto out;
	}

4878 4879 4880 4881 4882
	if (errno == ENOSPC) {
		log_buf_size <<= 1;
		free(log_buf);
		goto retry_load;
	}
4883
	ret = -errno;
4884
	cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
4885
	pr_warn("load bpf program failed: %s\n", cp);
4886
	pr_perm_msg(ret);
4887

4888 4889
	if (log_buf && log_buf[0] != '\0') {
		ret = -LIBBPF_ERRNO__VERIFY;
4890 4891 4892
		pr_warn("-- BEGIN DUMP LOG ---\n");
		pr_warn("\n%s\n", log_buf);
		pr_warn("-- END LOG --\n");
4893
	} else if (load_attr.insns_cnt >= BPF_MAXINSNS) {
4894 4895
		pr_warn("Program too large (%zu insns), at most %d insns\n",
			load_attr.insns_cnt, BPF_MAXINSNS);
4896
		ret = -LIBBPF_ERRNO__PROG2BIG;
4897
	} else if (load_attr.prog_type != BPF_PROG_TYPE_KPROBE) {
4898
		/* Wrong program type? */
4899
		int fd;
4900

4901 4902 4903 4904 4905 4906 4907 4908
		load_attr.prog_type = BPF_PROG_TYPE_KPROBE;
		load_attr.expected_attach_type = 0;
		fd = bpf_load_program_xattr(&load_attr, NULL, 0);
		if (fd >= 0) {
			close(fd);
			ret = -LIBBPF_ERRNO__PROGTYPE;
			goto out;
		}
4909 4910 4911 4912 4913 4914 4915
	}

out:
	free(log_buf);
	return ret;
}

4916
static int libbpf_find_attach_btf_id(struct bpf_program *prog);
4917 4918

int bpf_program__load(struct bpf_program *prog, char *license, __u32 kern_ver)
4919
{
4920 4921
	int err = 0, fd, i, btf_id;

4922 4923
	if (prog->type == BPF_PROG_TYPE_TRACING ||
	    prog->type == BPF_PROG_TYPE_EXT) {
4924
		btf_id = libbpf_find_attach_btf_id(prog);
4925 4926 4927 4928
		if (btf_id <= 0)
			return btf_id;
		prog->attach_btf_id = btf_id;
	}
4929

4930 4931
	if (prog->instances.nr < 0 || !prog->instances.fds) {
		if (prog->preprocessor) {
4932 4933
			pr_warn("Internal error: can't load program '%s'\n",
				prog->section_name);
4934 4935
			return -LIBBPF_ERRNO__INTERNAL;
		}
4936

4937 4938
		prog->instances.fds = malloc(sizeof(int));
		if (!prog->instances.fds) {
4939
			pr_warn("Not enough memory for BPF fds\n");
4940 4941 4942 4943 4944 4945 4946 4947
			return -ENOMEM;
		}
		prog->instances.nr = 1;
		prog->instances.fds[0] = -1;
	}

	if (!prog->preprocessor) {
		if (prog->instances.nr != 1) {
4948 4949
			pr_warn("Program '%s' is inconsistent: nr(%d) != 1\n",
				prog->section_name, prog->instances.nr);
4950
		}
4951
		err = load_program(prog, prog->insns, prog->insns_cnt,
4952
				   license, kern_ver, &fd);
4953 4954 4955 4956 4957 4958 4959 4960 4961
		if (!err)
			prog->instances.fds[0] = fd;
		goto out;
	}

	for (i = 0; i < prog->instances.nr; i++) {
		struct bpf_prog_prep_result result;
		bpf_program_prep_t preprocessor = prog->preprocessor;

4962
		memset(&result, 0, sizeof(result));
4963 4964 4965
		err = preprocessor(prog, i, prog->insns,
				   prog->insns_cnt, &result);
		if (err) {
4966 4967
			pr_warn("Preprocessing the %dth instance of program '%s' failed\n",
				i, prog->section_name);
4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979
			goto out;
		}

		if (!result.new_insn_ptr || !result.new_insn_cnt) {
			pr_debug("Skip loading the %dth instance of program '%s'\n",
				 i, prog->section_name);
			prog->instances.fds[i] = -1;
			if (result.pfd)
				*result.pfd = -1;
			continue;
		}

4980
		err = load_program(prog, result.new_insn_ptr,
4981
				   result.new_insn_cnt, license, kern_ver, &fd);
4982
		if (err) {
4983 4984
			pr_warn("Loading the %dth instance of program '%s' failed\n",
				i, prog->section_name);
4985 4986 4987 4988 4989 4990 4991 4992
			goto out;
		}

		if (result.pfd)
			*result.pfd = fd;
		prog->instances.fds[i] = fd;
	}
out:
4993
	if (err)
4994
		pr_warn("failed to load program '%s'\n", prog->section_name);
4995 4996 4997 4998 4999
	zfree(&prog->insns);
	prog->insns_cnt = 0;
	return err;
}

A
Andrii Nakryiko 已提交
5000 5001
static bool bpf_program__is_function_storage(const struct bpf_program *prog,
					     const struct bpf_object *obj)
5002 5003 5004 5005
{
	return prog->idx == obj->efile.text_shndx && obj->has_pseudo_calls;
}

5006
static int
5007
bpf_object__load_progs(struct bpf_object *obj, int log_level)
5008 5009 5010 5011 5012
{
	size_t i;
	int err;

	for (i = 0; i < obj->nr_programs; i++) {
5013
		if (bpf_program__is_function_storage(&obj->programs[i], obj))
5014
			continue;
5015
		obj->programs[i].log_level |= log_level;
5016 5017 5018 5019 5020 5021 5022 5023 5024
		err = bpf_program__load(&obj->programs[i],
					obj->license,
					obj->kern_version);
		if (err)
			return err;
	}
	return 0;
}

5025
static struct bpf_object *
5026
__bpf_object__open(const char *path, const void *obj_buf, size_t obj_buf_sz,
5027
		   const struct bpf_object_open_opts *opts)
5028
{
5029
	const char *obj_name, *kconfig;
5030
	struct bpf_program *prog;
5031
	struct bpf_object *obj;
5032
	char tmp_name[64];
5033
	int err;
5034 5035

	if (elf_version(EV_CURRENT) == EV_NONE) {
5036 5037
		pr_warn("failed to init libelf for %s\n",
			path ? : "(mem buf)");
5038
		return ERR_PTR(-LIBBPF_ERRNO__LIBELF);
5039 5040
	}

5041 5042 5043
	if (!OPTS_VALID(opts, bpf_object_open_opts))
		return ERR_PTR(-EINVAL);

5044
	obj_name = OPTS_GET(opts, object_name, NULL);
5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055
	if (obj_buf) {
		if (!obj_name) {
			snprintf(tmp_name, sizeof(tmp_name), "%lx-%lx",
				 (unsigned long)obj_buf,
				 (unsigned long)obj_buf_sz);
			obj_name = tmp_name;
		}
		path = obj_name;
		pr_debug("loading object '%s' from buffer\n", obj_name);
	}

5056
	obj = bpf_object__new(path, obj_buf, obj_buf_sz, obj_name);
5057 5058
	if (IS_ERR(obj))
		return obj;
5059

5060
	obj->relaxed_core_relocs = OPTS_GET(opts, relaxed_core_relocs, false);
5061 5062 5063 5064
	kconfig = OPTS_GET(opts, kconfig, NULL);
	if (kconfig) {
		obj->kconfig = strdup(kconfig);
		if (!obj->kconfig)
5065 5066
			return ERR_PTR(-ENOMEM);
	}
5067

5068 5069 5070
	err = bpf_object__elf_init(obj);
	err = err ? : bpf_object__check_endianness(obj);
	err = err ? : bpf_object__elf_collect(obj);
5071 5072
	err = err ? : bpf_object__collect_externs(obj);
	err = err ? : bpf_object__finalize_btf(obj);
5073 5074 5075 5076 5077
	err = err ? : bpf_object__init_maps(obj, opts);
	err = err ? : bpf_object__init_prog_names(obj);
	err = err ? : bpf_object__collect_reloc(obj);
	if (err)
		goto out;
5078
	bpf_object__elf_finish(obj);
5079 5080 5081 5082 5083

	bpf_object__for_each_program(prog, obj) {
		enum bpf_prog_type prog_type;
		enum bpf_attach_type attach_type;

5084 5085 5086
		if (prog->type != BPF_PROG_TYPE_UNSPEC)
			continue;

5087 5088 5089 5090 5091 5092 5093 5094 5095 5096
		err = libbpf_prog_type_by_name(prog->section_name, &prog_type,
					       &attach_type);
		if (err == -ESRCH)
			/* couldn't guess, but user might manually specify */
			continue;
		if (err)
			goto out;

		bpf_program__set_type(prog, prog_type);
		bpf_program__set_expected_attach_type(prog, attach_type);
5097 5098
		if (prog_type == BPF_PROG_TYPE_TRACING ||
		    prog_type == BPF_PROG_TYPE_EXT)
5099
			prog->attach_prog_fd = OPTS_GET(opts, attach_prog_fd, 0);
5100 5101
	}

5102 5103 5104
	return obj;
out:
	bpf_object__close(obj);
5105
	return ERR_PTR(err);
5106 5107
}

5108 5109
static struct bpf_object *
__bpf_object__open_xattr(struct bpf_object_open_attr *attr, int flags)
5110
{
5111
	DECLARE_LIBBPF_OPTS(bpf_object_open_opts, opts,
5112 5113 5114
		.relaxed_maps = flags & MAPS_RELAX_COMPAT,
	);

5115
	/* param validation */
5116
	if (!attr->file)
5117 5118
		return NULL;

5119
	pr_debug("loading %s\n", attr->file);
5120
	return __bpf_object__open(attr->file, NULL, 0, &opts);
5121 5122 5123 5124 5125
}

struct bpf_object *bpf_object__open_xattr(struct bpf_object_open_attr *attr)
{
	return __bpf_object__open_xattr(attr, 0);
5126 5127 5128 5129 5130 5131 5132 5133
}

struct bpf_object *bpf_object__open(const char *path)
{
	struct bpf_object_open_attr attr = {
		.file		= path,
		.prog_type	= BPF_PROG_TYPE_UNSPEC,
	};
5134

5135
	return bpf_object__open_xattr(&attr);
5136 5137
}

5138
struct bpf_object *
5139
bpf_object__open_file(const char *path, const struct bpf_object_open_opts *opts)
5140 5141 5142 5143 5144 5145
{
	if (!path)
		return ERR_PTR(-EINVAL);

	pr_debug("loading %s\n", path);

5146
	return __bpf_object__open(path, NULL, 0, opts);
5147 5148 5149 5150
}

struct bpf_object *
bpf_object__open_mem(const void *obj_buf, size_t obj_buf_sz,
5151
		     const struct bpf_object_open_opts *opts)
5152
{
5153 5154
	if (!obj_buf || obj_buf_sz == 0)
		return ERR_PTR(-EINVAL);
5155

5156
	return __bpf_object__open(NULL, obj_buf, obj_buf_sz, opts);
5157 5158 5159 5160 5161 5162
}

struct bpf_object *
bpf_object__open_buffer(const void *obj_buf, size_t obj_buf_sz,
			const char *name)
{
5163
	DECLARE_LIBBPF_OPTS(bpf_object_open_opts, opts,
5164 5165 5166 5167 5168 5169 5170 5171
		.object_name = name,
		/* wrong default, but backwards-compatible */
		.relaxed_maps = true,
	);

	/* returning NULL is wrong, but backwards-compatible */
	if (!obj_buf || obj_buf_sz == 0)
		return NULL;
5172

5173
	return bpf_object__open_mem(obj_buf, obj_buf_sz, &opts);
5174 5175
}

5176 5177 5178 5179 5180 5181 5182
int bpf_object__unload(struct bpf_object *obj)
{
	size_t i;

	if (!obj)
		return -EINVAL;

5183
	for (i = 0; i < obj->nr_maps; i++) {
5184
		zclose(obj->maps[i].fd);
5185 5186 5187
		if (obj->maps[i].st_ops)
			zfree(&obj->maps[i].st_ops->kern_vdata);
	}
5188

5189 5190 5191
	for (i = 0; i < obj->nr_programs; i++)
		bpf_program__unload(&obj->programs[i]);

5192 5193 5194
	return 0;
}

5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212
static int bpf_object__sanitize_maps(struct bpf_object *obj)
{
	struct bpf_map *m;

	bpf_object__for_each_map(m, obj) {
		if (!bpf_map__is_internal(m))
			continue;
		if (!obj->caps.global_data) {
			pr_warn("kernel doesn't support global data\n");
			return -ENOTSUP;
		}
		if (!obj->caps.array_mmap)
			m->def.map_flags ^= BPF_F_MMAPABLE;
	}

	return 0;
}

5213
static int bpf_object__resolve_externs(struct bpf_object *obj,
5214
				       const char *extra_kconfig)
5215 5216 5217 5218 5219 5220 5221 5222 5223
{
	bool need_config = false;
	struct extern_desc *ext;
	int err, i;
	void *data;

	if (obj->nr_extern == 0)
		return 0;

5224
	data = obj->maps[obj->kconfig_map_idx].mmaped;
5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247

	for (i = 0; i < obj->nr_extern; i++) {
		ext = &obj->externs[i];

		if (strcmp(ext->name, "LINUX_KERNEL_VERSION") == 0) {
			void *ext_val = data + ext->data_off;
			__u32 kver = get_kernel_version();

			if (!kver) {
				pr_warn("failed to get kernel version\n");
				return -EINVAL;
			}
			err = set_ext_value_num(ext, ext_val, kver);
			if (err)
				return err;
			pr_debug("extern %s=0x%x\n", ext->name, kver);
		} else if (strncmp(ext->name, "CONFIG_", 7) == 0) {
			need_config = true;
		} else {
			pr_warn("unrecognized extern '%s'\n", ext->name);
			return -EINVAL;
		}
	}
5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260
	if (need_config && extra_kconfig) {
		err = bpf_object__read_kconfig_mem(obj, extra_kconfig, data);
		if (err)
			return -EINVAL;
		need_config = false;
		for (i = 0; i < obj->nr_extern; i++) {
			ext = &obj->externs[i];
			if (!ext->is_set) {
				need_config = true;
				break;
			}
		}
	}
5261
	if (need_config) {
5262
		err = bpf_object__read_kconfig_file(obj, data);
5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280
		if (err)
			return -EINVAL;
	}
	for (i = 0; i < obj->nr_extern; i++) {
		ext = &obj->externs[i];

		if (!ext->is_set && !ext->is_weak) {
			pr_warn("extern %s (strong) not resolved\n", ext->name);
			return -ESRCH;
		} else if (!ext->is_set) {
			pr_debug("extern %s (weak) not resolved, defaulting to zero\n",
				 ext->name);
		}
	}

	return 0;
}

5281
int bpf_object__load_xattr(struct bpf_object_load_attr *attr)
5282
{
5283
	struct bpf_object *obj;
5284
	int err, i;
5285

5286 5287 5288
	if (!attr)
		return -EINVAL;
	obj = attr->obj;
5289 5290 5291 5292
	if (!obj)
		return -EINVAL;

	if (obj->loaded) {
5293
		pr_warn("object should not be loaded twice\n");
5294 5295 5296 5297
		return -EINVAL;
	}

	obj->loaded = true;
5298

5299
	err = bpf_object__probe_caps(obj);
5300
	err = err ? : bpf_object__resolve_externs(obj, obj->kconfig);
5301 5302
	err = err ? : bpf_object__sanitize_and_load_btf(obj);
	err = err ? : bpf_object__sanitize_maps(obj);
5303
	err = err ? : bpf_object__load_vmlinux_btf(obj);
5304
	err = err ? : bpf_object__init_kern_struct_ops_maps(obj);
5305 5306 5307
	err = err ? : bpf_object__create_maps(obj);
	err = err ? : bpf_object__relocate(obj, attr->target_btf_path);
	err = err ? : bpf_object__load_progs(obj, attr->log_level);
5308 5309 5310 5311

	btf__free(obj->btf_vmlinux);
	obj->btf_vmlinux = NULL;

5312 5313
	if (err)
		goto out;
5314 5315 5316

	return 0;
out:
5317 5318 5319 5320 5321
	/* unpin any maps that were auto-pinned during load */
	for (i = 0; i < obj->nr_maps; i++)
		if (obj->maps[i].pinned && !obj->maps[i].reused)
			bpf_map__unpin(&obj->maps[i], NULL);

5322
	bpf_object__unload(obj);
5323
	pr_warn("failed to load object '%s'\n", obj->path);
5324
	return err;
5325 5326
}

5327 5328 5329 5330 5331 5332 5333 5334 5335
int bpf_object__load(struct bpf_object *obj)
{
	struct bpf_object_load_attr attr = {
		.obj = obj,
	};

	return bpf_object__load_xattr(&attr);
}

5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357
static int make_parent_dir(const char *path)
{
	char *cp, errmsg[STRERR_BUFSIZE];
	char *dname, *dir;
	int err = 0;

	dname = strdup(path);
	if (dname == NULL)
		return -ENOMEM;

	dir = dirname(dname);
	if (mkdir(dir, 0700) && errno != EEXIST)
		err = -errno;

	free(dname);
	if (err) {
		cp = libbpf_strerror_r(-err, errmsg, sizeof(errmsg));
		pr_warn("failed to mkdir %s: %s\n", path, cp);
	}
	return err;
}

5358 5359
static int check_path(const char *path)
{
5360
	char *cp, errmsg[STRERR_BUFSIZE];
5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373
	struct statfs st_fs;
	char *dname, *dir;
	int err = 0;

	if (path == NULL)
		return -EINVAL;

	dname = strdup(path);
	if (dname == NULL)
		return -ENOMEM;

	dir = dirname(dname);
	if (statfs(dir, &st_fs)) {
5374
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
5375
		pr_warn("failed to statfs %s: %s\n", dir, cp);
5376 5377 5378 5379 5380
		err = -errno;
	}
	free(dname);

	if (!err && st_fs.f_type != BPF_FS_MAGIC) {
5381
		pr_warn("specified path %s is not on BPF FS\n", path);
5382 5383 5384 5385 5386 5387 5388 5389 5390
		err = -EINVAL;
	}

	return err;
}

int bpf_program__pin_instance(struct bpf_program *prog, const char *path,
			      int instance)
{
5391
	char *cp, errmsg[STRERR_BUFSIZE];
5392 5393
	int err;

5394 5395 5396 5397
	err = make_parent_dir(path);
	if (err)
		return err;

5398 5399 5400 5401 5402
	err = check_path(path);
	if (err)
		return err;

	if (prog == NULL) {
5403
		pr_warn("invalid program pointer\n");
5404 5405 5406 5407
		return -EINVAL;
	}

	if (instance < 0 || instance >= prog->instances.nr) {
5408 5409
		pr_warn("invalid prog instance %d of prog %s (max %d)\n",
			instance, prog->section_name, prog->instances.nr);
5410 5411 5412 5413
		return -EINVAL;
	}

	if (bpf_obj_pin(prog->instances.fds[instance], path)) {
5414
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
5415
		pr_warn("failed to pin program: %s\n", cp);
5416 5417 5418 5419 5420 5421 5422
		return -errno;
	}
	pr_debug("pinned program '%s'\n", path);

	return 0;
}

5423 5424 5425 5426 5427 5428 5429 5430 5431 5432
int bpf_program__unpin_instance(struct bpf_program *prog, const char *path,
				int instance)
{
	int err;

	err = check_path(path);
	if (err)
		return err;

	if (prog == NULL) {
5433
		pr_warn("invalid program pointer\n");
5434 5435 5436 5437
		return -EINVAL;
	}

	if (instance < 0 || instance >= prog->instances.nr) {
5438 5439
		pr_warn("invalid prog instance %d of prog %s (max %d)\n",
			instance, prog->section_name, prog->instances.nr);
5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450
		return -EINVAL;
	}

	err = unlink(path);
	if (err != 0)
		return -errno;
	pr_debug("unpinned program '%s'\n", path);

	return 0;
}

5451 5452 5453 5454
int bpf_program__pin(struct bpf_program *prog, const char *path)
{
	int i, err;

5455 5456 5457 5458
	err = make_parent_dir(path);
	if (err)
		return err;

5459 5460 5461 5462 5463
	err = check_path(path);
	if (err)
		return err;

	if (prog == NULL) {
5464
		pr_warn("invalid program pointer\n");
5465 5466 5467 5468
		return -EINVAL;
	}

	if (prog->instances.nr <= 0) {
5469
		pr_warn("no instances of prog %s to pin\n",
5470 5471 5472 5473
			   prog->section_name);
		return -EINVAL;
	}

5474 5475 5476 5477 5478
	if (prog->instances.nr == 1) {
		/* don't create subdirs when pinning single instance */
		return bpf_program__pin_instance(prog, path, 0);
	}

5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526
	for (i = 0; i < prog->instances.nr; i++) {
		char buf[PATH_MAX];
		int len;

		len = snprintf(buf, PATH_MAX, "%s/%d", path, i);
		if (len < 0) {
			err = -EINVAL;
			goto err_unpin;
		} else if (len >= PATH_MAX) {
			err = -ENAMETOOLONG;
			goto err_unpin;
		}

		err = bpf_program__pin_instance(prog, buf, i);
		if (err)
			goto err_unpin;
	}

	return 0;

err_unpin:
	for (i = i - 1; i >= 0; i--) {
		char buf[PATH_MAX];
		int len;

		len = snprintf(buf, PATH_MAX, "%s/%d", path, i);
		if (len < 0)
			continue;
		else if (len >= PATH_MAX)
			continue;

		bpf_program__unpin_instance(prog, buf, i);
	}

	rmdir(path);

	return err;
}

int bpf_program__unpin(struct bpf_program *prog, const char *path)
{
	int i, err;

	err = check_path(path);
	if (err)
		return err;

	if (prog == NULL) {
5527
		pr_warn("invalid program pointer\n");
5528 5529 5530 5531
		return -EINVAL;
	}

	if (prog->instances.nr <= 0) {
5532
		pr_warn("no instances of prog %s to pin\n",
5533 5534
			   prog->section_name);
		return -EINVAL;
5535 5536 5537 5538 5539
	}

	if (prog->instances.nr == 1) {
		/* don't create subdirs when pinning single instance */
		return bpf_program__unpin_instance(prog, path, 0);
5540 5541
	}

5542 5543 5544 5545 5546 5547 5548 5549 5550 5551
	for (i = 0; i < prog->instances.nr; i++) {
		char buf[PATH_MAX];
		int len;

		len = snprintf(buf, PATH_MAX, "%s/%d", path, i);
		if (len < 0)
			return -EINVAL;
		else if (len >= PATH_MAX)
			return -ENAMETOOLONG;

5552
		err = bpf_program__unpin_instance(prog, buf, i);
5553 5554 5555 5556
		if (err)
			return err;
	}

5557 5558 5559 5560
	err = rmdir(path);
	if (err)
		return -errno;

5561 5562 5563
	return 0;
}

J
Joe Stringer 已提交
5564 5565
int bpf_map__pin(struct bpf_map *map, const char *path)
{
5566
	char *cp, errmsg[STRERR_BUFSIZE];
J
Joe Stringer 已提交
5567 5568 5569
	int err;

	if (map == NULL) {
5570
		pr_warn("invalid map pointer\n");
J
Joe Stringer 已提交
5571 5572 5573
		return -EINVAL;
	}

5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598
	if (map->pin_path) {
		if (path && strcmp(path, map->pin_path)) {
			pr_warn("map '%s' already has pin path '%s' different from '%s'\n",
				bpf_map__name(map), map->pin_path, path);
			return -EINVAL;
		} else if (map->pinned) {
			pr_debug("map '%s' already pinned at '%s'; not re-pinning\n",
				 bpf_map__name(map), map->pin_path);
			return 0;
		}
	} else {
		if (!path) {
			pr_warn("missing a path to pin map '%s' at\n",
				bpf_map__name(map));
			return -EINVAL;
		} else if (map->pinned) {
			pr_warn("map '%s' already pinned\n", bpf_map__name(map));
			return -EEXIST;
		}

		map->pin_path = strdup(path);
		if (!map->pin_path) {
			err = -errno;
			goto out_err;
		}
J
Joe Stringer 已提交
5599 5600
	}

5601 5602 5603 5604
	err = make_parent_dir(map->pin_path);
	if (err)
		return err;

5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615
	err = check_path(map->pin_path);
	if (err)
		return err;

	if (bpf_obj_pin(map->fd, map->pin_path)) {
		err = -errno;
		goto out_err;
	}

	map->pinned = true;
	pr_debug("pinned map '%s'\n", map->pin_path);
5616

J
Joe Stringer 已提交
5617
	return 0;
5618 5619 5620 5621 5622

out_err:
	cp = libbpf_strerror_r(-err, errmsg, sizeof(errmsg));
	pr_warn("failed to pin map: %s\n", cp);
	return err;
J
Joe Stringer 已提交
5623 5624
}

5625 5626 5627 5628 5629
int bpf_map__unpin(struct bpf_map *map, const char *path)
{
	int err;

	if (map == NULL) {
5630
		pr_warn("invalid map pointer\n");
5631 5632 5633
		return -EINVAL;
	}

5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650
	if (map->pin_path) {
		if (path && strcmp(path, map->pin_path)) {
			pr_warn("map '%s' already has pin path '%s' different from '%s'\n",
				bpf_map__name(map), map->pin_path, path);
			return -EINVAL;
		}
		path = map->pin_path;
	} else if (!path) {
		pr_warn("no path to unpin map '%s' from\n",
			bpf_map__name(map));
		return -EINVAL;
	}

	err = check_path(path);
	if (err)
		return err;

5651 5652 5653
	err = unlink(path);
	if (err != 0)
		return -errno;
5654 5655 5656

	map->pinned = false;
	pr_debug("unpinned map '%s' from '%s'\n", bpf_map__name(map), path);
5657 5658 5659 5660

	return 0;
}

5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685
int bpf_map__set_pin_path(struct bpf_map *map, const char *path)
{
	char *new = NULL;

	if (path) {
		new = strdup(path);
		if (!new)
			return -errno;
	}

	free(map->pin_path);
	map->pin_path = new;
	return 0;
}

const char *bpf_map__get_pin_path(const struct bpf_map *map)
{
	return map->pin_path;
}

bool bpf_map__is_pinned(const struct bpf_map *map)
{
	return map->pinned;
}

5686
int bpf_object__pin_maps(struct bpf_object *obj, const char *path)
5687 5688 5689 5690 5691 5692 5693 5694
{
	struct bpf_map *map;
	int err;

	if (!obj)
		return -ENOENT;

	if (!obj->loaded) {
5695
		pr_warn("object not yet loaded; load it first\n");
5696 5697 5698
		return -ENOENT;
	}

5699
	bpf_object__for_each_map(map, obj) {
5700
		char *pin_path = NULL;
5701 5702
		char buf[PATH_MAX];

5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717
		if (path) {
			int len;

			len = snprintf(buf, PATH_MAX, "%s/%s", path,
				       bpf_map__name(map));
			if (len < 0) {
				err = -EINVAL;
				goto err_unpin_maps;
			} else if (len >= PATH_MAX) {
				err = -ENAMETOOLONG;
				goto err_unpin_maps;
			}
			pin_path = buf;
		} else if (!map->pin_path) {
			continue;
5718 5719
		}

5720
		err = bpf_map__pin(map, pin_path);
5721 5722 5723 5724 5725 5726 5727 5728
		if (err)
			goto err_unpin_maps;
	}

	return 0;

err_unpin_maps:
	while ((map = bpf_map__prev(map, obj))) {
5729
		if (!map->pin_path)
5730 5731
			continue;

5732
		bpf_map__unpin(map, NULL);
5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745
	}

	return err;
}

int bpf_object__unpin_maps(struct bpf_object *obj, const char *path)
{
	struct bpf_map *map;
	int err;

	if (!obj)
		return -ENOENT;

5746
	bpf_object__for_each_map(map, obj) {
5747
		char *pin_path = NULL;
5748 5749
		char buf[PATH_MAX];

5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762
		if (path) {
			int len;

			len = snprintf(buf, PATH_MAX, "%s/%s", path,
				       bpf_map__name(map));
			if (len < 0)
				return -EINVAL;
			else if (len >= PATH_MAX)
				return -ENAMETOOLONG;
			pin_path = buf;
		} else if (!map->pin_path) {
			continue;
		}
5763

5764
		err = bpf_map__unpin(map, pin_path);
5765 5766 5767 5768
		if (err)
			return err;
	}

5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780
	return 0;
}

int bpf_object__pin_programs(struct bpf_object *obj, const char *path)
{
	struct bpf_program *prog;
	int err;

	if (!obj)
		return -ENOENT;

	if (!obj->loaded) {
5781
		pr_warn("object not yet loaded; load it first\n");
5782 5783 5784 5785 5786 5787 5788 5789
		return -ENOENT;
	}

	bpf_object__for_each_program(prog, obj) {
		char buf[PATH_MAX];
		int len;

		len = snprintf(buf, PATH_MAX, "%s/%s", path,
S
Stanislav Fomichev 已提交
5790
			       prog->pin_name);
5791 5792 5793 5794 5795 5796 5797 5798 5799 5800 5801 5802 5803 5804 5805 5806 5807 5808 5809 5810 5811
		if (len < 0) {
			err = -EINVAL;
			goto err_unpin_programs;
		} else if (len >= PATH_MAX) {
			err = -ENAMETOOLONG;
			goto err_unpin_programs;
		}

		err = bpf_program__pin(prog, buf);
		if (err)
			goto err_unpin_programs;
	}

	return 0;

err_unpin_programs:
	while ((prog = bpf_program__prev(prog, obj))) {
		char buf[PATH_MAX];
		int len;

		len = snprintf(buf, PATH_MAX, "%s/%s", path,
S
Stanislav Fomichev 已提交
5812
			       prog->pin_name);
5813 5814 5815 5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827 5828 5829 5830 5831
		if (len < 0)
			continue;
		else if (len >= PATH_MAX)
			continue;

		bpf_program__unpin(prog, buf);
	}

	return err;
}

int bpf_object__unpin_programs(struct bpf_object *obj, const char *path)
{
	struct bpf_program *prog;
	int err;

	if (!obj)
		return -ENOENT;

5832 5833 5834 5835 5836
	bpf_object__for_each_program(prog, obj) {
		char buf[PATH_MAX];
		int len;

		len = snprintf(buf, PATH_MAX, "%s/%s", path,
S
Stanislav Fomichev 已提交
5837
			       prog->pin_name);
5838 5839 5840 5841 5842
		if (len < 0)
			return -EINVAL;
		else if (len >= PATH_MAX)
			return -ENAMETOOLONG;

5843
		err = bpf_program__unpin(prog, buf);
5844 5845 5846 5847 5848 5849 5850
		if (err)
			return err;
	}

	return 0;
}

5851 5852 5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867
int bpf_object__pin(struct bpf_object *obj, const char *path)
{
	int err;

	err = bpf_object__pin_maps(obj, path);
	if (err)
		return err;

	err = bpf_object__pin_programs(obj, path);
	if (err) {
		bpf_object__unpin_maps(obj, path);
		return err;
	}

	return 0;
}

5868 5869
void bpf_object__close(struct bpf_object *obj)
{
5870 5871
	size_t i;

5872 5873 5874
	if (!obj)
		return;

5875 5876 5877
	if (obj->clear_priv)
		obj->clear_priv(obj, obj->priv);

5878
	bpf_object__elf_finish(obj);
5879
	bpf_object__unload(obj);
5880
	btf__free(obj->btf);
5881
	btf_ext__free(obj->btf_ext);
5882

5883
	for (i = 0; i < obj->nr_maps; i++) {
5884 5885 5886 5887 5888 5889 5890 5891 5892 5893 5894 5895
		struct bpf_map *map = &obj->maps[i];

		if (map->clear_priv)
			map->clear_priv(map, map->priv);
		map->priv = NULL;
		map->clear_priv = NULL;

		if (map->mmaped) {
			munmap(map->mmaped, bpf_map_mmap_sz(map));
			map->mmaped = NULL;
		}

5896 5897 5898 5899 5900 5901 5902
		if (map->st_ops) {
			zfree(&map->st_ops->data);
			zfree(&map->st_ops->progs);
			zfree(&map->st_ops->kern_func_off);
			zfree(&map->st_ops);
		}

5903 5904
		zfree(&map->name);
		zfree(&map->pin_path);
5905
	}
5906

5907
	zfree(&obj->kconfig);
5908 5909 5910
	zfree(&obj->externs);
	obj->nr_extern = 0;

5911 5912
	zfree(&obj->maps);
	obj->nr_maps = 0;
5913 5914 5915 5916 5917 5918 5919

	if (obj->programs && obj->nr_programs) {
		for (i = 0; i < obj->nr_programs; i++)
			bpf_program__exit(&obj->programs[i]);
	}
	zfree(&obj->programs);

5920
	list_del(&obj->list);
5921 5922
	free(obj);
}
5923

5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940 5941 5942
struct bpf_object *
bpf_object__next(struct bpf_object *prev)
{
	struct bpf_object *next;

	if (!prev)
		next = list_first_entry(&bpf_objects_list,
					struct bpf_object,
					list);
	else
		next = list_next_entry(prev, list);

	/* Empty list is noticed here so don't need checking on entry. */
	if (&next->list == &bpf_objects_list)
		return NULL;

	return next;
}

A
Andrii Nakryiko 已提交
5943
const char *bpf_object__name(const struct bpf_object *obj)
5944
{
5945
	return obj ? obj->name : ERR_PTR(-EINVAL);
5946 5947
}

A
Andrii Nakryiko 已提交
5948
unsigned int bpf_object__kversion(const struct bpf_object *obj)
5949
{
5950
	return obj ? obj->kern_version : 0;
5951 5952
}

A
Andrii Nakryiko 已提交
5953
struct btf *bpf_object__btf(const struct bpf_object *obj)
5954 5955 5956 5957
{
	return obj ? obj->btf : NULL;
}

5958 5959 5960 5961 5962
int bpf_object__btf_fd(const struct bpf_object *obj)
{
	return obj->btf ? btf__fd(obj->btf) : -1;
}

5963 5964 5965 5966 5967 5968 5969 5970 5971 5972 5973
int bpf_object__set_priv(struct bpf_object *obj, void *priv,
			 bpf_object_clear_priv_t clear_priv)
{
	if (obj->priv && obj->clear_priv)
		obj->clear_priv(obj, obj->priv);

	obj->priv = priv;
	obj->clear_priv = clear_priv;
	return 0;
}

A
Andrii Nakryiko 已提交
5974
void *bpf_object__priv(const struct bpf_object *obj)
5975 5976 5977 5978
{
	return obj ? obj->priv : ERR_PTR(-EINVAL);
}

5979
static struct bpf_program *
A
Andrii Nakryiko 已提交
5980 5981
__bpf_program__iter(const struct bpf_program *p, const struct bpf_object *obj,
		    bool forward)
5982
{
5983
	size_t nr_programs = obj->nr_programs;
5984
	ssize_t idx;
5985

5986
	if (!nr_programs)
5987 5988
		return NULL;

5989 5990 5991 5992 5993
	if (!p)
		/* Iter from the beginning */
		return forward ? &obj->programs[0] :
			&obj->programs[nr_programs - 1];

5994
	if (p->obj != obj) {
5995
		pr_warn("error: program handler doesn't match object\n");
5996 5997 5998
		return NULL;
	}

5999
	idx = (p - obj->programs) + (forward ? 1 : -1);
6000
	if (idx >= obj->nr_programs || idx < 0)
6001 6002 6003 6004
		return NULL;
	return &obj->programs[idx];
}

6005
struct bpf_program *
A
Andrii Nakryiko 已提交
6006
bpf_program__next(struct bpf_program *prev, const struct bpf_object *obj)
6007 6008 6009 6010
{
	struct bpf_program *prog = prev;

	do {
6011
		prog = __bpf_program__iter(prog, obj, true);
6012 6013 6014 6015 6016 6017
	} while (prog && bpf_program__is_function_storage(prog, obj));

	return prog;
}

struct bpf_program *
A
Andrii Nakryiko 已提交
6018
bpf_program__prev(struct bpf_program *next, const struct bpf_object *obj)
6019 6020 6021 6022
{
	struct bpf_program *prog = next;

	do {
6023
		prog = __bpf_program__iter(prog, obj, false);
6024 6025 6026 6027 6028
	} while (prog && bpf_program__is_function_storage(prog, obj));

	return prog;
}

6029 6030
int bpf_program__set_priv(struct bpf_program *prog, void *priv,
			  bpf_program_clear_priv_t clear_priv)
6031 6032 6033 6034 6035 6036 6037 6038 6039
{
	if (prog->priv && prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

	prog->priv = priv;
	prog->clear_priv = clear_priv;
	return 0;
}

A
Andrii Nakryiko 已提交
6040
void *bpf_program__priv(const struct bpf_program *prog)
6041
{
6042
	return prog ? prog->priv : ERR_PTR(-EINVAL);
6043 6044
}

6045 6046 6047 6048 6049
void bpf_program__set_ifindex(struct bpf_program *prog, __u32 ifindex)
{
	prog->prog_ifindex = ifindex;
}

6050 6051 6052 6053 6054
const char *bpf_program__name(const struct bpf_program *prog)
{
	return prog->name;
}

A
Andrii Nakryiko 已提交
6055
const char *bpf_program__title(const struct bpf_program *prog, bool needs_copy)
6056 6057 6058 6059
{
	const char *title;

	title = prog->section_name;
6060
	if (needs_copy) {
6061 6062
		title = strdup(title);
		if (!title) {
6063
			pr_warn("failed to strdup program title\n");
6064
			return ERR_PTR(-ENOMEM);
6065 6066 6067 6068 6069 6070
		}
	}

	return title;
}

A
Andrii Nakryiko 已提交
6071
int bpf_program__fd(const struct bpf_program *prog)
6072
{
6073 6074 6075
	return bpf_program__nth_fd(prog, 0);
}

6076 6077 6078 6079 6080
size_t bpf_program__size(const struct bpf_program *prog)
{
	return prog->insns_cnt * sizeof(struct bpf_insn);
}

6081 6082 6083 6084 6085 6086 6087 6088 6089
int bpf_program__set_prep(struct bpf_program *prog, int nr_instances,
			  bpf_program_prep_t prep)
{
	int *instances_fds;

	if (nr_instances <= 0 || !prep)
		return -EINVAL;

	if (prog->instances.nr > 0 || prog->instances.fds) {
6090
		pr_warn("Can't set pre-processor after loading\n");
6091 6092 6093 6094 6095
		return -EINVAL;
	}

	instances_fds = malloc(sizeof(int) * nr_instances);
	if (!instances_fds) {
6096
		pr_warn("alloc memory failed for fds\n");
6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 6107 6108
		return -ENOMEM;
	}

	/* fill all fd with -1 */
	memset(instances_fds, -1, sizeof(int) * nr_instances);

	prog->instances.nr = nr_instances;
	prog->instances.fds = instances_fds;
	prog->preprocessor = prep;
	return 0;
}

A
Andrii Nakryiko 已提交
6109
int bpf_program__nth_fd(const struct bpf_program *prog, int n)
6110 6111 6112
{
	int fd;

6113 6114 6115
	if (!prog)
		return -EINVAL;

6116
	if (n >= prog->instances.nr || n < 0) {
6117 6118
		pr_warn("Can't get the %dth fd from program %s: only %d instances\n",
			n, prog->section_name, prog->instances.nr);
6119 6120 6121 6122 6123
		return -EINVAL;
	}

	fd = prog->instances.fds[n];
	if (fd < 0) {
6124 6125
		pr_warn("%dth instance of program '%s' is invalid\n",
			n, prog->section_name);
6126 6127 6128 6129
		return -ENOENT;
	}

	return fd;
6130
}
6131

6132 6133 6134 6135 6136
enum bpf_prog_type bpf_program__get_type(struct bpf_program *prog)
{
	return prog->type;
}

6137
void bpf_program__set_type(struct bpf_program *prog, enum bpf_prog_type type)
6138 6139 6140 6141
{
	prog->type = type;
}

A
Andrii Nakryiko 已提交
6142
static bool bpf_program__is_type(const struct bpf_program *prog,
6143 6144 6145 6146 6147
				 enum bpf_prog_type type)
{
	return prog ? (prog->type == type) : false;
}

A
Andrii Nakryiko 已提交
6148 6149 6150 6151 6152 6153 6154 6155 6156 6157 6158 6159 6160
#define BPF_PROG_TYPE_FNS(NAME, TYPE)				\
int bpf_program__set_##NAME(struct bpf_program *prog)		\
{								\
	if (!prog)						\
		return -EINVAL;					\
	bpf_program__set_type(prog, TYPE);			\
	return 0;						\
}								\
								\
bool bpf_program__is_##NAME(const struct bpf_program *prog)	\
{								\
	return bpf_program__is_type(prog, TYPE);		\
}								\
6161

6162
BPF_PROG_TYPE_FNS(socket_filter, BPF_PROG_TYPE_SOCKET_FILTER);
6163
BPF_PROG_TYPE_FNS(kprobe, BPF_PROG_TYPE_KPROBE);
6164 6165
BPF_PROG_TYPE_FNS(sched_cls, BPF_PROG_TYPE_SCHED_CLS);
BPF_PROG_TYPE_FNS(sched_act, BPF_PROG_TYPE_SCHED_ACT);
6166
BPF_PROG_TYPE_FNS(tracepoint, BPF_PROG_TYPE_TRACEPOINT);
6167
BPF_PROG_TYPE_FNS(raw_tracepoint, BPF_PROG_TYPE_RAW_TRACEPOINT);
6168 6169
BPF_PROG_TYPE_FNS(xdp, BPF_PROG_TYPE_XDP);
BPF_PROG_TYPE_FNS(perf_event, BPF_PROG_TYPE_PERF_EVENT);
6170
BPF_PROG_TYPE_FNS(tracing, BPF_PROG_TYPE_TRACING);
6171
BPF_PROG_TYPE_FNS(struct_ops, BPF_PROG_TYPE_STRUCT_OPS);
6172
BPF_PROG_TYPE_FNS(extension, BPF_PROG_TYPE_EXT);
6173

6174 6175 6176 6177 6178 6179
enum bpf_attach_type
bpf_program__get_expected_attach_type(struct bpf_program *prog)
{
	return prog->expected_attach_type;
}

J
John Fastabend 已提交
6180 6181
void bpf_program__set_expected_attach_type(struct bpf_program *prog,
					   enum bpf_attach_type type)
6182 6183 6184 6185
{
	prog->expected_attach_type = type;
}

6186 6187
#define BPF_PROG_SEC_IMPL(string, ptype, eatype, is_attachable, btf, atype) \
	{ string, sizeof(string) - 1, ptype, eatype, is_attachable, btf, atype }
6188

6189
/* Programs that can NOT be attached. */
6190
#define BPF_PROG_SEC(string, ptype) BPF_PROG_SEC_IMPL(string, ptype, 0, 0, 0, 0)
6191

6192 6193
/* Programs that can be attached. */
#define BPF_APROG_SEC(string, ptype, atype) \
6194
	BPF_PROG_SEC_IMPL(string, ptype, 0, 1, 0, atype)
6195

6196 6197
/* Programs that must specify expected attach type at load time. */
#define BPF_EAPROG_SEC(string, ptype, eatype) \
6198 6199 6200
	BPF_PROG_SEC_IMPL(string, ptype, eatype, 1, 0, eatype)

/* Programs that use BTF to identify attach point */
6201 6202
#define BPF_PROG_BTF(string, ptype, eatype) \
	BPF_PROG_SEC_IMPL(string, ptype, eatype, 0, 1, 0)
6203 6204 6205 6206 6207

/* Programs that can be attached but attach type can't be identified by section
 * name. Kept for backward compatibility.
 */
#define BPF_APROG_COMPAT(string, ptype) BPF_PROG_SEC(string, ptype)
6208

6209 6210 6211 6212 6213 6214 6215 6216 6217 6218 6219 6220 6221 6222 6223 6224 6225 6226 6227 6228 6229 6230
#define SEC_DEF(sec_pfx, ptype, ...) {					    \
	.sec = sec_pfx,							    \
	.len = sizeof(sec_pfx) - 1,					    \
	.prog_type = BPF_PROG_TYPE_##ptype,				    \
	__VA_ARGS__							    \
}

struct bpf_sec_def;

typedef struct bpf_link *(*attach_fn_t)(const struct bpf_sec_def *sec,
					struct bpf_program *prog);

static struct bpf_link *attach_kprobe(const struct bpf_sec_def *sec,
				      struct bpf_program *prog);
static struct bpf_link *attach_tp(const struct bpf_sec_def *sec,
				  struct bpf_program *prog);
static struct bpf_link *attach_raw_tp(const struct bpf_sec_def *sec,
				      struct bpf_program *prog);
static struct bpf_link *attach_trace(const struct bpf_sec_def *sec,
				     struct bpf_program *prog);

struct bpf_sec_def {
6231 6232 6233
	const char *sec;
	size_t len;
	enum bpf_prog_type prog_type;
6234
	enum bpf_attach_type expected_attach_type;
6235 6236
	bool is_attachable;
	bool is_attach_btf;
6237
	enum bpf_attach_type attach_type;
6238 6239 6240 6241
	attach_fn_t attach_fn;
};

static const struct bpf_sec_def section_defs[] = {
6242
	BPF_PROG_SEC("socket",			BPF_PROG_TYPE_SOCKET_FILTER),
6243
	BPF_PROG_SEC("sk_reuseport",		BPF_PROG_TYPE_SK_REUSEPORT),
6244 6245
	SEC_DEF("kprobe/", KPROBE,
		.attach_fn = attach_kprobe),
6246
	BPF_PROG_SEC("uprobe/",			BPF_PROG_TYPE_KPROBE),
6247 6248
	SEC_DEF("kretprobe/", KPROBE,
		.attach_fn = attach_kprobe),
6249
	BPF_PROG_SEC("uretprobe/",		BPF_PROG_TYPE_KPROBE),
6250 6251
	BPF_PROG_SEC("classifier",		BPF_PROG_TYPE_SCHED_CLS),
	BPF_PROG_SEC("action",			BPF_PROG_TYPE_SCHED_ACT),
6252 6253 6254 6255 6256 6257 6258 6259 6260 6261 6262 6263 6264 6265 6266 6267 6268 6269 6270 6271
	SEC_DEF("tracepoint/", TRACEPOINT,
		.attach_fn = attach_tp),
	SEC_DEF("tp/", TRACEPOINT,
		.attach_fn = attach_tp),
	SEC_DEF("raw_tracepoint/", RAW_TRACEPOINT,
		.attach_fn = attach_raw_tp),
	SEC_DEF("raw_tp/", RAW_TRACEPOINT,
		.attach_fn = attach_raw_tp),
	SEC_DEF("tp_btf/", TRACING,
		.expected_attach_type = BPF_TRACE_RAW_TP,
		.is_attach_btf = true,
		.attach_fn = attach_trace),
	SEC_DEF("fentry/", TRACING,
		.expected_attach_type = BPF_TRACE_FENTRY,
		.is_attach_btf = true,
		.attach_fn = attach_trace),
	SEC_DEF("fexit/", TRACING,
		.expected_attach_type = BPF_TRACE_FEXIT,
		.is_attach_btf = true,
		.attach_fn = attach_trace),
6272 6273 6274
	SEC_DEF("freplace/", EXT,
		.is_attach_btf = true,
		.attach_fn = attach_trace),
6275 6276 6277 6278 6279 6280
	BPF_PROG_SEC("xdp",			BPF_PROG_TYPE_XDP),
	BPF_PROG_SEC("perf_event",		BPF_PROG_TYPE_PERF_EVENT),
	BPF_PROG_SEC("lwt_in",			BPF_PROG_TYPE_LWT_IN),
	BPF_PROG_SEC("lwt_out",			BPF_PROG_TYPE_LWT_OUT),
	BPF_PROG_SEC("lwt_xmit",		BPF_PROG_TYPE_LWT_XMIT),
	BPF_PROG_SEC("lwt_seg6local",		BPF_PROG_TYPE_LWT_SEG6LOCAL),
6281 6282 6283 6284
	BPF_APROG_SEC("cgroup_skb/ingress",	BPF_PROG_TYPE_CGROUP_SKB,
						BPF_CGROUP_INET_INGRESS),
	BPF_APROG_SEC("cgroup_skb/egress",	BPF_PROG_TYPE_CGROUP_SKB,
						BPF_CGROUP_INET_EGRESS),
6285 6286 6287 6288 6289 6290 6291 6292 6293 6294 6295
	BPF_APROG_COMPAT("cgroup/skb",		BPF_PROG_TYPE_CGROUP_SKB),
	BPF_APROG_SEC("cgroup/sock",		BPF_PROG_TYPE_CGROUP_SOCK,
						BPF_CGROUP_INET_SOCK_CREATE),
	BPF_EAPROG_SEC("cgroup/post_bind4",	BPF_PROG_TYPE_CGROUP_SOCK,
						BPF_CGROUP_INET4_POST_BIND),
	BPF_EAPROG_SEC("cgroup/post_bind6",	BPF_PROG_TYPE_CGROUP_SOCK,
						BPF_CGROUP_INET6_POST_BIND),
	BPF_APROG_SEC("cgroup/dev",		BPF_PROG_TYPE_CGROUP_DEVICE,
						BPF_CGROUP_DEVICE),
	BPF_APROG_SEC("sockops",		BPF_PROG_TYPE_SOCK_OPS,
						BPF_CGROUP_SOCK_OPS),
6296 6297 6298 6299
	BPF_APROG_SEC("sk_skb/stream_parser",	BPF_PROG_TYPE_SK_SKB,
						BPF_SK_SKB_STREAM_PARSER),
	BPF_APROG_SEC("sk_skb/stream_verdict",	BPF_PROG_TYPE_SK_SKB,
						BPF_SK_SKB_STREAM_VERDICT),
6300 6301 6302 6303 6304 6305 6306 6307 6308 6309 6310 6311 6312 6313 6314 6315 6316 6317 6318
	BPF_APROG_COMPAT("sk_skb",		BPF_PROG_TYPE_SK_SKB),
	BPF_APROG_SEC("sk_msg",			BPF_PROG_TYPE_SK_MSG,
						BPF_SK_MSG_VERDICT),
	BPF_APROG_SEC("lirc_mode2",		BPF_PROG_TYPE_LIRC_MODE2,
						BPF_LIRC_MODE2),
	BPF_APROG_SEC("flow_dissector",		BPF_PROG_TYPE_FLOW_DISSECTOR,
						BPF_FLOW_DISSECTOR),
	BPF_EAPROG_SEC("cgroup/bind4",		BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
						BPF_CGROUP_INET4_BIND),
	BPF_EAPROG_SEC("cgroup/bind6",		BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
						BPF_CGROUP_INET6_BIND),
	BPF_EAPROG_SEC("cgroup/connect4",	BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
						BPF_CGROUP_INET4_CONNECT),
	BPF_EAPROG_SEC("cgroup/connect6",	BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
						BPF_CGROUP_INET6_CONNECT),
	BPF_EAPROG_SEC("cgroup/sendmsg4",	BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
						BPF_CGROUP_UDP4_SENDMSG),
	BPF_EAPROG_SEC("cgroup/sendmsg6",	BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
						BPF_CGROUP_UDP6_SENDMSG),
6319 6320 6321 6322
	BPF_EAPROG_SEC("cgroup/recvmsg4",	BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
						BPF_CGROUP_UDP4_RECVMSG),
	BPF_EAPROG_SEC("cgroup/recvmsg6",	BPF_PROG_TYPE_CGROUP_SOCK_ADDR,
						BPF_CGROUP_UDP6_RECVMSG),
A
Andrey Ignatov 已提交
6323 6324
	BPF_EAPROG_SEC("cgroup/sysctl",		BPF_PROG_TYPE_CGROUP_SYSCTL,
						BPF_CGROUP_SYSCTL),
6325 6326 6327 6328
	BPF_EAPROG_SEC("cgroup/getsockopt",	BPF_PROG_TYPE_CGROUP_SOCKOPT,
						BPF_CGROUP_GETSOCKOPT),
	BPF_EAPROG_SEC("cgroup/setsockopt",	BPF_PROG_TYPE_CGROUP_SOCKOPT,
						BPF_CGROUP_SETSOCKOPT),
6329
	BPF_PROG_SEC("struct_ops",		BPF_PROG_TYPE_STRUCT_OPS),
6330
};
6331

6332
#undef BPF_PROG_SEC_IMPL
6333
#undef BPF_PROG_SEC
6334 6335 6336
#undef BPF_APROG_SEC
#undef BPF_EAPROG_SEC
#undef BPF_APROG_COMPAT
6337
#undef SEC_DEF
6338

6339 6340
#define MAX_TYPE_NAME_SIZE 32

6341 6342 6343 6344 6345 6346 6347 6348 6349 6350 6351 6352 6353
static const struct bpf_sec_def *find_sec_def(const char *sec_name)
{
	int i, n = ARRAY_SIZE(section_defs);

	for (i = 0; i < n; i++) {
		if (strncmp(sec_name,
			    section_defs[i].sec, section_defs[i].len))
			continue;
		return &section_defs[i];
	}
	return NULL;
}

6354 6355
static char *libbpf_get_type_names(bool attach_type)
{
6356
	int i, len = ARRAY_SIZE(section_defs) * MAX_TYPE_NAME_SIZE;
6357 6358 6359 6360 6361 6362 6363 6364
	char *buf;

	buf = malloc(len);
	if (!buf)
		return NULL;

	buf[0] = '\0';
	/* Forge string buf with all available names */
6365 6366
	for (i = 0; i < ARRAY_SIZE(section_defs); i++) {
		if (attach_type && !section_defs[i].is_attachable)
6367 6368
			continue;

6369
		if (strlen(buf) + strlen(section_defs[i].sec) + 2 > len) {
6370 6371 6372 6373
			free(buf);
			return NULL;
		}
		strcat(buf, " ");
6374
		strcat(buf, section_defs[i].sec);
6375 6376 6377 6378 6379
	}

	return buf;
}

6380 6381
int libbpf_prog_type_by_name(const char *name, enum bpf_prog_type *prog_type,
			     enum bpf_attach_type *expected_attach_type)
6382
{
6383
	const struct bpf_sec_def *sec_def;
6384
	char *type_names;
6385

6386 6387
	if (!name)
		return -EINVAL;
6388

6389 6390 6391 6392
	sec_def = find_sec_def(name);
	if (sec_def) {
		*prog_type = sec_def->prog_type;
		*expected_attach_type = sec_def->expected_attach_type;
6393 6394
		return 0;
	}
6395

6396
	pr_debug("failed to guess program type from ELF section '%s'\n", name);
6397 6398
	type_names = libbpf_get_type_names(false);
	if (type_names != NULL) {
6399
		pr_debug("supported section(type) names are:%s\n", type_names);
6400 6401 6402
		free(type_names);
	}

6403
	return -ESRCH;
6404
}
6405

6406 6407 6408 6409 6410 6411 6412 6413 6414 6415 6416 6417 6418 6419 6420 6421 6422 6423 6424 6425 6426 6427 6428 6429 6430 6431 6432 6433 6434 6435 6436 6437
static struct bpf_map *find_struct_ops_map_by_offset(struct bpf_object *obj,
						     size_t offset)
{
	struct bpf_map *map;
	size_t i;

	for (i = 0; i < obj->nr_maps; i++) {
		map = &obj->maps[i];
		if (!bpf_map__is_struct_ops(map))
			continue;
		if (map->sec_offset <= offset &&
		    offset - map->sec_offset < map->def.value_size)
			return map;
	}

	return NULL;
}

/* Collect the reloc from ELF and populate the st_ops->progs[] */
static int bpf_object__collect_struct_ops_map_reloc(struct bpf_object *obj,
						    GElf_Shdr *shdr,
						    Elf_Data *data)
{
	const struct btf_member *member;
	struct bpf_struct_ops *st_ops;
	struct bpf_program *prog;
	unsigned int shdr_idx;
	const struct btf *btf;
	struct bpf_map *map;
	Elf_Data *symbols;
	unsigned int moff;
	const char *name;
6438
	__u32 member_idx;
6439 6440 6441 6442 6443 6444 6445 6446 6447 6448 6449 6450 6451 6452 6453 6454 6455 6456 6457 6458 6459 6460 6461 6462 6463 6464 6465 6466 6467 6468 6469 6470 6471 6472 6473 6474 6475 6476 6477 6478 6479 6480 6481 6482 6483 6484 6485 6486 6487 6488 6489 6490 6491 6492 6493 6494 6495 6496 6497 6498 6499 6500 6501 6502 6503 6504 6505 6506 6507 6508 6509 6510 6511 6512 6513 6514 6515 6516 6517 6518 6519 6520 6521 6522 6523 6524 6525 6526 6527 6528 6529 6530 6531 6532 6533 6534 6535
	GElf_Sym sym;
	GElf_Rel rel;
	int i, nrels;

	symbols = obj->efile.symbols;
	btf = obj->btf;
	nrels = shdr->sh_size / shdr->sh_entsize;
	for (i = 0; i < nrels; i++) {
		if (!gelf_getrel(data, i, &rel)) {
			pr_warn("struct_ops reloc: failed to get %d reloc\n", i);
			return -LIBBPF_ERRNO__FORMAT;
		}

		if (!gelf_getsym(symbols, GELF_R_SYM(rel.r_info), &sym)) {
			pr_warn("struct_ops reloc: symbol %zx not found\n",
				(size_t)GELF_R_SYM(rel.r_info));
			return -LIBBPF_ERRNO__FORMAT;
		}

		name = elf_strptr(obj->efile.elf, obj->efile.strtabidx,
				  sym.st_name) ? : "<?>";
		map = find_struct_ops_map_by_offset(obj, rel.r_offset);
		if (!map) {
			pr_warn("struct_ops reloc: cannot find map at rel.r_offset %zu\n",
				(size_t)rel.r_offset);
			return -EINVAL;
		}

		moff = rel.r_offset - map->sec_offset;
		shdr_idx = sym.st_shndx;
		st_ops = map->st_ops;
		pr_debug("struct_ops reloc %s: for %lld value %lld shdr_idx %u rel.r_offset %zu map->sec_offset %zu name %d (\'%s\')\n",
			 map->name,
			 (long long)(rel.r_info >> 32),
			 (long long)sym.st_value,
			 shdr_idx, (size_t)rel.r_offset,
			 map->sec_offset, sym.st_name, name);

		if (shdr_idx >= SHN_LORESERVE) {
			pr_warn("struct_ops reloc %s: rel.r_offset %zu shdr_idx %u unsupported non-static function\n",
				map->name, (size_t)rel.r_offset, shdr_idx);
			return -LIBBPF_ERRNO__RELOC;
		}

		member = find_member_by_offset(st_ops->type, moff * 8);
		if (!member) {
			pr_warn("struct_ops reloc %s: cannot find member at moff %u\n",
				map->name, moff);
			return -EINVAL;
		}
		member_idx = member - btf_members(st_ops->type);
		name = btf__name_by_offset(btf, member->name_off);

		if (!resolve_func_ptr(btf, member->type, NULL)) {
			pr_warn("struct_ops reloc %s: cannot relocate non func ptr %s\n",
				map->name, name);
			return -EINVAL;
		}

		prog = bpf_object__find_prog_by_idx(obj, shdr_idx);
		if (!prog) {
			pr_warn("struct_ops reloc %s: cannot find prog at shdr_idx %u to relocate func ptr %s\n",
				map->name, shdr_idx, name);
			return -EINVAL;
		}

		if (prog->type == BPF_PROG_TYPE_UNSPEC) {
			const struct bpf_sec_def *sec_def;

			sec_def = find_sec_def(prog->section_name);
			if (sec_def &&
			    sec_def->prog_type != BPF_PROG_TYPE_STRUCT_OPS) {
				/* for pr_warn */
				prog->type = sec_def->prog_type;
				goto invalid_prog;
			}

			prog->type = BPF_PROG_TYPE_STRUCT_OPS;
			prog->attach_btf_id = st_ops->type_id;
			prog->expected_attach_type = member_idx;
		} else if (prog->type != BPF_PROG_TYPE_STRUCT_OPS ||
			   prog->attach_btf_id != st_ops->type_id ||
			   prog->expected_attach_type != member_idx) {
			goto invalid_prog;
		}
		st_ops->progs[member_idx] = prog;
	}

	return 0;

invalid_prog:
	pr_warn("struct_ops reloc %s: cannot use prog %s in sec %s with type %u attach_btf_id %u expected_attach_type %u for func ptr %s\n",
		map->name, prog->name, prog->section_name, prog->type,
		prog->attach_btf_id, prog->expected_attach_type, name);
	return -EINVAL;
}

6536 6537 6538 6539 6540 6541 6542 6543 6544 6545 6546 6547 6548 6549 6550 6551 6552 6553 6554 6555 6556 6557 6558 6559 6560 6561 6562 6563 6564 6565 6566 6567 6568 6569
#define BTF_TRACE_PREFIX "btf_trace_"
#define BTF_MAX_NAME_SIZE 128

static int find_btf_by_prefix_kind(const struct btf *btf, const char *prefix,
				   const char *name, __u32 kind)
{
	char btf_type_name[BTF_MAX_NAME_SIZE];
	int ret;

	ret = snprintf(btf_type_name, sizeof(btf_type_name),
		       "%s%s", prefix, name);
	/* snprintf returns the number of characters written excluding the
	 * the terminating null. So, if >= BTF_MAX_NAME_SIZE are written, it
	 * indicates truncation.
	 */
	if (ret < 0 || ret >= sizeof(btf_type_name))
		return -ENAMETOOLONG;
	return btf__find_by_name_kind(btf, btf_type_name, kind);
}

static inline int __find_vmlinux_btf_id(struct btf *btf, const char *name,
					enum bpf_attach_type attach_type)
{
	int err;

	if (attach_type == BPF_TRACE_RAW_TP)
		err = find_btf_by_prefix_kind(btf, BTF_TRACE_PREFIX, name,
					      BTF_KIND_TYPEDEF);
	else
		err = btf__find_by_name_kind(btf, name, BTF_KIND_FUNC);

	return err;
}

6570 6571
int libbpf_find_vmlinux_btf_id(const char *name,
			       enum bpf_attach_type attach_type)
6572
{
6573
	struct btf *btf;
6574

6575
	btf = libbpf_find_kernel_btf();
6576 6577 6578 6579 6580
	if (IS_ERR(btf)) {
		pr_warn("vmlinux BTF is not found\n");
		return -EINVAL;
	}

6581
	return __find_vmlinux_btf_id(btf, name, attach_type);
6582 6583
}

6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 6598 6599 6600 6601 6602 6603 6604 6605 6606 6607 6608 6609 6610 6611 6612 6613 6614 6615 6616
static int libbpf_find_prog_btf_id(const char *name, __u32 attach_prog_fd)
{
	struct bpf_prog_info_linear *info_linear;
	struct bpf_prog_info *info;
	struct btf *btf = NULL;
	int err = -EINVAL;

	info_linear = bpf_program__get_prog_info_linear(attach_prog_fd, 0);
	if (IS_ERR_OR_NULL(info_linear)) {
		pr_warn("failed get_prog_info_linear for FD %d\n",
			attach_prog_fd);
		return -EINVAL;
	}
	info = &info_linear->info;
	if (!info->btf_id) {
		pr_warn("The target program doesn't have BTF\n");
		goto out;
	}
	if (btf__get_from_id(info->btf_id, &btf)) {
		pr_warn("Failed to get BTF of the program\n");
		goto out;
	}
	err = btf__find_by_name_kind(btf, name, BTF_KIND_FUNC);
	btf__free(btf);
	if (err <= 0) {
		pr_warn("%s is not found in prog's BTF\n", name);
		goto out;
	}
out:
	free(info_linear);
	return err;
}

6617
static int libbpf_find_attach_btf_id(struct bpf_program *prog)
6618
{
6619 6620 6621
	enum bpf_attach_type attach_type = prog->expected_attach_type;
	__u32 attach_prog_fd = prog->attach_prog_fd;
	const char *name = prog->section_name;
6622 6623
	int i, err;

6624
	if (!name)
6625
		return -EINVAL;
6626

6627 6628
	for (i = 0; i < ARRAY_SIZE(section_defs); i++) {
		if (!section_defs[i].is_attach_btf)
6629
			continue;
6630
		if (strncmp(name, section_defs[i].sec, section_defs[i].len))
6631
			continue;
6632
		if (attach_prog_fd)
6633
			err = libbpf_find_prog_btf_id(name + section_defs[i].len,
6634 6635
						      attach_prog_fd);
		else
6636 6637 6638
			err = __find_vmlinux_btf_id(prog->obj->btf_vmlinux,
						    name + section_defs[i].len,
						    attach_type);
6639 6640 6641
		if (err <= 0)
			pr_warn("%s is not found in vmlinux BTF\n", name);
		return err;
6642 6643
	}
	pr_warn("failed to identify btf_id based on ELF section name '%s'\n", name);
6644
	return -ESRCH;
6645 6646
}

6647 6648 6649
int libbpf_attach_type_by_name(const char *name,
			       enum bpf_attach_type *attach_type)
{
6650
	char *type_names;
6651 6652 6653 6654 6655
	int i;

	if (!name)
		return -EINVAL;

6656 6657
	for (i = 0; i < ARRAY_SIZE(section_defs); i++) {
		if (strncmp(name, section_defs[i].sec, section_defs[i].len))
6658
			continue;
6659
		if (!section_defs[i].is_attachable)
6660
			return -EINVAL;
6661
		*attach_type = section_defs[i].attach_type;
6662 6663
		return 0;
	}
6664
	pr_debug("failed to guess attach type based on ELF section name '%s'\n", name);
6665 6666
	type_names = libbpf_get_type_names(true);
	if (type_names != NULL) {
6667
		pr_debug("attachable section(type) names are:%s\n", type_names);
6668 6669 6670
		free(type_names);
	}

6671 6672 6673
	return -EINVAL;
}

A
Andrii Nakryiko 已提交
6674
int bpf_map__fd(const struct bpf_map *map)
6675
{
6676
	return map ? map->fd : -EINVAL;
6677 6678
}

A
Andrii Nakryiko 已提交
6679
const struct bpf_map_def *bpf_map__def(const struct bpf_map *map)
6680
{
6681
	return map ? &map->def : ERR_PTR(-EINVAL);
6682 6683
}

A
Andrii Nakryiko 已提交
6684
const char *bpf_map__name(const struct bpf_map *map)
6685
{
6686
	return map ? map->name : NULL;
6687 6688
}

6689
__u32 bpf_map__btf_key_type_id(const struct bpf_map *map)
6690
{
6691
	return map ? map->btf_key_type_id : 0;
6692 6693
}

6694
__u32 bpf_map__btf_value_type_id(const struct bpf_map *map)
6695
{
6696
	return map ? map->btf_value_type_id : 0;
6697 6698
}

6699 6700
int bpf_map__set_priv(struct bpf_map *map, void *priv,
		     bpf_map_clear_priv_t clear_priv)
6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 6712 6713 6714
{
	if (!map)
		return -EINVAL;

	if (map->priv) {
		if (map->clear_priv)
			map->clear_priv(map, map->priv);
	}

	map->priv = priv;
	map->clear_priv = clear_priv;
	return 0;
}

A
Andrii Nakryiko 已提交
6715
void *bpf_map__priv(const struct bpf_map *map)
6716
{
6717
	return map ? map->priv : ERR_PTR(-EINVAL);
6718 6719
}

A
Andrii Nakryiko 已提交
6720
bool bpf_map__is_offload_neutral(const struct bpf_map *map)
6721 6722 6723 6724
{
	return map->def.type == BPF_MAP_TYPE_PERF_EVENT_ARRAY;
}

A
Andrii Nakryiko 已提交
6725
bool bpf_map__is_internal(const struct bpf_map *map)
6726 6727 6728 6729
{
	return map->libbpf_type != LIBBPF_MAP_UNSPEC;
}

6730 6731 6732 6733 6734
void bpf_map__set_ifindex(struct bpf_map *map, __u32 ifindex)
{
	map->map_ifindex = ifindex;
}

6735 6736 6737
int bpf_map__set_inner_map_fd(struct bpf_map *map, int fd)
{
	if (!bpf_map_type__is_map_in_map(map->def.type)) {
6738
		pr_warn("error: unsupported map type\n");
6739 6740 6741
		return -EINVAL;
	}
	if (map->inner_map_fd != -1) {
6742
		pr_warn("error: inner_map_fd already specified\n");
6743 6744 6745 6746 6747 6748
		return -EINVAL;
	}
	map->inner_map_fd = fd;
	return 0;
}

6749
static struct bpf_map *
A
Andrii Nakryiko 已提交
6750
__bpf_map__iter(const struct bpf_map *m, const struct bpf_object *obj, int i)
6751
{
6752
	ssize_t idx;
6753 6754 6755 6756 6757 6758 6759 6760
	struct bpf_map *s, *e;

	if (!obj || !obj->maps)
		return NULL;

	s = obj->maps;
	e = obj->maps + obj->nr_maps;

6761
	if ((m < s) || (m >= e)) {
6762 6763
		pr_warn("error in %s: map handler doesn't belong to object\n",
			 __func__);
6764 6765 6766
		return NULL;
	}

6767 6768
	idx = (m - obj->maps) + i;
	if (idx >= obj->nr_maps || idx < 0)
6769 6770 6771
		return NULL;
	return &obj->maps[idx];
}
6772

6773
struct bpf_map *
A
Andrii Nakryiko 已提交
6774
bpf_map__next(const struct bpf_map *prev, const struct bpf_object *obj)
6775 6776 6777 6778 6779 6780 6781 6782
{
	if (prev == NULL)
		return obj->maps;

	return __bpf_map__iter(prev, obj, 1);
}

struct bpf_map *
A
Andrii Nakryiko 已提交
6783
bpf_map__prev(const struct bpf_map *next, const struct bpf_object *obj)
6784 6785 6786 6787 6788 6789 6790 6791 6792 6793
{
	if (next == NULL) {
		if (!obj->nr_maps)
			return NULL;
		return obj->maps + obj->nr_maps - 1;
	}

	return __bpf_map__iter(next, obj, -1);
}

6794
struct bpf_map *
A
Andrii Nakryiko 已提交
6795
bpf_object__find_map_by_name(const struct bpf_object *obj, const char *name)
6796 6797 6798
{
	struct bpf_map *pos;

6799
	bpf_object__for_each_map(pos, obj) {
6800
		if (pos->name && !strcmp(pos->name, name))
6801 6802 6803 6804
			return pos;
	}
	return NULL;
}
6805

6806
int
A
Andrii Nakryiko 已提交
6807
bpf_object__find_map_fd_by_name(const struct bpf_object *obj, const char *name)
6808 6809 6810 6811
{
	return bpf_map__fd(bpf_object__find_map_by_name(obj, name));
}

6812 6813 6814
struct bpf_map *
bpf_object__find_map_by_offset(struct bpf_object *obj, size_t offset)
{
6815
	return ERR_PTR(-ENOTSUP);
6816
}
6817 6818 6819

long libbpf_get_error(const void *ptr)
{
6820
	return PTR_ERR_OR_ZERO(ptr);
6821
}
6822 6823 6824

int bpf_prog_load(const char *file, enum bpf_prog_type type,
		  struct bpf_object **pobj, int *prog_fd)
6825 6826 6827 6828 6829 6830 6831 6832 6833 6834 6835 6836 6837
{
	struct bpf_prog_load_attr attr;

	memset(&attr, 0, sizeof(struct bpf_prog_load_attr));
	attr.file = file;
	attr.prog_type = type;
	attr.expected_attach_type = 0;

	return bpf_prog_load_xattr(&attr, pobj, prog_fd);
}

int bpf_prog_load_xattr(const struct bpf_prog_load_attr *attr,
			struct bpf_object **pobj, int *prog_fd)
6838
{
6839
	struct bpf_object_open_attr open_attr = {};
6840
	struct bpf_program *prog, *first_prog = NULL;
6841
	struct bpf_object *obj;
6842
	struct bpf_map *map;
6843 6844
	int err;

6845 6846
	if (!attr)
		return -EINVAL;
6847 6848
	if (!attr->file)
		return -EINVAL;
6849

6850 6851 6852
	open_attr.file = attr->file;
	open_attr.prog_type = attr->prog_type;

6853
	obj = bpf_object__open_xattr(&open_attr);
6854
	if (IS_ERR_OR_NULL(obj))
6855 6856
		return -ENOENT;

6857
	bpf_object__for_each_program(prog, obj) {
6858
		enum bpf_attach_type attach_type = attr->expected_attach_type;
6859
		/*
6860 6861 6862
		 * to preserve backwards compatibility, bpf_prog_load treats
		 * attr->prog_type, if specified, as an override to whatever
		 * bpf_object__open guessed
6863
		 */
6864 6865 6866 6867 6868 6869 6870 6871 6872 6873 6874 6875
		if (attr->prog_type != BPF_PROG_TYPE_UNSPEC) {
			bpf_program__set_type(prog, attr->prog_type);
			bpf_program__set_expected_attach_type(prog,
							      attach_type);
		}
		if (bpf_program__get_type(prog) == BPF_PROG_TYPE_UNSPEC) {
			/*
			 * we haven't guessed from section name and user
			 * didn't provide a fallback type, too bad...
			 */
			bpf_object__close(obj);
			return -EINVAL;
6876
		}
6877

6878
		prog->prog_ifindex = attr->ifindex;
6879
		prog->log_level = attr->log_level;
6880
		prog->prog_flags = attr->prog_flags;
6881
		if (!first_prog)
6882 6883 6884
			first_prog = prog;
	}

6885
	bpf_object__for_each_map(map, obj) {
6886 6887
		if (!bpf_map__is_offload_neutral(map))
			map->map_ifindex = attr->ifindex;
6888 6889
	}

6890
	if (!first_prog) {
6891
		pr_warn("object file doesn't contain bpf program\n");
6892 6893
		bpf_object__close(obj);
		return -ENOENT;
6894 6895
	}

6896 6897 6898 6899 6900 6901 6902
	err = bpf_object__load(obj);
	if (err) {
		bpf_object__close(obj);
		return -EINVAL;
	}

	*pobj = obj;
6903
	*prog_fd = bpf_program__fd(first_prog);
6904 6905
	return 0;
}
6906

6907
struct bpf_link {
6908
	int (*detach)(struct bpf_link *link);
6909
	int (*destroy)(struct bpf_link *link);
6910
	bool disconnected;
6911 6912
};

6913 6914 6915 6916 6917 6918 6919 6920 6921 6922 6923 6924 6925 6926 6927
/* Release "ownership" of underlying BPF resource (typically, BPF program
 * attached to some BPF hook, e.g., tracepoint, kprobe, etc). Disconnected
 * link, when destructed through bpf_link__destroy() call won't attempt to
 * detach/unregisted that BPF resource. This is useful in situations where,
 * say, attached BPF program has to outlive userspace program that attached it
 * in the system. Depending on type of BPF program, though, there might be
 * additional steps (like pinning BPF program in BPF FS) necessary to ensure
 * exit of userspace program doesn't trigger automatic detachment and clean up
 * inside the kernel.
 */
void bpf_link__disconnect(struct bpf_link *link)
{
	link->disconnected = true;
}

6928 6929
int bpf_link__destroy(struct bpf_link *link)
{
6930
	int err = 0;
6931 6932 6933 6934

	if (!link)
		return 0;

6935 6936 6937 6938
	if (!link->disconnected && link->detach)
		err = link->detach(link);
	if (link->destroy)
		link->destroy(link);
6939 6940 6941 6942 6943
	free(link);

	return err;
}

6944 6945 6946 6947 6948
struct bpf_link_fd {
	struct bpf_link link; /* has to be at the top of struct */
	int fd; /* hook FD */
};

6949
static int bpf_link__detach_perf_event(struct bpf_link *link)
6950 6951 6952 6953 6954 6955 6956 6957 6958 6959 6960 6961 6962 6963 6964 6965 6966 6967 6968 6969
{
	struct bpf_link_fd *l = (void *)link;
	int err;

	err = ioctl(l->fd, PERF_EVENT_IOC_DISABLE, 0);
	if (err)
		err = -errno;

	close(l->fd);
	return err;
}

struct bpf_link *bpf_program__attach_perf_event(struct bpf_program *prog,
						int pfd)
{
	char errmsg[STRERR_BUFSIZE];
	struct bpf_link_fd *link;
	int prog_fd, err;

	if (pfd < 0) {
6970 6971
		pr_warn("program '%s': invalid perf event FD %d\n",
			bpf_program__title(prog, false), pfd);
6972 6973 6974 6975
		return ERR_PTR(-EINVAL);
	}
	prog_fd = bpf_program__fd(prog);
	if (prog_fd < 0) {
6976 6977
		pr_warn("program '%s': can't attach BPF program w/o FD (did you load it?)\n",
			bpf_program__title(prog, false));
6978 6979 6980
		return ERR_PTR(-EINVAL);
	}

6981
	link = calloc(1, sizeof(*link));
6982 6983
	if (!link)
		return ERR_PTR(-ENOMEM);
6984
	link->link.detach = &bpf_link__detach_perf_event;
6985 6986 6987 6988 6989
	link->fd = pfd;

	if (ioctl(pfd, PERF_EVENT_IOC_SET_BPF, prog_fd) < 0) {
		err = -errno;
		free(link);
6990 6991
		pr_warn("program '%s': failed to attach to pfd %d: %s\n",
			bpf_program__title(prog, false), pfd,
6992 6993 6994 6995 6996 6997
			   libbpf_strerror_r(err, errmsg, sizeof(errmsg)));
		return ERR_PTR(err);
	}
	if (ioctl(pfd, PERF_EVENT_IOC_ENABLE, 0) < 0) {
		err = -errno;
		free(link);
6998 6999
		pr_warn("program '%s': failed to enable pfd %d: %s\n",
			bpf_program__title(prog, false), pfd,
7000 7001 7002 7003 7004 7005
			   libbpf_strerror_r(err, errmsg, sizeof(errmsg)));
		return ERR_PTR(err);
	}
	return (struct bpf_link *)link;
}

7006 7007 7008 7009 7010 7011 7012 7013 7014 7015 7016 7017 7018 7019 7020 7021 7022 7023 7024 7025 7026 7027 7028 7029 7030 7031 7032 7033 7034 7035 7036 7037 7038 7039 7040 7041 7042 7043 7044 7045 7046 7047 7048 7049 7050 7051 7052 7053 7054 7055 7056 7057 7058 7059 7060 7061 7062 7063 7064 7065 7066 7067 7068 7069 7070 7071 7072 7073
/*
 * this function is expected to parse integer in the range of [0, 2^31-1] from
 * given file using scanf format string fmt. If actual parsed value is
 * negative, the result might be indistinguishable from error
 */
static int parse_uint_from_file(const char *file, const char *fmt)
{
	char buf[STRERR_BUFSIZE];
	int err, ret;
	FILE *f;

	f = fopen(file, "r");
	if (!f) {
		err = -errno;
		pr_debug("failed to open '%s': %s\n", file,
			 libbpf_strerror_r(err, buf, sizeof(buf)));
		return err;
	}
	err = fscanf(f, fmt, &ret);
	if (err != 1) {
		err = err == EOF ? -EIO : -errno;
		pr_debug("failed to parse '%s': %s\n", file,
			libbpf_strerror_r(err, buf, sizeof(buf)));
		fclose(f);
		return err;
	}
	fclose(f);
	return ret;
}

static int determine_kprobe_perf_type(void)
{
	const char *file = "/sys/bus/event_source/devices/kprobe/type";

	return parse_uint_from_file(file, "%d\n");
}

static int determine_uprobe_perf_type(void)
{
	const char *file = "/sys/bus/event_source/devices/uprobe/type";

	return parse_uint_from_file(file, "%d\n");
}

static int determine_kprobe_retprobe_bit(void)
{
	const char *file = "/sys/bus/event_source/devices/kprobe/format/retprobe";

	return parse_uint_from_file(file, "config:%d\n");
}

static int determine_uprobe_retprobe_bit(void)
{
	const char *file = "/sys/bus/event_source/devices/uprobe/format/retprobe";

	return parse_uint_from_file(file, "config:%d\n");
}

static int perf_event_open_probe(bool uprobe, bool retprobe, const char *name,
				 uint64_t offset, int pid)
{
	struct perf_event_attr attr = {};
	char errmsg[STRERR_BUFSIZE];
	int type, pfd, err;

	type = uprobe ? determine_uprobe_perf_type()
		      : determine_kprobe_perf_type();
	if (type < 0) {
7074 7075 7076
		pr_warn("failed to determine %s perf type: %s\n",
			uprobe ? "uprobe" : "kprobe",
			libbpf_strerror_r(type, errmsg, sizeof(errmsg)));
7077 7078 7079 7080 7081 7082 7083
		return type;
	}
	if (retprobe) {
		int bit = uprobe ? determine_uprobe_retprobe_bit()
				 : determine_kprobe_retprobe_bit();

		if (bit < 0) {
7084 7085 7086
			pr_warn("failed to determine %s retprobe bit: %s\n",
				uprobe ? "uprobe" : "kprobe",
				libbpf_strerror_r(bit, errmsg, sizeof(errmsg)));
7087 7088 7089 7090 7091 7092
			return bit;
		}
		attr.config |= 1 << bit;
	}
	attr.size = sizeof(attr);
	attr.type = type;
7093 7094
	attr.config1 = ptr_to_u64(name); /* kprobe_func or uprobe_path */
	attr.config2 = offset;		 /* kprobe_addr or probe_offset */
7095 7096 7097 7098 7099 7100 7101 7102

	/* pid filter is meaningful only for uprobes */
	pfd = syscall(__NR_perf_event_open, &attr,
		      pid < 0 ? -1 : pid /* pid */,
		      pid == -1 ? 0 : -1 /* cpu */,
		      -1 /* group_fd */, PERF_FLAG_FD_CLOEXEC);
	if (pfd < 0) {
		err = -errno;
7103 7104 7105
		pr_warn("%s perf_event_open() failed: %s\n",
			uprobe ? "uprobe" : "kprobe",
			libbpf_strerror_r(err, errmsg, sizeof(errmsg)));
7106 7107 7108 7109 7110 7111 7112 7113 7114 7115 7116 7117 7118 7119 7120 7121
		return err;
	}
	return pfd;
}

struct bpf_link *bpf_program__attach_kprobe(struct bpf_program *prog,
					    bool retprobe,
					    const char *func_name)
{
	char errmsg[STRERR_BUFSIZE];
	struct bpf_link *link;
	int pfd, err;

	pfd = perf_event_open_probe(false /* uprobe */, retprobe, func_name,
				    0 /* offset */, -1 /* pid */);
	if (pfd < 0) {
7122 7123 7124 7125
		pr_warn("program '%s': failed to create %s '%s' perf event: %s\n",
			bpf_program__title(prog, false),
			retprobe ? "kretprobe" : "kprobe", func_name,
			libbpf_strerror_r(pfd, errmsg, sizeof(errmsg)));
7126 7127 7128 7129 7130 7131
		return ERR_PTR(pfd);
	}
	link = bpf_program__attach_perf_event(prog, pfd);
	if (IS_ERR(link)) {
		close(pfd);
		err = PTR_ERR(link);
7132 7133 7134 7135
		pr_warn("program '%s': failed to attach to %s '%s': %s\n",
			bpf_program__title(prog, false),
			retprobe ? "kretprobe" : "kprobe", func_name,
			libbpf_strerror_r(err, errmsg, sizeof(errmsg)));
7136 7137 7138 7139 7140
		return link;
	}
	return link;
}

7141 7142 7143 7144 7145 7146 7147 7148 7149 7150 7151 7152
static struct bpf_link *attach_kprobe(const struct bpf_sec_def *sec,
				      struct bpf_program *prog)
{
	const char *func_name;
	bool retprobe;

	func_name = bpf_program__title(prog, false) + sec->len;
	retprobe = strcmp(sec->sec, "kretprobe/") == 0;

	return bpf_program__attach_kprobe(prog, retprobe, func_name);
}

7153 7154 7155 7156 7157 7158 7159 7160 7161 7162 7163 7164
struct bpf_link *bpf_program__attach_uprobe(struct bpf_program *prog,
					    bool retprobe, pid_t pid,
					    const char *binary_path,
					    size_t func_offset)
{
	char errmsg[STRERR_BUFSIZE];
	struct bpf_link *link;
	int pfd, err;

	pfd = perf_event_open_probe(true /* uprobe */, retprobe,
				    binary_path, func_offset, pid);
	if (pfd < 0) {
7165 7166 7167 7168 7169
		pr_warn("program '%s': failed to create %s '%s:0x%zx' perf event: %s\n",
			bpf_program__title(prog, false),
			retprobe ? "uretprobe" : "uprobe",
			binary_path, func_offset,
			libbpf_strerror_r(pfd, errmsg, sizeof(errmsg)));
7170 7171 7172 7173 7174 7175
		return ERR_PTR(pfd);
	}
	link = bpf_program__attach_perf_event(prog, pfd);
	if (IS_ERR(link)) {
		close(pfd);
		err = PTR_ERR(link);
7176 7177 7178 7179 7180
		pr_warn("program '%s': failed to attach to %s '%s:0x%zx': %s\n",
			bpf_program__title(prog, false),
			retprobe ? "uretprobe" : "uprobe",
			binary_path, func_offset,
			libbpf_strerror_r(err, errmsg, sizeof(errmsg)));
7181 7182 7183 7184 7185
		return link;
	}
	return link;
}

7186 7187 7188 7189 7190 7191 7192 7193 7194 7195 7196 7197 7198 7199 7200 7201 7202 7203 7204 7205 7206 7207 7208 7209 7210 7211 7212 7213
static int determine_tracepoint_id(const char *tp_category,
				   const char *tp_name)
{
	char file[PATH_MAX];
	int ret;

	ret = snprintf(file, sizeof(file),
		       "/sys/kernel/debug/tracing/events/%s/%s/id",
		       tp_category, tp_name);
	if (ret < 0)
		return -errno;
	if (ret >= sizeof(file)) {
		pr_debug("tracepoint %s/%s path is too long\n",
			 tp_category, tp_name);
		return -E2BIG;
	}
	return parse_uint_from_file(file, "%d\n");
}

static int perf_event_open_tracepoint(const char *tp_category,
				      const char *tp_name)
{
	struct perf_event_attr attr = {};
	char errmsg[STRERR_BUFSIZE];
	int tp_id, pfd, err;

	tp_id = determine_tracepoint_id(tp_category, tp_name);
	if (tp_id < 0) {
7214 7215 7216
		pr_warn("failed to determine tracepoint '%s/%s' perf event ID: %s\n",
			tp_category, tp_name,
			libbpf_strerror_r(tp_id, errmsg, sizeof(errmsg)));
7217 7218 7219 7220 7221 7222 7223 7224 7225 7226 7227
		return tp_id;
	}

	attr.type = PERF_TYPE_TRACEPOINT;
	attr.size = sizeof(attr);
	attr.config = tp_id;

	pfd = syscall(__NR_perf_event_open, &attr, -1 /* pid */, 0 /* cpu */,
		      -1 /* group_fd */, PERF_FLAG_FD_CLOEXEC);
	if (pfd < 0) {
		err = -errno;
7228 7229 7230
		pr_warn("tracepoint '%s/%s' perf_event_open() failed: %s\n",
			tp_category, tp_name,
			libbpf_strerror_r(err, errmsg, sizeof(errmsg)));
7231 7232 7233 7234 7235 7236 7237 7238 7239 7240 7241 7242 7243 7244 7245
		return err;
	}
	return pfd;
}

struct bpf_link *bpf_program__attach_tracepoint(struct bpf_program *prog,
						const char *tp_category,
						const char *tp_name)
{
	char errmsg[STRERR_BUFSIZE];
	struct bpf_link *link;
	int pfd, err;

	pfd = perf_event_open_tracepoint(tp_category, tp_name);
	if (pfd < 0) {
7246 7247 7248 7249
		pr_warn("program '%s': failed to create tracepoint '%s/%s' perf event: %s\n",
			bpf_program__title(prog, false),
			tp_category, tp_name,
			libbpf_strerror_r(pfd, errmsg, sizeof(errmsg)));
7250 7251 7252 7253 7254 7255
		return ERR_PTR(pfd);
	}
	link = bpf_program__attach_perf_event(prog, pfd);
	if (IS_ERR(link)) {
		close(pfd);
		err = PTR_ERR(link);
7256 7257 7258 7259
		pr_warn("program '%s': failed to attach to tracepoint '%s/%s': %s\n",
			bpf_program__title(prog, false),
			tp_category, tp_name,
			libbpf_strerror_r(err, errmsg, sizeof(errmsg)));
7260 7261 7262 7263 7264
		return link;
	}
	return link;
}

7265 7266 7267 7268 7269 7270 7271 7272 7273 7274 7275 7276 7277 7278 7279 7280 7281 7282 7283 7284 7285 7286 7287 7288 7289 7290
static struct bpf_link *attach_tp(const struct bpf_sec_def *sec,
				  struct bpf_program *prog)
{
	char *sec_name, *tp_cat, *tp_name;
	struct bpf_link *link;

	sec_name = strdup(bpf_program__title(prog, false));
	if (!sec_name)
		return ERR_PTR(-ENOMEM);

	/* extract "tp/<category>/<name>" */
	tp_cat = sec_name + sec->len;
	tp_name = strchr(tp_cat, '/');
	if (!tp_name) {
		link = ERR_PTR(-EINVAL);
		goto out;
	}
	*tp_name = '\0';
	tp_name++;

	link = bpf_program__attach_tracepoint(prog, tp_cat, tp_name);
out:
	free(sec_name);
	return link;
}

7291
static int bpf_link__detach_fd(struct bpf_link *link)
7292 7293 7294 7295 7296 7297 7298 7299 7300 7301 7302 7303 7304 7305 7306
{
	struct bpf_link_fd *l = (void *)link;

	return close(l->fd);
}

struct bpf_link *bpf_program__attach_raw_tracepoint(struct bpf_program *prog,
						    const char *tp_name)
{
	char errmsg[STRERR_BUFSIZE];
	struct bpf_link_fd *link;
	int prog_fd, pfd;

	prog_fd = bpf_program__fd(prog);
	if (prog_fd < 0) {
7307 7308
		pr_warn("program '%s': can't attach before loaded\n",
			bpf_program__title(prog, false));
7309 7310 7311
		return ERR_PTR(-EINVAL);
	}

7312
	link = calloc(1, sizeof(*link));
7313 7314
	if (!link)
		return ERR_PTR(-ENOMEM);
7315
	link->link.detach = &bpf_link__detach_fd;
7316 7317 7318 7319 7320

	pfd = bpf_raw_tracepoint_open(tp_name, prog_fd);
	if (pfd < 0) {
		pfd = -errno;
		free(link);
7321 7322 7323
		pr_warn("program '%s': failed to attach to raw tracepoint '%s': %s\n",
			bpf_program__title(prog, false), tp_name,
			libbpf_strerror_r(pfd, errmsg, sizeof(errmsg)));
7324 7325 7326 7327 7328 7329
		return ERR_PTR(pfd);
	}
	link->fd = pfd;
	return (struct bpf_link *)link;
}

7330 7331 7332 7333 7334 7335 7336 7337
static struct bpf_link *attach_raw_tp(const struct bpf_sec_def *sec,
				      struct bpf_program *prog)
{
	const char *tp_name = bpf_program__title(prog, false) + sec->len;

	return bpf_program__attach_raw_tracepoint(prog, tp_name);
}

7338 7339 7340 7341 7342 7343 7344 7345 7346 7347 7348 7349 7350
struct bpf_link *bpf_program__attach_trace(struct bpf_program *prog)
{
	char errmsg[STRERR_BUFSIZE];
	struct bpf_link_fd *link;
	int prog_fd, pfd;

	prog_fd = bpf_program__fd(prog);
	if (prog_fd < 0) {
		pr_warn("program '%s': can't attach before loaded\n",
			bpf_program__title(prog, false));
		return ERR_PTR(-EINVAL);
	}

7351
	link = calloc(1, sizeof(*link));
7352 7353
	if (!link)
		return ERR_PTR(-ENOMEM);
7354
	link->link.detach = &bpf_link__detach_fd;
7355 7356 7357 7358 7359 7360 7361 7362 7363 7364 7365 7366 7367 7368

	pfd = bpf_raw_tracepoint_open(NULL, prog_fd);
	if (pfd < 0) {
		pfd = -errno;
		free(link);
		pr_warn("program '%s': failed to attach to trace: %s\n",
			bpf_program__title(prog, false),
			libbpf_strerror_r(pfd, errmsg, sizeof(errmsg)));
		return ERR_PTR(pfd);
	}
	link->fd = pfd;
	return (struct bpf_link *)link;
}

7369 7370 7371 7372 7373 7374 7375 7376 7377 7378 7379 7380 7381 7382 7383 7384 7385
static struct bpf_link *attach_trace(const struct bpf_sec_def *sec,
				     struct bpf_program *prog)
{
	return bpf_program__attach_trace(prog);
}

struct bpf_link *bpf_program__attach(struct bpf_program *prog)
{
	const struct bpf_sec_def *sec_def;

	sec_def = find_sec_def(bpf_program__title(prog, false));
	if (!sec_def || !sec_def->attach_fn)
		return ERR_PTR(-ESRCH);

	return sec_def->attach_fn(sec_def, prog);
}

7386 7387 7388 7389 7390 7391 7392 7393 7394 7395 7396 7397 7398 7399 7400 7401 7402 7403 7404 7405 7406 7407 7408 7409 7410 7411 7412 7413 7414 7415 7416 7417 7418 7419 7420 7421 7422 7423 7424 7425 7426 7427 7428 7429 7430 7431 7432 7433 7434 7435 7436 7437
static int bpf_link__detach_struct_ops(struct bpf_link *link)
{
	struct bpf_link_fd *l = (void *)link;
	__u32 zero = 0;

	if (bpf_map_delete_elem(l->fd, &zero))
		return -errno;

	return 0;
}

struct bpf_link *bpf_map__attach_struct_ops(struct bpf_map *map)
{
	struct bpf_struct_ops *st_ops;
	struct bpf_link_fd *link;
	__u32 i, zero = 0;
	int err;

	if (!bpf_map__is_struct_ops(map) || map->fd == -1)
		return ERR_PTR(-EINVAL);

	link = calloc(1, sizeof(*link));
	if (!link)
		return ERR_PTR(-EINVAL);

	st_ops = map->st_ops;
	for (i = 0; i < btf_vlen(st_ops->type); i++) {
		struct bpf_program *prog = st_ops->progs[i];
		void *kern_data;
		int prog_fd;

		if (!prog)
			continue;

		prog_fd = bpf_program__fd(prog);
		kern_data = st_ops->kern_vdata + st_ops->kern_func_off[i];
		*(unsigned long *)kern_data = prog_fd;
	}

	err = bpf_map_update_elem(map->fd, &zero, st_ops->kern_vdata, 0);
	if (err) {
		err = -errno;
		free(link);
		return ERR_PTR(err);
	}

	link->link.detach = bpf_link__detach_struct_ops;
	link->fd = map->fd;

	return (struct bpf_link *)link;
}

7438
enum bpf_perf_event_ret
7439 7440 7441
bpf_perf_event_read_simple(void *mmap_mem, size_t mmap_size, size_t page_size,
			   void **copy_mem, size_t *copy_size,
			   bpf_perf_event_print_t fn, void *private_data)
7442
{
7443
	struct perf_event_mmap_page *header = mmap_mem;
7444
	__u64 data_head = ring_buffer_read_head(header);
7445
	__u64 data_tail = header->data_tail;
7446 7447 7448 7449 7450 7451 7452 7453 7454 7455 7456 7457 7458 7459 7460 7461 7462 7463 7464
	void *base = ((__u8 *)header) + page_size;
	int ret = LIBBPF_PERF_EVENT_CONT;
	struct perf_event_header *ehdr;
	size_t ehdr_size;

	while (data_head != data_tail) {
		ehdr = base + (data_tail & (mmap_size - 1));
		ehdr_size = ehdr->size;

		if (((void *)ehdr) + ehdr_size > base + mmap_size) {
			void *copy_start = ehdr;
			size_t len_first = base + mmap_size - copy_start;
			size_t len_secnd = ehdr_size - len_first;

			if (*copy_size < ehdr_size) {
				free(*copy_mem);
				*copy_mem = malloc(ehdr_size);
				if (!*copy_mem) {
					*copy_size = 0;
7465 7466 7467
					ret = LIBBPF_PERF_EVENT_ERROR;
					break;
				}
7468
				*copy_size = ehdr_size;
7469 7470
			}

7471 7472 7473
			memcpy(*copy_mem, copy_start, len_first);
			memcpy(*copy_mem + len_first, base, len_secnd);
			ehdr = *copy_mem;
7474 7475
		}

7476 7477
		ret = fn(ehdr, private_data);
		data_tail += ehdr_size;
7478 7479 7480 7481
		if (ret != LIBBPF_PERF_EVENT_CONT)
			break;
	}

7482
	ring_buffer_write_tail(header, data_tail);
7483 7484
	return ret;
}
7485

A
Andrii Nakryiko 已提交
7486 7487 7488 7489 7490 7491 7492 7493 7494 7495 7496 7497 7498 7499 7500 7501 7502 7503 7504 7505 7506 7507 7508 7509 7510 7511 7512 7513 7514 7515 7516 7517 7518 7519 7520
struct perf_buffer;

struct perf_buffer_params {
	struct perf_event_attr *attr;
	/* if event_cb is specified, it takes precendence */
	perf_buffer_event_fn event_cb;
	/* sample_cb and lost_cb are higher-level common-case callbacks */
	perf_buffer_sample_fn sample_cb;
	perf_buffer_lost_fn lost_cb;
	void *ctx;
	int cpu_cnt;
	int *cpus;
	int *map_keys;
};

struct perf_cpu_buf {
	struct perf_buffer *pb;
	void *base; /* mmap()'ed memory */
	void *buf; /* for reconstructing segmented data */
	size_t buf_size;
	int fd;
	int cpu;
	int map_key;
};

struct perf_buffer {
	perf_buffer_event_fn event_cb;
	perf_buffer_sample_fn sample_cb;
	perf_buffer_lost_fn lost_cb;
	void *ctx; /* passed into callbacks */

	size_t page_size;
	size_t mmap_size;
	struct perf_cpu_buf **cpu_bufs;
	struct epoll_event *events;
7521
	int cpu_cnt; /* number of allocated CPU buffers */
A
Andrii Nakryiko 已提交
7522 7523 7524 7525 7526 7527 7528 7529 7530 7531 7532
	int epoll_fd; /* perf event FD */
	int map_fd; /* BPF_MAP_TYPE_PERF_EVENT_ARRAY BPF map FD */
};

static void perf_buffer__free_cpu_buf(struct perf_buffer *pb,
				      struct perf_cpu_buf *cpu_buf)
{
	if (!cpu_buf)
		return;
	if (cpu_buf->base &&
	    munmap(cpu_buf->base, pb->mmap_size + pb->page_size))
7533
		pr_warn("failed to munmap cpu_buf #%d\n", cpu_buf->cpu);
A
Andrii Nakryiko 已提交
7534 7535 7536 7537 7538 7539 7540 7541 7542 7543 7544 7545 7546 7547 7548 7549 7550 7551 7552 7553 7554 7555 7556 7557 7558 7559 7560 7561 7562 7563 7564 7565 7566 7567 7568 7569 7570 7571 7572 7573 7574 7575 7576 7577 7578 7579 7580 7581 7582
	if (cpu_buf->fd >= 0) {
		ioctl(cpu_buf->fd, PERF_EVENT_IOC_DISABLE, 0);
		close(cpu_buf->fd);
	}
	free(cpu_buf->buf);
	free(cpu_buf);
}

void perf_buffer__free(struct perf_buffer *pb)
{
	int i;

	if (!pb)
		return;
	if (pb->cpu_bufs) {
		for (i = 0; i < pb->cpu_cnt && pb->cpu_bufs[i]; i++) {
			struct perf_cpu_buf *cpu_buf = pb->cpu_bufs[i];

			bpf_map_delete_elem(pb->map_fd, &cpu_buf->map_key);
			perf_buffer__free_cpu_buf(pb, cpu_buf);
		}
		free(pb->cpu_bufs);
	}
	if (pb->epoll_fd >= 0)
		close(pb->epoll_fd);
	free(pb->events);
	free(pb);
}

static struct perf_cpu_buf *
perf_buffer__open_cpu_buf(struct perf_buffer *pb, struct perf_event_attr *attr,
			  int cpu, int map_key)
{
	struct perf_cpu_buf *cpu_buf;
	char msg[STRERR_BUFSIZE];
	int err;

	cpu_buf = calloc(1, sizeof(*cpu_buf));
	if (!cpu_buf)
		return ERR_PTR(-ENOMEM);

	cpu_buf->pb = pb;
	cpu_buf->cpu = cpu;
	cpu_buf->map_key = map_key;

	cpu_buf->fd = syscall(__NR_perf_event_open, attr, -1 /* pid */, cpu,
			      -1, PERF_FLAG_FD_CLOEXEC);
	if (cpu_buf->fd < 0) {
		err = -errno;
7583 7584
		pr_warn("failed to open perf buffer event on cpu #%d: %s\n",
			cpu, libbpf_strerror_r(err, msg, sizeof(msg)));
A
Andrii Nakryiko 已提交
7585 7586 7587 7588 7589 7590 7591 7592 7593
		goto error;
	}

	cpu_buf->base = mmap(NULL, pb->mmap_size + pb->page_size,
			     PROT_READ | PROT_WRITE, MAP_SHARED,
			     cpu_buf->fd, 0);
	if (cpu_buf->base == MAP_FAILED) {
		cpu_buf->base = NULL;
		err = -errno;
7594 7595
		pr_warn("failed to mmap perf buffer on cpu #%d: %s\n",
			cpu, libbpf_strerror_r(err, msg, sizeof(msg)));
A
Andrii Nakryiko 已提交
7596 7597 7598 7599 7600
		goto error;
	}

	if (ioctl(cpu_buf->fd, PERF_EVENT_IOC_ENABLE, 0) < 0) {
		err = -errno;
7601 7602
		pr_warn("failed to enable perf buffer event on cpu #%d: %s\n",
			cpu, libbpf_strerror_r(err, msg, sizeof(msg)));
A
Andrii Nakryiko 已提交
7603 7604 7605 7606 7607 7608 7609 7610 7611 7612 7613 7614 7615 7616 7617 7618 7619
		goto error;
	}

	return cpu_buf;

error:
	perf_buffer__free_cpu_buf(pb, cpu_buf);
	return (struct perf_cpu_buf *)ERR_PTR(err);
}

static struct perf_buffer *__perf_buffer__new(int map_fd, size_t page_cnt,
					      struct perf_buffer_params *p);

struct perf_buffer *perf_buffer__new(int map_fd, size_t page_cnt,
				     const struct perf_buffer_opts *opts)
{
	struct perf_buffer_params p = {};
7620 7621 7622 7623 7624 7625 7626
	struct perf_event_attr attr = { 0, };

	attr.config = PERF_COUNT_SW_BPF_OUTPUT,
	attr.type = PERF_TYPE_SOFTWARE;
	attr.sample_type = PERF_SAMPLE_RAW;
	attr.sample_period = 1;
	attr.wakeup_events = 1;
A
Andrii Nakryiko 已提交
7627 7628 7629 7630 7631 7632 7633 7634 7635 7636 7637 7638 7639 7640 7641 7642 7643 7644 7645 7646 7647 7648 7649 7650 7651 7652 7653 7654

	p.attr = &attr;
	p.sample_cb = opts ? opts->sample_cb : NULL;
	p.lost_cb = opts ? opts->lost_cb : NULL;
	p.ctx = opts ? opts->ctx : NULL;

	return __perf_buffer__new(map_fd, page_cnt, &p);
}

struct perf_buffer *
perf_buffer__new_raw(int map_fd, size_t page_cnt,
		     const struct perf_buffer_raw_opts *opts)
{
	struct perf_buffer_params p = {};

	p.attr = opts->attr;
	p.event_cb = opts->event_cb;
	p.ctx = opts->ctx;
	p.cpu_cnt = opts->cpu_cnt;
	p.cpus = opts->cpus;
	p.map_keys = opts->map_keys;

	return __perf_buffer__new(map_fd, page_cnt, &p);
}

static struct perf_buffer *__perf_buffer__new(int map_fd, size_t page_cnt,
					      struct perf_buffer_params *p)
{
7655
	const char *online_cpus_file = "/sys/devices/system/cpu/online";
A
Andrii Nakryiko 已提交
7656 7657 7658
	struct bpf_map_info map = {};
	char msg[STRERR_BUFSIZE];
	struct perf_buffer *pb;
7659
	bool *online = NULL;
A
Andrii Nakryiko 已提交
7660
	__u32 map_info_len;
7661
	int err, i, j, n;
A
Andrii Nakryiko 已提交
7662 7663

	if (page_cnt & (page_cnt - 1)) {
7664 7665
		pr_warn("page count should be power of two, but is %zu\n",
			page_cnt);
A
Andrii Nakryiko 已提交
7666 7667 7668 7669 7670 7671 7672
		return ERR_PTR(-EINVAL);
	}

	map_info_len = sizeof(map);
	err = bpf_obj_get_info_by_fd(map_fd, &map, &map_info_len);
	if (err) {
		err = -errno;
7673 7674
		pr_warn("failed to get map info for map FD %d: %s\n",
			map_fd, libbpf_strerror_r(err, msg, sizeof(msg)));
A
Andrii Nakryiko 已提交
7675 7676 7677 7678
		return ERR_PTR(err);
	}

	if (map.type != BPF_MAP_TYPE_PERF_EVENT_ARRAY) {
7679 7680
		pr_warn("map '%s' should be BPF_MAP_TYPE_PERF_EVENT_ARRAY\n",
			map.name);
A
Andrii Nakryiko 已提交
7681 7682 7683 7684 7685 7686 7687 7688 7689 7690 7691 7692 7693 7694 7695 7696 7697 7698 7699
		return ERR_PTR(-EINVAL);
	}

	pb = calloc(1, sizeof(*pb));
	if (!pb)
		return ERR_PTR(-ENOMEM);

	pb->event_cb = p->event_cb;
	pb->sample_cb = p->sample_cb;
	pb->lost_cb = p->lost_cb;
	pb->ctx = p->ctx;

	pb->page_size = getpagesize();
	pb->mmap_size = pb->page_size * page_cnt;
	pb->map_fd = map_fd;

	pb->epoll_fd = epoll_create1(EPOLL_CLOEXEC);
	if (pb->epoll_fd < 0) {
		err = -errno;
7700 7701
		pr_warn("failed to create epoll instance: %s\n",
			libbpf_strerror_r(err, msg, sizeof(msg)));
A
Andrii Nakryiko 已提交
7702 7703 7704 7705 7706 7707 7708 7709 7710 7711 7712 7713 7714 7715 7716 7717 7718 7719
		goto error;
	}

	if (p->cpu_cnt > 0) {
		pb->cpu_cnt = p->cpu_cnt;
	} else {
		pb->cpu_cnt = libbpf_num_possible_cpus();
		if (pb->cpu_cnt < 0) {
			err = pb->cpu_cnt;
			goto error;
		}
		if (map.max_entries < pb->cpu_cnt)
			pb->cpu_cnt = map.max_entries;
	}

	pb->events = calloc(pb->cpu_cnt, sizeof(*pb->events));
	if (!pb->events) {
		err = -ENOMEM;
7720
		pr_warn("failed to allocate events: out of memory\n");
A
Andrii Nakryiko 已提交
7721 7722 7723 7724 7725
		goto error;
	}
	pb->cpu_bufs = calloc(pb->cpu_cnt, sizeof(*pb->cpu_bufs));
	if (!pb->cpu_bufs) {
		err = -ENOMEM;
7726
		pr_warn("failed to allocate buffers: out of memory\n");
A
Andrii Nakryiko 已提交
7727 7728 7729
		goto error;
	}

7730 7731 7732 7733 7734 7735 7736
	err = parse_cpu_mask_file(online_cpus_file, &online, &n);
	if (err) {
		pr_warn("failed to get online CPU mask: %d\n", err);
		goto error;
	}

	for (i = 0, j = 0; i < pb->cpu_cnt; i++) {
A
Andrii Nakryiko 已提交
7737 7738 7739 7740 7741 7742
		struct perf_cpu_buf *cpu_buf;
		int cpu, map_key;

		cpu = p->cpu_cnt > 0 ? p->cpus[i] : i;
		map_key = p->cpu_cnt > 0 ? p->map_keys[i] : i;

7743 7744 7745 7746 7747 7748
		/* in case user didn't explicitly requested particular CPUs to
		 * be attached to, skip offline/not present CPUs
		 */
		if (p->cpu_cnt <= 0 && (cpu >= n || !online[cpu]))
			continue;

A
Andrii Nakryiko 已提交
7749 7750 7751 7752 7753 7754
		cpu_buf = perf_buffer__open_cpu_buf(pb, p->attr, cpu, map_key);
		if (IS_ERR(cpu_buf)) {
			err = PTR_ERR(cpu_buf);
			goto error;
		}

7755
		pb->cpu_bufs[j] = cpu_buf;
A
Andrii Nakryiko 已提交
7756 7757 7758 7759 7760

		err = bpf_map_update_elem(pb->map_fd, &map_key,
					  &cpu_buf->fd, 0);
		if (err) {
			err = -errno;
7761 7762 7763
			pr_warn("failed to set cpu #%d, key %d -> perf FD %d: %s\n",
				cpu, map_key, cpu_buf->fd,
				libbpf_strerror_r(err, msg, sizeof(msg)));
A
Andrii Nakryiko 已提交
7764 7765 7766
			goto error;
		}

7767 7768
		pb->events[j].events = EPOLLIN;
		pb->events[j].data.ptr = cpu_buf;
A
Andrii Nakryiko 已提交
7769
		if (epoll_ctl(pb->epoll_fd, EPOLL_CTL_ADD, cpu_buf->fd,
7770
			      &pb->events[j]) < 0) {
A
Andrii Nakryiko 已提交
7771
			err = -errno;
7772 7773 7774
			pr_warn("failed to epoll_ctl cpu #%d perf FD %d: %s\n",
				cpu, cpu_buf->fd,
				libbpf_strerror_r(err, msg, sizeof(msg)));
A
Andrii Nakryiko 已提交
7775 7776
			goto error;
		}
7777
		j++;
A
Andrii Nakryiko 已提交
7778
	}
7779 7780
	pb->cpu_cnt = j;
	free(online);
A
Andrii Nakryiko 已提交
7781 7782 7783 7784

	return pb;

error:
7785
	free(online);
A
Andrii Nakryiko 已提交
7786 7787 7788 7789 7790 7791 7792 7793 7794 7795 7796 7797 7798 7799 7800 7801 7802 7803 7804 7805 7806 7807 7808 7809 7810 7811 7812 7813 7814 7815 7816 7817 7818 7819 7820 7821 7822 7823 7824 7825 7826 7827 7828 7829 7830
	if (pb)
		perf_buffer__free(pb);
	return ERR_PTR(err);
}

struct perf_sample_raw {
	struct perf_event_header header;
	uint32_t size;
	char data[0];
};

struct perf_sample_lost {
	struct perf_event_header header;
	uint64_t id;
	uint64_t lost;
	uint64_t sample_id;
};

static enum bpf_perf_event_ret
perf_buffer__process_record(struct perf_event_header *e, void *ctx)
{
	struct perf_cpu_buf *cpu_buf = ctx;
	struct perf_buffer *pb = cpu_buf->pb;
	void *data = e;

	/* user wants full control over parsing perf event */
	if (pb->event_cb)
		return pb->event_cb(pb->ctx, cpu_buf->cpu, e);

	switch (e->type) {
	case PERF_RECORD_SAMPLE: {
		struct perf_sample_raw *s = data;

		if (pb->sample_cb)
			pb->sample_cb(pb->ctx, cpu_buf->cpu, s->data, s->size);
		break;
	}
	case PERF_RECORD_LOST: {
		struct perf_sample_lost *s = data;

		if (pb->lost_cb)
			pb->lost_cb(pb->ctx, cpu_buf->cpu, s->lost);
		break;
	}
	default:
7831
		pr_warn("unknown perf sample type %d\n", e->type);
A
Andrii Nakryiko 已提交
7832 7833 7834 7835 7836 7837 7838 7839 7840 7841 7842 7843 7844 7845 7846 7847 7848 7849 7850 7851 7852 7853 7854 7855 7856 7857 7858 7859 7860
		return LIBBPF_PERF_EVENT_ERROR;
	}
	return LIBBPF_PERF_EVENT_CONT;
}

static int perf_buffer__process_records(struct perf_buffer *pb,
					struct perf_cpu_buf *cpu_buf)
{
	enum bpf_perf_event_ret ret;

	ret = bpf_perf_event_read_simple(cpu_buf->base, pb->mmap_size,
					 pb->page_size, &cpu_buf->buf,
					 &cpu_buf->buf_size,
					 perf_buffer__process_record, cpu_buf);
	if (ret != LIBBPF_PERF_EVENT_CONT)
		return ret;
	return 0;
}

int perf_buffer__poll(struct perf_buffer *pb, int timeout_ms)
{
	int i, cnt, err;

	cnt = epoll_wait(pb->epoll_fd, pb->events, pb->cpu_cnt, timeout_ms);
	for (i = 0; i < cnt; i++) {
		struct perf_cpu_buf *cpu_buf = pb->events[i].data.ptr;

		err = perf_buffer__process_records(pb, cpu_buf);
		if (err) {
7861
			pr_warn("error while processing records: %d\n", err);
A
Andrii Nakryiko 已提交
7862 7863 7864 7865 7866 7867
			return err;
		}
	}
	return cnt < 0 ? -errno : cnt;
}

7868 7869 7870 7871 7872 7873 7874 7875 7876 7877 7878 7879 7880 7881 7882 7883 7884 7885 7886 7887 7888 7889 7890 7891 7892 7893 7894 7895 7896 7897 7898 7899 7900 7901 7902 7903 7904 7905 7906 7907 7908 7909 7910 7911 7912 7913 7914 7915 7916 7917 7918 7919 7920 7921 7922 7923 7924
struct bpf_prog_info_array_desc {
	int	array_offset;	/* e.g. offset of jited_prog_insns */
	int	count_offset;	/* e.g. offset of jited_prog_len */
	int	size_offset;	/* > 0: offset of rec size,
				 * < 0: fix size of -size_offset
				 */
};

static struct bpf_prog_info_array_desc bpf_prog_info_array_desc[] = {
	[BPF_PROG_INFO_JITED_INSNS] = {
		offsetof(struct bpf_prog_info, jited_prog_insns),
		offsetof(struct bpf_prog_info, jited_prog_len),
		-1,
	},
	[BPF_PROG_INFO_XLATED_INSNS] = {
		offsetof(struct bpf_prog_info, xlated_prog_insns),
		offsetof(struct bpf_prog_info, xlated_prog_len),
		-1,
	},
	[BPF_PROG_INFO_MAP_IDS] = {
		offsetof(struct bpf_prog_info, map_ids),
		offsetof(struct bpf_prog_info, nr_map_ids),
		-(int)sizeof(__u32),
	},
	[BPF_PROG_INFO_JITED_KSYMS] = {
		offsetof(struct bpf_prog_info, jited_ksyms),
		offsetof(struct bpf_prog_info, nr_jited_ksyms),
		-(int)sizeof(__u64),
	},
	[BPF_PROG_INFO_JITED_FUNC_LENS] = {
		offsetof(struct bpf_prog_info, jited_func_lens),
		offsetof(struct bpf_prog_info, nr_jited_func_lens),
		-(int)sizeof(__u32),
	},
	[BPF_PROG_INFO_FUNC_INFO] = {
		offsetof(struct bpf_prog_info, func_info),
		offsetof(struct bpf_prog_info, nr_func_info),
		offsetof(struct bpf_prog_info, func_info_rec_size),
	},
	[BPF_PROG_INFO_LINE_INFO] = {
		offsetof(struct bpf_prog_info, line_info),
		offsetof(struct bpf_prog_info, nr_line_info),
		offsetof(struct bpf_prog_info, line_info_rec_size),
	},
	[BPF_PROG_INFO_JITED_LINE_INFO] = {
		offsetof(struct bpf_prog_info, jited_line_info),
		offsetof(struct bpf_prog_info, nr_jited_line_info),
		offsetof(struct bpf_prog_info, jited_line_info_rec_size),
	},
	[BPF_PROG_INFO_PROG_TAGS] = {
		offsetof(struct bpf_prog_info, prog_tags),
		offsetof(struct bpf_prog_info, nr_prog_tags),
		-(int)sizeof(__u8) * BPF_TAG_SIZE,
	},

};

7925 7926
static __u32 bpf_prog_info_read_offset_u32(struct bpf_prog_info *info,
					   int offset)
7927 7928 7929 7930 7931 7932 7933 7934
{
	__u32 *array = (__u32 *)info;

	if (offset >= 0)
		return array[offset / sizeof(__u32)];
	return -(int)offset;
}

7935 7936
static __u64 bpf_prog_info_read_offset_u64(struct bpf_prog_info *info,
					   int offset)
7937 7938 7939 7940 7941 7942 7943 7944 7945 7946 7947 7948 7949 7950 7951 7952 7953 7954 7955 7956 7957 7958 7959 7960 7961 7962 7963 7964 7965 7966 7967 7968 7969 7970 7971 7972 7973 7974 7975 7976 7977 7978 7979 7980 7981 7982 7983 7984 7985 7986 7987 7988 7989 7990 7991 7992 7993 7994 7995 7996 7997 7998 7999 8000 8001 8002 8003 8004 8005 8006 8007 8008 8009 8010 8011 8012 8013 8014 8015 8016 8017 8018 8019 8020 8021 8022 8023 8024 8025 8026 8027 8028 8029 8030 8031 8032 8033 8034 8035 8036 8037 8038 8039 8040 8041 8042 8043 8044 8045 8046 8047 8048 8049 8050 8051 8052 8053 8054 8055 8056 8057 8058 8059
{
	__u64 *array = (__u64 *)info;

	if (offset >= 0)
		return array[offset / sizeof(__u64)];
	return -(int)offset;
}

static void bpf_prog_info_set_offset_u32(struct bpf_prog_info *info, int offset,
					 __u32 val)
{
	__u32 *array = (__u32 *)info;

	if (offset >= 0)
		array[offset / sizeof(__u32)] = val;
}

static void bpf_prog_info_set_offset_u64(struct bpf_prog_info *info, int offset,
					 __u64 val)
{
	__u64 *array = (__u64 *)info;

	if (offset >= 0)
		array[offset / sizeof(__u64)] = val;
}

struct bpf_prog_info_linear *
bpf_program__get_prog_info_linear(int fd, __u64 arrays)
{
	struct bpf_prog_info_linear *info_linear;
	struct bpf_prog_info info = {};
	__u32 info_len = sizeof(info);
	__u32 data_len = 0;
	int i, err;
	void *ptr;

	if (arrays >> BPF_PROG_INFO_LAST_ARRAY)
		return ERR_PTR(-EINVAL);

	/* step 1: get array dimensions */
	err = bpf_obj_get_info_by_fd(fd, &info, &info_len);
	if (err) {
		pr_debug("can't get prog info: %s", strerror(errno));
		return ERR_PTR(-EFAULT);
	}

	/* step 2: calculate total size of all arrays */
	for (i = BPF_PROG_INFO_FIRST_ARRAY; i < BPF_PROG_INFO_LAST_ARRAY; ++i) {
		bool include_array = (arrays & (1UL << i)) > 0;
		struct bpf_prog_info_array_desc *desc;
		__u32 count, size;

		desc = bpf_prog_info_array_desc + i;

		/* kernel is too old to support this field */
		if (info_len < desc->array_offset + sizeof(__u32) ||
		    info_len < desc->count_offset + sizeof(__u32) ||
		    (desc->size_offset > 0 && info_len < desc->size_offset))
			include_array = false;

		if (!include_array) {
			arrays &= ~(1UL << i);	/* clear the bit */
			continue;
		}

		count = bpf_prog_info_read_offset_u32(&info, desc->count_offset);
		size  = bpf_prog_info_read_offset_u32(&info, desc->size_offset);

		data_len += count * size;
	}

	/* step 3: allocate continuous memory */
	data_len = roundup(data_len, sizeof(__u64));
	info_linear = malloc(sizeof(struct bpf_prog_info_linear) + data_len);
	if (!info_linear)
		return ERR_PTR(-ENOMEM);

	/* step 4: fill data to info_linear->info */
	info_linear->arrays = arrays;
	memset(&info_linear->info, 0, sizeof(info));
	ptr = info_linear->data;

	for (i = BPF_PROG_INFO_FIRST_ARRAY; i < BPF_PROG_INFO_LAST_ARRAY; ++i) {
		struct bpf_prog_info_array_desc *desc;
		__u32 count, size;

		if ((arrays & (1UL << i)) == 0)
			continue;

		desc  = bpf_prog_info_array_desc + i;
		count = bpf_prog_info_read_offset_u32(&info, desc->count_offset);
		size  = bpf_prog_info_read_offset_u32(&info, desc->size_offset);
		bpf_prog_info_set_offset_u32(&info_linear->info,
					     desc->count_offset, count);
		bpf_prog_info_set_offset_u32(&info_linear->info,
					     desc->size_offset, size);
		bpf_prog_info_set_offset_u64(&info_linear->info,
					     desc->array_offset,
					     ptr_to_u64(ptr));
		ptr += count * size;
	}

	/* step 5: call syscall again to get required arrays */
	err = bpf_obj_get_info_by_fd(fd, &info_linear->info, &info_len);
	if (err) {
		pr_debug("can't get prog info: %s", strerror(errno));
		free(info_linear);
		return ERR_PTR(-EFAULT);
	}

	/* step 6: verify the data */
	for (i = BPF_PROG_INFO_FIRST_ARRAY; i < BPF_PROG_INFO_LAST_ARRAY; ++i) {
		struct bpf_prog_info_array_desc *desc;
		__u32 v1, v2;

		if ((arrays & (1UL << i)) == 0)
			continue;

		desc = bpf_prog_info_array_desc + i;
		v1 = bpf_prog_info_read_offset_u32(&info, desc->count_offset);
		v2 = bpf_prog_info_read_offset_u32(&info_linear->info,
						   desc->count_offset);
		if (v1 != v2)
8060
			pr_warn("%s: mismatch in element count\n", __func__);
8061 8062 8063 8064 8065

		v1 = bpf_prog_info_read_offset_u32(&info, desc->size_offset);
		v2 = bpf_prog_info_read_offset_u32(&info_linear->info,
						   desc->size_offset);
		if (v1 != v2)
8066
			pr_warn("%s: mismatch in rec size\n", __func__);
8067 8068 8069 8070 8071 8072 8073 8074 8075 8076 8077 8078 8079 8080 8081 8082 8083 8084 8085 8086 8087 8088 8089 8090 8091 8092 8093 8094 8095 8096 8097 8098 8099 8100 8101 8102 8103 8104 8105 8106 8107 8108 8109 8110 8111 8112 8113 8114
	}

	/* step 7: update info_len and data_len */
	info_linear->info_len = sizeof(struct bpf_prog_info);
	info_linear->data_len = data_len;

	return info_linear;
}

void bpf_program__bpil_addr_to_offs(struct bpf_prog_info_linear *info_linear)
{
	int i;

	for (i = BPF_PROG_INFO_FIRST_ARRAY; i < BPF_PROG_INFO_LAST_ARRAY; ++i) {
		struct bpf_prog_info_array_desc *desc;
		__u64 addr, offs;

		if ((info_linear->arrays & (1UL << i)) == 0)
			continue;

		desc = bpf_prog_info_array_desc + i;
		addr = bpf_prog_info_read_offset_u64(&info_linear->info,
						     desc->array_offset);
		offs = addr - ptr_to_u64(info_linear->data);
		bpf_prog_info_set_offset_u64(&info_linear->info,
					     desc->array_offset, offs);
	}
}

void bpf_program__bpil_offs_to_addr(struct bpf_prog_info_linear *info_linear)
{
	int i;

	for (i = BPF_PROG_INFO_FIRST_ARRAY; i < BPF_PROG_INFO_LAST_ARRAY; ++i) {
		struct bpf_prog_info_array_desc *desc;
		__u64 addr, offs;

		if ((info_linear->arrays & (1UL << i)) == 0)
			continue;

		desc = bpf_prog_info_array_desc + i;
		offs = bpf_prog_info_read_offset_u64(&info_linear->info,
						     desc->array_offset);
		addr = offs + ptr_to_u64(info_linear->data);
		bpf_prog_info_set_offset_u64(&info_linear->info,
					     desc->array_offset, addr);
	}
}
8115

8116
int parse_cpu_mask_str(const char *s, bool **mask, int *mask_sz)
8117
{
8118 8119
	int err = 0, n, len, start, end = -1;
	bool *tmp;
8120

8121 8122 8123 8124 8125 8126 8127 8128 8129 8130 8131 8132 8133 8134 8135 8136 8137 8138 8139 8140 8141 8142 8143 8144 8145 8146 8147 8148 8149 8150 8151 8152 8153 8154 8155 8156 8157 8158 8159 8160 8161 8162 8163 8164 8165 8166 8167 8168 8169
	*mask = NULL;
	*mask_sz = 0;

	/* Each sub string separated by ',' has format \d+-\d+ or \d+ */
	while (*s) {
		if (*s == ',' || *s == '\n') {
			s++;
			continue;
		}
		n = sscanf(s, "%d%n-%d%n", &start, &len, &end, &len);
		if (n <= 0 || n > 2) {
			pr_warn("Failed to get CPU range %s: %d\n", s, n);
			err = -EINVAL;
			goto cleanup;
		} else if (n == 1) {
			end = start;
		}
		if (start < 0 || start > end) {
			pr_warn("Invalid CPU range [%d,%d] in %s\n",
				start, end, s);
			err = -EINVAL;
			goto cleanup;
		}
		tmp = realloc(*mask, end + 1);
		if (!tmp) {
			err = -ENOMEM;
			goto cleanup;
		}
		*mask = tmp;
		memset(tmp + *mask_sz, 0, start - *mask_sz);
		memset(tmp + start, 1, end - start + 1);
		*mask_sz = end + 1;
		s += len;
	}
	if (!*mask_sz) {
		pr_warn("Empty CPU range\n");
		return -EINVAL;
	}
	return 0;
cleanup:
	free(*mask);
	*mask = NULL;
	return err;
}

int parse_cpu_mask_file(const char *fcpu, bool **mask, int *mask_sz)
{
	int fd, err = 0, len;
	char buf[128];
8170 8171 8172

	fd = open(fcpu, O_RDONLY);
	if (fd < 0) {
8173 8174 8175
		err = -errno;
		pr_warn("Failed to open cpu mask file %s: %d\n", fcpu, err);
		return err;
8176 8177 8178 8179
	}
	len = read(fd, buf, sizeof(buf));
	close(fd);
	if (len <= 0) {
8180 8181 8182
		err = len ? -errno : -EINVAL;
		pr_warn("Failed to read cpu mask from %s: %d\n", fcpu, err);
		return err;
8183
	}
8184 8185 8186
	if (len >= sizeof(buf)) {
		pr_warn("CPU mask is too big in file %s\n", fcpu);
		return -E2BIG;
8187 8188 8189
	}
	buf[len] = '\0';

8190 8191 8192 8193 8194 8195 8196 8197 8198 8199 8200 8201 8202 8203 8204 8205 8206 8207 8208 8209 8210 8211
	return parse_cpu_mask_str(buf, mask, mask_sz);
}

int libbpf_num_possible_cpus(void)
{
	static const char *fcpu = "/sys/devices/system/cpu/possible";
	static int cpus;
	int err, n, i, tmp_cpus;
	bool *mask;

	tmp_cpus = READ_ONCE(cpus);
	if (tmp_cpus > 0)
		return tmp_cpus;

	err = parse_cpu_mask_file(fcpu, &mask, &n);
	if (err)
		return err;

	tmp_cpus = 0;
	for (i = 0; i < n; i++) {
		if (mask[i])
			tmp_cpus++;
8212
	}
8213
	free(mask);
8214 8215 8216

	WRITE_ONCE(cpus, tmp_cpus);
	return tmp_cpus;
8217
}
8218 8219 8220 8221 8222 8223 8224 8225 8226 8227 8228 8229 8230 8231 8232 8233 8234 8235 8236 8237 8238 8239 8240 8241 8242 8243 8244 8245 8246 8247 8248 8249 8250 8251 8252 8253 8254 8255 8256 8257 8258 8259

int bpf_object__open_skeleton(struct bpf_object_skeleton *s,
			      const struct bpf_object_open_opts *opts)
{
	DECLARE_LIBBPF_OPTS(bpf_object_open_opts, skel_opts,
		.object_name = s->name,
	);
	struct bpf_object *obj;
	int i;

	/* Attempt to preserve opts->object_name, unless overriden by user
	 * explicitly. Overwriting object name for skeletons is discouraged,
	 * as it breaks global data maps, because they contain object name
	 * prefix as their own map name prefix. When skeleton is generated,
	 * bpftool is making an assumption that this name will stay the same.
	 */
	if (opts) {
		memcpy(&skel_opts, opts, sizeof(*opts));
		if (!opts->object_name)
			skel_opts.object_name = s->name;
	}

	obj = bpf_object__open_mem(s->data, s->data_sz, &skel_opts);
	if (IS_ERR(obj)) {
		pr_warn("failed to initialize skeleton BPF object '%s': %ld\n",
			s->name, PTR_ERR(obj));
		return PTR_ERR(obj);
	}

	*s->obj = obj;

	for (i = 0; i < s->map_cnt; i++) {
		struct bpf_map **map = s->maps[i].map;
		const char *name = s->maps[i].name;
		void **mmaped = s->maps[i].mmaped;

		*map = bpf_object__find_map_by_name(obj, name);
		if (!*map) {
			pr_warn("failed to find skeleton map '%s'\n", name);
			return -ESRCH;
		}

8260
		/* externs shouldn't be pre-setup from user code */
8261
		if (mmaped && (*map)->libbpf_type != LIBBPF_MAP_KCONFIG)
8262 8263 8264 8265 8266 8267 8268 8269 8270 8271 8272 8273 8274 8275 8276 8277 8278 8279 8280 8281 8282 8283 8284 8285 8286 8287 8288 8289 8290 8291 8292 8293 8294 8295 8296 8297 8298 8299 8300 8301 8302 8303 8304 8305 8306 8307 8308 8309 8310 8311 8312 8313 8314 8315 8316 8317
			*mmaped = (*map)->mmaped;
	}

	for (i = 0; i < s->prog_cnt; i++) {
		struct bpf_program **prog = s->progs[i].prog;
		const char *name = s->progs[i].name;

		*prog = bpf_object__find_program_by_name(obj, name);
		if (!*prog) {
			pr_warn("failed to find skeleton program '%s'\n", name);
			return -ESRCH;
		}
	}

	return 0;
}

int bpf_object__load_skeleton(struct bpf_object_skeleton *s)
{
	int i, err;

	err = bpf_object__load(*s->obj);
	if (err) {
		pr_warn("failed to load BPF skeleton '%s': %d\n", s->name, err);
		return err;
	}

	for (i = 0; i < s->map_cnt; i++) {
		struct bpf_map *map = *s->maps[i].map;
		size_t mmap_sz = bpf_map_mmap_sz(map);
		int prot, map_fd = bpf_map__fd(map);
		void **mmaped = s->maps[i].mmaped;

		if (!mmaped)
			continue;

		if (!(map->def.map_flags & BPF_F_MMAPABLE)) {
			*mmaped = NULL;
			continue;
		}

		if (map->def.map_flags & BPF_F_RDONLY_PROG)
			prot = PROT_READ;
		else
			prot = PROT_READ | PROT_WRITE;

		/* Remap anonymous mmap()-ed "map initialization image" as
		 * a BPF map-backed mmap()-ed memory, but preserving the same
		 * memory address. This will cause kernel to change process'
		 * page table to point to a different piece of kernel memory,
		 * but from userspace point of view memory address (and its
		 * contents, being identical at this point) will stay the
		 * same. This mapping will be released by bpf_object__close()
		 * as per normal clean up procedure, so we don't need to worry
		 * about it from skeleton's clean up perspective.
		 */
8318 8319 8320
		*mmaped = mmap(map->mmaped, mmap_sz, prot,
				MAP_SHARED | MAP_FIXED, map_fd, 0);
		if (*mmaped == MAP_FAILED) {
8321 8322 8323 8324 8325 8326 8327 8328 8329 8330 8331 8332 8333 8334 8335 8336 8337 8338 8339 8340 8341 8342 8343 8344 8345 8346 8347 8348 8349 8350 8351 8352 8353 8354 8355 8356 8357 8358 8359 8360 8361 8362 8363 8364 8365 8366 8367 8368 8369 8370 8371 8372 8373 8374 8375 8376 8377 8378 8379
			err = -errno;
			*mmaped = NULL;
			pr_warn("failed to re-mmap() map '%s': %d\n",
				 bpf_map__name(map), err);
			return err;
		}
	}

	return 0;
}

int bpf_object__attach_skeleton(struct bpf_object_skeleton *s)
{
	int i;

	for (i = 0; i < s->prog_cnt; i++) {
		struct bpf_program *prog = *s->progs[i].prog;
		struct bpf_link **link = s->progs[i].link;
		const struct bpf_sec_def *sec_def;
		const char *sec_name = bpf_program__title(prog, false);

		sec_def = find_sec_def(sec_name);
		if (!sec_def || !sec_def->attach_fn)
			continue;

		*link = sec_def->attach_fn(sec_def, prog);
		if (IS_ERR(*link)) {
			pr_warn("failed to auto-attach program '%s': %ld\n",
				bpf_program__name(prog), PTR_ERR(*link));
			return PTR_ERR(*link);
		}
	}

	return 0;
}

void bpf_object__detach_skeleton(struct bpf_object_skeleton *s)
{
	int i;

	for (i = 0; i < s->prog_cnt; i++) {
		struct bpf_link **link = s->progs[i].link;

		if (!IS_ERR_OR_NULL(*link))
			bpf_link__destroy(*link);
		*link = NULL;
	}
}

void bpf_object__destroy_skeleton(struct bpf_object_skeleton *s)
{
	if (s->progs)
		bpf_object__detach_skeleton(s);
	if (s->obj)
		bpf_object__close(*s->obj);
	free(s->maps);
	free(s->progs);
	free(s);
}