sch_multiq.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473
  1. /*
  2. * Copyright (c) 2008, Intel Corporation.
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms and conditions of the GNU General Public License,
  6. * version 2, as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope it will be useful, but WITHOUT
  9. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  10. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  11. * more details.
  12. *
  13. * You should have received a copy of the GNU General Public License along with
  14. * this program; if not, write to the Free Software Foundation, Inc., 59 Temple
  15. * Place - Suite 330, Boston, MA 02111-1307 USA.
  16. *
  17. * Author: Alexander Duyck <alexander.h.duyck@intel.com>
  18. */
  19. #include <linux/module.h>
  20. #include <linux/types.h>
  21. #include <linux/kernel.h>
  22. #include <linux/string.h>
  23. #include <linux/errno.h>
  24. #include <linux/skbuff.h>
  25. #include <net/netlink.h>
  26. #include <net/pkt_sched.h>
  27. struct multiq_sched_data {
  28. u16 bands;
  29. u16 max_bands;
  30. u16 curband;
  31. struct tcf_proto *filter_list;
  32. struct Qdisc **queues;
  33. };
  34. static struct Qdisc *
  35. multiq_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
  36. {
  37. struct multiq_sched_data *q = qdisc_priv(sch);
  38. u32 band;
  39. struct tcf_result res;
  40. int err;
  41. *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
  42. err = tc_classify(skb, q->filter_list, &res);
  43. #ifdef CONFIG_NET_CLS_ACT
  44. switch (err) {
  45. case TC_ACT_STOLEN:
  46. case TC_ACT_QUEUED:
  47. *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
  48. case TC_ACT_SHOT:
  49. return NULL;
  50. }
  51. #endif
  52. band = skb_get_queue_mapping(skb);
  53. if (band >= q->bands)
  54. return q->queues[0];
  55. return q->queues[band];
  56. }
  57. static int
  58. multiq_enqueue(struct sk_buff *skb, struct Qdisc *sch)
  59. {
  60. struct Qdisc *qdisc;
  61. int ret;
  62. qdisc = multiq_classify(skb, sch, &ret);
  63. #ifdef CONFIG_NET_CLS_ACT
  64. if (qdisc == NULL) {
  65. if (ret & __NET_XMIT_BYPASS)
  66. sch->qstats.drops++;
  67. kfree_skb(skb);
  68. return ret;
  69. }
  70. #endif
  71. ret = qdisc_enqueue(skb, qdisc);
  72. if (ret == NET_XMIT_SUCCESS) {
  73. sch->bstats.bytes += qdisc_pkt_len(skb);
  74. sch->bstats.packets++;
  75. sch->q.qlen++;
  76. return NET_XMIT_SUCCESS;
  77. }
  78. if (net_xmit_drop_count(ret))
  79. sch->qstats.drops++;
  80. return ret;
  81. }
  82. static struct sk_buff *multiq_dequeue(struct Qdisc *sch)
  83. {
  84. struct multiq_sched_data *q = qdisc_priv(sch);
  85. struct Qdisc *qdisc;
  86. struct sk_buff *skb;
  87. int band;
  88. for (band = 0; band < q->bands; band++) {
  89. /* cycle through bands to ensure fairness */
  90. q->curband++;
  91. if (q->curband >= q->bands)
  92. q->curband = 0;
  93. /* Check that target subqueue is available before
  94. * pulling an skb to avoid head-of-line blocking.
  95. */
  96. if (!__netif_subqueue_stopped(qdisc_dev(sch), q->curband)) {
  97. qdisc = q->queues[q->curband];
  98. skb = qdisc->dequeue(qdisc);
  99. if (skb) {
  100. sch->q.qlen--;
  101. return skb;
  102. }
  103. }
  104. }
  105. return NULL;
  106. }
  107. static struct sk_buff *multiq_peek(struct Qdisc *sch)
  108. {
  109. struct multiq_sched_data *q = qdisc_priv(sch);
  110. unsigned int curband = q->curband;
  111. struct Qdisc *qdisc;
  112. struct sk_buff *skb;
  113. int band;
  114. for (band = 0; band < q->bands; band++) {
  115. /* cycle through bands to ensure fairness */
  116. curband++;
  117. if (curband >= q->bands)
  118. curband = 0;
  119. /* Check that target subqueue is available before
  120. * pulling an skb to avoid head-of-line blocking.
  121. */
  122. if (!__netif_subqueue_stopped(qdisc_dev(sch), curband)) {
  123. qdisc = q->queues[curband];
  124. skb = qdisc->ops->peek(qdisc);
  125. if (skb)
  126. return skb;
  127. }
  128. }
  129. return NULL;
  130. }
  131. static unsigned int multiq_drop(struct Qdisc *sch)
  132. {
  133. struct multiq_sched_data *q = qdisc_priv(sch);
  134. int band;
  135. unsigned int len;
  136. struct Qdisc *qdisc;
  137. for (band = q->bands-1; band >= 0; band--) {
  138. qdisc = q->queues[band];
  139. if (qdisc->ops->drop) {
  140. len = qdisc->ops->drop(qdisc);
  141. if (len != 0) {
  142. sch->q.qlen--;
  143. return len;
  144. }
  145. }
  146. }
  147. return 0;
  148. }
  149. static void
  150. multiq_reset(struct Qdisc *sch)
  151. {
  152. u16 band;
  153. struct multiq_sched_data *q = qdisc_priv(sch);
  154. for (band = 0; band < q->bands; band++)
  155. qdisc_reset(q->queues[band]);
  156. sch->q.qlen = 0;
  157. q->curband = 0;
  158. }
  159. static void
  160. multiq_destroy(struct Qdisc *sch)
  161. {
  162. int band;
  163. struct multiq_sched_data *q = qdisc_priv(sch);
  164. tcf_destroy_chain(&q->filter_list);
  165. for (band = 0; band < q->bands; band++)
  166. qdisc_destroy(q->queues[band]);
  167. kfree(q->queues);
  168. }
  169. static int multiq_tune(struct Qdisc *sch, struct nlattr *opt)
  170. {
  171. struct multiq_sched_data *q = qdisc_priv(sch);
  172. struct tc_multiq_qopt *qopt;
  173. int i;
  174. if (!netif_is_multiqueue(qdisc_dev(sch)))
  175. return -EOPNOTSUPP;
  176. if (nla_len(opt) < sizeof(*qopt))
  177. return -EINVAL;
  178. qopt = nla_data(opt);
  179. qopt->bands = qdisc_dev(sch)->real_num_tx_queues;
  180. sch_tree_lock(sch);
  181. q->bands = qopt->bands;
  182. for (i = q->bands; i < q->max_bands; i++) {
  183. if (q->queues[i] != &noop_qdisc) {
  184. struct Qdisc *child = q->queues[i];
  185. q->queues[i] = &noop_qdisc;
  186. qdisc_tree_decrease_qlen(child, child->q.qlen);
  187. qdisc_destroy(child);
  188. }
  189. }
  190. sch_tree_unlock(sch);
  191. for (i = 0; i < q->bands; i++) {
  192. if (q->queues[i] == &noop_qdisc) {
  193. struct Qdisc *child, *old;
  194. child = qdisc_create_dflt(qdisc_dev(sch),
  195. sch->dev_queue,
  196. &pfifo_qdisc_ops,
  197. TC_H_MAKE(sch->handle,
  198. i + 1));
  199. if (child) {
  200. sch_tree_lock(sch);
  201. old = q->queues[i];
  202. q->queues[i] = child;
  203. if (old != &noop_qdisc) {
  204. qdisc_tree_decrease_qlen(old,
  205. old->q.qlen);
  206. qdisc_destroy(old);
  207. }
  208. sch_tree_unlock(sch);
  209. }
  210. }
  211. }
  212. return 0;
  213. }
  214. static int multiq_init(struct Qdisc *sch, struct nlattr *opt)
  215. {
  216. struct multiq_sched_data *q = qdisc_priv(sch);
  217. int i, err;
  218. q->queues = NULL;
  219. if (opt == NULL)
  220. return -EINVAL;
  221. q->max_bands = qdisc_dev(sch)->num_tx_queues;
  222. q->queues = kcalloc(q->max_bands, sizeof(struct Qdisc *), GFP_KERNEL);
  223. if (!q->queues)
  224. return -ENOBUFS;
  225. for (i = 0; i < q->max_bands; i++)
  226. q->queues[i] = &noop_qdisc;
  227. err = multiq_tune(sch,opt);
  228. if (err)
  229. kfree(q->queues);
  230. return err;
  231. }
  232. static int multiq_dump(struct Qdisc *sch, struct sk_buff *skb)
  233. {
  234. struct multiq_sched_data *q = qdisc_priv(sch);
  235. unsigned char *b = skb_tail_pointer(skb);
  236. struct tc_multiq_qopt opt;
  237. opt.bands = q->bands;
  238. opt.max_bands = q->max_bands;
  239. NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
  240. return skb->len;
  241. nla_put_failure:
  242. nlmsg_trim(skb, b);
  243. return -1;
  244. }
  245. static int multiq_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
  246. struct Qdisc **old)
  247. {
  248. struct multiq_sched_data *q = qdisc_priv(sch);
  249. unsigned long band = arg - 1;
  250. if (band >= q->bands)
  251. return -EINVAL;
  252. if (new == NULL)
  253. new = &noop_qdisc;
  254. sch_tree_lock(sch);
  255. *old = q->queues[band];
  256. q->queues[band] = new;
  257. qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
  258. qdisc_reset(*old);
  259. sch_tree_unlock(sch);
  260. return 0;
  261. }
  262. static struct Qdisc *
  263. multiq_leaf(struct Qdisc *sch, unsigned long arg)
  264. {
  265. struct multiq_sched_data *q = qdisc_priv(sch);
  266. unsigned long band = arg - 1;
  267. if (band >= q->bands)
  268. return NULL;
  269. return q->queues[band];
  270. }
  271. static unsigned long multiq_get(struct Qdisc *sch, u32 classid)
  272. {
  273. struct multiq_sched_data *q = qdisc_priv(sch);
  274. unsigned long band = TC_H_MIN(classid);
  275. if (band - 1 >= q->bands)
  276. return 0;
  277. return band;
  278. }
  279. static unsigned long multiq_bind(struct Qdisc *sch, unsigned long parent,
  280. u32 classid)
  281. {
  282. return multiq_get(sch, classid);
  283. }
  284. static void multiq_put(struct Qdisc *q, unsigned long cl)
  285. {
  286. return;
  287. }
  288. static int multiq_change(struct Qdisc *sch, u32 handle, u32 parent,
  289. struct nlattr **tca, unsigned long *arg)
  290. {
  291. unsigned long cl = *arg;
  292. struct multiq_sched_data *q = qdisc_priv(sch);
  293. if (cl - 1 > q->bands)
  294. return -ENOENT;
  295. return 0;
  296. }
  297. static int multiq_delete(struct Qdisc *sch, unsigned long cl)
  298. {
  299. struct multiq_sched_data *q = qdisc_priv(sch);
  300. if (cl - 1 > q->bands)
  301. return -ENOENT;
  302. return 0;
  303. }
  304. static int multiq_dump_class(struct Qdisc *sch, unsigned long cl,
  305. struct sk_buff *skb, struct tcmsg *tcm)
  306. {
  307. struct multiq_sched_data *q = qdisc_priv(sch);
  308. if (cl - 1 > q->bands)
  309. return -ENOENT;
  310. tcm->tcm_handle |= TC_H_MIN(cl);
  311. if (q->queues[cl-1])
  312. tcm->tcm_info = q->queues[cl-1]->handle;
  313. return 0;
  314. }
  315. static int multiq_dump_class_stats(struct Qdisc *sch, unsigned long cl,
  316. struct gnet_dump *d)
  317. {
  318. struct multiq_sched_data *q = qdisc_priv(sch);
  319. struct Qdisc *cl_q;
  320. cl_q = q->queues[cl - 1];
  321. if (gnet_stats_copy_basic(d, &cl_q->bstats) < 0 ||
  322. gnet_stats_copy_queue(d, &cl_q->qstats) < 0)
  323. return -1;
  324. return 0;
  325. }
  326. static void multiq_walk(struct Qdisc *sch, struct qdisc_walker *arg)
  327. {
  328. struct multiq_sched_data *q = qdisc_priv(sch);
  329. int band;
  330. if (arg->stop)
  331. return;
  332. for (band = 0; band < q->bands; band++) {
  333. if (arg->count < arg->skip) {
  334. arg->count++;
  335. continue;
  336. }
  337. if (arg->fn(sch, band+1, arg) < 0) {
  338. arg->stop = 1;
  339. break;
  340. }
  341. arg->count++;
  342. }
  343. }
  344. static struct tcf_proto **multiq_find_tcf(struct Qdisc *sch, unsigned long cl)
  345. {
  346. struct multiq_sched_data *q = qdisc_priv(sch);
  347. if (cl)
  348. return NULL;
  349. return &q->filter_list;
  350. }
  351. static const struct Qdisc_class_ops multiq_class_ops = {
  352. .graft = multiq_graft,
  353. .leaf = multiq_leaf,
  354. .get = multiq_get,
  355. .put = multiq_put,
  356. .change = multiq_change,
  357. .delete = multiq_delete,
  358. .walk = multiq_walk,
  359. .tcf_chain = multiq_find_tcf,
  360. .bind_tcf = multiq_bind,
  361. .unbind_tcf = multiq_put,
  362. .dump = multiq_dump_class,
  363. .dump_stats = multiq_dump_class_stats,
  364. };
  365. static struct Qdisc_ops multiq_qdisc_ops __read_mostly = {
  366. .next = NULL,
  367. .cl_ops = &multiq_class_ops,
  368. .id = "multiq",
  369. .priv_size = sizeof(struct multiq_sched_data),
  370. .enqueue = multiq_enqueue,
  371. .dequeue = multiq_dequeue,
  372. .peek = multiq_peek,
  373. .drop = multiq_drop,
  374. .init = multiq_init,
  375. .reset = multiq_reset,
  376. .destroy = multiq_destroy,
  377. .change = multiq_tune,
  378. .dump = multiq_dump,
  379. .owner = THIS_MODULE,
  380. };
  381. static int __init multiq_module_init(void)
  382. {
  383. return register_qdisc(&multiq_qdisc_ops);
  384. }
  385. static void __exit multiq_module_exit(void)
  386. {
  387. unregister_qdisc(&multiq_qdisc_ops);
  388. }
  389. module_init(multiq_module_init)
  390. module_exit(multiq_module_exit)
  391. MODULE_LICENSE("GPL");