sch_drr.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507
  1. /*
  2. * net/sched/sch_drr.c Deficit Round Robin scheduler
  3. *
  4. * Copyright (c) 2008 Patrick McHardy <kaber@trash.net>
  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/module.h>
  11. #include <linux/init.h>
  12. #include <linux/errno.h>
  13. #include <linux/netdevice.h>
  14. #include <linux/pkt_sched.h>
  15. #include <net/sch_generic.h>
  16. #include <net/pkt_sched.h>
  17. #include <net/pkt_cls.h>
  18. struct drr_class {
  19. struct Qdisc_class_common common;
  20. unsigned int refcnt;
  21. unsigned int filter_cnt;
  22. struct gnet_stats_basic bstats;
  23. struct gnet_stats_queue qstats;
  24. struct gnet_stats_rate_est rate_est;
  25. struct list_head alist;
  26. struct Qdisc *qdisc;
  27. u32 quantum;
  28. u32 deficit;
  29. };
  30. struct drr_sched {
  31. struct list_head active;
  32. struct tcf_proto *filter_list;
  33. struct Qdisc_class_hash clhash;
  34. };
  35. static struct drr_class *drr_find_class(struct Qdisc *sch, u32 classid)
  36. {
  37. struct drr_sched *q = qdisc_priv(sch);
  38. struct Qdisc_class_common *clc;
  39. clc = qdisc_class_find(&q->clhash, classid);
  40. if (clc == NULL)
  41. return NULL;
  42. return container_of(clc, struct drr_class, common);
  43. }
  44. static void drr_purge_queue(struct drr_class *cl)
  45. {
  46. unsigned int len = cl->qdisc->q.qlen;
  47. qdisc_reset(cl->qdisc);
  48. qdisc_tree_decrease_qlen(cl->qdisc, len);
  49. }
  50. static const struct nla_policy drr_policy[TCA_DRR_MAX + 1] = {
  51. [TCA_DRR_QUANTUM] = { .type = NLA_U32 },
  52. };
  53. static int drr_change_class(struct Qdisc *sch, u32 classid, u32 parentid,
  54. struct nlattr **tca, unsigned long *arg)
  55. {
  56. struct drr_sched *q = qdisc_priv(sch);
  57. struct drr_class *cl = (struct drr_class *)*arg;
  58. struct nlattr *tb[TCA_DRR_MAX + 1];
  59. u32 quantum;
  60. int err;
  61. err = nla_parse_nested(tb, TCA_DRR_MAX, tca[TCA_OPTIONS], drr_policy);
  62. if (err < 0)
  63. return err;
  64. if (tb[TCA_DRR_QUANTUM]) {
  65. quantum = nla_get_u32(tb[TCA_DRR_QUANTUM]);
  66. if (quantum == 0)
  67. return -EINVAL;
  68. } else
  69. quantum = psched_mtu(qdisc_dev(sch));
  70. if (cl != NULL) {
  71. sch_tree_lock(sch);
  72. if (tb[TCA_DRR_QUANTUM])
  73. cl->quantum = quantum;
  74. sch_tree_unlock(sch);
  75. if (tca[TCA_RATE])
  76. gen_replace_estimator(&cl->bstats, &cl->rate_est,
  77. qdisc_root_sleeping_lock(sch),
  78. tca[TCA_RATE]);
  79. return 0;
  80. }
  81. cl = kzalloc(sizeof(struct drr_class), GFP_KERNEL);
  82. if (cl == NULL)
  83. return -ENOBUFS;
  84. cl->refcnt = 1;
  85. cl->common.classid = classid;
  86. cl->quantum = quantum;
  87. cl->qdisc = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
  88. &pfifo_qdisc_ops, classid);
  89. if (cl->qdisc == NULL)
  90. cl->qdisc = &noop_qdisc;
  91. if (tca[TCA_RATE])
  92. gen_replace_estimator(&cl->bstats, &cl->rate_est,
  93. qdisc_root_sleeping_lock(sch),
  94. tca[TCA_RATE]);
  95. sch_tree_lock(sch);
  96. qdisc_class_hash_insert(&q->clhash, &cl->common);
  97. sch_tree_unlock(sch);
  98. qdisc_class_hash_grow(sch, &q->clhash);
  99. *arg = (unsigned long)cl;
  100. return 0;
  101. }
  102. static void drr_destroy_class(struct Qdisc *sch, struct drr_class *cl)
  103. {
  104. gen_kill_estimator(&cl->bstats, &cl->rate_est);
  105. qdisc_destroy(cl->qdisc);
  106. kfree(cl);
  107. }
  108. static int drr_delete_class(struct Qdisc *sch, unsigned long arg)
  109. {
  110. struct drr_sched *q = qdisc_priv(sch);
  111. struct drr_class *cl = (struct drr_class *)arg;
  112. if (cl->filter_cnt > 0)
  113. return -EBUSY;
  114. sch_tree_lock(sch);
  115. drr_purge_queue(cl);
  116. qdisc_class_hash_remove(&q->clhash, &cl->common);
  117. if (--cl->refcnt == 0)
  118. drr_destroy_class(sch, cl);
  119. sch_tree_unlock(sch);
  120. return 0;
  121. }
  122. static unsigned long drr_get_class(struct Qdisc *sch, u32 classid)
  123. {
  124. struct drr_class *cl = drr_find_class(sch, classid);
  125. if (cl != NULL)
  126. cl->refcnt++;
  127. return (unsigned long)cl;
  128. }
  129. static void drr_put_class(struct Qdisc *sch, unsigned long arg)
  130. {
  131. struct drr_class *cl = (struct drr_class *)arg;
  132. if (--cl->refcnt == 0)
  133. drr_destroy_class(sch, cl);
  134. }
  135. static struct tcf_proto **drr_tcf_chain(struct Qdisc *sch, unsigned long cl)
  136. {
  137. struct drr_sched *q = qdisc_priv(sch);
  138. if (cl)
  139. return NULL;
  140. return &q->filter_list;
  141. }
  142. static unsigned long drr_bind_tcf(struct Qdisc *sch, unsigned long parent,
  143. u32 classid)
  144. {
  145. struct drr_class *cl = drr_find_class(sch, classid);
  146. if (cl != NULL)
  147. cl->filter_cnt++;
  148. return (unsigned long)cl;
  149. }
  150. static void drr_unbind_tcf(struct Qdisc *sch, unsigned long arg)
  151. {
  152. struct drr_class *cl = (struct drr_class *)arg;
  153. cl->filter_cnt--;
  154. }
  155. static int drr_graft_class(struct Qdisc *sch, unsigned long arg,
  156. struct Qdisc *new, struct Qdisc **old)
  157. {
  158. struct drr_class *cl = (struct drr_class *)arg;
  159. if (new == NULL) {
  160. new = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
  161. &pfifo_qdisc_ops, cl->common.classid);
  162. if (new == NULL)
  163. new = &noop_qdisc;
  164. }
  165. sch_tree_lock(sch);
  166. drr_purge_queue(cl);
  167. *old = cl->qdisc;
  168. cl->qdisc = new;
  169. sch_tree_unlock(sch);
  170. return 0;
  171. }
  172. static struct Qdisc *drr_class_leaf(struct Qdisc *sch, unsigned long arg)
  173. {
  174. struct drr_class *cl = (struct drr_class *)arg;
  175. return cl->qdisc;
  176. }
  177. static void drr_qlen_notify(struct Qdisc *csh, unsigned long arg)
  178. {
  179. struct drr_class *cl = (struct drr_class *)arg;
  180. if (cl->qdisc->q.qlen == 0)
  181. list_del(&cl->alist);
  182. }
  183. static int drr_dump_class(struct Qdisc *sch, unsigned long arg,
  184. struct sk_buff *skb, struct tcmsg *tcm)
  185. {
  186. struct drr_class *cl = (struct drr_class *)arg;
  187. struct nlattr *nest;
  188. tcm->tcm_parent = TC_H_ROOT;
  189. tcm->tcm_handle = cl->common.classid;
  190. tcm->tcm_info = cl->qdisc->handle;
  191. nest = nla_nest_start(skb, TCA_OPTIONS);
  192. if (nest == NULL)
  193. goto nla_put_failure;
  194. NLA_PUT_U32(skb, TCA_DRR_QUANTUM, cl->quantum);
  195. return nla_nest_end(skb, nest);
  196. nla_put_failure:
  197. nla_nest_cancel(skb, nest);
  198. return -EMSGSIZE;
  199. }
  200. static int drr_dump_class_stats(struct Qdisc *sch, unsigned long arg,
  201. struct gnet_dump *d)
  202. {
  203. struct drr_class *cl = (struct drr_class *)arg;
  204. struct tc_drr_stats xstats;
  205. memset(&xstats, 0, sizeof(xstats));
  206. if (cl->qdisc->q.qlen)
  207. xstats.deficit = cl->deficit;
  208. if (gnet_stats_copy_basic(d, &cl->bstats) < 0 ||
  209. gnet_stats_copy_rate_est(d, &cl->rate_est) < 0 ||
  210. gnet_stats_copy_queue(d, &cl->qdisc->qstats) < 0)
  211. return -1;
  212. return gnet_stats_copy_app(d, &xstats, sizeof(xstats));
  213. }
  214. static void drr_walk(struct Qdisc *sch, struct qdisc_walker *arg)
  215. {
  216. struct drr_sched *q = qdisc_priv(sch);
  217. struct drr_class *cl;
  218. struct hlist_node *n;
  219. unsigned int i;
  220. if (arg->stop)
  221. return;
  222. for (i = 0; i < q->clhash.hashsize; i++) {
  223. hlist_for_each_entry(cl, n, &q->clhash.hash[i], common.hnode) {
  224. if (arg->count < arg->skip) {
  225. arg->count++;
  226. continue;
  227. }
  228. if (arg->fn(sch, (unsigned long)cl, arg) < 0) {
  229. arg->stop = 1;
  230. return;
  231. }
  232. arg->count++;
  233. }
  234. }
  235. }
  236. static struct drr_class *drr_classify(struct sk_buff *skb, struct Qdisc *sch,
  237. int *qerr)
  238. {
  239. struct drr_sched *q = qdisc_priv(sch);
  240. struct drr_class *cl;
  241. struct tcf_result res;
  242. int result;
  243. if (TC_H_MAJ(skb->priority ^ sch->handle) == 0) {
  244. cl = drr_find_class(sch, skb->priority);
  245. if (cl != NULL)
  246. return cl;
  247. }
  248. *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
  249. result = tc_classify(skb, q->filter_list, &res);
  250. if (result >= 0) {
  251. #ifdef CONFIG_NET_CLS_ACT
  252. switch (result) {
  253. case TC_ACT_QUEUED:
  254. case TC_ACT_STOLEN:
  255. *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
  256. case TC_ACT_SHOT:
  257. return NULL;
  258. }
  259. #endif
  260. cl = (struct drr_class *)res.class;
  261. if (cl == NULL)
  262. cl = drr_find_class(sch, res.classid);
  263. return cl;
  264. }
  265. return NULL;
  266. }
  267. static int drr_enqueue(struct sk_buff *skb, struct Qdisc *sch)
  268. {
  269. struct drr_sched *q = qdisc_priv(sch);
  270. struct drr_class *cl;
  271. unsigned int len;
  272. int err;
  273. cl = drr_classify(skb, sch, &err);
  274. if (cl == NULL) {
  275. if (err & __NET_XMIT_BYPASS)
  276. sch->qstats.drops++;
  277. kfree_skb(skb);
  278. return err;
  279. }
  280. len = qdisc_pkt_len(skb);
  281. err = qdisc_enqueue(skb, cl->qdisc);
  282. if (unlikely(err != NET_XMIT_SUCCESS)) {
  283. if (net_xmit_drop_count(err)) {
  284. cl->qstats.drops++;
  285. sch->qstats.drops++;
  286. }
  287. return err;
  288. }
  289. if (cl->qdisc->q.qlen == 1) {
  290. list_add_tail(&cl->alist, &q->active);
  291. cl->deficit = cl->quantum;
  292. }
  293. cl->bstats.packets++;
  294. cl->bstats.bytes += len;
  295. sch->bstats.packets++;
  296. sch->bstats.bytes += len;
  297. sch->q.qlen++;
  298. return err;
  299. }
  300. static struct sk_buff *drr_dequeue(struct Qdisc *sch)
  301. {
  302. struct drr_sched *q = qdisc_priv(sch);
  303. struct drr_class *cl;
  304. struct sk_buff *skb;
  305. unsigned int len;
  306. while (!list_empty(&q->active)) {
  307. cl = list_first_entry(&q->active, struct drr_class, alist);
  308. skb = cl->qdisc->ops->peek(cl->qdisc);
  309. if (skb == NULL)
  310. goto skip;
  311. len = qdisc_pkt_len(skb);
  312. if (len <= cl->deficit) {
  313. cl->deficit -= len;
  314. skb = qdisc_dequeue_peeked(cl->qdisc);
  315. if (cl->qdisc->q.qlen == 0)
  316. list_del(&cl->alist);
  317. sch->q.qlen--;
  318. return skb;
  319. }
  320. cl->deficit += cl->quantum;
  321. skip:
  322. list_move_tail(&cl->alist, &q->active);
  323. }
  324. return NULL;
  325. }
  326. static unsigned int drr_drop(struct Qdisc *sch)
  327. {
  328. struct drr_sched *q = qdisc_priv(sch);
  329. struct drr_class *cl;
  330. unsigned int len;
  331. list_for_each_entry(cl, &q->active, alist) {
  332. if (cl->qdisc->ops->drop) {
  333. len = cl->qdisc->ops->drop(cl->qdisc);
  334. if (len > 0) {
  335. sch->q.qlen--;
  336. if (cl->qdisc->q.qlen == 0)
  337. list_del(&cl->alist);
  338. return len;
  339. }
  340. }
  341. }
  342. return 0;
  343. }
  344. static int drr_init_qdisc(struct Qdisc *sch, struct nlattr *opt)
  345. {
  346. struct drr_sched *q = qdisc_priv(sch);
  347. int err;
  348. err = qdisc_class_hash_init(&q->clhash);
  349. if (err < 0)
  350. return err;
  351. INIT_LIST_HEAD(&q->active);
  352. return 0;
  353. }
  354. static void drr_reset_qdisc(struct Qdisc *sch)
  355. {
  356. struct drr_sched *q = qdisc_priv(sch);
  357. struct drr_class *cl;
  358. struct hlist_node *n;
  359. unsigned int i;
  360. for (i = 0; i < q->clhash.hashsize; i++) {
  361. hlist_for_each_entry(cl, n, &q->clhash.hash[i], common.hnode) {
  362. if (cl->qdisc->q.qlen)
  363. list_del(&cl->alist);
  364. qdisc_reset(cl->qdisc);
  365. }
  366. }
  367. sch->q.qlen = 0;
  368. }
  369. static void drr_destroy_qdisc(struct Qdisc *sch)
  370. {
  371. struct drr_sched *q = qdisc_priv(sch);
  372. struct drr_class *cl;
  373. struct hlist_node *n, *next;
  374. unsigned int i;
  375. tcf_destroy_chain(&q->filter_list);
  376. for (i = 0; i < q->clhash.hashsize; i++) {
  377. hlist_for_each_entry_safe(cl, n, next, &q->clhash.hash[i],
  378. common.hnode)
  379. drr_destroy_class(sch, cl);
  380. }
  381. qdisc_class_hash_destroy(&q->clhash);
  382. }
  383. static const struct Qdisc_class_ops drr_class_ops = {
  384. .change = drr_change_class,
  385. .delete = drr_delete_class,
  386. .get = drr_get_class,
  387. .put = drr_put_class,
  388. .tcf_chain = drr_tcf_chain,
  389. .bind_tcf = drr_bind_tcf,
  390. .unbind_tcf = drr_unbind_tcf,
  391. .graft = drr_graft_class,
  392. .leaf = drr_class_leaf,
  393. .qlen_notify = drr_qlen_notify,
  394. .dump = drr_dump_class,
  395. .dump_stats = drr_dump_class_stats,
  396. .walk = drr_walk,
  397. };
  398. static struct Qdisc_ops drr_qdisc_ops __read_mostly = {
  399. .cl_ops = &drr_class_ops,
  400. .id = "drr",
  401. .priv_size = sizeof(struct drr_sched),
  402. .enqueue = drr_enqueue,
  403. .dequeue = drr_dequeue,
  404. .peek = qdisc_peek_dequeued,
  405. .drop = drr_drop,
  406. .init = drr_init_qdisc,
  407. .reset = drr_reset_qdisc,
  408. .destroy = drr_destroy_qdisc,
  409. .owner = THIS_MODULE,
  410. };
  411. static int __init drr_init(void)
  412. {
  413. return register_qdisc(&drr_qdisc_ops);
  414. }
  415. static void __exit drr_exit(void)
  416. {
  417. unregister_qdisc(&drr_qdisc_ops);
  418. }
  419. module_init(drr_init);
  420. module_exit(drr_exit);
  421. MODULE_LICENSE("GPL");