sch_codel.c 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282
  1. // SPDX-License-Identifier: GPL-2.0 OR BSD-3-Clause
  2. /*
  3. * Codel - The Controlled-Delay Active Queue Management algorithm
  4. *
  5. * Copyright (C) 2011-2012 Kathleen Nichols <nichols@pollere.com>
  6. * Copyright (C) 2011-2012 Van Jacobson <van@pollere.net>
  7. *
  8. * Implemented on linux by :
  9. * Copyright (C) 2012 Michael D. Taht <dave.taht@bufferbloat.net>
  10. * Copyright (C) 2012,2015 Eric Dumazet <edumazet@google.com>
  11. */
  12. #include <linux/module.h>
  13. #include <linux/slab.h>
  14. #include <linux/types.h>
  15. #include <linux/kernel.h>
  16. #include <linux/errno.h>
  17. #include <linux/skbuff.h>
  18. #include <linux/prefetch.h>
  19. #include <net/pkt_sched.h>
  20. #include <net/codel.h>
  21. #include <net/codel_impl.h>
  22. #include <net/codel_qdisc.h>
  23. #define DEFAULT_CODEL_LIMIT 1000
  24. struct codel_sched_data {
  25. struct codel_params params;
  26. struct codel_vars vars;
  27. struct codel_stats stats;
  28. u32 drop_overlimit;
  29. };
  30. /* This is the specific function called from codel_dequeue()
  31. * to dequeue a packet from queue. Note: backlog is handled in
  32. * codel, we dont need to reduce it here.
  33. */
  34. static struct sk_buff *dequeue_func(struct codel_vars *vars, void *ctx)
  35. {
  36. struct Qdisc *sch = ctx;
  37. struct sk_buff *skb = __qdisc_dequeue_head(&sch->q);
  38. if (skb) {
  39. sch->qstats.backlog -= qdisc_pkt_len(skb);
  40. prefetch(&skb->end); /* we'll need skb_shinfo() */
  41. }
  42. return skb;
  43. }
  44. static void drop_func(struct sk_buff *skb, void *ctx)
  45. {
  46. struct Qdisc *sch = ctx;
  47. kfree_skb(skb);
  48. qdisc_qstats_drop(sch);
  49. }
  50. static struct sk_buff *codel_qdisc_dequeue(struct Qdisc *sch)
  51. {
  52. struct codel_sched_data *q = qdisc_priv(sch);
  53. struct sk_buff *skb;
  54. skb = codel_dequeue(sch, &sch->qstats.backlog, &q->params, &q->vars,
  55. &q->stats, qdisc_pkt_len, codel_get_enqueue_time,
  56. drop_func, dequeue_func);
  57. if (q->stats.drop_count) {
  58. qdisc_tree_reduce_backlog(sch, q->stats.drop_count, q->stats.drop_len);
  59. q->stats.drop_count = 0;
  60. q->stats.drop_len = 0;
  61. }
  62. if (skb)
  63. qdisc_bstats_update(sch, skb);
  64. return skb;
  65. }
  66. static int codel_qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch,
  67. struct sk_buff **to_free)
  68. {
  69. struct codel_sched_data *q;
  70. if (likely(qdisc_qlen(sch) < sch->limit)) {
  71. codel_set_enqueue_time(skb);
  72. return qdisc_enqueue_tail(skb, sch);
  73. }
  74. q = qdisc_priv(sch);
  75. q->drop_overlimit++;
  76. return qdisc_drop(skb, sch, to_free);
  77. }
  78. static const struct nla_policy codel_policy[TCA_CODEL_MAX + 1] = {
  79. [TCA_CODEL_TARGET] = { .type = NLA_U32 },
  80. [TCA_CODEL_LIMIT] = { .type = NLA_U32 },
  81. [TCA_CODEL_INTERVAL] = { .type = NLA_U32 },
  82. [TCA_CODEL_ECN] = { .type = NLA_U32 },
  83. [TCA_CODEL_CE_THRESHOLD]= { .type = NLA_U32 },
  84. };
  85. static int codel_change(struct Qdisc *sch, struct nlattr *opt,
  86. struct netlink_ext_ack *extack)
  87. {
  88. struct codel_sched_data *q = qdisc_priv(sch);
  89. struct nlattr *tb[TCA_CODEL_MAX + 1];
  90. unsigned int qlen, dropped = 0;
  91. int err;
  92. err = nla_parse_nested_deprecated(tb, TCA_CODEL_MAX, opt,
  93. codel_policy, NULL);
  94. if (err < 0)
  95. return err;
  96. sch_tree_lock(sch);
  97. if (tb[TCA_CODEL_TARGET]) {
  98. u32 target = nla_get_u32(tb[TCA_CODEL_TARGET]);
  99. WRITE_ONCE(q->params.target,
  100. ((u64)target * NSEC_PER_USEC) >> CODEL_SHIFT);
  101. }
  102. if (tb[TCA_CODEL_CE_THRESHOLD]) {
  103. u64 val = nla_get_u32(tb[TCA_CODEL_CE_THRESHOLD]);
  104. WRITE_ONCE(q->params.ce_threshold,
  105. (val * NSEC_PER_USEC) >> CODEL_SHIFT);
  106. }
  107. if (tb[TCA_CODEL_INTERVAL]) {
  108. u32 interval = nla_get_u32(tb[TCA_CODEL_INTERVAL]);
  109. WRITE_ONCE(q->params.interval,
  110. ((u64)interval * NSEC_PER_USEC) >> CODEL_SHIFT);
  111. }
  112. if (tb[TCA_CODEL_LIMIT])
  113. WRITE_ONCE(sch->limit,
  114. nla_get_u32(tb[TCA_CODEL_LIMIT]));
  115. if (tb[TCA_CODEL_ECN])
  116. WRITE_ONCE(q->params.ecn,
  117. !!nla_get_u32(tb[TCA_CODEL_ECN]));
  118. qlen = sch->q.qlen;
  119. while (sch->q.qlen > sch->limit) {
  120. struct sk_buff *skb = qdisc_dequeue_internal(sch, true);
  121. dropped += qdisc_pkt_len(skb);
  122. qdisc_qstats_backlog_dec(sch, skb);
  123. rtnl_qdisc_drop(skb, sch);
  124. }
  125. qdisc_tree_reduce_backlog(sch, qlen - sch->q.qlen, dropped);
  126. sch_tree_unlock(sch);
  127. return 0;
  128. }
  129. static int codel_init(struct Qdisc *sch, struct nlattr *opt,
  130. struct netlink_ext_ack *extack)
  131. {
  132. struct codel_sched_data *q = qdisc_priv(sch);
  133. sch->limit = DEFAULT_CODEL_LIMIT;
  134. codel_params_init(&q->params);
  135. codel_vars_init(&q->vars);
  136. codel_stats_init(&q->stats);
  137. q->params.mtu = psched_mtu(qdisc_dev(sch));
  138. if (opt) {
  139. int err = codel_change(sch, opt, extack);
  140. if (err)
  141. return err;
  142. }
  143. if (sch->limit >= 1)
  144. sch->flags |= TCQ_F_CAN_BYPASS;
  145. else
  146. sch->flags &= ~TCQ_F_CAN_BYPASS;
  147. return 0;
  148. }
  149. static int codel_dump(struct Qdisc *sch, struct sk_buff *skb)
  150. {
  151. struct codel_sched_data *q = qdisc_priv(sch);
  152. codel_time_t ce_threshold;
  153. struct nlattr *opts;
  154. opts = nla_nest_start_noflag(skb, TCA_OPTIONS);
  155. if (opts == NULL)
  156. goto nla_put_failure;
  157. if (nla_put_u32(skb, TCA_CODEL_TARGET,
  158. codel_time_to_us(READ_ONCE(q->params.target))) ||
  159. nla_put_u32(skb, TCA_CODEL_LIMIT,
  160. READ_ONCE(sch->limit)) ||
  161. nla_put_u32(skb, TCA_CODEL_INTERVAL,
  162. codel_time_to_us(READ_ONCE(q->params.interval))) ||
  163. nla_put_u32(skb, TCA_CODEL_ECN,
  164. READ_ONCE(q->params.ecn)))
  165. goto nla_put_failure;
  166. ce_threshold = READ_ONCE(q->params.ce_threshold);
  167. if (ce_threshold != CODEL_DISABLED_THRESHOLD &&
  168. nla_put_u32(skb, TCA_CODEL_CE_THRESHOLD,
  169. codel_time_to_us(ce_threshold)))
  170. goto nla_put_failure;
  171. return nla_nest_end(skb, opts);
  172. nla_put_failure:
  173. nla_nest_cancel(skb, opts);
  174. return -1;
  175. }
  176. static int codel_dump_stats(struct Qdisc *sch, struct gnet_dump *d)
  177. {
  178. const struct codel_sched_data *q = qdisc_priv(sch);
  179. struct tc_codel_xstats st = {
  180. .maxpacket = q->stats.maxpacket,
  181. .count = q->vars.count,
  182. .lastcount = q->vars.lastcount,
  183. .drop_overlimit = q->drop_overlimit,
  184. .ldelay = codel_time_to_us(q->vars.ldelay),
  185. .dropping = q->vars.dropping,
  186. .ecn_mark = q->stats.ecn_mark,
  187. .ce_mark = q->stats.ce_mark,
  188. };
  189. if (q->vars.dropping) {
  190. codel_tdiff_t delta = q->vars.drop_next - codel_get_time();
  191. if (delta >= 0)
  192. st.drop_next = codel_time_to_us(delta);
  193. else
  194. st.drop_next = -codel_time_to_us(-delta);
  195. }
  196. return gnet_stats_copy_app(d, &st, sizeof(st));
  197. }
  198. static void codel_reset(struct Qdisc *sch)
  199. {
  200. struct codel_sched_data *q = qdisc_priv(sch);
  201. qdisc_reset_queue(sch);
  202. codel_vars_init(&q->vars);
  203. }
  204. static struct Qdisc_ops codel_qdisc_ops __read_mostly = {
  205. .id = "codel",
  206. .priv_size = sizeof(struct codel_sched_data),
  207. .enqueue = codel_qdisc_enqueue,
  208. .dequeue = codel_qdisc_dequeue,
  209. .peek = qdisc_peek_dequeued,
  210. .init = codel_init,
  211. .reset = codel_reset,
  212. .change = codel_change,
  213. .dump = codel_dump,
  214. .dump_stats = codel_dump_stats,
  215. .owner = THIS_MODULE,
  216. };
  217. MODULE_ALIAS_NET_SCH("codel");
  218. static int __init codel_module_init(void)
  219. {
  220. return register_qdisc(&codel_qdisc_ops);
  221. }
  222. static void __exit codel_module_exit(void)
  223. {
  224. unregister_qdisc(&codel_qdisc_ops);
  225. }
  226. module_init(codel_module_init)
  227. module_exit(codel_module_exit)
  228. MODULE_DESCRIPTION("Controlled Delay queue discipline");
  229. MODULE_AUTHOR("Dave Taht");
  230. MODULE_AUTHOR("Eric Dumazet");
  231. MODULE_LICENSE("Dual BSD/GPL");