?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
GUI: Fix Tomato RAF theme for all builds. Compilation typo.
[tomato.git] / release / src-rt-6.x.4708 / linux / linux-2.6.36 / net / sched / cls_tcindex.c
blob962a49b6c872a62a5a9652a4dbb0781791fcd728
1 /*
2 * net/sched/cls_tcindex.c Packet classifier for skb->tc_index
3 *
4 * Written 1998,1999 by Werner Almesberger, EPFL ICA
5 */
6
7 #include <linux/module.h>
8 #include <linux/types.h>
9 #include <linux/kernel.h>
10 #include <linux/skbuff.h>
11 #include <linux/errno.h>
12 #include <linux/slab.h>
13 #include <net/act_api.h>
14 #include <net/netlink.h>
15 #include <net/pkt_cls.h>
16
17
18 #define PERFECT_HASH_THRESHOLD 64 /* use perfect hash if not bigger */
19 #define DEFAULT_HASH_SIZE 64 /* optimized for diffserv */
20
21
22 #define PRIV(tp) ((struct tcindex_data *) (tp)->root)
23
24
25 struct tcindex_filter_result {
26 struct tcf_exts exts;
27 struct tcf_result res;
28 };
29
30 struct tcindex_filter {
31 u16 key;
32 struct tcindex_filter_result result;
33 struct tcindex_filter *next;
34 };
35
36
37 struct tcindex_data {
38 struct tcindex_filter_result *perfect; /* perfect hash; NULL if none */
39 struct tcindex_filter **h; /* imperfect hash; only used if !perfect;
40 NULL if unused */
41 u16 mask; /* AND key with mask */
42 int shift; /* shift ANDed key to the right */
43 int hash; /* hash table size; 0 if undefined */
44 int alloc_hash; /* allocated size */
45 int fall_through; /* 0: only classify if explicit match */
46 };
47
48 static const struct tcf_ext_map tcindex_ext_map = {
49 .police = TCA_TCINDEX_POLICE,
50 .action = TCA_TCINDEX_ACT
51 };
52
53 static inline int
54 tcindex_filter_is_set(struct tcindex_filter_result *r)
55 {
56 return tcf_exts_is_predicative(&r->exts) || r->res.classid;
57 }
58
59 static struct tcindex_filter_result *
60 tcindex_lookup(struct tcindex_data *p, u16 key)
61 {
62 struct tcindex_filter *f;
63
64 if (p->perfect)
65 return tcindex_filter_is_set(p->perfect + key) ?
66 p->perfect + key : NULL;
67 else if (p->h) {
68 for (f = p->h[key % p->hash]; f; f = f->next)
69 if (f->key == key)
70 return &f->result;
71 }
72
73 return NULL;
74 }
75
76
77 static int tcindex_classify(struct sk_buff *skb, struct tcf_proto *tp,
78 struct tcf_result *res)
79 {
80 struct tcindex_data *p = PRIV(tp);
81 struct tcindex_filter_result *f;
82 int key = (skb->tc_index & p->mask) >> p->shift;
83
84 pr_debug("tcindex_classify(skb %p,tp %p,res %p),p %p\n",
85 skb, tp, res, p);
86
87 f = tcindex_lookup(p, key);
88 if (!f) {
89 if (!p->fall_through)
90 return -1;
91 res->classid = TC_H_MAKE(TC_H_MAJ(tp->q->handle), key);
92 res->class = 0;
93 pr_debug("alg 0x%x\n", res->classid);
94 return 0;
95 }
96 *res = f->res;
97 pr_debug("map 0x%x\n", res->classid);
98
99 return tcf_exts_exec(skb, &f->exts, res);
100 }
101
102
103 static unsigned long tcindex_get(struct tcf_proto *tp, u32 handle)
104 {
105 struct tcindex_data *p = PRIV(tp);
106 struct tcindex_filter_result *r;
107
108 pr_debug("tcindex_get(tp %p,handle 0x%08x)\n", tp, handle);
109 if (p->perfect && handle >= p->alloc_hash)
110 return 0;
111 r = tcindex_lookup(p, handle);
112 return r && tcindex_filter_is_set(r) ? (unsigned long) r : 0UL;
113 }
114
115
116 static void tcindex_put(struct tcf_proto *tp, unsigned long f)
117 {
118 pr_debug("tcindex_put(tp %p,f 0x%lx)\n", tp, f);
119 }
120
121
122 static int tcindex_init(struct tcf_proto *tp)
123 {
124 struct tcindex_data *p;
125
126 pr_debug("tcindex_init(tp %p)\n", tp);
127 p = kzalloc(sizeof(struct tcindex_data), GFP_KERNEL);
128 if (!p)
129 return -ENOMEM;
130
131 p->mask = 0xffff;
132 p->hash = DEFAULT_HASH_SIZE;
133 p->fall_through = 1;
134
135 tp->root = p;
136 return 0;
137 }
138
139
140 static int
141 __tcindex_delete(struct tcf_proto *tp, unsigned long arg, int lock)
142 {
143 struct tcindex_data *p = PRIV(tp);
144 struct tcindex_filter_result *r = (struct tcindex_filter_result *) arg;
145 struct tcindex_filter *f = NULL;
146
147 pr_debug("tcindex_delete(tp %p,arg 0x%lx),p %p,f %p\n", tp, arg, p, f);
148 if (p->perfect) {
149 if (!r->res.class)
150 return -ENOENT;
151 } else {
152 int i;
153 struct tcindex_filter **walk = NULL;
154
155 for (i = 0; i < p->hash; i++)
156 for (walk = p->h+i; *walk; walk = &(*walk)->next)
157 if (&(*walk)->result == r)
158 goto found;
159 return -ENOENT;
160
161 found:
162 f = *walk;
163 if (lock)
164 tcf_tree_lock(tp);
165 *walk = f->next;
166 if (lock)
167 tcf_tree_unlock(tp);
168 }
169 tcf_unbind_filter(tp, &r->res);
170 tcf_exts_destroy(tp, &r->exts);
171 kfree(f);
172 return 0;
173 }
174
175 static int tcindex_delete(struct tcf_proto *tp, unsigned long arg)
176 {
177 return __tcindex_delete(tp, arg, 1);
178 }
179
180 static inline int
181 valid_perfect_hash(struct tcindex_data *p)
182 {
183 return p->hash > (p->mask >> p->shift);
184 }
185
186 static const struct nla_policy tcindex_policy[TCA_TCINDEX_MAX + 1] = {
187 [TCA_TCINDEX_HASH] = { .type = NLA_U32 },
188 [TCA_TCINDEX_MASK] = { .type = NLA_U16 },
189 [TCA_TCINDEX_SHIFT] = { .type = NLA_U32 },
190 [TCA_TCINDEX_FALL_THROUGH] = { .type = NLA_U32 },
191 [TCA_TCINDEX_CLASSID] = { .type = NLA_U32 },
192 };
193
194 static int
195 tcindex_set_parms(struct tcf_proto *tp, unsigned long base, u32 handle,
196 struct tcindex_data *p, struct tcindex_filter_result *r,
197 struct nlattr **tb, struct nlattr *est)
198 {
199 int err, balloc = 0;
200 struct tcindex_filter_result new_filter_result, *old_r = r;
201 struct tcindex_filter_result cr;
202 struct tcindex_data cp;
203 struct tcindex_filter *f = NULL; /* make gcc behave */
204 struct tcf_exts e;
205
206 err = tcf_exts_validate(tp, tb, est, &e, &tcindex_ext_map);
207 if (err < 0)
208 return err;
209
210 memcpy(&cp, p, sizeof(cp));
211 memset(&new_filter_result, 0, sizeof(new_filter_result));
212
213 if (old_r)
214 memcpy(&cr, r, sizeof(cr));
215 else
216 memset(&cr, 0, sizeof(cr));
217
218 if (tb[TCA_TCINDEX_HASH])
219 cp.hash = nla_get_u32(tb[TCA_TCINDEX_HASH]);
220
221 if (tb[TCA_TCINDEX_MASK])
222 cp.mask = nla_get_u16(tb[TCA_TCINDEX_MASK]);
223
224 if (tb[TCA_TCINDEX_SHIFT])
225 cp.shift = nla_get_u32(tb[TCA_TCINDEX_SHIFT]);
226
227 err = -EBUSY;
228 /* Hash already allocated, make sure that we still meet the
229 * requirements for the allocated hash.
230 */
231 if (cp.perfect) {
232 if (!valid_perfect_hash(&cp) ||
233 cp.hash > cp.alloc_hash)
234 goto errout;
235 } else if (cp.h && cp.hash != cp.alloc_hash)
236 goto errout;
237
238 err = -EINVAL;
239 if (tb[TCA_TCINDEX_FALL_THROUGH])
240 cp.fall_through = nla_get_u32(tb[TCA_TCINDEX_FALL_THROUGH]);
241
242 if (!cp.hash) {
243 /* Hash not specified, use perfect hash if the upper limit
244 * of the hashing index is below the threshold.
245 */
246 if ((cp.mask >> cp.shift) < PERFECT_HASH_THRESHOLD)
247 cp.hash = (cp.mask >> cp.shift)+1;
248 else
249 cp.hash = DEFAULT_HASH_SIZE;
250 }
251
252 if (!cp.perfect && !cp.h)
253 cp.alloc_hash = cp.hash;
254
255 /* Note: this could be as restrictive as if (handle & ~(mask >> shift))
256 * but then, we'd fail handles that may become valid after some future
257 * mask change. While this is extremely unlikely to ever matter,
258 * the check below is safer (and also more backwards-compatible).
259 */
260 if (cp.perfect || valid_perfect_hash(&cp))
261 if (handle >= cp.alloc_hash)
262 goto errout;
263
264
265 err = -ENOMEM;
266 if (!cp.perfect && !cp.h) {
267 if (valid_perfect_hash(&cp)) {
268 cp.perfect = kcalloc(cp.hash, sizeof(*r), GFP_KERNEL);
269 if (!cp.perfect)
270 goto errout;
271 balloc = 1;
272 } else {
273 cp.h = kcalloc(cp.hash, sizeof(f), GFP_KERNEL);
274 if (!cp.h)
275 goto errout;
276 balloc = 2;
277 }
278 }
279
280 if (cp.perfect)
281 r = cp.perfect + handle;
282 else
283 r = tcindex_lookup(&cp, handle) ? : &new_filter_result;
284
285 if (r == &new_filter_result) {
286 f = kzalloc(sizeof(*f), GFP_KERNEL);
287 if (!f)
288 goto errout_alloc;
289 }
290
291 if (tb[TCA_TCINDEX_CLASSID]) {
292 cr.res.classid = nla_get_u32(tb[TCA_TCINDEX_CLASSID]);
293 tcf_bind_filter(tp, &cr.res, base);
294 }
295
296 tcf_exts_change(tp, &cr.exts, &e);
297
298 tcf_tree_lock(tp);
299 if (old_r && old_r != r)
300 memset(old_r, 0, sizeof(*old_r));
301
302 memcpy(p, &cp, sizeof(cp));
303 memcpy(r, &cr, sizeof(cr));
304
305 if (r == &new_filter_result) {
306 struct tcindex_filter **fp;
307
308 f->key = handle;
309 f->result = new_filter_result;
310 f->next = NULL;
311 for (fp = p->h+(handle % p->hash); *fp; fp = &(*fp)->next)
312 /* nothing */;
313 *fp = f;
314 }
315 tcf_tree_unlock(tp);
316
317 return 0;
318
319 errout_alloc:
320 if (balloc == 1)
321 kfree(cp.perfect);
322 else if (balloc == 2)
323 kfree(cp.h);
324 errout:
325 tcf_exts_destroy(tp, &e);
326 return err;
327 }
328
329 static int
330 tcindex_change(struct tcf_proto *tp, unsigned long base, u32 handle,
331 struct nlattr **tca, unsigned long *arg)
332 {
333 struct nlattr *opt = tca[TCA_OPTIONS];
334 struct nlattr *tb[TCA_TCINDEX_MAX + 1];
335 struct tcindex_data *p = PRIV(tp);
336 struct tcindex_filter_result *r = (struct tcindex_filter_result *) *arg;
337 int err;
338
339 pr_debug("tcindex_change(tp %p,handle 0x%08x,tca %p,arg %p),opt %p,"
340 "p %p,r %p,*arg 0x%lx\n",
341 tp, handle, tca, arg, opt, p, r, arg ? *arg : 0L);
342
343 if (!opt)
344 return 0;
345
346 err = nla_parse_nested(tb, TCA_TCINDEX_MAX, opt, tcindex_policy);
347 if (err < 0)
348 return err;
349
350 return tcindex_set_parms(tp, base, handle, p, r, tb, tca[TCA_RATE]);
351 }
352
353
354 static void tcindex_walk(struct tcf_proto *tp, struct tcf_walker *walker)
355 {
356 struct tcindex_data *p = PRIV(tp);
357 struct tcindex_filter *f, *next;
358 int i;
359
360 pr_debug("tcindex_walk(tp %p,walker %p),p %p\n", tp, walker, p);
361 if (p->perfect) {
362 for (i = 0; i < p->hash; i++) {
363 if (!p->perfect[i].res.class)
364 continue;
365 if (walker->count >= walker->skip) {
366 if (walker->fn(tp,
367 (unsigned long) (p->perfect+i), walker)
368 < 0) {
369 walker->stop = 1;
370 return;
371 }
372 }
373 walker->count++;
374 }
375 }
376 if (!p->h)
377 return;
378 for (i = 0; i < p->hash; i++) {
379 for (f = p->h[i]; f; f = next) {
380 next = f->next;
381 if (walker->count >= walker->skip) {
382 if (walker->fn(tp, (unsigned long) &f->result,
383 walker) < 0) {
384 walker->stop = 1;
385 return;
386 }
387 }
388 walker->count++;
389 }
390 }
391 }
392
393
394 static int tcindex_destroy_element(struct tcf_proto *tp,
395 unsigned long arg, struct tcf_walker *walker)
396 {
397 return __tcindex_delete(tp, arg, 0);
398 }
399
400
401 static void tcindex_destroy(struct tcf_proto *tp)
402 {
403 struct tcindex_data *p = PRIV(tp);
404 struct tcf_walker walker;
405
406 pr_debug("tcindex_destroy(tp %p),p %p\n", tp, p);
407 walker.count = 0;
408 walker.skip = 0;
409 walker.fn = &tcindex_destroy_element;
410 tcindex_walk(tp, &walker);
411 kfree(p->perfect);
412 kfree(p->h);
413 kfree(p);
414 tp->root = NULL;
415 }
416
417
418 static int tcindex_dump(struct tcf_proto *tp, unsigned long fh,
419 struct sk_buff *skb, struct tcmsg *t)
420 {
421 struct tcindex_data *p = PRIV(tp);
422 struct tcindex_filter_result *r = (struct tcindex_filter_result *) fh;
423 unsigned char *b = skb_tail_pointer(skb);
424 struct nlattr *nest;
425
426 pr_debug("tcindex_dump(tp %p,fh 0x%lx,skb %p,t %p),p %p,r %p,b %p\n",
427 tp, fh, skb, t, p, r, b);
428 pr_debug("p->perfect %p p->h %p\n", p->perfect, p->h);
429
430 nest = nla_nest_start(skb, TCA_OPTIONS);
431 if (nest == NULL)
432 goto nla_put_failure;
433
434 if (!fh) {
435 t->tcm_handle = ~0; /* whatever ... */
436 NLA_PUT_U32(skb, TCA_TCINDEX_HASH, p->hash);
437 NLA_PUT_U16(skb, TCA_TCINDEX_MASK, p->mask);
438 NLA_PUT_U32(skb, TCA_TCINDEX_SHIFT, p->shift);
439 NLA_PUT_U32(skb, TCA_TCINDEX_FALL_THROUGH, p->fall_through);
440 nla_nest_end(skb, nest);
441 } else {
442 if (p->perfect) {
443 t->tcm_handle = r-p->perfect;
444 } else {
445 struct tcindex_filter *f;
446 int i;
447
448 t->tcm_handle = 0;
449 for (i = 0; !t->tcm_handle && i < p->hash; i++) {
450 for (f = p->h[i]; !t->tcm_handle && f;
451 f = f->next) {
452 if (&f->result == r)
453 t->tcm_handle = f->key;
454 }
455 }
456 }
457 pr_debug("handle = %d\n", t->tcm_handle);
458 if (r->res.class)
459 NLA_PUT_U32(skb, TCA_TCINDEX_CLASSID, r->res.classid);
460
461 if (tcf_exts_dump(skb, &r->exts, &tcindex_ext_map) < 0)
462 goto nla_put_failure;
463 nla_nest_end(skb, nest);
464
465 if (tcf_exts_dump_stats(skb, &r->exts, &tcindex_ext_map) < 0)
466 goto nla_put_failure;
467 }
468
469 return skb->len;
470
471 nla_put_failure:
472 nlmsg_trim(skb, b);
473 return -1;
474 }
475
476 static struct tcf_proto_ops cls_tcindex_ops __read_mostly = {
477 .kind = "tcindex",
478 .classify = tcindex_classify,
479 .init = tcindex_init,
480 .destroy = tcindex_destroy,
481 .get = tcindex_get,
482 .put = tcindex_put,
483 .change = tcindex_change,
484 .delete = tcindex_delete,
485 .walk = tcindex_walk,
486 .dump = tcindex_dump,
487 .owner = THIS_MODULE,
488 };
489
490 static int __init init_tcindex(void)
491 {
492 return register_tcf_proto_ops(&cls_tcindex_ops);
493 }
494
495 static void __exit exit_tcindex(void)
496 {
497 unregister_tcf_proto_ops(&cls_tcindex_ops);
498 }
499
500 module_init(init_tcindex)
501 module_exit(exit_tcindex)
502 MODULE_LICENSE("GPL");
Tomato firmware and modifications.