11bc38b8fSAlexei Starovoitov /* SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause) */ 26061a3d6SEric Leblond 3e3ed2fefSWang Nan /* 40a504fa1SIlya Leoshkevich * Common BPF ELF operations. 5e3ed2fefSWang Nan * 6e3ed2fefSWang Nan * Copyright (C) 2013-2015 Alexei Starovoitov <ast@kernel.org> 7e3ed2fefSWang Nan * Copyright (C) 2015 Wang Nan <wangnan0@huawei.com> 8e3ed2fefSWang Nan * Copyright (C) 2015 Huawei Inc. 9203d1cacSWang Nan * 10203d1cacSWang Nan * This program is free software; you can redistribute it and/or 11203d1cacSWang Nan * modify it under the terms of the GNU Lesser General Public 12203d1cacSWang Nan * License as published by the Free Software Foundation; 13203d1cacSWang Nan * version 2.1 of the License (not later!) 14203d1cacSWang Nan * 15203d1cacSWang Nan * This program is distributed in the hope that it will be useful, 16203d1cacSWang Nan * but WITHOUT ANY WARRANTY; without even the implied warranty of 17203d1cacSWang Nan * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18203d1cacSWang Nan * GNU Lesser General Public License for more details. 19203d1cacSWang Nan * 20203d1cacSWang Nan * You should have received a copy of the GNU Lesser General Public 21203d1cacSWang Nan * License along with this program; if not, see <http://www.gnu.org/licenses> 22e3ed2fefSWang Nan */ 23eff81908SAndrey Ignatov #ifndef __LIBBPF_BPF_H 24eff81908SAndrey Ignatov #define __LIBBPF_BPF_H 25e3ed2fefSWang Nan 26e3ed2fefSWang Nan #include <linux/bpf.h> 27878a4d32SBjörn Töpel #include <stdbool.h> 287a5980f9SMickaël Salaün #include <stddef.h> 2932e621e5SDaniel T. Lee #include <stdint.h> 30e3ed2fefSWang Nan 31544402d4SAndrii Nakryiko #include "libbpf_common.h" 32be80e9cdSAndrii Nakryiko #include "libbpf_legacy.h" 33544402d4SAndrii Nakryiko 348c4905b9SStanislav Fomichev #ifdef __cplusplus 358c4905b9SStanislav Fomichev extern "C" { 368c4905b9SStanislav Fomichev #endif 378c4905b9SStanislav Fomichev 38e542f2c4SAndrii Nakryiko int libbpf_set_memlock_rlim(size_t memlock_bytes); 39e542f2c4SAndrii Nakryiko 40992c4225SAndrii Nakryiko struct bpf_map_create_opts { 41992c4225SAndrii Nakryiko size_t sz; /* size of this struct for forward/backward compatibility */ 42992c4225SAndrii Nakryiko 43992c4225SAndrii Nakryiko __u32 btf_fd; 44992c4225SAndrii Nakryiko __u32 btf_key_type_id; 45992c4225SAndrii Nakryiko __u32 btf_value_type_id; 46992c4225SAndrii Nakryiko __u32 btf_vmlinux_value_type_id; 47992c4225SAndrii Nakryiko 4874d98070SAndrii Nakryiko __u32 inner_map_fd; 4974d98070SAndrii Nakryiko __u32 map_flags; 50992c4225SAndrii Nakryiko __u64 map_extra; 51992c4225SAndrii Nakryiko 5274d98070SAndrii Nakryiko __u32 numa_node; 5374d98070SAndrii Nakryiko __u32 map_ifindex; 54992c4225SAndrii Nakryiko }; 55992c4225SAndrii Nakryiko #define bpf_map_create_opts__last_field map_ifindex 56992c4225SAndrii Nakryiko 57992c4225SAndrii Nakryiko LIBBPF_API int bpf_map_create(enum bpf_map_type map_type, 58992c4225SAndrii Nakryiko const char *map_name, 59992c4225SAndrii Nakryiko __u32 key_size, 60992c4225SAndrii Nakryiko __u32 value_size, 61992c4225SAndrii Nakryiko __u32 max_entries, 62992c4225SAndrii Nakryiko const struct bpf_map_create_opts *opts); 63992c4225SAndrii Nakryiko 64d10ef2b8SAndrii Nakryiko struct bpf_prog_load_opts { 65d10ef2b8SAndrii Nakryiko size_t sz; /* size of this struct for forward/backward compatibility */ 66d10ef2b8SAndrii Nakryiko 67d10ef2b8SAndrii Nakryiko /* libbpf can retry BPF_PROG_LOAD command if bpf() syscall returns 68d10ef2b8SAndrii Nakryiko * -EAGAIN. This field determines how many attempts libbpf has to 69d10ef2b8SAndrii Nakryiko * make. If not specified, libbpf will use default value of 5. 70d10ef2b8SAndrii Nakryiko */ 71d10ef2b8SAndrii Nakryiko int attempts; 72d10ef2b8SAndrii Nakryiko 73d10ef2b8SAndrii Nakryiko enum bpf_attach_type expected_attach_type; 74d10ef2b8SAndrii Nakryiko __u32 prog_btf_fd; 75d10ef2b8SAndrii Nakryiko __u32 prog_flags; 76d10ef2b8SAndrii Nakryiko __u32 prog_ifindex; 77d10ef2b8SAndrii Nakryiko __u32 kern_version; 78d10ef2b8SAndrii Nakryiko 79d10ef2b8SAndrii Nakryiko __u32 attach_btf_id; 80d10ef2b8SAndrii Nakryiko __u32 attach_prog_fd; 81d10ef2b8SAndrii Nakryiko __u32 attach_btf_obj_fd; 82d10ef2b8SAndrii Nakryiko 83d10ef2b8SAndrii Nakryiko const int *fd_array; 84d10ef2b8SAndrii Nakryiko 85d10ef2b8SAndrii Nakryiko /* .BTF.ext func info data */ 86d10ef2b8SAndrii Nakryiko const void *func_info; 87d10ef2b8SAndrii Nakryiko __u32 func_info_cnt; 88d10ef2b8SAndrii Nakryiko __u32 func_info_rec_size; 89d10ef2b8SAndrii Nakryiko 90d10ef2b8SAndrii Nakryiko /* .BTF.ext line info data */ 91d10ef2b8SAndrii Nakryiko const void *line_info; 92d10ef2b8SAndrii Nakryiko __u32 line_info_cnt; 93d10ef2b8SAndrii Nakryiko __u32 line_info_rec_size; 94d10ef2b8SAndrii Nakryiko 95d10ef2b8SAndrii Nakryiko /* verifier log options */ 96d10ef2b8SAndrii Nakryiko __u32 log_level; 97d10ef2b8SAndrii Nakryiko __u32 log_size; 98d10ef2b8SAndrii Nakryiko char *log_buf; 9994e55c0fSAndrii Nakryiko /* output: actual total log contents size (including termintaing zero). 10094e55c0fSAndrii Nakryiko * It could be both larger than original log_size (if log was 10194e55c0fSAndrii Nakryiko * truncated), or smaller (if log buffer wasn't filled completely). 10294e55c0fSAndrii Nakryiko * If kernel doesn't support this feature, log_size is left unchanged. 10394e55c0fSAndrii Nakryiko */ 10494e55c0fSAndrii Nakryiko __u32 log_true_size; 10594e55c0fSAndrii Nakryiko size_t :0; 106d10ef2b8SAndrii Nakryiko }; 10794e55c0fSAndrii Nakryiko #define bpf_prog_load_opts__last_field log_true_size 108d10ef2b8SAndrii Nakryiko 109d10ef2b8SAndrii Nakryiko LIBBPF_API int bpf_prog_load(enum bpf_prog_type prog_type, 110d10ef2b8SAndrii Nakryiko const char *prog_name, const char *license, 111d10ef2b8SAndrii Nakryiko const struct bpf_insn *insns, size_t insn_cnt, 11294e55c0fSAndrii Nakryiko struct bpf_prog_load_opts *opts); 113d7be143bSAndrey Ignatov 114c034a177SJohn Fastabend /* Flags to direct loading requirements */ 115c034a177SJohn Fastabend #define MAPS_RELAX_COMPAT 0x01 116c034a177SJohn Fastabend 117e0e3ea88SAndrii Nakryiko /* Recommended log buffer size */ 1184519efa6SMcCabe, Robert J #define BPF_LOG_BUF_SIZE (UINT32_MAX >> 8) /* verifier maximum in kernels <= 5.1 */ 119e0e3ea88SAndrii Nakryiko 1200ed08d67SAndrii Nakryiko struct bpf_btf_load_opts { 1210ed08d67SAndrii Nakryiko size_t sz; /* size of this struct for forward/backward compatibility */ 1220ed08d67SAndrii Nakryiko 1230ed08d67SAndrii Nakryiko /* kernel log options */ 1240ed08d67SAndrii Nakryiko char *log_buf; 1250ed08d67SAndrii Nakryiko __u32 log_level; 1260ed08d67SAndrii Nakryiko __u32 log_size; 127*097d8002SAndrii Nakryiko /* output: actual total log contents size (including termintaing zero). 128*097d8002SAndrii Nakryiko * It could be both larger than original log_size (if log was 129*097d8002SAndrii Nakryiko * truncated), or smaller (if log buffer wasn't filled completely). 130*097d8002SAndrii Nakryiko * If kernel doesn't support this feature, log_size is left unchanged. 131*097d8002SAndrii Nakryiko */ 132*097d8002SAndrii Nakryiko __u32 log_true_size; 133*097d8002SAndrii Nakryiko size_t :0; 1340ed08d67SAndrii Nakryiko }; 135*097d8002SAndrii Nakryiko #define bpf_btf_load_opts__last_field log_true_size 1360ed08d67SAndrii Nakryiko 1370ed08d67SAndrii Nakryiko LIBBPF_API int bpf_btf_load(const void *btf_data, size_t btf_size, 138*097d8002SAndrii Nakryiko struct bpf_btf_load_opts *opts); 1390ed08d67SAndrii Nakryiko 140ab9e0848SAndrey Ignatov LIBBPF_API int bpf_map_update_elem(int fd, const void *key, const void *value, 14183d994d0SJoe Stringer __u64 flags); 1429742da01SWang Nan 143ab9e0848SAndrey Ignatov LIBBPF_API int bpf_map_lookup_elem(int fd, const void *key, void *value); 144df5d22faSAlexei Starovoitov LIBBPF_API int bpf_map_lookup_elem_flags(int fd, const void *key, void *value, 145df5d22faSAlexei Starovoitov __u64 flags); 14643b987d2SMauricio Vasquez B LIBBPF_API int bpf_map_lookup_and_delete_elem(int fd, const void *key, 14743b987d2SMauricio Vasquez B void *value); 148d59b9f2dSDenis Salopek LIBBPF_API int bpf_map_lookup_and_delete_elem_flags(int fd, const void *key, 149d59b9f2dSDenis Salopek void *value, __u64 flags); 150ab9e0848SAndrey Ignatov LIBBPF_API int bpf_map_delete_elem(int fd, const void *key); 151737d0646SAndrii Nakryiko LIBBPF_API int bpf_map_delete_elem_flags(int fd, const void *key, __u64 flags); 152ab9e0848SAndrey Ignatov LIBBPF_API int bpf_map_get_next_key(int fd, const void *key, void *next_key); 153d859900cSDaniel Borkmann LIBBPF_API int bpf_map_freeze(int fd); 1542ab3d86eSYonghong Song 1552ab3d86eSYonghong Song struct bpf_map_batch_opts { 1562ab3d86eSYonghong Song size_t sz; /* size of this struct for forward/backward compatibility */ 1572ab3d86eSYonghong Song __u64 elem_flags; 1582ab3d86eSYonghong Song __u64 flags; 1592ab3d86eSYonghong Song }; 1602ab3d86eSYonghong Song #define bpf_map_batch_opts__last_field flags 1612ab3d86eSYonghong Song 162e59618f0SGrant Seltzer 163e59618f0SGrant Seltzer /** 164e59618f0SGrant Seltzer * @brief **bpf_map_delete_batch()** allows for batch deletion of multiple 165e59618f0SGrant Seltzer * elements in a BPF map. 166e59618f0SGrant Seltzer * 167e59618f0SGrant Seltzer * @param fd BPF map file descriptor 168e59618f0SGrant Seltzer * @param keys pointer to an array of *count* keys 169e59618f0SGrant Seltzer * @param count input and output parameter; on input **count** represents the 170e59618f0SGrant Seltzer * number of elements in the map to delete in batch; 171e59618f0SGrant Seltzer * on output if a non-EFAULT error is returned, **count** represents the number of deleted 172e59618f0SGrant Seltzer * elements if the output **count** value is not equal to the input **count** value 173e59618f0SGrant Seltzer * If EFAULT is returned, **count** should not be trusted to be correct. 174e59618f0SGrant Seltzer * @param opts options for configuring the way the batch deletion works 175e59618f0SGrant Seltzer * @return 0, on success; negative error code, otherwise (errno is also set to 176e59618f0SGrant Seltzer * the error code) 177e59618f0SGrant Seltzer */ 178e59618f0SGrant Seltzer LIBBPF_API int bpf_map_delete_batch(int fd, const void *keys, 1792ab3d86eSYonghong Song __u32 *count, 1802ab3d86eSYonghong Song const struct bpf_map_batch_opts *opts); 181e59618f0SGrant Seltzer 182e59618f0SGrant Seltzer /** 183e59618f0SGrant Seltzer * @brief **bpf_map_lookup_batch()** allows for batch lookup of BPF map elements. 184e59618f0SGrant Seltzer * 185e59618f0SGrant Seltzer * The parameter *in_batch* is the address of the first element in the batch to read. 186e59618f0SGrant Seltzer * *out_batch* is an output parameter that should be passed as *in_batch* to subsequent 187e59618f0SGrant Seltzer * calls to **bpf_map_lookup_batch()**. NULL can be passed for *in_batch* to indicate 188e59618f0SGrant Seltzer * that the batched lookup starts from the beginning of the map. 189e59618f0SGrant Seltzer * 190e59618f0SGrant Seltzer * The *keys* and *values* are output parameters which must point to memory large enough to 191e59618f0SGrant Seltzer * hold *count* items based on the key and value size of the map *map_fd*. The *keys* 192e59618f0SGrant Seltzer * buffer must be of *key_size* * *count*. The *values* buffer must be of 193e59618f0SGrant Seltzer * *value_size* * *count*. 194e59618f0SGrant Seltzer * 195e59618f0SGrant Seltzer * @param fd BPF map file descriptor 196e59618f0SGrant Seltzer * @param in_batch address of the first element in batch to read, can pass NULL to 197e59618f0SGrant Seltzer * indicate that the batched lookup starts from the beginning of the map. 198e59618f0SGrant Seltzer * @param out_batch output parameter that should be passed to next call as *in_batch* 199e59618f0SGrant Seltzer * @param keys pointer to an array large enough for *count* keys 200e59618f0SGrant Seltzer * @param values pointer to an array large enough for *count* values 201e59618f0SGrant Seltzer * @param count input and output parameter; on input it's the number of elements 202e59618f0SGrant Seltzer * in the map to read in batch; on output it's the number of elements that were 203e59618f0SGrant Seltzer * successfully read. 204e59618f0SGrant Seltzer * If a non-EFAULT error is returned, count will be set as the number of elements 205e59618f0SGrant Seltzer * that were read before the error occurred. 206e59618f0SGrant Seltzer * If EFAULT is returned, **count** should not be trusted to be correct. 207e59618f0SGrant Seltzer * @param opts options for configuring the way the batch lookup works 208e59618f0SGrant Seltzer * @return 0, on success; negative error code, otherwise (errno is also set to 209e59618f0SGrant Seltzer * the error code) 210e59618f0SGrant Seltzer */ 2112ab3d86eSYonghong Song LIBBPF_API int bpf_map_lookup_batch(int fd, void *in_batch, void *out_batch, 2122ab3d86eSYonghong Song void *keys, void *values, __u32 *count, 2132ab3d86eSYonghong Song const struct bpf_map_batch_opts *opts); 214e59618f0SGrant Seltzer 215e59618f0SGrant Seltzer /** 216e59618f0SGrant Seltzer * @brief **bpf_map_lookup_and_delete_batch()** allows for batch lookup and deletion 217e59618f0SGrant Seltzer * of BPF map elements where each element is deleted after being retrieved. 218e59618f0SGrant Seltzer * 219e59618f0SGrant Seltzer * @param fd BPF map file descriptor 220e59618f0SGrant Seltzer * @param in_batch address of the first element in batch to read, can pass NULL to 221e59618f0SGrant Seltzer * get address of the first element in *out_batch* 222e59618f0SGrant Seltzer * @param out_batch output parameter that should be passed to next call as *in_batch* 223e59618f0SGrant Seltzer * @param keys pointer to an array of *count* keys 224e59618f0SGrant Seltzer * @param values pointer to an array large enough for *count* values 225e59618f0SGrant Seltzer * @param count input and output parameter; on input it's the number of elements 226e59618f0SGrant Seltzer * in the map to read and delete in batch; on output it represents the number of 227e59618f0SGrant Seltzer * elements that were successfully read and deleted 228e59618f0SGrant Seltzer * If a non-**EFAULT** error code is returned and if the output **count** value 229e59618f0SGrant Seltzer * is not equal to the input **count** value, up to **count** elements may 230e59618f0SGrant Seltzer * have been deleted. 231e59618f0SGrant Seltzer * if **EFAULT** is returned up to *count* elements may have been deleted without 232e59618f0SGrant Seltzer * being returned via the *keys* and *values* output parameters. 233e59618f0SGrant Seltzer * @param opts options for configuring the way the batch lookup and delete works 234e59618f0SGrant Seltzer * @return 0, on success; negative error code, otherwise (errno is also set to 235e59618f0SGrant Seltzer * the error code) 236e59618f0SGrant Seltzer */ 2372ab3d86eSYonghong Song LIBBPF_API int bpf_map_lookup_and_delete_batch(int fd, void *in_batch, 2382ab3d86eSYonghong Song void *out_batch, void *keys, 2392ab3d86eSYonghong Song void *values, __u32 *count, 2402ab3d86eSYonghong Song const struct bpf_map_batch_opts *opts); 241e59618f0SGrant Seltzer 242e59618f0SGrant Seltzer /** 243e59618f0SGrant Seltzer * @brief **bpf_map_update_batch()** updates multiple elements in a map 244e59618f0SGrant Seltzer * by specifying keys and their corresponding values. 245e59618f0SGrant Seltzer * 246e59618f0SGrant Seltzer * The *keys* and *values* parameters must point to memory large enough 247e59618f0SGrant Seltzer * to hold *count* items based on the key and value size of the map. 248e59618f0SGrant Seltzer * 249e59618f0SGrant Seltzer * The *opts* parameter can be used to control how *bpf_map_update_batch()* 250e59618f0SGrant Seltzer * should handle keys that either do or do not already exist in the map. 251e59618f0SGrant Seltzer * In particular the *flags* parameter of *bpf_map_batch_opts* can be 252e59618f0SGrant Seltzer * one of the following: 253e59618f0SGrant Seltzer * 254e59618f0SGrant Seltzer * Note that *count* is an input and output parameter, where on output it 255e59618f0SGrant Seltzer * represents how many elements were successfully updated. Also note that if 256e59618f0SGrant Seltzer * **EFAULT** then *count* should not be trusted to be correct. 257e59618f0SGrant Seltzer * 258e59618f0SGrant Seltzer * **BPF_ANY** 259e59618f0SGrant Seltzer * Create new elements or update existing. 260e59618f0SGrant Seltzer * 261e59618f0SGrant Seltzer * **BPF_NOEXIST** 262e59618f0SGrant Seltzer * Create new elements only if they do not exist. 263e59618f0SGrant Seltzer * 264e59618f0SGrant Seltzer * **BPF_EXIST** 265e59618f0SGrant Seltzer * Update existing elements. 266e59618f0SGrant Seltzer * 267e59618f0SGrant Seltzer * **BPF_F_LOCK** 268e59618f0SGrant Seltzer * Update spin_lock-ed map elements. This must be 269e59618f0SGrant Seltzer * specified if the map value contains a spinlock. 270e59618f0SGrant Seltzer * 271e59618f0SGrant Seltzer * @param fd BPF map file descriptor 272e59618f0SGrant Seltzer * @param keys pointer to an array of *count* keys 273e59618f0SGrant Seltzer * @param values pointer to an array of *count* values 274e59618f0SGrant Seltzer * @param count input and output parameter; on input it's the number of elements 275e59618f0SGrant Seltzer * in the map to update in batch; on output if a non-EFAULT error is returned, 276e59618f0SGrant Seltzer * **count** represents the number of updated elements if the output **count** 277e59618f0SGrant Seltzer * value is not equal to the input **count** value. 278e59618f0SGrant Seltzer * If EFAULT is returned, **count** should not be trusted to be correct. 279e59618f0SGrant Seltzer * @param opts options for configuring the way the batch update works 280e59618f0SGrant Seltzer * @return 0, on success; negative error code, otherwise (errno is also set to 281e59618f0SGrant Seltzer * the error code) 282e59618f0SGrant Seltzer */ 283e59618f0SGrant Seltzer LIBBPF_API int bpf_map_update_batch(int fd, const void *keys, const void *values, 2842ab3d86eSYonghong Song __u32 *count, 2852ab3d86eSYonghong Song const struct bpf_map_batch_opts *opts); 2862ab3d86eSYonghong Song 287395fc4faSJoe Burton struct bpf_obj_get_opts { 288395fc4faSJoe Burton size_t sz; /* size of this struct for forward/backward compatibility */ 289395fc4faSJoe Burton 290395fc4faSJoe Burton __u32 file_flags; 291395fc4faSJoe Burton 292395fc4faSJoe Burton size_t :0; 293395fc4faSJoe Burton }; 294395fc4faSJoe Burton #define bpf_obj_get_opts__last_field file_flags 295395fc4faSJoe Burton 296ab9e0848SAndrey Ignatov LIBBPF_API int bpf_obj_pin(int fd, const char *pathname); 297ab9e0848SAndrey Ignatov LIBBPF_API int bpf_obj_get(const char *pathname); 298395fc4faSJoe Burton LIBBPF_API int bpf_obj_get_opts(const char *pathname, 299395fc4faSJoe Burton const struct bpf_obj_get_opts *opts); 300cdbee383SAndrey Ignatov 301cdbee383SAndrey Ignatov struct bpf_prog_attach_opts { 302cdbee383SAndrey Ignatov size_t sz; /* size of this struct for forward/backward compatibility */ 303cdbee383SAndrey Ignatov unsigned int flags; 304cdbee383SAndrey Ignatov int replace_prog_fd; 305cdbee383SAndrey Ignatov }; 306cdbee383SAndrey Ignatov #define bpf_prog_attach_opts__last_field replace_prog_fd 307cdbee383SAndrey Ignatov 308ab9e0848SAndrey Ignatov LIBBPF_API int bpf_prog_attach(int prog_fd, int attachable_fd, 309ab9e0848SAndrey Ignatov enum bpf_attach_type type, unsigned int flags); 310d6c9c24eSChristy Lee LIBBPF_API int bpf_prog_attach_opts(int prog_fd, int attachable_fd, 311d6c9c24eSChristy Lee enum bpf_attach_type type, 312d6c9c24eSChristy Lee const struct bpf_prog_attach_opts *opts); 313ab9e0848SAndrey Ignatov LIBBPF_API int bpf_prog_detach(int attachable_fd, enum bpf_attach_type type); 314ab9e0848SAndrey Ignatov LIBBPF_API int bpf_prog_detach2(int prog_fd, int attachable_fd, 315ab9e0848SAndrey Ignatov enum bpf_attach_type type); 31664a97591SLorenz Bauer 31774fc097dSYonghong Song union bpf_iter_link_info; /* defined in up-to-date linux/bpf.h */ 318cc4f864bSAndrii Nakryiko struct bpf_link_create_opts { 319cc4f864bSAndrii Nakryiko size_t sz; /* size of this struct for forward/backward compatibility */ 320cd31039aSYonghong Song __u32 flags; 32174fc097dSYonghong Song union bpf_iter_link_info *iter_info; 32274fc097dSYonghong Song __u32 iter_info_len; 323a5359091SToke Høiland-Jørgensen __u32 target_btf_id; 3243ec84f4bSAndrii Nakryiko union { 3253ec84f4bSAndrii Nakryiko struct { 3263ec84f4bSAndrii Nakryiko __u64 bpf_cookie; 3273ec84f4bSAndrii Nakryiko } perf_event; 3285117c26eSJiri Olsa struct { 3295117c26eSJiri Olsa __u32 flags; 3305117c26eSJiri Olsa __u32 cnt; 3315117c26eSJiri Olsa const char **syms; 3325117c26eSJiri Olsa const unsigned long *addrs; 3335117c26eSJiri Olsa const __u64 *cookies; 3345117c26eSJiri Olsa } kprobe_multi; 335129b9c5eSKui-Feng Lee struct { 336129b9c5eSKui-Feng Lee __u64 cookie; 337129b9c5eSKui-Feng Lee } tracing; 338cc4f864bSAndrii Nakryiko }; 3393ec84f4bSAndrii Nakryiko size_t :0; 3403ec84f4bSAndrii Nakryiko }; 3415117c26eSJiri Olsa #define bpf_link_create_opts__last_field kprobe_multi.cookies 342cc4f864bSAndrii Nakryiko 343cc4f864bSAndrii Nakryiko LIBBPF_API int bpf_link_create(int prog_fd, int target_fd, 344cc4f864bSAndrii Nakryiko enum bpf_attach_type attach_type, 345cc4f864bSAndrii Nakryiko const struct bpf_link_create_opts *opts); 346cc4f864bSAndrii Nakryiko 3472e49527eSAndrii Nakryiko LIBBPF_API int bpf_link_detach(int link_fd); 3482e49527eSAndrii Nakryiko 349cc4f864bSAndrii Nakryiko struct bpf_link_update_opts { 350cc4f864bSAndrii Nakryiko size_t sz; /* size of this struct for forward/backward compatibility */ 351cc4f864bSAndrii Nakryiko __u32 flags; /* extra flags */ 352cc4f864bSAndrii Nakryiko __u32 old_prog_fd; /* expected old program FD */ 353912dd4b0SKui-Feng Lee __u32 old_map_fd; /* expected old map FD */ 354cc4f864bSAndrii Nakryiko }; 355912dd4b0SKui-Feng Lee #define bpf_link_update_opts__last_field old_map_fd 356cc4f864bSAndrii Nakryiko 357cc4f864bSAndrii Nakryiko LIBBPF_API int bpf_link_update(int link_fd, int new_prog_fd, 358cc4f864bSAndrii Nakryiko const struct bpf_link_update_opts *opts); 359cc4f864bSAndrii Nakryiko 360c09add2fSYonghong Song LIBBPF_API int bpf_iter_create(int link_fd); 361c09add2fSYonghong Song 36264a97591SLorenz Bauer struct bpf_prog_test_run_attr { 36364a97591SLorenz Bauer int prog_fd; 36464a97591SLorenz Bauer int repeat; 36564a97591SLorenz Bauer const void *data_in; 36664a97591SLorenz Bauer __u32 data_size_in; 36764a97591SLorenz Bauer void *data_out; /* optional */ 36864a97591SLorenz Bauer __u32 data_size_out; /* in: max length of data_out 36964a97591SLorenz Bauer * out: length of data_out */ 37064a97591SLorenz Bauer __u32 retval; /* out: return code of the BPF program */ 37164a97591SLorenz Bauer __u32 duration; /* out: average per repetition in ns */ 3725e903c65SStanislav Fomichev const void *ctx_in; /* optional */ 3735e903c65SStanislav Fomichev __u32 ctx_size_in; 3745e903c65SStanislav Fomichev void *ctx_out; /* optional */ 3755e903c65SStanislav Fomichev __u32 ctx_size_out; /* in: max length of ctx_out 3765e903c65SStanislav Fomichev * out: length of cxt_out */ 37764a97591SLorenz Bauer }; 37864a97591SLorenz Bauer 379ab9e0848SAndrey Ignatov LIBBPF_API int bpf_prog_get_next_id(__u32 start_id, __u32 *next_id); 380ab9e0848SAndrey Ignatov LIBBPF_API int bpf_map_get_next_id(__u32 start_id, __u32 *next_id); 38109d7c2e3SQuentin Monnet LIBBPF_API int bpf_btf_get_next_id(__u32 start_id, __u32 *next_id); 3820dbc8668SAndrii Nakryiko LIBBPF_API int bpf_link_get_next_id(__u32 start_id, __u32 *next_id); 383243e3005SRoberto Sassu 384243e3005SRoberto Sassu struct bpf_get_fd_by_id_opts { 385243e3005SRoberto Sassu size_t sz; /* size of this struct for forward/backward compatibility */ 386243e3005SRoberto Sassu __u32 open_flags; /* permissions requested for the operation on fd */ 387243e3005SRoberto Sassu size_t :0; 388243e3005SRoberto Sassu }; 389243e3005SRoberto Sassu #define bpf_get_fd_by_id_opts__last_field open_flags 390243e3005SRoberto Sassu 391ab9e0848SAndrey Ignatov LIBBPF_API int bpf_prog_get_fd_by_id(__u32 id); 3928f13f168SRoberto Sassu LIBBPF_API int bpf_prog_get_fd_by_id_opts(__u32 id, 3938f13f168SRoberto Sassu const struct bpf_get_fd_by_id_opts *opts); 394ab9e0848SAndrey Ignatov LIBBPF_API int bpf_map_get_fd_by_id(__u32 id); 395243e3005SRoberto Sassu LIBBPF_API int bpf_map_get_fd_by_id_opts(__u32 id, 396243e3005SRoberto Sassu const struct bpf_get_fd_by_id_opts *opts); 397ab9e0848SAndrey Ignatov LIBBPF_API int bpf_btf_get_fd_by_id(__u32 id); 3982ce7cbf2SRoberto Sassu LIBBPF_API int bpf_btf_get_fd_by_id_opts(__u32 id, 3992ce7cbf2SRoberto Sassu const struct bpf_get_fd_by_id_opts *opts); 4000dbc8668SAndrii Nakryiko LIBBPF_API int bpf_link_get_fd_by_id(__u32 id); 40197c8f9ddSRoberto Sassu LIBBPF_API int bpf_link_get_fd_by_id_opts(__u32 id, 40297c8f9ddSRoberto Sassu const struct bpf_get_fd_by_id_opts *opts); 4030dbc8668SAndrii Nakryiko LIBBPF_API int bpf_obj_get_info_by_fd(int bpf_fd, void *info, __u32 *info_len); 4040a504fa1SIlya Leoshkevich 4050a504fa1SIlya Leoshkevich /** 4060a504fa1SIlya Leoshkevich * @brief **bpf_prog_get_info_by_fd()** obtains information about the BPF 4070a504fa1SIlya Leoshkevich * program corresponding to *prog_fd*. 4080a504fa1SIlya Leoshkevich * 4090a504fa1SIlya Leoshkevich * Populates up to *info_len* bytes of *info* and updates *info_len* with the 4100a504fa1SIlya Leoshkevich * actual number of bytes written to *info*. 4110a504fa1SIlya Leoshkevich * 4120a504fa1SIlya Leoshkevich * @param prog_fd BPF program file descriptor 4130a504fa1SIlya Leoshkevich * @param info pointer to **struct bpf_prog_info** that will be populated with 4140a504fa1SIlya Leoshkevich * BPF program information 4150a504fa1SIlya Leoshkevich * @param info_len pointer to the size of *info*; on success updated with the 4160a504fa1SIlya Leoshkevich * number of bytes written to *info* 4170a504fa1SIlya Leoshkevich * @return 0, on success; negative error code, otherwise (errno is also set to 4180a504fa1SIlya Leoshkevich * the error code) 41955a9ed0eSIlya Leoshkevich */ 42055a9ed0eSIlya Leoshkevich LIBBPF_API int bpf_prog_get_info_by_fd(int prog_fd, struct bpf_prog_info *info, __u32 *info_len); 4210a504fa1SIlya Leoshkevich 4220a504fa1SIlya Leoshkevich /** 4230a504fa1SIlya Leoshkevich * @brief **bpf_map_get_info_by_fd()** obtains information about the BPF 4240a504fa1SIlya Leoshkevich * map corresponding to *map_fd*. 4250a504fa1SIlya Leoshkevich * 4260a504fa1SIlya Leoshkevich * Populates up to *info_len* bytes of *info* and updates *info_len* with the 4270a504fa1SIlya Leoshkevich * actual number of bytes written to *info*. 4280a504fa1SIlya Leoshkevich * 4290a504fa1SIlya Leoshkevich * @param map_fd BPF map file descriptor 4300a504fa1SIlya Leoshkevich * @param info pointer to **struct bpf_map_info** that will be populated with 4310a504fa1SIlya Leoshkevich * BPF map information 4320a504fa1SIlya Leoshkevich * @param info_len pointer to the size of *info*; on success updated with the 4330a504fa1SIlya Leoshkevich * number of bytes written to *info* 4340a504fa1SIlya Leoshkevich * @return 0, on success; negative error code, otherwise (errno is also set to 4350a504fa1SIlya Leoshkevich * the error code) 4360a504fa1SIlya Leoshkevich */ 43755a9ed0eSIlya Leoshkevich LIBBPF_API int bpf_map_get_info_by_fd(int map_fd, struct bpf_map_info *info, __u32 *info_len); 4380a504fa1SIlya Leoshkevich 4390a504fa1SIlya Leoshkevich /** 4400a504fa1SIlya Leoshkevich * @brief **bpf_btf_get_info_by_fd()** obtains information about the 4410a504fa1SIlya Leoshkevich * BTF object corresponding to *btf_fd*. 4420a504fa1SIlya Leoshkevich * 4430a504fa1SIlya Leoshkevich * Populates up to *info_len* bytes of *info* and updates *info_len* with the 4440a504fa1SIlya Leoshkevich * actual number of bytes written to *info*. 4450a504fa1SIlya Leoshkevich * 4460a504fa1SIlya Leoshkevich * @param btf_fd BTF object file descriptor 4470a504fa1SIlya Leoshkevich * @param info pointer to **struct bpf_btf_info** that will be populated with 4480a504fa1SIlya Leoshkevich * BTF object information 4490a504fa1SIlya Leoshkevich * @param info_len pointer to the size of *info*; on success updated with the 4500a504fa1SIlya Leoshkevich * number of bytes written to *info* 4510a504fa1SIlya Leoshkevich * @return 0, on success; negative error code, otherwise (errno is also set to 4520a504fa1SIlya Leoshkevich * the error code) 4530a504fa1SIlya Leoshkevich */ 45455a9ed0eSIlya Leoshkevich LIBBPF_API int bpf_btf_get_info_by_fd(int btf_fd, struct bpf_btf_info *info, __u32 *info_len); 4550a504fa1SIlya Leoshkevich 4560a504fa1SIlya Leoshkevich /** 4570a504fa1SIlya Leoshkevich * @brief **bpf_btf_get_info_by_fd()** obtains information about the BPF 4580a504fa1SIlya Leoshkevich * link corresponding to *link_fd*. 4590a504fa1SIlya Leoshkevich * 4600a504fa1SIlya Leoshkevich * Populates up to *info_len* bytes of *info* and updates *info_len* with the 4610a504fa1SIlya Leoshkevich * actual number of bytes written to *info*. 4620a504fa1SIlya Leoshkevich * 4630a504fa1SIlya Leoshkevich * @param link_fd BPF link file descriptor 4640a504fa1SIlya Leoshkevich * @param info pointer to **struct bpf_link_info** that will be populated with 4650a504fa1SIlya Leoshkevich * BPF link information 4660a504fa1SIlya Leoshkevich * @param info_len pointer to the size of *info*; on success updated with the 4670a504fa1SIlya Leoshkevich * number of bytes written to *info* 4680a504fa1SIlya Leoshkevich * @return 0, on success; negative error code, otherwise (errno is also set to 4690a504fa1SIlya Leoshkevich * the error code) 4700a504fa1SIlya Leoshkevich */ 47155a9ed0eSIlya Leoshkevich LIBBPF_API int bpf_link_get_info_by_fd(int link_fd, struct bpf_link_info *info, __u32 *info_len); 472a4b2f3cfSStanislav Fomichev 473a4b2f3cfSStanislav Fomichev struct bpf_prog_query_opts { 474a4b2f3cfSStanislav Fomichev size_t sz; /* size of this struct for forward/backward compatibility */ 475a4b2f3cfSStanislav Fomichev __u32 query_flags; 476a4b2f3cfSStanislav Fomichev __u32 attach_flags; /* output argument */ 477a4b2f3cfSStanislav Fomichev __u32 *prog_ids; 478a4b2f3cfSStanislav Fomichev __u32 prog_cnt; /* input+output argument */ 479a4b2f3cfSStanislav Fomichev __u32 *prog_attach_flags; 480a4b2f3cfSStanislav Fomichev }; 481a4b2f3cfSStanislav Fomichev #define bpf_prog_query_opts__last_field prog_attach_flags 482a4b2f3cfSStanislav Fomichev 483a4b2f3cfSStanislav Fomichev LIBBPF_API int bpf_prog_query_opts(int target_fd, 484a4b2f3cfSStanislav Fomichev enum bpf_attach_type type, 485a4b2f3cfSStanislav Fomichev struct bpf_prog_query_opts *opts); 486ab9e0848SAndrey Ignatov LIBBPF_API int bpf_prog_query(int target_fd, enum bpf_attach_type type, 487ab9e0848SAndrey Ignatov __u32 query_flags, __u32 *attach_flags, 488ab9e0848SAndrey Ignatov __u32 *prog_ids, __u32 *prog_cnt); 489a4b2f3cfSStanislav Fomichev 490ab9e0848SAndrey Ignatov LIBBPF_API int bpf_raw_tracepoint_open(const char *name, int prog_fd); 491ab9e0848SAndrey Ignatov LIBBPF_API int bpf_task_fd_query(int pid, int fd, __u32 flags, char *buf, 492ab9e0848SAndrey Ignatov __u32 *buf_len, __u32 *prog_id, __u32 *fd_type, 493ab9e0848SAndrey Ignatov __u64 *probe_offset, __u64 *probe_addr); 4944e15507fSAndrii Nakryiko 495b4269341SAndrii Nakryiko #ifdef __cplusplus 496b4269341SAndrii Nakryiko /* forward-declaring enums in C++ isn't compatible with pure C enums, so 497b4269341SAndrii Nakryiko * instead define bpf_enable_stats() as accepting int as an input 498b4269341SAndrii Nakryiko */ 499b4269341SAndrii Nakryiko LIBBPF_API int bpf_enable_stats(int type); 500b4269341SAndrii Nakryiko #else 5014e15507fSAndrii Nakryiko enum bpf_stats_type; /* defined in up-to-date linux/bpf.h */ 5020bee1067SSong Liu LIBBPF_API int bpf_enable_stats(enum bpf_stats_type type); 503b4269341SAndrii Nakryiko #endif 5048c4905b9SStanislav Fomichev 5055d23328dSYiFei Zhu struct bpf_prog_bind_opts { 5065d23328dSYiFei Zhu size_t sz; /* size of this struct for forward/backward compatibility */ 5075d23328dSYiFei Zhu __u32 flags; 5085d23328dSYiFei Zhu }; 5095d23328dSYiFei Zhu #define bpf_prog_bind_opts__last_field flags 5105d23328dSYiFei Zhu 5115d23328dSYiFei Zhu LIBBPF_API int bpf_prog_bind_map(int prog_fd, int map_fd, 5125d23328dSYiFei Zhu const struct bpf_prog_bind_opts *opts); 51388f7fe72SSong Liu 51488f7fe72SSong Liu struct bpf_test_run_opts { 51588f7fe72SSong Liu size_t sz; /* size of this struct for forward/backward compatibility */ 51688f7fe72SSong Liu const void *data_in; /* optional */ 51788f7fe72SSong Liu void *data_out; /* optional */ 51888f7fe72SSong Liu __u32 data_size_in; 51988f7fe72SSong Liu __u32 data_size_out; /* in: max length of data_out 52088f7fe72SSong Liu * out: length of data_out 52188f7fe72SSong Liu */ 52288f7fe72SSong Liu const void *ctx_in; /* optional */ 52388f7fe72SSong Liu void *ctx_out; /* optional */ 52488f7fe72SSong Liu __u32 ctx_size_in; 52588f7fe72SSong Liu __u32 ctx_size_out; /* in: max length of ctx_out 52688f7fe72SSong Liu * out: length of cxt_out 52788f7fe72SSong Liu */ 52888f7fe72SSong Liu __u32 retval; /* out: return code of the BPF program */ 52988f7fe72SSong Liu int repeat; 53088f7fe72SSong Liu __u32 duration; /* out: average per repetition in ns */ 53188f7fe72SSong Liu __u32 flags; 53288f7fe72SSong Liu __u32 cpu; 53324592ad1SToke Høiland-Jørgensen __u32 batch_size; 53488f7fe72SSong Liu }; 53524592ad1SToke Høiland-Jørgensen #define bpf_test_run_opts__last_field batch_size 53688f7fe72SSong Liu 53788f7fe72SSong Liu LIBBPF_API int bpf_prog_test_run_opts(int prog_fd, 53888f7fe72SSong Liu struct bpf_test_run_opts *opts); 53988f7fe72SSong Liu 5408c4905b9SStanislav Fomichev #ifdef __cplusplus 5418c4905b9SStanislav Fomichev } /* extern "C" */ 5428c4905b9SStanislav Fomichev #endif 5438c4905b9SStanislav Fomichev 544eff81908SAndrey Ignatov #endif /* __LIBBPF_BPF_H */ 545