Lines Matching +full:function +full:- +full:enumerator
1 // SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause)
33 /* raw BTF data in non-native endianness */
45 * +--------------------------------+
47 * +--------------------------------+
51 * types_data-+ |
52 * strs_data------------+
63 * +----------+ +---------+ +-----------+
65 * +----------+ +---------+ +-----------+
69 * types_data----+ |
70 * strs_data------------------+
72 * +----------+---------+-----------+
74 * raw_data----->+----------+---------+-----------+
79 size_t types_data_cap; /* used size stored in hdr->type_len */
87 size_t strs_data_cap; /* used size stored in hdr->str_len */
142 memset(new_data + (*cap_cnt) * elem_sz, 0, (new_cnt - *cap_cnt) * elem_sz); in btf_add_mem()
159 p = btf_add_mem(data, cap_cnt, elem_sz, *cap_cnt, SIZE_MAX, need_cnt - *cap_cnt); in btf_ensure_mem()
161 return -ENOMEM; in btf_ensure_mem()
170 p = btf_add_mem((void **)&btf->type_offs, &btf->type_offs_cap, sizeof(__u32), in btf_add_type_idx_entry()
171 btf->nr_types + 1, BTF_MAX_NR_TYPES, 1); in btf_add_type_idx_entry()
173 return -ENOMEM; in btf_add_type_idx_entry()
181 h->magic = bswap_16(h->magic); in btf_bswap_hdr()
182 h->hdr_len = bswap_32(h->hdr_len); in btf_bswap_hdr()
183 h->type_off = bswap_32(h->type_off); in btf_bswap_hdr()
184 h->type_len = bswap_32(h->type_len); in btf_bswap_hdr()
185 h->str_off = bswap_32(h->str_off); in btf_bswap_hdr()
186 h->str_len = bswap_32(h->str_len); in btf_bswap_hdr()
191 struct btf_header *hdr = btf->hdr; in btf_parse_hdr()
194 if (btf->raw_size < sizeof(struct btf_header)) { in btf_parse_hdr()
196 return -EINVAL; in btf_parse_hdr()
199 if (hdr->magic == bswap_16(BTF_MAGIC)) { in btf_parse_hdr()
200 btf->swapped_endian = true; in btf_parse_hdr()
201 if (bswap_32(hdr->hdr_len) != sizeof(struct btf_header)) { in btf_parse_hdr()
202 pr_warn("Can't load BTF with non-native endianness due to unsupported header length %u\n", in btf_parse_hdr()
203 bswap_32(hdr->hdr_len)); in btf_parse_hdr()
204 return -ENOTSUP; in btf_parse_hdr()
207 } else if (hdr->magic != BTF_MAGIC) { in btf_parse_hdr()
208 pr_debug("Invalid BTF magic: %x\n", hdr->magic); in btf_parse_hdr()
209 return -EINVAL; in btf_parse_hdr()
212 if (btf->raw_size < hdr->hdr_len) { in btf_parse_hdr()
214 hdr->hdr_len, btf->raw_size); in btf_parse_hdr()
215 return -EINVAL; in btf_parse_hdr()
218 meta_left = btf->raw_size - hdr->hdr_len; in btf_parse_hdr()
219 if (meta_left < (long long)hdr->str_off + hdr->str_len) { in btf_parse_hdr()
220 pr_debug("Invalid BTF total size: %u\n", btf->raw_size); in btf_parse_hdr()
221 return -EINVAL; in btf_parse_hdr()
224 if ((long long)hdr->type_off + hdr->type_len > hdr->str_off) { in btf_parse_hdr()
226 hdr->type_off, hdr->type_len, hdr->str_off, hdr->str_len); in btf_parse_hdr()
227 return -EINVAL; in btf_parse_hdr()
230 if (hdr->type_off % 4) { in btf_parse_hdr()
232 return -EINVAL; in btf_parse_hdr()
240 const struct btf_header *hdr = btf->hdr; in btf_parse_str_sec()
241 const char *start = btf->strs_data; in btf_parse_str_sec()
242 const char *end = start + btf->hdr->str_len; in btf_parse_str_sec()
244 if (!hdr->str_len || hdr->str_len - 1 > BTF_MAX_STR_OFFSET || in btf_parse_str_sec()
245 start[0] || end[-1]) { in btf_parse_str_sec()
247 return -EINVAL; in btf_parse_str_sec()
284 return -EINVAL; in btf_type_size()
290 t->name_off = bswap_32(t->name_off); in btf_bswap_type_base()
291 t->info = bswap_32(t->info); in btf_bswap_type_base()
292 t->type = bswap_32(t->type); in btf_bswap_type_base()
319 e->name_off = bswap_32(e->name_off); in btf_bswap_type_rest()
320 e->val = bswap_32(e->val); in btf_bswap_type_rest()
325 a->type = bswap_32(a->type); in btf_bswap_type_rest()
326 a->index_type = bswap_32(a->index_type); in btf_bswap_type_rest()
327 a->nelems = bswap_32(a->nelems); in btf_bswap_type_rest()
332 m->name_off = bswap_32(m->name_off); in btf_bswap_type_rest()
333 m->type = bswap_32(m->type); in btf_bswap_type_rest()
334 m->offset = bswap_32(m->offset); in btf_bswap_type_rest()
339 p->name_off = bswap_32(p->name_off); in btf_bswap_type_rest()
340 p->type = bswap_32(p->type); in btf_bswap_type_rest()
344 btf_var(t)->linkage = bswap_32(btf_var(t)->linkage); in btf_bswap_type_rest()
348 v->type = bswap_32(v->type); in btf_bswap_type_rest()
349 v->offset = bswap_32(v->offset); in btf_bswap_type_rest()
350 v->size = bswap_32(v->size); in btf_bswap_type_rest()
355 return -EINVAL; in btf_bswap_type_rest()
361 struct btf_header *hdr = btf->hdr; in btf_parse_type_sec()
362 void *next_type = btf->types_data; in btf_parse_type_sec()
363 void *end_type = next_type + hdr->type_len; in btf_parse_type_sec()
377 if (btf->swapped_endian) in btf_parse_type_sec()
385 return -EINVAL; in btf_parse_type_sec()
388 if (btf->swapped_endian && btf_bswap_type_rest(next_type)) in btf_parse_type_sec()
389 return -EINVAL; in btf_parse_type_sec()
391 err = btf_add_type_idx_entry(btf, next_type - btf->types_data); in btf_parse_type_sec()
396 btf->nr_types++; in btf_parse_type_sec()
401 return -EINVAL; in btf_parse_type_sec()
409 return btf->nr_types; in btf__get_nr_types()
412 /* internal helper returning non-const pointer to a type */
418 return btf->types_data + btf->type_offs[type_id]; in btf_type_by_id()
423 if (type_id > btf->nr_types) in btf__type_by_id()
434 for (i = 1; i <= btf->nr_types; i++) { in determine_ptr_size()
439 name = btf__name_by_offset(btf, t->name_off); in determine_ptr_size()
445 if (t->size != 4 && t->size != 8) in determine_ptr_size()
447 return t->size; in determine_ptr_size()
451 return -1; in determine_ptr_size()
456 if (!btf->ptr_sz) in btf_ptr_sz()
457 ((struct btf *)btf)->ptr_sz = determine_ptr_size(btf); in btf_ptr_sz()
458 return btf->ptr_sz < 0 ? sizeof(void *) : btf->ptr_sz; in btf_ptr_sz()
464 * type, this function returns 0. In the latter case, native architecture's
471 if (!btf->ptr_sz) in btf__pointer_size()
472 ((struct btf *)btf)->ptr_sz = determine_ptr_size(btf); in btf__pointer_size()
474 if (btf->ptr_sz < 0) in btf__pointer_size()
478 return btf->ptr_sz; in btf__pointer_size()
487 return -EINVAL; in btf__set_pointer_size()
488 btf->ptr_sz = ptr_sz; in btf__set_pointer_size()
506 return btf->swapped_endian ? BTF_LITTLE_ENDIAN : BTF_BIG_ENDIAN; in btf__endianness()
508 return btf->swapped_endian ? BTF_BIG_ENDIAN : BTF_LITTLE_ENDIAN; in btf__endianness()
514 return -EINVAL; in btf__set_endianness()
516 btf->swapped_endian = is_host_big_endian() != (endian == BTF_BIG_ENDIAN); in btf__set_endianness()
517 if (!btf->swapped_endian) { in btf__set_endianness()
518 free(btf->raw_data_swapped); in btf__set_endianness()
519 btf->raw_data_swapped = NULL; in btf__set_endianness()
541 __s64 size = -1; in btf__resolve_size()
553 size = t->size; in btf__resolve_size()
563 type_id = t->type; in btf__resolve_size()
567 if (nelems && array->nelems > UINT32_MAX / nelems) in btf__resolve_size()
568 return -E2BIG; in btf__resolve_size()
569 nelems *= array->nelems; in btf__resolve_size()
570 type_id = array->type; in btf__resolve_size()
573 return -EINVAL; in btf__resolve_size()
581 return -EINVAL; in btf__resolve_size()
583 return -E2BIG; in btf__resolve_size()
596 return min(btf_ptr_sz(btf), (size_t)t->size); in btf__align_of()
603 return btf__align_of(btf, t->type); in btf__align_of()
605 return btf__align_of(btf, btf_array(t)->type); in btf__align_of()
613 align = btf__align_of(btf, m->type); in btf__align_of()
636 type_id = t->type; in btf__resolve_type()
642 return -EINVAL; in btf__resolve_type()
654 for (i = 1; i <= btf->nr_types; i++) { in btf__find_by_name()
656 const char *name = btf__name_by_offset(btf, t->name_off); in btf__find_by_name()
662 return -ENOENT; in btf__find_by_name()
673 for (i = 1; i <= btf->nr_types; i++) { in btf__find_by_name_kind()
679 name = btf__name_by_offset(btf, t->name_off); in btf__find_by_name_kind()
684 return -ENOENT; in btf__find_by_name_kind()
689 return (void *)btf->hdr != btf->raw_data; in btf_is_modifiable()
697 if (btf->fd >= 0) in btf__free()
698 close(btf->fd); in btf__free()
702 * in-memory representation for header, types, and strings in btf__free()
707 free(btf->hdr); in btf__free()
708 free(btf->types_data); in btf__free()
709 free(btf->strs_data); in btf__free()
711 free(btf->raw_data); in btf__free()
712 free(btf->raw_data_swapped); in btf__free()
713 free(btf->type_offs); in btf__free()
723 return ERR_PTR(-ENOMEM); in btf__new_empty()
725 btf->fd = -1; in btf__new_empty()
726 btf->ptr_sz = sizeof(void *); in btf__new_empty()
727 btf->swapped_endian = false; in btf__new_empty()
730 btf->raw_size = sizeof(struct btf_header) + 1; in btf__new_empty()
731 btf->raw_data = calloc(1, btf->raw_size); in btf__new_empty()
732 if (!btf->raw_data) { in btf__new_empty()
734 return ERR_PTR(-ENOMEM); in btf__new_empty()
737 btf->hdr = btf->raw_data; in btf__new_empty()
738 btf->hdr->hdr_len = sizeof(struct btf_header); in btf__new_empty()
739 btf->hdr->magic = BTF_MAGIC; in btf__new_empty()
740 btf->hdr->version = BTF_VERSION; in btf__new_empty()
742 btf->types_data = btf->raw_data + btf->hdr->hdr_len; in btf__new_empty()
743 btf->strs_data = btf->raw_data + btf->hdr->hdr_len; in btf__new_empty()
744 btf->hdr->str_len = 1; /* empty string at offset 0 */ in btf__new_empty()
756 return ERR_PTR(-ENOMEM); in btf__new()
758 btf->raw_data = malloc(size); in btf__new()
759 if (!btf->raw_data) { in btf__new()
760 err = -ENOMEM; in btf__new()
763 memcpy(btf->raw_data, data, size); in btf__new()
764 btf->raw_size = size; in btf__new()
766 btf->hdr = btf->raw_data; in btf__new()
771 btf->strs_data = btf->raw_data + btf->hdr->hdr_len + btf->hdr->str_off; in btf__new()
772 btf->types_data = btf->raw_data + btf->hdr->hdr_len + btf->hdr->type_off; in btf__new()
779 btf->fd = -1; in btf__new()
793 int err = 0, fd = -1, idx = 0; in btf__parse_elf()
801 return ERR_PTR(-LIBBPF_ERRNO__LIBELF); in btf__parse_elf()
806 err = -errno; in btf__parse_elf()
811 err = -LIBBPF_ERRNO__FORMAT; in btf__parse_elf()
865 err = -ENOENT; in btf__parse_elf()
868 btf = btf__new(btf_data->d_buf, btf_data->d_size); in btf__parse_elf()
885 *btf_ext = btf_ext__new(btf_ext_data->d_buf, in btf__parse_elf()
886 btf_ext_data->d_size); in btf__parse_elf()
924 err = -errno; in btf__parse_raw()
930 err = -EIO; in btf__parse_raw()
935 err = -EPROTO; in btf__parse_raw()
941 err = -errno; in btf__parse_raw()
946 err = -errno; in btf__parse_raw()
951 err = -errno; in btf__parse_raw()
955 /* pre-alloc memory and read all of BTF data */ in btf__parse_raw()
958 err = -ENOMEM; in btf__parse_raw()
962 err = -EIO; in btf__parse_raw()
984 if (!IS_ERR(btf) || PTR_ERR(btf) != -EPROTO) in btf__parse()
995 return a->offset - b->offset; in compare_vsi_off()
1002 const char *name = btf__name_by_offset(btf, t->name_off); in btf_fixup_datasec()
1010 return -ENOENT; in btf_fixup_datasec()
1016 if (t->size) in btf_fixup_datasec()
1020 if (ret || !size || (t->size && t->size != size)) { in btf_fixup_datasec()
1022 return -ENOENT; in btf_fixup_datasec()
1025 t->size = size; in btf_fixup_datasec()
1028 t_var = btf__type_by_id(btf, vsi->type); in btf_fixup_datasec()
1032 pr_debug("Non-VAR type seen in section %s\n", name); in btf_fixup_datasec()
1033 return -EINVAL; in btf_fixup_datasec()
1036 if (var->linkage == BTF_VAR_STATIC) in btf_fixup_datasec()
1039 name = btf__name_by_offset(btf, t_var->name_off); in btf_fixup_datasec()
1042 return -ENOENT; in btf_fixup_datasec()
1049 return -ENOENT; in btf_fixup_datasec()
1052 vsi->offset = off; in btf_fixup_datasec()
1065 for (i = 1; i <= btf->nr_types; i++) { in btf__finalize_data()
1092 if (btf->fd >= 0) in btf__load()
1093 return -EEXIST; in btf__load()
1099 return -ENOMEM; in btf__load()
1106 err = -ENOMEM; in btf__load()
1110 btf->raw_size = raw_size; in btf__load()
1111 btf->raw_data = raw_data; in btf__load()
1113 btf->fd = bpf_load_btf(raw_data, raw_size, log_buf, log_buf_size, false); in btf__load()
1114 if (btf->fd < 0) { in btf__load()
1122 err = -errno; in btf__load()
1136 return btf->fd; in btf__fd()
1141 btf->fd = fd; in btf__set_fd()
1146 struct btf_header *hdr = btf->hdr; in btf_get_raw_data()
1152 data = swap_endian ? btf->raw_data_swapped : btf->raw_data; in btf_get_raw_data()
1154 *size = btf->raw_size; in btf_get_raw_data()
1158 data_sz = hdr->hdr_len + hdr->type_len + hdr->str_len; in btf_get_raw_data()
1164 memcpy(p, hdr, hdr->hdr_len); in btf_get_raw_data()
1167 p += hdr->hdr_len; in btf_get_raw_data()
1169 memcpy(p, btf->types_data, hdr->type_len); in btf_get_raw_data()
1171 for (i = 1; i <= btf->nr_types; i++) { in btf_get_raw_data()
1172 t = p + btf->type_offs[i]; in btf_get_raw_data()
1173 /* btf_bswap_type_rest() relies on native t->info, so in btf_get_raw_data()
1182 p += hdr->type_len; in btf_get_raw_data()
1184 memcpy(p, btf->strs_data, hdr->str_len); in btf_get_raw_data()
1185 p += hdr->str_len; in btf_get_raw_data()
1200 data = btf_get_raw_data(btf, &data_sz, btf->swapped_endian); in btf__get_raw_data()
1204 btf->raw_size = data_sz; in btf__get_raw_data()
1205 if (btf->swapped_endian) in btf__get_raw_data()
1206 btf->raw_data_swapped = data; in btf__get_raw_data()
1208 btf->raw_data = data; in btf__get_raw_data()
1215 if (offset < btf->hdr->str_len) in btf__str_by_offset()
1216 return btf->strs_data + offset; in btf__str_by_offset()
1242 * let's start with a sane default - 4KiB here - and resize it only if in btf__get_from_id()
1249 err = -ENOMEM; in btf__get_from_id()
1263 err = -ENOMEM; in btf__get_from_id()
1305 return -EINVAL; in btf__get_map_kv_tids()
1319 return -EINVAL; in btf__get_map_kv_tids()
1325 return -EINVAL; in btf__get_map_kv_tids()
1331 key_size = btf__resolve_size(btf, key->type); in btf__get_map_kv_tids()
1340 return -EINVAL; in btf__get_map_kv_tids()
1343 value_size = btf__resolve_size(btf, value->type); in btf__get_map_kv_tids()
1352 return -EINVAL; in btf__get_map_kv_tids()
1355 *key_type_id = key->type; in btf__get_map_kv_tids()
1356 *value_type_id = value->type; in btf__get_map_kv_tids()
1364 const char *str = btf->strs_data + (long)key; in strs_hash_fn()
1372 const char *str1 = btf->strs_data + (long)key1; in strs_hash_equal_fn()
1373 const char *str2 = btf->strs_data + (long)key2; in strs_hash_equal_fn()
1380 if (btf->raw_data) { in btf_invalidate_raw_data()
1381 free(btf->raw_data); in btf_invalidate_raw_data()
1382 btf->raw_data = NULL; in btf_invalidate_raw_data()
1384 if (btf->raw_data_swapped) { in btf_invalidate_raw_data()
1385 free(btf->raw_data_swapped); in btf_invalidate_raw_data()
1386 btf->raw_data_swapped = NULL; in btf_invalidate_raw_data()
1408 hdr = malloc(btf->hdr->hdr_len); in btf_ensure_modifiable()
1409 types = malloc(btf->hdr->type_len); in btf_ensure_modifiable()
1410 strs = malloc(btf->hdr->str_len); in btf_ensure_modifiable()
1414 memcpy(hdr, btf->hdr, btf->hdr->hdr_len); in btf_ensure_modifiable()
1415 memcpy(types, btf->types_data, btf->hdr->type_len); in btf_ensure_modifiable()
1416 memcpy(strs, btf->strs_data, btf->hdr->str_len); in btf_ensure_modifiable()
1426 strs_end = strs + btf->hdr->str_len; in btf_ensure_modifiable()
1432 if (err == -EEXIST) in btf_ensure_modifiable()
1439 btf->hdr = hdr; in btf_ensure_modifiable()
1440 btf->types_data = types; in btf_ensure_modifiable()
1441 btf->types_data_cap = btf->hdr->type_len; in btf_ensure_modifiable()
1442 btf->strs_data = strs; in btf_ensure_modifiable()
1443 btf->strs_data_cap = btf->hdr->str_len; in btf_ensure_modifiable()
1444 btf->strs_hash = hash; in btf_ensure_modifiable()
1448 btf->strs_deduped = btf->hdr->str_len <= 1; in btf_ensure_modifiable()
1460 return -ENOMEM; in btf_ensure_modifiable()
1465 return btf_add_mem(&btf->strs_data, &btf->strs_data_cap, 1, in btf_add_str_mem()
1466 btf->hdr->str_len, BTF_MAX_STR_OFFSET, add_sz); in btf_add_str_mem()
1471 * - >0 offset into string section, if string is found;
1472 * - -ENOENT, if string is not in the string section;
1473 * - <0, on any other error.
1482 return -ENOMEM; in btf__find_str()
1488 return -ENOMEM; in btf__find_str()
1490 new_off = btf->hdr->str_len; in btf__find_str()
1493 if (hashmap__find(btf->strs_hash, (void *)new_off, (void **)&old_off)) in btf__find_str()
1496 return -ENOENT; in btf__find_str()
1501 * - > 0 offset into string section, on success;
1502 * - < 0, on error.
1511 return -ENOMEM; in btf__add_str()
1513 /* Hashmap keys are always offsets within btf->strs_data, so to even in btf__add_str()
1516 * until btf->hdr->str_len is incremented, that string is just a piece in btf__add_str()
1519 * ready to be used, only a simple btf->hdr->str_len increment away. in btf__add_str()
1524 return -ENOMEM; in btf__add_str()
1526 new_off = btf->hdr->str_len; in btf__add_str()
1533 err = hashmap__insert(btf->strs_hash, (void *)new_off, (void *)new_off, in btf__add_str()
1535 if (err == -EEXIST) in btf__add_str()
1540 btf->hdr->str_len += len; /* new unique string, adjust data length */ in btf__add_str()
1546 return btf_add_mem(&btf->types_data, &btf->types_data_cap, 1, in btf_add_type_mem()
1547 btf->hdr->type_len, UINT_MAX, add_sz); in btf_add_type_mem()
1557 t->info = btf_type_info(btf_kind(t), btf_vlen(t) + 1, btf_kflag(t)); in btf_type_inc_vlen()
1562 * - *name* - non-empty, non-NULL type name;
1563 * - *sz* - power-of-2 (1, 2, 4, ..) size of the type, in bytes;
1564 * - encoding is a combination of BTF_INT_SIGNED, BTF_INT_CHAR, BTF_INT_BOOL.
1566 * - >0, type ID of newly added BTF type;
1567 * - <0, on error.
1574 /* non-empty name */ in btf__add_int()
1576 return -EINVAL; in btf__add_int()
1578 if (!byte_sz || (byte_sz & (byte_sz - 1)) || byte_sz > 16) in btf__add_int()
1579 return -EINVAL; in btf__add_int()
1581 return -EINVAL; in btf__add_int()
1585 return -ENOMEM; in btf__add_int()
1590 return -ENOMEM; in btf__add_int()
1600 t->name_off = name_off; in btf__add_int()
1601 t->info = btf_type_info(BTF_KIND_INT, 0, 0); in btf__add_int()
1602 t->size = byte_sz; in btf__add_int()
1606 err = btf_add_type_idx_entry(btf, btf->hdr->type_len); in btf__add_int()
1610 btf->hdr->type_len += sz; in btf__add_int()
1611 btf->hdr->str_off += sz; in btf__add_int()
1612 btf->nr_types++; in btf__add_int()
1613 return btf->nr_types; in btf__add_int()
1623 return -EINVAL; in validate_type_id()
1627 /* generic append function for PTR, TYPEDEF, CONST/VOLATILE/RESTRICT */
1634 return -EINVAL; in btf_add_ref_kind()
1637 return -ENOMEM; in btf_add_ref_kind()
1642 return -ENOMEM; in btf_add_ref_kind()
1650 t->name_off = name_off; in btf_add_ref_kind()
1651 t->info = btf_type_info(kind, 0, 0); in btf_add_ref_kind()
1652 t->type = ref_type_id; in btf_add_ref_kind()
1654 err = btf_add_type_idx_entry(btf, btf->hdr->type_len); in btf_add_ref_kind()
1658 btf->hdr->type_len += sz; in btf_add_ref_kind()
1659 btf->hdr->str_off += sz; in btf_add_ref_kind()
1660 btf->nr_types++; in btf_add_ref_kind()
1661 return btf->nr_types; in btf_add_ref_kind()
1666 * - *ref_type_id* - referenced type ID, it might not exist yet;
1668 * - >0, type ID of newly added BTF type;
1669 * - <0, on error.
1678 * - *index_type_id* - type ID of the type describing array index;
1679 * - *elem_type_id* - type ID of the type describing array element;
1680 * - *nr_elems* - the size of the array;
1682 * - >0, type ID of newly added BTF type;
1683 * - <0, on error.
1692 return -EINVAL; in btf__add_array()
1695 return -ENOMEM; in btf__add_array()
1700 return -ENOMEM; in btf__add_array()
1702 t->name_off = 0; in btf__add_array()
1703 t->info = btf_type_info(BTF_KIND_ARRAY, 0, 0); in btf__add_array()
1704 t->size = 0; in btf__add_array()
1707 a->type = elem_type_id; in btf__add_array()
1708 a->index_type = index_type_id; in btf__add_array()
1709 a->nelems = nr_elems; in btf__add_array()
1711 err = btf_add_type_idx_entry(btf, btf->hdr->type_len); in btf__add_array()
1715 btf->hdr->type_len += sz; in btf__add_array()
1716 btf->hdr->str_off += sz; in btf__add_array()
1717 btf->nr_types++; in btf__add_array()
1718 return btf->nr_types; in btf__add_array()
1721 /* generic STRUCT/UNION append function */
1728 return -ENOMEM; in btf_add_composite()
1733 return -ENOMEM; in btf_add_composite()
1744 t->name_off = name_off; in btf_add_composite()
1745 t->info = btf_type_info(kind, 0, 0); in btf_add_composite()
1746 t->size = bytes_sz; in btf_add_composite()
1748 err = btf_add_type_idx_entry(btf, btf->hdr->type_len); in btf_add_composite()
1752 btf->hdr->type_len += sz; in btf_add_composite()
1753 btf->hdr->str_off += sz; in btf_add_composite()
1754 btf->nr_types++; in btf_add_composite()
1755 return btf->nr_types; in btf_add_composite()
1760 * - *name* - name of the struct, can be NULL or empty for anonymous structs;
1761 * - *byte_sz* - size of the struct, in bytes;
1767 * - >0, type ID of newly added BTF type;
1768 * - <0, on error.
1777 * - *name* - name of the union, can be NULL or empty for anonymous union;
1778 * - *byte_sz* - size of the union, in bytes;
1785 * - >0, type ID of newly added BTF type;
1786 * - <0, on error.
1795 * - *name* - name of the field, can be NULL or empty for anonymous field;
1796 * - *type_id* - type ID for the type describing field type;
1797 * - *bit_offset* - bit offset of the start of the field within struct/union;
1798 * - *bit_size* - bit size of a bitfield, 0 for non-bitfield fields;
1800 * - 0, on success;
1801 * - <0, on error.
1812 if (btf->nr_types == 0) in btf__add_field()
1813 return -EINVAL; in btf__add_field()
1814 t = btf_type_by_id(btf, btf->nr_types); in btf__add_field()
1816 return -EINVAL; in btf__add_field()
1819 return -EINVAL; in btf__add_field()
1820 /* best-effort bit field offset/size enforcement */ in btf__add_field()
1823 return -EINVAL; in btf__add_field()
1827 return -EINVAL; in btf__add_field()
1831 return -ENOMEM; in btf__add_field()
1836 return -ENOMEM; in btf__add_field()
1844 m->name_off = name_off; in btf__add_field()
1845 m->type = type_id; in btf__add_field()
1846 m->offset = bit_offset | (bit_size << 24); in btf__add_field()
1849 t = btf_type_by_id(btf, btf->nr_types); in btf__add_field()
1851 t->info = btf_type_info(btf_kind(t), btf_vlen(t) + 1, is_bitfield || btf_kflag(t)); in btf__add_field()
1853 btf->hdr->type_len += sz; in btf__add_field()
1854 btf->hdr->str_off += sz; in btf__add_field()
1860 * - *name* - name of the enum, can be NULL or empty for anonymous enums;
1861 * - *byte_sz* - size of the enum, in bytes.
1864 * declaration). Enumerator values can be added by btf__add_enum_value()
1868 * - >0, type ID of newly added BTF type;
1869 * - <0, on error.
1877 if (!byte_sz || (byte_sz & (byte_sz - 1)) || byte_sz > 8) in btf__add_enum()
1878 return -EINVAL; in btf__add_enum()
1881 return -ENOMEM; in btf__add_enum()
1886 return -ENOMEM; in btf__add_enum()
1895 t->name_off = name_off; in btf__add_enum()
1896 t->info = btf_type_info(BTF_KIND_ENUM, 0, 0); in btf__add_enum()
1897 t->size = byte_sz; in btf__add_enum()
1899 err = btf_add_type_idx_entry(btf, btf->hdr->type_len); in btf__add_enum()
1903 btf->hdr->type_len += sz; in btf__add_enum()
1904 btf->hdr->str_off += sz; in btf__add_enum()
1905 btf->nr_types++; in btf__add_enum()
1906 return btf->nr_types; in btf__add_enum()
1911 * - *name* - name of the enumerator value, can't be NULL or empty;
1912 * - *value* - integer value corresponding to enum value *name*;
1914 * - 0, on success;
1915 * - <0, on error.
1924 if (btf->nr_types == 0) in btf__add_enum_value()
1925 return -EINVAL; in btf__add_enum_value()
1926 t = btf_type_by_id(btf, btf->nr_types); in btf__add_enum_value()
1928 return -EINVAL; in btf__add_enum_value()
1930 /* non-empty name */ in btf__add_enum_value()
1932 return -EINVAL; in btf__add_enum_value()
1934 return -E2BIG; in btf__add_enum_value()
1938 return -ENOMEM; in btf__add_enum_value()
1943 return -ENOMEM; in btf__add_enum_value()
1949 v->name_off = name_off; in btf__add_enum_value()
1950 v->val = value; in btf__add_enum_value()
1953 t = btf_type_by_id(btf, btf->nr_types); in btf__add_enum_value()
1956 btf->hdr->type_len += sz; in btf__add_enum_value()
1957 btf->hdr->str_off += sz; in btf__add_enum_value()
1963 * - *name*, non-empty/non-NULL name;
1964 * - *fwd_kind*, kind of forward declaration, one of BTF_FWD_STRUCT,
1967 * - >0, type ID of newly added BTF type;
1968 * - <0, on error.
1973 return -EINVAL; in btf__add_fwd()
1985 t->info = btf_type_info(BTF_KIND_FWD, 0, fwd_kind == BTF_FWD_UNION); in btf__add_fwd()
1990 * values; we also assume a standard 4-byte size for it in btf__add_fwd()
1994 return -EINVAL; in btf__add_fwd()
2000 * - *name*, non-empty/non-NULL name;
2001 * - *ref_type_id* - referenced type ID, it might not exist yet;
2003 * - >0, type ID of newly added BTF type;
2004 * - <0, on error.
2009 return -EINVAL; in btf__add_typedef()
2016 * - *ref_type_id* - referenced type ID, it might not exist yet;
2018 * - >0, type ID of newly added BTF type;
2019 * - <0, on error.
2028 * - *ref_type_id* - referenced type ID, it might not exist yet;
2030 * - >0, type ID of newly added BTF type;
2031 * - <0, on error.
2040 * - *ref_type_id* - referenced type ID, it might not exist yet;
2042 * - >0, type ID of newly added BTF type;
2043 * - <0, on error.
2052 * - *name*, non-empty/non-NULL name;
2053 * - *proto_type_id* - FUNC_PROTO's type ID, it might not exist yet;
2055 * - >0, type ID of newly added BTF type;
2056 * - <0, on error.
2064 return -EINVAL; in btf__add_func()
2067 return -EINVAL; in btf__add_func()
2073 t->info = btf_type_info(BTF_KIND_FUNC, linkage, 0); in btf__add_func()
2080 * - *ret_type_id* - type ID for return result of a function.
2082 * Function prototype initially has no arguments, but they can be added by
2087 * - >0, type ID of newly added BTF type;
2088 * - <0, on error.
2096 return -EINVAL; in btf__add_func_proto()
2099 return -ENOMEM; in btf__add_func_proto()
2104 return -ENOMEM; in btf__add_func_proto()
2109 t->name_off = 0; in btf__add_func_proto()
2110 t->info = btf_type_info(BTF_KIND_FUNC_PROTO, 0, 0); in btf__add_func_proto()
2111 t->type = ret_type_id; in btf__add_func_proto()
2113 err = btf_add_type_idx_entry(btf, btf->hdr->type_len); in btf__add_func_proto()
2117 btf->hdr->type_len += sz; in btf__add_func_proto()
2118 btf->hdr->str_off += sz; in btf__add_func_proto()
2119 btf->nr_types++; in btf__add_func_proto()
2120 return btf->nr_types; in btf__add_func_proto()
2124 * Append new function parameter for current FUNC_PROTO type with:
2125 * - *name* - parameter name, can be NULL or empty;
2126 * - *type_id* - type ID describing the type of the parameter.
2128 * - 0, on success;
2129 * - <0, on error.
2138 return -EINVAL; in btf__add_func_param()
2141 if (btf->nr_types == 0) in btf__add_func_param()
2142 return -EINVAL; in btf__add_func_param()
2143 t = btf_type_by_id(btf, btf->nr_types); in btf__add_func_param()
2145 return -EINVAL; in btf__add_func_param()
2149 return -ENOMEM; in btf__add_func_param()
2154 return -ENOMEM; in btf__add_func_param()
2162 p->name_off = name_off; in btf__add_func_param()
2163 p->type = type_id; in btf__add_func_param()
2166 t = btf_type_by_id(btf, btf->nr_types); in btf__add_func_param()
2169 btf->hdr->type_len += sz; in btf__add_func_param()
2170 btf->hdr->str_off += sz; in btf__add_func_param()
2176 * - *name* - non-empty/non-NULL name;
2177 * - *linkage* - variable linkage, one of BTF_VAR_STATIC,
2179 * - *type_id* - type ID of the type describing the type of the variable.
2181 * - >0, type ID of newly added BTF type;
2182 * - <0, on error.
2190 /* non-empty name */ in btf__add_var()
2192 return -EINVAL; in btf__add_var()
2195 return -EINVAL; in btf__add_var()
2197 return -EINVAL; in btf__add_var()
2201 return -ENOMEM; in btf__add_var()
2206 return -ENOMEM; in btf__add_var()
2212 t->name_off = name_off; in btf__add_var()
2213 t->info = btf_type_info(BTF_KIND_VAR, 0, 0); in btf__add_var()
2214 t->type = type_id; in btf__add_var()
2217 v->linkage = linkage; in btf__add_var()
2219 err = btf_add_type_idx_entry(btf, btf->hdr->type_len); in btf__add_var()
2223 btf->hdr->type_len += sz; in btf__add_var()
2224 btf->hdr->str_off += sz; in btf__add_var()
2225 btf->nr_types++; in btf__add_var()
2226 return btf->nr_types; in btf__add_var()
2231 * - *name* - non-empty/non-NULL name;
2232 * - *byte_sz* - data section size, in bytes.
2238 * - >0, type ID of newly added BTF type;
2239 * - <0, on error.
2246 /* non-empty name */ in btf__add_datasec()
2248 return -EINVAL; in btf__add_datasec()
2251 return -ENOMEM; in btf__add_datasec()
2256 return -ENOMEM; in btf__add_datasec()
2263 t->name_off = name_off; in btf__add_datasec()
2264 t->info = btf_type_info(BTF_KIND_DATASEC, 0, 0); in btf__add_datasec()
2265 t->size = byte_sz; in btf__add_datasec()
2267 err = btf_add_type_idx_entry(btf, btf->hdr->type_len); in btf__add_datasec()
2271 btf->hdr->type_len += sz; in btf__add_datasec()
2272 btf->hdr->str_off += sz; in btf__add_datasec()
2273 btf->nr_types++; in btf__add_datasec()
2274 return btf->nr_types; in btf__add_datasec()
2279 * - *var_type_id* - type ID, describing type of the variable;
2280 * - *offset* - variable offset within data section, in bytes;
2281 * - *byte_sz* - variable size, in bytes.
2284 * - 0, on success;
2285 * - <0, on error.
2294 if (btf->nr_types == 0) in btf__add_datasec_var_info()
2295 return -EINVAL; in btf__add_datasec_var_info()
2296 t = btf_type_by_id(btf, btf->nr_types); in btf__add_datasec_var_info()
2298 return -EINVAL; in btf__add_datasec_var_info()
2301 return -EINVAL; in btf__add_datasec_var_info()
2305 return -ENOMEM; in btf__add_datasec_var_info()
2310 return -ENOMEM; in btf__add_datasec_var_info()
2312 v->type = var_type_id; in btf__add_datasec_var_info()
2313 v->offset = offset; in btf__add_datasec_var_info()
2314 v->size = byte_sz; in btf__add_datasec_var_info()
2317 t = btf_type_by_id(btf, btf->nr_types); in btf__add_datasec_var_info()
2320 btf->hdr->type_len += sz; in btf__add_datasec_var_info()
2321 btf->hdr->str_off += sz; in btf__add_datasec_var_info()
2342 if (ext_sec->len == 0) in btf_ext_setup_info()
2345 if (ext_sec->off & 0x03) { in btf_ext_setup_info()
2347 ext_sec->desc); in btf_ext_setup_info()
2348 return -EINVAL; in btf_ext_setup_info()
2351 info = btf_ext->data + btf_ext->hdr->hdr_len + ext_sec->off; in btf_ext_setup_info()
2352 info_left = ext_sec->len; in btf_ext_setup_info()
2354 if (btf_ext->data + btf_ext->data_size < info + ext_sec->len) { in btf_ext_setup_info()
2356 ext_sec->desc, ext_sec->off, ext_sec->len); in btf_ext_setup_info()
2357 return -EINVAL; in btf_ext_setup_info()
2362 pr_debug(".BTF.ext %s record size not found\n", ext_sec->desc); in btf_ext_setup_info()
2363 return -EINVAL; in btf_ext_setup_info()
2368 if (record_size < ext_sec->min_rec_size || in btf_ext_setup_info()
2371 ext_sec->desc, record_size); in btf_ext_setup_info()
2372 return -EINVAL; in btf_ext_setup_info()
2376 info_left -= sizeof(__u32); in btf_ext_setup_info()
2380 pr_debug("%s section in .BTF.ext has no records", ext_sec->desc); in btf_ext_setup_info()
2381 return -EINVAL; in btf_ext_setup_info()
2391 ext_sec->desc); in btf_ext_setup_info()
2392 return -EINVAL; in btf_ext_setup_info()
2395 num_records = sinfo->num_info; in btf_ext_setup_info()
2398 ext_sec->desc); in btf_ext_setup_info()
2399 return -EINVAL; in btf_ext_setup_info()
2406 ext_sec->desc); in btf_ext_setup_info()
2407 return -EINVAL; in btf_ext_setup_info()
2410 info_left -= total_record_size; in btf_ext_setup_info()
2414 ext_info = ext_sec->ext_info; in btf_ext_setup_info()
2415 ext_info->len = ext_sec->len - sizeof(__u32); in btf_ext_setup_info()
2416 ext_info->rec_size = record_size; in btf_ext_setup_info()
2417 ext_info->info = info + sizeof(__u32); in btf_ext_setup_info()
2425 .off = btf_ext->hdr->func_info_off, in btf_ext_setup_func_info()
2426 .len = btf_ext->hdr->func_info_len, in btf_ext_setup_func_info()
2428 .ext_info = &btf_ext->func_info, in btf_ext_setup_func_info()
2438 .off = btf_ext->hdr->line_info_off, in btf_ext_setup_line_info()
2439 .len = btf_ext->hdr->line_info_len, in btf_ext_setup_line_info()
2441 .ext_info = &btf_ext->line_info, in btf_ext_setup_line_info()
2451 .off = btf_ext->hdr->core_relo_off, in btf_ext_setup_core_relos()
2452 .len = btf_ext->hdr->core_relo_len, in btf_ext_setup_core_relos()
2454 .ext_info = &btf_ext->core_relo_info, in btf_ext_setup_core_relos()
2466 data_size < hdr->hdr_len) { in btf_ext_parse_hdr()
2468 return -EINVAL; in btf_ext_parse_hdr()
2471 if (hdr->magic == bswap_16(BTF_MAGIC)) { in btf_ext_parse_hdr()
2472 pr_warn("BTF.ext in non-native endianness is not supported\n"); in btf_ext_parse_hdr()
2473 return -ENOTSUP; in btf_ext_parse_hdr()
2474 } else if (hdr->magic != BTF_MAGIC) { in btf_ext_parse_hdr()
2475 pr_debug("Invalid BTF.ext magic:%x\n", hdr->magic); in btf_ext_parse_hdr()
2476 return -EINVAL; in btf_ext_parse_hdr()
2479 if (hdr->version != BTF_VERSION) { in btf_ext_parse_hdr()
2480 pr_debug("Unsupported BTF.ext version:%u\n", hdr->version); in btf_ext_parse_hdr()
2481 return -ENOTSUP; in btf_ext_parse_hdr()
2484 if (hdr->flags) { in btf_ext_parse_hdr()
2485 pr_debug("Unsupported BTF.ext flags:%x\n", hdr->flags); in btf_ext_parse_hdr()
2486 return -ENOTSUP; in btf_ext_parse_hdr()
2489 if (data_size == hdr->hdr_len) { in btf_ext_parse_hdr()
2491 return -EINVAL; in btf_ext_parse_hdr()
2501 free(btf_ext->data); in btf_ext__free()
2516 return ERR_PTR(-ENOMEM); in btf_ext__new()
2518 btf_ext->data_size = size; in btf_ext__new()
2519 btf_ext->data = malloc(size); in btf_ext__new()
2520 if (!btf_ext->data) { in btf_ext__new()
2521 err = -ENOMEM; in btf_ext__new()
2524 memcpy(btf_ext->data, data, size); in btf_ext__new()
2526 if (btf_ext->hdr->hdr_len < in btf_ext__new()
2537 if (btf_ext->hdr->hdr_len < offsetofend(struct btf_ext_header, core_relo_len)) in btf_ext__new()
2554 *size = btf_ext->data_size; in btf_ext__get_raw_data()
2555 return btf_ext->data; in btf_ext__get_raw_data()
2570 record_size = ext_info->rec_size; in btf_ext_reloc_info()
2571 sinfo = ext_info->info; in btf_ext_reloc_info()
2572 remain_len = ext_info->len; in btf_ext_reloc_info()
2574 records_len = sinfo->num_info * record_size; in btf_ext_reloc_info()
2575 info_sec_name = btf__name_by_offset(btf, sinfo->sec_name_off); in btf_ext_reloc_info()
2577 remain_len -= sec_hdrlen + records_len; in btf_ext_reloc_info()
2585 return -ENOMEM; in btf_ext_reloc_info()
2587 memcpy(data + existing_len, sinfo->data, records_len); in btf_ext_reloc_info()
2591 for (i = 0; i < sinfo->num_info; i++) { in btf_ext_reloc_info()
2599 *cnt += sinfo->num_info; in btf_ext_reloc_info()
2603 return -ENOENT; in btf_ext_reloc_info()
2611 return btf_ext_reloc_info(btf, &btf_ext->func_info, sec_name, in btf_ext__reloc_func_info()
2620 return btf_ext_reloc_info(btf, &btf_ext->line_info, sec_name, in btf_ext__reloc_line_info()
2626 return btf_ext->func_info.rec_size; in btf_ext__func_info_rec_size()
2631 return btf_ext->line_info.rec_size; in btf_ext__line_info_rec_size()
2651 * memory in-place with deduplicated types and strings without any loss of
2656 * If function returns with error, type/string data might be garbled and should
2661 * https://facebookmicrosites.github.io/bpf/blog/2018/11/14/btf-enhancement.html
2768 * `btf_dedup->map` array. This map is also used to record STRUCT/UNION that
2772 * index (`btf_dedup->dedup_table`), which maps type descriptor's signature hash
2775 * hashing function, we can limit number of canonical types for each unique type
2781 * `btf_dedup_is_equiv` function.
2791 return -EINVAL; in btf__dedup()
2795 return -ENOMEM; in btf__dedup()
2833 #define BTF_UNPROCESSED_ID ((__u32)-1)
2834 #define BTF_IN_PROGRESS_ID ((__u32)-2)
2837 /* .BTF section to be deduped in-place */
2882 hashmap__for_each_key_entry(d->dedup_table, node, (void *)hash)
2886 return hashmap__append(d->dedup_table, in btf_dedup_table_add()
2893 if (d->hypot_cnt == d->hypot_cap) { in btf_dedup_hypot_map_add()
2896 d->hypot_cap += max((size_t)16, d->hypot_cap / 2); in btf_dedup_hypot_map_add()
2897 new_list = libbpf_reallocarray(d->hypot_list, d->hypot_cap, sizeof(__u32)); in btf_dedup_hypot_map_add()
2899 return -ENOMEM; in btf_dedup_hypot_map_add()
2900 d->hypot_list = new_list; in btf_dedup_hypot_map_add()
2902 d->hypot_list[d->hypot_cnt++] = from_id; in btf_dedup_hypot_map_add()
2903 d->hypot_map[from_id] = to_id; in btf_dedup_hypot_map_add()
2911 for (i = 0; i < d->hypot_cnt; i++) in btf_dedup_clear_hypot_map()
2912 d->hypot_map[d->hypot_list[i]] = BTF_UNPROCESSED_ID; in btf_dedup_clear_hypot_map()
2913 d->hypot_cnt = 0; in btf_dedup_clear_hypot_map()
2918 hashmap__free(d->dedup_table); in btf_dedup_free()
2919 d->dedup_table = NULL; in btf_dedup_free()
2921 free(d->map); in btf_dedup_free()
2922 d->map = NULL; in btf_dedup_free()
2924 free(d->hypot_map); in btf_dedup_free()
2925 d->hypot_map = NULL; in btf_dedup_free()
2927 free(d->hypot_list); in btf_dedup_free()
2928 d->hypot_list = NULL; in btf_dedup_free()
2956 return ERR_PTR(-ENOMEM); in btf_dedup_new()
2958 d->opts.dont_resolve_fwds = opts && opts->dont_resolve_fwds; in btf_dedup_new()
2960 if (opts && opts->dedup_table_size == 1) in btf_dedup_new()
2963 d->btf = btf; in btf_dedup_new()
2964 d->btf_ext = btf_ext; in btf_dedup_new()
2966 d->dedup_table = hashmap__new(hash_fn, btf_dedup_equal_fn, NULL); in btf_dedup_new()
2967 if (IS_ERR(d->dedup_table)) { in btf_dedup_new()
2968 err = PTR_ERR(d->dedup_table); in btf_dedup_new()
2969 d->dedup_table = NULL; in btf_dedup_new()
2973 d->map = malloc(sizeof(__u32) * (1 + btf->nr_types)); in btf_dedup_new()
2974 if (!d->map) { in btf_dedup_new()
2975 err = -ENOMEM; in btf_dedup_new()
2979 d->map[0] = 0; in btf_dedup_new()
2980 for (i = 1; i <= btf->nr_types; i++) { in btf_dedup_new()
2981 struct btf_type *t = btf_type_by_id(d->btf, i); in btf_dedup_new()
2983 /* VAR and DATASEC are never deduped and are self-canonical */ in btf_dedup_new()
2985 d->map[i] = i; in btf_dedup_new()
2987 d->map[i] = BTF_UNPROCESSED_ID; in btf_dedup_new()
2990 d->hypot_map = malloc(sizeof(__u32) * (1 + btf->nr_types)); in btf_dedup_new()
2991 if (!d->hypot_map) { in btf_dedup_new()
2992 err = -ENOMEM; in btf_dedup_new()
2995 for (i = 0; i <= btf->nr_types; i++) in btf_dedup_new()
2996 d->hypot_map[i] = BTF_UNPROCESSED_ID; in btf_dedup_new()
3019 for (i = 1; i <= d->btf->nr_types; i++) { in btf_for_each_str_off()
3020 t = btf_type_by_id(d->btf, i); in btf_for_each_str_off()
3021 r = fn(&t->name_off, ctx); in btf_for_each_str_off()
3032 r = fn(&m->name_off, ctx); in btf_for_each_str_off()
3044 r = fn(&m->name_off, ctx); in btf_for_each_str_off()
3056 r = fn(&m->name_off, ctx); in btf_for_each_str_off()
3068 if (!d->btf_ext) in btf_for_each_str_off()
3071 line_data_cur = d->btf_ext->line_info.info; in btf_for_each_str_off()
3072 line_data_end = d->btf_ext->line_info.info + d->btf_ext->line_info.len; in btf_for_each_str_off()
3073 rec_size = d->btf_ext->line_info.rec_size; in btf_for_each_str_off()
3078 __u32 num_info = sec->num_info; in btf_for_each_str_off()
3080 r = fn(&sec->sec_name_off, ctx); in btf_for_each_str_off()
3087 r = fn(&line_info->file_name_off, ctx); in btf_for_each_str_off()
3090 r = fn(&line_info->line_off, ctx); in btf_for_each_str_off()
3105 return strcmp(p1->str, p2->str); in str_sort_by_content()
3113 if (p1->str != p2->str) in str_sort_by_offset()
3114 return p1->str < p2->str ? -1 : 1; in str_sort_by_offset()
3122 if (str_ptr != p->str) in btf_dedup_str_ptr_cmp()
3123 return (const char *)str_ptr < p->str ? -1 : 1; in btf_dedup_str_ptr_cmp()
3136 s = bsearch(strs->data + *str_off_ptr, strs->ptrs, strs->cnt, in btf_str_mark_as_used()
3139 return -EINVAL; in btf_str_mark_as_used()
3140 s->used = true; in btf_str_mark_as_used()
3153 s = bsearch(strs->data + *str_off_ptr, strs->ptrs, strs->cnt, in btf_str_remap_offset()
3156 return -EINVAL; in btf_str_remap_offset()
3157 *str_off_ptr = s->new_off; in btf_str_remap_offset()
3174 char *start = d->btf->strs_data; in btf_dedup_strings()
3175 char *end = start + d->btf->hdr->str_len; in btf_dedup_strings()
3186 if (d->btf->strs_deduped) in btf_dedup_strings()
3197 err = -ENOMEM; in btf_dedup_strings()
3211 tmp_strs = malloc(d->btf->hdr->str_len); in btf_dedup_strings()
3213 err = -ENOMEM; in btf_dedup_strings()
3252 int new_off = p - tmp_strs; in btf_dedup_strings()
3268 d->btf->hdr->str_len = p - tmp_strs; in btf_dedup_strings()
3269 memmove(start, tmp_strs, d->btf->hdr->str_len); in btf_dedup_strings()
3270 end = start + d->btf->hdr->str_len; in btf_dedup_strings()
3280 d->btf->hdr->str_len = end - start; in btf_dedup_strings()
3281 d->btf->strs_deduped = true; in btf_dedup_strings()
3293 h = hash_combine(0, t->name_off); in btf_hash_common()
3294 h = hash_combine(h, t->info); in btf_hash_common()
3295 h = hash_combine(h, t->size); in btf_hash_common()
3301 return t1->name_off == t2->name_off && in btf_equal_common()
3302 t1->info == t2->info && in btf_equal_common()
3303 t1->size == t2->size; in btf_equal_common()
3335 h = hash_combine(0, t->name_off); in btf_hash_enum()
3336 h = hash_combine(h, t->info & ~0xffff); in btf_hash_enum()
3337 h = hash_combine(h, t->size); in btf_hash_enum()
3355 if (m1->name_off != m2->name_off || m1->val != m2->val) in btf_equal_enum()
3373 return t1->name_off == t2->name_off && in btf_compat_enum()
3374 (t1->info & ~0xffff) == (t2->info & ~0xffff) && in btf_compat_enum()
3375 t1->size == t2->size; in btf_compat_enum()
3391 h = hash_combine(h, member->name_off); in btf_hash_struct()
3392 h = hash_combine(h, member->offset); in btf_hash_struct()
3417 if (m1->name_off != m2->name_off || m1->offset != m2->offset) in btf_shallow_equal_struct()
3435 h = hash_combine(h, info->type); in btf_hash_array()
3436 h = hash_combine(h, info->index_type); in btf_hash_array()
3437 h = hash_combine(h, info->nelems); in btf_hash_array()
3445 * This function is called during reference types deduplication to compare
3457 return info1->type == info2->type && in btf_equal_array()
3458 info1->index_type == info2->index_type && in btf_equal_array()
3459 info1->nelems == info2->nelems; in btf_equal_array()
3472 return btf_array(t1)->nelems == btf_array(t2)->nelems; in btf_compat_array()
3488 h = hash_combine(h, member->name_off); in btf_hash_fnproto()
3489 h = hash_combine(h, member->type); in btf_hash_fnproto()
3499 * This function is called during reference types deduplication to compare
3515 if (m1->name_off != m2->name_off || m1->type != m2->type) in btf_equal_fnproto()
3535 if (t1->name_off != t2->name_off || t1->info != t2->info) in btf_compat_fnproto()
3542 if (m1->name_off != m2->name_off) in btf_compat_fnproto()
3554 * canonical and is added into `btf_dedup->dedup_table` as another candidate.
3558 struct btf_type *t = btf_type_by_id(d->btf, type_id); in btf_dedup_prim_type()
3584 cand_id = (__u32)(long)hash_entry->value; in btf_dedup_prim_type()
3585 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_prim_type()
3596 cand_id = (__u32)(long)hash_entry->value; in btf_dedup_prim_type()
3597 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_prim_type()
3602 if (d->opts.dont_resolve_fwds) in btf_dedup_prim_type()
3611 d->map[cand_id] = type_id; in btf_dedup_prim_type()
3619 cand_id = (__u32)(long)hash_entry->value; in btf_dedup_prim_type()
3620 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_prim_type()
3629 return -EINVAL; in btf_dedup_prim_type()
3632 d->map[type_id] = new_id; in btf_dedup_prim_type()
3634 return -ENOMEM; in btf_dedup_prim_type()
3643 for (i = 1; i <= d->btf->nr_types; i++) { in btf_dedup_prim_types()
3656 return d->map[type_id] <= BTF_MAX_NR_TYPES; in is_type_mapped()
3666 while (is_type_mapped(d, type_id) && d->map[type_id] != type_id) in resolve_type_id()
3667 type_id = d->map[type_id]; in resolve_type_id()
3679 if (!btf_is_fwd(btf__type_by_id(d->btf, type_id))) in resolve_fwd_id()
3682 while (is_type_mapped(d, type_id) && d->map[type_id] != type_id) in resolve_fwd_id()
3683 type_id = d->map[type_id]; in resolve_fwd_id()
3685 if (!btf_is_fwd(btf__type_by_id(d->btf, type_id))) in resolve_fwd_id()
3705 * - >0, if type graphs are equivalent;
3706 * - 0, if not equivalent;
3707 * - <0, on error.
3709 * Algorithm performs side-by-side DFS traversal of both type graphs and checks
3714 * a `cand_id` is recored in hypothetical mapping (`btf_dedup->hypot_map`).
3721 * - `canon_id` is mapped to exactly the same type as `cand_id`. This will
3724 * - `canon_id` is mapped to different type. This is contradiction in our
3738 * this mapping will be used to record FWD -> STRUCT/UNION mapping permanently.
3763 * map. To handle this problem, we allow to follow FWD -> STRUCT/UNION
3767 * - Both types in canonical and candidate graphs are FWDs. If they are
3771 * - Both types in canonical and candidate graphs are concrete STRUCT/UNION,
3773 * - Type in canonical graph is FWD, while type in candidate is concrete
3782 * - Type in canonical graph is concrete STRUCT/UNION, while type in candidate
3787 * turn out equivalent, we'll re-resolve FWD to concrete STRUCT/UNION from
3806 hypot_type_id = d->hypot_map[canon_id]; in btf_dedup_is_equiv()
3811 return -ENOMEM; in btf_dedup_is_equiv()
3813 cand_type = btf_type_by_id(d->btf, cand_id); in btf_dedup_is_equiv()
3814 canon_type = btf_type_by_id(d->btf, canon_id); in btf_dedup_is_equiv()
3818 if (cand_type->name_off != canon_type->name_off) in btf_dedup_is_equiv()
3821 /* FWD <--> STRUCT/UNION equivalence check, if enabled */ in btf_dedup_is_equiv()
3822 if (!d->opts.dont_resolve_fwds in btf_dedup_is_equiv()
3846 if (d->opts.dont_resolve_fwds) in btf_dedup_is_equiv()
3860 if (cand_type->info != canon_type->info) in btf_dedup_is_equiv()
3862 return btf_dedup_is_equiv(d, cand_type->type, canon_type->type); in btf_dedup_is_equiv()
3872 cand_arr->index_type, canon_arr->index_type); in btf_dedup_is_equiv()
3875 return btf_dedup_is_equiv(d, cand_arr->type, canon_arr->type); in btf_dedup_is_equiv()
3889 eq = btf_dedup_is_equiv(d, cand_m->type, canon_m->type); in btf_dedup_is_equiv()
3905 eq = btf_dedup_is_equiv(d, cand_type->type, canon_type->type); in btf_dedup_is_equiv()
3912 eq = btf_dedup_is_equiv(d, cand_p->type, canon_p->type); in btf_dedup_is_equiv()
3922 return -EINVAL; in btf_dedup_is_equiv()
3932 * FWD -> STRUCT/UNION correspondence as well. FWD resolution is bidirectional:
3960 for (i = 0; i < d->hypot_cnt; i++) { in btf_dedup_merge_hypot_map()
3961 cand_type_id = d->hypot_list[i]; in btf_dedup_merge_hypot_map()
3962 targ_type_id = d->hypot_map[cand_type_id]; in btf_dedup_merge_hypot_map()
3965 t_kind = btf_kind(btf__type_by_id(d->btf, t_id)); in btf_dedup_merge_hypot_map()
3966 c_kind = btf_kind(btf__type_by_id(d->btf, c_id)); in btf_dedup_merge_hypot_map()
3971 * STRUCT/UNION <--> STRUCT/UNION mapping logic below), because in btf_dedup_merge_hypot_map()
3980 d->map[c_id] = t_id; in btf_dedup_merge_hypot_map()
3982 d->map[t_id] = c_id; in btf_dedup_merge_hypot_map()
3994 d->map[t_id] = c_id; in btf_dedup_merge_hypot_map()
4011 * (btf_dedup->hypot_map) produced by aforementioned type graph equivalence
4012 * algorithm is used to record FWD -> STRUCT/UNION mapping. It's also used to
4018 * as canonical for itself and is added into btf_dedup->dedup_table hash map
4031 if (d->map[type_id] <= BTF_MAX_NR_TYPES) in btf_dedup_struct_type()
4034 t = btf_type_by_id(d->btf, type_id); in btf_dedup_struct_type()
4042 __u32 cand_id = (__u32)(long)hash_entry->value; in btf_dedup_struct_type()
4052 * creating a loop (FWD -> STRUCT and STRUCT -> FWD), because in btf_dedup_struct_type()
4055 cand_type = btf_type_by_id(d->btf, cand_id); in btf_dedup_struct_type()
4070 d->map[type_id] = new_id; in btf_dedup_struct_type()
4072 return -ENOMEM; in btf_dedup_struct_type()
4081 for (i = 1; i <= d->btf->nr_types; i++) { in btf_dedup_struct_types()
4111 * btf_dedup->dedup_table as another possible canonical representative.
4122 if (d->map[type_id] == BTF_IN_PROGRESS_ID) in btf_dedup_ref_type()
4123 return -ELOOP; in btf_dedup_ref_type()
4124 if (d->map[type_id] <= BTF_MAX_NR_TYPES) in btf_dedup_ref_type()
4127 t = btf_type_by_id(d->btf, type_id); in btf_dedup_ref_type()
4128 d->map[type_id] = BTF_IN_PROGRESS_ID; in btf_dedup_ref_type()
4137 ref_type_id = btf_dedup_ref_type(d, t->type); in btf_dedup_ref_type()
4140 t->type = ref_type_id; in btf_dedup_ref_type()
4144 cand_id = (__u32)(long)hash_entry->value; in btf_dedup_ref_type()
4145 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_ref_type()
4156 ref_type_id = btf_dedup_ref_type(d, info->type); in btf_dedup_ref_type()
4159 info->type = ref_type_id; in btf_dedup_ref_type()
4161 ref_type_id = btf_dedup_ref_type(d, info->index_type); in btf_dedup_ref_type()
4164 info->index_type = ref_type_id; in btf_dedup_ref_type()
4168 cand_id = (__u32)(long)hash_entry->value; in btf_dedup_ref_type()
4169 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_ref_type()
4183 ref_type_id = btf_dedup_ref_type(d, t->type); in btf_dedup_ref_type()
4186 t->type = ref_type_id; in btf_dedup_ref_type()
4191 ref_type_id = btf_dedup_ref_type(d, param->type); in btf_dedup_ref_type()
4194 param->type = ref_type_id; in btf_dedup_ref_type()
4200 cand_id = (__u32)(long)hash_entry->value; in btf_dedup_ref_type()
4201 cand = btf_type_by_id(d->btf, cand_id); in btf_dedup_ref_type()
4211 return -EINVAL; in btf_dedup_ref_type()
4214 d->map[type_id] = new_id; in btf_dedup_ref_type()
4216 return -ENOMEM; in btf_dedup_ref_type()
4225 for (i = 1; i <= d->btf->nr_types; i++) { in btf_dedup_ref_types()
4230 /* we won't need d->dedup_table anymore */ in btf_dedup_ref_types()
4231 hashmap__free(d->dedup_table); in btf_dedup_ref_types()
4232 d->dedup_table = NULL; in btf_dedup_ref_types()
4242 * duplicates. During compaction btf_dedup->hypot_map array is reused to store
4255 d->hypot_map[0] = 0; in btf_dedup_compact_types()
4256 for (i = 1; i <= d->btf->nr_types; i++) in btf_dedup_compact_types()
4257 d->hypot_map[i] = BTF_UNPROCESSED_ID; in btf_dedup_compact_types()
4259 p = d->btf->types_data; in btf_dedup_compact_types()
4261 for (i = 1; i <= d->btf->nr_types; i++) { in btf_dedup_compact_types()
4262 if (d->map[i] != i) in btf_dedup_compact_types()
4265 len = btf_type_size(btf__type_by_id(d->btf, i)); in btf_dedup_compact_types()
4269 memmove(p, btf__type_by_id(d->btf, i), len); in btf_dedup_compact_types()
4270 d->hypot_map[i] = next_type_id; in btf_dedup_compact_types()
4271 d->btf->type_offs[next_type_id] = p - d->btf->types_data; in btf_dedup_compact_types()
4277 d->btf->nr_types = next_type_id - 1; in btf_dedup_compact_types()
4278 d->btf->type_offs_cap = d->btf->nr_types + 1; in btf_dedup_compact_types()
4279 d->btf->hdr->type_len = p - d->btf->types_data; in btf_dedup_compact_types()
4280 new_offs = libbpf_reallocarray(d->btf->type_offs, d->btf->type_offs_cap, in btf_dedup_compact_types()
4283 return -ENOMEM; in btf_dedup_compact_types()
4284 d->btf->type_offs = new_offs; in btf_dedup_compact_types()
4285 d->btf->hdr->str_off = d->btf->hdr->type_len; in btf_dedup_compact_types()
4286 d->btf->raw_size = d->btf->hdr->hdr_len + d->btf->hdr->type_len + d->btf->hdr->str_len; in btf_dedup_compact_types()
4293 * then mapping it to a deduplicated type ID, stored in btf_dedup->hypot_map,
4301 new_type_id = d->hypot_map[resolved_type_id]; in btf_dedup_remap_type_id()
4303 return -EINVAL; in btf_dedup_remap_type_id()
4312 * deduped type ID is stored in btf_dedup->hypot_map and is populated during
4319 struct btf_type *t = btf_type_by_id(d->btf, type_id); in btf_dedup_remap_type()
4335 r = btf_dedup_remap_type_id(d, t->type); in btf_dedup_remap_type()
4338 t->type = r; in btf_dedup_remap_type()
4344 r = btf_dedup_remap_type_id(d, arr_info->type); in btf_dedup_remap_type()
4347 arr_info->type = r; in btf_dedup_remap_type()
4348 r = btf_dedup_remap_type_id(d, arr_info->index_type); in btf_dedup_remap_type()
4351 arr_info->index_type = r; in btf_dedup_remap_type()
4361 r = btf_dedup_remap_type_id(d, member->type); in btf_dedup_remap_type()
4364 member->type = r; in btf_dedup_remap_type()
4374 r = btf_dedup_remap_type_id(d, t->type); in btf_dedup_remap_type()
4377 t->type = r; in btf_dedup_remap_type()
4380 r = btf_dedup_remap_type_id(d, param->type); in btf_dedup_remap_type()
4383 param->type = r; in btf_dedup_remap_type()
4394 r = btf_dedup_remap_type_id(d, var->type); in btf_dedup_remap_type()
4397 var->type = r; in btf_dedup_remap_type()
4404 return -EINVAL; in btf_dedup_remap_type()
4414 for (i = 1; i <= d->btf->nr_types; i++) { in btf_dedup_remap_types()
4423 * Probe few well-known locations for vmlinux kernel image and try to load BTF
4435 { "/boot/vmlinux-%1$s" }, in libbpf_find_kernel_btf()
4436 { "/lib/modules/%1$s/vmlinux-%1$s" }, in libbpf_find_kernel_btf()
4439 { "/usr/lib/debug/boot/vmlinux-%1$s" }, in libbpf_find_kernel_btf()
4440 { "/usr/lib/debug/boot/vmlinux-%1$s.debug" }, in libbpf_find_kernel_btf()
4470 return ERR_PTR(-ESRCH); in libbpf_find_kernel_btf()