cls_api.c 14 KB

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