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 /* Must supply act, dump, cleanup and init */
274 if (!act->act || !act->dump || !act->cleanup || !act->init)
278 act->lookup = tcf_hash_search;
280 write_lock(&act_mod_lock);
281 for (ap = &act_base; (a = *ap) != NULL; ap = &a->next) {
282 if (act->type == a->type || (strcmp(act->kind, a->kind) == 0)) {
283 write_unlock(&act_mod_lock);
289 write_unlock(&act_mod_lock);
292 EXPORT_SYMBOL(tcf_register_action);
294 int tcf_unregister_action(struct tc_action_ops *act)
296 struct tc_action_ops *a, **ap;
299 write_lock(&act_mod_lock);
300 for (ap = &act_base; (a = *ap) != NULL; ap = &a->next)
308 write_unlock(&act_mod_lock);
311 EXPORT_SYMBOL(tcf_unregister_action);
314 static struct tc_action_ops *tc_lookup_action_n(char *kind)
316 struct tc_action_ops *a = NULL;
319 read_lock(&act_mod_lock);
320 for (a = act_base; a; a = a->next) {
321 if (strcmp(kind, a->kind) == 0) {
322 if (!try_module_get(a->owner)) {
323 read_unlock(&act_mod_lock);
329 read_unlock(&act_mod_lock);
334 /* lookup by nlattr */
335 static struct tc_action_ops *tc_lookup_action(struct nlattr *kind)
337 struct tc_action_ops *a = NULL;
340 read_lock(&act_mod_lock);
341 for (a = act_base; a; a = a->next) {
342 if (nla_strcmp(kind, a->kind) == 0) {
343 if (!try_module_get(a->owner)) {
344 read_unlock(&act_mod_lock);
350 read_unlock(&act_mod_lock);
357 static struct tc_action_ops *tc_lookup_action_id(u32 type)
359 struct tc_action_ops *a = NULL;
362 read_lock(&act_mod_lock);
363 for (a = act_base; a; a = a->next) {
364 if (a->type == type) {
365 if (!try_module_get(a->owner)) {
366 read_unlock(&act_mod_lock);
372 read_unlock(&act_mod_lock);
378 int tcf_action_exec(struct sk_buff *skb, const struct tc_action *act,
379 struct tcf_result *res)
381 const struct tc_action *a;
384 if (skb->tc_verd & TC_NCLS) {
385 skb->tc_verd = CLR_TC_NCLS(skb->tc_verd);
389 while ((a = act) != NULL) {
392 ret = a->ops->act(skb, a, res);
393 if (TC_MUNGED & skb->tc_verd) {
394 /* copied already, allow trampling */
395 skb->tc_verd = SET_TC_OK2MUNGE(skb->tc_verd);
396 skb->tc_verd = CLR_TC_MUNGED(skb->tc_verd);
398 if (ret == TC_ACT_REPEAT)
399 goto repeat; /* we need a ttl - JHS */
400 if (ret != TC_ACT_PIPE)
408 EXPORT_SYMBOL(tcf_action_exec);
410 void tcf_action_destroy(struct tc_action *act, int bind)
414 for (a = act; a; a = act) {
416 if (a->ops->cleanup(a, bind) == ACT_P_DELETED)
417 module_put(a->ops->owner);
421 /*FIXME: Remove later - catch insertion bugs*/
422 WARN(1, "tcf_action_destroy: BUG? destroying NULL ops\n");
430 tcf_action_dump_old(struct sk_buff *skb, struct tc_action *a, int bind, int ref)
436 return a->ops->dump(skb, a, bind, ref);
440 tcf_action_dump_1(struct sk_buff *skb, struct tc_action *a, int bind, int ref)
443 unsigned char *b = skb_tail_pointer(skb);
449 if (nla_put_string(skb, TCA_KIND, a->ops->kind))
450 goto nla_put_failure;
451 if (tcf_action_copy_stats(skb, a, 0))
452 goto nla_put_failure;
453 nest = nla_nest_start(skb, TCA_OPTIONS);
455 goto nla_put_failure;
456 err = tcf_action_dump_old(skb, a, bind, ref);
458 nla_nest_end(skb, nest);
466 EXPORT_SYMBOL(tcf_action_dump_1);
469 tcf_action_dump(struct sk_buff *skb, struct tc_action *act, int bind, int ref)
475 while ((a = act) != NULL) {
477 nest = nla_nest_start(skb, a->order);
479 goto nla_put_failure;
480 err = tcf_action_dump_1(skb, a, bind, ref);
483 nla_nest_end(skb, nest);
491 nla_nest_cancel(skb, nest);
495 struct tc_action *tcf_action_init_1(struct net *net, struct nlattr *nla,
496 struct nlattr *est, char *name, int ovr,
500 struct tc_action_ops *a_o;
501 char act_name[IFNAMSIZ];
502 struct nlattr *tb[TCA_ACT_MAX + 1];
507 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
511 kind = tb[TCA_ACT_KIND];
514 if (nla_strlcpy(act_name, kind, IFNAMSIZ) >= IFNAMSIZ)
518 if (strlcpy(act_name, name, IFNAMSIZ) >= IFNAMSIZ)
522 a_o = tc_lookup_action_n(act_name);
524 #ifdef CONFIG_MODULES
526 request_module("act_%s", act_name);
529 a_o = tc_lookup_action_n(act_name);
531 /* We dropped the RTNL semaphore in order to
532 * perform the module load. So, even if we
533 * succeeded in loading the module we have to
534 * tell the caller to replay the request. We
535 * indicate this using -EAGAIN.
547 a = kzalloc(sizeof(*a), GFP_KERNEL);
551 /* backward compatibility for policer */
553 err = a_o->init(net, tb[TCA_ACT_OPTIONS], est, a, ovr, bind);
555 err = a_o->init(net, nla, est, a, ovr, bind);
559 /* module count goes up only when brand new policy is created
560 * if it exists and is only bound to in a_o->init() then
561 * ACT_P_CREATED is not returned (a zero is).
563 if (err != ACT_P_CREATED)
564 module_put(a_o->owner);
572 module_put(a_o->owner);
577 struct tc_action *tcf_action_init(struct net *net, struct nlattr *nla,
578 struct nlattr *est, char *name, int ovr,
581 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
582 struct tc_action *head = NULL, *act, *act_prev = NULL;
586 err = nla_parse_nested(tb, TCA_ACT_MAX_PRIO, nla, NULL);
590 for (i = 1; i <= TCA_ACT_MAX_PRIO && tb[i]; i++) {
591 act = tcf_action_init_1(net, tb[i], est, name, ovr, bind);
599 act_prev->next = act;
606 tcf_action_destroy(head, bind);
610 int tcf_action_copy_stats(struct sk_buff *skb, struct tc_action *a,
615 struct tcf_act_hdr *h = a->priv;
620 /* compat_mode being true specifies a call that is supposed
621 * to add additional backward compatibility statistic TLVs.
624 if (a->type == TCA_OLD_COMPAT)
625 err = gnet_stats_start_copy_compat(skb, 0,
626 TCA_STATS, TCA_XSTATS, &h->tcf_lock, &d);
630 err = gnet_stats_start_copy(skb, TCA_ACT_STATS,
636 if (a->ops != NULL && a->ops->get_stats != NULL)
637 if (a->ops->get_stats(skb, a) < 0)
640 if (gnet_stats_copy_basic(&d, &h->tcf_bstats) < 0 ||
641 gnet_stats_copy_rate_est(&d, &h->tcf_bstats,
642 &h->tcf_rate_est) < 0 ||
643 gnet_stats_copy_queue(&d, &h->tcf_qstats) < 0)
646 if (gnet_stats_finish_copy(&d) < 0)
656 tca_get_fill(struct sk_buff *skb, struct tc_action *a, u32 portid, u32 seq,
657 u16 flags, int event, int bind, int ref)
660 struct nlmsghdr *nlh;
661 unsigned char *b = skb_tail_pointer(skb);
664 nlh = nlmsg_put(skb, portid, seq, event, sizeof(*t), flags);
668 t->tca_family = AF_UNSPEC;
672 nest = nla_nest_start(skb, TCA_ACT_TAB);
676 if (tcf_action_dump(skb, a, bind, ref) < 0)
679 nla_nest_end(skb, nest);
681 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
690 act_get_notify(struct net *net, u32 portid, struct nlmsghdr *n,
691 struct tc_action *a, int event)
695 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
698 if (tca_get_fill(skb, a, portid, n->nlmsg_seq, 0, event, 0, 0) <= 0) {
703 return rtnl_unicast(skb, net, portid);
706 static struct tc_action *
707 tcf_action_get_1(struct nlattr *nla, struct nlmsghdr *n, u32 portid)
709 struct nlattr *tb[TCA_ACT_MAX + 1];
714 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
719 if (tb[TCA_ACT_INDEX] == NULL ||
720 nla_len(tb[TCA_ACT_INDEX]) < sizeof(index))
722 index = nla_get_u32(tb[TCA_ACT_INDEX]);
725 a = kzalloc(sizeof(struct tc_action), GFP_KERNEL);
730 a->ops = tc_lookup_action(tb[TCA_ACT_KIND]);
734 if (a->ops->lookup(a, index) == 0)
737 module_put(a->ops->owner);
741 module_put(a->ops->owner);
748 static void cleanup_a(struct tc_action *act)
752 for (a = act; a; a = act) {
758 static struct tc_action *create_a(int i)
760 struct tc_action *act;
762 act = kzalloc(sizeof(*act), GFP_KERNEL);
764 pr_debug("create_a: failed to alloc!\n");
771 static int tca_action_flush(struct net *net, struct nlattr *nla,
772 struct nlmsghdr *n, u32 portid)
776 struct nlmsghdr *nlh;
778 struct netlink_callback dcb;
780 struct nlattr *tb[TCA_ACT_MAX + 1];
782 struct tc_action *a = create_a(0);
786 pr_debug("tca_action_flush: couldnt create tc_action\n");
790 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
792 pr_debug("tca_action_flush: failed skb alloc\n");
797 b = skb_tail_pointer(skb);
799 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
804 kind = tb[TCA_ACT_KIND];
805 a->ops = tc_lookup_action(kind);
809 nlh = nlmsg_put(skb, portid, n->nlmsg_seq, RTM_DELACTION, sizeof(*t), 0);
813 t->tca_family = AF_UNSPEC;
817 nest = nla_nest_start(skb, TCA_ACT_TAB);
821 err = a->ops->walk(skb, &dcb, RTM_DELACTION, a);
827 nla_nest_end(skb, nest);
829 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
830 nlh->nlmsg_flags |= NLM_F_ROOT;
831 module_put(a->ops->owner);
833 err = rtnetlink_send(skb, net, portid, RTNLGRP_TC,
834 n->nlmsg_flags & NLM_F_ECHO);
841 module_put(a->ops->owner);
850 tca_action_gd(struct net *net, struct nlattr *nla, struct nlmsghdr *n,
851 u32 portid, int event)
854 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
855 struct tc_action *head = NULL, *act, *act_prev = NULL;
857 ret = nla_parse_nested(tb, TCA_ACT_MAX_PRIO, nla, NULL);
861 if (event == RTM_DELACTION && n->nlmsg_flags & NLM_F_ROOT) {
863 return tca_action_flush(net, tb[1], n, portid);
868 for (i = 1; i <= TCA_ACT_MAX_PRIO && tb[i]; i++) {
869 act = tcf_action_get_1(tb[i], n, portid);
879 act_prev->next = act;
883 if (event == RTM_GETACTION)
884 ret = act_get_notify(net, portid, n, head, event);
888 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
894 if (tca_get_fill(skb, head, portid, n->nlmsg_seq, 0, event,
901 /* now do the delete */
902 tcf_action_destroy(head, 0);
903 ret = rtnetlink_send(skb, net, portid, RTNLGRP_TC,
904 n->nlmsg_flags & NLM_F_ECHO);
914 static int tcf_add_notify(struct net *net, struct tc_action *a,
915 u32 portid, u32 seq, int event, u16 flags)
918 struct nlmsghdr *nlh;
924 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
928 b = skb_tail_pointer(skb);
930 nlh = nlmsg_put(skb, portid, seq, event, sizeof(*t), flags);
934 t->tca_family = AF_UNSPEC;
938 nest = nla_nest_start(skb, TCA_ACT_TAB);
942 if (tcf_action_dump(skb, a, 0, 0) < 0)
945 nla_nest_end(skb, nest);
947 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
948 NETLINK_CB(skb).dst_group = RTNLGRP_TC;
950 err = rtnetlink_send(skb, net, portid, RTNLGRP_TC, flags & NLM_F_ECHO);
962 tcf_action_add(struct net *net, struct nlattr *nla, struct nlmsghdr *n,
966 struct tc_action *act;
968 u32 seq = n->nlmsg_seq;
970 act = tcf_action_init(net, nla, NULL, NULL, ovr, 0);
978 /* dump then free all the actions after update; inserted policy
981 ret = tcf_add_notify(net, act, portid, seq, RTM_NEWACTION, n->nlmsg_flags);
982 for (a = act; a; a = act) {
990 static int tc_ctl_action(struct sk_buff *skb, struct nlmsghdr *n)
992 struct net *net = sock_net(skb->sk);
993 struct nlattr *tca[TCA_ACT_MAX + 1];
994 u32 portid = skb ? NETLINK_CB(skb).portid : 0;
995 int ret = 0, ovr = 0;
997 if ((n->nlmsg_type != RTM_GETACTION) && !capable(CAP_NET_ADMIN))
1000 ret = nlmsg_parse(n, sizeof(struct tcamsg), tca, TCA_ACT_MAX, NULL);
1004 if (tca[TCA_ACT_TAB] == NULL) {
1005 pr_notice("tc_ctl_action: received NO action attribs\n");
1009 /* n->nlmsg_flags & NLM_F_CREATE */
1010 switch (n->nlmsg_type) {
1012 /* we are going to assume all other flags
1013 * imply create only if it doesn't exist
1014 * Note that CREATE | EXCL implies that
1015 * but since we want avoid ambiguity (eg when flags
1016 * is zero) then just set this
1018 if (n->nlmsg_flags & NLM_F_REPLACE)
1021 ret = tcf_action_add(net, tca[TCA_ACT_TAB], n, portid, ovr);
1026 ret = tca_action_gd(net, tca[TCA_ACT_TAB], n,
1027 portid, RTM_DELACTION);
1030 ret = tca_action_gd(net, tca[TCA_ACT_TAB], n,
1031 portid, RTM_GETACTION);
1040 static struct nlattr *
1041 find_dump_kind(const struct nlmsghdr *n)
1043 struct nlattr *tb1, *tb2[TCA_ACT_MAX + 1];
1044 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
1045 struct nlattr *nla[TCAA_MAX + 1];
1046 struct nlattr *kind;
1048 if (nlmsg_parse(n, sizeof(struct tcamsg), nla, TCAA_MAX, NULL) < 0)
1050 tb1 = nla[TCA_ACT_TAB];
1054 if (nla_parse(tb, TCA_ACT_MAX_PRIO, nla_data(tb1),
1055 NLMSG_ALIGN(nla_len(tb1)), NULL) < 0)
1060 if (nla_parse(tb2, TCA_ACT_MAX, nla_data(tb[1]),
1061 nla_len(tb[1]), NULL) < 0)
1063 kind = tb2[TCA_ACT_KIND];
1069 tc_dump_action(struct sk_buff *skb, struct netlink_callback *cb)
1071 struct nlmsghdr *nlh;
1072 unsigned char *b = skb_tail_pointer(skb);
1073 struct nlattr *nest;
1074 struct tc_action_ops *a_o;
1077 struct tcamsg *t = (struct tcamsg *) nlmsg_data(cb->nlh);
1078 struct nlattr *kind = find_dump_kind(cb->nlh);
1081 pr_info("tc_dump_action: action bad kind\n");
1085 a_o = tc_lookup_action(kind);
1089 memset(&a, 0, sizeof(struct tc_action));
1092 if (a_o->walk == NULL) {
1093 WARN(1, "tc_dump_action: %s !capable of dumping table\n",
1095 goto out_module_put;
1098 nlh = nlmsg_put(skb, NETLINK_CB(cb->skb).portid, cb->nlh->nlmsg_seq,
1099 cb->nlh->nlmsg_type, sizeof(*t), 0);
1101 goto out_module_put;
1102 t = nlmsg_data(nlh);
1103 t->tca_family = AF_UNSPEC;
1107 nest = nla_nest_start(skb, TCA_ACT_TAB);
1109 goto out_module_put;
1111 ret = a_o->walk(skb, cb, RTM_GETACTION, &a);
1113 goto out_module_put;
1116 nla_nest_end(skb, nest);
1119 nla_nest_cancel(skb, nest);
1121 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
1122 if (NETLINK_CB(cb->skb).portid && ret)
1123 nlh->nlmsg_flags |= NLM_F_MULTI;
1124 module_put(a_o->owner);
1128 module_put(a_o->owner);
1133 static int __init tc_action_init(void)
1135 rtnl_register(PF_UNSPEC, RTM_NEWACTION, tc_ctl_action, NULL, NULL);
1136 rtnl_register(PF_UNSPEC, RTM_DELACTION, tc_ctl_action, NULL, NULL);
1137 rtnl_register(PF_UNSPEC, RTM_GETACTION, tc_ctl_action, tc_dump_action,
1143 subsys_initcall(tc_action_init);