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>
16 #include <linux/errno.h>
17 #include <linux/rtnetlink.h>
18 #include <linux/skbuff.h>
19 #include <net/netlink.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 const 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)
84 struct basic_head *head;
86 head = kzalloc(sizeof(*head), GFP_KERNEL);
89 INIT_LIST_HEAD(&head->flist);
94 static inline void basic_delete_filter(struct tcf_proto *tp,
95 struct basic_filter *f)
97 tcf_unbind_filter(tp, &f->res);
98 tcf_exts_destroy(tp, &f->exts);
99 tcf_em_tree_destroy(tp, &f->ematches);
103 static void basic_destroy(struct tcf_proto *tp)
105 struct basic_head *head = tp->root;
106 struct basic_filter *f, *n;
108 list_for_each_entry_safe(f, n, &head->flist, link) {
110 basic_delete_filter(tp, f);
115 static int basic_delete(struct tcf_proto *tp, unsigned long arg)
117 struct basic_head *head = (struct basic_head *) tp->root;
118 struct basic_filter *t, *f = (struct basic_filter *) arg;
120 list_for_each_entry(t, &head->flist, link)
125 basic_delete_filter(tp, t);
132 static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
133 [TCA_BASIC_CLASSID] = { .type = NLA_U32 },
134 [TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
137 static inline int basic_set_parms(struct tcf_proto *tp, struct basic_filter *f,
138 unsigned long base, struct nlattr **tb,
143 struct tcf_ematch_tree t;
145 err = tcf_exts_validate(tp, tb, est, &e, &basic_ext_map);
149 err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &t);
153 if (tb[TCA_BASIC_CLASSID]) {
154 f->res.classid = nla_get_u32(tb[TCA_BASIC_CLASSID]);
155 tcf_bind_filter(tp, &f->res, base);
158 tcf_exts_change(tp, &f->exts, &e);
159 tcf_em_tree_change(tp, &f->ematches, &t);
163 tcf_exts_destroy(tp, &e);
167 static int basic_change(struct tcf_proto *tp, unsigned long base, u32 handle,
168 struct nlattr **tca, unsigned long *arg)
171 struct basic_head *head = (struct basic_head *) tp->root;
172 struct nlattr *tb[TCA_BASIC_MAX + 1];
173 struct basic_filter *f = (struct basic_filter *) *arg;
175 if (tca[TCA_OPTIONS] == NULL)
178 err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
184 if (handle && f->handle != handle)
186 return basic_set_parms(tp, f, base, tb, tca[TCA_RATE]);
190 f = kzalloc(sizeof(*f), GFP_KERNEL);
198 unsigned int i = 0x80000000;
200 if (++head->hgenerator == 0x7FFFFFFF)
201 head->hgenerator = 1;
202 } while (--i > 0 && basic_get(tp, head->hgenerator));
205 printk(KERN_ERR "Insufficient number of handles\n");
209 f->handle = head->hgenerator;
212 err = basic_set_parms(tp, f, base, tb, tca[TCA_RATE]);
217 list_add(&f->link, &head->flist);
219 *arg = (unsigned long) f;
223 if (*arg == 0UL && f)
229 static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
231 struct basic_head *head = (struct basic_head *) tp->root;
232 struct basic_filter *f;
234 list_for_each_entry(f, &head->flist, link) {
235 if (arg->count < arg->skip)
238 if (arg->fn(tp, (unsigned long) f, arg) < 0) {
247 static int basic_dump(struct tcf_proto *tp, unsigned long fh,
248 struct sk_buff *skb, struct tcmsg *t)
250 struct basic_filter *f = (struct basic_filter *) fh;
256 t->tcm_handle = f->handle;
258 nest = nla_nest_start(skb, TCA_OPTIONS);
260 goto nla_put_failure;
263 NLA_PUT_U32(skb, TCA_BASIC_CLASSID, f->res.classid);
265 if (tcf_exts_dump(skb, &f->exts, &basic_ext_map) < 0 ||
266 tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
267 goto nla_put_failure;
269 nla_nest_end(skb, nest);
273 nla_nest_cancel(skb, nest);
277 static struct tcf_proto_ops cls_basic_ops __read_mostly = {
279 .classify = basic_classify,
281 .destroy = basic_destroy,
284 .change = basic_change,
285 .delete = basic_delete,
288 .owner = THIS_MODULE,
291 static int __init init_basic(void)
293 return register_tcf_proto_ops(&cls_basic_ops);
296 static void __exit exit_basic(void)
298 unregister_tcf_proto_ops(&cls_basic_ops);
301 module_init(init_basic)
302 module_exit(exit_basic)
303 MODULE_LICENSE("GPL");