2 * net/sched/act_api.c Packet action API.
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 * Author: Jamal Hadi Salim
14 #include <linux/types.h>
15 #include <linux/kernel.h>
16 #include <linux/string.h>
17 #include <linux/errno.h>
18 #include <linux/slab.h>
19 #include <linux/skbuff.h>
20 #include <linux/init.h>
21 #include <linux/kmod.h>
22 #include <linux/err.h>
23 #include <linux/module.h>
24 #include <net/net_namespace.h>
26 #include <net/sch_generic.h>
27 #include <net/act_api.h>
28 #include <net/netlink.h>
30 void tcf_hash_destroy(struct tcf_common *p, struct tcf_hashinfo *hinfo)
32 unsigned int h = tcf_hash(p->tcfc_index, hinfo->hmask);
33 struct tcf_common **p1p;
35 for (p1p = &hinfo->htab[h]; *p1p; p1p = &(*p1p)->tcfc_next) {
37 write_lock_bh(hinfo->lock);
39 write_unlock_bh(hinfo->lock);
40 gen_kill_estimator(&p->tcfc_bstats,
43 * gen_estimator est_timer() might access p->tcfc_lock
44 * or bstats, wait a RCU grace period before freeing p
46 kfree_rcu(p, tcfc_rcu);
52 EXPORT_SYMBOL(tcf_hash_destroy);
54 int tcf_hash_release(struct tcf_common *p, int bind,
55 struct tcf_hashinfo *hinfo)
64 if (p->tcfc_bindcnt <= 0 && p->tcfc_refcnt <= 0) {
65 tcf_hash_destroy(p, hinfo);
71 EXPORT_SYMBOL(tcf_hash_release);
73 static int tcf_dump_walker(struct sk_buff *skb, struct netlink_callback *cb,
74 struct tc_action *a, struct tcf_hashinfo *hinfo)
77 int err = 0, index = -1, i = 0, s_i = 0, n_i = 0;
80 read_lock_bh(hinfo->lock);
84 for (i = 0; i < (hinfo->hmask + 1); i++) {
85 p = hinfo->htab[tcf_hash(i, hinfo->hmask)];
87 for (; p; p = p->tcfc_next) {
94 nest = nla_nest_start(skb, a->order);
97 err = tcf_action_dump_1(skb, a, 0, 0);
100 nlmsg_trim(skb, nest);
103 nla_nest_end(skb, nest);
105 if (n_i >= TCA_ACT_MAX_PRIO)
110 read_unlock_bh(hinfo->lock);
116 nla_nest_cancel(skb, nest);
120 static int tcf_del_walker(struct sk_buff *skb, struct tc_action *a,
121 struct tcf_hashinfo *hinfo)
123 struct tcf_common *p, *s_p;
127 nest = nla_nest_start(skb, a->order);
129 goto nla_put_failure;
130 if (nla_put_string(skb, TCA_KIND, a->ops->kind))
131 goto nla_put_failure;
132 for (i = 0; i < (hinfo->hmask + 1); i++) {
133 p = hinfo->htab[tcf_hash(i, hinfo->hmask)];
137 if (ACT_P_DELETED == tcf_hash_release(p, 0, hinfo))
138 module_put(a->ops->owner);
143 if (nla_put_u32(skb, TCA_FCNT, n_i))
144 goto nla_put_failure;
145 nla_nest_end(skb, nest);
149 nla_nest_cancel(skb, nest);
153 int tcf_generic_walker(struct sk_buff *skb, struct netlink_callback *cb,
154 int type, struct tc_action *a)
156 struct tcf_hashinfo *hinfo = a->ops->hinfo;
158 if (type == RTM_DELACTION) {
159 return tcf_del_walker(skb, a, hinfo);
160 } else if (type == RTM_GETACTION) {
161 return tcf_dump_walker(skb, cb, a, hinfo);
163 WARN(1, "tcf_generic_walker: unknown action %d\n", type);
167 EXPORT_SYMBOL(tcf_generic_walker);
169 struct tcf_common *tcf_hash_lookup(u32 index, struct tcf_hashinfo *hinfo)
171 struct tcf_common *p;
173 read_lock_bh(hinfo->lock);
174 for (p = hinfo->htab[tcf_hash(index, hinfo->hmask)]; p;
176 if (p->tcfc_index == index)
179 read_unlock_bh(hinfo->lock);
183 EXPORT_SYMBOL(tcf_hash_lookup);
185 u32 tcf_hash_new_index(u32 *idx_gen, struct tcf_hashinfo *hinfo)
192 } while (tcf_hash_lookup(val, hinfo));
194 return (*idx_gen = val);
196 EXPORT_SYMBOL(tcf_hash_new_index);
198 int tcf_hash_search(struct tc_action *a, u32 index)
200 struct tcf_hashinfo *hinfo = a->ops->hinfo;
201 struct tcf_common *p = tcf_hash_lookup(index, hinfo);
209 EXPORT_SYMBOL(tcf_hash_search);
211 struct tcf_common *tcf_hash_check(u32 index, struct tc_action *a, int bind,
212 struct tcf_hashinfo *hinfo)
214 struct tcf_common *p = NULL;
215 if (index && (p = tcf_hash_lookup(index, hinfo)) != NULL) {
223 EXPORT_SYMBOL(tcf_hash_check);
225 struct tcf_common *tcf_hash_create(u32 index, struct nlattr *est,
226 struct tc_action *a, int size, int bind,
227 u32 *idx_gen, struct tcf_hashinfo *hinfo)
229 struct tcf_common *p = kzalloc(size, GFP_KERNEL);
232 return ERR_PTR(-ENOMEM);
237 spin_lock_init(&p->tcfc_lock);
238 p->tcfc_index = index ? index : tcf_hash_new_index(idx_gen, hinfo);
239 p->tcfc_tm.install = jiffies;
240 p->tcfc_tm.lastuse = jiffies;
242 int err = gen_new_estimator(&p->tcfc_bstats, &p->tcfc_rate_est,
250 a->priv = (void *) p;
253 EXPORT_SYMBOL(tcf_hash_create);
255 void tcf_hash_insert(struct tcf_common *p, struct tcf_hashinfo *hinfo)
257 unsigned int h = tcf_hash(p->tcfc_index, hinfo->hmask);
259 write_lock_bh(hinfo->lock);
260 p->tcfc_next = hinfo->htab[h];
262 write_unlock_bh(hinfo->lock);
264 EXPORT_SYMBOL(tcf_hash_insert);
266 static struct tc_action_ops *act_base = NULL;
267 static DEFINE_RWLOCK(act_mod_lock);
269 int tcf_register_action(struct tc_action_ops *act)
271 struct tc_action_ops *a, **ap;
273 write_lock(&act_mod_lock);
274 for (ap = &act_base; (a = *ap) != NULL; ap = &a->next) {
275 if (act->type == a->type || (strcmp(act->kind, a->kind) == 0)) {
276 write_unlock(&act_mod_lock);
282 write_unlock(&act_mod_lock);
285 EXPORT_SYMBOL(tcf_register_action);
287 int tcf_unregister_action(struct tc_action_ops *act)
289 struct tc_action_ops *a, **ap;
292 write_lock(&act_mod_lock);
293 for (ap = &act_base; (a = *ap) != NULL; ap = &a->next)
301 write_unlock(&act_mod_lock);
304 EXPORT_SYMBOL(tcf_unregister_action);
307 static struct tc_action_ops *tc_lookup_action_n(char *kind)
309 struct tc_action_ops *a = NULL;
312 read_lock(&act_mod_lock);
313 for (a = act_base; a; a = a->next) {
314 if (strcmp(kind, a->kind) == 0) {
315 if (!try_module_get(a->owner)) {
316 read_unlock(&act_mod_lock);
322 read_unlock(&act_mod_lock);
327 /* lookup by nlattr */
328 static struct tc_action_ops *tc_lookup_action(struct nlattr *kind)
330 struct tc_action_ops *a = NULL;
333 read_lock(&act_mod_lock);
334 for (a = act_base; a; a = a->next) {
335 if (nla_strcmp(kind, a->kind) == 0) {
336 if (!try_module_get(a->owner)) {
337 read_unlock(&act_mod_lock);
343 read_unlock(&act_mod_lock);
350 static struct tc_action_ops *tc_lookup_action_id(u32 type)
352 struct tc_action_ops *a = NULL;
355 read_lock(&act_mod_lock);
356 for (a = act_base; a; a = a->next) {
357 if (a->type == type) {
358 if (!try_module_get(a->owner)) {
359 read_unlock(&act_mod_lock);
365 read_unlock(&act_mod_lock);
371 int tcf_action_exec(struct sk_buff *skb, const struct tc_action *act,
372 struct tcf_result *res)
374 const struct tc_action *a;
377 if (skb->tc_verd & TC_NCLS) {
378 skb->tc_verd = CLR_TC_NCLS(skb->tc_verd);
382 while ((a = act) != NULL) {
384 if (a->ops && a->ops->act) {
385 ret = a->ops->act(skb, a, res);
386 if (TC_MUNGED & skb->tc_verd) {
387 /* copied already, allow trampling */
388 skb->tc_verd = SET_TC_OK2MUNGE(skb->tc_verd);
389 skb->tc_verd = CLR_TC_MUNGED(skb->tc_verd);
391 if (ret == TC_ACT_REPEAT)
392 goto repeat; /* we need a ttl - JHS */
393 if (ret != TC_ACT_PIPE)
401 EXPORT_SYMBOL(tcf_action_exec);
403 void tcf_action_destroy(struct tc_action *act, int bind)
407 for (a = act; a; a = act) {
408 if (a->ops && a->ops->cleanup) {
409 if (a->ops->cleanup(a, bind) == ACT_P_DELETED)
410 module_put(a->ops->owner);
414 /*FIXME: Remove later - catch insertion bugs*/
415 WARN(1, "tcf_action_destroy: BUG? destroying NULL ops\n");
423 tcf_action_dump_old(struct sk_buff *skb, struct tc_action *a, int bind, int ref)
427 if (a->ops == NULL || a->ops->dump == NULL)
429 return a->ops->dump(skb, a, bind, ref);
433 tcf_action_dump_1(struct sk_buff *skb, struct tc_action *a, int bind, int ref)
436 unsigned char *b = skb_tail_pointer(skb);
439 if (a->ops == NULL || a->ops->dump == NULL)
442 if (nla_put_string(skb, TCA_KIND, a->ops->kind))
443 goto nla_put_failure;
444 if (tcf_action_copy_stats(skb, a, 0))
445 goto nla_put_failure;
446 nest = nla_nest_start(skb, TCA_OPTIONS);
448 goto nla_put_failure;
449 err = tcf_action_dump_old(skb, a, bind, ref);
451 nla_nest_end(skb, nest);
459 EXPORT_SYMBOL(tcf_action_dump_1);
462 tcf_action_dump(struct sk_buff *skb, struct tc_action *act, int bind, int ref)
468 while ((a = act) != NULL) {
470 nest = nla_nest_start(skb, a->order);
472 goto nla_put_failure;
473 err = tcf_action_dump_1(skb, a, bind, ref);
476 nla_nest_end(skb, nest);
484 nla_nest_cancel(skb, nest);
488 struct tc_action *tcf_action_init_1(struct nlattr *nla, struct nlattr *est,
489 char *name, int ovr, int bind)
492 struct tc_action_ops *a_o;
493 char act_name[IFNAMSIZ];
494 struct nlattr *tb[TCA_ACT_MAX + 1];
499 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
503 kind = tb[TCA_ACT_KIND];
506 if (nla_strlcpy(act_name, kind, IFNAMSIZ) >= IFNAMSIZ)
510 if (strlcpy(act_name, name, IFNAMSIZ) >= IFNAMSIZ)
514 a_o = tc_lookup_action_n(act_name);
516 #ifdef CONFIG_MODULES
518 request_module("act_%s", act_name);
521 a_o = tc_lookup_action_n(act_name);
523 /* We dropped the RTNL semaphore in order to
524 * perform the module load. So, even if we
525 * succeeded in loading the module we have to
526 * tell the caller to replay the request. We
527 * indicate this using -EAGAIN.
539 a = kzalloc(sizeof(*a), GFP_KERNEL);
543 /* backward compatibility for policer */
545 err = a_o->init(tb[TCA_ACT_OPTIONS], est, a, ovr, bind);
547 err = a_o->init(nla, est, a, ovr, bind);
551 /* module count goes up only when brand new policy is created
552 * if it exists and is only bound to in a_o->init() then
553 * ACT_P_CREATED is not returned (a zero is).
555 if (err != ACT_P_CREATED)
556 module_put(a_o->owner);
564 module_put(a_o->owner);
569 struct tc_action *tcf_action_init(struct nlattr *nla, struct nlattr *est,
570 char *name, int ovr, int bind)
572 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
573 struct tc_action *head = NULL, *act, *act_prev = NULL;
577 err = nla_parse_nested(tb, TCA_ACT_MAX_PRIO, nla, NULL);
581 for (i = 1; i <= TCA_ACT_MAX_PRIO && tb[i]; i++) {
582 act = tcf_action_init_1(tb[i], est, name, ovr, bind);
590 act_prev->next = act;
597 tcf_action_destroy(head, bind);
601 int tcf_action_copy_stats(struct sk_buff *skb, struct tc_action *a,
606 struct tcf_act_hdr *h = a->priv;
611 /* compat_mode being true specifies a call that is supposed
612 * to add additional backward compatibility statistic TLVs.
615 if (a->type == TCA_OLD_COMPAT)
616 err = gnet_stats_start_copy_compat(skb, 0,
617 TCA_STATS, TCA_XSTATS, &h->tcf_lock, &d);
621 err = gnet_stats_start_copy(skb, TCA_ACT_STATS,
627 if (a->ops != NULL && a->ops->get_stats != NULL)
628 if (a->ops->get_stats(skb, a) < 0)
631 if (gnet_stats_copy_basic(&d, &h->tcf_bstats) < 0 ||
632 gnet_stats_copy_rate_est(&d, &h->tcf_bstats,
633 &h->tcf_rate_est) < 0 ||
634 gnet_stats_copy_queue(&d, &h->tcf_qstats) < 0)
637 if (gnet_stats_finish_copy(&d) < 0)
647 tca_get_fill(struct sk_buff *skb, struct tc_action *a, u32 pid, u32 seq,
648 u16 flags, int event, int bind, int ref)
651 struct nlmsghdr *nlh;
652 unsigned char *b = skb_tail_pointer(skb);
655 nlh = NLMSG_NEW(skb, pid, seq, event, sizeof(*t), flags);
658 t->tca_family = AF_UNSPEC;
662 nest = nla_nest_start(skb, TCA_ACT_TAB);
664 goto nla_put_failure;
666 if (tcf_action_dump(skb, a, bind, ref) < 0)
667 goto nla_put_failure;
669 nla_nest_end(skb, nest);
671 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
681 act_get_notify(struct net *net, u32 pid, struct nlmsghdr *n,
682 struct tc_action *a, int event)
686 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
689 if (tca_get_fill(skb, a, pid, n->nlmsg_seq, 0, event, 0, 0) <= 0) {
694 return rtnl_unicast(skb, net, pid);
697 static struct tc_action *
698 tcf_action_get_1(struct nlattr *nla, struct nlmsghdr *n, u32 pid)
700 struct nlattr *tb[TCA_ACT_MAX + 1];
705 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
710 if (tb[TCA_ACT_INDEX] == NULL ||
711 nla_len(tb[TCA_ACT_INDEX]) < sizeof(index))
713 index = nla_get_u32(tb[TCA_ACT_INDEX]);
716 a = kzalloc(sizeof(struct tc_action), GFP_KERNEL);
721 a->ops = tc_lookup_action(tb[TCA_ACT_KIND]);
724 if (a->ops->lookup == NULL)
727 if (a->ops->lookup(a, index) == 0)
730 module_put(a->ops->owner);
734 module_put(a->ops->owner);
741 static void cleanup_a(struct tc_action *act)
745 for (a = act; a; a = act) {
751 static struct tc_action *create_a(int i)
753 struct tc_action *act;
755 act = kzalloc(sizeof(*act), GFP_KERNEL);
757 pr_debug("create_a: failed to alloc!\n");
764 static int tca_action_flush(struct net *net, struct nlattr *nla,
765 struct nlmsghdr *n, u32 pid)
769 struct nlmsghdr *nlh;
771 struct netlink_callback dcb;
773 struct nlattr *tb[TCA_ACT_MAX + 1];
775 struct tc_action *a = create_a(0);
779 pr_debug("tca_action_flush: couldnt create tc_action\n");
783 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
785 pr_debug("tca_action_flush: failed skb alloc\n");
790 b = skb_tail_pointer(skb);
792 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
797 kind = tb[TCA_ACT_KIND];
798 a->ops = tc_lookup_action(kind);
802 nlh = NLMSG_PUT(skb, pid, n->nlmsg_seq, RTM_DELACTION, sizeof(*t));
804 t->tca_family = AF_UNSPEC;
808 nest = nla_nest_start(skb, TCA_ACT_TAB);
810 goto nla_put_failure;
812 err = a->ops->walk(skb, &dcb, RTM_DELACTION, a);
814 goto nla_put_failure;
818 nla_nest_end(skb, nest);
820 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
821 nlh->nlmsg_flags |= NLM_F_ROOT;
822 module_put(a->ops->owner);
824 err = rtnetlink_send(skb, net, pid, RTNLGRP_TC,
825 n->nlmsg_flags & NLM_F_ECHO);
833 module_put(a->ops->owner);
842 tca_action_gd(struct net *net, struct nlattr *nla, struct nlmsghdr *n,
846 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
847 struct tc_action *head = NULL, *act, *act_prev = NULL;
849 ret = nla_parse_nested(tb, TCA_ACT_MAX_PRIO, nla, NULL);
853 if (event == RTM_DELACTION && n->nlmsg_flags & NLM_F_ROOT) {
855 return tca_action_flush(net, tb[1], n, pid);
860 for (i = 1; i <= TCA_ACT_MAX_PRIO && tb[i]; i++) {
861 act = tcf_action_get_1(tb[i], n, pid);
871 act_prev->next = act;
875 if (event == RTM_GETACTION)
876 ret = act_get_notify(net, pid, n, head, event);
880 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
886 if (tca_get_fill(skb, head, pid, n->nlmsg_seq, 0, event,
893 /* now do the delete */
894 tcf_action_destroy(head, 0);
895 ret = rtnetlink_send(skb, net, pid, RTNLGRP_TC,
896 n->nlmsg_flags & NLM_F_ECHO);
906 static int tcf_add_notify(struct net *net, struct tc_action *a,
907 u32 pid, u32 seq, int event, u16 flags)
910 struct nlmsghdr *nlh;
916 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
920 b = skb_tail_pointer(skb);
922 nlh = NLMSG_NEW(skb, pid, seq, event, sizeof(*t), flags);
924 t->tca_family = AF_UNSPEC;
928 nest = nla_nest_start(skb, TCA_ACT_TAB);
930 goto nla_put_failure;
932 if (tcf_action_dump(skb, a, 0, 0) < 0)
933 goto nla_put_failure;
935 nla_nest_end(skb, nest);
937 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
938 NETLINK_CB(skb).dst_group = RTNLGRP_TC;
940 err = rtnetlink_send(skb, net, pid, RTNLGRP_TC, flags & NLM_F_ECHO);
953 tcf_action_add(struct net *net, struct nlattr *nla, struct nlmsghdr *n,
957 struct tc_action *act;
959 u32 seq = n->nlmsg_seq;
961 act = tcf_action_init(nla, NULL, NULL, ovr, 0);
969 /* dump then free all the actions after update; inserted policy
972 ret = tcf_add_notify(net, act, pid, seq, RTM_NEWACTION, n->nlmsg_flags);
973 for (a = act; a; a = act) {
981 static int tc_ctl_action(struct sk_buff *skb, struct nlmsghdr *n, void *arg)
983 struct net *net = sock_net(skb->sk);
984 struct nlattr *tca[TCA_ACT_MAX + 1];
985 u32 pid = skb ? NETLINK_CB(skb).pid : 0;
986 int ret = 0, ovr = 0;
988 ret = nlmsg_parse(n, sizeof(struct tcamsg), tca, TCA_ACT_MAX, NULL);
992 if (tca[TCA_ACT_TAB] == NULL) {
993 pr_notice("tc_ctl_action: received NO action attribs\n");
997 /* n->nlmsg_flags & NLM_F_CREATE */
998 switch (n->nlmsg_type) {
1000 /* we are going to assume all other flags
1001 * imply create only if it doesn't exist
1002 * Note that CREATE | EXCL implies that
1003 * but since we want avoid ambiguity (eg when flags
1004 * is zero) then just set this
1006 if (n->nlmsg_flags & NLM_F_REPLACE)
1009 ret = tcf_action_add(net, tca[TCA_ACT_TAB], n, pid, ovr);
1014 ret = tca_action_gd(net, tca[TCA_ACT_TAB], n,
1015 pid, RTM_DELACTION);
1018 ret = tca_action_gd(net, tca[TCA_ACT_TAB], n,
1019 pid, RTM_GETACTION);
1028 static struct nlattr *
1029 find_dump_kind(const struct nlmsghdr *n)
1031 struct nlattr *tb1, *tb2[TCA_ACT_MAX + 1];
1032 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
1033 struct nlattr *nla[TCAA_MAX + 1];
1034 struct nlattr *kind;
1036 if (nlmsg_parse(n, sizeof(struct tcamsg), nla, TCAA_MAX, NULL) < 0)
1038 tb1 = nla[TCA_ACT_TAB];
1042 if (nla_parse(tb, TCA_ACT_MAX_PRIO, nla_data(tb1),
1043 NLMSG_ALIGN(nla_len(tb1)), NULL) < 0)
1048 if (nla_parse(tb2, TCA_ACT_MAX, nla_data(tb[1]),
1049 nla_len(tb[1]), NULL) < 0)
1051 kind = tb2[TCA_ACT_KIND];
1057 tc_dump_action(struct sk_buff *skb, struct netlink_callback *cb)
1059 struct nlmsghdr *nlh;
1060 unsigned char *b = skb_tail_pointer(skb);
1061 struct nlattr *nest;
1062 struct tc_action_ops *a_o;
1065 struct tcamsg *t = (struct tcamsg *) NLMSG_DATA(cb->nlh);
1066 struct nlattr *kind = find_dump_kind(cb->nlh);
1069 pr_info("tc_dump_action: action bad kind\n");
1073 a_o = tc_lookup_action(kind);
1077 memset(&a, 0, sizeof(struct tc_action));
1080 if (a_o->walk == NULL) {
1081 WARN(1, "tc_dump_action: %s !capable of dumping table\n",
1083 goto nla_put_failure;
1086 nlh = NLMSG_PUT(skb, NETLINK_CB(cb->skb).pid, cb->nlh->nlmsg_seq,
1087 cb->nlh->nlmsg_type, sizeof(*t));
1088 t = NLMSG_DATA(nlh);
1089 t->tca_family = AF_UNSPEC;
1093 nest = nla_nest_start(skb, TCA_ACT_TAB);
1095 goto nla_put_failure;
1097 ret = a_o->walk(skb, cb, RTM_GETACTION, &a);
1099 goto nla_put_failure;
1102 nla_nest_end(skb, nest);
1105 nla_nest_cancel(skb, nest);
1107 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
1108 if (NETLINK_CB(cb->skb).pid && ret)
1109 nlh->nlmsg_flags |= NLM_F_MULTI;
1110 module_put(a_o->owner);
1115 module_put(a_o->owner);
1120 static int __init tc_action_init(void)
1122 rtnl_register(PF_UNSPEC, RTM_NEWACTION, tc_ctl_action, NULL, NULL);
1123 rtnl_register(PF_UNSPEC, RTM_DELACTION, tc_ctl_action, NULL, NULL);
1124 rtnl_register(PF_UNSPEC, RTM_GETACTION, tc_ctl_action, tc_dump_action,
1130 subsys_initcall(tc_action_init);