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;
82 /* The 'ht' field MUST be the last field in structure to allow for
83 * more entries allocated at end of structure.
85 struct tc_u_knode __rcu *ht[1];
89 struct tc_u_hnode __rcu *hlist;
96 static inline unsigned int u32_hash_fold(__be32 key,
97 const struct tc_u32_sel *sel,
100 unsigned int h = ntohl(key & sel->hmask) >> fshift;
105 static int u32_classify(struct sk_buff *skb, const struct tcf_proto *tp, struct tcf_result *res)
108 struct tc_u_knode *knode;
110 } stack[TC_U32_MAXDEPTH];
112 struct tc_u_hnode *ht = rcu_dereference_bh(tp->root);
113 unsigned int off = skb_network_offset(skb);
114 struct tc_u_knode *n;
118 #ifdef CONFIG_CLS_U32_PERF
124 n = rcu_dereference_bh(ht->ht[sel]);
128 struct tc_u32_key *key = n->sel.keys;
130 #ifdef CONFIG_CLS_U32_PERF
131 __this_cpu_inc(n->pf->rcnt);
135 #ifdef CONFIG_CLS_U32_MARK
136 if ((skb->mark & n->mask) != n->val) {
137 n = rcu_dereference_bh(n->next);
140 __this_cpu_inc(*n->pcpu_success);
144 for (i = n->sel.nkeys; i > 0; i--, key++) {
145 int toff = off + key->off + (off2 & key->offmask);
148 if (skb_headroom(skb) + toff > INT_MAX)
151 data = skb_header_pointer(skb, toff, 4, &hdata);
154 if ((*data ^ key->val) & key->mask) {
155 n = rcu_dereference_bh(n->next);
158 #ifdef CONFIG_CLS_U32_PERF
159 __this_cpu_inc(n->pf->kcnts[j]);
164 ht = rcu_dereference_bh(n->ht_down);
167 if (n->sel.flags & TC_U32_TERMINAL) {
170 #ifdef CONFIG_NET_CLS_IND
171 if (!tcf_match_indev(skb, n->ifindex)) {
172 n = rcu_dereference_bh(n->next);
176 #ifdef CONFIG_CLS_U32_PERF
177 __this_cpu_inc(n->pf->rhit);
179 r = tcf_exts_exec(skb, &n->exts, res);
181 n = rcu_dereference_bh(n->next);
187 n = rcu_dereference_bh(n->next);
192 if (sdepth >= TC_U32_MAXDEPTH)
194 stack[sdepth].knode = n;
195 stack[sdepth].off = off;
198 ht = rcu_dereference_bh(n->ht_down);
203 data = skb_header_pointer(skb, off + n->sel.hoff, 4,
207 sel = ht->divisor & u32_hash_fold(*data, &n->sel,
210 if (!(n->sel.flags & (TC_U32_VAROFFSET | TC_U32_OFFSET | TC_U32_EAT)))
213 if (n->sel.flags & (TC_U32_OFFSET | TC_U32_VAROFFSET)) {
214 off2 = n->sel.off + 3;
215 if (n->sel.flags & TC_U32_VAROFFSET) {
218 data = skb_header_pointer(skb,
223 off2 += ntohs(n->sel.offmask & *data) >>
228 if (n->sel.flags & TC_U32_EAT) {
239 n = stack[sdepth].knode;
240 ht = rcu_dereference_bh(n->ht_up);
241 off = stack[sdepth].off;
248 net_warn_ratelimited("cls_u32: dead loop\n");
252 static struct tc_u_hnode *
253 u32_lookup_ht(struct tc_u_common *tp_c, u32 handle)
255 struct tc_u_hnode *ht;
257 for (ht = rtnl_dereference(tp_c->hlist);
259 ht = rtnl_dereference(ht->next))
260 if (ht->handle == handle)
266 static struct tc_u_knode *
267 u32_lookup_key(struct tc_u_hnode *ht, u32 handle)
270 struct tc_u_knode *n = NULL;
272 sel = TC_U32_HASH(handle);
273 if (sel > ht->divisor)
276 for (n = rtnl_dereference(ht->ht[sel]);
278 n = rtnl_dereference(n->next))
279 if (n->handle == handle)
286 static unsigned long u32_get(struct tcf_proto *tp, u32 handle)
288 struct tc_u_hnode *ht;
289 struct tc_u_common *tp_c = tp->data;
291 if (TC_U32_HTID(handle) == TC_U32_ROOT)
292 ht = rtnl_dereference(tp->root);
294 ht = u32_lookup_ht(tp_c, TC_U32_HTID(handle));
299 if (TC_U32_KEY(handle) == 0)
300 return (unsigned long)ht;
302 return (unsigned long)u32_lookup_key(ht, handle);
305 static u32 gen_new_htid(struct tc_u_common *tp_c)
309 /* hgenerator only used inside rtnl lock it is safe to increment
310 * without read _copy_ update semantics
313 if (++tp_c->hgenerator == 0x7FF)
314 tp_c->hgenerator = 1;
315 } while (--i > 0 && u32_lookup_ht(tp_c, (tp_c->hgenerator|0x800)<<20));
317 return i > 0 ? (tp_c->hgenerator|0x800)<<20 : 0;
320 static int u32_init(struct tcf_proto *tp)
322 struct tc_u_hnode *root_ht;
323 struct tc_u_common *tp_c;
325 tp_c = tp->q->u32_node;
327 root_ht = kzalloc(sizeof(*root_ht), GFP_KERNEL);
331 root_ht->divisor = 0;
333 root_ht->handle = tp_c ? gen_new_htid(tp_c) : 0x80000000;
334 root_ht->prio = tp->prio;
337 tp_c = kzalloc(sizeof(*tp_c), GFP_KERNEL);
343 tp->q->u32_node = tp_c;
347 RCU_INIT_POINTER(root_ht->next, tp_c->hlist);
348 rcu_assign_pointer(tp_c->hlist, root_ht);
349 root_ht->tp_c = tp_c;
351 rcu_assign_pointer(tp->root, root_ht);
356 static int u32_destroy_key(struct tcf_proto *tp,
357 struct tc_u_knode *n,
360 tcf_exts_destroy(&n->exts);
362 n->ht_down->refcnt--;
363 #ifdef CONFIG_CLS_U32_PERF
367 #ifdef CONFIG_CLS_U32_MARK
369 free_percpu(n->pcpu_success);
375 /* u32_delete_key_rcu should be called when free'ing a copied
376 * version of a tc_u_knode obtained from u32_init_knode(). When
377 * copies are obtained from u32_init_knode() the statistics are
378 * shared between the old and new copies to allow readers to
379 * continue to update the statistics during the copy. To support
380 * this the u32_delete_key_rcu variant does not free the percpu
383 static void u32_delete_key_rcu(struct rcu_head *rcu)
385 struct tc_u_knode *key = container_of(rcu, struct tc_u_knode, rcu);
387 u32_destroy_key(key->tp, key, false);
390 /* u32_delete_key_freepf_rcu is the rcu callback variant
391 * that free's the entire structure including the statistics
392 * percpu variables. Only use this if the key is not a copy
393 * returned by u32_init_knode(). See u32_delete_key_rcu()
394 * for the variant that should be used with keys return from
397 static void u32_delete_key_freepf_rcu(struct rcu_head *rcu)
399 struct tc_u_knode *key = container_of(rcu, struct tc_u_knode, rcu);
401 u32_destroy_key(key->tp, key, true);
404 static int u32_delete_key(struct tcf_proto *tp, struct tc_u_knode *key)
406 struct tc_u_knode __rcu **kp;
407 struct tc_u_knode *pkp;
408 struct tc_u_hnode *ht = rtnl_dereference(key->ht_up);
411 kp = &ht->ht[TC_U32_HASH(key->handle)];
412 for (pkp = rtnl_dereference(*kp); pkp;
413 kp = &pkp->next, pkp = rtnl_dereference(*kp)) {
415 RCU_INIT_POINTER(*kp, key->next);
417 tcf_unbind_filter(tp, &key->res);
418 call_rcu(&key->rcu, u32_delete_key_freepf_rcu);
427 static void u32_clear_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
429 struct tc_u_knode *n;
432 for (h = 0; h <= ht->divisor; h++) {
433 while ((n = rtnl_dereference(ht->ht[h])) != NULL) {
434 RCU_INIT_POINTER(ht->ht[h],
435 rtnl_dereference(n->next));
436 tcf_unbind_filter(tp, &n->res);
437 call_rcu(&n->rcu, u32_delete_key_freepf_rcu);
442 static int u32_destroy_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
444 struct tc_u_common *tp_c = tp->data;
445 struct tc_u_hnode __rcu **hn;
446 struct tc_u_hnode *phn;
450 u32_clear_hnode(tp, ht);
453 for (phn = rtnl_dereference(*hn);
455 hn = &phn->next, phn = rtnl_dereference(*hn)) {
457 RCU_INIT_POINTER(*hn, ht->next);
466 static bool ht_empty(struct tc_u_hnode *ht)
470 for (h = 0; h <= ht->divisor; h++)
471 if (rcu_access_pointer(ht->ht[h]))
477 static bool u32_destroy(struct tcf_proto *tp, bool force)
479 struct tc_u_common *tp_c = tp->data;
480 struct tc_u_hnode *root_ht = rtnl_dereference(tp->root);
482 WARN_ON(root_ht == NULL);
486 if (root_ht->refcnt > 1)
488 if (root_ht->refcnt == 1) {
489 if (!ht_empty(root_ht))
494 if (tp_c->refcnt > 1)
497 if (tp_c->refcnt == 1) {
498 struct tc_u_hnode *ht;
500 for (ht = rtnl_dereference(tp_c->hlist);
502 ht = rtnl_dereference(ht->next))
508 if (root_ht && --root_ht->refcnt == 0)
509 u32_destroy_hnode(tp, root_ht);
511 if (--tp_c->refcnt == 0) {
512 struct tc_u_hnode *ht;
514 tp->q->u32_node = NULL;
516 for (ht = rtnl_dereference(tp_c->hlist);
518 ht = rtnl_dereference(ht->next)) {
520 u32_clear_hnode(tp, ht);
523 while ((ht = rtnl_dereference(tp_c->hlist)) != NULL) {
524 RCU_INIT_POINTER(tp_c->hlist, ht->next);
535 static int u32_delete(struct tcf_proto *tp, unsigned long arg)
537 struct tc_u_hnode *ht = (struct tc_u_hnode *)arg;
538 struct tc_u_hnode *root_ht = rtnl_dereference(tp->root);
543 if (TC_U32_KEY(ht->handle))
544 return u32_delete_key(tp, (struct tc_u_knode *)ht);
549 if (ht->refcnt == 1) {
551 u32_destroy_hnode(tp, ht);
559 #define NR_U32_NODE (1<<12)
560 static u32 gen_new_kid(struct tc_u_hnode *ht, u32 handle)
562 struct tc_u_knode *n;
564 unsigned long *bitmap = kzalloc(BITS_TO_LONGS(NR_U32_NODE) * sizeof(unsigned long),
567 return handle | 0xFFF;
569 for (n = rtnl_dereference(ht->ht[TC_U32_HASH(handle)]);
571 n = rtnl_dereference(n->next))
572 set_bit(TC_U32_NODE(n->handle), bitmap);
574 i = find_next_zero_bit(bitmap, NR_U32_NODE, 0x800);
575 if (i >= NR_U32_NODE)
576 i = find_next_zero_bit(bitmap, NR_U32_NODE, 1);
579 return handle | (i >= NR_U32_NODE ? 0xFFF : i);
582 static const struct nla_policy u32_policy[TCA_U32_MAX + 1] = {
583 [TCA_U32_CLASSID] = { .type = NLA_U32 },
584 [TCA_U32_HASH] = { .type = NLA_U32 },
585 [TCA_U32_LINK] = { .type = NLA_U32 },
586 [TCA_U32_DIVISOR] = { .type = NLA_U32 },
587 [TCA_U32_SEL] = { .len = sizeof(struct tc_u32_sel) },
588 [TCA_U32_INDEV] = { .type = NLA_STRING, .len = IFNAMSIZ },
589 [TCA_U32_MARK] = { .len = sizeof(struct tc_u32_mark) },
592 static int u32_set_parms(struct net *net, struct tcf_proto *tp,
593 unsigned long base, struct tc_u_hnode *ht,
594 struct tc_u_knode *n, struct nlattr **tb,
595 struct nlattr *est, bool ovr)
600 tcf_exts_init(&e, TCA_U32_ACT, TCA_U32_POLICE);
601 err = tcf_exts_validate(net, tp, tb, est, &e, ovr);
606 if (tb[TCA_U32_LINK]) {
607 u32 handle = nla_get_u32(tb[TCA_U32_LINK]);
608 struct tc_u_hnode *ht_down = NULL, *ht_old;
610 if (TC_U32_KEY(handle))
614 ht_down = u32_lookup_ht(ht->tp_c, handle);
621 ht_old = rtnl_dereference(n->ht_down);
622 rcu_assign_pointer(n->ht_down, ht_down);
627 if (tb[TCA_U32_CLASSID]) {
628 n->res.classid = nla_get_u32(tb[TCA_U32_CLASSID]);
629 tcf_bind_filter(tp, &n->res, base);
632 #ifdef CONFIG_NET_CLS_IND
633 if (tb[TCA_U32_INDEV]) {
635 ret = tcf_change_indev(net, tb[TCA_U32_INDEV]);
641 tcf_exts_change(tp, &n->exts, &e);
645 tcf_exts_destroy(&e);
649 static void u32_replace_knode(struct tcf_proto *tp,
650 struct tc_u_common *tp_c,
651 struct tc_u_knode *n)
653 struct tc_u_knode __rcu **ins;
654 struct tc_u_knode *pins;
655 struct tc_u_hnode *ht;
657 if (TC_U32_HTID(n->handle) == TC_U32_ROOT)
658 ht = rtnl_dereference(tp->root);
660 ht = u32_lookup_ht(tp_c, TC_U32_HTID(n->handle));
662 ins = &ht->ht[TC_U32_HASH(n->handle)];
664 /* The node must always exist for it to be replaced if this is not the
665 * case then something went very wrong elsewhere.
667 for (pins = rtnl_dereference(*ins); ;
668 ins = &pins->next, pins = rtnl_dereference(*ins))
669 if (pins->handle == n->handle)
672 RCU_INIT_POINTER(n->next, pins->next);
673 rcu_assign_pointer(*ins, n);
676 static struct tc_u_knode *u32_init_knode(struct tcf_proto *tp,
677 struct tc_u_knode *n)
679 struct tc_u_knode *new;
680 struct tc_u32_sel *s = &n->sel;
682 new = kzalloc(sizeof(*n) + s->nkeys*sizeof(struct tc_u32_key),
688 RCU_INIT_POINTER(new->next, n->next);
689 new->handle = n->handle;
690 RCU_INIT_POINTER(new->ht_up, n->ht_up);
692 #ifdef CONFIG_NET_CLS_IND
693 new->ifindex = n->ifindex;
695 new->fshift = n->fshift;
697 RCU_INIT_POINTER(new->ht_down, n->ht_down);
699 /* bump reference count as long as we hold pointer to structure */
701 new->ht_down->refcnt++;
703 #ifdef CONFIG_CLS_U32_PERF
704 /* Statistics may be incremented by readers during update
705 * so we must keep them in tact. When the node is later destroyed
706 * a special destroy call must be made to not free the pf memory.
711 #ifdef CONFIG_CLS_U32_MARK
714 /* Similarly success statistics must be moved as pointers */
715 new->pcpu_success = n->pcpu_success;
718 memcpy(&new->sel, s, sizeof(*s) + s->nkeys*sizeof(struct tc_u32_key));
720 tcf_exts_init(&new->exts, TCA_U32_ACT, TCA_U32_POLICE);
725 static int u32_change(struct net *net, struct sk_buff *in_skb,
726 struct tcf_proto *tp, unsigned long base, u32 handle,
728 unsigned long *arg, bool ovr)
730 struct tc_u_common *tp_c = tp->data;
731 struct tc_u_hnode *ht;
732 struct tc_u_knode *n;
733 struct tc_u32_sel *s;
734 struct nlattr *opt = tca[TCA_OPTIONS];
735 struct nlattr *tb[TCA_U32_MAX + 1];
738 #ifdef CONFIG_CLS_U32_PERF
743 return handle ? -EINVAL : 0;
745 err = nla_parse_nested(tb, TCA_U32_MAX, opt, u32_policy);
749 n = (struct tc_u_knode *)*arg;
751 struct tc_u_knode *new;
753 if (TC_U32_KEY(n->handle) == 0)
756 new = u32_init_knode(tp, n);
760 err = u32_set_parms(net, tp, base,
761 rtnl_dereference(n->ht_up), new, tb,
765 u32_destroy_key(tp, new, false);
769 u32_replace_knode(tp, tp_c, new);
770 tcf_unbind_filter(tp, &n->res);
771 call_rcu(&n->rcu, u32_delete_key_rcu);
775 if (tb[TCA_U32_DIVISOR]) {
776 unsigned int divisor = nla_get_u32(tb[TCA_U32_DIVISOR]);
778 if (--divisor > 0x100)
780 if (TC_U32_KEY(handle))
783 handle = gen_new_htid(tp->data);
787 ht = kzalloc(sizeof(*ht) + divisor*sizeof(void *), GFP_KERNEL);
792 ht->divisor = divisor;
795 RCU_INIT_POINTER(ht->next, tp_c->hlist);
796 rcu_assign_pointer(tp_c->hlist, ht);
797 *arg = (unsigned long)ht;
801 if (tb[TCA_U32_HASH]) {
802 htid = nla_get_u32(tb[TCA_U32_HASH]);
803 if (TC_U32_HTID(htid) == TC_U32_ROOT) {
804 ht = rtnl_dereference(tp->root);
807 ht = u32_lookup_ht(tp->data, TC_U32_HTID(htid));
812 ht = rtnl_dereference(tp->root);
816 if (ht->divisor < TC_U32_HASH(htid))
820 if (TC_U32_HTID(handle) && TC_U32_HTID(handle^htid))
822 handle = htid | TC_U32_NODE(handle);
824 handle = gen_new_kid(ht, htid);
826 if (tb[TCA_U32_SEL] == NULL)
829 s = nla_data(tb[TCA_U32_SEL]);
831 n = kzalloc(sizeof(*n) + s->nkeys*sizeof(struct tc_u32_key), GFP_KERNEL);
835 #ifdef CONFIG_CLS_U32_PERF
836 size = sizeof(struct tc_u32_pcnt) + s->nkeys * sizeof(u64);
837 n->pf = __alloc_percpu(size, __alignof__(struct tc_u32_pcnt));
844 memcpy(&n->sel, s, sizeof(*s) + s->nkeys*sizeof(struct tc_u32_key));
845 RCU_INIT_POINTER(n->ht_up, ht);
847 n->fshift = s->hmask ? ffs(ntohl(s->hmask)) - 1 : 0;
848 tcf_exts_init(&n->exts, TCA_U32_ACT, TCA_U32_POLICE);
851 #ifdef CONFIG_CLS_U32_MARK
852 n->pcpu_success = alloc_percpu(u32);
853 if (!n->pcpu_success) {
858 if (tb[TCA_U32_MARK]) {
859 struct tc_u32_mark *mark;
861 mark = nla_data(tb[TCA_U32_MARK]);
863 n->mask = mark->mask;
867 err = u32_set_parms(net, tp, base, ht, n, tb, tca[TCA_RATE], ovr);
869 struct tc_u_knode __rcu **ins;
870 struct tc_u_knode *pins;
872 ins = &ht->ht[TC_U32_HASH(handle)];
873 for (pins = rtnl_dereference(*ins); pins;
874 ins = &pins->next, pins = rtnl_dereference(*ins))
875 if (TC_U32_NODE(handle) < TC_U32_NODE(pins->handle))
878 RCU_INIT_POINTER(n->next, pins);
879 rcu_assign_pointer(*ins, n);
881 *arg = (unsigned long)n;
885 #ifdef CONFIG_CLS_U32_MARK
886 free_percpu(n->pcpu_success);
890 #ifdef CONFIG_CLS_U32_PERF
897 static void u32_walk(struct tcf_proto *tp, struct tcf_walker *arg)
899 struct tc_u_common *tp_c = tp->data;
900 struct tc_u_hnode *ht;
901 struct tc_u_knode *n;
907 for (ht = rtnl_dereference(tp_c->hlist);
909 ht = rtnl_dereference(ht->next)) {
910 if (ht->prio != tp->prio)
912 if (arg->count >= arg->skip) {
913 if (arg->fn(tp, (unsigned long)ht, arg) < 0) {
919 for (h = 0; h <= ht->divisor; h++) {
920 for (n = rtnl_dereference(ht->ht[h]);
922 n = rtnl_dereference(n->next)) {
923 if (arg->count < arg->skip) {
927 if (arg->fn(tp, (unsigned long)n, arg) < 0) {
937 static int u32_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
938 struct sk_buff *skb, struct tcmsg *t)
940 struct tc_u_knode *n = (struct tc_u_knode *)fh;
941 struct tc_u_hnode *ht_up, *ht_down;
947 t->tcm_handle = n->handle;
949 nest = nla_nest_start(skb, TCA_OPTIONS);
951 goto nla_put_failure;
953 if (TC_U32_KEY(n->handle) == 0) {
954 struct tc_u_hnode *ht = (struct tc_u_hnode *)fh;
955 u32 divisor = ht->divisor + 1;
957 if (nla_put_u32(skb, TCA_U32_DIVISOR, divisor))
958 goto nla_put_failure;
960 #ifdef CONFIG_CLS_U32_PERF
961 struct tc_u32_pcnt *gpf;
965 if (nla_put(skb, TCA_U32_SEL,
966 sizeof(n->sel) + n->sel.nkeys*sizeof(struct tc_u32_key),
968 goto nla_put_failure;
970 ht_up = rtnl_dereference(n->ht_up);
972 u32 htid = n->handle & 0xFFFFF000;
973 if (nla_put_u32(skb, TCA_U32_HASH, htid))
974 goto nla_put_failure;
976 if (n->res.classid &&
977 nla_put_u32(skb, TCA_U32_CLASSID, n->res.classid))
978 goto nla_put_failure;
980 ht_down = rtnl_dereference(n->ht_down);
982 nla_put_u32(skb, TCA_U32_LINK, ht_down->handle))
983 goto nla_put_failure;
985 #ifdef CONFIG_CLS_U32_MARK
986 if ((n->val || n->mask)) {
987 struct tc_u32_mark mark = {.val = n->val,
992 for_each_possible_cpu(cpum) {
993 __u32 cnt = *per_cpu_ptr(n->pcpu_success, cpum);
998 if (nla_put(skb, TCA_U32_MARK, sizeof(mark), &mark))
999 goto nla_put_failure;
1003 if (tcf_exts_dump(skb, &n->exts) < 0)
1004 goto nla_put_failure;
1006 #ifdef CONFIG_NET_CLS_IND
1008 struct net_device *dev;
1009 dev = __dev_get_by_index(net, n->ifindex);
1010 if (dev && nla_put_string(skb, TCA_U32_INDEV, dev->name))
1011 goto nla_put_failure;
1014 #ifdef CONFIG_CLS_U32_PERF
1015 gpf = kzalloc(sizeof(struct tc_u32_pcnt) +
1016 n->sel.nkeys * sizeof(u64),
1019 goto nla_put_failure;
1021 for_each_possible_cpu(cpu) {
1023 struct tc_u32_pcnt *pf = per_cpu_ptr(n->pf, cpu);
1025 gpf->rcnt += pf->rcnt;
1026 gpf->rhit += pf->rhit;
1027 for (i = 0; i < n->sel.nkeys; i++)
1028 gpf->kcnts[i] += pf->kcnts[i];
1031 if (nla_put(skb, TCA_U32_PCNT,
1032 sizeof(struct tc_u32_pcnt) + n->sel.nkeys*sizeof(u64),
1035 goto nla_put_failure;
1041 nla_nest_end(skb, nest);
1043 if (TC_U32_KEY(n->handle))
1044 if (tcf_exts_dump_stats(skb, &n->exts) < 0)
1045 goto nla_put_failure;
1049 nla_nest_cancel(skb, nest);
1053 static struct tcf_proto_ops cls_u32_ops __read_mostly = {
1055 .classify = u32_classify,
1057 .destroy = u32_destroy,
1059 .change = u32_change,
1060 .delete = u32_delete,
1063 .owner = THIS_MODULE,
1066 static int __init init_u32(void)
1068 pr_info("u32 classifier\n");
1069 #ifdef CONFIG_CLS_U32_PERF
1070 pr_info(" Performance counters on\n");
1072 #ifdef CONFIG_NET_CLS_IND
1073 pr_info(" input device check on\n");
1075 #ifdef CONFIG_NET_CLS_ACT
1076 pr_info(" Actions configured\n");
1078 return register_tcf_proto_ops(&cls_u32_ops);
1081 static void __exit exit_u32(void)
1083 unregister_tcf_proto_ops(&cls_u32_ops);
1086 module_init(init_u32)
1087 module_exit(exit_u32)
1088 MODULE_LICENSE("GPL");