blob: d0de979c04a3644f8208e57a165339acf9deebf1 [file] [log] [blame]
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +01001/*
2 * Berkeley Packet Filter based traffic classifier
3 *
4 * Might be used to classify traffic through flexible, user-defined and
5 * possibly JIT-ed BPF filters for traffic control as an alternative to
6 * ematches.
7 *
8 * (C) 2013 Daniel Borkmann <dborkman@redhat.com>
9 *
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License version 2 as
12 * published by the Free Software Foundation.
13 */
14
15#include <linux/module.h>
16#include <linux/types.h>
17#include <linux/skbuff.h>
18#include <linux/filter.h>
19#include <net/rtnetlink.h>
20#include <net/pkt_cls.h>
21#include <net/sock.h>
22
23MODULE_LICENSE("GPL");
24MODULE_AUTHOR("Daniel Borkmann <dborkman@redhat.com>");
25MODULE_DESCRIPTION("TC BPF based classifier");
26
27struct cls_bpf_head {
28 struct list_head plist;
29 u32 hgen;
John Fastabend1f947bf2014-09-12 20:10:24 -070030 struct rcu_head rcu;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +010031};
32
33struct cls_bpf_prog {
Alexei Starovoitov7ae457c2014-07-30 20:34:16 -070034 struct bpf_prog *filter;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +010035 struct sock_filter *bpf_ops;
36 struct tcf_exts exts;
37 struct tcf_result res;
38 struct list_head link;
39 u32 handle;
40 u16 bpf_len;
John Fastabend1f947bf2014-09-12 20:10:24 -070041 struct tcf_proto *tp;
42 struct rcu_head rcu;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +010043};
44
45static const struct nla_policy bpf_policy[TCA_BPF_MAX + 1] = {
46 [TCA_BPF_CLASSID] = { .type = NLA_U32 },
47 [TCA_BPF_OPS_LEN] = { .type = NLA_U16 },
48 [TCA_BPF_OPS] = { .type = NLA_BINARY,
49 .len = sizeof(struct sock_filter) * BPF_MAXINSNS },
50};
51
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +010052static int cls_bpf_classify(struct sk_buff *skb, const struct tcf_proto *tp,
53 struct tcf_result *res)
54{
WANG Cong80dcbd12014-09-15 14:21:50 -070055 struct cls_bpf_head *head = rcu_dereference_bh(tp->root);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +010056 struct cls_bpf_prog *prog;
57 int ret;
58
John Fastabend1f947bf2014-09-12 20:10:24 -070059 list_for_each_entry_rcu(prog, &head->plist, link) {
Alexei Starovoitov7ae457c2014-07-30 20:34:16 -070060 int filter_res = BPF_PROG_RUN(prog->filter, skb);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +010061
62 if (filter_res == 0)
63 continue;
64
65 *res = prog->res;
66 if (filter_res != -1)
67 res->classid = filter_res;
68
69 ret = tcf_exts_exec(skb, &prog->exts, res);
70 if (ret < 0)
71 continue;
72
73 return ret;
74 }
75
76 return -1;
77}
78
79static int cls_bpf_init(struct tcf_proto *tp)
80{
81 struct cls_bpf_head *head;
82
83 head = kzalloc(sizeof(*head), GFP_KERNEL);
84 if (head == NULL)
85 return -ENOBUFS;
86
John Fastabend1f947bf2014-09-12 20:10:24 -070087 INIT_LIST_HEAD_RCU(&head->plist);
88 rcu_assign_pointer(tp->root, head);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +010089
90 return 0;
91}
92
93static void cls_bpf_delete_prog(struct tcf_proto *tp, struct cls_bpf_prog *prog)
94{
WANG Cong18d02642014-09-25 10:26:37 -070095 tcf_exts_destroy(&prog->exts);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +010096
Alexei Starovoitov7ae457c2014-07-30 20:34:16 -070097 bpf_prog_destroy(prog->filter);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +010098
99 kfree(prog->bpf_ops);
100 kfree(prog);
101}
102
John Fastabend1f947bf2014-09-12 20:10:24 -0700103static void __cls_bpf_delete_prog(struct rcu_head *rcu)
104{
105 struct cls_bpf_prog *prog = container_of(rcu, struct cls_bpf_prog, rcu);
106
107 cls_bpf_delete_prog(prog->tp, prog);
108}
109
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100110static int cls_bpf_delete(struct tcf_proto *tp, unsigned long arg)
111{
Jiri Pirko472f5832014-12-02 18:00:32 +0100112 struct cls_bpf_prog *prog = (struct cls_bpf_prog *) arg;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100113
Jiri Pirko472f5832014-12-02 18:00:32 +0100114 list_del_rcu(&prog->link);
115 tcf_unbind_filter(tp, &prog->res);
116 call_rcu(&prog->rcu, __cls_bpf_delete_prog);
117 return 0;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100118}
119
120static void cls_bpf_destroy(struct tcf_proto *tp)
121{
John Fastabend1f947bf2014-09-12 20:10:24 -0700122 struct cls_bpf_head *head = rtnl_dereference(tp->root);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100123 struct cls_bpf_prog *prog, *tmp;
124
125 list_for_each_entry_safe(prog, tmp, &head->plist, link) {
John Fastabend1f947bf2014-09-12 20:10:24 -0700126 list_del_rcu(&prog->link);
John Fastabend18cdb372014-10-05 21:28:52 -0700127 tcf_unbind_filter(tp, &prog->res);
John Fastabend1f947bf2014-09-12 20:10:24 -0700128 call_rcu(&prog->rcu, __cls_bpf_delete_prog);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100129 }
130
John Fastabend1f947bf2014-09-12 20:10:24 -0700131 RCU_INIT_POINTER(tp->root, NULL);
132 kfree_rcu(head, rcu);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100133}
134
135static unsigned long cls_bpf_get(struct tcf_proto *tp, u32 handle)
136{
John Fastabend1f947bf2014-09-12 20:10:24 -0700137 struct cls_bpf_head *head = rtnl_dereference(tp->root);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100138 struct cls_bpf_prog *prog;
139 unsigned long ret = 0UL;
140
141 if (head == NULL)
142 return 0UL;
143
Jiri Pirko3fe6b492014-12-02 18:00:33 +0100144 list_for_each_entry(prog, &head->plist, link) {
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100145 if (prog->handle == handle) {
146 ret = (unsigned long) prog;
147 break;
148 }
149 }
150
151 return ret;
152}
153
154static void cls_bpf_put(struct tcf_proto *tp, unsigned long f)
155{
156}
157
158static int cls_bpf_modify_existing(struct net *net, struct tcf_proto *tp,
159 struct cls_bpf_prog *prog,
160 unsigned long base, struct nlattr **tb,
Cong Wang2f7ef2f2014-04-25 13:54:06 -0700161 struct nlattr *est, bool ovr)
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100162{
John Fastabend1f947bf2014-09-12 20:10:24 -0700163 struct sock_filter *bpf_ops;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100164 struct tcf_exts exts;
Daniel Borkmannb1fcd352014-05-23 18:43:58 +0200165 struct sock_fprog_kern tmp;
John Fastabend1f947bf2014-09-12 20:10:24 -0700166 struct bpf_prog *fp;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100167 u16 bpf_size, bpf_len;
168 u32 classid;
169 int ret;
170
171 if (!tb[TCA_BPF_OPS_LEN] || !tb[TCA_BPF_OPS] || !tb[TCA_BPF_CLASSID])
172 return -EINVAL;
173
WANG Cong5da57f42013-12-15 20:15:07 -0800174 tcf_exts_init(&exts, TCA_BPF_ACT, TCA_BPF_POLICE);
Cong Wang2f7ef2f2014-04-25 13:54:06 -0700175 ret = tcf_exts_validate(net, tp, tb, est, &exts, ovr);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100176 if (ret < 0)
177 return ret;
178
179 classid = nla_get_u32(tb[TCA_BPF_CLASSID]);
180 bpf_len = nla_get_u16(tb[TCA_BPF_OPS_LEN]);
181 if (bpf_len > BPF_MAXINSNS || bpf_len == 0) {
182 ret = -EINVAL;
183 goto errout;
184 }
185
186 bpf_size = bpf_len * sizeof(*bpf_ops);
187 bpf_ops = kzalloc(bpf_size, GFP_KERNEL);
188 if (bpf_ops == NULL) {
189 ret = -ENOMEM;
190 goto errout;
191 }
192
193 memcpy(bpf_ops, nla_data(tb[TCA_BPF_OPS]), bpf_size);
194
195 tmp.len = bpf_len;
Daniel Borkmannb1fcd352014-05-23 18:43:58 +0200196 tmp.filter = bpf_ops;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100197
Alexei Starovoitov7ae457c2014-07-30 20:34:16 -0700198 ret = bpf_prog_create(&fp, &tmp);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100199 if (ret)
200 goto errout_free;
201
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100202 prog->bpf_len = bpf_len;
203 prog->bpf_ops = bpf_ops;
204 prog->filter = fp;
205 prog->res.classid = classid;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100206
207 tcf_bind_filter(tp, &prog->res, base);
208 tcf_exts_change(tp, &prog->exts, &exts);
209
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100210 return 0;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100211errout_free:
212 kfree(bpf_ops);
213errout:
WANG Cong18d02642014-09-25 10:26:37 -0700214 tcf_exts_destroy(&exts);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100215 return ret;
216}
217
218static u32 cls_bpf_grab_new_handle(struct tcf_proto *tp,
219 struct cls_bpf_head *head)
220{
221 unsigned int i = 0x80000000;
222
223 do {
224 if (++head->hgen == 0x7FFFFFFF)
225 head->hgen = 1;
226 } while (--i > 0 && cls_bpf_get(tp, head->hgen));
227 if (i == 0)
228 pr_err("Insufficient number of handles\n");
229
230 return i;
231}
232
233static int cls_bpf_change(struct net *net, struct sk_buff *in_skb,
234 struct tcf_proto *tp, unsigned long base,
235 u32 handle, struct nlattr **tca,
Cong Wang2f7ef2f2014-04-25 13:54:06 -0700236 unsigned long *arg, bool ovr)
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100237{
John Fastabend1f947bf2014-09-12 20:10:24 -0700238 struct cls_bpf_head *head = rtnl_dereference(tp->root);
239 struct cls_bpf_prog *oldprog = (struct cls_bpf_prog *) *arg;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100240 struct nlattr *tb[TCA_BPF_MAX + 1];
John Fastabend1f947bf2014-09-12 20:10:24 -0700241 struct cls_bpf_prog *prog;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100242 int ret;
243
244 if (tca[TCA_OPTIONS] == NULL)
245 return -EINVAL;
246
247 ret = nla_parse_nested(tb, TCA_BPF_MAX, tca[TCA_OPTIONS], bpf_policy);
248 if (ret < 0)
249 return ret;
250
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100251 prog = kzalloc(sizeof(*prog), GFP_KERNEL);
John Fastabend1f947bf2014-09-12 20:10:24 -0700252 if (!prog)
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100253 return -ENOBUFS;
254
WANG Cong5da57f42013-12-15 20:15:07 -0800255 tcf_exts_init(&prog->exts, TCA_BPF_ACT, TCA_BPF_POLICE);
John Fastabend1f947bf2014-09-12 20:10:24 -0700256
257 if (oldprog) {
258 if (handle && oldprog->handle != handle) {
259 ret = -EINVAL;
260 goto errout;
261 }
262 }
263
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100264 if (handle == 0)
265 prog->handle = cls_bpf_grab_new_handle(tp, head);
266 else
267 prog->handle = handle;
268 if (prog->handle == 0) {
269 ret = -EINVAL;
270 goto errout;
271 }
272
Cong Wang2f7ef2f2014-04-25 13:54:06 -0700273 ret = cls_bpf_modify_existing(net, tp, prog, base, tb, tca[TCA_RATE], ovr);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100274 if (ret < 0)
275 goto errout;
276
John Fastabend1f947bf2014-09-12 20:10:24 -0700277 if (oldprog) {
278 list_replace_rcu(&prog->link, &oldprog->link);
John Fastabend18cdb372014-10-05 21:28:52 -0700279 tcf_unbind_filter(tp, &oldprog->res);
John Fastabend1f947bf2014-09-12 20:10:24 -0700280 call_rcu(&oldprog->rcu, __cls_bpf_delete_prog);
281 } else {
282 list_add_rcu(&prog->link, &head->plist);
283 }
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100284
285 *arg = (unsigned long) prog;
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100286 return 0;
287errout:
John Fastabend1f947bf2014-09-12 20:10:24 -0700288 kfree(prog);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100289
290 return ret;
291}
292
WANG Cong832d1d52014-01-09 16:14:01 -0800293static int cls_bpf_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100294 struct sk_buff *skb, struct tcmsg *tm)
295{
296 struct cls_bpf_prog *prog = (struct cls_bpf_prog *) fh;
297 struct nlattr *nest, *nla;
298
299 if (prog == NULL)
300 return skb->len;
301
302 tm->tcm_handle = prog->handle;
303
304 nest = nla_nest_start(skb, TCA_OPTIONS);
305 if (nest == NULL)
306 goto nla_put_failure;
307
308 if (nla_put_u32(skb, TCA_BPF_CLASSID, prog->res.classid))
309 goto nla_put_failure;
310 if (nla_put_u16(skb, TCA_BPF_OPS_LEN, prog->bpf_len))
311 goto nla_put_failure;
312
313 nla = nla_reserve(skb, TCA_BPF_OPS, prog->bpf_len *
314 sizeof(struct sock_filter));
315 if (nla == NULL)
316 goto nla_put_failure;
317
Yang Yingliang1fab9ab2013-12-10 20:55:30 +0800318 memcpy(nla_data(nla), prog->bpf_ops, nla_len(nla));
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100319
WANG Cong5da57f42013-12-15 20:15:07 -0800320 if (tcf_exts_dump(skb, &prog->exts) < 0)
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100321 goto nla_put_failure;
322
323 nla_nest_end(skb, nest);
324
WANG Cong5da57f42013-12-15 20:15:07 -0800325 if (tcf_exts_dump_stats(skb, &prog->exts) < 0)
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100326 goto nla_put_failure;
327
328 return skb->len;
329
330nla_put_failure:
331 nla_nest_cancel(skb, nest);
332 return -1;
333}
334
335static void cls_bpf_walk(struct tcf_proto *tp, struct tcf_walker *arg)
336{
John Fastabend1f947bf2014-09-12 20:10:24 -0700337 struct cls_bpf_head *head = rtnl_dereference(tp->root);
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100338 struct cls_bpf_prog *prog;
339
Jiri Pirko3fe6b492014-12-02 18:00:33 +0100340 list_for_each_entry(prog, &head->plist, link) {
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100341 if (arg->count < arg->skip)
342 goto skip;
343 if (arg->fn(tp, (unsigned long) prog, arg) < 0) {
344 arg->stop = 1;
345 break;
346 }
347skip:
348 arg->count++;
349 }
350}
351
352static struct tcf_proto_ops cls_bpf_ops __read_mostly = {
353 .kind = "bpf",
354 .owner = THIS_MODULE,
355 .classify = cls_bpf_classify,
356 .init = cls_bpf_init,
357 .destroy = cls_bpf_destroy,
358 .get = cls_bpf_get,
359 .put = cls_bpf_put,
360 .change = cls_bpf_change,
361 .delete = cls_bpf_delete,
362 .walk = cls_bpf_walk,
363 .dump = cls_bpf_dump,
364};
365
366static int __init cls_bpf_init_mod(void)
367{
368 return register_tcf_proto_ops(&cls_bpf_ops);
369}
370
371static void __exit cls_bpf_exit_mod(void)
372{
373 unregister_tcf_proto_ops(&cls_bpf_ops);
374}
375
376module_init(cls_bpf_init_mod);
377module_exit(cls_bpf_exit_mod);