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>
40d9ae7f2bSJakub Kicinski #include <linux/list.h>
41d9ae7f2bSJakub Kicinski #include <linux/types.h>
42d9ae7f2bSJakub Kicinski 
43b3f868dfSJakub Kicinski #include "../nfp_asm.h"
44c66a9cf4SJakub Kicinski 
452314fe9eSJakub Kicinski /* For relocation logic use up-most byte of branch instruction as scratch
46d9ae7f2bSJakub Kicinski  * area.  Remember to clear this before sending instructions to HW!
47d9ae7f2bSJakub Kicinski  */
482314fe9eSJakub Kicinski #define OP_RELO_TYPE	0xff00000000000000ULL
49d9ae7f2bSJakub Kicinski 
502314fe9eSJakub Kicinski enum nfp_relo_type {
512314fe9eSJakub Kicinski 	RELO_NONE = 0,
522314fe9eSJakub Kicinski 	/* standard internal jumps */
532314fe9eSJakub Kicinski 	RELO_BR_REL,
542314fe9eSJakub Kicinski 	/* internal jumps to parts of the outro */
552314fe9eSJakub Kicinski 	RELO_BR_GO_OUT,
562314fe9eSJakub Kicinski 	RELO_BR_GO_ABORT,
572314fe9eSJakub Kicinski 	/* external jumps to fixed addresses */
582314fe9eSJakub Kicinski 	RELO_BR_NEXT_PKT,
59d9ae7f2bSJakub Kicinski };
60d9ae7f2bSJakub Kicinski 
61e84797feSJakub Kicinski /* To make absolute relocated branches (branches other than RELO_BR_REL)
62e84797feSJakub Kicinski  * distinguishable in user space dumps from normal jumps, add a large offset
63e84797feSJakub Kicinski  * to them.
64e84797feSJakub Kicinski  */
65e84797feSJakub Kicinski #define BR_OFF_RELO		15000
66e84797feSJakub Kicinski 
67d9ae7f2bSJakub Kicinski enum static_regs {
6818e53b6cSJakub Kicinski 	STATIC_REG_IMM		= 21, /* Bank AB */
69d3488480SJakub Kicinski 	STATIC_REG_STACK	= 22, /* Bank A */
7018e53b6cSJakub Kicinski 	STATIC_REG_PKT_LEN	= 22, /* Bank B */
7118e53b6cSJakub Kicinski };
7218e53b6cSJakub Kicinski 
7318e53b6cSJakub Kicinski enum pkt_vec {
7418e53b6cSJakub Kicinski 	PKT_VEC_PKT_LEN		= 0,
7518e53b6cSJakub Kicinski 	PKT_VEC_PKT_PTR		= 2,
76d9ae7f2bSJakub Kicinski };
77d9ae7f2bSJakub Kicinski 
7818e53b6cSJakub Kicinski #define pv_len(np)	reg_lm(1, PKT_VEC_PKT_LEN)
7918e53b6cSJakub Kicinski #define pv_ctm_ptr(np)	reg_lm(1, PKT_VEC_PKT_PTR)
8018e53b6cSJakub Kicinski 
81d3488480SJakub Kicinski #define stack_reg(np)	reg_a(STATIC_REG_STACK)
82d3488480SJakub Kicinski #define stack_imm(np)	imm_b(np)
8318e53b6cSJakub Kicinski #define plen_reg(np)	reg_b(STATIC_REG_PKT_LEN)
8418e53b6cSJakub Kicinski #define pptr_reg(np)	pv_ctm_ptr(np)
8518e53b6cSJakub Kicinski #define imm_a(np)	reg_a(STATIC_REG_IMM)
8618e53b6cSJakub Kicinski #define imm_b(np)	reg_b(STATIC_REG_IMM)
8718e53b6cSJakub Kicinski #define imm_both(np)	reg_both(STATIC_REG_IMM)
88d9ae7f2bSJakub Kicinski 
89509144e2SJakub Kicinski #define NFP_BPF_ABI_FLAGS	reg_imm(0)
90d9ae7f2bSJakub Kicinski #define   NFP_BPF_ABI_FLAG_MARK	1
91d9ae7f2bSJakub Kicinski 
9277a844eeSJakub Kicinski /**
9377a844eeSJakub Kicinski  * struct nfp_app_bpf - bpf app priv structure
9477a844eeSJakub Kicinski  * @app:		backpointer to the app
950d49eaf4SJakub Kicinski  *
964da98eeaSJakub Kicinski  * @map_list:		list of offloaded maps
974da98eeaSJakub Kicinski  *
980d49eaf4SJakub Kicinski  * @adjust_head:	adjust head capability
990d49eaf4SJakub Kicinski  * @flags:		extra flags for adjust head
1000d49eaf4SJakub Kicinski  * @off_min:		minimal packet offset within buffer required
1010d49eaf4SJakub Kicinski  * @off_max:		maximum packet offset within buffer required
1028231f844SJakub Kicinski  * @guaranteed_sub:	amount of negative adjustment guaranteed possible
1038231f844SJakub Kicinski  * @guaranteed_add:	amount of positive adjustment guaranteed possible
10477a844eeSJakub Kicinski  */
10577a844eeSJakub Kicinski struct nfp_app_bpf {
10677a844eeSJakub Kicinski 	struct nfp_app *app;
1070d49eaf4SJakub Kicinski 
1084da98eeaSJakub Kicinski 	struct list_head map_list;
1094da98eeaSJakub Kicinski 
1100d49eaf4SJakub Kicinski 	struct nfp_bpf_cap_adjust_head {
1110d49eaf4SJakub Kicinski 		u32 flags;
1120d49eaf4SJakub Kicinski 		int off_min;
1130d49eaf4SJakub Kicinski 		int off_max;
1148231f844SJakub Kicinski 		int guaranteed_sub;
1158231f844SJakub Kicinski 		int guaranteed_add;
1160d49eaf4SJakub Kicinski 	} adjust_head;
11777a844eeSJakub Kicinski };
11877a844eeSJakub Kicinski 
1194da98eeaSJakub Kicinski /**
1204da98eeaSJakub Kicinski  * struct nfp_bpf_map - private per-map data attached to BPF maps for offload
1214da98eeaSJakub Kicinski  * @offmap:	pointer to the offloaded BPF map
1224da98eeaSJakub Kicinski  * @bpf:	back pointer to bpf app private structure
1234da98eeaSJakub Kicinski  * @tid:	table id identifying map on datapath
1244da98eeaSJakub Kicinski  * @l:		link on the nfp_app_bpf->map_list list
1254da98eeaSJakub Kicinski  */
1264da98eeaSJakub Kicinski struct nfp_bpf_map {
1274da98eeaSJakub Kicinski 	struct bpf_offloaded_map *offmap;
1284da98eeaSJakub Kicinski 	struct nfp_app_bpf *bpf;
1294da98eeaSJakub Kicinski 	u32 tid;
1304da98eeaSJakub Kicinski 	struct list_head l;
1314da98eeaSJakub Kicinski };
1324da98eeaSJakub Kicinski 
133d9ae7f2bSJakub Kicinski struct nfp_prog;
134d9ae7f2bSJakub Kicinski struct nfp_insn_meta;
135d9ae7f2bSJakub Kicinski typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *);
136d9ae7f2bSJakub Kicinski 
137d9ae7f2bSJakub Kicinski #define nfp_prog_first_meta(nfp_prog)					\
138d9ae7f2bSJakub Kicinski 	list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l)
139d9ae7f2bSJakub Kicinski #define nfp_prog_last_meta(nfp_prog)					\
140d9ae7f2bSJakub Kicinski 	list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l)
141d9ae7f2bSJakub Kicinski #define nfp_meta_next(meta)	list_next_entry(meta, l)
142d9ae7f2bSJakub Kicinski #define nfp_meta_prev(meta)	list_prev_entry(meta, l)
143d9ae7f2bSJakub Kicinski 
144a09d5c52SJiong Wang #define FLAG_INSN_IS_JUMP_DST	BIT(0)
145a09d5c52SJiong Wang 
146d9ae7f2bSJakub Kicinski /**
147d9ae7f2bSJakub Kicinski  * struct nfp_insn_meta - BPF instruction wrapper
148d9ae7f2bSJakub Kicinski  * @insn: BPF instruction
1492ca71441SJakub Kicinski  * @ptr: pointer type for memory operations
1509879a381SJiong Wang  * @ldst_gather_len: memcpy length gathered from load/store sequence
1519879a381SJiong Wang  * @paired_st: the paired store insn at the head of the sequence
1528231f844SJakub Kicinski  * @arg2: arg2 for call instructions
153b14157eeSJakub Kicinski  * @ptr_not_const: pointer is not always constant
1545b674140SJiong Wang  * @jmp_dst: destination info for jump instructions
155d9ae7f2bSJakub Kicinski  * @off: index of first generated machine instruction (in nfp_prog.prog)
156d9ae7f2bSJakub Kicinski  * @n: eBPF instruction number
157a09d5c52SJiong Wang  * @flags: eBPF instruction extra optimization flags
158d9ae7f2bSJakub Kicinski  * @skip: skip this instruction (optimized out)
159d9ae7f2bSJakub Kicinski  * @double_cb: callback for second part of the instruction
160d9ae7f2bSJakub Kicinski  * @l: link on nfp_prog->insns list
161d9ae7f2bSJakub Kicinski  */
162d9ae7f2bSJakub Kicinski struct nfp_insn_meta {
163d9ae7f2bSJakub Kicinski 	struct bpf_insn insn;
1645b674140SJiong Wang 	union {
1655b674140SJiong Wang 		struct {
1662ca71441SJakub Kicinski 			struct bpf_reg_state ptr;
1679879a381SJiong Wang 			struct bpf_insn *paired_st;
1689879a381SJiong Wang 			s16 ldst_gather_len;
169b14157eeSJakub Kicinski 			bool ptr_not_const;
1705b674140SJiong Wang 		};
1715b674140SJiong Wang 		struct nfp_insn_meta *jmp_dst;
1728231f844SJakub Kicinski 		struct bpf_reg_state arg2;
1735b674140SJiong Wang 	};
174d9ae7f2bSJakub Kicinski 	unsigned int off;
175d9ae7f2bSJakub Kicinski 	unsigned short n;
176a09d5c52SJiong Wang 	unsigned short flags;
177d9ae7f2bSJakub Kicinski 	bool skip;
178d9ae7f2bSJakub Kicinski 	instr_cb_t double_cb;
179d9ae7f2bSJakub Kicinski 
180d9ae7f2bSJakub Kicinski 	struct list_head l;
181d9ae7f2bSJakub Kicinski };
182d9ae7f2bSJakub Kicinski 
183d9ae7f2bSJakub Kicinski #define BPF_SIZE_MASK	0x18
184d9ae7f2bSJakub Kicinski 
185d9ae7f2bSJakub Kicinski static inline u8 mbpf_class(const struct nfp_insn_meta *meta)
186d9ae7f2bSJakub Kicinski {
187d9ae7f2bSJakub Kicinski 	return BPF_CLASS(meta->insn.code);
188d9ae7f2bSJakub Kicinski }
189d9ae7f2bSJakub Kicinski 
190d9ae7f2bSJakub Kicinski static inline u8 mbpf_src(const struct nfp_insn_meta *meta)
191d9ae7f2bSJakub Kicinski {
192d9ae7f2bSJakub Kicinski 	return BPF_SRC(meta->insn.code);
193d9ae7f2bSJakub Kicinski }
194d9ae7f2bSJakub Kicinski 
195d9ae7f2bSJakub Kicinski static inline u8 mbpf_op(const struct nfp_insn_meta *meta)
196d9ae7f2bSJakub Kicinski {
197d9ae7f2bSJakub Kicinski 	return BPF_OP(meta->insn.code);
198d9ae7f2bSJakub Kicinski }
199d9ae7f2bSJakub Kicinski 
200d9ae7f2bSJakub Kicinski static inline u8 mbpf_mode(const struct nfp_insn_meta *meta)
201d9ae7f2bSJakub Kicinski {
202d9ae7f2bSJakub Kicinski 	return BPF_MODE(meta->insn.code);
203d9ae7f2bSJakub Kicinski }
204d9ae7f2bSJakub Kicinski 
2055e4d6d20SJiong Wang static inline bool is_mbpf_load(const struct nfp_insn_meta *meta)
2065e4d6d20SJiong Wang {
2075e4d6d20SJiong Wang 	return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM);
2085e4d6d20SJiong Wang }
2095e4d6d20SJiong Wang 
2105e4d6d20SJiong Wang static inline bool is_mbpf_store(const struct nfp_insn_meta *meta)
2115e4d6d20SJiong Wang {
2125e4d6d20SJiong Wang 	return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM);
2135e4d6d20SJiong Wang }
2145e4d6d20SJiong Wang 
215d9ae7f2bSJakub Kicinski /**
216d9ae7f2bSJakub Kicinski  * struct nfp_prog - nfp BPF program
21777a844eeSJakub Kicinski  * @bpf: backpointer to the bpf app priv structure
218d9ae7f2bSJakub Kicinski  * @prog: machine code
219d9ae7f2bSJakub Kicinski  * @prog_len: number of valid instructions in @prog array
220d9ae7f2bSJakub Kicinski  * @__prog_alloc_len: alloc size of @prog array
221c6c580d7SJakub Kicinski  * @verifier_meta: temporary storage for verifier's insn meta
222012bb8a8SJakub Kicinski  * @type: BPF program type
223854dc87dSJiong Wang  * @last_bpf_off: address of the last instruction translated from BPF
224d9ae7f2bSJakub Kicinski  * @tgt_out: jump target for normal exit
225d9ae7f2bSJakub Kicinski  * @tgt_abort: jump target for abort (e.g. access outside of packet buffer)
226d9ae7f2bSJakub Kicinski  * @n_translated: number of successfully translated instructions (for errors)
227d9ae7f2bSJakub Kicinski  * @error: error code if something went wrong
228ee9133a8SJakub Kicinski  * @stack_depth: max stack depth from the verifier
2298231f844SJakub Kicinski  * @adjust_head_location: if program has single adjust head call - the insn no.
230d9ae7f2bSJakub Kicinski  * @insns: list of BPF instruction wrappers (struct nfp_insn_meta)
231d9ae7f2bSJakub Kicinski  */
232d9ae7f2bSJakub Kicinski struct nfp_prog {
23377a844eeSJakub Kicinski 	struct nfp_app_bpf *bpf;
23477a844eeSJakub Kicinski 
235d9ae7f2bSJakub Kicinski 	u64 *prog;
236d9ae7f2bSJakub Kicinski 	unsigned int prog_len;
237d9ae7f2bSJakub Kicinski 	unsigned int __prog_alloc_len;
238d9ae7f2bSJakub Kicinski 
239c6c580d7SJakub Kicinski 	struct nfp_insn_meta *verifier_meta;
240c6c580d7SJakub Kicinski 
241012bb8a8SJakub Kicinski 	enum bpf_prog_type type;
242d9ae7f2bSJakub Kicinski 
243854dc87dSJiong Wang 	unsigned int last_bpf_off;
244d9ae7f2bSJakub Kicinski 	unsigned int tgt_out;
245d9ae7f2bSJakub Kicinski 	unsigned int tgt_abort;
246d9ae7f2bSJakub Kicinski 
247d9ae7f2bSJakub Kicinski 	unsigned int n_translated;
248d9ae7f2bSJakub Kicinski 	int error;
249d9ae7f2bSJakub Kicinski 
250ee9133a8SJakub Kicinski 	unsigned int stack_depth;
2518231f844SJakub Kicinski 	unsigned int adjust_head_location;
252ee9133a8SJakub Kicinski 
253d9ae7f2bSJakub Kicinski 	struct list_head insns;
254d9ae7f2bSJakub Kicinski };
255d9ae7f2bSJakub Kicinski 
256d3f89b98SJakub Kicinski /**
257d3f89b98SJakub Kicinski  * struct nfp_bpf_vnic - per-vNIC BPF priv structure
258d3f89b98SJakub Kicinski  * @tc_prog:	currently loaded cls_bpf program
2592314fe9eSJakub Kicinski  * @start_off:	address of the first instruction in the memory
2602314fe9eSJakub Kicinski  * @tgt_done:	jump target to get the next packet
261d3f89b98SJakub Kicinski  */
262d3f89b98SJakub Kicinski struct nfp_bpf_vnic {
263d3f89b98SJakub Kicinski 	struct bpf_prog *tc_prog;
2642314fe9eSJakub Kicinski 	unsigned int start_off;
2652314fe9eSJakub Kicinski 	unsigned int tgt_done;
266d3f89b98SJakub Kicinski };
267d3f89b98SJakub Kicinski 
2681549921dSJakub Kicinski void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt);
269c6c580d7SJakub Kicinski int nfp_bpf_jit(struct nfp_prog *prog);
270d9ae7f2bSJakub Kicinski 
271cae1927cSJakub Kicinski extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops;
272d9ae7f2bSJakub Kicinski 
273c6c580d7SJakub Kicinski struct netdev_bpf;
274c6c580d7SJakub Kicinski struct nfp_app;
275bb45e51cSJakub Kicinski struct nfp_net;
276bb45e51cSJakub Kicinski 
277af93d15aSJakub Kicinski int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn,
278af93d15aSJakub Kicinski 		struct netdev_bpf *bpf);
2799ce7a956SJakub Kicinski int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog,
280e4a91cd5SJakub Kicinski 			bool old_prog);
281bb45e51cSJakub Kicinski 
2825b674140SJiong Wang struct nfp_insn_meta *
2835b674140SJiong Wang nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta,
2845b674140SJiong Wang 		  unsigned int insn_idx, unsigned int n_insns);
2852314fe9eSJakub Kicinski 
2862314fe9eSJakub Kicinski void *nfp_bpf_relo_for_vnic(struct nfp_prog *nfp_prog, struct nfp_bpf_vnic *bv);
287d9ae7f2bSJakub Kicinski #endif
288