1 // SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause)
2 /* Copyright (c) 2018 Facebook */
12 #include <sys/utsname.h>
13 #include <sys/param.h>
15 #include <linux/kernel.h>
16 #include <linux/err.h>
17 #include <linux/btf.h>
22 #include "libbpf_internal.h"
26 #define BTF_MAX_NR_TYPES 0x7fffffffU
27 #define BTF_MAX_STR_OFFSET 0x7fffffffU
29 static struct btf_type btf_void;
32 /* raw BTF data in native endianness */
34 /* raw BTF data in non-native endianness */
35 void *raw_data_swapped;
37 /* whether target endianness differs from the native one */
41 * When BTF is loaded from an ELF or raw memory it is stored
42 * in a contiguous memory block. The hdr, type_data, and, strs_data
43 * point inside that memory region to their respective parts of BTF
46 * +--------------------------------+
47 * | Header | Types | Strings |
48 * +--------------------------------+
53 * strs_data------------+
55 * If BTF data is later modified, e.g., due to types added or
56 * removed, BTF deduplication performed, etc, this contiguous
57 * representation is broken up into three independently allocated
58 * memory regions to be able to modify them independently.
59 * raw_data is nulled out at that point, but can be later allocated
60 * and cached again if user calls btf__get_raw_data(), at which point
61 * raw_data will contain a contiguous copy of header, types, and
64 * +----------+ +---------+ +-----------+
65 * | Header | | Types | | Strings |
66 * +----------+ +---------+ +-----------+
71 * strset__data(strs_set)-----+
73 * +----------+---------+-----------+
74 * | Header | Types | Strings |
75 * raw_data----->+----------+---------+-----------+
77 struct btf_header *hdr;
80 size_t types_data_cap; /* used size stored in hdr->type_len */
82 /* type ID to `struct btf_type *` lookup index
83 * type_offs[0] corresponds to the first non-VOID type:
84 * - for base BTF it's type [1];
85 * - for split BTF it's the first non-base BTF type.
89 /* number of types in this BTF instance:
90 * - doesn't include special [0] void type;
91 * - for split BTF counts number of types added on top of base BTF.
94 /* if not NULL, points to the base BTF on top of which the current
98 /* BTF type ID of the first type in this BTF instance:
99 * - for base BTF it's equal to 1;
100 * - for split BTF it's equal to biggest type ID of base BTF plus 1.
103 /* logical string offset of this BTF instance:
104 * - for base BTF it's equal to 0;
105 * - for split BTF it's equal to total size of base BTF's string section size.
109 /* only one of strs_data or strs_set can be non-NULL, depending on
110 * whether BTF is in a modifiable state (strs_set is used) or not
111 * (strs_data points inside raw_data)
114 /* a set of unique strings */
115 struct strset *strs_set;
116 /* whether strings are already deduplicated */
119 /* BTF object FD, if loaded into kernel */
122 /* Pointer size (in bytes) for a target architecture of this BTF */
126 static inline __u64 ptr_to_u64(const void *ptr)
128 return (__u64) (unsigned long) ptr;
131 /* Ensure given dynamically allocated memory region pointed to by *data* with
132 * capacity of *cap_cnt* elements each taking *elem_sz* bytes has enough
133 * memory to accomodate *add_cnt* new elements, assuming *cur_cnt* elements
134 * are already used. At most *max_cnt* elements can be ever allocated.
135 * If necessary, memory is reallocated and all existing data is copied over,
136 * new pointer to the memory region is stored at *data, new memory region
137 * capacity (in number of elements) is stored in *cap.
138 * On success, memory pointer to the beginning of unused memory is returned.
139 * On error, NULL is returned.
141 void *libbpf_add_mem(void **data, size_t *cap_cnt, size_t elem_sz,
142 size_t cur_cnt, size_t max_cnt, size_t add_cnt)
147 if (cur_cnt + add_cnt <= *cap_cnt)
148 return *data + cur_cnt * elem_sz;
150 /* requested more than the set limit */
151 if (cur_cnt + add_cnt > max_cnt)
155 new_cnt += new_cnt / 4; /* expand by 25% */
156 if (new_cnt < 16) /* but at least 16 elements */
158 if (new_cnt > max_cnt) /* but not exceeding a set limit */
160 if (new_cnt < cur_cnt + add_cnt) /* also ensure we have enough memory */
161 new_cnt = cur_cnt + add_cnt;
163 new_data = libbpf_reallocarray(*data, new_cnt, elem_sz);
167 /* zero out newly allocated portion of memory */
168 memset(new_data + (*cap_cnt) * elem_sz, 0, (new_cnt - *cap_cnt) * elem_sz);
172 return new_data + cur_cnt * elem_sz;
175 /* Ensure given dynamically allocated memory region has enough allocated space
176 * to accommodate *need_cnt* elements of size *elem_sz* bytes each
178 int libbpf_ensure_mem(void **data, size_t *cap_cnt, size_t elem_sz, size_t need_cnt)
182 if (need_cnt <= *cap_cnt)
185 p = libbpf_add_mem(data, cap_cnt, elem_sz, *cap_cnt, SIZE_MAX, need_cnt - *cap_cnt);
192 static int btf_add_type_idx_entry(struct btf *btf, __u32 type_off)
196 p = libbpf_add_mem((void **)&btf->type_offs, &btf->type_offs_cap, sizeof(__u32),
197 btf->nr_types, BTF_MAX_NR_TYPES, 1);
205 static void btf_bswap_hdr(struct btf_header *h)
207 h->magic = bswap_16(h->magic);
208 h->hdr_len = bswap_32(h->hdr_len);
209 h->type_off = bswap_32(h->type_off);
210 h->type_len = bswap_32(h->type_len);
211 h->str_off = bswap_32(h->str_off);
212 h->str_len = bswap_32(h->str_len);
215 static int btf_parse_hdr(struct btf *btf)
217 struct btf_header *hdr = btf->hdr;
220 if (btf->raw_size < sizeof(struct btf_header)) {
221 pr_debug("BTF header not found\n");
225 if (hdr->magic == bswap_16(BTF_MAGIC)) {
226 btf->swapped_endian = true;
227 if (bswap_32(hdr->hdr_len) != sizeof(struct btf_header)) {
228 pr_warn("Can't load BTF with non-native endianness due to unsupported header length %u\n",
229 bswap_32(hdr->hdr_len));
233 } else if (hdr->magic != BTF_MAGIC) {
234 pr_debug("Invalid BTF magic:%x\n", hdr->magic);
238 meta_left = btf->raw_size - sizeof(*hdr);
239 if (meta_left < hdr->str_off + hdr->str_len) {
240 pr_debug("Invalid BTF total size:%u\n", btf->raw_size);
244 if (hdr->type_off + hdr->type_len > hdr->str_off) {
245 pr_debug("Invalid BTF data sections layout: type data at %u + %u, strings data at %u + %u\n",
246 hdr->type_off, hdr->type_len, hdr->str_off, hdr->str_len);
250 if (hdr->type_off % 4) {
251 pr_debug("BTF type section is not aligned to 4 bytes\n");
258 static int btf_parse_str_sec(struct btf *btf)
260 const struct btf_header *hdr = btf->hdr;
261 const char *start = btf->strs_data;
262 const char *end = start + btf->hdr->str_len;
264 if (btf->base_btf && hdr->str_len == 0)
266 if (!hdr->str_len || hdr->str_len - 1 > BTF_MAX_STR_OFFSET || end[-1]) {
267 pr_debug("Invalid BTF string section\n");
270 if (!btf->base_btf && start[0]) {
271 pr_debug("Invalid BTF string section\n");
277 static int btf_type_size(const struct btf_type *t)
279 const int base_size = sizeof(struct btf_type);
280 __u16 vlen = btf_vlen(t);
282 switch (btf_kind(t)) {
285 case BTF_KIND_VOLATILE:
286 case BTF_KIND_RESTRICT:
288 case BTF_KIND_TYPEDEF:
293 return base_size + sizeof(__u32);
295 return base_size + vlen * sizeof(struct btf_enum);
297 return base_size + sizeof(struct btf_array);
298 case BTF_KIND_STRUCT:
300 return base_size + vlen * sizeof(struct btf_member);
301 case BTF_KIND_FUNC_PROTO:
302 return base_size + vlen * sizeof(struct btf_param);
304 return base_size + sizeof(struct btf_var);
305 case BTF_KIND_DATASEC:
306 return base_size + vlen * sizeof(struct btf_var_secinfo);
308 pr_debug("Unsupported BTF_KIND:%u\n", btf_kind(t));
313 static void btf_bswap_type_base(struct btf_type *t)
315 t->name_off = bswap_32(t->name_off);
316 t->info = bswap_32(t->info);
317 t->type = bswap_32(t->type);
320 static int btf_bswap_type_rest(struct btf_type *t)
322 struct btf_var_secinfo *v;
323 struct btf_member *m;
327 __u16 vlen = btf_vlen(t);
330 switch (btf_kind(t)) {
333 case BTF_KIND_VOLATILE:
334 case BTF_KIND_RESTRICT:
336 case BTF_KIND_TYPEDEF:
341 *(__u32 *)(t + 1) = bswap_32(*(__u32 *)(t + 1));
344 for (i = 0, e = btf_enum(t); i < vlen; i++, e++) {
345 e->name_off = bswap_32(e->name_off);
346 e->val = bswap_32(e->val);
351 a->type = bswap_32(a->type);
352 a->index_type = bswap_32(a->index_type);
353 a->nelems = bswap_32(a->nelems);
355 case BTF_KIND_STRUCT:
357 for (i = 0, m = btf_members(t); i < vlen; i++, m++) {
358 m->name_off = bswap_32(m->name_off);
359 m->type = bswap_32(m->type);
360 m->offset = bswap_32(m->offset);
363 case BTF_KIND_FUNC_PROTO:
364 for (i = 0, p = btf_params(t); i < vlen; i++, p++) {
365 p->name_off = bswap_32(p->name_off);
366 p->type = bswap_32(p->type);
370 btf_var(t)->linkage = bswap_32(btf_var(t)->linkage);
372 case BTF_KIND_DATASEC:
373 for (i = 0, v = btf_var_secinfos(t); i < vlen; i++, v++) {
374 v->type = bswap_32(v->type);
375 v->offset = bswap_32(v->offset);
376 v->size = bswap_32(v->size);
380 pr_debug("Unsupported BTF_KIND:%u\n", btf_kind(t));
385 static int btf_parse_type_sec(struct btf *btf)
387 struct btf_header *hdr = btf->hdr;
388 void *next_type = btf->types_data;
389 void *end_type = next_type + hdr->type_len;
392 while (next_type + sizeof(struct btf_type) <= end_type) {
393 if (btf->swapped_endian)
394 btf_bswap_type_base(next_type);
396 type_size = btf_type_size(next_type);
399 if (next_type + type_size > end_type) {
400 pr_warn("BTF type [%d] is malformed\n", btf->start_id + btf->nr_types);
404 if (btf->swapped_endian && btf_bswap_type_rest(next_type))
407 err = btf_add_type_idx_entry(btf, next_type - btf->types_data);
411 next_type += type_size;
415 if (next_type != end_type) {
416 pr_warn("BTF types data is malformed\n");
423 __u32 btf__get_nr_types(const struct btf *btf)
425 return btf->start_id + btf->nr_types - 1;
428 const struct btf *btf__base_btf(const struct btf *btf)
430 return btf->base_btf;
433 /* internal helper returning non-const pointer to a type */
434 struct btf_type *btf_type_by_id(struct btf *btf, __u32 type_id)
438 if (type_id < btf->start_id)
439 return btf_type_by_id(btf->base_btf, type_id);
440 return btf->types_data + btf->type_offs[type_id - btf->start_id];
443 const struct btf_type *btf__type_by_id(const struct btf *btf, __u32 type_id)
445 if (type_id >= btf->start_id + btf->nr_types)
446 return errno = EINVAL, NULL;
447 return btf_type_by_id((struct btf *)btf, type_id);
450 static int determine_ptr_size(const struct btf *btf)
452 const struct btf_type *t;
456 if (btf->base_btf && btf->base_btf->ptr_sz > 0)
457 return btf->base_btf->ptr_sz;
459 n = btf__get_nr_types(btf);
460 for (i = 1; i <= n; i++) {
461 t = btf__type_by_id(btf, i);
465 name = btf__name_by_offset(btf, t->name_off);
469 if (strcmp(name, "long int") == 0 ||
470 strcmp(name, "long unsigned int") == 0) {
471 if (t->size != 4 && t->size != 8)
480 static size_t btf_ptr_sz(const struct btf *btf)
483 ((struct btf *)btf)->ptr_sz = determine_ptr_size(btf);
484 return btf->ptr_sz < 0 ? sizeof(void *) : btf->ptr_sz;
487 /* Return pointer size this BTF instance assumes. The size is heuristically
488 * determined by looking for 'long' or 'unsigned long' integer type and
489 * recording its size in bytes. If BTF type information doesn't have any such
490 * type, this function returns 0. In the latter case, native architecture's
491 * pointer size is assumed, so will be either 4 or 8, depending on
492 * architecture that libbpf was compiled for. It's possible to override
493 * guessed value by using btf__set_pointer_size() API.
495 size_t btf__pointer_size(const struct btf *btf)
498 ((struct btf *)btf)->ptr_sz = determine_ptr_size(btf);
501 /* not enough BTF type info to guess */
507 /* Override or set pointer size in bytes. Only values of 4 and 8 are
510 int btf__set_pointer_size(struct btf *btf, size_t ptr_sz)
512 if (ptr_sz != 4 && ptr_sz != 8)
513 return libbpf_err(-EINVAL);
514 btf->ptr_sz = ptr_sz;
518 static bool is_host_big_endian(void)
520 #if __BYTE_ORDER == __LITTLE_ENDIAN
522 #elif __BYTE_ORDER == __BIG_ENDIAN
525 # error "Unrecognized __BYTE_ORDER__"
529 enum btf_endianness btf__endianness(const struct btf *btf)
531 if (is_host_big_endian())
532 return btf->swapped_endian ? BTF_LITTLE_ENDIAN : BTF_BIG_ENDIAN;
534 return btf->swapped_endian ? BTF_BIG_ENDIAN : BTF_LITTLE_ENDIAN;
537 int btf__set_endianness(struct btf *btf, enum btf_endianness endian)
539 if (endian != BTF_LITTLE_ENDIAN && endian != BTF_BIG_ENDIAN)
540 return libbpf_err(-EINVAL);
542 btf->swapped_endian = is_host_big_endian() != (endian == BTF_BIG_ENDIAN);
543 if (!btf->swapped_endian) {
544 free(btf->raw_data_swapped);
545 btf->raw_data_swapped = NULL;
550 static bool btf_type_is_void(const struct btf_type *t)
552 return t == &btf_void || btf_is_fwd(t);
555 static bool btf_type_is_void_or_null(const struct btf_type *t)
557 return !t || btf_type_is_void(t);
560 #define MAX_RESOLVE_DEPTH 32
562 __s64 btf__resolve_size(const struct btf *btf, __u32 type_id)
564 const struct btf_array *array;
565 const struct btf_type *t;
570 t = btf__type_by_id(btf, type_id);
571 for (i = 0; i < MAX_RESOLVE_DEPTH && !btf_type_is_void_or_null(t); i++) {
572 switch (btf_kind(t)) {
574 case BTF_KIND_STRUCT:
577 case BTF_KIND_DATASEC:
582 size = btf_ptr_sz(btf);
584 case BTF_KIND_TYPEDEF:
585 case BTF_KIND_VOLATILE:
587 case BTF_KIND_RESTRICT:
592 array = btf_array(t);
593 if (nelems && array->nelems > UINT32_MAX / nelems)
594 return libbpf_err(-E2BIG);
595 nelems *= array->nelems;
596 type_id = array->type;
599 return libbpf_err(-EINVAL);
602 t = btf__type_by_id(btf, type_id);
607 return libbpf_err(-EINVAL);
608 if (nelems && size > UINT32_MAX / nelems)
609 return libbpf_err(-E2BIG);
611 return nelems * size;
614 int btf__align_of(const struct btf *btf, __u32 id)
616 const struct btf_type *t = btf__type_by_id(btf, id);
617 __u16 kind = btf_kind(t);
623 return min(btf_ptr_sz(btf), (size_t)t->size);
625 return btf_ptr_sz(btf);
626 case BTF_KIND_TYPEDEF:
627 case BTF_KIND_VOLATILE:
629 case BTF_KIND_RESTRICT:
630 return btf__align_of(btf, t->type);
632 return btf__align_of(btf, btf_array(t)->type);
633 case BTF_KIND_STRUCT:
634 case BTF_KIND_UNION: {
635 const struct btf_member *m = btf_members(t);
636 __u16 vlen = btf_vlen(t);
637 int i, max_align = 1, align;
639 for (i = 0; i < vlen; i++, m++) {
640 align = btf__align_of(btf, m->type);
642 return libbpf_err(align);
643 max_align = max(max_align, align);
649 pr_warn("unsupported BTF_KIND:%u\n", btf_kind(t));
650 return errno = EINVAL, 0;
654 int btf__resolve_type(const struct btf *btf, __u32 type_id)
656 const struct btf_type *t;
659 t = btf__type_by_id(btf, type_id);
660 while (depth < MAX_RESOLVE_DEPTH &&
661 !btf_type_is_void_or_null(t) &&
662 (btf_is_mod(t) || btf_is_typedef(t) || btf_is_var(t))) {
664 t = btf__type_by_id(btf, type_id);
668 if (depth == MAX_RESOLVE_DEPTH || btf_type_is_void_or_null(t))
669 return libbpf_err(-EINVAL);
674 __s32 btf__find_by_name(const struct btf *btf, const char *type_name)
676 __u32 i, nr_types = btf__get_nr_types(btf);
678 if (!strcmp(type_name, "void"))
681 for (i = 1; i <= nr_types; i++) {
682 const struct btf_type *t = btf__type_by_id(btf, i);
683 const char *name = btf__name_by_offset(btf, t->name_off);
685 if (name && !strcmp(type_name, name))
689 return libbpf_err(-ENOENT);
692 __s32 btf__find_by_name_kind(const struct btf *btf, const char *type_name,
695 __u32 i, nr_types = btf__get_nr_types(btf);
697 if (kind == BTF_KIND_UNKN || !strcmp(type_name, "void"))
700 for (i = 1; i <= nr_types; i++) {
701 const struct btf_type *t = btf__type_by_id(btf, i);
704 if (btf_kind(t) != kind)
706 name = btf__name_by_offset(btf, t->name_off);
707 if (name && !strcmp(type_name, name))
711 return libbpf_err(-ENOENT);
714 static bool btf_is_modifiable(const struct btf *btf)
716 return (void *)btf->hdr != btf->raw_data;
719 void btf__free(struct btf *btf)
721 if (IS_ERR_OR_NULL(btf))
727 if (btf_is_modifiable(btf)) {
728 /* if BTF was modified after loading, it will have a split
729 * in-memory representation for header, types, and strings
730 * sections, so we need to free all of them individually. It
731 * might still have a cached contiguous raw data present,
732 * which will be unconditionally freed below.
735 free(btf->types_data);
736 strset__free(btf->strs_set);
739 free(btf->raw_data_swapped);
740 free(btf->type_offs);
744 static struct btf *btf_new_empty(struct btf *base_btf)
748 btf = calloc(1, sizeof(*btf));
750 return ERR_PTR(-ENOMEM);
754 btf->start_str_off = 0;
756 btf->ptr_sz = sizeof(void *);
757 btf->swapped_endian = false;
760 btf->base_btf = base_btf;
761 btf->start_id = btf__get_nr_types(base_btf) + 1;
762 btf->start_str_off = base_btf->hdr->str_len;
765 /* +1 for empty string at offset 0 */
766 btf->raw_size = sizeof(struct btf_header) + (base_btf ? 0 : 1);
767 btf->raw_data = calloc(1, btf->raw_size);
768 if (!btf->raw_data) {
770 return ERR_PTR(-ENOMEM);
773 btf->hdr = btf->raw_data;
774 btf->hdr->hdr_len = sizeof(struct btf_header);
775 btf->hdr->magic = BTF_MAGIC;
776 btf->hdr->version = BTF_VERSION;
778 btf->types_data = btf->raw_data + btf->hdr->hdr_len;
779 btf->strs_data = btf->raw_data + btf->hdr->hdr_len;
780 btf->hdr->str_len = base_btf ? 0 : 1; /* empty string at offset 0 */
785 struct btf *btf__new_empty(void)
787 return libbpf_ptr(btf_new_empty(NULL));
790 struct btf *btf__new_empty_split(struct btf *base_btf)
792 return libbpf_ptr(btf_new_empty(base_btf));
795 static struct btf *btf_new(const void *data, __u32 size, struct btf *base_btf)
800 btf = calloc(1, sizeof(struct btf));
802 return ERR_PTR(-ENOMEM);
806 btf->start_str_off = 0;
809 btf->base_btf = base_btf;
810 btf->start_id = btf__get_nr_types(base_btf) + 1;
811 btf->start_str_off = base_btf->hdr->str_len;
814 btf->raw_data = malloc(size);
815 if (!btf->raw_data) {
819 memcpy(btf->raw_data, data, size);
820 btf->raw_size = size;
822 btf->hdr = btf->raw_data;
823 err = btf_parse_hdr(btf);
827 btf->strs_data = btf->raw_data + btf->hdr->hdr_len + btf->hdr->str_off;
828 btf->types_data = btf->raw_data + btf->hdr->hdr_len + btf->hdr->type_off;
830 err = btf_parse_str_sec(btf);
831 err = err ?: btf_parse_type_sec(btf);
846 struct btf *btf__new(const void *data, __u32 size)
848 return libbpf_ptr(btf_new(data, size, NULL));
851 static struct btf *btf_parse_elf(const char *path, struct btf *base_btf,
852 struct btf_ext **btf_ext)
854 Elf_Data *btf_data = NULL, *btf_ext_data = NULL;
855 int err = 0, fd = -1, idx = 0;
856 struct btf *btf = NULL;
862 if (elf_version(EV_CURRENT) == EV_NONE) {
863 pr_warn("failed to init libelf for %s\n", path);
864 return ERR_PTR(-LIBBPF_ERRNO__LIBELF);
867 fd = open(path, O_RDONLY);
870 pr_warn("failed to open %s: %s\n", path, strerror(errno));
874 err = -LIBBPF_ERRNO__FORMAT;
876 elf = elf_begin(fd, ELF_C_READ, NULL);
878 pr_warn("failed to open %s as ELF file\n", path);
881 if (!gelf_getehdr(elf, &ehdr)) {
882 pr_warn("failed to get EHDR from %s\n", path);
886 if (elf_getshdrstrndx(elf, &shstrndx)) {
887 pr_warn("failed to get section names section index for %s\n",
892 if (!elf_rawdata(elf_getscn(elf, shstrndx), NULL)) {
893 pr_warn("failed to get e_shstrndx from %s\n", path);
897 while ((scn = elf_nextscn(elf, scn)) != NULL) {
902 if (gelf_getshdr(scn, &sh) != &sh) {
903 pr_warn("failed to get section(%d) header from %s\n",
907 name = elf_strptr(elf, shstrndx, sh.sh_name);
909 pr_warn("failed to get section(%d) name from %s\n",
913 if (strcmp(name, BTF_ELF_SEC) == 0) {
914 btf_data = elf_getdata(scn, 0);
916 pr_warn("failed to get section(%d, %s) data from %s\n",
921 } else if (btf_ext && strcmp(name, BTF_EXT_ELF_SEC) == 0) {
922 btf_ext_data = elf_getdata(scn, 0);
924 pr_warn("failed to get section(%d, %s) data from %s\n",
938 btf = btf_new(btf_data->d_buf, btf_data->d_size, base_btf);
939 err = libbpf_get_error(btf);
943 switch (gelf_getclass(elf)) {
945 btf__set_pointer_size(btf, 4);
948 btf__set_pointer_size(btf, 8);
951 pr_warn("failed to get ELF class (bitness) for %s\n", path);
955 if (btf_ext && btf_ext_data) {
956 *btf_ext = btf_ext__new(btf_ext_data->d_buf, btf_ext_data->d_size);
957 err = libbpf_get_error(*btf_ext);
960 } else if (btf_ext) {
972 btf_ext__free(*btf_ext);
978 struct btf *btf__parse_elf(const char *path, struct btf_ext **btf_ext)
980 return libbpf_ptr(btf_parse_elf(path, NULL, btf_ext));
983 struct btf *btf__parse_elf_split(const char *path, struct btf *base_btf)
985 return libbpf_ptr(btf_parse_elf(path, base_btf, NULL));
988 static struct btf *btf_parse_raw(const char *path, struct btf *base_btf)
990 struct btf *btf = NULL;
997 f = fopen(path, "rb");
1003 /* check BTF magic */
1004 if (fread(&magic, 1, sizeof(magic), f) < sizeof(magic)) {
1008 if (magic != BTF_MAGIC && magic != bswap_16(BTF_MAGIC)) {
1009 /* definitely not a raw BTF */
1015 if (fseek(f, 0, SEEK_END)) {
1024 /* rewind to the start */
1025 if (fseek(f, 0, SEEK_SET)) {
1030 /* pre-alloc memory and read all of BTF data */
1036 if (fread(data, 1, sz, f) < sz) {
1041 /* finally parse BTF data */
1042 btf = btf_new(data, sz, base_btf);
1048 return err ? ERR_PTR(err) : btf;
1051 struct btf *btf__parse_raw(const char *path)
1053 return libbpf_ptr(btf_parse_raw(path, NULL));
1056 struct btf *btf__parse_raw_split(const char *path, struct btf *base_btf)
1058 return libbpf_ptr(btf_parse_raw(path, base_btf));
1061 static struct btf *btf_parse(const char *path, struct btf *base_btf, struct btf_ext **btf_ext)
1069 btf = btf_parse_raw(path, base_btf);
1070 err = libbpf_get_error(btf);
1074 return ERR_PTR(err);
1075 return btf_parse_elf(path, base_btf, btf_ext);
1078 struct btf *btf__parse(const char *path, struct btf_ext **btf_ext)
1080 return libbpf_ptr(btf_parse(path, NULL, btf_ext));
1083 struct btf *btf__parse_split(const char *path, struct btf *base_btf)
1085 return libbpf_ptr(btf_parse(path, base_btf, NULL));
1088 static int compare_vsi_off(const void *_a, const void *_b)
1090 const struct btf_var_secinfo *a = _a;
1091 const struct btf_var_secinfo *b = _b;
1093 return a->offset - b->offset;
1096 static int btf_fixup_datasec(struct bpf_object *obj, struct btf *btf,
1099 __u32 size = 0, off = 0, i, vars = btf_vlen(t);
1100 const char *name = btf__name_by_offset(btf, t->name_off);
1101 const struct btf_type *t_var;
1102 struct btf_var_secinfo *vsi;
1103 const struct btf_var *var;
1107 pr_debug("No name found in string section for DATASEC kind.\n");
1111 /* .extern datasec size and var offsets were set correctly during
1112 * extern collection step, so just skip straight to sorting variables
1117 ret = bpf_object__section_size(obj, name, &size);
1118 if (ret || !size || (t->size && t->size != size)) {
1119 pr_debug("Invalid size for section %s: %u bytes\n", name, size);
1125 for (i = 0, vsi = btf_var_secinfos(t); i < vars; i++, vsi++) {
1126 t_var = btf__type_by_id(btf, vsi->type);
1127 var = btf_var(t_var);
1129 if (!btf_is_var(t_var)) {
1130 pr_debug("Non-VAR type seen in section %s\n", name);
1134 if (var->linkage == BTF_VAR_STATIC)
1137 name = btf__name_by_offset(btf, t_var->name_off);
1139 pr_debug("No name found in string section for VAR kind\n");
1143 ret = bpf_object__variable_offset(obj, name, &off);
1145 pr_debug("No offset found in symbol table for VAR %s\n",
1154 qsort(btf_var_secinfos(t), vars, sizeof(*vsi), compare_vsi_off);
1158 int btf__finalize_data(struct bpf_object *obj, struct btf *btf)
1163 for (i = 1; i <= btf->nr_types; i++) {
1164 struct btf_type *t = btf_type_by_id(btf, i);
1166 /* Loader needs to fix up some of the things compiler
1167 * couldn't get its hands on while emitting BTF. This
1168 * is section size and global variable offset. We use
1169 * the info from the ELF itself for this purpose.
1171 if (btf_is_datasec(t)) {
1172 err = btf_fixup_datasec(obj, btf, t);
1178 return libbpf_err(err);
1181 static void *btf_get_raw_data(const struct btf *btf, __u32 *size, bool swap_endian);
1183 int btf__load_into_kernel(struct btf *btf)
1185 __u32 log_buf_size = 0, raw_size;
1186 char *log_buf = NULL;
1191 return libbpf_err(-EEXIST);
1195 log_buf = malloc(log_buf_size);
1197 return libbpf_err(-ENOMEM);
1202 raw_data = btf_get_raw_data(btf, &raw_size, false);
1207 /* cache native raw data representation */
1208 btf->raw_size = raw_size;
1209 btf->raw_data = raw_data;
1211 btf->fd = bpf_load_btf(raw_data, raw_size, log_buf, log_buf_size, false);
1213 if (!log_buf || errno == ENOSPC) {
1214 log_buf_size = max((__u32)BPF_LOG_BUF_SIZE,
1221 pr_warn("Error loading BTF: %s(%d)\n", strerror(errno), errno);
1223 pr_warn("%s\n", log_buf);
1229 return libbpf_err(err);
1231 int btf__load(struct btf *) __attribute__((alias("btf__load_into_kernel")));
1233 int btf__fd(const struct btf *btf)
1238 void btf__set_fd(struct btf *btf, int fd)
1243 static const void *btf_strs_data(const struct btf *btf)
1245 return btf->strs_data ? btf->strs_data : strset__data(btf->strs_set);
1248 static void *btf_get_raw_data(const struct btf *btf, __u32 *size, bool swap_endian)
1250 struct btf_header *hdr = btf->hdr;
1256 data = swap_endian ? btf->raw_data_swapped : btf->raw_data;
1258 *size = btf->raw_size;
1262 data_sz = hdr->hdr_len + hdr->type_len + hdr->str_len;
1263 data = calloc(1, data_sz);
1268 memcpy(p, hdr, hdr->hdr_len);
1273 memcpy(p, btf->types_data, hdr->type_len);
1275 for (i = 0; i < btf->nr_types; i++) {
1276 t = p + btf->type_offs[i];
1277 /* btf_bswap_type_rest() relies on native t->info, so
1278 * we swap base type info after we swapped all the
1279 * additional information
1281 if (btf_bswap_type_rest(t))
1283 btf_bswap_type_base(t);
1288 memcpy(p, btf_strs_data(btf), hdr->str_len);
1298 const void *btf__get_raw_data(const struct btf *btf_ro, __u32 *size)
1300 struct btf *btf = (struct btf *)btf_ro;
1304 data = btf_get_raw_data(btf, &data_sz, btf->swapped_endian);
1306 return errno = -ENOMEM, NULL;
1308 btf->raw_size = data_sz;
1309 if (btf->swapped_endian)
1310 btf->raw_data_swapped = data;
1312 btf->raw_data = data;
1317 const char *btf__str_by_offset(const struct btf *btf, __u32 offset)
1319 if (offset < btf->start_str_off)
1320 return btf__str_by_offset(btf->base_btf, offset);
1321 else if (offset - btf->start_str_off < btf->hdr->str_len)
1322 return btf_strs_data(btf) + (offset - btf->start_str_off);
1324 return errno = EINVAL, NULL;
1327 const char *btf__name_by_offset(const struct btf *btf, __u32 offset)
1329 return btf__str_by_offset(btf, offset);
1332 struct btf *btf_get_from_fd(int btf_fd, struct btf *base_btf)
1334 struct bpf_btf_info btf_info;
1335 __u32 len = sizeof(btf_info);
1341 /* we won't know btf_size until we call bpf_obj_get_info_by_fd(). so
1342 * let's start with a sane default - 4KiB here - and resize it only if
1343 * bpf_obj_get_info_by_fd() needs a bigger buffer.
1346 ptr = malloc(last_size);
1348 return ERR_PTR(-ENOMEM);
1350 memset(&btf_info, 0, sizeof(btf_info));
1351 btf_info.btf = ptr_to_u64(ptr);
1352 btf_info.btf_size = last_size;
1353 err = bpf_obj_get_info_by_fd(btf_fd, &btf_info, &len);
1355 if (!err && btf_info.btf_size > last_size) {
1358 last_size = btf_info.btf_size;
1359 temp_ptr = realloc(ptr, last_size);
1361 btf = ERR_PTR(-ENOMEM);
1366 len = sizeof(btf_info);
1367 memset(&btf_info, 0, sizeof(btf_info));
1368 btf_info.btf = ptr_to_u64(ptr);
1369 btf_info.btf_size = last_size;
1371 err = bpf_obj_get_info_by_fd(btf_fd, &btf_info, &len);
1374 if (err || btf_info.btf_size > last_size) {
1375 btf = err ? ERR_PTR(-errno) : ERR_PTR(-E2BIG);
1379 btf = btf_new(ptr, btf_info.btf_size, base_btf);
1386 struct btf *btf__load_from_kernel_by_id(__u32 id)
1391 btf_fd = bpf_btf_get_fd_by_id(id);
1393 return libbpf_err_ptr(-errno);
1395 btf = btf_get_from_fd(btf_fd, NULL);
1398 return libbpf_ptr(btf);
1401 int btf__get_from_id(__u32 id, struct btf **btf)
1407 res = btf__load_from_kernel_by_id(id);
1408 err = libbpf_get_error(res);
1411 return libbpf_err(err);
1417 int btf__get_map_kv_tids(const struct btf *btf, const char *map_name,
1418 __u32 expected_key_size, __u32 expected_value_size,
1419 __u32 *key_type_id, __u32 *value_type_id)
1421 const struct btf_type *container_type;
1422 const struct btf_member *key, *value;
1423 const size_t max_name = 256;
1424 char container_name[max_name];
1425 __s64 key_size, value_size;
1428 if (snprintf(container_name, max_name, "____btf_map_%s", map_name) == max_name) {
1429 pr_warn("map:%s length of '____btf_map_%s' is too long\n",
1430 map_name, map_name);
1431 return libbpf_err(-EINVAL);
1434 container_id = btf__find_by_name(btf, container_name);
1435 if (container_id < 0) {
1436 pr_debug("map:%s container_name:%s cannot be found in BTF. Missing BPF_ANNOTATE_KV_PAIR?\n",
1437 map_name, container_name);
1438 return libbpf_err(container_id);
1441 container_type = btf__type_by_id(btf, container_id);
1442 if (!container_type) {
1443 pr_warn("map:%s cannot find BTF type for container_id:%u\n",
1444 map_name, container_id);
1445 return libbpf_err(-EINVAL);
1448 if (!btf_is_struct(container_type) || btf_vlen(container_type) < 2) {
1449 pr_warn("map:%s container_name:%s is an invalid container struct\n",
1450 map_name, container_name);
1451 return libbpf_err(-EINVAL);
1454 key = btf_members(container_type);
1457 key_size = btf__resolve_size(btf, key->type);
1459 pr_warn("map:%s invalid BTF key_type_size\n", map_name);
1460 return libbpf_err(key_size);
1463 if (expected_key_size != key_size) {
1464 pr_warn("map:%s btf_key_type_size:%u != map_def_key_size:%u\n",
1465 map_name, (__u32)key_size, expected_key_size);
1466 return libbpf_err(-EINVAL);
1469 value_size = btf__resolve_size(btf, value->type);
1470 if (value_size < 0) {
1471 pr_warn("map:%s invalid BTF value_type_size\n", map_name);
1472 return libbpf_err(value_size);
1475 if (expected_value_size != value_size) {
1476 pr_warn("map:%s btf_value_type_size:%u != map_def_value_size:%u\n",
1477 map_name, (__u32)value_size, expected_value_size);
1478 return libbpf_err(-EINVAL);
1481 *key_type_id = key->type;
1482 *value_type_id = value->type;
1487 static void btf_invalidate_raw_data(struct btf *btf)
1489 if (btf->raw_data) {
1490 free(btf->raw_data);
1491 btf->raw_data = NULL;
1493 if (btf->raw_data_swapped) {
1494 free(btf->raw_data_swapped);
1495 btf->raw_data_swapped = NULL;
1499 /* Ensure BTF is ready to be modified (by splitting into a three memory
1500 * regions for header, types, and strings). Also invalidate cached
1503 static int btf_ensure_modifiable(struct btf *btf)
1506 struct strset *set = NULL;
1509 if (btf_is_modifiable(btf)) {
1510 /* any BTF modification invalidates raw_data */
1511 btf_invalidate_raw_data(btf);
1515 /* split raw data into three memory regions */
1516 hdr = malloc(btf->hdr->hdr_len);
1517 types = malloc(btf->hdr->type_len);
1521 memcpy(hdr, btf->hdr, btf->hdr->hdr_len);
1522 memcpy(types, btf->types_data, btf->hdr->type_len);
1524 /* build lookup index for all strings */
1525 set = strset__new(BTF_MAX_STR_OFFSET, btf->strs_data, btf->hdr->str_len);
1531 /* only when everything was successful, update internal state */
1533 btf->types_data = types;
1534 btf->types_data_cap = btf->hdr->type_len;
1535 btf->strs_data = NULL;
1536 btf->strs_set = set;
1537 /* if BTF was created from scratch, all strings are guaranteed to be
1538 * unique and deduplicated
1540 if (btf->hdr->str_len == 0)
1541 btf->strs_deduped = true;
1542 if (!btf->base_btf && btf->hdr->str_len == 1)
1543 btf->strs_deduped = true;
1545 /* invalidate raw_data representation */
1546 btf_invalidate_raw_data(btf);
1557 /* Find an offset in BTF string section that corresponds to a given string *s*.
1559 * - >0 offset into string section, if string is found;
1560 * - -ENOENT, if string is not in the string section;
1561 * - <0, on any other error.
1563 int btf__find_str(struct btf *btf, const char *s)
1567 if (btf->base_btf) {
1568 off = btf__find_str(btf->base_btf, s);
1573 /* BTF needs to be in a modifiable state to build string lookup index */
1574 if (btf_ensure_modifiable(btf))
1575 return libbpf_err(-ENOMEM);
1577 off = strset__find_str(btf->strs_set, s);
1579 return libbpf_err(off);
1581 return btf->start_str_off + off;
1584 /* Add a string s to the BTF string section.
1586 * - > 0 offset into string section, on success;
1589 int btf__add_str(struct btf *btf, const char *s)
1593 if (btf->base_btf) {
1594 off = btf__find_str(btf->base_btf, s);
1599 if (btf_ensure_modifiable(btf))
1600 return libbpf_err(-ENOMEM);
1602 off = strset__add_str(btf->strs_set, s);
1604 return libbpf_err(off);
1606 btf->hdr->str_len = strset__data_size(btf->strs_set);
1608 return btf->start_str_off + off;
1611 static void *btf_add_type_mem(struct btf *btf, size_t add_sz)
1613 return libbpf_add_mem(&btf->types_data, &btf->types_data_cap, 1,
1614 btf->hdr->type_len, UINT_MAX, add_sz);
1617 static void btf_type_inc_vlen(struct btf_type *t)
1619 t->info = btf_type_info(btf_kind(t), btf_vlen(t) + 1, btf_kflag(t));
1622 static int btf_commit_type(struct btf *btf, int data_sz)
1626 err = btf_add_type_idx_entry(btf, btf->hdr->type_len);
1628 return libbpf_err(err);
1630 btf->hdr->type_len += data_sz;
1631 btf->hdr->str_off += data_sz;
1633 return btf->start_id + btf->nr_types - 1;
1637 const struct btf *src;
1641 static int btf_rewrite_str(__u32 *str_off, void *ctx)
1643 struct btf_pipe *p = ctx;
1646 if (!*str_off) /* nothing to do for empty strings */
1649 off = btf__add_str(p->dst, btf__str_by_offset(p->src, *str_off));
1657 int btf__add_type(struct btf *btf, const struct btf *src_btf, const struct btf_type *src_type)
1659 struct btf_pipe p = { .src = src_btf, .dst = btf };
1663 sz = btf_type_size(src_type);
1665 return libbpf_err(sz);
1667 /* deconstruct BTF, if necessary, and invalidate raw_data */
1668 if (btf_ensure_modifiable(btf))
1669 return libbpf_err(-ENOMEM);
1671 t = btf_add_type_mem(btf, sz);
1673 return libbpf_err(-ENOMEM);
1675 memcpy(t, src_type, sz);
1677 err = btf_type_visit_str_offs(t, btf_rewrite_str, &p);
1679 return libbpf_err(err);
1681 return btf_commit_type(btf, sz);
1685 * Append new BTF_KIND_INT type with:
1686 * - *name* - non-empty, non-NULL type name;
1687 * - *sz* - power-of-2 (1, 2, 4, ..) size of the type, in bytes;
1688 * - encoding is a combination of BTF_INT_SIGNED, BTF_INT_CHAR, BTF_INT_BOOL.
1690 * - >0, type ID of newly added BTF type;
1693 int btf__add_int(struct btf *btf, const char *name, size_t byte_sz, int encoding)
1698 /* non-empty name */
1699 if (!name || !name[0])
1700 return libbpf_err(-EINVAL);
1701 /* byte_sz must be power of 2 */
1702 if (!byte_sz || (byte_sz & (byte_sz - 1)) || byte_sz > 16)
1703 return libbpf_err(-EINVAL);
1704 if (encoding & ~(BTF_INT_SIGNED | BTF_INT_CHAR | BTF_INT_BOOL))
1705 return libbpf_err(-EINVAL);
1707 /* deconstruct BTF, if necessary, and invalidate raw_data */
1708 if (btf_ensure_modifiable(btf))
1709 return libbpf_err(-ENOMEM);
1711 sz = sizeof(struct btf_type) + sizeof(int);
1712 t = btf_add_type_mem(btf, sz);
1714 return libbpf_err(-ENOMEM);
1716 /* if something goes wrong later, we might end up with an extra string,
1717 * but that shouldn't be a problem, because BTF can't be constructed
1718 * completely anyway and will most probably be just discarded
1720 name_off = btf__add_str(btf, name);
1724 t->name_off = name_off;
1725 t->info = btf_type_info(BTF_KIND_INT, 0, 0);
1727 /* set INT info, we don't allow setting legacy bit offset/size */
1728 *(__u32 *)(t + 1) = (encoding << 24) | (byte_sz * 8);
1730 return btf_commit_type(btf, sz);
1734 * Append new BTF_KIND_FLOAT type with:
1735 * - *name* - non-empty, non-NULL type name;
1736 * - *sz* - size of the type, in bytes;
1738 * - >0, type ID of newly added BTF type;
1741 int btf__add_float(struct btf *btf, const char *name, size_t byte_sz)
1746 /* non-empty name */
1747 if (!name || !name[0])
1748 return libbpf_err(-EINVAL);
1750 /* byte_sz must be one of the explicitly allowed values */
1751 if (byte_sz != 2 && byte_sz != 4 && byte_sz != 8 && byte_sz != 12 &&
1753 return libbpf_err(-EINVAL);
1755 if (btf_ensure_modifiable(btf))
1756 return libbpf_err(-ENOMEM);
1758 sz = sizeof(struct btf_type);
1759 t = btf_add_type_mem(btf, sz);
1761 return libbpf_err(-ENOMEM);
1763 name_off = btf__add_str(btf, name);
1767 t->name_off = name_off;
1768 t->info = btf_type_info(BTF_KIND_FLOAT, 0, 0);
1771 return btf_commit_type(btf, sz);
1774 /* it's completely legal to append BTF types with type IDs pointing forward to
1775 * types that haven't been appended yet, so we only make sure that id looks
1776 * sane, we can't guarantee that ID will always be valid
1778 static int validate_type_id(int id)
1780 if (id < 0 || id > BTF_MAX_NR_TYPES)
1785 /* generic append function for PTR, TYPEDEF, CONST/VOLATILE/RESTRICT */
1786 static int btf_add_ref_kind(struct btf *btf, int kind, const char *name, int ref_type_id)
1789 int sz, name_off = 0;
1791 if (validate_type_id(ref_type_id))
1792 return libbpf_err(-EINVAL);
1794 if (btf_ensure_modifiable(btf))
1795 return libbpf_err(-ENOMEM);
1797 sz = sizeof(struct btf_type);
1798 t = btf_add_type_mem(btf, sz);
1800 return libbpf_err(-ENOMEM);
1802 if (name && name[0]) {
1803 name_off = btf__add_str(btf, name);
1808 t->name_off = name_off;
1809 t->info = btf_type_info(kind, 0, 0);
1810 t->type = ref_type_id;
1812 return btf_commit_type(btf, sz);
1816 * Append new BTF_KIND_PTR type with:
1817 * - *ref_type_id* - referenced type ID, it might not exist yet;
1819 * - >0, type ID of newly added BTF type;
1822 int btf__add_ptr(struct btf *btf, int ref_type_id)
1824 return btf_add_ref_kind(btf, BTF_KIND_PTR, NULL, ref_type_id);
1828 * Append new BTF_KIND_ARRAY type with:
1829 * - *index_type_id* - type ID of the type describing array index;
1830 * - *elem_type_id* - type ID of the type describing array element;
1831 * - *nr_elems* - the size of the array;
1833 * - >0, type ID of newly added BTF type;
1836 int btf__add_array(struct btf *btf, int index_type_id, int elem_type_id, __u32 nr_elems)
1839 struct btf_array *a;
1842 if (validate_type_id(index_type_id) || validate_type_id(elem_type_id))
1843 return libbpf_err(-EINVAL);
1845 if (btf_ensure_modifiable(btf))
1846 return libbpf_err(-ENOMEM);
1848 sz = sizeof(struct btf_type) + sizeof(struct btf_array);
1849 t = btf_add_type_mem(btf, sz);
1851 return libbpf_err(-ENOMEM);
1854 t->info = btf_type_info(BTF_KIND_ARRAY, 0, 0);
1858 a->type = elem_type_id;
1859 a->index_type = index_type_id;
1860 a->nelems = nr_elems;
1862 return btf_commit_type(btf, sz);
1865 /* generic STRUCT/UNION append function */
1866 static int btf_add_composite(struct btf *btf, int kind, const char *name, __u32 bytes_sz)
1869 int sz, name_off = 0;
1871 if (btf_ensure_modifiable(btf))
1872 return libbpf_err(-ENOMEM);
1874 sz = sizeof(struct btf_type);
1875 t = btf_add_type_mem(btf, sz);
1877 return libbpf_err(-ENOMEM);
1879 if (name && name[0]) {
1880 name_off = btf__add_str(btf, name);
1885 /* start out with vlen=0 and no kflag; this will be adjusted when
1886 * adding each member
1888 t->name_off = name_off;
1889 t->info = btf_type_info(kind, 0, 0);
1892 return btf_commit_type(btf, sz);
1896 * Append new BTF_KIND_STRUCT type with:
1897 * - *name* - name of the struct, can be NULL or empty for anonymous structs;
1898 * - *byte_sz* - size of the struct, in bytes;
1900 * Struct initially has no fields in it. Fields can be added by
1901 * btf__add_field() right after btf__add_struct() succeeds.
1904 * - >0, type ID of newly added BTF type;
1907 int btf__add_struct(struct btf *btf, const char *name, __u32 byte_sz)
1909 return btf_add_composite(btf, BTF_KIND_STRUCT, name, byte_sz);
1913 * Append new BTF_KIND_UNION type with:
1914 * - *name* - name of the union, can be NULL or empty for anonymous union;
1915 * - *byte_sz* - size of the union, in bytes;
1917 * Union initially has no fields in it. Fields can be added by
1918 * btf__add_field() right after btf__add_union() succeeds. All fields
1919 * should have *bit_offset* of 0.
1922 * - >0, type ID of newly added BTF type;
1925 int btf__add_union(struct btf *btf, const char *name, __u32 byte_sz)
1927 return btf_add_composite(btf, BTF_KIND_UNION, name, byte_sz);
1930 static struct btf_type *btf_last_type(struct btf *btf)
1932 return btf_type_by_id(btf, btf__get_nr_types(btf));
1936 * Append new field for the current STRUCT/UNION type with:
1937 * - *name* - name of the field, can be NULL or empty for anonymous field;
1938 * - *type_id* - type ID for the type describing field type;
1939 * - *bit_offset* - bit offset of the start of the field within struct/union;
1940 * - *bit_size* - bit size of a bitfield, 0 for non-bitfield fields;
1945 int btf__add_field(struct btf *btf, const char *name, int type_id,
1946 __u32 bit_offset, __u32 bit_size)
1949 struct btf_member *m;
1951 int sz, name_off = 0;
1953 /* last type should be union/struct */
1954 if (btf->nr_types == 0)
1955 return libbpf_err(-EINVAL);
1956 t = btf_last_type(btf);
1957 if (!btf_is_composite(t))
1958 return libbpf_err(-EINVAL);
1960 if (validate_type_id(type_id))
1961 return libbpf_err(-EINVAL);
1962 /* best-effort bit field offset/size enforcement */
1963 is_bitfield = bit_size || (bit_offset % 8 != 0);
1964 if (is_bitfield && (bit_size == 0 || bit_size > 255 || bit_offset > 0xffffff))
1965 return libbpf_err(-EINVAL);
1967 /* only offset 0 is allowed for unions */
1968 if (btf_is_union(t) && bit_offset)
1969 return libbpf_err(-EINVAL);
1971 /* decompose and invalidate raw data */
1972 if (btf_ensure_modifiable(btf))
1973 return libbpf_err(-ENOMEM);
1975 sz = sizeof(struct btf_member);
1976 m = btf_add_type_mem(btf, sz);
1978 return libbpf_err(-ENOMEM);
1980 if (name && name[0]) {
1981 name_off = btf__add_str(btf, name);
1986 m->name_off = name_off;
1988 m->offset = bit_offset | (bit_size << 24);
1990 /* btf_add_type_mem can invalidate t pointer */
1991 t = btf_last_type(btf);
1992 /* update parent type's vlen and kflag */
1993 t->info = btf_type_info(btf_kind(t), btf_vlen(t) + 1, is_bitfield || btf_kflag(t));
1995 btf->hdr->type_len += sz;
1996 btf->hdr->str_off += sz;
2001 * Append new BTF_KIND_ENUM type with:
2002 * - *name* - name of the enum, can be NULL or empty for anonymous enums;
2003 * - *byte_sz* - size of the enum, in bytes.
2005 * Enum initially has no enum values in it (and corresponds to enum forward
2006 * declaration). Enumerator values can be added by btf__add_enum_value()
2007 * immediately after btf__add_enum() succeeds.
2010 * - >0, type ID of newly added BTF type;
2013 int btf__add_enum(struct btf *btf, const char *name, __u32 byte_sz)
2016 int sz, name_off = 0;
2018 /* byte_sz must be power of 2 */
2019 if (!byte_sz || (byte_sz & (byte_sz - 1)) || byte_sz > 8)
2020 return libbpf_err(-EINVAL);
2022 if (btf_ensure_modifiable(btf))
2023 return libbpf_err(-ENOMEM);
2025 sz = sizeof(struct btf_type);
2026 t = btf_add_type_mem(btf, sz);
2028 return libbpf_err(-ENOMEM);
2030 if (name && name[0]) {
2031 name_off = btf__add_str(btf, name);
2036 /* start out with vlen=0; it will be adjusted when adding enum values */
2037 t->name_off = name_off;
2038 t->info = btf_type_info(BTF_KIND_ENUM, 0, 0);
2041 return btf_commit_type(btf, sz);
2045 * Append new enum value for the current ENUM type with:
2046 * - *name* - name of the enumerator value, can't be NULL or empty;
2047 * - *value* - integer value corresponding to enum value *name*;
2052 int btf__add_enum_value(struct btf *btf, const char *name, __s64 value)
2058 /* last type should be BTF_KIND_ENUM */
2059 if (btf->nr_types == 0)
2060 return libbpf_err(-EINVAL);
2061 t = btf_last_type(btf);
2062 if (!btf_is_enum(t))
2063 return libbpf_err(-EINVAL);
2065 /* non-empty name */
2066 if (!name || !name[0])
2067 return libbpf_err(-EINVAL);
2068 if (value < INT_MIN || value > UINT_MAX)
2069 return libbpf_err(-E2BIG);
2071 /* decompose and invalidate raw data */
2072 if (btf_ensure_modifiable(btf))
2073 return libbpf_err(-ENOMEM);
2075 sz = sizeof(struct btf_enum);
2076 v = btf_add_type_mem(btf, sz);
2078 return libbpf_err(-ENOMEM);
2080 name_off = btf__add_str(btf, name);
2084 v->name_off = name_off;
2087 /* update parent type's vlen */
2088 t = btf_last_type(btf);
2089 btf_type_inc_vlen(t);
2091 btf->hdr->type_len += sz;
2092 btf->hdr->str_off += sz;
2097 * Append new BTF_KIND_FWD type with:
2098 * - *name*, non-empty/non-NULL name;
2099 * - *fwd_kind*, kind of forward declaration, one of BTF_FWD_STRUCT,
2100 * BTF_FWD_UNION, or BTF_FWD_ENUM;
2102 * - >0, type ID of newly added BTF type;
2105 int btf__add_fwd(struct btf *btf, const char *name, enum btf_fwd_kind fwd_kind)
2107 if (!name || !name[0])
2108 return libbpf_err(-EINVAL);
2111 case BTF_FWD_STRUCT:
2112 case BTF_FWD_UNION: {
2116 id = btf_add_ref_kind(btf, BTF_KIND_FWD, name, 0);
2119 t = btf_type_by_id(btf, id);
2120 t->info = btf_type_info(BTF_KIND_FWD, 0, fwd_kind == BTF_FWD_UNION);
2124 /* enum forward in BTF currently is just an enum with no enum
2125 * values; we also assume a standard 4-byte size for it
2127 return btf__add_enum(btf, name, sizeof(int));
2129 return libbpf_err(-EINVAL);
2134 * Append new BTF_KING_TYPEDEF type with:
2135 * - *name*, non-empty/non-NULL name;
2136 * - *ref_type_id* - referenced type ID, it might not exist yet;
2138 * - >0, type ID of newly added BTF type;
2141 int btf__add_typedef(struct btf *btf, const char *name, int ref_type_id)
2143 if (!name || !name[0])
2144 return libbpf_err(-EINVAL);
2146 return btf_add_ref_kind(btf, BTF_KIND_TYPEDEF, name, ref_type_id);
2150 * Append new BTF_KIND_VOLATILE type with:
2151 * - *ref_type_id* - referenced type ID, it might not exist yet;
2153 * - >0, type ID of newly added BTF type;
2156 int btf__add_volatile(struct btf *btf, int ref_type_id)
2158 return btf_add_ref_kind(btf, BTF_KIND_VOLATILE, NULL, ref_type_id);
2162 * Append new BTF_KIND_CONST type with:
2163 * - *ref_type_id* - referenced type ID, it might not exist yet;
2165 * - >0, type ID of newly added BTF type;
2168 int btf__add_const(struct btf *btf, int ref_type_id)
2170 return btf_add_ref_kind(btf, BTF_KIND_CONST, NULL, ref_type_id);
2174 * Append new BTF_KIND_RESTRICT type with:
2175 * - *ref_type_id* - referenced type ID, it might not exist yet;
2177 * - >0, type ID of newly added BTF type;
2180 int btf__add_restrict(struct btf *btf, int ref_type_id)
2182 return btf_add_ref_kind(btf, BTF_KIND_RESTRICT, NULL, ref_type_id);
2186 * Append new BTF_KIND_FUNC type with:
2187 * - *name*, non-empty/non-NULL name;
2188 * - *proto_type_id* - FUNC_PROTO's type ID, it might not exist yet;
2190 * - >0, type ID of newly added BTF type;
2193 int btf__add_func(struct btf *btf, const char *name,
2194 enum btf_func_linkage linkage, int proto_type_id)
2198 if (!name || !name[0])
2199 return libbpf_err(-EINVAL);
2200 if (linkage != BTF_FUNC_STATIC && linkage != BTF_FUNC_GLOBAL &&
2201 linkage != BTF_FUNC_EXTERN)
2202 return libbpf_err(-EINVAL);
2204 id = btf_add_ref_kind(btf, BTF_KIND_FUNC, name, proto_type_id);
2206 struct btf_type *t = btf_type_by_id(btf, id);
2208 t->info = btf_type_info(BTF_KIND_FUNC, linkage, 0);
2210 return libbpf_err(id);
2214 * Append new BTF_KIND_FUNC_PROTO with:
2215 * - *ret_type_id* - type ID for return result of a function.
2217 * Function prototype initially has no arguments, but they can be added by
2218 * btf__add_func_param() one by one, immediately after
2219 * btf__add_func_proto() succeeded.
2222 * - >0, type ID of newly added BTF type;
2225 int btf__add_func_proto(struct btf *btf, int ret_type_id)
2230 if (validate_type_id(ret_type_id))
2231 return libbpf_err(-EINVAL);
2233 if (btf_ensure_modifiable(btf))
2234 return libbpf_err(-ENOMEM);
2236 sz = sizeof(struct btf_type);
2237 t = btf_add_type_mem(btf, sz);
2239 return libbpf_err(-ENOMEM);
2241 /* start out with vlen=0; this will be adjusted when adding enum
2242 * values, if necessary
2245 t->info = btf_type_info(BTF_KIND_FUNC_PROTO, 0, 0);
2246 t->type = ret_type_id;
2248 return btf_commit_type(btf, sz);
2252 * Append new function parameter for current FUNC_PROTO type with:
2253 * - *name* - parameter name, can be NULL or empty;
2254 * - *type_id* - type ID describing the type of the parameter.
2259 int btf__add_func_param(struct btf *btf, const char *name, int type_id)
2262 struct btf_param *p;
2263 int sz, name_off = 0;
2265 if (validate_type_id(type_id))
2266 return libbpf_err(-EINVAL);
2268 /* last type should be BTF_KIND_FUNC_PROTO */
2269 if (btf->nr_types == 0)
2270 return libbpf_err(-EINVAL);
2271 t = btf_last_type(btf);
2272 if (!btf_is_func_proto(t))
2273 return libbpf_err(-EINVAL);
2275 /* decompose and invalidate raw data */
2276 if (btf_ensure_modifiable(btf))
2277 return libbpf_err(-ENOMEM);
2279 sz = sizeof(struct btf_param);
2280 p = btf_add_type_mem(btf, sz);
2282 return libbpf_err(-ENOMEM);
2284 if (name && name[0]) {
2285 name_off = btf__add_str(btf, name);
2290 p->name_off = name_off;
2293 /* update parent type's vlen */
2294 t = btf_last_type(btf);
2295 btf_type_inc_vlen(t);
2297 btf->hdr->type_len += sz;
2298 btf->hdr->str_off += sz;
2303 * Append new BTF_KIND_VAR type with:
2304 * - *name* - non-empty/non-NULL name;
2305 * - *linkage* - variable linkage, one of BTF_VAR_STATIC,
2306 * BTF_VAR_GLOBAL_ALLOCATED, or BTF_VAR_GLOBAL_EXTERN;
2307 * - *type_id* - type ID of the type describing the type of the variable.
2309 * - >0, type ID of newly added BTF type;
2312 int btf__add_var(struct btf *btf, const char *name, int linkage, int type_id)
2318 /* non-empty name */
2319 if (!name || !name[0])
2320 return libbpf_err(-EINVAL);
2321 if (linkage != BTF_VAR_STATIC && linkage != BTF_VAR_GLOBAL_ALLOCATED &&
2322 linkage != BTF_VAR_GLOBAL_EXTERN)
2323 return libbpf_err(-EINVAL);
2324 if (validate_type_id(type_id))
2325 return libbpf_err(-EINVAL);
2327 /* deconstruct BTF, if necessary, and invalidate raw_data */
2328 if (btf_ensure_modifiable(btf))
2329 return libbpf_err(-ENOMEM);
2331 sz = sizeof(struct btf_type) + sizeof(struct btf_var);
2332 t = btf_add_type_mem(btf, sz);
2334 return libbpf_err(-ENOMEM);
2336 name_off = btf__add_str(btf, name);
2340 t->name_off = name_off;
2341 t->info = btf_type_info(BTF_KIND_VAR, 0, 0);
2345 v->linkage = linkage;
2347 return btf_commit_type(btf, sz);
2351 * Append new BTF_KIND_DATASEC type with:
2352 * - *name* - non-empty/non-NULL name;
2353 * - *byte_sz* - data section size, in bytes.
2355 * Data section is initially empty. Variables info can be added with
2356 * btf__add_datasec_var_info() calls, after btf__add_datasec() succeeds.
2359 * - >0, type ID of newly added BTF type;
2362 int btf__add_datasec(struct btf *btf, const char *name, __u32 byte_sz)
2367 /* non-empty name */
2368 if (!name || !name[0])
2369 return libbpf_err(-EINVAL);
2371 if (btf_ensure_modifiable(btf))
2372 return libbpf_err(-ENOMEM);
2374 sz = sizeof(struct btf_type);
2375 t = btf_add_type_mem(btf, sz);
2377 return libbpf_err(-ENOMEM);
2379 name_off = btf__add_str(btf, name);
2383 /* start with vlen=0, which will be update as var_secinfos are added */
2384 t->name_off = name_off;
2385 t->info = btf_type_info(BTF_KIND_DATASEC, 0, 0);
2388 return btf_commit_type(btf, sz);
2392 * Append new data section variable information entry for current DATASEC type:
2393 * - *var_type_id* - type ID, describing type of the variable;
2394 * - *offset* - variable offset within data section, in bytes;
2395 * - *byte_sz* - variable size, in bytes.
2401 int btf__add_datasec_var_info(struct btf *btf, int var_type_id, __u32 offset, __u32 byte_sz)
2404 struct btf_var_secinfo *v;
2407 /* last type should be BTF_KIND_DATASEC */
2408 if (btf->nr_types == 0)
2409 return libbpf_err(-EINVAL);
2410 t = btf_last_type(btf);
2411 if (!btf_is_datasec(t))
2412 return libbpf_err(-EINVAL);
2414 if (validate_type_id(var_type_id))
2415 return libbpf_err(-EINVAL);
2417 /* decompose and invalidate raw data */
2418 if (btf_ensure_modifiable(btf))
2419 return libbpf_err(-ENOMEM);
2421 sz = sizeof(struct btf_var_secinfo);
2422 v = btf_add_type_mem(btf, sz);
2424 return libbpf_err(-ENOMEM);
2426 v->type = var_type_id;
2430 /* update parent type's vlen */
2431 t = btf_last_type(btf);
2432 btf_type_inc_vlen(t);
2434 btf->hdr->type_len += sz;
2435 btf->hdr->str_off += sz;
2439 struct btf_ext_sec_setup_param {
2443 struct btf_ext_info *ext_info;
2447 static int btf_ext_setup_info(struct btf_ext *btf_ext,
2448 struct btf_ext_sec_setup_param *ext_sec)
2450 const struct btf_ext_info_sec *sinfo;
2451 struct btf_ext_info *ext_info;
2452 __u32 info_left, record_size;
2453 /* The start of the info sec (including the __u32 record_size). */
2456 if (ext_sec->len == 0)
2459 if (ext_sec->off & 0x03) {
2460 pr_debug(".BTF.ext %s section is not aligned to 4 bytes\n",
2465 info = btf_ext->data + btf_ext->hdr->hdr_len + ext_sec->off;
2466 info_left = ext_sec->len;
2468 if (btf_ext->data + btf_ext->data_size < info + ext_sec->len) {
2469 pr_debug("%s section (off:%u len:%u) is beyond the end of the ELF section .BTF.ext\n",
2470 ext_sec->desc, ext_sec->off, ext_sec->len);
2474 /* At least a record size */
2475 if (info_left < sizeof(__u32)) {
2476 pr_debug(".BTF.ext %s record size not found\n", ext_sec->desc);
2480 /* The record size needs to meet the minimum standard */
2481 record_size = *(__u32 *)info;
2482 if (record_size < ext_sec->min_rec_size ||
2483 record_size & 0x03) {
2484 pr_debug("%s section in .BTF.ext has invalid record size %u\n",
2485 ext_sec->desc, record_size);
2489 sinfo = info + sizeof(__u32);
2490 info_left -= sizeof(__u32);
2492 /* If no records, return failure now so .BTF.ext won't be used. */
2494 pr_debug("%s section in .BTF.ext has no records", ext_sec->desc);
2499 unsigned int sec_hdrlen = sizeof(struct btf_ext_info_sec);
2500 __u64 total_record_size;
2503 if (info_left < sec_hdrlen) {
2504 pr_debug("%s section header is not found in .BTF.ext\n",
2509 num_records = sinfo->num_info;
2510 if (num_records == 0) {
2511 pr_debug("%s section has incorrect num_records in .BTF.ext\n",
2516 total_record_size = sec_hdrlen +
2517 (__u64)num_records * record_size;
2518 if (info_left < total_record_size) {
2519 pr_debug("%s section has incorrect num_records in .BTF.ext\n",
2524 info_left -= total_record_size;
2525 sinfo = (void *)sinfo + total_record_size;
2528 ext_info = ext_sec->ext_info;
2529 ext_info->len = ext_sec->len - sizeof(__u32);
2530 ext_info->rec_size = record_size;
2531 ext_info->info = info + sizeof(__u32);
2536 static int btf_ext_setup_func_info(struct btf_ext *btf_ext)
2538 struct btf_ext_sec_setup_param param = {
2539 .off = btf_ext->hdr->func_info_off,
2540 .len = btf_ext->hdr->func_info_len,
2541 .min_rec_size = sizeof(struct bpf_func_info_min),
2542 .ext_info = &btf_ext->func_info,
2546 return btf_ext_setup_info(btf_ext, ¶m);
2549 static int btf_ext_setup_line_info(struct btf_ext *btf_ext)
2551 struct btf_ext_sec_setup_param param = {
2552 .off = btf_ext->hdr->line_info_off,
2553 .len = btf_ext->hdr->line_info_len,
2554 .min_rec_size = sizeof(struct bpf_line_info_min),
2555 .ext_info = &btf_ext->line_info,
2556 .desc = "line_info",
2559 return btf_ext_setup_info(btf_ext, ¶m);
2562 static int btf_ext_setup_core_relos(struct btf_ext *btf_ext)
2564 struct btf_ext_sec_setup_param param = {
2565 .off = btf_ext->hdr->core_relo_off,
2566 .len = btf_ext->hdr->core_relo_len,
2567 .min_rec_size = sizeof(struct bpf_core_relo),
2568 .ext_info = &btf_ext->core_relo_info,
2569 .desc = "core_relo",
2572 return btf_ext_setup_info(btf_ext, ¶m);
2575 static int btf_ext_parse_hdr(__u8 *data, __u32 data_size)
2577 const struct btf_ext_header *hdr = (struct btf_ext_header *)data;
2579 if (data_size < offsetofend(struct btf_ext_header, hdr_len) ||
2580 data_size < hdr->hdr_len) {
2581 pr_debug("BTF.ext header not found");
2585 if (hdr->magic == bswap_16(BTF_MAGIC)) {
2586 pr_warn("BTF.ext in non-native endianness is not supported\n");
2588 } else if (hdr->magic != BTF_MAGIC) {
2589 pr_debug("Invalid BTF.ext magic:%x\n", hdr->magic);
2593 if (hdr->version != BTF_VERSION) {
2594 pr_debug("Unsupported BTF.ext version:%u\n", hdr->version);
2599 pr_debug("Unsupported BTF.ext flags:%x\n", hdr->flags);
2603 if (data_size == hdr->hdr_len) {
2604 pr_debug("BTF.ext has no data\n");
2611 void btf_ext__free(struct btf_ext *btf_ext)
2613 if (IS_ERR_OR_NULL(btf_ext))
2615 free(btf_ext->data);
2619 struct btf_ext *btf_ext__new(__u8 *data, __u32 size)
2621 struct btf_ext *btf_ext;
2624 err = btf_ext_parse_hdr(data, size);
2626 return libbpf_err_ptr(err);
2628 btf_ext = calloc(1, sizeof(struct btf_ext));
2630 return libbpf_err_ptr(-ENOMEM);
2632 btf_ext->data_size = size;
2633 btf_ext->data = malloc(size);
2634 if (!btf_ext->data) {
2638 memcpy(btf_ext->data, data, size);
2640 if (btf_ext->hdr->hdr_len < offsetofend(struct btf_ext_header, line_info_len)) {
2645 err = btf_ext_setup_func_info(btf_ext);
2649 err = btf_ext_setup_line_info(btf_ext);
2653 if (btf_ext->hdr->hdr_len < offsetofend(struct btf_ext_header, core_relo_len)) {
2658 err = btf_ext_setup_core_relos(btf_ext);
2664 btf_ext__free(btf_ext);
2665 return libbpf_err_ptr(err);
2671 const void *btf_ext__get_raw_data(const struct btf_ext *btf_ext, __u32 *size)
2673 *size = btf_ext->data_size;
2674 return btf_ext->data;
2677 static int btf_ext_reloc_info(const struct btf *btf,
2678 const struct btf_ext_info *ext_info,
2679 const char *sec_name, __u32 insns_cnt,
2680 void **info, __u32 *cnt)
2682 __u32 sec_hdrlen = sizeof(struct btf_ext_info_sec);
2683 __u32 i, record_size, existing_len, records_len;
2684 struct btf_ext_info_sec *sinfo;
2685 const char *info_sec_name;
2689 record_size = ext_info->rec_size;
2690 sinfo = ext_info->info;
2691 remain_len = ext_info->len;
2692 while (remain_len > 0) {
2693 records_len = sinfo->num_info * record_size;
2694 info_sec_name = btf__name_by_offset(btf, sinfo->sec_name_off);
2695 if (strcmp(info_sec_name, sec_name)) {
2696 remain_len -= sec_hdrlen + records_len;
2697 sinfo = (void *)sinfo + sec_hdrlen + records_len;
2701 existing_len = (*cnt) * record_size;
2702 data = realloc(*info, existing_len + records_len);
2704 return libbpf_err(-ENOMEM);
2706 memcpy(data + existing_len, sinfo->data, records_len);
2707 /* adjust insn_off only, the rest data will be passed
2710 for (i = 0; i < sinfo->num_info; i++) {
2713 insn_off = data + existing_len + (i * record_size);
2714 *insn_off = *insn_off / sizeof(struct bpf_insn) + insns_cnt;
2717 *cnt += sinfo->num_info;
2721 return libbpf_err(-ENOENT);
2724 int btf_ext__reloc_func_info(const struct btf *btf,
2725 const struct btf_ext *btf_ext,
2726 const char *sec_name, __u32 insns_cnt,
2727 void **func_info, __u32 *cnt)
2729 return btf_ext_reloc_info(btf, &btf_ext->func_info, sec_name,
2730 insns_cnt, func_info, cnt);
2733 int btf_ext__reloc_line_info(const struct btf *btf,
2734 const struct btf_ext *btf_ext,
2735 const char *sec_name, __u32 insns_cnt,
2736 void **line_info, __u32 *cnt)
2738 return btf_ext_reloc_info(btf, &btf_ext->line_info, sec_name,
2739 insns_cnt, line_info, cnt);
2742 __u32 btf_ext__func_info_rec_size(const struct btf_ext *btf_ext)
2744 return btf_ext->func_info.rec_size;
2747 __u32 btf_ext__line_info_rec_size(const struct btf_ext *btf_ext)
2749 return btf_ext->line_info.rec_size;
2754 static struct btf_dedup *btf_dedup_new(struct btf *btf, struct btf_ext *btf_ext,
2755 const struct btf_dedup_opts *opts);
2756 static void btf_dedup_free(struct btf_dedup *d);
2757 static int btf_dedup_prep(struct btf_dedup *d);
2758 static int btf_dedup_strings(struct btf_dedup *d);
2759 static int btf_dedup_prim_types(struct btf_dedup *d);
2760 static int btf_dedup_struct_types(struct btf_dedup *d);
2761 static int btf_dedup_ref_types(struct btf_dedup *d);
2762 static int btf_dedup_compact_types(struct btf_dedup *d);
2763 static int btf_dedup_remap_types(struct btf_dedup *d);
2766 * Deduplicate BTF types and strings.
2768 * BTF dedup algorithm takes as an input `struct btf` representing `.BTF` ELF
2769 * section with all BTF type descriptors and string data. It overwrites that
2770 * memory in-place with deduplicated types and strings without any loss of
2771 * information. If optional `struct btf_ext` representing '.BTF.ext' ELF section
2772 * is provided, all the strings referenced from .BTF.ext section are honored
2773 * and updated to point to the right offsets after deduplication.
2775 * If function returns with error, type/string data might be garbled and should
2778 * More verbose and detailed description of both problem btf_dedup is solving,
2779 * as well as solution could be found at:
2780 * https://facebookmicrosites.github.io/bpf/blog/2018/11/14/btf-enhancement.html
2782 * Problem description and justification
2783 * =====================================
2785 * BTF type information is typically emitted either as a result of conversion
2786 * from DWARF to BTF or directly by compiler. In both cases, each compilation
2787 * unit contains information about a subset of all the types that are used
2788 * in an application. These subsets are frequently overlapping and contain a lot
2789 * of duplicated information when later concatenated together into a single
2790 * binary. This algorithm ensures that each unique type is represented by single
2791 * BTF type descriptor, greatly reducing resulting size of BTF data.
2793 * Compilation unit isolation and subsequent duplication of data is not the only
2794 * problem. The same type hierarchy (e.g., struct and all the type that struct
2795 * references) in different compilation units can be represented in BTF to
2796 * various degrees of completeness (or, rather, incompleteness) due to
2797 * struct/union forward declarations.
2799 * Let's take a look at an example, that we'll use to better understand the
2800 * problem (and solution). Suppose we have two compilation units, each using
2801 * same `struct S`, but each of them having incomplete type information about
2830 * In case of CU #1, BTF data will know only that `struct B` exist (but no
2831 * more), but will know the complete type information about `struct A`. While
2832 * for CU #2, it will know full type information about `struct B`, but will
2833 * only know about forward declaration of `struct A` (in BTF terms, it will
2834 * have `BTF_KIND_FWD` type descriptor with name `B`).
2836 * This compilation unit isolation means that it's possible that there is no
2837 * single CU with complete type information describing structs `S`, `A`, and
2838 * `B`. Also, we might get tons of duplicated and redundant type information.
2840 * Additional complication we need to keep in mind comes from the fact that
2841 * types, in general, can form graphs containing cycles, not just DAGs.
2843 * While algorithm does deduplication, it also merges and resolves type
2844 * information (unless disabled throught `struct btf_opts`), whenever possible.
2845 * E.g., in the example above with two compilation units having partial type
2846 * information for structs `A` and `B`, the output of algorithm will emit
2847 * a single copy of each BTF type that describes structs `A`, `B`, and `S`
2848 * (as well as type information for `int` and pointers), as if they were defined
2849 * in a single compilation unit as:
2869 * Algorithm completes its work in 6 separate passes:
2871 * 1. Strings deduplication.
2872 * 2. Primitive types deduplication (int, enum, fwd).
2873 * 3. Struct/union types deduplication.
2874 * 4. Reference types deduplication (pointers, typedefs, arrays, funcs, func
2875 * protos, and const/volatile/restrict modifiers).
2876 * 5. Types compaction.
2877 * 6. Types remapping.
2879 * Algorithm determines canonical type descriptor, which is a single
2880 * representative type for each truly unique type. This canonical type is the
2881 * one that will go into final deduplicated BTF type information. For
2882 * struct/unions, it is also the type that algorithm will merge additional type
2883 * information into (while resolving FWDs), as it discovers it from data in
2884 * other CUs. Each input BTF type eventually gets either mapped to itself, if
2885 * that type is canonical, or to some other type, if that type is equivalent
2886 * and was chosen as canonical representative. This mapping is stored in
2887 * `btf_dedup->map` array. This map is also used to record STRUCT/UNION that
2888 * FWD type got resolved to.
2890 * To facilitate fast discovery of canonical types, we also maintain canonical
2891 * index (`btf_dedup->dedup_table`), which maps type descriptor's signature hash
2892 * (i.e., hashed kind, name, size, fields, etc) into a list of canonical types
2893 * that match that signature. With sufficiently good choice of type signature
2894 * hashing function, we can limit number of canonical types for each unique type
2895 * signature to a very small number, allowing to find canonical type for any
2896 * duplicated type very quickly.
2898 * Struct/union deduplication is the most critical part and algorithm for
2899 * deduplicating structs/unions is described in greater details in comments for
2900 * `btf_dedup_is_equiv` function.
2902 int btf__dedup(struct btf *btf, struct btf_ext *btf_ext,
2903 const struct btf_dedup_opts *opts)
2905 struct btf_dedup *d = btf_dedup_new(btf, btf_ext, opts);
2909 pr_debug("btf_dedup_new failed: %ld", PTR_ERR(d));
2910 return libbpf_err(-EINVAL);
2913 if (btf_ensure_modifiable(btf))
2914 return libbpf_err(-ENOMEM);
2916 err = btf_dedup_prep(d);
2918 pr_debug("btf_dedup_prep failed:%d\n", err);
2921 err = btf_dedup_strings(d);
2923 pr_debug("btf_dedup_strings failed:%d\n", err);
2926 err = btf_dedup_prim_types(d);
2928 pr_debug("btf_dedup_prim_types failed:%d\n", err);
2931 err = btf_dedup_struct_types(d);
2933 pr_debug("btf_dedup_struct_types failed:%d\n", err);
2936 err = btf_dedup_ref_types(d);
2938 pr_debug("btf_dedup_ref_types failed:%d\n", err);
2941 err = btf_dedup_compact_types(d);
2943 pr_debug("btf_dedup_compact_types failed:%d\n", err);
2946 err = btf_dedup_remap_types(d);
2948 pr_debug("btf_dedup_remap_types failed:%d\n", err);
2954 return libbpf_err(err);
2957 #define BTF_UNPROCESSED_ID ((__u32)-1)
2958 #define BTF_IN_PROGRESS_ID ((__u32)-2)
2961 /* .BTF section to be deduped in-place */
2964 * Optional .BTF.ext section. When provided, any strings referenced
2965 * from it will be taken into account when deduping strings
2967 struct btf_ext *btf_ext;
2969 * This is a map from any type's signature hash to a list of possible
2970 * canonical representative type candidates. Hash collisions are
2971 * ignored, so even types of various kinds can share same list of
2972 * candidates, which is fine because we rely on subsequent
2973 * btf_xxx_equal() checks to authoritatively verify type equality.
2975 struct hashmap *dedup_table;
2976 /* Canonical types map */
2978 /* Hypothetical mapping, used during type graph equivalence checks */
2983 /* Whether hypothetical mapping, if successful, would need to adjust
2984 * already canonicalized types (due to a new forward declaration to
2985 * concrete type resolution). In such case, during split BTF dedup
2986 * candidate type would still be considered as different, because base
2987 * BTF is considered to be immutable.
2989 bool hypot_adjust_canon;
2990 /* Various option modifying behavior of algorithm */
2991 struct btf_dedup_opts opts;
2992 /* temporary strings deduplication state */
2993 struct strset *strs_set;
2996 static long hash_combine(long h, long value)
2998 return h * 31 + value;
3001 #define for_each_dedup_cand(d, node, hash) \
3002 hashmap__for_each_key_entry(d->dedup_table, node, (void *)hash)
3004 static int btf_dedup_table_add(struct btf_dedup *d, long hash, __u32 type_id)
3006 return hashmap__append(d->dedup_table,
3007 (void *)hash, (void *)(long)type_id);
3010 static int btf_dedup_hypot_map_add(struct btf_dedup *d,
3011 __u32 from_id, __u32 to_id)
3013 if (d->hypot_cnt == d->hypot_cap) {
3016 d->hypot_cap += max((size_t)16, d->hypot_cap / 2);
3017 new_list = libbpf_reallocarray(d->hypot_list, d->hypot_cap, sizeof(__u32));
3020 d->hypot_list = new_list;
3022 d->hypot_list[d->hypot_cnt++] = from_id;
3023 d->hypot_map[from_id] = to_id;
3027 static void btf_dedup_clear_hypot_map(struct btf_dedup *d)
3031 for (i = 0; i < d->hypot_cnt; i++)
3032 d->hypot_map[d->hypot_list[i]] = BTF_UNPROCESSED_ID;
3034 d->hypot_adjust_canon = false;
3037 static void btf_dedup_free(struct btf_dedup *d)
3039 hashmap__free(d->dedup_table);
3040 d->dedup_table = NULL;
3046 d->hypot_map = NULL;
3048 free(d->hypot_list);
3049 d->hypot_list = NULL;
3054 static size_t btf_dedup_identity_hash_fn(const void *key, void *ctx)
3059 static size_t btf_dedup_collision_hash_fn(const void *key, void *ctx)
3064 static bool btf_dedup_equal_fn(const void *k1, const void *k2, void *ctx)
3069 static struct btf_dedup *btf_dedup_new(struct btf *btf, struct btf_ext *btf_ext,
3070 const struct btf_dedup_opts *opts)
3072 struct btf_dedup *d = calloc(1, sizeof(struct btf_dedup));
3073 hashmap_hash_fn hash_fn = btf_dedup_identity_hash_fn;
3074 int i, err = 0, type_cnt;
3077 return ERR_PTR(-ENOMEM);
3079 d->opts.dont_resolve_fwds = opts && opts->dont_resolve_fwds;
3080 /* dedup_table_size is now used only to force collisions in tests */
3081 if (opts && opts->dedup_table_size == 1)
3082 hash_fn = btf_dedup_collision_hash_fn;
3085 d->btf_ext = btf_ext;
3087 d->dedup_table = hashmap__new(hash_fn, btf_dedup_equal_fn, NULL);
3088 if (IS_ERR(d->dedup_table)) {
3089 err = PTR_ERR(d->dedup_table);
3090 d->dedup_table = NULL;
3094 type_cnt = btf__get_nr_types(btf) + 1;
3095 d->map = malloc(sizeof(__u32) * type_cnt);
3100 /* special BTF "void" type is made canonical immediately */
3102 for (i = 1; i < type_cnt; i++) {
3103 struct btf_type *t = btf_type_by_id(d->btf, i);
3105 /* VAR and DATASEC are never deduped and are self-canonical */
3106 if (btf_is_var(t) || btf_is_datasec(t))
3109 d->map[i] = BTF_UNPROCESSED_ID;
3112 d->hypot_map = malloc(sizeof(__u32) * type_cnt);
3113 if (!d->hypot_map) {
3117 for (i = 0; i < type_cnt; i++)
3118 d->hypot_map[i] = BTF_UNPROCESSED_ID;
3123 return ERR_PTR(err);
3130 * Iterate over all possible places in .BTF and .BTF.ext that can reference
3131 * string and pass pointer to it to a provided callback `fn`.
3133 static int btf_for_each_str_off(struct btf_dedup *d, str_off_visit_fn fn, void *ctx)
3137 for (i = 0; i < d->btf->nr_types; i++) {
3138 struct btf_type *t = btf_type_by_id(d->btf, d->btf->start_id + i);
3140 r = btf_type_visit_str_offs(t, fn, ctx);
3148 r = btf_ext_visit_str_offs(d->btf_ext, fn, ctx);
3155 static int strs_dedup_remap_str_off(__u32 *str_off_ptr, void *ctx)
3157 struct btf_dedup *d = ctx;
3158 __u32 str_off = *str_off_ptr;
3162 /* don't touch empty string or string in main BTF */
3163 if (str_off == 0 || str_off < d->btf->start_str_off)
3166 s = btf__str_by_offset(d->btf, str_off);
3167 if (d->btf->base_btf) {
3168 err = btf__find_str(d->btf->base_btf, s);
3177 off = strset__add_str(d->strs_set, s);
3181 *str_off_ptr = d->btf->start_str_off + off;
3186 * Dedup string and filter out those that are not referenced from either .BTF
3187 * or .BTF.ext (if provided) sections.
3189 * This is done by building index of all strings in BTF's string section,
3190 * then iterating over all entities that can reference strings (e.g., type
3191 * names, struct field names, .BTF.ext line info, etc) and marking corresponding
3192 * strings as used. After that all used strings are deduped and compacted into
3193 * sequential blob of memory and new offsets are calculated. Then all the string
3194 * references are iterated again and rewritten using new offsets.
3196 static int btf_dedup_strings(struct btf_dedup *d)
3200 if (d->btf->strs_deduped)
3203 d->strs_set = strset__new(BTF_MAX_STR_OFFSET, NULL, 0);
3204 if (IS_ERR(d->strs_set)) {
3205 err = PTR_ERR(d->strs_set);
3209 if (!d->btf->base_btf) {
3210 /* insert empty string; we won't be looking it up during strings
3211 * dedup, but it's good to have it for generic BTF string lookups
3213 err = strset__add_str(d->strs_set, "");
3218 /* remap string offsets */
3219 err = btf_for_each_str_off(d, strs_dedup_remap_str_off, d);
3223 /* replace BTF string data and hash with deduped ones */
3224 strset__free(d->btf->strs_set);
3225 d->btf->hdr->str_len = strset__data_size(d->strs_set);
3226 d->btf->strs_set = d->strs_set;
3228 d->btf->strs_deduped = true;
3232 strset__free(d->strs_set);
3238 static long btf_hash_common(struct btf_type *t)
3242 h = hash_combine(0, t->name_off);
3243 h = hash_combine(h, t->info);
3244 h = hash_combine(h, t->size);
3248 static bool btf_equal_common(struct btf_type *t1, struct btf_type *t2)
3250 return t1->name_off == t2->name_off &&
3251 t1->info == t2->info &&
3252 t1->size == t2->size;
3255 /* Calculate type signature hash of INT. */
3256 static long btf_hash_int(struct btf_type *t)
3258 __u32 info = *(__u32 *)(t + 1);
3261 h = btf_hash_common(t);
3262 h = hash_combine(h, info);
3266 /* Check structural equality of two INTs. */
3267 static bool btf_equal_int(struct btf_type *t1, struct btf_type *t2)
3271 if (!btf_equal_common(t1, t2))
3273 info1 = *(__u32 *)(t1 + 1);
3274 info2 = *(__u32 *)(t2 + 1);
3275 return info1 == info2;
3278 /* Calculate type signature hash of ENUM. */
3279 static long btf_hash_enum(struct btf_type *t)
3283 /* don't hash vlen and enum members to support enum fwd resolving */
3284 h = hash_combine(0, t->name_off);
3285 h = hash_combine(h, t->info & ~0xffff);
3286 h = hash_combine(h, t->size);
3290 /* Check structural equality of two ENUMs. */
3291 static bool btf_equal_enum(struct btf_type *t1, struct btf_type *t2)
3293 const struct btf_enum *m1, *m2;
3297 if (!btf_equal_common(t1, t2))
3300 vlen = btf_vlen(t1);
3303 for (i = 0; i < vlen; i++) {
3304 if (m1->name_off != m2->name_off || m1->val != m2->val)
3312 static inline bool btf_is_enum_fwd(struct btf_type *t)
3314 return btf_is_enum(t) && btf_vlen(t) == 0;
3317 static bool btf_compat_enum(struct btf_type *t1, struct btf_type *t2)
3319 if (!btf_is_enum_fwd(t1) && !btf_is_enum_fwd(t2))
3320 return btf_equal_enum(t1, t2);
3321 /* ignore vlen when comparing */
3322 return t1->name_off == t2->name_off &&
3323 (t1->info & ~0xffff) == (t2->info & ~0xffff) &&
3324 t1->size == t2->size;
3328 * Calculate type signature hash of STRUCT/UNION, ignoring referenced type IDs,
3329 * as referenced type IDs equivalence is established separately during type
3330 * graph equivalence check algorithm.
3332 static long btf_hash_struct(struct btf_type *t)
3334 const struct btf_member *member = btf_members(t);
3335 __u32 vlen = btf_vlen(t);
3336 long h = btf_hash_common(t);
3339 for (i = 0; i < vlen; i++) {
3340 h = hash_combine(h, member->name_off);
3341 h = hash_combine(h, member->offset);
3342 /* no hashing of referenced type ID, it can be unresolved yet */
3349 * Check structural compatibility of two FUNC_PROTOs, ignoring referenced type
3350 * IDs. This check is performed during type graph equivalence check and
3351 * referenced types equivalence is checked separately.
3353 static bool btf_shallow_equal_struct(struct btf_type *t1, struct btf_type *t2)
3355 const struct btf_member *m1, *m2;
3359 if (!btf_equal_common(t1, t2))
3362 vlen = btf_vlen(t1);
3363 m1 = btf_members(t1);
3364 m2 = btf_members(t2);
3365 for (i = 0; i < vlen; i++) {
3366 if (m1->name_off != m2->name_off || m1->offset != m2->offset)
3375 * Calculate type signature hash of ARRAY, including referenced type IDs,
3376 * under assumption that they were already resolved to canonical type IDs and
3377 * are not going to change.
3379 static long btf_hash_array(struct btf_type *t)
3381 const struct btf_array *info = btf_array(t);
3382 long h = btf_hash_common(t);
3384 h = hash_combine(h, info->type);
3385 h = hash_combine(h, info->index_type);
3386 h = hash_combine(h, info->nelems);
3391 * Check exact equality of two ARRAYs, taking into account referenced
3392 * type IDs, under assumption that they were already resolved to canonical
3393 * type IDs and are not going to change.
3394 * This function is called during reference types deduplication to compare
3395 * ARRAY to potential canonical representative.
3397 static bool btf_equal_array(struct btf_type *t1, struct btf_type *t2)
3399 const struct btf_array *info1, *info2;
3401 if (!btf_equal_common(t1, t2))
3404 info1 = btf_array(t1);
3405 info2 = btf_array(t2);
3406 return info1->type == info2->type &&
3407 info1->index_type == info2->index_type &&
3408 info1->nelems == info2->nelems;
3412 * Check structural compatibility of two ARRAYs, ignoring referenced type
3413 * IDs. This check is performed during type graph equivalence check and
3414 * referenced types equivalence is checked separately.
3416 static bool btf_compat_array(struct btf_type *t1, struct btf_type *t2)
3418 if (!btf_equal_common(t1, t2))
3421 return btf_array(t1)->nelems == btf_array(t2)->nelems;
3425 * Calculate type signature hash of FUNC_PROTO, including referenced type IDs,
3426 * under assumption that they were already resolved to canonical type IDs and
3427 * are not going to change.
3429 static long btf_hash_fnproto(struct btf_type *t)
3431 const struct btf_param *member = btf_params(t);
3432 __u16 vlen = btf_vlen(t);
3433 long h = btf_hash_common(t);
3436 for (i = 0; i < vlen; i++) {
3437 h = hash_combine(h, member->name_off);
3438 h = hash_combine(h, member->type);
3445 * Check exact equality of two FUNC_PROTOs, taking into account referenced
3446 * type IDs, under assumption that they were already resolved to canonical
3447 * type IDs and are not going to change.
3448 * This function is called during reference types deduplication to compare
3449 * FUNC_PROTO to potential canonical representative.
3451 static bool btf_equal_fnproto(struct btf_type *t1, struct btf_type *t2)
3453 const struct btf_param *m1, *m2;
3457 if (!btf_equal_common(t1, t2))
3460 vlen = btf_vlen(t1);
3461 m1 = btf_params(t1);
3462 m2 = btf_params(t2);
3463 for (i = 0; i < vlen; i++) {
3464 if (m1->name_off != m2->name_off || m1->type != m2->type)
3473 * Check structural compatibility of two FUNC_PROTOs, ignoring referenced type
3474 * IDs. This check is performed during type graph equivalence check and
3475 * referenced types equivalence is checked separately.
3477 static bool btf_compat_fnproto(struct btf_type *t1, struct btf_type *t2)
3479 const struct btf_param *m1, *m2;
3483 /* skip return type ID */
3484 if (t1->name_off != t2->name_off || t1->info != t2->info)
3487 vlen = btf_vlen(t1);
3488 m1 = btf_params(t1);
3489 m2 = btf_params(t2);
3490 for (i = 0; i < vlen; i++) {
3491 if (m1->name_off != m2->name_off)
3499 /* Prepare split BTF for deduplication by calculating hashes of base BTF's
3500 * types and initializing the rest of the state (canonical type mapping) for
3501 * the fixed base BTF part.
3503 static int btf_dedup_prep(struct btf_dedup *d)
3509 if (!d->btf->base_btf)
3512 for (type_id = 1; type_id < d->btf->start_id; type_id++) {
3513 t = btf_type_by_id(d->btf, type_id);
3515 /* all base BTF types are self-canonical by definition */
3516 d->map[type_id] = type_id;
3518 switch (btf_kind(t)) {
3520 case BTF_KIND_DATASEC:
3521 /* VAR and DATASEC are never hash/deduplicated */
3523 case BTF_KIND_CONST:
3524 case BTF_KIND_VOLATILE:
3525 case BTF_KIND_RESTRICT:
3528 case BTF_KIND_TYPEDEF:
3530 case BTF_KIND_FLOAT:
3531 h = btf_hash_common(t);
3534 h = btf_hash_int(t);
3537 h = btf_hash_enum(t);
3539 case BTF_KIND_STRUCT:
3540 case BTF_KIND_UNION:
3541 h = btf_hash_struct(t);
3543 case BTF_KIND_ARRAY:
3544 h = btf_hash_array(t);
3546 case BTF_KIND_FUNC_PROTO:
3547 h = btf_hash_fnproto(t);
3550 pr_debug("unknown kind %d for type [%d]\n", btf_kind(t), type_id);
3553 if (btf_dedup_table_add(d, h, type_id))
3561 * Deduplicate primitive types, that can't reference other types, by calculating
3562 * their type signature hash and comparing them with any possible canonical
3563 * candidate. If no canonical candidate matches, type itself is marked as
3564 * canonical and is added into `btf_dedup->dedup_table` as another candidate.
3566 static int btf_dedup_prim_type(struct btf_dedup *d, __u32 type_id)
3568 struct btf_type *t = btf_type_by_id(d->btf, type_id);
3569 struct hashmap_entry *hash_entry;
3570 struct btf_type *cand;
3571 /* if we don't find equivalent type, then we are canonical */
3572 __u32 new_id = type_id;
3576 switch (btf_kind(t)) {
3577 case BTF_KIND_CONST:
3578 case BTF_KIND_VOLATILE:
3579 case BTF_KIND_RESTRICT:
3581 case BTF_KIND_TYPEDEF:
3582 case BTF_KIND_ARRAY:
3583 case BTF_KIND_STRUCT:
3584 case BTF_KIND_UNION:
3586 case BTF_KIND_FUNC_PROTO:
3588 case BTF_KIND_DATASEC:
3592 h = btf_hash_int(t);
3593 for_each_dedup_cand(d, hash_entry, h) {
3594 cand_id = (__u32)(long)hash_entry->value;
3595 cand = btf_type_by_id(d->btf, cand_id);
3596 if (btf_equal_int(t, cand)) {
3604 h = btf_hash_enum(t);
3605 for_each_dedup_cand(d, hash_entry, h) {
3606 cand_id = (__u32)(long)hash_entry->value;
3607 cand = btf_type_by_id(d->btf, cand_id);
3608 if (btf_equal_enum(t, cand)) {
3612 if (d->opts.dont_resolve_fwds)
3614 if (btf_compat_enum(t, cand)) {
3615 if (btf_is_enum_fwd(t)) {
3616 /* resolve fwd to full enum */
3620 /* resolve canonical enum fwd to full enum */
3621 d->map[cand_id] = type_id;
3627 case BTF_KIND_FLOAT:
3628 h = btf_hash_common(t);
3629 for_each_dedup_cand(d, hash_entry, h) {
3630 cand_id = (__u32)(long)hash_entry->value;
3631 cand = btf_type_by_id(d->btf, cand_id);
3632 if (btf_equal_common(t, cand)) {
3643 d->map[type_id] = new_id;
3644 if (type_id == new_id && btf_dedup_table_add(d, h, type_id))
3650 static int btf_dedup_prim_types(struct btf_dedup *d)
3654 for (i = 0; i < d->btf->nr_types; i++) {
3655 err = btf_dedup_prim_type(d, d->btf->start_id + i);
3663 * Check whether type is already mapped into canonical one (could be to itself).
3665 static inline bool is_type_mapped(struct btf_dedup *d, uint32_t type_id)
3667 return d->map[type_id] <= BTF_MAX_NR_TYPES;
3671 * Resolve type ID into its canonical type ID, if any; otherwise return original
3672 * type ID. If type is FWD and is resolved into STRUCT/UNION already, follow
3673 * STRUCT/UNION link and resolve it into canonical type ID as well.
3675 static inline __u32 resolve_type_id(struct btf_dedup *d, __u32 type_id)
3677 while (is_type_mapped(d, type_id) && d->map[type_id] != type_id)
3678 type_id = d->map[type_id];
3683 * Resolve FWD to underlying STRUCT/UNION, if any; otherwise return original
3686 static uint32_t resolve_fwd_id(struct btf_dedup *d, uint32_t type_id)
3688 __u32 orig_type_id = type_id;
3690 if (!btf_is_fwd(btf__type_by_id(d->btf, type_id)))
3693 while (is_type_mapped(d, type_id) && d->map[type_id] != type_id)
3694 type_id = d->map[type_id];
3696 if (!btf_is_fwd(btf__type_by_id(d->btf, type_id)))
3699 return orig_type_id;
3703 static inline __u16 btf_fwd_kind(struct btf_type *t)
3705 return btf_kflag(t) ? BTF_KIND_UNION : BTF_KIND_STRUCT;
3708 /* Check if given two types are identical ARRAY definitions */
3709 static int btf_dedup_identical_arrays(struct btf_dedup *d, __u32 id1, __u32 id2)
3711 struct btf_type *t1, *t2;
3713 t1 = btf_type_by_id(d->btf, id1);
3714 t2 = btf_type_by_id(d->btf, id2);
3715 if (!btf_is_array(t1) || !btf_is_array(t2))
3718 return btf_equal_array(t1, t2);
3722 * Check equivalence of BTF type graph formed by candidate struct/union (we'll
3723 * call it "candidate graph" in this description for brevity) to a type graph
3724 * formed by (potential) canonical struct/union ("canonical graph" for brevity
3725 * here, though keep in mind that not all types in canonical graph are
3726 * necessarily canonical representatives themselves, some of them might be
3727 * duplicates or its uniqueness might not have been established yet).
3729 * - >0, if type graphs are equivalent;
3730 * - 0, if not equivalent;
3733 * Algorithm performs side-by-side DFS traversal of both type graphs and checks
3734 * equivalence of BTF types at each step. If at any point BTF types in candidate
3735 * and canonical graphs are not compatible structurally, whole graphs are
3736 * incompatible. If types are structurally equivalent (i.e., all information
3737 * except referenced type IDs is exactly the same), a mapping from `canon_id` to
3738 * a `cand_id` is recored in hypothetical mapping (`btf_dedup->hypot_map`).
3739 * If a type references other types, then those referenced types are checked
3740 * for equivalence recursively.
3742 * During DFS traversal, if we find that for current `canon_id` type we
3743 * already have some mapping in hypothetical map, we check for two possible
3745 * - `canon_id` is mapped to exactly the same type as `cand_id`. This will
3746 * happen when type graphs have cycles. In this case we assume those two
3747 * types are equivalent.
3748 * - `canon_id` is mapped to different type. This is contradiction in our
3749 * hypothetical mapping, because same graph in canonical graph corresponds
3750 * to two different types in candidate graph, which for equivalent type
3751 * graphs shouldn't happen. This condition terminates equivalence check
3752 * with negative result.
3754 * If type graphs traversal exhausts types to check and find no contradiction,
3755 * then type graphs are equivalent.
3757 * When checking types for equivalence, there is one special case: FWD types.
3758 * If FWD type resolution is allowed and one of the types (either from canonical
3759 * or candidate graph) is FWD and other is STRUCT/UNION (depending on FWD's kind
3760 * flag) and their names match, hypothetical mapping is updated to point from
3761 * FWD to STRUCT/UNION. If graphs will be determined as equivalent successfully,
3762 * this mapping will be used to record FWD -> STRUCT/UNION mapping permanently.
3764 * Technically, this could lead to incorrect FWD to STRUCT/UNION resolution,
3765 * if there are two exactly named (or anonymous) structs/unions that are
3766 * compatible structurally, one of which has FWD field, while other is concrete
3767 * STRUCT/UNION, but according to C sources they are different structs/unions
3768 * that are referencing different types with the same name. This is extremely
3769 * unlikely to happen, but btf_dedup API allows to disable FWD resolution if
3770 * this logic is causing problems.
3772 * Doing FWD resolution means that both candidate and/or canonical graphs can
3773 * consists of portions of the graph that come from multiple compilation units.
3774 * This is due to the fact that types within single compilation unit are always
3775 * deduplicated and FWDs are already resolved, if referenced struct/union
3776 * definiton is available. So, if we had unresolved FWD and found corresponding
3777 * STRUCT/UNION, they will be from different compilation units. This
3778 * consequently means that when we "link" FWD to corresponding STRUCT/UNION,
3779 * type graph will likely have at least two different BTF types that describe
3780 * same type (e.g., most probably there will be two different BTF types for the
3781 * same 'int' primitive type) and could even have "overlapping" parts of type
3782 * graph that describe same subset of types.
3784 * This in turn means that our assumption that each type in canonical graph
3785 * must correspond to exactly one type in candidate graph might not hold
3786 * anymore and will make it harder to detect contradictions using hypothetical
3787 * map. To handle this problem, we allow to follow FWD -> STRUCT/UNION
3788 * resolution only in canonical graph. FWDs in candidate graphs are never
3789 * resolved. To see why it's OK, let's check all possible situations w.r.t. FWDs
3791 * - Both types in canonical and candidate graphs are FWDs. If they are
3792 * structurally equivalent, then they can either be both resolved to the
3793 * same STRUCT/UNION or not resolved at all. In both cases they are
3794 * equivalent and there is no need to resolve FWD on candidate side.
3795 * - Both types in canonical and candidate graphs are concrete STRUCT/UNION,
3796 * so nothing to resolve as well, algorithm will check equivalence anyway.
3797 * - Type in canonical graph is FWD, while type in candidate is concrete
3798 * STRUCT/UNION. In this case candidate graph comes from single compilation
3799 * unit, so there is exactly one BTF type for each unique C type. After
3800 * resolving FWD into STRUCT/UNION, there might be more than one BTF type
3801 * in canonical graph mapping to single BTF type in candidate graph, but
3802 * because hypothetical mapping maps from canonical to candidate types, it's
3803 * alright, and we still maintain the property of having single `canon_id`
3804 * mapping to single `cand_id` (there could be two different `canon_id`
3805 * mapped to the same `cand_id`, but it's not contradictory).
3806 * - Type in canonical graph is concrete STRUCT/UNION, while type in candidate
3807 * graph is FWD. In this case we are just going to check compatibility of
3808 * STRUCT/UNION and corresponding FWD, and if they are compatible, we'll
3809 * assume that whatever STRUCT/UNION FWD resolves to must be equivalent to
3810 * a concrete STRUCT/UNION from canonical graph. If the rest of type graphs
3811 * turn out equivalent, we'll re-resolve FWD to concrete STRUCT/UNION from
3814 static int btf_dedup_is_equiv(struct btf_dedup *d, __u32 cand_id,
3817 struct btf_type *cand_type;
3818 struct btf_type *canon_type;
3819 __u32 hypot_type_id;
3824 /* if both resolve to the same canonical, they must be equivalent */
3825 if (resolve_type_id(d, cand_id) == resolve_type_id(d, canon_id))
3828 canon_id = resolve_fwd_id(d, canon_id);
3830 hypot_type_id = d->hypot_map[canon_id];
3831 if (hypot_type_id <= BTF_MAX_NR_TYPES) {
3832 /* In some cases compiler will generate different DWARF types
3833 * for *identical* array type definitions and use them for
3834 * different fields within the *same* struct. This breaks type
3835 * equivalence check, which makes an assumption that candidate
3836 * types sub-graph has a consistent and deduped-by-compiler
3837 * types within a single CU. So work around that by explicitly
3838 * allowing identical array types here.
3840 return hypot_type_id == cand_id ||
3841 btf_dedup_identical_arrays(d, hypot_type_id, cand_id);
3844 if (btf_dedup_hypot_map_add(d, canon_id, cand_id))
3847 cand_type = btf_type_by_id(d->btf, cand_id);
3848 canon_type = btf_type_by_id(d->btf, canon_id);
3849 cand_kind = btf_kind(cand_type);
3850 canon_kind = btf_kind(canon_type);
3852 if (cand_type->name_off != canon_type->name_off)
3855 /* FWD <--> STRUCT/UNION equivalence check, if enabled */
3856 if (!d->opts.dont_resolve_fwds
3857 && (cand_kind == BTF_KIND_FWD || canon_kind == BTF_KIND_FWD)
3858 && cand_kind != canon_kind) {
3862 if (cand_kind == BTF_KIND_FWD) {
3863 real_kind = canon_kind;
3864 fwd_kind = btf_fwd_kind(cand_type);
3866 real_kind = cand_kind;
3867 fwd_kind = btf_fwd_kind(canon_type);
3868 /* we'd need to resolve base FWD to STRUCT/UNION */
3869 if (fwd_kind == real_kind && canon_id < d->btf->start_id)
3870 d->hypot_adjust_canon = true;
3872 return fwd_kind == real_kind;
3875 if (cand_kind != canon_kind)
3878 switch (cand_kind) {
3880 return btf_equal_int(cand_type, canon_type);
3883 if (d->opts.dont_resolve_fwds)
3884 return btf_equal_enum(cand_type, canon_type);
3886 return btf_compat_enum(cand_type, canon_type);
3889 case BTF_KIND_FLOAT:
3890 return btf_equal_common(cand_type, canon_type);
3892 case BTF_KIND_CONST:
3893 case BTF_KIND_VOLATILE:
3894 case BTF_KIND_RESTRICT:
3896 case BTF_KIND_TYPEDEF:
3898 if (cand_type->info != canon_type->info)
3900 return btf_dedup_is_equiv(d, cand_type->type, canon_type->type);
3902 case BTF_KIND_ARRAY: {
3903 const struct btf_array *cand_arr, *canon_arr;
3905 if (!btf_compat_array(cand_type, canon_type))
3907 cand_arr = btf_array(cand_type);
3908 canon_arr = btf_array(canon_type);
3909 eq = btf_dedup_is_equiv(d, cand_arr->index_type, canon_arr->index_type);
3912 return btf_dedup_is_equiv(d, cand_arr->type, canon_arr->type);
3915 case BTF_KIND_STRUCT:
3916 case BTF_KIND_UNION: {
3917 const struct btf_member *cand_m, *canon_m;
3920 if (!btf_shallow_equal_struct(cand_type, canon_type))
3922 vlen = btf_vlen(cand_type);
3923 cand_m = btf_members(cand_type);
3924 canon_m = btf_members(canon_type);
3925 for (i = 0; i < vlen; i++) {
3926 eq = btf_dedup_is_equiv(d, cand_m->type, canon_m->type);
3936 case BTF_KIND_FUNC_PROTO: {
3937 const struct btf_param *cand_p, *canon_p;
3940 if (!btf_compat_fnproto(cand_type, canon_type))
3942 eq = btf_dedup_is_equiv(d, cand_type->type, canon_type->type);
3945 vlen = btf_vlen(cand_type);
3946 cand_p = btf_params(cand_type);
3947 canon_p = btf_params(canon_type);
3948 for (i = 0; i < vlen; i++) {
3949 eq = btf_dedup_is_equiv(d, cand_p->type, canon_p->type);
3965 * Use hypothetical mapping, produced by successful type graph equivalence
3966 * check, to augment existing struct/union canonical mapping, where possible.
3968 * If BTF_KIND_FWD resolution is allowed, this mapping is also used to record
3969 * FWD -> STRUCT/UNION correspondence as well. FWD resolution is bidirectional:
3970 * it doesn't matter if FWD type was part of canonical graph or candidate one,
3971 * we are recording the mapping anyway. As opposed to carefulness required
3972 * for struct/union correspondence mapping (described below), for FWD resolution
3973 * it's not important, as by the time that FWD type (reference type) will be
3974 * deduplicated all structs/unions will be deduped already anyway.
3976 * Recording STRUCT/UNION mapping is purely a performance optimization and is
3977 * not required for correctness. It needs to be done carefully to ensure that
3978 * struct/union from candidate's type graph is not mapped into corresponding
3979 * struct/union from canonical type graph that itself hasn't been resolved into
3980 * canonical representative. The only guarantee we have is that canonical
3981 * struct/union was determined as canonical and that won't change. But any
3982 * types referenced through that struct/union fields could have been not yet
3983 * resolved, so in case like that it's too early to establish any kind of
3984 * correspondence between structs/unions.
3986 * No canonical correspondence is derived for primitive types (they are already
3987 * deduplicated completely already anyway) or reference types (they rely on
3988 * stability of struct/union canonical relationship for equivalence checks).
3990 static void btf_dedup_merge_hypot_map(struct btf_dedup *d)
3992 __u32 canon_type_id, targ_type_id;
3993 __u16 t_kind, c_kind;
3997 for (i = 0; i < d->hypot_cnt; i++) {
3998 canon_type_id = d->hypot_list[i];
3999 targ_type_id = d->hypot_map[canon_type_id];
4000 t_id = resolve_type_id(d, targ_type_id);
4001 c_id = resolve_type_id(d, canon_type_id);
4002 t_kind = btf_kind(btf__type_by_id(d->btf, t_id));
4003 c_kind = btf_kind(btf__type_by_id(d->btf, c_id));
4005 * Resolve FWD into STRUCT/UNION.
4006 * It's ok to resolve FWD into STRUCT/UNION that's not yet
4007 * mapped to canonical representative (as opposed to
4008 * STRUCT/UNION <--> STRUCT/UNION mapping logic below), because
4009 * eventually that struct is going to be mapped and all resolved
4010 * FWDs will automatically resolve to correct canonical
4011 * representative. This will happen before ref type deduping,
4012 * which critically depends on stability of these mapping. This
4013 * stability is not a requirement for STRUCT/UNION equivalence
4017 /* if it's the split BTF case, we still need to point base FWD
4018 * to STRUCT/UNION in a split BTF, because FWDs from split BTF
4019 * will be resolved against base FWD. If we don't point base
4020 * canonical FWD to the resolved STRUCT/UNION, then all the
4021 * FWDs in split BTF won't be correctly resolved to a proper
4024 if (t_kind != BTF_KIND_FWD && c_kind == BTF_KIND_FWD)
4025 d->map[c_id] = t_id;
4027 /* if graph equivalence determined that we'd need to adjust
4028 * base canonical types, then we need to only point base FWDs
4029 * to STRUCTs/UNIONs and do no more modifications. For all
4030 * other purposes the type graphs were not equivalent.
4032 if (d->hypot_adjust_canon)
4035 if (t_kind == BTF_KIND_FWD && c_kind != BTF_KIND_FWD)
4036 d->map[t_id] = c_id;
4038 if ((t_kind == BTF_KIND_STRUCT || t_kind == BTF_KIND_UNION) &&
4039 c_kind != BTF_KIND_FWD &&
4040 is_type_mapped(d, c_id) &&
4041 !is_type_mapped(d, t_id)) {
4043 * as a perf optimization, we can map struct/union
4044 * that's part of type graph we just verified for
4045 * equivalence. We can do that for struct/union that has
4046 * canonical representative only, though.
4048 d->map[t_id] = c_id;
4054 * Deduplicate struct/union types.
4056 * For each struct/union type its type signature hash is calculated, taking
4057 * into account type's name, size, number, order and names of fields, but
4058 * ignoring type ID's referenced from fields, because they might not be deduped
4059 * completely until after reference types deduplication phase. This type hash
4060 * is used to iterate over all potential canonical types, sharing same hash.
4061 * For each canonical candidate we check whether type graphs that they form
4062 * (through referenced types in fields and so on) are equivalent using algorithm
4063 * implemented in `btf_dedup_is_equiv`. If such equivalence is found and
4064 * BTF_KIND_FWD resolution is allowed, then hypothetical mapping
4065 * (btf_dedup->hypot_map) produced by aforementioned type graph equivalence
4066 * algorithm is used to record FWD -> STRUCT/UNION mapping. It's also used to
4067 * potentially map other structs/unions to their canonical representatives,
4068 * if such relationship hasn't yet been established. This speeds up algorithm
4069 * by eliminating some of the duplicate work.
4071 * If no matching canonical representative was found, struct/union is marked
4072 * as canonical for itself and is added into btf_dedup->dedup_table hash map
4073 * for further look ups.
4075 static int btf_dedup_struct_type(struct btf_dedup *d, __u32 type_id)
4077 struct btf_type *cand_type, *t;
4078 struct hashmap_entry *hash_entry;
4079 /* if we don't find equivalent type, then we are canonical */
4080 __u32 new_id = type_id;
4084 /* already deduped or is in process of deduping (loop detected) */
4085 if (d->map[type_id] <= BTF_MAX_NR_TYPES)
4088 t = btf_type_by_id(d->btf, type_id);
4091 if (kind != BTF_KIND_STRUCT && kind != BTF_KIND_UNION)
4094 h = btf_hash_struct(t);
4095 for_each_dedup_cand(d, hash_entry, h) {
4096 __u32 cand_id = (__u32)(long)hash_entry->value;
4100 * Even though btf_dedup_is_equiv() checks for
4101 * btf_shallow_equal_struct() internally when checking two
4102 * structs (unions) for equivalence, we need to guard here
4103 * from picking matching FWD type as a dedup candidate.
4104 * This can happen due to hash collision. In such case just
4105 * relying on btf_dedup_is_equiv() would lead to potentially
4106 * creating a loop (FWD -> STRUCT and STRUCT -> FWD), because
4107 * FWD and compatible STRUCT/UNION are considered equivalent.
4109 cand_type = btf_type_by_id(d->btf, cand_id);
4110 if (!btf_shallow_equal_struct(t, cand_type))
4113 btf_dedup_clear_hypot_map(d);
4114 eq = btf_dedup_is_equiv(d, type_id, cand_id);
4119 btf_dedup_merge_hypot_map(d);
4120 if (d->hypot_adjust_canon) /* not really equivalent */
4126 d->map[type_id] = new_id;
4127 if (type_id == new_id && btf_dedup_table_add(d, h, type_id))
4133 static int btf_dedup_struct_types(struct btf_dedup *d)
4137 for (i = 0; i < d->btf->nr_types; i++) {
4138 err = btf_dedup_struct_type(d, d->btf->start_id + i);
4146 * Deduplicate reference type.
4148 * Once all primitive and struct/union types got deduplicated, we can easily
4149 * deduplicate all other (reference) BTF types. This is done in two steps:
4151 * 1. Resolve all referenced type IDs into their canonical type IDs. This
4152 * resolution can be done either immediately for primitive or struct/union types
4153 * (because they were deduped in previous two phases) or recursively for
4154 * reference types. Recursion will always terminate at either primitive or
4155 * struct/union type, at which point we can "unwind" chain of reference types
4156 * one by one. There is no danger of encountering cycles because in C type
4157 * system the only way to form type cycle is through struct/union, so any chain
4158 * of reference types, even those taking part in a type cycle, will inevitably
4159 * reach struct/union at some point.
4161 * 2. Once all referenced type IDs are resolved into canonical ones, BTF type
4162 * becomes "stable", in the sense that no further deduplication will cause
4163 * any changes to it. With that, it's now possible to calculate type's signature
4164 * hash (this time taking into account referenced type IDs) and loop over all
4165 * potential canonical representatives. If no match was found, current type
4166 * will become canonical representative of itself and will be added into
4167 * btf_dedup->dedup_table as another possible canonical representative.
4169 static int btf_dedup_ref_type(struct btf_dedup *d, __u32 type_id)
4171 struct hashmap_entry *hash_entry;
4172 __u32 new_id = type_id, cand_id;
4173 struct btf_type *t, *cand;
4174 /* if we don't find equivalent type, then we are representative type */
4178 if (d->map[type_id] == BTF_IN_PROGRESS_ID)
4180 if (d->map[type_id] <= BTF_MAX_NR_TYPES)
4181 return resolve_type_id(d, type_id);
4183 t = btf_type_by_id(d->btf, type_id);
4184 d->map[type_id] = BTF_IN_PROGRESS_ID;
4186 switch (btf_kind(t)) {
4187 case BTF_KIND_CONST:
4188 case BTF_KIND_VOLATILE:
4189 case BTF_KIND_RESTRICT:
4191 case BTF_KIND_TYPEDEF:
4193 ref_type_id = btf_dedup_ref_type(d, t->type);
4194 if (ref_type_id < 0)
4196 t->type = ref_type_id;
4198 h = btf_hash_common(t);
4199 for_each_dedup_cand(d, hash_entry, h) {
4200 cand_id = (__u32)(long)hash_entry->value;
4201 cand = btf_type_by_id(d->btf, cand_id);
4202 if (btf_equal_common(t, cand)) {
4209 case BTF_KIND_ARRAY: {
4210 struct btf_array *info = btf_array(t);
4212 ref_type_id = btf_dedup_ref_type(d, info->type);
4213 if (ref_type_id < 0)
4215 info->type = ref_type_id;
4217 ref_type_id = btf_dedup_ref_type(d, info->index_type);
4218 if (ref_type_id < 0)
4220 info->index_type = ref_type_id;
4222 h = btf_hash_array(t);
4223 for_each_dedup_cand(d, hash_entry, h) {
4224 cand_id = (__u32)(long)hash_entry->value;
4225 cand = btf_type_by_id(d->btf, cand_id);
4226 if (btf_equal_array(t, cand)) {
4234 case BTF_KIND_FUNC_PROTO: {
4235 struct btf_param *param;
4239 ref_type_id = btf_dedup_ref_type(d, t->type);
4240 if (ref_type_id < 0)
4242 t->type = ref_type_id;
4245 param = btf_params(t);
4246 for (i = 0; i < vlen; i++) {
4247 ref_type_id = btf_dedup_ref_type(d, param->type);
4248 if (ref_type_id < 0)
4250 param->type = ref_type_id;
4254 h = btf_hash_fnproto(t);
4255 for_each_dedup_cand(d, hash_entry, h) {
4256 cand_id = (__u32)(long)hash_entry->value;
4257 cand = btf_type_by_id(d->btf, cand_id);
4258 if (btf_equal_fnproto(t, cand)) {
4270 d->map[type_id] = new_id;
4271 if (type_id == new_id && btf_dedup_table_add(d, h, type_id))
4277 static int btf_dedup_ref_types(struct btf_dedup *d)
4281 for (i = 0; i < d->btf->nr_types; i++) {
4282 err = btf_dedup_ref_type(d, d->btf->start_id + i);
4286 /* we won't need d->dedup_table anymore */
4287 hashmap__free(d->dedup_table);
4288 d->dedup_table = NULL;
4295 * After we established for each type its corresponding canonical representative
4296 * type, we now can eliminate types that are not canonical and leave only
4297 * canonical ones layed out sequentially in memory by copying them over
4298 * duplicates. During compaction btf_dedup->hypot_map array is reused to store
4299 * a map from original type ID to a new compacted type ID, which will be used
4300 * during next phase to "fix up" type IDs, referenced from struct/union and
4303 static int btf_dedup_compact_types(struct btf_dedup *d)
4306 __u32 next_type_id = d->btf->start_id;
4307 const struct btf_type *t;
4311 /* we are going to reuse hypot_map to store compaction remapping */
4312 d->hypot_map[0] = 0;
4313 /* base BTF types are not renumbered */
4314 for (id = 1; id < d->btf->start_id; id++)
4315 d->hypot_map[id] = id;
4316 for (i = 0, id = d->btf->start_id; i < d->btf->nr_types; i++, id++)
4317 d->hypot_map[id] = BTF_UNPROCESSED_ID;
4319 p = d->btf->types_data;
4321 for (i = 0, id = d->btf->start_id; i < d->btf->nr_types; i++, id++) {
4322 if (d->map[id] != id)
4325 t = btf__type_by_id(d->btf, id);
4326 len = btf_type_size(t);
4331 d->hypot_map[id] = next_type_id;
4332 d->btf->type_offs[next_type_id - d->btf->start_id] = p - d->btf->types_data;
4337 /* shrink struct btf's internal types index and update btf_header */
4338 d->btf->nr_types = next_type_id - d->btf->start_id;
4339 d->btf->type_offs_cap = d->btf->nr_types;
4340 d->btf->hdr->type_len = p - d->btf->types_data;
4341 new_offs = libbpf_reallocarray(d->btf->type_offs, d->btf->type_offs_cap,
4343 if (d->btf->type_offs_cap && !new_offs)
4345 d->btf->type_offs = new_offs;
4346 d->btf->hdr->str_off = d->btf->hdr->type_len;
4347 d->btf->raw_size = d->btf->hdr->hdr_len + d->btf->hdr->type_len + d->btf->hdr->str_len;
4352 * Figure out final (deduplicated and compacted) type ID for provided original
4353 * `type_id` by first resolving it into corresponding canonical type ID and
4354 * then mapping it to a deduplicated type ID, stored in btf_dedup->hypot_map,
4355 * which is populated during compaction phase.
4357 static int btf_dedup_remap_type_id(__u32 *type_id, void *ctx)
4359 struct btf_dedup *d = ctx;
4360 __u32 resolved_type_id, new_type_id;
4362 resolved_type_id = resolve_type_id(d, *type_id);
4363 new_type_id = d->hypot_map[resolved_type_id];
4364 if (new_type_id > BTF_MAX_NR_TYPES)
4367 *type_id = new_type_id;
4372 * Remap referenced type IDs into deduped type IDs.
4374 * After BTF types are deduplicated and compacted, their final type IDs may
4375 * differ from original ones. The map from original to a corresponding
4376 * deduped type ID is stored in btf_dedup->hypot_map and is populated during
4377 * compaction phase. During remapping phase we are rewriting all type IDs
4378 * referenced from any BTF type (e.g., struct fields, func proto args, etc) to
4379 * their final deduped type IDs.
4381 static int btf_dedup_remap_types(struct btf_dedup *d)
4385 for (i = 0; i < d->btf->nr_types; i++) {
4386 struct btf_type *t = btf_type_by_id(d->btf, d->btf->start_id + i);
4388 r = btf_type_visit_type_ids(t, btf_dedup_remap_type_id, d);
4396 r = btf_ext_visit_type_ids(d->btf_ext, btf_dedup_remap_type_id, d);
4404 * Probe few well-known locations for vmlinux kernel image and try to load BTF
4405 * data out of it to use for target BTF.
4407 struct btf *libbpf_find_kernel_btf(void)
4410 const char *path_fmt;
4413 /* try canonical vmlinux BTF through sysfs first */
4414 { "/sys/kernel/btf/vmlinux", true /* raw BTF */ },
4415 /* fall back to trying to find vmlinux ELF on disk otherwise */
4416 { "/boot/vmlinux-%1$s" },
4417 { "/lib/modules/%1$s/vmlinux-%1$s" },
4418 { "/lib/modules/%1$s/build/vmlinux" },
4419 { "/usr/lib/modules/%1$s/kernel/vmlinux" },
4420 { "/usr/lib/debug/boot/vmlinux-%1$s" },
4421 { "/usr/lib/debug/boot/vmlinux-%1$s.debug" },
4422 { "/usr/lib/debug/lib/modules/%1$s/vmlinux" },
4424 char path[PATH_MAX + 1];
4431 for (i = 0; i < ARRAY_SIZE(locations); i++) {
4432 snprintf(path, PATH_MAX, locations[i].path_fmt, buf.release);
4434 if (access(path, R_OK))
4437 if (locations[i].raw_btf)
4438 btf = btf__parse_raw(path);
4440 btf = btf__parse_elf(path, NULL);
4441 err = libbpf_get_error(btf);
4442 pr_debug("loading kernel BTF '%s': %d\n", path, err);
4449 pr_warn("failed to find valid kernel BTF\n");
4450 return libbpf_err_ptr(-ESRCH);
4453 int btf_type_visit_type_ids(struct btf_type *t, type_id_visit_fn visit, void *ctx)
4457 switch (btf_kind(t)) {
4459 case BTF_KIND_FLOAT:
4464 case BTF_KIND_CONST:
4465 case BTF_KIND_VOLATILE:
4466 case BTF_KIND_RESTRICT:
4468 case BTF_KIND_TYPEDEF:
4471 return visit(&t->type, ctx);
4473 case BTF_KIND_ARRAY: {
4474 struct btf_array *a = btf_array(t);
4476 err = visit(&a->type, ctx);
4477 err = err ?: visit(&a->index_type, ctx);
4481 case BTF_KIND_STRUCT:
4482 case BTF_KIND_UNION: {
4483 struct btf_member *m = btf_members(t);
4485 for (i = 0, n = btf_vlen(t); i < n; i++, m++) {
4486 err = visit(&m->type, ctx);
4493 case BTF_KIND_FUNC_PROTO: {
4494 struct btf_param *m = btf_params(t);
4496 err = visit(&t->type, ctx);
4499 for (i = 0, n = btf_vlen(t); i < n; i++, m++) {
4500 err = visit(&m->type, ctx);
4507 case BTF_KIND_DATASEC: {
4508 struct btf_var_secinfo *m = btf_var_secinfos(t);
4510 for (i = 0, n = btf_vlen(t); i < n; i++, m++) {
4511 err = visit(&m->type, ctx);
4523 int btf_type_visit_str_offs(struct btf_type *t, str_off_visit_fn visit, void *ctx)
4527 err = visit(&t->name_off, ctx);
4531 switch (btf_kind(t)) {
4532 case BTF_KIND_STRUCT:
4533 case BTF_KIND_UNION: {
4534 struct btf_member *m = btf_members(t);
4536 for (i = 0, n = btf_vlen(t); i < n; i++, m++) {
4537 err = visit(&m->name_off, ctx);
4543 case BTF_KIND_ENUM: {
4544 struct btf_enum *m = btf_enum(t);
4546 for (i = 0, n = btf_vlen(t); i < n; i++, m++) {
4547 err = visit(&m->name_off, ctx);
4553 case BTF_KIND_FUNC_PROTO: {
4554 struct btf_param *m = btf_params(t);
4556 for (i = 0, n = btf_vlen(t); i < n; i++, m++) {
4557 err = visit(&m->name_off, ctx);
4570 int btf_ext_visit_type_ids(struct btf_ext *btf_ext, type_id_visit_fn visit, void *ctx)
4572 const struct btf_ext_info *seg;
4573 struct btf_ext_info_sec *sec;
4576 seg = &btf_ext->func_info;
4577 for_each_btf_ext_sec(seg, sec) {
4578 struct bpf_func_info_min *rec;
4580 for_each_btf_ext_rec(seg, sec, i, rec) {
4581 err = visit(&rec->type_id, ctx);
4587 seg = &btf_ext->core_relo_info;
4588 for_each_btf_ext_sec(seg, sec) {
4589 struct bpf_core_relo *rec;
4591 for_each_btf_ext_rec(seg, sec, i, rec) {
4592 err = visit(&rec->type_id, ctx);
4601 int btf_ext_visit_str_offs(struct btf_ext *btf_ext, str_off_visit_fn visit, void *ctx)
4603 const struct btf_ext_info *seg;
4604 struct btf_ext_info_sec *sec;
4607 seg = &btf_ext->func_info;
4608 for_each_btf_ext_sec(seg, sec) {
4609 err = visit(&sec->sec_name_off, ctx);
4614 seg = &btf_ext->line_info;
4615 for_each_btf_ext_sec(seg, sec) {
4616 struct bpf_line_info_min *rec;
4618 err = visit(&sec->sec_name_off, ctx);
4622 for_each_btf_ext_rec(seg, sec, i, rec) {
4623 err = visit(&rec->file_name_off, ctx);
4626 err = visit(&rec->line_off, ctx);
4632 seg = &btf_ext->core_relo_info;
4633 for_each_btf_ext_sec(seg, sec) {
4634 struct bpf_core_relo *rec;
4636 err = visit(&sec->sec_name_off, ctx);
4640 for_each_btf_ext_rec(seg, sec, i, rec) {
4641 err = visit(&rec->access_str_off, ctx);