projects / deliverable / linux.git / blob
? search:


dd2d691f0bbb334f1c9e0450e982511b3ffa74ef
[deliverable/linux.git] / net / sched / cls_tcindex.c
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 * Passing parameters to the root seems to be done more awkwardly than really
19 * necessary. At least, u32 doesn't seem to use such dirty hacks. To be
20 * verified. FIXME.
21 */
22
23 #define PERFECT_HASH_THRESHOLD 64 /* use perfect hash if not bigger */
24 #define DEFAULT_HASH_SIZE 64 /* optimized for diffserv */
25
26
27 struct tcindex_filter_result {
28 struct tcf_exts exts;
29 struct tcf_result res;
30 };
31
32 struct tcindex_filter {
33 u16 key;
34 struct tcindex_filter_result result;
35 struct tcindex_filter __rcu *next;
36 struct rcu_head rcu;
37 };
38
39
40 struct tcindex_data {
41 struct tcindex_filter_result *perfect; /* perfect hash; NULL if none */
42 struct tcindex_filter __rcu **h; /* imperfect hash; */
43 struct tcf_proto *tp;
44 u16 mask; /* AND key with mask */
45 u32 shift; /* shift ANDed key to the right */
46 u32 hash; /* hash table size; 0 if undefined */
47 u32 alloc_hash; /* allocated size */
48 u32 fall_through; /* 0: only classify if explicit match */
49 struct rcu_head rcu;
50 };
51
52 static inline int
53 tcindex_filter_is_set(struct tcindex_filter_result *r)
54 {
55 return tcf_exts_is_predicative(&r->exts) || r->res.classid;
56 }
57
58 static struct tcindex_filter_result *
59 tcindex_lookup(struct tcindex_data *p, u16 key)
60 {
61 if (p->perfect) {
62 struct tcindex_filter_result *f = p->perfect + key;
63
64 return tcindex_filter_is_set(f) ? f : NULL;
65 } else if (p->h) {
66 struct tcindex_filter __rcu **fp;
67 struct tcindex_filter *f;
68
69 fp = &p->h[key % p->hash];
70 for (f = rcu_dereference_bh_rtnl(*fp);
71 f;
72 fp = &f->next, f = rcu_dereference_bh_rtnl(*fp))
73 if (f->key == key)
74 return &f->result;
75 }
76
77 return NULL;
78 }
79
80
81 static int tcindex_classify(struct sk_buff *skb, const struct tcf_proto *tp,
82 struct tcf_result *res)
83 {
84 struct tcindex_data *p = rcu_dereference_bh(tp->root);
85 struct tcindex_filter_result *f;
86 int key = (skb->tc_index & p->mask) >> p->shift;
87
88 pr_debug("tcindex_classify(skb %p,tp %p,res %p),p %p\n",
89 skb, tp, res, p);
90
91 f = tcindex_lookup(p, key);
92 if (!f) {
93 if (!p->fall_through)
94 return -1;
95 res->classid = TC_H_MAKE(TC_H_MAJ(tp->q->handle), key);
96 res->class = 0;
97 pr_debug("alg 0x%x\n", res->classid);
98 return 0;
99 }
100 *res = f->res;
101 pr_debug("map 0x%x\n", res->classid);
102
103 return tcf_exts_exec(skb, &f->exts, res);
104 }
105
106
107 static unsigned long tcindex_get(struct tcf_proto *tp, u32 handle)
108 {
109 struct tcindex_data *p = rtnl_dereference(tp->root);
110 struct tcindex_filter_result *r;
111
112 pr_debug("tcindex_get(tp %p,handle 0x%08x)\n", tp, handle);
113 if (p->perfect && handle >= p->alloc_hash)
114 return 0;
115 r = tcindex_lookup(p, handle);
116 return r && tcindex_filter_is_set(r) ? (unsigned long) r : 0UL;
117 }
118
119
120 static void tcindex_put(struct tcf_proto *tp, unsigned long f)
121 {
122 pr_debug("tcindex_put(tp %p,f 0x%lx)\n", tp, f);
123 }
124
125
126 static int tcindex_init(struct tcf_proto *tp)
127 {
128 struct tcindex_data *p;
129
130 pr_debug("tcindex_init(tp %p)\n", tp);
131 p = kzalloc(sizeof(struct tcindex_data), GFP_KERNEL);
132 if (!p)
133 return -ENOMEM;
134
135 p->mask = 0xffff;
136 p->hash = DEFAULT_HASH_SIZE;
137 p->fall_through = 1;
138
139 rcu_assign_pointer(tp->root, p);
140 return 0;
141 }
142
143 static int
144 tcindex_delete(struct tcf_proto *tp, unsigned long arg)
145 {
146 struct tcindex_data *p = rtnl_dereference(tp->root);
147 struct tcindex_filter_result *r = (struct tcindex_filter_result *) arg;
148 struct tcindex_filter __rcu **walk;
149 struct tcindex_filter *f = NULL;
150
151 pr_debug("tcindex_delete(tp %p,arg 0x%lx),p %p\n", tp, arg, p);
152 if (p->perfect) {
153 if (!r->res.class)
154 return -ENOENT;
155 } else {
156 int i;
157
158 for (i = 0; i < p->hash; i++) {
159 walk = p->h + i;
160 for (f = rtnl_dereference(*walk); f;
161 walk = &f->next, f = rtnl_dereference(*walk)) {
162 if (&f->result == r)
163 goto found;
164 }
165 }
166 return -ENOENT;
167
168 found:
169 rcu_assign_pointer(*walk, rtnl_dereference(f->next));
170 }
171 tcf_unbind_filter(tp, &r->res);
172 tcf_exts_destroy(tp, &r->exts);
173 if (f)
174 kfree_rcu(f, rcu);
175 return 0;
176 }
177
178 static int tcindex_destroy_element(struct tcf_proto *tp,
179 unsigned long arg,
180 struct tcf_walker *walker)
181 {
182 return tcindex_delete(tp, arg);
183 }
184
185 static void __tcindex_destroy(struct rcu_head *head)
186 {
187 struct tcindex_data *p = container_of(head, struct tcindex_data, rcu);
188
189 kfree(p->perfect);
190 kfree(p->h);
191 kfree(p);
192 }
193
194 static inline int
195 valid_perfect_hash(struct tcindex_data *p)
196 {
197 return p->hash > (p->mask >> p->shift);
198 }
199
200 static const struct nla_policy tcindex_policy[TCA_TCINDEX_MAX + 1] = {
201 [TCA_TCINDEX_HASH] = { .type = NLA_U32 },
202 [TCA_TCINDEX_MASK] = { .type = NLA_U16 },
203 [TCA_TCINDEX_SHIFT] = { .type = NLA_U32 },
204 [TCA_TCINDEX_FALL_THROUGH] = { .type = NLA_U32 },
205 [TCA_TCINDEX_CLASSID] = { .type = NLA_U32 },
206 };
207
208 static void tcindex_filter_result_init(struct tcindex_filter_result *r)
209 {
210 memset(r, 0, sizeof(*r));
211 tcf_exts_init(&r->exts, TCA_TCINDEX_ACT, TCA_TCINDEX_POLICE);
212 }
213
214 static void __tcindex_partial_destroy(struct rcu_head *head)
215 {
216 struct tcindex_data *p = container_of(head, struct tcindex_data, rcu);
217
218 kfree(p->perfect);
219 kfree(p);
220 }
221
222 static int
223 tcindex_set_parms(struct net *net, struct tcf_proto *tp, unsigned long base,
224 u32 handle, struct tcindex_data *p,
225 struct tcindex_filter_result *r, struct nlattr **tb,
226 struct nlattr *est, bool ovr)
227 {
228 int err, balloc = 0;
229 struct tcindex_filter_result new_filter_result, *old_r = r;
230 struct tcindex_filter_result cr;
231 struct tcindex_data *cp, *oldp;
232 struct tcindex_filter *f = NULL; /* make gcc behave */
233 struct tcf_exts e;
234
235 tcf_exts_init(&e, TCA_TCINDEX_ACT, TCA_TCINDEX_POLICE);
236 err = tcf_exts_validate(net, tp, tb, est, &e, ovr);
237 if (err < 0)
238 return err;
239
240 /* tcindex_data attributes must look atomic to classifier/lookup so
241 * allocate new tcindex data and RCU assign it onto root. Keeping
242 * perfect hash and hash pointers from old data.
243 */
244 cp = kzalloc(sizeof(*cp), GFP_KERNEL);
245 if (!cp)
246 return -ENOMEM;
247
248 cp->mask = p->mask;
249 cp->shift = p->shift;
250 cp->hash = p->hash;
251 cp->alloc_hash = p->alloc_hash;
252 cp->fall_through = p->fall_through;
253 cp->tp = tp;
254
255 if (p->perfect) {
256 cp->perfect = kmemdup(p->perfect,
257 sizeof(*r) * cp->hash, GFP_KERNEL);
258 if (!cp->perfect)
259 goto errout;
260 }
261 cp->h = p->h;
262
263 tcindex_filter_result_init(&new_filter_result);
264 tcindex_filter_result_init(&cr);
265 if (old_r)
266 cr.res = r->res;
267
268 if (tb[TCA_TCINDEX_HASH])
269 cp->hash = nla_get_u32(tb[TCA_TCINDEX_HASH]);
270
271 if (tb[TCA_TCINDEX_MASK])
272 cp->mask = nla_get_u16(tb[TCA_TCINDEX_MASK]);
273
274 if (tb[TCA_TCINDEX_SHIFT])
275 cp->shift = nla_get_u32(tb[TCA_TCINDEX_SHIFT]);
276
277 err = -EBUSY;
278
279 /* Hash already allocated, make sure that we still meet the
280 * requirements for the allocated hash.
281 */
282 if (cp->perfect) {
283 if (!valid_perfect_hash(cp) ||
284 cp->hash > cp->alloc_hash)
285 goto errout;
286 } else if (cp->h && cp->hash != cp->alloc_hash) {
287 goto errout;
288 }
289
290 err = -EINVAL;
291 if (tb[TCA_TCINDEX_FALL_THROUGH])
292 cp->fall_through = nla_get_u32(tb[TCA_TCINDEX_FALL_THROUGH]);
293
294 if (!cp->hash) {
295 /* Hash not specified, use perfect hash if the upper limit
296 * of the hashing index is below the threshold.
297 */
298 if ((cp->mask >> cp->shift) < PERFECT_HASH_THRESHOLD)
299 cp->hash = (cp->mask >> cp->shift) + 1;
300 else
301 cp->hash = DEFAULT_HASH_SIZE;
302 }
303
304 if (!cp->perfect && cp->h)
305 cp->alloc_hash = cp->hash;
306
307 /* Note: this could be as restrictive as if (handle & ~(mask >> shift))
308 * but then, we'd fail handles that may become valid after some future
309 * mask change. While this is extremely unlikely to ever matter,
310 * the check below is safer (and also more backwards-compatible).
311 */
312 if (cp->perfect || valid_perfect_hash(cp))
313 if (handle >= cp->alloc_hash)
314 goto errout;
315
316
317 err = -ENOMEM;
318 if (!cp->perfect && !cp->h) {
319 if (valid_perfect_hash(cp)) {
320 int i;
321
322 cp->perfect = kcalloc(cp->hash, sizeof(*r), GFP_KERNEL);
323 if (!cp->perfect)
324 goto errout;
325 for (i = 0; i < cp->hash; i++)
326 tcf_exts_init(&cp->perfect[i].exts,
327 TCA_TCINDEX_ACT,
328 TCA_TCINDEX_POLICE);
329 balloc = 1;
330 } else {
331 struct tcindex_filter __rcu **hash;
332
333 hash = kcalloc(cp->hash,
334 sizeof(struct tcindex_filter *),
335 GFP_KERNEL);
336
337 if (!hash)
338 goto errout;
339
340 cp->h = hash;
341 balloc = 2;
342 }
343 }
344
345 if (cp->perfect)
346 r = cp->perfect + handle;
347 else
348 r = tcindex_lookup(cp, handle) ? : &new_filter_result;
349
350 if (r == &new_filter_result) {
351 f = kzalloc(sizeof(*f), GFP_KERNEL);
352 if (!f)
353 goto errout_alloc;
354 }
355
356 if (tb[TCA_TCINDEX_CLASSID]) {
357 cr.res.classid = nla_get_u32(tb[TCA_TCINDEX_CLASSID]);
358 tcf_bind_filter(tp, &cr.res, base);
359 }
360
361 if (old_r)
362 tcf_exts_change(tp, &r->exts, &e);
363 else
364 tcf_exts_change(tp, &cr.exts, &e);
365
366 if (old_r && old_r != r)
367 tcindex_filter_result_init(old_r);
368
369 oldp = p;
370 r->res = cr.res;
371 rcu_assign_pointer(tp->root, cp);
372
373 if (r == &new_filter_result) {
374 struct tcindex_filter *nfp;
375 struct tcindex_filter __rcu **fp;
376
377 f->key = handle;
378 f->result = new_filter_result;
379 f->next = NULL;
380
381 fp = p->h + (handle % p->hash);
382 for (nfp = rtnl_dereference(*fp);
383 nfp;
384 fp = &nfp->next, nfp = rtnl_dereference(*fp))
385 ; /* nothing */
386
387 rcu_assign_pointer(*fp, f);
388 }
389
390 if (oldp)
391 call_rcu(&oldp->rcu, __tcindex_partial_destroy);
392 return 0;
393
394 errout_alloc:
395 if (balloc == 1)
396 kfree(cp->perfect);
397 else if (balloc == 2)
398 kfree(cp->h);
399 errout:
400 kfree(cp);
401 tcf_exts_destroy(tp, &e);
402 return err;
403 }
404
405 static int
406 tcindex_change(struct net *net, struct sk_buff *in_skb,
407 struct tcf_proto *tp, unsigned long base, u32 handle,
408 struct nlattr **tca, unsigned long *arg, bool ovr)
409 {
410 struct nlattr *opt = tca[TCA_OPTIONS];
411 struct nlattr *tb[TCA_TCINDEX_MAX + 1];
412 struct tcindex_data *p = rtnl_dereference(tp->root);
413 struct tcindex_filter_result *r = (struct tcindex_filter_result *) *arg;
414 int err;
415
416 pr_debug("tcindex_change(tp %p,handle 0x%08x,tca %p,arg %p),opt %p,"
417 "p %p,r %p,*arg 0x%lx\n",
418 tp, handle, tca, arg, opt, p, r, arg ? *arg : 0L);
419
420 if (!opt)
421 return 0;
422
423 err = nla_parse_nested(tb, TCA_TCINDEX_MAX, opt, tcindex_policy);
424 if (err < 0)
425 return err;
426
427 return tcindex_set_parms(net, tp, base, handle, p, r, tb,
428 tca[TCA_RATE], ovr);
429 }
430
431 static void tcindex_walk(struct tcf_proto *tp, struct tcf_walker *walker)
432 {
433 struct tcindex_data *p = rtnl_dereference(tp->root);
434 struct tcindex_filter *f, *next;
435 int i;
436
437 pr_debug("tcindex_walk(tp %p,walker %p),p %p\n", tp, walker, p);
438 if (p->perfect) {
439 for (i = 0; i < p->hash; i++) {
440 if (!p->perfect[i].res.class)
441 continue;
442 if (walker->count >= walker->skip) {
443 if (walker->fn(tp,
444 (unsigned long) (p->perfect+i), walker)
445 < 0) {
446 walker->stop = 1;
447 return;
448 }
449 }
450 walker->count++;
451 }
452 }
453 if (!p->h)
454 return;
455 for (i = 0; i < p->hash; i++) {
456 for (f = rtnl_dereference(p->h[i]); f; f = next) {
457 next = rtnl_dereference(f->next);
458 if (walker->count >= walker->skip) {
459 if (walker->fn(tp, (unsigned long) &f->result,
460 walker) < 0) {
461 walker->stop = 1;
462 return;
463 }
464 }
465 walker->count++;
466 }
467 }
468 }
469
470 static void tcindex_destroy(struct tcf_proto *tp)
471 {
472 struct tcindex_data *p = rtnl_dereference(tp->root);
473 struct tcf_walker walker;
474
475 pr_debug("tcindex_destroy(tp %p),p %p\n", tp, p);
476 walker.count = 0;
477 walker.skip = 0;
478 walker.fn = tcindex_destroy_element;
479 tcindex_walk(tp, &walker);
480
481 RCU_INIT_POINTER(tp->root, NULL);
482 call_rcu(&p->rcu, __tcindex_destroy);
483 }
484
485
486 static int tcindex_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
487 struct sk_buff *skb, struct tcmsg *t)
488 {
489 struct tcindex_data *p = rtnl_dereference(tp->root);
490 struct tcindex_filter_result *r = (struct tcindex_filter_result *) fh;
491 unsigned char *b = skb_tail_pointer(skb);
492 struct nlattr *nest;
493
494 pr_debug("tcindex_dump(tp %p,fh 0x%lx,skb %p,t %p),p %p,r %p,b %p\n",
495 tp, fh, skb, t, p, r, b);
496 pr_debug("p->perfect %p p->h %p\n", p->perfect, p->h);
497
498 nest = nla_nest_start(skb, TCA_OPTIONS);
499 if (nest == NULL)
500 goto nla_put_failure;
501
502 if (!fh) {
503 t->tcm_handle = ~0; /* whatever ... */
504 if (nla_put_u32(skb, TCA_TCINDEX_HASH, p->hash) ||
505 nla_put_u16(skb, TCA_TCINDEX_MASK, p->mask) ||
506 nla_put_u32(skb, TCA_TCINDEX_SHIFT, p->shift) ||
507 nla_put_u32(skb, TCA_TCINDEX_FALL_THROUGH, p->fall_through))
508 goto nla_put_failure;
509 nla_nest_end(skb, nest);
510 } else {
511 if (p->perfect) {
512 t->tcm_handle = r - p->perfect;
513 } else {
514 struct tcindex_filter *f;
515 struct tcindex_filter __rcu **fp;
516 int i;
517
518 t->tcm_handle = 0;
519 for (i = 0; !t->tcm_handle && i < p->hash; i++) {
520 fp = &p->h[i];
521 for (f = rtnl_dereference(*fp);
522 !t->tcm_handle && f;
523 fp = &f->next, f = rtnl_dereference(*fp)) {
524 if (&f->result == r)
525 t->tcm_handle = f->key;
526 }
527 }
528 }
529 pr_debug("handle = %d\n", t->tcm_handle);
530 if (r->res.class &&
531 nla_put_u32(skb, TCA_TCINDEX_CLASSID, r->res.classid))
532 goto nla_put_failure;
533
534 if (tcf_exts_dump(skb, &r->exts) < 0)
535 goto nla_put_failure;
536 nla_nest_end(skb, nest);
537
538 if (tcf_exts_dump_stats(skb, &r->exts) < 0)
539 goto nla_put_failure;
540 }
541
542 return skb->len;
543
544 nla_put_failure:
545 nlmsg_trim(skb, b);
546 return -1;
547 }
548
549 static struct tcf_proto_ops cls_tcindex_ops __read_mostly = {
550 .kind = "tcindex",
551 .classify = tcindex_classify,
552 .init = tcindex_init,
553 .destroy = tcindex_destroy,
554 .get = tcindex_get,
555 .put = tcindex_put,
556 .change = tcindex_change,
557 .delete = tcindex_delete,
558 .walk = tcindex_walk,
559 .dump = tcindex_dump,
560 .owner = THIS_MODULE,
561 };
562
563 static int __init init_tcindex(void)
564 {
565 return register_tcf_proto_ops(&cls_tcindex_ops);
566 }
567
568 static void __exit exit_tcindex(void)
569 {
570 unregister_tcf_proto_ops(&cls_tcindex_ops);
571 }
572
573 module_init(init_tcindex)
574 module_exit(exit_tcindex)
575 MODULE_LICENSE("GPL");
Linux kernel - Deliverables
This page took 0.041815 seconds and 4 git commands to generate.