cls_api.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640
  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 <asm/uaccess.h>
  17. #include <asm/system.h>
  18. #include <linux/bitops.h>
  19. #include <linux/module.h>
  20. #include <linux/types.h>
  21. #include <linux/kernel.h>
  22. #include <linux/string.h>
  23. #include <linux/mm.h>
  24. #include <linux/socket.h>
  25. #include <linux/sockios.h>
  26. #include <linux/in.h>
  27. #include <linux/errno.h>
  28. #include <linux/interrupt.h>
  29. #include <linux/netdevice.h>
  30. #include <linux/skbuff.h>
  31. #include <linux/rtnetlink.h>
  32. #include <linux/init.h>
  33. #include <linux/kmod.h>
  34. #include <net/sock.h>
  35. #include <net/pkt_sched.h>
  36. #include <net/pkt_cls.h>
  37. #if 0 /* control */
  38. #define DPRINTK(format,args...) printk(KERN_DEBUG format,##args)
  39. #else
  40. #define DPRINTK(format,args...)
  41. #endif
  42. /* The list of all installed classifier types */
  43. static struct tcf_proto_ops *tcf_proto_base;
  44. /* Protects list of registered TC modules. It is pure SMP lock. */
  45. static DEFINE_RWLOCK(cls_mod_lock);
  46. /* Find classifier type by string name */
  47. static struct tcf_proto_ops * tcf_proto_lookup_ops(struct rtattr *kind)
  48. {
  49. struct tcf_proto_ops *t = NULL;
  50. if (kind) {
  51. read_lock(&cls_mod_lock);
  52. for (t = tcf_proto_base; t; t = t->next) {
  53. if (rtattr_strcmp(kind, t->kind) == 0) {
  54. if (!try_module_get(t->owner))
  55. t = NULL;
  56. break;
  57. }
  58. }
  59. read_unlock(&cls_mod_lock);
  60. }
  61. return t;
  62. }
  63. /* Register(unregister) new classifier type */
  64. int register_tcf_proto_ops(struct tcf_proto_ops *ops)
  65. {
  66. struct tcf_proto_ops *t, **tp;
  67. int rc = -EEXIST;
  68. write_lock(&cls_mod_lock);
  69. for (tp = &tcf_proto_base; (t = *tp) != NULL; tp = &t->next)
  70. if (!strcmp(ops->kind, t->kind))
  71. goto out;
  72. ops->next = NULL;
  73. *tp = ops;
  74. rc = 0;
  75. out:
  76. write_unlock(&cls_mod_lock);
  77. return rc;
  78. }
  79. int unregister_tcf_proto_ops(struct tcf_proto_ops *ops)
  80. {
  81. struct tcf_proto_ops *t, **tp;
  82. int rc = -ENOENT;
  83. write_lock(&cls_mod_lock);
  84. for (tp = &tcf_proto_base; (t=*tp) != NULL; tp = &t->next)
  85. if (t == ops)
  86. break;
  87. if (!t)
  88. goto out;
  89. *tp = t->next;
  90. rc = 0;
  91. out:
  92. write_unlock(&cls_mod_lock);
  93. return rc;
  94. }
  95. static int tfilter_notify(struct sk_buff *oskb, struct nlmsghdr *n,
  96. struct tcf_proto *tp, unsigned long fh, int event);
  97. /* Select new prio value from the range, managed by kernel. */
  98. static __inline__ u32 tcf_auto_prio(struct tcf_proto *tp)
  99. {
  100. u32 first = TC_H_MAKE(0xC0000000U,0U);
  101. if (tp)
  102. first = tp->prio-1;
  103. return first;
  104. }
  105. /* Add/change/delete/get a filter node */
  106. static int tc_ctl_tfilter(struct sk_buff *skb, struct nlmsghdr *n, void *arg)
  107. {
  108. struct rtattr **tca;
  109. struct tcmsg *t;
  110. u32 protocol;
  111. u32 prio;
  112. u32 nprio;
  113. u32 parent;
  114. struct net_device *dev;
  115. struct Qdisc *q;
  116. struct tcf_proto **back, **chain;
  117. struct tcf_proto *tp;
  118. struct tcf_proto_ops *tp_ops;
  119. struct Qdisc_class_ops *cops;
  120. unsigned long cl;
  121. unsigned long fh;
  122. int err;
  123. replay:
  124. tca = arg;
  125. t = NLMSG_DATA(n);
  126. protocol = TC_H_MIN(t->tcm_info);
  127. prio = TC_H_MAJ(t->tcm_info);
  128. nprio = prio;
  129. parent = t->tcm_parent;
  130. cl = 0;
  131. if (prio == 0) {
  132. /* If no priority is given, user wants we allocated it. */
  133. if (n->nlmsg_type != RTM_NEWTFILTER || !(n->nlmsg_flags&NLM_F_CREATE))
  134. return -ENOENT;
  135. prio = TC_H_MAKE(0x80000000U,0U);
  136. }
  137. /* Find head of filter chain. */
  138. /* Find link */
  139. if ((dev = __dev_get_by_index(t->tcm_ifindex)) == NULL)
  140. return -ENODEV;
  141. /* Find qdisc */
  142. if (!parent) {
  143. q = dev->qdisc_sleeping;
  144. parent = q->handle;
  145. } else if ((q = qdisc_lookup(dev, TC_H_MAJ(t->tcm_parent))) == NULL)
  146. return -EINVAL;
  147. /* Is it classful? */
  148. if ((cops = q->ops->cl_ops) == NULL)
  149. return -EINVAL;
  150. /* Do we search for filter, attached to class? */
  151. if (TC_H_MIN(parent)) {
  152. cl = cops->get(q, parent);
  153. if (cl == 0)
  154. return -ENOENT;
  155. }
  156. /* And the last stroke */
  157. chain = cops->tcf_chain(q, cl);
  158. err = -EINVAL;
  159. if (chain == NULL)
  160. goto errout;
  161. /* Check the chain for existence of proto-tcf with this priority */
  162. for (back = chain; (tp=*back) != NULL; back = &tp->next) {
  163. if (tp->prio >= prio) {
  164. if (tp->prio == prio) {
  165. if (!nprio || (tp->protocol != protocol && protocol))
  166. goto errout;
  167. } else
  168. tp = NULL;
  169. break;
  170. }
  171. }
  172. if (tp == NULL) {
  173. /* Proto-tcf does not exist, create new one */
  174. if (tca[TCA_KIND-1] == NULL || !protocol)
  175. goto errout;
  176. err = -ENOENT;
  177. if (n->nlmsg_type != RTM_NEWTFILTER || !(n->nlmsg_flags&NLM_F_CREATE))
  178. goto errout;
  179. /* Create new proto tcf */
  180. err = -ENOBUFS;
  181. if ((tp = kzalloc(sizeof(*tp), GFP_KERNEL)) == NULL)
  182. goto errout;
  183. err = -EINVAL;
  184. tp_ops = tcf_proto_lookup_ops(tca[TCA_KIND-1]);
  185. if (tp_ops == NULL) {
  186. #ifdef CONFIG_KMOD
  187. struct rtattr *kind = tca[TCA_KIND-1];
  188. char name[IFNAMSIZ];
  189. if (kind != NULL &&
  190. rtattr_strlcpy(name, kind, IFNAMSIZ) < IFNAMSIZ) {
  191. rtnl_unlock();
  192. request_module("cls_%s", name);
  193. rtnl_lock();
  194. tp_ops = tcf_proto_lookup_ops(kind);
  195. /* We dropped the RTNL semaphore in order to
  196. * perform the module load. So, even if we
  197. * succeeded in loading the module we have to
  198. * replay the request. We indicate this using
  199. * -EAGAIN.
  200. */
  201. if (tp_ops != NULL) {
  202. module_put(tp_ops->owner);
  203. err = -EAGAIN;
  204. }
  205. }
  206. #endif
  207. kfree(tp);
  208. goto errout;
  209. }
  210. tp->ops = tp_ops;
  211. tp->protocol = protocol;
  212. tp->prio = nprio ? : tcf_auto_prio(*back);
  213. tp->q = q;
  214. tp->classify = tp_ops->classify;
  215. tp->classid = parent;
  216. if ((err = tp_ops->init(tp)) != 0) {
  217. module_put(tp_ops->owner);
  218. kfree(tp);
  219. goto errout;
  220. }
  221. qdisc_lock_tree(dev);
  222. tp->next = *back;
  223. *back = tp;
  224. qdisc_unlock_tree(dev);
  225. } else if (tca[TCA_KIND-1] && rtattr_strcmp(tca[TCA_KIND-1], tp->ops->kind))
  226. goto errout;
  227. fh = tp->ops->get(tp, t->tcm_handle);
  228. if (fh == 0) {
  229. if (n->nlmsg_type == RTM_DELTFILTER && t->tcm_handle == 0) {
  230. qdisc_lock_tree(dev);
  231. *back = tp->next;
  232. qdisc_unlock_tree(dev);
  233. tfilter_notify(skb, n, tp, fh, RTM_DELTFILTER);
  234. tcf_destroy(tp);
  235. err = 0;
  236. goto errout;
  237. }
  238. err = -ENOENT;
  239. if (n->nlmsg_type != RTM_NEWTFILTER || !(n->nlmsg_flags&NLM_F_CREATE))
  240. goto errout;
  241. } else {
  242. switch (n->nlmsg_type) {
  243. case RTM_NEWTFILTER:
  244. err = -EEXIST;
  245. if (n->nlmsg_flags&NLM_F_EXCL)
  246. goto errout;
  247. break;
  248. case RTM_DELTFILTER:
  249. err = tp->ops->delete(tp, fh);
  250. if (err == 0)
  251. tfilter_notify(skb, n, tp, fh, RTM_DELTFILTER);
  252. goto errout;
  253. case RTM_GETTFILTER:
  254. err = tfilter_notify(skb, n, tp, fh, RTM_NEWTFILTER);
  255. goto errout;
  256. default:
  257. err = -EINVAL;
  258. goto errout;
  259. }
  260. }
  261. err = tp->ops->change(tp, cl, t->tcm_handle, tca, &fh);
  262. if (err == 0)
  263. tfilter_notify(skb, n, tp, fh, RTM_NEWTFILTER);
  264. errout:
  265. if (cl)
  266. cops->put(q, cl);
  267. if (err == -EAGAIN)
  268. /* Replay the request. */
  269. goto replay;
  270. return err;
  271. }
  272. static int
  273. tcf_fill_node(struct sk_buff *skb, struct tcf_proto *tp, unsigned long fh,
  274. u32 pid, u32 seq, u16 flags, int event)
  275. {
  276. struct tcmsg *tcm;
  277. struct nlmsghdr *nlh;
  278. unsigned char *b = skb->tail;
  279. nlh = NLMSG_NEW(skb, pid, seq, event, sizeof(*tcm), flags);
  280. tcm = NLMSG_DATA(nlh);
  281. tcm->tcm_family = AF_UNSPEC;
  282. tcm->tcm__pad1 = 0;
  283. tcm->tcm__pad1 = 0;
  284. tcm->tcm_ifindex = tp->q->dev->ifindex;
  285. tcm->tcm_parent = tp->classid;
  286. tcm->tcm_info = TC_H_MAKE(tp->prio, tp->protocol);
  287. RTA_PUT(skb, TCA_KIND, IFNAMSIZ, tp->ops->kind);
  288. tcm->tcm_handle = fh;
  289. if (RTM_DELTFILTER != event) {
  290. tcm->tcm_handle = 0;
  291. if (tp->ops->dump && tp->ops->dump(tp, fh, skb, tcm) < 0)
  292. goto rtattr_failure;
  293. }
  294. nlh->nlmsg_len = skb->tail - b;
  295. return skb->len;
  296. nlmsg_failure:
  297. rtattr_failure:
  298. skb_trim(skb, b - skb->data);
  299. return -1;
  300. }
  301. static int tfilter_notify(struct sk_buff *oskb, struct nlmsghdr *n,
  302. struct tcf_proto *tp, unsigned long fh, int event)
  303. {
  304. struct sk_buff *skb;
  305. u32 pid = oskb ? NETLINK_CB(oskb).pid : 0;
  306. skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
  307. if (!skb)
  308. return -ENOBUFS;
  309. if (tcf_fill_node(skb, tp, fh, pid, n->nlmsg_seq, 0, event) <= 0) {
  310. kfree_skb(skb);
  311. return -EINVAL;
  312. }
  313. return rtnetlink_send(skb, pid, RTNLGRP_TC, n->nlmsg_flags&NLM_F_ECHO);
  314. }
  315. struct tcf_dump_args
  316. {
  317. struct tcf_walker w;
  318. struct sk_buff *skb;
  319. struct netlink_callback *cb;
  320. };
  321. static int tcf_node_dump(struct tcf_proto *tp, unsigned long n, struct tcf_walker *arg)
  322. {
  323. struct tcf_dump_args *a = (void*)arg;
  324. return tcf_fill_node(a->skb, tp, n, NETLINK_CB(a->cb->skb).pid,
  325. a->cb->nlh->nlmsg_seq, NLM_F_MULTI, RTM_NEWTFILTER);
  326. }
  327. static int tc_dump_tfilter(struct sk_buff *skb, struct netlink_callback *cb)
  328. {
  329. int t;
  330. int s_t;
  331. struct net_device *dev;
  332. struct Qdisc *q;
  333. struct tcf_proto *tp, **chain;
  334. struct tcmsg *tcm = (struct tcmsg*)NLMSG_DATA(cb->nlh);
  335. unsigned long cl = 0;
  336. struct Qdisc_class_ops *cops;
  337. struct tcf_dump_args arg;
  338. if (cb->nlh->nlmsg_len < NLMSG_LENGTH(sizeof(*tcm)))
  339. return skb->len;
  340. if ((dev = dev_get_by_index(tcm->tcm_ifindex)) == NULL)
  341. return skb->len;
  342. read_lock(&qdisc_tree_lock);
  343. if (!tcm->tcm_parent)
  344. q = dev->qdisc_sleeping;
  345. else
  346. q = qdisc_lookup(dev, TC_H_MAJ(tcm->tcm_parent));
  347. if (!q)
  348. goto out;
  349. if ((cops = q->ops->cl_ops) == NULL)
  350. goto errout;
  351. if (TC_H_MIN(tcm->tcm_parent)) {
  352. cl = cops->get(q, tcm->tcm_parent);
  353. if (cl == 0)
  354. goto errout;
  355. }
  356. chain = cops->tcf_chain(q, cl);
  357. if (chain == NULL)
  358. goto errout;
  359. s_t = cb->args[0];
  360. for (tp=*chain, t=0; tp; tp = tp->next, t++) {
  361. if (t < s_t) continue;
  362. if (TC_H_MAJ(tcm->tcm_info) &&
  363. TC_H_MAJ(tcm->tcm_info) != tp->prio)
  364. continue;
  365. if (TC_H_MIN(tcm->tcm_info) &&
  366. TC_H_MIN(tcm->tcm_info) != tp->protocol)
  367. continue;
  368. if (t > s_t)
  369. memset(&cb->args[1], 0, sizeof(cb->args)-sizeof(cb->args[0]));
  370. if (cb->args[1] == 0) {
  371. if (tcf_fill_node(skb, tp, 0, NETLINK_CB(cb->skb).pid,
  372. cb->nlh->nlmsg_seq, NLM_F_MULTI, RTM_NEWTFILTER) <= 0) {
  373. break;
  374. }
  375. cb->args[1] = 1;
  376. }
  377. if (tp->ops->walk == NULL)
  378. continue;
  379. arg.w.fn = tcf_node_dump;
  380. arg.skb = skb;
  381. arg.cb = cb;
  382. arg.w.stop = 0;
  383. arg.w.skip = cb->args[1]-1;
  384. arg.w.count = 0;
  385. tp->ops->walk(tp, &arg.w);
  386. cb->args[1] = arg.w.count+1;
  387. if (arg.w.stop)
  388. break;
  389. }
  390. cb->args[0] = t;
  391. errout:
  392. if (cl)
  393. cops->put(q, cl);
  394. out:
  395. read_unlock(&qdisc_tree_lock);
  396. dev_put(dev);
  397. return skb->len;
  398. }
  399. void
  400. tcf_exts_destroy(struct tcf_proto *tp, struct tcf_exts *exts)
  401. {
  402. #ifdef CONFIG_NET_CLS_ACT
  403. if (exts->action) {
  404. tcf_action_destroy(exts->action, TCA_ACT_UNBIND);
  405. exts->action = NULL;
  406. }
  407. #elif defined CONFIG_NET_CLS_POLICE
  408. if (exts->police) {
  409. tcf_police_release(exts->police, TCA_ACT_UNBIND);
  410. exts->police = NULL;
  411. }
  412. #endif
  413. }
  414. int
  415. tcf_exts_validate(struct tcf_proto *tp, struct rtattr **tb,
  416. struct rtattr *rate_tlv, struct tcf_exts *exts,
  417. struct tcf_ext_map *map)
  418. {
  419. memset(exts, 0, sizeof(*exts));
  420. #ifdef CONFIG_NET_CLS_ACT
  421. {
  422. int err;
  423. struct tc_action *act;
  424. if (map->police && tb[map->police-1]) {
  425. act = tcf_action_init_1(tb[map->police-1], rate_tlv, "police",
  426. TCA_ACT_NOREPLACE, TCA_ACT_BIND, &err);
  427. if (act == NULL)
  428. return err;
  429. act->type = TCA_OLD_COMPAT;
  430. exts->action = act;
  431. } else if (map->action && tb[map->action-1]) {
  432. act = tcf_action_init(tb[map->action-1], rate_tlv, NULL,
  433. TCA_ACT_NOREPLACE, TCA_ACT_BIND, &err);
  434. if (act == NULL)
  435. return err;
  436. exts->action = act;
  437. }
  438. }
  439. #elif defined CONFIG_NET_CLS_POLICE
  440. if (map->police && tb[map->police-1]) {
  441. struct tcf_police *p;
  442. p = tcf_police_locate(tb[map->police-1], rate_tlv);
  443. if (p == NULL)
  444. return -EINVAL;
  445. exts->police = p;
  446. } else if (map->action && tb[map->action-1])
  447. return -EOPNOTSUPP;
  448. #else
  449. if ((map->action && tb[map->action-1]) ||
  450. (map->police && tb[map->police-1]))
  451. return -EOPNOTSUPP;
  452. #endif
  453. return 0;
  454. }
  455. void
  456. tcf_exts_change(struct tcf_proto *tp, struct tcf_exts *dst,
  457. struct tcf_exts *src)
  458. {
  459. #ifdef CONFIG_NET_CLS_ACT
  460. if (src->action) {
  461. struct tc_action *act;
  462. tcf_tree_lock(tp);
  463. act = xchg(&dst->action, src->action);
  464. tcf_tree_unlock(tp);
  465. if (act)
  466. tcf_action_destroy(act, TCA_ACT_UNBIND);
  467. }
  468. #elif defined CONFIG_NET_CLS_POLICE
  469. if (src->police) {
  470. struct tcf_police *p;
  471. tcf_tree_lock(tp);
  472. p = xchg(&dst->police, src->police);
  473. tcf_tree_unlock(tp);
  474. if (p)
  475. tcf_police_release(p, TCA_ACT_UNBIND);
  476. }
  477. #endif
  478. }
  479. int
  480. tcf_exts_dump(struct sk_buff *skb, struct tcf_exts *exts,
  481. struct tcf_ext_map *map)
  482. {
  483. #ifdef CONFIG_NET_CLS_ACT
  484. if (map->action && exts->action) {
  485. /*
  486. * again for backward compatible mode - we want
  487. * to work with both old and new modes of entering
  488. * tc data even if iproute2 was newer - jhs
  489. */
  490. struct rtattr * p_rta = (struct rtattr*) skb->tail;
  491. if (exts->action->type != TCA_OLD_COMPAT) {
  492. RTA_PUT(skb, map->action, 0, NULL);
  493. if (tcf_action_dump(skb, exts->action, 0, 0) < 0)
  494. goto rtattr_failure;
  495. p_rta->rta_len = skb->tail - (u8*)p_rta;
  496. } else if (map->police) {
  497. RTA_PUT(skb, map->police, 0, NULL);
  498. if (tcf_action_dump_old(skb, exts->action, 0, 0) < 0)
  499. goto rtattr_failure;
  500. p_rta->rta_len = skb->tail - (u8*)p_rta;
  501. }
  502. }
  503. #elif defined CONFIG_NET_CLS_POLICE
  504. if (map->police && exts->police) {
  505. struct rtattr * p_rta = (struct rtattr*) skb->tail;
  506. RTA_PUT(skb, map->police, 0, NULL);
  507. if (tcf_police_dump(skb, exts->police) < 0)
  508. goto rtattr_failure;
  509. p_rta->rta_len = skb->tail - (u8*)p_rta;
  510. }
  511. #endif
  512. return 0;
  513. rtattr_failure: __attribute__ ((unused))
  514. return -1;
  515. }
  516. int
  517. tcf_exts_dump_stats(struct sk_buff *skb, struct tcf_exts *exts,
  518. struct tcf_ext_map *map)
  519. {
  520. #ifdef CONFIG_NET_CLS_ACT
  521. if (exts->action)
  522. if (tcf_action_copy_stats(skb, exts->action, 1) < 0)
  523. goto rtattr_failure;
  524. #elif defined CONFIG_NET_CLS_POLICE
  525. if (exts->police)
  526. if (tcf_police_dump_stats(skb, exts->police) < 0)
  527. goto rtattr_failure;
  528. #endif
  529. return 0;
  530. rtattr_failure: __attribute__ ((unused))
  531. return -1;
  532. }
  533. static int __init tc_filter_init(void)
  534. {
  535. struct rtnetlink_link *link_p = rtnetlink_links[PF_UNSPEC];
  536. /* Setup rtnetlink links. It is made here to avoid
  537. exporting large number of public symbols.
  538. */
  539. if (link_p) {
  540. link_p[RTM_NEWTFILTER-RTM_BASE].doit = tc_ctl_tfilter;
  541. link_p[RTM_DELTFILTER-RTM_BASE].doit = tc_ctl_tfilter;
  542. link_p[RTM_GETTFILTER-RTM_BASE].doit = tc_ctl_tfilter;
  543. link_p[RTM_GETTFILTER-RTM_BASE].dumpit = tc_dump_tfilter;
  544. }
  545. return 0;
  546. }
  547. subsys_initcall(tc_filter_init);
  548. EXPORT_SYMBOL(register_tcf_proto_ops);
  549. EXPORT_SYMBOL(unregister_tcf_proto_ops);
  550. EXPORT_SYMBOL(tcf_exts_validate);
  551. EXPORT_SYMBOL(tcf_exts_destroy);
  552. EXPORT_SYMBOL(tcf_exts_change);
  553. EXPORT_SYMBOL(tcf_exts_dump);
  554. EXPORT_SYMBOL(tcf_exts_dump_stats);