sch_prio.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409
  1. /*
  2. * net/sched/sch_prio.c Simple 3-band priority "scheduler".
  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. * Fixes: 19990609: J Hadi Salim <hadi@nortelnetworks.com>:
  11. * Init -- EINVAL when opt undefined
  12. */
  13. #include <linux/module.h>
  14. #include <linux/slab.h>
  15. #include <linux/types.h>
  16. #include <linux/kernel.h>
  17. #include <linux/string.h>
  18. #include <linux/errno.h>
  19. #include <linux/skbuff.h>
  20. #include <net/netlink.h>
  21. #include <net/pkt_sched.h>
  22. struct prio_sched_data {
  23. int bands;
  24. struct tcf_proto __rcu *filter_list;
  25. u8 prio2band[TC_PRIO_MAX+1];
  26. struct Qdisc *queues[TCQ_PRIO_BANDS];
  27. };
  28. static struct Qdisc *
  29. prio_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
  30. {
  31. struct prio_sched_data *q = qdisc_priv(sch);
  32. u32 band = skb->priority;
  33. struct tcf_result res;
  34. struct tcf_proto *fl;
  35. int err;
  36. *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
  37. if (TC_H_MAJ(skb->priority) != sch->handle) {
  38. fl = rcu_dereference_bh(q->filter_list);
  39. err = tc_classify(skb, fl, &res);
  40. #ifdef CONFIG_NET_CLS_ACT
  41. switch (err) {
  42. case TC_ACT_STOLEN:
  43. case TC_ACT_QUEUED:
  44. *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
  45. case TC_ACT_SHOT:
  46. return NULL;
  47. }
  48. #endif
  49. if (!fl || err < 0) {
  50. if (TC_H_MAJ(band))
  51. band = 0;
  52. return q->queues[q->prio2band[band & TC_PRIO_MAX]];
  53. }
  54. band = res.classid;
  55. }
  56. band = TC_H_MIN(band) - 1;
  57. if (band >= q->bands)
  58. return q->queues[q->prio2band[0]];
  59. return q->queues[band];
  60. }
  61. static int
  62. prio_enqueue(struct sk_buff *skb, struct Qdisc *sch)
  63. {
  64. struct Qdisc *qdisc;
  65. int ret;
  66. qdisc = prio_classify(skb, sch, &ret);
  67. #ifdef CONFIG_NET_CLS_ACT
  68. if (qdisc == NULL) {
  69. if (ret & __NET_XMIT_BYPASS)
  70. qdisc_qstats_drop(sch);
  71. kfree_skb(skb);
  72. return ret;
  73. }
  74. #endif
  75. ret = qdisc_enqueue(skb, qdisc);
  76. if (ret == NET_XMIT_SUCCESS) {
  77. sch->q.qlen++;
  78. return NET_XMIT_SUCCESS;
  79. }
  80. if (net_xmit_drop_count(ret))
  81. qdisc_qstats_drop(sch);
  82. return ret;
  83. }
  84. static struct sk_buff *prio_peek(struct Qdisc *sch)
  85. {
  86. struct prio_sched_data *q = qdisc_priv(sch);
  87. int prio;
  88. for (prio = 0; prio < q->bands; prio++) {
  89. struct Qdisc *qdisc = q->queues[prio];
  90. struct sk_buff *skb = qdisc->ops->peek(qdisc);
  91. if (skb)
  92. return skb;
  93. }
  94. return NULL;
  95. }
  96. static struct sk_buff *prio_dequeue(struct Qdisc *sch)
  97. {
  98. struct prio_sched_data *q = qdisc_priv(sch);
  99. int prio;
  100. for (prio = 0; prio < q->bands; prio++) {
  101. struct Qdisc *qdisc = q->queues[prio];
  102. struct sk_buff *skb = qdisc_dequeue_peeked(qdisc);
  103. if (skb) {
  104. qdisc_bstats_update(sch, skb);
  105. sch->q.qlen--;
  106. return skb;
  107. }
  108. }
  109. return NULL;
  110. }
  111. static unsigned int prio_drop(struct Qdisc *sch)
  112. {
  113. struct prio_sched_data *q = qdisc_priv(sch);
  114. int prio;
  115. unsigned int len;
  116. struct Qdisc *qdisc;
  117. for (prio = q->bands-1; prio >= 0; prio--) {
  118. qdisc = q->queues[prio];
  119. if (qdisc->ops->drop && (len = qdisc->ops->drop(qdisc)) != 0) {
  120. sch->q.qlen--;
  121. return len;
  122. }
  123. }
  124. return 0;
  125. }
  126. static void
  127. prio_reset(struct Qdisc *sch)
  128. {
  129. int prio;
  130. struct prio_sched_data *q = qdisc_priv(sch);
  131. for (prio = 0; prio < q->bands; prio++)
  132. qdisc_reset(q->queues[prio]);
  133. sch->q.qlen = 0;
  134. }
  135. static void
  136. prio_destroy(struct Qdisc *sch)
  137. {
  138. int prio;
  139. struct prio_sched_data *q = qdisc_priv(sch);
  140. tcf_destroy_chain(&q->filter_list);
  141. for (prio = 0; prio < q->bands; prio++)
  142. qdisc_destroy(q->queues[prio]);
  143. }
  144. static int prio_tune(struct Qdisc *sch, struct nlattr *opt)
  145. {
  146. struct prio_sched_data *q = qdisc_priv(sch);
  147. struct tc_prio_qopt *qopt;
  148. int i;
  149. if (nla_len(opt) < sizeof(*qopt))
  150. return -EINVAL;
  151. qopt = nla_data(opt);
  152. if (qopt->bands > TCQ_PRIO_BANDS || qopt->bands < 2)
  153. return -EINVAL;
  154. for (i = 0; i <= TC_PRIO_MAX; i++) {
  155. if (qopt->priomap[i] >= qopt->bands)
  156. return -EINVAL;
  157. }
  158. sch_tree_lock(sch);
  159. q->bands = qopt->bands;
  160. memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1);
  161. for (i = q->bands; i < TCQ_PRIO_BANDS; i++) {
  162. struct Qdisc *child = q->queues[i];
  163. q->queues[i] = &noop_qdisc;
  164. if (child != &noop_qdisc) {
  165. qdisc_tree_decrease_qlen(child, child->q.qlen);
  166. qdisc_destroy(child);
  167. }
  168. }
  169. sch_tree_unlock(sch);
  170. for (i = 0; i < q->bands; i++) {
  171. if (q->queues[i] == &noop_qdisc) {
  172. struct Qdisc *child, *old;
  173. child = qdisc_create_dflt(sch->dev_queue,
  174. &pfifo_qdisc_ops,
  175. TC_H_MAKE(sch->handle, i + 1));
  176. if (child) {
  177. sch_tree_lock(sch);
  178. old = q->queues[i];
  179. q->queues[i] = child;
  180. if (old != &noop_qdisc) {
  181. qdisc_tree_decrease_qlen(old,
  182. old->q.qlen);
  183. qdisc_destroy(old);
  184. }
  185. sch_tree_unlock(sch);
  186. }
  187. }
  188. }
  189. return 0;
  190. }
  191. static int prio_init(struct Qdisc *sch, struct nlattr *opt)
  192. {
  193. struct prio_sched_data *q = qdisc_priv(sch);
  194. int i;
  195. for (i = 0; i < TCQ_PRIO_BANDS; i++)
  196. q->queues[i] = &noop_qdisc;
  197. if (opt == NULL) {
  198. return -EINVAL;
  199. } else {
  200. int err;
  201. if ((err = prio_tune(sch, opt)) != 0)
  202. return err;
  203. }
  204. return 0;
  205. }
  206. static int prio_dump(struct Qdisc *sch, struct sk_buff *skb)
  207. {
  208. struct prio_sched_data *q = qdisc_priv(sch);
  209. unsigned char *b = skb_tail_pointer(skb);
  210. struct tc_prio_qopt opt;
  211. opt.bands = q->bands;
  212. memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX + 1);
  213. if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt))
  214. goto nla_put_failure;
  215. return skb->len;
  216. nla_put_failure:
  217. nlmsg_trim(skb, b);
  218. return -1;
  219. }
  220. static int prio_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
  221. struct Qdisc **old)
  222. {
  223. struct prio_sched_data *q = qdisc_priv(sch);
  224. unsigned long band = arg - 1;
  225. if (new == NULL)
  226. new = &noop_qdisc;
  227. sch_tree_lock(sch);
  228. *old = q->queues[band];
  229. q->queues[band] = new;
  230. qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
  231. qdisc_reset(*old);
  232. sch_tree_unlock(sch);
  233. return 0;
  234. }
  235. static struct Qdisc *
  236. prio_leaf(struct Qdisc *sch, unsigned long arg)
  237. {
  238. struct prio_sched_data *q = qdisc_priv(sch);
  239. unsigned long band = arg - 1;
  240. return q->queues[band];
  241. }
  242. static unsigned long prio_get(struct Qdisc *sch, u32 classid)
  243. {
  244. struct prio_sched_data *q = qdisc_priv(sch);
  245. unsigned long band = TC_H_MIN(classid);
  246. if (band - 1 >= q->bands)
  247. return 0;
  248. return band;
  249. }
  250. static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid)
  251. {
  252. return prio_get(sch, classid);
  253. }
  254. static void prio_put(struct Qdisc *q, unsigned long cl)
  255. {
  256. }
  257. static int prio_dump_class(struct Qdisc *sch, unsigned long cl, struct sk_buff *skb,
  258. struct tcmsg *tcm)
  259. {
  260. struct prio_sched_data *q = qdisc_priv(sch);
  261. tcm->tcm_handle |= TC_H_MIN(cl);
  262. tcm->tcm_info = q->queues[cl-1]->handle;
  263. return 0;
  264. }
  265. static int prio_dump_class_stats(struct Qdisc *sch, unsigned long cl,
  266. struct gnet_dump *d)
  267. {
  268. struct prio_sched_data *q = qdisc_priv(sch);
  269. struct Qdisc *cl_q;
  270. cl_q = q->queues[cl - 1];
  271. if (gnet_stats_copy_basic(d, NULL, &cl_q->bstats) < 0 ||
  272. gnet_stats_copy_queue(d, NULL, &cl_q->qstats, cl_q->q.qlen) < 0)
  273. return -1;
  274. return 0;
  275. }
  276. static void prio_walk(struct Qdisc *sch, struct qdisc_walker *arg)
  277. {
  278. struct prio_sched_data *q = qdisc_priv(sch);
  279. int prio;
  280. if (arg->stop)
  281. return;
  282. for (prio = 0; prio < q->bands; prio++) {
  283. if (arg->count < arg->skip) {
  284. arg->count++;
  285. continue;
  286. }
  287. if (arg->fn(sch, prio + 1, arg) < 0) {
  288. arg->stop = 1;
  289. break;
  290. }
  291. arg->count++;
  292. }
  293. }
  294. static struct tcf_proto __rcu **prio_find_tcf(struct Qdisc *sch,
  295. unsigned long cl)
  296. {
  297. struct prio_sched_data *q = qdisc_priv(sch);
  298. if (cl)
  299. return NULL;
  300. return &q->filter_list;
  301. }
  302. static const struct Qdisc_class_ops prio_class_ops = {
  303. .graft = prio_graft,
  304. .leaf = prio_leaf,
  305. .get = prio_get,
  306. .put = prio_put,
  307. .walk = prio_walk,
  308. .tcf_chain = prio_find_tcf,
  309. .bind_tcf = prio_bind,
  310. .unbind_tcf = prio_put,
  311. .dump = prio_dump_class,
  312. .dump_stats = prio_dump_class_stats,
  313. };
  314. static struct Qdisc_ops prio_qdisc_ops __read_mostly = {
  315. .next = NULL,
  316. .cl_ops = &prio_class_ops,
  317. .id = "prio",
  318. .priv_size = sizeof(struct prio_sched_data),
  319. .enqueue = prio_enqueue,
  320. .dequeue = prio_dequeue,
  321. .peek = prio_peek,
  322. .drop = prio_drop,
  323. .init = prio_init,
  324. .reset = prio_reset,
  325. .destroy = prio_destroy,
  326. .change = prio_tune,
  327. .dump = prio_dump,
  328. .owner = THIS_MODULE,
  329. };
  330. static int __init prio_module_init(void)
  331. {
  332. return register_qdisc(&prio_qdisc_ops);
  333. }
  334. static void __exit prio_module_exit(void)
  335. {
  336. unregister_qdisc(&prio_qdisc_ops);
  337. }
  338. module_init(prio_module_init)
  339. module_exit(prio_module_exit)
  340. MODULE_LICENSE("GPL");