main.c 11.1 KB
Newer Older
J
Jakub Kicinski 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
/*
 * Copyright (C) 2017 Netronome Systems, Inc.
 *
 * This software is dual licensed under the GNU General License Version 2,
 * June 1991 as shown in the file COPYING in the top-level directory of this
 * source tree or the BSD 2-Clause License provided below.  You have the
 * option to license this software under the complete terms of either license.
 *
 * The BSD 2-Clause License:
 *
 *     Redistribution and use in source and binary forms, with or
 *     without modification, are permitted provided that the following
 *     conditions are met:
 *
 *      1. Redistributions of source code must retain the above
 *         copyright notice, this list of conditions and the following
 *         disclaimer.
 *
 *      2. Redistributions in binary form must reproduce the above
 *         copyright notice, this list of conditions and the following
 *         disclaimer in the documentation and/or other materials
 *         provided with the distribution.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

34 35
#include <net/pkt_cls.h>

J
Jakub Kicinski 已提交
36
#include "../nfpcore/nfp_cpp.h"
37
#include "../nfpcore/nfp_nffw.h"
J
Jakub Kicinski 已提交
38
#include "../nfpcore/nfp_nsp.h"
J
Jakub Kicinski 已提交
39 40 41 42
#include "../nfp_app.h"
#include "../nfp_main.h"
#include "../nfp_net.h"
#include "../nfp_port.h"
43
#include "fw.h"
44 45 46 47
#include "main.h"

static bool nfp_net_ebpf_capable(struct nfp_net *nn)
{
48
#ifdef __LITTLE_ENDIAN
49 50 51
	if (nn->cap & NFP_NET_CFG_CTRL_BPF &&
	    nn_readb(nn, NFP_NET_CFG_BPF_ABI) == NFP_NET_BPF_ABI)
		return true;
52
#endif
53 54 55 56 57
	return false;
}

static int
nfp_bpf_xdp_offload(struct nfp_app *app, struct nfp_net *nn,
58
		    struct bpf_prog *prog, struct netlink_ext_ack *extack)
59
{
J
Jakub Kicinski 已提交
60
	bool running, xdp_running;
61 62 63 64 65
	int ret;

	if (!nfp_net_ebpf_capable(nn))
		return -EINVAL;

J
Jakub Kicinski 已提交
66 67 68 69 70 71 72
	running = nn->dp.ctrl & NFP_NET_CFG_CTRL_BPF;
	xdp_running = running && nn->dp.bpf_offload_xdp;

	if (!prog && !xdp_running)
		return 0;
	if (prog && running && !xdp_running)
		return -EBUSY;
73

74
	ret = nfp_net_bpf_offload(nn, prog, running, extack);
75
	/* Stop offload if replace not possible */
J
Jakub Kicinski 已提交
76
	if (ret && prog)
77
		nfp_bpf_xdp_offload(app, nn, NULL, extack);
J
Jakub Kicinski 已提交
78

79 80 81 82 83 84 85 86
	nn->dp.bpf_offload_xdp = prog && !ret;
	return ret;
}

static const char *nfp_bpf_extra_cap(struct nfp_app *app, struct nfp_net *nn)
{
	return nfp_net_ebpf_capable(nn) ? "BPF" : "";
}
J
Jakub Kicinski 已提交
87

88 89 90
static int
nfp_bpf_vnic_alloc(struct nfp_app *app, struct nfp_net *nn, unsigned int id)
{
J
Jakub Kicinski 已提交
91
	struct nfp_pf *pf = app->pf;
92
	struct nfp_bpf_vnic *bv;
93 94
	int err;

J
Jakub Kicinski 已提交
95 96 97 98 99 100 101 102 103 104
	if (!pf->eth_tbl) {
		nfp_err(pf->cpp, "No ETH table\n");
		return -EINVAL;
	}
	if (pf->max_data_vnics != pf->eth_tbl->count) {
		nfp_err(pf->cpp, "ETH entries don't match vNICs (%d vs %d)\n",
			pf->max_data_vnics, pf->eth_tbl->count);
		return -EINVAL;
	}

105 106
	bv = kzalloc(sizeof(*bv), GFP_KERNEL);
	if (!bv)
107
		return -ENOMEM;
108
	nn->app_priv = bv;
109 110 111 112 113

	err = nfp_app_nic_vnic_alloc(app, nn, id);
	if (err)
		goto err_free_priv;

114 115 116
	bv->start_off = nn_readw(nn, NFP_NET_CFG_BPF_START);
	bv->tgt_done = nn_readw(nn, NFP_NET_CFG_BPF_DONE);

117 118 119 120 121 122 123 124 125 126 127 128 129 130
	return 0;
err_free_priv:
	kfree(nn->app_priv);
	return err;
}

static void nfp_bpf_vnic_free(struct nfp_app *app, struct nfp_net *nn)
{
	struct nfp_bpf_vnic *bv = nn->app_priv;

	WARN_ON(bv->tc_prog);
	kfree(bv);
}

131 132
static int nfp_bpf_setup_tc_block_cb(enum tc_setup_type type,
				     void *type_data, void *cb_priv)
133
{
134
	struct tc_cls_bpf_offload *cls_bpf = type_data;
135
	struct nfp_net *nn = cb_priv;
136 137 138
	struct bpf_prog *oldprog;
	struct nfp_bpf_vnic *bv;
	int err;
J
Jakub Kicinski 已提交
139

140 141 142 143 144
	if (type != TC_SETUP_CLSBPF) {
		NL_SET_ERR_MSG_MOD(cls_bpf->common.extack,
				   "only offload of BPF classifiers supported");
		return -EOPNOTSUPP;
	}
145
	if (!tc_cls_can_offload_and_chain0(nn->dp.netdev, &cls_bpf->common))
146 147 148 149 150 151 152 153 154 155 156
		return -EOPNOTSUPP;
	if (!nfp_net_ebpf_capable(nn)) {
		NL_SET_ERR_MSG_MOD(cls_bpf->common.extack,
				   "NFP firmware does not support eBPF offload");
		return -EOPNOTSUPP;
	}
	if (cls_bpf->common.protocol != htons(ETH_P_ALL)) {
		NL_SET_ERR_MSG_MOD(cls_bpf->common.extack,
				   "only ETH_P_ALL supported as filter protocol");
		return -EOPNOTSUPP;
	}
157

J
Jakub Kicinski 已提交
158 159 160
	/* Only support TC direct action */
	if (!cls_bpf->exts_integrated ||
	    tcf_exts_has_actions(cls_bpf->exts)) {
161 162
		NL_SET_ERR_MSG_MOD(cls_bpf->common.extack,
				   "only direct action with no legacy actions supported");
163
		return -EOPNOTSUPP;
J
Jakub Kicinski 已提交
164 165
	}

166
	if (cls_bpf->command != TC_CLSBPF_OFFLOAD)
167
		return -EOPNOTSUPP;
168

169 170 171 172 173 174 175 176
	bv = nn->app_priv;
	oldprog = cls_bpf->oldprog;

	/* Don't remove if oldprog doesn't match driver's state */
	if (bv->tc_prog != oldprog) {
		oldprog = NULL;
		if (!cls_bpf->prog)
			return 0;
177
	}
178

179 180
	err = nfp_net_bpf_offload(nn, cls_bpf->prog, oldprog,
				  cls_bpf->common.extack);
181 182 183 184
	if (err)
		return err;

	bv->tc_prog = cls_bpf->prog;
185
	nn->port->tc_offload_cnt = !!bv->tc_prog;
186
	return 0;
187 188 189 190 191
}

static int nfp_bpf_setup_tc_block(struct net_device *netdev,
				  struct tc_block_offload *f)
{
192 193
	struct nfp_net *nn = netdev_priv(netdev);

194
	if (f->binder_type != TCF_BLOCK_BINDER_TYPE_CLSACT_INGRESS)
195 196
		return -EOPNOTSUPP;

197 198 199 200 201 202 203 204 205 206 207 208 209 210
	switch (f->command) {
	case TC_BLOCK_BIND:
		return tcf_block_cb_register(f->block,
					     nfp_bpf_setup_tc_block_cb,
					     nn, nn);
	case TC_BLOCK_UNBIND:
		tcf_block_cb_unregister(f->block,
					nfp_bpf_setup_tc_block_cb,
					nn);
		return 0;
	default:
		return -EOPNOTSUPP;
	}
}
211

212 213 214 215 216 217 218 219 220
static int nfp_bpf_setup_tc(struct nfp_app *app, struct net_device *netdev,
			    enum tc_setup_type type, void *type_data)
{
	switch (type) {
	case TC_SETUP_BLOCK:
		return nfp_bpf_setup_tc_block(netdev, type_data);
	default:
		return -EOPNOTSUPP;
	}
221 222
}

223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240
static int
nfp_bpf_change_mtu(struct nfp_app *app, struct net_device *netdev, int new_mtu)
{
	struct nfp_net *nn = netdev_priv(netdev);
	unsigned int max_mtu;

	if (~nn->dp.ctrl & NFP_NET_CFG_CTRL_BPF)
		return 0;

	max_mtu = nn_readb(nn, NFP_NET_CFG_BPF_INL_MTU) * 64 - 32;
	if (new_mtu > max_mtu) {
		nn_info(nn, "BPF offload active, MTU over %u not supported\n",
			max_mtu);
		return -EBUSY;
	}
	return 0;
}

241 242 243 244 245 246 247 248 249 250 251 252 253 254 255
static int
nfp_bpf_parse_cap_adjust_head(struct nfp_app_bpf *bpf, void __iomem *value,
			      u32 length)
{
	struct nfp_bpf_cap_tlv_adjust_head __iomem *cap = value;
	struct nfp_cpp *cpp = bpf->app->pf->cpp;

	if (length < sizeof(*cap)) {
		nfp_err(cpp, "truncated adjust_head TLV: %d\n", length);
		return -EINVAL;
	}

	bpf->adjust_head.flags = readl(&cap->flags);
	bpf->adjust_head.off_min = readl(&cap->off_min);
	bpf->adjust_head.off_max = readl(&cap->off_max);
256 257
	bpf->adjust_head.guaranteed_sub = readl(&cap->guaranteed_sub);
	bpf->adjust_head.guaranteed_add = readl(&cap->guaranteed_add);
258 259 260 261 262 263 264 265 266 267 268 269 270 271 272

	if (bpf->adjust_head.off_min > bpf->adjust_head.off_max) {
		nfp_err(cpp, "invalid adjust_head TLV: min > max\n");
		return -EINVAL;
	}
	if (!FIELD_FIT(UR_REG_IMM_MAX, bpf->adjust_head.off_min) ||
	    !FIELD_FIT(UR_REG_IMM_MAX, bpf->adjust_head.off_max)) {
		nfp_warn(cpp, "disabling adjust_head - driver expects min/max to fit in as immediates\n");
		memset(&bpf->adjust_head, 0, sizeof(bpf->adjust_head));
		return 0;
	}

	return 0;
}

273 274 275 276 277 278 279 280 281 282 283 284 285 286
static int
nfp_bpf_parse_cap_func(struct nfp_app_bpf *bpf, void __iomem *value, u32 length)
{
	struct nfp_bpf_cap_tlv_func __iomem *cap = value;

	if (length < sizeof(*cap)) {
		nfp_err(bpf->app->cpp, "truncated function TLV: %d\n", length);
		return -EINVAL;
	}

	switch (readl(&cap->func_id)) {
	case BPF_FUNC_map_lookup_elem:
		bpf->helpers.map_lookup = readl(&cap->func_addr);
		break;
287 288 289
	case BPF_FUNC_map_update_elem:
		bpf->helpers.map_update = readl(&cap->func_addr);
		break;
290 291 292
	case BPF_FUNC_map_delete_elem:
		bpf->helpers.map_delete = readl(&cap->func_addr);
		break;
293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317
	}

	return 0;
}

static int
nfp_bpf_parse_cap_maps(struct nfp_app_bpf *bpf, void __iomem *value, u32 length)
{
	struct nfp_bpf_cap_tlv_maps __iomem *cap = value;

	if (length < sizeof(*cap)) {
		nfp_err(bpf->app->cpp, "truncated maps TLV: %d\n", length);
		return -EINVAL;
	}

	bpf->maps.types = readl(&cap->types);
	bpf->maps.max_maps = readl(&cap->max_maps);
	bpf->maps.max_elems = readl(&cap->max_elems);
	bpf->maps.max_key_sz = readl(&cap->max_key_sz);
	bpf->maps.max_val_sz = readl(&cap->max_val_sz);
	bpf->maps.max_elem_sz = readl(&cap->max_elem_sz);

	return 0;
}

318 319 320 321 322 323 324 325
static int
nfp_bpf_parse_cap_random(struct nfp_app_bpf *bpf, void __iomem *value,
			 u32 length)
{
	bpf->pseudo_random = true;
	return 0;
}

326 327 328 329 330 331 332 333 334 335 336 337 338
static int nfp_bpf_parse_capabilities(struct nfp_app *app)
{
	struct nfp_cpp *cpp = app->pf->cpp;
	struct nfp_cpp_area *area;
	u8 __iomem *mem, *start;

	mem = nfp_rtsym_map(app->pf->rtbl, "_abi_bpf_capabilities", "bpf.cap",
			    8, &area);
	if (IS_ERR(mem))
		return PTR_ERR(mem) == -ENOENT ? 0 : PTR_ERR(mem);

	start = mem;
	while (mem - start + 8 < nfp_cpp_area_size(area)) {
339
		u8 __iomem *value;
340 341 342 343
		u32 type, length;

		type = readl(mem);
		length = readl(mem + 4);
344
		value = mem + 8;
345 346 347 348 349 350

		mem += 8 + length;
		if (mem - start > nfp_cpp_area_size(area))
			goto err_release_free;

		switch (type) {
351 352 353 354
		case NFP_BPF_CAP_TYPE_FUNC:
			if (nfp_bpf_parse_cap_func(app->priv, value, length))
				goto err_release_free;
			break;
355 356 357 358 359
		case NFP_BPF_CAP_TYPE_ADJUST_HEAD:
			if (nfp_bpf_parse_cap_adjust_head(app->priv, value,
							  length))
				goto err_release_free;
			break;
360 361 362 363
		case NFP_BPF_CAP_TYPE_MAPS:
			if (nfp_bpf_parse_cap_maps(app->priv, value, length))
				goto err_release_free;
			break;
364 365 366 367
		case NFP_BPF_CAP_TYPE_RANDOM:
			if (nfp_bpf_parse_cap_random(app->priv, value, length))
				goto err_release_free;
			break;
368 369 370 371 372 373
		default:
			nfp_dbg(cpp, "unknown BPF capability: %d\n", type);
			break;
		}
	}
	if (mem - start != nfp_cpp_area_size(area)) {
374
		nfp_err(cpp, "BPF capabilities left after parsing, parsed:%zd total length:%zu\n",
375 376 377 378 379 380 381 382 383
			mem - start, nfp_cpp_area_size(area));
		goto err_release_free;
	}

	nfp_cpp_area_release_free(area);

	return 0;

err_release_free:
384
	nfp_err(cpp, "invalid BPF capabilities at offset:%zd\n", mem - start);
385 386 387 388 389 390 391 392 393 394 395 396 397 398 399
	nfp_cpp_area_release_free(area);
	return -EINVAL;
}

static int nfp_bpf_init(struct nfp_app *app)
{
	struct nfp_app_bpf *bpf;
	int err;

	bpf = kzalloc(sizeof(*bpf), GFP_KERNEL);
	if (!bpf)
		return -ENOMEM;
	bpf->app = app;
	app->priv = bpf;

400 401
	skb_queue_head_init(&bpf->cmsg_replies);
	init_waitqueue_head(&bpf->cmsg_wq);
402 403
	INIT_LIST_HEAD(&bpf->map_list);

404 405 406 407 408 409 410 411 412 413 414 415 416
	err = nfp_bpf_parse_capabilities(app);
	if (err)
		goto err_free_bpf;

	return 0;

err_free_bpf:
	kfree(bpf);
	return err;
}

static void nfp_bpf_clean(struct nfp_app *app)
{
417 418
	struct nfp_app_bpf *bpf = app->priv;

419
	WARN_ON(!skb_queue_empty(&bpf->cmsg_replies));
420
	WARN_ON(!list_empty(&bpf->map_list));
421
	WARN_ON(bpf->maps_in_use || bpf->map_elems_in_use);
422
	kfree(bpf);
423 424
}

J
Jakub Kicinski 已提交
425 426
const struct nfp_app_type app_bpf = {
	.id		= NFP_APP_BPF_NIC,
427
	.name		= "ebpf",
J
Jakub Kicinski 已提交
428

429
	.ctrl_cap_mask	= 0,
430

431 432 433
	.init		= nfp_bpf_init,
	.clean		= nfp_bpf_clean,

434 435
	.change_mtu	= nfp_bpf_change_mtu,

436 437
	.extra_cap	= nfp_bpf_extra_cap,

438 439
	.vnic_alloc	= nfp_bpf_vnic_alloc,
	.vnic_free	= nfp_bpf_vnic_free,
440

441 442
	.ctrl_msg_rx	= nfp_bpf_ctrl_msg_rx,

443
	.setup_tc	= nfp_bpf_setup_tc,
444
	.bpf		= nfp_ndo_bpf,
445
	.xdp_offload	= nfp_bpf_xdp_offload,
J
Jakub Kicinski 已提交
446
};