blob: d4f144a62f0f99ccc42be28c11f0f64e93bb6a59 [file] [log] [blame]
Jakub Kicinskicd7df562016-09-21 11:44:00 +01001/*
2 * Copyright (C) 2016 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>
Jakub Kicinski2ca71442017-10-12 10:34:16 -070039#include <linux/bpf_verifier.h>
Jakub Kicinskicd7df562016-09-21 11:44:00 +010040#include <linux/list.h>
41#include <linux/types.h>
42
Jakub Kicinskib3f868d2017-10-08 21:04:05 -070043#include "../nfp_asm.h"
Jakub Kicinskic66a9cf2017-05-31 08:06:50 -070044#include "../nfp_net.h"
45
Jakub Kicinskicd7df562016-09-21 11:44:00 +010046/* For branch fixup logic use up-most byte of branch instruction as scratch
47 * area. Remember to clear this before sending instructions to HW!
48 */
49#define OP_BR_SPECIAL 0xff00000000000000ULL
50
51enum br_special {
52 OP_BR_NORMAL = 0,
53 OP_BR_GO_OUT,
54 OP_BR_GO_ABORT,
55};
56
57enum static_regs {
Jakub Kicinski18e53b62017-10-08 21:04:13 -070058 STATIC_REG_IMM = 21, /* Bank AB */
Jakub Kicinskid3488482017-10-23 11:58:11 -070059 STATIC_REG_STACK = 22, /* Bank A */
Jakub Kicinski18e53b62017-10-08 21:04:13 -070060 STATIC_REG_PKT_LEN = 22, /* Bank B */
61};
62
63enum pkt_vec {
64 PKT_VEC_PKT_LEN = 0,
65 PKT_VEC_PKT_PTR = 2,
Jakub Kicinskicd7df562016-09-21 11:44:00 +010066};
67
68enum nfp_bpf_action_type {
69 NN_ACT_TC_DROP,
Jakub Kicinski2d184212016-09-21 11:44:06 +010070 NN_ACT_TC_REDIR,
Jakub Kicinskie3b8baf2016-09-21 11:44:07 +010071 NN_ACT_DIRECT,
Jakub Kicinski6d677072016-11-03 17:12:09 +000072 NN_ACT_XDP,
Jakub Kicinskicd7df562016-09-21 11:44:00 +010073};
74
Jakub Kicinski18e53b62017-10-08 21:04:13 -070075#define pv_len(np) reg_lm(1, PKT_VEC_PKT_LEN)
76#define pv_ctm_ptr(np) reg_lm(1, PKT_VEC_PKT_PTR)
77
Jakub Kicinskid3488482017-10-23 11:58:11 -070078#define stack_reg(np) reg_a(STATIC_REG_STACK)
79#define stack_imm(np) imm_b(np)
Jakub Kicinski18e53b62017-10-08 21:04:13 -070080#define plen_reg(np) reg_b(STATIC_REG_PKT_LEN)
81#define pptr_reg(np) pv_ctm_ptr(np)
82#define imm_a(np) reg_a(STATIC_REG_IMM)
83#define imm_b(np) reg_b(STATIC_REG_IMM)
84#define imm_both(np) reg_both(STATIC_REG_IMM)
Jakub Kicinskicd7df562016-09-21 11:44:00 +010085
Jakub Kicinski509144e2017-10-08 21:04:09 -070086#define NFP_BPF_ABI_FLAGS reg_imm(0)
Jakub Kicinski19d0f542016-09-21 11:44:04 +010087#define NFP_BPF_ABI_FLAG_MARK 1
Jakub Kicinskicd7df562016-09-21 11:44:00 +010088
89struct nfp_prog;
90struct nfp_insn_meta;
91typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *);
92
93#define nfp_prog_first_meta(nfp_prog) \
94 list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l)
95#define nfp_prog_last_meta(nfp_prog) \
96 list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l)
97#define nfp_meta_next(meta) list_next_entry(meta, l)
98#define nfp_meta_prev(meta) list_prev_entry(meta, l)
99
100/**
101 * struct nfp_insn_meta - BPF instruction wrapper
102 * @insn: BPF instruction
Jakub Kicinski2ca71442017-10-12 10:34:16 -0700103 * @ptr: pointer type for memory operations
Jakub Kicinskicd7df562016-09-21 11:44:00 +0100104 * @off: index of first generated machine instruction (in nfp_prog.prog)
105 * @n: eBPF instruction number
106 * @skip: skip this instruction (optimized out)
107 * @double_cb: callback for second part of the instruction
108 * @l: link on nfp_prog->insns list
109 */
110struct nfp_insn_meta {
111 struct bpf_insn insn;
Jakub Kicinski2ca71442017-10-12 10:34:16 -0700112 struct bpf_reg_state ptr;
Jakub Kicinskicd7df562016-09-21 11:44:00 +0100113 unsigned int off;
114 unsigned short n;
115 bool skip;
116 instr_cb_t double_cb;
117
118 struct list_head l;
119};
120
121#define BPF_SIZE_MASK 0x18
122
123static inline u8 mbpf_class(const struct nfp_insn_meta *meta)
124{
125 return BPF_CLASS(meta->insn.code);
126}
127
128static inline u8 mbpf_src(const struct nfp_insn_meta *meta)
129{
130 return BPF_SRC(meta->insn.code);
131}
132
133static inline u8 mbpf_op(const struct nfp_insn_meta *meta)
134{
135 return BPF_OP(meta->insn.code);
136}
137
138static inline u8 mbpf_mode(const struct nfp_insn_meta *meta)
139{
140 return BPF_MODE(meta->insn.code);
141}
142
143/**
144 * struct nfp_prog - nfp BPF program
145 * @prog: machine code
146 * @prog_len: number of valid instructions in @prog array
147 * @__prog_alloc_len: alloc size of @prog array
148 * @act: BPF program/action type (TC DA, TC with action, XDP etc.)
149 * @num_regs: number of registers used by this program
150 * @regs_per_thread: number of basic registers allocated per thread
151 * @start_off: address of the first instruction in the memory
152 * @tgt_out: jump target for normal exit
153 * @tgt_abort: jump target for abort (e.g. access outside of packet buffer)
154 * @tgt_done: jump target to get the next packet
155 * @n_translated: number of successfully translated instructions (for errors)
156 * @error: error code if something went wrong
Jakub Kicinskiee9133a2017-10-23 11:58:08 -0700157 * @stack_depth: max stack depth from the verifier
Jakub Kicinskicd7df562016-09-21 11:44:00 +0100158 * @insns: list of BPF instruction wrappers (struct nfp_insn_meta)
159 */
160struct nfp_prog {
161 u64 *prog;
162 unsigned int prog_len;
163 unsigned int __prog_alloc_len;
164
165 enum nfp_bpf_action_type act;
166
167 unsigned int num_regs;
168 unsigned int regs_per_thread;
169
170 unsigned int start_off;
171 unsigned int tgt_out;
172 unsigned int tgt_abort;
173 unsigned int tgt_done;
174
175 unsigned int n_translated;
176 int error;
177
Jakub Kicinskiee9133a2017-10-23 11:58:08 -0700178 unsigned int stack_depth;
179
Jakub Kicinskicd7df562016-09-21 11:44:00 +0100180 struct list_head insns;
181};
182
183struct nfp_bpf_result {
184 unsigned int n_instr;
185 bool dense_mode;
186};
187
Jakub Kicinskicd7df562016-09-21 11:44:00 +0100188int
189nfp_bpf_jit(struct bpf_prog *filter, void *prog, enum nfp_bpf_action_type act,
190 unsigned int prog_start, unsigned int prog_done,
191 unsigned int prog_sz, struct nfp_bpf_result *res);
Jakub Kicinskicd7df562016-09-21 11:44:00 +0100192
193int nfp_prog_verify(struct nfp_prog *nfp_prog, struct bpf_prog *prog);
194
Jakub Kicinskibb45e512017-05-31 08:06:49 -0700195struct nfp_net;
196struct tc_cls_bpf_offload;
197
Jakub Kicinskic66a9cf2017-05-31 08:06:50 -0700198/**
199 * struct nfp_net_bpf_priv - per-vNIC BPF private data
200 * @rx_filter: Filter offload statistics - dropped packets/bytes
201 * @rx_filter_prev: Filter offload statistics - values from previous update
202 * @rx_filter_change: Jiffies when statistics last changed
203 * @rx_filter_stats_timer: Timer for polling filter offload statistics
204 * @rx_filter_lock: Lock protecting timer state changes (teardown)
205 */
206struct nfp_net_bpf_priv {
207 struct nfp_stat_pair rx_filter, rx_filter_prev;
208 unsigned long rx_filter_change;
209 struct timer_list rx_filter_stats_timer;
210 spinlock_t rx_filter_lock;
211};
212
Jakub Kicinskibb45e512017-05-31 08:06:49 -0700213int nfp_net_bpf_offload(struct nfp_net *nn, struct tc_cls_bpf_offload *cls_bpf);
Jakub Kicinskic66a9cf2017-05-31 08:06:50 -0700214void nfp_net_filter_stats_timer(unsigned long data);
Jakub Kicinskibb45e512017-05-31 08:06:49 -0700215
Jakub Kicinskicd7df562016-09-21 11:44:00 +0100216#endif