2 * net/sched/cls_u32.c Ugly (or Universal) 32bit key 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: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
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.
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.
20 * It seems that it represents the best middle point between
21 * speed and manageability both by human and by machine.
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.
27 * JHS: We should remove the CONFIG_NET_CLS_IND from here
28 * eventually when the meta match extension is made available
30 * nfmark match added by Catalin(ux aka Dino) BOIE <catab at umbrella.ro>
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/percpu.h>
40 #include <linux/rtnetlink.h>
41 #include <linux/skbuff.h>
42 #include <linux/bitmap.h>
43 #include <net/netlink.h>
44 #include <net/act_api.h>
45 #include <net/pkt_cls.h>
48 struct tc_u_knode __rcu *next;
50 struct tc_u_hnode __rcu *ht_up;
52 #ifdef CONFIG_NET_CLS_IND
56 struct tcf_result res;
57 struct tc_u_hnode __rcu *ht_down;
58 #ifdef CONFIG_CLS_U32_PERF
59 struct tc_u32_pcnt __percpu *pf;
61 #ifdef CONFIG_CLS_U32_MARK
64 u32 __percpu *pcpu_success;
68 /* The 'sel' field MUST be the last field in structure to allow for
69 * tc_u32_keys allocated at end of structure.
71 struct tc_u32_sel sel;
75 struct tc_u_hnode __rcu *next;
78 struct tc_u_common *tp_c;
81 struct tc_u_knode __rcu *ht[1];
86 struct tc_u_hnode __rcu *hlist;
93 static inline unsigned int u32_hash_fold(__be32 key,
94 const struct tc_u32_sel *sel,
97 unsigned int h = ntohl(key & sel->hmask) >> fshift;
102 static int u32_classify(struct sk_buff *skb, const struct tcf_proto *tp, struct tcf_result *res)
105 struct tc_u_knode *knode;
107 } stack[TC_U32_MAXDEPTH];
109 struct tc_u_hnode *ht = rcu_dereference_bh(tp->root);
110 unsigned int off = skb_network_offset(skb);
111 struct tc_u_knode *n;
115 #ifdef CONFIG_CLS_U32_PERF
121 n = rcu_dereference_bh(ht->ht[sel]);
125 struct tc_u32_key *key = n->sel.keys;
127 #ifdef CONFIG_CLS_U32_PERF
128 __this_cpu_inc(n->pf->rcnt);
132 #ifdef CONFIG_CLS_U32_MARK
133 if ((skb->mark & n->mask) != n->val) {
134 n = rcu_dereference_bh(n->next);
137 __this_cpu_inc(*n->pcpu_success);
141 for (i = n->sel.nkeys; i > 0; i--, key++) {
142 int toff = off + key->off + (off2 & key->offmask);
145 if (skb_headroom(skb) + toff > INT_MAX)
148 data = skb_header_pointer(skb, toff, 4, &hdata);
151 if ((*data ^ key->val) & key->mask) {
152 n = rcu_dereference_bh(n->next);
155 #ifdef CONFIG_CLS_U32_PERF
156 __this_cpu_inc(n->pf->kcnts[j]);
161 ht = rcu_dereference_bh(n->ht_down);
164 if (n->sel.flags & TC_U32_TERMINAL) {
167 #ifdef CONFIG_NET_CLS_IND
168 if (!tcf_match_indev(skb, n->ifindex)) {
169 n = rcu_dereference_bh(n->next);
173 #ifdef CONFIG_CLS_U32_PERF
174 __this_cpu_inc(n->pf->rhit);
176 r = tcf_exts_exec(skb, &n->exts, res);
178 n = rcu_dereference_bh(n->next);
184 n = rcu_dereference_bh(n->next);
189 if (sdepth >= TC_U32_MAXDEPTH)
191 stack[sdepth].knode = n;
192 stack[sdepth].off = off;
195 ht = rcu_dereference_bh(n->ht_down);
200 data = skb_header_pointer(skb, off + n->sel.hoff, 4,
204 sel = ht->divisor & u32_hash_fold(*data, &n->sel,
207 if (!(n->sel.flags & (TC_U32_VAROFFSET | TC_U32_OFFSET | TC_U32_EAT)))
210 if (n->sel.flags & (TC_U32_OFFSET | TC_U32_VAROFFSET)) {
211 off2 = n->sel.off + 3;
212 if (n->sel.flags & TC_U32_VAROFFSET) {
215 data = skb_header_pointer(skb,
220 off2 += ntohs(n->sel.offmask & *data) >>
225 if (n->sel.flags & TC_U32_EAT) {
236 n = stack[sdepth].knode;
237 ht = rcu_dereference_bh(n->ht_up);
238 off = stack[sdepth].off;
245 net_warn_ratelimited("cls_u32: dead loop\n");
249 static struct tc_u_hnode *
250 u32_lookup_ht(struct tc_u_common *tp_c, u32 handle)
252 struct tc_u_hnode *ht;
254 for (ht = rtnl_dereference(tp_c->hlist);
256 ht = rtnl_dereference(ht->next))
257 if (ht->handle == handle)
263 static struct tc_u_knode *
264 u32_lookup_key(struct tc_u_hnode *ht, u32 handle)
267 struct tc_u_knode *n = NULL;
269 sel = TC_U32_HASH(handle);
270 if (sel > ht->divisor)
273 for (n = rtnl_dereference(ht->ht[sel]);
275 n = rtnl_dereference(n->next))
276 if (n->handle == handle)
283 static unsigned long u32_get(struct tcf_proto *tp, u32 handle)
285 struct tc_u_hnode *ht;
286 struct tc_u_common *tp_c = tp->data;
288 if (TC_U32_HTID(handle) == TC_U32_ROOT)
289 ht = rtnl_dereference(tp->root);
291 ht = u32_lookup_ht(tp_c, TC_U32_HTID(handle));
296 if (TC_U32_KEY(handle) == 0)
297 return (unsigned long)ht;
299 return (unsigned long)u32_lookup_key(ht, handle);
302 static u32 gen_new_htid(struct tc_u_common *tp_c)
306 /* hgenerator only used inside rtnl lock it is safe to increment
307 * without read _copy_ update semantics
310 if (++tp_c->hgenerator == 0x7FF)
311 tp_c->hgenerator = 1;
312 } while (--i > 0 && u32_lookup_ht(tp_c, (tp_c->hgenerator|0x800)<<20));
314 return i > 0 ? (tp_c->hgenerator|0x800)<<20 : 0;
317 static int u32_init(struct tcf_proto *tp)
319 struct tc_u_hnode *root_ht;
320 struct tc_u_common *tp_c;
322 tp_c = tp->q->u32_node;
324 root_ht = kzalloc(sizeof(*root_ht), GFP_KERNEL);
328 root_ht->divisor = 0;
330 root_ht->handle = tp_c ? gen_new_htid(tp_c) : 0x80000000;
331 root_ht->prio = tp->prio;
334 tp_c = kzalloc(sizeof(*tp_c), GFP_KERNEL);
340 tp->q->u32_node = tp_c;
344 RCU_INIT_POINTER(root_ht->next, tp_c->hlist);
345 rcu_assign_pointer(tp_c->hlist, root_ht);
346 root_ht->tp_c = tp_c;
348 rcu_assign_pointer(tp->root, root_ht);
353 static int u32_destroy_key(struct tcf_proto *tp,
354 struct tc_u_knode *n,
357 tcf_exts_destroy(&n->exts);
359 n->ht_down->refcnt--;
360 #ifdef CONFIG_CLS_U32_PERF
364 #ifdef CONFIG_CLS_U32_MARK
366 free_percpu(n->pcpu_success);
372 /* u32_delete_key_rcu should be called when free'ing a copied
373 * version of a tc_u_knode obtained from u32_init_knode(). When
374 * copies are obtained from u32_init_knode() the statistics are
375 * shared between the old and new copies to allow readers to
376 * continue to update the statistics during the copy. To support
377 * this the u32_delete_key_rcu variant does not free the percpu
380 static void u32_delete_key_rcu(struct rcu_head *rcu)
382 struct tc_u_knode *key = container_of(rcu, struct tc_u_knode, rcu);
384 u32_destroy_key(key->tp, key, false);
387 /* u32_delete_key_freepf_rcu is the rcu callback variant
388 * that free's the entire structure including the statistics
389 * percpu variables. Only use this if the key is not a copy
390 * returned by u32_init_knode(). See u32_delete_key_rcu()
391 * for the variant that should be used with keys return from
394 static void u32_delete_key_freepf_rcu(struct rcu_head *rcu)
396 struct tc_u_knode *key = container_of(rcu, struct tc_u_knode, rcu);
398 u32_destroy_key(key->tp, key, true);
401 static int u32_delete_key(struct tcf_proto *tp, struct tc_u_knode *key)
403 struct tc_u_knode __rcu **kp;
404 struct tc_u_knode *pkp;
405 struct tc_u_hnode *ht = rtnl_dereference(key->ht_up);
408 kp = &ht->ht[TC_U32_HASH(key->handle)];
409 for (pkp = rtnl_dereference(*kp); pkp;
410 kp = &pkp->next, pkp = rtnl_dereference(*kp)) {
412 RCU_INIT_POINTER(*kp, key->next);
414 tcf_unbind_filter(tp, &key->res);
415 call_rcu(&key->rcu, u32_delete_key_freepf_rcu);
424 static void u32_clear_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
426 struct tc_u_knode *n;
429 for (h = 0; h <= ht->divisor; h++) {
430 while ((n = rtnl_dereference(ht->ht[h])) != NULL) {
431 RCU_INIT_POINTER(ht->ht[h],
432 rtnl_dereference(n->next));
433 tcf_unbind_filter(tp, &n->res);
434 call_rcu(&n->rcu, u32_delete_key_freepf_rcu);
439 static int u32_destroy_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
441 struct tc_u_common *tp_c = tp->data;
442 struct tc_u_hnode __rcu **hn;
443 struct tc_u_hnode *phn;
447 u32_clear_hnode(tp, ht);
450 for (phn = rtnl_dereference(*hn);
452 hn = &phn->next, phn = rtnl_dereference(*hn)) {
454 RCU_INIT_POINTER(*hn, ht->next);
463 static void u32_destroy(struct tcf_proto *tp)
465 struct tc_u_common *tp_c = tp->data;
466 struct tc_u_hnode *root_ht = rtnl_dereference(tp->root);
468 WARN_ON(root_ht == NULL);
470 if (root_ht && --root_ht->refcnt == 0)
471 u32_destroy_hnode(tp, root_ht);
473 if (--tp_c->refcnt == 0) {
474 struct tc_u_hnode *ht;
476 tp->q->u32_node = NULL;
478 for (ht = rtnl_dereference(tp_c->hlist);
480 ht = rtnl_dereference(ht->next)) {
482 u32_clear_hnode(tp, ht);
485 while ((ht = rtnl_dereference(tp_c->hlist)) != NULL) {
486 RCU_INIT_POINTER(tp_c->hlist, ht->next);
496 static int u32_delete(struct tcf_proto *tp, unsigned long arg)
498 struct tc_u_hnode *ht = (struct tc_u_hnode *)arg;
499 struct tc_u_hnode *root_ht = rtnl_dereference(tp->root);
504 if (TC_U32_KEY(ht->handle))
505 return u32_delete_key(tp, (struct tc_u_knode *)ht);
510 if (ht->refcnt == 1) {
512 u32_destroy_hnode(tp, ht);
520 #define NR_U32_NODE (1<<12)
521 static u32 gen_new_kid(struct tc_u_hnode *ht, u32 handle)
523 struct tc_u_knode *n;
525 unsigned long *bitmap = kzalloc(BITS_TO_LONGS(NR_U32_NODE) * sizeof(unsigned long),
528 return handle | 0xFFF;
530 for (n = rtnl_dereference(ht->ht[TC_U32_HASH(handle)]);
532 n = rtnl_dereference(n->next))
533 set_bit(TC_U32_NODE(n->handle), bitmap);
535 i = find_next_zero_bit(bitmap, NR_U32_NODE, 0x800);
536 if (i >= NR_U32_NODE)
537 i = find_next_zero_bit(bitmap, NR_U32_NODE, 1);
540 return handle | (i >= NR_U32_NODE ? 0xFFF : i);
543 static const struct nla_policy u32_policy[TCA_U32_MAX + 1] = {
544 [TCA_U32_CLASSID] = { .type = NLA_U32 },
545 [TCA_U32_HASH] = { .type = NLA_U32 },
546 [TCA_U32_LINK] = { .type = NLA_U32 },
547 [TCA_U32_DIVISOR] = { .type = NLA_U32 },
548 [TCA_U32_SEL] = { .len = sizeof(struct tc_u32_sel) },
549 [TCA_U32_INDEV] = { .type = NLA_STRING, .len = IFNAMSIZ },
550 [TCA_U32_MARK] = { .len = sizeof(struct tc_u32_mark) },
553 static int u32_set_parms(struct net *net, struct tcf_proto *tp,
554 unsigned long base, struct tc_u_hnode *ht,
555 struct tc_u_knode *n, struct nlattr **tb,
556 struct nlattr *est, bool ovr)
561 tcf_exts_init(&e, TCA_U32_ACT, TCA_U32_POLICE);
562 err = tcf_exts_validate(net, tp, tb, est, &e, ovr);
567 if (tb[TCA_U32_LINK]) {
568 u32 handle = nla_get_u32(tb[TCA_U32_LINK]);
569 struct tc_u_hnode *ht_down = NULL, *ht_old;
571 if (TC_U32_KEY(handle))
575 ht_down = u32_lookup_ht(ht->tp_c, handle);
582 ht_old = rtnl_dereference(n->ht_down);
583 rcu_assign_pointer(n->ht_down, ht_down);
588 if (tb[TCA_U32_CLASSID]) {
589 n->res.classid = nla_get_u32(tb[TCA_U32_CLASSID]);
590 tcf_bind_filter(tp, &n->res, base);
593 #ifdef CONFIG_NET_CLS_IND
594 if (tb[TCA_U32_INDEV]) {
596 ret = tcf_change_indev(net, tb[TCA_U32_INDEV]);
602 tcf_exts_change(tp, &n->exts, &e);
606 tcf_exts_destroy(&e);
610 static void u32_replace_knode(struct tcf_proto *tp,
611 struct tc_u_common *tp_c,
612 struct tc_u_knode *n)
614 struct tc_u_knode __rcu **ins;
615 struct tc_u_knode *pins;
616 struct tc_u_hnode *ht;
618 if (TC_U32_HTID(n->handle) == TC_U32_ROOT)
619 ht = rtnl_dereference(tp->root);
621 ht = u32_lookup_ht(tp_c, TC_U32_HTID(n->handle));
623 ins = &ht->ht[TC_U32_HASH(n->handle)];
625 /* The node must always exist for it to be replaced if this is not the
626 * case then something went very wrong elsewhere.
628 for (pins = rtnl_dereference(*ins); ;
629 ins = &pins->next, pins = rtnl_dereference(*ins))
630 if (pins->handle == n->handle)
633 RCU_INIT_POINTER(n->next, pins->next);
634 rcu_assign_pointer(*ins, n);
637 static struct tc_u_knode *u32_init_knode(struct tcf_proto *tp,
638 struct tc_u_knode *n)
640 struct tc_u_knode *new;
641 struct tc_u32_sel *s = &n->sel;
643 new = kzalloc(sizeof(*n) + s->nkeys*sizeof(struct tc_u32_key),
649 RCU_INIT_POINTER(new->next, n->next);
650 new->handle = n->handle;
651 RCU_INIT_POINTER(new->ht_up, n->ht_up);
653 #ifdef CONFIG_NET_CLS_IND
654 new->ifindex = n->ifindex;
656 new->fshift = n->fshift;
658 RCU_INIT_POINTER(new->ht_down, n->ht_down);
660 /* bump reference count as long as we hold pointer to structure */
662 new->ht_down->refcnt++;
664 #ifdef CONFIG_CLS_U32_PERF
665 /* Statistics may be incremented by readers during update
666 * so we must keep them in tact. When the node is later destroyed
667 * a special destroy call must be made to not free the pf memory.
672 #ifdef CONFIG_CLS_U32_MARK
675 /* Similarly success statistics must be moved as pointers */
676 new->pcpu_success = n->pcpu_success;
679 memcpy(&new->sel, s, sizeof(*s) + s->nkeys*sizeof(struct tc_u32_key));
681 tcf_exts_init(&new->exts, TCA_U32_ACT, TCA_U32_POLICE);
686 static int u32_change(struct net *net, struct sk_buff *in_skb,
687 struct tcf_proto *tp, unsigned long base, u32 handle,
689 unsigned long *arg, bool ovr)
691 struct tc_u_common *tp_c = tp->data;
692 struct tc_u_hnode *ht;
693 struct tc_u_knode *n;
694 struct tc_u32_sel *s;
695 struct nlattr *opt = tca[TCA_OPTIONS];
696 struct nlattr *tb[TCA_U32_MAX + 1];
699 #ifdef CONFIG_CLS_U32_PERF
704 return handle ? -EINVAL : 0;
706 err = nla_parse_nested(tb, TCA_U32_MAX, opt, u32_policy);
710 n = (struct tc_u_knode *)*arg;
712 struct tc_u_knode *new;
714 if (TC_U32_KEY(n->handle) == 0)
717 new = u32_init_knode(tp, n);
721 err = u32_set_parms(net, tp, base,
722 rtnl_dereference(n->ht_up), new, tb,
726 u32_destroy_key(tp, new, false);
730 u32_replace_knode(tp, tp_c, new);
731 tcf_unbind_filter(tp, &n->res);
732 call_rcu(&n->rcu, u32_delete_key_rcu);
736 if (tb[TCA_U32_DIVISOR]) {
737 unsigned int divisor = nla_get_u32(tb[TCA_U32_DIVISOR]);
739 if (--divisor > 0x100)
741 if (TC_U32_KEY(handle))
744 handle = gen_new_htid(tp->data);
748 ht = kzalloc(sizeof(*ht) + divisor*sizeof(void *), GFP_KERNEL);
753 ht->divisor = divisor;
756 RCU_INIT_POINTER(ht->next, tp_c->hlist);
757 rcu_assign_pointer(tp_c->hlist, ht);
758 *arg = (unsigned long)ht;
762 if (tb[TCA_U32_HASH]) {
763 htid = nla_get_u32(tb[TCA_U32_HASH]);
764 if (TC_U32_HTID(htid) == TC_U32_ROOT) {
765 ht = rtnl_dereference(tp->root);
768 ht = u32_lookup_ht(tp->data, TC_U32_HTID(htid));
773 ht = rtnl_dereference(tp->root);
777 if (ht->divisor < TC_U32_HASH(htid))
781 if (TC_U32_HTID(handle) && TC_U32_HTID(handle^htid))
783 handle = htid | TC_U32_NODE(handle);
785 handle = gen_new_kid(ht, htid);
787 if (tb[TCA_U32_SEL] == NULL)
790 s = nla_data(tb[TCA_U32_SEL]);
792 n = kzalloc(sizeof(*n) + s->nkeys*sizeof(struct tc_u32_key), GFP_KERNEL);
796 #ifdef CONFIG_CLS_U32_PERF
797 size = sizeof(struct tc_u32_pcnt) + s->nkeys * sizeof(u64);
798 n->pf = __alloc_percpu(size, __alignof__(struct tc_u32_pcnt));
805 memcpy(&n->sel, s, sizeof(*s) + s->nkeys*sizeof(struct tc_u32_key));
806 RCU_INIT_POINTER(n->ht_up, ht);
808 n->fshift = s->hmask ? ffs(ntohl(s->hmask)) - 1 : 0;
809 tcf_exts_init(&n->exts, TCA_U32_ACT, TCA_U32_POLICE);
812 #ifdef CONFIG_CLS_U32_MARK
813 n->pcpu_success = alloc_percpu(u32);
814 if (!n->pcpu_success) {
819 if (tb[TCA_U32_MARK]) {
820 struct tc_u32_mark *mark;
822 mark = nla_data(tb[TCA_U32_MARK]);
824 n->mask = mark->mask;
828 err = u32_set_parms(net, tp, base, ht, n, tb, tca[TCA_RATE], ovr);
830 struct tc_u_knode __rcu **ins;
831 struct tc_u_knode *pins;
833 ins = &ht->ht[TC_U32_HASH(handle)];
834 for (pins = rtnl_dereference(*ins); pins;
835 ins = &pins->next, pins = rtnl_dereference(*ins))
836 if (TC_U32_NODE(handle) < TC_U32_NODE(pins->handle))
839 RCU_INIT_POINTER(n->next, pins);
840 rcu_assign_pointer(*ins, n);
842 *arg = (unsigned long)n;
846 #ifdef CONFIG_CLS_U32_MARK
847 free_percpu(n->pcpu_success);
851 #ifdef CONFIG_CLS_U32_PERF
858 static void u32_walk(struct tcf_proto *tp, struct tcf_walker *arg)
860 struct tc_u_common *tp_c = tp->data;
861 struct tc_u_hnode *ht;
862 struct tc_u_knode *n;
868 for (ht = rtnl_dereference(tp_c->hlist);
870 ht = rtnl_dereference(ht->next)) {
871 if (ht->prio != tp->prio)
873 if (arg->count >= arg->skip) {
874 if (arg->fn(tp, (unsigned long)ht, arg) < 0) {
880 for (h = 0; h <= ht->divisor; h++) {
881 for (n = rtnl_dereference(ht->ht[h]);
883 n = rtnl_dereference(n->next)) {
884 if (arg->count < arg->skip) {
888 if (arg->fn(tp, (unsigned long)n, arg) < 0) {
898 static int u32_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
899 struct sk_buff *skb, struct tcmsg *t)
901 struct tc_u_knode *n = (struct tc_u_knode *)fh;
902 struct tc_u_hnode *ht_up, *ht_down;
908 t->tcm_handle = n->handle;
910 nest = nla_nest_start(skb, TCA_OPTIONS);
912 goto nla_put_failure;
914 if (TC_U32_KEY(n->handle) == 0) {
915 struct tc_u_hnode *ht = (struct tc_u_hnode *)fh;
916 u32 divisor = ht->divisor + 1;
918 if (nla_put_u32(skb, TCA_U32_DIVISOR, divisor))
919 goto nla_put_failure;
921 #ifdef CONFIG_CLS_U32_PERF
922 struct tc_u32_pcnt *gpf;
926 if (nla_put(skb, TCA_U32_SEL,
927 sizeof(n->sel) + n->sel.nkeys*sizeof(struct tc_u32_key),
929 goto nla_put_failure;
931 ht_up = rtnl_dereference(n->ht_up);
933 u32 htid = n->handle & 0xFFFFF000;
934 if (nla_put_u32(skb, TCA_U32_HASH, htid))
935 goto nla_put_failure;
937 if (n->res.classid &&
938 nla_put_u32(skb, TCA_U32_CLASSID, n->res.classid))
939 goto nla_put_failure;
941 ht_down = rtnl_dereference(n->ht_down);
943 nla_put_u32(skb, TCA_U32_LINK, ht_down->handle))
944 goto nla_put_failure;
946 #ifdef CONFIG_CLS_U32_MARK
947 if ((n->val || n->mask)) {
948 struct tc_u32_mark mark = {.val = n->val,
953 for_each_possible_cpu(cpum) {
954 __u32 cnt = *per_cpu_ptr(n->pcpu_success, cpum);
959 if (nla_put(skb, TCA_U32_MARK, sizeof(mark), &mark))
960 goto nla_put_failure;
964 if (tcf_exts_dump(skb, &n->exts) < 0)
965 goto nla_put_failure;
967 #ifdef CONFIG_NET_CLS_IND
969 struct net_device *dev;
970 dev = __dev_get_by_index(net, n->ifindex);
971 if (dev && nla_put_string(skb, TCA_U32_INDEV, dev->name))
972 goto nla_put_failure;
975 #ifdef CONFIG_CLS_U32_PERF
976 gpf = kzalloc(sizeof(struct tc_u32_pcnt) +
977 n->sel.nkeys * sizeof(u64),
980 goto nla_put_failure;
982 for_each_possible_cpu(cpu) {
984 struct tc_u32_pcnt *pf = per_cpu_ptr(n->pf, cpu);
986 gpf->rcnt += pf->rcnt;
987 gpf->rhit += pf->rhit;
988 for (i = 0; i < n->sel.nkeys; i++)
989 gpf->kcnts[i] += pf->kcnts[i];
992 if (nla_put(skb, TCA_U32_PCNT,
993 sizeof(struct tc_u32_pcnt) + n->sel.nkeys*sizeof(u64),
996 goto nla_put_failure;
1002 nla_nest_end(skb, nest);
1004 if (TC_U32_KEY(n->handle))
1005 if (tcf_exts_dump_stats(skb, &n->exts) < 0)
1006 goto nla_put_failure;
1010 nla_nest_cancel(skb, nest);
1014 static struct tcf_proto_ops cls_u32_ops __read_mostly = {
1016 .classify = u32_classify,
1018 .destroy = u32_destroy,
1020 .change = u32_change,
1021 .delete = u32_delete,
1024 .owner = THIS_MODULE,
1027 static int __init init_u32(void)
1029 pr_info("u32 classifier\n");
1030 #ifdef CONFIG_CLS_U32_PERF
1031 pr_info(" Performance counters on\n");
1033 #ifdef CONFIG_NET_CLS_IND
1034 pr_info(" input device check on\n");
1036 #ifdef CONFIG_NET_CLS_ACT
1037 pr_info(" Actions configured\n");
1039 return register_tcf_proto_ops(&cls_u32_ops);
1042 static void __exit exit_u32(void)
1044 unregister_tcf_proto_ops(&cls_u32_ops);
1047 module_init(init_u32)
1048 module_exit(exit_u32)
1049 MODULE_LICENSE("GPL");