sch_drr.c 11 KB

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