sch_prio.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406
  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. {
  24. int bands;
  25. struct tcf_proto *filter_list;
  26. u8 prio2band[TC_PRIO_MAX+1];
  27. struct Qdisc *queues[TCQ_PRIO_BANDS];
  28. };
  29. static struct Qdisc *
  30. prio_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
  31. {
  32. struct prio_sched_data *q = qdisc_priv(sch);
  33. u32 band = skb->priority;
  34. struct tcf_result res;
  35. int err;
  36. *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
  37. if (TC_H_MAJ(skb->priority) != sch->handle) {
  38. err = tc_classify(skb, q->filter_list, &res);
  39. #ifdef CONFIG_NET_CLS_ACT
  40. switch (err) {
  41. case TC_ACT_STOLEN:
  42. case TC_ACT_QUEUED:
  43. *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
  44. case TC_ACT_SHOT:
  45. return NULL;
  46. }
  47. #endif
  48. if (!q->filter_list || err < 0) {
  49. if (TC_H_MAJ(band))
  50. band = 0;
  51. return q->queues[q->prio2band[band&TC_PRIO_MAX]];
  52. }
  53. band = res.classid;
  54. }
  55. band = TC_H_MIN(band) - 1;
  56. if (band >= q->bands)
  57. return q->queues[q->prio2band[0]];
  58. return q->queues[band];
  59. }
  60. static int
  61. prio_enqueue(struct sk_buff *skb, struct Qdisc *sch)
  62. {
  63. struct Qdisc *qdisc;
  64. int ret;
  65. qdisc = prio_classify(skb, sch, &ret);
  66. #ifdef CONFIG_NET_CLS_ACT
  67. if (qdisc == NULL) {
  68. if (ret & __NET_XMIT_BYPASS)
  69. sch->qstats.drops++;
  70. kfree_skb(skb);
  71. return ret;
  72. }
  73. #endif
  74. ret = qdisc_enqueue(skb, qdisc);
  75. if (ret == NET_XMIT_SUCCESS) {
  76. sch->bstats.bytes += qdisc_pkt_len(skb);
  77. sch->bstats.packets++;
  78. sch->q.qlen++;
  79. return NET_XMIT_SUCCESS;
  80. }
  81. if (net_xmit_drop_count(ret))
  82. sch->qstats.drops++;
  83. return ret;
  84. }
  85. static struct sk_buff *prio_peek(struct Qdisc *sch)
  86. {
  87. struct prio_sched_data *q = qdisc_priv(sch);
  88. int prio;
  89. for (prio = 0; prio < q->bands; prio++) {
  90. struct Qdisc *qdisc = q->queues[prio];
  91. struct sk_buff *skb = qdisc->ops->peek(qdisc);
  92. if (skb)
  93. return skb;
  94. }
  95. return NULL;
  96. }
  97. static struct sk_buff *prio_dequeue(struct Qdisc* sch)
  98. {
  99. struct prio_sched_data *q = qdisc_priv(sch);
  100. int prio;
  101. for (prio = 0; prio < q->bands; prio++) {
  102. struct Qdisc *qdisc = q->queues[prio];
  103. struct sk_buff *skb = qdisc->dequeue(qdisc);
  104. if (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(qdisc_dev(sch), 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. NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
  214. return skb->len;
  215. nla_put_failure:
  216. nlmsg_trim(skb, b);
  217. return -1;
  218. }
  219. static int prio_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
  220. struct Qdisc **old)
  221. {
  222. struct prio_sched_data *q = qdisc_priv(sch);
  223. unsigned long band = arg - 1;
  224. if (new == NULL)
  225. new = &noop_qdisc;
  226. sch_tree_lock(sch);
  227. *old = q->queues[band];
  228. q->queues[band] = new;
  229. qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
  230. qdisc_reset(*old);
  231. sch_tree_unlock(sch);
  232. return 0;
  233. }
  234. static struct Qdisc *
  235. prio_leaf(struct Qdisc *sch, unsigned long arg)
  236. {
  237. struct prio_sched_data *q = qdisc_priv(sch);
  238. unsigned long band = arg - 1;
  239. return q->queues[band];
  240. }
  241. static unsigned long prio_get(struct Qdisc *sch, u32 classid)
  242. {
  243. struct prio_sched_data *q = qdisc_priv(sch);
  244. unsigned long band = TC_H_MIN(classid);
  245. if (band - 1 >= q->bands)
  246. return 0;
  247. return band;
  248. }
  249. static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid)
  250. {
  251. return prio_get(sch, classid);
  252. }
  253. static void prio_put(struct Qdisc *q, unsigned long cl)
  254. {
  255. }
  256. static int prio_dump_class(struct Qdisc *sch, unsigned long cl, struct sk_buff *skb,
  257. struct tcmsg *tcm)
  258. {
  259. struct prio_sched_data *q = qdisc_priv(sch);
  260. tcm->tcm_handle |= TC_H_MIN(cl);
  261. tcm->tcm_info = q->queues[cl-1]->handle;
  262. return 0;
  263. }
  264. static int prio_dump_class_stats(struct Qdisc *sch, unsigned long cl,
  265. struct gnet_dump *d)
  266. {
  267. struct prio_sched_data *q = qdisc_priv(sch);
  268. struct Qdisc *cl_q;
  269. cl_q = q->queues[cl - 1];
  270. cl_q->qstats.qlen = cl_q->q.qlen;
  271. if (gnet_stats_copy_basic(d, &cl_q->bstats) < 0 ||
  272. gnet_stats_copy_queue(d, &cl_q->qstats) < 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 ** prio_find_tcf(struct Qdisc *sch, unsigned long cl)
  295. {
  296. struct prio_sched_data *q = qdisc_priv(sch);
  297. if (cl)
  298. return NULL;
  299. return &q->filter_list;
  300. }
  301. static const struct Qdisc_class_ops prio_class_ops = {
  302. .graft = prio_graft,
  303. .leaf = prio_leaf,
  304. .get = prio_get,
  305. .put = prio_put,
  306. .walk = prio_walk,
  307. .tcf_chain = prio_find_tcf,
  308. .bind_tcf = prio_bind,
  309. .unbind_tcf = prio_put,
  310. .dump = prio_dump_class,
  311. .dump_stats = prio_dump_class_stats,
  312. };
  313. static struct Qdisc_ops prio_qdisc_ops __read_mostly = {
  314. .next = NULL,
  315. .cl_ops = &prio_class_ops,
  316. .id = "prio",
  317. .priv_size = sizeof(struct prio_sched_data),
  318. .enqueue = prio_enqueue,
  319. .dequeue = prio_dequeue,
  320. .peek = prio_peek,
  321. .drop = prio_drop,
  322. .init = prio_init,
  323. .reset = prio_reset,
  324. .destroy = prio_destroy,
  325. .change = prio_tune,
  326. .dump = prio_dump,
  327. .owner = THIS_MODULE,
  328. };
  329. static int __init prio_module_init(void)
  330. {
  331. return register_qdisc(&prio_qdisc_ops);
  332. }
  333. static void __exit prio_module_exit(void)
  334. {
  335. unregister_qdisc(&prio_qdisc_ops);
  336. }
  337. module_init(prio_module_init)
  338. module_exit(prio_module_exit)
  339. MODULE_LICENSE("GPL");