cls_bpf.c 8.1 KB
Newer Older
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
/*
 * 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>
#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");

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

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

static const struct nla_policy bpf_policy[TCA_BPF_MAX + 1] = {
	[TCA_BPF_CLASSID]	= { .type = NLA_U32 },
	[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)
{
55
	struct cls_bpf_head *head = rcu_dereference_bh(tp->root);
56 57 58
	struct cls_bpf_prog *prog;
	int ret;

J
John Fastabend 已提交
59
	list_for_each_entry_rcu(prog, &head->plist, link) {
60
		int filter_res = BPF_PROG_RUN(prog->filter, skb);
61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86

		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;

		return ret;
	}

	return -1;
}

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 已提交
87 88
	INIT_LIST_HEAD_RCU(&head->plist);
	rcu_assign_pointer(tp->root, head);
89 90 91 92 93 94

	return 0;
}

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

97
	bpf_prog_destroy(prog->filter);
98 99 100 101 102

	kfree(prog->bpf_ops);
	kfree(prog);
}

J
John Fastabend 已提交
103 104 105 106 107 108 109
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);
}

110 111
static int cls_bpf_delete(struct tcf_proto *tp, unsigned long arg)
{
112
	struct cls_bpf_prog *prog = (struct cls_bpf_prog *) arg;
113

114 115 116 117
	list_del_rcu(&prog->link);
	tcf_unbind_filter(tp, &prog->res);
	call_rcu(&prog->rcu, __cls_bpf_delete_prog);
	return 0;
118 119 120 121
}

static void cls_bpf_destroy(struct tcf_proto *tp)
{
J
John Fastabend 已提交
122
	struct cls_bpf_head *head = rtnl_dereference(tp->root);
123 124 125
	struct cls_bpf_prog *prog, *tmp;

	list_for_each_entry_safe(prog, tmp, &head->plist, link) {
J
John Fastabend 已提交
126
		list_del_rcu(&prog->link);
127
		tcf_unbind_filter(tp, &prog->res);
J
John Fastabend 已提交
128
		call_rcu(&prog->rcu, __cls_bpf_delete_prog);
129 130
	}

J
John Fastabend 已提交
131 132
	RCU_INIT_POINTER(tp->root, NULL);
	kfree_rcu(head, rcu);
133 134 135 136
}

static unsigned long cls_bpf_get(struct tcf_proto *tp, u32 handle)
{
J
John Fastabend 已提交
137
	struct cls_bpf_head *head = rtnl_dereference(tp->root);
138 139 140 141 142 143
	struct cls_bpf_prog *prog;
	unsigned long ret = 0UL;

	if (head == NULL)
		return 0UL;

144
	list_for_each_entry(prog, &head->plist, link) {
145 146 147 148 149 150 151 152 153 154 155 156
		if (prog->handle == handle) {
			ret = (unsigned long) prog;
			break;
		}
	}

	return ret;
}

static int cls_bpf_modify_existing(struct net *net, struct tcf_proto *tp,
				   struct cls_bpf_prog *prog,
				   unsigned long base, struct nlattr **tb,
157
				   struct nlattr *est, bool ovr)
158
{
J
John Fastabend 已提交
159
	struct sock_filter *bpf_ops;
160
	struct tcf_exts exts;
161
	struct sock_fprog_kern tmp;
J
John Fastabend 已提交
162
	struct bpf_prog *fp;
163 164 165 166 167 168 169
	u16 bpf_size, bpf_len;
	u32 classid;
	int ret;

	if (!tb[TCA_BPF_OPS_LEN] || !tb[TCA_BPF_OPS] || !tb[TCA_BPF_CLASSID])
		return -EINVAL;

170
	tcf_exts_init(&exts, TCA_BPF_ACT, TCA_BPF_POLICE);
171
	ret = tcf_exts_validate(net, tp, tb, est, &exts, ovr);
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191
	if (ret < 0)
		return ret;

	classid = nla_get_u32(tb[TCA_BPF_CLASSID]);
	bpf_len = nla_get_u16(tb[TCA_BPF_OPS_LEN]);
	if (bpf_len > BPF_MAXINSNS || bpf_len == 0) {
		ret = -EINVAL;
		goto errout;
	}

	bpf_size = bpf_len * sizeof(*bpf_ops);
	bpf_ops = kzalloc(bpf_size, GFP_KERNEL);
	if (bpf_ops == NULL) {
		ret = -ENOMEM;
		goto errout;
	}

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

	tmp.len = bpf_len;
192
	tmp.filter = bpf_ops;
193

194
	ret = bpf_prog_create(&fp, &tmp);
195 196 197 198 199 200 201 202 203 204 205 206 207 208 209
	if (ret)
		goto errout_free;

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

	tcf_bind_filter(tp, &prog->res, base);
	tcf_exts_change(tp, &prog->exts, &exts);

	return 0;
errout_free:
	kfree(bpf_ops);
errout:
210
	tcf_exts_destroy(&exts);
211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231
	return ret;
}

static u32 cls_bpf_grab_new_handle(struct tcf_proto *tp,
				   struct cls_bpf_head *head)
{
	unsigned int i = 0x80000000;

	do {
		if (++head->hgen == 0x7FFFFFFF)
			head->hgen = 1;
	} while (--i > 0 && cls_bpf_get(tp, head->hgen));
	if (i == 0)
		pr_err("Insufficient number of handles\n");

	return i;
}

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,
232
			  unsigned long *arg, bool ovr)
233
{
J
John Fastabend 已提交
234 235
	struct cls_bpf_head *head = rtnl_dereference(tp->root);
	struct cls_bpf_prog *oldprog = (struct cls_bpf_prog *) *arg;
236
	struct nlattr *tb[TCA_BPF_MAX + 1];
J
John Fastabend 已提交
237
	struct cls_bpf_prog *prog;
238 239 240 241 242 243 244 245 246 247
	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 已提交
248
	if (!prog)
249 250
		return -ENOBUFS;

251
	tcf_exts_init(&prog->exts, TCA_BPF_ACT, TCA_BPF_POLICE);
J
John Fastabend 已提交
252 253 254 255 256 257 258 259

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

260 261 262 263 264 265 266 267 268
	if (handle == 0)
		prog->handle = cls_bpf_grab_new_handle(tp, head);
	else
		prog->handle = handle;
	if (prog->handle == 0) {
		ret = -EINVAL;
		goto errout;
	}

269
	ret = cls_bpf_modify_existing(net, tp, prog, base, tb, tca[TCA_RATE], ovr);
270 271 272
	if (ret < 0)
		goto errout;

J
John Fastabend 已提交
273 274
	if (oldprog) {
		list_replace_rcu(&prog->link, &oldprog->link);
275
		tcf_unbind_filter(tp, &oldprog->res);
J
John Fastabend 已提交
276 277 278 279
		call_rcu(&oldprog->rcu, __cls_bpf_delete_prog);
	} else {
		list_add_rcu(&prog->link, &head->plist);
	}
280 281 282 283

	*arg = (unsigned long) prog;
	return 0;
errout:
J
John Fastabend 已提交
284
	kfree(prog);
285 286 287 288

	return ret;
}

289
static int cls_bpf_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313
			struct sk_buff *skb, struct tcmsg *tm)
{
	struct cls_bpf_prog *prog = (struct cls_bpf_prog *) fh;
	struct nlattr *nest, *nla;

	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;
	if (nla_put_u16(skb, TCA_BPF_OPS_LEN, prog->bpf_len))
		goto nla_put_failure;

	nla = nla_reserve(skb, TCA_BPF_OPS, prog->bpf_len *
			  sizeof(struct sock_filter));
	if (nla == NULL)
		goto nla_put_failure;

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

316
	if (tcf_exts_dump(skb, &prog->exts) < 0)
317 318 319 320
		goto nla_put_failure;

	nla_nest_end(skb, nest);

321
	if (tcf_exts_dump_stats(skb, &prog->exts) < 0)
322 323 324 325 326 327 328 329 330 331 332
		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 已提交
333
	struct cls_bpf_head *head = rtnl_dereference(tp->root);
334 335
	struct cls_bpf_prog *prog;

336
	list_for_each_entry(prog, &head->plist, link) {
337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372
		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);