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 int basic_init(struct tcf_proto
*tp
)
77 struct basic_head
*head
;
79 head
= kzalloc(sizeof(*head
), GFP_KERNEL
);
82 INIT_LIST_HEAD(&head
->flist
);
83 rcu_assign_pointer(tp
->root
, head
);
87 static void basic_delete_filter(struct rcu_head
*head
)
89 struct basic_filter
*f
= container_of(head
, struct basic_filter
, rcu
);
91 tcf_exts_destroy(&f
->exts
);
92 tcf_em_tree_destroy(&f
->ematches
);
96 static void basic_destroy(struct tcf_proto
*tp
)
98 struct basic_head
*head
= rtnl_dereference(tp
->root
);
99 struct basic_filter
*f
, *n
;
101 list_for_each_entry_safe(f
, n
, &head
->flist
, link
) {
102 list_del_rcu(&f
->link
);
103 tcf_unbind_filter(tp
, &f
->res
);
104 call_rcu(&f
->rcu
, basic_delete_filter
);
106 RCU_INIT_POINTER(tp
->root
, NULL
);
107 kfree_rcu(head
, rcu
);
110 static int basic_delete(struct tcf_proto
*tp
, unsigned long arg
)
112 struct basic_filter
*f
= (struct basic_filter
*) arg
;
114 list_del_rcu(&f
->link
);
115 tcf_unbind_filter(tp
, &f
->res
);
116 call_rcu(&f
->rcu
, basic_delete_filter
);
120 static const struct nla_policy basic_policy
[TCA_BASIC_MAX
+ 1] = {
121 [TCA_BASIC_CLASSID
] = { .type
= NLA_U32
},
122 [TCA_BASIC_EMATCHES
] = { .type
= NLA_NESTED
},
125 static int basic_set_parms(struct net
*net
, struct tcf_proto
*tp
,
126 struct basic_filter
*f
, unsigned long base
,
128 struct nlattr
*est
, bool ovr
)
132 struct tcf_ematch_tree t
;
134 tcf_exts_init(&e
, TCA_BASIC_ACT
, TCA_BASIC_POLICE
);
135 err
= tcf_exts_validate(net
, tp
, tb
, est
, &e
, ovr
);
139 err
= tcf_em_tree_validate(tp
, tb
[TCA_BASIC_EMATCHES
], &t
);
143 if (tb
[TCA_BASIC_CLASSID
]) {
144 f
->res
.classid
= nla_get_u32(tb
[TCA_BASIC_CLASSID
]);
145 tcf_bind_filter(tp
, &f
->res
, base
);
148 tcf_exts_change(tp
, &f
->exts
, &e
);
149 tcf_em_tree_change(tp
, &f
->ematches
, &t
);
154 tcf_exts_destroy(&e
);
158 static int basic_change(struct net
*net
, struct sk_buff
*in_skb
,
159 struct tcf_proto
*tp
, unsigned long base
, u32 handle
,
160 struct nlattr
**tca
, unsigned long *arg
, bool ovr
)
163 struct basic_head
*head
= rtnl_dereference(tp
->root
);
164 struct nlattr
*tb
[TCA_BASIC_MAX
+ 1];
165 struct basic_filter
*fold
= (struct basic_filter
*) *arg
;
166 struct basic_filter
*fnew
;
168 if (tca
[TCA_OPTIONS
] == NULL
)
171 err
= nla_parse_nested(tb
, TCA_BASIC_MAX
, tca
[TCA_OPTIONS
],
177 if (handle
&& fold
->handle
!= handle
)
181 fnew
= kzalloc(sizeof(*fnew
), GFP_KERNEL
);
185 tcf_exts_init(&fnew
->exts
, TCA_BASIC_ACT
, TCA_BASIC_POLICE
);
188 fnew
->handle
= handle
;
190 fnew
->handle
= fold
->handle
;
192 unsigned int i
= 0x80000000;
194 if (++head
->hgenerator
== 0x7FFFFFFF)
195 head
->hgenerator
= 1;
196 } while (--i
> 0 && basic_get(tp
, head
->hgenerator
));
199 pr_err("Insufficient number of handles\n");
203 fnew
->handle
= head
->hgenerator
;
206 err
= basic_set_parms(net
, tp
, fnew
, base
, tb
, tca
[TCA_RATE
], ovr
);
210 *arg
= (unsigned long)fnew
;
213 list_replace_rcu(&fold
->link
, &fnew
->link
);
214 tcf_unbind_filter(tp
, &fold
->res
);
215 call_rcu(&fold
->rcu
, basic_delete_filter
);
217 list_add_rcu(&fnew
->link
, &head
->flist
);
226 static void basic_walk(struct tcf_proto
*tp
, struct tcf_walker
*arg
)
228 struct basic_head
*head
= rtnl_dereference(tp
->root
);
229 struct basic_filter
*f
;
231 list_for_each_entry(f
, &head
->flist
, link
) {
232 if (arg
->count
< arg
->skip
)
235 if (arg
->fn(tp
, (unsigned long) f
, arg
) < 0) {
244 static int basic_dump(struct net
*net
, struct tcf_proto
*tp
, unsigned long fh
,
245 struct sk_buff
*skb
, struct tcmsg
*t
)
247 struct basic_filter
*f
= (struct basic_filter
*) fh
;
253 t
->tcm_handle
= f
->handle
;
255 nest
= nla_nest_start(skb
, TCA_OPTIONS
);
257 goto nla_put_failure
;
259 if (f
->res
.classid
&&
260 nla_put_u32(skb
, TCA_BASIC_CLASSID
, f
->res
.classid
))
261 goto nla_put_failure
;
263 if (tcf_exts_dump(skb
, &f
->exts
) < 0 ||
264 tcf_em_tree_dump(skb
, &f
->ematches
, TCA_BASIC_EMATCHES
) < 0)
265 goto nla_put_failure
;
267 nla_nest_end(skb
, nest
);
269 if (tcf_exts_dump_stats(skb
, &f
->exts
) < 0)
270 goto nla_put_failure
;
275 nla_nest_cancel(skb
, nest
);
279 static struct tcf_proto_ops cls_basic_ops __read_mostly
= {
281 .classify
= basic_classify
,
283 .destroy
= basic_destroy
,
285 .change
= basic_change
,
286 .delete = basic_delete
,
289 .owner
= THIS_MODULE
,
292 static int __init
init_basic(void)
294 return register_tcf_proto_ops(&cls_basic_ops
);
297 static void __exit
exit_basic(void)
299 unregister_tcf_proto_ops(&cls_basic_ops
);
302 module_init(init_basic
)
303 module_exit(exit_basic
)
304 MODULE_LICENSE("GPL");