1 /* 2 * Copyright (C) 2016-2018 Netronome Systems, Inc. 3 * 4 * This software is dual licensed under the GNU General License Version 2, 5 * June 1991 as shown in the file COPYING in the top-level directory of this 6 * source tree or the BSD 2-Clause License provided below. You have the 7 * option to license this software under the complete terms of either license. 8 * 9 * The BSD 2-Clause License: 10 * 11 * Redistribution and use in source and binary forms, with or 12 * without modification, are permitted provided that the following 13 * conditions are met: 14 * 15 * 1. Redistributions of source code must retain the above 16 * copyright notice, this list of conditions and the following 17 * disclaimer. 18 * 19 * 2. Redistributions in binary form must reproduce the above 20 * copyright notice, this list of conditions and the following 21 * disclaimer in the documentation and/or other materials 22 * provided with the distribution. 23 * 24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS 28 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 29 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN 30 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 31 * SOFTWARE. 32 */ 33 34 #ifndef __NFP_BPF_H__ 35 #define __NFP_BPF_H__ 1 36 37 #include <linux/bitfield.h> 38 #include <linux/bpf.h> 39 #include <linux/bpf_verifier.h> 40 #include <linux/kernel.h> 41 #include <linux/list.h> 42 #include <linux/rhashtable.h> 43 #include <linux/skbuff.h> 44 #include <linux/types.h> 45 #include <linux/wait.h> 46 47 #include "../nfp_asm.h" 48 #include "fw.h" 49 50 /* For relocation logic use up-most byte of branch instruction as scratch 51 * area. Remember to clear this before sending instructions to HW! 52 */ 53 #define OP_RELO_TYPE 0xff00000000000000ULL 54 55 enum nfp_relo_type { 56 RELO_NONE = 0, 57 /* standard internal jumps */ 58 RELO_BR_REL, 59 /* internal jumps to parts of the outro */ 60 RELO_BR_GO_OUT, 61 RELO_BR_GO_ABORT, 62 /* external jumps to fixed addresses */ 63 RELO_BR_NEXT_PKT, 64 RELO_BR_HELPER, 65 /* immediate relocation against load address */ 66 RELO_IMMED_REL, 67 }; 68 69 /* To make absolute relocated branches (branches other than RELO_BR_REL) 70 * distinguishable in user space dumps from normal jumps, add a large offset 71 * to them. 72 */ 73 #define BR_OFF_RELO 15000 74 75 enum static_regs { 76 STATIC_REG_IMMA = 20, /* Bank AB */ 77 STATIC_REG_IMM = 21, /* Bank AB */ 78 STATIC_REG_STACK = 22, /* Bank A */ 79 STATIC_REG_PKT_LEN = 22, /* Bank B */ 80 }; 81 82 enum pkt_vec { 83 PKT_VEC_PKT_LEN = 0, 84 PKT_VEC_PKT_PTR = 2, 85 }; 86 87 #define pv_len(np) reg_lm(1, PKT_VEC_PKT_LEN) 88 #define pv_ctm_ptr(np) reg_lm(1, PKT_VEC_PKT_PTR) 89 90 #define stack_reg(np) reg_a(STATIC_REG_STACK) 91 #define stack_imm(np) imm_b(np) 92 #define plen_reg(np) reg_b(STATIC_REG_PKT_LEN) 93 #define pptr_reg(np) pv_ctm_ptr(np) 94 #define imm_a(np) reg_a(STATIC_REG_IMM) 95 #define imm_b(np) reg_b(STATIC_REG_IMM) 96 #define imma_a(np) reg_a(STATIC_REG_IMMA) 97 #define imma_b(np) reg_b(STATIC_REG_IMMA) 98 #define imm_both(np) reg_both(STATIC_REG_IMM) 99 100 #define NFP_BPF_ABI_FLAGS reg_imm(0) 101 #define NFP_BPF_ABI_FLAG_MARK 1 102 103 /** 104 * struct nfp_app_bpf - bpf app priv structure 105 * @app: backpointer to the app 106 * 107 * @tag_allocator: bitmap of control message tags in use 108 * @tag_alloc_next: next tag bit to allocate 109 * @tag_alloc_last: next tag bit to be freed 110 * 111 * @cmsg_replies: received cmsg replies waiting to be consumed 112 * @cmsg_wq: work queue for waiting for cmsg replies 113 * 114 * @map_list: list of offloaded maps 115 * @maps_in_use: number of currently offloaded maps 116 * @map_elems_in_use: number of elements allocated to offloaded maps 117 * 118 * @maps_neutral: hash table of offload-neutral maps (on pointer) 119 * 120 * @adjust_head: adjust head capability 121 * @adjust_head.flags: extra flags for adjust head 122 * @adjust_head.off_min: minimal packet offset within buffer required 123 * @adjust_head.off_max: maximum packet offset within buffer required 124 * @adjust_head.guaranteed_sub: negative adjustment guaranteed possible 125 * @adjust_head.guaranteed_add: positive adjustment guaranteed possible 126 * 127 * @maps: map capability 128 * @maps.types: supported map types 129 * @maps.max_maps: max number of maps supported 130 * @maps.max_elems: max number of entries in each map 131 * @maps.max_key_sz: max size of map key 132 * @maps.max_val_sz: max size of map value 133 * @maps.max_elem_sz: max size of map entry (key + value) 134 * 135 * @helpers: helper addressess for various calls 136 * @helpers.map_lookup: map lookup helper address 137 * @helpers.map_update: map update helper address 138 * @helpers.map_delete: map delete helper address 139 * @helpers.perf_event_output: output perf event to a ring buffer 140 * 141 * @pseudo_random: FW initialized the pseudo-random machinery (CSRs) 142 */ 143 struct nfp_app_bpf { 144 struct nfp_app *app; 145 146 DECLARE_BITMAP(tag_allocator, U16_MAX + 1); 147 u16 tag_alloc_next; 148 u16 tag_alloc_last; 149 150 struct sk_buff_head cmsg_replies; 151 struct wait_queue_head cmsg_wq; 152 153 struct list_head map_list; 154 unsigned int maps_in_use; 155 unsigned int map_elems_in_use; 156 157 struct rhashtable maps_neutral; 158 159 struct nfp_bpf_cap_adjust_head { 160 u32 flags; 161 int off_min; 162 int off_max; 163 int guaranteed_sub; 164 int guaranteed_add; 165 } adjust_head; 166 167 struct { 168 u32 types; 169 u32 max_maps; 170 u32 max_elems; 171 u32 max_key_sz; 172 u32 max_val_sz; 173 u32 max_elem_sz; 174 } maps; 175 176 struct { 177 u32 map_lookup; 178 u32 map_update; 179 u32 map_delete; 180 u32 perf_event_output; 181 } helpers; 182 183 bool pseudo_random; 184 }; 185 186 enum nfp_bpf_map_use { 187 NFP_MAP_UNUSED = 0, 188 NFP_MAP_USE_READ, 189 NFP_MAP_USE_WRITE, 190 NFP_MAP_USE_ATOMIC_CNT, 191 }; 192 193 /** 194 * struct nfp_bpf_map - private per-map data attached to BPF maps for offload 195 * @offmap: pointer to the offloaded BPF map 196 * @bpf: back pointer to bpf app private structure 197 * @tid: table id identifying map on datapath 198 * @l: link on the nfp_app_bpf->map_list list 199 * @use_map: map of how the value is used (in 4B chunks) 200 */ 201 struct nfp_bpf_map { 202 struct bpf_offloaded_map *offmap; 203 struct nfp_app_bpf *bpf; 204 u32 tid; 205 struct list_head l; 206 enum nfp_bpf_map_use use_map[]; 207 }; 208 209 struct nfp_bpf_neutral_map { 210 struct rhash_head l; 211 struct bpf_map *ptr; 212 u32 count; 213 }; 214 215 extern const struct rhashtable_params nfp_bpf_maps_neutral_params; 216 217 struct nfp_prog; 218 struct nfp_insn_meta; 219 typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *); 220 221 #define nfp_prog_first_meta(nfp_prog) \ 222 list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 223 #define nfp_prog_last_meta(nfp_prog) \ 224 list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l) 225 #define nfp_meta_next(meta) list_next_entry(meta, l) 226 #define nfp_meta_prev(meta) list_prev_entry(meta, l) 227 228 /** 229 * struct nfp_bpf_reg_state - register state for calls 230 * @reg: BPF register state from latest path 231 * @var_off: for stack arg - changes stack offset on different paths 232 */ 233 struct nfp_bpf_reg_state { 234 struct bpf_reg_state reg; 235 bool var_off; 236 }; 237 238 #define FLAG_INSN_IS_JUMP_DST BIT(0) 239 240 /** 241 * struct nfp_insn_meta - BPF instruction wrapper 242 * @insn: BPF instruction 243 * @ptr: pointer type for memory operations 244 * @ldst_gather_len: memcpy length gathered from load/store sequence 245 * @paired_st: the paired store insn at the head of the sequence 246 * @ptr_not_const: pointer is not always constant 247 * @pkt_cache: packet data cache information 248 * @pkt_cache.range_start: start offset for associated packet data cache 249 * @pkt_cache.range_end: end offset for associated packet data cache 250 * @pkt_cache.do_init: this read needs to initialize packet data cache 251 * @xadd_over_16bit: 16bit immediate is not guaranteed 252 * @xadd_maybe_16bit: 16bit immediate is possible 253 * @jmp_dst: destination info for jump instructions 254 * @jump_neg_op: jump instruction has inverted immediate, use ADD instead of SUB 255 * @func_id: function id for call instructions 256 * @arg1: arg1 for call instructions 257 * @arg2: arg2 for call instructions 258 * @off: index of first generated machine instruction (in nfp_prog.prog) 259 * @n: eBPF instruction number 260 * @flags: eBPF instruction extra optimization flags 261 * @skip: skip this instruction (optimized out) 262 * @double_cb: callback for second part of the instruction 263 * @l: link on nfp_prog->insns list 264 */ 265 struct nfp_insn_meta { 266 struct bpf_insn insn; 267 union { 268 /* pointer ops (ld/st/xadd) */ 269 struct { 270 struct bpf_reg_state ptr; 271 struct bpf_insn *paired_st; 272 s16 ldst_gather_len; 273 bool ptr_not_const; 274 struct { 275 s16 range_start; 276 s16 range_end; 277 bool do_init; 278 } pkt_cache; 279 bool xadd_over_16bit; 280 bool xadd_maybe_16bit; 281 }; 282 /* jump */ 283 struct { 284 struct nfp_insn_meta *jmp_dst; 285 bool jump_neg_op; 286 }; 287 /* function calls */ 288 struct { 289 u32 func_id; 290 struct bpf_reg_state arg1; 291 struct nfp_bpf_reg_state arg2; 292 }; 293 }; 294 unsigned int off; 295 unsigned short n; 296 unsigned short flags; 297 bool skip; 298 instr_cb_t double_cb; 299 300 struct list_head l; 301 }; 302 303 #define BPF_SIZE_MASK 0x18 304 305 static inline u8 mbpf_class(const struct nfp_insn_meta *meta) 306 { 307 return BPF_CLASS(meta->insn.code); 308 } 309 310 static inline u8 mbpf_src(const struct nfp_insn_meta *meta) 311 { 312 return BPF_SRC(meta->insn.code); 313 } 314 315 static inline u8 mbpf_op(const struct nfp_insn_meta *meta) 316 { 317 return BPF_OP(meta->insn.code); 318 } 319 320 static inline u8 mbpf_mode(const struct nfp_insn_meta *meta) 321 { 322 return BPF_MODE(meta->insn.code); 323 } 324 325 static inline bool is_mbpf_load(const struct nfp_insn_meta *meta) 326 { 327 return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_LDX | BPF_MEM); 328 } 329 330 static inline bool is_mbpf_store(const struct nfp_insn_meta *meta) 331 { 332 return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_MEM); 333 } 334 335 static inline bool is_mbpf_load_pkt(const struct nfp_insn_meta *meta) 336 { 337 return is_mbpf_load(meta) && meta->ptr.type == PTR_TO_PACKET; 338 } 339 340 static inline bool is_mbpf_store_pkt(const struct nfp_insn_meta *meta) 341 { 342 return is_mbpf_store(meta) && meta->ptr.type == PTR_TO_PACKET; 343 } 344 345 static inline bool is_mbpf_classic_load(const struct nfp_insn_meta *meta) 346 { 347 u8 code = meta->insn.code; 348 349 return BPF_CLASS(code) == BPF_LD && 350 (BPF_MODE(code) == BPF_ABS || BPF_MODE(code) == BPF_IND); 351 } 352 353 static inline bool is_mbpf_classic_store(const struct nfp_insn_meta *meta) 354 { 355 u8 code = meta->insn.code; 356 357 return BPF_CLASS(code) == BPF_ST && BPF_MODE(code) == BPF_MEM; 358 } 359 360 static inline bool is_mbpf_classic_store_pkt(const struct nfp_insn_meta *meta) 361 { 362 return is_mbpf_classic_store(meta) && meta->ptr.type == PTR_TO_PACKET; 363 } 364 365 static inline bool is_mbpf_xadd(const struct nfp_insn_meta *meta) 366 { 367 return (meta->insn.code & ~BPF_SIZE_MASK) == (BPF_STX | BPF_XADD); 368 } 369 370 /** 371 * struct nfp_prog - nfp BPF program 372 * @bpf: backpointer to the bpf app priv structure 373 * @prog: machine code 374 * @prog_len: number of valid instructions in @prog array 375 * @__prog_alloc_len: alloc size of @prog array 376 * @verifier_meta: temporary storage for verifier's insn meta 377 * @type: BPF program type 378 * @last_bpf_off: address of the last instruction translated from BPF 379 * @tgt_out: jump target for normal exit 380 * @tgt_abort: jump target for abort (e.g. access outside of packet buffer) 381 * @n_translated: number of successfully translated instructions (for errors) 382 * @error: error code if something went wrong 383 * @stack_depth: max stack depth from the verifier 384 * @adjust_head_location: if program has single adjust head call - the insn no. 385 * @map_records_cnt: the number of map pointers recorded for this prog 386 * @map_records: the map record pointers from bpf->maps_neutral 387 * @insns: list of BPF instruction wrappers (struct nfp_insn_meta) 388 */ 389 struct nfp_prog { 390 struct nfp_app_bpf *bpf; 391 392 u64 *prog; 393 unsigned int prog_len; 394 unsigned int __prog_alloc_len; 395 396 struct nfp_insn_meta *verifier_meta; 397 398 enum bpf_prog_type type; 399 400 unsigned int last_bpf_off; 401 unsigned int tgt_out; 402 unsigned int tgt_abort; 403 404 unsigned int n_translated; 405 int error; 406 407 unsigned int stack_depth; 408 unsigned int adjust_head_location; 409 410 unsigned int map_records_cnt; 411 struct nfp_bpf_neutral_map **map_records; 412 413 struct list_head insns; 414 }; 415 416 /** 417 * struct nfp_bpf_vnic - per-vNIC BPF priv structure 418 * @tc_prog: currently loaded cls_bpf program 419 * @start_off: address of the first instruction in the memory 420 * @tgt_done: jump target to get the next packet 421 */ 422 struct nfp_bpf_vnic { 423 struct bpf_prog *tc_prog; 424 unsigned int start_off; 425 unsigned int tgt_done; 426 }; 427 428 void nfp_bpf_jit_prepare(struct nfp_prog *nfp_prog, unsigned int cnt); 429 int nfp_bpf_jit(struct nfp_prog *prog); 430 bool nfp_bpf_supported_opcode(u8 code); 431 432 extern const struct bpf_prog_offload_ops nfp_bpf_analyzer_ops; 433 434 struct netdev_bpf; 435 struct nfp_app; 436 struct nfp_net; 437 438 int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn, 439 struct netdev_bpf *bpf); 440 int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog, 441 bool old_prog, struct netlink_ext_ack *extack); 442 443 struct nfp_insn_meta * 444 nfp_bpf_goto_meta(struct nfp_prog *nfp_prog, struct nfp_insn_meta *meta, 445 unsigned int insn_idx, unsigned int n_insns); 446 447 void *nfp_bpf_relo_for_vnic(struct nfp_prog *nfp_prog, struct nfp_bpf_vnic *bv); 448 449 long long int 450 nfp_bpf_ctrl_alloc_map(struct nfp_app_bpf *bpf, struct bpf_map *map); 451 void 452 nfp_bpf_ctrl_free_map(struct nfp_app_bpf *bpf, struct nfp_bpf_map *nfp_map); 453 int nfp_bpf_ctrl_getfirst_entry(struct bpf_offloaded_map *offmap, 454 void *next_key); 455 int nfp_bpf_ctrl_update_entry(struct bpf_offloaded_map *offmap, 456 void *key, void *value, u64 flags); 457 int nfp_bpf_ctrl_del_entry(struct bpf_offloaded_map *offmap, void *key); 458 int nfp_bpf_ctrl_lookup_entry(struct bpf_offloaded_map *offmap, 459 void *key, void *value); 460 int nfp_bpf_ctrl_getnext_entry(struct bpf_offloaded_map *offmap, 461 void *key, void *next_key); 462 463 int nfp_bpf_event_output(struct nfp_app_bpf *bpf, struct sk_buff *skb); 464 465 void nfp_bpf_ctrl_msg_rx(struct nfp_app *app, struct sk_buff *skb); 466 #endif 467