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 * 13028264eb2SJakub Kicinski * @abi_version: global BPF ABI version 13128264eb2SJakub Kicinski * 1320d49eaf4SJakub Kicinski * @adjust_head: adjust head capability 133703f578aSJakub Kicinski * @adjust_head.flags: extra flags for adjust head 134703f578aSJakub Kicinski * @adjust_head.off_min: minimal packet offset within buffer required 135703f578aSJakub Kicinski * @adjust_head.off_max: maximum packet offset within buffer required 136703f578aSJakub Kicinski * @adjust_head.guaranteed_sub: negative adjustment guaranteed possible 137703f578aSJakub Kicinski * @adjust_head.guaranteed_add: positive adjustment guaranteed possible 1389d080d5dSJakub Kicinski * 1399d080d5dSJakub Kicinski * @maps: map capability 140703f578aSJakub Kicinski * @maps.types: supported map types 141703f578aSJakub Kicinski * @maps.max_maps: max number of maps supported 142703f578aSJakub Kicinski * @maps.max_elems: max number of entries in each map 143703f578aSJakub Kicinski * @maps.max_key_sz: max size of map key 144703f578aSJakub Kicinski * @maps.max_val_sz: max size of map value 145703f578aSJakub Kicinski * @maps.max_elem_sz: max size of map entry (key + value) 1469d080d5dSJakub Kicinski * 1479d080d5dSJakub Kicinski * @helpers: helper addressess for various calls 148703f578aSJakub Kicinski * @helpers.map_lookup: map lookup helper address 14944d65a47SJakub Kicinski * @helpers.map_update: map update helper address 150bfee64deSJakub Kicinski * @helpers.map_delete: map delete helper address 1519816dd35SJakub Kicinski * @helpers.perf_event_output: output perf event to a ring buffer 152df4a37d8SJakub Kicinski * 153df4a37d8SJakub Kicinski * @pseudo_random: FW initialized the pseudo-random machinery (CSRs) 154d985888fSJakub Kicinski * @queue_select: BPF can set the RX queue ID in packet vector 1550c261593SJakub Kicinski * @adjust_tail: BPF can simply trunc packet size for adjust tail 15677a844eeSJakub Kicinski */ 15777a844eeSJakub Kicinski struct nfp_app_bpf { 15877a844eeSJakub Kicinski struct nfp_app *app; 1590d49eaf4SJakub Kicinski 160602144c2SJakub Kicinski struct bpf_offload_dev *bpf_dev; 161602144c2SJakub Kicinski 162d48ae231SJakub Kicinski DECLARE_BITMAP(tag_allocator, U16_MAX + 1); 163d48ae231SJakub Kicinski u16 tag_alloc_next; 164d48ae231SJakub Kicinski u16 tag_alloc_last; 165d48ae231SJakub Kicinski 166d48ae231SJakub Kicinski struct sk_buff_head cmsg_replies; 167d48ae231SJakub Kicinski struct wait_queue_head cmsg_wq; 168d48ae231SJakub Kicinski 1694da98eeaSJakub Kicinski struct list_head map_list; 1701bba4c41SJakub Kicinski unsigned int maps_in_use; 1711bba4c41SJakub Kicinski unsigned int map_elems_in_use; 1724da98eeaSJakub Kicinski 173630a4d38SJakub Kicinski struct rhashtable maps_neutral; 174630a4d38SJakub Kicinski 17528264eb2SJakub Kicinski u32 abi_version; 17628264eb2SJakub Kicinski 1770d49eaf4SJakub Kicinski struct nfp_bpf_cap_adjust_head { 1780d49eaf4SJakub Kicinski u32 flags; 1790d49eaf4SJakub Kicinski int off_min; 1800d49eaf4SJakub Kicinski int off_max; 1818231f844SJakub Kicinski int guaranteed_sub; 1828231f844SJakub Kicinski int guaranteed_add; 1830d49eaf4SJakub Kicinski } adjust_head; 1849d080d5dSJakub Kicinski 1859d080d5dSJakub Kicinski struct { 1869d080d5dSJakub Kicinski u32 types; 1879d080d5dSJakub Kicinski u32 max_maps; 1889d080d5dSJakub Kicinski u32 max_elems; 1899d080d5dSJakub Kicinski u32 max_key_sz; 1909d080d5dSJakub Kicinski u32 max_val_sz; 1919d080d5dSJakub Kicinski u32 max_elem_sz; 1929d080d5dSJakub Kicinski } maps; 1939d080d5dSJakub Kicinski 1949d080d5dSJakub Kicinski struct { 1959d080d5dSJakub Kicinski u32 map_lookup; 19644d65a47SJakub Kicinski u32 map_update; 197bfee64deSJakub Kicinski u32 map_delete; 1989816dd35SJakub Kicinski u32 perf_event_output; 1999d080d5dSJakub Kicinski } helpers; 200df4a37d8SJakub Kicinski 201df4a37d8SJakub Kicinski bool pseudo_random; 202d985888fSJakub Kicinski bool queue_select; 2030c261593SJakub Kicinski bool adjust_tail; 20477a844eeSJakub Kicinski }; 20577a844eeSJakub Kicinski 206dcb0c27fSJakub Kicinski enum nfp_bpf_map_use { 207dcb0c27fSJakub Kicinski NFP_MAP_UNUSED = 0, 208dcb0c27fSJakub Kicinski NFP_MAP_USE_READ, 209dcb0c27fSJakub Kicinski NFP_MAP_USE_WRITE, 210dcb0c27fSJakub Kicinski NFP_MAP_USE_ATOMIC_CNT, 211dcb0c27fSJakub Kicinski }; 212dcb0c27fSJakub Kicinski 2134da98eeaSJakub Kicinski /** 2144da98eeaSJakub Kicinski * struct nfp_bpf_map - private per-map data attached to BPF maps for offload 2154da98eeaSJakub Kicinski * @offmap: pointer to the offloaded BPF map 2164da98eeaSJakub Kicinski * @bpf: back pointer to bpf app private structure 2174da98eeaSJakub Kicinski * @tid: table id identifying map on datapath 2184da98eeaSJakub Kicinski * @l: link on the nfp_app_bpf->map_list list 219dcb0c27fSJakub Kicinski * @use_map: map of how the value is used (in 4B chunks) 2204da98eeaSJakub Kicinski */ 2214da98eeaSJakub Kicinski struct nfp_bpf_map { 2224da98eeaSJakub Kicinski struct bpf_offloaded_map *offmap; 2234da98eeaSJakub Kicinski struct nfp_app_bpf *bpf; 2244da98eeaSJakub Kicinski u32 tid; 2254da98eeaSJakub Kicinski struct list_head l; 226dcb0c27fSJakub Kicinski enum nfp_bpf_map_use use_map[]; 2274da98eeaSJakub Kicinski }; 2284da98eeaSJakub Kicinski 229630a4d38SJakub Kicinski struct nfp_bpf_neutral_map { 230630a4d38SJakub Kicinski struct rhash_head l; 231630a4d38SJakub Kicinski struct bpf_map *ptr; 232ab01f4acSJakub Kicinski u32 map_id; 233630a4d38SJakub Kicinski u32 count; 234630a4d38SJakub Kicinski }; 235630a4d38SJakub Kicinski 236630a4d38SJakub Kicinski extern const struct rhashtable_params nfp_bpf_maps_neutral_params; 237630a4d38SJakub Kicinski 238d9ae7f2bSJakub Kicinski struct nfp_prog; 239d9ae7f2bSJakub Kicinski struct nfp_insn_meta; 240d9ae7f2bSJakub Kicinski typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *); 241d9ae7f2bSJakub Kicinski 242d9ae7f2bSJakub Kicinski #define nfp_prog_first_meta(nfp_prog) \ 243d9ae7f2bSJakub Kicinski list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 244d9ae7f2bSJakub Kicinski #define nfp_prog_last_meta(nfp_prog) \ 245d9ae7f2bSJakub Kicinski list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 246d9ae7f2bSJakub Kicinski #define nfp_meta_next(meta) list_next_entry(meta, l) 247d9ae7f2bSJakub Kicinski #define nfp_meta_prev(meta) list_prev_entry(meta, l) 248d9ae7f2bSJakub Kicinski 2492f46e0c1SJakub Kicinski /** 2502f46e0c1SJakub Kicinski * struct nfp_bpf_reg_state - register state for calls 2512f46e0c1SJakub Kicinski * @reg: BPF register state from latest path 2522f46e0c1SJakub Kicinski * @var_off: for stack arg - changes stack offset on different paths 2532f46e0c1SJakub Kicinski */ 2542f46e0c1SJakub Kicinski struct nfp_bpf_reg_state { 2552f46e0c1SJakub Kicinski struct bpf_reg_state reg; 2562f46e0c1SJakub Kicinski bool var_off; 2572f46e0c1SJakub Kicinski }; 2582f46e0c1SJakub Kicinski 259a09d5c52SJiong Wang #define FLAG_INSN_IS_JUMP_DST BIT(0) 260a09d5c52SJiong Wang 261d9ae7f2bSJakub Kicinski /** 262d9ae7f2bSJakub Kicinski * struct nfp_insn_meta - BPF instruction wrapper 263d9ae7f2bSJakub Kicinski * @insn: BPF instruction 2642ca71441SJakub Kicinski * @ptr: pointer type for memory operations 2659879a381SJiong Wang * @ldst_gather_len: memcpy length gathered from load/store sequence 2669879a381SJiong Wang * @paired_st: the paired store insn at the head of the sequence 267b14157eeSJakub Kicinski * @ptr_not_const: pointer is not always constant 268be759237SJiong Wang * @pkt_cache: packet data cache information 269be759237SJiong Wang * @pkt_cache.range_start: start offset for associated packet data cache 270be759237SJiong Wang * @pkt_cache.range_end: end offset for associated packet data cache 271be759237SJiong Wang * @pkt_cache.do_init: this read needs to initialize packet data cache 27241aed09cSJakub Kicinski * @xadd_over_16bit: 16bit immediate is not guaranteed 27341aed09cSJakub Kicinski * @xadd_maybe_16bit: 16bit immediate is possible 2745b674140SJiong Wang * @jmp_dst: destination info for jump instructions 2757bdc97beSJakub Kicinski * @jump_neg_op: jump instruction has inverted immediate, use ADD instead of SUB 27677a3d311SJakub Kicinski * @func_id: function id for call instructions 27777a3d311SJakub Kicinski * @arg1: arg1 for call instructions 27877a3d311SJakub Kicinski * @arg2: arg2 for call instructions 279662c5472SJiong Wang * @umin_src: copy of core verifier umin_value for src opearnd. 280662c5472SJiong Wang * @umax_src: copy of core verifier umax_value for src operand. 28133b94310SJiong Wang * @umin_dst: copy of core verifier umin_value for dst opearnd. 28233b94310SJiong Wang * @umax_dst: copy of core verifier umax_value for dst operand. 283d9ae7f2bSJakub Kicinski * @off: index of first generated machine instruction (in nfp_prog.prog) 284d9ae7f2bSJakub Kicinski * @n: eBPF instruction number 285a09d5c52SJiong Wang * @flags: eBPF instruction extra optimization flags 286d9ae7f2bSJakub Kicinski * @skip: skip this instruction (optimized out) 287d9ae7f2bSJakub Kicinski * @double_cb: callback for second part of the instruction 288d9ae7f2bSJakub Kicinski * @l: link on nfp_prog->insns list 289d9ae7f2bSJakub Kicinski */ 290d9ae7f2bSJakub Kicinski struct nfp_insn_meta { 291d9ae7f2bSJakub Kicinski struct bpf_insn insn; 2925b674140SJiong Wang union { 29341aed09cSJakub Kicinski /* pointer ops (ld/st/xadd) */ 2945b674140SJiong Wang struct { 2952ca71441SJakub Kicinski struct bpf_reg_state ptr; 2969879a381SJiong Wang struct bpf_insn *paired_st; 2979879a381SJiong Wang s16 ldst_gather_len; 298b14157eeSJakub Kicinski bool ptr_not_const; 299be759237SJiong Wang struct { 300be759237SJiong Wang s16 range_start; 301be759237SJiong Wang s16 range_end; 302be759237SJiong Wang bool do_init; 303be759237SJiong Wang } pkt_cache; 30441aed09cSJakub Kicinski bool xadd_over_16bit; 30541aed09cSJakub Kicinski bool xadd_maybe_16bit; 3065b674140SJiong Wang }; 30741aed09cSJakub Kicinski /* jump */ 3087bdc97beSJakub Kicinski struct { 3095b674140SJiong Wang struct nfp_insn_meta *jmp_dst; 3107bdc97beSJakub Kicinski bool jump_neg_op; 3117bdc97beSJakub Kicinski }; 31241aed09cSJakub Kicinski /* function calls */ 31377a3d311SJakub Kicinski struct { 31477a3d311SJakub Kicinski u32 func_id; 31577a3d311SJakub Kicinski struct bpf_reg_state arg1; 3162f46e0c1SJakub Kicinski struct nfp_bpf_reg_state arg2; 31777a3d311SJakub Kicinski }; 31833b94310SJiong Wang /* We are interested in range info for operands of ALU 31933b94310SJiong Wang * operations. For example, shift amount, multiplicand and 32033b94310SJiong Wang * multiplier etc. 321991f5b36SJiong Wang */ 322991f5b36SJiong Wang struct { 323662c5472SJiong Wang u64 umin_src; 324662c5472SJiong Wang u64 umax_src; 32533b94310SJiong Wang u64 umin_dst; 32633b94310SJiong Wang u64 umax_dst; 327991f5b36SJiong Wang }; 3285b674140SJiong Wang }; 329d9ae7f2bSJakub Kicinski unsigned int off; 330d9ae7f2bSJakub Kicinski unsigned short n; 331a09d5c52SJiong Wang unsigned short flags; 332d9ae7f2bSJakub Kicinski bool skip; 333d9ae7f2bSJakub Kicinski instr_cb_t double_cb; 334d9ae7f2bSJakub Kicinski 335d9ae7f2bSJakub Kicinski struct list_head l; 336d9ae7f2bSJakub Kicinski }; 337d9ae7f2bSJakub Kicinski 338d9ae7f2bSJakub Kicinski #define BPF_SIZE_MASK 0x18 339d9ae7f2bSJakub Kicinski 340d9ae7f2bSJakub Kicinski static inline u8 mbpf_class(const struct nfp_insn_meta *meta) 341d9ae7f2bSJakub Kicinski { 342d9ae7f2bSJakub Kicinski return BPF_CLASS(meta->insn.code); 343d9ae7f2bSJakub Kicinski } 344d9ae7f2bSJakub Kicinski 345d9ae7f2bSJakub Kicinski static inline u8 mbpf_src(const struct nfp_insn_meta *meta) 346d9ae7f2bSJakub Kicinski { 347d9ae7f2bSJakub Kicinski return BPF_SRC(meta->insn.code); 348d9ae7f2bSJakub Kicinski } 349d9ae7f2bSJakub Kicinski 350d9ae7f2bSJakub Kicinski static inline u8 mbpf_op(const struct nfp_insn_meta *meta) 351d9ae7f2bSJakub Kicinski { 352d9ae7f2bSJakub Kicinski return BPF_OP(meta->insn.code); 353d9ae7f2bSJakub Kicinski } 354d9ae7f2bSJakub Kicinski 355d9ae7f2bSJakub Kicinski static inline u8 mbpf_mode(const struct nfp_insn_meta *meta) 356d9ae7f2bSJakub Kicinski { 357d9ae7f2bSJakub Kicinski return BPF_MODE(meta->insn.code); 358d9ae7f2bSJakub Kicinski } 359d9ae7f2bSJakub Kicinski 36033b94310SJiong Wang static inline bool is_mbpf_alu(const struct nfp_insn_meta *meta) 36133b94310SJiong Wang { 36233b94310SJiong Wang return mbpf_class(meta) == BPF_ALU64 || mbpf_class(meta) == BPF_ALU; 36333b94310SJiong Wang } 36433b94310SJiong Wang 3655e4d6d20SJiong Wang static inline bool is_mbpf_load(const struct nfp_insn_meta *meta) 3665e4d6d20SJiong Wang { 3675e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM); 3685e4d6d20SJiong Wang } 3695e4d6d20SJiong Wang 3705e4d6d20SJiong Wang static inline bool is_mbpf_store(const struct nfp_insn_meta *meta) 3715e4d6d20SJiong Wang { 3725e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM); 3735e4d6d20SJiong Wang } 3745e4d6d20SJiong Wang 37587b10ecdSJiong Wang static inline bool is_mbpf_load_pkt(const struct nfp_insn_meta *meta) 37687b10ecdSJiong Wang { 37787b10ecdSJiong Wang return is_mbpf_load(meta) && meta->ptr.type == PTR_TO_PACKET; 37887b10ecdSJiong Wang } 37987b10ecdSJiong Wang 38087b10ecdSJiong Wang static inline bool is_mbpf_store_pkt(const struct nfp_insn_meta *meta) 38187b10ecdSJiong Wang { 38287b10ecdSJiong Wang return is_mbpf_store(meta) && meta->ptr.type == PTR_TO_PACKET; 38387b10ecdSJiong Wang } 38487b10ecdSJiong Wang 38587b10ecdSJiong Wang static inline bool is_mbpf_classic_load(const struct nfp_insn_meta *meta) 38687b10ecdSJiong Wang { 38787b10ecdSJiong Wang u8 code = meta->insn.code; 38887b10ecdSJiong Wang 38987b10ecdSJiong Wang return BPF_CLASS(code) == BPF_LD && 39087b10ecdSJiong Wang (BPF_MODE(code) == BPF_ABS || BPF_MODE(code) == BPF_IND); 39187b10ecdSJiong Wang } 39287b10ecdSJiong Wang 39387b10ecdSJiong Wang static inline bool is_mbpf_classic_store(const struct nfp_insn_meta *meta) 39487b10ecdSJiong Wang { 39587b10ecdSJiong Wang u8 code = meta->insn.code; 39687b10ecdSJiong Wang 39787b10ecdSJiong Wang return BPF_CLASS(code) == BPF_ST && BPF_MODE(code) == BPF_MEM; 39887b10ecdSJiong Wang } 39987b10ecdSJiong Wang 40087b10ecdSJiong Wang static inline bool is_mbpf_classic_store_pkt(const struct nfp_insn_meta *meta) 40187b10ecdSJiong Wang { 40287b10ecdSJiong Wang return is_mbpf_classic_store(meta) && meta->ptr.type == PTR_TO_PACKET; 40387b10ecdSJiong Wang } 40487b10ecdSJiong Wang 405dcb0c27fSJakub Kicinski static inline bool is_mbpf_xadd(const struct nfp_insn_meta *meta) 406dcb0c27fSJakub Kicinski { 407dcb0c27fSJakub Kicinski return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_XADD); 408dcb0c27fSJakub Kicinski } 409dcb0c27fSJakub Kicinski 410d3d23fdbSJiong Wang static inline bool is_mbpf_mul(const struct nfp_insn_meta *meta) 411d3d23fdbSJiong Wang { 412d3d23fdbSJiong Wang return is_mbpf_alu(meta) && mbpf_op(meta) == BPF_MUL; 413d3d23fdbSJiong Wang } 414d3d23fdbSJiong Wang 4152a952b03SJiong Wang static inline bool is_mbpf_div(const struct nfp_insn_meta *meta) 4162a952b03SJiong Wang { 4172a952b03SJiong Wang return is_mbpf_alu(meta) && mbpf_op(meta) == BPF_DIV; 4182a952b03SJiong Wang } 4192a952b03SJiong Wang 420d9ae7f2bSJakub Kicinski /** 421d9ae7f2bSJakub Kicinski * struct nfp_prog - nfp BPF program 42277a844eeSJakub Kicinski * @bpf: backpointer to the bpf app priv structure 423d9ae7f2bSJakub Kicinski * @prog: machine code 424d9ae7f2bSJakub Kicinski * @prog_len: number of valid instructions in @prog array 425d9ae7f2bSJakub Kicinski * @__prog_alloc_len: alloc size of @prog array 426c6c580d7SJakub Kicinski * @verifier_meta: temporary storage for verifier's insn meta 427012bb8a8SJakub Kicinski * @type: BPF program type 428854dc87dSJiong Wang * @last_bpf_off: address of the last instruction translated from BPF 429d9ae7f2bSJakub Kicinski * @tgt_out: jump target for normal exit 430d9ae7f2bSJakub Kicinski * @tgt_abort: jump target for abort (e.g. access outside of packet buffer) 431d9ae7f2bSJakub Kicinski * @n_translated: number of successfully translated instructions (for errors) 432d9ae7f2bSJakub Kicinski * @error: error code if something went wrong 433ee9133a8SJakub Kicinski * @stack_depth: max stack depth from the verifier 4348231f844SJakub Kicinski * @adjust_head_location: if program has single adjust head call - the insn no. 435630a4d38SJakub Kicinski * @map_records_cnt: the number of map pointers recorded for this prog 436630a4d38SJakub Kicinski * @map_records: the map record pointers from bpf->maps_neutral 437d9ae7f2bSJakub Kicinski * @insns: list of BPF instruction wrappers (struct nfp_insn_meta) 438d9ae7f2bSJakub Kicinski */ 439d9ae7f2bSJakub Kicinski struct nfp_prog { 44077a844eeSJakub Kicinski struct nfp_app_bpf *bpf; 44177a844eeSJakub Kicinski 442d9ae7f2bSJakub Kicinski u64 *prog; 443d9ae7f2bSJakub Kicinski unsigned int prog_len; 444d9ae7f2bSJakub Kicinski unsigned int __prog_alloc_len; 445d9ae7f2bSJakub Kicinski 446c6c580d7SJakub Kicinski struct nfp_insn_meta *verifier_meta; 447c6c580d7SJakub Kicinski 448012bb8a8SJakub Kicinski enum bpf_prog_type type; 449d9ae7f2bSJakub Kicinski 450854dc87dSJiong Wang unsigned int last_bpf_off; 451d9ae7f2bSJakub Kicinski unsigned int tgt_out; 452d9ae7f2bSJakub Kicinski unsigned int tgt_abort; 453d9ae7f2bSJakub Kicinski 454d9ae7f2bSJakub Kicinski unsigned int n_translated; 455d9ae7f2bSJakub Kicinski int error; 456d9ae7f2bSJakub Kicinski 457ee9133a8SJakub Kicinski unsigned int stack_depth; 4588231f844SJakub Kicinski unsigned int adjust_head_location; 459ee9133a8SJakub Kicinski 460630a4d38SJakub Kicinski unsigned int map_records_cnt; 461630a4d38SJakub Kicinski struct nfp_bpf_neutral_map **map_records; 462630a4d38SJakub Kicinski 463d9ae7f2bSJakub Kicinski struct list_head insns; 464d9ae7f2bSJakub Kicinski }; 465d9ae7f2bSJakub Kicinski 466d3f89b98SJakub Kicinski /** 467d3f89b98SJakub Kicinski * struct nfp_bpf_vnic - per-vNIC BPF priv structure 468d3f89b98SJakub Kicinski * @tc_prog: currently loaded cls_bpf program 4692314fe9eSJakub Kicinski * @start_off: address of the first instruction in the memory 4702314fe9eSJakub Kicinski * @tgt_done: jump target to get the next packet 471d3f89b98SJakub Kicinski */ 472d3f89b98SJakub Kicinski struct nfp_bpf_vnic { 473d3f89b98SJakub Kicinski struct bpf_prog *tc_prog; 4742314fe9eSJakub Kicinski unsigned int start_off; 4752314fe9eSJakub Kicinski unsigned int tgt_done; 476d3f89b98SJakub Kicinski }; 477d3f89b98SJakub Kicinski 4781549921dSJakub Kicinski void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt); 479c6c580d7SJakub Kicinski int nfp_bpf_jit(struct nfp_prog *prog); 48074801e50SQuentin Monnet bool nfp_bpf_supported_opcode(u8 code); 481d9ae7f2bSJakub Kicinski 482cae1927cSJakub Kicinski extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops; 483d9ae7f2bSJakub Kicinski 484c6c580d7SJakub Kicinski struct netdev_bpf; 485c6c580d7SJakub Kicinski struct nfp_app; 486bb45e51cSJakub Kicinski struct nfp_net; 487bb45e51cSJakub Kicinski 488af93d15aSJakub Kicinski int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn, 489af93d15aSJakub Kicinski struct netdev_bpf *bpf); 4909ce7a956SJakub Kicinski int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog, 49152be9a7cSQuentin Monnet bool old_prog, struct netlink_ext_ack *extack); 492bb45e51cSJakub Kicinski 4935b674140SJiong Wang struct nfp_insn_meta * 4945b674140SJiong Wang nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta, 4955b674140SJiong Wang unsigned int insn_idx, unsigned int n_insns); 4962314fe9eSJakub Kicinski 4972314fe9eSJakub Kicinski void *nfp_bpf_relo_for_vnic(struct nfp_prog *nfp_prog, struct nfp_bpf_vnic *bv); 498d48ae231SJakub Kicinski 499ff3d43f7SJakub Kicinski long long int 500ff3d43f7SJakub Kicinski nfp_bpf_ctrl_alloc_map(struct nfp_app_bpf *bpf, struct bpf_map *map); 501ff3d43f7SJakub Kicinski void 502ff3d43f7SJakub Kicinski nfp_bpf_ctrl_free_map(struct nfp_app_bpf *bpf, struct nfp_bpf_map *nfp_map); 503ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getfirst_entry(struct bpf_offloaded_map *offmap, 504ff3d43f7SJakub Kicinski void *next_key); 505ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_update_entry(struct bpf_offloaded_map *offmap, 506ff3d43f7SJakub Kicinski void *key, void *value, u64 flags); 507ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_del_entry(struct bpf_offloaded_map *offmap, void *key); 508ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_lookup_entry(struct bpf_offloaded_map *offmap, 509ff3d43f7SJakub Kicinski void *key, void *value); 510ff3d43f7SJakub Kicinski int nfp_bpf_ctrl_getnext_entry(struct bpf_offloaded_map *offmap, 511ff3d43f7SJakub Kicinski void *key, void *next_key); 512ff3d43f7SJakub Kicinski 51320c54204SJakub Kicinski int nfp_bpf_event_output(struct nfp_app_bpf *bpf, const void *data, 51420c54204SJakub Kicinski unsigned int len); 5159816dd35SJakub Kicinski 516d48ae231SJakub Kicinski void nfp_bpf_ctrl_msg_rx(struct nfp_app *app, struct sk_buff *skb); 51709587627SJakub Kicinski void 51809587627SJakub Kicinski nfp_bpf_ctrl_msg_rx_raw(struct nfp_app *app, const void *data, 51909587627SJakub Kicinski unsigned int len); 520d9ae7f2bSJakub Kicinski #endif 521