projects / deliverable / linux.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
net_sched: add struct net pointer to tcf_proto_ops->dump
[deliverable/linux.git] / net / sched / cls_u32.c
1 /*
2 * net/sched/cls_u32.c Ugly (or Universal) 32bit key Packet Classifier.
3 *
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.
8 *
9 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
10 *
11 * The filters are packed to hash tables of key nodes
12 * with a set of 32bit key/mask pairs at every node.
13 * Nodes reference next level hash tables etc.
14 *
15 * This scheme is the best universal classifier I managed to
16 * invent; it is not super-fast, but it is not slow (provided you
17 * program it correctly), and general enough. And its relative
18 * speed grows as the number of rules becomes larger.
19 *
20 * It seems that it represents the best middle point between
21 * speed and manageability both by human and by machine.
22 *
23 * It is especially useful for link sharing combined with QoS;
24 * pure RSVP doesn't need such a general approach and can use
25 * much simpler (and faster) schemes, sort of cls_rsvp.c.
26 *
27 * JHS: We should remove the CONFIG_NET_CLS_IND from here
28 * eventually when the meta match extension is made available
29 *
30 * nfmark match added by Catalin(ux aka Dino) BOIE <catab at umbrella.ro>
31 */
32
33 #include <linux/module.h>
34 #include <linux/slab.h>
35 #include <linux/types.h>
36 #include <linux/kernel.h>
37 #include <linux/string.h>
38 #include <linux/errno.h>
39 #include <linux/rtnetlink.h>
40 #include <linux/skbuff.h>
41 #include <net/netlink.h>
42 #include <net/act_api.h>
43 #include <net/pkt_cls.h>
44
45 struct tc_u_knode {
46 struct tc_u_knode *next;
47 u32 handle;
48 struct tc_u_hnode *ht_up;
49 struct tcf_exts exts;
50 #ifdef CONFIG_NET_CLS_IND
51 char indev[IFNAMSIZ];
52 #endif
53 u8 fshift;
54 struct tcf_result res;
55 struct tc_u_hnode *ht_down;
56 #ifdef CONFIG_CLS_U32_PERF
57 struct tc_u32_pcnt *pf;
58 #endif
59 #ifdef CONFIG_CLS_U32_MARK
60 struct tc_u32_mark mark;
61 #endif
62 struct tc_u32_sel sel;
63 };
64
65 struct tc_u_hnode {
66 struct tc_u_hnode *next;
67 u32 handle;
68 u32 prio;
69 struct tc_u_common *tp_c;
70 int refcnt;
71 unsigned int divisor;
72 struct tc_u_knode *ht[1];
73 };
74
75 struct tc_u_common {
76 struct tc_u_hnode *hlist;
77 struct Qdisc *q;
78 int refcnt;
79 u32 hgenerator;
80 };
81
82 static inline unsigned int u32_hash_fold(__be32 key,
83 const struct tc_u32_sel *sel,
84 u8 fshift)
85 {
86 unsigned int h = ntohl(key & sel->hmask) >> fshift;
87
88 return h;
89 }
90
91 static int u32_classify(struct sk_buff *skb, const struct tcf_proto *tp, struct tcf_result *res)
92 {
93 struct {
94 struct tc_u_knode *knode;
95 unsigned int off;
96 } stack[TC_U32_MAXDEPTH];
97
98 struct tc_u_hnode *ht = (struct tc_u_hnode *)tp->root;
99 unsigned int off = skb_network_offset(skb);
100 struct tc_u_knode *n;
101 int sdepth = 0;
102 int off2 = 0;
103 int sel = 0;
104 #ifdef CONFIG_CLS_U32_PERF
105 int j;
106 #endif
107 int i, r;
108
109 next_ht:
110 n = ht->ht[sel];
111
112 next_knode:
113 if (n) {
114 struct tc_u32_key *key = n->sel.keys;
115
116 #ifdef CONFIG_CLS_U32_PERF
117 n->pf->rcnt += 1;
118 j = 0;
119 #endif
120
121 #ifdef CONFIG_CLS_U32_MARK
122 if ((skb->mark & n->mark.mask) != n->mark.val) {
123 n = n->next;
124 goto next_knode;
125 } else {
126 n->mark.success++;
127 }
128 #endif
129
130 for (i = n->sel.nkeys; i > 0; i--, key++) {
131 int toff = off + key->off + (off2 & key->offmask);
132 __be32 *data, hdata;
133
134 if (skb_headroom(skb) + toff > INT_MAX)
135 goto out;
136
137 data = skb_header_pointer(skb, toff, 4, &hdata);
138 if (!data)
139 goto out;
140 if ((*data ^ key->val) & key->mask) {
141 n = n->next;
142 goto next_knode;
143 }
144 #ifdef CONFIG_CLS_U32_PERF
145 n->pf->kcnts[j] += 1;
146 j++;
147 #endif
148 }
149 if (n->ht_down == NULL) {
150 check_terminal:
151 if (n->sel.flags & TC_U32_TERMINAL) {
152
153 *res = n->res;
154 #ifdef CONFIG_NET_CLS_IND
155 if (!tcf_match_indev(skb, n->indev)) {
156 n = n->next;
157 goto next_knode;
158 }
159 #endif
160 #ifdef CONFIG_CLS_U32_PERF
161 n->pf->rhit += 1;
162 #endif
163 r = tcf_exts_exec(skb, &n->exts, res);
164 if (r < 0) {
165 n = n->next;
166 goto next_knode;
167 }
168
169 return r;
170 }
171 n = n->next;
172 goto next_knode;
173 }
174
175 /* PUSH */
176 if (sdepth >= TC_U32_MAXDEPTH)
177 goto deadloop;
178 stack[sdepth].knode = n;
179 stack[sdepth].off = off;
180 sdepth++;
181
182 ht = n->ht_down;
183 sel = 0;
184 if (ht->divisor) {
185 __be32 *data, hdata;
186
187 data = skb_header_pointer(skb, off + n->sel.hoff, 4,
188 &hdata);
189 if (!data)
190 goto out;
191 sel = ht->divisor & u32_hash_fold(*data, &n->sel,
192 n->fshift);
193 }
194 if (!(n->sel.flags & (TC_U32_VAROFFSET | TC_U32_OFFSET | TC_U32_EAT)))
195 goto next_ht;
196
197 if (n->sel.flags & (TC_U32_OFFSET | TC_U32_VAROFFSET)) {
198 off2 = n->sel.off + 3;
199 if (n->sel.flags & TC_U32_VAROFFSET) {
200 __be16 *data, hdata;
201
202 data = skb_header_pointer(skb,
203 off + n->sel.offoff,
204 2, &hdata);
205 if (!data)
206 goto out;
207 off2 += ntohs(n->sel.offmask & *data) >>
208 n->sel.offshift;
209 }
210 off2 &= ~3;
211 }
212 if (n->sel.flags & TC_U32_EAT) {
213 off += off2;
214 off2 = 0;
215 }
216
217 if (off < skb->len)
218 goto next_ht;
219 }
220
221 /* POP */
222 if (sdepth--) {
223 n = stack[sdepth].knode;
224 ht = n->ht_up;
225 off = stack[sdepth].off;
226 goto check_terminal;
227 }
228 out:
229 return -1;
230
231 deadloop:
232 net_warn_ratelimited("cls_u32: dead loop\n");
233 return -1;
234 }
235
236 static struct tc_u_hnode *
237 u32_lookup_ht(struct tc_u_common *tp_c, u32 handle)
238 {
239 struct tc_u_hnode *ht;
240
241 for (ht = tp_c->hlist; ht; ht = ht->next)
242 if (ht->handle == handle)
243 break;
244
245 return ht;
246 }
247
248 static struct tc_u_knode *
249 u32_lookup_key(struct tc_u_hnode *ht, u32 handle)
250 {
251 unsigned int sel;
252 struct tc_u_knode *n = NULL;
253
254 sel = TC_U32_HASH(handle);
255 if (sel > ht->divisor)
256 goto out;
257
258 for (n = ht->ht[sel]; n; n = n->next)
259 if (n->handle == handle)
260 break;
261 out:
262 return n;
263 }
264
265
266 static unsigned long u32_get(struct tcf_proto *tp, u32 handle)
267 {
268 struct tc_u_hnode *ht;
269 struct tc_u_common *tp_c = tp->data;
270
271 if (TC_U32_HTID(handle) == TC_U32_ROOT)
272 ht = tp->root;
273 else
274 ht = u32_lookup_ht(tp_c, TC_U32_HTID(handle));
275
276 if (!ht)
277 return 0;
278
279 if (TC_U32_KEY(handle) == 0)
280 return (unsigned long)ht;
281
282 return (unsigned long)u32_lookup_key(ht, handle);
283 }
284
285 static void u32_put(struct tcf_proto *tp, unsigned long f)
286 {
287 }
288
289 static u32 gen_new_htid(struct tc_u_common *tp_c)
290 {
291 int i = 0x800;
292
293 do {
294 if (++tp_c->hgenerator == 0x7FF)
295 tp_c->hgenerator = 1;
296 } while (--i > 0 && u32_lookup_ht(tp_c, (tp_c->hgenerator|0x800)<<20));
297
298 return i > 0 ? (tp_c->hgenerator|0x800)<<20 : 0;
299 }
300
301 static int u32_init(struct tcf_proto *tp)
302 {
303 struct tc_u_hnode *root_ht;
304 struct tc_u_common *tp_c;
305
306 tp_c = tp->q->u32_node;
307
308 root_ht = kzalloc(sizeof(*root_ht), GFP_KERNEL);
309 if (root_ht == NULL)
310 return -ENOBUFS;
311
312 root_ht->divisor = 0;
313 root_ht->refcnt++;
314 root_ht->handle = tp_c ? gen_new_htid(tp_c) : 0x80000000;
315 root_ht->prio = tp->prio;
316
317 if (tp_c == NULL) {
318 tp_c = kzalloc(sizeof(*tp_c), GFP_KERNEL);
319 if (tp_c == NULL) {
320 kfree(root_ht);
321 return -ENOBUFS;
322 }
323 tp_c->q = tp->q;
324 tp->q->u32_node = tp_c;
325 }
326
327 tp_c->refcnt++;
328 root_ht->next = tp_c->hlist;
329 tp_c->hlist = root_ht;
330 root_ht->tp_c = tp_c;
331
332 tp->root = root_ht;
333 tp->data = tp_c;
334 return 0;
335 }
336
337 static int u32_destroy_key(struct tcf_proto *tp, struct tc_u_knode *n)
338 {
339 tcf_unbind_filter(tp, &n->res);
340 tcf_exts_destroy(tp, &n->exts);
341 if (n->ht_down)
342 n->ht_down->refcnt--;
343 #ifdef CONFIG_CLS_U32_PERF
344 kfree(n->pf);
345 #endif
346 kfree(n);
347 return 0;
348 }
349
350 static int u32_delete_key(struct tcf_proto *tp, struct tc_u_knode *key)
351 {
352 struct tc_u_knode **kp;
353 struct tc_u_hnode *ht = key->ht_up;
354
355 if (ht) {
356 for (kp = &ht->ht[TC_U32_HASH(key->handle)]; *kp; kp = &(*kp)->next) {
357 if (*kp == key) {
358 tcf_tree_lock(tp);
359 *kp = key->next;
360 tcf_tree_unlock(tp);
361
362 u32_destroy_key(tp, key);
363 return 0;
364 }
365 }
366 }
367 WARN_ON(1);
368 return 0;
369 }
370
371 static void u32_clear_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
372 {
373 struct tc_u_knode *n;
374 unsigned int h;
375
376 for (h = 0; h <= ht->divisor; h++) {
377 while ((n = ht->ht[h]) != NULL) {
378 ht->ht[h] = n->next;
379
380 u32_destroy_key(tp, n);
381 }
382 }
383 }
384
385 static int u32_destroy_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
386 {
387 struct tc_u_common *tp_c = tp->data;
388 struct tc_u_hnode **hn;
389
390 WARN_ON(ht->refcnt);
391
392 u32_clear_hnode(tp, ht);
393
394 for (hn = &tp_c->hlist; *hn; hn = &(*hn)->next) {
395 if (*hn == ht) {
396 *hn = ht->next;
397 kfree(ht);
398 return 0;
399 }
400 }
401
402 WARN_ON(1);
403 return -ENOENT;
404 }
405
406 static void u32_destroy(struct tcf_proto *tp)
407 {
408 struct tc_u_common *tp_c = tp->data;
409 struct tc_u_hnode *root_ht = tp->root;
410
411 WARN_ON(root_ht == NULL);
412
413 if (root_ht && --root_ht->refcnt == 0)
414 u32_destroy_hnode(tp, root_ht);
415
416 if (--tp_c->refcnt == 0) {
417 struct tc_u_hnode *ht;
418
419 tp->q->u32_node = NULL;
420
421 for (ht = tp_c->hlist; ht; ht = ht->next) {
422 ht->refcnt--;
423 u32_clear_hnode(tp, ht);
424 }
425
426 while ((ht = tp_c->hlist) != NULL) {
427 tp_c->hlist = ht->next;
428
429 WARN_ON(ht->refcnt != 0);
430
431 kfree(ht);
432 }
433
434 kfree(tp_c);
435 }
436
437 tp->data = NULL;
438 }
439
440 static int u32_delete(struct tcf_proto *tp, unsigned long arg)
441 {
442 struct tc_u_hnode *ht = (struct tc_u_hnode *)arg;
443
444 if (ht == NULL)
445 return 0;
446
447 if (TC_U32_KEY(ht->handle))
448 return u32_delete_key(tp, (struct tc_u_knode *)ht);
449
450 if (tp->root == ht)
451 return -EINVAL;
452
453 if (ht->refcnt == 1) {
454 ht->refcnt--;
455 u32_destroy_hnode(tp, ht);
456 } else {
457 return -EBUSY;
458 }
459
460 return 0;
461 }
462
463 static u32 gen_new_kid(struct tc_u_hnode *ht, u32 handle)
464 {
465 struct tc_u_knode *n;
466 unsigned int i = 0x7FF;
467
468 for (n = ht->ht[TC_U32_HASH(handle)]; n; n = n->next)
469 if (i < TC_U32_NODE(n->handle))
470 i = TC_U32_NODE(n->handle);
471 i++;
472
473 return handle | (i > 0xFFF ? 0xFFF : i);
474 }
475
476 static const struct nla_policy u32_policy[TCA_U32_MAX + 1] = {
477 [TCA_U32_CLASSID] = { .type = NLA_U32 },
478 [TCA_U32_HASH] = { .type = NLA_U32 },
479 [TCA_U32_LINK] = { .type = NLA_U32 },
480 [TCA_U32_DIVISOR] = { .type = NLA_U32 },
481 [TCA_U32_SEL] = { .len = sizeof(struct tc_u32_sel) },
482 [TCA_U32_INDEV] = { .type = NLA_STRING, .len = IFNAMSIZ },
483 [TCA_U32_MARK] = { .len = sizeof(struct tc_u32_mark) },
484 };
485
486 static int u32_set_parms(struct net *net, struct tcf_proto *tp,
487 unsigned long base, struct tc_u_hnode *ht,
488 struct tc_u_knode *n, struct nlattr **tb,
489 struct nlattr *est)
490 {
491 int err;
492 struct tcf_exts e;
493
494 tcf_exts_init(&e, TCA_U32_ACT, TCA_U32_POLICE);
495 err = tcf_exts_validate(net, tp, tb, est, &e);
496 if (err < 0)
497 return err;
498
499 err = -EINVAL;
500 if (tb[TCA_U32_LINK]) {
501 u32 handle = nla_get_u32(tb[TCA_U32_LINK]);
502 struct tc_u_hnode *ht_down = NULL, *ht_old;
503
504 if (TC_U32_KEY(handle))
505 goto errout;
506
507 if (handle) {
508 ht_down = u32_lookup_ht(ht->tp_c, handle);
509
510 if (ht_down == NULL)
511 goto errout;
512 ht_down->refcnt++;
513 }
514
515 tcf_tree_lock(tp);
516 ht_old = n->ht_down;
517 n->ht_down = ht_down;
518 tcf_tree_unlock(tp);
519
520 if (ht_old)
521 ht_old->refcnt--;
522 }
523 if (tb[TCA_U32_CLASSID]) {
524 n->res.classid = nla_get_u32(tb[TCA_U32_CLASSID]);
525 tcf_bind_filter(tp, &n->res, base);
526 }
527
528 #ifdef CONFIG_NET_CLS_IND
529 if (tb[TCA_U32_INDEV]) {
530 err = tcf_change_indev(tp, n->indev, tb[TCA_U32_INDEV]);
531 if (err < 0)
532 goto errout;
533 }
534 #endif
535 tcf_exts_change(tp, &n->exts, &e);
536
537 return 0;
538 errout:
539 tcf_exts_destroy(tp, &e);
540 return err;
541 }
542
543 static int u32_change(struct net *net, struct sk_buff *in_skb,
544 struct tcf_proto *tp, unsigned long base, u32 handle,
545 struct nlattr **tca,
546 unsigned long *arg)
547 {
548 struct tc_u_common *tp_c = tp->data;
549 struct tc_u_hnode *ht;
550 struct tc_u_knode *n;
551 struct tc_u32_sel *s;
552 struct nlattr *opt = tca[TCA_OPTIONS];
553 struct nlattr *tb[TCA_U32_MAX + 1];
554 u32 htid;
555 int err;
556
557 if (opt == NULL)
558 return handle ? -EINVAL : 0;
559
560 err = nla_parse_nested(tb, TCA_U32_MAX, opt, u32_policy);
561 if (err < 0)
562 return err;
563
564 n = (struct tc_u_knode *)*arg;
565 if (n) {
566 if (TC_U32_KEY(n->handle) == 0)
567 return -EINVAL;
568
569 return u32_set_parms(net, tp, base, n->ht_up, n, tb,
570 tca[TCA_RATE]);
571 }
572
573 if (tb[TCA_U32_DIVISOR]) {
574 unsigned int divisor = nla_get_u32(tb[TCA_U32_DIVISOR]);
575
576 if (--divisor > 0x100)
577 return -EINVAL;
578 if (TC_U32_KEY(handle))
579 return -EINVAL;
580 if (handle == 0) {
581 handle = gen_new_htid(tp->data);
582 if (handle == 0)
583 return -ENOMEM;
584 }
585 ht = kzalloc(sizeof(*ht) + divisor*sizeof(void *), GFP_KERNEL);
586 if (ht == NULL)
587 return -ENOBUFS;
588 ht->tp_c = tp_c;
589 ht->refcnt = 1;
590 ht->divisor = divisor;
591 ht->handle = handle;
592 ht->prio = tp->prio;
593 ht->next = tp_c->hlist;
594 tp_c->hlist = ht;
595 *arg = (unsigned long)ht;
596 return 0;
597 }
598
599 if (tb[TCA_U32_HASH]) {
600 htid = nla_get_u32(tb[TCA_U32_HASH]);
601 if (TC_U32_HTID(htid) == TC_U32_ROOT) {
602 ht = tp->root;
603 htid = ht->handle;
604 } else {
605 ht = u32_lookup_ht(tp->data, TC_U32_HTID(htid));
606 if (ht == NULL)
607 return -EINVAL;
608 }
609 } else {
610 ht = tp->root;
611 htid = ht->handle;
612 }
613
614 if (ht->divisor < TC_U32_HASH(htid))
615 return -EINVAL;
616
617 if (handle) {
618 if (TC_U32_HTID(handle) && TC_U32_HTID(handle^htid))
619 return -EINVAL;
620 handle = htid | TC_U32_NODE(handle);
621 } else
622 handle = gen_new_kid(ht, htid);
623
624 if (tb[TCA_U32_SEL] == NULL)
625 return -EINVAL;
626
627 s = nla_data(tb[TCA_U32_SEL]);
628
629 n = kzalloc(sizeof(*n) + s->nkeys*sizeof(struct tc_u32_key), GFP_KERNEL);
630 if (n == NULL)
631 return -ENOBUFS;
632
633 #ifdef CONFIG_CLS_U32_PERF
634 n->pf = kzalloc(sizeof(struct tc_u32_pcnt) + s->nkeys*sizeof(u64), GFP_KERNEL);
635 if (n->pf == NULL) {
636 kfree(n);
637 return -ENOBUFS;
638 }
639 #endif
640
641 memcpy(&n->sel, s, sizeof(*s) + s->nkeys*sizeof(struct tc_u32_key));
642 n->ht_up = ht;
643 n->handle = handle;
644 n->fshift = s->hmask ? ffs(ntohl(s->hmask)) - 1 : 0;
645 tcf_exts_init(&n->exts, TCA_U32_ACT, TCA_U32_POLICE);
646
647 #ifdef CONFIG_CLS_U32_MARK
648 if (tb[TCA_U32_MARK]) {
649 struct tc_u32_mark *mark;
650
651 mark = nla_data(tb[TCA_U32_MARK]);
652 memcpy(&n->mark, mark, sizeof(struct tc_u32_mark));
653 n->mark.success = 0;
654 }
655 #endif
656
657 err = u32_set_parms(net, tp, base, ht, n, tb, tca[TCA_RATE]);
658 if (err == 0) {
659 struct tc_u_knode **ins;
660 for (ins = &ht->ht[TC_U32_HASH(handle)]; *ins; ins = &(*ins)->next)
661 if (TC_U32_NODE(handle) < TC_U32_NODE((*ins)->handle))
662 break;
663
664 n->next = *ins;
665 tcf_tree_lock(tp);
666 *ins = n;
667 tcf_tree_unlock(tp);
668
669 *arg = (unsigned long)n;
670 return 0;
671 }
672 #ifdef CONFIG_CLS_U32_PERF
673 kfree(n->pf);
674 #endif
675 kfree(n);
676 return err;
677 }
678
679 static void u32_walk(struct tcf_proto *tp, struct tcf_walker *arg)
680 {
681 struct tc_u_common *tp_c = tp->data;
682 struct tc_u_hnode *ht;
683 struct tc_u_knode *n;
684 unsigned int h;
685
686 if (arg->stop)
687 return;
688
689 for (ht = tp_c->hlist; ht; ht = ht->next) {
690 if (ht->prio != tp->prio)
691 continue;
692 if (arg->count >= arg->skip) {
693 if (arg->fn(tp, (unsigned long)ht, arg) < 0) {
694 arg->stop = 1;
695 return;
696 }
697 }
698 arg->count++;
699 for (h = 0; h <= ht->divisor; h++) {
700 for (n = ht->ht[h]; n; n = n->next) {
701 if (arg->count < arg->skip) {
702 arg->count++;
703 continue;
704 }
705 if (arg->fn(tp, (unsigned long)n, arg) < 0) {
706 arg->stop = 1;
707 return;
708 }
709 arg->count++;
710 }
711 }
712 }
713 }
714
715 static int u32_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
716 struct sk_buff *skb, struct tcmsg *t)
717 {
718 struct tc_u_knode *n = (struct tc_u_knode *)fh;
719 struct nlattr *nest;
720
721 if (n == NULL)
722 return skb->len;
723
724 t->tcm_handle = n->handle;
725
726 nest = nla_nest_start(skb, TCA_OPTIONS);
727 if (nest == NULL)
728 goto nla_put_failure;
729
730 if (TC_U32_KEY(n->handle) == 0) {
731 struct tc_u_hnode *ht = (struct tc_u_hnode *)fh;
732 u32 divisor = ht->divisor + 1;
733
734 if (nla_put_u32(skb, TCA_U32_DIVISOR, divisor))
735 goto nla_put_failure;
736 } else {
737 if (nla_put(skb, TCA_U32_SEL,
738 sizeof(n->sel) + n->sel.nkeys*sizeof(struct tc_u32_key),
739 &n->sel))
740 goto nla_put_failure;
741 if (n->ht_up) {
742 u32 htid = n->handle & 0xFFFFF000;
743 if (nla_put_u32(skb, TCA_U32_HASH, htid))
744 goto nla_put_failure;
745 }
746 if (n->res.classid &&
747 nla_put_u32(skb, TCA_U32_CLASSID, n->res.classid))
748 goto nla_put_failure;
749 if (n->ht_down &&
750 nla_put_u32(skb, TCA_U32_LINK, n->ht_down->handle))
751 goto nla_put_failure;
752
753 #ifdef CONFIG_CLS_U32_MARK
754 if ((n->mark.val || n->mark.mask) &&
755 nla_put(skb, TCA_U32_MARK, sizeof(n->mark), &n->mark))
756 goto nla_put_failure;
757 #endif
758
759 if (tcf_exts_dump(skb, &n->exts) < 0)
760 goto nla_put_failure;
761
762 #ifdef CONFIG_NET_CLS_IND
763 if (strlen(n->indev) &&
764 nla_put_string(skb, TCA_U32_INDEV, n->indev))
765 goto nla_put_failure;
766 #endif
767 #ifdef CONFIG_CLS_U32_PERF
768 if (nla_put(skb, TCA_U32_PCNT,
769 sizeof(struct tc_u32_pcnt) + n->sel.nkeys*sizeof(u64),
770 n->pf))
771 goto nla_put_failure;
772 #endif
773 }
774
775 nla_nest_end(skb, nest);
776
777 if (TC_U32_KEY(n->handle))
778 if (tcf_exts_dump_stats(skb, &n->exts) < 0)
779 goto nla_put_failure;
780 return skb->len;
781
782 nla_put_failure:
783 nla_nest_cancel(skb, nest);
784 return -1;
785 }
786
787 static struct tcf_proto_ops cls_u32_ops __read_mostly = {
788 .kind = "u32",
789 .classify = u32_classify,
790 .init = u32_init,
791 .destroy = u32_destroy,
792 .get = u32_get,
793 .put = u32_put,
794 .change = u32_change,
795 .delete = u32_delete,
796 .walk = u32_walk,
797 .dump = u32_dump,
798 .owner = THIS_MODULE,
799 };
800
801 static int __init init_u32(void)
802 {
803 pr_info("u32 classifier\n");
804 #ifdef CONFIG_CLS_U32_PERF
805 pr_info(" Performance counters on\n");
806 #endif
807 #ifdef CONFIG_NET_CLS_IND
808 pr_info(" input device check on\n");
809 #endif
810 #ifdef CONFIG_NET_CLS_ACT
811 pr_info(" Actions configured\n");
812 #endif
813 return register_tcf_proto_ops(&cls_u32_ops);
814 }
815
816 static void __exit exit_u32(void)
817 {
818 unregister_tcf_proto_ops(&cls_u32_ops);
819 }
820
821 module_init(init_u32)
822 module_exit(exit_u32)
823 MODULE_LICENSE("GPL");
Linux kernel - Deliverables
This page took 0.092076 seconds and 5 git commands to generate.