cls_api.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604
  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. spinlock_t *root_lock;
  102. struct tcmsg *t;
  103. u32 protocol;
  104. u32 prio;
  105. u32 nprio;
  106. u32 parent;
  107. struct net_device *dev;
  108. struct Qdisc *q;
  109. struct tcf_proto **back, **chain;
  110. struct tcf_proto *tp;
  111. struct tcf_proto_ops *tp_ops;
  112. const struct Qdisc_class_ops *cops;
  113. unsigned long cl;
  114. unsigned long fh;
  115. int err;
  116. if (net != &init_net)
  117. return -EINVAL;
  118. replay:
  119. t = NLMSG_DATA(n);
  120. protocol = TC_H_MIN(t->tcm_info);
  121. prio = TC_H_MAJ(t->tcm_info);
  122. nprio = prio;
  123. parent = t->tcm_parent;
  124. cl = 0;
  125. if (prio == 0) {
  126. /* If no priority is given, user wants we allocated it. */
  127. if (n->nlmsg_type != RTM_NEWTFILTER || !(n->nlmsg_flags&NLM_F_CREATE))
  128. return -ENOENT;
  129. prio = TC_H_MAKE(0x80000000U, 0U);
  130. }
  131. /* Find head of filter chain. */
  132. /* Find link */
  133. dev = __dev_get_by_index(&init_net, t->tcm_ifindex);
  134. if (dev == NULL)
  135. return -ENODEV;
  136. err = nlmsg_parse(n, sizeof(*t), tca, TCA_MAX, NULL);
  137. if (err < 0)
  138. return err;
  139. /* Find qdisc */
  140. if (!parent) {
  141. struct netdev_queue *dev_queue = netdev_get_tx_queue(dev, 0);
  142. q = dev_queue->qdisc_sleeping;
  143. parent = q->handle;
  144. } else {
  145. q = qdisc_lookup(dev, TC_H_MAJ(t->tcm_parent));
  146. if (q == NULL)
  147. return -EINVAL;
  148. }
  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. root_lock = qdisc_root_sleeping_lock(q);
  175. if (tp == NULL) {
  176. /* Proto-tcf does not exist, create new one */
  177. if (tca[TCA_KIND] == NULL || !protocol)
  178. goto errout;
  179. err = -ENOENT;
  180. if (n->nlmsg_type != RTM_NEWTFILTER || !(n->nlmsg_flags&NLM_F_CREATE))
  181. goto errout;
  182. /* Create new proto tcf */
  183. err = -ENOBUFS;
  184. tp = kzalloc(sizeof(*tp), GFP_KERNEL);
  185. if (tp == NULL)
  186. goto errout;
  187. err = -ENOENT;
  188. tp_ops = tcf_proto_lookup_ops(tca[TCA_KIND]);
  189. if (tp_ops == NULL) {
  190. #ifdef CONFIG_MODULES
  191. struct nlattr *kind = tca[TCA_KIND];
  192. char name[IFNAMSIZ];
  193. if (kind != NULL &&
  194. nla_strlcpy(name, kind, IFNAMSIZ) < IFNAMSIZ) {
  195. rtnl_unlock();
  196. request_module("cls_%s", name);
  197. rtnl_lock();
  198. tp_ops = tcf_proto_lookup_ops(kind);
  199. /* We dropped the RTNL semaphore in order to
  200. * perform the module load. So, even if we
  201. * succeeded in loading the module we have to
  202. * replay the request. We indicate this using
  203. * -EAGAIN.
  204. */
  205. if (tp_ops != NULL) {
  206. module_put(tp_ops->owner);
  207. err = -EAGAIN;
  208. }
  209. }
  210. #endif
  211. kfree(tp);
  212. goto errout;
  213. }
  214. tp->ops = tp_ops;
  215. tp->protocol = protocol;
  216. tp->prio = nprio ? : TC_H_MAJ(tcf_auto_prio(*back));
  217. tp->q = q;
  218. tp->classify = tp_ops->classify;
  219. tp->classid = parent;
  220. err = tp_ops->init(tp);
  221. if (err != 0) {
  222. module_put(tp_ops->owner);
  223. kfree(tp);
  224. goto errout;
  225. }
  226. spin_lock_bh(root_lock);
  227. tp->next = *back;
  228. *back = tp;
  229. spin_unlock_bh(root_lock);
  230. } else if (tca[TCA_KIND] && nla_strcmp(tca[TCA_KIND], tp->ops->kind))
  231. goto errout;
  232. fh = tp->ops->get(tp, t->tcm_handle);
  233. if (fh == 0) {
  234. if (n->nlmsg_type == RTM_DELTFILTER && t->tcm_handle == 0) {
  235. spin_lock_bh(root_lock);
  236. *back = tp->next;
  237. spin_unlock_bh(root_lock);
  238. tfilter_notify(skb, n, tp, fh, RTM_DELTFILTER);
  239. tcf_destroy(tp);
  240. err = 0;
  241. goto errout;
  242. }
  243. err = -ENOENT;
  244. if (n->nlmsg_type != RTM_NEWTFILTER ||
  245. !(n->nlmsg_flags & NLM_F_CREATE))
  246. goto errout;
  247. } else {
  248. switch (n->nlmsg_type) {
  249. case RTM_NEWTFILTER:
  250. err = -EEXIST;
  251. if (n->nlmsg_flags & NLM_F_EXCL)
  252. goto errout;
  253. break;
  254. case RTM_DELTFILTER:
  255. err = tp->ops->delete(tp, fh);
  256. if (err == 0)
  257. tfilter_notify(skb, n, tp, fh, RTM_DELTFILTER);
  258. goto errout;
  259. case RTM_GETTFILTER:
  260. err = tfilter_notify(skb, n, tp, fh, RTM_NEWTFILTER);
  261. goto errout;
  262. default:
  263. err = -EINVAL;
  264. goto errout;
  265. }
  266. }
  267. err = tp->ops->change(tp, cl, t->tcm_handle, tca, &fh);
  268. if (err == 0)
  269. tfilter_notify(skb, n, tp, fh, RTM_NEWTFILTER);
  270. errout:
  271. if (cl)
  272. cops->put(q, cl);
  273. if (err == -EAGAIN)
  274. /* Replay the request. */
  275. goto replay;
  276. return err;
  277. }
  278. static int tcf_fill_node(struct sk_buff *skb, struct tcf_proto *tp,
  279. unsigned long fh, u32 pid, u32 seq, u16 flags, int event)
  280. {
  281. struct tcmsg *tcm;
  282. struct nlmsghdr *nlh;
  283. unsigned char *b = skb_tail_pointer(skb);
  284. nlh = NLMSG_NEW(skb, pid, seq, event, sizeof(*tcm), flags);
  285. tcm = NLMSG_DATA(nlh);
  286. tcm->tcm_family = AF_UNSPEC;
  287. tcm->tcm__pad1 = 0;
  288. tcm->tcm__pad1 = 0;
  289. tcm->tcm_ifindex = qdisc_dev(tp->q)->ifindex;
  290. tcm->tcm_parent = tp->classid;
  291. tcm->tcm_info = TC_H_MAKE(tp->prio, tp->protocol);
  292. NLA_PUT_STRING(skb, TCA_KIND, tp->ops->kind);
  293. tcm->tcm_handle = fh;
  294. if (RTM_DELTFILTER != event) {
  295. tcm->tcm_handle = 0;
  296. if (tp->ops->dump && tp->ops->dump(tp, fh, skb, tcm) < 0)
  297. goto nla_put_failure;
  298. }
  299. nlh->nlmsg_len = skb_tail_pointer(skb) - b;
  300. return skb->len;
  301. nlmsg_failure:
  302. nla_put_failure:
  303. nlmsg_trim(skb, b);
  304. return -1;
  305. }
  306. static int tfilter_notify(struct sk_buff *oskb, struct nlmsghdr *n,
  307. struct tcf_proto *tp, unsigned long fh, int event)
  308. {
  309. struct sk_buff *skb;
  310. u32 pid = oskb ? NETLINK_CB(oskb).pid : 0;
  311. skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
  312. if (!skb)
  313. return -ENOBUFS;
  314. if (tcf_fill_node(skb, tp, fh, pid, n->nlmsg_seq, 0, event) <= 0) {
  315. kfree_skb(skb);
  316. return -EINVAL;
  317. }
  318. return rtnetlink_send(skb, &init_net, pid, RTNLGRP_TC,
  319. n->nlmsg_flags & NLM_F_ECHO);
  320. }
  321. struct tcf_dump_args {
  322. struct tcf_walker w;
  323. struct sk_buff *skb;
  324. struct netlink_callback *cb;
  325. };
  326. static int tcf_node_dump(struct tcf_proto *tp, unsigned long n,
  327. struct tcf_walker *arg)
  328. {
  329. struct tcf_dump_args *a = (void *)arg;
  330. return tcf_fill_node(a->skb, tp, n, NETLINK_CB(a->cb->skb).pid,
  331. a->cb->nlh->nlmsg_seq, NLM_F_MULTI, RTM_NEWTFILTER);
  332. }
  333. static int tc_dump_tfilter(struct sk_buff *skb, struct netlink_callback *cb)
  334. {
  335. struct net *net = sock_net(skb->sk);
  336. struct netdev_queue *dev_queue;
  337. int t;
  338. int s_t;
  339. struct net_device *dev;
  340. struct Qdisc *q;
  341. struct tcf_proto *tp, **chain;
  342. struct tcmsg *tcm = (struct tcmsg *)NLMSG_DATA(cb->nlh);
  343. unsigned long cl = 0;
  344. const struct Qdisc_class_ops *cops;
  345. struct tcf_dump_args arg;
  346. if (net != &init_net)
  347. return 0;
  348. if (cb->nlh->nlmsg_len < NLMSG_LENGTH(sizeof(*tcm)))
  349. return skb->len;
  350. if ((dev = dev_get_by_index(&init_net, tcm->tcm_ifindex)) == NULL)
  351. return skb->len;
  352. dev_queue = netdev_get_tx_queue(dev, 0);
  353. if (!tcm->tcm_parent)
  354. q = dev_queue->qdisc_sleeping;
  355. else
  356. q = qdisc_lookup(dev, TC_H_MAJ(tcm->tcm_parent));
  357. if (!q)
  358. goto out;
  359. if ((cops = q->ops->cl_ops) == NULL)
  360. goto errout;
  361. if (TC_H_MIN(tcm->tcm_parent)) {
  362. cl = cops->get(q, tcm->tcm_parent);
  363. if (cl == 0)
  364. goto errout;
  365. }
  366. chain = cops->tcf_chain(q, cl);
  367. if (chain == NULL)
  368. goto errout;
  369. s_t = cb->args[0];
  370. for (tp=*chain, t=0; tp; tp = tp->next, t++) {
  371. if (t < s_t) continue;
  372. if (TC_H_MAJ(tcm->tcm_info) &&
  373. TC_H_MAJ(tcm->tcm_info) != tp->prio)
  374. continue;
  375. if (TC_H_MIN(tcm->tcm_info) &&
  376. TC_H_MIN(tcm->tcm_info) != tp->protocol)
  377. continue;
  378. if (t > s_t)
  379. memset(&cb->args[1], 0, sizeof(cb->args)-sizeof(cb->args[0]));
  380. if (cb->args[1] == 0) {
  381. if (tcf_fill_node(skb, tp, 0, NETLINK_CB(cb->skb).pid,
  382. cb->nlh->nlmsg_seq, NLM_F_MULTI,
  383. RTM_NEWTFILTER) <= 0)
  384. break;
  385. cb->args[1] = 1;
  386. }
  387. if (tp->ops->walk == NULL)
  388. continue;
  389. arg.w.fn = tcf_node_dump;
  390. arg.skb = skb;
  391. arg.cb = cb;
  392. arg.w.stop = 0;
  393. arg.w.skip = cb->args[1]-1;
  394. arg.w.count = 0;
  395. tp->ops->walk(tp, &arg.w);
  396. cb->args[1] = arg.w.count+1;
  397. if (arg.w.stop)
  398. break;
  399. }
  400. cb->args[0] = t;
  401. errout:
  402. if (cl)
  403. cops->put(q, cl);
  404. out:
  405. dev_put(dev);
  406. return skb->len;
  407. }
  408. void tcf_exts_destroy(struct tcf_proto *tp, struct tcf_exts *exts)
  409. {
  410. #ifdef CONFIG_NET_CLS_ACT
  411. if (exts->action) {
  412. tcf_action_destroy(exts->action, TCA_ACT_UNBIND);
  413. exts->action = NULL;
  414. }
  415. #endif
  416. }
  417. EXPORT_SYMBOL(tcf_exts_destroy);
  418. int tcf_exts_validate(struct tcf_proto *tp, struct nlattr **tb,
  419. struct nlattr *rate_tlv, struct tcf_exts *exts,
  420. const struct tcf_ext_map *map)
  421. {
  422. memset(exts, 0, sizeof(*exts));
  423. #ifdef CONFIG_NET_CLS_ACT
  424. {
  425. struct tc_action *act;
  426. if (map->police && tb[map->police]) {
  427. act = tcf_action_init_1(tb[map->police], rate_tlv,
  428. "police", TCA_ACT_NOREPLACE,
  429. TCA_ACT_BIND);
  430. if (IS_ERR(act))
  431. return PTR_ERR(act);
  432. act->type = TCA_OLD_COMPAT;
  433. exts->action = act;
  434. } else if (map->action && tb[map->action]) {
  435. act = tcf_action_init(tb[map->action], rate_tlv, NULL,
  436. TCA_ACT_NOREPLACE, TCA_ACT_BIND);
  437. if (IS_ERR(act))
  438. return PTR_ERR(act);
  439. exts->action = act;
  440. }
  441. }
  442. #else
  443. if ((map->action && tb[map->action]) ||
  444. (map->police && tb[map->police]))
  445. return -EOPNOTSUPP;
  446. #endif
  447. return 0;
  448. }
  449. EXPORT_SYMBOL(tcf_exts_validate);
  450. void tcf_exts_change(struct tcf_proto *tp, struct tcf_exts *dst,
  451. struct tcf_exts *src)
  452. {
  453. #ifdef CONFIG_NET_CLS_ACT
  454. if (src->action) {
  455. struct tc_action *act;
  456. tcf_tree_lock(tp);
  457. act = dst->action;
  458. dst->action = src->action;
  459. tcf_tree_unlock(tp);
  460. if (act)
  461. tcf_action_destroy(act, TCA_ACT_UNBIND);
  462. }
  463. #endif
  464. }
  465. EXPORT_SYMBOL(tcf_exts_change);
  466. int tcf_exts_dump(struct sk_buff *skb, struct tcf_exts *exts,
  467. const struct tcf_ext_map *map)
  468. {
  469. #ifdef CONFIG_NET_CLS_ACT
  470. if (map->action && exts->action) {
  471. /*
  472. * again for backward compatible mode - we want
  473. * to work with both old and new modes of entering
  474. * tc data even if iproute2 was newer - jhs
  475. */
  476. struct nlattr *nest;
  477. if (exts->action->type != TCA_OLD_COMPAT) {
  478. nest = nla_nest_start(skb, map->action);
  479. if (nest == NULL)
  480. goto nla_put_failure;
  481. if (tcf_action_dump(skb, exts->action, 0, 0) < 0)
  482. goto nla_put_failure;
  483. nla_nest_end(skb, nest);
  484. } else if (map->police) {
  485. nest = nla_nest_start(skb, map->police);
  486. if (nest == NULL)
  487. goto nla_put_failure;
  488. if (tcf_action_dump_old(skb, exts->action, 0, 0) < 0)
  489. goto nla_put_failure;
  490. nla_nest_end(skb, nest);
  491. }
  492. }
  493. #endif
  494. return 0;
  495. nla_put_failure: __attribute__ ((unused))
  496. return -1;
  497. }
  498. EXPORT_SYMBOL(tcf_exts_dump);
  499. int tcf_exts_dump_stats(struct sk_buff *skb, struct tcf_exts *exts,
  500. const struct tcf_ext_map *map)
  501. {
  502. #ifdef CONFIG_NET_CLS_ACT
  503. if (exts->action)
  504. if (tcf_action_copy_stats(skb, exts->action, 1) < 0)
  505. goto nla_put_failure;
  506. #endif
  507. return 0;
  508. nla_put_failure: __attribute__ ((unused))
  509. return -1;
  510. }
  511. EXPORT_SYMBOL(tcf_exts_dump_stats);
  512. static int __init tc_filter_init(void)
  513. {
  514. rtnl_register(PF_UNSPEC, RTM_NEWTFILTER, tc_ctl_tfilter, NULL);
  515. rtnl_register(PF_UNSPEC, RTM_DELTFILTER, tc_ctl_tfilter, NULL);
  516. rtnl_register(PF_UNSPEC, RTM_GETTFILTER, tc_ctl_tfilter,
  517. tc_dump_tfilter);
  518. return 0;
  519. }
  520. subsys_initcall(tc_filter_init);