libbpf.c 31.3 KB
Newer Older
1 2 3 4 5 6
/*
 * 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.
W
Wang Nan 已提交
7 8 9 10 11 12 13 14 15 16 17 18 19
 *
 * 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>
20 21 22
 */

#include <stdlib.h>
23 24
#include <stdio.h>
#include <stdarg.h>
25
#include <inttypes.h>
26
#include <string.h>
27
#include <unistd.h>
28 29
#include <fcntl.h>
#include <errno.h>
30
#include <asm/unistd.h>
31
#include <linux/kernel.h>
32
#include <linux/bpf.h>
33
#include <linux/list.h>
34 35
#include <libelf.h>
#include <gelf.h>
36 37

#include "libbpf.h"
38
#include "bpf.h"
39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75

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

77 78 79 80 81 82 83 84 85 86
#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",
87
	[ERRCODE_OFFSET(ENDIAN)]	= "Endian mismatch",
88 89 90 91 92
	[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",
93
	[ERRCODE_OFFSET(PROGTYPE)]	= "Kernel doesn't support this program type",
94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131
};

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)


132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151
/* 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

152 153 154 155 156 157 158 159 160 161
/*
 * 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;
	char *section_name;
	struct bpf_insn *insns;
	size_t insns_cnt;
162
	enum bpf_prog_type type;
163 164 165 166 167 168

	struct {
		int insn_idx;
		int map_idx;
	} *reloc_desc;
	int nr_reloc;
169

170 171 172 173 174
	struct {
		int nr;
		int *fds;
	} instances;
	bpf_program_prep_t preprocessor;
175 176 177 178

	struct bpf_object *obj;
	void *priv;
	bpf_program_clear_priv_t clear_priv;
179 180
};

181 182
struct bpf_map {
	int fd;
183
	char *name;
184 185 186 187 188
	struct bpf_map_def def;
	void *priv;
	bpf_map_clear_priv_t clear_priv;
};

189 190
static LIST_HEAD(bpf_objects_list);

191
struct bpf_object {
192 193
	char license[64];
	u32 kern_version;
194

195 196
	struct bpf_program *programs;
	size_t nr_programs;
197 198 199
	struct bpf_map *maps;
	size_t nr_maps;

200
	bool loaded;
201

202 203 204 205 206 207
	/*
	 * Information when doing elf related work. Only valid if fd
	 * is valid.
	 */
	struct {
		int fd;
208 209
		void *obj_buf;
		size_t obj_buf_sz;
210 211
		Elf *elf;
		GElf_Ehdr ehdr;
212
		Elf_Data *symbols;
213
		size_t strtabidx;
214 215 216 217 218
		struct {
			GElf_Shdr shdr;
			Elf_Data *data;
		} *reloc;
		int nr_reloc;
219
		int maps_shndx;
220
	} efile;
221 222 223 224 225 226
	/*
	 * 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;
227 228 229 230
	char path[];
};
#define obj_elf_valid(o)	((o)->efile.elf)

231 232
static void bpf_program__unload(struct bpf_program *prog)
{
233 234
	int i;

235 236 237
	if (!prog)
		return;

238 239 240 241 242 243 244 245 246 247 248 249 250 251
	/*
	 * 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);
252 253
}

254 255 256 257 258
static void bpf_program__exit(struct bpf_program *prog)
{
	if (!prog)
		return;

259 260 261 262 263 264
	if (prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

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

265
	bpf_program__unload(prog);
266 267
	zfree(&prog->section_name);
	zfree(&prog->insns);
268 269 270
	zfree(&prog->reloc_desc);

	prog->nr_reloc = 0;
271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301
	prog->insns_cnt = 0;
	prog->idx = -1;
}

static int
bpf_program__init(void *data, size_t size, char *name, int idx,
		    struct bpf_program *prog)
{
	if (size < sizeof(struct bpf_insn)) {
		pr_warning("corrupted section '%s'\n", name);
		return -EINVAL;
	}

	bzero(prog, sizeof(*prog));

	prog->section_name = strdup(name);
	if (!prog->section_name) {
		pr_warning("failed to alloc name for prog %s\n",
			   name);
		goto errout;
	}

	prog->insns = malloc(size);
	if (!prog->insns) {
		pr_warning("failed to alloc insns for %s\n", name);
		goto errout;
	}
	prog->insns_cnt = size / sizeof(struct bpf_insn);
	memcpy(prog->insns, data,
	       prog->insns_cnt * sizeof(struct bpf_insn));
	prog->idx = idx;
302 303
	prog->instances.fds = NULL;
	prog->instances.nr = -1;
304
	prog->type = BPF_PROG_TYPE_KPROBE;
305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341

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

static int
bpf_object__add_program(struct bpf_object *obj, void *data, size_t size,
			char *name, int idx)
{
	struct bpf_program prog, *progs;
	int nr_progs, err;

	err = bpf_program__init(data, size, name, idx, &prog);
	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().
		 */
		pr_warning("failed to alloc a new program '%s'\n",
			   name);
		bpf_program__exit(&prog);
		return -ENOMEM;
	}

	pr_debug("found program %s\n", prog.section_name);
	obj->programs = progs;
	obj->nr_programs = nr_progs + 1;
342
	prog.obj = obj;
343 344 345 346
	progs[nr_progs] = prog;
	return 0;
}

347 348 349
static struct bpf_object *bpf_object__new(const char *path,
					  void *obj_buf,
					  size_t obj_buf_sz)
350 351 352 353 354 355
{
	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);
356
		return ERR_PTR(-ENOMEM);
357 358 359 360
	}

	strcpy(obj->path, path);
	obj->efile.fd = -1;
361 362 363 364 365 366 367 368 369

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

372
	obj->loaded = false;
373 374 375

	INIT_LIST_HEAD(&obj->list);
	list_add(&obj->list, &bpf_objects_list);
376 377 378 379 380 381 382 383 384 385 386 387
	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;
	}
388
	obj->efile.symbols = NULL;
389 390 391

	zfree(&obj->efile.reloc);
	obj->efile.nr_reloc = 0;
392
	zclose(obj->efile.fd);
393 394
	obj->efile.obj_buf = NULL;
	obj->efile.obj_buf_sz = 0;
395 396 397 398 399 400 401 402 403
}

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");
404
		return -LIBBPF_ERRNO__LIBELF;
405 406
	}

407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424
	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);
425 426 427 428 429
	}

	if (!obj->efile.elf) {
		pr_warning("failed to open %s as ELF file\n",
				obj->path);
430
		err = -LIBBPF_ERRNO__LIBELF;
431 432 433 434 435 436
		goto errout;
	}

	if (!gelf_getehdr(obj->efile.elf, &obj->efile.ehdr)) {
		pr_warning("failed to get EHDR from %s\n",
				obj->path);
437
		err = -LIBBPF_ERRNO__FORMAT;
438 439 440 441 442 443 444
		goto errout;
	}
	ep = &obj->efile.ehdr;

	if ((ep->e_type != ET_REL) || (ep->e_machine != 0)) {
		pr_warning("%s is not an eBPF object file\n",
			obj->path);
445
		err = -LIBBPF_ERRNO__FORMAT;
446 447 448 449 450 451 452 453 454
		goto errout;
	}

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

455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472
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:
473
		return -LIBBPF_ERRNO__ENDIAN;
474 475 476 477 478 479
	}

	return 0;

mismatch:
	pr_warning("Error: endianness mismatch.\n");
480
	return -LIBBPF_ERRNO__ENDIAN;
481 482
}

483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500
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);
501
		return -LIBBPF_ERRNO__FORMAT;
502 503 504 505 506 507 508 509
	}
	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;
}

510 511 512 513
static int
bpf_object__init_maps(struct bpf_object *obj, void *data,
		      size_t size)
{
514 515 516 517 518
	size_t nr_maps;
	int i;

	nr_maps = size / sizeof(struct bpf_map_def);
	if (!data || !nr_maps) {
519 520 521 522 523
		pr_debug("%s doesn't need map definition\n",
			 obj->path);
		return 0;
	}

524 525 526 527 528
	pr_debug("maps in %s: %zd bytes\n", obj->path, size);

	obj->maps = calloc(nr_maps, sizeof(obj->maps[0]));
	if (!obj->maps) {
		pr_warning("alloc maps for object failed\n");
529 530
		return -ENOMEM;
	}
531 532 533 534
	obj->nr_maps = nr_maps;

	for (i = 0; i < nr_maps; i++) {
		struct bpf_map_def *def = &obj->maps[i].def;
535

536 537 538 539 540 541 542 543 544 545
		/*
		 * fill all fd with -1 so won't close incorrect
		 * fd (fd=0 is stdin) when failure (zclose won't close
		 * negative fd)).
		 */
		obj->maps[i].fd = -1;

		/* Save map definition into obj->maps */
		*def = ((struct bpf_map_def *)data)[i];
	}
546 547 548
	return 0;
}

549
static int
550
bpf_object__init_maps_name(struct bpf_object *obj)
551 552 553 554
{
	int i;
	Elf_Data *symbols = obj->efile.symbols;

555
	if (!symbols || obj->efile.maps_shndx < 0)
556
		return -EINVAL;
557 558 559 560 561 562 563 564

	for (i = 0; i < symbols->d_size / sizeof(GElf_Sym); i++) {
		GElf_Sym sym;
		size_t map_idx;
		const char *map_name;

		if (!gelf_getsym(symbols, i, &sym))
			continue;
565
		if (sym.st_shndx != obj->efile.maps_shndx)
566 567 568
			continue;

		map_name = elf_strptr(obj->efile.elf,
569
				      obj->efile.strtabidx,
570 571 572 573 574 575 576 577
				      sym.st_name);
		map_idx = sym.st_value / sizeof(struct bpf_map_def);
		if (map_idx >= obj->nr_maps) {
			pr_warning("index of map \"%s\" is buggy: %zu > %zu\n",
				   map_name, map_idx, obj->nr_maps);
			continue;
		}
		obj->maps[map_idx].name = strdup(map_name);
578 579 580 581
		if (!obj->maps[map_idx].name) {
			pr_warning("failed to alloc map name\n");
			return -ENOMEM;
		}
582 583 584
		pr_debug("map %zu is \"%s\"\n", map_idx,
			 obj->maps[map_idx].name);
	}
585
	return 0;
586 587
}

588 589 590 591 592
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;
593
	int idx = 0, err = 0;
594 595 596 597 598

	/* 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);
599
		return -LIBBPF_ERRNO__FORMAT;
600 601 602 603 604 605 606 607 608 609 610
	}

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

		idx++;
		if (gelf_getshdr(scn, &sh) != &sh) {
			pr_warning("failed to get section header from %s\n",
				   obj->path);
611
			err = -LIBBPF_ERRNO__FORMAT;
612 613 614 615 616 617 618
			goto out;
		}

		name = elf_strptr(elf, ep->e_shstrndx, sh.sh_name);
		if (!name) {
			pr_warning("failed to get section name from %s\n",
				   obj->path);
619
			err = -LIBBPF_ERRNO__FORMAT;
620 621 622 623 624 625 626
			goto out;
		}

		data = elf_getdata(scn, 0);
		if (!data) {
			pr_warning("failed to get section data from %s(%s)\n",
				   name, obj->path);
627
			err = -LIBBPF_ERRNO__FORMAT;
628 629 630 631 632 633
			goto out;
		}
		pr_debug("section %s, size %ld, link %d, flags %lx, type=%d\n",
			 name, (unsigned long)data->d_size,
			 (int)sh.sh_link, (unsigned long)sh.sh_flags,
			 (int)sh.sh_type);
634 635 636 637 638 639 640 641 642

		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);
643
		else if (strcmp(name, "maps") == 0) {
644 645
			err = bpf_object__init_maps(obj, data->d_buf,
						    data->d_size);
646
			obj->efile.maps_shndx = idx;
647
		} else if (sh.sh_type == SHT_SYMTAB) {
648 649 650
			if (obj->efile.symbols) {
				pr_warning("bpf: multiple SYMTAB in %s\n",
					   obj->path);
651
				err = -LIBBPF_ERRNO__FORMAT;
652
			} else {
653
				obj->efile.symbols = data;
654 655
				obj->efile.strtabidx = sh.sh_link;
			}
656 657 658 659 660 661
		} else if ((sh.sh_type == SHT_PROGBITS) &&
			   (sh.sh_flags & SHF_EXECINSTR) &&
			   (data->d_size > 0)) {
			err = bpf_object__add_program(obj, data->d_buf,
						      data->d_size, name, idx);
			if (err) {
662 663
				char errmsg[STRERR_BUFSIZE];

664 665 666 667
				strerror_r(-err, errmsg, sizeof(errmsg));
				pr_warning("failed to alloc program %s (%s): %s",
					   name, obj->path, errmsg);
			}
668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685
		} else if (sh.sh_type == SHT_REL) {
			void *reloc = obj->efile.reloc;
			int nr_reloc = obj->efile.nr_reloc + 1;

			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;
			}
686
		}
687 688
		if (err)
			goto out;
689
	}
690

691 692 693 694
	if (!obj->efile.strtabidx || obj->efile.strtabidx >= idx) {
		pr_warning("Corrupted ELF file: index of strtab invalid\n");
		return LIBBPF_ERRNO__FORMAT;
	}
695 696
	if (obj->efile.maps_shndx >= 0)
		err = bpf_object__init_maps_name(obj);
697 698 699 700
out:
	return err;
}

701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717
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
bpf_program__collect_reloc(struct bpf_program *prog,
			   size_t nr_maps, GElf_Shdr *shdr,
718 719
			   Elf_Data *data, Elf_Data *symbols,
			   int maps_shndx)
720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742
{
	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);
743
			return -LIBBPF_ERRNO__FORMAT;
744 745 746 747 748 749 750
		}

		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));
751
			return -LIBBPF_ERRNO__FORMAT;
752 753
		}

754 755 756 757 758 759 760 761 762
		if (sym.st_shndx != maps_shndx) {
			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);

763 764 765
		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);
766
			return -LIBBPF_ERRNO__RELOC;
767 768 769 770 771 772
		}

		map_idx = sym.st_value / sizeof(struct bpf_map_def);
		if (map_idx >= nr_maps) {
			pr_warning("bpf relocation: map_idx %d large than %d\n",
				   (int)map_idx, (int)nr_maps - 1);
773
			return -LIBBPF_ERRNO__RELOC;
774 775 776 777 778 779 780 781
		}

		prog->reloc_desc[i].insn_idx = insn_idx;
		prog->reloc_desc[i].map_idx = map_idx;
	}
	return 0;
}

782 783 784 785 786
static int
bpf_object__create_maps(struct bpf_object *obj)
{
	unsigned int i;

787 788 789
	for (i = 0; i < obj->nr_maps; i++) {
		struct bpf_map_def *def = &obj->maps[i].def;
		int *pfd = &obj->maps[i].fd;
790

791 792 793 794
		*pfd = bpf_create_map(def->type,
				      def->key_size,
				      def->value_size,
				      def->max_entries);
795 796 797 798 799 800 801
		if (*pfd < 0) {
			size_t j;
			int err = *pfd;

			pr_warning("failed to create map: %s\n",
				   strerror(errno));
			for (j = 0; j < i; j++)
802
				zclose(obj->maps[j].fd);
803 804 805 806 807 808 809 810
			return err;
		}
		pr_debug("create map: fd=%d\n", *pfd);
	}

	return 0;
}

W
Wang Nan 已提交
811
static int
812
bpf_program__relocate(struct bpf_program *prog, struct bpf_object *obj)
W
Wang Nan 已提交
813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828
{
	int i;

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

	for (i = 0; i < prog->nr_reloc; i++) {
		int insn_idx, map_idx;
		struct bpf_insn *insns = prog->insns;

		insn_idx = prog->reloc_desc[i].insn_idx;
		map_idx = prog->reloc_desc[i].map_idx;

		if (insn_idx >= (int)prog->insns_cnt) {
			pr_warning("relocation out of range: '%s'\n",
				   prog->section_name);
829
			return -LIBBPF_ERRNO__RELOC;
W
Wang Nan 已提交
830 831
		}
		insns[insn_idx].src_reg = BPF_PSEUDO_MAP_FD;
832
		insns[insn_idx].imm = obj->maps[map_idx].fd;
W
Wang Nan 已提交
833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850
	}

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

851
		err = bpf_program__relocate(prog, obj);
W
Wang Nan 已提交
852 853 854 855 856 857 858 859 860
		if (err) {
			pr_warning("failed to relocate '%s'\n",
				   prog->section_name);
			return err;
		}
	}
	return 0;
}

861 862 863 864 865 866
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");
867
		return -LIBBPF_ERRNO__INTERNAL;
868 869 870 871 872 873 874
	}

	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;
875
		size_t nr_maps = obj->nr_maps;
876 877 878

		if (shdr->sh_type != SHT_REL) {
			pr_warning("internal error at %d\n", __LINE__);
879
			return -LIBBPF_ERRNO__INTERNAL;
880 881 882 883 884 885
		}

		prog = bpf_object__find_prog_by_idx(obj, idx);
		if (!prog) {
			pr_warning("relocation failed: no %d section\n",
				   idx);
886
			return -LIBBPF_ERRNO__RELOC;
887 888 889 890
		}

		err = bpf_program__collect_reloc(prog, nr_maps,
						 shdr, data,
891 892
						 obj->efile.symbols,
						 obj->efile.maps_shndx);
893
		if (err)
894
			return err;
895 896 897 898
	}
	return 0;
}

899
static int
900 901
load_program(enum bpf_prog_type type, struct bpf_insn *insns,
	     int insns_cnt, char *license, u32 kern_version, int *pfd)
902 903 904 905 906 907 908 909 910 911 912
{
	int ret;
	char *log_buf;

	if (!insns || !insns_cnt)
		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");

913 914
	ret = bpf_load_program(type, insns, insns_cnt, license,
			       kern_version, log_buf, BPF_LOG_BUF_SIZE);
915 916 917 918 919 920 921

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

922
	ret = -LIBBPF_ERRNO__LOAD;
923 924
	pr_warning("load bpf program failed: %s\n", strerror(errno));

925 926
	if (log_buf && log_buf[0] != '\0') {
		ret = -LIBBPF_ERRNO__VERIFY;
927 928 929
		pr_warning("-- BEGIN DUMP LOG ---\n");
		pr_warning("\n%s\n", log_buf);
		pr_warning("-- END LOG --\n");
930 931 932 933
	} else if (insns_cnt >= BPF_MAXINSNS) {
		pr_warning("Program too large (%d insns), at most %d insns\n",
			   insns_cnt, BPF_MAXINSNS);
		ret = -LIBBPF_ERRNO__PROG2BIG;
934
	} else {
935 936 937 938 939 940 941 942 943 944 945 946
		/* Wrong program type? */
		if (type != BPF_PROG_TYPE_KPROBE) {
			int fd;

			fd = bpf_load_program(BPF_PROG_TYPE_KPROBE, insns,
					      insns_cnt, license, kern_version,
					      NULL, 0);
			if (fd >= 0) {
				close(fd);
				ret = -LIBBPF_ERRNO__PROGTYPE;
				goto out;
			}
947
		}
948 949 950

		if (log_buf)
			ret = -LIBBPF_ERRNO__KVER;
951 952 953 954 955 956 957 958 959 960 961
	}

out:
	free(log_buf);
	return ret;
}

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

964 965 966 967 968 969
	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;
		}
970

971 972 973 974 975 976 977 978 979 980 981 982 983 984
		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);
		}
985
		err = load_program(prog->type, prog->insns, prog->insns_cnt,
986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013
				   license, kern_version, &fd);
		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;
		}

1014
		err = load_program(prog->type, result.new_insn_ptr,
1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028
				   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:
1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052
	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++) {
		err = bpf_program__load(&obj->programs[i],
					obj->license,
					obj->kern_version);
		if (err)
			return err;
	}
	return 0;
}

1053 1054 1055 1056 1057
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);
1058
		return -LIBBPF_ERRNO__KVERSION;
1059 1060 1061 1062
	}
	return 0;
}

1063
static struct bpf_object *
1064
__bpf_object__open(const char *path, void *obj_buf, size_t obj_buf_sz)
1065 1066
{
	struct bpf_object *obj;
1067
	int err;
1068 1069 1070

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

1074
	obj = bpf_object__new(path, obj_buf, obj_buf_sz);
1075 1076
	if (IS_ERR(obj))
		return obj;
1077

1078 1079 1080 1081 1082
	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);
1083 1084 1085 1086 1087

	bpf_object__elf_finish(obj);
	return obj;
out:
	bpf_object__close(obj);
1088
	return ERR_PTR(err);
1089 1090 1091 1092 1093 1094 1095 1096 1097 1098
}

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

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

1099 1100 1101 1102
	return __bpf_object__open(path, NULL, 0);
}

struct bpf_object *bpf_object__open_buffer(void *obj_buf,
1103 1104
					   size_t obj_buf_sz,
					   const char *name)
1105
{
1106 1107
	char tmp_name[64];

1108 1109 1110 1111
	/* param validation */
	if (!obj_buf || obj_buf_sz <= 0)
		return NULL;

1112 1113 1114 1115 1116 1117 1118 1119 1120
	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);
1121

1122
	return __bpf_object__open(name, obj_buf, obj_buf_sz);
1123 1124
}

1125 1126 1127 1128 1129 1130 1131
int bpf_object__unload(struct bpf_object *obj)
{
	size_t i;

	if (!obj)
		return -EINVAL;

1132 1133
	for (i = 0; i < obj->nr_maps; i++)
		zclose(obj->maps[i].fd);
1134

1135 1136 1137
	for (i = 0; i < obj->nr_programs; i++)
		bpf_program__unload(&obj->programs[i]);

1138 1139 1140 1141 1142
	return 0;
}

int bpf_object__load(struct bpf_object *obj)
{
1143 1144
	int err;

1145 1146 1147 1148 1149 1150 1151 1152 1153
	if (!obj)
		return -EINVAL;

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

	obj->loaded = true;
1154 1155 1156 1157

	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);
1158 1159 1160 1161 1162

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

1166 1167
void bpf_object__close(struct bpf_object *obj)
{
1168 1169
	size_t i;

1170 1171 1172 1173
	if (!obj)
		return;

	bpf_object__elf_finish(obj);
1174
	bpf_object__unload(obj);
1175

1176
	for (i = 0; i < obj->nr_maps; i++) {
1177
		zfree(&obj->maps[i].name);
1178 1179 1180 1181 1182 1183 1184 1185
		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;
1186 1187 1188 1189 1190 1191 1192

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

1193
	list_del(&obj->list);
1194 1195
	free(obj);
}
1196

1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215
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;
}

1216
const char *bpf_object__name(struct bpf_object *obj)
1217
{
1218
	return obj ? obj->path : ERR_PTR(-EINVAL);
1219 1220
}

1221
unsigned int bpf_object__kversion(struct bpf_object *obj)
1222
{
1223
	return obj ? obj->kern_version : 0;
1224 1225
}

1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247
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];
}

1248 1249
int bpf_program__set_priv(struct bpf_program *prog, void *priv,
			  bpf_program_clear_priv_t clear_priv)
1250 1251 1252 1253 1254 1255 1256 1257 1258
{
	if (prog->priv && prog->clear_priv)
		prog->clear_priv(prog, prog->priv);

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

1259
void *bpf_program__priv(struct bpf_program *prog)
1260
{
1261
	return prog ? prog->priv : ERR_PTR(-EINVAL);
1262 1263
}

1264
const char *bpf_program__title(struct bpf_program *prog, bool needs_copy)
1265 1266 1267 1268
{
	const char *title;

	title = prog->section_name;
1269
	if (needs_copy) {
1270 1271 1272
		title = strdup(title);
		if (!title) {
			pr_warning("failed to strdup program title\n");
1273
			return ERR_PTR(-ENOMEM);
1274 1275 1276 1277 1278 1279 1280 1281
		}
	}

	return title;
}

int bpf_program__fd(struct bpf_program *prog)
{
1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 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
	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;
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 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370
static void bpf_program__set_type(struct bpf_program *prog,
				  enum bpf_prog_type type)
{
	prog->type = type;
}

int bpf_program__set_tracepoint(struct bpf_program *prog)
{
	if (!prog)
		return -EINVAL;
	bpf_program__set_type(prog, BPF_PROG_TYPE_TRACEPOINT);
	return 0;
}

int bpf_program__set_kprobe(struct bpf_program *prog)
{
	if (!prog)
		return -EINVAL;
	bpf_program__set_type(prog, BPF_PROG_TYPE_KPROBE);
	return 0;
}

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

bool bpf_program__is_tracepoint(struct bpf_program *prog)
{
	return bpf_program__is_type(prog, BPF_PROG_TYPE_TRACEPOINT);
}

bool bpf_program__is_kprobe(struct bpf_program *prog)
{
	return bpf_program__is_type(prog, BPF_PROG_TYPE_KPROBE);
}

1371
int bpf_map__fd(struct bpf_map *map)
1372
{
1373
	return map ? map->fd : -EINVAL;
1374 1375
}

1376
const struct bpf_map_def *bpf_map__def(struct bpf_map *map)
1377
{
1378
	return map ? &map->def : ERR_PTR(-EINVAL);
1379 1380
}

1381
const char *bpf_map__name(struct bpf_map *map)
1382
{
1383
	return map ? map->name : NULL;
1384 1385
}

1386 1387
int bpf_map__set_priv(struct bpf_map *map, void *priv,
		     bpf_map_clear_priv_t clear_priv)
1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401
{
	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;
}

1402
void *bpf_map__priv(struct bpf_map *map)
1403
{
1404
	return map ? map->priv : ERR_PTR(-EINVAL);
1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432
}

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];
}
1433 1434

struct bpf_map *
1435
bpf_object__find_map_by_name(struct bpf_object *obj, const char *name)
1436 1437 1438 1439
{
	struct bpf_map *pos;

	bpf_map__for_each(pos, obj) {
1440
		if (pos->name && !strcmp(pos->name, name))
1441 1442 1443 1444
			return pos;
	}
	return NULL;
}