libbpf.c 46.8 KB
Newer Older
1 2
// SPDX-License-Identifier: LGPL-2.1

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.
W
Wang Nan 已提交
10 11 12 13 14 15 16 17 18 19 20 21 22
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation;
 * version 2.1 of the License (not later!)
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this program; if not,  see <http://www.gnu.org/licenses>
23 24 25
 */

#include <stdlib.h>
26 27
#include <stdio.h>
#include <stdarg.h>
28
#include <libgen.h>
29
#include <inttypes.h>
30
#include <string.h>
31
#include <unistd.h>
32 33
#include <fcntl.h>
#include <errno.h>
34
#include <asm/unistd.h>
35
#include <linux/err.h>
36
#include <linux/kernel.h>
37
#include <linux/bpf.h>
38
#include <linux/list.h>
39 40 41 42
#include <linux/limits.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <sys/vfs.h>
43 44
#include <libelf.h>
#include <gelf.h>
45 46

#include "libbpf.h"
47
#include "bpf.h"
48

49 50 51 52
#ifndef EM_BPF
#define EM_BPF 247
#endif

53 54 55 56
#ifndef BPF_FS_MAGIC
#define BPF_FS_MAGIC		0xcafe4a11
#endif

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 86 87 88 89 90 91 92
#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;
}
93

94 95 96 97 98 99 100 101 102 103
#define STRERR_BUFSIZE  128

#define ERRNO_OFFSET(e)		((e) - __LIBBPF_ERRNO__START)
#define ERRCODE_OFFSET(c)	ERRNO_OFFSET(LIBBPF_ERRNO__##c)
#define NR_ERRNO	(__LIBBPF_ERRNO__END - __LIBBPF_ERRNO__START)

static const char *libbpf_strerror_table[NR_ERRNO] = {
	[ERRCODE_OFFSET(LIBELF)]	= "Something wrong in libelf",
	[ERRCODE_OFFSET(FORMAT)]	= "BPF object format invalid",
	[ERRCODE_OFFSET(KVERSION)]	= "'version' section incorrect or lost",
104
	[ERRCODE_OFFSET(ENDIAN)]	= "Endian mismatch",
105 106 107 108 109
	[ERRCODE_OFFSET(INTERNAL)]	= "Internal error in libbpf",
	[ERRCODE_OFFSET(RELOC)]		= "Relocation failed",
	[ERRCODE_OFFSET(VERIFY)]	= "Kernel verifier blocks program loading",
	[ERRCODE_OFFSET(PROG2BIG)]	= "Program too big",
	[ERRCODE_OFFSET(KVER)]		= "Incorrect kernel version",
110
	[ERRCODE_OFFSET(PROGTYPE)]	= "Kernel doesn't support this program type",
E
Eric Leblond 已提交
111 112
	[ERRCODE_OFFSET(WRNGPID)]	= "Wrong pid in netlink message",
	[ERRCODE_OFFSET(INVSEQ)]	= "Invalid netlink sequence",
113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150
};

int libbpf_strerror(int err, char *buf, size_t size)
{
	if (!buf || !size)
		return -1;

	err = err > 0 ? err : -err;

	if (err < __LIBBPF_ERRNO__START) {
		int ret;

		ret = strerror_r(err, buf, size);
		buf[size - 1] = '\0';
		return ret;
	}

	if (err < __LIBBPF_ERRNO__END) {
		const char *msg;

		msg = libbpf_strerror_table[ERRNO_OFFSET(err)];
		snprintf(buf, size, "%s", msg);
		buf[size - 1] = '\0';
		return 0;
	}

	snprintf(buf, size, "Unknown libbpf error %d", err);
	buf[size - 1] = '\0';
	return -1;
}

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


151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170
/* 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

171 172 173 174 175 176 177
/*
 * 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;
178
	char *name;
179 180
	char *section_name;
	struct bpf_insn *insns;
181
	size_t insns_cnt, main_prog_cnt;
182
	enum bpf_prog_type type;
183

184 185 186 187 188
	struct reloc_desc {
		enum {
			RELO_LD64,
			RELO_CALL,
		} type;
189
		int insn_idx;
190 191 192 193
		union {
			int map_idx;
			int text_off;
		};
194 195
	} *reloc_desc;
	int nr_reloc;
196

197 198 199 200 201
	struct {
		int nr;
		int *fds;
	} instances;
	bpf_program_prep_t preprocessor;
202 203 204 205

	struct bpf_object *obj;
	void *priv;
	bpf_program_clear_priv_t clear_priv;
206 207

	enum bpf_attach_type expected_attach_type;
208 209
};

210 211
struct bpf_map {
	int fd;
212
	char *name;
E
Eric Leblond 已提交
213
	size_t offset;
214 215 216 217 218
	struct bpf_map_def def;
	void *priv;
	bpf_map_clear_priv_t clear_priv;
};

219 220
static LIST_HEAD(bpf_objects_list);

221
struct bpf_object {
222 223
	char license[64];
	u32 kern_version;
224

225 226
	struct bpf_program *programs;
	size_t nr_programs;
227 228 229
	struct bpf_map *maps;
	size_t nr_maps;

230
	bool loaded;
231

232 233 234 235 236 237
	/*
	 * Information when doing elf related work. Only valid if fd
	 * is valid.
	 */
	struct {
		int fd;
238 239
		void *obj_buf;
		size_t obj_buf_sz;
240 241
		Elf *elf;
		GElf_Ehdr ehdr;
242
		Elf_Data *symbols;
243
		size_t strtabidx;
244 245 246 247 248
		struct {
			GElf_Shdr shdr;
			Elf_Data *data;
		} *reloc;
		int nr_reloc;
249
		int maps_shndx;
250
		int text_shndx;
251
	} efile;
252 253 254 255 256 257
	/*
	 * 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;
258 259 260 261

	void *priv;
	bpf_object_clear_priv_t clear_priv;

262 263 264 265
	char path[];
};
#define obj_elf_valid(o)	((o)->efile.elf)

266 267
static void bpf_program__unload(struct bpf_program *prog)
{
268 269
	int i;

270 271 272
	if (!prog)
		return;

273 274 275 276 277 278 279 280 281 282 283 284 285 286
	/*
	 * 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);
287 288
}

289 290 291 292 293
static void bpf_program__exit(struct bpf_program *prog)
{
	if (!prog)
		return;

294 295 296 297 298 299
	if (prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

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

300
	bpf_program__unload(prog);
301
	zfree(&prog->name);
302 303
	zfree(&prog->section_name);
	zfree(&prog->insns);
304 305 306
	zfree(&prog->reloc_desc);

	prog->nr_reloc = 0;
307 308 309 310 311
	prog->insns_cnt = 0;
	prog->idx = -1;
}

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

	bzero(prog, sizeof(*prog));

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

	prog->insns = malloc(size);
	if (!prog->insns) {
331 332
		pr_warning("failed to alloc insns for prog under section %s\n",
			   section_name);
333 334 335 336 337 338
		goto errout;
	}
	prog->insns_cnt = size / sizeof(struct bpf_insn);
	memcpy(prog->insns, data,
	       prog->insns_cnt * sizeof(struct bpf_insn));
	prog->idx = idx;
339 340
	prog->instances.fds = NULL;
	prog->instances.nr = -1;
341
	prog->type = BPF_PROG_TYPE_KPROBE;
342 343 344 345 346 347 348 349 350

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

static int
bpf_object__add_program(struct bpf_object *obj, void *data, size_t size,
351
			char *section_name, int idx)
352 353 354 355
{
	struct bpf_program prog, *progs;
	int nr_progs, err;

356
	err = bpf_program__init(data, size, section_name, idx, &prog);
357 358 359 360 361 362 363 364 365 366 367 368 369
	if (err)
		return err;

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

	progs = realloc(progs, sizeof(progs[0]) * (nr_progs + 1));
	if (!progs) {
		/*
		 * In this case the original obj->programs
		 * is still valid, so don't need special treat for
		 * bpf_close_object().
		 */
370 371
		pr_warning("failed to alloc a new program under section '%s'\n",
			   section_name);
372 373 374 375 376 377 378
		bpf_program__exit(&prog);
		return -ENOMEM;
	}

	pr_debug("found program %s\n", prog.section_name);
	obj->programs = progs;
	obj->nr_programs = nr_progs + 1;
379
	prog.obj = obj;
380 381 382 383
	progs[nr_progs] = prog;
	return 0;
}

384 385 386 387 388 389 390 391
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++) {
392
		const char *name = NULL;
393 394

		prog = &obj->programs[pi];
395 396 397 398
		if (prog->idx == obj->efile.text_shndx) {
			name = ".text";
			goto skip_search;
		}
399 400 401 402 403 404 405 406 407

		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;
408 409
			if (GELF_ST_BIND(sym.st_info) != STB_GLOBAL)
				continue;
410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425

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

		if (!name) {
			pr_warning("failed to find sym for prog %s\n",
				   prog->section_name);
			return -EINVAL;
		}
426
skip_search:
427 428 429 430 431 432 433 434 435 436 437
		prog->name = strdup(name);
		if (!prog->name) {
			pr_warning("failed to allocate memory for prog sym %s\n",
				   name);
			return -ENOMEM;
		}
	}

	return 0;
}

438 439 440
static struct bpf_object *bpf_object__new(const char *path,
					  void *obj_buf,
					  size_t obj_buf_sz)
441 442 443 444 445 446
{
	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);
447
		return ERR_PTR(-ENOMEM);
448 449 450 451
	}

	strcpy(obj->path, path);
	obj->efile.fd = -1;
452 453 454 455 456 457 458 459 460

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

463
	obj->loaded = false;
464 465 466

	INIT_LIST_HEAD(&obj->list);
	list_add(&obj->list, &bpf_objects_list);
467 468 469 470 471 472 473 474 475 476 477 478
	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;
	}
479
	obj->efile.symbols = NULL;
480 481 482

	zfree(&obj->efile.reloc);
	obj->efile.nr_reloc = 0;
483
	zclose(obj->efile.fd);
484 485
	obj->efile.obj_buf = NULL;
	obj->efile.obj_buf_sz = 0;
486 487 488 489 490 491 492 493 494
}

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");
495
		return -LIBBPF_ERRNO__LIBELF;
496 497
	}

498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515
	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) {
			pr_warning("failed to open %s: %s\n", obj->path,
					strerror(errno));
			return -errno;
		}

		obj->efile.elf = elf_begin(obj->efile.fd,
				LIBBPF_ELF_C_READ_MMAP,
				NULL);
516 517 518 519 520
	}

	if (!obj->efile.elf) {
		pr_warning("failed to open %s as ELF file\n",
				obj->path);
521
		err = -LIBBPF_ERRNO__LIBELF;
522 523 524 525 526 527
		goto errout;
	}

	if (!gelf_getehdr(obj->efile.elf, &obj->efile.ehdr)) {
		pr_warning("failed to get EHDR from %s\n",
				obj->path);
528
		err = -LIBBPF_ERRNO__FORMAT;
529 530 531 532
		goto errout;
	}
	ep = &obj->efile.ehdr;

533 534
	/* Old LLVM set e_machine to EM_NONE */
	if ((ep->e_type != ET_REL) || (ep->e_machine && (ep->e_machine != EM_BPF))) {
535 536
		pr_warning("%s is not an eBPF object file\n",
			obj->path);
537
		err = -LIBBPF_ERRNO__FORMAT;
538 539 540 541 542 543 544 545 546
		goto errout;
	}

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

547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564
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:
565
		return -LIBBPF_ERRNO__ENDIAN;
566 567 568 569 570 571
	}

	return 0;

mismatch:
	pr_warning("Error: endianness mismatch.\n");
572
	return -LIBBPF_ERRNO__ENDIAN;
573 574
}

575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592
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)
{
	u32 kver;

	if (size != sizeof(kver)) {
		pr_warning("invalid kver section in %s\n", obj->path);
593
		return -LIBBPF_ERRNO__FORMAT;
594 595 596 597 598 599 600 601
	}
	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 已提交
602 603 604 605
static int compare_bpf_map(const void *_a, const void *_b)
{
	const struct bpf_map *a = _a;
	const struct bpf_map *b = _b;
606

E
Eric Leblond 已提交
607
	return a->offset - b->offset;
608 609
}

610
static int
E
Eric Leblond 已提交
611
bpf_object__init_maps(struct bpf_object *obj)
612
{
613
	int i, map_idx, map_def_sz, nr_maps = 0;
E
Eric Leblond 已提交
614 615
	Elf_Scn *scn;
	Elf_Data *data;
616 617
	Elf_Data *symbols = obj->efile.symbols;

E
Eric Leblond 已提交
618 619 620 621 622 623 624 625 626 627 628
	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);
629
		return -EINVAL;
E
Eric Leblond 已提交
630
	}
631

E
Eric Leblond 已提交
632 633 634 635 636 637 638
	/*
	 * 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.
	 */
639 640
	for (i = 0; i < symbols->d_size / sizeof(GElf_Sym); i++) {
		GElf_Sym sym;
E
Eric Leblond 已提交
641 642 643 644 645 646 647 648 649 650 651 652 653 654 655

		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;

656 657 658 659 660 661 662 663 664
	/* 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 已提交
665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684
	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;
685
		const char *map_name;
E
Eric Leblond 已提交
686
		struct bpf_map_def *def;
687 688 689

		if (!gelf_getsym(symbols, i, &sym))
			continue;
690
		if (sym.st_shndx != obj->efile.maps_shndx)
691 692 693
			continue;

		map_name = elf_strptr(obj->efile.elf,
694
				      obj->efile.strtabidx,
695
				      sym.st_name);
E
Eric Leblond 已提交
696
		obj->maps[map_idx].offset = sym.st_value;
697
		if (sym.st_value + map_def_sz > data->d_size) {
E
Eric Leblond 已提交
698 699 700
			pr_warning("corrupted maps section in %s: last map \"%s\" too small\n",
				   obj->path, map_name);
			return -EINVAL;
701
		}
E
Eric Leblond 已提交
702

703
		obj->maps[map_idx].name = strdup(map_name);
704 705 706 707
		if (!obj->maps[map_idx].name) {
			pr_warning("failed to alloc map name\n");
			return -ENOMEM;
		}
E
Eric Leblond 已提交
708
		pr_debug("map %d is \"%s\"\n", map_idx,
709
			 obj->maps[map_idx].name);
E
Eric Leblond 已提交
710
		def = (struct bpf_map_def *)(data->d_buf + sym.st_value);
711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739
		/*
		 * 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 已提交
740
		map_idx++;
741
	}
E
Eric Leblond 已提交
742 743

	qsort(obj->maps, obj->nr_maps, sizeof(obj->maps[0]), compare_bpf_map);
744
	return 0;
745 746
}

747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764
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;
}

765 766 767 768 769
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;
770
	int idx = 0, err = 0;
771 772 773 774 775

	/* 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);
776
		return -LIBBPF_ERRNO__FORMAT;
777 778 779 780 781 782 783 784 785
	}

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

		idx++;
		if (gelf_getshdr(scn, &sh) != &sh) {
786 787
			pr_warning("failed to get section(%d) header from %s\n",
				   idx, obj->path);
788
			err = -LIBBPF_ERRNO__FORMAT;
789 790 791 792 793
			goto out;
		}

		name = elf_strptr(elf, ep->e_shstrndx, sh.sh_name);
		if (!name) {
794 795
			pr_warning("failed to get section(%d) name from %s\n",
				   idx, obj->path);
796
			err = -LIBBPF_ERRNO__FORMAT;
797 798 799 800 801
			goto out;
		}

		data = elf_getdata(scn, 0);
		if (!data) {
802 803
			pr_warning("failed to get section(%d) data from %s(%s)\n",
				   idx, name, obj->path);
804
			err = -LIBBPF_ERRNO__FORMAT;
805 806
			goto out;
		}
807 808
		pr_debug("section(%d) %s, size %ld, link %d, flags %lx, type=%d\n",
			 idx, name, (unsigned long)data->d_size,
809 810
			 (int)sh.sh_link, (unsigned long)sh.sh_flags,
			 (int)sh.sh_type);
811 812 813 814 815 816 817 818 819

		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 已提交
820
		else if (strcmp(name, "maps") == 0)
821
			obj->efile.maps_shndx = idx;
E
Eric Leblond 已提交
822
		else if (sh.sh_type == SHT_SYMTAB) {
823 824 825
			if (obj->efile.symbols) {
				pr_warning("bpf: multiple SYMTAB in %s\n",
					   obj->path);
826
				err = -LIBBPF_ERRNO__FORMAT;
827
			} else {
828
				obj->efile.symbols = data;
829 830
				obj->efile.strtabidx = sh.sh_link;
			}
831 832 833
		} else if ((sh.sh_type == SHT_PROGBITS) &&
			   (sh.sh_flags & SHF_EXECINSTR) &&
			   (data->d_size > 0)) {
834 835
			if (strcmp(name, ".text") == 0)
				obj->efile.text_shndx = idx;
836 837 838
			err = bpf_object__add_program(obj, data->d_buf,
						      data->d_size, name, idx);
			if (err) {
839 840
				char errmsg[STRERR_BUFSIZE];

841 842 843 844
				strerror_r(-err, errmsg, sizeof(errmsg));
				pr_warning("failed to alloc program %s (%s): %s",
					   name, obj->path, errmsg);
			}
845 846 847
		} else if (sh.sh_type == SHT_REL) {
			void *reloc = obj->efile.reloc;
			int nr_reloc = obj->efile.nr_reloc + 1;
848 849 850 851 852 853 854 855
			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;
			}
856 857 858 859 860 861 862 863 864 865 866 867 868 869 870

			reloc = realloc(reloc,
					sizeof(*obj->efile.reloc) * nr_reloc);
			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;
			}
871 872
		} else {
			pr_debug("skip section(%d) %s\n", idx, name);
873
		}
874 875
		if (err)
			goto out;
876
	}
877

878 879 880 881
	if (!obj->efile.strtabidx || obj->efile.strtabidx >= idx) {
		pr_warning("Corrupted ELF file: index of strtab invalid\n");
		return LIBBPF_ERRNO__FORMAT;
	}
882
	if (obj->efile.maps_shndx >= 0) {
E
Eric Leblond 已提交
883
		err = bpf_object__init_maps(obj);
884 885 886 887
		if (err)
			goto out;
	}
	err = bpf_object__init_prog_names(obj);
888 889 890 891
out:
	return err;
}

892 893 894 895 896 897 898 899 900 901 902 903 904 905 906
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;
}

static int
907 908
bpf_program__collect_reloc(struct bpf_program *prog, GElf_Shdr *shdr,
			   Elf_Data *data, struct bpf_object *obj)
909
{
910 911 912 913 914
	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;
915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936
	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);
937
			return -LIBBPF_ERRNO__FORMAT;
938 939 940 941 942 943 944
		}

		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));
945
			return -LIBBPF_ERRNO__FORMAT;
946
		}
D
David Miller 已提交
947 948 949
		pr_debug("relo for %lld value %lld name %d\n",
			 (long long) (rel.r_info >> 32),
			 (long long) sym.st_value, sym.st_name);
950

951
		if (sym.st_shndx != maps_shndx && sym.st_shndx != text_shndx) {
952 953 954 955 956 957 958 959
			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);

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

971 972 973
		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);
974
			return -LIBBPF_ERRNO__RELOC;
975 976
		}

977 978 979 980 981 982 983 984 985
		/* 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;
			}
		}

986 987 988
		if (map_idx >= nr_maps) {
			pr_warning("bpf relocation: map_idx %d large than %d\n",
				   (int)map_idx, (int)nr_maps - 1);
989
			return -LIBBPF_ERRNO__RELOC;
990 991
		}

992
		prog->reloc_desc[i].type = RELO_LD64;
993 994 995 996 997 998
		prog->reloc_desc[i].insn_idx = insn_idx;
		prog->reloc_desc[i].map_idx = map_idx;
	}
	return 0;
}

999 1000 1001 1002 1003
static int
bpf_object__create_maps(struct bpf_object *obj)
{
	unsigned int i;

1004 1005 1006
	for (i = 0; i < obj->nr_maps; i++) {
		struct bpf_map_def *def = &obj->maps[i].def;
		int *pfd = &obj->maps[i].fd;
1007

1008 1009 1010 1011 1012
		*pfd = bpf_create_map_name(def->type,
					   obj->maps[i].name,
					   def->key_size,
					   def->value_size,
					   def->max_entries,
1013
					   def->map_flags);
1014 1015 1016 1017
		if (*pfd < 0) {
			size_t j;
			int err = *pfd;

E
Eric Leblond 已提交
1018 1019
			pr_warning("failed to create map (name: '%s'): %s\n",
				   obj->maps[i].name,
1020 1021
				   strerror(errno));
			for (j = 0; j < i; j++)
1022
				zclose(obj->maps[j].fd);
1023 1024
			return err;
		}
E
Eric Leblond 已提交
1025
		pr_debug("create map %s: fd=%d\n", obj->maps[i].name, *pfd);
1026 1027 1028 1029 1030
	}

	return 0;
}

1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064
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;
		new_insn = realloc(prog->insns, new_cnt * sizeof(*insn));
		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;
1065 1066 1067
		pr_debug("added %zd insn from %s to prog %s\n",
			 text->insns_cnt, text->section_name,
			 prog->section_name);
1068 1069 1070 1071 1072 1073
	}
	insn = &prog->insns[relo->insn_idx];
	insn->imm += prog->main_prog_cnt - relo->insn_idx;
	return 0;
}

W
Wang Nan 已提交
1074
static int
1075
bpf_program__relocate(struct bpf_program *prog, struct bpf_object *obj)
W
Wang Nan 已提交
1076
{
1077
	int i, err;
W
Wang Nan 已提交
1078 1079 1080 1081 1082

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

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

1087 1088
			insn_idx = prog->reloc_desc[i].insn_idx;
			map_idx = prog->reloc_desc[i].map_idx;
W
Wang Nan 已提交
1089

1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101
			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 已提交
1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120
		}
	}

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

1121
		err = bpf_program__relocate(prog, obj);
W
Wang Nan 已提交
1122 1123 1124 1125 1126 1127 1128 1129 1130
		if (err) {
			pr_warning("failed to relocate '%s'\n",
				   prog->section_name);
			return err;
		}
	}
	return 0;
}

1131 1132 1133 1134 1135 1136
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");
1137
		return -LIBBPF_ERRNO__INTERNAL;
1138 1139 1140 1141 1142 1143 1144 1145 1146 1147
	}

	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__);
1148
			return -LIBBPF_ERRNO__INTERNAL;
1149 1150 1151 1152
		}

		prog = bpf_object__find_prog_by_idx(obj, idx);
		if (!prog) {
1153
			pr_warning("relocation failed: no section(%d)\n", idx);
1154
			return -LIBBPF_ERRNO__RELOC;
1155 1156
		}

1157
		err = bpf_program__collect_reloc(prog,
1158
						 shdr, data,
1159
						 obj);
1160
		if (err)
1161
			return err;
1162 1163 1164 1165
	}
	return 0;
}

1166
static int
1167 1168 1169
load_program(enum bpf_prog_type type, enum bpf_attach_type expected_attach_type,
	     const char *name, struct bpf_insn *insns, int insns_cnt,
	     char *license, u32 kern_version, int *pfd)
1170
{
1171
	struct bpf_load_program_attr load_attr;
1172
	char *log_buf;
1173
	int ret;
1174

1175 1176 1177 1178 1179 1180 1181 1182 1183 1184
	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;

	if (!load_attr.insns || !load_attr.insns_cnt)
1185 1186 1187 1188 1189 1190
		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");

1191
	ret = bpf_load_program_xattr(&load_attr, log_buf, BPF_LOG_BUF_SIZE);
1192 1193 1194 1195 1196 1197 1198

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

1199
	ret = -LIBBPF_ERRNO__LOAD;
1200 1201
	pr_warning("load bpf program failed: %s\n", strerror(errno));

1202 1203
	if (log_buf && log_buf[0] != '\0') {
		ret = -LIBBPF_ERRNO__VERIFY;
1204 1205 1206
		pr_warning("-- BEGIN DUMP LOG ---\n");
		pr_warning("\n%s\n", log_buf);
		pr_warning("-- END LOG --\n");
1207 1208 1209
	} 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);
1210
		ret = -LIBBPF_ERRNO__PROG2BIG;
1211
	} else {
1212
		/* Wrong program type? */
1213
		if (load_attr.prog_type != BPF_PROG_TYPE_KPROBE) {
1214 1215
			int fd;

1216 1217 1218
			load_attr.prog_type = BPF_PROG_TYPE_KPROBE;
			load_attr.expected_attach_type = 0;
			fd = bpf_load_program_xattr(&load_attr, NULL, 0);
1219 1220 1221 1222 1223
			if (fd >= 0) {
				close(fd);
				ret = -LIBBPF_ERRNO__PROGTYPE;
				goto out;
			}
1224
		}
1225 1226 1227

		if (log_buf)
			ret = -LIBBPF_ERRNO__KVER;
1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238
	}

out:
	free(log_buf);
	return ret;
}

static int
bpf_program__load(struct bpf_program *prog,
		  char *license, u32 kern_version)
{
1239
	int err = 0, fd, i;
1240

1241 1242 1243 1244 1245 1246
	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;
		}
1247

1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261
		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);
		}
1262 1263 1264
		err = load_program(prog->type, prog->expected_attach_type,
				   prog->name, prog->insns, prog->insns_cnt,
				   license, kern_version, &fd);
1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291
		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;
		}

1292 1293
		err = load_program(prog->type, prog->expected_attach_type,
				   prog->name, result.new_insn_ptr,
1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307
				   result.new_insn_cnt,
				   license, kern_version, &fd);

		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:
1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322
	if (err)
		pr_warning("failed to load program '%s'\n",
			   prog->section_name);
	zfree(&prog->insns);
	prog->insns_cnt = 0;
	return err;
}

static int
bpf_object__load_progs(struct bpf_object *obj)
{
	size_t i;
	int err;

	for (i = 0; i < obj->nr_programs; i++) {
1323 1324
		if (obj->programs[i].idx == obj->efile.text_shndx)
			continue;
1325 1326 1327 1328 1329 1330 1331 1332 1333
		err = bpf_program__load(&obj->programs[i],
					obj->license,
					obj->kern_version);
		if (err)
			return err;
	}
	return 0;
}

1334 1335 1336 1337 1338
static int bpf_object__validate(struct bpf_object *obj)
{
	if (obj->kern_version == 0) {
		pr_warning("%s doesn't provide kernel version\n",
			   obj->path);
1339
		return -LIBBPF_ERRNO__KVERSION;
1340 1341 1342 1343
	}
	return 0;
}

1344
static struct bpf_object *
1345
__bpf_object__open(const char *path, void *obj_buf, size_t obj_buf_sz)
1346 1347
{
	struct bpf_object *obj;
1348
	int err;
1349 1350 1351

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

1355
	obj = bpf_object__new(path, obj_buf, obj_buf_sz);
1356 1357
	if (IS_ERR(obj))
		return obj;
1358

1359 1360 1361 1362 1363
	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);
	CHECK_ERR(bpf_object__validate(obj), err, out);
1364 1365 1366 1367 1368

	bpf_object__elf_finish(obj);
	return obj;
out:
	bpf_object__close(obj);
1369
	return ERR_PTR(err);
1370 1371 1372 1373 1374 1375 1376 1377 1378 1379
}

struct bpf_object *bpf_object__open(const char *path)
{
	/* param validation */
	if (!path)
		return NULL;

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

1380 1381 1382 1383
	return __bpf_object__open(path, NULL, 0);
}

struct bpf_object *bpf_object__open_buffer(void *obj_buf,
1384 1385
					   size_t obj_buf_sz,
					   const char *name)
1386
{
1387 1388
	char tmp_name[64];

1389 1390 1391 1392
	/* param validation */
	if (!obj_buf || obj_buf_sz <= 0)
		return NULL;

1393 1394 1395 1396 1397 1398 1399 1400 1401
	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);
1402

1403
	return __bpf_object__open(name, obj_buf, obj_buf_sz);
1404 1405
}

1406 1407 1408 1409 1410 1411 1412
int bpf_object__unload(struct bpf_object *obj)
{
	size_t i;

	if (!obj)
		return -EINVAL;

1413 1414
	for (i = 0; i < obj->nr_maps; i++)
		zclose(obj->maps[i].fd);
1415

1416 1417 1418
	for (i = 0; i < obj->nr_programs; i++)
		bpf_program__unload(&obj->programs[i]);

1419 1420 1421 1422 1423
	return 0;
}

int bpf_object__load(struct bpf_object *obj)
{
1424 1425
	int err;

1426 1427 1428 1429 1430 1431 1432 1433 1434
	if (!obj)
		return -EINVAL;

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

	obj->loaded = true;
1435 1436 1437 1438

	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);
1439 1440 1441 1442 1443

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

1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556
static int check_path(const char *path)
{
	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)) {
		pr_warning("failed to statfs %s: %s\n", dir, strerror(errno));
		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)
{
	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)) {
		pr_warning("failed to pin program: %s\n", strerror(errno));
		return -errno;
	}
	pr_debug("pinned program '%s'\n", path);

	return 0;
}

static int make_dir(const char *path)
{
	int err = 0;

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

	if (err)
		pr_warning("failed to mkdir %s: %s\n", path, strerror(-err));
	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 已提交
1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578
int bpf_map__pin(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;
	}

	if (bpf_obj_pin(map->fd, path)) {
		pr_warning("failed to pin map: %s\n", strerror(errno));
		return -errno;
	}

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

1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631
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;
}

1632 1633
void bpf_object__close(struct bpf_object *obj)
{
1634 1635
	size_t i;

1636 1637 1638
	if (!obj)
		return;

1639 1640 1641
	if (obj->clear_priv)
		obj->clear_priv(obj, obj->priv);

1642
	bpf_object__elf_finish(obj);
1643
	bpf_object__unload(obj);
1644

1645
	for (i = 0; i < obj->nr_maps; i++) {
1646
		zfree(&obj->maps[i].name);
1647 1648 1649 1650 1651 1652 1653 1654
		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;
1655 1656 1657 1658 1659 1660 1661

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

1662
	list_del(&obj->list);
1663 1664
	free(obj);
}
1665

1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684
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;
}

1685
const char *bpf_object__name(struct bpf_object *obj)
1686
{
1687
	return obj ? obj->path : ERR_PTR(-EINVAL);
1688 1689
}

1690
unsigned int bpf_object__kversion(struct bpf_object *obj)
1691
{
1692
	return obj ? obj->kern_version : 0;
1693 1694
}

1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710
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);
}

1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732
struct bpf_program *
bpf_program__next(struct bpf_program *prev, struct bpf_object *obj)
{
	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];
}

1733 1734
int bpf_program__set_priv(struct bpf_program *prog, void *priv,
			  bpf_program_clear_priv_t clear_priv)
1735 1736 1737 1738 1739 1740 1741 1742 1743
{
	if (prog->priv && prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

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

1744
void *bpf_program__priv(struct bpf_program *prog)
1745
{
1746
	return prog ? prog->priv : ERR_PTR(-EINVAL);
1747 1748
}

1749
const char *bpf_program__title(struct bpf_program *prog, bool needs_copy)
1750 1751 1752 1753
{
	const char *title;

	title = prog->section_name;
1754
	if (needs_copy) {
1755 1756 1757
		title = strdup(title);
		if (!title) {
			pr_warning("failed to strdup program title\n");
1758
			return ERR_PTR(-ENOMEM);
1759 1760 1761 1762 1763 1764 1765 1766
		}
	}

	return title;
}

int bpf_program__fd(struct bpf_program *prog)
{
1767 1768 1769 1770 1771 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
	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;

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

1818
void bpf_program__set_type(struct bpf_program *prog, enum bpf_prog_type type)
1819 1820 1821 1822 1823 1824 1825 1826 1827 1828
{
	prog->type = type;
}

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

1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842
#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);	\
}							\

1843
BPF_PROG_TYPE_FNS(socket_filter, BPF_PROG_TYPE_SOCKET_FILTER);
1844
BPF_PROG_TYPE_FNS(kprobe, BPF_PROG_TYPE_KPROBE);
1845 1846
BPF_PROG_TYPE_FNS(sched_cls, BPF_PROG_TYPE_SCHED_CLS);
BPF_PROG_TYPE_FNS(sched_act, BPF_PROG_TYPE_SCHED_ACT);
1847
BPF_PROG_TYPE_FNS(tracepoint, BPF_PROG_TYPE_TRACEPOINT);
1848 1849
BPF_PROG_TYPE_FNS(xdp, BPF_PROG_TYPE_XDP);
BPF_PROG_TYPE_FNS(perf_event, BPF_PROG_TYPE_PERF_EVENT);
1850

1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861
static void bpf_program__set_expected_attach_type(struct bpf_program *prog,
						 enum bpf_attach_type type)
{
	prog->expected_attach_type = type;
}

#define BPF_PROG_SEC_FULL(string, ptype, atype) \
	{ string, sizeof(string) - 1, ptype, atype }

#define BPF_PROG_SEC(string, ptype) BPF_PROG_SEC_FULL(string, ptype, 0)

1862 1863 1864
#define BPF_SA_PROG_SEC(string, ptype) \
	BPF_PROG_SEC_FULL(string, BPF_PROG_TYPE_CGROUP_SOCK_ADDR, ptype)

1865 1866 1867 1868
static const struct {
	const char *sec;
	size_t len;
	enum bpf_prog_type prog_type;
1869
	enum bpf_attach_type expected_attach_type;
1870 1871 1872 1873
} section_names[] = {
	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),
1874 1875
	BPF_PROG_SEC("classifier",	BPF_PROG_TYPE_SCHED_CLS),
	BPF_PROG_SEC("action",		BPF_PROG_TYPE_SCHED_ACT),
1876 1877 1878 1879 1880 1881
	BPF_PROG_SEC("tracepoint/",	BPF_PROG_TYPE_TRACEPOINT),
	BPF_PROG_SEC("xdp",		BPF_PROG_TYPE_XDP),
	BPF_PROG_SEC("perf_event",	BPF_PROG_TYPE_PERF_EVENT),
	BPF_PROG_SEC("cgroup/skb",	BPF_PROG_TYPE_CGROUP_SKB),
	BPF_PROG_SEC("cgroup/sock",	BPF_PROG_TYPE_CGROUP_SOCK),
	BPF_PROG_SEC("cgroup/dev",	BPF_PROG_TYPE_CGROUP_DEVICE),
1882 1883 1884
	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),
1885 1886
	BPF_PROG_SEC("sockops",		BPF_PROG_TYPE_SOCK_OPS),
	BPF_PROG_SEC("sk_skb",		BPF_PROG_TYPE_SK_SKB),
1887
	BPF_PROG_SEC("sk_msg",		BPF_PROG_TYPE_SK_MSG),
1888 1889
	BPF_SA_PROG_SEC("cgroup/bind4",	BPF_CGROUP_INET4_BIND),
	BPF_SA_PROG_SEC("cgroup/bind6",	BPF_CGROUP_INET6_BIND),
1890 1891
	BPF_SA_PROG_SEC("cgroup/connect4", BPF_CGROUP_INET4_CONNECT),
	BPF_SA_PROG_SEC("cgroup/connect6", BPF_CGROUP_INET6_CONNECT),
1892
};
1893

1894
#undef BPF_PROG_SEC
1895
#undef BPF_PROG_SEC_FULL
1896
#undef BPF_SA_PROG_SEC
1897

1898
static int bpf_program__identify_section(struct bpf_program *prog)
1899 1900 1901 1902 1903 1904 1905 1906 1907
{
	int i;

	if (!prog->section_name)
		goto err;

	for (i = 0; i < ARRAY_SIZE(section_names); i++)
		if (strncmp(prog->section_name, section_names[i].sec,
			    section_names[i].len) == 0)
1908
			return i;
1909 1910 1911 1912 1913

err:
	pr_warning("failed to guess program type based on section name %s\n",
		   prog->section_name);

1914
	return -1;
1915 1916
}

1917
int bpf_map__fd(struct bpf_map *map)
1918
{
1919
	return map ? map->fd : -EINVAL;
1920 1921
}

1922
const struct bpf_map_def *bpf_map__def(struct bpf_map *map)
1923
{
1924
	return map ? &map->def : ERR_PTR(-EINVAL);
1925 1926
}

1927
const char *bpf_map__name(struct bpf_map *map)
1928
{
1929
	return map ? map->name : NULL;
1930 1931
}

1932 1933
int bpf_map__set_priv(struct bpf_map *map, void *priv,
		     bpf_map_clear_priv_t clear_priv)
1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947
{
	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;
}

1948
void *bpf_map__priv(struct bpf_map *map)
1949
{
1950
	return map ? map->priv : ERR_PTR(-EINVAL);
1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978
}

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];
}
1979 1980

struct bpf_map *
1981
bpf_object__find_map_by_name(struct bpf_object *obj, const char *name)
1982 1983 1984 1985
{
	struct bpf_map *pos;

	bpf_map__for_each(pos, obj) {
1986
		if (pos->name && !strcmp(pos->name, name))
1987 1988 1989 1990
			return pos;
	}
	return NULL;
}
1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002

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);
}
2003 2004 2005 2006 2007 2008 2009

long libbpf_get_error(const void *ptr)
{
	if (IS_ERR(ptr))
		return PTR_ERR(ptr);
	return 0;
}
2010 2011 2012

int bpf_prog_load(const char *file, enum bpf_prog_type type,
		  struct bpf_object **pobj, int *prog_fd)
2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025
{
	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)
2026
{
2027
	struct bpf_program *prog, *first_prog = NULL;
2028 2029
	enum bpf_attach_type expected_attach_type;
	enum bpf_prog_type prog_type;
2030
	struct bpf_object *obj;
2031
	int section_idx;
2032 2033
	int err;

2034 2035 2036 2037
	if (!attr)
		return -EINVAL;

	obj = bpf_object__open(attr->file);
2038 2039 2040
	if (IS_ERR(obj))
		return -ENOENT;

2041 2042 2043 2044 2045
	bpf_object__for_each_program(prog, obj) {
		/*
		 * If type is not specified, try to guess it based on
		 * section name.
		 */
2046 2047 2048 2049 2050
		prog_type = attr->prog_type;
		expected_attach_type = attr->expected_attach_type;
		if (prog_type == BPF_PROG_TYPE_UNSPEC) {
			section_idx = bpf_program__identify_section(prog);
			if (section_idx < 0) {
2051 2052 2053
				bpf_object__close(obj);
				return -EINVAL;
			}
2054 2055 2056
			prog_type = section_names[section_idx].prog_type;
			expected_attach_type =
				section_names[section_idx].expected_attach_type;
2057
		}
2058

2059 2060 2061 2062
		bpf_program__set_type(prog, prog_type);
		bpf_program__set_expected_attach_type(prog,
						      expected_attach_type);

2063 2064 2065 2066 2067 2068 2069 2070
		if (prog->idx != obj->efile.text_shndx && !first_prog)
			first_prog = prog;
	}

	if (!first_prog) {
		pr_warning("object file doesn't contain bpf program\n");
		bpf_object__close(obj);
		return -ENOENT;
2071 2072
	}

2073 2074 2075 2076 2077 2078 2079
	err = bpf_object__load(obj);
	if (err) {
		bpf_object__close(obj);
		return -EINVAL;
	}

	*pobj = obj;
2080
	*prog_fd = bpf_program__fd(first_prog);
2081 2082
	return 0;
}