cls_api.c 15 KB

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