blob: d76a35d0dc85b82ddd9b8f2cc037b1ff0d31f5d5 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * net/sched/cls_basic.c Basic Packet Classifier.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
8 *
9 * Authors: Thomas Graf <tgraf@suug.ch>
10 */
11
Linus Torvalds1da177e2005-04-16 15:20:36 -070012#include <linux/module.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090013#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070014#include <linux/types.h>
15#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#include <linux/string.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070017#include <linux/errno.h>
18#include <linux/rtnetlink.h>
19#include <linux/skbuff.h>
Arnaldo Carvalho de Melodc5fc572007-03-25 23:06:12 -070020#include <net/netlink.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070021#include <net/act_api.h>
22#include <net/pkt_cls.h>
23
Eric Dumazetcc7ec452011-01-19 19:26:56 +000024struct basic_head {
Linus Torvalds1da177e2005-04-16 15:20:36 -070025 u32 hgenerator;
26 struct list_head flist;
27};
28
Eric Dumazetcc7ec452011-01-19 19:26:56 +000029struct basic_filter {
Linus Torvalds1da177e2005-04-16 15:20:36 -070030 u32 handle;
31 struct tcf_exts exts;
32 struct tcf_ematch_tree ematches;
33 struct tcf_result res;
34 struct list_head link;
35};
36
Patrick McHardy52390082008-01-31 18:36:18 -080037static const struct tcf_ext_map basic_ext_map = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070038 .action = TCA_BASIC_ACT,
39 .police = TCA_BASIC_POLICE
40};
41
Eric Dumazetdc7f9f62011-07-05 23:25:42 +000042static int basic_classify(struct sk_buff *skb, const struct tcf_proto *tp,
Linus Torvalds1da177e2005-04-16 15:20:36 -070043 struct tcf_result *res)
44{
45 int r;
46 struct basic_head *head = (struct basic_head *) tp->root;
47 struct basic_filter *f;
48
49 list_for_each_entry(f, &head->flist, link) {
50 if (!tcf_em_tree_match(skb, &f->ematches, NULL))
51 continue;
52 *res = f->res;
53 r = tcf_exts_exec(skb, &f->exts, res);
54 if (r < 0)
55 continue;
56 return r;
57 }
58 return -1;
59}
60
61static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
62{
63 unsigned long l = 0UL;
64 struct basic_head *head = (struct basic_head *) tp->root;
65 struct basic_filter *f;
66
67 if (head == NULL)
68 return 0UL;
69
70 list_for_each_entry(f, &head->flist, link)
71 if (f->handle == handle)
72 l = (unsigned long) f;
73
74 return l;
75}
76
77static void basic_put(struct tcf_proto *tp, unsigned long f)
78{
79}
80
81static int basic_init(struct tcf_proto *tp)
82{
Patrick McHardyd3fa76e2007-03-24 22:13:06 -070083 struct basic_head *head;
84
85 head = kzalloc(sizeof(*head), GFP_KERNEL);
86 if (head == NULL)
87 return -ENOBUFS;
88 INIT_LIST_HEAD(&head->flist);
89 tp->root = head;
Linus Torvalds1da177e2005-04-16 15:20:36 -070090 return 0;
91}
92
Eric Dumazetcc7ec452011-01-19 19:26:56 +000093static void basic_delete_filter(struct tcf_proto *tp, struct basic_filter *f)
Linus Torvalds1da177e2005-04-16 15:20:36 -070094{
95 tcf_unbind_filter(tp, &f->res);
96 tcf_exts_destroy(tp, &f->exts);
97 tcf_em_tree_destroy(tp, &f->ematches);
98 kfree(f);
99}
100
101static void basic_destroy(struct tcf_proto *tp)
102{
Patrick McHardy47a1a1d2008-11-19 08:03:09 +0000103 struct basic_head *head = tp->root;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104 struct basic_filter *f, *n;
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900105
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106 list_for_each_entry_safe(f, n, &head->flist, link) {
107 list_del(&f->link);
108 basic_delete_filter(tp, f);
109 }
Patrick McHardy31ba5482007-03-30 13:36:23 -0700110 kfree(head);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111}
112
113static int basic_delete(struct tcf_proto *tp, unsigned long arg)
114{
115 struct basic_head *head = (struct basic_head *) tp->root;
116 struct basic_filter *t, *f = (struct basic_filter *) arg;
117
118 list_for_each_entry(t, &head->flist, link)
119 if (t == f) {
120 tcf_tree_lock(tp);
121 list_del(&t->link);
122 tcf_tree_unlock(tp);
123 basic_delete_filter(tp, t);
124 return 0;
125 }
126
127 return -ENOENT;
128}
129
Patrick McHardy6fa8c012008-01-23 20:36:12 -0800130static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
131 [TCA_BASIC_CLASSID] = { .type = NLA_U32 },
132 [TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
133};
134
Benjamin LaHaisec1b52732013-01-14 05:15:39 +0000135static int basic_set_parms(struct net *net, struct tcf_proto *tp,
136 struct basic_filter *f, unsigned long base,
137 struct nlattr **tb,
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000138 struct nlattr *est)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139{
140 int err = -EINVAL;
141 struct tcf_exts e;
142 struct tcf_ematch_tree t;
143
Benjamin LaHaisec1b52732013-01-14 05:15:39 +0000144 err = tcf_exts_validate(net, tp, tb, est, &e, &basic_ext_map);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 if (err < 0)
146 return err;
147
Patrick McHardyadd93b62008-01-22 22:11:33 -0800148 err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149 if (err < 0)
150 goto errout;
151
Patrick McHardyadd93b62008-01-22 22:11:33 -0800152 if (tb[TCA_BASIC_CLASSID]) {
Patrick McHardy1587bac2008-01-23 20:35:03 -0800153 f->res.classid = nla_get_u32(tb[TCA_BASIC_CLASSID]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154 tcf_bind_filter(tp, &f->res, base);
155 }
156
157 tcf_exts_change(tp, &f->exts, &e);
158 tcf_em_tree_change(tp, &f->ematches, &t);
159
160 return 0;
161errout:
162 tcf_exts_destroy(tp, &e);
163 return err;
164}
165
Benjamin LaHaisec1b52732013-01-14 05:15:39 +0000166static int basic_change(struct net *net, struct sk_buff *in_skb,
Eric W. Biedermanaf4c6642012-05-25 13:42:45 -0600167 struct tcf_proto *tp, unsigned long base, u32 handle,
Patrick McHardyadd93b62008-01-22 22:11:33 -0800168 struct nlattr **tca, unsigned long *arg)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169{
Patrick McHardycee63722008-01-23 20:33:32 -0800170 int err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171 struct basic_head *head = (struct basic_head *) tp->root;
Patrick McHardyadd93b62008-01-22 22:11:33 -0800172 struct nlattr *tb[TCA_BASIC_MAX + 1];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173 struct basic_filter *f = (struct basic_filter *) *arg;
174
Patrick McHardyadd93b62008-01-22 22:11:33 -0800175 if (tca[TCA_OPTIONS] == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176 return -EINVAL;
177
Patrick McHardy6fa8c012008-01-23 20:36:12 -0800178 err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
179 basic_policy);
Patrick McHardycee63722008-01-23 20:33:32 -0800180 if (err < 0)
181 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182
183 if (f != NULL) {
184 if (handle && f->handle != handle)
185 return -EINVAL;
Benjamin LaHaisec1b52732013-01-14 05:15:39 +0000186 return basic_set_parms(net, tp, f, base, tb, tca[TCA_RATE]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187 }
188
189 err = -ENOBUFS;
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700190 f = kzalloc(sizeof(*f), GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191 if (f == NULL)
192 goto errout;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193
194 err = -EINVAL;
195 if (handle)
196 f->handle = handle;
197 else {
Kim Nordlund658270a2006-09-27 16:19:53 -0700198 unsigned int i = 0x80000000;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199 do {
200 if (++head->hgenerator == 0x7FFFFFFF)
201 head->hgenerator = 1;
202 } while (--i > 0 && basic_get(tp, head->hgenerator));
203
204 if (i <= 0) {
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000205 pr_err("Insufficient number of handles\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206 goto errout;
207 }
208
209 f->handle = head->hgenerator;
210 }
211
Benjamin LaHaisec1b52732013-01-14 05:15:39 +0000212 err = basic_set_parms(net, tp, f, base, tb, tca[TCA_RATE]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213 if (err < 0)
214 goto errout;
215
216 tcf_tree_lock(tp);
217 list_add(&f->link, &head->flist);
218 tcf_tree_unlock(tp);
219 *arg = (unsigned long) f;
220
221 return 0;
222errout:
223 if (*arg == 0UL && f)
224 kfree(f);
225
226 return err;
227}
228
229static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
230{
231 struct basic_head *head = (struct basic_head *) tp->root;
232 struct basic_filter *f;
233
234 list_for_each_entry(f, &head->flist, link) {
235 if (arg->count < arg->skip)
236 goto skip;
237
238 if (arg->fn(tp, (unsigned long) f, arg) < 0) {
239 arg->stop = 1;
240 break;
241 }
242skip:
243 arg->count++;
244 }
245}
246
247static int basic_dump(struct tcf_proto *tp, unsigned long fh,
248 struct sk_buff *skb, struct tcmsg *t)
249{
250 struct basic_filter *f = (struct basic_filter *) fh;
Patrick McHardy4b3550ef2008-01-23 20:34:11 -0800251 struct nlattr *nest;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252
253 if (f == NULL)
254 return skb->len;
255
256 t->tcm_handle = f->handle;
257
Patrick McHardy4b3550ef2008-01-23 20:34:11 -0800258 nest = nla_nest_start(skb, TCA_OPTIONS);
259 if (nest == NULL)
260 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261
David S. Miller1b34ec42012-03-29 05:11:39 -0400262 if (f->res.classid &&
263 nla_put_u32(skb, TCA_BASIC_CLASSID, f->res.classid))
264 goto nla_put_failure;
Thomas Grafe1e284a2005-06-08 15:11:02 -0700265
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266 if (tcf_exts_dump(skb, &f->exts, &basic_ext_map) < 0 ||
267 tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
Patrick McHardyadd93b62008-01-22 22:11:33 -0800268 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269
Patrick McHardy4b3550ef2008-01-23 20:34:11 -0800270 nla_nest_end(skb, nest);
stephen hemminger4c46ee52010-11-04 11:47:04 +0000271
272 if (tcf_exts_dump_stats(skb, &f->exts, &basic_ext_map) < 0)
273 goto nla_put_failure;
274
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275 return skb->len;
276
Patrick McHardyadd93b62008-01-22 22:11:33 -0800277nla_put_failure:
Patrick McHardy4b3550ef2008-01-23 20:34:11 -0800278 nla_nest_cancel(skb, nest);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279 return -1;
280}
281
Patrick McHardy2eb9d752008-01-22 22:10:42 -0800282static struct tcf_proto_ops cls_basic_ops __read_mostly = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283 .kind = "basic",
284 .classify = basic_classify,
285 .init = basic_init,
286 .destroy = basic_destroy,
287 .get = basic_get,
288 .put = basic_put,
289 .change = basic_change,
290 .delete = basic_delete,
291 .walk = basic_walk,
292 .dump = basic_dump,
293 .owner = THIS_MODULE,
294};
295
296static int __init init_basic(void)
297{
298 return register_tcf_proto_ops(&cls_basic_ops);
299}
300
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900301static void __exit exit_basic(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700302{
303 unregister_tcf_proto_ops(&cls_basic_ops);
304}
305
306module_init(init_basic)
307module_exit(exit_basic)
308MODULE_LICENSE("GPL");
309