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,
63d9ae7f2bSJakub Kicinski };
64d9ae7f2bSJakub Kicinski 
65e84797feSJakub Kicinski /* To make absolute relocated branches (branches other than RELO_BR_REL)
66e84797feSJakub Kicinski  * distinguishable in user space dumps from normal jumps, add a large offset
67e84797feSJakub Kicinski  * to them.
68e84797feSJakub Kicinski  */
69e84797feSJakub Kicinski #define BR_OFF_RELO		15000
70e84797feSJakub Kicinski 
71d9ae7f2bSJakub Kicinski enum static_regs {
7218e53b6cSJakub Kicinski 	STATIC_REG_IMM		= 21, /* Bank AB */
73d3488480SJakub Kicinski 	STATIC_REG_STACK	= 22, /* Bank A */
7418e53b6cSJakub Kicinski 	STATIC_REG_PKT_LEN	= 22, /* Bank B */
7518e53b6cSJakub Kicinski };
7618e53b6cSJakub Kicinski 
7718e53b6cSJakub Kicinski enum pkt_vec {
7818e53b6cSJakub Kicinski 	PKT_VEC_PKT_LEN		= 0,
7918e53b6cSJakub Kicinski 	PKT_VEC_PKT_PTR		= 2,
80d9ae7f2bSJakub Kicinski };
81d9ae7f2bSJakub Kicinski 
8218e53b6cSJakub Kicinski #define pv_len(np)	reg_lm(1, PKT_VEC_PKT_LEN)
8318e53b6cSJakub Kicinski #define pv_ctm_ptr(np)	reg_lm(1, PKT_VEC_PKT_PTR)
8418e53b6cSJakub Kicinski 
85d3488480SJakub Kicinski #define stack_reg(np)	reg_a(STATIC_REG_STACK)
86d3488480SJakub Kicinski #define stack_imm(np)	imm_b(np)
8718e53b6cSJakub Kicinski #define plen_reg(np)	reg_b(STATIC_REG_PKT_LEN)
8818e53b6cSJakub Kicinski #define pptr_reg(np)	pv_ctm_ptr(np)
8918e53b6cSJakub Kicinski #define imm_a(np)	reg_a(STATIC_REG_IMM)
9018e53b6cSJakub Kicinski #define imm_b(np)	reg_b(STATIC_REG_IMM)
9118e53b6cSJakub Kicinski #define imm_both(np)	reg_both(STATIC_REG_IMM)
92d9ae7f2bSJakub Kicinski 
93509144e2SJakub Kicinski #define NFP_BPF_ABI_FLAGS	reg_imm(0)
94d9ae7f2bSJakub Kicinski #define   NFP_BPF_ABI_FLAG_MARK	1
95d9ae7f2bSJakub Kicinski 
9677a844eeSJakub Kicinski /**
9777a844eeSJakub Kicinski  * struct nfp_app_bpf - bpf app priv structure
9877a844eeSJakub Kicinski  * @app:		backpointer to the app
990d49eaf4SJakub Kicinski  *
100d48ae231SJakub Kicinski  * @tag_allocator:	bitmap of control message tags in use
101d48ae231SJakub Kicinski  * @tag_alloc_next:	next tag bit to allocate
102d48ae231SJakub Kicinski  * @tag_alloc_last:	next tag bit to be freed
103d48ae231SJakub Kicinski  *
104d48ae231SJakub Kicinski  * @cmsg_replies:	received cmsg replies waiting to be consumed
105d48ae231SJakub Kicinski  * @cmsg_wq:		work queue for waiting for cmsg replies
106d48ae231SJakub Kicinski  *
1074da98eeaSJakub Kicinski  * @map_list:		list of offloaded maps
1084da98eeaSJakub Kicinski  *
1090d49eaf4SJakub Kicinski  * @adjust_head:	adjust head capability
1100d49eaf4SJakub Kicinski  * @flags:		extra flags for adjust head
1110d49eaf4SJakub Kicinski  * @off_min:		minimal packet offset within buffer required
1120d49eaf4SJakub Kicinski  * @off_max:		maximum packet offset within buffer required
1138231f844SJakub Kicinski  * @guaranteed_sub:	amount of negative adjustment guaranteed possible
1148231f844SJakub Kicinski  * @guaranteed_add:	amount of positive adjustment guaranteed possible
1159d080d5dSJakub Kicinski  *
1169d080d5dSJakub Kicinski  * @maps:		map capability
1179d080d5dSJakub Kicinski  * @types:		supported map types
1189d080d5dSJakub Kicinski  * @max_maps:		max number of maps supported
1199d080d5dSJakub Kicinski  * @max_elems:		max number of entries in each map
1209d080d5dSJakub Kicinski  * @max_key_sz:		max size of map key
1219d080d5dSJakub Kicinski  * @max_val_sz:		max size of map value
1229d080d5dSJakub Kicinski  * @max_elem_sz:	max size of map entry (key + value)
1239d080d5dSJakub Kicinski  *
1249d080d5dSJakub Kicinski  * @helpers:		helper addressess for various calls
1259d080d5dSJakub Kicinski  * @map_lookup:		map lookup helper address
12677a844eeSJakub Kicinski  */
12777a844eeSJakub Kicinski struct nfp_app_bpf {
12877a844eeSJakub Kicinski 	struct nfp_app *app;
1290d49eaf4SJakub Kicinski 
130d48ae231SJakub Kicinski 	DECLARE_BITMAP(tag_allocator, U16_MAX + 1);
131d48ae231SJakub Kicinski 	u16 tag_alloc_next;
132d48ae231SJakub Kicinski 	u16 tag_alloc_last;
133d48ae231SJakub Kicinski 
134d48ae231SJakub Kicinski 	struct sk_buff_head cmsg_replies;
135d48ae231SJakub Kicinski 	struct wait_queue_head cmsg_wq;
136d48ae231SJakub Kicinski 
1374da98eeaSJakub Kicinski 	struct list_head map_list;
1384da98eeaSJakub Kicinski 
1390d49eaf4SJakub Kicinski 	struct nfp_bpf_cap_adjust_head {
1400d49eaf4SJakub Kicinski 		u32 flags;
1410d49eaf4SJakub Kicinski 		int off_min;
1420d49eaf4SJakub Kicinski 		int off_max;
1438231f844SJakub Kicinski 		int guaranteed_sub;
1448231f844SJakub Kicinski 		int guaranteed_add;
1450d49eaf4SJakub Kicinski 	} adjust_head;
1469d080d5dSJakub Kicinski 
1479d080d5dSJakub Kicinski 	struct {
1489d080d5dSJakub Kicinski 		u32 types;
1499d080d5dSJakub Kicinski 		u32 max_maps;
1509d080d5dSJakub Kicinski 		u32 max_elems;
1519d080d5dSJakub Kicinski 		u32 max_key_sz;
1529d080d5dSJakub Kicinski 		u32 max_val_sz;
1539d080d5dSJakub Kicinski 		u32 max_elem_sz;
1549d080d5dSJakub Kicinski 	} maps;
1559d080d5dSJakub Kicinski 
1569d080d5dSJakub Kicinski 	struct {
1579d080d5dSJakub Kicinski 		u32 map_lookup;
1589d080d5dSJakub Kicinski 	} helpers;
15977a844eeSJakub Kicinski };
16077a844eeSJakub Kicinski 
1614da98eeaSJakub Kicinski /**
1624da98eeaSJakub Kicinski  * struct nfp_bpf_map - private per-map data attached to BPF maps for offload
1634da98eeaSJakub Kicinski  * @offmap:	pointer to the offloaded BPF map
1644da98eeaSJakub Kicinski  * @bpf:	back pointer to bpf app private structure
1654da98eeaSJakub Kicinski  * @tid:	table id identifying map on datapath
1664da98eeaSJakub Kicinski  * @l:		link on the nfp_app_bpf->map_list list
1674da98eeaSJakub Kicinski  */
1684da98eeaSJakub Kicinski struct nfp_bpf_map {
1694da98eeaSJakub Kicinski 	struct bpf_offloaded_map *offmap;
1704da98eeaSJakub Kicinski 	struct nfp_app_bpf *bpf;
1714da98eeaSJakub Kicinski 	u32 tid;
1724da98eeaSJakub Kicinski 	struct list_head l;
1734da98eeaSJakub Kicinski };
1744da98eeaSJakub Kicinski 
175d9ae7f2bSJakub Kicinski struct nfp_prog;
176d9ae7f2bSJakub Kicinski struct nfp_insn_meta;
177d9ae7f2bSJakub Kicinski typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *);
178d9ae7f2bSJakub Kicinski 
179d9ae7f2bSJakub Kicinski #define nfp_prog_first_meta(nfp_prog)					\
180d9ae7f2bSJakub Kicinski 	list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l)
181d9ae7f2bSJakub Kicinski #define nfp_prog_last_meta(nfp_prog)					\
182d9ae7f2bSJakub Kicinski 	list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l)
183d9ae7f2bSJakub Kicinski #define nfp_meta_next(meta)	list_next_entry(meta, l)
184d9ae7f2bSJakub Kicinski #define nfp_meta_prev(meta)	list_prev_entry(meta, l)
185d9ae7f2bSJakub Kicinski 
186a09d5c52SJiong Wang #define FLAG_INSN_IS_JUMP_DST	BIT(0)
187a09d5c52SJiong Wang 
188d9ae7f2bSJakub Kicinski /**
189d9ae7f2bSJakub Kicinski  * struct nfp_insn_meta - BPF instruction wrapper
190d9ae7f2bSJakub Kicinski  * @insn: BPF instruction
1912ca71441SJakub Kicinski  * @ptr: pointer type for memory operations
1929879a381SJiong Wang  * @ldst_gather_len: memcpy length gathered from load/store sequence
1939879a381SJiong Wang  * @paired_st: the paired store insn at the head of the sequence
1948231f844SJakub Kicinski  * @arg2: arg2 for call instructions
195b14157eeSJakub Kicinski  * @ptr_not_const: pointer is not always constant
1965b674140SJiong Wang  * @jmp_dst: destination info for jump instructions
197d9ae7f2bSJakub Kicinski  * @off: index of first generated machine instruction (in nfp_prog.prog)
198d9ae7f2bSJakub Kicinski  * @n: eBPF instruction number
199a09d5c52SJiong Wang  * @flags: eBPF instruction extra optimization flags
200d9ae7f2bSJakub Kicinski  * @skip: skip this instruction (optimized out)
201d9ae7f2bSJakub Kicinski  * @double_cb: callback for second part of the instruction
202d9ae7f2bSJakub Kicinski  * @l: link on nfp_prog->insns list
203d9ae7f2bSJakub Kicinski  */
204d9ae7f2bSJakub Kicinski struct nfp_insn_meta {
205d9ae7f2bSJakub Kicinski 	struct bpf_insn insn;
2065b674140SJiong Wang 	union {
2075b674140SJiong Wang 		struct {
2082ca71441SJakub Kicinski 			struct bpf_reg_state ptr;
2099879a381SJiong Wang 			struct bpf_insn *paired_st;
2109879a381SJiong Wang 			s16 ldst_gather_len;
211b14157eeSJakub Kicinski 			bool ptr_not_const;
2125b674140SJiong Wang 		};
2135b674140SJiong Wang 		struct nfp_insn_meta *jmp_dst;
2148231f844SJakub Kicinski 		struct bpf_reg_state arg2;
2155b674140SJiong Wang 	};
216d9ae7f2bSJakub Kicinski 	unsigned int off;
217d9ae7f2bSJakub Kicinski 	unsigned short n;
218a09d5c52SJiong Wang 	unsigned short flags;
219d9ae7f2bSJakub Kicinski 	bool skip;
220d9ae7f2bSJakub Kicinski 	instr_cb_t double_cb;
221d9ae7f2bSJakub Kicinski 
222d9ae7f2bSJakub Kicinski 	struct list_head l;
223d9ae7f2bSJakub Kicinski };
224d9ae7f2bSJakub Kicinski 
225d9ae7f2bSJakub Kicinski #define BPF_SIZE_MASK	0x18
226d9ae7f2bSJakub Kicinski 
227d9ae7f2bSJakub Kicinski static inline u8 mbpf_class(const struct nfp_insn_meta *meta)
228d9ae7f2bSJakub Kicinski {
229d9ae7f2bSJakub Kicinski 	return BPF_CLASS(meta->insn.code);
230d9ae7f2bSJakub Kicinski }
231d9ae7f2bSJakub Kicinski 
232d9ae7f2bSJakub Kicinski static inline u8 mbpf_src(const struct nfp_insn_meta *meta)
233d9ae7f2bSJakub Kicinski {
234d9ae7f2bSJakub Kicinski 	return BPF_SRC(meta->insn.code);
235d9ae7f2bSJakub Kicinski }
236d9ae7f2bSJakub Kicinski 
237d9ae7f2bSJakub Kicinski static inline u8 mbpf_op(const struct nfp_insn_meta *meta)
238d9ae7f2bSJakub Kicinski {
239d9ae7f2bSJakub Kicinski 	return BPF_OP(meta->insn.code);
240d9ae7f2bSJakub Kicinski }
241d9ae7f2bSJakub Kicinski 
242d9ae7f2bSJakub Kicinski static inline u8 mbpf_mode(const struct nfp_insn_meta *meta)
243d9ae7f2bSJakub Kicinski {
244d9ae7f2bSJakub Kicinski 	return BPF_MODE(meta->insn.code);
245d9ae7f2bSJakub Kicinski }
246d9ae7f2bSJakub Kicinski 
2475e4d6d20SJiong Wang static inline bool is_mbpf_load(const struct nfp_insn_meta *meta)
2485e4d6d20SJiong Wang {
2495e4d6d20SJiong Wang 	return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM);
2505e4d6d20SJiong Wang }
2515e4d6d20SJiong Wang 
2525e4d6d20SJiong Wang static inline bool is_mbpf_store(const struct nfp_insn_meta *meta)
2535e4d6d20SJiong Wang {
2545e4d6d20SJiong Wang 	return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM);
2555e4d6d20SJiong Wang }
2565e4d6d20SJiong Wang 
257d9ae7f2bSJakub Kicinski /**
258d9ae7f2bSJakub Kicinski  * struct nfp_prog - nfp BPF program
25977a844eeSJakub Kicinski  * @bpf: backpointer to the bpf app priv structure
260d9ae7f2bSJakub Kicinski  * @prog: machine code
261d9ae7f2bSJakub Kicinski  * @prog_len: number of valid instructions in @prog array
262d9ae7f2bSJakub Kicinski  * @__prog_alloc_len: alloc size of @prog array
263c6c580d7SJakub Kicinski  * @verifier_meta: temporary storage for verifier's insn meta
264012bb8a8SJakub Kicinski  * @type: BPF program type
265854dc87dSJiong Wang  * @last_bpf_off: address of the last instruction translated from BPF
266d9ae7f2bSJakub Kicinski  * @tgt_out: jump target for normal exit
267d9ae7f2bSJakub Kicinski  * @tgt_abort: jump target for abort (e.g. access outside of packet buffer)
268d9ae7f2bSJakub Kicinski  * @n_translated: number of successfully translated instructions (for errors)
269d9ae7f2bSJakub Kicinski  * @error: error code if something went wrong
270ee9133a8SJakub Kicinski  * @stack_depth: max stack depth from the verifier
2718231f844SJakub Kicinski  * @adjust_head_location: if program has single adjust head call - the insn no.
272d9ae7f2bSJakub Kicinski  * @insns: list of BPF instruction wrappers (struct nfp_insn_meta)
273d9ae7f2bSJakub Kicinski  */
274d9ae7f2bSJakub Kicinski struct nfp_prog {
27577a844eeSJakub Kicinski 	struct nfp_app_bpf *bpf;
27677a844eeSJakub Kicinski 
277d9ae7f2bSJakub Kicinski 	u64 *prog;
278d9ae7f2bSJakub Kicinski 	unsigned int prog_len;
279d9ae7f2bSJakub Kicinski 	unsigned int __prog_alloc_len;
280d9ae7f2bSJakub Kicinski 
281c6c580d7SJakub Kicinski 	struct nfp_insn_meta *verifier_meta;
282c6c580d7SJakub Kicinski 
283012bb8a8SJakub Kicinski 	enum bpf_prog_type type;
284d9ae7f2bSJakub Kicinski 
285854dc87dSJiong Wang 	unsigned int last_bpf_off;
286d9ae7f2bSJakub Kicinski 	unsigned int tgt_out;
287d9ae7f2bSJakub Kicinski 	unsigned int tgt_abort;
288d9ae7f2bSJakub Kicinski 
289d9ae7f2bSJakub Kicinski 	unsigned int n_translated;
290d9ae7f2bSJakub Kicinski 	int error;
291d9ae7f2bSJakub Kicinski 
292ee9133a8SJakub Kicinski 	unsigned int stack_depth;
2938231f844SJakub Kicinski 	unsigned int adjust_head_location;
294ee9133a8SJakub Kicinski 
295d9ae7f2bSJakub Kicinski 	struct list_head insns;
296d9ae7f2bSJakub Kicinski };
297d9ae7f2bSJakub Kicinski 
298d3f89b98SJakub Kicinski /**
299d3f89b98SJakub Kicinski  * struct nfp_bpf_vnic - per-vNIC BPF priv structure
300d3f89b98SJakub Kicinski  * @tc_prog:	currently loaded cls_bpf program
3012314fe9eSJakub Kicinski  * @start_off:	address of the first instruction in the memory
3022314fe9eSJakub Kicinski  * @tgt_done:	jump target to get the next packet
303d3f89b98SJakub Kicinski  */
304d3f89b98SJakub Kicinski struct nfp_bpf_vnic {
305d3f89b98SJakub Kicinski 	struct bpf_prog *tc_prog;
3062314fe9eSJakub Kicinski 	unsigned int start_off;
3072314fe9eSJakub Kicinski 	unsigned int tgt_done;
308d3f89b98SJakub Kicinski };
309d3f89b98SJakub Kicinski 
3101549921dSJakub Kicinski void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt);
311c6c580d7SJakub Kicinski int nfp_bpf_jit(struct nfp_prog *prog);
312d9ae7f2bSJakub Kicinski 
313cae1927cSJakub Kicinski extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops;
314d9ae7f2bSJakub Kicinski 
315c6c580d7SJakub Kicinski struct netdev_bpf;
316c6c580d7SJakub Kicinski struct nfp_app;
317bb45e51cSJakub Kicinski struct nfp_net;
318bb45e51cSJakub Kicinski 
319af93d15aSJakub Kicinski int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn,
320af93d15aSJakub Kicinski 		struct netdev_bpf *bpf);
3219ce7a956SJakub Kicinski int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog,
322e4a91cd5SJakub Kicinski 			bool old_prog);
323bb45e51cSJakub Kicinski 
3245b674140SJiong Wang struct nfp_insn_meta *
3255b674140SJiong Wang nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta,
3265b674140SJiong Wang 		  unsigned int insn_idx, unsigned int n_insns);
3272314fe9eSJakub Kicinski 
3282314fe9eSJakub Kicinski void *nfp_bpf_relo_for_vnic(struct nfp_prog *nfp_prog, struct nfp_bpf_vnic *bv);
329d48ae231SJakub Kicinski 
330ff3d43f7SJakub Kicinski long long int
331ff3d43f7SJakub Kicinski nfp_bpf_ctrl_alloc_map(struct nfp_app_bpf *bpf, struct bpf_map *map);
332ff3d43f7SJakub Kicinski void
333ff3d43f7SJakub Kicinski nfp_bpf_ctrl_free_map(struct nfp_app_bpf *bpf, struct nfp_bpf_map *nfp_map);
334ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getfirst_entry(struct bpf_offloaded_map *offmap,
335ff3d43f7SJakub Kicinski 				void *next_key);
336ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_update_entry(struct bpf_offloaded_map *offmap,
337ff3d43f7SJakub Kicinski 			      void *key, void *value, u64 flags);
338ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_del_entry(struct bpf_offloaded_map *offmap, void *key);
339ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_lookup_entry(struct bpf_offloaded_map *offmap,
340ff3d43f7SJakub Kicinski 			      void *key, void *value);
341ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getnext_entry(struct bpf_offloaded_map *offmap,
342ff3d43f7SJakub Kicinski 			       void *key, void *next_key);
343ff3d43f7SJakub Kicinski 
344d48ae231SJakub Kicinski void nfp_bpf_ctrl_msg_rx(struct nfp_app *app, struct sk_buff *skb);
345d9ae7f2bSJakub Kicinski #endif
346