sch_drr.c 11 KB

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