mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-22 08:39:31 +07:00
96408c4344
Currently, to get map key/value type id's, the macro BPF_ANNOTATE_KV_PAIR(<map_name>, <key_type>, <value_type>) needs to be defined in the bpf program for the corresponding map. During program/map loading time, the local static function bpf_map_find_btf_info() in libbpf.c is implemented to retrieve the key/value type ids given the map name. The patch refactored function bpf_map_find_btf_info() to create an API btf__get_map_kv_tids() which includes the bulk of implementation for the original function. The API btf__get_map_kv_tids() can be used by bcc, a JIT based bpf compilation system, which uses the same BPF_ANNOTATE_KV_PAIR to record map key/value types. Acked-by: Martin KaFai Lau <kafai@fb.com> Signed-off-by: Yonghong Song <yhs@fb.com> Signed-off-by: Alexei Starovoitov <ast@kernel.org>
858 lines
19 KiB
C
858 lines
19 KiB
C
// SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause)
|
|
/* Copyright (c) 2018 Facebook */
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
#include <errno.h>
|
|
#include <linux/err.h>
|
|
#include <linux/btf.h>
|
|
#include "btf.h"
|
|
#include "bpf.h"
|
|
#include "libbpf.h"
|
|
#include "libbpf_util.h"
|
|
|
|
#define max(a, b) ((a) > (b) ? (a) : (b))
|
|
#define min(a, b) ((a) < (b) ? (a) : (b))
|
|
|
|
#define BTF_MAX_NR_TYPES 65535
|
|
|
|
#define IS_MODIFIER(k) (((k) == BTF_KIND_TYPEDEF) || \
|
|
((k) == BTF_KIND_VOLATILE) || \
|
|
((k) == BTF_KIND_CONST) || \
|
|
((k) == BTF_KIND_RESTRICT))
|
|
|
|
static struct btf_type btf_void;
|
|
|
|
struct btf {
|
|
union {
|
|
struct btf_header *hdr;
|
|
void *data;
|
|
};
|
|
struct btf_type **types;
|
|
const char *strings;
|
|
void *nohdr_data;
|
|
__u32 nr_types;
|
|
__u32 types_size;
|
|
__u32 data_size;
|
|
int fd;
|
|
};
|
|
|
|
struct btf_ext_info {
|
|
/*
|
|
* info points to a deep copy of the individual info section
|
|
* (e.g. func_info and line_info) from the .BTF.ext.
|
|
* It does not include the __u32 rec_size.
|
|
*/
|
|
void *info;
|
|
__u32 rec_size;
|
|
__u32 len;
|
|
};
|
|
|
|
struct btf_ext {
|
|
struct btf_ext_info func_info;
|
|
struct btf_ext_info line_info;
|
|
};
|
|
|
|
struct btf_ext_info_sec {
|
|
__u32 sec_name_off;
|
|
__u32 num_info;
|
|
/* Followed by num_info * record_size number of bytes */
|
|
__u8 data[0];
|
|
};
|
|
|
|
/* The minimum bpf_func_info checked by the loader */
|
|
struct bpf_func_info_min {
|
|
__u32 insn_off;
|
|
__u32 type_id;
|
|
};
|
|
|
|
/* The minimum bpf_line_info checked by the loader */
|
|
struct bpf_line_info_min {
|
|
__u32 insn_off;
|
|
__u32 file_name_off;
|
|
__u32 line_off;
|
|
__u32 line_col;
|
|
};
|
|
|
|
static inline __u64 ptr_to_u64(const void *ptr)
|
|
{
|
|
return (__u64) (unsigned long) ptr;
|
|
}
|
|
|
|
static int btf_add_type(struct btf *btf, struct btf_type *t)
|
|
{
|
|
if (btf->types_size - btf->nr_types < 2) {
|
|
struct btf_type **new_types;
|
|
__u32 expand_by, new_size;
|
|
|
|
if (btf->types_size == BTF_MAX_NR_TYPES)
|
|
return -E2BIG;
|
|
|
|
expand_by = max(btf->types_size >> 2, 16);
|
|
new_size = min(BTF_MAX_NR_TYPES, btf->types_size + expand_by);
|
|
|
|
new_types = realloc(btf->types, sizeof(*new_types) * new_size);
|
|
if (!new_types)
|
|
return -ENOMEM;
|
|
|
|
if (btf->nr_types == 0)
|
|
new_types[0] = &btf_void;
|
|
|
|
btf->types = new_types;
|
|
btf->types_size = new_size;
|
|
}
|
|
|
|
btf->types[++(btf->nr_types)] = t;
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int btf_parse_hdr(struct btf *btf)
|
|
{
|
|
const struct btf_header *hdr = btf->hdr;
|
|
__u32 meta_left;
|
|
|
|
if (btf->data_size < sizeof(struct btf_header)) {
|
|
pr_debug("BTF header not found\n");
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (hdr->magic != BTF_MAGIC) {
|
|
pr_debug("Invalid BTF magic:%x\n", hdr->magic);
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (hdr->version != BTF_VERSION) {
|
|
pr_debug("Unsupported BTF version:%u\n", hdr->version);
|
|
return -ENOTSUP;
|
|
}
|
|
|
|
if (hdr->flags) {
|
|
pr_debug("Unsupported BTF flags:%x\n", hdr->flags);
|
|
return -ENOTSUP;
|
|
}
|
|
|
|
meta_left = btf->data_size - sizeof(*hdr);
|
|
if (!meta_left) {
|
|
pr_debug("BTF has no data\n");
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (meta_left < hdr->type_off) {
|
|
pr_debug("Invalid BTF type section offset:%u\n", hdr->type_off);
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (meta_left < hdr->str_off) {
|
|
pr_debug("Invalid BTF string section offset:%u\n", hdr->str_off);
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (hdr->type_off >= hdr->str_off) {
|
|
pr_debug("BTF type section offset >= string section offset. No type?\n");
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (hdr->type_off & 0x02) {
|
|
pr_debug("BTF type section is not aligned to 4 bytes\n");
|
|
return -EINVAL;
|
|
}
|
|
|
|
btf->nohdr_data = btf->hdr + 1;
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int btf_parse_str_sec(struct btf *btf)
|
|
{
|
|
const struct btf_header *hdr = btf->hdr;
|
|
const char *start = btf->nohdr_data + hdr->str_off;
|
|
const char *end = start + btf->hdr->str_len;
|
|
|
|
if (!hdr->str_len || hdr->str_len - 1 > BTF_MAX_NAME_OFFSET ||
|
|
start[0] || end[-1]) {
|
|
pr_debug("Invalid BTF string section\n");
|
|
return -EINVAL;
|
|
}
|
|
|
|
btf->strings = start;
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int btf_parse_type_sec(struct btf *btf)
|
|
{
|
|
struct btf_header *hdr = btf->hdr;
|
|
void *nohdr_data = btf->nohdr_data;
|
|
void *next_type = nohdr_data + hdr->type_off;
|
|
void *end_type = nohdr_data + hdr->str_off;
|
|
|
|
while (next_type < end_type) {
|
|
struct btf_type *t = next_type;
|
|
__u16 vlen = BTF_INFO_VLEN(t->info);
|
|
int err;
|
|
|
|
next_type += sizeof(*t);
|
|
switch (BTF_INFO_KIND(t->info)) {
|
|
case BTF_KIND_INT:
|
|
next_type += sizeof(int);
|
|
break;
|
|
case BTF_KIND_ARRAY:
|
|
next_type += sizeof(struct btf_array);
|
|
break;
|
|
case BTF_KIND_STRUCT:
|
|
case BTF_KIND_UNION:
|
|
next_type += vlen * sizeof(struct btf_member);
|
|
break;
|
|
case BTF_KIND_ENUM:
|
|
next_type += vlen * sizeof(struct btf_enum);
|
|
break;
|
|
case BTF_KIND_FUNC_PROTO:
|
|
next_type += vlen * sizeof(struct btf_param);
|
|
break;
|
|
case BTF_KIND_FUNC:
|
|
case BTF_KIND_TYPEDEF:
|
|
case BTF_KIND_PTR:
|
|
case BTF_KIND_FWD:
|
|
case BTF_KIND_VOLATILE:
|
|
case BTF_KIND_CONST:
|
|
case BTF_KIND_RESTRICT:
|
|
break;
|
|
default:
|
|
pr_debug("Unsupported BTF_KIND:%u\n",
|
|
BTF_INFO_KIND(t->info));
|
|
return -EINVAL;
|
|
}
|
|
|
|
err = btf_add_type(btf, t);
|
|
if (err)
|
|
return err;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
const struct btf_type *btf__type_by_id(const struct btf *btf, __u32 type_id)
|
|
{
|
|
if (type_id > btf->nr_types)
|
|
return NULL;
|
|
|
|
return btf->types[type_id];
|
|
}
|
|
|
|
static bool btf_type_is_void(const struct btf_type *t)
|
|
{
|
|
return t == &btf_void || BTF_INFO_KIND(t->info) == BTF_KIND_FWD;
|
|
}
|
|
|
|
static bool btf_type_is_void_or_null(const struct btf_type *t)
|
|
{
|
|
return !t || btf_type_is_void(t);
|
|
}
|
|
|
|
static __s64 btf_type_size(const struct btf_type *t)
|
|
{
|
|
switch (BTF_INFO_KIND(t->info)) {
|
|
case BTF_KIND_INT:
|
|
case BTF_KIND_STRUCT:
|
|
case BTF_KIND_UNION:
|
|
case BTF_KIND_ENUM:
|
|
return t->size;
|
|
case BTF_KIND_PTR:
|
|
return sizeof(void *);
|
|
default:
|
|
return -EINVAL;
|
|
}
|
|
}
|
|
|
|
#define MAX_RESOLVE_DEPTH 32
|
|
|
|
__s64 btf__resolve_size(const struct btf *btf, __u32 type_id)
|
|
{
|
|
const struct btf_array *array;
|
|
const struct btf_type *t;
|
|
__u32 nelems = 1;
|
|
__s64 size = -1;
|
|
int i;
|
|
|
|
t = btf__type_by_id(btf, type_id);
|
|
for (i = 0; i < MAX_RESOLVE_DEPTH && !btf_type_is_void_or_null(t);
|
|
i++) {
|
|
size = btf_type_size(t);
|
|
if (size >= 0)
|
|
break;
|
|
|
|
switch (BTF_INFO_KIND(t->info)) {
|
|
case BTF_KIND_TYPEDEF:
|
|
case BTF_KIND_VOLATILE:
|
|
case BTF_KIND_CONST:
|
|
case BTF_KIND_RESTRICT:
|
|
type_id = t->type;
|
|
break;
|
|
case BTF_KIND_ARRAY:
|
|
array = (const struct btf_array *)(t + 1);
|
|
if (nelems && array->nelems > UINT32_MAX / nelems)
|
|
return -E2BIG;
|
|
nelems *= array->nelems;
|
|
type_id = array->type;
|
|
break;
|
|
default:
|
|
return -EINVAL;
|
|
}
|
|
|
|
t = btf__type_by_id(btf, type_id);
|
|
}
|
|
|
|
if (size < 0)
|
|
return -EINVAL;
|
|
|
|
if (nelems && size > UINT32_MAX / nelems)
|
|
return -E2BIG;
|
|
|
|
return nelems * size;
|
|
}
|
|
|
|
int btf__resolve_type(const struct btf *btf, __u32 type_id)
|
|
{
|
|
const struct btf_type *t;
|
|
int depth = 0;
|
|
|
|
t = btf__type_by_id(btf, type_id);
|
|
while (depth < MAX_RESOLVE_DEPTH &&
|
|
!btf_type_is_void_or_null(t) &&
|
|
IS_MODIFIER(BTF_INFO_KIND(t->info))) {
|
|
type_id = t->type;
|
|
t = btf__type_by_id(btf, type_id);
|
|
depth++;
|
|
}
|
|
|
|
if (depth == MAX_RESOLVE_DEPTH || btf_type_is_void_or_null(t))
|
|
return -EINVAL;
|
|
|
|
return type_id;
|
|
}
|
|
|
|
__s32 btf__find_by_name(const struct btf *btf, const char *type_name)
|
|
{
|
|
__u32 i;
|
|
|
|
if (!strcmp(type_name, "void"))
|
|
return 0;
|
|
|
|
for (i = 1; i <= btf->nr_types; i++) {
|
|
const struct btf_type *t = btf->types[i];
|
|
const char *name = btf__name_by_offset(btf, t->name_off);
|
|
|
|
if (name && !strcmp(type_name, name))
|
|
return i;
|
|
}
|
|
|
|
return -ENOENT;
|
|
}
|
|
|
|
void btf__free(struct btf *btf)
|
|
{
|
|
if (!btf)
|
|
return;
|
|
|
|
if (btf->fd != -1)
|
|
close(btf->fd);
|
|
|
|
free(btf->data);
|
|
free(btf->types);
|
|
free(btf);
|
|
}
|
|
|
|
struct btf *btf__new(__u8 *data, __u32 size)
|
|
{
|
|
__u32 log_buf_size = 0;
|
|
char *log_buf = NULL;
|
|
struct btf *btf;
|
|
int err;
|
|
|
|
btf = calloc(1, sizeof(struct btf));
|
|
if (!btf)
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
btf->fd = -1;
|
|
|
|
log_buf = malloc(BPF_LOG_BUF_SIZE);
|
|
if (!log_buf) {
|
|
err = -ENOMEM;
|
|
goto done;
|
|
}
|
|
|
|
*log_buf = 0;
|
|
log_buf_size = BPF_LOG_BUF_SIZE;
|
|
|
|
btf->data = malloc(size);
|
|
if (!btf->data) {
|
|
err = -ENOMEM;
|
|
goto done;
|
|
}
|
|
|
|
memcpy(btf->data, data, size);
|
|
btf->data_size = size;
|
|
|
|
btf->fd = bpf_load_btf(btf->data, btf->data_size,
|
|
log_buf, log_buf_size, false);
|
|
|
|
if (btf->fd == -1) {
|
|
err = -errno;
|
|
pr_warning("Error loading BTF: %s(%d)\n", strerror(errno), errno);
|
|
if (log_buf && *log_buf)
|
|
pr_warning("%s\n", log_buf);
|
|
goto done;
|
|
}
|
|
|
|
err = btf_parse_hdr(btf);
|
|
if (err)
|
|
goto done;
|
|
|
|
err = btf_parse_str_sec(btf);
|
|
if (err)
|
|
goto done;
|
|
|
|
err = btf_parse_type_sec(btf);
|
|
|
|
done:
|
|
free(log_buf);
|
|
|
|
if (err) {
|
|
btf__free(btf);
|
|
return ERR_PTR(err);
|
|
}
|
|
|
|
return btf;
|
|
}
|
|
|
|
int btf__fd(const struct btf *btf)
|
|
{
|
|
return btf->fd;
|
|
}
|
|
|
|
const char *btf__name_by_offset(const struct btf *btf, __u32 offset)
|
|
{
|
|
if (offset < btf->hdr->str_len)
|
|
return &btf->strings[offset];
|
|
else
|
|
return NULL;
|
|
}
|
|
|
|
int btf__get_from_id(__u32 id, struct btf **btf)
|
|
{
|
|
struct bpf_btf_info btf_info = { 0 };
|
|
__u32 len = sizeof(btf_info);
|
|
__u32 last_size;
|
|
int btf_fd;
|
|
void *ptr;
|
|
int err;
|
|
|
|
err = 0;
|
|
*btf = NULL;
|
|
btf_fd = bpf_btf_get_fd_by_id(id);
|
|
if (btf_fd < 0)
|
|
return 0;
|
|
|
|
/* we won't know btf_size until we call bpf_obj_get_info_by_fd(). so
|
|
* let's start with a sane default - 4KiB here - and resize it only if
|
|
* bpf_obj_get_info_by_fd() needs a bigger buffer.
|
|
*/
|
|
btf_info.btf_size = 4096;
|
|
last_size = btf_info.btf_size;
|
|
ptr = malloc(last_size);
|
|
if (!ptr) {
|
|
err = -ENOMEM;
|
|
goto exit_free;
|
|
}
|
|
|
|
bzero(ptr, last_size);
|
|
btf_info.btf = ptr_to_u64(ptr);
|
|
err = bpf_obj_get_info_by_fd(btf_fd, &btf_info, &len);
|
|
|
|
if (!err && btf_info.btf_size > last_size) {
|
|
void *temp_ptr;
|
|
|
|
last_size = btf_info.btf_size;
|
|
temp_ptr = realloc(ptr, last_size);
|
|
if (!temp_ptr) {
|
|
err = -ENOMEM;
|
|
goto exit_free;
|
|
}
|
|
ptr = temp_ptr;
|
|
bzero(ptr, last_size);
|
|
btf_info.btf = ptr_to_u64(ptr);
|
|
err = bpf_obj_get_info_by_fd(btf_fd, &btf_info, &len);
|
|
}
|
|
|
|
if (err || btf_info.btf_size > last_size) {
|
|
err = errno;
|
|
goto exit_free;
|
|
}
|
|
|
|
*btf = btf__new((__u8 *)(long)btf_info.btf, btf_info.btf_size);
|
|
if (IS_ERR(*btf)) {
|
|
err = PTR_ERR(*btf);
|
|
*btf = NULL;
|
|
}
|
|
|
|
exit_free:
|
|
close(btf_fd);
|
|
free(ptr);
|
|
|
|
return err;
|
|
}
|
|
|
|
int btf__get_map_kv_tids(const struct btf *btf, char *map_name,
|
|
__u32 expected_key_size, __u32 expected_value_size,
|
|
__u32 *key_type_id, __u32 *value_type_id)
|
|
{
|
|
const struct btf_type *container_type;
|
|
const struct btf_member *key, *value;
|
|
const size_t max_name = 256;
|
|
char container_name[max_name];
|
|
__s64 key_size, value_size;
|
|
__s32 container_id;
|
|
|
|
if (snprintf(container_name, max_name, "____btf_map_%s", map_name) ==
|
|
max_name) {
|
|
pr_warning("map:%s length of '____btf_map_%s' is too long\n",
|
|
map_name, map_name);
|
|
return -EINVAL;
|
|
}
|
|
|
|
container_id = btf__find_by_name(btf, container_name);
|
|
if (container_id < 0) {
|
|
pr_warning("map:%s container_name:%s cannot be found in BTF. Missing BPF_ANNOTATE_KV_PAIR?\n",
|
|
map_name, container_name);
|
|
return container_id;
|
|
}
|
|
|
|
container_type = btf__type_by_id(btf, container_id);
|
|
if (!container_type) {
|
|
pr_warning("map:%s cannot find BTF type for container_id:%u\n",
|
|
map_name, container_id);
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (BTF_INFO_KIND(container_type->info) != BTF_KIND_STRUCT ||
|
|
BTF_INFO_VLEN(container_type->info) < 2) {
|
|
pr_warning("map:%s container_name:%s is an invalid container struct\n",
|
|
map_name, container_name);
|
|
return -EINVAL;
|
|
}
|
|
|
|
key = (struct btf_member *)(container_type + 1);
|
|
value = key + 1;
|
|
|
|
key_size = btf__resolve_size(btf, key->type);
|
|
if (key_size < 0) {
|
|
pr_warning("map:%s invalid BTF key_type_size\n", map_name);
|
|
return key_size;
|
|
}
|
|
|
|
if (expected_key_size != key_size) {
|
|
pr_warning("map:%s btf_key_type_size:%u != map_def_key_size:%u\n",
|
|
map_name, (__u32)key_size, expected_key_size);
|
|
return -EINVAL;
|
|
}
|
|
|
|
value_size = btf__resolve_size(btf, value->type);
|
|
if (value_size < 0) {
|
|
pr_warning("map:%s invalid BTF value_type_size\n", map_name);
|
|
return value_size;
|
|
}
|
|
|
|
if (expected_value_size != value_size) {
|
|
pr_warning("map:%s btf_value_type_size:%u != map_def_value_size:%u\n",
|
|
map_name, (__u32)value_size, expected_value_size);
|
|
return -EINVAL;
|
|
}
|
|
|
|
*key_type_id = key->type;
|
|
*value_type_id = value->type;
|
|
|
|
return 0;
|
|
}
|
|
|
|
struct btf_ext_sec_copy_param {
|
|
__u32 off;
|
|
__u32 len;
|
|
__u32 min_rec_size;
|
|
struct btf_ext_info *ext_info;
|
|
const char *desc;
|
|
};
|
|
|
|
static int btf_ext_copy_info(struct btf_ext *btf_ext,
|
|
__u8 *data, __u32 data_size,
|
|
struct btf_ext_sec_copy_param *ext_sec)
|
|
{
|
|
const struct btf_ext_header *hdr = (struct btf_ext_header *)data;
|
|
const struct btf_ext_info_sec *sinfo;
|
|
struct btf_ext_info *ext_info;
|
|
__u32 info_left, record_size;
|
|
/* The start of the info sec (including the __u32 record_size). */
|
|
const void *info;
|
|
|
|
/* data and data_size do not include btf_ext_header from now on */
|
|
data = data + hdr->hdr_len;
|
|
data_size -= hdr->hdr_len;
|
|
|
|
if (ext_sec->off & 0x03) {
|
|
pr_debug(".BTF.ext %s section is not aligned to 4 bytes\n",
|
|
ext_sec->desc);
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (data_size < ext_sec->off ||
|
|
ext_sec->len > data_size - ext_sec->off) {
|
|
pr_debug("%s section (off:%u len:%u) is beyond the end of the ELF section .BTF.ext\n",
|
|
ext_sec->desc, ext_sec->off, ext_sec->len);
|
|
return -EINVAL;
|
|
}
|
|
|
|
info = data + ext_sec->off;
|
|
info_left = ext_sec->len;
|
|
|
|
/* At least a record size */
|
|
if (info_left < sizeof(__u32)) {
|
|
pr_debug(".BTF.ext %s record size not found\n", ext_sec->desc);
|
|
return -EINVAL;
|
|
}
|
|
|
|
/* The record size needs to meet the minimum standard */
|
|
record_size = *(__u32 *)info;
|
|
if (record_size < ext_sec->min_rec_size ||
|
|
record_size & 0x03) {
|
|
pr_debug("%s section in .BTF.ext has invalid record size %u\n",
|
|
ext_sec->desc, record_size);
|
|
return -EINVAL;
|
|
}
|
|
|
|
sinfo = info + sizeof(__u32);
|
|
info_left -= sizeof(__u32);
|
|
|
|
/* If no records, return failure now so .BTF.ext won't be used. */
|
|
if (!info_left) {
|
|
pr_debug("%s section in .BTF.ext has no records", ext_sec->desc);
|
|
return -EINVAL;
|
|
}
|
|
|
|
while (info_left) {
|
|
unsigned int sec_hdrlen = sizeof(struct btf_ext_info_sec);
|
|
__u64 total_record_size;
|
|
__u32 num_records;
|
|
|
|
if (info_left < sec_hdrlen) {
|
|
pr_debug("%s section header is not found in .BTF.ext\n",
|
|
ext_sec->desc);
|
|
return -EINVAL;
|
|
}
|
|
|
|
num_records = sinfo->num_info;
|
|
if (num_records == 0) {
|
|
pr_debug("%s section has incorrect num_records in .BTF.ext\n",
|
|
ext_sec->desc);
|
|
return -EINVAL;
|
|
}
|
|
|
|
total_record_size = sec_hdrlen +
|
|
(__u64)num_records * record_size;
|
|
if (info_left < total_record_size) {
|
|
pr_debug("%s section has incorrect num_records in .BTF.ext\n",
|
|
ext_sec->desc);
|
|
return -EINVAL;
|
|
}
|
|
|
|
info_left -= total_record_size;
|
|
sinfo = (void *)sinfo + total_record_size;
|
|
}
|
|
|
|
ext_info = ext_sec->ext_info;
|
|
ext_info->len = ext_sec->len - sizeof(__u32);
|
|
ext_info->rec_size = record_size;
|
|
ext_info->info = malloc(ext_info->len);
|
|
if (!ext_info->info)
|
|
return -ENOMEM;
|
|
memcpy(ext_info->info, info + sizeof(__u32), ext_info->len);
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int btf_ext_copy_func_info(struct btf_ext *btf_ext,
|
|
__u8 *data, __u32 data_size)
|
|
{
|
|
const struct btf_ext_header *hdr = (struct btf_ext_header *)data;
|
|
struct btf_ext_sec_copy_param param = {
|
|
.off = hdr->func_info_off,
|
|
.len = hdr->func_info_len,
|
|
.min_rec_size = sizeof(struct bpf_func_info_min),
|
|
.ext_info = &btf_ext->func_info,
|
|
.desc = "func_info"
|
|
};
|
|
|
|
return btf_ext_copy_info(btf_ext, data, data_size, ¶m);
|
|
}
|
|
|
|
static int btf_ext_copy_line_info(struct btf_ext *btf_ext,
|
|
__u8 *data, __u32 data_size)
|
|
{
|
|
const struct btf_ext_header *hdr = (struct btf_ext_header *)data;
|
|
struct btf_ext_sec_copy_param param = {
|
|
.off = hdr->line_info_off,
|
|
.len = hdr->line_info_len,
|
|
.min_rec_size = sizeof(struct bpf_line_info_min),
|
|
.ext_info = &btf_ext->line_info,
|
|
.desc = "line_info",
|
|
};
|
|
|
|
return btf_ext_copy_info(btf_ext, data, data_size, ¶m);
|
|
}
|
|
|
|
static int btf_ext_parse_hdr(__u8 *data, __u32 data_size)
|
|
{
|
|
const struct btf_ext_header *hdr = (struct btf_ext_header *)data;
|
|
|
|
if (data_size < offsetof(struct btf_ext_header, func_info_off) ||
|
|
data_size < hdr->hdr_len) {
|
|
pr_debug("BTF.ext header not found");
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (hdr->magic != BTF_MAGIC) {
|
|
pr_debug("Invalid BTF.ext magic:%x\n", hdr->magic);
|
|
return -EINVAL;
|
|
}
|
|
|
|
if (hdr->version != BTF_VERSION) {
|
|
pr_debug("Unsupported BTF.ext version:%u\n", hdr->version);
|
|
return -ENOTSUP;
|
|
}
|
|
|
|
if (hdr->flags) {
|
|
pr_debug("Unsupported BTF.ext flags:%x\n", hdr->flags);
|
|
return -ENOTSUP;
|
|
}
|
|
|
|
if (data_size == hdr->hdr_len) {
|
|
pr_debug("BTF.ext has no data\n");
|
|
return -EINVAL;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
void btf_ext__free(struct btf_ext *btf_ext)
|
|
{
|
|
if (!btf_ext)
|
|
return;
|
|
|
|
free(btf_ext->func_info.info);
|
|
free(btf_ext->line_info.info);
|
|
free(btf_ext);
|
|
}
|
|
|
|
struct btf_ext *btf_ext__new(__u8 *data, __u32 size)
|
|
{
|
|
struct btf_ext *btf_ext;
|
|
int err;
|
|
|
|
err = btf_ext_parse_hdr(data, size);
|
|
if (err)
|
|
return ERR_PTR(err);
|
|
|
|
btf_ext = calloc(1, sizeof(struct btf_ext));
|
|
if (!btf_ext)
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
err = btf_ext_copy_func_info(btf_ext, data, size);
|
|
if (err) {
|
|
btf_ext__free(btf_ext);
|
|
return ERR_PTR(err);
|
|
}
|
|
|
|
err = btf_ext_copy_line_info(btf_ext, data, size);
|
|
if (err) {
|
|
btf_ext__free(btf_ext);
|
|
return ERR_PTR(err);
|
|
}
|
|
|
|
return btf_ext;
|
|
}
|
|
|
|
static int btf_ext_reloc_info(const struct btf *btf,
|
|
const struct btf_ext_info *ext_info,
|
|
const char *sec_name, __u32 insns_cnt,
|
|
void **info, __u32 *cnt)
|
|
{
|
|
__u32 sec_hdrlen = sizeof(struct btf_ext_info_sec);
|
|
__u32 i, record_size, existing_len, records_len;
|
|
struct btf_ext_info_sec *sinfo;
|
|
const char *info_sec_name;
|
|
__u64 remain_len;
|
|
void *data;
|
|
|
|
record_size = ext_info->rec_size;
|
|
sinfo = ext_info->info;
|
|
remain_len = ext_info->len;
|
|
while (remain_len > 0) {
|
|
records_len = sinfo->num_info * record_size;
|
|
info_sec_name = btf__name_by_offset(btf, sinfo->sec_name_off);
|
|
if (strcmp(info_sec_name, sec_name)) {
|
|
remain_len -= sec_hdrlen + records_len;
|
|
sinfo = (void *)sinfo + sec_hdrlen + records_len;
|
|
continue;
|
|
}
|
|
|
|
existing_len = (*cnt) * record_size;
|
|
data = realloc(*info, existing_len + records_len);
|
|
if (!data)
|
|
return -ENOMEM;
|
|
|
|
memcpy(data + existing_len, sinfo->data, records_len);
|
|
/* adjust insn_off only, the rest data will be passed
|
|
* to the kernel.
|
|
*/
|
|
for (i = 0; i < sinfo->num_info; i++) {
|
|
__u32 *insn_off;
|
|
|
|
insn_off = data + existing_len + (i * record_size);
|
|
*insn_off = *insn_off / sizeof(struct bpf_insn) +
|
|
insns_cnt;
|
|
}
|
|
*info = data;
|
|
*cnt += sinfo->num_info;
|
|
return 0;
|
|
}
|
|
|
|
return -ENOENT;
|
|
}
|
|
|
|
int btf_ext__reloc_func_info(const struct btf *btf, const struct btf_ext *btf_ext,
|
|
const char *sec_name, __u32 insns_cnt,
|
|
void **func_info, __u32 *cnt)
|
|
{
|
|
return btf_ext_reloc_info(btf, &btf_ext->func_info, sec_name,
|
|
insns_cnt, func_info, cnt);
|
|
}
|
|
|
|
int btf_ext__reloc_line_info(const struct btf *btf, const struct btf_ext *btf_ext,
|
|
const char *sec_name, __u32 insns_cnt,
|
|
void **line_info, __u32 *cnt)
|
|
{
|
|
return btf_ext_reloc_info(btf, &btf_ext->line_info, sec_name,
|
|
insns_cnt, line_info, cnt);
|
|
}
|
|
|
|
__u32 btf_ext__func_info_rec_size(const struct btf_ext *btf_ext)
|
|
{
|
|
return btf_ext->func_info.rec_size;
|
|
}
|
|
|
|
__u32 btf_ext__line_info_rec_size(const struct btf_ext *btf_ext)
|
|
{
|
|
return btf_ext->line_info.rec_size;
|
|
}
|