sch_mqprio.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420
  1. /*
  2. * net/sched/sch_mqprio.c
  3. *
  4. * Copyright (c) 2010 John Fastabend <john.r.fastabend@intel.com>
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License
  8. * version 2 as published by the Free Software Foundation.
  9. */
  10. #include <linux/types.h>
  11. #include <linux/slab.h>
  12. #include <linux/kernel.h>
  13. #include <linux/string.h>
  14. #include <linux/errno.h>
  15. #include <linux/skbuff.h>
  16. #include <linux/module.h>
  17. #include <net/netlink.h>
  18. #include <net/pkt_sched.h>
  19. #include <net/sch_generic.h>
  20. struct mqprio_sched {
  21. struct Qdisc **qdiscs;
  22. int hw_owned;
  23. };
  24. static void mqprio_destroy(struct Qdisc *sch)
  25. {
  26. struct net_device *dev = qdisc_dev(sch);
  27. struct mqprio_sched *priv = qdisc_priv(sch);
  28. unsigned int ntx;
  29. if (priv->qdiscs) {
  30. for (ntx = 0;
  31. ntx < dev->num_tx_queues && priv->qdiscs[ntx];
  32. ntx++)
  33. qdisc_destroy(priv->qdiscs[ntx]);
  34. kfree(priv->qdiscs);
  35. }
  36. if (priv->hw_owned && dev->netdev_ops->ndo_setup_tc)
  37. dev->netdev_ops->ndo_setup_tc(dev, 0);
  38. else
  39. netdev_set_num_tc(dev, 0);
  40. }
  41. static int mqprio_parse_opt(struct net_device *dev, struct tc_mqprio_qopt *qopt)
  42. {
  43. int i, j;
  44. /* Verify num_tc is not out of max range */
  45. if (qopt->num_tc > TC_MAX_QUEUE)
  46. return -EINVAL;
  47. /* Verify priority mapping uses valid tcs */
  48. for (i = 0; i < TC_BITMASK + 1; i++) {
  49. if (qopt->prio_tc_map[i] >= qopt->num_tc)
  50. return -EINVAL;
  51. }
  52. /* net_device does not support requested operation */
  53. if (qopt->hw && !dev->netdev_ops->ndo_setup_tc)
  54. return -EINVAL;
  55. /* if hw owned qcount and qoffset are taken from LLD so
  56. * no reason to verify them here
  57. */
  58. if (qopt->hw)
  59. return 0;
  60. for (i = 0; i < qopt->num_tc; i++) {
  61. unsigned int last = qopt->offset[i] + qopt->count[i];
  62. /* Verify the queue count is in tx range being equal to the
  63. * real_num_tx_queues indicates the last queue is in use.
  64. */
  65. if (qopt->offset[i] >= dev->real_num_tx_queues ||
  66. !qopt->count[i] ||
  67. last > dev->real_num_tx_queues)
  68. return -EINVAL;
  69. /* Verify that the offset and counts do not overlap */
  70. for (j = i + 1; j < qopt->num_tc; j++) {
  71. if (last > qopt->offset[j])
  72. return -EINVAL;
  73. }
  74. }
  75. return 0;
  76. }
  77. static int mqprio_init(struct Qdisc *sch, struct nlattr *opt)
  78. {
  79. struct net_device *dev = qdisc_dev(sch);
  80. struct mqprio_sched *priv = qdisc_priv(sch);
  81. struct netdev_queue *dev_queue;
  82. struct Qdisc *qdisc;
  83. int i, err = -EOPNOTSUPP;
  84. struct tc_mqprio_qopt *qopt = NULL;
  85. BUILD_BUG_ON(TC_MAX_QUEUE != TC_QOPT_MAX_QUEUE);
  86. BUILD_BUG_ON(TC_BITMASK != TC_QOPT_BITMASK);
  87. if (sch->parent != TC_H_ROOT)
  88. return -EOPNOTSUPP;
  89. if (!netif_is_multiqueue(dev))
  90. return -EOPNOTSUPP;
  91. if (!opt || nla_len(opt) < sizeof(*qopt))
  92. return -EINVAL;
  93. qopt = nla_data(opt);
  94. if (mqprio_parse_opt(dev, qopt))
  95. return -EINVAL;
  96. /* pre-allocate qdisc, attachment can't fail */
  97. priv->qdiscs = kcalloc(dev->num_tx_queues, sizeof(priv->qdiscs[0]),
  98. GFP_KERNEL);
  99. if (priv->qdiscs == NULL) {
  100. err = -ENOMEM;
  101. goto err;
  102. }
  103. for (i = 0; i < dev->num_tx_queues; i++) {
  104. dev_queue = netdev_get_tx_queue(dev, i);
  105. qdisc = qdisc_create_dflt(dev_queue, &pfifo_fast_ops,
  106. TC_H_MAKE(TC_H_MAJ(sch->handle),
  107. TC_H_MIN(i + 1)));
  108. if (qdisc == NULL) {
  109. err = -ENOMEM;
  110. goto err;
  111. }
  112. priv->qdiscs[i] = qdisc;
  113. }
  114. /* If the mqprio options indicate that hardware should own
  115. * the queue mapping then run ndo_setup_tc otherwise use the
  116. * supplied and verified mapping
  117. */
  118. if (qopt->hw) {
  119. priv->hw_owned = 1;
  120. err = dev->netdev_ops->ndo_setup_tc(dev, qopt->num_tc);
  121. if (err)
  122. goto err;
  123. } else {
  124. netdev_set_num_tc(dev, qopt->num_tc);
  125. for (i = 0; i < qopt->num_tc; i++)
  126. netdev_set_tc_queue(dev, i,
  127. qopt->count[i], qopt->offset[i]);
  128. }
  129. /* Always use supplied priority mappings */
  130. for (i = 0; i < TC_BITMASK + 1; i++)
  131. netdev_set_prio_tc_map(dev, i, qopt->prio_tc_map[i]);
  132. sch->flags |= TCQ_F_MQROOT;
  133. return 0;
  134. err:
  135. mqprio_destroy(sch);
  136. return err;
  137. }
  138. static void mqprio_attach(struct Qdisc *sch)
  139. {
  140. struct net_device *dev = qdisc_dev(sch);
  141. struct mqprio_sched *priv = qdisc_priv(sch);
  142. struct Qdisc *qdisc;
  143. unsigned int ntx;
  144. /* Attach underlying qdisc */
  145. for (ntx = 0; ntx < dev->num_tx_queues; ntx++) {
  146. qdisc = priv->qdiscs[ntx];
  147. qdisc = dev_graft_qdisc(qdisc->dev_queue, qdisc);
  148. if (qdisc)
  149. qdisc_destroy(qdisc);
  150. }
  151. kfree(priv->qdiscs);
  152. priv->qdiscs = NULL;
  153. }
  154. static struct netdev_queue *mqprio_queue_get(struct Qdisc *sch,
  155. unsigned long cl)
  156. {
  157. struct net_device *dev = qdisc_dev(sch);
  158. unsigned long ntx = cl - 1 - netdev_get_num_tc(dev);
  159. if (ntx >= dev->num_tx_queues)
  160. return NULL;
  161. return netdev_get_tx_queue(dev, ntx);
  162. }
  163. static int mqprio_graft(struct Qdisc *sch, unsigned long cl, struct Qdisc *new,
  164. struct Qdisc **old)
  165. {
  166. struct net_device *dev = qdisc_dev(sch);
  167. struct netdev_queue *dev_queue = mqprio_queue_get(sch, cl);
  168. if (!dev_queue)
  169. return -EINVAL;
  170. if (dev->flags & IFF_UP)
  171. dev_deactivate(dev);
  172. *old = dev_graft_qdisc(dev_queue, new);
  173. if (dev->flags & IFF_UP)
  174. dev_activate(dev);
  175. return 0;
  176. }
  177. static int mqprio_dump(struct Qdisc *sch, struct sk_buff *skb)
  178. {
  179. struct net_device *dev = qdisc_dev(sch);
  180. struct mqprio_sched *priv = qdisc_priv(sch);
  181. unsigned char *b = skb_tail_pointer(skb);
  182. struct tc_mqprio_qopt opt = { 0 };
  183. struct Qdisc *qdisc;
  184. unsigned int i;
  185. sch->q.qlen = 0;
  186. memset(&sch->bstats, 0, sizeof(sch->bstats));
  187. memset(&sch->qstats, 0, sizeof(sch->qstats));
  188. for (i = 0; i < dev->num_tx_queues; i++) {
  189. qdisc = netdev_get_tx_queue(dev, i)->qdisc;
  190. spin_lock_bh(qdisc_lock(qdisc));
  191. sch->q.qlen += qdisc->q.qlen;
  192. sch->bstats.bytes += qdisc->bstats.bytes;
  193. sch->bstats.packets += qdisc->bstats.packets;
  194. sch->qstats.qlen += qdisc->qstats.qlen;
  195. sch->qstats.backlog += qdisc->qstats.backlog;
  196. sch->qstats.drops += qdisc->qstats.drops;
  197. sch->qstats.requeues += qdisc->qstats.requeues;
  198. sch->qstats.overlimits += qdisc->qstats.overlimits;
  199. spin_unlock_bh(qdisc_lock(qdisc));
  200. }
  201. opt.num_tc = netdev_get_num_tc(dev);
  202. memcpy(opt.prio_tc_map, dev->prio_tc_map, sizeof(opt.prio_tc_map));
  203. opt.hw = priv->hw_owned;
  204. for (i = 0; i < netdev_get_num_tc(dev); i++) {
  205. opt.count[i] = dev->tc_to_txq[i].count;
  206. opt.offset[i] = dev->tc_to_txq[i].offset;
  207. }
  208. if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt))
  209. goto nla_put_failure;
  210. return skb->len;
  211. nla_put_failure:
  212. nlmsg_trim(skb, b);
  213. return -1;
  214. }
  215. static struct Qdisc *mqprio_leaf(struct Qdisc *sch, unsigned long cl)
  216. {
  217. struct netdev_queue *dev_queue = mqprio_queue_get(sch, cl);
  218. if (!dev_queue)
  219. return NULL;
  220. return dev_queue->qdisc_sleeping;
  221. }
  222. static unsigned long mqprio_get(struct Qdisc *sch, u32 classid)
  223. {
  224. struct net_device *dev = qdisc_dev(sch);
  225. unsigned int ntx = TC_H_MIN(classid);
  226. if (ntx > dev->num_tx_queues + netdev_get_num_tc(dev))
  227. return 0;
  228. return ntx;
  229. }
  230. static void mqprio_put(struct Qdisc *sch, unsigned long cl)
  231. {
  232. }
  233. static int mqprio_dump_class(struct Qdisc *sch, unsigned long cl,
  234. struct sk_buff *skb, struct tcmsg *tcm)
  235. {
  236. struct net_device *dev = qdisc_dev(sch);
  237. if (cl <= netdev_get_num_tc(dev)) {
  238. tcm->tcm_parent = TC_H_ROOT;
  239. tcm->tcm_info = 0;
  240. } else {
  241. int i;
  242. struct netdev_queue *dev_queue;
  243. dev_queue = mqprio_queue_get(sch, cl);
  244. tcm->tcm_parent = 0;
  245. for (i = 0; i < netdev_get_num_tc(dev); i++) {
  246. struct netdev_tc_txq tc = dev->tc_to_txq[i];
  247. int q_idx = cl - netdev_get_num_tc(dev);
  248. if (q_idx > tc.offset &&
  249. q_idx <= tc.offset + tc.count) {
  250. tcm->tcm_parent =
  251. TC_H_MAKE(TC_H_MAJ(sch->handle),
  252. TC_H_MIN(i + 1));
  253. break;
  254. }
  255. }
  256. tcm->tcm_info = dev_queue->qdisc_sleeping->handle;
  257. }
  258. tcm->tcm_handle |= TC_H_MIN(cl);
  259. return 0;
  260. }
  261. static int mqprio_dump_class_stats(struct Qdisc *sch, unsigned long cl,
  262. struct gnet_dump *d)
  263. __releases(d->lock)
  264. __acquires(d->lock)
  265. {
  266. struct net_device *dev = qdisc_dev(sch);
  267. if (cl <= netdev_get_num_tc(dev)) {
  268. int i;
  269. struct Qdisc *qdisc;
  270. struct gnet_stats_queue qstats = {0};
  271. struct gnet_stats_basic_packed bstats = {0};
  272. struct netdev_tc_txq tc = dev->tc_to_txq[cl - 1];
  273. /* Drop lock here it will be reclaimed before touching
  274. * statistics this is required because the d->lock we
  275. * hold here is the look on dev_queue->qdisc_sleeping
  276. * also acquired below.
  277. */
  278. spin_unlock_bh(d->lock);
  279. for (i = tc.offset; i < tc.offset + tc.count; i++) {
  280. qdisc = netdev_get_tx_queue(dev, i)->qdisc;
  281. spin_lock_bh(qdisc_lock(qdisc));
  282. bstats.bytes += qdisc->bstats.bytes;
  283. bstats.packets += qdisc->bstats.packets;
  284. qstats.qlen += qdisc->qstats.qlen;
  285. qstats.backlog += qdisc->qstats.backlog;
  286. qstats.drops += qdisc->qstats.drops;
  287. qstats.requeues += qdisc->qstats.requeues;
  288. qstats.overlimits += qdisc->qstats.overlimits;
  289. spin_unlock_bh(qdisc_lock(qdisc));
  290. }
  291. /* Reclaim root sleeping lock before completing stats */
  292. spin_lock_bh(d->lock);
  293. if (gnet_stats_copy_basic(d, &bstats) < 0 ||
  294. gnet_stats_copy_queue(d, &qstats) < 0)
  295. return -1;
  296. } else {
  297. struct netdev_queue *dev_queue = mqprio_queue_get(sch, cl);
  298. sch = dev_queue->qdisc_sleeping;
  299. sch->qstats.qlen = sch->q.qlen;
  300. if (gnet_stats_copy_basic(d, &sch->bstats) < 0 ||
  301. gnet_stats_copy_queue(d, &sch->qstats) < 0)
  302. return -1;
  303. }
  304. return 0;
  305. }
  306. static void mqprio_walk(struct Qdisc *sch, struct qdisc_walker *arg)
  307. {
  308. struct net_device *dev = qdisc_dev(sch);
  309. unsigned long ntx;
  310. if (arg->stop)
  311. return;
  312. /* Walk hierarchy with a virtual class per tc */
  313. arg->count = arg->skip;
  314. for (ntx = arg->skip;
  315. ntx < dev->num_tx_queues + netdev_get_num_tc(dev);
  316. ntx++) {
  317. if (arg->fn(sch, ntx + 1, arg) < 0) {
  318. arg->stop = 1;
  319. break;
  320. }
  321. arg->count++;
  322. }
  323. }
  324. static const struct Qdisc_class_ops mqprio_class_ops = {
  325. .graft = mqprio_graft,
  326. .leaf = mqprio_leaf,
  327. .get = mqprio_get,
  328. .put = mqprio_put,
  329. .walk = mqprio_walk,
  330. .dump = mqprio_dump_class,
  331. .dump_stats = mqprio_dump_class_stats,
  332. };
  333. static struct Qdisc_ops mqprio_qdisc_ops __read_mostly = {
  334. .cl_ops = &mqprio_class_ops,
  335. .id = "mqprio",
  336. .priv_size = sizeof(struct mqprio_sched),
  337. .init = mqprio_init,
  338. .destroy = mqprio_destroy,
  339. .attach = mqprio_attach,
  340. .dump = mqprio_dump,
  341. .owner = THIS_MODULE,
  342. };
  343. static int __init mqprio_module_init(void)
  344. {
  345. return register_qdisc(&mqprio_qdisc_ops);
  346. }
  347. static void __exit mqprio_module_exit(void)
  348. {
  349. unregister_qdisc(&mqprio_qdisc_ops);
  350. }
  351. module_init(mqprio_module_init);
  352. module_exit(mqprio_module_exit);
  353. MODULE_LICENSE("GPL");