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/config.h>
13 #include <linux/module.h>
14 #include <linux/types.h>
15 #include <linux/kernel.h>
16 #include <linux/sched.h>
17 #include <linux/string.h>
19 #include <linux/errno.h>
20 #include <linux/rtnetlink.h>
21 #include <linux/skbuff.h>
22 #include <net/act_api.h>
23 #include <net/pkt_cls.h>
28 struct list_head flist
;
35 struct tcf_ematch_tree ematches
;
36 struct tcf_result res
;
37 struct list_head link
;
40 static struct tcf_ext_map basic_ext_map
= {
41 .action
= TCA_BASIC_ACT
,
42 .police
= TCA_BASIC_POLICE
45 static int basic_classify(struct sk_buff
*skb
, struct tcf_proto
*tp
,
46 struct tcf_result
*res
)
49 struct basic_head
*head
= (struct basic_head
*) tp
->root
;
50 struct basic_filter
*f
;
52 list_for_each_entry(f
, &head
->flist
, link
) {
53 if (!tcf_em_tree_match(skb
, &f
->ematches
, NULL
))
56 r
= tcf_exts_exec(skb
, &f
->exts
, res
);
64 static unsigned long basic_get(struct tcf_proto
*tp
, u32 handle
)
66 unsigned long l
= 0UL;
67 struct basic_head
*head
= (struct basic_head
*) tp
->root
;
68 struct basic_filter
*f
;
73 list_for_each_entry(f
, &head
->flist
, link
)
74 if (f
->handle
== handle
)
75 l
= (unsigned long) f
;
80 static void basic_put(struct tcf_proto
*tp
, unsigned long f
)
84 static int basic_init(struct tcf_proto
*tp
)
89 static inline void basic_delete_filter(struct tcf_proto
*tp
,
90 struct basic_filter
*f
)
92 tcf_unbind_filter(tp
, &f
->res
);
93 tcf_exts_destroy(tp
, &f
->exts
);
94 tcf_em_tree_destroy(tp
, &f
->ematches
);
98 static void basic_destroy(struct tcf_proto
*tp
)
100 struct basic_head
*head
= (struct basic_head
*) xchg(&tp
->root
, NULL
);
101 struct basic_filter
*f
, *n
;
103 list_for_each_entry_safe(f
, n
, &head
->flist
, link
) {
105 basic_delete_filter(tp
, f
);
109 static int basic_delete(struct tcf_proto
*tp
, unsigned long arg
)
111 struct basic_head
*head
= (struct basic_head
*) tp
->root
;
112 struct basic_filter
*t
, *f
= (struct basic_filter
*) arg
;
114 list_for_each_entry(t
, &head
->flist
, link
)
119 basic_delete_filter(tp
, t
);
126 static inline int basic_set_parms(struct tcf_proto
*tp
, struct basic_filter
*f
,
127 unsigned long base
, struct rtattr
**tb
,
132 struct tcf_ematch_tree t
;
134 if (tb
[TCA_BASIC_CLASSID
-1])
135 if (RTA_PAYLOAD(tb
[TCA_BASIC_CLASSID
-1]) < sizeof(u32
))
138 err
= tcf_exts_validate(tp
, tb
, est
, &e
, &basic_ext_map
);
142 err
= tcf_em_tree_validate(tp
, tb
[TCA_BASIC_EMATCHES
-1], &t
);
146 if (tb
[TCA_BASIC_CLASSID
-1]) {
147 f
->res
.classid
= *(u32
*)RTA_DATA(tb
[TCA_BASIC_CLASSID
-1]);
148 tcf_bind_filter(tp
, &f
->res
, base
);
151 tcf_exts_change(tp
, &f
->exts
, &e
);
152 tcf_em_tree_change(tp
, &f
->ematches
, &t
);
156 tcf_exts_destroy(tp
, &e
);
160 static int basic_change(struct tcf_proto
*tp
, unsigned long base
, u32 handle
,
161 struct rtattr
**tca
, unsigned long *arg
)
164 struct basic_head
*head
= (struct basic_head
*) tp
->root
;
165 struct rtattr
*tb
[TCA_BASIC_MAX
];
166 struct basic_filter
*f
= (struct basic_filter
*) *arg
;
168 if (tca
[TCA_OPTIONS
-1] == NULL
)
171 if (rtattr_parse_nested(tb
, TCA_BASIC_MAX
, tca
[TCA_OPTIONS
-1]) < 0)
175 if (handle
&& f
->handle
!= handle
)
177 return basic_set_parms(tp
, f
, base
, tb
, tca
[TCA_RATE
-1]);
182 head
= kmalloc(sizeof(*head
), GFP_KERNEL
);
186 memset(head
, 0, sizeof(*head
));
187 INIT_LIST_HEAD(&head
->flist
);
191 f
= kmalloc(sizeof(*f
), GFP_KERNEL
);
194 memset(f
, 0, sizeof(*f
));
202 if (++head
->hgenerator
== 0x7FFFFFFF)
203 head
->hgenerator
= 1;
204 } while (--i
> 0 && basic_get(tp
, head
->hgenerator
));
207 printk(KERN_ERR
"Insufficient number of handles\n");
211 f
->handle
= head
->hgenerator
;
214 err
= basic_set_parms(tp
, f
, base
, tb
, tca
[TCA_RATE
-1]);
219 list_add(&f
->link
, &head
->flist
);
221 *arg
= (unsigned long) f
;
225 if (*arg
== 0UL && f
)
231 static void basic_walk(struct tcf_proto
*tp
, struct tcf_walker
*arg
)
233 struct basic_head
*head
= (struct basic_head
*) tp
->root
;
234 struct basic_filter
*f
;
236 list_for_each_entry(f
, &head
->flist
, link
) {
237 if (arg
->count
< arg
->skip
)
240 if (arg
->fn(tp
, (unsigned long) f
, arg
) < 0) {
249 static int basic_dump(struct tcf_proto
*tp
, unsigned long fh
,
250 struct sk_buff
*skb
, struct tcmsg
*t
)
252 struct basic_filter
*f
= (struct basic_filter
*) fh
;
253 unsigned char *b
= skb
->tail
;
259 t
->tcm_handle
= f
->handle
;
261 rta
= (struct rtattr
*) b
;
262 RTA_PUT(skb
, TCA_OPTIONS
, 0, NULL
);
265 RTA_PUT(skb
, TCA_BASIC_CLASSID
, sizeof(u32
), &f
->res
.classid
);
267 if (tcf_exts_dump(skb
, &f
->exts
, &basic_ext_map
) < 0 ||
268 tcf_em_tree_dump(skb
, &f
->ematches
, TCA_BASIC_EMATCHES
) < 0)
271 rta
->rta_len
= (skb
->tail
- b
);
275 skb_trim(skb
, b
- skb
->data
);
279 static struct tcf_proto_ops cls_basic_ops
= {
281 .classify
= basic_classify
,
283 .destroy
= basic_destroy
,
286 .change
= basic_change
,
287 .delete = basic_delete
,
290 .owner
= THIS_MODULE
,
293 static int __init
init_basic(void)
295 return register_tcf_proto_ops(&cls_basic_ops
);
298 static void __exit
exit_basic(void)
300 unregister_tcf_proto_ops(&cls_basic_ops
);
303 module_init(init_basic
)
304 module_exit(exit_basic
)
305 MODULE_LICENSE("GPL");