cls_bpf.c 10.5 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/*
 * Berkeley Packet Filter based traffic classifier
 *
 * Might be used to classify traffic through flexible, user-defined and
 * possibly JIT-ed BPF filters for traffic control as an alternative to
 * ematches.
 *
 * (C) 2013 Daniel Borkmann <dborkman@redhat.com>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */

#include <linux/module.h>
#include <linux/types.h>
#include <linux/skbuff.h>
#include <linux/filter.h>
19 20
#include <linux/bpf.h>

21 22 23 24 25 26 27 28
#include <net/rtnetlink.h>
#include <net/pkt_cls.h>
#include <net/sock.h>

MODULE_LICENSE("GPL");
MODULE_AUTHOR("Daniel Borkmann <dborkman@redhat.com>");
MODULE_DESCRIPTION("TC BPF based classifier");

29 30
#define CLS_BPF_NAME_LEN	256

31 32 33
struct cls_bpf_head {
	struct list_head plist;
	u32 hgen;
J
John Fastabend 已提交
34
	struct rcu_head rcu;
35 36 37
};

struct cls_bpf_prog {
38
	struct bpf_prog *filter;
39
	struct list_head link;
40 41
	struct tcf_result res;
	struct tcf_exts exts;
42
	u32 handle;
43 44 45 46 47 48
	union {
		u32 bpf_fd;
		u16 bpf_num_ops;
	};
	struct sock_filter *bpf_ops;
	const char *bpf_name;
J
John Fastabend 已提交
49 50
	struct tcf_proto *tp;
	struct rcu_head rcu;
51 52 53 54
};

static const struct nla_policy bpf_policy[TCA_BPF_MAX + 1] = {
	[TCA_BPF_CLASSID]	= { .type = NLA_U32 },
55 56
	[TCA_BPF_FD]		= { .type = NLA_U32 },
	[TCA_BPF_NAME]		= { .type = NLA_NUL_STRING, .len = CLS_BPF_NAME_LEN },
57 58 59 60 61 62 63 64
	[TCA_BPF_OPS_LEN]	= { .type = NLA_U16 },
	[TCA_BPF_OPS]		= { .type = NLA_BINARY,
				    .len = sizeof(struct sock_filter) * BPF_MAXINSNS },
};

static int cls_bpf_classify(struct sk_buff *skb, const struct tcf_proto *tp,
			    struct tcf_result *res)
{
65
	struct cls_bpf_head *head = rcu_dereference_bh(tp->root);
66
	struct cls_bpf_prog *prog;
67
	int ret = -1;
68

69 70 71
	if (unlikely(!skb_mac_header_was_set(skb)))
		return -1;

72 73
	/* Needed here for accessing maps. */
	rcu_read_lock();
J
John Fastabend 已提交
74
	list_for_each_entry_rcu(prog, &head->plist, link) {
75
		int filter_res = BPF_PROG_RUN(prog->filter, skb);
76 77 78 79 80 81 82 83 84 85 86 87

		if (filter_res == 0)
			continue;

		*res = prog->res;
		if (filter_res != -1)
			res->classid = filter_res;

		ret = tcf_exts_exec(skb, &prog->exts, res);
		if (ret < 0)
			continue;

88
		break;
89
	}
90
	rcu_read_unlock();
91

92
	return ret;
93 94
}

95 96 97 98 99
static bool cls_bpf_is_ebpf(const struct cls_bpf_prog *prog)
{
	return !prog->bpf_ops;
}

100 101 102 103 104 105 106 107
static int cls_bpf_init(struct tcf_proto *tp)
{
	struct cls_bpf_head *head;

	head = kzalloc(sizeof(*head), GFP_KERNEL);
	if (head == NULL)
		return -ENOBUFS;

J
John Fastabend 已提交
108 109
	INIT_LIST_HEAD_RCU(&head->plist);
	rcu_assign_pointer(tp->root, head);
110 111 112 113 114 115

	return 0;
}

static void cls_bpf_delete_prog(struct tcf_proto *tp, struct cls_bpf_prog *prog)
{
116
	tcf_exts_destroy(&prog->exts);
117

118 119 120 121
	if (cls_bpf_is_ebpf(prog))
		bpf_prog_put(prog->filter);
	else
		bpf_prog_destroy(prog->filter);
122

123
	kfree(prog->bpf_name);
124 125 126 127
	kfree(prog->bpf_ops);
	kfree(prog);
}

J
John Fastabend 已提交
128 129 130 131 132 133 134
static void __cls_bpf_delete_prog(struct rcu_head *rcu)
{
	struct cls_bpf_prog *prog = container_of(rcu, struct cls_bpf_prog, rcu);

	cls_bpf_delete_prog(prog->tp, prog);
}

135 136
static int cls_bpf_delete(struct tcf_proto *tp, unsigned long arg)
{
137
	struct cls_bpf_prog *prog = (struct cls_bpf_prog *) arg;
138

139 140 141
	list_del_rcu(&prog->link);
	tcf_unbind_filter(tp, &prog->res);
	call_rcu(&prog->rcu, __cls_bpf_delete_prog);
142

143
	return 0;
144 145
}

146
static bool cls_bpf_destroy(struct tcf_proto *tp, bool force)
147
{
J
John Fastabend 已提交
148
	struct cls_bpf_head *head = rtnl_dereference(tp->root);
149 150
	struct cls_bpf_prog *prog, *tmp;

151 152 153
	if (!force && !list_empty(&head->plist))
		return false;

154
	list_for_each_entry_safe(prog, tmp, &head->plist, link) {
J
John Fastabend 已提交
155
		list_del_rcu(&prog->link);
156
		tcf_unbind_filter(tp, &prog->res);
J
John Fastabend 已提交
157
		call_rcu(&prog->rcu, __cls_bpf_delete_prog);
158 159
	}

J
John Fastabend 已提交
160 161
	RCU_INIT_POINTER(tp->root, NULL);
	kfree_rcu(head, rcu);
162
	return true;
163 164 165 166
}

static unsigned long cls_bpf_get(struct tcf_proto *tp, u32 handle)
{
J
John Fastabend 已提交
167
	struct cls_bpf_head *head = rtnl_dereference(tp->root);
168 169 170 171 172 173
	struct cls_bpf_prog *prog;
	unsigned long ret = 0UL;

	if (head == NULL)
		return 0UL;

174
	list_for_each_entry(prog, &head->plist, link) {
175 176 177 178 179 180 181 182 183
		if (prog->handle == handle) {
			ret = (unsigned long) prog;
			break;
		}
	}

	return ret;
}

184 185
static int cls_bpf_prog_from_ops(struct nlattr **tb,
				 struct cls_bpf_prog *prog, u32 classid)
186
{
J
John Fastabend 已提交
187
	struct sock_filter *bpf_ops;
188
	struct sock_fprog_kern fprog_tmp;
J
John Fastabend 已提交
189
	struct bpf_prog *fp;
190
	u16 bpf_size, bpf_num_ops;
191 192
	int ret;

193
	bpf_num_ops = nla_get_u16(tb[TCA_BPF_OPS_LEN]);
194 195
	if (bpf_num_ops > BPF_MAXINSNS || bpf_num_ops == 0)
		return -EINVAL;
196

197
	bpf_size = bpf_num_ops * sizeof(*bpf_ops);
198 199
	if (bpf_size != nla_len(tb[TCA_BPF_OPS]))
		return -EINVAL;
200

201
	bpf_ops = kzalloc(bpf_size, GFP_KERNEL);
202 203
	if (bpf_ops == NULL)
		return -ENOMEM;
204 205 206

	memcpy(bpf_ops, nla_data(tb[TCA_BPF_OPS]), bpf_size);

207 208
	fprog_tmp.len = bpf_num_ops;
	fprog_tmp.filter = bpf_ops;
209

210 211 212 213 214
	ret = bpf_prog_create(&fp, &fprog_tmp);
	if (ret < 0) {
		kfree(bpf_ops);
		return ret;
	}
215 216

	prog->bpf_ops = bpf_ops;
217 218 219
	prog->bpf_num_ops = bpf_num_ops;
	prog->bpf_name = NULL;

220 221 222
	prog->filter = fp;
	prog->res.classid = classid;

223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
	return 0;
}

static int cls_bpf_prog_from_efd(struct nlattr **tb,
				 struct cls_bpf_prog *prog, u32 classid)
{
	struct bpf_prog *fp;
	char *name = NULL;
	u32 bpf_fd;

	bpf_fd = nla_get_u32(tb[TCA_BPF_FD]);

	fp = bpf_prog_get(bpf_fd);
	if (IS_ERR(fp))
		return PTR_ERR(fp);

	if (fp->type != BPF_PROG_TYPE_SCHED_CLS) {
		bpf_prog_put(fp);
		return -EINVAL;
	}

	if (tb[TCA_BPF_NAME]) {
		name = kmemdup(nla_data(tb[TCA_BPF_NAME]),
			       nla_len(tb[TCA_BPF_NAME]),
			       GFP_KERNEL);
		if (!name) {
			bpf_prog_put(fp);
			return -ENOMEM;
		}
	}

	prog->bpf_ops = NULL;
	prog->bpf_fd = bpf_fd;
	prog->bpf_name = name;

	prog->filter = fp;
	prog->res.classid = classid;

	return 0;
}

static int cls_bpf_modify_existing(struct net *net, struct tcf_proto *tp,
				   struct cls_bpf_prog *prog,
				   unsigned long base, struct nlattr **tb,
				   struct nlattr *est, bool ovr)
{
	struct tcf_exts exts;
	bool is_bpf, is_ebpf;
	u32 classid;
	int ret;

	is_bpf = tb[TCA_BPF_OPS_LEN] && tb[TCA_BPF_OPS];
	is_ebpf = tb[TCA_BPF_FD];

	if ((!is_bpf && !is_ebpf) || (is_bpf && is_ebpf) ||
	    !tb[TCA_BPF_CLASSID])
		return -EINVAL;

	tcf_exts_init(&exts, TCA_BPF_ACT, TCA_BPF_POLICE);
	ret = tcf_exts_validate(net, tp, tb, est, &exts, ovr);
	if (ret < 0)
		return ret;

	classid = nla_get_u32(tb[TCA_BPF_CLASSID]);

	ret = is_bpf ? cls_bpf_prog_from_ops(tb, prog, classid) :
		       cls_bpf_prog_from_efd(tb, prog, classid);
	if (ret < 0) {
		tcf_exts_destroy(&exts);
		return ret;
	}

295 296 297 298 299 300 301 302 303 304
	tcf_bind_filter(tp, &prog->res, base);
	tcf_exts_change(tp, &prog->exts, &exts);

	return 0;
}

static u32 cls_bpf_grab_new_handle(struct tcf_proto *tp,
				   struct cls_bpf_head *head)
{
	unsigned int i = 0x80000000;
305
	u32 handle;
306 307 308 309 310

	do {
		if (++head->hgen == 0x7FFFFFFF)
			head->hgen = 1;
	} while (--i > 0 && cls_bpf_get(tp, head->hgen));
311 312

	if (unlikely(i == 0)) {
313
		pr_err("Insufficient number of handles\n");
314 315 316 317
		handle = 0;
	} else {
		handle = head->hgen;
	}
318

319
	return handle;
320 321 322 323 324
}

static int cls_bpf_change(struct net *net, struct sk_buff *in_skb,
			  struct tcf_proto *tp, unsigned long base,
			  u32 handle, struct nlattr **tca,
325
			  unsigned long *arg, bool ovr)
326
{
J
John Fastabend 已提交
327 328
	struct cls_bpf_head *head = rtnl_dereference(tp->root);
	struct cls_bpf_prog *oldprog = (struct cls_bpf_prog *) *arg;
329
	struct nlattr *tb[TCA_BPF_MAX + 1];
J
John Fastabend 已提交
330
	struct cls_bpf_prog *prog;
331 332 333 334 335 336 337 338 339 340
	int ret;

	if (tca[TCA_OPTIONS] == NULL)
		return -EINVAL;

	ret = nla_parse_nested(tb, TCA_BPF_MAX, tca[TCA_OPTIONS], bpf_policy);
	if (ret < 0)
		return ret;

	prog = kzalloc(sizeof(*prog), GFP_KERNEL);
J
John Fastabend 已提交
341
	if (!prog)
342 343
		return -ENOBUFS;

344
	tcf_exts_init(&prog->exts, TCA_BPF_ACT, TCA_BPF_POLICE);
J
John Fastabend 已提交
345 346 347 348 349 350 351 352

	if (oldprog) {
		if (handle && oldprog->handle != handle) {
			ret = -EINVAL;
			goto errout;
		}
	}

353 354 355 356 357 358 359 360 361
	if (handle == 0)
		prog->handle = cls_bpf_grab_new_handle(tp, head);
	else
		prog->handle = handle;
	if (prog->handle == 0) {
		ret = -EINVAL;
		goto errout;
	}

362
	ret = cls_bpf_modify_existing(net, tp, prog, base, tb, tca[TCA_RATE], ovr);
363 364 365
	if (ret < 0)
		goto errout;

J
John Fastabend 已提交
366 367
	if (oldprog) {
		list_replace_rcu(&prog->link, &oldprog->link);
368
		tcf_unbind_filter(tp, &oldprog->res);
J
John Fastabend 已提交
369 370 371 372
		call_rcu(&oldprog->rcu, __cls_bpf_delete_prog);
	} else {
		list_add_rcu(&prog->link, &head->plist);
	}
373 374 375 376

	*arg = (unsigned long) prog;
	return 0;
errout:
J
John Fastabend 已提交
377
	kfree(prog);
378 379 380 381

	return ret;
}

382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412
static int cls_bpf_dump_bpf_info(const struct cls_bpf_prog *prog,
				 struct sk_buff *skb)
{
	struct nlattr *nla;

	if (nla_put_u16(skb, TCA_BPF_OPS_LEN, prog->bpf_num_ops))
		return -EMSGSIZE;

	nla = nla_reserve(skb, TCA_BPF_OPS, prog->bpf_num_ops *
			  sizeof(struct sock_filter));
	if (nla == NULL)
		return -EMSGSIZE;

	memcpy(nla_data(nla), prog->bpf_ops, nla_len(nla));

	return 0;
}

static int cls_bpf_dump_ebpf_info(const struct cls_bpf_prog *prog,
				  struct sk_buff *skb)
{
	if (nla_put_u32(skb, TCA_BPF_FD, prog->bpf_fd))
		return -EMSGSIZE;

	if (prog->bpf_name &&
	    nla_put_string(skb, TCA_BPF_NAME, prog->bpf_name))
		return -EMSGSIZE;

	return 0;
}

413
static int cls_bpf_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
414 415 416
			struct sk_buff *skb, struct tcmsg *tm)
{
	struct cls_bpf_prog *prog = (struct cls_bpf_prog *) fh;
417 418
	struct nlattr *nest;
	int ret;
419 420 421 422 423 424 425 426 427 428 429 430 431

	if (prog == NULL)
		return skb->len;

	tm->tcm_handle = prog->handle;

	nest = nla_nest_start(skb, TCA_OPTIONS);
	if (nest == NULL)
		goto nla_put_failure;

	if (nla_put_u32(skb, TCA_BPF_CLASSID, prog->res.classid))
		goto nla_put_failure;

432 433 434 435 436
	if (cls_bpf_is_ebpf(prog))
		ret = cls_bpf_dump_ebpf_info(prog, skb);
	else
		ret = cls_bpf_dump_bpf_info(prog, skb);
	if (ret)
437 438
		goto nla_put_failure;

439
	if (tcf_exts_dump(skb, &prog->exts) < 0)
440 441 442 443
		goto nla_put_failure;

	nla_nest_end(skb, nest);

444
	if (tcf_exts_dump_stats(skb, &prog->exts) < 0)
445 446 447 448 449 450 451 452 453 454 455
		goto nla_put_failure;

	return skb->len;

nla_put_failure:
	nla_nest_cancel(skb, nest);
	return -1;
}

static void cls_bpf_walk(struct tcf_proto *tp, struct tcf_walker *arg)
{
J
John Fastabend 已提交
456
	struct cls_bpf_head *head = rtnl_dereference(tp->root);
457 458
	struct cls_bpf_prog *prog;

459
	list_for_each_entry(prog, &head->plist, link) {
460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495
		if (arg->count < arg->skip)
			goto skip;
		if (arg->fn(tp, (unsigned long) prog, arg) < 0) {
			arg->stop = 1;
			break;
		}
skip:
		arg->count++;
	}
}

static struct tcf_proto_ops cls_bpf_ops __read_mostly = {
	.kind		=	"bpf",
	.owner		=	THIS_MODULE,
	.classify	=	cls_bpf_classify,
	.init		=	cls_bpf_init,
	.destroy	=	cls_bpf_destroy,
	.get		=	cls_bpf_get,
	.change		=	cls_bpf_change,
	.delete		=	cls_bpf_delete,
	.walk		=	cls_bpf_walk,
	.dump		=	cls_bpf_dump,
};

static int __init cls_bpf_init_mod(void)
{
	return register_tcf_proto_ops(&cls_bpf_ops);
}

static void __exit cls_bpf_exit_mod(void)
{
	unregister_tcf_proto_ops(&cls_bpf_ops);
}

module_init(cls_bpf_init_mod);
module_exit(cls_bpf_exit_mod);