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> 40d9ae7f2bSJakub Kicinski #include <linux/list.h> 41d9ae7f2bSJakub Kicinski #include <linux/types.h> 42d9ae7f2bSJakub Kicinski 43b3f868dfSJakub Kicinski #include "../nfp_asm.h" 44c66a9cf4SJakub Kicinski 45d9ae7f2bSJakub Kicinski /* For branch fixup logic use up-most byte of branch instruction as scratch 46d9ae7f2bSJakub Kicinski * area. Remember to clear this before sending instructions to HW! 47d9ae7f2bSJakub Kicinski */ 48d9ae7f2bSJakub Kicinski #define OP_BR_SPECIAL 0xff00000000000000ULL 49d9ae7f2bSJakub Kicinski 50d9ae7f2bSJakub Kicinski enum br_special { 51d9ae7f2bSJakub Kicinski OP_BR_NORMAL = 0, 52d9ae7f2bSJakub Kicinski OP_BR_GO_OUT, 53d9ae7f2bSJakub Kicinski OP_BR_GO_ABORT, 54d9ae7f2bSJakub Kicinski }; 55d9ae7f2bSJakub Kicinski 56d9ae7f2bSJakub Kicinski enum static_regs { 5718e53b6cSJakub Kicinski STATIC_REG_IMM = 21, /* Bank AB */ 58d3488480SJakub Kicinski STATIC_REG_STACK = 22, /* Bank A */ 5918e53b6cSJakub Kicinski STATIC_REG_PKT_LEN = 22, /* Bank B */ 6018e53b6cSJakub Kicinski }; 6118e53b6cSJakub Kicinski 6218e53b6cSJakub Kicinski enum pkt_vec { 6318e53b6cSJakub Kicinski PKT_VEC_PKT_LEN = 0, 6418e53b6cSJakub Kicinski PKT_VEC_PKT_PTR = 2, 65d9ae7f2bSJakub Kicinski }; 66d9ae7f2bSJakub Kicinski 6718e53b6cSJakub Kicinski #define pv_len(np) reg_lm(1, PKT_VEC_PKT_LEN) 6818e53b6cSJakub Kicinski #define pv_ctm_ptr(np) reg_lm(1, PKT_VEC_PKT_PTR) 6918e53b6cSJakub Kicinski 70d3488480SJakub Kicinski #define stack_reg(np) reg_a(STATIC_REG_STACK) 71d3488480SJakub Kicinski #define stack_imm(np) imm_b(np) 7218e53b6cSJakub Kicinski #define plen_reg(np) reg_b(STATIC_REG_PKT_LEN) 7318e53b6cSJakub Kicinski #define pptr_reg(np) pv_ctm_ptr(np) 7418e53b6cSJakub Kicinski #define imm_a(np) reg_a(STATIC_REG_IMM) 7518e53b6cSJakub Kicinski #define imm_b(np) reg_b(STATIC_REG_IMM) 7618e53b6cSJakub Kicinski #define imm_both(np) reg_both(STATIC_REG_IMM) 77d9ae7f2bSJakub Kicinski 78509144e2SJakub Kicinski #define NFP_BPF_ABI_FLAGS reg_imm(0) 79d9ae7f2bSJakub Kicinski #define NFP_BPF_ABI_FLAG_MARK 1 80d9ae7f2bSJakub Kicinski 8177a844eeSJakub Kicinski /** 8277a844eeSJakub Kicinski * struct nfp_app_bpf - bpf app priv structure 8377a844eeSJakub Kicinski * @app: backpointer to the app 840d49eaf4SJakub Kicinski * 850d49eaf4SJakub Kicinski * @adjust_head: adjust head capability 860d49eaf4SJakub Kicinski * @flags: extra flags for adjust head 870d49eaf4SJakub Kicinski * @off_min: minimal packet offset within buffer required 880d49eaf4SJakub Kicinski * @off_max: maximum packet offset within buffer required 898231f844SJakub Kicinski * @guaranteed_sub: amount of negative adjustment guaranteed possible 908231f844SJakub Kicinski * @guaranteed_add: amount of positive adjustment guaranteed possible 9177a844eeSJakub Kicinski */ 9277a844eeSJakub Kicinski struct nfp_app_bpf { 9377a844eeSJakub Kicinski struct nfp_app *app; 940d49eaf4SJakub Kicinski 950d49eaf4SJakub Kicinski struct nfp_bpf_cap_adjust_head { 960d49eaf4SJakub Kicinski u32 flags; 970d49eaf4SJakub Kicinski int off_min; 980d49eaf4SJakub Kicinski int off_max; 998231f844SJakub Kicinski int guaranteed_sub; 1008231f844SJakub Kicinski int guaranteed_add; 1010d49eaf4SJakub Kicinski } adjust_head; 10277a844eeSJakub Kicinski }; 10377a844eeSJakub Kicinski 104d9ae7f2bSJakub Kicinski struct nfp_prog; 105d9ae7f2bSJakub Kicinski struct nfp_insn_meta; 106d9ae7f2bSJakub Kicinski typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *); 107d9ae7f2bSJakub Kicinski 108d9ae7f2bSJakub Kicinski #define nfp_prog_first_meta(nfp_prog) \ 109d9ae7f2bSJakub Kicinski list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 110d9ae7f2bSJakub Kicinski #define nfp_prog_last_meta(nfp_prog) \ 111d9ae7f2bSJakub Kicinski list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 112d9ae7f2bSJakub Kicinski #define nfp_meta_next(meta) list_next_entry(meta, l) 113d9ae7f2bSJakub Kicinski #define nfp_meta_prev(meta) list_prev_entry(meta, l) 114d9ae7f2bSJakub Kicinski 115a09d5c52SJiong Wang #define FLAG_INSN_IS_JUMP_DST BIT(0) 116a09d5c52SJiong Wang 117d9ae7f2bSJakub Kicinski /** 118d9ae7f2bSJakub Kicinski * struct nfp_insn_meta - BPF instruction wrapper 119d9ae7f2bSJakub Kicinski * @insn: BPF instruction 1202ca71441SJakub Kicinski * @ptr: pointer type for memory operations 1219879a381SJiong Wang * @ldst_gather_len: memcpy length gathered from load/store sequence 1229879a381SJiong Wang * @paired_st: the paired store insn at the head of the sequence 1238231f844SJakub Kicinski * @arg2: arg2 for call instructions 124b14157eeSJakub Kicinski * @ptr_not_const: pointer is not always constant 1255b674140SJiong Wang * @jmp_dst: destination info for jump instructions 126d9ae7f2bSJakub Kicinski * @off: index of first generated machine instruction (in nfp_prog.prog) 127d9ae7f2bSJakub Kicinski * @n: eBPF instruction number 128a09d5c52SJiong Wang * @flags: eBPF instruction extra optimization flags 129d9ae7f2bSJakub Kicinski * @skip: skip this instruction (optimized out) 130d9ae7f2bSJakub Kicinski * @double_cb: callback for second part of the instruction 131d9ae7f2bSJakub Kicinski * @l: link on nfp_prog->insns list 132d9ae7f2bSJakub Kicinski */ 133d9ae7f2bSJakub Kicinski struct nfp_insn_meta { 134d9ae7f2bSJakub Kicinski struct bpf_insn insn; 1355b674140SJiong Wang union { 1365b674140SJiong Wang struct { 1372ca71441SJakub Kicinski struct bpf_reg_state ptr; 1389879a381SJiong Wang struct bpf_insn *paired_st; 1399879a381SJiong Wang s16 ldst_gather_len; 140b14157eeSJakub Kicinski bool ptr_not_const; 1415b674140SJiong Wang }; 1425b674140SJiong Wang struct nfp_insn_meta *jmp_dst; 1438231f844SJakub Kicinski struct bpf_reg_state arg2; 1445b674140SJiong Wang }; 145d9ae7f2bSJakub Kicinski unsigned int off; 146d9ae7f2bSJakub Kicinski unsigned short n; 147a09d5c52SJiong Wang unsigned short flags; 148d9ae7f2bSJakub Kicinski bool skip; 149d9ae7f2bSJakub Kicinski instr_cb_t double_cb; 150d9ae7f2bSJakub Kicinski 151d9ae7f2bSJakub Kicinski struct list_head l; 152d9ae7f2bSJakub Kicinski }; 153d9ae7f2bSJakub Kicinski 154d9ae7f2bSJakub Kicinski #define BPF_SIZE_MASK 0x18 155d9ae7f2bSJakub Kicinski 156d9ae7f2bSJakub Kicinski static inline u8 mbpf_class(const struct nfp_insn_meta *meta) 157d9ae7f2bSJakub Kicinski { 158d9ae7f2bSJakub Kicinski return BPF_CLASS(meta->insn.code); 159d9ae7f2bSJakub Kicinski } 160d9ae7f2bSJakub Kicinski 161d9ae7f2bSJakub Kicinski static inline u8 mbpf_src(const struct nfp_insn_meta *meta) 162d9ae7f2bSJakub Kicinski { 163d9ae7f2bSJakub Kicinski return BPF_SRC(meta->insn.code); 164d9ae7f2bSJakub Kicinski } 165d9ae7f2bSJakub Kicinski 166d9ae7f2bSJakub Kicinski static inline u8 mbpf_op(const struct nfp_insn_meta *meta) 167d9ae7f2bSJakub Kicinski { 168d9ae7f2bSJakub Kicinski return BPF_OP(meta->insn.code); 169d9ae7f2bSJakub Kicinski } 170d9ae7f2bSJakub Kicinski 171d9ae7f2bSJakub Kicinski static inline u8 mbpf_mode(const struct nfp_insn_meta *meta) 172d9ae7f2bSJakub Kicinski { 173d9ae7f2bSJakub Kicinski return BPF_MODE(meta->insn.code); 174d9ae7f2bSJakub Kicinski } 175d9ae7f2bSJakub Kicinski 1765e4d6d20SJiong Wang static inline bool is_mbpf_load(const struct nfp_insn_meta *meta) 1775e4d6d20SJiong Wang { 1785e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM); 1795e4d6d20SJiong Wang } 1805e4d6d20SJiong Wang 1815e4d6d20SJiong Wang static inline bool is_mbpf_store(const struct nfp_insn_meta *meta) 1825e4d6d20SJiong Wang { 1835e4d6d20SJiong Wang return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM); 1845e4d6d20SJiong Wang } 1855e4d6d20SJiong Wang 186d9ae7f2bSJakub Kicinski /** 187d9ae7f2bSJakub Kicinski * struct nfp_prog - nfp BPF program 18877a844eeSJakub Kicinski * @bpf: backpointer to the bpf app priv structure 189d9ae7f2bSJakub Kicinski * @prog: machine code 190d9ae7f2bSJakub Kicinski * @prog_len: number of valid instructions in @prog array 191d9ae7f2bSJakub Kicinski * @__prog_alloc_len: alloc size of @prog array 192c6c580d7SJakub Kicinski * @verifier_meta: temporary storage for verifier's insn meta 193012bb8a8SJakub Kicinski * @type: BPF program type 194d9ae7f2bSJakub Kicinski * @start_off: address of the first instruction in the memory 195854dc87dSJiong Wang * @last_bpf_off: address of the last instruction translated from BPF 196d9ae7f2bSJakub Kicinski * @tgt_out: jump target for normal exit 197d9ae7f2bSJakub Kicinski * @tgt_abort: jump target for abort (e.g. access outside of packet buffer) 198d9ae7f2bSJakub Kicinski * @tgt_done: jump target to get the next packet 199d9ae7f2bSJakub Kicinski * @n_translated: number of successfully translated instructions (for errors) 200d9ae7f2bSJakub Kicinski * @error: error code if something went wrong 201ee9133a8SJakub Kicinski * @stack_depth: max stack depth from the verifier 2028231f844SJakub Kicinski * @adjust_head_location: if program has single adjust head call - the insn no. 203d9ae7f2bSJakub Kicinski * @insns: list of BPF instruction wrappers (struct nfp_insn_meta) 204d9ae7f2bSJakub Kicinski */ 205d9ae7f2bSJakub Kicinski struct nfp_prog { 20677a844eeSJakub Kicinski struct nfp_app_bpf *bpf; 20777a844eeSJakub Kicinski 208d9ae7f2bSJakub Kicinski u64 *prog; 209d9ae7f2bSJakub Kicinski unsigned int prog_len; 210d9ae7f2bSJakub Kicinski unsigned int __prog_alloc_len; 211d9ae7f2bSJakub Kicinski 212c6c580d7SJakub Kicinski struct nfp_insn_meta *verifier_meta; 213c6c580d7SJakub Kicinski 214012bb8a8SJakub Kicinski enum bpf_prog_type type; 215d9ae7f2bSJakub Kicinski 216d9ae7f2bSJakub Kicinski unsigned int start_off; 217854dc87dSJiong Wang unsigned int last_bpf_off; 218d9ae7f2bSJakub Kicinski unsigned int tgt_out; 219d9ae7f2bSJakub Kicinski unsigned int tgt_abort; 220d9ae7f2bSJakub Kicinski unsigned int tgt_done; 221d9ae7f2bSJakub Kicinski 222d9ae7f2bSJakub Kicinski unsigned int n_translated; 223d9ae7f2bSJakub Kicinski int error; 224d9ae7f2bSJakub Kicinski 225ee9133a8SJakub Kicinski unsigned int stack_depth; 2268231f844SJakub Kicinski unsigned int adjust_head_location; 227ee9133a8SJakub Kicinski 228d9ae7f2bSJakub Kicinski struct list_head insns; 229d9ae7f2bSJakub Kicinski }; 230d9ae7f2bSJakub Kicinski 231d3f89b98SJakub Kicinski /** 232d3f89b98SJakub Kicinski * struct nfp_bpf_vnic - per-vNIC BPF priv structure 233d3f89b98SJakub Kicinski * @tc_prog: currently loaded cls_bpf program 234d3f89b98SJakub Kicinski */ 235d3f89b98SJakub Kicinski struct nfp_bpf_vnic { 236d3f89b98SJakub Kicinski struct bpf_prog *tc_prog; 237d3f89b98SJakub Kicinski }; 238d3f89b98SJakub Kicinski 2391549921dSJakub Kicinski void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt); 240c6c580d7SJakub Kicinski int nfp_bpf_jit(struct nfp_prog *prog); 241d9ae7f2bSJakub Kicinski 242cae1927cSJakub Kicinski extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops; 243d9ae7f2bSJakub Kicinski 244c6c580d7SJakub Kicinski struct netdev_bpf; 245c6c580d7SJakub Kicinski struct nfp_app; 246bb45e51cSJakub Kicinski struct nfp_net; 247bb45e51cSJakub Kicinski 2489ce7a956SJakub Kicinski int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog, 249e4a91cd5SJakub Kicinski bool old_prog); 250bb45e51cSJakub Kicinski 251c6c580d7SJakub Kicinski int nfp_bpf_verifier_prep(struct nfp_app *app, struct nfp_net *nn, 252c6c580d7SJakub Kicinski struct netdev_bpf *bpf); 253c6c580d7SJakub Kicinski int nfp_bpf_translate(struct nfp_app *app, struct nfp_net *nn, 254c6c580d7SJakub Kicinski struct bpf_prog *prog); 255c6c580d7SJakub Kicinski int nfp_bpf_destroy(struct nfp_app *app, struct nfp_net *nn, 256c6c580d7SJakub Kicinski struct bpf_prog *prog); 2575b674140SJiong Wang struct nfp_insn_meta * 2585b674140SJiong Wang nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta, 2595b674140SJiong Wang unsigned int insn_idx, unsigned int n_insns); 260d9ae7f2bSJakub Kicinski #endif 261