blob: 0c872a76c4b005f787ac2b5dcd20c1f2c0ed4004 [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>
13#include <linux/types.h>
14#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070015#include <linux/string.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#include <linux/errno.h>
17#include <linux/rtnetlink.h>
18#include <linux/skbuff.h>
Arnaldo Carvalho de Melodc5fc572007-03-25 23:06:12 -070019#include <net/netlink.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070020#include <net/act_api.h>
21#include <net/pkt_cls.h>
22
23struct basic_head
24{
25 u32 hgenerator;
26 struct list_head flist;
27};
28
29struct basic_filter
30{
31 u32 handle;
32 struct tcf_exts exts;
33 struct tcf_ematch_tree ematches;
34 struct tcf_result res;
35 struct list_head link;
36};
37
38static struct tcf_ext_map basic_ext_map = {
39 .action = TCA_BASIC_ACT,
40 .police = TCA_BASIC_POLICE
41};
42
43static int basic_classify(struct sk_buff *skb, struct tcf_proto *tp,
44 struct tcf_result *res)
45{
46 int r;
47 struct basic_head *head = (struct basic_head *) tp->root;
48 struct basic_filter *f;
49
50 list_for_each_entry(f, &head->flist, link) {
51 if (!tcf_em_tree_match(skb, &f->ematches, NULL))
52 continue;
53 *res = f->res;
54 r = tcf_exts_exec(skb, &f->exts, res);
55 if (r < 0)
56 continue;
57 return r;
58 }
59 return -1;
60}
61
62static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
63{
64 unsigned long l = 0UL;
65 struct basic_head *head = (struct basic_head *) tp->root;
66 struct basic_filter *f;
67
68 if (head == NULL)
69 return 0UL;
70
71 list_for_each_entry(f, &head->flist, link)
72 if (f->handle == handle)
73 l = (unsigned long) f;
74
75 return l;
76}
77
78static void basic_put(struct tcf_proto *tp, unsigned long f)
79{
80}
81
82static int basic_init(struct tcf_proto *tp)
83{
Patrick McHardyd3fa76e2007-03-24 22:13:06 -070084 struct basic_head *head;
85
86 head = kzalloc(sizeof(*head), GFP_KERNEL);
87 if (head == NULL)
88 return -ENOBUFS;
89 INIT_LIST_HEAD(&head->flist);
90 tp->root = head;
Linus Torvalds1da177e2005-04-16 15:20:36 -070091 return 0;
92}
93
94static inline void basic_delete_filter(struct tcf_proto *tp,
95 struct basic_filter *f)
96{
97 tcf_unbind_filter(tp, &f->res);
98 tcf_exts_destroy(tp, &f->exts);
99 tcf_em_tree_destroy(tp, &f->ematches);
100 kfree(f);
101}
102
103static void basic_destroy(struct tcf_proto *tp)
104{
105 struct basic_head *head = (struct basic_head *) xchg(&tp->root, NULL);
106 struct basic_filter *f, *n;
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900107
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108 list_for_each_entry_safe(f, n, &head->flist, link) {
109 list_del(&f->link);
110 basic_delete_filter(tp, f);
111 }
Patrick McHardy31ba5482007-03-30 13:36:23 -0700112 kfree(head);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113}
114
115static int basic_delete(struct tcf_proto *tp, unsigned long arg)
116{
117 struct basic_head *head = (struct basic_head *) tp->root;
118 struct basic_filter *t, *f = (struct basic_filter *) arg;
119
120 list_for_each_entry(t, &head->flist, link)
121 if (t == f) {
122 tcf_tree_lock(tp);
123 list_del(&t->link);
124 tcf_tree_unlock(tp);
125 basic_delete_filter(tp, t);
126 return 0;
127 }
128
129 return -ENOENT;
130}
131
132static inline int basic_set_parms(struct tcf_proto *tp, struct basic_filter *f,
Patrick McHardyadd93b62008-01-22 22:11:33 -0800133 unsigned long base, struct nlattr **tb,
134 struct nlattr *est)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700135{
136 int err = -EINVAL;
137 struct tcf_exts e;
138 struct tcf_ematch_tree t;
139
Patrick McHardyadd93b62008-01-22 22:11:33 -0800140 if (tb[TCA_BASIC_CLASSID])
141 if (nla_len(tb[TCA_BASIC_CLASSID]) < sizeof(u32))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 return err;
143
144 err = tcf_exts_validate(tp, tb, est, &e, &basic_ext_map);
145 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
166static int basic_change(struct tcf_proto *tp, unsigned long base, u32 handle,
Patrick McHardyadd93b62008-01-22 22:11:33 -0800167 struct nlattr **tca, unsigned long *arg)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168{
Patrick McHardycee63722008-01-23 20:33:32 -0800169 int err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170 struct basic_head *head = (struct basic_head *) tp->root;
Patrick McHardyadd93b62008-01-22 22:11:33 -0800171 struct nlattr *tb[TCA_BASIC_MAX + 1];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 struct basic_filter *f = (struct basic_filter *) *arg;
173
Patrick McHardyadd93b62008-01-22 22:11:33 -0800174 if (tca[TCA_OPTIONS] == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 return -EINVAL;
176
Patrick McHardycee63722008-01-23 20:33:32 -0800177 err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS], NULL);
178 if (err < 0)
179 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180
181 if (f != NULL) {
182 if (handle && f->handle != handle)
183 return -EINVAL;
Patrick McHardyadd93b62008-01-22 22:11:33 -0800184 return basic_set_parms(tp, f, base, tb, tca[TCA_RATE]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700185 }
186
187 err = -ENOBUFS;
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700188 f = kzalloc(sizeof(*f), GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700189 if (f == NULL)
190 goto errout;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191
192 err = -EINVAL;
193 if (handle)
194 f->handle = handle;
195 else {
Kim Nordlund658270a2006-09-27 16:19:53 -0700196 unsigned int i = 0x80000000;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197 do {
198 if (++head->hgenerator == 0x7FFFFFFF)
199 head->hgenerator = 1;
200 } while (--i > 0 && basic_get(tp, head->hgenerator));
201
202 if (i <= 0) {
203 printk(KERN_ERR "Insufficient number of handles\n");
204 goto errout;
205 }
206
207 f->handle = head->hgenerator;
208 }
209
Patrick McHardyadd93b62008-01-22 22:11:33 -0800210 err = basic_set_parms(tp, f, base, tb, tca[TCA_RATE]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700211 if (err < 0)
212 goto errout;
213
214 tcf_tree_lock(tp);
215 list_add(&f->link, &head->flist);
216 tcf_tree_unlock(tp);
217 *arg = (unsigned long) f;
218
219 return 0;
220errout:
221 if (*arg == 0UL && f)
222 kfree(f);
223
224 return err;
225}
226
227static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
228{
229 struct basic_head *head = (struct basic_head *) tp->root;
230 struct basic_filter *f;
231
232 list_for_each_entry(f, &head->flist, link) {
233 if (arg->count < arg->skip)
234 goto skip;
235
236 if (arg->fn(tp, (unsigned long) f, arg) < 0) {
237 arg->stop = 1;
238 break;
239 }
240skip:
241 arg->count++;
242 }
243}
244
245static int basic_dump(struct tcf_proto *tp, unsigned long fh,
246 struct sk_buff *skb, struct tcmsg *t)
247{
248 struct basic_filter *f = (struct basic_filter *) fh;
Patrick McHardy4b3550ef2008-01-23 20:34:11 -0800249 struct nlattr *nest;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250
251 if (f == NULL)
252 return skb->len;
253
254 t->tcm_handle = f->handle;
255
Patrick McHardy4b3550ef2008-01-23 20:34:11 -0800256 nest = nla_nest_start(skb, TCA_OPTIONS);
257 if (nest == NULL)
258 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259
Thomas Grafe1e284a2005-06-08 15:11:02 -0700260 if (f->res.classid)
Patrick McHardy24beeab2008-01-23 20:34:48 -0800261 NLA_PUT_U32(skb, TCA_BASIC_CLASSID, f->res.classid);
Thomas Grafe1e284a2005-06-08 15:11:02 -0700262
Linus Torvalds1da177e2005-04-16 15:20:36 -0700263 if (tcf_exts_dump(skb, &f->exts, &basic_ext_map) < 0 ||
264 tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
Patrick McHardyadd93b62008-01-22 22:11:33 -0800265 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266
Patrick McHardy4b3550ef2008-01-23 20:34:11 -0800267 nla_nest_end(skb, nest);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700268 return skb->len;
269
Patrick McHardyadd93b62008-01-22 22:11:33 -0800270nla_put_failure:
Patrick McHardy4b3550ef2008-01-23 20:34:11 -0800271 nla_nest_cancel(skb, nest);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272 return -1;
273}
274
Patrick McHardy2eb9d752008-01-22 22:10:42 -0800275static struct tcf_proto_ops cls_basic_ops __read_mostly = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276 .kind = "basic",
277 .classify = basic_classify,
278 .init = basic_init,
279 .destroy = basic_destroy,
280 .get = basic_get,
281 .put = basic_put,
282 .change = basic_change,
283 .delete = basic_delete,
284 .walk = basic_walk,
285 .dump = basic_dump,
286 .owner = THIS_MODULE,
287};
288
289static int __init init_basic(void)
290{
291 return register_tcf_proto_ops(&cls_basic_ops);
292}
293
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900294static void __exit exit_basic(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700295{
296 unregister_tcf_proto_ops(&cls_basic_ops);
297}
298
299module_init(init_basic)
300module_exit(exit_basic)
301MODULE_LICENSE("GPL");
302