cls_api.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600
  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 <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 struct tcf_proto_ops *tcf_proto_base __read_mostly;
  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 struct tcf_proto_ops *tcf_proto_lookup_ops(struct nlattr *kind)
  37. {
  38. struct tcf_proto_ops *t = NULL;
  39. if (kind) {
  40. read_lock(&cls_mod_lock);
  41. for (t = tcf_proto_base; t; t = t->next) {
  42. if (nla_strcmp(kind, t->kind) == 0) {
  43. if (!try_module_get(t->owner))
  44. t = NULL;
  45. break;
  46. }
  47. }
  48. read_unlock(&cls_mod_lock);
  49. }
  50. return t;
  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, **tp;
  56. int rc = -EEXIST;
  57. write_lock(&cls_mod_lock);
  58. for (tp = &tcf_proto_base; (t = *tp) != NULL; tp = &t->next)
  59. if (!strcmp(ops->kind, t->kind))
  60. goto out;
  61. ops->next = NULL;
  62. *tp = ops;
  63. rc = 0;
  64. out:
  65. write_unlock(&cls_mod_lock);
  66. return rc;
  67. }
  68. EXPORT_SYMBOL(register_tcf_proto_ops);
  69. int unregister_tcf_proto_ops(struct tcf_proto_ops *ops)
  70. {
  71. struct tcf_proto_ops *t, **tp;
  72. int rc = -ENOENT;
  73. write_lock(&cls_mod_lock);
  74. for (tp = &tcf_proto_base; (t=*tp) != NULL; tp = &t->next)
  75. if (t == ops)
  76. break;
  77. if (!t)
  78. goto out;
  79. *tp = t->next;
  80. rc = 0;
  81. out:
  82. write_unlock(&cls_mod_lock);
  83. return rc;
  84. }
  85. EXPORT_SYMBOL(unregister_tcf_proto_ops);
  86. static int tfilter_notify(struct sk_buff *oskb, struct nlmsghdr *n,
  87. struct tcf_proto *tp, unsigned long fh, int event);
  88. /* Select new prio value from the range, managed by kernel. */
  89. static inline u32 tcf_auto_prio(struct tcf_proto *tp)
  90. {
  91. u32 first = TC_H_MAKE(0xC0000000U, 0U);
  92. if (tp)
  93. first = tp->prio-1;
  94. return first;
  95. }
  96. /* Add/change/delete/get a filter node */
  97. static int tc_ctl_tfilter(struct sk_buff *skb, struct nlmsghdr *n, void *arg)
  98. {
  99. struct net *net = sock_net(skb->sk);
  100. struct nlattr *tca[TCA_MAX + 1];
  101. struct tcmsg *t;
  102. u32 protocol;
  103. u32 prio;
  104. u32 nprio;
  105. u32 parent;
  106. struct net_device *dev;
  107. struct Qdisc *q;
  108. struct tcf_proto **back, **chain;
  109. struct tcf_proto *tp;
  110. struct tcf_proto_ops *tp_ops;
  111. const struct Qdisc_class_ops *cops;
  112. unsigned long cl;
  113. unsigned long fh;
  114. int err;
  115. if (net != &init_net)
  116. return -EINVAL;
  117. replay:
  118. t = NLMSG_DATA(n);
  119. protocol = TC_H_MIN(t->tcm_info);
  120. prio = TC_H_MAJ(t->tcm_info);
  121. nprio = prio;
  122. parent = t->tcm_parent;
  123. cl = 0;
  124. if (prio == 0) {
  125. /* If no priority is given, user wants we allocated it. */
  126. if (n->nlmsg_type != RTM_NEWTFILTER || !(n->nlmsg_flags&NLM_F_CREATE))
  127. return -ENOENT;
  128. prio = TC_H_MAKE(0x80000000U, 0U);
  129. }
  130. /* Find head of filter chain. */
  131. /* Find link */
  132. dev = __dev_get_by_index(&init_net, t->tcm_ifindex);
  133. if (dev == NULL)
  134. return -ENODEV;
  135. err = nlmsg_parse(n, sizeof(*t), tca, TCA_MAX, NULL);
  136. if (err < 0)
  137. return err;
  138. /* Find qdisc */
  139. if (!parent) {
  140. struct netdev_queue *dev_queue = &dev->tx_queue;
  141. q = dev_queue->qdisc_sleeping;
  142. parent = q->handle;
  143. } else {
  144. q = qdisc_lookup(dev, TC_H_MAJ(t->tcm_parent));
  145. if (q == NULL)
  146. return -EINVAL;
  147. }
  148. /* Is it classful? */
  149. if ((cops = q->ops->cl_ops) == NULL)
  150. return -EINVAL;
  151. /* Do we search for filter, attached to class? */
  152. if (TC_H_MIN(parent)) {
  153. cl = cops->get(q, parent);
  154. if (cl == 0)
  155. return -ENOENT;
  156. }
  157. /* And the last stroke */
  158. chain = cops->tcf_chain(q, cl);
  159. err = -EINVAL;
  160. if (chain == NULL)
  161. goto errout;
  162. /* Check the chain for existence of proto-tcf with this priority */
  163. for (back = chain; (tp=*back) != NULL; back = &tp->next) {
  164. if (tp->prio >= prio) {
  165. if (tp->prio == prio) {
  166. if (!nprio || (tp->protocol != protocol && protocol))
  167. goto errout;
  168. } else
  169. tp = NULL;
  170. break;
  171. }
  172. }
  173. if (tp == NULL) {
  174. /* Proto-tcf does not exist, create new one */
  175. if (tca[TCA_KIND] == NULL || !protocol)
  176. goto errout;
  177. err = -ENOENT;
  178. if (n->nlmsg_type != RTM_NEWTFILTER || !(n->nlmsg_flags&NLM_F_CREATE))
  179. goto errout;
  180. /* Create new proto tcf */
  181. err = -ENOBUFS;
  182. tp = kzalloc(sizeof(*tp), GFP_KERNEL);
  183. if (tp == NULL)
  184. goto errout;
  185. err = -ENOENT;
  186. tp_ops = tcf_proto_lookup_ops(tca[TCA_KIND]);
  187. if (tp_ops == NULL) {
  188. #ifdef CONFIG_KMOD
  189. struct nlattr *kind = tca[TCA_KIND];
  190. char name[IFNAMSIZ];
  191. if (kind != NULL &&
  192. nla_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. tp->ops = tp_ops;
  213. tp->protocol = protocol;
  214. tp->prio = nprio ? : tcf_auto_prio(*back);
  215. tp->q = q;
  216. tp->classify = tp_ops->classify;
  217. tp->classid = parent;
  218. err = tp_ops->init(tp);
  219. if (err != 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] && nla_strcmp(tca[TCA_KIND], 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 ||
  243. !(n->nlmsg_flags & NLM_F_CREATE))
  244. goto errout;
  245. } else {
  246. switch (n->nlmsg_type) {
  247. case RTM_NEWTFILTER:
  248. err = -EEXIST;
  249. if (n->nlmsg_flags & NLM_F_EXCL)
  250. goto errout;
  251. break;
  252. case RTM_DELTFILTER:
  253. err = tp->ops->delete(tp, fh);
  254. if (err == 0)
  255. tfilter_notify(skb, n, tp, fh, RTM_DELTFILTER);
  256. goto errout;
  257. case RTM_GETTFILTER:
  258. err = tfilter_notify(skb, n, tp, fh, RTM_NEWTFILTER);
  259. goto errout;
  260. default:
  261. err = -EINVAL;
  262. goto errout;
  263. }
  264. }
  265. err = tp->ops->change(tp, cl, t->tcm_handle, tca, &fh);
  266. if (err == 0)
  267. tfilter_notify(skb, n, tp, fh, RTM_NEWTFILTER);
  268. errout:
  269. if (cl)
  270. cops->put(q, cl);
  271. if (err == -EAGAIN)
  272. /* Replay the request. */
  273. goto replay;
  274. return err;
  275. }
  276. static int tcf_fill_node(struct sk_buff *skb, struct tcf_proto *tp,
  277. unsigned long fh, u32 pid, u32 seq, u16 flags, int event)
  278. {
  279. struct tcmsg *tcm;
  280. struct nlmsghdr *nlh;
  281. unsigned char *b = skb_tail_pointer(skb);
  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 = qdisc_dev(tp->q)->ifindex;
  288. tcm->tcm_parent = tp->classid;
  289. tcm->tcm_info = TC_H_MAKE(tp->prio, tp->protocol);
  290. NLA_PUT_STRING(skb, TCA_KIND, 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 nla_put_failure;
  296. }
  297. nlh->nlmsg_len = skb_tail_pointer(skb) - b;
  298. return skb->len;
  299. nlmsg_failure:
  300. nla_put_failure:
  301. nlmsg_trim(skb, b);
  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, &init_net, pid, RTNLGRP_TC,
  317. n->nlmsg_flags & NLM_F_ECHO);
  318. }
  319. struct tcf_dump_args {
  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,
  325. struct tcf_walker *arg)
  326. {
  327. struct tcf_dump_args *a = (void *)arg;
  328. return tcf_fill_node(a->skb, tp, n, NETLINK_CB(a->cb->skb).pid,
  329. a->cb->nlh->nlmsg_seq, NLM_F_MULTI, RTM_NEWTFILTER);
  330. }
  331. static int tc_dump_tfilter(struct sk_buff *skb, struct netlink_callback *cb)
  332. {
  333. struct net *net = sock_net(skb->sk);
  334. struct netdev_queue *dev_queue;
  335. int t;
  336. int s_t;
  337. struct net_device *dev;
  338. struct Qdisc *q;
  339. struct tcf_proto *tp, **chain;
  340. struct tcmsg *tcm = (struct tcmsg *)NLMSG_DATA(cb->nlh);
  341. unsigned long cl = 0;
  342. const struct Qdisc_class_ops *cops;
  343. struct tcf_dump_args arg;
  344. if (net != &init_net)
  345. return 0;
  346. if (cb->nlh->nlmsg_len < NLMSG_LENGTH(sizeof(*tcm)))
  347. return skb->len;
  348. if ((dev = dev_get_by_index(&init_net, tcm->tcm_ifindex)) == NULL)
  349. return skb->len;
  350. dev_queue = &dev->tx_queue;
  351. if (!tcm->tcm_parent)
  352. q = dev_queue->qdisc_sleeping;
  353. else
  354. q = qdisc_lookup(dev, TC_H_MAJ(tcm->tcm_parent));
  355. if (!q)
  356. goto out;
  357. if ((cops = q->ops->cl_ops) == NULL)
  358. goto errout;
  359. if (TC_H_MIN(tcm->tcm_parent)) {
  360. cl = cops->get(q, tcm->tcm_parent);
  361. if (cl == 0)
  362. goto errout;
  363. }
  364. chain = cops->tcf_chain(q, cl);
  365. if (chain == NULL)
  366. goto errout;
  367. s_t = cb->args[0];
  368. for (tp=*chain, t=0; tp; tp = tp->next, t++) {
  369. if (t < s_t) continue;
  370. if (TC_H_MAJ(tcm->tcm_info) &&
  371. TC_H_MAJ(tcm->tcm_info) != tp->prio)
  372. continue;
  373. if (TC_H_MIN(tcm->tcm_info) &&
  374. TC_H_MIN(tcm->tcm_info) != tp->protocol)
  375. continue;
  376. if (t > s_t)
  377. memset(&cb->args[1], 0, sizeof(cb->args)-sizeof(cb->args[0]));
  378. if (cb->args[1] == 0) {
  379. if (tcf_fill_node(skb, tp, 0, NETLINK_CB(cb->skb).pid,
  380. cb->nlh->nlmsg_seq, NLM_F_MULTI,
  381. RTM_NEWTFILTER) <= 0)
  382. break;
  383. cb->args[1] = 1;
  384. }
  385. if (tp->ops->walk == NULL)
  386. continue;
  387. arg.w.fn = tcf_node_dump;
  388. arg.skb = skb;
  389. arg.cb = cb;
  390. arg.w.stop = 0;
  391. arg.w.skip = cb->args[1]-1;
  392. arg.w.count = 0;
  393. tp->ops->walk(tp, &arg.w);
  394. cb->args[1] = arg.w.count+1;
  395. if (arg.w.stop)
  396. break;
  397. }
  398. cb->args[0] = t;
  399. errout:
  400. if (cl)
  401. cops->put(q, cl);
  402. out:
  403. dev_put(dev);
  404. return skb->len;
  405. }
  406. void tcf_exts_destroy(struct tcf_proto *tp, struct tcf_exts *exts)
  407. {
  408. #ifdef CONFIG_NET_CLS_ACT
  409. if (exts->action) {
  410. tcf_action_destroy(exts->action, TCA_ACT_UNBIND);
  411. exts->action = NULL;
  412. }
  413. #endif
  414. }
  415. EXPORT_SYMBOL(tcf_exts_destroy);
  416. int tcf_exts_validate(struct tcf_proto *tp, struct nlattr **tb,
  417. struct nlattr *rate_tlv, struct tcf_exts *exts,
  418. const struct tcf_ext_map *map)
  419. {
  420. memset(exts, 0, sizeof(*exts));
  421. #ifdef CONFIG_NET_CLS_ACT
  422. {
  423. struct tc_action *act;
  424. if (map->police && tb[map->police]) {
  425. act = tcf_action_init_1(tb[map->police], rate_tlv,
  426. "police", TCA_ACT_NOREPLACE,
  427. TCA_ACT_BIND);
  428. if (IS_ERR(act))
  429. return PTR_ERR(act);
  430. act->type = TCA_OLD_COMPAT;
  431. exts->action = act;
  432. } else if (map->action && tb[map->action]) {
  433. act = tcf_action_init(tb[map->action], rate_tlv, NULL,
  434. TCA_ACT_NOREPLACE, TCA_ACT_BIND);
  435. if (IS_ERR(act))
  436. return PTR_ERR(act);
  437. exts->action = act;
  438. }
  439. }
  440. #else
  441. if ((map->action && tb[map->action]) ||
  442. (map->police && tb[map->police]))
  443. return -EOPNOTSUPP;
  444. #endif
  445. return 0;
  446. }
  447. EXPORT_SYMBOL(tcf_exts_validate);
  448. void tcf_exts_change(struct tcf_proto *tp, struct tcf_exts *dst,
  449. struct tcf_exts *src)
  450. {
  451. #ifdef CONFIG_NET_CLS_ACT
  452. if (src->action) {
  453. struct tc_action *act;
  454. tcf_tree_lock(tp);
  455. act = xchg(&dst->action, src->action);
  456. tcf_tree_unlock(tp);
  457. if (act)
  458. tcf_action_destroy(act, TCA_ACT_UNBIND);
  459. }
  460. #endif
  461. }
  462. EXPORT_SYMBOL(tcf_exts_change);
  463. int tcf_exts_dump(struct sk_buff *skb, struct tcf_exts *exts,
  464. const struct tcf_ext_map *map)
  465. {
  466. #ifdef CONFIG_NET_CLS_ACT
  467. if (map->action && exts->action) {
  468. /*
  469. * again for backward compatible mode - we want
  470. * to work with both old and new modes of entering
  471. * tc data even if iproute2 was newer - jhs
  472. */
  473. struct nlattr *nest;
  474. if (exts->action->type != TCA_OLD_COMPAT) {
  475. nest = nla_nest_start(skb, map->action);
  476. if (nest == NULL)
  477. goto nla_put_failure;
  478. if (tcf_action_dump(skb, exts->action, 0, 0) < 0)
  479. goto nla_put_failure;
  480. nla_nest_end(skb, nest);
  481. } else if (map->police) {
  482. nest = nla_nest_start(skb, map->police);
  483. if (nest == NULL)
  484. goto nla_put_failure;
  485. if (tcf_action_dump_old(skb, exts->action, 0, 0) < 0)
  486. goto nla_put_failure;
  487. nla_nest_end(skb, nest);
  488. }
  489. }
  490. #endif
  491. return 0;
  492. nla_put_failure: __attribute__ ((unused))
  493. return -1;
  494. }
  495. EXPORT_SYMBOL(tcf_exts_dump);
  496. int tcf_exts_dump_stats(struct sk_buff *skb, struct tcf_exts *exts,
  497. const struct tcf_ext_map *map)
  498. {
  499. #ifdef CONFIG_NET_CLS_ACT
  500. if (exts->action)
  501. if (tcf_action_copy_stats(skb, exts->action, 1) < 0)
  502. goto nla_put_failure;
  503. #endif
  504. return 0;
  505. nla_put_failure: __attribute__ ((unused))
  506. return -1;
  507. }
  508. EXPORT_SYMBOL(tcf_exts_dump_stats);
  509. static int __init tc_filter_init(void)
  510. {
  511. rtnl_register(PF_UNSPEC, RTM_NEWTFILTER, tc_ctl_tfilter, NULL);
  512. rtnl_register(PF_UNSPEC, RTM_DELTFILTER, tc_ctl_tfilter, NULL);
  513. rtnl_register(PF_UNSPEC, RTM_GETTFILTER, tc_ctl_tfilter,
  514. tc_dump_tfilter);
  515. return 0;
  516. }
  517. subsys_initcall(tc_filter_init);