1d9ae7f2bSJakub Kicinski /* 2854dc87dSJiong Wang * Copyright (C) 2016-2017 Netronome Systems, Inc. 3d9ae7f2bSJakub Kicinski * 4d9ae7f2bSJakub Kicinski * This software is dual licensed under the GNU General License Version 2, 5d9ae7f2bSJakub Kicinski * June 1991 as shown in the file COPYING in the top-level directory of this 6d9ae7f2bSJakub Kicinski * source tree or the BSD 2-Clause License provided below. You have the 7d9ae7f2bSJakub Kicinski * option to license this software under the complete terms of either license. 8d9ae7f2bSJakub Kicinski * 9d9ae7f2bSJakub Kicinski * The BSD 2-Clause License: 10d9ae7f2bSJakub Kicinski * 11d9ae7f2bSJakub Kicinski * Redistribution and use in source and binary forms, with or 12d9ae7f2bSJakub Kicinski * without modification, are permitted provided that the following 13d9ae7f2bSJakub Kicinski * conditions are met: 14d9ae7f2bSJakub Kicinski * 15d9ae7f2bSJakub Kicinski * 1. Redistributions of source code must retain the above 16d9ae7f2bSJakub Kicinski * copyright notice, this list of conditions and the following 17d9ae7f2bSJakub Kicinski * disclaimer. 18d9ae7f2bSJakub Kicinski * 19d9ae7f2bSJakub Kicinski * 2. Redistributions in binary form must reproduce the above 20d9ae7f2bSJakub Kicinski * copyright notice, this list of conditions and the following 21d9ae7f2bSJakub Kicinski * disclaimer in the documentation and/or other materials 22d9ae7f2bSJakub Kicinski * provided with the distribution. 23d9ae7f2bSJakub Kicinski * 24d9ae7f2bSJakub Kicinski * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 25d9ae7f2bSJakub Kicinski * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 26d9ae7f2bSJakub Kicinski * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 27d9ae7f2bSJakub Kicinski * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS 28d9ae7f2bSJakub Kicinski * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 29d9ae7f2bSJakub Kicinski * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN 30d9ae7f2bSJakub Kicinski * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 31d9ae7f2bSJakub Kicinski * SOFTWARE. 32d9ae7f2bSJakub Kicinski */ 33d9ae7f2bSJakub Kicinski 34d9ae7f2bSJakub Kicinski #ifndef __NFP_BPF_H__ 35d9ae7f2bSJakub Kicinski #define __NFP_BPF_H__ 1 36d9ae7f2bSJakub Kicinski 37d9ae7f2bSJakub Kicinski #include <linux/bitfield.h> 38d9ae7f2bSJakub Kicinski #include <linux/bpf.h> 392ca71441SJakub Kicinski #include <linux/bpf_verifier.h> 40d48ae231SJakub Kicinski #include <linux/kernel.h> 41d9ae7f2bSJakub Kicinski #include <linux/list.h> 42d48ae231SJakub Kicinski #include <linux/skbuff.h> 43d9ae7f2bSJakub Kicinski #include <linux/types.h> 44d48ae231SJakub Kicinski #include <linux/wait.h> 45d9ae7f2bSJakub Kicinski 46b3f868dfSJakub Kicinski #include "../nfp_asm.h" 47d48ae231SJakub Kicinski #include "fw.h" 48c66a9cf4SJakub Kicinski 492314fe9eSJakub Kicinski /* For relocation logic use up-most byte of branch instruction as scratch 50d9ae7f2bSJakub Kicinski * area. Remember to clear this before sending instructions to HW! 51d9ae7f2bSJakub Kicinski */ 522314fe9eSJakub Kicinski #define OP_RELO_TYPE 0xff00000000000000ULL 53d9ae7f2bSJakub Kicinski 542314fe9eSJakub Kicinski enum nfp_relo_type { 552314fe9eSJakub Kicinski RELO_NONE = 0, 562314fe9eSJakub Kicinski /* standard internal jumps */ 572314fe9eSJakub Kicinski RELO_BR_REL, 582314fe9eSJakub Kicinski /* internal jumps to parts of the outro */ 592314fe9eSJakub Kicinski RELO_BR_GO_OUT, 602314fe9eSJakub Kicinski RELO_BR_GO_ABORT, 612314fe9eSJakub Kicinski /* external jumps to fixed addresses */ 622314fe9eSJakub Kicinski RELO_BR_NEXT_PKT, 6377a3d311SJakub Kicinski RELO_BR_HELPER, 6477a3d311SJakub Kicinski /* immediate relocation against load address */ 6577a3d311SJakub Kicinski RELO_IMMED_REL, 66d9ae7f2bSJakub Kicinski }; 67d9ae7f2bSJakub Kicinski 68e84797feSJakub Kicinski /* To make absolute relocated branches (branches other than RELO_BR_REL) 69e84797feSJakub Kicinski * distinguishable in user space dumps from normal jumps, add a large offset 70e84797feSJakub Kicinski * to them. 71e84797feSJakub Kicinski */ 72e84797feSJakub Kicinski #define BR_OFF_RELO 15000 73e84797feSJakub Kicinski 74d9ae7f2bSJakub Kicinski enum static_regs { 7518e53b6cSJakub Kicinski STATIC_REG_IMM = 21, /* Bank AB */ 76d3488480SJakub Kicinski STATIC_REG_STACK = 22, /* Bank A */ 7718e53b6cSJakub Kicinski STATIC_REG_PKT_LEN = 22, /* Bank B */ 7818e53b6cSJakub Kicinski }; 7918e53b6cSJakub Kicinski 8018e53b6cSJakub Kicinski enum pkt_vec { 8118e53b6cSJakub Kicinski PKT_VEC_PKT_LEN = 0, 8218e53b6cSJakub Kicinski PKT_VEC_PKT_PTR = 2, 83d9ae7f2bSJakub Kicinski }; 84d9ae7f2bSJakub Kicinski 8518e53b6cSJakub Kicinski #define pv_len(np) reg_lm(1, PKT_VEC_PKT_LEN) 8618e53b6cSJakub Kicinski #define pv_ctm_ptr(np) reg_lm(1, PKT_VEC_PKT_PTR) 8718e53b6cSJakub Kicinski 88d3488480SJakub Kicinski #define stack_reg(np) reg_a(STATIC_REG_STACK) 89d3488480SJakub Kicinski #define stack_imm(np) imm_b(np) 9018e53b6cSJakub Kicinski #define plen_reg(np) reg_b(STATIC_REG_PKT_LEN) 9118e53b6cSJakub Kicinski #define pptr_reg(np) pv_ctm_ptr(np) 9218e53b6cSJakub Kicinski #define imm_a(np) reg_a(STATIC_REG_IMM) 9318e53b6cSJakub Kicinski #define imm_b(np) reg_b(STATIC_REG_IMM) 9418e53b6cSJakub Kicinski #define imm_both(np) reg_both(STATIC_REG_IMM) 95d9ae7f2bSJakub Kicinski 96509144e2SJakub Kicinski #define NFP_BPF_ABI_FLAGS reg_imm(0) 97d9ae7f2bSJakub Kicinski #define NFP_BPF_ABI_FLAG_MARK 1 98d9ae7f2bSJakub Kicinski 9977a844eeSJakub Kicinski /** 10077a844eeSJakub Kicinski * struct nfp_app_bpf - bpf app priv structure 10177a844eeSJakub Kicinski * @app: backpointer to the app 1020d49eaf4SJakub Kicinski * 103d48ae231SJakub Kicinski * @tag_allocator: bitmap of control message tags in use 104d48ae231SJakub Kicinski * @tag_alloc_next: next tag bit to allocate 105d48ae231SJakub Kicinski * @tag_alloc_last: next tag bit to be freed 106d48ae231SJakub Kicinski * 107d48ae231SJakub Kicinski * @cmsg_replies: received cmsg replies waiting to be consumed 108d48ae231SJakub Kicinski * @cmsg_wq: work queue for waiting for cmsg replies 109d48ae231SJakub Kicinski * 1104da98eeaSJakub Kicinski * @map_list: list of offloaded maps 1111bba4c41SJakub Kicinski * @maps_in_use: number of currently offloaded maps 1121bba4c41SJakub Kicinski * @map_elems_in_use: number of elements allocated to offloaded maps 1134da98eeaSJakub Kicinski * 1140d49eaf4SJakub Kicinski * @adjust_head: adjust head capability 1150d49eaf4SJakub Kicinski * @flags: extra flags for adjust head 1160d49eaf4SJakub Kicinski * @off_min: minimal packet offset within buffer required 1170d49eaf4SJakub Kicinski * @off_max: maximum packet offset within buffer required 1188231f844SJakub Kicinski * @guaranteed_sub: amount of negative adjustment guaranteed possible 1198231f844SJakub Kicinski * @guaranteed_add: amount of positive adjustment guaranteed possible 1209d080d5dSJakub Kicinski * 1219d080d5dSJakub Kicinski * @maps: map capability 1229d080d5dSJakub Kicinski * @types: supported map types 1239d080d5dSJakub Kicinski * @max_maps: max number of maps supported 1249d080d5dSJakub Kicinski * @max_elems: max number of entries in each map 1259d080d5dSJakub Kicinski * @max_key_sz: max size of map key 1269d080d5dSJakub Kicinski * @max_val_sz: max size of map value 1279d080d5dSJakub Kicinski * @max_elem_sz: max size of map entry (key + value) 1289d080d5dSJakub Kicinski * 1299d080d5dSJakub Kicinski * @helpers: helper addressess for various calls 1309d080d5dSJakub Kicinski * @map_lookup: map lookup helper address 13177a844eeSJakub Kicinski */ 13277a844eeSJakub Kicinski struct nfp_app_bpf { 13377a844eeSJakub Kicinski struct nfp_app *app; 1340d49eaf4SJakub Kicinski 135d48ae231SJakub Kicinski DECLARE_BITMAP(tag_allocator, U16_MAX + 1); 136d48ae231SJakub Kicinski u16 tag_alloc_next; 137d48ae231SJakub Kicinski u16 tag_alloc_last; 138d48ae231SJakub Kicinski 139d48ae231SJakub Kicinski struct sk_buff_head cmsg_replies; 140d48ae231SJakub Kicinski struct wait_queue_head cmsg_wq; 141d48ae231SJakub Kicinski 1424da98eeaSJakub Kicinski struct list_head map_list; 1431bba4c41SJakub Kicinski unsigned int maps_in_use; 1441bba4c41SJakub Kicinski unsigned int map_elems_in_use; 1454da98eeaSJakub Kicinski 1460d49eaf4SJakub Kicinski struct nfp_bpf_cap_adjust_head { 1470d49eaf4SJakub Kicinski u32 flags; 1480d49eaf4SJakub Kicinski int off_min; 1490d49eaf4SJakub Kicinski int off_max; 1508231f844SJakub Kicinski int guaranteed_sub; 1518231f844SJakub Kicinski int guaranteed_add; 1520d49eaf4SJakub Kicinski } adjust_head; 1539d080d5dSJakub Kicinski 1549d080d5dSJakub Kicinski struct { 1559d080d5dSJakub Kicinski u32 types; 1569d080d5dSJakub Kicinski u32 max_maps; 1579d080d5dSJakub Kicinski u32 max_elems; 1589d080d5dSJakub Kicinski u32 max_key_sz; 1599d080d5dSJakub Kicinski u32 max_val_sz; 1609d080d5dSJakub Kicinski u32 max_elem_sz; 1619d080d5dSJakub Kicinski } maps; 1629d080d5dSJakub Kicinski 1639d080d5dSJakub Kicinski struct { 1649d080d5dSJakub Kicinski u32 map_lookup; 1659d080d5dSJakub Kicinski } helpers; 16677a844eeSJakub Kicinski }; 16777a844eeSJakub Kicinski 1684da98eeaSJakub Kicinski /** 1694da98eeaSJakub Kicinski * struct nfp_bpf_map - private per-map data attached to BPF maps for offload 1704da98eeaSJakub Kicinski * @offmap: pointer to the offloaded BPF map 1714da98eeaSJakub Kicinski * @bpf: back pointer to bpf app private structure 1724da98eeaSJakub Kicinski * @tid: table id identifying map on datapath 1734da98eeaSJakub Kicinski * @l: link on the nfp_app_bpf->map_list list 1744da98eeaSJakub Kicinski */ 1754da98eeaSJakub Kicinski struct nfp_bpf_map { 1764da98eeaSJakub Kicinski struct bpf_offloaded_map *offmap; 1774da98eeaSJakub Kicinski struct nfp_app_bpf *bpf; 1784da98eeaSJakub Kicinski u32 tid; 1794da98eeaSJakub Kicinski struct list_head l; 1804da98eeaSJakub Kicinski }; 1814da98eeaSJakub Kicinski 182d9ae7f2bSJakub Kicinski struct nfp_prog; 183d9ae7f2bSJakub Kicinski struct nfp_insn_meta; 184d9ae7f2bSJakub Kicinski typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *); 185d9ae7f2bSJakub Kicinski 186d9ae7f2bSJakub Kicinski #define nfp_prog_first_meta(nfp_prog) \ 187d9ae7f2bSJakub Kicinski list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 188d9ae7f2bSJakub Kicinski #define nfp_prog_last_meta(nfp_prog) \ 189d9ae7f2bSJakub Kicinski list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 190d9ae7f2bSJakub Kicinski #define nfp_meta_next(meta) list_next_entry(meta, l) 191d9ae7f2bSJakub Kicinski #define nfp_meta_prev(meta) list_prev_entry(meta, l) 192d9ae7f2bSJakub Kicinski 193a09d5c52SJiong Wang #define FLAG_INSN_IS_JUMP_DST BIT(0) 194a09d5c52SJiong Wang 195d9ae7f2bSJakub Kicinski /** 196d9ae7f2bSJakub Kicinski * struct nfp_insn_meta - BPF instruction wrapper 197d9ae7f2bSJakub Kicinski * @insn: BPF instruction 1982ca71441SJakub Kicinski * @ptr: pointer type for memory operations 1999879a381SJiong Wang * @ldst_gather_len: memcpy length gathered from load/store sequence 2009879a381SJiong Wang * @paired_st: the paired store insn at the head of the sequence 201b14157eeSJakub Kicinski * @ptr_not_const: pointer is not always constant 2025b674140SJiong Wang * @jmp_dst: destination info for jump instructions 20377a3d311SJakub Kicinski * @func_id: function id for call instructions 20477a3d311SJakub Kicinski * @arg1: arg1 for call instructions 20577a3d311SJakub Kicinski * @arg2: arg2 for call instructions 20677a3d311SJakub Kicinski * @arg2_var_off: arg2 changes stack offset on different paths 207d9ae7f2bSJakub Kicinski * @off: index of first generated machine instruction (in nfp_prog.prog) 208d9ae7f2bSJakub Kicinski * @n: eBPF instruction number 209a09d5c52SJiong Wang * @flags: eBPF instruction extra optimization flags 210d9ae7f2bSJakub Kicinski * @skip: skip this instruction (optimized out) 211d9ae7f2bSJakub Kicinski * @double_cb: callback for second part of the instruction 212d9ae7f2bSJakub Kicinski * @l: link on nfp_prog->insns list 213d9ae7f2bSJakub Kicinski */ 214d9ae7f2bSJakub Kicinski struct nfp_insn_meta { 215d9ae7f2bSJakub Kicinski struct bpf_insn insn; 2165b674140SJiong Wang union { 2175b674140SJiong Wang struct { 2182ca71441SJakub Kicinski struct bpf_reg_state ptr; 2199879a381SJiong Wang struct bpf_insn *paired_st; 2209879a381SJiong Wang s16 ldst_gather_len; 221b14157eeSJakub Kicinski bool ptr_not_const; 2225b674140SJiong Wang }; 2235b674140SJiong Wang struct nfp_insn_meta *jmp_dst; 22477a3d311SJakub Kicinski struct { 22577a3d311SJakub Kicinski u32 func_id; 22677a3d311SJakub Kicinski struct bpf_reg_state arg1; 2278231f844SJakub Kicinski struct bpf_reg_state arg2; 22877a3d311SJakub Kicinski bool arg2_var_off; 22977a3d311SJakub Kicinski }; 2305b674140SJiong Wang }; 231d9ae7f2bSJakub Kicinski unsigned int off; 232d9ae7f2bSJakub Kicinski unsigned short n; 233a09d5c52SJiong Wang unsigned short flags; 234d9ae7f2bSJakub Kicinski bool skip; 235d9ae7f2bSJakub Kicinski instr_cb_t double_cb; 236d9ae7f2bSJakub Kicinski 237d9ae7f2bSJakub Kicinski struct list_head l; 238d9ae7f2bSJakub Kicinski }; 239d9ae7f2bSJakub Kicinski 240d9ae7f2bSJakub Kicinski #define BPF_SIZE_MASK 0x18 241d9ae7f2bSJakub Kicinski 242d9ae7f2bSJakub Kicinski static inline u8 mbpf_class(const struct nfp_insn_meta *meta) 243d9ae7f2bSJakub Kicinski { 244d9ae7f2bSJakub Kicinski return BPF_CLASS(meta->insn.code); 245d9ae7f2bSJakub Kicinski } 246d9ae7f2bSJakub Kicinski 247d9ae7f2bSJakub Kicinski static inline u8 mbpf_src(const struct nfp_insn_meta *meta) 248d9ae7f2bSJakub Kicinski { 249d9ae7f2bSJakub Kicinski return BPF_SRC(meta->insn.code); 250d9ae7f2bSJakub Kicinski } 251d9ae7f2bSJakub Kicinski 252d9ae7f2bSJakub Kicinski static inline u8 mbpf_op(const struct nfp_insn_meta *meta) 253d9ae7f2bSJakub Kicinski { 254d9ae7f2bSJakub Kicinski return BPF_OP(meta->insn.code); 255d9ae7f2bSJakub Kicinski } 256d9ae7f2bSJakub Kicinski 257d9ae7f2bSJakub Kicinski static inline u8 mbpf_mode(const struct nfp_insn_meta *meta) 258d9ae7f2bSJakub Kicinski { 259d9ae7f2bSJakub Kicinski return BPF_MODE(meta->insn.code); 260d9ae7f2bSJakub Kicinski } 261d9ae7f2bSJakub Kicinski 2625e4d6d20SJiong Wang static inline bool is_mbpf_load(const struct nfp_insn_meta *meta) 2635e4d6d20SJiong Wang { 2645e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM); 2655e4d6d20SJiong Wang } 2665e4d6d20SJiong Wang 2675e4d6d20SJiong Wang static inline bool is_mbpf_store(const struct nfp_insn_meta *meta) 2685e4d6d20SJiong Wang { 2695e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM); 2705e4d6d20SJiong Wang } 2715e4d6d20SJiong Wang 272d9ae7f2bSJakub Kicinski /** 273d9ae7f2bSJakub Kicinski * struct nfp_prog - nfp BPF program 27477a844eeSJakub Kicinski * @bpf: backpointer to the bpf app priv structure 275d9ae7f2bSJakub Kicinski * @prog: machine code 276d9ae7f2bSJakub Kicinski * @prog_len: number of valid instructions in @prog array 277d9ae7f2bSJakub Kicinski * @__prog_alloc_len: alloc size of @prog array 278c6c580d7SJakub Kicinski * @verifier_meta: temporary storage for verifier's insn meta 279012bb8a8SJakub Kicinski * @type: BPF program type 280854dc87dSJiong Wang * @last_bpf_off: address of the last instruction translated from BPF 281d9ae7f2bSJakub Kicinski * @tgt_out: jump target for normal exit 282d9ae7f2bSJakub Kicinski * @tgt_abort: jump target for abort (e.g. access outside of packet buffer) 283d9ae7f2bSJakub Kicinski * @n_translated: number of successfully translated instructions (for errors) 284d9ae7f2bSJakub Kicinski * @error: error code if something went wrong 285ee9133a8SJakub Kicinski * @stack_depth: max stack depth from the verifier 2868231f844SJakub Kicinski * @adjust_head_location: if program has single adjust head call - the insn no. 287d9ae7f2bSJakub Kicinski * @insns: list of BPF instruction wrappers (struct nfp_insn_meta) 288d9ae7f2bSJakub Kicinski */ 289d9ae7f2bSJakub Kicinski struct nfp_prog { 29077a844eeSJakub Kicinski struct nfp_app_bpf *bpf; 29177a844eeSJakub Kicinski 292d9ae7f2bSJakub Kicinski u64 *prog; 293d9ae7f2bSJakub Kicinski unsigned int prog_len; 294d9ae7f2bSJakub Kicinski unsigned int __prog_alloc_len; 295d9ae7f2bSJakub Kicinski 296c6c580d7SJakub Kicinski struct nfp_insn_meta *verifier_meta; 297c6c580d7SJakub Kicinski 298012bb8a8SJakub Kicinski enum bpf_prog_type type; 299d9ae7f2bSJakub Kicinski 300854dc87dSJiong Wang unsigned int last_bpf_off; 301d9ae7f2bSJakub Kicinski unsigned int tgt_out; 302d9ae7f2bSJakub Kicinski unsigned int tgt_abort; 303d9ae7f2bSJakub Kicinski 304d9ae7f2bSJakub Kicinski unsigned int n_translated; 305d9ae7f2bSJakub Kicinski int error; 306d9ae7f2bSJakub Kicinski 307ee9133a8SJakub Kicinski unsigned int stack_depth; 3088231f844SJakub Kicinski unsigned int adjust_head_location; 309ee9133a8SJakub Kicinski 310d9ae7f2bSJakub Kicinski struct list_head insns; 311d9ae7f2bSJakub Kicinski }; 312d9ae7f2bSJakub Kicinski 313d3f89b98SJakub Kicinski /** 314d3f89b98SJakub Kicinski * struct nfp_bpf_vnic - per-vNIC BPF priv structure 315d3f89b98SJakub Kicinski * @tc_prog: currently loaded cls_bpf program 3162314fe9eSJakub Kicinski * @start_off: address of the first instruction in the memory 3172314fe9eSJakub Kicinski * @tgt_done: jump target to get the next packet 318d3f89b98SJakub Kicinski */ 319d3f89b98SJakub Kicinski struct nfp_bpf_vnic { 320d3f89b98SJakub Kicinski struct bpf_prog *tc_prog; 3212314fe9eSJakub Kicinski unsigned int start_off; 3222314fe9eSJakub Kicinski unsigned int tgt_done; 323d3f89b98SJakub Kicinski }; 324d3f89b98SJakub Kicinski 3251549921dSJakub Kicinski void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt); 326c6c580d7SJakub Kicinski int nfp_bpf_jit(struct nfp_prog *prog); 32774801e50SQuentin Monnet bool nfp_bpf_supported_opcode(u8 code); 328d9ae7f2bSJakub Kicinski 329cae1927cSJakub Kicinski extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops; 330d9ae7f2bSJakub Kicinski 331c6c580d7SJakub Kicinski struct netdev_bpf; 332c6c580d7SJakub Kicinski struct nfp_app; 333bb45e51cSJakub Kicinski struct nfp_net; 334bb45e51cSJakub Kicinski 335af93d15aSJakub Kicinski int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn, 336af93d15aSJakub Kicinski struct netdev_bpf *bpf); 3379ce7a956SJakub Kicinski int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog, 338e4a91cd5SJakub Kicinski bool old_prog); 339bb45e51cSJakub Kicinski 3405b674140SJiong Wang struct nfp_insn_meta * 3415b674140SJiong Wang nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta, 3425b674140SJiong Wang unsigned int insn_idx, unsigned int n_insns); 3432314fe9eSJakub Kicinski 3442314fe9eSJakub Kicinski void *nfp_bpf_relo_for_vnic(struct nfp_prog *nfp_prog, struct nfp_bpf_vnic *bv); 345d48ae231SJakub Kicinski 346ff3d43f7SJakub Kicinski long long int 347ff3d43f7SJakub Kicinski nfp_bpf_ctrl_alloc_map(struct nfp_app_bpf *bpf, struct bpf_map *map); 348ff3d43f7SJakub Kicinski void 349ff3d43f7SJakub Kicinski nfp_bpf_ctrl_free_map(struct nfp_app_bpf *bpf, struct nfp_bpf_map *nfp_map); 350ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getfirst_entry(struct bpf_offloaded_map *offmap, 351ff3d43f7SJakub Kicinski void *next_key); 352ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_update_entry(struct bpf_offloaded_map *offmap, 353ff3d43f7SJakub Kicinski void *key, void *value, u64 flags); 354ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_del_entry(struct bpf_offloaded_map *offmap, void *key); 355ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_lookup_entry(struct bpf_offloaded_map *offmap, 356ff3d43f7SJakub Kicinski void *key, void *value); 357ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getnext_entry(struct bpf_offloaded_map *offmap, 358ff3d43f7SJakub Kicinski void *key, void *next_key); 359ff3d43f7SJakub Kicinski 360d48ae231SJakub Kicinski void nfp_bpf_ctrl_msg_rx(struct nfp_app *app, struct sk_buff *skb); 361d9ae7f2bSJakub Kicinski #endif 362