cls_api.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698
  1. /*
  2. * net/sched/cls_api.c Packet classifier API.
  3. *
  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.
  8. *
  9. * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
  10. *
  11. * Changes:
  12. *
  13. * Eduardo J. Blanco <ejbs@netlabs.com.uy> :990222: kmod support
  14. *
  15. */
  16. #include <linux/module.h>
  17. #include <linux/types.h>
  18. #include <linux/kernel.h>
  19. #include <linux/string.h>
  20. #include <linux/errno.h>
  21. #include <linux/skbuff.h>
  22. #include <linux/init.h>
  23. #include <linux/kmod.h>
  24. #include <linux/err.h>
  25. #include <linux/slab.h>
  26. #include <net/net_namespace.h>
  27. #include <net/sock.h>
  28. #include <net/netlink.h>
  29. #include <net/pkt_sched.h>
  30. #include <net/pkt_cls.h>
  31. /* The list of all installed classifier types */
  32. static LIST_HEAD(tcf_proto_base);
  33. /* Protects list of registered TC modules. It is pure SMP lock. */
  34. static DEFINE_RWLOCK(cls_mod_lock);
  35. /* Find classifier type by string name */
  36. static const struct tcf_proto_ops *tcf_proto_lookup_ops(struct nlattr *kind)
  37. {
  38. const struct tcf_proto_ops *t, *res = NULL;
  39. if (kind) {
  40. read_lock(&cls_mod_lock);
  41. list_for_each_entry(t, &tcf_proto_base, head) {
  42. if (nla_strcmp(kind, t->kind) == 0) {
  43. if (try_module_get(t->owner))
  44. res = t;
  45. break;
  46. }
  47. }
  48. read_unlock(&cls_mod_lock);
  49. }
  50. return res;
  51. }
  52. /* Register(unregister) new classifier type */
  53. int register_tcf_proto_ops(struct tcf_proto_ops *ops)
  54. {
  55. struct tcf_proto_ops *t;
  56. int rc = -EEXIST;
  57. write_lock(&cls_mod_lock);
  58. list_for_each_entry(t, &tcf_proto_base, head)
  59. if (!strcmp(ops->kind, t->kind))
  60. goto out;
  61. list_add_tail(&ops->head, &tcf_proto_base);
  62. rc = 0;
  63. out:
  64. write_unlock(&cls_mod_lock);
  65. return rc;
  66. }
  67. EXPORT_SYMBOL(register_tcf_proto_ops);
  68. int unregister_tcf_proto_ops(struct tcf_proto_ops *ops)
  69. {
  70. struct tcf_proto_ops *t;
  71. int rc = -ENOENT;
  72. /* Wait for outstanding call_rcu()s, if any, from a
  73. * tcf_proto_ops's destroy() handler.
  74. */
  75. rcu_barrier();
  76. write_lock(&cls_mod_lock);
  77. list_for_each_entry(t, &tcf_proto_base, head) {
  78. if (t == ops) {
  79. list_del(&t->head);
  80. rc = 0;
  81. break;
  82. }
  83. }
  84. write_unlock(&cls_mod_lock);
  85. return rc;
  86. }
  87. EXPORT_SYMBOL(unregister_tcf_proto_ops);
  88. static int tfilter_notify(struct net *net, struct sk_buff *oskb,
  89. struct nlmsghdr *n, struct tcf_proto *tp,
  90. unsigned long fh, int event, bool unicast);
  91. static void tfilter_notify_chain(struct net *net, struct sk_buff *oskb,
  92. struct nlmsghdr *n,
  93. struct tcf_proto __rcu **chain, int event)
  94. {
  95. struct tcf_proto __rcu **it_chain;
  96. struct tcf_proto *tp;
  97. for (it_chain = chain; (tp = rtnl_dereference(*it_chain)) != NULL;
  98. it_chain = &tp->next)
  99. tfilter_notify(net, oskb, n, tp, 0, event, false);
  100. }
  101. /* Select new prio value from the range, managed by kernel. */
  102. static inline u32 tcf_auto_prio(struct tcf_proto *tp)
  103. {
  104. u32 first = TC_H_MAKE(0xC0000000U, 0U);
  105. if (tp)
  106. first = tp->prio - 1;
  107. return first;
  108. }
  109. /* Add/change/delete/get a filter node */
  110. static int tc_ctl_tfilter(struct sk_buff *skb, struct nlmsghdr *n)
  111. {
  112. struct net *net = sock_net(skb->sk);
  113. struct nlattr *tca[TCA_MAX + 1];
  114. struct tcmsg *t;
  115. u32 protocol;
  116. u32 prio;
  117. u32 nprio;
  118. u32 parent;
  119. struct net_device *dev;
  120. struct Qdisc *q;
  121. struct tcf_proto __rcu **back;
  122. struct tcf_proto __rcu **chain;
  123. struct tcf_proto *tp;
  124. const struct tcf_proto_ops *tp_ops;
  125. const struct Qdisc_class_ops *cops;
  126. unsigned long cl;
  127. unsigned long fh;
  128. int err;
  129. int tp_created;
  130. if ((n->nlmsg_type != RTM_GETTFILTER) &&
  131. !netlink_ns_capable(skb, net->user_ns, CAP_NET_ADMIN))
  132. return -EPERM;
  133. replay:
  134. tp_created = 0;
  135. err = nlmsg_parse(n, sizeof(*t), tca, TCA_MAX, NULL);
  136. if (err < 0)
  137. return err;
  138. t = nlmsg_data(n);
  139. protocol = TC_H_MIN(t->tcm_info);
  140. prio = TC_H_MAJ(t->tcm_info);
  141. nprio = prio;
  142. parent = t->tcm_parent;
  143. cl = 0;
  144. if (prio == 0) {
  145. switch (n->nlmsg_type) {
  146. case RTM_DELTFILTER:
  147. if (protocol || t->tcm_handle || tca[TCA_KIND])
  148. return -ENOENT;
  149. break;
  150. case RTM_NEWTFILTER:
  151. /* If no priority is provided by the user,
  152. * we allocate one.
  153. */
  154. if (n->nlmsg_flags & NLM_F_CREATE) {
  155. prio = TC_H_MAKE(0x80000000U, 0U);
  156. break;
  157. }
  158. /* fall-through */
  159. default:
  160. return -ENOENT;
  161. }
  162. }
  163. /* Find head of filter chain. */
  164. /* Find link */
  165. dev = __dev_get_by_index(net, t->tcm_ifindex);
  166. if (dev == NULL)
  167. return -ENODEV;
  168. /* Find qdisc */
  169. if (!parent) {
  170. q = dev->qdisc;
  171. parent = q->handle;
  172. } else {
  173. q = qdisc_lookup(dev, TC_H_MAJ(t->tcm_parent));
  174. if (q == NULL)
  175. return -EINVAL;
  176. }
  177. /* Is it classful? */
  178. cops = q->ops->cl_ops;
  179. if (!cops)
  180. return -EINVAL;
  181. if (cops->tcf_chain == NULL)
  182. return -EOPNOTSUPP;
  183. /* Do we search for filter, attached to class? */
  184. if (TC_H_MIN(parent)) {
  185. cl = cops->get(q, parent);
  186. if (cl == 0)
  187. return -ENOENT;
  188. }
  189. /* And the last stroke */
  190. chain = cops->tcf_chain(q, cl);
  191. err = -EINVAL;
  192. if (chain == NULL)
  193. goto errout;
  194. if (n->nlmsg_type == RTM_DELTFILTER && prio == 0) {
  195. tfilter_notify_chain(net, skb, n, chain, RTM_DELTFILTER);
  196. tcf_destroy_chain(chain);
  197. err = 0;
  198. goto errout;
  199. }
  200. /* Check the chain for existence of proto-tcf with this priority */
  201. for (back = chain;
  202. (tp = rtnl_dereference(*back)) != NULL;
  203. back = &tp->next) {
  204. if (tp->prio >= prio) {
  205. if (tp->prio == prio) {
  206. if (!nprio ||
  207. (tp->protocol != protocol && protocol))
  208. goto errout;
  209. } else
  210. tp = NULL;
  211. break;
  212. }
  213. }
  214. if (tp == NULL) {
  215. /* Proto-tcf does not exist, create new one */
  216. if (tca[TCA_KIND] == NULL || !protocol)
  217. goto errout;
  218. err = -ENOENT;
  219. if (n->nlmsg_type != RTM_NEWTFILTER ||
  220. !(n->nlmsg_flags & NLM_F_CREATE))
  221. goto errout;
  222. /* Create new proto tcf */
  223. err = -ENOBUFS;
  224. tp = kzalloc(sizeof(*tp), GFP_KERNEL);
  225. if (tp == NULL)
  226. goto errout;
  227. err = -ENOENT;
  228. tp_ops = tcf_proto_lookup_ops(tca[TCA_KIND]);
  229. if (tp_ops == NULL) {
  230. #ifdef CONFIG_MODULES
  231. struct nlattr *kind = tca[TCA_KIND];
  232. char name[IFNAMSIZ];
  233. if (kind != NULL &&
  234. nla_strlcpy(name, kind, IFNAMSIZ) < IFNAMSIZ) {
  235. rtnl_unlock();
  236. request_module("cls_%s", name);
  237. rtnl_lock();
  238. tp_ops = tcf_proto_lookup_ops(kind);
  239. /* We dropped the RTNL semaphore in order to
  240. * perform the module load. So, even if we
  241. * succeeded in loading the module we have to
  242. * replay the request. We indicate this using
  243. * -EAGAIN.
  244. */
  245. if (tp_ops != NULL) {
  246. module_put(tp_ops->owner);
  247. err = -EAGAIN;
  248. }
  249. }
  250. #endif
  251. kfree(tp);
  252. goto errout;
  253. }
  254. tp->ops = tp_ops;
  255. tp->protocol = protocol;
  256. tp->prio = nprio ? :
  257. TC_H_MAJ(tcf_auto_prio(rtnl_dereference(*back)));
  258. tp->q = q;
  259. tp->classify = tp_ops->classify;
  260. tp->classid = parent;
  261. err = tp_ops->init(tp);
  262. if (err != 0) {
  263. module_put(tp_ops->owner);
  264. kfree(tp);
  265. goto errout;
  266. }
  267. tp_created = 1;
  268. } else if (tca[TCA_KIND] && nla_strcmp(tca[TCA_KIND], tp->ops->kind))
  269. goto errout;
  270. fh = tp->ops->get(tp, t->tcm_handle);
  271. if (fh == 0) {
  272. if (n->nlmsg_type == RTM_DELTFILTER && t->tcm_handle == 0) {
  273. struct tcf_proto *next = rtnl_dereference(tp->next);
  274. RCU_INIT_POINTER(*back, next);
  275. tfilter_notify(net, skb, n, tp, fh,
  276. RTM_DELTFILTER, false);
  277. tcf_destroy(tp, true);
  278. err = 0;
  279. goto errout;
  280. }
  281. err = -ENOENT;
  282. if (n->nlmsg_type != RTM_NEWTFILTER ||
  283. !(n->nlmsg_flags & NLM_F_CREATE))
  284. goto errout;
  285. } else {
  286. switch (n->nlmsg_type) {
  287. case RTM_NEWTFILTER:
  288. err = -EEXIST;
  289. if (n->nlmsg_flags & NLM_F_EXCL) {
  290. if (tp_created)
  291. tcf_destroy(tp, true);
  292. goto errout;
  293. }
  294. break;
  295. case RTM_DELTFILTER:
  296. err = tp->ops->delete(tp, fh);
  297. if (err == 0) {
  298. struct tcf_proto *next = rtnl_dereference(tp->next);
  299. tfilter_notify(net, skb, n, tp,
  300. t->tcm_handle,
  301. RTM_DELTFILTER, false);
  302. if (tcf_destroy(tp, false))
  303. RCU_INIT_POINTER(*back, next);
  304. }
  305. goto errout;
  306. case RTM_GETTFILTER:
  307. err = tfilter_notify(net, skb, n, tp, fh,
  308. RTM_NEWTFILTER, true);
  309. goto errout;
  310. default:
  311. err = -EINVAL;
  312. goto errout;
  313. }
  314. }
  315. err = tp->ops->change(net, skb, tp, cl, t->tcm_handle, tca, &fh,
  316. n->nlmsg_flags & NLM_F_CREATE ? TCA_ACT_NOREPLACE : TCA_ACT_REPLACE);
  317. if (err == 0) {
  318. if (tp_created) {
  319. RCU_INIT_POINTER(tp->next, rtnl_dereference(*back));
  320. rcu_assign_pointer(*back, tp);
  321. }
  322. tfilter_notify(net, skb, n, tp, fh, RTM_NEWTFILTER, false);
  323. } else {
  324. if (tp_created)
  325. tcf_destroy(tp, true);
  326. }
  327. errout:
  328. if (cl)
  329. cops->put(q, cl);
  330. if (err == -EAGAIN)
  331. /* Replay the request. */
  332. goto replay;
  333. return err;
  334. }
  335. static int tcf_fill_node(struct net *net, struct sk_buff *skb,
  336. struct tcf_proto *tp, unsigned long fh, u32 portid,
  337. u32 seq, u16 flags, int event)
  338. {
  339. struct tcmsg *tcm;
  340. struct nlmsghdr *nlh;
  341. unsigned char *b = skb_tail_pointer(skb);
  342. nlh = nlmsg_put(skb, portid, seq, event, sizeof(*tcm), flags);
  343. if (!nlh)
  344. goto out_nlmsg_trim;
  345. tcm = nlmsg_data(nlh);
  346. tcm->tcm_family = AF_UNSPEC;
  347. tcm->tcm__pad1 = 0;
  348. tcm->tcm__pad2 = 0;
  349. tcm->tcm_ifindex = qdisc_dev(tp->q)->ifindex;
  350. tcm->tcm_parent = tp->classid;
  351. tcm->tcm_info = TC_H_MAKE(tp->prio, tp->protocol);
  352. if (nla_put_string(skb, TCA_KIND, tp->ops->kind))
  353. goto nla_put_failure;
  354. tcm->tcm_handle = fh;
  355. if (RTM_DELTFILTER != event) {
  356. tcm->tcm_handle = 0;
  357. if (tp->ops->dump && tp->ops->dump(net, tp, fh, skb, tcm) < 0)
  358. goto nla_put_failure;
  359. }
  360. nlh->nlmsg_len = skb_tail_pointer(skb) - b;
  361. return skb->len;
  362. out_nlmsg_trim:
  363. nla_put_failure:
  364. nlmsg_trim(skb, b);
  365. return -1;
  366. }
  367. static int tfilter_notify(struct net *net, struct sk_buff *oskb,
  368. struct nlmsghdr *n, struct tcf_proto *tp,
  369. unsigned long fh, int event, bool unicast)
  370. {
  371. struct sk_buff *skb;
  372. u32 portid = oskb ? NETLINK_CB(oskb).portid : 0;
  373. skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
  374. if (!skb)
  375. return -ENOBUFS;
  376. if (tcf_fill_node(net, skb, tp, fh, portid, n->nlmsg_seq,
  377. n->nlmsg_flags, event) <= 0) {
  378. kfree_skb(skb);
  379. return -EINVAL;
  380. }
  381. if (unicast)
  382. return netlink_unicast(net->rtnl, skb, portid, MSG_DONTWAIT);
  383. return rtnetlink_send(skb, net, portid, RTNLGRP_TC,
  384. n->nlmsg_flags & NLM_F_ECHO);
  385. }
  386. struct tcf_dump_args {
  387. struct tcf_walker w;
  388. struct sk_buff *skb;
  389. struct netlink_callback *cb;
  390. };
  391. static int tcf_node_dump(struct tcf_proto *tp, unsigned long n,
  392. struct tcf_walker *arg)
  393. {
  394. struct tcf_dump_args *a = (void *)arg;
  395. struct net *net = sock_net(a->skb->sk);
  396. return tcf_fill_node(net, a->skb, tp, n, NETLINK_CB(a->cb->skb).portid,
  397. a->cb->nlh->nlmsg_seq, NLM_F_MULTI,
  398. RTM_NEWTFILTER);
  399. }
  400. /* called with RTNL */
  401. static int tc_dump_tfilter(struct sk_buff *skb, struct netlink_callback *cb)
  402. {
  403. struct net *net = sock_net(skb->sk);
  404. int t;
  405. int s_t;
  406. struct net_device *dev;
  407. struct Qdisc *q;
  408. struct tcf_proto *tp, __rcu **chain;
  409. struct tcmsg *tcm = nlmsg_data(cb->nlh);
  410. unsigned long cl = 0;
  411. const struct Qdisc_class_ops *cops;
  412. struct tcf_dump_args arg;
  413. if (nlmsg_len(cb->nlh) < sizeof(*tcm))
  414. return skb->len;
  415. dev = __dev_get_by_index(net, tcm->tcm_ifindex);
  416. if (!dev)
  417. return skb->len;
  418. if (!tcm->tcm_parent)
  419. q = dev->qdisc;
  420. else
  421. q = qdisc_lookup(dev, TC_H_MAJ(tcm->tcm_parent));
  422. if (!q)
  423. goto out;
  424. cops = q->ops->cl_ops;
  425. if (!cops)
  426. goto errout;
  427. if (cops->tcf_chain == NULL)
  428. goto errout;
  429. if (TC_H_MIN(tcm->tcm_parent)) {
  430. cl = cops->get(q, tcm->tcm_parent);
  431. if (cl == 0)
  432. goto errout;
  433. }
  434. chain = cops->tcf_chain(q, cl);
  435. if (chain == NULL)
  436. goto errout;
  437. s_t = cb->args[0];
  438. for (tp = rtnl_dereference(*chain), t = 0;
  439. tp; tp = rtnl_dereference(tp->next), t++) {
  440. if (t < s_t)
  441. continue;
  442. if (TC_H_MAJ(tcm->tcm_info) &&
  443. TC_H_MAJ(tcm->tcm_info) != tp->prio)
  444. continue;
  445. if (TC_H_MIN(tcm->tcm_info) &&
  446. TC_H_MIN(tcm->tcm_info) != tp->protocol)
  447. continue;
  448. if (t > s_t)
  449. memset(&cb->args[1], 0,
  450. sizeof(cb->args)-sizeof(cb->args[0]));
  451. if (cb->args[1] == 0) {
  452. if (tcf_fill_node(net, skb, tp, 0,
  453. NETLINK_CB(cb->skb).portid,
  454. cb->nlh->nlmsg_seq, NLM_F_MULTI,
  455. RTM_NEWTFILTER) <= 0)
  456. break;
  457. cb->args[1] = 1;
  458. }
  459. if (tp->ops->walk == NULL)
  460. continue;
  461. arg.w.fn = tcf_node_dump;
  462. arg.skb = skb;
  463. arg.cb = cb;
  464. arg.w.stop = 0;
  465. arg.w.skip = cb->args[1] - 1;
  466. arg.w.count = 0;
  467. tp->ops->walk(tp, &arg.w);
  468. cb->args[1] = arg.w.count + 1;
  469. if (arg.w.stop)
  470. break;
  471. }
  472. cb->args[0] = t;
  473. errout:
  474. if (cl)
  475. cops->put(q, cl);
  476. out:
  477. return skb->len;
  478. }
  479. void tcf_exts_destroy(struct tcf_exts *exts)
  480. {
  481. #ifdef CONFIG_NET_CLS_ACT
  482. LIST_HEAD(actions);
  483. tcf_exts_to_list(exts, &actions);
  484. tcf_action_destroy(&actions, TCA_ACT_UNBIND);
  485. kfree(exts->actions);
  486. exts->nr_actions = 0;
  487. #endif
  488. }
  489. EXPORT_SYMBOL(tcf_exts_destroy);
  490. int tcf_exts_validate(struct net *net, struct tcf_proto *tp, struct nlattr **tb,
  491. struct nlattr *rate_tlv, struct tcf_exts *exts, bool ovr)
  492. {
  493. #ifdef CONFIG_NET_CLS_ACT
  494. {
  495. struct tc_action *act;
  496. if (exts->police && tb[exts->police]) {
  497. act = tcf_action_init_1(net, tb[exts->police], rate_tlv,
  498. "police", ovr, TCA_ACT_BIND);
  499. if (IS_ERR(act))
  500. return PTR_ERR(act);
  501. act->type = exts->type = TCA_OLD_COMPAT;
  502. exts->actions[0] = act;
  503. exts->nr_actions = 1;
  504. } else if (exts->action && tb[exts->action]) {
  505. LIST_HEAD(actions);
  506. int err, i = 0;
  507. err = tcf_action_init(net, tb[exts->action], rate_tlv,
  508. NULL, ovr, TCA_ACT_BIND,
  509. &actions);
  510. if (err)
  511. return err;
  512. list_for_each_entry(act, &actions, list)
  513. exts->actions[i++] = act;
  514. exts->nr_actions = i;
  515. }
  516. }
  517. #else
  518. if ((exts->action && tb[exts->action]) ||
  519. (exts->police && tb[exts->police]))
  520. return -EOPNOTSUPP;
  521. #endif
  522. return 0;
  523. }
  524. EXPORT_SYMBOL(tcf_exts_validate);
  525. void tcf_exts_change(struct tcf_proto *tp, struct tcf_exts *dst,
  526. struct tcf_exts *src)
  527. {
  528. #ifdef CONFIG_NET_CLS_ACT
  529. struct tcf_exts old = *dst;
  530. tcf_tree_lock(tp);
  531. dst->nr_actions = src->nr_actions;
  532. dst->actions = src->actions;
  533. dst->type = src->type;
  534. tcf_tree_unlock(tp);
  535. tcf_exts_destroy(&old);
  536. #endif
  537. }
  538. EXPORT_SYMBOL(tcf_exts_change);
  539. #ifdef CONFIG_NET_CLS_ACT
  540. static struct tc_action *tcf_exts_first_act(struct tcf_exts *exts)
  541. {
  542. if (exts->nr_actions == 0)
  543. return NULL;
  544. else
  545. return exts->actions[0];
  546. }
  547. #endif
  548. int tcf_exts_dump(struct sk_buff *skb, struct tcf_exts *exts)
  549. {
  550. #ifdef CONFIG_NET_CLS_ACT
  551. struct nlattr *nest;
  552. if (exts->action && exts->nr_actions) {
  553. /*
  554. * again for backward compatible mode - we want
  555. * to work with both old and new modes of entering
  556. * tc data even if iproute2 was newer - jhs
  557. */
  558. if (exts->type != TCA_OLD_COMPAT) {
  559. LIST_HEAD(actions);
  560. nest = nla_nest_start(skb, exts->action);
  561. if (nest == NULL)
  562. goto nla_put_failure;
  563. tcf_exts_to_list(exts, &actions);
  564. if (tcf_action_dump(skb, &actions, 0, 0) < 0)
  565. goto nla_put_failure;
  566. nla_nest_end(skb, nest);
  567. } else if (exts->police) {
  568. struct tc_action *act = tcf_exts_first_act(exts);
  569. nest = nla_nest_start(skb, exts->police);
  570. if (nest == NULL || !act)
  571. goto nla_put_failure;
  572. if (tcf_action_dump_old(skb, act, 0, 0) < 0)
  573. goto nla_put_failure;
  574. nla_nest_end(skb, nest);
  575. }
  576. }
  577. return 0;
  578. nla_put_failure:
  579. nla_nest_cancel(skb, nest);
  580. return -1;
  581. #else
  582. return 0;
  583. #endif
  584. }
  585. EXPORT_SYMBOL(tcf_exts_dump);
  586. int tcf_exts_dump_stats(struct sk_buff *skb, struct tcf_exts *exts)
  587. {
  588. #ifdef CONFIG_NET_CLS_ACT
  589. struct tc_action *a = tcf_exts_first_act(exts);
  590. if (a != NULL && tcf_action_copy_stats(skb, a, 1) < 0)
  591. return -1;
  592. #endif
  593. return 0;
  594. }
  595. EXPORT_SYMBOL(tcf_exts_dump_stats);
  596. static int __init tc_filter_init(void)
  597. {
  598. rtnl_register(PF_UNSPEC, RTM_NEWTFILTER, tc_ctl_tfilter, NULL, NULL);
  599. rtnl_register(PF_UNSPEC, RTM_DELTFILTER, tc_ctl_tfilter, NULL, NULL);
  600. rtnl_register(PF_UNSPEC, RTM_GETTFILTER, tc_ctl_tfilter,
  601. tc_dump_tfilter, NULL);
  602. return 0;
  603. }
  604. subsys_initcall(tc_filter_init);