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 void u32_put(struct tcf_proto *tp, unsigned long f)
306 static u32 gen_new_htid(struct tc_u_common *tp_c)
310 /* hgenerator only used inside rtnl lock it is safe to increment
311 * without read _copy_ update semantics
314 if (++tp_c->hgenerator == 0x7FF)
315 tp_c->hgenerator = 1;
316 } while (--i > 0 && u32_lookup_ht(tp_c, (tp_c->hgenerator|0x800)<<20));
318 return i > 0 ? (tp_c->hgenerator|0x800)<<20 : 0;
321 static int u32_init(struct tcf_proto *tp)
323 struct tc_u_hnode *root_ht;
324 struct tc_u_common *tp_c;
326 tp_c = tp->q->u32_node;
328 root_ht = kzalloc(sizeof(*root_ht), GFP_KERNEL);
332 root_ht->divisor = 0;
334 root_ht->handle = tp_c ? gen_new_htid(tp_c) : 0x80000000;
335 root_ht->prio = tp->prio;
338 tp_c = kzalloc(sizeof(*tp_c), GFP_KERNEL);
344 tp->q->u32_node = tp_c;
348 RCU_INIT_POINTER(root_ht->next, tp_c->hlist);
349 rcu_assign_pointer(tp_c->hlist, root_ht);
350 root_ht->tp_c = tp_c;
352 rcu_assign_pointer(tp->root, root_ht);
357 static int u32_destroy_key(struct tcf_proto *tp,
358 struct tc_u_knode *n,
361 tcf_exts_destroy(&n->exts);
363 n->ht_down->refcnt--;
364 #ifdef CONFIG_CLS_U32_PERF
368 #ifdef CONFIG_CLS_U32_MARK
370 free_percpu(n->pcpu_success);
376 /* u32_delete_key_rcu should be called when free'ing a copied
377 * version of a tc_u_knode obtained from u32_init_knode(). When
378 * copies are obtained from u32_init_knode() the statistics are
379 * shared between the old and new copies to allow readers to
380 * continue to update the statistics during the copy. To support
381 * this the u32_delete_key_rcu variant does not free the percpu
384 static void u32_delete_key_rcu(struct rcu_head *rcu)
386 struct tc_u_knode *key = container_of(rcu, struct tc_u_knode, rcu);
388 u32_destroy_key(key->tp, key, false);
391 /* u32_delete_key_freepf_rcu is the rcu callback variant
392 * that free's the entire structure including the statistics
393 * percpu variables. Only use this if the key is not a copy
394 * returned by u32_init_knode(). See u32_delete_key_rcu()
395 * for the variant that should be used with keys return from
398 static void u32_delete_key_freepf_rcu(struct rcu_head *rcu)
400 struct tc_u_knode *key = container_of(rcu, struct tc_u_knode, rcu);
402 u32_destroy_key(key->tp, key, true);
405 static int u32_delete_key(struct tcf_proto *tp, struct tc_u_knode *key)
407 struct tc_u_knode __rcu **kp;
408 struct tc_u_knode *pkp;
409 struct tc_u_hnode *ht = rtnl_dereference(key->ht_up);
412 kp = &ht->ht[TC_U32_HASH(key->handle)];
413 for (pkp = rtnl_dereference(*kp); pkp;
414 kp = &pkp->next, pkp = rtnl_dereference(*kp)) {
416 RCU_INIT_POINTER(*kp, key->next);
418 tcf_unbind_filter(tp, &key->res);
419 call_rcu(&key->rcu, u32_delete_key_freepf_rcu);
428 static void u32_clear_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
430 struct tc_u_knode *n;
433 for (h = 0; h <= ht->divisor; h++) {
434 while ((n = rtnl_dereference(ht->ht[h])) != NULL) {
435 RCU_INIT_POINTER(ht->ht[h],
436 rtnl_dereference(n->next));
437 tcf_unbind_filter(tp, &n->res);
438 call_rcu(&n->rcu, u32_delete_key_freepf_rcu);
443 static int u32_destroy_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
445 struct tc_u_common *tp_c = tp->data;
446 struct tc_u_hnode __rcu **hn;
447 struct tc_u_hnode *phn;
451 u32_clear_hnode(tp, ht);
454 for (phn = rtnl_dereference(*hn);
456 hn = &phn->next, phn = rtnl_dereference(*hn)) {
458 RCU_INIT_POINTER(*hn, ht->next);
467 static void u32_destroy(struct tcf_proto *tp)
469 struct tc_u_common *tp_c = tp->data;
470 struct tc_u_hnode *root_ht = rtnl_dereference(tp->root);
472 WARN_ON(root_ht == NULL);
474 if (root_ht && --root_ht->refcnt == 0)
475 u32_destroy_hnode(tp, root_ht);
477 if (--tp_c->refcnt == 0) {
478 struct tc_u_hnode *ht;
480 tp->q->u32_node = NULL;
482 for (ht = rtnl_dereference(tp_c->hlist);
484 ht = rtnl_dereference(ht->next)) {
486 u32_clear_hnode(tp, ht);
489 while ((ht = rtnl_dereference(tp_c->hlist)) != NULL) {
490 RCU_INIT_POINTER(tp_c->hlist, ht->next);
500 static int u32_delete(struct tcf_proto *tp, unsigned long arg)
502 struct tc_u_hnode *ht = (struct tc_u_hnode *)arg;
503 struct tc_u_hnode *root_ht = rtnl_dereference(tp->root);
508 if (TC_U32_KEY(ht->handle))
509 return u32_delete_key(tp, (struct tc_u_knode *)ht);
514 if (ht->refcnt == 1) {
516 u32_destroy_hnode(tp, ht);
524 #define NR_U32_NODE (1<<12)
525 static u32 gen_new_kid(struct tc_u_hnode *ht, u32 handle)
527 struct tc_u_knode *n;
529 unsigned long *bitmap = kzalloc(BITS_TO_LONGS(NR_U32_NODE) * sizeof(unsigned long),
532 return handle | 0xFFF;
534 for (n = rtnl_dereference(ht->ht[TC_U32_HASH(handle)]);
536 n = rtnl_dereference(n->next))
537 set_bit(TC_U32_NODE(n->handle), bitmap);
539 i = find_next_zero_bit(bitmap, NR_U32_NODE, 0x800);
540 if (i >= NR_U32_NODE)
541 i = find_next_zero_bit(bitmap, NR_U32_NODE, 1);
544 return handle | (i >= NR_U32_NODE ? 0xFFF : i);
547 static const struct nla_policy u32_policy[TCA_U32_MAX + 1] = {
548 [TCA_U32_CLASSID] = { .type = NLA_U32 },
549 [TCA_U32_HASH] = { .type = NLA_U32 },
550 [TCA_U32_LINK] = { .type = NLA_U32 },
551 [TCA_U32_DIVISOR] = { .type = NLA_U32 },
552 [TCA_U32_SEL] = { .len = sizeof(struct tc_u32_sel) },
553 [TCA_U32_INDEV] = { .type = NLA_STRING, .len = IFNAMSIZ },
554 [TCA_U32_MARK] = { .len = sizeof(struct tc_u32_mark) },
557 static int u32_set_parms(struct net *net, struct tcf_proto *tp,
558 unsigned long base, struct tc_u_hnode *ht,
559 struct tc_u_knode *n, struct nlattr **tb,
560 struct nlattr *est, bool ovr)
565 tcf_exts_init(&e, TCA_U32_ACT, TCA_U32_POLICE);
566 err = tcf_exts_validate(net, tp, tb, est, &e, ovr);
571 if (tb[TCA_U32_LINK]) {
572 u32 handle = nla_get_u32(tb[TCA_U32_LINK]);
573 struct tc_u_hnode *ht_down = NULL, *ht_old;
575 if (TC_U32_KEY(handle))
579 ht_down = u32_lookup_ht(ht->tp_c, handle);
586 ht_old = rtnl_dereference(n->ht_down);
587 rcu_assign_pointer(n->ht_down, ht_down);
592 if (tb[TCA_U32_CLASSID]) {
593 n->res.classid = nla_get_u32(tb[TCA_U32_CLASSID]);
594 tcf_bind_filter(tp, &n->res, base);
597 #ifdef CONFIG_NET_CLS_IND
598 if (tb[TCA_U32_INDEV]) {
600 ret = tcf_change_indev(net, tb[TCA_U32_INDEV]);
606 tcf_exts_change(tp, &n->exts, &e);
610 tcf_exts_destroy(&e);
614 static void u32_replace_knode(struct tcf_proto *tp,
615 struct tc_u_common *tp_c,
616 struct tc_u_knode *n)
618 struct tc_u_knode __rcu **ins;
619 struct tc_u_knode *pins;
620 struct tc_u_hnode *ht;
622 if (TC_U32_HTID(n->handle) == TC_U32_ROOT)
623 ht = rtnl_dereference(tp->root);
625 ht = u32_lookup_ht(tp_c, TC_U32_HTID(n->handle));
627 ins = &ht->ht[TC_U32_HASH(n->handle)];
629 /* The node must always exist for it to be replaced if this is not the
630 * case then something went very wrong elsewhere.
632 for (pins = rtnl_dereference(*ins); ;
633 ins = &pins->next, pins = rtnl_dereference(*ins))
634 if (pins->handle == n->handle)
637 RCU_INIT_POINTER(n->next, pins->next);
638 rcu_assign_pointer(*ins, n);
641 static struct tc_u_knode *u32_init_knode(struct tcf_proto *tp,
642 struct tc_u_knode *n)
644 struct tc_u_knode *new;
645 struct tc_u32_sel *s = &n->sel;
647 new = kzalloc(sizeof(*n) + s->nkeys*sizeof(struct tc_u32_key),
653 RCU_INIT_POINTER(new->next, n->next);
654 new->handle = n->handle;
655 RCU_INIT_POINTER(new->ht_up, n->ht_up);
657 #ifdef CONFIG_NET_CLS_IND
658 new->ifindex = n->ifindex;
660 new->fshift = n->fshift;
662 RCU_INIT_POINTER(new->ht_down, n->ht_down);
664 /* bump reference count as long as we hold pointer to structure */
666 new->ht_down->refcnt++;
668 #ifdef CONFIG_CLS_U32_PERF
669 /* Statistics may be incremented by readers during update
670 * so we must keep them in tact. When the node is later destroyed
671 * a special destroy call must be made to not free the pf memory.
676 #ifdef CONFIG_CLS_U32_MARK
679 /* Similarly success statistics must be moved as pointers */
680 new->pcpu_success = n->pcpu_success;
683 memcpy(&new->sel, s, sizeof(*s) + s->nkeys*sizeof(struct tc_u32_key));
685 tcf_exts_init(&new->exts, TCA_U32_ACT, TCA_U32_POLICE);
690 static int u32_change(struct net *net, struct sk_buff *in_skb,
691 struct tcf_proto *tp, unsigned long base, u32 handle,
693 unsigned long *arg, bool ovr)
695 struct tc_u_common *tp_c = tp->data;
696 struct tc_u_hnode *ht;
697 struct tc_u_knode *n;
698 struct tc_u32_sel *s;
699 struct nlattr *opt = tca[TCA_OPTIONS];
700 struct nlattr *tb[TCA_U32_MAX + 1];
703 #ifdef CONFIG_CLS_U32_PERF
708 return handle ? -EINVAL : 0;
710 err = nla_parse_nested(tb, TCA_U32_MAX, opt, u32_policy);
714 n = (struct tc_u_knode *)*arg;
716 struct tc_u_knode *new;
718 if (TC_U32_KEY(n->handle) == 0)
721 new = u32_init_knode(tp, n);
725 err = u32_set_parms(net, tp, base,
726 rtnl_dereference(n->ht_up), new, tb,
730 u32_destroy_key(tp, new, false);
734 u32_replace_knode(tp, tp_c, new);
735 tcf_unbind_filter(tp, &n->res);
736 call_rcu(&n->rcu, u32_delete_key_rcu);
740 if (tb[TCA_U32_DIVISOR]) {
741 unsigned int divisor = nla_get_u32(tb[TCA_U32_DIVISOR]);
743 if (--divisor > 0x100)
745 if (TC_U32_KEY(handle))
748 handle = gen_new_htid(tp->data);
752 ht = kzalloc(sizeof(*ht) + divisor*sizeof(void *), GFP_KERNEL);
757 ht->divisor = divisor;
760 RCU_INIT_POINTER(ht->next, tp_c->hlist);
761 rcu_assign_pointer(tp_c->hlist, ht);
762 *arg = (unsigned long)ht;
766 if (tb[TCA_U32_HASH]) {
767 htid = nla_get_u32(tb[TCA_U32_HASH]);
768 if (TC_U32_HTID(htid) == TC_U32_ROOT) {
769 ht = rtnl_dereference(tp->root);
772 ht = u32_lookup_ht(tp->data, TC_U32_HTID(htid));
777 ht = rtnl_dereference(tp->root);
781 if (ht->divisor < TC_U32_HASH(htid))
785 if (TC_U32_HTID(handle) && TC_U32_HTID(handle^htid))
787 handle = htid | TC_U32_NODE(handle);
789 handle = gen_new_kid(ht, htid);
791 if (tb[TCA_U32_SEL] == NULL)
794 s = nla_data(tb[TCA_U32_SEL]);
796 n = kzalloc(sizeof(*n) + s->nkeys*sizeof(struct tc_u32_key), GFP_KERNEL);
800 #ifdef CONFIG_CLS_U32_PERF
801 size = sizeof(struct tc_u32_pcnt) + s->nkeys * sizeof(u64);
802 n->pf = __alloc_percpu(size, __alignof__(struct tc_u32_pcnt));
809 memcpy(&n->sel, s, sizeof(*s) + s->nkeys*sizeof(struct tc_u32_key));
810 RCU_INIT_POINTER(n->ht_up, ht);
812 n->fshift = s->hmask ? ffs(ntohl(s->hmask)) - 1 : 0;
813 tcf_exts_init(&n->exts, TCA_U32_ACT, TCA_U32_POLICE);
816 #ifdef CONFIG_CLS_U32_MARK
817 n->pcpu_success = alloc_percpu(u32);
818 if (!n->pcpu_success) {
823 if (tb[TCA_U32_MARK]) {
824 struct tc_u32_mark *mark;
826 mark = nla_data(tb[TCA_U32_MARK]);
828 n->mask = mark->mask;
832 err = u32_set_parms(net, tp, base, ht, n, tb, tca[TCA_RATE], ovr);
834 struct tc_u_knode __rcu **ins;
835 struct tc_u_knode *pins;
837 ins = &ht->ht[TC_U32_HASH(handle)];
838 for (pins = rtnl_dereference(*ins); pins;
839 ins = &pins->next, pins = rtnl_dereference(*ins))
840 if (TC_U32_NODE(handle) < TC_U32_NODE(pins->handle))
843 RCU_INIT_POINTER(n->next, pins);
844 rcu_assign_pointer(*ins, n);
846 *arg = (unsigned long)n;
850 #ifdef CONFIG_CLS_U32_MARK
851 free_percpu(n->pcpu_success);
855 #ifdef CONFIG_CLS_U32_PERF
862 static void u32_walk(struct tcf_proto *tp, struct tcf_walker *arg)
864 struct tc_u_common *tp_c = tp->data;
865 struct tc_u_hnode *ht;
866 struct tc_u_knode *n;
872 for (ht = rtnl_dereference(tp_c->hlist);
874 ht = rtnl_dereference(ht->next)) {
875 if (ht->prio != tp->prio)
877 if (arg->count >= arg->skip) {
878 if (arg->fn(tp, (unsigned long)ht, arg) < 0) {
884 for (h = 0; h <= ht->divisor; h++) {
885 for (n = rtnl_dereference(ht->ht[h]);
887 n = rtnl_dereference(n->next)) {
888 if (arg->count < arg->skip) {
892 if (arg->fn(tp, (unsigned long)n, arg) < 0) {
902 static int u32_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
903 struct sk_buff *skb, struct tcmsg *t)
905 struct tc_u_knode *n = (struct tc_u_knode *)fh;
906 struct tc_u_hnode *ht_up, *ht_down;
912 t->tcm_handle = n->handle;
914 nest = nla_nest_start(skb, TCA_OPTIONS);
916 goto nla_put_failure;
918 if (TC_U32_KEY(n->handle) == 0) {
919 struct tc_u_hnode *ht = (struct tc_u_hnode *)fh;
920 u32 divisor = ht->divisor + 1;
922 if (nla_put_u32(skb, TCA_U32_DIVISOR, divisor))
923 goto nla_put_failure;
925 #ifdef CONFIG_CLS_U32_PERF
926 struct tc_u32_pcnt *gpf;
930 if (nla_put(skb, TCA_U32_SEL,
931 sizeof(n->sel) + n->sel.nkeys*sizeof(struct tc_u32_key),
933 goto nla_put_failure;
935 ht_up = rtnl_dereference(n->ht_up);
937 u32 htid = n->handle & 0xFFFFF000;
938 if (nla_put_u32(skb, TCA_U32_HASH, htid))
939 goto nla_put_failure;
941 if (n->res.classid &&
942 nla_put_u32(skb, TCA_U32_CLASSID, n->res.classid))
943 goto nla_put_failure;
945 ht_down = rtnl_dereference(n->ht_down);
947 nla_put_u32(skb, TCA_U32_LINK, ht_down->handle))
948 goto nla_put_failure;
950 #ifdef CONFIG_CLS_U32_MARK
951 if ((n->val || n->mask)) {
952 struct tc_u32_mark mark = {.val = n->val,
957 for_each_possible_cpu(cpum) {
958 __u32 cnt = *per_cpu_ptr(n->pcpu_success, cpum);
963 if (nla_put(skb, TCA_U32_MARK, sizeof(mark), &mark))
964 goto nla_put_failure;
968 if (tcf_exts_dump(skb, &n->exts) < 0)
969 goto nla_put_failure;
971 #ifdef CONFIG_NET_CLS_IND
973 struct net_device *dev;
974 dev = __dev_get_by_index(net, n->ifindex);
975 if (dev && nla_put_string(skb, TCA_U32_INDEV, dev->name))
976 goto nla_put_failure;
979 #ifdef CONFIG_CLS_U32_PERF
980 gpf = kzalloc(sizeof(struct tc_u32_pcnt) +
981 n->sel.nkeys * sizeof(u64),
984 goto nla_put_failure;
986 for_each_possible_cpu(cpu) {
988 struct tc_u32_pcnt *pf = per_cpu_ptr(n->pf, cpu);
990 gpf->rcnt += pf->rcnt;
991 gpf->rhit += pf->rhit;
992 for (i = 0; i < n->sel.nkeys; i++)
993 gpf->kcnts[i] += pf->kcnts[i];
996 if (nla_put(skb, TCA_U32_PCNT,
997 sizeof(struct tc_u32_pcnt) + n->sel.nkeys*sizeof(u64),
1000 goto nla_put_failure;
1006 nla_nest_end(skb, nest);
1008 if (TC_U32_KEY(n->handle))
1009 if (tcf_exts_dump_stats(skb, &n->exts) < 0)
1010 goto nla_put_failure;
1014 nla_nest_cancel(skb, nest);
1018 static struct tcf_proto_ops cls_u32_ops __read_mostly = {
1020 .classify = u32_classify,
1022 .destroy = u32_destroy,
1025 .change = u32_change,
1026 .delete = u32_delete,
1029 .owner = THIS_MODULE,
1032 static int __init init_u32(void)
1034 pr_info("u32 classifier\n");
1035 #ifdef CONFIG_CLS_U32_PERF
1036 pr_info(" Performance counters on\n");
1038 #ifdef CONFIG_NET_CLS_IND
1039 pr_info(" input device check on\n");
1041 #ifdef CONFIG_NET_CLS_ACT
1042 pr_info(" Actions configured\n");
1044 return register_tcf_proto_ops(&cls_u32_ops);
1047 static void __exit exit_u32(void)
1049 unregister_tcf_proto_ops(&cls_u32_ops);
1052 module_init(init_u32)
1053 module_exit(exit_u32)
1054 MODULE_LICENSE("GPL");