libbpf.c 68.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
#ifndef _GNU_SOURCE
13
#define _GNU_SOURCE
14
#endif
15
#include <stdlib.h>
16 17
#include <stdio.h>
#include <stdarg.h>
18
#include <libgen.h>
19
#include <inttypes.h>
20
#include <string.h>
21
#include <unistd.h>
22 23
#include <fcntl.h>
#include <errno.h>
24
#include <asm/unistd.h>
25
#include <linux/err.h>
26
#include <linux/kernel.h>
27
#include <linux/bpf.h>
28
#include <linux/btf.h>
29
#include <linux/filter.h>
30
#include <linux/list.h>
31
#include <linux/limits.h>
32
#include <linux/perf_event.h>
33
#include <linux/ring_buffer.h>
34 35 36
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/vfs.h>
37
#include <tools/libc_compat.h>
38 39
#include <libelf.h>
#include <gelf.h>
40 41

#include "libbpf.h"
42
#include "bpf.h"
43
#include "btf.h"
44
#include "str_error.h"
45
#include "libbpf_util.h"
46

47 48 49 50
#ifndef EM_BPF
#define EM_BPF 247
#endif

51 52 53 54
#ifndef BPF_FS_MAGIC
#define BPF_FS_MAGIC		0xcafe4a11
#endif

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
#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;

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;
}
81

82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
__printf(2, 3)
void libbpf_print(enum libbpf_print_level level, const char *format, ...)
{
	va_list args;

	va_start(args, format);
	if (level == LIBBPF_WARN) {
		if (__pr_warning)
			__pr_warning(format, args);
	} else if (level == LIBBPF_INFO) {
		if (__pr_info)
			__pr_info(format, args);
	} else {
		if (__pr_debug)
			__pr_debug(format, args);
	}
	va_end(args);
}

101 102 103 104 105 106 107 108 109
#define STRERR_BUFSIZE  128

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


110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129
/* 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

130 131 132 133 134
struct bpf_capabilities {
	/* v4.14: kernel support for program & map names. */
	__u32 name:1;
};

135 136 137 138 139 140 141
/*
 * 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;
142
	char *name;
143
	int prog_ifindex;
144
	char *section_name;
S
Stanislav Fomichev 已提交
145 146 147 148
	/* section_name with / replaced by _; makes recursive pinning
	 * in bpf_object__pin_programs easier
	 */
	char *pin_name;
149
	struct bpf_insn *insns;
150
	size_t insns_cnt, main_prog_cnt;
151
	enum bpf_prog_type type;
152

153 154 155 156 157
	struct reloc_desc {
		enum {
			RELO_LD64,
			RELO_CALL,
		} type;
158
		int insn_idx;
159 160 161 162
		union {
			int map_idx;
			int text_off;
		};
163 164
	} *reloc_desc;
	int nr_reloc;
165

166 167 168 169 170
	struct {
		int nr;
		int *fds;
	} instances;
	bpf_program_prep_t preprocessor;
171 172 173 174

	struct bpf_object *obj;
	void *priv;
	bpf_program_clear_priv_t clear_priv;
175 176

	enum bpf_attach_type expected_attach_type;
177 178 179
	int btf_fd;
	void *func_info;
	__u32 func_info_rec_size;
180
	__u32 func_info_cnt;
181 182

	struct bpf_capabilities *caps;
183 184 185 186

	void *line_info;
	__u32 line_info_rec_size;
	__u32 line_info_cnt;
187 188
};

189 190
struct bpf_map {
	int fd;
191
	char *name;
E
Eric Leblond 已提交
192
	size_t offset;
193
	int map_ifindex;
194
	int inner_map_fd;
195
	struct bpf_map_def def;
196 197
	__u32 btf_key_type_id;
	__u32 btf_value_type_id;
198 199 200 201
	void *priv;
	bpf_map_clear_priv_t clear_priv;
};

202 203
static LIST_HEAD(bpf_objects_list);

204
struct bpf_object {
205
	char license[64];
206
	__u32 kern_version;
207

208 209
	struct bpf_program *programs;
	size_t nr_programs;
210 211 212
	struct bpf_map *maps;
	size_t nr_maps;

213
	bool loaded;
214
	bool has_pseudo_calls;
215

216 217 218 219 220 221
	/*
	 * Information when doing elf related work. Only valid if fd
	 * is valid.
	 */
	struct {
		int fd;
222 223
		void *obj_buf;
		size_t obj_buf_sz;
224 225
		Elf *elf;
		GElf_Ehdr ehdr;
226
		Elf_Data *symbols;
227
		size_t strtabidx;
228 229 230 231 232
		struct {
			GElf_Shdr shdr;
			Elf_Data *data;
		} *reloc;
		int nr_reloc;
233
		int maps_shndx;
234
		int text_shndx;
235
	} efile;
236 237 238 239 240 241
	/*
	 * 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;
242

243
	struct btf *btf;
244
	struct btf_ext *btf_ext;
245

246 247 248
	void *priv;
	bpf_object_clear_priv_t clear_priv;

249 250
	struct bpf_capabilities caps;

251 252 253 254
	char path[];
};
#define obj_elf_valid(o)	((o)->efile.elf)

255
void bpf_program__unload(struct bpf_program *prog)
256
{
257 258
	int i;

259 260 261
	if (!prog)
		return;

262 263 264 265 266 267 268 269 270 271 272 273 274 275
	/*
	 * 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);
276 277 278

	zclose(prog->btf_fd);
	zfree(&prog->func_info);
279
	zfree(&prog->line_info);
280 281
}

282 283 284 285 286
static void bpf_program__exit(struct bpf_program *prog)
{
	if (!prog)
		return;

287 288 289 290 291 292
	if (prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

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

293
	bpf_program__unload(prog);
294
	zfree(&prog->name);
295
	zfree(&prog->section_name);
S
Stanislav Fomichev 已提交
296
	zfree(&prog->pin_name);
297
	zfree(&prog->insns);
298 299 300
	zfree(&prog->reloc_desc);

	prog->nr_reloc = 0;
301 302 303 304
	prog->insns_cnt = 0;
	prog->idx = -1;
}

S
Stanislav Fomichev 已提交
305 306 307 308 309 310 311 312 313 314 315
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;
}

316
static int
317 318
bpf_program__init(void *data, size_t size, char *section_name, int idx,
		  struct bpf_program *prog)
319 320
{
	if (size < sizeof(struct bpf_insn)) {
321
		pr_warning("corrupted section '%s'\n", section_name);
322 323 324 325 326
		return -EINVAL;
	}

	bzero(prog, sizeof(*prog));

327
	prog->section_name = strdup(section_name);
328
	if (!prog->section_name) {
329 330
		pr_warning("failed to alloc name for prog under section(%d) %s\n",
			   idx, section_name);
331 332 333
		goto errout;
	}

S
Stanislav Fomichev 已提交
334 335 336 337 338 339 340
	prog->pin_name = __bpf_program__pin_name(prog);
	if (!prog->pin_name) {
		pr_warning("failed to alloc pin name for prog under section(%d) %s\n",
			   idx, section_name);
		goto errout;
	}

341 342
	prog->insns = malloc(size);
	if (!prog->insns) {
343 344
		pr_warning("failed to alloc insns for prog under section %s\n",
			   section_name);
345 346 347 348 349 350
		goto errout;
	}
	prog->insns_cnt = size / sizeof(struct bpf_insn);
	memcpy(prog->insns, data,
	       prog->insns_cnt * sizeof(struct bpf_insn));
	prog->idx = idx;
351 352
	prog->instances.fds = NULL;
	prog->instances.nr = -1;
353
	prog->type = BPF_PROG_TYPE_UNSPEC;
354
	prog->btf_fd = -1;
355 356 357 358 359 360 361 362 363

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

static int
bpf_object__add_program(struct bpf_object *obj, void *data, size_t size,
364
			char *section_name, int idx)
365 366 367 368
{
	struct bpf_program prog, *progs;
	int nr_progs, err;

369
	err = bpf_program__init(data, size, section_name, idx, &prog);
370 371 372
	if (err)
		return err;

373
	prog.caps = &obj->caps;
374 375 376
	progs = obj->programs;
	nr_progs = obj->nr_programs;

377
	progs = reallocarray(progs, nr_progs + 1, sizeof(progs[0]));
378 379 380 381 382 383
	if (!progs) {
		/*
		 * In this case the original obj->programs
		 * is still valid, so don't need special treat for
		 * bpf_close_object().
		 */
384 385
		pr_warning("failed to alloc a new program under section '%s'\n",
			   section_name);
386 387 388 389 390 391 392
		bpf_program__exit(&prog);
		return -ENOMEM;
	}

	pr_debug("found program %s\n", prog.section_name);
	obj->programs = progs;
	obj->nr_programs = nr_progs + 1;
393
	prog.obj = obj;
394 395 396 397
	progs[nr_progs] = prog;
	return 0;
}

398 399 400 401 402 403 404 405
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++) {
406
		const char *name = NULL;
407 408 409 410 411 412 413 414 415 416 417

		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;
418 419
			if (GELF_ST_BIND(sym.st_info) != STB_GLOBAL)
				continue;
420 421 422 423 424 425 426 427 428 429 430

			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;
			}
		}

431 432 433
		if (!name && prog->idx == obj->efile.text_shndx)
			name = ".text";

434 435 436 437 438
		if (!name) {
			pr_warning("failed to find sym for prog %s\n",
				   prog->section_name);
			return -EINVAL;
		}
439

440 441 442 443 444 445 446 447 448 449 450
		prog->name = strdup(name);
		if (!prog->name) {
			pr_warning("failed to allocate memory for prog sym %s\n",
				   name);
			return -ENOMEM;
		}
	}

	return 0;
}

451 452 453
static struct bpf_object *bpf_object__new(const char *path,
					  void *obj_buf,
					  size_t obj_buf_sz)
454 455 456 457 458 459
{
	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);
460
		return ERR_PTR(-ENOMEM);
461 462 463 464
	}

	strcpy(obj->path, path);
	obj->efile.fd = -1;
465 466 467 468 469 470 471 472 473

	/*
	 * 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;
474
	obj->efile.maps_shndx = -1;
475

476
	obj->loaded = false;
477 478 479

	INIT_LIST_HEAD(&obj->list);
	list_add(&obj->list, &bpf_objects_list);
480 481 482 483 484 485 486 487 488 489 490 491
	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;
	}
492
	obj->efile.symbols = NULL;
493 494 495

	zfree(&obj->efile.reloc);
	obj->efile.nr_reloc = 0;
496
	zclose(obj->efile.fd);
497 498
	obj->efile.obj_buf = NULL;
	obj->efile.obj_buf_sz = 0;
499 500 501 502 503 504 505 506 507
}

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");
508
		return -LIBBPF_ERRNO__LIBELF;
509 510
	}

511 512 513 514 515 516 517 518 519 520
	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) {
521
			char errmsg[STRERR_BUFSIZE];
522 523
			char *cp = libbpf_strerror_r(errno, errmsg,
						     sizeof(errmsg));
524 525

			pr_warning("failed to open %s: %s\n", obj->path, cp);
526 527 528 529 530 531
			return -errno;
		}

		obj->efile.elf = elf_begin(obj->efile.fd,
				LIBBPF_ELF_C_READ_MMAP,
				NULL);
532 533 534 535 536
	}

	if (!obj->efile.elf) {
		pr_warning("failed to open %s as ELF file\n",
				obj->path);
537
		err = -LIBBPF_ERRNO__LIBELF;
538 539 540 541 542 543
		goto errout;
	}

	if (!gelf_getehdr(obj->efile.elf, &obj->efile.ehdr)) {
		pr_warning("failed to get EHDR from %s\n",
				obj->path);
544
		err = -LIBBPF_ERRNO__FORMAT;
545 546 547 548
		goto errout;
	}
	ep = &obj->efile.ehdr;

549 550
	/* Old LLVM set e_machine to EM_NONE */
	if ((ep->e_type != ET_REL) || (ep->e_machine && (ep->e_machine != EM_BPF))) {
551 552
		pr_warning("%s is not an eBPF object file\n",
			obj->path);
553
		err = -LIBBPF_ERRNO__FORMAT;
554 555 556 557 558 559 560 561 562
		goto errout;
	}

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

563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580
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:
581
		return -LIBBPF_ERRNO__ENDIAN;
582 583 584 585 586 587
	}

	return 0;

mismatch:
	pr_warning("Error: endianness mismatch.\n");
588
	return -LIBBPF_ERRNO__ENDIAN;
589 590
}

591 592 593 594 595 596 597 598 599 600 601 602 603 604
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)
{
605
	__u32 kver;
606 607 608

	if (size != sizeof(kver)) {
		pr_warning("invalid kver section in %s\n", obj->path);
609
		return -LIBBPF_ERRNO__FORMAT;
610 611 612 613 614 615 616 617
	}
	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 已提交
618 619 620 621
static int compare_bpf_map(const void *_a, const void *_b)
{
	const struct bpf_map *a = _a;
	const struct bpf_map *b = _b;
622

E
Eric Leblond 已提交
623
	return a->offset - b->offset;
624 625
}

626 627 628 629 630 631 632 633
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;
}

634
static int
635
bpf_object__init_maps(struct bpf_object *obj, int flags)
636
{
637
	bool strict = !(flags & MAPS_RELAX_COMPAT);
638
	int i, map_idx, map_def_sz, nr_maps = 0;
E
Eric Leblond 已提交
639 640
	Elf_Scn *scn;
	Elf_Data *data;
641 642
	Elf_Data *symbols = obj->efile.symbols;

E
Eric Leblond 已提交
643 644 645 646 647 648 649 650 651 652 653
	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);
654
		return -EINVAL;
E
Eric Leblond 已提交
655
	}
656

E
Eric Leblond 已提交
657 658 659 660 661 662 663
	/*
	 * 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.
	 */
664 665
	for (i = 0; i < symbols->d_size / sizeof(GElf_Sym); i++) {
		GElf_Sym sym;
E
Eric Leblond 已提交
666 667 668 669 670 671 672 673 674 675 676 677 678 679 680

		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;

681 682 683 684 685 686 687 688 689
	/* 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 已提交
690 691 692 693 694 695 696
	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;

697 698 699 700 701 702
	for (i = 0; i < nr_maps; i++) {
		/*
		 * fill all fd with -1 so won't close incorrect
		 * fd (fd=0 is stdin) when failure (zclose won't close
		 * negative fd)).
		 */
E
Eric Leblond 已提交
703
		obj->maps[i].fd = -1;
704 705
		obj->maps[i].inner_map_fd = -1;
	}
E
Eric Leblond 已提交
706 707 708 709 710 711

	/*
	 * 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;
712
		const char *map_name;
E
Eric Leblond 已提交
713
		struct bpf_map_def *def;
714 715 716

		if (!gelf_getsym(symbols, i, &sym))
			continue;
717
		if (sym.st_shndx != obj->efile.maps_shndx)
718 719 720
			continue;

		map_name = elf_strptr(obj->efile.elf,
721
				      obj->efile.strtabidx,
722
				      sym.st_name);
E
Eric Leblond 已提交
723
		obj->maps[map_idx].offset = sym.st_value;
724
		if (sym.st_value + map_def_sz > data->d_size) {
E
Eric Leblond 已提交
725 726 727
			pr_warning("corrupted maps section in %s: last map \"%s\" too small\n",
				   obj->path, map_name);
			return -EINVAL;
728
		}
E
Eric Leblond 已提交
729

730
		obj->maps[map_idx].name = strdup(map_name);
731 732 733 734
		if (!obj->maps[map_idx].name) {
			pr_warning("failed to alloc map name\n");
			return -ENOMEM;
		}
E
Eric Leblond 已提交
735
		pr_debug("map %d is \"%s\"\n", map_idx,
736
			 obj->maps[map_idx].name);
E
Eric Leblond 已提交
737
		def = (struct bpf_map_def *)(data->d_buf + sym.st_value);
738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760
		/*
		 * 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);
761 762
					if (strict)
						return -EINVAL;
763 764 765 766 767
				}
			}
			memcpy(&obj->maps[map_idx].def, def,
			       sizeof(struct bpf_map_def));
		}
E
Eric Leblond 已提交
768
		map_idx++;
769
	}
E
Eric Leblond 已提交
770 771

	qsort(obj->maps, obj->nr_maps, sizeof(obj->maps[0]), compare_bpf_map);
772
	return 0;
773 774
}

775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792
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;
}

793
static int bpf_object__elf_collect(struct bpf_object *obj, int flags)
794 795 796
{
	Elf *elf = obj->efile.elf;
	GElf_Ehdr *ep = &obj->efile.ehdr;
797
	Elf_Data *btf_ext_data = NULL;
798
	Elf_Scn *scn = NULL;
799
	int idx = 0, err = 0;
800 801 802 803 804

	/* 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);
805
		return -LIBBPF_ERRNO__FORMAT;
806 807 808 809 810 811 812 813 814
	}

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

		idx++;
		if (gelf_getshdr(scn, &sh) != &sh) {
815 816
			pr_warning("failed to get section(%d) header from %s\n",
				   idx, obj->path);
817
			err = -LIBBPF_ERRNO__FORMAT;
818 819 820 821 822
			goto out;
		}

		name = elf_strptr(elf, ep->e_shstrndx, sh.sh_name);
		if (!name) {
823 824
			pr_warning("failed to get section(%d) name from %s\n",
				   idx, obj->path);
825
			err = -LIBBPF_ERRNO__FORMAT;
826 827 828 829 830
			goto out;
		}

		data = elf_getdata(scn, 0);
		if (!data) {
831 832
			pr_warning("failed to get section(%d) data from %s(%s)\n",
				   idx, name, obj->path);
833
			err = -LIBBPF_ERRNO__FORMAT;
834 835
			goto out;
		}
836 837
		pr_debug("section(%d) %s, size %ld, link %d, flags %lx, type=%d\n",
			 idx, name, (unsigned long)data->d_size,
838 839
			 (int)sh.sh_link, (unsigned long)sh.sh_flags,
			 (int)sh.sh_type);
840 841 842 843 844 845 846 847 848

		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 已提交
849
		else if (strcmp(name, "maps") == 0)
850
			obj->efile.maps_shndx = idx;
851
		else if (strcmp(name, BTF_ELF_SEC) == 0) {
852
			obj->btf = btf__new(data->d_buf, data->d_size);
853 854 855 856 857
			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;
			}
858
		} else if (strcmp(name, BTF_EXT_ELF_SEC) == 0) {
859
			btf_ext_data = data;
860
		} else if (sh.sh_type == SHT_SYMTAB) {
861 862 863
			if (obj->efile.symbols) {
				pr_warning("bpf: multiple SYMTAB in %s\n",
					   obj->path);
864
				err = -LIBBPF_ERRNO__FORMAT;
865
			} else {
866
				obj->efile.symbols = data;
867 868
				obj->efile.strtabidx = sh.sh_link;
			}
869 870 871
		} else if ((sh.sh_type == SHT_PROGBITS) &&
			   (sh.sh_flags & SHF_EXECINSTR) &&
			   (data->d_size > 0)) {
872 873
			if (strcmp(name, ".text") == 0)
				obj->efile.text_shndx = idx;
874 875 876
			err = bpf_object__add_program(obj, data->d_buf,
						      data->d_size, name, idx);
			if (err) {
877
				char errmsg[STRERR_BUFSIZE];
878 879
				char *cp = libbpf_strerror_r(-err, errmsg,
							     sizeof(errmsg));
880

881
				pr_warning("failed to alloc program %s (%s): %s",
882
					   name, obj->path, cp);
883
			}
884 885 886
		} else if (sh.sh_type == SHT_REL) {
			void *reloc = obj->efile.reloc;
			int nr_reloc = obj->efile.nr_reloc + 1;
887 888 889 890 891 892 893 894
			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;
			}
895

896 897
			reloc = reallocarray(reloc, nr_reloc,
					     sizeof(*obj->efile.reloc));
898 899 900 901 902 903 904 905 906 907 908 909
			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;
			}
910 911
		} else {
			pr_debug("skip section(%d) %s\n", idx, name);
912
		}
913 914
		if (err)
			goto out;
915
	}
916

917 918 919 920
	if (!obj->efile.strtabidx || obj->efile.strtabidx >= idx) {
		pr_warning("Corrupted ELF file: index of strtab invalid\n");
		return LIBBPF_ERRNO__FORMAT;
	}
921 922 923 924 925 926
	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);
		} else {
			obj->btf_ext = btf_ext__new(btf_ext_data->d_buf,
927
						    btf_ext_data->d_size);
928 929 930 931 932 933 934 935
			if (IS_ERR(obj->btf_ext)) {
				pr_warning("Error loading ELF section %s: %ld. Ignored and continue.\n",
					   BTF_EXT_ELF_SEC,
					   PTR_ERR(obj->btf_ext));
				obj->btf_ext = NULL;
			}
		}
	}
936
	if (obj->efile.maps_shndx >= 0) {
937
		err = bpf_object__init_maps(obj, flags);
938 939 940 941
		if (err)
			goto out;
	}
	err = bpf_object__init_prog_names(obj);
942 943 944 945
out:
	return err;
}

946 947 948 949 950 951 952 953 954 955 956 957 958 959
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;
}

960 961 962 963 964 965 966 967 968 969 970 971
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;
}

972
static int
973 974
bpf_program__collect_reloc(struct bpf_program *prog, GElf_Shdr *shdr,
			   Elf_Data *data, struct bpf_object *obj)
975
{
976 977 978 979 980
	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;
981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002
	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);
1003
			return -LIBBPF_ERRNO__FORMAT;
1004 1005 1006 1007 1008 1009 1010
		}

		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));
1011
			return -LIBBPF_ERRNO__FORMAT;
1012
		}
D
David Miller 已提交
1013 1014 1015
		pr_debug("relo for %lld value %lld name %d\n",
			 (long long) (rel.r_info >> 32),
			 (long long) sym.st_value, sym.st_name);
1016

1017
		if (sym.st_shndx != maps_shndx && sym.st_shndx != text_shndx) {
1018 1019 1020 1021 1022 1023 1024 1025
			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);

1026 1027 1028 1029 1030 1031 1032 1033
		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;
1034
			obj->has_pseudo_calls = true;
1035 1036 1037
			continue;
		}

1038 1039 1040
		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);
1041
			return -LIBBPF_ERRNO__RELOC;
1042 1043
		}

1044 1045 1046 1047 1048 1049 1050 1051 1052
		/* 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;
			}
		}

1053 1054 1055
		if (map_idx >= nr_maps) {
			pr_warning("bpf relocation: map_idx %d large than %d\n",
				   (int)map_idx, (int)nr_maps - 1);
1056
			return -LIBBPF_ERRNO__RELOC;
1057 1058
		}

1059
		prog->reloc_desc[i].type = RELO_LD64;
1060 1061 1062 1063 1064 1065
		prog->reloc_desc[i].insn_idx = insn_idx;
		prog->reloc_desc[i].map_idx = map_idx;
	}
	return 0;
}

1066 1067
static int bpf_map_find_btf_info(struct bpf_map *map, const struct btf *btf)
{
1068 1069
	const struct btf_type *container_type;
	const struct btf_member *key, *value;
1070 1071
	struct bpf_map_def *def = &map->def;
	const size_t max_name = 256;
1072
	char container_name[max_name];
1073
	__s64 key_size, value_size;
1074
	__s32 container_id;
1075

1076 1077 1078
	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",
1079 1080 1081 1082
			   map->name, map->name);
		return -EINVAL;
	}

1083 1084 1085 1086 1087
	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;
1088 1089
	}

1090 1091 1092 1093 1094
	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;
1095 1096
	}

1097 1098 1099 1100
	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);
1101 1102 1103
		return -EINVAL;
	}

1104 1105 1106 1107 1108 1109 1110 1111
	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;
1112 1113
	}

1114 1115 1116 1117
	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;
1118 1119
	}

1120
	value_size = btf__resolve_size(btf, value->type);
1121
	if (value_size < 0) {
1122
		pr_warning("map:%s invalid BTF value_type_size\n", map->name);
1123 1124 1125 1126
		return value_size;
	}

	if (def->value_size != value_size) {
1127 1128
		pr_warning("map:%s btf_value_type_size:%u != map_def_value_size:%u\n",
			   map->name, (__u32)value_size, def->value_size);
1129 1130 1131
		return -EINVAL;
	}

1132 1133
	map->btf_key_type_id = key->type;
	map->btf_value_type_id = value->type;
1134 1135 1136 1137

	return 0;
}

J
Jakub Kicinski 已提交
1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184
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;
}

1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 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 1227 1228 1229 1230
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));
		pr_warning("Error in %s():%s(%d). Couldn't load basic 'r0 = 0' BPF program.\n",
			   __func__, cp, errno);
		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;
}

static int
bpf_object__probe_caps(struct bpf_object *obj)
{
	return bpf_object__probe_name(obj);
}

1231 1232 1233
static int
bpf_object__create_maps(struct bpf_object *obj)
{
1234
	struct bpf_create_map_attr create_attr = {};
1235
	unsigned int i;
1236
	int err;
1237

1238
	for (i = 0; i < obj->nr_maps; i++) {
1239 1240
		struct bpf_map *map = &obj->maps[i];
		struct bpf_map_def *def = &map->def;
1241
		char *cp, errmsg[STRERR_BUFSIZE];
1242 1243
		int *pfd = &map->fd;

J
Jakub Kicinski 已提交
1244 1245 1246 1247 1248 1249
		if (map->fd >= 0) {
			pr_debug("skip map create (preset) %s: fd=%d\n",
				 map->name, map->fd);
			continue;
		}

1250 1251
		if (obj->caps.name)
			create_attr.name = map->name;
1252
		create_attr.map_ifindex = map->map_ifindex;
1253 1254 1255 1256 1257 1258
		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;
1259 1260
		create_attr.btf_key_type_id = 0;
		create_attr.btf_value_type_id = 0;
1261 1262 1263
		if (bpf_map_type__is_map_in_map(def->type) &&
		    map->inner_map_fd >= 0)
			create_attr.inner_map_fd = map->inner_map_fd;
1264 1265 1266

		if (obj->btf && !bpf_map_find_btf_info(map, obj->btf)) {
			create_attr.btf_fd = btf__fd(obj->btf);
1267 1268
			create_attr.btf_key_type_id = map->btf_key_type_id;
			create_attr.btf_value_type_id = map->btf_value_type_id;
1269 1270 1271
		}

		*pfd = bpf_create_map_xattr(&create_attr);
1272
		if (*pfd < 0 && create_attr.btf_key_type_id) {
1273
			cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
1274
			pr_warning("Error in bpf_create_map_xattr(%s):%s(%d). Retrying without BTF.\n",
1275
				   map->name, cp, errno);
1276
			create_attr.btf_fd = 0;
1277 1278 1279 1280
			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;
1281 1282 1283
			*pfd = bpf_create_map_xattr(&create_attr);
		}

1284 1285 1286
		if (*pfd < 0) {
			size_t j;

1287
			err = *pfd;
1288
			cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
E
Eric Leblond 已提交
1289
			pr_warning("failed to create map (name: '%s'): %s\n",
1290
				   map->name, cp);
1291
			for (j = 0; j < i; j++)
1292
				zclose(obj->maps[j].fd);
1293 1294
			return err;
		}
1295
		pr_debug("create map %s: fd=%d\n", map->name, *pfd);
1296 1297 1298 1299 1300
	}

	return 0;
}

1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357
static int
check_btf_ext_reloc_err(struct bpf_program *prog, int err,
			void *btf_prog_info, const char *info_name)
{
	if (err != -ENOENT) {
		pr_warning("Error in loading %s for sec %s.\n",
			   info_name, prog->section_name);
		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
		 * in the last btf_ext reloc.  Must have to error
		 * out.
		 */
		pr_warning("Error in relocating %s for sec %s.\n",
			   info_name, prog->section_name);
		return err;
	}

	/*
	 * Have problem loading the very first info.  Ignore
	 * the rest.
	 */
	pr_warning("Cannot find %s for main program sec %s. Ignore all %s.\n",
		   info_name, prog->section_name, info_name);
	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);
	}

1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370
	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);
	}

1371 1372 1373 1374 1375 1376
	if (!insn_offset)
		prog->btf_fd = btf__fd(obj->btf);

	return 0;
}

1377 1378 1379 1380 1381 1382 1383
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;
1384
	int err;
1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401

	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;
1402
		new_insn = reallocarray(prog->insns, new_cnt, sizeof(*insn));
1403 1404 1405 1406
		if (!new_insn) {
			pr_warning("oom in prog realloc\n");
			return -ENOMEM;
		}
1407

1408 1409 1410 1411 1412
		if (obj->btf_ext) {
			err = bpf_program_reloc_btf_ext(prog, obj,
							text->section_name,
							prog->insns_cnt);
			if (err)
1413 1414 1415
				return err;
		}

1416 1417 1418 1419 1420
		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;
1421 1422 1423
		pr_debug("added %zd insn from %s to prog %s\n",
			 text->insns_cnt, text->section_name,
			 prog->section_name);
1424 1425 1426 1427 1428 1429
	}
	insn = &prog->insns[relo->insn_idx];
	insn->imm += prog->main_prog_cnt - relo->insn_idx;
	return 0;
}

W
Wang Nan 已提交
1430
static int
1431
bpf_program__relocate(struct bpf_program *prog, struct bpf_object *obj)
W
Wang Nan 已提交
1432
{
1433
	int i, err;
W
Wang Nan 已提交
1434

1435 1436 1437
	if (!prog)
		return 0;

1438 1439 1440 1441
	if (obj->btf_ext) {
		err = bpf_program_reloc_btf_ext(prog, obj,
						prog->section_name, 0);
		if (err)
1442 1443 1444 1445
			return err;
	}

	if (!prog->reloc_desc)
W
Wang Nan 已提交
1446 1447 1448
		return 0;

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

1453 1454
			insn_idx = prog->reloc_desc[i].insn_idx;
			map_idx = prog->reloc_desc[i].map_idx;
W
Wang Nan 已提交
1455

1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467
			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 已提交
1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486
		}
	}

	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];

1487
		err = bpf_program__relocate(prog, obj);
W
Wang Nan 已提交
1488 1489 1490 1491 1492 1493 1494 1495 1496
		if (err) {
			pr_warning("failed to relocate '%s'\n",
				   prog->section_name);
			return err;
		}
	}
	return 0;
}

1497 1498 1499 1500 1501 1502
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");
1503
		return -LIBBPF_ERRNO__INTERNAL;
1504 1505 1506 1507 1508 1509 1510 1511 1512 1513
	}

	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__);
1514
			return -LIBBPF_ERRNO__INTERNAL;
1515 1516 1517 1518
		}

		prog = bpf_object__find_prog_by_idx(obj, idx);
		if (!prog) {
1519
			pr_warning("relocation failed: no section(%d)\n", idx);
1520
			return -LIBBPF_ERRNO__RELOC;
1521 1522
		}

1523
		err = bpf_program__collect_reloc(prog,
1524
						 shdr, data,
1525
						 obj);
1526
		if (err)
1527
			return err;
1528 1529 1530 1531
	}
	return 0;
}

1532
static int
1533
load_program(struct bpf_program *prog, struct bpf_insn *insns, int insns_cnt,
1534
	     char *license, __u32 kern_version, int *pfd)
1535
{
1536
	struct bpf_load_program_attr load_attr;
1537
	char *cp, errmsg[STRERR_BUFSIZE];
1538
	char *log_buf;
1539
	int ret;
1540

1541
	memset(&load_attr, 0, sizeof(struct bpf_load_program_attr));
1542 1543
	load_attr.prog_type = prog->type;
	load_attr.expected_attach_type = prog->expected_attach_type;
1544 1545
	if (prog->caps->name)
		load_attr.name = prog->name;
1546 1547 1548 1549
	load_attr.insns = insns;
	load_attr.insns_cnt = insns_cnt;
	load_attr.license = license;
	load_attr.kern_version = kern_version;
1550
	load_attr.prog_ifindex = prog->prog_ifindex;
Y
Yonghong Song 已提交
1551
	load_attr.prog_btf_fd = prog->btf_fd >= 0 ? prog->btf_fd : 0;
1552 1553
	load_attr.func_info = prog->func_info;
	load_attr.func_info_rec_size = prog->func_info_rec_size;
1554
	load_attr.func_info_cnt = prog->func_info_cnt;
1555 1556 1557
	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;
1558
	if (!load_attr.insns || !load_attr.insns_cnt)
1559 1560 1561 1562 1563 1564
		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");

1565
	ret = bpf_load_program_xattr(&load_attr, log_buf, BPF_LOG_BUF_SIZE);
1566 1567 1568 1569 1570 1571 1572

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

1573
	ret = -LIBBPF_ERRNO__LOAD;
1574
	cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
1575
	pr_warning("load bpf program failed: %s\n", cp);
1576

1577 1578
	if (log_buf && log_buf[0] != '\0') {
		ret = -LIBBPF_ERRNO__VERIFY;
1579 1580 1581
		pr_warning("-- BEGIN DUMP LOG ---\n");
		pr_warning("\n%s\n", log_buf);
		pr_warning("-- END LOG --\n");
1582 1583 1584
	} 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);
1585
		ret = -LIBBPF_ERRNO__PROG2BIG;
1586
	} else {
1587
		/* Wrong program type? */
1588
		if (load_attr.prog_type != BPF_PROG_TYPE_KPROBE) {
1589 1590
			int fd;

1591 1592 1593
			load_attr.prog_type = BPF_PROG_TYPE_KPROBE;
			load_attr.expected_attach_type = 0;
			fd = bpf_load_program_xattr(&load_attr, NULL, 0);
1594 1595 1596 1597 1598
			if (fd >= 0) {
				close(fd);
				ret = -LIBBPF_ERRNO__PROGTYPE;
				goto out;
			}
1599
		}
1600 1601 1602

		if (log_buf)
			ret = -LIBBPF_ERRNO__KVER;
1603 1604 1605 1606 1607 1608 1609
	}

out:
	free(log_buf);
	return ret;
}

1610
int
1611
bpf_program__load(struct bpf_program *prog,
1612
		  char *license, __u32 kern_version)
1613
{
1614
	int err = 0, fd, i;
1615

1616 1617 1618 1619 1620 1621
	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;
		}
1622

1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636
		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);
		}
1637
		err = load_program(prog, prog->insns, prog->insns_cnt,
1638
				   license, kern_version, &fd);
1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665
		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;
		}

1666
		err = load_program(prog, result.new_insn_ptr,
1667
				   result.new_insn_cnt,
1668
				   license, kern_version, &fd);
1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680

		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:
1681 1682 1683 1684 1685 1686 1687 1688
	if (err)
		pr_warning("failed to load program '%s'\n",
			   prog->section_name);
	zfree(&prog->insns);
	prog->insns_cnt = 0;
	return err;
}

1689 1690 1691 1692 1693 1694
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;
}

1695 1696 1697 1698 1699 1700 1701
static int
bpf_object__load_progs(struct bpf_object *obj)
{
	size_t i;
	int err;

	for (i = 0; i < obj->nr_programs; i++) {
1702
		if (bpf_program__is_function_storage(&obj->programs[i], obj))
1703
			continue;
1704 1705 1706 1707 1708 1709 1710 1711 1712
		err = bpf_program__load(&obj->programs[i],
					obj->license,
					obj->kern_version);
		if (err)
			return err;
	}
	return 0;
}

1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724
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:
1725
	case BPF_PROG_TYPE_LWT_SEG6LOCAL:
1726 1727 1728 1729 1730
	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:
1731
	case BPF_PROG_TYPE_LIRC_MODE2:
1732
	case BPF_PROG_TYPE_SK_REUSEPORT:
1733
	case BPF_PROG_TYPE_FLOW_DISSECTOR:
1734 1735 1736
	case BPF_PROG_TYPE_UNSPEC:
	case BPF_PROG_TYPE_TRACEPOINT:
	case BPF_PROG_TYPE_RAW_TRACEPOINT:
1737 1738 1739
	case BPF_PROG_TYPE_PERF_EVENT:
		return false;
	case BPF_PROG_TYPE_KPROBE:
1740 1741 1742 1743 1744 1745
	default:
		return true;
	}
}

static int bpf_object__validate(struct bpf_object *obj, bool needs_kver)
1746
{
1747
	if (needs_kver && obj->kern_version == 0) {
1748 1749
		pr_warning("%s doesn't provide kernel version\n",
			   obj->path);
1750
		return -LIBBPF_ERRNO__KVERSION;
1751 1752 1753 1754
	}
	return 0;
}

1755
static struct bpf_object *
1756
__bpf_object__open(const char *path, void *obj_buf, size_t obj_buf_sz,
1757
		   bool needs_kver, int flags)
1758 1759
{
	struct bpf_object *obj;
1760
	int err;
1761 1762 1763

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

1767
	obj = bpf_object__new(path, obj_buf, obj_buf_sz);
1768 1769
	if (IS_ERR(obj))
		return obj;
1770

1771 1772
	CHECK_ERR(bpf_object__elf_init(obj), err, out);
	CHECK_ERR(bpf_object__check_endianness(obj), err, out);
1773
	CHECK_ERR(bpf_object__elf_collect(obj, flags), err, out);
1774
	CHECK_ERR(bpf_object__collect_reloc(obj), err, out);
1775
	CHECK_ERR(bpf_object__validate(obj, needs_kver), err, out);
1776 1777 1778 1779 1780

	bpf_object__elf_finish(obj);
	return obj;
out:
	bpf_object__close(obj);
1781
	return ERR_PTR(err);
1782 1783
}

1784 1785
struct bpf_object *__bpf_object__open_xattr(struct bpf_object_open_attr *attr,
					    int flags)
1786 1787
{
	/* param validation */
1788
	if (!attr->file)
1789 1790
		return NULL;

1791 1792 1793
	pr_debug("loading %s\n", attr->file);

	return __bpf_object__open(attr->file, NULL, 0,
1794 1795 1796 1797 1798 1799 1800
				  bpf_prog_type__needs_kver(attr->prog_type),
				  flags);
}

struct bpf_object *bpf_object__open_xattr(struct bpf_object_open_attr *attr)
{
	return __bpf_object__open_xattr(attr, 0);
1801 1802 1803 1804 1805 1806 1807 1808
}

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

1810
	return bpf_object__open_xattr(&attr);
1811 1812 1813
}

struct bpf_object *bpf_object__open_buffer(void *obj_buf,
1814 1815
					   size_t obj_buf_sz,
					   const char *name)
1816
{
1817 1818
	char tmp_name[64];

1819 1820 1821 1822
	/* param validation */
	if (!obj_buf || obj_buf_sz <= 0)
		return NULL;

1823 1824 1825 1826 1827 1828 1829 1830 1831
	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);
1832

1833
	return __bpf_object__open(name, obj_buf, obj_buf_sz, true, true);
1834 1835
}

1836 1837 1838 1839 1840 1841 1842
int bpf_object__unload(struct bpf_object *obj)
{
	size_t i;

	if (!obj)
		return -EINVAL;

1843 1844
	for (i = 0; i < obj->nr_maps; i++)
		zclose(obj->maps[i].fd);
1845

1846 1847 1848
	for (i = 0; i < obj->nr_programs; i++)
		bpf_program__unload(&obj->programs[i]);

1849 1850 1851 1852 1853
	return 0;
}

int bpf_object__load(struct bpf_object *obj)
{
1854 1855
	int err;

1856 1857 1858 1859 1860 1861 1862 1863 1864
	if (!obj)
		return -EINVAL;

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

	obj->loaded = true;
1865

1866
	CHECK_ERR(bpf_object__probe_caps(obj), err, out);
1867 1868 1869
	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);
1870 1871 1872 1873 1874

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

1878 1879
static int check_path(const char *path)
{
1880
	char *cp, errmsg[STRERR_BUFSIZE];
1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893
	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)) {
1894
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
1895
		pr_warning("failed to statfs %s: %s\n", dir, cp);
1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910
		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)
{
1911
	char *cp, errmsg[STRERR_BUFSIZE];
1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929
	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)) {
1930
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
1931
		pr_warning("failed to pin program: %s\n", cp);
1932 1933 1934 1935 1936 1937 1938
		return -errno;
	}
	pr_debug("pinned program '%s'\n", path);

	return 0;
}

1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966
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) {
		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;
	}

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

	return 0;
}

1967 1968
static int make_dir(const char *path)
{
1969
	char *cp, errmsg[STRERR_BUFSIZE];
1970 1971 1972 1973 1974
	int err = 0;

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

1975
	if (err) {
1976
		cp = libbpf_strerror_r(-err, errmsg, sizeof(errmsg));
1977 1978
		pr_warning("failed to mkdir %s: %s\n", path, cp);
	}
1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000
	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;
	}

2001 2002 2003 2004 2005
	if (prog->instances.nr == 1) {
		/* don't create subdirs when pinning single instance */
		return bpf_program__pin_instance(prog, path, 0);
	}

2006 2007 2008 2009
	err = make_dir(path);
	if (err)
		return err;

2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065
	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) {
		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;
2066 2067 2068 2069 2070
	}

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

2073 2074 2075 2076 2077 2078 2079 2080 2081 2082
	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;

2083
		err = bpf_program__unpin_instance(prog, buf, i);
2084 2085 2086 2087
		if (err)
			return err;
	}

2088 2089 2090 2091
	err = rmdir(path);
	if (err)
		return -errno;

2092 2093 2094
	return 0;
}

J
Joe Stringer 已提交
2095 2096
int bpf_map__pin(struct bpf_map *map, const char *path)
{
2097
	char *cp, errmsg[STRERR_BUFSIZE];
J
Joe Stringer 已提交
2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109
	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)) {
2110
		cp = libbpf_strerror_r(errno, errmsg, sizeof(errmsg));
2111
		pr_warning("failed to pin map: %s\n", cp);
J
Joe Stringer 已提交
2112 2113 2114 2115
		return -errno;
	}

	pr_debug("pinned map '%s'\n", path);
2116

J
Joe Stringer 已提交
2117 2118 2119
	return 0;
}

2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141
int bpf_map__unpin(struct bpf_map *map, const char *path)
{
	int err;

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

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

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

	return 0;
}

int bpf_object__pin_maps(struct bpf_object *obj, const char *path)
2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157
{
	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;

2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204
	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) {
			err = -EINVAL;
			goto err_unpin_maps;
		} else if (len >= PATH_MAX) {
			err = -ENAMETOOLONG;
			goto err_unpin_maps;
		}

		err = bpf_map__pin(map, buf);
		if (err)
			goto err_unpin_maps;
	}

	return 0;

err_unpin_maps:
	while ((map = bpf_map__prev(map, obj))) {
		char buf[PATH_MAX];
		int len;

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

		bpf_map__unpin(map, buf);
	}

	return err;
}

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

	if (!obj)
		return -ENOENT;

2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215
	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;

2216
		err = bpf_map__unpin(map, buf);
2217 2218 2219 2220
		if (err)
			return err;
	}

2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245
	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) {
		pr_warning("object not yet loaded; load it first\n");
		return -ENOENT;
	}

	err = make_dir(path);
	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,
S
Stanislav Fomichev 已提交
2246
			       prog->pin_name);
2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267
		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 已提交
2268
			       prog->pin_name);
2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287
		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;

2288 2289 2290 2291 2292
	bpf_object__for_each_program(prog, obj) {
		char buf[PATH_MAX];
		int len;

		len = snprintf(buf, PATH_MAX, "%s/%s", path,
S
Stanislav Fomichev 已提交
2293
			       prog->pin_name);
2294 2295 2296 2297 2298
		if (len < 0)
			return -EINVAL;
		else if (len >= PATH_MAX)
			return -ENAMETOOLONG;

2299
		err = bpf_program__unpin(prog, buf);
2300 2301 2302 2303 2304 2305 2306
		if (err)
			return err;
	}

	return 0;
}

2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323
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;
}

2324 2325
void bpf_object__close(struct bpf_object *obj)
{
2326 2327
	size_t i;

2328 2329 2330
	if (!obj)
		return;

2331 2332 2333
	if (obj->clear_priv)
		obj->clear_priv(obj, obj->priv);

2334
	bpf_object__elf_finish(obj);
2335
	bpf_object__unload(obj);
2336
	btf__free(obj->btf);
2337
	btf_ext__free(obj->btf_ext);
2338

2339
	for (i = 0; i < obj->nr_maps; i++) {
2340
		zfree(&obj->maps[i].name);
2341 2342 2343 2344 2345 2346 2347 2348
		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;
2349 2350 2351 2352 2353 2354 2355

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

2356
	list_del(&obj->list);
2357 2358
	free(obj);
}
2359

2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378
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;
}

2379
const char *bpf_object__name(struct bpf_object *obj)
2380
{
2381
	return obj ? obj->path : ERR_PTR(-EINVAL);
2382 2383
}

2384
unsigned int bpf_object__kversion(struct bpf_object *obj)
2385
{
2386
	return obj ? obj->kern_version : 0;
2387 2388
}

2389 2390 2391 2392 2393
int bpf_object__btf_fd(const struct bpf_object *obj)
{
	return obj->btf ? btf__fd(obj->btf) : -1;
}

2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409
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);
}

2410
static struct bpf_program *
2411
__bpf_program__iter(struct bpf_program *p, struct bpf_object *obj, bool forward)
2412
{
2413
	size_t nr_programs = obj->nr_programs;
2414
	ssize_t idx;
2415

2416
	if (!nr_programs)
2417 2418
		return NULL;

2419 2420 2421 2422 2423
	if (!p)
		/* Iter from the beginning */
		return forward ? &obj->programs[0] :
			&obj->programs[nr_programs - 1];

2424
	if (p->obj != obj) {
2425 2426 2427 2428
		pr_warning("error: program handler doesn't match object\n");
		return NULL;
	}

2429
	idx = (p - obj->programs) + (forward ? 1 : -1);
2430
	if (idx >= obj->nr_programs || idx < 0)
2431 2432 2433 2434
		return NULL;
	return &obj->programs[idx];
}

2435 2436 2437 2438 2439 2440
struct bpf_program *
bpf_program__next(struct bpf_program *prev, struct bpf_object *obj)
{
	struct bpf_program *prog = prev;

	do {
2441
		prog = __bpf_program__iter(prog, obj, true);
2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452
	} while (prog && bpf_program__is_function_storage(prog, obj));

	return prog;
}

struct bpf_program *
bpf_program__prev(struct bpf_program *next, struct bpf_object *obj)
{
	struct bpf_program *prog = next;

	do {
2453
		prog = __bpf_program__iter(prog, obj, false);
2454 2455 2456 2457 2458
	} while (prog && bpf_program__is_function_storage(prog, obj));

	return prog;
}

2459 2460
int bpf_program__set_priv(struct bpf_program *prog, void *priv,
			  bpf_program_clear_priv_t clear_priv)
2461 2462 2463 2464 2465 2466 2467 2468 2469
{
	if (prog->priv && prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

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

2470
void *bpf_program__priv(struct bpf_program *prog)
2471
{
2472
	return prog ? prog->priv : ERR_PTR(-EINVAL);
2473 2474
}

2475 2476 2477 2478 2479
void bpf_program__set_ifindex(struct bpf_program *prog, __u32 ifindex)
{
	prog->prog_ifindex = ifindex;
}

2480
const char *bpf_program__title(struct bpf_program *prog, bool needs_copy)
2481 2482 2483 2484
{
	const char *title;

	title = prog->section_name;
2485
	if (needs_copy) {
2486 2487 2488
		title = strdup(title);
		if (!title) {
			pr_warning("failed to strdup program title\n");
2489
			return ERR_PTR(-ENOMEM);
2490 2491 2492 2493 2494 2495 2496 2497
		}
	}

	return title;
}

int bpf_program__fd(struct bpf_program *prog)
{
2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532
	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;

2533 2534 2535
	if (!prog)
		return -EINVAL;

2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549
	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;
2550
}
2551

2552
void bpf_program__set_type(struct bpf_program *prog, enum bpf_prog_type type)
2553 2554 2555 2556 2557 2558 2559 2560 2561 2562
{
	prog->type = type;
}

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

2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576
#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);	\
}							\

2577
BPF_PROG_TYPE_FNS(socket_filter, BPF_PROG_TYPE_SOCKET_FILTER);
2578
BPF_PROG_TYPE_FNS(kprobe, BPF_PROG_TYPE_KPROBE);
2579 2580
BPF_PROG_TYPE_FNS(sched_cls, BPF_PROG_TYPE_SCHED_CLS);
BPF_PROG_TYPE_FNS(sched_act, BPF_PROG_TYPE_SCHED_ACT);
2581
BPF_PROG_TYPE_FNS(tracepoint, BPF_PROG_TYPE_TRACEPOINT);
2582
BPF_PROG_TYPE_FNS(raw_tracepoint, BPF_PROG_TYPE_RAW_TRACEPOINT);
2583 2584
BPF_PROG_TYPE_FNS(xdp, BPF_PROG_TYPE_XDP);
BPF_PROG_TYPE_FNS(perf_event, BPF_PROG_TYPE_PERF_EVENT);
2585

J
John Fastabend 已提交
2586 2587
void bpf_program__set_expected_attach_type(struct bpf_program *prog,
					   enum bpf_attach_type type)
2588 2589 2590 2591
{
	prog->expected_attach_type = type;
}

2592 2593
#define BPF_PROG_SEC_IMPL(string, ptype, eatype, is_attachable, atype) \
	{ string, sizeof(string) - 1, ptype, eatype, is_attachable, atype }
2594

2595
/* Programs that can NOT be attached. */
2596
#define BPF_PROG_SEC(string, ptype) BPF_PROG_SEC_IMPL(string, ptype, 0, 0, 0)
2597

2598 2599
/* Programs that can be attached. */
#define BPF_APROG_SEC(string, ptype, atype) \
2600
	BPF_PROG_SEC_IMPL(string, ptype, 0, 1, atype)
2601

2602 2603
/* Programs that must specify expected attach type at load time. */
#define BPF_EAPROG_SEC(string, ptype, eatype) \
2604
	BPF_PROG_SEC_IMPL(string, ptype, eatype, 1, eatype)
2605 2606 2607 2608 2609

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

2611 2612 2613 2614
static const struct {
	const char *sec;
	size_t len;
	enum bpf_prog_type prog_type;
2615
	enum bpf_attach_type expected_attach_type;
2616
	int is_attachable;
2617
	enum bpf_attach_type attach_type;
2618
} section_names[] = {
2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631
	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),
2632 2633 2634 2635
	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),
2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646
	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),
2647 2648 2649 2650
	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),
2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669
	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),
2670
};
2671

2672
#undef BPF_PROG_SEC_IMPL
2673
#undef BPF_PROG_SEC
2674 2675 2676
#undef BPF_APROG_SEC
#undef BPF_EAPROG_SEC
#undef BPF_APROG_COMPAT
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
#define MAX_TYPE_NAME_SIZE 32

static char *libbpf_get_type_names(bool attach_type)
{
	int i, len = ARRAY_SIZE(section_names) * MAX_TYPE_NAME_SIZE;
	char *buf;

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

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

		if (strlen(buf) + strlen(section_names[i].sec) + 2 > len) {
			free(buf);
			return NULL;
		}
		strcat(buf, " ");
		strcat(buf, section_names[i].sec);
	}

	return buf;
}

2706 2707
int libbpf_prog_type_by_name(const char *name, enum bpf_prog_type *prog_type,
			     enum bpf_attach_type *expected_attach_type)
2708
{
2709
	char *type_names;
2710 2711
	int i;

2712 2713
	if (!name)
		return -EINVAL;
2714

2715 2716 2717 2718 2719 2720 2721
	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;
	}
2722 2723 2724 2725 2726 2727 2728
	pr_warning("failed to guess program type based on ELF section name '%s'\n", name);
	type_names = libbpf_get_type_names(false);
	if (type_names != NULL) {
		pr_info("supported section(type) names are:%s\n", type_names);
		free(type_names);
	}

2729 2730
	return -EINVAL;
}
2731

2732 2733 2734
int libbpf_attach_type_by_name(const char *name,
			       enum bpf_attach_type *attach_type)
{
2735
	char *type_names;
2736 2737 2738 2739 2740 2741 2742 2743
	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;
2744
		if (!section_names[i].is_attachable)
2745 2746 2747 2748
			return -EINVAL;
		*attach_type = section_names[i].attach_type;
		return 0;
	}
2749 2750 2751 2752 2753 2754 2755
	pr_warning("failed to guess attach type based on ELF section name '%s'\n", name);
	type_names = libbpf_get_type_names(true);
	if (type_names != NULL) {
		pr_info("attachable section(type) names are:%s\n", type_names);
		free(type_names);
	}

2756 2757 2758
	return -EINVAL;
}

2759 2760 2761 2762 2763 2764 2765
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);
2766 2767
}

2768
int bpf_map__fd(struct bpf_map *map)
2769
{
2770
	return map ? map->fd : -EINVAL;
2771 2772
}

2773
const struct bpf_map_def *bpf_map__def(struct bpf_map *map)
2774
{
2775
	return map ? &map->def : ERR_PTR(-EINVAL);
2776 2777
}

2778
const char *bpf_map__name(struct bpf_map *map)
2779
{
2780
	return map ? map->name : NULL;
2781 2782
}

2783
__u32 bpf_map__btf_key_type_id(const struct bpf_map *map)
2784
{
2785
	return map ? map->btf_key_type_id : 0;
2786 2787
}

2788
__u32 bpf_map__btf_value_type_id(const struct bpf_map *map)
2789
{
2790
	return map ? map->btf_value_type_id : 0;
2791 2792
}

2793 2794
int bpf_map__set_priv(struct bpf_map *map, void *priv,
		     bpf_map_clear_priv_t clear_priv)
2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808
{
	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;
}

2809
void *bpf_map__priv(struct bpf_map *map)
2810
{
2811
	return map ? map->priv : ERR_PTR(-EINVAL);
2812 2813
}

2814 2815 2816 2817 2818
bool bpf_map__is_offload_neutral(struct bpf_map *map)
{
	return map->def.type == BPF_MAP_TYPE_PERF_EVENT_ARRAY;
}

2819 2820 2821 2822 2823
void bpf_map__set_ifindex(struct bpf_map *map, __u32 ifindex)
{
	map->map_ifindex = ifindex;
}

2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837
int bpf_map__set_inner_map_fd(struct bpf_map *map, int fd)
{
	if (!bpf_map_type__is_map_in_map(map->def.type)) {
		pr_warning("error: unsupported map type\n");
		return -EINVAL;
	}
	if (map->inner_map_fd != -1) {
		pr_warning("error: inner_map_fd already specified\n");
		return -EINVAL;
	}
	map->inner_map_fd = fd;
	return 0;
}

2838 2839
static struct bpf_map *
__bpf_map__iter(struct bpf_map *m, struct bpf_object *obj, int i)
2840
{
2841
	ssize_t idx;
2842 2843 2844 2845 2846 2847 2848 2849
	struct bpf_map *s, *e;

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

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

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

2856 2857
	idx = (m - obj->maps) + i;
	if (idx >= obj->nr_maps || idx < 0)
2858 2859 2860
		return NULL;
	return &obj->maps[idx];
}
2861

2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882
struct bpf_map *
bpf_map__next(struct bpf_map *prev, struct bpf_object *obj)
{
	if (prev == NULL)
		return obj->maps;

	return __bpf_map__iter(prev, obj, 1);
}

struct bpf_map *
bpf_map__prev(struct bpf_map *next, struct bpf_object *obj)
{
	if (next == NULL) {
		if (!obj->nr_maps)
			return NULL;
		return obj->maps + obj->nr_maps - 1;
	}

	return __bpf_map__iter(next, obj, -1);
}

2883
struct bpf_map *
2884
bpf_object__find_map_by_name(struct bpf_object *obj, const char *name)
2885 2886 2887 2888
{
	struct bpf_map *pos;

	bpf_map__for_each(pos, obj) {
2889
		if (pos->name && !strcmp(pos->name, name))
2890 2891 2892 2893
			return pos;
	}
	return NULL;
}
2894

2895 2896 2897 2898 2899 2900
int
bpf_object__find_map_fd_by_name(struct bpf_object *obj, const char *name)
{
	return bpf_map__fd(bpf_object__find_map_by_name(obj, name));
}

2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911
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);
}
2912 2913 2914 2915 2916 2917 2918

long libbpf_get_error(const void *ptr)
{
	if (IS_ERR(ptr))
		return PTR_ERR(ptr);
	return 0;
}
2919 2920 2921

int bpf_prog_load(const char *file, enum bpf_prog_type type,
		  struct bpf_object **pobj, int *prog_fd)
2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934
{
	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)
2935
{
2936 2937 2938 2939
	struct bpf_object_open_attr open_attr = {
		.file		= attr->file,
		.prog_type	= attr->prog_type,
	};
2940
	struct bpf_program *prog, *first_prog = NULL;
2941 2942
	enum bpf_attach_type expected_attach_type;
	enum bpf_prog_type prog_type;
2943
	struct bpf_object *obj;
2944
	struct bpf_map *map;
2945 2946
	int err;

2947 2948
	if (!attr)
		return -EINVAL;
2949 2950
	if (!attr->file)
		return -EINVAL;
2951

2952
	obj = bpf_object__open_xattr(&open_attr);
2953
	if (IS_ERR_OR_NULL(obj))
2954 2955
		return -ENOENT;

2956 2957 2958 2959 2960
	bpf_object__for_each_program(prog, obj) {
		/*
		 * If type is not specified, try to guess it based on
		 * section name.
		 */
2961
		prog_type = attr->prog_type;
2962
		prog->prog_ifindex = attr->ifindex;
2963 2964
		expected_attach_type = attr->expected_attach_type;
		if (prog_type == BPF_PROG_TYPE_UNSPEC) {
2965 2966 2967
			err = bpf_program__identify_section(prog, &prog_type,
							    &expected_attach_type);
			if (err < 0) {
2968 2969 2970
				bpf_object__close(obj);
				return -EINVAL;
			}
2971
		}
2972

2973 2974 2975 2976
		bpf_program__set_type(prog, prog_type);
		bpf_program__set_expected_attach_type(prog,
						      expected_attach_type);

2977
		if (!first_prog)
2978 2979 2980
			first_prog = prog;
	}

2981
	bpf_map__for_each(map, obj) {
2982 2983
		if (!bpf_map__is_offload_neutral(map))
			map->map_ifindex = attr->ifindex;
2984 2985
	}

2986 2987 2988 2989
	if (!first_prog) {
		pr_warning("object file doesn't contain bpf program\n");
		bpf_object__close(obj);
		return -ENOENT;
2990 2991
	}

2992 2993 2994 2995 2996 2997 2998
	err = bpf_object__load(obj);
	if (err) {
		bpf_object__close(obj);
		return -EINVAL;
	}

	*pobj = obj;
2999
	*prog_fd = bpf_program__fd(first_prog);
3000 3001
	return 0;
}
3002 3003

enum bpf_perf_event_ret
3004 3005 3006
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)
3007
{
3008
	struct perf_event_mmap_page *header = mmap_mem;
3009
	__u64 data_head = ring_buffer_read_head(header);
3010
	__u64 data_tail = header->data_tail;
3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029
	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;
3030 3031 3032
					ret = LIBBPF_PERF_EVENT_ERROR;
					break;
				}
3033
				*copy_size = ehdr_size;
3034 3035
			}

3036 3037 3038
			memcpy(*copy_mem, copy_start, len_first);
			memcpy(*copy_mem + len_first, base, len_secnd);
			ehdr = *copy_mem;
3039 3040
		}

3041 3042
		ret = fn(ehdr, private_data);
		data_tail += ehdr_size;
3043 3044 3045 3046
		if (ret != LIBBPF_PERF_EVENT_CONT)
			break;
	}

3047
	ring_buffer_write_tail(header, data_tail);
3048 3049
	return ret;
}