mirror of https://github.com/Qortal/Brooklyn
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
293 lines
9.8 KiB
293 lines
9.8 KiB
/* SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause) */ |
|
|
|
/* |
|
* common eBPF ELF operations. |
|
* |
|
* Copyright (C) 2013-2015 Alexei Starovoitov <[email protected]> |
|
* Copyright (C) 2015 Wang Nan <[email protected]> |
|
* Copyright (C) 2015 Huawei Inc. |
|
* |
|
* This program is free software; you can redistribute it and/or |
|
* modify it under the terms of the GNU Lesser General Public |
|
* License as published by the Free Software Foundation; |
|
* version 2.1 of the License (not later!) |
|
* |
|
* This program is distributed in the hope that it will be useful, |
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
* GNU Lesser General Public License for more details. |
|
* |
|
* You should have received a copy of the GNU Lesser General Public |
|
* License along with this program; if not, see <http://www.gnu.org/licenses> |
|
*/ |
|
#ifndef __LIBBPF_BPF_H |
|
#define __LIBBPF_BPF_H |
|
|
|
#include <linux/bpf.h> |
|
#include <stdbool.h> |
|
#include <stddef.h> |
|
#include <stdint.h> |
|
|
|
#include "libbpf_common.h" |
|
|
|
#ifdef __cplusplus |
|
extern "C" { |
|
#endif |
|
|
|
struct bpf_create_map_attr { |
|
const char *name; |
|
enum bpf_map_type map_type; |
|
__u32 map_flags; |
|
__u32 key_size; |
|
__u32 value_size; |
|
__u32 max_entries; |
|
__u32 numa_node; |
|
__u32 btf_fd; |
|
__u32 btf_key_type_id; |
|
__u32 btf_value_type_id; |
|
__u32 map_ifindex; |
|
union { |
|
__u32 inner_map_fd; |
|
__u32 btf_vmlinux_value_type_id; |
|
}; |
|
}; |
|
|
|
LIBBPF_API int |
|
bpf_create_map_xattr(const struct bpf_create_map_attr *create_attr); |
|
LIBBPF_API int bpf_create_map_node(enum bpf_map_type map_type, const char *name, |
|
int key_size, int value_size, |
|
int max_entries, __u32 map_flags, int node); |
|
LIBBPF_API int bpf_create_map_name(enum bpf_map_type map_type, const char *name, |
|
int key_size, int value_size, |
|
int max_entries, __u32 map_flags); |
|
LIBBPF_API int bpf_create_map(enum bpf_map_type map_type, int key_size, |
|
int value_size, int max_entries, __u32 map_flags); |
|
LIBBPF_API int bpf_create_map_in_map_node(enum bpf_map_type map_type, |
|
const char *name, int key_size, |
|
int inner_map_fd, int max_entries, |
|
__u32 map_flags, int node); |
|
LIBBPF_API int bpf_create_map_in_map(enum bpf_map_type map_type, |
|
const char *name, int key_size, |
|
int inner_map_fd, int max_entries, |
|
__u32 map_flags); |
|
|
|
struct bpf_load_program_attr { |
|
enum bpf_prog_type prog_type; |
|
enum bpf_attach_type expected_attach_type; |
|
const char *name; |
|
const struct bpf_insn *insns; |
|
size_t insns_cnt; |
|
const char *license; |
|
union { |
|
__u32 kern_version; |
|
__u32 attach_prog_fd; |
|
}; |
|
union { |
|
__u32 prog_ifindex; |
|
__u32 attach_btf_id; |
|
}; |
|
__u32 prog_btf_fd; |
|
__u32 func_info_rec_size; |
|
const void *func_info; |
|
__u32 func_info_cnt; |
|
__u32 line_info_rec_size; |
|
const void *line_info; |
|
__u32 line_info_cnt; |
|
__u32 log_level; |
|
__u32 prog_flags; |
|
}; |
|
|
|
/* Flags to direct loading requirements */ |
|
#define MAPS_RELAX_COMPAT 0x01 |
|
|
|
/* Recommend log buffer size */ |
|
#define BPF_LOG_BUF_SIZE (UINT32_MAX >> 8) /* verifier maximum in kernels <= 5.1 */ |
|
LIBBPF_API int |
|
bpf_load_program_xattr(const struct bpf_load_program_attr *load_attr, |
|
char *log_buf, size_t log_buf_sz); |
|
LIBBPF_API int bpf_load_program(enum bpf_prog_type type, |
|
const struct bpf_insn *insns, size_t insns_cnt, |
|
const char *license, __u32 kern_version, |
|
char *log_buf, size_t log_buf_sz); |
|
LIBBPF_API int bpf_verify_program(enum bpf_prog_type type, |
|
const struct bpf_insn *insns, |
|
size_t insns_cnt, __u32 prog_flags, |
|
const char *license, __u32 kern_version, |
|
char *log_buf, size_t log_buf_sz, |
|
int log_level); |
|
|
|
LIBBPF_API int bpf_map_update_elem(int fd, const void *key, const void *value, |
|
__u64 flags); |
|
|
|
LIBBPF_API int bpf_map_lookup_elem(int fd, const void *key, void *value); |
|
LIBBPF_API int bpf_map_lookup_elem_flags(int fd, const void *key, void *value, |
|
__u64 flags); |
|
LIBBPF_API int bpf_map_lookup_and_delete_elem(int fd, const void *key, |
|
void *value); |
|
LIBBPF_API int bpf_map_lookup_and_delete_elem_flags(int fd, const void *key, |
|
void *value, __u64 flags); |
|
LIBBPF_API int bpf_map_delete_elem(int fd, const void *key); |
|
LIBBPF_API int bpf_map_get_next_key(int fd, const void *key, void *next_key); |
|
LIBBPF_API int bpf_map_freeze(int fd); |
|
|
|
struct bpf_map_batch_opts { |
|
size_t sz; /* size of this struct for forward/backward compatibility */ |
|
__u64 elem_flags; |
|
__u64 flags; |
|
}; |
|
#define bpf_map_batch_opts__last_field flags |
|
|
|
LIBBPF_API int bpf_map_delete_batch(int fd, void *keys, |
|
__u32 *count, |
|
const struct bpf_map_batch_opts *opts); |
|
LIBBPF_API int bpf_map_lookup_batch(int fd, void *in_batch, void *out_batch, |
|
void *keys, void *values, __u32 *count, |
|
const struct bpf_map_batch_opts *opts); |
|
LIBBPF_API int bpf_map_lookup_and_delete_batch(int fd, void *in_batch, |
|
void *out_batch, void *keys, |
|
void *values, __u32 *count, |
|
const struct bpf_map_batch_opts *opts); |
|
LIBBPF_API int bpf_map_update_batch(int fd, void *keys, void *values, |
|
__u32 *count, |
|
const struct bpf_map_batch_opts *opts); |
|
|
|
LIBBPF_API int bpf_obj_pin(int fd, const char *pathname); |
|
LIBBPF_API int bpf_obj_get(const char *pathname); |
|
|
|
struct bpf_prog_attach_opts { |
|
size_t sz; /* size of this struct for forward/backward compatibility */ |
|
unsigned int flags; |
|
int replace_prog_fd; |
|
}; |
|
#define bpf_prog_attach_opts__last_field replace_prog_fd |
|
|
|
LIBBPF_API int bpf_prog_attach(int prog_fd, int attachable_fd, |
|
enum bpf_attach_type type, unsigned int flags); |
|
LIBBPF_API int bpf_prog_attach_xattr(int prog_fd, int attachable_fd, |
|
enum bpf_attach_type type, |
|
const struct bpf_prog_attach_opts *opts); |
|
LIBBPF_API int bpf_prog_detach(int attachable_fd, enum bpf_attach_type type); |
|
LIBBPF_API int bpf_prog_detach2(int prog_fd, int attachable_fd, |
|
enum bpf_attach_type type); |
|
|
|
union bpf_iter_link_info; /* defined in up-to-date linux/bpf.h */ |
|
struct bpf_link_create_opts { |
|
size_t sz; /* size of this struct for forward/backward compatibility */ |
|
__u32 flags; |
|
union bpf_iter_link_info *iter_info; |
|
__u32 iter_info_len; |
|
__u32 target_btf_id; |
|
union { |
|
struct { |
|
__u64 bpf_cookie; |
|
} perf_event; |
|
}; |
|
size_t :0; |
|
}; |
|
#define bpf_link_create_opts__last_field perf_event |
|
|
|
LIBBPF_API int bpf_link_create(int prog_fd, int target_fd, |
|
enum bpf_attach_type attach_type, |
|
const struct bpf_link_create_opts *opts); |
|
|
|
LIBBPF_API int bpf_link_detach(int link_fd); |
|
|
|
struct bpf_link_update_opts { |
|
size_t sz; /* size of this struct for forward/backward compatibility */ |
|
__u32 flags; /* extra flags */ |
|
__u32 old_prog_fd; /* expected old program FD */ |
|
}; |
|
#define bpf_link_update_opts__last_field old_prog_fd |
|
|
|
LIBBPF_API int bpf_link_update(int link_fd, int new_prog_fd, |
|
const struct bpf_link_update_opts *opts); |
|
|
|
LIBBPF_API int bpf_iter_create(int link_fd); |
|
|
|
struct bpf_prog_test_run_attr { |
|
int prog_fd; |
|
int repeat; |
|
const void *data_in; |
|
__u32 data_size_in; |
|
void *data_out; /* optional */ |
|
__u32 data_size_out; /* in: max length of data_out |
|
* out: length of data_out */ |
|
__u32 retval; /* out: return code of the BPF program */ |
|
__u32 duration; /* out: average per repetition in ns */ |
|
const void *ctx_in; /* optional */ |
|
__u32 ctx_size_in; |
|
void *ctx_out; /* optional */ |
|
__u32 ctx_size_out; /* in: max length of ctx_out |
|
* out: length of cxt_out */ |
|
}; |
|
|
|
LIBBPF_API int bpf_prog_test_run_xattr(struct bpf_prog_test_run_attr *test_attr); |
|
|
|
/* |
|
* bpf_prog_test_run does not check that data_out is large enough. Consider |
|
* using bpf_prog_test_run_xattr instead. |
|
*/ |
|
LIBBPF_API int bpf_prog_test_run(int prog_fd, int repeat, void *data, |
|
__u32 size, void *data_out, __u32 *size_out, |
|
__u32 *retval, __u32 *duration); |
|
LIBBPF_API int bpf_prog_get_next_id(__u32 start_id, __u32 *next_id); |
|
LIBBPF_API int bpf_map_get_next_id(__u32 start_id, __u32 *next_id); |
|
LIBBPF_API int bpf_btf_get_next_id(__u32 start_id, __u32 *next_id); |
|
LIBBPF_API int bpf_link_get_next_id(__u32 start_id, __u32 *next_id); |
|
LIBBPF_API int bpf_prog_get_fd_by_id(__u32 id); |
|
LIBBPF_API int bpf_map_get_fd_by_id(__u32 id); |
|
LIBBPF_API int bpf_btf_get_fd_by_id(__u32 id); |
|
LIBBPF_API int bpf_link_get_fd_by_id(__u32 id); |
|
LIBBPF_API int bpf_obj_get_info_by_fd(int bpf_fd, void *info, __u32 *info_len); |
|
LIBBPF_API int bpf_prog_query(int target_fd, enum bpf_attach_type type, |
|
__u32 query_flags, __u32 *attach_flags, |
|
__u32 *prog_ids, __u32 *prog_cnt); |
|
LIBBPF_API int bpf_raw_tracepoint_open(const char *name, int prog_fd); |
|
LIBBPF_API int bpf_load_btf(const void *btf, __u32 btf_size, char *log_buf, |
|
__u32 log_buf_size, bool do_log); |
|
LIBBPF_API int bpf_task_fd_query(int pid, int fd, __u32 flags, char *buf, |
|
__u32 *buf_len, __u32 *prog_id, __u32 *fd_type, |
|
__u64 *probe_offset, __u64 *probe_addr); |
|
|
|
enum bpf_stats_type; /* defined in up-to-date linux/bpf.h */ |
|
LIBBPF_API int bpf_enable_stats(enum bpf_stats_type type); |
|
|
|
struct bpf_prog_bind_opts { |
|
size_t sz; /* size of this struct for forward/backward compatibility */ |
|
__u32 flags; |
|
}; |
|
#define bpf_prog_bind_opts__last_field flags |
|
|
|
LIBBPF_API int bpf_prog_bind_map(int prog_fd, int map_fd, |
|
const struct bpf_prog_bind_opts *opts); |
|
|
|
struct bpf_test_run_opts { |
|
size_t sz; /* size of this struct for forward/backward compatibility */ |
|
const void *data_in; /* optional */ |
|
void *data_out; /* optional */ |
|
__u32 data_size_in; |
|
__u32 data_size_out; /* in: max length of data_out |
|
* out: length of data_out |
|
*/ |
|
const void *ctx_in; /* optional */ |
|
void *ctx_out; /* optional */ |
|
__u32 ctx_size_in; |
|
__u32 ctx_size_out; /* in: max length of ctx_out |
|
* out: length of cxt_out |
|
*/ |
|
__u32 retval; /* out: return code of the BPF program */ |
|
int repeat; |
|
__u32 duration; /* out: average per repetition in ns */ |
|
__u32 flags; |
|
__u32 cpu; |
|
}; |
|
#define bpf_test_run_opts__last_field cpu |
|
|
|
LIBBPF_API int bpf_prog_test_run_opts(int prog_fd, |
|
struct bpf_test_run_opts *opts); |
|
|
|
#ifdef __cplusplus |
|
} /* extern "C" */ |
|
#endif |
|
|
|
#endif /* __LIBBPF_BPF_H */
|
|
|