1d9ae7f2bSJakub Kicinski /* 2630a4d38SJakub Kicinski * Copyright (C) 2016-2018 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> 42630a4d38SJakub Kicinski #include <linux/rhashtable.h> 43d48ae231SJakub Kicinski #include <linux/skbuff.h> 44d9ae7f2bSJakub Kicinski #include <linux/types.h> 45d48ae231SJakub Kicinski #include <linux/wait.h> 46d9ae7f2bSJakub Kicinski 47b3f868dfSJakub Kicinski #include "../nfp_asm.h" 48d48ae231SJakub Kicinski #include "fw.h" 49c66a9cf4SJakub Kicinski 502314fe9eSJakub Kicinski /* For relocation logic use up-most byte of branch instruction as scratch 51d9ae7f2bSJakub Kicinski * area. Remember to clear this before sending instructions to HW! 52d9ae7f2bSJakub Kicinski */ 532314fe9eSJakub Kicinski #define OP_RELO_TYPE 0xff00000000000000ULL 54d9ae7f2bSJakub Kicinski 552314fe9eSJakub Kicinski enum nfp_relo_type { 562314fe9eSJakub Kicinski RELO_NONE = 0, 572314fe9eSJakub Kicinski /* standard internal jumps */ 582314fe9eSJakub Kicinski RELO_BR_REL, 592314fe9eSJakub Kicinski /* internal jumps to parts of the outro */ 602314fe9eSJakub Kicinski RELO_BR_GO_OUT, 612314fe9eSJakub Kicinski RELO_BR_GO_ABORT, 622314fe9eSJakub Kicinski /* external jumps to fixed addresses */ 632314fe9eSJakub Kicinski RELO_BR_NEXT_PKT, 6477a3d311SJakub Kicinski RELO_BR_HELPER, 6577a3d311SJakub Kicinski /* immediate relocation against load address */ 6677a3d311SJakub Kicinski RELO_IMMED_REL, 67d9ae7f2bSJakub Kicinski }; 68d9ae7f2bSJakub Kicinski 69e84797feSJakub Kicinski /* To make absolute relocated branches (branches other than RELO_BR_REL) 70e84797feSJakub Kicinski * distinguishable in user space dumps from normal jumps, add a large offset 71e84797feSJakub Kicinski * to them. 72e84797feSJakub Kicinski */ 73e84797feSJakub Kicinski #define BR_OFF_RELO 15000 74e84797feSJakub Kicinski 75d9ae7f2bSJakub Kicinski enum static_regs { 76dcb0c27fSJakub Kicinski STATIC_REG_IMMA = 20, /* Bank AB */ 7718e53b6cSJakub Kicinski STATIC_REG_IMM = 21, /* Bank AB */ 78d3488480SJakub Kicinski STATIC_REG_STACK = 22, /* Bank A */ 7918e53b6cSJakub Kicinski STATIC_REG_PKT_LEN = 22, /* Bank B */ 8018e53b6cSJakub Kicinski }; 8118e53b6cSJakub Kicinski 8218e53b6cSJakub Kicinski enum pkt_vec { 8318e53b6cSJakub Kicinski PKT_VEC_PKT_LEN = 0, 8418e53b6cSJakub Kicinski PKT_VEC_PKT_PTR = 2, 85d9ae7f2bSJakub Kicinski }; 86d9ae7f2bSJakub Kicinski 8718e53b6cSJakub Kicinski #define pv_len(np) reg_lm(1, PKT_VEC_PKT_LEN) 8818e53b6cSJakub Kicinski #define pv_ctm_ptr(np) reg_lm(1, PKT_VEC_PKT_PTR) 8918e53b6cSJakub Kicinski 90d3488480SJakub Kicinski #define stack_reg(np) reg_a(STATIC_REG_STACK) 91d3488480SJakub Kicinski #define stack_imm(np) imm_b(np) 9218e53b6cSJakub Kicinski #define plen_reg(np) reg_b(STATIC_REG_PKT_LEN) 9318e53b6cSJakub Kicinski #define pptr_reg(np) pv_ctm_ptr(np) 9418e53b6cSJakub Kicinski #define imm_a(np) reg_a(STATIC_REG_IMM) 9518e53b6cSJakub Kicinski #define imm_b(np) reg_b(STATIC_REG_IMM) 96dcb0c27fSJakub Kicinski #define imma_a(np) reg_a(STATIC_REG_IMMA) 97dcb0c27fSJakub Kicinski #define imma_b(np) reg_b(STATIC_REG_IMMA) 9818e53b6cSJakub Kicinski #define imm_both(np) reg_both(STATIC_REG_IMM) 99d9ae7f2bSJakub Kicinski 100509144e2SJakub Kicinski #define NFP_BPF_ABI_FLAGS reg_imm(0) 101d9ae7f2bSJakub Kicinski #define NFP_BPF_ABI_FLAG_MARK 1 102d9ae7f2bSJakub Kicinski 10377a844eeSJakub Kicinski /** 10477a844eeSJakub Kicinski * struct nfp_app_bpf - bpf app priv structure 10577a844eeSJakub Kicinski * @app: backpointer to the app 1060d49eaf4SJakub Kicinski * 107d48ae231SJakub Kicinski * @tag_allocator: bitmap of control message tags in use 108d48ae231SJakub Kicinski * @tag_alloc_next: next tag bit to allocate 109d48ae231SJakub Kicinski * @tag_alloc_last: next tag bit to be freed 110d48ae231SJakub Kicinski * 111d48ae231SJakub Kicinski * @cmsg_replies: received cmsg replies waiting to be consumed 112d48ae231SJakub Kicinski * @cmsg_wq: work queue for waiting for cmsg replies 113d48ae231SJakub Kicinski * 1144da98eeaSJakub Kicinski * @map_list: list of offloaded maps 1151bba4c41SJakub Kicinski * @maps_in_use: number of currently offloaded maps 1161bba4c41SJakub Kicinski * @map_elems_in_use: number of elements allocated to offloaded maps 1174da98eeaSJakub Kicinski * 118630a4d38SJakub Kicinski * @maps_neutral: hash table of offload-neutral maps (on pointer) 119630a4d38SJakub Kicinski * 1200d49eaf4SJakub Kicinski * @adjust_head: adjust head capability 121703f578aSJakub Kicinski * @adjust_head.flags: extra flags for adjust head 122703f578aSJakub Kicinski * @adjust_head.off_min: minimal packet offset within buffer required 123703f578aSJakub Kicinski * @adjust_head.off_max: maximum packet offset within buffer required 124703f578aSJakub Kicinski * @adjust_head.guaranteed_sub: negative adjustment guaranteed possible 125703f578aSJakub Kicinski * @adjust_head.guaranteed_add: positive adjustment guaranteed possible 1269d080d5dSJakub Kicinski * 1279d080d5dSJakub Kicinski * @maps: map capability 128703f578aSJakub Kicinski * @maps.types: supported map types 129703f578aSJakub Kicinski * @maps.max_maps: max number of maps supported 130703f578aSJakub Kicinski * @maps.max_elems: max number of entries in each map 131703f578aSJakub Kicinski * @maps.max_key_sz: max size of map key 132703f578aSJakub Kicinski * @maps.max_val_sz: max size of map value 133703f578aSJakub Kicinski * @maps.max_elem_sz: max size of map entry (key + value) 1349d080d5dSJakub Kicinski * 1359d080d5dSJakub Kicinski * @helpers: helper addressess for various calls 136703f578aSJakub Kicinski * @helpers.map_lookup: map lookup helper address 13744d65a47SJakub Kicinski * @helpers.map_update: map update helper address 138bfee64deSJakub Kicinski * @helpers.map_delete: map delete helper address 1399816dd35SJakub Kicinski * @helpers.perf_event_output: output perf event to a ring buffer 140df4a37d8SJakub Kicinski * 141df4a37d8SJakub Kicinski * @pseudo_random: FW initialized the pseudo-random machinery (CSRs) 14277a844eeSJakub Kicinski */ 14377a844eeSJakub Kicinski struct nfp_app_bpf { 14477a844eeSJakub Kicinski struct nfp_app *app; 1450d49eaf4SJakub Kicinski 146d48ae231SJakub Kicinski DECLARE_BITMAP(tag_allocator, U16_MAX + 1); 147d48ae231SJakub Kicinski u16 tag_alloc_next; 148d48ae231SJakub Kicinski u16 tag_alloc_last; 149d48ae231SJakub Kicinski 150d48ae231SJakub Kicinski struct sk_buff_head cmsg_replies; 151d48ae231SJakub Kicinski struct wait_queue_head cmsg_wq; 152d48ae231SJakub Kicinski 1534da98eeaSJakub Kicinski struct list_head map_list; 1541bba4c41SJakub Kicinski unsigned int maps_in_use; 1551bba4c41SJakub Kicinski unsigned int map_elems_in_use; 1564da98eeaSJakub Kicinski 157630a4d38SJakub Kicinski struct rhashtable maps_neutral; 158630a4d38SJakub Kicinski 1590d49eaf4SJakub Kicinski struct nfp_bpf_cap_adjust_head { 1600d49eaf4SJakub Kicinski u32 flags; 1610d49eaf4SJakub Kicinski int off_min; 1620d49eaf4SJakub Kicinski int off_max; 1638231f844SJakub Kicinski int guaranteed_sub; 1648231f844SJakub Kicinski int guaranteed_add; 1650d49eaf4SJakub Kicinski } adjust_head; 1669d080d5dSJakub Kicinski 1679d080d5dSJakub Kicinski struct { 1689d080d5dSJakub Kicinski u32 types; 1699d080d5dSJakub Kicinski u32 max_maps; 1709d080d5dSJakub Kicinski u32 max_elems; 1719d080d5dSJakub Kicinski u32 max_key_sz; 1729d080d5dSJakub Kicinski u32 max_val_sz; 1739d080d5dSJakub Kicinski u32 max_elem_sz; 1749d080d5dSJakub Kicinski } maps; 1759d080d5dSJakub Kicinski 1769d080d5dSJakub Kicinski struct { 1779d080d5dSJakub Kicinski u32 map_lookup; 17844d65a47SJakub Kicinski u32 map_update; 179bfee64deSJakub Kicinski u32 map_delete; 1809816dd35SJakub Kicinski u32 perf_event_output; 1819d080d5dSJakub Kicinski } helpers; 182df4a37d8SJakub Kicinski 183df4a37d8SJakub Kicinski bool pseudo_random; 18477a844eeSJakub Kicinski }; 18577a844eeSJakub Kicinski 186dcb0c27fSJakub Kicinski enum nfp_bpf_map_use { 187dcb0c27fSJakub Kicinski NFP_MAP_UNUSED = 0, 188dcb0c27fSJakub Kicinski NFP_MAP_USE_READ, 189dcb0c27fSJakub Kicinski NFP_MAP_USE_WRITE, 190dcb0c27fSJakub Kicinski NFP_MAP_USE_ATOMIC_CNT, 191dcb0c27fSJakub Kicinski }; 192dcb0c27fSJakub Kicinski 1934da98eeaSJakub Kicinski /** 1944da98eeaSJakub Kicinski * struct nfp_bpf_map - private per-map data attached to BPF maps for offload 1954da98eeaSJakub Kicinski * @offmap: pointer to the offloaded BPF map 1964da98eeaSJakub Kicinski * @bpf: back pointer to bpf app private structure 1974da98eeaSJakub Kicinski * @tid: table id identifying map on datapath 1984da98eeaSJakub Kicinski * @l: link on the nfp_app_bpf->map_list list 199dcb0c27fSJakub Kicinski * @use_map: map of how the value is used (in 4B chunks) 2004da98eeaSJakub Kicinski */ 2014da98eeaSJakub Kicinski struct nfp_bpf_map { 2024da98eeaSJakub Kicinski struct bpf_offloaded_map *offmap; 2034da98eeaSJakub Kicinski struct nfp_app_bpf *bpf; 2044da98eeaSJakub Kicinski u32 tid; 2054da98eeaSJakub Kicinski struct list_head l; 206dcb0c27fSJakub Kicinski enum nfp_bpf_map_use use_map[]; 2074da98eeaSJakub Kicinski }; 2084da98eeaSJakub Kicinski 209630a4d38SJakub Kicinski struct nfp_bpf_neutral_map { 210630a4d38SJakub Kicinski struct rhash_head l; 211630a4d38SJakub Kicinski struct bpf_map *ptr; 212630a4d38SJakub Kicinski u32 count; 213630a4d38SJakub Kicinski }; 214630a4d38SJakub Kicinski 215630a4d38SJakub Kicinski extern const struct rhashtable_params nfp_bpf_maps_neutral_params; 216630a4d38SJakub Kicinski 217d9ae7f2bSJakub Kicinski struct nfp_prog; 218d9ae7f2bSJakub Kicinski struct nfp_insn_meta; 219d9ae7f2bSJakub Kicinski typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *); 220d9ae7f2bSJakub Kicinski 221d9ae7f2bSJakub Kicinski #define nfp_prog_first_meta(nfp_prog) \ 222d9ae7f2bSJakub Kicinski list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 223d9ae7f2bSJakub Kicinski #define nfp_prog_last_meta(nfp_prog) \ 224d9ae7f2bSJakub Kicinski list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 225d9ae7f2bSJakub Kicinski #define nfp_meta_next(meta) list_next_entry(meta, l) 226d9ae7f2bSJakub Kicinski #define nfp_meta_prev(meta) list_prev_entry(meta, l) 227d9ae7f2bSJakub Kicinski 2282f46e0c1SJakub Kicinski /** 2292f46e0c1SJakub Kicinski * struct nfp_bpf_reg_state - register state for calls 2302f46e0c1SJakub Kicinski * @reg: BPF register state from latest path 2312f46e0c1SJakub Kicinski * @var_off: for stack arg - changes stack offset on different paths 2322f46e0c1SJakub Kicinski */ 2332f46e0c1SJakub Kicinski struct nfp_bpf_reg_state { 2342f46e0c1SJakub Kicinski struct bpf_reg_state reg; 2352f46e0c1SJakub Kicinski bool var_off; 2362f46e0c1SJakub Kicinski }; 2372f46e0c1SJakub Kicinski 238a09d5c52SJiong Wang #define FLAG_INSN_IS_JUMP_DST BIT(0) 239a09d5c52SJiong Wang 240d9ae7f2bSJakub Kicinski /** 241d9ae7f2bSJakub Kicinski * struct nfp_insn_meta - BPF instruction wrapper 242d9ae7f2bSJakub Kicinski * @insn: BPF instruction 2432ca71441SJakub Kicinski * @ptr: pointer type for memory operations 2449879a381SJiong Wang * @ldst_gather_len: memcpy length gathered from load/store sequence 2459879a381SJiong Wang * @paired_st: the paired store insn at the head of the sequence 246b14157eeSJakub Kicinski * @ptr_not_const: pointer is not always constant 247be759237SJiong Wang * @pkt_cache: packet data cache information 248be759237SJiong Wang * @pkt_cache.range_start: start offset for associated packet data cache 249be759237SJiong Wang * @pkt_cache.range_end: end offset for associated packet data cache 250be759237SJiong Wang * @pkt_cache.do_init: this read needs to initialize packet data cache 25141aed09cSJakub Kicinski * @xadd_over_16bit: 16bit immediate is not guaranteed 25241aed09cSJakub Kicinski * @xadd_maybe_16bit: 16bit immediate is possible 2535b674140SJiong Wang * @jmp_dst: destination info for jump instructions 2547bdc97beSJakub Kicinski * @jump_neg_op: jump instruction has inverted immediate, use ADD instead of SUB 25577a3d311SJakub Kicinski * @func_id: function id for call instructions 25677a3d311SJakub Kicinski * @arg1: arg1 for call instructions 25777a3d311SJakub Kicinski * @arg2: arg2 for call instructions 258d9ae7f2bSJakub Kicinski * @off: index of first generated machine instruction (in nfp_prog.prog) 259d9ae7f2bSJakub Kicinski * @n: eBPF instruction number 260a09d5c52SJiong Wang * @flags: eBPF instruction extra optimization flags 261d9ae7f2bSJakub Kicinski * @skip: skip this instruction (optimized out) 262d9ae7f2bSJakub Kicinski * @double_cb: callback for second part of the instruction 263d9ae7f2bSJakub Kicinski * @l: link on nfp_prog->insns list 264d9ae7f2bSJakub Kicinski */ 265d9ae7f2bSJakub Kicinski struct nfp_insn_meta { 266d9ae7f2bSJakub Kicinski struct bpf_insn insn; 2675b674140SJiong Wang union { 26841aed09cSJakub Kicinski /* pointer ops (ld/st/xadd) */ 2695b674140SJiong Wang struct { 2702ca71441SJakub Kicinski struct bpf_reg_state ptr; 2719879a381SJiong Wang struct bpf_insn *paired_st; 2729879a381SJiong Wang s16 ldst_gather_len; 273b14157eeSJakub Kicinski bool ptr_not_const; 274be759237SJiong Wang struct { 275be759237SJiong Wang s16 range_start; 276be759237SJiong Wang s16 range_end; 277be759237SJiong Wang bool do_init; 278be759237SJiong Wang } pkt_cache; 27941aed09cSJakub Kicinski bool xadd_over_16bit; 28041aed09cSJakub Kicinski bool xadd_maybe_16bit; 2815b674140SJiong Wang }; 28241aed09cSJakub Kicinski /* jump */ 2837bdc97beSJakub Kicinski struct { 2845b674140SJiong Wang struct nfp_insn_meta *jmp_dst; 2857bdc97beSJakub Kicinski bool jump_neg_op; 2867bdc97beSJakub Kicinski }; 28741aed09cSJakub Kicinski /* function calls */ 28877a3d311SJakub Kicinski struct { 28977a3d311SJakub Kicinski u32 func_id; 29077a3d311SJakub Kicinski struct bpf_reg_state arg1; 2912f46e0c1SJakub Kicinski struct nfp_bpf_reg_state arg2; 29277a3d311SJakub Kicinski }; 2935b674140SJiong Wang }; 294d9ae7f2bSJakub Kicinski unsigned int off; 295d9ae7f2bSJakub Kicinski unsigned short n; 296a09d5c52SJiong Wang unsigned short flags; 297d9ae7f2bSJakub Kicinski bool skip; 298d9ae7f2bSJakub Kicinski instr_cb_t double_cb; 299d9ae7f2bSJakub Kicinski 300d9ae7f2bSJakub Kicinski struct list_head l; 301d9ae7f2bSJakub Kicinski }; 302d9ae7f2bSJakub Kicinski 303d9ae7f2bSJakub Kicinski #define BPF_SIZE_MASK 0x18 304d9ae7f2bSJakub Kicinski 305d9ae7f2bSJakub Kicinski static inline u8 mbpf_class(const struct nfp_insn_meta *meta) 306d9ae7f2bSJakub Kicinski { 307d9ae7f2bSJakub Kicinski return BPF_CLASS(meta->insn.code); 308d9ae7f2bSJakub Kicinski } 309d9ae7f2bSJakub Kicinski 310d9ae7f2bSJakub Kicinski static inline u8 mbpf_src(const struct nfp_insn_meta *meta) 311d9ae7f2bSJakub Kicinski { 312d9ae7f2bSJakub Kicinski return BPF_SRC(meta->insn.code); 313d9ae7f2bSJakub Kicinski } 314d9ae7f2bSJakub Kicinski 315d9ae7f2bSJakub Kicinski static inline u8 mbpf_op(const struct nfp_insn_meta *meta) 316d9ae7f2bSJakub Kicinski { 317d9ae7f2bSJakub Kicinski return BPF_OP(meta->insn.code); 318d9ae7f2bSJakub Kicinski } 319d9ae7f2bSJakub Kicinski 320d9ae7f2bSJakub Kicinski static inline u8 mbpf_mode(const struct nfp_insn_meta *meta) 321d9ae7f2bSJakub Kicinski { 322d9ae7f2bSJakub Kicinski return BPF_MODE(meta->insn.code); 323d9ae7f2bSJakub Kicinski } 324d9ae7f2bSJakub Kicinski 3255e4d6d20SJiong Wang static inline bool is_mbpf_load(const struct nfp_insn_meta *meta) 3265e4d6d20SJiong Wang { 3275e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM); 3285e4d6d20SJiong Wang } 3295e4d6d20SJiong Wang 3305e4d6d20SJiong Wang static inline bool is_mbpf_store(const struct nfp_insn_meta *meta) 3315e4d6d20SJiong Wang { 3325e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM); 3335e4d6d20SJiong Wang } 3345e4d6d20SJiong Wang 33587b10ecdSJiong Wang static inline bool is_mbpf_load_pkt(const struct nfp_insn_meta *meta) 33687b10ecdSJiong Wang { 33787b10ecdSJiong Wang return is_mbpf_load(meta) && meta->ptr.type == PTR_TO_PACKET; 33887b10ecdSJiong Wang } 33987b10ecdSJiong Wang 34087b10ecdSJiong Wang static inline bool is_mbpf_store_pkt(const struct nfp_insn_meta *meta) 34187b10ecdSJiong Wang { 34287b10ecdSJiong Wang return is_mbpf_store(meta) && meta->ptr.type == PTR_TO_PACKET; 34387b10ecdSJiong Wang } 34487b10ecdSJiong Wang 34587b10ecdSJiong Wang static inline bool is_mbpf_classic_load(const struct nfp_insn_meta *meta) 34687b10ecdSJiong Wang { 34787b10ecdSJiong Wang u8 code = meta->insn.code; 34887b10ecdSJiong Wang 34987b10ecdSJiong Wang return BPF_CLASS(code) == BPF_LD && 35087b10ecdSJiong Wang (BPF_MODE(code) == BPF_ABS || BPF_MODE(code) == BPF_IND); 35187b10ecdSJiong Wang } 35287b10ecdSJiong Wang 35387b10ecdSJiong Wang static inline bool is_mbpf_classic_store(const struct nfp_insn_meta *meta) 35487b10ecdSJiong Wang { 35587b10ecdSJiong Wang u8 code = meta->insn.code; 35687b10ecdSJiong Wang 35787b10ecdSJiong Wang return BPF_CLASS(code) == BPF_ST && BPF_MODE(code) == BPF_MEM; 35887b10ecdSJiong Wang } 35987b10ecdSJiong Wang 36087b10ecdSJiong Wang static inline bool is_mbpf_classic_store_pkt(const struct nfp_insn_meta *meta) 36187b10ecdSJiong Wang { 36287b10ecdSJiong Wang return is_mbpf_classic_store(meta) && meta->ptr.type == PTR_TO_PACKET; 36387b10ecdSJiong Wang } 36487b10ecdSJiong Wang 365dcb0c27fSJakub Kicinski static inline bool is_mbpf_xadd(const struct nfp_insn_meta *meta) 366dcb0c27fSJakub Kicinski { 367dcb0c27fSJakub Kicinski return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_XADD); 368dcb0c27fSJakub Kicinski } 369dcb0c27fSJakub Kicinski 370d9ae7f2bSJakub Kicinski /** 371d9ae7f2bSJakub Kicinski * struct nfp_prog - nfp BPF program 37277a844eeSJakub Kicinski * @bpf: backpointer to the bpf app priv structure 373d9ae7f2bSJakub Kicinski * @prog: machine code 374d9ae7f2bSJakub Kicinski * @prog_len: number of valid instructions in @prog array 375d9ae7f2bSJakub Kicinski * @__prog_alloc_len: alloc size of @prog array 376c6c580d7SJakub Kicinski * @verifier_meta: temporary storage for verifier's insn meta 377012bb8a8SJakub Kicinski * @type: BPF program type 378854dc87dSJiong Wang * @last_bpf_off: address of the last instruction translated from BPF 379d9ae7f2bSJakub Kicinski * @tgt_out: jump target for normal exit 380d9ae7f2bSJakub Kicinski * @tgt_abort: jump target for abort (e.g. access outside of packet buffer) 381d9ae7f2bSJakub Kicinski * @n_translated: number of successfully translated instructions (for errors) 382d9ae7f2bSJakub Kicinski * @error: error code if something went wrong 383ee9133a8SJakub Kicinski * @stack_depth: max stack depth from the verifier 3848231f844SJakub Kicinski * @adjust_head_location: if program has single adjust head call - the insn no. 385630a4d38SJakub Kicinski * @map_records_cnt: the number of map pointers recorded for this prog 386630a4d38SJakub Kicinski * @map_records: the map record pointers from bpf->maps_neutral 387d9ae7f2bSJakub Kicinski * @insns: list of BPF instruction wrappers (struct nfp_insn_meta) 388d9ae7f2bSJakub Kicinski */ 389d9ae7f2bSJakub Kicinski struct nfp_prog { 39077a844eeSJakub Kicinski struct nfp_app_bpf *bpf; 39177a844eeSJakub Kicinski 392d9ae7f2bSJakub Kicinski u64 *prog; 393d9ae7f2bSJakub Kicinski unsigned int prog_len; 394d9ae7f2bSJakub Kicinski unsigned int __prog_alloc_len; 395d9ae7f2bSJakub Kicinski 396c6c580d7SJakub Kicinski struct nfp_insn_meta *verifier_meta; 397c6c580d7SJakub Kicinski 398012bb8a8SJakub Kicinski enum bpf_prog_type type; 399d9ae7f2bSJakub Kicinski 400854dc87dSJiong Wang unsigned int last_bpf_off; 401d9ae7f2bSJakub Kicinski unsigned int tgt_out; 402d9ae7f2bSJakub Kicinski unsigned int tgt_abort; 403d9ae7f2bSJakub Kicinski 404d9ae7f2bSJakub Kicinski unsigned int n_translated; 405d9ae7f2bSJakub Kicinski int error; 406d9ae7f2bSJakub Kicinski 407ee9133a8SJakub Kicinski unsigned int stack_depth; 4088231f844SJakub Kicinski unsigned int adjust_head_location; 409ee9133a8SJakub Kicinski 410630a4d38SJakub Kicinski unsigned int map_records_cnt; 411630a4d38SJakub Kicinski struct nfp_bpf_neutral_map **map_records; 412630a4d38SJakub Kicinski 413d9ae7f2bSJakub Kicinski struct list_head insns; 414d9ae7f2bSJakub Kicinski }; 415d9ae7f2bSJakub Kicinski 416d3f89b98SJakub Kicinski /** 417d3f89b98SJakub Kicinski * struct nfp_bpf_vnic - per-vNIC BPF priv structure 418d3f89b98SJakub Kicinski * @tc_prog: currently loaded cls_bpf program 4192314fe9eSJakub Kicinski * @start_off: address of the first instruction in the memory 4202314fe9eSJakub Kicinski * @tgt_done: jump target to get the next packet 421d3f89b98SJakub Kicinski */ 422d3f89b98SJakub Kicinski struct nfp_bpf_vnic { 423d3f89b98SJakub Kicinski struct bpf_prog *tc_prog; 4242314fe9eSJakub Kicinski unsigned int start_off; 4252314fe9eSJakub Kicinski unsigned int tgt_done; 426d3f89b98SJakub Kicinski }; 427d3f89b98SJakub Kicinski 4281549921dSJakub Kicinski void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt); 429c6c580d7SJakub Kicinski int nfp_bpf_jit(struct nfp_prog *prog); 43074801e50SQuentin Monnet bool nfp_bpf_supported_opcode(u8 code); 431d9ae7f2bSJakub Kicinski 432cae1927cSJakub Kicinski extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops; 433d9ae7f2bSJakub Kicinski 434c6c580d7SJakub Kicinski struct netdev_bpf; 435c6c580d7SJakub Kicinski struct nfp_app; 436bb45e51cSJakub Kicinski struct nfp_net; 437bb45e51cSJakub Kicinski 438af93d15aSJakub Kicinski int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn, 439af93d15aSJakub Kicinski struct netdev_bpf *bpf); 4409ce7a956SJakub Kicinski int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog, 44152be9a7cSQuentin Monnet bool old_prog, struct netlink_ext_ack *extack); 442bb45e51cSJakub Kicinski 4435b674140SJiong Wang struct nfp_insn_meta * 4445b674140SJiong Wang nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta, 4455b674140SJiong Wang unsigned int insn_idx, unsigned int n_insns); 4462314fe9eSJakub Kicinski 4472314fe9eSJakub Kicinski void *nfp_bpf_relo_for_vnic(struct nfp_prog *nfp_prog, struct nfp_bpf_vnic *bv); 448d48ae231SJakub Kicinski 449ff3d43f7SJakub Kicinski long long int 450ff3d43f7SJakub Kicinski nfp_bpf_ctrl_alloc_map(struct nfp_app_bpf *bpf, struct bpf_map *map); 451ff3d43f7SJakub Kicinski void 452ff3d43f7SJakub Kicinski nfp_bpf_ctrl_free_map(struct nfp_app_bpf *bpf, struct nfp_bpf_map *nfp_map); 453ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getfirst_entry(struct bpf_offloaded_map *offmap, 454ff3d43f7SJakub Kicinski void *next_key); 455ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_update_entry(struct bpf_offloaded_map *offmap, 456ff3d43f7SJakub Kicinski void *key, void *value, u64 flags); 457ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_del_entry(struct bpf_offloaded_map *offmap, void *key); 458ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_lookup_entry(struct bpf_offloaded_map *offmap, 459ff3d43f7SJakub Kicinski void *key, void *value); 460ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getnext_entry(struct bpf_offloaded_map *offmap, 461ff3d43f7SJakub Kicinski void *key, void *next_key); 462ff3d43f7SJakub Kicinski 4639816dd35SJakub Kicinski int nfp_bpf_event_output(struct nfp_app_bpf *bpf, struct sk_buff *skb); 4649816dd35SJakub Kicinski 465d48ae231SJakub Kicinski void nfp_bpf_ctrl_msg_rx(struct nfp_app *app, struct sk_buff *skb); 466d9ae7f2bSJakub Kicinski #endif 467