sch_drr.c 11 KB

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