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 115703f578aSJakub Kicinski * @adjust_head.flags: extra flags for adjust head 116703f578aSJakub Kicinski * @adjust_head.off_min: minimal packet offset within buffer required 117703f578aSJakub Kicinski * @adjust_head.off_max: maximum packet offset within buffer required 118703f578aSJakub Kicinski * @adjust_head.guaranteed_sub: negative adjustment guaranteed possible 119703f578aSJakub Kicinski * @adjust_head.guaranteed_add: positive adjustment guaranteed possible 1209d080d5dSJakub Kicinski * 1219d080d5dSJakub Kicinski * @maps: map capability 122703f578aSJakub Kicinski * @maps.types: supported map types 123703f578aSJakub Kicinski * @maps.max_maps: max number of maps supported 124703f578aSJakub Kicinski * @maps.max_elems: max number of entries in each map 125703f578aSJakub Kicinski * @maps.max_key_sz: max size of map key 126703f578aSJakub Kicinski * @maps.max_val_sz: max size of map value 127703f578aSJakub Kicinski * @maps.max_elem_sz: max size of map entry (key + value) 1289d080d5dSJakub Kicinski * 1299d080d5dSJakub Kicinski * @helpers: helper addressess for various calls 130703f578aSJakub Kicinski * @helpers.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 1932f46e0c1SJakub Kicinski /** 1942f46e0c1SJakub Kicinski * struct nfp_bpf_reg_state - register state for calls 1952f46e0c1SJakub Kicinski * @reg: BPF register state from latest path 1962f46e0c1SJakub Kicinski * @var_off: for stack arg - changes stack offset on different paths 1972f46e0c1SJakub Kicinski */ 1982f46e0c1SJakub Kicinski struct nfp_bpf_reg_state { 1992f46e0c1SJakub Kicinski struct bpf_reg_state reg; 2002f46e0c1SJakub Kicinski bool var_off; 2012f46e0c1SJakub Kicinski }; 2022f46e0c1SJakub Kicinski 203a09d5c52SJiong Wang #define FLAG_INSN_IS_JUMP_DST BIT(0) 204a09d5c52SJiong Wang 205d9ae7f2bSJakub Kicinski /** 206d9ae7f2bSJakub Kicinski * struct nfp_insn_meta - BPF instruction wrapper 207d9ae7f2bSJakub Kicinski * @insn: BPF instruction 2082ca71441SJakub Kicinski * @ptr: pointer type for memory operations 2099879a381SJiong Wang * @ldst_gather_len: memcpy length gathered from load/store sequence 2109879a381SJiong Wang * @paired_st: the paired store insn at the head of the sequence 211b14157eeSJakub Kicinski * @ptr_not_const: pointer is not always constant 212be759237SJiong Wang * @pkt_cache: packet data cache information 213be759237SJiong Wang * @pkt_cache.range_start: start offset for associated packet data cache 214be759237SJiong Wang * @pkt_cache.range_end: end offset for associated packet data cache 215be759237SJiong Wang * @pkt_cache.do_init: this read needs to initialize packet data cache 2165b674140SJiong Wang * @jmp_dst: destination info for jump instructions 21777a3d311SJakub Kicinski * @func_id: function id for call instructions 21877a3d311SJakub Kicinski * @arg1: arg1 for call instructions 21977a3d311SJakub Kicinski * @arg2: arg2 for call instructions 220d9ae7f2bSJakub Kicinski * @off: index of first generated machine instruction (in nfp_prog.prog) 221d9ae7f2bSJakub Kicinski * @n: eBPF instruction number 222a09d5c52SJiong Wang * @flags: eBPF instruction extra optimization flags 223d9ae7f2bSJakub Kicinski * @skip: skip this instruction (optimized out) 224d9ae7f2bSJakub Kicinski * @double_cb: callback for second part of the instruction 225d9ae7f2bSJakub Kicinski * @l: link on nfp_prog->insns list 226d9ae7f2bSJakub Kicinski */ 227d9ae7f2bSJakub Kicinski struct nfp_insn_meta { 228d9ae7f2bSJakub Kicinski struct bpf_insn insn; 2295b674140SJiong Wang union { 2305b674140SJiong Wang struct { 2312ca71441SJakub Kicinski struct bpf_reg_state ptr; 2329879a381SJiong Wang struct bpf_insn *paired_st; 2339879a381SJiong Wang s16 ldst_gather_len; 234b14157eeSJakub Kicinski bool ptr_not_const; 235be759237SJiong Wang struct { 236be759237SJiong Wang s16 range_start; 237be759237SJiong Wang s16 range_end; 238be759237SJiong Wang bool do_init; 239be759237SJiong Wang } pkt_cache; 2405b674140SJiong Wang }; 2415b674140SJiong Wang struct nfp_insn_meta *jmp_dst; 24277a3d311SJakub Kicinski struct { 24377a3d311SJakub Kicinski u32 func_id; 24477a3d311SJakub Kicinski struct bpf_reg_state arg1; 2452f46e0c1SJakub Kicinski struct nfp_bpf_reg_state arg2; 24677a3d311SJakub Kicinski }; 2475b674140SJiong Wang }; 248d9ae7f2bSJakub Kicinski unsigned int off; 249d9ae7f2bSJakub Kicinski unsigned short n; 250a09d5c52SJiong Wang unsigned short flags; 251d9ae7f2bSJakub Kicinski bool skip; 252d9ae7f2bSJakub Kicinski instr_cb_t double_cb; 253d9ae7f2bSJakub Kicinski 254d9ae7f2bSJakub Kicinski struct list_head l; 255d9ae7f2bSJakub Kicinski }; 256d9ae7f2bSJakub Kicinski 257d9ae7f2bSJakub Kicinski #define BPF_SIZE_MASK 0x18 258d9ae7f2bSJakub Kicinski 259d9ae7f2bSJakub Kicinski static inline u8 mbpf_class(const struct nfp_insn_meta *meta) 260d9ae7f2bSJakub Kicinski { 261d9ae7f2bSJakub Kicinski return BPF_CLASS(meta->insn.code); 262d9ae7f2bSJakub Kicinski } 263d9ae7f2bSJakub Kicinski 264d9ae7f2bSJakub Kicinski static inline u8 mbpf_src(const struct nfp_insn_meta *meta) 265d9ae7f2bSJakub Kicinski { 266d9ae7f2bSJakub Kicinski return BPF_SRC(meta->insn.code); 267d9ae7f2bSJakub Kicinski } 268d9ae7f2bSJakub Kicinski 269d9ae7f2bSJakub Kicinski static inline u8 mbpf_op(const struct nfp_insn_meta *meta) 270d9ae7f2bSJakub Kicinski { 271d9ae7f2bSJakub Kicinski return BPF_OP(meta->insn.code); 272d9ae7f2bSJakub Kicinski } 273d9ae7f2bSJakub Kicinski 274d9ae7f2bSJakub Kicinski static inline u8 mbpf_mode(const struct nfp_insn_meta *meta) 275d9ae7f2bSJakub Kicinski { 276d9ae7f2bSJakub Kicinski return BPF_MODE(meta->insn.code); 277d9ae7f2bSJakub Kicinski } 278d9ae7f2bSJakub Kicinski 2795e4d6d20SJiong Wang static inline bool is_mbpf_load(const struct nfp_insn_meta *meta) 2805e4d6d20SJiong Wang { 2815e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM); 2825e4d6d20SJiong Wang } 2835e4d6d20SJiong Wang 2845e4d6d20SJiong Wang static inline bool is_mbpf_store(const struct nfp_insn_meta *meta) 2855e4d6d20SJiong Wang { 2865e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM); 2875e4d6d20SJiong Wang } 2885e4d6d20SJiong Wang 28987b10ecdSJiong Wang static inline bool is_mbpf_load_pkt(const struct nfp_insn_meta *meta) 29087b10ecdSJiong Wang { 29187b10ecdSJiong Wang return is_mbpf_load(meta) && meta->ptr.type == PTR_TO_PACKET; 29287b10ecdSJiong Wang } 29387b10ecdSJiong Wang 29487b10ecdSJiong Wang static inline bool is_mbpf_store_pkt(const struct nfp_insn_meta *meta) 29587b10ecdSJiong Wang { 29687b10ecdSJiong Wang return is_mbpf_store(meta) && meta->ptr.type == PTR_TO_PACKET; 29787b10ecdSJiong Wang } 29887b10ecdSJiong Wang 29987b10ecdSJiong Wang static inline bool is_mbpf_classic_load(const struct nfp_insn_meta *meta) 30087b10ecdSJiong Wang { 30187b10ecdSJiong Wang u8 code = meta->insn.code; 30287b10ecdSJiong Wang 30387b10ecdSJiong Wang return BPF_CLASS(code) == BPF_LD && 30487b10ecdSJiong Wang (BPF_MODE(code) == BPF_ABS || BPF_MODE(code) == BPF_IND); 30587b10ecdSJiong Wang } 30687b10ecdSJiong Wang 30787b10ecdSJiong Wang static inline bool is_mbpf_classic_store(const struct nfp_insn_meta *meta) 30887b10ecdSJiong Wang { 30987b10ecdSJiong Wang u8 code = meta->insn.code; 31087b10ecdSJiong Wang 31187b10ecdSJiong Wang return BPF_CLASS(code) == BPF_ST && BPF_MODE(code) == BPF_MEM; 31287b10ecdSJiong Wang } 31387b10ecdSJiong Wang 31487b10ecdSJiong Wang static inline bool is_mbpf_classic_store_pkt(const struct nfp_insn_meta *meta) 31587b10ecdSJiong Wang { 31687b10ecdSJiong Wang return is_mbpf_classic_store(meta) && meta->ptr.type == PTR_TO_PACKET; 31787b10ecdSJiong Wang } 31887b10ecdSJiong Wang 319d9ae7f2bSJakub Kicinski /** 320d9ae7f2bSJakub Kicinski * struct nfp_prog - nfp BPF program 32177a844eeSJakub Kicinski * @bpf: backpointer to the bpf app priv structure 322d9ae7f2bSJakub Kicinski * @prog: machine code 323d9ae7f2bSJakub Kicinski * @prog_len: number of valid instructions in @prog array 324d9ae7f2bSJakub Kicinski * @__prog_alloc_len: alloc size of @prog array 325c6c580d7SJakub Kicinski * @verifier_meta: temporary storage for verifier's insn meta 326012bb8a8SJakub Kicinski * @type: BPF program type 327854dc87dSJiong Wang * @last_bpf_off: address of the last instruction translated from BPF 328d9ae7f2bSJakub Kicinski * @tgt_out: jump target for normal exit 329d9ae7f2bSJakub Kicinski * @tgt_abort: jump target for abort (e.g. access outside of packet buffer) 330d9ae7f2bSJakub Kicinski * @n_translated: number of successfully translated instructions (for errors) 331d9ae7f2bSJakub Kicinski * @error: error code if something went wrong 332ee9133a8SJakub Kicinski * @stack_depth: max stack depth from the verifier 3338231f844SJakub Kicinski * @adjust_head_location: if program has single adjust head call - the insn no. 334d9ae7f2bSJakub Kicinski * @insns: list of BPF instruction wrappers (struct nfp_insn_meta) 335d9ae7f2bSJakub Kicinski */ 336d9ae7f2bSJakub Kicinski struct nfp_prog { 33777a844eeSJakub Kicinski struct nfp_app_bpf *bpf; 33877a844eeSJakub Kicinski 339d9ae7f2bSJakub Kicinski u64 *prog; 340d9ae7f2bSJakub Kicinski unsigned int prog_len; 341d9ae7f2bSJakub Kicinski unsigned int __prog_alloc_len; 342d9ae7f2bSJakub Kicinski 343c6c580d7SJakub Kicinski struct nfp_insn_meta *verifier_meta; 344c6c580d7SJakub Kicinski 345012bb8a8SJakub Kicinski enum bpf_prog_type type; 346d9ae7f2bSJakub Kicinski 347854dc87dSJiong Wang unsigned int last_bpf_off; 348d9ae7f2bSJakub Kicinski unsigned int tgt_out; 349d9ae7f2bSJakub Kicinski unsigned int tgt_abort; 350d9ae7f2bSJakub Kicinski 351d9ae7f2bSJakub Kicinski unsigned int n_translated; 352d9ae7f2bSJakub Kicinski int error; 353d9ae7f2bSJakub Kicinski 354ee9133a8SJakub Kicinski unsigned int stack_depth; 3558231f844SJakub Kicinski unsigned int adjust_head_location; 356ee9133a8SJakub Kicinski 357d9ae7f2bSJakub Kicinski struct list_head insns; 358d9ae7f2bSJakub Kicinski }; 359d9ae7f2bSJakub Kicinski 360d3f89b98SJakub Kicinski /** 361d3f89b98SJakub Kicinski * struct nfp_bpf_vnic - per-vNIC BPF priv structure 362d3f89b98SJakub Kicinski * @tc_prog: currently loaded cls_bpf program 3632314fe9eSJakub Kicinski * @start_off: address of the first instruction in the memory 3642314fe9eSJakub Kicinski * @tgt_done: jump target to get the next packet 365d3f89b98SJakub Kicinski */ 366d3f89b98SJakub Kicinski struct nfp_bpf_vnic { 367d3f89b98SJakub Kicinski struct bpf_prog *tc_prog; 3682314fe9eSJakub Kicinski unsigned int start_off; 3692314fe9eSJakub Kicinski unsigned int tgt_done; 370d3f89b98SJakub Kicinski }; 371d3f89b98SJakub Kicinski 3721549921dSJakub Kicinski void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt); 373c6c580d7SJakub Kicinski int nfp_bpf_jit(struct nfp_prog *prog); 37474801e50SQuentin Monnet bool nfp_bpf_supported_opcode(u8 code); 375d9ae7f2bSJakub Kicinski 376cae1927cSJakub Kicinski extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops; 377d9ae7f2bSJakub Kicinski 378c6c580d7SJakub Kicinski struct netdev_bpf; 379c6c580d7SJakub Kicinski struct nfp_app; 380bb45e51cSJakub Kicinski struct nfp_net; 381bb45e51cSJakub Kicinski 382af93d15aSJakub Kicinski int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn, 383af93d15aSJakub Kicinski struct netdev_bpf *bpf); 3849ce7a956SJakub Kicinski int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog, 38552be9a7cSQuentin Monnet bool old_prog, struct netlink_ext_ack *extack); 386bb45e51cSJakub Kicinski 3875b674140SJiong Wang struct nfp_insn_meta * 3885b674140SJiong Wang nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta, 3895b674140SJiong Wang unsigned int insn_idx, unsigned int n_insns); 3902314fe9eSJakub Kicinski 3912314fe9eSJakub Kicinski void *nfp_bpf_relo_for_vnic(struct nfp_prog *nfp_prog, struct nfp_bpf_vnic *bv); 392d48ae231SJakub Kicinski 393ff3d43f7SJakub Kicinski long long int 394ff3d43f7SJakub Kicinski nfp_bpf_ctrl_alloc_map(struct nfp_app_bpf *bpf, struct bpf_map *map); 395ff3d43f7SJakub Kicinski void 396ff3d43f7SJakub Kicinski nfp_bpf_ctrl_free_map(struct nfp_app_bpf *bpf, struct nfp_bpf_map *nfp_map); 397ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getfirst_entry(struct bpf_offloaded_map *offmap, 398ff3d43f7SJakub Kicinski void *next_key); 399ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_update_entry(struct bpf_offloaded_map *offmap, 400ff3d43f7SJakub Kicinski void *key, void *value, u64 flags); 401ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_del_entry(struct bpf_offloaded_map *offmap, void *key); 402ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_lookup_entry(struct bpf_offloaded_map *offmap, 403ff3d43f7SJakub Kicinski void *key, void *value); 404ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getnext_entry(struct bpf_offloaded_map *offmap, 405ff3d43f7SJakub Kicinski void *key, void *next_key); 406ff3d43f7SJakub Kicinski 407d48ae231SJakub Kicinski void nfp_bpf_ctrl_msg_rx(struct nfp_app *app, struct sk_buff *skb); 408d9ae7f2bSJakub Kicinski #endif 409