libbpf.c 56.8 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 11
 */

12
#define _GNU_SOURCE
13
#include <stdlib.h>
14 15
#include <stdio.h>
#include <stdarg.h>
16
#include <libgen.h>
17
#include <inttypes.h>
18
#include <string.h>
19
#include <unistd.h>
20 21
#include <fcntl.h>
#include <errno.h>
22
#include <asm/unistd.h>
23
#include <linux/err.h>
24
#include <linux/kernel.h>
25
#include <linux/bpf.h>
26
#include <linux/btf.h>
27
#include <linux/list.h>
28
#include <linux/limits.h>
29
#include <linux/perf_event.h>
30 31 32
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/vfs.h>
33
#include <tools/libc_compat.h>
34 35
#include <libelf.h>
#include <gelf.h>
36 37

#include "libbpf.h"
38
#include "bpf.h"
39
#include "btf.h"
40
#include "str_error.h"
41

42 43 44 45
#ifndef EM_BPF
#define EM_BPF 247
#endif

46 47 48 49
#ifndef BPF_FS_MAGIC
#define BPF_FS_MAGIC		0xcafe4a11
#endif

50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85
#define __printf(a, b)	__attribute__((format(printf, a, b)))

__printf(1, 2)
static int __base_pr(const char *format, ...)
{
	va_list args;
	int err;

	va_start(args, format);
	err = vfprintf(stderr, format, args);
	va_end(args);
	return err;
}

static __printf(1, 2) libbpf_print_fn_t __pr_warning = __base_pr;
static __printf(1, 2) libbpf_print_fn_t __pr_info = __base_pr;
static __printf(1, 2) libbpf_print_fn_t __pr_debug;

#define __pr(func, fmt, ...)	\
do {				\
	if ((func))		\
		(func)("libbpf: " fmt, ##__VA_ARGS__); \
} while (0)

#define pr_warning(fmt, ...)	__pr(__pr_warning, fmt, ##__VA_ARGS__)
#define pr_info(fmt, ...)	__pr(__pr_info, fmt, ##__VA_ARGS__)
#define pr_debug(fmt, ...)	__pr(__pr_debug, fmt, ##__VA_ARGS__)

void libbpf_set_print(libbpf_print_fn_t warn,
		      libbpf_print_fn_t info,
		      libbpf_print_fn_t debug)
{
	__pr_warning = warn;
	__pr_info = info;
	__pr_debug = debug;
}
86

87 88 89 90 91 92 93 94 95
#define STRERR_BUFSIZE  128

#define CHECK_ERR(action, err, out) do {	\
	err = action;			\
	if (err)			\
		goto out;		\
} while(0)


96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115
/* 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

116 117 118 119 120 121 122
/*
 * 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;
123
	char *name;
124
	int prog_ifindex;
125 126
	char *section_name;
	struct bpf_insn *insns;
127
	size_t insns_cnt, main_prog_cnt;
128
	enum bpf_prog_type type;
129

130 131 132 133 134
	struct reloc_desc {
		enum {
			RELO_LD64,
			RELO_CALL,
		} type;
135
		int insn_idx;
136 137 138 139
		union {
			int map_idx;
			int text_off;
		};
140 141
	} *reloc_desc;
	int nr_reloc;
142

143 144 145 146 147
	struct {
		int nr;
		int *fds;
	} instances;
	bpf_program_prep_t preprocessor;
148 149 150 151

	struct bpf_object *obj;
	void *priv;
	bpf_program_clear_priv_t clear_priv;
152 153

	enum bpf_attach_type expected_attach_type;
154 155
};

156 157
struct bpf_map {
	int fd;
158
	char *name;
E
Eric Leblond 已提交
159
	size_t offset;
160
	int map_ifindex;
161
	struct bpf_map_def def;
162 163
	__u32 btf_key_type_id;
	__u32 btf_value_type_id;
164 165 166 167
	void *priv;
	bpf_map_clear_priv_t clear_priv;
};

168 169
static LIST_HEAD(bpf_objects_list);

170
struct bpf_object {
171
	char license[64];
172
	__u32 kern_version;
173

174 175
	struct bpf_program *programs;
	size_t nr_programs;
176 177 178
	struct bpf_map *maps;
	size_t nr_maps;

179
	bool loaded;
180
	bool has_pseudo_calls;
181

182 183 184 185 186 187
	/*
	 * Information when doing elf related work. Only valid if fd
	 * is valid.
	 */
	struct {
		int fd;
188 189
		void *obj_buf;
		size_t obj_buf_sz;
190 191
		Elf *elf;
		GElf_Ehdr ehdr;
192
		Elf_Data *symbols;
193
		size_t strtabidx;
194 195 196 197 198
		struct {
			GElf_Shdr shdr;
			Elf_Data *data;
		} *reloc;
		int nr_reloc;
199
		int maps_shndx;
200
		int text_shndx;
201
	} efile;
202 203 204 205 206 207
	/*
	 * 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;
208

209 210
	struct btf *btf;

211 212 213
	void *priv;
	bpf_object_clear_priv_t clear_priv;

214 215 216 217
	char path[];
};
#define obj_elf_valid(o)	((o)->efile.elf)

218
void bpf_program__unload(struct bpf_program *prog)
219
{
220 221
	int i;

222 223 224
	if (!prog)
		return;

225 226 227 228 229 230 231 232 233 234 235 236 237 238
	/*
	 * 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) {
		pr_warning("Internal error: instances.nr is %d\n",
			   prog->instances.nr);
	}

	prog->instances.nr = -1;
	zfree(&prog->instances.fds);
239 240
}

241 242 243 244 245
static void bpf_program__exit(struct bpf_program *prog)
{
	if (!prog)
		return;

246 247 248 249 250 251
	if (prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

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

252
	bpf_program__unload(prog);
253
	zfree(&prog->name);
254 255
	zfree(&prog->section_name);
	zfree(&prog->insns);
256 257 258
	zfree(&prog->reloc_desc);

	prog->nr_reloc = 0;
259 260 261 262 263
	prog->insns_cnt = 0;
	prog->idx = -1;
}

static int
264 265
bpf_program__init(void *data, size_t size, char *section_name, int idx,
		  struct bpf_program *prog)
266 267
{
	if (size < sizeof(struct bpf_insn)) {
268
		pr_warning("corrupted section '%s'\n", section_name);
269 270 271 272 273
		return -EINVAL;
	}

	bzero(prog, sizeof(*prog));

274
	prog->section_name = strdup(section_name);
275
	if (!prog->section_name) {
276 277
		pr_warning("failed to alloc name for prog under section(%d) %s\n",
			   idx, section_name);
278 279 280 281 282
		goto errout;
	}

	prog->insns = malloc(size);
	if (!prog->insns) {
283 284
		pr_warning("failed to alloc insns for prog under section %s\n",
			   section_name);
285 286 287 288 289 290
		goto errout;
	}
	prog->insns_cnt = size / sizeof(struct bpf_insn);
	memcpy(prog->insns, data,
	       prog->insns_cnt * sizeof(struct bpf_insn));
	prog->idx = idx;
291 292
	prog->instances.fds = NULL;
	prog->instances.nr = -1;
293
	prog->type = BPF_PROG_TYPE_KPROBE;
294 295 296 297 298 299 300 301 302

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

static int
bpf_object__add_program(struct bpf_object *obj, void *data, size_t size,
303
			char *section_name, int idx)
304 305 306 307
{
	struct bpf_program prog, *progs;
	int nr_progs, err;

308
	err = bpf_program__init(data, size, section_name, idx, &prog);
309 310 311 312 313 314
	if (err)
		return err;

	progs = obj->programs;
	nr_progs = obj->nr_programs;

315
	progs = reallocarray(progs, nr_progs + 1, sizeof(progs[0]));
316 317 318 319 320 321
	if (!progs) {
		/*
		 * In this case the original obj->programs
		 * is still valid, so don't need special treat for
		 * bpf_close_object().
		 */
322 323
		pr_warning("failed to alloc a new program under section '%s'\n",
			   section_name);
324 325 326 327 328 329 330
		bpf_program__exit(&prog);
		return -ENOMEM;
	}

	pr_debug("found program %s\n", prog.section_name);
	obj->programs = progs;
	obj->nr_programs = nr_progs + 1;
331
	prog.obj = obj;
332 333 334 335
	progs[nr_progs] = prog;
	return 0;
}

336 337 338 339 340 341 342 343
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++) {
344
		const char *name = NULL;
345 346 347 348 349 350 351 352 353 354 355

		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;
356 357
			if (GELF_ST_BIND(sym.st_info) != STB_GLOBAL)
				continue;
358 359 360 361 362 363 364 365 366 367 368

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

369 370 371
		if (!name && prog->idx == obj->efile.text_shndx)
			name = ".text";

372 373 374 375 376
		if (!name) {
			pr_warning("failed to find sym for prog %s\n",
				   prog->section_name);
			return -EINVAL;
		}
377

378 379 380 381 382 383 384 385 386 387 388
		prog->name = strdup(name);
		if (!prog->name) {
			pr_warning("failed to allocate memory for prog sym %s\n",
				   name);
			return -ENOMEM;
		}
	}

	return 0;
}

389 390 391
static struct bpf_object *bpf_object__new(const char *path,
					  void *obj_buf,
					  size_t obj_buf_sz)
392 393 394 395 396 397
{
	struct bpf_object *obj;

	obj = calloc(1, sizeof(struct bpf_object) + strlen(path) + 1);
	if (!obj) {
		pr_warning("alloc memory failed for %s\n", path);
398
		return ERR_PTR(-ENOMEM);
399 400 401 402
	}

	strcpy(obj->path, path);
	obj->efile.fd = -1;
403 404 405 406 407 408 409 410 411

	/*
	 * Caller of this function should also calls
	 * 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;
412
	obj->efile.maps_shndx = -1;
413

414
	obj->loaded = false;
415 416 417

	INIT_LIST_HEAD(&obj->list);
	list_add(&obj->list, &bpf_objects_list);
418 419 420 421 422 423 424 425 426 427 428 429
	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;
	}
430
	obj->efile.symbols = NULL;
431 432 433

	zfree(&obj->efile.reloc);
	obj->efile.nr_reloc = 0;
434
	zclose(obj->efile.fd);
435 436
	obj->efile.obj_buf = NULL;
	obj->efile.obj_buf_sz = 0;
437 438 439 440 441 442 443 444 445
}

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

	if (obj_elf_valid(obj)) {
		pr_warning("elf init: internal error\n");
446
		return -LIBBPF_ERRNO__LIBELF;
447 448
	}

449 450 451 452 453 454 455 456 457 458
	if (obj->efile.obj_buf_sz > 0) {
		/*
		 * obj_buf should have been validated by
		 * bpf_object__open_buffer().
		 */
		obj->efile.elf = elf_memory(obj->efile.obj_buf,
					    obj->efile.obj_buf_sz);
	} else {
		obj->efile.fd = open(obj->path, O_RDONLY);
		if (obj->efile.fd < 0) {
459
			char errmsg[STRERR_BUFSIZE];
460 461
			char *cp = libbpf_strerror_r(errno, errmsg,
						     sizeof(errmsg));
462 463

			pr_warning("failed to open %s: %s\n", obj->path, cp);
464 465 466 467 468 469
			return -errno;
		}

		obj->efile.elf = elf_begin(obj->efile.fd,
				LIBBPF_ELF_C_READ_MMAP,
				NULL);
470 471 472 473 474
	}

	if (!obj->efile.elf) {
		pr_warning("failed to open %s as ELF file\n",
				obj->path);
475
		err = -LIBBPF_ERRNO__LIBELF;
476 477 478 479 480 481
		goto errout;
	}

	if (!gelf_getehdr(obj->efile.elf, &obj->efile.ehdr)) {
		pr_warning("failed to get EHDR from %s\n",
				obj->path);
482
		err = -LIBBPF_ERRNO__FORMAT;
483 484 485 486
		goto errout;
	}
	ep = &obj->efile.ehdr;

487 488
	/* Old LLVM set e_machine to EM_NONE */
	if ((ep->e_type != ET_REL) || (ep->e_machine && (ep->e_machine != EM_BPF))) {
489 490
		pr_warning("%s is not an eBPF object file\n",
			obj->path);
491
		err = -LIBBPF_ERRNO__FORMAT;
492 493 494 495 496 497 498 499 500
		goto errout;
	}

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

501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518
static int
bpf_object__check_endianness(struct bpf_object *obj)
{
	static unsigned int const endian = 1;

	switch (obj->efile.ehdr.e_ident[EI_DATA]) {
	case ELFDATA2LSB:
		/* We are big endian, BPF obj is little endian. */
		if (*(unsigned char const *)&endian != 1)
			goto mismatch;
		break;

	case ELFDATA2MSB:
		/* We are little endian, BPF obj is big endian. */
		if (*(unsigned char const *)&endian != 0)
			goto mismatch;
		break;
	default:
519
		return -LIBBPF_ERRNO__ENDIAN;
520 521 522 523 524 525
	}

	return 0;

mismatch:
	pr_warning("Error: endianness mismatch.\n");
526
	return -LIBBPF_ERRNO__ENDIAN;
527 528
}

529 530 531 532 533 534 535 536 537 538 539 540 541 542
static int
bpf_object__init_license(struct bpf_object *obj,
			 void *data, size_t size)
{
	memcpy(obj->license, data,
	       min(size, sizeof(obj->license) - 1));
	pr_debug("license of %s is %s\n", obj->path, obj->license);
	return 0;
}

static int
bpf_object__init_kversion(struct bpf_object *obj,
			  void *data, size_t size)
{
543
	__u32 kver;
544 545 546

	if (size != sizeof(kver)) {
		pr_warning("invalid kver section in %s\n", obj->path);
547
		return -LIBBPF_ERRNO__FORMAT;
548 549 550 551 552 553 554 555
	}
	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;
}

E
Eric Leblond 已提交
556 557 558 559
static int compare_bpf_map(const void *_a, const void *_b)
{
	const struct bpf_map *a = _a;
	const struct bpf_map *b = _b;
560

E
Eric Leblond 已提交
561
	return a->offset - b->offset;
562 563
}

564
static int
E
Eric Leblond 已提交
565
bpf_object__init_maps(struct bpf_object *obj)
566
{
567
	int i, map_idx, map_def_sz, nr_maps = 0;
E
Eric Leblond 已提交
568 569
	Elf_Scn *scn;
	Elf_Data *data;
570 571
	Elf_Data *symbols = obj->efile.symbols;

E
Eric Leblond 已提交
572 573 574 575 576 577 578 579 580 581 582
	if (obj->efile.maps_shndx < 0)
		return -EINVAL;
	if (!symbols)
		return -EINVAL;

	scn = elf_getscn(obj->efile.elf, obj->efile.maps_shndx);
	if (scn)
		data = elf_getdata(scn, NULL);
	if (!scn || !data) {
		pr_warning("failed to get Elf_Data from map section %d\n",
			   obj->efile.maps_shndx);
583
		return -EINVAL;
E
Eric Leblond 已提交
584
	}
585

E
Eric Leblond 已提交
586 587 588 589 590 591 592
	/*
	 * 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.
	 */
593 594
	for (i = 0; i < symbols->d_size / sizeof(GElf_Sym); i++) {
		GElf_Sym sym;
E
Eric Leblond 已提交
595 596 597 598 599 600 601 602 603 604 605 606 607 608 609

		if (!gelf_getsym(symbols, i, &sym))
			continue;
		if (sym.st_shndx != obj->efile.maps_shndx)
			continue;
		nr_maps++;
	}

	/* Alloc obj->maps and fill nr_maps. */
	pr_debug("maps in %s: %d maps in %zd bytes\n", obj->path,
		 nr_maps, data->d_size);

	if (!nr_maps)
		return 0;

610 611 612 613 614 615 616 617 618
	/* Assume equally sized map definitions */
	map_def_sz = data->d_size / nr_maps;
	if (!data->d_size || (data->d_size % nr_maps) != 0) {
		pr_warning("unable to determine map definition size "
			   "section %s, %d maps in %zd bytes\n",
			   obj->path, nr_maps, data->d_size);
		return -EINVAL;
	}

E
Eric Leblond 已提交
619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638
	obj->maps = calloc(nr_maps, sizeof(obj->maps[0]));
	if (!obj->maps) {
		pr_warning("alloc maps for object failed\n");
		return -ENOMEM;
	}
	obj->nr_maps = nr_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 = 0; i < nr_maps; i++)
		obj->maps[i].fd = -1;

	/*
	 * Fill obj->maps using data in "maps" section.
	 */
	for (i = 0, map_idx = 0; i < symbols->d_size / sizeof(GElf_Sym); i++) {
		GElf_Sym sym;
639
		const char *map_name;
E
Eric Leblond 已提交
640
		struct bpf_map_def *def;
641 642 643

		if (!gelf_getsym(symbols, i, &sym))
			continue;
644
		if (sym.st_shndx != obj->efile.maps_shndx)
645 646 647
			continue;

		map_name = elf_strptr(obj->efile.elf,
648
				      obj->efile.strtabidx,
649
				      sym.st_name);
E
Eric Leblond 已提交
650
		obj->maps[map_idx].offset = sym.st_value;
651
		if (sym.st_value + map_def_sz > data->d_size) {
E
Eric Leblond 已提交
652 653 654
			pr_warning("corrupted maps section in %s: last map \"%s\" too small\n",
				   obj->path, map_name);
			return -EINVAL;
655
		}
E
Eric Leblond 已提交
656

657
		obj->maps[map_idx].name = strdup(map_name);
658 659 660 661
		if (!obj->maps[map_idx].name) {
			pr_warning("failed to alloc map name\n");
			return -ENOMEM;
		}
E
Eric Leblond 已提交
662
		pr_debug("map %d is \"%s\"\n", map_idx,
663
			 obj->maps[map_idx].name);
E
Eric Leblond 已提交
664
		def = (struct bpf_map_def *)(data->d_buf + sym.st_value);
665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693
		/*
		 * 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)) {
			memcpy(&obj->maps[map_idx].def, def, map_def_sz);
		} 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;
			for (b = ((char *)def) + sizeof(struct bpf_map_def);
			     b < ((char *)def) + map_def_sz; b++) {
				if (*b != 0) {
					pr_warning("maps section in %s: \"%s\" "
						   "has unrecognized, non-zero "
						   "options\n",
						   obj->path, map_name);
					return -EINVAL;
				}
			}
			memcpy(&obj->maps[map_idx].def, def,
			       sizeof(struct bpf_map_def));
		}
E
Eric Leblond 已提交
694
		map_idx++;
695
	}
E
Eric Leblond 已提交
696 697

	qsort(obj->maps, obj->nr_maps, sizeof(obj->maps[0]), compare_bpf_map);
698
	return 0;
699 700
}

701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718
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;
}

719 720 721 722 723
static int bpf_object__elf_collect(struct bpf_object *obj)
{
	Elf *elf = obj->efile.elf;
	GElf_Ehdr *ep = &obj->efile.ehdr;
	Elf_Scn *scn = NULL;
724
	int idx = 0, err = 0;
725 726 727 728 729

	/* Elf is corrupted/truncated, avoid calling elf_strptr. */
	if (!elf_rawdata(elf_getscn(elf, ep->e_shstrndx), NULL)) {
		pr_warning("failed to get e_shstrndx from %s\n",
			   obj->path);
730
		return -LIBBPF_ERRNO__FORMAT;
731 732 733 734 735 736 737 738 739
	}

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

		idx++;
		if (gelf_getshdr(scn, &sh) != &sh) {
740 741
			pr_warning("failed to get section(%d) header from %s\n",
				   idx, obj->path);
742
			err = -LIBBPF_ERRNO__FORMAT;
743 744 745 746 747
			goto out;
		}

		name = elf_strptr(elf, ep->e_shstrndx, sh.sh_name);
		if (!name) {
748 749
			pr_warning("failed to get section(%d) name from %s\n",
				   idx, obj->path);
750
			err = -LIBBPF_ERRNO__FORMAT;
751 752 753 754 755
			goto out;
		}

		data = elf_getdata(scn, 0);
		if (!data) {
756 757
			pr_warning("failed to get section(%d) data from %s(%s)\n",
				   idx, name, obj->path);
758
			err = -LIBBPF_ERRNO__FORMAT;
759 760
			goto out;
		}
761 762
		pr_debug("section(%d) %s, size %ld, link %d, flags %lx, type=%d\n",
			 idx, name, (unsigned long)data->d_size,
763 764
			 (int)sh.sh_link, (unsigned long)sh.sh_flags,
			 (int)sh.sh_type);
765 766 767 768 769 770 771 772 773

		if (strcmp(name, "license") == 0)
			err = bpf_object__init_license(obj,
						       data->d_buf,
						       data->d_size);
		else if (strcmp(name, "version") == 0)
			err = bpf_object__init_kversion(obj,
							data->d_buf,
							data->d_size);
E
Eric Leblond 已提交
774
		else if (strcmp(name, "maps") == 0)
775
			obj->efile.maps_shndx = idx;
776 777 778 779 780 781 782 783 784
		else if (strcmp(name, BTF_ELF_SEC) == 0) {
			obj->btf = btf__new(data->d_buf, data->d_size,
					    __pr_debug);
			if (IS_ERR(obj->btf)) {
				pr_warning("Error loading ELF section %s: %ld. Ignored and continue.\n",
					   BTF_ELF_SEC, PTR_ERR(obj->btf));
				obj->btf = NULL;
			}
		} else if (sh.sh_type == SHT_SYMTAB) {
785 786 787
			if (obj->efile.symbols) {
				pr_warning("bpf: multiple SYMTAB in %s\n",
					   obj->path);
788
				err = -LIBBPF_ERRNO__FORMAT;
789
			} else {
790
				obj->efile.symbols = data;
791 792
				obj->efile.strtabidx = sh.sh_link;
			}
793 794 795
		} else if ((sh.sh_type == SHT_PROGBITS) &&
			   (sh.sh_flags & SHF_EXECINSTR) &&
			   (data->d_size > 0)) {
796 797
			if (strcmp(name, ".text") == 0)
				obj->efile.text_shndx = idx;
798 799 800
			err = bpf_object__add_program(obj, data->d_buf,
						      data->d_size, name, idx);
			if (err) {
801
				char errmsg[STRERR_BUFSIZE];
802 803
				char *cp = libbpf_strerror_r(-err, errmsg,
							     sizeof(errmsg));
804

805
				pr_warning("failed to alloc program %s (%s): %s",
806
					   name, obj->path, cp);
807
			}
808 809 810
		} else if (sh.sh_type == SHT_REL) {
			void *reloc = obj->efile.reloc;
			int nr_reloc = obj->efile.nr_reloc + 1;
811 812 813 814 815 816 817 818
			int sec = sh.sh_info; /* points to other section */

			/* Only do relo for section with exec instructions */
			if (!section_have_execinstr(obj, sec)) {
				pr_debug("skip relo %s(%d) for section(%d)\n",
					 name, idx, sec);
				continue;
			}
819

820 821
			reloc = reallocarray(reloc, nr_reloc,
					     sizeof(*obj->efile.reloc));
822 823 824 825 826 827 828 829 830 831 832 833
			if (!reloc) {
				pr_warning("realloc failed\n");
				err = -ENOMEM;
			} else {
				int n = nr_reloc - 1;

				obj->efile.reloc = reloc;
				obj->efile.nr_reloc = nr_reloc;

				obj->efile.reloc[n].shdr = sh;
				obj->efile.reloc[n].data = data;
			}
834 835
		} else {
			pr_debug("skip section(%d) %s\n", idx, name);
836
		}
837 838
		if (err)
			goto out;
839
	}
840

841 842 843 844
	if (!obj->efile.strtabidx || obj->efile.strtabidx >= idx) {
		pr_warning("Corrupted ELF file: index of strtab invalid\n");
		return LIBBPF_ERRNO__FORMAT;
	}
845
	if (obj->efile.maps_shndx >= 0) {
E
Eric Leblond 已提交
846
		err = bpf_object__init_maps(obj);
847 848 849 850
		if (err)
			goto out;
	}
	err = bpf_object__init_prog_names(obj);
851 852 853 854
out:
	return err;
}

855 856 857 858 859 860 861 862 863 864 865 866 867 868
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;
}

869 870 871 872 873 874 875 876 877 878 879 880
struct bpf_program *
bpf_object__find_program_by_title(struct bpf_object *obj, const char *title)
{
	struct bpf_program *pos;

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

881
static int
882 883
bpf_program__collect_reloc(struct bpf_program *prog, GElf_Shdr *shdr,
			   Elf_Data *data, struct bpf_object *obj)
884
{
885 886 887 888 889
	Elf_Data *symbols = obj->efile.symbols;
	int text_shndx = obj->efile.text_shndx;
	int maps_shndx = obj->efile.maps_shndx;
	struct bpf_map *maps = obj->maps;
	size_t nr_maps = obj->nr_maps;
890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911
	int i, nrels;

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

	prog->reloc_desc = malloc(sizeof(*prog->reloc_desc) * nrels);
	if (!prog->reloc_desc) {
		pr_warning("failed to alloc memory in relocation\n");
		return -ENOMEM;
	}
	prog->nr_reloc = nrels;

	for (i = 0; i < nrels; i++) {
		GElf_Sym sym;
		GElf_Rel rel;
		unsigned int insn_idx;
		struct bpf_insn *insns = prog->insns;
		size_t map_idx;

		if (!gelf_getrel(data, i, &rel)) {
			pr_warning("relocation: failed to get %d reloc\n", i);
912
			return -LIBBPF_ERRNO__FORMAT;
913 914 915 916 917 918 919
		}

		if (!gelf_getsym(symbols,
				 GELF_R_SYM(rel.r_info),
				 &sym)) {
			pr_warning("relocation: symbol %"PRIx64" not found\n",
				   GELF_R_SYM(rel.r_info));
920
			return -LIBBPF_ERRNO__FORMAT;
921
		}
D
David Miller 已提交
922 923 924
		pr_debug("relo for %lld value %lld name %d\n",
			 (long long) (rel.r_info >> 32),
			 (long long) sym.st_value, sym.st_name);
925

926
		if (sym.st_shndx != maps_shndx && sym.st_shndx != text_shndx) {
927 928 929 930 931 932 933 934
			pr_warning("Program '%s' contains non-map related relo data pointing to section %u\n",
				   prog->section_name, sym.st_shndx);
			return -LIBBPF_ERRNO__RELOC;
		}

		insn_idx = rel.r_offset / sizeof(struct bpf_insn);
		pr_debug("relocation: insn_idx=%u\n", insn_idx);

935 936 937 938 939 940 941 942
		if (insns[insn_idx].code == (BPF_JMP | BPF_CALL)) {
			if (insns[insn_idx].src_reg != BPF_PSEUDO_CALL) {
				pr_warning("incorrect bpf_call opcode\n");
				return -LIBBPF_ERRNO__RELOC;
			}
			prog->reloc_desc[i].type = RELO_CALL;
			prog->reloc_desc[i].insn_idx = insn_idx;
			prog->reloc_desc[i].text_off = sym.st_value;
943
			obj->has_pseudo_calls = true;
944 945 946
			continue;
		}

947 948 949
		if (insns[insn_idx].code != (BPF_LD | BPF_IMM | BPF_DW)) {
			pr_warning("bpf: relocation: invalid relo for insns[%d].code 0x%x\n",
				   insn_idx, insns[insn_idx].code);
950
			return -LIBBPF_ERRNO__RELOC;
951 952
		}

953 954 955 956 957 958 959 960 961
		/* TODO: 'maps' is sorted. We can use bsearch to make it faster. */
		for (map_idx = 0; map_idx < nr_maps; map_idx++) {
			if (maps[map_idx].offset == sym.st_value) {
				pr_debug("relocation: find map %zd (%s) for insn %u\n",
					 map_idx, maps[map_idx].name, insn_idx);
				break;
			}
		}

962 963 964
		if (map_idx >= nr_maps) {
			pr_warning("bpf relocation: map_idx %d large than %d\n",
				   (int)map_idx, (int)nr_maps - 1);
965
			return -LIBBPF_ERRNO__RELOC;
966 967
		}

968
		prog->reloc_desc[i].type = RELO_LD64;
969 970 971 972 973 974
		prog->reloc_desc[i].insn_idx = insn_idx;
		prog->reloc_desc[i].map_idx = map_idx;
	}
	return 0;
}

975 976
static int bpf_map_find_btf_info(struct bpf_map *map, const struct btf *btf)
{
977 978
	const struct btf_type *container_type;
	const struct btf_member *key, *value;
979 980
	struct bpf_map_def *def = &map->def;
	const size_t max_name = 256;
981
	char container_name[max_name];
982
	__s64 key_size, value_size;
983
	__s32 container_id;
984

985 986 987
	if (snprintf(container_name, max_name, "____btf_map_%s", map->name) ==
	    max_name) {
		pr_warning("map:%s length of '____btf_map_%s' is too long\n",
988 989 990 991
			   map->name, map->name);
		return -EINVAL;
	}

992 993 994 995 996
	container_id = btf__find_by_name(btf, container_name);
	if (container_id < 0) {
		pr_debug("map:%s container_name:%s cannot be found in BTF. Missing BPF_ANNOTATE_KV_PAIR?\n",
			 map->name, container_name);
		return container_id;
997 998
	}

999 1000 1001 1002 1003
	container_type = btf__type_by_id(btf, container_id);
	if (!container_type) {
		pr_warning("map:%s cannot find BTF type for container_id:%u\n",
			   map->name, container_id);
		return -EINVAL;
1004 1005
	}

1006 1007 1008 1009
	if (BTF_INFO_KIND(container_type->info) != BTF_KIND_STRUCT ||
	    BTF_INFO_VLEN(container_type->info) < 2) {
		pr_warning("map:%s container_name:%s is an invalid container struct\n",
			   map->name, container_name);
1010 1011 1012
		return -EINVAL;
	}

1013 1014 1015 1016 1017 1018 1019 1020
	key = (struct btf_member *)(container_type + 1);
	value = key + 1;

	key_size = btf__resolve_size(btf, key->type);
	if (key_size < 0) {
		pr_warning("map:%s invalid BTF key_type_size\n",
			   map->name);
		return key_size;
1021 1022
	}

1023 1024 1025 1026
	if (def->key_size != key_size) {
		pr_warning("map:%s btf_key_type_size:%u != map_def_key_size:%u\n",
			   map->name, (__u32)key_size, def->key_size);
		return -EINVAL;
1027 1028
	}

1029
	value_size = btf__resolve_size(btf, value->type);
1030
	if (value_size < 0) {
1031
		pr_warning("map:%s invalid BTF value_type_size\n", map->name);
1032 1033 1034 1035
		return value_size;
	}

	if (def->value_size != value_size) {
1036 1037
		pr_warning("map:%s btf_value_type_size:%u != map_def_value_size:%u\n",
			   map->name, (__u32)value_size, def->value_size);
1038 1039 1040
		return -EINVAL;
	}

1041 1042
	map->btf_key_type_id = key->type;
	map->btf_value_type_id = value->type;
1043 1044 1045 1046

	return 0;
}

J
Jakub Kicinski 已提交
1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093
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);
	if (new_fd < 0)
		goto err_free_new_name;

	new_fd = dup3(fd, new_fd, O_CLOEXEC);
	if (new_fd < 0)
		goto err_close_new_fd;

	err = zclose(map->fd);
	if (err)
		goto err_close_new_fd;
	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;

	return 0;

err_close_new_fd:
	close(new_fd);
err_free_new_name:
	free(new_name);
	return -errno;
}

1094 1095 1096
static int
bpf_object__create_maps(struct bpf_object *obj)
{
1097
	struct bpf_create_map_attr create_attr = {};
1098
	unsigned int i;
1099
	int err;
1100

1101
	for (i = 0; i < obj->nr_maps; i++) {
1102 1103
		struct bpf_map *map = &obj->maps[i];
		struct bpf_map_def *def = &map->def;
1104
		char *cp, errmsg[STRERR_BUFSIZE];
1105 1106
		int *pfd = &map->fd;

J
Jakub Kicinski 已提交
1107 1108 1109 1110 1111 1112
		if (map->fd >= 0) {
			pr_debug("skip map create (preset) %s: fd=%d\n",
				 map->name, map->fd);
			continue;
		}

1113
		create_attr.name = map->name;
1114
		create_attr.map_ifindex = map->map_ifindex;
1115 1116 1117 1118 1119 1120
		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;
		create_attr.max_entries = def->max_entries;
		create_attr.btf_fd = 0;
1121 1122
		create_attr.btf_key_type_id = 0;
		create_attr.btf_value_type_id = 0;
1123 1124 1125

		if (obj->btf && !bpf_map_find_btf_info(map, obj->btf)) {
			create_attr.btf_fd = btf__fd(obj->btf);
1126 1127
			create_attr.btf_key_type_id = map->btf_key_type_id;
			create_attr.btf_value_type_id = map->btf_value_type_id;
1128 1129 1130
		}

		*pfd = bpf_create_map_xattr(&create_attr);
1131
		if (*pfd < 0 && create_attr.btf_key_type_id) {
1132
			cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
1133
			pr_warning("Error in bpf_create_map_xattr(%s):%s(%d). Retrying without BTF.\n",
1134
				   map->name, cp, errno);
1135
			create_attr.btf_fd = 0;
1136 1137 1138 1139
			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;
1140 1141 1142
			*pfd = bpf_create_map_xattr(&create_attr);
		}

1143 1144 1145
		if (*pfd < 0) {
			size_t j;

1146
			err = *pfd;
1147
			cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
E
Eric Leblond 已提交
1148
			pr_warning("failed to create map (name: '%s'): %s\n",
1149
				   map->name, cp);
1150
			for (j = 0; j < i; j++)
1151
				zclose(obj->maps[j].fd);
1152 1153
			return err;
		}
1154
		pr_debug("create map %s: fd=%d\n", map->name, *pfd);
1155 1156 1157 1158 1159
	}

	return 0;
}

1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183
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;

	if (relo->type != RELO_CALL)
		return -LIBBPF_ERRNO__RELOC;

	if (prog->idx == obj->efile.text_shndx) {
		pr_warning("relo in .text insn %d into off %d\n",
			   relo->insn_idx, relo->text_off);
		return -LIBBPF_ERRNO__RELOC;
	}

	if (prog->main_prog_cnt == 0) {
		text = bpf_object__find_prog_by_idx(obj, obj->efile.text_shndx);
		if (!text) {
			pr_warning("no .text section found yet relo into text exist\n");
			return -LIBBPF_ERRNO__RELOC;
		}
		new_cnt = prog->insns_cnt + text->insns_cnt;
1184
		new_insn = reallocarray(prog->insns, new_cnt, sizeof(*insn));
1185 1186 1187 1188 1189 1190 1191 1192 1193
		if (!new_insn) {
			pr_warning("oom in prog realloc\n");
			return -ENOMEM;
		}
		memcpy(new_insn + prog->insns_cnt, text->insns,
		       text->insns_cnt * sizeof(*insn));
		prog->insns = new_insn;
		prog->main_prog_cnt = prog->insns_cnt;
		prog->insns_cnt = new_cnt;
1194 1195 1196
		pr_debug("added %zd insn from %s to prog %s\n",
			 text->insns_cnt, text->section_name,
			 prog->section_name);
1197 1198 1199 1200 1201 1202
	}
	insn = &prog->insns[relo->insn_idx];
	insn->imm += prog->main_prog_cnt - relo->insn_idx;
	return 0;
}

W
Wang Nan 已提交
1203
static int
1204
bpf_program__relocate(struct bpf_program *prog, struct bpf_object *obj)
W
Wang Nan 已提交
1205
{
1206
	int i, err;
W
Wang Nan 已提交
1207 1208 1209 1210 1211

	if (!prog || !prog->reloc_desc)
		return 0;

	for (i = 0; i < prog->nr_reloc; i++) {
1212 1213 1214
		if (prog->reloc_desc[i].type == RELO_LD64) {
			struct bpf_insn *insns = prog->insns;
			int insn_idx, map_idx;
W
Wang Nan 已提交
1215

1216 1217
			insn_idx = prog->reloc_desc[i].insn_idx;
			map_idx = prog->reloc_desc[i].map_idx;
W
Wang Nan 已提交
1218

1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230
			if (insn_idx >= (int)prog->insns_cnt) {
				pr_warning("relocation out of range: '%s'\n",
					   prog->section_name);
				return -LIBBPF_ERRNO__RELOC;
			}
			insns[insn_idx].src_reg = BPF_PSEUDO_MAP_FD;
			insns[insn_idx].imm = obj->maps[map_idx].fd;
		} else {
			err = bpf_program__reloc_text(prog, obj,
						      &prog->reloc_desc[i]);
			if (err)
				return err;
W
Wang Nan 已提交
1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249
		}
	}

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


static int
bpf_object__relocate(struct bpf_object *obj)
{
	struct bpf_program *prog;
	size_t i;
	int err;

	for (i = 0; i < obj->nr_programs; i++) {
		prog = &obj->programs[i];

1250
		err = bpf_program__relocate(prog, obj);
W
Wang Nan 已提交
1251 1252 1253 1254 1255 1256 1257 1258 1259
		if (err) {
			pr_warning("failed to relocate '%s'\n",
				   prog->section_name);
			return err;
		}
	}
	return 0;
}

1260 1261 1262 1263 1264 1265
static int bpf_object__collect_reloc(struct bpf_object *obj)
{
	int i, err;

	if (!obj_elf_valid(obj)) {
		pr_warning("Internal error: elf object is closed\n");
1266
		return -LIBBPF_ERRNO__INTERNAL;
1267 1268 1269 1270 1271 1272 1273 1274 1275 1276
	}

	for (i = 0; i < obj->efile.nr_reloc; i++) {
		GElf_Shdr *shdr = &obj->efile.reloc[i].shdr;
		Elf_Data *data = obj->efile.reloc[i].data;
		int idx = shdr->sh_info;
		struct bpf_program *prog;

		if (shdr->sh_type != SHT_REL) {
			pr_warning("internal error at %d\n", __LINE__);
1277
			return -LIBBPF_ERRNO__INTERNAL;
1278 1279 1280 1281
		}

		prog = bpf_object__find_prog_by_idx(obj, idx);
		if (!prog) {
1282
			pr_warning("relocation failed: no section(%d)\n", idx);
1283
			return -LIBBPF_ERRNO__RELOC;
1284 1285
		}

1286
		err = bpf_program__collect_reloc(prog,
1287
						 shdr, data,
1288
						 obj);
1289
		if (err)
1290
			return err;
1291 1292 1293 1294
	}
	return 0;
}

1295
static int
1296 1297
load_program(enum bpf_prog_type type, enum bpf_attach_type expected_attach_type,
	     const char *name, struct bpf_insn *insns, int insns_cnt,
1298
	     char *license, __u32 kern_version, int *pfd, int prog_ifindex)
1299
{
1300
	struct bpf_load_program_attr load_attr;
1301
	char *cp, errmsg[STRERR_BUFSIZE];
1302
	char *log_buf;
1303
	int ret;
1304

1305 1306 1307 1308 1309 1310 1311 1312
	memset(&load_attr, 0, sizeof(struct bpf_load_program_attr));
	load_attr.prog_type = type;
	load_attr.expected_attach_type = expected_attach_type;
	load_attr.name = name;
	load_attr.insns = insns;
	load_attr.insns_cnt = insns_cnt;
	load_attr.license = license;
	load_attr.kern_version = kern_version;
1313
	load_attr.prog_ifindex = prog_ifindex;
1314 1315

	if (!load_attr.insns || !load_attr.insns_cnt)
1316 1317 1318 1319 1320 1321
		return -EINVAL;

	log_buf = malloc(BPF_LOG_BUF_SIZE);
	if (!log_buf)
		pr_warning("Alloc log buffer for bpf loader error, continue without log\n");

1322
	ret = bpf_load_program_xattr(&load_attr, log_buf, BPF_LOG_BUF_SIZE);
1323 1324 1325 1326 1327 1328 1329

	if (ret >= 0) {
		*pfd = ret;
		ret = 0;
		goto out;
	}

1330
	ret = -LIBBPF_ERRNO__LOAD;
1331
	cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
1332
	pr_warning("load bpf program failed: %s\n", cp);
1333

1334 1335
	if (log_buf && log_buf[0] != '\0') {
		ret = -LIBBPF_ERRNO__VERIFY;
1336 1337 1338
		pr_warning("-- BEGIN DUMP LOG ---\n");
		pr_warning("\n%s\n", log_buf);
		pr_warning("-- END LOG --\n");
1339 1340 1341
	} else if (load_attr.insns_cnt >= BPF_MAXINSNS) {
		pr_warning("Program too large (%zu insns), at most %d insns\n",
			   load_attr.insns_cnt, BPF_MAXINSNS);
1342
		ret = -LIBBPF_ERRNO__PROG2BIG;
1343
	} else {
1344
		/* Wrong program type? */
1345
		if (load_attr.prog_type != BPF_PROG_TYPE_KPROBE) {
1346 1347
			int fd;

1348 1349 1350
			load_attr.prog_type = BPF_PROG_TYPE_KPROBE;
			load_attr.expected_attach_type = 0;
			fd = bpf_load_program_xattr(&load_attr, NULL, 0);
1351 1352 1353 1354 1355
			if (fd >= 0) {
				close(fd);
				ret = -LIBBPF_ERRNO__PROGTYPE;
				goto out;
			}
1356
		}
1357 1358 1359

		if (log_buf)
			ret = -LIBBPF_ERRNO__KVER;
1360 1361 1362 1363 1364 1365 1366
	}

out:
	free(log_buf);
	return ret;
}

1367
int
1368
bpf_program__load(struct bpf_program *prog,
1369
		  char *license, __u32 kern_version)
1370
{
1371
	int err = 0, fd, i;
1372

1373 1374 1375 1376 1377 1378
	if (prog->instances.nr < 0 || !prog->instances.fds) {
		if (prog->preprocessor) {
			pr_warning("Internal error: can't load program '%s'\n",
				   prog->section_name);
			return -LIBBPF_ERRNO__INTERNAL;
		}
1379

1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393
		prog->instances.fds = malloc(sizeof(int));
		if (!prog->instances.fds) {
			pr_warning("Not enough memory for BPF fds\n");
			return -ENOMEM;
		}
		prog->instances.nr = 1;
		prog->instances.fds[0] = -1;
	}

	if (!prog->preprocessor) {
		if (prog->instances.nr != 1) {
			pr_warning("Program '%s' is inconsistent: nr(%d) != 1\n",
				   prog->section_name, prog->instances.nr);
		}
1394 1395
		err = load_program(prog->type, prog->expected_attach_type,
				   prog->name, prog->insns, prog->insns_cnt,
1396 1397
				   license, kern_version, &fd,
				   prog->prog_ifindex);
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
		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;

		bzero(&result, sizeof(result));
		err = preprocessor(prog, i, prog->insns,
				   prog->insns_cnt, &result);
		if (err) {
			pr_warning("Preprocessing the %dth instance of program '%s' failed\n",
				   i, prog->section_name);
			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;
		}

1425 1426
		err = load_program(prog->type, prog->expected_attach_type,
				   prog->name, result.new_insn_ptr,
1427
				   result.new_insn_cnt,
1428 1429
				   license, kern_version, &fd,
				   prog->prog_ifindex);
1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441

		if (err) {
			pr_warning("Loading the %dth instance of program '%s' failed\n",
					i, prog->section_name);
			goto out;
		}

		if (result.pfd)
			*result.pfd = fd;
		prog->instances.fds[i] = fd;
	}
out:
1442 1443 1444 1445 1446 1447 1448 1449
	if (err)
		pr_warning("failed to load program '%s'\n",
			   prog->section_name);
	zfree(&prog->insns);
	prog->insns_cnt = 0;
	return err;
}

1450 1451 1452 1453 1454 1455
static bool bpf_program__is_function_storage(struct bpf_program *prog,
					     struct bpf_object *obj)
{
	return prog->idx == obj->efile.text_shndx && obj->has_pseudo_calls;
}

1456 1457 1458 1459 1460 1461 1462
static int
bpf_object__load_progs(struct bpf_object *obj)
{
	size_t i;
	int err;

	for (i = 0; i < obj->nr_programs; i++) {
1463
		if (bpf_program__is_function_storage(&obj->programs[i], obj))
1464
			continue;
1465 1466 1467 1468 1469 1470 1471 1472 1473
		err = bpf_program__load(&obj->programs[i],
					obj->license,
					obj->kern_version);
		if (err)
			return err;
	}
	return 0;
}

1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485
static bool bpf_prog_type__needs_kver(enum bpf_prog_type type)
{
	switch (type) {
	case BPF_PROG_TYPE_SOCKET_FILTER:
	case BPF_PROG_TYPE_SCHED_CLS:
	case BPF_PROG_TYPE_SCHED_ACT:
	case BPF_PROG_TYPE_XDP:
	case BPF_PROG_TYPE_CGROUP_SKB:
	case BPF_PROG_TYPE_CGROUP_SOCK:
	case BPF_PROG_TYPE_LWT_IN:
	case BPF_PROG_TYPE_LWT_OUT:
	case BPF_PROG_TYPE_LWT_XMIT:
1486
	case BPF_PROG_TYPE_LWT_SEG6LOCAL:
1487 1488 1489 1490 1491
	case BPF_PROG_TYPE_SOCK_OPS:
	case BPF_PROG_TYPE_SK_SKB:
	case BPF_PROG_TYPE_CGROUP_DEVICE:
	case BPF_PROG_TYPE_SK_MSG:
	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
1492
	case BPF_PROG_TYPE_LIRC_MODE2:
1493
	case BPF_PROG_TYPE_SK_REUSEPORT:
1494
	case BPF_PROG_TYPE_FLOW_DISSECTOR:
1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506
		return false;
	case BPF_PROG_TYPE_UNSPEC:
	case BPF_PROG_TYPE_KPROBE:
	case BPF_PROG_TYPE_TRACEPOINT:
	case BPF_PROG_TYPE_PERF_EVENT:
	case BPF_PROG_TYPE_RAW_TRACEPOINT:
	default:
		return true;
	}
}

static int bpf_object__validate(struct bpf_object *obj, bool needs_kver)
1507
{
1508
	if (needs_kver && obj->kern_version == 0) {
1509 1510
		pr_warning("%s doesn't provide kernel version\n",
			   obj->path);
1511
		return -LIBBPF_ERRNO__KVERSION;
1512 1513 1514 1515
	}
	return 0;
}

1516
static struct bpf_object *
1517 1518
__bpf_object__open(const char *path, void *obj_buf, size_t obj_buf_sz,
		   bool needs_kver)
1519 1520
{
	struct bpf_object *obj;
1521
	int err;
1522 1523 1524

	if (elf_version(EV_CURRENT) == EV_NONE) {
		pr_warning("failed to init libelf for %s\n", path);
1525
		return ERR_PTR(-LIBBPF_ERRNO__LIBELF);
1526 1527
	}

1528
	obj = bpf_object__new(path, obj_buf, obj_buf_sz);
1529 1530
	if (IS_ERR(obj))
		return obj;
1531

1532 1533 1534 1535
	CHECK_ERR(bpf_object__elf_init(obj), err, out);
	CHECK_ERR(bpf_object__check_endianness(obj), err, out);
	CHECK_ERR(bpf_object__elf_collect(obj), err, out);
	CHECK_ERR(bpf_object__collect_reloc(obj), err, out);
1536
	CHECK_ERR(bpf_object__validate(obj, needs_kver), err, out);
1537 1538 1539 1540 1541

	bpf_object__elf_finish(obj);
	return obj;
out:
	bpf_object__close(obj);
1542
	return ERR_PTR(err);
1543 1544
}

1545
struct bpf_object *bpf_object__open_xattr(struct bpf_object_open_attr *attr)
1546 1547
{
	/* param validation */
1548
	if (!attr->file)
1549 1550
		return NULL;

1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562
	pr_debug("loading %s\n", attr->file);

	return __bpf_object__open(attr->file, NULL, 0,
				  bpf_prog_type__needs_kver(attr->prog_type));
}

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

1564
	return bpf_object__open_xattr(&attr);
1565 1566 1567
}

struct bpf_object *bpf_object__open_buffer(void *obj_buf,
1568 1569
					   size_t obj_buf_sz,
					   const char *name)
1570
{
1571 1572
	char tmp_name[64];

1573 1574 1575 1576
	/* param validation */
	if (!obj_buf || obj_buf_sz <= 0)
		return NULL;

1577 1578 1579 1580 1581 1582 1583 1584 1585
	if (!name) {
		snprintf(tmp_name, sizeof(tmp_name), "%lx-%lx",
			 (unsigned long)obj_buf,
			 (unsigned long)obj_buf_sz);
		tmp_name[sizeof(tmp_name) - 1] = '\0';
		name = tmp_name;
	}
	pr_debug("loading object '%s' from buffer\n",
		 name);
1586

1587
	return __bpf_object__open(name, obj_buf, obj_buf_sz, true);
1588 1589
}

1590 1591 1592 1593 1594 1595 1596
int bpf_object__unload(struct bpf_object *obj)
{
	size_t i;

	if (!obj)
		return -EINVAL;

1597 1598
	for (i = 0; i < obj->nr_maps; i++)
		zclose(obj->maps[i].fd);
1599

1600 1601 1602
	for (i = 0; i < obj->nr_programs; i++)
		bpf_program__unload(&obj->programs[i]);

1603 1604 1605 1606 1607
	return 0;
}

int bpf_object__load(struct bpf_object *obj)
{
1608 1609
	int err;

1610 1611 1612 1613 1614 1615 1616 1617 1618
	if (!obj)
		return -EINVAL;

	if (obj->loaded) {
		pr_warning("object should not be loaded twice\n");
		return -EINVAL;
	}

	obj->loaded = true;
1619 1620 1621 1622

	CHECK_ERR(bpf_object__create_maps(obj), err, out);
	CHECK_ERR(bpf_object__relocate(obj), err, out);
	CHECK_ERR(bpf_object__load_progs(obj), err, out);
1623 1624 1625 1626 1627

	return 0;
out:
	bpf_object__unload(obj);
	pr_warning("failed to load object '%s'\n", obj->path);
1628
	return err;
1629 1630
}

1631 1632
static int check_path(const char *path)
{
1633
	char *cp, errmsg[STRERR_BUFSIZE];
1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646
	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)) {
1647
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
1648
		pr_warning("failed to statfs %s: %s\n", dir, cp);
1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663
		err = -errno;
	}
	free(dname);

	if (!err && st_fs.f_type != BPF_FS_MAGIC) {
		pr_warning("specified path %s is not on BPF FS\n", path);
		err = -EINVAL;
	}

	return err;
}

int bpf_program__pin_instance(struct bpf_program *prog, const char *path,
			      int instance)
{
1664
	char *cp, errmsg[STRERR_BUFSIZE];
1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682
	int err;

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

	if (prog == NULL) {
		pr_warning("invalid program pointer\n");
		return -EINVAL;
	}

	if (instance < 0 || instance >= prog->instances.nr) {
		pr_warning("invalid prog instance %d of prog %s (max %d)\n",
			   instance, prog->section_name, prog->instances.nr);
		return -EINVAL;
	}

	if (bpf_obj_pin(prog->instances.fds[instance], path)) {
1683
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
1684
		pr_warning("failed to pin program: %s\n", cp);
1685 1686 1687 1688 1689 1690 1691 1692 1693
		return -errno;
	}
	pr_debug("pinned program '%s'\n", path);

	return 0;
}

static int make_dir(const char *path)
{
1694
	char *cp, errmsg[STRERR_BUFSIZE];
1695 1696 1697 1698 1699
	int err = 0;

	if (mkdir(path, 0700) && errno != EEXIST)
		err = -errno;

1700
	if (err) {
1701
		cp = libbpf_strerror_r(-err, errmsg, sizeof(errmsg));
1702 1703
		pr_warning("failed to mkdir %s: %s\n", path, cp);
	}
1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747
	return err;
}

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

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

	if (prog == NULL) {
		pr_warning("invalid program pointer\n");
		return -EINVAL;
	}

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

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

	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;

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

	return 0;
}

J
Joe Stringer 已提交
1748 1749
int bpf_map__pin(struct bpf_map *map, const char *path)
{
1750
	char *cp, errmsg[STRERR_BUFSIZE];
J
Joe Stringer 已提交
1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762
	int err;

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

	if (map == NULL) {
		pr_warning("invalid map pointer\n");
		return -EINVAL;
	}

	if (bpf_obj_pin(map->fd, path)) {
1763
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
1764
		pr_warning("failed to pin map: %s\n", cp);
J
Joe Stringer 已提交
1765 1766 1767 1768 1769 1770 1771
		return -errno;
	}

	pr_debug("pinned map '%s'\n", path);
	return 0;
}

1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824
int bpf_object__pin(struct bpf_object *obj, const char *path)
{
	struct bpf_program *prog;
	struct bpf_map *map;
	int err;

	if (!obj)
		return -ENOENT;

	if (!obj->loaded) {
		pr_warning("object not yet loaded; load it first\n");
		return -ENOENT;
	}

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

	bpf_map__for_each(map, obj) {
		char buf[PATH_MAX];
		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;

		err = bpf_map__pin(map, buf);
		if (err)
			return err;
	}

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

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

		err = bpf_program__pin(prog, buf);
		if (err)
			return err;
	}

	return 0;
}

1825 1826
void bpf_object__close(struct bpf_object *obj)
{
1827 1828
	size_t i;

1829 1830 1831
	if (!obj)
		return;

1832 1833 1834
	if (obj->clear_priv)
		obj->clear_priv(obj, obj->priv);

1835
	bpf_object__elf_finish(obj);
1836
	bpf_object__unload(obj);
1837
	btf__free(obj->btf);
1838

1839
	for (i = 0; i < obj->nr_maps; i++) {
1840
		zfree(&obj->maps[i].name);
1841 1842 1843 1844 1845 1846 1847 1848
		if (obj->maps[i].clear_priv)
			obj->maps[i].clear_priv(&obj->maps[i],
						obj->maps[i].priv);
		obj->maps[i].priv = NULL;
		obj->maps[i].clear_priv = NULL;
	}
	zfree(&obj->maps);
	obj->nr_maps = 0;
1849 1850 1851 1852 1853 1854 1855

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

1856
	list_del(&obj->list);
1857 1858
	free(obj);
}
1859

1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878
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;
}

1879
const char *bpf_object__name(struct bpf_object *obj)
1880
{
1881
	return obj ? obj->path : ERR_PTR(-EINVAL);
1882 1883
}

1884
unsigned int bpf_object__kversion(struct bpf_object *obj)
1885
{
1886
	return obj ? obj->kern_version : 0;
1887 1888
}

1889 1890 1891 1892 1893
int bpf_object__btf_fd(const struct bpf_object *obj)
{
	return obj->btf ? btf__fd(obj->btf) : -1;
}

1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909
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;
}

void *bpf_object__priv(struct bpf_object *obj)
{
	return obj ? obj->priv : ERR_PTR(-EINVAL);
}

1910 1911
static struct bpf_program *
__bpf_program__next(struct bpf_program *prev, struct bpf_object *obj)
1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931
{
	size_t idx;

	if (!obj->programs)
		return NULL;
	/* First handler */
	if (prev == NULL)
		return &obj->programs[0];

	if (prev->obj != obj) {
		pr_warning("error: program handler doesn't match object\n");
		return NULL;
	}

	idx = (prev - obj->programs) + 1;
	if (idx >= obj->nr_programs)
		return NULL;
	return &obj->programs[idx];
}

1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943
struct bpf_program *
bpf_program__next(struct bpf_program *prev, struct bpf_object *obj)
{
	struct bpf_program *prog = prev;

	do {
		prog = __bpf_program__next(prog, obj);
	} while (prog && bpf_program__is_function_storage(prog, obj));

	return prog;
}

1944 1945
int bpf_program__set_priv(struct bpf_program *prog, void *priv,
			  bpf_program_clear_priv_t clear_priv)
1946 1947 1948 1949 1950 1951 1952 1953 1954
{
	if (prog->priv && prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

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

1955
void *bpf_program__priv(struct bpf_program *prog)
1956
{
1957
	return prog ? prog->priv : ERR_PTR(-EINVAL);
1958 1959
}

1960 1961 1962 1963 1964
void bpf_program__set_ifindex(struct bpf_program *prog, __u32 ifindex)
{
	prog->prog_ifindex = ifindex;
}

1965
const char *bpf_program__title(struct bpf_program *prog, bool needs_copy)
1966 1967 1968 1969
{
	const char *title;

	title = prog->section_name;
1970
	if (needs_copy) {
1971 1972 1973
		title = strdup(title);
		if (!title) {
			pr_warning("failed to strdup program title\n");
1974
			return ERR_PTR(-ENOMEM);
1975 1976 1977 1978 1979 1980 1981 1982
		}
	}

	return title;
}

int bpf_program__fd(struct bpf_program *prog)
{
1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017
	return bpf_program__nth_fd(prog, 0);
}

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) {
		pr_warning("Can't set pre-processor after loading\n");
		return -EINVAL;
	}

	instances_fds = malloc(sizeof(int) * nr_instances);
	if (!instances_fds) {
		pr_warning("alloc memory failed for fds\n");
		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;
}

int bpf_program__nth_fd(struct bpf_program *prog, int n)
{
	int fd;

2018 2019 2020
	if (!prog)
		return -EINVAL;

2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034
	if (n >= prog->instances.nr || n < 0) {
		pr_warning("Can't get the %dth fd from program %s: only %d instances\n",
			   n, prog->section_name, prog->instances.nr);
		return -EINVAL;
	}

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

	return fd;
2035
}
2036

2037
void bpf_program__set_type(struct bpf_program *prog, enum bpf_prog_type type)
2038 2039 2040 2041 2042 2043 2044 2045 2046 2047
{
	prog->type = type;
}

static bool bpf_program__is_type(struct bpf_program *prog,
				 enum bpf_prog_type type)
{
	return prog ? (prog->type == type) : false;
}

2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061
#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(struct bpf_program *prog)	\
{							\
	return bpf_program__is_type(prog, TYPE);	\
}							\

2062
BPF_PROG_TYPE_FNS(socket_filter, BPF_PROG_TYPE_SOCKET_FILTER);
2063
BPF_PROG_TYPE_FNS(kprobe, BPF_PROG_TYPE_KPROBE);
2064 2065
BPF_PROG_TYPE_FNS(sched_cls, BPF_PROG_TYPE_SCHED_CLS);
BPF_PROG_TYPE_FNS(sched_act, BPF_PROG_TYPE_SCHED_ACT);
2066
BPF_PROG_TYPE_FNS(tracepoint, BPF_PROG_TYPE_TRACEPOINT);
2067
BPF_PROG_TYPE_FNS(raw_tracepoint, BPF_PROG_TYPE_RAW_TRACEPOINT);
2068 2069
BPF_PROG_TYPE_FNS(xdp, BPF_PROG_TYPE_XDP);
BPF_PROG_TYPE_FNS(perf_event, BPF_PROG_TYPE_PERF_EVENT);
2070

J
John Fastabend 已提交
2071 2072
void bpf_program__set_expected_attach_type(struct bpf_program *prog,
					   enum bpf_attach_type type)
2073 2074 2075 2076
{
	prog->expected_attach_type = type;
}

2077 2078
#define BPF_PROG_SEC_IMPL(string, ptype, eatype, atype) \
	{ string, sizeof(string) - 1, ptype, eatype, atype }
2079

2080 2081
/* Programs that can NOT be attached. */
#define BPF_PROG_SEC(string, ptype) BPF_PROG_SEC_IMPL(string, ptype, 0, -EINVAL)
2082

2083 2084 2085
/* Programs that can be attached. */
#define BPF_APROG_SEC(string, ptype, atype) \
	BPF_PROG_SEC_IMPL(string, ptype, 0, atype)
2086

2087 2088 2089 2090 2091 2092 2093 2094
/* Programs that must specify expected attach type at load time. */
#define BPF_EAPROG_SEC(string, ptype, eatype) \
	BPF_PROG_SEC_IMPL(string, ptype, eatype, eatype)

/* 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)
2095

2096 2097 2098 2099
static const struct {
	const char *sec;
	size_t len;
	enum bpf_prog_type prog_type;
2100
	enum bpf_attach_type expected_attach_type;
2101
	enum bpf_attach_type attach_type;
2102
} section_names[] = {
2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115
	BPF_PROG_SEC("socket",			BPF_PROG_TYPE_SOCKET_FILTER),
	BPF_PROG_SEC("kprobe/",			BPF_PROG_TYPE_KPROBE),
	BPF_PROG_SEC("kretprobe/",		BPF_PROG_TYPE_KPROBE),
	BPF_PROG_SEC("classifier",		BPF_PROG_TYPE_SCHED_CLS),
	BPF_PROG_SEC("action",			BPF_PROG_TYPE_SCHED_ACT),
	BPF_PROG_SEC("tracepoint/",		BPF_PROG_TYPE_TRACEPOINT),
	BPF_PROG_SEC("raw_tracepoint/",		BPF_PROG_TYPE_RAW_TRACEPOINT),
	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),
2116 2117 2118 2119
	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),
2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130
	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),
2131 2132 2133 2134
	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),
2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153
	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),
2154
};
2155

2156
#undef BPF_PROG_SEC_IMPL
2157
#undef BPF_PROG_SEC
2158 2159 2160
#undef BPF_APROG_SEC
#undef BPF_EAPROG_SEC
#undef BPF_APROG_COMPAT
2161

2162 2163
int libbpf_prog_type_by_name(const char *name, enum bpf_prog_type *prog_type,
			     enum bpf_attach_type *expected_attach_type)
2164 2165 2166
{
	int i;

2167 2168
	if (!name)
		return -EINVAL;
2169

2170 2171 2172 2173 2174 2175 2176 2177 2178
	for (i = 0; i < ARRAY_SIZE(section_names); i++) {
		if (strncmp(name, section_names[i].sec, section_names[i].len))
			continue;
		*prog_type = section_names[i].prog_type;
		*expected_attach_type = section_names[i].expected_attach_type;
		return 0;
	}
	return -EINVAL;
}
2179

2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198
int libbpf_attach_type_by_name(const char *name,
			       enum bpf_attach_type *attach_type)
{
	int i;

	if (!name)
		return -EINVAL;

	for (i = 0; i < ARRAY_SIZE(section_names); i++) {
		if (strncmp(name, section_names[i].sec, section_names[i].len))
			continue;
		if (section_names[i].attach_type == -EINVAL)
			return -EINVAL;
		*attach_type = section_names[i].attach_type;
		return 0;
	}
	return -EINVAL;
}

2199 2200 2201 2202 2203 2204 2205
static int
bpf_program__identify_section(struct bpf_program *prog,
			      enum bpf_prog_type *prog_type,
			      enum bpf_attach_type *expected_attach_type)
{
	return libbpf_prog_type_by_name(prog->section_name, prog_type,
					expected_attach_type);
2206 2207
}

2208
int bpf_map__fd(struct bpf_map *map)
2209
{
2210
	return map ? map->fd : -EINVAL;
2211 2212
}

2213
const struct bpf_map_def *bpf_map__def(struct bpf_map *map)
2214
{
2215
	return map ? &map->def : ERR_PTR(-EINVAL);
2216 2217
}

2218
const char *bpf_map__name(struct bpf_map *map)
2219
{
2220
	return map ? map->name : NULL;
2221 2222
}

2223
__u32 bpf_map__btf_key_type_id(const struct bpf_map *map)
2224
{
2225
	return map ? map->btf_key_type_id : 0;
2226 2227
}

2228
__u32 bpf_map__btf_value_type_id(const struct bpf_map *map)
2229
{
2230
	return map ? map->btf_value_type_id : 0;
2231 2232
}

2233 2234
int bpf_map__set_priv(struct bpf_map *map, void *priv,
		     bpf_map_clear_priv_t clear_priv)
2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248
{
	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;
}

2249
void *bpf_map__priv(struct bpf_map *map)
2250
{
2251
	return map ? map->priv : ERR_PTR(-EINVAL);
2252 2253
}

2254 2255 2256 2257 2258
bool bpf_map__is_offload_neutral(struct bpf_map *map)
{
	return map->def.type == BPF_MAP_TYPE_PERF_EVENT_ARRAY;
}

2259 2260 2261 2262 2263
void bpf_map__set_ifindex(struct bpf_map *map, __u32 ifindex)
{
	map->map_ifindex = ifindex;
}

2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289
struct bpf_map *
bpf_map__next(struct bpf_map *prev, struct bpf_object *obj)
{
	size_t idx;
	struct bpf_map *s, *e;

	if (!obj || !obj->maps)
		return NULL;

	s = obj->maps;
	e = obj->maps + obj->nr_maps;

	if (prev == NULL)
		return s;

	if ((prev < s) || (prev >= e)) {
		pr_warning("error in %s: map handler doesn't belong to object\n",
			   __func__);
		return NULL;
	}

	idx = (prev - obj->maps) + 1;
	if (idx >= obj->nr_maps)
		return NULL;
	return &obj->maps[idx];
}
2290 2291

struct bpf_map *
2292
bpf_object__find_map_by_name(struct bpf_object *obj, const char *name)
2293 2294 2295 2296
{
	struct bpf_map *pos;

	bpf_map__for_each(pos, obj) {
2297
		if (pos->name && !strcmp(pos->name, name))
2298 2299 2300 2301
			return pos;
	}
	return NULL;
}
2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313

struct bpf_map *
bpf_object__find_map_by_offset(struct bpf_object *obj, size_t offset)
{
	int i;

	for (i = 0; i < obj->nr_maps; i++) {
		if (obj->maps[i].offset == offset)
			return &obj->maps[i];
	}
	return ERR_PTR(-ENOENT);
}
2314 2315 2316 2317 2318 2319 2320

long libbpf_get_error(const void *ptr)
{
	if (IS_ERR(ptr))
		return PTR_ERR(ptr);
	return 0;
}
2321 2322 2323

int bpf_prog_load(const char *file, enum bpf_prog_type type,
		  struct bpf_object **pobj, int *prog_fd)
2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336
{
	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)
2337
{
2338 2339 2340 2341
	struct bpf_object_open_attr open_attr = {
		.file		= attr->file,
		.prog_type	= attr->prog_type,
	};
2342
	struct bpf_program *prog, *first_prog = NULL;
2343 2344
	enum bpf_attach_type expected_attach_type;
	enum bpf_prog_type prog_type;
2345
	struct bpf_object *obj;
2346
	struct bpf_map *map;
2347 2348
	int err;

2349 2350
	if (!attr)
		return -EINVAL;
2351 2352
	if (!attr->file)
		return -EINVAL;
2353

2354
	obj = bpf_object__open_xattr(&open_attr);
2355
	if (IS_ERR_OR_NULL(obj))
2356 2357
		return -ENOENT;

2358 2359 2360 2361 2362
	bpf_object__for_each_program(prog, obj) {
		/*
		 * If type is not specified, try to guess it based on
		 * section name.
		 */
2363
		prog_type = attr->prog_type;
2364
		prog->prog_ifindex = attr->ifindex;
2365 2366
		expected_attach_type = attr->expected_attach_type;
		if (prog_type == BPF_PROG_TYPE_UNSPEC) {
2367 2368 2369 2370 2371
			err = bpf_program__identify_section(prog, &prog_type,
							    &expected_attach_type);
			if (err < 0) {
				pr_warning("failed to guess program type based on section name %s\n",
					   prog->section_name);
2372 2373 2374
				bpf_object__close(obj);
				return -EINVAL;
			}
2375
		}
2376

2377 2378 2379 2380
		bpf_program__set_type(prog, prog_type);
		bpf_program__set_expected_attach_type(prog,
						      expected_attach_type);

2381
		if (!first_prog)
2382 2383 2384
			first_prog = prog;
	}

2385
	bpf_map__for_each(map, obj) {
2386 2387
		if (!bpf_map__is_offload_neutral(map))
			map->map_ifindex = attr->ifindex;
2388 2389
	}

2390 2391 2392 2393
	if (!first_prog) {
		pr_warning("object file doesn't contain bpf program\n");
		bpf_object__close(obj);
		return -ENOENT;
2394 2395
	}

2396 2397 2398 2399 2400 2401 2402
	err = bpf_object__load(obj);
	if (err) {
		bpf_object__close(obj);
		return -EINVAL;
	}

	*pobj = obj;
2403
	*prog_fd = bpf_program__fd(first_prog);
2404 2405
	return 0;
}
2406 2407 2408 2409 2410 2411 2412 2413 2414

enum bpf_perf_event_ret
bpf_perf_event_read_simple(void *mem, unsigned long size,
			   unsigned long page_size, void **buf, size_t *buf_len,
			   bpf_perf_event_print_t fn, void *priv)
{
	volatile struct perf_event_mmap_page *header = mem;
	__u64 data_tail = header->data_tail;
	__u64 data_head = header->data_head;
2415
	int ret = LIBBPF_PERF_EVENT_ERROR;
2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465
	void *base, *begin, *end;

	asm volatile("" ::: "memory"); /* in real code it should be smp_rmb() */
	if (data_head == data_tail)
		return LIBBPF_PERF_EVENT_CONT;

	base = ((char *)header) + page_size;

	begin = base + data_tail % size;
	end = base + data_head % size;

	while (begin != end) {
		struct perf_event_header *ehdr;

		ehdr = begin;
		if (begin + ehdr->size > base + size) {
			long len = base + size - begin;

			if (*buf_len < ehdr->size) {
				free(*buf);
				*buf = malloc(ehdr->size);
				if (!*buf) {
					ret = LIBBPF_PERF_EVENT_ERROR;
					break;
				}
				*buf_len = ehdr->size;
			}

			memcpy(*buf, begin, len);
			memcpy(*buf + len, base, ehdr->size - len);
			ehdr = (void *)*buf;
			begin = base + ehdr->size - len;
		} else if (begin + ehdr->size == base + size) {
			begin = base;
		} else {
			begin += ehdr->size;
		}

		ret = fn(ehdr, priv);
		if (ret != LIBBPF_PERF_EVENT_CONT)
			break;

		data_tail += ehdr->size;
	}

	__sync_synchronize(); /* smp_mb() */
	header->data_tail = data_tail;

	return ret;
}