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/slab.h>
14 #include <linux/types.h>
15 #include <linux/kernel.h>
16 #include <linux/string.h>
17 #include <linux/errno.h>
18 #include <linux/rtnetlink.h>
19 #include <linux/skbuff.h>
20 #include <net/netlink.h>
21 #include <net/act_api.h>
22 #include <net/pkt_cls.h>
26 struct list_head flist;
33 struct tcf_ematch_tree ematches;
34 struct tcf_result res;
36 struct list_head link;
40 static int basic_classify(struct sk_buff *skb, const struct tcf_proto *tp,
41 struct tcf_result *res)
44 struct basic_head *head = rcu_dereference_bh(tp->root);
45 struct basic_filter *f;
47 list_for_each_entry_rcu(f, &head->flist, link) {
48 if (!tcf_em_tree_match(skb, &f->ematches, NULL))
51 r = tcf_exts_exec(skb, &f->exts, res);
59 static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
61 unsigned long l = 0UL;
62 struct basic_head *head = rtnl_dereference(tp->root);
63 struct basic_filter *f;
68 list_for_each_entry(f, &head->flist, link)
69 if (f->handle == handle)
70 l = (unsigned long) f;
75 static void basic_put(struct tcf_proto *tp, unsigned long f)
79 static int basic_init(struct tcf_proto *tp)
81 struct basic_head *head;
83 head = kzalloc(sizeof(*head), GFP_KERNEL);
86 INIT_LIST_HEAD(&head->flist);
87 rcu_assign_pointer(tp->root, head);
91 static void basic_delete_filter(struct rcu_head *head)
93 struct basic_filter *f = container_of(head, struct basic_filter, rcu);
95 tcf_exts_destroy(&f->exts);
96 tcf_em_tree_destroy(&f->ematches);
100 static void basic_destroy(struct tcf_proto *tp)
102 struct basic_head *head = rtnl_dereference(tp->root);
103 struct basic_filter *f, *n;
105 list_for_each_entry_safe(f, n, &head->flist, link) {
106 list_del_rcu(&f->link);
107 tcf_unbind_filter(tp, &f->res);
108 call_rcu(&f->rcu, basic_delete_filter);
110 RCU_INIT_POINTER(tp->root, NULL);
111 kfree_rcu(head, rcu);
114 static int basic_delete(struct tcf_proto *tp, unsigned long arg)
116 struct basic_head *head = rtnl_dereference(tp->root);
117 struct basic_filter *t, *f = (struct basic_filter *) arg;
119 list_for_each_entry(t, &head->flist, link)
121 list_del_rcu(&t->link);
122 tcf_unbind_filter(tp, &t->res);
123 call_rcu(&t->rcu, basic_delete_filter);
130 static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
131 [TCA_BASIC_CLASSID] = { .type = NLA_U32 },
132 [TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
135 static int basic_set_parms(struct net *net, struct tcf_proto *tp,
136 struct basic_filter *f, unsigned long base,
138 struct nlattr *est, bool ovr)
142 struct tcf_ematch_tree t;
144 tcf_exts_init(&e, TCA_BASIC_ACT, TCA_BASIC_POLICE);
145 err = tcf_exts_validate(net, tp, tb, est, &e, ovr);
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);
164 tcf_exts_destroy(&e);
168 static int basic_change(struct net *net, struct sk_buff *in_skb,
169 struct tcf_proto *tp, unsigned long base, u32 handle,
170 struct nlattr **tca, unsigned long *arg, bool ovr)
173 struct basic_head *head = rtnl_dereference(tp->root);
174 struct nlattr *tb[TCA_BASIC_MAX + 1];
175 struct basic_filter *fold = (struct basic_filter *) *arg;
176 struct basic_filter *fnew;
178 if (tca[TCA_OPTIONS] == NULL)
181 err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
187 if (handle && fold->handle != handle)
192 fnew = kzalloc(sizeof(*fnew), GFP_KERNEL);
196 tcf_exts_init(&fnew->exts, TCA_BASIC_ACT, TCA_BASIC_POLICE);
199 fnew->handle = handle;
201 fnew->handle = fold->handle;
203 unsigned int i = 0x80000000;
205 if (++head->hgenerator == 0x7FFFFFFF)
206 head->hgenerator = 1;
207 } while (--i > 0 && basic_get(tp, head->hgenerator));
210 pr_err("Insufficient number of handles\n");
214 fnew->handle = head->hgenerator;
217 err = basic_set_parms(net, tp, fnew, base, tb, tca[TCA_RATE], ovr);
221 *arg = (unsigned long)fnew;
224 list_replace_rcu(&fold->link, &fnew->link);
225 tcf_unbind_filter(tp, &fold->res);
226 call_rcu(&fold->rcu, basic_delete_filter);
228 list_add_rcu(&fnew->link, &head->flist);
237 static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
239 struct basic_head *head = rtnl_dereference(tp->root);
240 struct basic_filter *f;
242 list_for_each_entry(f, &head->flist, link) {
243 if (arg->count < arg->skip)
246 if (arg->fn(tp, (unsigned long) f, arg) < 0) {
255 static int basic_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
256 struct sk_buff *skb, struct tcmsg *t)
258 struct basic_filter *f = (struct basic_filter *) fh;
264 t->tcm_handle = f->handle;
266 nest = nla_nest_start(skb, TCA_OPTIONS);
268 goto nla_put_failure;
270 if (f->res.classid &&
271 nla_put_u32(skb, TCA_BASIC_CLASSID, f->res.classid))
272 goto nla_put_failure;
274 if (tcf_exts_dump(skb, &f->exts) < 0 ||
275 tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
276 goto nla_put_failure;
278 nla_nest_end(skb, nest);
280 if (tcf_exts_dump_stats(skb, &f->exts) < 0)
281 goto nla_put_failure;
286 nla_nest_cancel(skb, nest);
290 static struct tcf_proto_ops cls_basic_ops __read_mostly = {
292 .classify = basic_classify,
294 .destroy = basic_destroy,
297 .change = basic_change,
298 .delete = basic_delete,
301 .owner = THIS_MODULE,
304 static int __init init_basic(void)
306 return register_tcf_proto_ops(&cls_basic_ops);
309 static void __exit exit_basic(void)
311 unregister_tcf_proto_ops(&cls_basic_ops);
314 module_init(init_basic)
315 module_exit(exit_basic)
316 MODULE_LICENSE("GPL");