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
;
32 struct tcf_ematch_tree ematches
;
33 struct tcf_result res
;
34 struct list_head link
;
37 static const struct tcf_ext_map basic_ext_map
= {
38 .action
= TCA_BASIC_ACT
,
39 .police
= TCA_BASIC_POLICE
42 static int basic_classify(struct sk_buff
*skb
, const struct tcf_proto
*tp
,
43 struct tcf_result
*res
)
46 struct basic_head
*head
= (struct basic_head
*) tp
->root
;
47 struct basic_filter
*f
;
49 list_for_each_entry(f
, &head
->flist
, link
) {
50 if (!tcf_em_tree_match(skb
, &f
->ematches
, NULL
))
53 r
= tcf_exts_exec(skb
, &f
->exts
, res
);
61 static unsigned long basic_get(struct tcf_proto
*tp
, u32 handle
)
63 unsigned long l
= 0UL;
64 struct basic_head
*head
= (struct basic_head
*) tp
->root
;
65 struct basic_filter
*f
;
70 list_for_each_entry(f
, &head
->flist
, link
)
71 if (f
->handle
== handle
)
72 l
= (unsigned long) f
;
77 static void basic_put(struct tcf_proto
*tp
, unsigned long f
)
81 static int basic_init(struct tcf_proto
*tp
)
83 struct basic_head
*head
;
85 head
= kzalloc(sizeof(*head
), GFP_KERNEL
);
88 INIT_LIST_HEAD(&head
->flist
);
93 static void basic_delete_filter(struct tcf_proto
*tp
, struct basic_filter
*f
)
95 tcf_unbind_filter(tp
, &f
->res
);
96 tcf_exts_destroy(tp
, &f
->exts
);
97 tcf_em_tree_destroy(tp
, &f
->ematches
);
101 static void basic_destroy(struct tcf_proto
*tp
)
103 struct basic_head
*head
= tp
->root
;
104 struct basic_filter
*f
, *n
;
106 list_for_each_entry_safe(f
, n
, &head
->flist
, link
) {
108 basic_delete_filter(tp
, f
);
113 static int basic_delete(struct tcf_proto
*tp
, unsigned long arg
)
115 struct basic_head
*head
= (struct basic_head
*) tp
->root
;
116 struct basic_filter
*t
, *f
= (struct basic_filter
*) arg
;
118 list_for_each_entry(t
, &head
->flist
, link
)
123 basic_delete_filter(tp
, t
);
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
,
142 struct tcf_ematch_tree t
;
144 err
= tcf_exts_validate(net
, tp
, tb
, est
, &e
, &basic_ext_map
);
148 err
= tcf_em_tree_validate(tp
, tb
[TCA_BASIC_EMATCHES
], &t
);
152 if (tb
[TCA_BASIC_CLASSID
]) {
153 f
->res
.classid
= nla_get_u32(tb
[TCA_BASIC_CLASSID
]);
154 tcf_bind_filter(tp
, &f
->res
, base
);
157 tcf_exts_change(tp
, &f
->exts
, &e
);
158 tcf_em_tree_change(tp
, &f
->ematches
, &t
);
162 tcf_exts_destroy(tp
, &e
);
166 static int basic_change(struct net
*net
, struct sk_buff
*in_skb
,
167 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(net
, 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 pr_err("Insufficient number of handles\n");
209 f
->handle
= head
->hgenerator
;
212 err
= basic_set_parms(net
, 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
;
262 if (f
->res
.classid
&&
263 nla_put_u32(skb
, TCA_BASIC_CLASSID
, f
->res
.classid
))
264 goto nla_put_failure
;
266 if (tcf_exts_dump(skb
, &f
->exts
, &basic_ext_map
) < 0 ||
267 tcf_em_tree_dump(skb
, &f
->ematches
, TCA_BASIC_EMATCHES
) < 0)
268 goto nla_put_failure
;
270 nla_nest_end(skb
, nest
);
272 if (tcf_exts_dump_stats(skb
, &f
->exts
, &basic_ext_map
) < 0)
273 goto nla_put_failure
;
278 nla_nest_cancel(skb
, nest
);
282 static struct tcf_proto_ops cls_basic_ops __read_mostly
= {
284 .classify
= basic_classify
,
286 .destroy
= basic_destroy
,
289 .change
= basic_change
,
290 .delete = basic_delete
,
293 .owner
= THIS_MODULE
,
296 static int __init
init_basic(void)
298 return register_tcf_proto_ops(&cls_basic_ops
);
301 static void __exit
exit_basic(void)
303 unregister_tcf_proto_ops(&cls_basic_ops
);
306 module_init(init_basic
)
307 module_exit(exit_basic
)
308 MODULE_LICENSE("GPL");