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 { 75dcb0c27fSJakub Kicinski STATIC_REG_IMMA = 20, /* Bank AB */ 7618e53b6cSJakub Kicinski STATIC_REG_IMM = 21, /* Bank AB */ 77d3488480SJakub Kicinski STATIC_REG_STACK = 22, /* Bank A */ 7818e53b6cSJakub Kicinski STATIC_REG_PKT_LEN = 22, /* Bank B */ 7918e53b6cSJakub Kicinski }; 8018e53b6cSJakub Kicinski 8118e53b6cSJakub Kicinski enum pkt_vec { 8218e53b6cSJakub Kicinski PKT_VEC_PKT_LEN = 0, 8318e53b6cSJakub Kicinski PKT_VEC_PKT_PTR = 2, 84d9ae7f2bSJakub Kicinski }; 85d9ae7f2bSJakub Kicinski 8618e53b6cSJakub Kicinski #define pv_len(np) reg_lm(1, PKT_VEC_PKT_LEN) 8718e53b6cSJakub Kicinski #define pv_ctm_ptr(np) reg_lm(1, PKT_VEC_PKT_PTR) 8818e53b6cSJakub Kicinski 89d3488480SJakub Kicinski #define stack_reg(np) reg_a(STATIC_REG_STACK) 90d3488480SJakub Kicinski #define stack_imm(np) imm_b(np) 9118e53b6cSJakub Kicinski #define plen_reg(np) reg_b(STATIC_REG_PKT_LEN) 9218e53b6cSJakub Kicinski #define pptr_reg(np) pv_ctm_ptr(np) 9318e53b6cSJakub Kicinski #define imm_a(np) reg_a(STATIC_REG_IMM) 9418e53b6cSJakub Kicinski #define imm_b(np) reg_b(STATIC_REG_IMM) 95dcb0c27fSJakub Kicinski #define imma_a(np) reg_a(STATIC_REG_IMMA) 96dcb0c27fSJakub Kicinski #define imma_b(np) reg_b(STATIC_REG_IMMA) 9718e53b6cSJakub Kicinski #define imm_both(np) reg_both(STATIC_REG_IMM) 98d9ae7f2bSJakub Kicinski 99509144e2SJakub Kicinski #define NFP_BPF_ABI_FLAGS reg_imm(0) 100d9ae7f2bSJakub Kicinski #define NFP_BPF_ABI_FLAG_MARK 1 101d9ae7f2bSJakub Kicinski 10277a844eeSJakub Kicinski /** 10377a844eeSJakub Kicinski * struct nfp_app_bpf - bpf app priv structure 10477a844eeSJakub Kicinski * @app: backpointer to the app 1050d49eaf4SJakub Kicinski * 106d48ae231SJakub Kicinski * @tag_allocator: bitmap of control message tags in use 107d48ae231SJakub Kicinski * @tag_alloc_next: next tag bit to allocate 108d48ae231SJakub Kicinski * @tag_alloc_last: next tag bit to be freed 109d48ae231SJakub Kicinski * 110d48ae231SJakub Kicinski * @cmsg_replies: received cmsg replies waiting to be consumed 111d48ae231SJakub Kicinski * @cmsg_wq: work queue for waiting for cmsg replies 112d48ae231SJakub Kicinski * 1134da98eeaSJakub Kicinski * @map_list: list of offloaded maps 1141bba4c41SJakub Kicinski * @maps_in_use: number of currently offloaded maps 1151bba4c41SJakub Kicinski * @map_elems_in_use: number of elements allocated to offloaded maps 1164da98eeaSJakub Kicinski * 1170d49eaf4SJakub Kicinski * @adjust_head: adjust head capability 118703f578aSJakub Kicinski * @adjust_head.flags: extra flags for adjust head 119703f578aSJakub Kicinski * @adjust_head.off_min: minimal packet offset within buffer required 120703f578aSJakub Kicinski * @adjust_head.off_max: maximum packet offset within buffer required 121703f578aSJakub Kicinski * @adjust_head.guaranteed_sub: negative adjustment guaranteed possible 122703f578aSJakub Kicinski * @adjust_head.guaranteed_add: positive adjustment guaranteed possible 1239d080d5dSJakub Kicinski * 1249d080d5dSJakub Kicinski * @maps: map capability 125703f578aSJakub Kicinski * @maps.types: supported map types 126703f578aSJakub Kicinski * @maps.max_maps: max number of maps supported 127703f578aSJakub Kicinski * @maps.max_elems: max number of entries in each map 128703f578aSJakub Kicinski * @maps.max_key_sz: max size of map key 129703f578aSJakub Kicinski * @maps.max_val_sz: max size of map value 130703f578aSJakub Kicinski * @maps.max_elem_sz: max size of map entry (key + value) 1319d080d5dSJakub Kicinski * 1329d080d5dSJakub Kicinski * @helpers: helper addressess for various calls 133703f578aSJakub Kicinski * @helpers.map_lookup: map lookup helper address 13444d65a47SJakub Kicinski * @helpers.map_update: map update helper address 135bfee64deSJakub Kicinski * @helpers.map_delete: map delete helper address 136df4a37d8SJakub Kicinski * 137df4a37d8SJakub Kicinski * @pseudo_random: FW initialized the pseudo-random machinery (CSRs) 13877a844eeSJakub Kicinski */ 13977a844eeSJakub Kicinski struct nfp_app_bpf { 14077a844eeSJakub Kicinski struct nfp_app *app; 1410d49eaf4SJakub Kicinski 142d48ae231SJakub Kicinski DECLARE_BITMAP(tag_allocator, U16_MAX + 1); 143d48ae231SJakub Kicinski u16 tag_alloc_next; 144d48ae231SJakub Kicinski u16 tag_alloc_last; 145d48ae231SJakub Kicinski 146d48ae231SJakub Kicinski struct sk_buff_head cmsg_replies; 147d48ae231SJakub Kicinski struct wait_queue_head cmsg_wq; 148d48ae231SJakub Kicinski 1494da98eeaSJakub Kicinski struct list_head map_list; 1501bba4c41SJakub Kicinski unsigned int maps_in_use; 1511bba4c41SJakub Kicinski unsigned int map_elems_in_use; 1524da98eeaSJakub Kicinski 1530d49eaf4SJakub Kicinski struct nfp_bpf_cap_adjust_head { 1540d49eaf4SJakub Kicinski u32 flags; 1550d49eaf4SJakub Kicinski int off_min; 1560d49eaf4SJakub Kicinski int off_max; 1578231f844SJakub Kicinski int guaranteed_sub; 1588231f844SJakub Kicinski int guaranteed_add; 1590d49eaf4SJakub Kicinski } adjust_head; 1609d080d5dSJakub Kicinski 1619d080d5dSJakub Kicinski struct { 1629d080d5dSJakub Kicinski u32 types; 1639d080d5dSJakub Kicinski u32 max_maps; 1649d080d5dSJakub Kicinski u32 max_elems; 1659d080d5dSJakub Kicinski u32 max_key_sz; 1669d080d5dSJakub Kicinski u32 max_val_sz; 1679d080d5dSJakub Kicinski u32 max_elem_sz; 1689d080d5dSJakub Kicinski } maps; 1699d080d5dSJakub Kicinski 1709d080d5dSJakub Kicinski struct { 1719d080d5dSJakub Kicinski u32 map_lookup; 17244d65a47SJakub Kicinski u32 map_update; 173bfee64deSJakub Kicinski u32 map_delete; 1749d080d5dSJakub Kicinski } helpers; 175df4a37d8SJakub Kicinski 176df4a37d8SJakub Kicinski bool pseudo_random; 17777a844eeSJakub Kicinski }; 17877a844eeSJakub Kicinski 179dcb0c27fSJakub Kicinski enum nfp_bpf_map_use { 180dcb0c27fSJakub Kicinski NFP_MAP_UNUSED = 0, 181dcb0c27fSJakub Kicinski NFP_MAP_USE_READ, 182dcb0c27fSJakub Kicinski NFP_MAP_USE_WRITE, 183dcb0c27fSJakub Kicinski NFP_MAP_USE_ATOMIC_CNT, 184dcb0c27fSJakub Kicinski }; 185dcb0c27fSJakub Kicinski 1864da98eeaSJakub Kicinski /** 1874da98eeaSJakub Kicinski * struct nfp_bpf_map - private per-map data attached to BPF maps for offload 1884da98eeaSJakub Kicinski * @offmap: pointer to the offloaded BPF map 1894da98eeaSJakub Kicinski * @bpf: back pointer to bpf app private structure 1904da98eeaSJakub Kicinski * @tid: table id identifying map on datapath 1914da98eeaSJakub Kicinski * @l: link on the nfp_app_bpf->map_list list 192dcb0c27fSJakub Kicinski * @use_map: map of how the value is used (in 4B chunks) 1934da98eeaSJakub Kicinski */ 1944da98eeaSJakub Kicinski struct nfp_bpf_map { 1954da98eeaSJakub Kicinski struct bpf_offloaded_map *offmap; 1964da98eeaSJakub Kicinski struct nfp_app_bpf *bpf; 1974da98eeaSJakub Kicinski u32 tid; 1984da98eeaSJakub Kicinski struct list_head l; 199dcb0c27fSJakub Kicinski enum nfp_bpf_map_use use_map[]; 2004da98eeaSJakub Kicinski }; 2014da98eeaSJakub Kicinski 202d9ae7f2bSJakub Kicinski struct nfp_prog; 203d9ae7f2bSJakub Kicinski struct nfp_insn_meta; 204d9ae7f2bSJakub Kicinski typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *); 205d9ae7f2bSJakub Kicinski 206d9ae7f2bSJakub Kicinski #define nfp_prog_first_meta(nfp_prog) \ 207d9ae7f2bSJakub Kicinski list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 208d9ae7f2bSJakub Kicinski #define nfp_prog_last_meta(nfp_prog) \ 209d9ae7f2bSJakub Kicinski list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 210d9ae7f2bSJakub Kicinski #define nfp_meta_next(meta) list_next_entry(meta, l) 211d9ae7f2bSJakub Kicinski #define nfp_meta_prev(meta) list_prev_entry(meta, l) 212d9ae7f2bSJakub Kicinski 2132f46e0c1SJakub Kicinski /** 2142f46e0c1SJakub Kicinski * struct nfp_bpf_reg_state - register state for calls 2152f46e0c1SJakub Kicinski * @reg: BPF register state from latest path 2162f46e0c1SJakub Kicinski * @var_off: for stack arg - changes stack offset on different paths 2172f46e0c1SJakub Kicinski */ 2182f46e0c1SJakub Kicinski struct nfp_bpf_reg_state { 2192f46e0c1SJakub Kicinski struct bpf_reg_state reg; 2202f46e0c1SJakub Kicinski bool var_off; 2212f46e0c1SJakub Kicinski }; 2222f46e0c1SJakub Kicinski 223a09d5c52SJiong Wang #define FLAG_INSN_IS_JUMP_DST BIT(0) 224a09d5c52SJiong Wang 225d9ae7f2bSJakub Kicinski /** 226d9ae7f2bSJakub Kicinski * struct nfp_insn_meta - BPF instruction wrapper 227d9ae7f2bSJakub Kicinski * @insn: BPF instruction 2282ca71441SJakub Kicinski * @ptr: pointer type for memory operations 2299879a381SJiong Wang * @ldst_gather_len: memcpy length gathered from load/store sequence 2309879a381SJiong Wang * @paired_st: the paired store insn at the head of the sequence 231b14157eeSJakub Kicinski * @ptr_not_const: pointer is not always constant 232be759237SJiong Wang * @pkt_cache: packet data cache information 233be759237SJiong Wang * @pkt_cache.range_start: start offset for associated packet data cache 234be759237SJiong Wang * @pkt_cache.range_end: end offset for associated packet data cache 235be759237SJiong Wang * @pkt_cache.do_init: this read needs to initialize packet data cache 23641aed09cSJakub Kicinski * @xadd_over_16bit: 16bit immediate is not guaranteed 23741aed09cSJakub Kicinski * @xadd_maybe_16bit: 16bit immediate is possible 2385b674140SJiong Wang * @jmp_dst: destination info for jump instructions 2397bdc97beSJakub Kicinski * @jump_neg_op: jump instruction has inverted immediate, use ADD instead of SUB 24077a3d311SJakub Kicinski * @func_id: function id for call instructions 24177a3d311SJakub Kicinski * @arg1: arg1 for call instructions 24277a3d311SJakub Kicinski * @arg2: arg2 for call instructions 243d9ae7f2bSJakub Kicinski * @off: index of first generated machine instruction (in nfp_prog.prog) 244d9ae7f2bSJakub Kicinski * @n: eBPF instruction number 245a09d5c52SJiong Wang * @flags: eBPF instruction extra optimization flags 246d9ae7f2bSJakub Kicinski * @skip: skip this instruction (optimized out) 247d9ae7f2bSJakub Kicinski * @double_cb: callback for second part of the instruction 248d9ae7f2bSJakub Kicinski * @l: link on nfp_prog->insns list 249d9ae7f2bSJakub Kicinski */ 250d9ae7f2bSJakub Kicinski struct nfp_insn_meta { 251d9ae7f2bSJakub Kicinski struct bpf_insn insn; 2525b674140SJiong Wang union { 25341aed09cSJakub Kicinski /* pointer ops (ld/st/xadd) */ 2545b674140SJiong Wang struct { 2552ca71441SJakub Kicinski struct bpf_reg_state ptr; 2569879a381SJiong Wang struct bpf_insn *paired_st; 2579879a381SJiong Wang s16 ldst_gather_len; 258b14157eeSJakub Kicinski bool ptr_not_const; 259be759237SJiong Wang struct { 260be759237SJiong Wang s16 range_start; 261be759237SJiong Wang s16 range_end; 262be759237SJiong Wang bool do_init; 263be759237SJiong Wang } pkt_cache; 26441aed09cSJakub Kicinski bool xadd_over_16bit; 26541aed09cSJakub Kicinski bool xadd_maybe_16bit; 2665b674140SJiong Wang }; 26741aed09cSJakub Kicinski /* jump */ 2687bdc97beSJakub Kicinski struct { 2695b674140SJiong Wang struct nfp_insn_meta *jmp_dst; 2707bdc97beSJakub Kicinski bool jump_neg_op; 2717bdc97beSJakub Kicinski }; 27241aed09cSJakub Kicinski /* function calls */ 27377a3d311SJakub Kicinski struct { 27477a3d311SJakub Kicinski u32 func_id; 27577a3d311SJakub Kicinski struct bpf_reg_state arg1; 2762f46e0c1SJakub Kicinski struct nfp_bpf_reg_state arg2; 27777a3d311SJakub Kicinski }; 2785b674140SJiong Wang }; 279d9ae7f2bSJakub Kicinski unsigned int off; 280d9ae7f2bSJakub Kicinski unsigned short n; 281a09d5c52SJiong Wang unsigned short flags; 282d9ae7f2bSJakub Kicinski bool skip; 283d9ae7f2bSJakub Kicinski instr_cb_t double_cb; 284d9ae7f2bSJakub Kicinski 285d9ae7f2bSJakub Kicinski struct list_head l; 286d9ae7f2bSJakub Kicinski }; 287d9ae7f2bSJakub Kicinski 288d9ae7f2bSJakub Kicinski #define BPF_SIZE_MASK 0x18 289d9ae7f2bSJakub Kicinski 290d9ae7f2bSJakub Kicinski static inline u8 mbpf_class(const struct nfp_insn_meta *meta) 291d9ae7f2bSJakub Kicinski { 292d9ae7f2bSJakub Kicinski return BPF_CLASS(meta->insn.code); 293d9ae7f2bSJakub Kicinski } 294d9ae7f2bSJakub Kicinski 295d9ae7f2bSJakub Kicinski static inline u8 mbpf_src(const struct nfp_insn_meta *meta) 296d9ae7f2bSJakub Kicinski { 297d9ae7f2bSJakub Kicinski return BPF_SRC(meta->insn.code); 298d9ae7f2bSJakub Kicinski } 299d9ae7f2bSJakub Kicinski 300d9ae7f2bSJakub Kicinski static inline u8 mbpf_op(const struct nfp_insn_meta *meta) 301d9ae7f2bSJakub Kicinski { 302d9ae7f2bSJakub Kicinski return BPF_OP(meta->insn.code); 303d9ae7f2bSJakub Kicinski } 304d9ae7f2bSJakub Kicinski 305d9ae7f2bSJakub Kicinski static inline u8 mbpf_mode(const struct nfp_insn_meta *meta) 306d9ae7f2bSJakub Kicinski { 307d9ae7f2bSJakub Kicinski return BPF_MODE(meta->insn.code); 308d9ae7f2bSJakub Kicinski } 309d9ae7f2bSJakub Kicinski 3105e4d6d20SJiong Wang static inline bool is_mbpf_load(const struct nfp_insn_meta *meta) 3115e4d6d20SJiong Wang { 3125e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM); 3135e4d6d20SJiong Wang } 3145e4d6d20SJiong Wang 3155e4d6d20SJiong Wang static inline bool is_mbpf_store(const struct nfp_insn_meta *meta) 3165e4d6d20SJiong Wang { 3175e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM); 3185e4d6d20SJiong Wang } 3195e4d6d20SJiong Wang 32087b10ecdSJiong Wang static inline bool is_mbpf_load_pkt(const struct nfp_insn_meta *meta) 32187b10ecdSJiong Wang { 32287b10ecdSJiong Wang return is_mbpf_load(meta) && meta->ptr.type == PTR_TO_PACKET; 32387b10ecdSJiong Wang } 32487b10ecdSJiong Wang 32587b10ecdSJiong Wang static inline bool is_mbpf_store_pkt(const struct nfp_insn_meta *meta) 32687b10ecdSJiong Wang { 32787b10ecdSJiong Wang return is_mbpf_store(meta) && meta->ptr.type == PTR_TO_PACKET; 32887b10ecdSJiong Wang } 32987b10ecdSJiong Wang 33087b10ecdSJiong Wang static inline bool is_mbpf_classic_load(const struct nfp_insn_meta *meta) 33187b10ecdSJiong Wang { 33287b10ecdSJiong Wang u8 code = meta->insn.code; 33387b10ecdSJiong Wang 33487b10ecdSJiong Wang return BPF_CLASS(code) == BPF_LD && 33587b10ecdSJiong Wang (BPF_MODE(code) == BPF_ABS || BPF_MODE(code) == BPF_IND); 33687b10ecdSJiong Wang } 33787b10ecdSJiong Wang 33887b10ecdSJiong Wang static inline bool is_mbpf_classic_store(const struct nfp_insn_meta *meta) 33987b10ecdSJiong Wang { 34087b10ecdSJiong Wang u8 code = meta->insn.code; 34187b10ecdSJiong Wang 34287b10ecdSJiong Wang return BPF_CLASS(code) == BPF_ST && BPF_MODE(code) == BPF_MEM; 34387b10ecdSJiong Wang } 34487b10ecdSJiong Wang 34587b10ecdSJiong Wang static inline bool is_mbpf_classic_store_pkt(const struct nfp_insn_meta *meta) 34687b10ecdSJiong Wang { 34787b10ecdSJiong Wang return is_mbpf_classic_store(meta) && meta->ptr.type == PTR_TO_PACKET; 34887b10ecdSJiong Wang } 34987b10ecdSJiong Wang 350dcb0c27fSJakub Kicinski static inline bool is_mbpf_xadd(const struct nfp_insn_meta *meta) 351dcb0c27fSJakub Kicinski { 352dcb0c27fSJakub Kicinski return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_XADD); 353dcb0c27fSJakub Kicinski } 354dcb0c27fSJakub Kicinski 355d9ae7f2bSJakub Kicinski /** 356d9ae7f2bSJakub Kicinski * struct nfp_prog - nfp BPF program 35777a844eeSJakub Kicinski * @bpf: backpointer to the bpf app priv structure 358d9ae7f2bSJakub Kicinski * @prog: machine code 359d9ae7f2bSJakub Kicinski * @prog_len: number of valid instructions in @prog array 360d9ae7f2bSJakub Kicinski * @__prog_alloc_len: alloc size of @prog array 361c6c580d7SJakub Kicinski * @verifier_meta: temporary storage for verifier's insn meta 362012bb8a8SJakub Kicinski * @type: BPF program type 363854dc87dSJiong Wang * @last_bpf_off: address of the last instruction translated from BPF 364d9ae7f2bSJakub Kicinski * @tgt_out: jump target for normal exit 365d9ae7f2bSJakub Kicinski * @tgt_abort: jump target for abort (e.g. access outside of packet buffer) 366d9ae7f2bSJakub Kicinski * @n_translated: number of successfully translated instructions (for errors) 367d9ae7f2bSJakub Kicinski * @error: error code if something went wrong 368ee9133a8SJakub Kicinski * @stack_depth: max stack depth from the verifier 3698231f844SJakub Kicinski * @adjust_head_location: if program has single adjust head call - the insn no. 370d9ae7f2bSJakub Kicinski * @insns: list of BPF instruction wrappers (struct nfp_insn_meta) 371d9ae7f2bSJakub Kicinski */ 372d9ae7f2bSJakub Kicinski struct nfp_prog { 37377a844eeSJakub Kicinski struct nfp_app_bpf *bpf; 37477a844eeSJakub Kicinski 375d9ae7f2bSJakub Kicinski u64 *prog; 376d9ae7f2bSJakub Kicinski unsigned int prog_len; 377d9ae7f2bSJakub Kicinski unsigned int __prog_alloc_len; 378d9ae7f2bSJakub Kicinski 379c6c580d7SJakub Kicinski struct nfp_insn_meta *verifier_meta; 380c6c580d7SJakub Kicinski 381012bb8a8SJakub Kicinski enum bpf_prog_type type; 382d9ae7f2bSJakub Kicinski 383854dc87dSJiong Wang unsigned int last_bpf_off; 384d9ae7f2bSJakub Kicinski unsigned int tgt_out; 385d9ae7f2bSJakub Kicinski unsigned int tgt_abort; 386d9ae7f2bSJakub Kicinski 387d9ae7f2bSJakub Kicinski unsigned int n_translated; 388d9ae7f2bSJakub Kicinski int error; 389d9ae7f2bSJakub Kicinski 390ee9133a8SJakub Kicinski unsigned int stack_depth; 3918231f844SJakub Kicinski unsigned int adjust_head_location; 392ee9133a8SJakub Kicinski 393d9ae7f2bSJakub Kicinski struct list_head insns; 394d9ae7f2bSJakub Kicinski }; 395d9ae7f2bSJakub Kicinski 396d3f89b98SJakub Kicinski /** 397d3f89b98SJakub Kicinski * struct nfp_bpf_vnic - per-vNIC BPF priv structure 398d3f89b98SJakub Kicinski * @tc_prog: currently loaded cls_bpf program 3992314fe9eSJakub Kicinski * @start_off: address of the first instruction in the memory 4002314fe9eSJakub Kicinski * @tgt_done: jump target to get the next packet 401d3f89b98SJakub Kicinski */ 402d3f89b98SJakub Kicinski struct nfp_bpf_vnic { 403d3f89b98SJakub Kicinski struct bpf_prog *tc_prog; 4042314fe9eSJakub Kicinski unsigned int start_off; 4052314fe9eSJakub Kicinski unsigned int tgt_done; 406d3f89b98SJakub Kicinski }; 407d3f89b98SJakub Kicinski 4081549921dSJakub Kicinski void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt); 409c6c580d7SJakub Kicinski int nfp_bpf_jit(struct nfp_prog *prog); 41074801e50SQuentin Monnet bool nfp_bpf_supported_opcode(u8 code); 411d9ae7f2bSJakub Kicinski 412cae1927cSJakub Kicinski extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops; 413d9ae7f2bSJakub Kicinski 414c6c580d7SJakub Kicinski struct netdev_bpf; 415c6c580d7SJakub Kicinski struct nfp_app; 416bb45e51cSJakub Kicinski struct nfp_net; 417bb45e51cSJakub Kicinski 418af93d15aSJakub Kicinski int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn, 419af93d15aSJakub Kicinski struct netdev_bpf *bpf); 4209ce7a956SJakub Kicinski int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog, 42152be9a7cSQuentin Monnet bool old_prog, struct netlink_ext_ack *extack); 422bb45e51cSJakub Kicinski 4235b674140SJiong Wang struct nfp_insn_meta * 4245b674140SJiong Wang nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta, 4255b674140SJiong Wang unsigned int insn_idx, unsigned int n_insns); 4262314fe9eSJakub Kicinski 4272314fe9eSJakub Kicinski void *nfp_bpf_relo_for_vnic(struct nfp_prog *nfp_prog, struct nfp_bpf_vnic *bv); 428d48ae231SJakub Kicinski 429ff3d43f7SJakub Kicinski long long int 430ff3d43f7SJakub Kicinski nfp_bpf_ctrl_alloc_map(struct nfp_app_bpf *bpf, struct bpf_map *map); 431ff3d43f7SJakub Kicinski void 432ff3d43f7SJakub Kicinski nfp_bpf_ctrl_free_map(struct nfp_app_bpf *bpf, struct nfp_bpf_map *nfp_map); 433ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getfirst_entry(struct bpf_offloaded_map *offmap, 434ff3d43f7SJakub Kicinski void *next_key); 435ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_update_entry(struct bpf_offloaded_map *offmap, 436ff3d43f7SJakub Kicinski void *key, void *value, u64 flags); 437ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_del_entry(struct bpf_offloaded_map *offmap, void *key); 438ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_lookup_entry(struct bpf_offloaded_map *offmap, 439ff3d43f7SJakub Kicinski void *key, void *value); 440ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getnext_entry(struct bpf_offloaded_map *offmap, 441ff3d43f7SJakub Kicinski void *key, void *next_key); 442ff3d43f7SJakub Kicinski 443d48ae231SJakub Kicinski void nfp_bpf_ctrl_msg_rx(struct nfp_app *app, struct sk_buff *skb); 444d9ae7f2bSJakub Kicinski #endif 445