2 * net/sched/cls_basic.c Basic Packet Classifier.
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.
9 * Authors: Thomas Graf <tgraf@suug.ch>
12 #include <linux/module.h>
13 #include <linux/types.h>
14 #include <linux/kernel.h>
15 #include <linux/string.h>
17 #include <linux/errno.h>
18 #include <linux/rtnetlink.h>
19 #include <linux/skbuff.h>
20 #include <net/act_api.h>
21 #include <net/pkt_cls.h>
26 struct list_head flist;
33 struct tcf_ematch_tree ematches;
34 struct tcf_result res;
35 struct list_head link;
38 static struct tcf_ext_map basic_ext_map = {
39 .action = TCA_BASIC_ACT,
40 .police = TCA_BASIC_POLICE
43 static int basic_classify(struct sk_buff *skb, struct tcf_proto *tp,
44 struct tcf_result *res)
47 struct basic_head *head = (struct basic_head *) tp->root;
48 struct basic_filter *f;
50 list_for_each_entry(f, &head->flist, link) {
51 if (!tcf_em_tree_match(skb, &f->ematches, NULL))
54 r = tcf_exts_exec(skb, &f->exts, res);
62 static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
64 unsigned long l = 0UL;
65 struct basic_head *head = (struct basic_head *) tp->root;
66 struct basic_filter *f;
71 list_for_each_entry(f, &head->flist, link)
72 if (f->handle == handle)
73 l = (unsigned long) f;
78 static void basic_put(struct tcf_proto *tp, unsigned long f)
82 static int basic_init(struct tcf_proto *tp)
87 static inline void basic_delete_filter(struct tcf_proto *tp,
88 struct basic_filter *f)
90 tcf_unbind_filter(tp, &f->res);
91 tcf_exts_destroy(tp, &f->exts);
92 tcf_em_tree_destroy(tp, &f->ematches);
96 static void basic_destroy(struct tcf_proto *tp)
98 struct basic_head *head = (struct basic_head *) xchg(&tp->root, NULL);
99 struct basic_filter *f, *n;
101 list_for_each_entry_safe(f, n, &head->flist, link) {
103 basic_delete_filter(tp, f);
107 static int basic_delete(struct tcf_proto *tp, unsigned long arg)
109 struct basic_head *head = (struct basic_head *) tp->root;
110 struct basic_filter *t, *f = (struct basic_filter *) arg;
112 list_for_each_entry(t, &head->flist, link)
117 basic_delete_filter(tp, t);
124 static inline int basic_set_parms(struct tcf_proto *tp, struct basic_filter *f,
125 unsigned long base, struct rtattr **tb,
130 struct tcf_ematch_tree t;
132 if (tb[TCA_BASIC_CLASSID-1])
133 if (RTA_PAYLOAD(tb[TCA_BASIC_CLASSID-1]) < sizeof(u32))
136 err = tcf_exts_validate(tp, tb, est, &e, &basic_ext_map);
140 err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES-1], &t);
144 if (tb[TCA_BASIC_CLASSID-1]) {
145 f->res.classid = *(u32*)RTA_DATA(tb[TCA_BASIC_CLASSID-1]);
146 tcf_bind_filter(tp, &f->res, base);
149 tcf_exts_change(tp, &f->exts, &e);
150 tcf_em_tree_change(tp, &f->ematches, &t);
154 tcf_exts_destroy(tp, &e);
158 static int basic_change(struct tcf_proto *tp, unsigned long base, u32 handle,
159 struct rtattr **tca, unsigned long *arg)
162 struct basic_head *head = (struct basic_head *) tp->root;
163 struct rtattr *tb[TCA_BASIC_MAX];
164 struct basic_filter *f = (struct basic_filter *) *arg;
166 if (tca[TCA_OPTIONS-1] == NULL)
169 if (rtattr_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS-1]) < 0)
173 if (handle && f->handle != handle)
175 return basic_set_parms(tp, f, base, tb, tca[TCA_RATE-1]);
180 head = kzalloc(sizeof(*head), GFP_KERNEL);
184 INIT_LIST_HEAD(&head->flist);
188 f = kzalloc(sizeof(*f), GFP_KERNEL);
196 unsigned int i = 0x80000000;
198 if (++head->hgenerator == 0x7FFFFFFF)
199 head->hgenerator = 1;
200 } while (--i > 0 && basic_get(tp, head->hgenerator));
203 printk(KERN_ERR "Insufficient number of handles\n");
207 f->handle = head->hgenerator;
210 err = basic_set_parms(tp, f, base, tb, tca[TCA_RATE-1]);
215 list_add(&f->link, &head->flist);
217 *arg = (unsigned long) f;
221 if (*arg == 0UL && f)
227 static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
229 struct basic_head *head = (struct basic_head *) tp->root;
230 struct basic_filter *f;
232 list_for_each_entry(f, &head->flist, link) {
233 if (arg->count < arg->skip)
236 if (arg->fn(tp, (unsigned long) f, arg) < 0) {
245 static int basic_dump(struct tcf_proto *tp, unsigned long fh,
246 struct sk_buff *skb, struct tcmsg *t)
248 struct basic_filter *f = (struct basic_filter *) fh;
249 unsigned char *b = skb->tail;
255 t->tcm_handle = f->handle;
257 rta = (struct rtattr *) b;
258 RTA_PUT(skb, TCA_OPTIONS, 0, NULL);
261 RTA_PUT(skb, TCA_BASIC_CLASSID, sizeof(u32), &f->res.classid);
263 if (tcf_exts_dump(skb, &f->exts, &basic_ext_map) < 0 ||
264 tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
267 rta->rta_len = (skb->tail - b);
271 skb_trim(skb, b - skb->data);
275 static struct tcf_proto_ops cls_basic_ops = {
277 .classify = basic_classify,
279 .destroy = basic_destroy,
282 .change = basic_change,
283 .delete = basic_delete,
286 .owner = THIS_MODULE,
289 static int __init init_basic(void)
291 return register_tcf_proto_ops(&cls_basic_ops);
294 static void __exit exit_basic(void)
296 unregister_tcf_proto_ops(&cls_basic_ops);
299 module_init(init_basic)
300 module_exit(exit_basic)
301 MODULE_LICENSE("GPL");