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 50ab01f4acSJakub Kicinski #define cmsg_warn(bpf, msg...) nn_dp_warn(&(bpf)->app->ctrl->dp, msg) 51ab01f4acSJakub Kicinski 522314fe9eSJakub Kicinski /* For relocation logic use up-most byte of branch instruction as scratch 53d9ae7f2bSJakub Kicinski * area. Remember to clear this before sending instructions to HW! 54d9ae7f2bSJakub Kicinski */ 552314fe9eSJakub Kicinski #define OP_RELO_TYPE 0xff00000000000000ULL 56d9ae7f2bSJakub Kicinski 572314fe9eSJakub Kicinski enum nfp_relo_type { 582314fe9eSJakub Kicinski RELO_NONE = 0, 592314fe9eSJakub Kicinski /* standard internal jumps */ 602314fe9eSJakub Kicinski RELO_BR_REL, 612314fe9eSJakub Kicinski /* internal jumps to parts of the outro */ 622314fe9eSJakub Kicinski RELO_BR_GO_OUT, 632314fe9eSJakub Kicinski RELO_BR_GO_ABORT, 642314fe9eSJakub Kicinski /* external jumps to fixed addresses */ 652314fe9eSJakub Kicinski RELO_BR_NEXT_PKT, 6677a3d311SJakub Kicinski RELO_BR_HELPER, 6777a3d311SJakub Kicinski /* immediate relocation against load address */ 6877a3d311SJakub Kicinski RELO_IMMED_REL, 69d9ae7f2bSJakub Kicinski }; 70d9ae7f2bSJakub Kicinski 71e84797feSJakub Kicinski /* To make absolute relocated branches (branches other than RELO_BR_REL) 72e84797feSJakub Kicinski * distinguishable in user space dumps from normal jumps, add a large offset 73e84797feSJakub Kicinski * to them. 74e84797feSJakub Kicinski */ 75e84797feSJakub Kicinski #define BR_OFF_RELO 15000 76e84797feSJakub Kicinski 77d9ae7f2bSJakub Kicinski enum static_regs { 78dcb0c27fSJakub Kicinski STATIC_REG_IMMA = 20, /* Bank AB */ 7918e53b6cSJakub Kicinski STATIC_REG_IMM = 21, /* Bank AB */ 80d3488480SJakub Kicinski STATIC_REG_STACK = 22, /* Bank A */ 8118e53b6cSJakub Kicinski STATIC_REG_PKT_LEN = 22, /* Bank B */ 8218e53b6cSJakub Kicinski }; 8318e53b6cSJakub Kicinski 8418e53b6cSJakub Kicinski enum pkt_vec { 8518e53b6cSJakub Kicinski PKT_VEC_PKT_LEN = 0, 8618e53b6cSJakub Kicinski PKT_VEC_PKT_PTR = 2, 87d985888fSJakub Kicinski PKT_VEC_QSEL_SET = 4, 88d985888fSJakub Kicinski PKT_VEC_QSEL_VAL = 6, 89d9ae7f2bSJakub Kicinski }; 90d9ae7f2bSJakub Kicinski 91d985888fSJakub Kicinski #define PKT_VEL_QSEL_SET_BIT 4 92d985888fSJakub Kicinski 9318e53b6cSJakub Kicinski #define pv_len(np) reg_lm(1, PKT_VEC_PKT_LEN) 9418e53b6cSJakub Kicinski #define pv_ctm_ptr(np) reg_lm(1, PKT_VEC_PKT_PTR) 95d985888fSJakub Kicinski #define pv_qsel_set(np) reg_lm(1, PKT_VEC_QSEL_SET) 96d985888fSJakub Kicinski #define pv_qsel_val(np) reg_lm(1, PKT_VEC_QSEL_VAL) 9718e53b6cSJakub Kicinski 98d3488480SJakub Kicinski #define stack_reg(np) reg_a(STATIC_REG_STACK) 99d3488480SJakub Kicinski #define stack_imm(np) imm_b(np) 10018e53b6cSJakub Kicinski #define plen_reg(np) reg_b(STATIC_REG_PKT_LEN) 10118e53b6cSJakub Kicinski #define pptr_reg(np) pv_ctm_ptr(np) 10218e53b6cSJakub Kicinski #define imm_a(np) reg_a(STATIC_REG_IMM) 10318e53b6cSJakub Kicinski #define imm_b(np) reg_b(STATIC_REG_IMM) 104dcb0c27fSJakub Kicinski #define imma_a(np) reg_a(STATIC_REG_IMMA) 105dcb0c27fSJakub Kicinski #define imma_b(np) reg_b(STATIC_REG_IMMA) 10618e53b6cSJakub Kicinski #define imm_both(np) reg_both(STATIC_REG_IMM) 107d9ae7f2bSJakub Kicinski 108509144e2SJakub Kicinski #define NFP_BPF_ABI_FLAGS reg_imm(0) 109d9ae7f2bSJakub Kicinski #define NFP_BPF_ABI_FLAG_MARK 1 110d9ae7f2bSJakub Kicinski 11177a844eeSJakub Kicinski /** 11277a844eeSJakub Kicinski * struct nfp_app_bpf - bpf app priv structure 11377a844eeSJakub Kicinski * @app: backpointer to the app 1140d49eaf4SJakub Kicinski * 115602144c2SJakub Kicinski * @bpf_dev: BPF offload device handle 116602144c2SJakub Kicinski * 117d48ae231SJakub Kicinski * @tag_allocator: bitmap of control message tags in use 118d48ae231SJakub Kicinski * @tag_alloc_next: next tag bit to allocate 119d48ae231SJakub Kicinski * @tag_alloc_last: next tag bit to be freed 120d48ae231SJakub Kicinski * 121d48ae231SJakub Kicinski * @cmsg_replies: received cmsg replies waiting to be consumed 122d48ae231SJakub Kicinski * @cmsg_wq: work queue for waiting for cmsg replies 123d48ae231SJakub Kicinski * 1244da98eeaSJakub Kicinski * @map_list: list of offloaded maps 1251bba4c41SJakub Kicinski * @maps_in_use: number of currently offloaded maps 1261bba4c41SJakub Kicinski * @map_elems_in_use: number of elements allocated to offloaded maps 1274da98eeaSJakub Kicinski * 128630a4d38SJakub Kicinski * @maps_neutral: hash table of offload-neutral maps (on pointer) 129630a4d38SJakub Kicinski * 1300d49eaf4SJakub Kicinski * @adjust_head: adjust head capability 131703f578aSJakub Kicinski * @adjust_head.flags: extra flags for adjust head 132703f578aSJakub Kicinski * @adjust_head.off_min: minimal packet offset within buffer required 133703f578aSJakub Kicinski * @adjust_head.off_max: maximum packet offset within buffer required 134703f578aSJakub Kicinski * @adjust_head.guaranteed_sub: negative adjustment guaranteed possible 135703f578aSJakub Kicinski * @adjust_head.guaranteed_add: positive adjustment guaranteed possible 1369d080d5dSJakub Kicinski * 1379d080d5dSJakub Kicinski * @maps: map capability 138703f578aSJakub Kicinski * @maps.types: supported map types 139703f578aSJakub Kicinski * @maps.max_maps: max number of maps supported 140703f578aSJakub Kicinski * @maps.max_elems: max number of entries in each map 141703f578aSJakub Kicinski * @maps.max_key_sz: max size of map key 142703f578aSJakub Kicinski * @maps.max_val_sz: max size of map value 143703f578aSJakub Kicinski * @maps.max_elem_sz: max size of map entry (key + value) 1449d080d5dSJakub Kicinski * 1459d080d5dSJakub Kicinski * @helpers: helper addressess for various calls 146703f578aSJakub Kicinski * @helpers.map_lookup: map lookup helper address 14744d65a47SJakub Kicinski * @helpers.map_update: map update helper address 148bfee64deSJakub Kicinski * @helpers.map_delete: map delete helper address 1499816dd35SJakub Kicinski * @helpers.perf_event_output: output perf event to a ring buffer 150df4a37d8SJakub Kicinski * 151df4a37d8SJakub Kicinski * @pseudo_random: FW initialized the pseudo-random machinery (CSRs) 152d985888fSJakub Kicinski * @queue_select: BPF can set the RX queue ID in packet vector 1530c261593SJakub Kicinski * @adjust_tail: BPF can simply trunc packet size for adjust tail 15477a844eeSJakub Kicinski */ 15577a844eeSJakub Kicinski struct nfp_app_bpf { 15677a844eeSJakub Kicinski struct nfp_app *app; 1570d49eaf4SJakub Kicinski 158602144c2SJakub Kicinski struct bpf_offload_dev *bpf_dev; 159602144c2SJakub Kicinski 160d48ae231SJakub Kicinski DECLARE_BITMAP(tag_allocator, U16_MAX + 1); 161d48ae231SJakub Kicinski u16 tag_alloc_next; 162d48ae231SJakub Kicinski u16 tag_alloc_last; 163d48ae231SJakub Kicinski 164d48ae231SJakub Kicinski struct sk_buff_head cmsg_replies; 165d48ae231SJakub Kicinski struct wait_queue_head cmsg_wq; 166d48ae231SJakub Kicinski 1674da98eeaSJakub Kicinski struct list_head map_list; 1681bba4c41SJakub Kicinski unsigned int maps_in_use; 1691bba4c41SJakub Kicinski unsigned int map_elems_in_use; 1704da98eeaSJakub Kicinski 171630a4d38SJakub Kicinski struct rhashtable maps_neutral; 172630a4d38SJakub Kicinski 1730d49eaf4SJakub Kicinski struct nfp_bpf_cap_adjust_head { 1740d49eaf4SJakub Kicinski u32 flags; 1750d49eaf4SJakub Kicinski int off_min; 1760d49eaf4SJakub Kicinski int off_max; 1778231f844SJakub Kicinski int guaranteed_sub; 1788231f844SJakub Kicinski int guaranteed_add; 1790d49eaf4SJakub Kicinski } adjust_head; 1809d080d5dSJakub Kicinski 1819d080d5dSJakub Kicinski struct { 1829d080d5dSJakub Kicinski u32 types; 1839d080d5dSJakub Kicinski u32 max_maps; 1849d080d5dSJakub Kicinski u32 max_elems; 1859d080d5dSJakub Kicinski u32 max_key_sz; 1869d080d5dSJakub Kicinski u32 max_val_sz; 1879d080d5dSJakub Kicinski u32 max_elem_sz; 1889d080d5dSJakub Kicinski } maps; 1899d080d5dSJakub Kicinski 1909d080d5dSJakub Kicinski struct { 1919d080d5dSJakub Kicinski u32 map_lookup; 19244d65a47SJakub Kicinski u32 map_update; 193bfee64deSJakub Kicinski u32 map_delete; 1949816dd35SJakub Kicinski u32 perf_event_output; 1959d080d5dSJakub Kicinski } helpers; 196df4a37d8SJakub Kicinski 197df4a37d8SJakub Kicinski bool pseudo_random; 198d985888fSJakub Kicinski bool queue_select; 1990c261593SJakub Kicinski bool adjust_tail; 20077a844eeSJakub Kicinski }; 20177a844eeSJakub Kicinski 202dcb0c27fSJakub Kicinski enum nfp_bpf_map_use { 203dcb0c27fSJakub Kicinski NFP_MAP_UNUSED = 0, 204dcb0c27fSJakub Kicinski NFP_MAP_USE_READ, 205dcb0c27fSJakub Kicinski NFP_MAP_USE_WRITE, 206dcb0c27fSJakub Kicinski NFP_MAP_USE_ATOMIC_CNT, 207dcb0c27fSJakub Kicinski }; 208dcb0c27fSJakub Kicinski 2094da98eeaSJakub Kicinski /** 2104da98eeaSJakub Kicinski * struct nfp_bpf_map - private per-map data attached to BPF maps for offload 2114da98eeaSJakub Kicinski * @offmap: pointer to the offloaded BPF map 2124da98eeaSJakub Kicinski * @bpf: back pointer to bpf app private structure 2134da98eeaSJakub Kicinski * @tid: table id identifying map on datapath 2144da98eeaSJakub Kicinski * @l: link on the nfp_app_bpf->map_list list 215dcb0c27fSJakub Kicinski * @use_map: map of how the value is used (in 4B chunks) 2164da98eeaSJakub Kicinski */ 2174da98eeaSJakub Kicinski struct nfp_bpf_map { 2184da98eeaSJakub Kicinski struct bpf_offloaded_map *offmap; 2194da98eeaSJakub Kicinski struct nfp_app_bpf *bpf; 2204da98eeaSJakub Kicinski u32 tid; 2214da98eeaSJakub Kicinski struct list_head l; 222dcb0c27fSJakub Kicinski enum nfp_bpf_map_use use_map[]; 2234da98eeaSJakub Kicinski }; 2244da98eeaSJakub Kicinski 225630a4d38SJakub Kicinski struct nfp_bpf_neutral_map { 226630a4d38SJakub Kicinski struct rhash_head l; 227630a4d38SJakub Kicinski struct bpf_map *ptr; 228ab01f4acSJakub Kicinski u32 map_id; 229630a4d38SJakub Kicinski u32 count; 230630a4d38SJakub Kicinski }; 231630a4d38SJakub Kicinski 232630a4d38SJakub Kicinski extern const struct rhashtable_params nfp_bpf_maps_neutral_params; 233630a4d38SJakub Kicinski 234d9ae7f2bSJakub Kicinski struct nfp_prog; 235d9ae7f2bSJakub Kicinski struct nfp_insn_meta; 236d9ae7f2bSJakub Kicinski typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *); 237d9ae7f2bSJakub Kicinski 238d9ae7f2bSJakub Kicinski #define nfp_prog_first_meta(nfp_prog) \ 239d9ae7f2bSJakub Kicinski list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 240d9ae7f2bSJakub Kicinski #define nfp_prog_last_meta(nfp_prog) \ 241d9ae7f2bSJakub Kicinski list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 242d9ae7f2bSJakub Kicinski #define nfp_meta_next(meta) list_next_entry(meta, l) 243d9ae7f2bSJakub Kicinski #define nfp_meta_prev(meta) list_prev_entry(meta, l) 244d9ae7f2bSJakub Kicinski 2452f46e0c1SJakub Kicinski /** 2462f46e0c1SJakub Kicinski * struct nfp_bpf_reg_state - register state for calls 2472f46e0c1SJakub Kicinski * @reg: BPF register state from latest path 2482f46e0c1SJakub Kicinski * @var_off: for stack arg - changes stack offset on different paths 2492f46e0c1SJakub Kicinski */ 2502f46e0c1SJakub Kicinski struct nfp_bpf_reg_state { 2512f46e0c1SJakub Kicinski struct bpf_reg_state reg; 2522f46e0c1SJakub Kicinski bool var_off; 2532f46e0c1SJakub Kicinski }; 2542f46e0c1SJakub Kicinski 255a09d5c52SJiong Wang #define FLAG_INSN_IS_JUMP_DST BIT(0) 256a09d5c52SJiong Wang 257d9ae7f2bSJakub Kicinski /** 258d9ae7f2bSJakub Kicinski * struct nfp_insn_meta - BPF instruction wrapper 259d9ae7f2bSJakub Kicinski * @insn: BPF instruction 2602ca71441SJakub Kicinski * @ptr: pointer type for memory operations 2619879a381SJiong Wang * @ldst_gather_len: memcpy length gathered from load/store sequence 2629879a381SJiong Wang * @paired_st: the paired store insn at the head of the sequence 263b14157eeSJakub Kicinski * @ptr_not_const: pointer is not always constant 264be759237SJiong Wang * @pkt_cache: packet data cache information 265be759237SJiong Wang * @pkt_cache.range_start: start offset for associated packet data cache 266be759237SJiong Wang * @pkt_cache.range_end: end offset for associated packet data cache 267be759237SJiong Wang * @pkt_cache.do_init: this read needs to initialize packet data cache 26841aed09cSJakub Kicinski * @xadd_over_16bit: 16bit immediate is not guaranteed 26941aed09cSJakub Kicinski * @xadd_maybe_16bit: 16bit immediate is possible 2705b674140SJiong Wang * @jmp_dst: destination info for jump instructions 2717bdc97beSJakub Kicinski * @jump_neg_op: jump instruction has inverted immediate, use ADD instead of SUB 27277a3d311SJakub Kicinski * @func_id: function id for call instructions 27377a3d311SJakub Kicinski * @arg1: arg1 for call instructions 27477a3d311SJakub Kicinski * @arg2: arg2 for call instructions 275662c5472SJiong Wang * @umin_src: copy of core verifier umin_value for src opearnd. 276662c5472SJiong Wang * @umax_src: copy of core verifier umax_value for src operand. 27733b94310SJiong Wang * @umin_dst: copy of core verifier umin_value for dst opearnd. 27833b94310SJiong Wang * @umax_dst: copy of core verifier umax_value for dst operand. 279d9ae7f2bSJakub Kicinski * @off: index of first generated machine instruction (in nfp_prog.prog) 280d9ae7f2bSJakub Kicinski * @n: eBPF instruction number 281a09d5c52SJiong Wang * @flags: eBPF instruction extra optimization flags 282d9ae7f2bSJakub Kicinski * @skip: skip this instruction (optimized out) 283d9ae7f2bSJakub Kicinski * @double_cb: callback for second part of the instruction 284d9ae7f2bSJakub Kicinski * @l: link on nfp_prog->insns list 285d9ae7f2bSJakub Kicinski */ 286d9ae7f2bSJakub Kicinski struct nfp_insn_meta { 287d9ae7f2bSJakub Kicinski struct bpf_insn insn; 2885b674140SJiong Wang union { 28941aed09cSJakub Kicinski /* pointer ops (ld/st/xadd) */ 2905b674140SJiong Wang struct { 2912ca71441SJakub Kicinski struct bpf_reg_state ptr; 2929879a381SJiong Wang struct bpf_insn *paired_st; 2939879a381SJiong Wang s16 ldst_gather_len; 294b14157eeSJakub Kicinski bool ptr_not_const; 295be759237SJiong Wang struct { 296be759237SJiong Wang s16 range_start; 297be759237SJiong Wang s16 range_end; 298be759237SJiong Wang bool do_init; 299be759237SJiong Wang } pkt_cache; 30041aed09cSJakub Kicinski bool xadd_over_16bit; 30141aed09cSJakub Kicinski bool xadd_maybe_16bit; 3025b674140SJiong Wang }; 30341aed09cSJakub Kicinski /* jump */ 3047bdc97beSJakub Kicinski struct { 3055b674140SJiong Wang struct nfp_insn_meta *jmp_dst; 3067bdc97beSJakub Kicinski bool jump_neg_op; 3077bdc97beSJakub Kicinski }; 30841aed09cSJakub Kicinski /* function calls */ 30977a3d311SJakub Kicinski struct { 31077a3d311SJakub Kicinski u32 func_id; 31177a3d311SJakub Kicinski struct bpf_reg_state arg1; 3122f46e0c1SJakub Kicinski struct nfp_bpf_reg_state arg2; 31377a3d311SJakub Kicinski }; 31433b94310SJiong Wang /* We are interested in range info for operands of ALU 31533b94310SJiong Wang * operations. For example, shift amount, multiplicand and 31633b94310SJiong Wang * multiplier etc. 317991f5b36SJiong Wang */ 318991f5b36SJiong Wang struct { 319662c5472SJiong Wang u64 umin_src; 320662c5472SJiong Wang u64 umax_src; 32133b94310SJiong Wang u64 umin_dst; 32233b94310SJiong Wang u64 umax_dst; 323991f5b36SJiong Wang }; 3245b674140SJiong Wang }; 325d9ae7f2bSJakub Kicinski unsigned int off; 326d9ae7f2bSJakub Kicinski unsigned short n; 327a09d5c52SJiong Wang unsigned short flags; 328d9ae7f2bSJakub Kicinski bool skip; 329d9ae7f2bSJakub Kicinski instr_cb_t double_cb; 330d9ae7f2bSJakub Kicinski 331d9ae7f2bSJakub Kicinski struct list_head l; 332d9ae7f2bSJakub Kicinski }; 333d9ae7f2bSJakub Kicinski 334d9ae7f2bSJakub Kicinski #define BPF_SIZE_MASK 0x18 335d9ae7f2bSJakub Kicinski 336d9ae7f2bSJakub Kicinski static inline u8 mbpf_class(const struct nfp_insn_meta *meta) 337d9ae7f2bSJakub Kicinski { 338d9ae7f2bSJakub Kicinski return BPF_CLASS(meta->insn.code); 339d9ae7f2bSJakub Kicinski } 340d9ae7f2bSJakub Kicinski 341d9ae7f2bSJakub Kicinski static inline u8 mbpf_src(const struct nfp_insn_meta *meta) 342d9ae7f2bSJakub Kicinski { 343d9ae7f2bSJakub Kicinski return BPF_SRC(meta->insn.code); 344d9ae7f2bSJakub Kicinski } 345d9ae7f2bSJakub Kicinski 346d9ae7f2bSJakub Kicinski static inline u8 mbpf_op(const struct nfp_insn_meta *meta) 347d9ae7f2bSJakub Kicinski { 348d9ae7f2bSJakub Kicinski return BPF_OP(meta->insn.code); 349d9ae7f2bSJakub Kicinski } 350d9ae7f2bSJakub Kicinski 351d9ae7f2bSJakub Kicinski static inline u8 mbpf_mode(const struct nfp_insn_meta *meta) 352d9ae7f2bSJakub Kicinski { 353d9ae7f2bSJakub Kicinski return BPF_MODE(meta->insn.code); 354d9ae7f2bSJakub Kicinski } 355d9ae7f2bSJakub Kicinski 35633b94310SJiong Wang static inline bool is_mbpf_alu(const struct nfp_insn_meta *meta) 35733b94310SJiong Wang { 35833b94310SJiong Wang return mbpf_class(meta) == BPF_ALU64 || mbpf_class(meta) == BPF_ALU; 35933b94310SJiong Wang } 36033b94310SJiong Wang 3615e4d6d20SJiong Wang static inline bool is_mbpf_load(const struct nfp_insn_meta *meta) 3625e4d6d20SJiong Wang { 3635e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM); 3645e4d6d20SJiong Wang } 3655e4d6d20SJiong Wang 3665e4d6d20SJiong Wang static inline bool is_mbpf_store(const struct nfp_insn_meta *meta) 3675e4d6d20SJiong Wang { 3685e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM); 3695e4d6d20SJiong Wang } 3705e4d6d20SJiong Wang 37187b10ecdSJiong Wang static inline bool is_mbpf_load_pkt(const struct nfp_insn_meta *meta) 37287b10ecdSJiong Wang { 37387b10ecdSJiong Wang return is_mbpf_load(meta) && meta->ptr.type == PTR_TO_PACKET; 37487b10ecdSJiong Wang } 37587b10ecdSJiong Wang 37687b10ecdSJiong Wang static inline bool is_mbpf_store_pkt(const struct nfp_insn_meta *meta) 37787b10ecdSJiong Wang { 37887b10ecdSJiong Wang return is_mbpf_store(meta) && meta->ptr.type == PTR_TO_PACKET; 37987b10ecdSJiong Wang } 38087b10ecdSJiong Wang 38187b10ecdSJiong Wang static inline bool is_mbpf_classic_load(const struct nfp_insn_meta *meta) 38287b10ecdSJiong Wang { 38387b10ecdSJiong Wang u8 code = meta->insn.code; 38487b10ecdSJiong Wang 38587b10ecdSJiong Wang return BPF_CLASS(code) == BPF_LD && 38687b10ecdSJiong Wang (BPF_MODE(code) == BPF_ABS || BPF_MODE(code) == BPF_IND); 38787b10ecdSJiong Wang } 38887b10ecdSJiong Wang 38987b10ecdSJiong Wang static inline bool is_mbpf_classic_store(const struct nfp_insn_meta *meta) 39087b10ecdSJiong Wang { 39187b10ecdSJiong Wang u8 code = meta->insn.code; 39287b10ecdSJiong Wang 39387b10ecdSJiong Wang return BPF_CLASS(code) == BPF_ST && BPF_MODE(code) == BPF_MEM; 39487b10ecdSJiong Wang } 39587b10ecdSJiong Wang 39687b10ecdSJiong Wang static inline bool is_mbpf_classic_store_pkt(const struct nfp_insn_meta *meta) 39787b10ecdSJiong Wang { 39887b10ecdSJiong Wang return is_mbpf_classic_store(meta) && meta->ptr.type == PTR_TO_PACKET; 39987b10ecdSJiong Wang } 40087b10ecdSJiong Wang 401dcb0c27fSJakub Kicinski static inline bool is_mbpf_xadd(const struct nfp_insn_meta *meta) 402dcb0c27fSJakub Kicinski { 403dcb0c27fSJakub Kicinski return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_XADD); 404dcb0c27fSJakub Kicinski } 405dcb0c27fSJakub Kicinski 406d3d23fdbSJiong Wang static inline bool is_mbpf_mul(const struct nfp_insn_meta *meta) 407d3d23fdbSJiong Wang { 408d3d23fdbSJiong Wang return is_mbpf_alu(meta) && mbpf_op(meta) == BPF_MUL; 409d3d23fdbSJiong Wang } 410d3d23fdbSJiong Wang 4112a952b03SJiong Wang static inline bool is_mbpf_div(const struct nfp_insn_meta *meta) 4122a952b03SJiong Wang { 4132a952b03SJiong Wang return is_mbpf_alu(meta) && mbpf_op(meta) == BPF_DIV; 4142a952b03SJiong Wang } 4152a952b03SJiong Wang 416d9ae7f2bSJakub Kicinski /** 417d9ae7f2bSJakub Kicinski * struct nfp_prog - nfp BPF program 41877a844eeSJakub Kicinski * @bpf: backpointer to the bpf app priv structure 419d9ae7f2bSJakub Kicinski * @prog: machine code 420d9ae7f2bSJakub Kicinski * @prog_len: number of valid instructions in @prog array 421d9ae7f2bSJakub Kicinski * @__prog_alloc_len: alloc size of @prog array 422c6c580d7SJakub Kicinski * @verifier_meta: temporary storage for verifier's insn meta 423012bb8a8SJakub Kicinski * @type: BPF program type 424854dc87dSJiong Wang * @last_bpf_off: address of the last instruction translated from BPF 425d9ae7f2bSJakub Kicinski * @tgt_out: jump target for normal exit 426d9ae7f2bSJakub Kicinski * @tgt_abort: jump target for abort (e.g. access outside of packet buffer) 427d9ae7f2bSJakub Kicinski * @n_translated: number of successfully translated instructions (for errors) 428d9ae7f2bSJakub Kicinski * @error: error code if something went wrong 429ee9133a8SJakub Kicinski * @stack_depth: max stack depth from the verifier 4308231f844SJakub Kicinski * @adjust_head_location: if program has single adjust head call - the insn no. 431630a4d38SJakub Kicinski * @map_records_cnt: the number of map pointers recorded for this prog 432630a4d38SJakub Kicinski * @map_records: the map record pointers from bpf->maps_neutral 433d9ae7f2bSJakub Kicinski * @insns: list of BPF instruction wrappers (struct nfp_insn_meta) 434d9ae7f2bSJakub Kicinski */ 435d9ae7f2bSJakub Kicinski struct nfp_prog { 43677a844eeSJakub Kicinski struct nfp_app_bpf *bpf; 43777a844eeSJakub Kicinski 438d9ae7f2bSJakub Kicinski u64 *prog; 439d9ae7f2bSJakub Kicinski unsigned int prog_len; 440d9ae7f2bSJakub Kicinski unsigned int __prog_alloc_len; 441d9ae7f2bSJakub Kicinski 442c6c580d7SJakub Kicinski struct nfp_insn_meta *verifier_meta; 443c6c580d7SJakub Kicinski 444012bb8a8SJakub Kicinski enum bpf_prog_type type; 445d9ae7f2bSJakub Kicinski 446854dc87dSJiong Wang unsigned int last_bpf_off; 447d9ae7f2bSJakub Kicinski unsigned int tgt_out; 448d9ae7f2bSJakub Kicinski unsigned int tgt_abort; 449d9ae7f2bSJakub Kicinski 450d9ae7f2bSJakub Kicinski unsigned int n_translated; 451d9ae7f2bSJakub Kicinski int error; 452d9ae7f2bSJakub Kicinski 453ee9133a8SJakub Kicinski unsigned int stack_depth; 4548231f844SJakub Kicinski unsigned int adjust_head_location; 455ee9133a8SJakub Kicinski 456630a4d38SJakub Kicinski unsigned int map_records_cnt; 457630a4d38SJakub Kicinski struct nfp_bpf_neutral_map **map_records; 458630a4d38SJakub Kicinski 459d9ae7f2bSJakub Kicinski struct list_head insns; 460d9ae7f2bSJakub Kicinski }; 461d9ae7f2bSJakub Kicinski 462d3f89b98SJakub Kicinski /** 463d3f89b98SJakub Kicinski * struct nfp_bpf_vnic - per-vNIC BPF priv structure 464d3f89b98SJakub Kicinski * @tc_prog: currently loaded cls_bpf program 4652314fe9eSJakub Kicinski * @start_off: address of the first instruction in the memory 4662314fe9eSJakub Kicinski * @tgt_done: jump target to get the next packet 467d3f89b98SJakub Kicinski */ 468d3f89b98SJakub Kicinski struct nfp_bpf_vnic { 469d3f89b98SJakub Kicinski struct bpf_prog *tc_prog; 4702314fe9eSJakub Kicinski unsigned int start_off; 4712314fe9eSJakub Kicinski unsigned int tgt_done; 472d3f89b98SJakub Kicinski }; 473d3f89b98SJakub Kicinski 4741549921dSJakub Kicinski void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt); 475c6c580d7SJakub Kicinski int nfp_bpf_jit(struct nfp_prog *prog); 47674801e50SQuentin Monnet bool nfp_bpf_supported_opcode(u8 code); 477d9ae7f2bSJakub Kicinski 478cae1927cSJakub Kicinski extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops; 479d9ae7f2bSJakub Kicinski 480c6c580d7SJakub Kicinski struct netdev_bpf; 481c6c580d7SJakub Kicinski struct nfp_app; 482bb45e51cSJakub Kicinski struct nfp_net; 483bb45e51cSJakub Kicinski 484af93d15aSJakub Kicinski int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn, 485af93d15aSJakub Kicinski struct netdev_bpf *bpf); 4869ce7a956SJakub Kicinski int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog, 48752be9a7cSQuentin Monnet bool old_prog, struct netlink_ext_ack *extack); 488bb45e51cSJakub Kicinski 4895b674140SJiong Wang struct nfp_insn_meta * 4905b674140SJiong Wang nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta, 4915b674140SJiong Wang unsigned int insn_idx, unsigned int n_insns); 4922314fe9eSJakub Kicinski 4932314fe9eSJakub Kicinski void *nfp_bpf_relo_for_vnic(struct nfp_prog *nfp_prog, struct nfp_bpf_vnic *bv); 494d48ae231SJakub Kicinski 495ff3d43f7SJakub Kicinski long long int 496ff3d43f7SJakub Kicinski nfp_bpf_ctrl_alloc_map(struct nfp_app_bpf *bpf, struct bpf_map *map); 497ff3d43f7SJakub Kicinski void 498ff3d43f7SJakub Kicinski nfp_bpf_ctrl_free_map(struct nfp_app_bpf *bpf, struct nfp_bpf_map *nfp_map); 499ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getfirst_entry(struct bpf_offloaded_map *offmap, 500ff3d43f7SJakub Kicinski void *next_key); 501ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_update_entry(struct bpf_offloaded_map *offmap, 502ff3d43f7SJakub Kicinski void *key, void *value, u64 flags); 503ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_del_entry(struct bpf_offloaded_map *offmap, void *key); 504ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_lookup_entry(struct bpf_offloaded_map *offmap, 505ff3d43f7SJakub Kicinski void *key, void *value); 506ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getnext_entry(struct bpf_offloaded_map *offmap, 507ff3d43f7SJakub Kicinski void *key, void *next_key); 508ff3d43f7SJakub Kicinski 50920c54204SJakub Kicinski int nfp_bpf_event_output(struct nfp_app_bpf *bpf, const void *data, 51020c54204SJakub Kicinski unsigned int len); 5119816dd35SJakub Kicinski 512d48ae231SJakub Kicinski void nfp_bpf_ctrl_msg_rx(struct nfp_app *app, struct sk_buff *skb); 51309587627SJakub Kicinski void 51409587627SJakub Kicinski nfp_bpf_ctrl_msg_rx_raw(struct nfp_app *app, const void *data, 51509587627SJakub Kicinski unsigned int len); 516d9ae7f2bSJakub Kicinski #endif 517