2 * Codel - The Controlled-Delay Active Queue Management algorithm
4 * Copyright (C) 2011-2012 Kathleen Nichols <nichols@pollere.com>
5 * Copyright (C) 2011-2012 Van Jacobson <van@pollere.com>
6 * Copyright (C) 2012 Michael D. Taht <dave.taht@bufferbloat.net>
7 * Copyright (C) 2012,2015 Eric Dumazet <edumazet@google.com>
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions, and the following disclaimer,
14 * without modification.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. The names of the authors may not be used to endorse or promote products
19 * derived from this software without specific prior written permission.
21 * Alternatively, provided that this notice is retained in full, this
22 * software may be distributed under the terms of the GNU General
23 * Public License ("GPL") version 2, in which case the provisions of the
24 * GPL apply INSTEAD OF those given above.
26 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
27 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
28 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
29 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
30 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
31 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
32 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
33 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
34 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
35 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
36 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
45 #include <sys/socket.h>
46 #include <netinet/in.h>
47 #include <arpa/inet.h>
53 static void explain(void)
55 fprintf(stderr
, "Usage: ... codel [ limit PACKETS ] [ target TIME ]\n");
56 fprintf(stderr
, " [ interval TIME ] [ ecn | noecn ]\n");
57 fprintf(stderr
, " [ ce_threshold TIME ]\n");
60 static int codel_parse_opt(struct qdisc_util
*qu
, int argc
, char **argv
,
61 struct nlmsghdr
*n
, const char *dev
)
63 unsigned int limit
= 0;
64 unsigned int target
= 0;
65 unsigned int interval
= 0;
66 unsigned int ce_threshold
= ~0U;
71 if (strcmp(*argv
, "limit") == 0) {
73 if (get_unsigned(&limit
, *argv
, 0)) {
74 fprintf(stderr
, "Illegal \"limit\"\n");
77 } else if (strcmp(*argv
, "target") == 0) {
79 if (get_time(&target
, *argv
)) {
80 fprintf(stderr
, "Illegal \"target\"\n");
83 } else if (strcmp(*argv
, "ce_threshold") == 0) {
85 if (get_time(&ce_threshold
, *argv
)) {
86 fprintf(stderr
, "Illegal \"ce_threshold\"\n");
89 } else if (strcmp(*argv
, "interval") == 0) {
91 if (get_time(&interval
, *argv
)) {
92 fprintf(stderr
, "Illegal \"interval\"\n");
95 } else if (strcmp(*argv
, "ecn") == 0) {
97 } else if (strcmp(*argv
, "noecn") == 0) {
99 } else if (strcmp(*argv
, "help") == 0) {
103 fprintf(stderr
, "What is \"%s\"?\n", *argv
);
110 tail
= addattr_nest(n
, 1024, TCA_OPTIONS
);
112 addattr_l(n
, 1024, TCA_CODEL_LIMIT
, &limit
, sizeof(limit
));
114 addattr_l(n
, 1024, TCA_CODEL_INTERVAL
, &interval
, sizeof(interval
));
116 addattr_l(n
, 1024, TCA_CODEL_TARGET
, &target
, sizeof(target
));
118 addattr_l(n
, 1024, TCA_CODEL_ECN
, &ecn
, sizeof(ecn
));
119 if (ce_threshold
!= ~0U)
120 addattr_l(n
, 1024, TCA_CODEL_CE_THRESHOLD
,
121 &ce_threshold
, sizeof(ce_threshold
));
123 addattr_nest_end(n
, tail
);
127 static int codel_print_opt(struct qdisc_util
*qu
, FILE *f
, struct rtattr
*opt
)
129 struct rtattr
*tb
[TCA_CODEL_MAX
+ 1];
131 unsigned int interval
;
134 unsigned int ce_threshold
;
141 parse_rtattr_nested(tb
, TCA_CODEL_MAX
, opt
);
143 if (tb
[TCA_CODEL_LIMIT
] &&
144 RTA_PAYLOAD(tb
[TCA_CODEL_LIMIT
]) >= sizeof(__u32
)) {
145 limit
= rta_getattr_u32(tb
[TCA_CODEL_LIMIT
]);
146 fprintf(f
, "limit %up ", limit
);
148 if (tb
[TCA_CODEL_TARGET
] &&
149 RTA_PAYLOAD(tb
[TCA_CODEL_TARGET
]) >= sizeof(__u32
)) {
150 target
= rta_getattr_u32(tb
[TCA_CODEL_TARGET
]);
151 fprintf(f
, "target %s ", sprint_time(target
, b1
));
153 if (tb
[TCA_CODEL_CE_THRESHOLD
] &&
154 RTA_PAYLOAD(tb
[TCA_CODEL_CE_THRESHOLD
]) >= sizeof(__u32
)) {
155 ce_threshold
= rta_getattr_u32(tb
[TCA_CODEL_CE_THRESHOLD
]);
156 fprintf(f
, "ce_threshold %s ", sprint_time(ce_threshold
, b1
));
158 if (tb
[TCA_CODEL_INTERVAL
] &&
159 RTA_PAYLOAD(tb
[TCA_CODEL_INTERVAL
]) >= sizeof(__u32
)) {
160 interval
= rta_getattr_u32(tb
[TCA_CODEL_INTERVAL
]);
161 fprintf(f
, "interval %s ", sprint_time(interval
, b1
));
163 if (tb
[TCA_CODEL_ECN
] &&
164 RTA_PAYLOAD(tb
[TCA_CODEL_ECN
]) >= sizeof(__u32
)) {
165 ecn
= rta_getattr_u32(tb
[TCA_CODEL_ECN
]);
173 static int codel_print_xstats(struct qdisc_util
*qu
, FILE *f
,
174 struct rtattr
*xstats
)
176 struct tc_codel_xstats _st
= {}, *st
;
183 st
= RTA_DATA(xstats
);
184 if (RTA_PAYLOAD(xstats
) < sizeof(*st
)) {
185 memcpy(&_st
, st
, RTA_PAYLOAD(xstats
));
189 fprintf(f
, " count %u lastcount %u ldelay %s",
190 st
->count
, st
->lastcount
, sprint_time(st
->ldelay
, b1
));
192 fprintf(f
, " dropping");
193 if (st
->drop_next
< 0)
194 fprintf(f
, " drop_next -%s", sprint_time(-st
->drop_next
, b1
));
196 fprintf(f
, " drop_next %s", sprint_time(st
->drop_next
, b1
));
197 fprintf(f
, "\n maxpacket %u ecn_mark %u drop_overlimit %u",
198 st
->maxpacket
, st
->ecn_mark
, st
->drop_overlimit
);
200 fprintf(f
, " ce_mark %u", st
->ce_mark
);
205 struct qdisc_util codel_qdisc_util
= {
207 .parse_qopt
= codel_parse_opt
,
208 .print_qopt
= codel_print_opt
,
209 .print_xstats
= codel_print_xstats
,