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 void *basic_get(struct tcf_proto *tp, u32 handle)
61 struct basic_head *head = rtnl_dereference(tp->root);
62 struct basic_filter *f;
64 list_for_each_entry(f, &head->flist, link) {
65 if (f->handle == handle) {
73 static int basic_init(struct tcf_proto *tp)
75 struct basic_head *head;
77 head = kzalloc(sizeof(*head), GFP_KERNEL);
80 INIT_LIST_HEAD(&head->flist);
81 rcu_assign_pointer(tp->root, head);
85 static void basic_delete_filter(struct rcu_head *head)
87 struct basic_filter *f = container_of(head, struct basic_filter, rcu);
89 tcf_exts_destroy(&f->exts);
90 tcf_em_tree_destroy(&f->ematches);
94 static void basic_destroy(struct tcf_proto *tp)
96 struct basic_head *head = rtnl_dereference(tp->root);
97 struct basic_filter *f, *n;
99 list_for_each_entry_safe(f, n, &head->flist, link) {
100 list_del_rcu(&f->link);
101 tcf_unbind_filter(tp, &f->res);
102 call_rcu(&f->rcu, basic_delete_filter);
104 kfree_rcu(head, rcu);
107 static int basic_delete(struct tcf_proto *tp, void *arg, bool *last)
109 struct basic_head *head = rtnl_dereference(tp->root);
110 struct basic_filter *f = arg;
112 list_del_rcu(&f->link);
113 tcf_unbind_filter(tp, &f->res);
114 call_rcu(&f->rcu, basic_delete_filter);
115 *last = list_empty(&head->flist);
119 static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
120 [TCA_BASIC_CLASSID] = { .type = NLA_U32 },
121 [TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
124 static int basic_set_parms(struct net *net, struct tcf_proto *tp,
125 struct basic_filter *f, unsigned long base,
127 struct nlattr *est, bool ovr)
131 err = tcf_exts_validate(net, tp, tb, est, &f->exts, ovr);
135 err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &f->ematches);
139 if (tb[TCA_BASIC_CLASSID]) {
140 f->res.classid = nla_get_u32(tb[TCA_BASIC_CLASSID]);
141 tcf_bind_filter(tp, &f->res, base);
148 static int basic_change(struct net *net, struct sk_buff *in_skb,
149 struct tcf_proto *tp, unsigned long base, u32 handle,
150 struct nlattr **tca, void **arg, bool ovr)
153 struct basic_head *head = rtnl_dereference(tp->root);
154 struct nlattr *tb[TCA_BASIC_MAX + 1];
155 struct basic_filter *fold = (struct basic_filter *) *arg;
156 struct basic_filter *fnew;
158 if (tca[TCA_OPTIONS] == NULL)
161 err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
167 if (handle && fold->handle != handle)
171 fnew = kzalloc(sizeof(*fnew), GFP_KERNEL);
175 err = tcf_exts_init(&fnew->exts, TCA_BASIC_ACT, TCA_BASIC_POLICE);
181 fnew->handle = handle;
183 fnew->handle = fold->handle;
185 unsigned int i = 0x80000000;
187 if (++head->hgenerator == 0x7FFFFFFF)
188 head->hgenerator = 1;
189 } while (--i > 0 && basic_get(tp, head->hgenerator));
192 pr_err("Insufficient number of handles\n");
196 fnew->handle = head->hgenerator;
199 err = basic_set_parms(net, tp, fnew, base, tb, tca[TCA_RATE], ovr);
206 list_replace_rcu(&fold->link, &fnew->link);
207 tcf_unbind_filter(tp, &fold->res);
208 call_rcu(&fold->rcu, basic_delete_filter);
210 list_add_rcu(&fnew->link, &head->flist);
215 tcf_exts_destroy(&fnew->exts);
220 static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
222 struct basic_head *head = rtnl_dereference(tp->root);
223 struct basic_filter *f;
225 list_for_each_entry(f, &head->flist, link) {
226 if (arg->count < arg->skip)
229 if (arg->fn(tp, f, arg) < 0) {
238 static void basic_bind_class(void *fh, u32 classid, unsigned long cl)
240 struct basic_filter *f = fh;
242 if (f && f->res.classid == classid)
246 static int basic_dump(struct net *net, struct tcf_proto *tp, void *fh,
247 struct sk_buff *skb, struct tcmsg *t)
249 struct basic_filter *f = fh;
255 t->tcm_handle = f->handle;
257 nest = nla_nest_start(skb, TCA_OPTIONS);
259 goto nla_put_failure;
261 if (f->res.classid &&
262 nla_put_u32(skb, TCA_BASIC_CLASSID, f->res.classid))
263 goto nla_put_failure;
265 if (tcf_exts_dump(skb, &f->exts) < 0 ||
266 tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
267 goto nla_put_failure;
269 nla_nest_end(skb, nest);
271 if (tcf_exts_dump_stats(skb, &f->exts) < 0)
272 goto nla_put_failure;
277 nla_nest_cancel(skb, nest);
281 static struct tcf_proto_ops cls_basic_ops __read_mostly = {
283 .classify = basic_classify,
285 .destroy = basic_destroy,
287 .change = basic_change,
288 .delete = basic_delete,
291 .bind_class = basic_bind_class,
292 .owner = THIS_MODULE,
295 static int __init init_basic(void)
297 return register_tcf_proto_ops(&cls_basic_ops);
300 static void __exit exit_basic(void)
302 unregister_tcf_proto_ops(&cls_basic_ops);
305 module_init(init_basic)
306 module_exit(exit_basic)
307 MODULE_LICENSE("GPL");