4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
9 * Authors: Martin Devera, devik@cdi.cz
18 #include <sys/socket.h>
19 #include <netinet/in.h>
20 #include <arpa/inet.h>
26 #define HTB_TC_VER 0x30003
27 #if HTB_TC_VER >> 16 != TC_HTB_PROTOVER
28 #error "Different kernel and TC HTB versions"
31 static void explain(void)
33 fprintf(stderr, "Usage: ... qdisc add ... htb [default N] [r2q N]\n"
34 " default minor id of class to which unclassified packets are sent {0}\n"
35 " r2q DRR quantums are computed as rate in Bps/r2q {10}\n"
36 " debug string of 16 numbers each 0-3 {0}\n\n"
37 "... class add ... htb rate R1 [burst B1] [mpu B] [overhead O]\n"
38 " [prio P] [slot S] [pslot PS]\n"
39 " [ceil R2] [cburst B2] [mtu MTU] [quantum Q]\n"
40 " rate rate allocated to this class (class can still borrow)\n"
41 " burst max bytes burst which can be accumulated during idle period {computed}\n"
42 " mpu minimum packet size used in rate computations\n"
43 " overhead per-packet size overhead used in rate computations\n"
44 " linklay adapting to a linklayer e.g. atm\n"
45 " ceil definite upper class rate (no borrows) {rate}\n"
46 " cburst burst but for ceil {computed}\n"
47 " mtu max packet size we create rate map for {1600}\n"
48 " prio priority of leaf; lower are served first {0}\n"
49 " quantum how much bytes to serve from leaf at once {use r2q}\n"
50 "\nTC HTB version %d.%d\n",HTB_TC_VER>>16,HTB_TC_VER&0xffff
54 static void explain1(char *arg)
56 fprintf(stderr, "Illegal \"%s\"\n", arg);
61 static int htb_parse_opt(struct qdisc_util *qu, int argc, char **argv, struct nlmsghdr *n)
63 struct tc_htb_glob opt;
66 memset(&opt,0,sizeof(opt));
67 opt.rate2quantum = 10;
71 if (matches(*argv, "r2q") == 0) {
73 if (get_u32(&opt.rate2quantum, *argv, 10)) {
74 explain1("r2q"); return -1;
76 } else if (matches(*argv, "default") == 0) {
78 if (get_u32(&opt.defcls, *argv, 16)) {
79 explain1("default"); return -1;
81 } else if (matches(*argv, "debug") == 0) {
82 NEXT_ARG(); p = *argv;
83 for (i=0; i<16; i++,p++) {
84 if (*p<'0' || *p>'3') break;
85 opt.debug |= (*p-'0')<<(2*i);
88 fprintf(stderr, "What is \"%s\"?\n", *argv);
95 addattr_l(n, 1024, TCA_OPTIONS, NULL, 0);
96 addattr_l(n, 2024, TCA_HTB_INIT, &opt, NLMSG_ALIGN(sizeof(opt)));
97 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
101 static int htb_parse_class_opt(struct qdisc_util *qu, int argc, char **argv, struct nlmsghdr *n)
104 struct tc_htb_opt opt;
105 __u32 rtab[256],ctab[256];
106 unsigned buffer=0,cbuffer=0;
107 int cell_log=-1,ccell_log = -1;
109 unsigned short mpu = 0;
110 unsigned short overhead = 0;
111 unsigned int linklayer = LINKLAYER_ETHERNET; /* Assume ethernet */
114 memset(&opt, 0, sizeof(opt)); mtu = 1600; /* eth packet len */
117 if (matches(*argv, "prio") == 0) {
119 if (get_u32(&opt.prio, *argv, 10)) {
120 explain1("prio"); return -1;
123 } else if (matches(*argv, "mtu") == 0) {
125 if (get_u32(&mtu, *argv, 10)) {
126 explain1("mtu"); return -1;
128 } else if (matches(*argv, "mpu") == 0) {
130 if (get_u16(&mpu, *argv, 10)) {
131 explain1("mpu"); return -1;
133 } else if (matches(*argv, "overhead") == 0) {
135 if (get_u16(&overhead, *argv, 10)) {
136 explain1("overhead"); return -1;
138 } else if (matches(*argv, "linklayer") == 0) {
140 if (get_linklayer(&linklayer, *argv)) {
141 explain1("linklayer"); return -1;
143 } else if (matches(*argv, "quantum") == 0) {
145 if (get_u32(&opt.quantum, *argv, 10)) {
146 explain1("quantum"); return -1;
148 } else if (matches(*argv, "burst") == 0 ||
149 strcmp(*argv, "buffer") == 0 ||
150 strcmp(*argv, "maxburst") == 0) {
152 if (get_size_and_cell(&buffer, &cell_log, *argv) < 0) {
157 } else if (matches(*argv, "cburst") == 0 ||
158 strcmp(*argv, "cbuffer") == 0 ||
159 strcmp(*argv, "cmaxburst") == 0) {
161 if (get_size_and_cell(&cbuffer, &ccell_log, *argv) < 0) {
166 } else if (strcmp(*argv, "ceil") == 0) {
169 fprintf(stderr, "Double \"ceil\" spec\n");
172 if (get_rate(&opt.ceil.rate, *argv)) {
177 } else if (strcmp(*argv, "rate") == 0) {
180 fprintf(stderr, "Double \"rate\" spec\n");
183 if (get_rate(&opt.rate.rate, *argv)) {
188 } else if (strcmp(*argv, "help") == 0) {
192 fprintf(stderr, "What is \"%s\"?\n", *argv);
202 if (opt.rate.rate == 0) {
203 fprintf(stderr, "\"rate\" is required.\n");
206 /* if ceil params are missing, use the same as rate */
207 if (!opt.ceil.rate) opt.ceil = opt.rate;
209 /* compute minimal allowed burst from rate; mtu is added here to make
210 sute that buffer is larger than mtu and to have some safeguard space */
211 if (!buffer) buffer = opt.rate.rate / get_hz() + mtu;
212 if (!cbuffer) cbuffer = opt.ceil.rate / get_hz() + mtu;
214 opt.ceil.overhead = overhead;
215 opt.rate.overhead = overhead;
220 if (tc_calc_rtable(&opt.rate, rtab, cell_log, mtu, linklayer) < 0) {
221 fprintf(stderr, "htb: failed to calculate rate table.\n");
224 opt.buffer = tc_calc_xmittime(opt.rate.rate, buffer);
226 if (tc_calc_rtable(&opt.ceil, ctab, ccell_log, mtu, linklayer) < 0) {
227 fprintf(stderr, "htb: failed to calculate ceil rate table.\n");
230 opt.cbuffer = tc_calc_xmittime(opt.ceil.rate, cbuffer);
232 tail = NLMSG_TAIL(n);
233 addattr_l(n, 1024, TCA_OPTIONS, NULL, 0);
234 addattr_l(n, 2024, TCA_HTB_PARMS, &opt, sizeof(opt));
235 addattr_l(n, 3024, TCA_HTB_RTAB, rtab, 1024);
236 addattr_l(n, 4024, TCA_HTB_CTAB, ctab, 1024);
237 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
241 static int htb_print_opt(struct qdisc_util *qu, FILE *f, struct rtattr *opt)
243 struct rtattr *tb[TCA_HTB_RTAB+1];
244 struct tc_htb_opt *hopt;
245 struct tc_htb_glob *gopt;
246 double buffer,cbuffer;
254 parse_rtattr_nested(tb, TCA_HTB_RTAB, opt);
256 if (tb[TCA_HTB_PARMS]) {
258 hopt = RTA_DATA(tb[TCA_HTB_PARMS]);
259 if (RTA_PAYLOAD(tb[TCA_HTB_PARMS]) < sizeof(*hopt)) return -1;
262 fprintf(f, "prio %d ", (int)hopt->prio);
264 fprintf(f, "quantum %d ", (int)hopt->quantum);
266 fprintf(f, "rate %s ", sprint_rate(hopt->rate.rate, b1));
267 buffer = tc_calc_xmitsize(hopt->rate.rate, hopt->buffer);
268 fprintf(f, "ceil %s ", sprint_rate(hopt->ceil.rate, b1));
269 cbuffer = tc_calc_xmitsize(hopt->ceil.rate, hopt->cbuffer);
271 fprintf(f, "burst %s/%u mpu %s overhead %s ",
272 sprint_size(buffer, b1),
273 1<<hopt->rate.cell_log,
274 sprint_size(hopt->rate.mpu&0xFF, b2),
275 sprint_size((hopt->rate.mpu>>8)&0xFF, b3));
276 fprintf(f, "cburst %s/%u mpu %s overhead %s ",
277 sprint_size(cbuffer, b1),
278 1<<hopt->ceil.cell_log,
279 sprint_size(hopt->ceil.mpu&0xFF, b2),
280 sprint_size((hopt->ceil.mpu>>8)&0xFF, b3));
281 fprintf(f, "level %d ", (int)hopt->level);
283 fprintf(f, "burst %s ", sprint_size(buffer, b1));
284 fprintf(f, "cburst %s ", sprint_size(cbuffer, b1));
287 fprintf(f, "buffer [%08x] cbuffer [%08x] ",
288 hopt->buffer,hopt->cbuffer);
290 if (tb[TCA_HTB_INIT]) {
291 gopt = RTA_DATA(tb[TCA_HTB_INIT]);
292 if (RTA_PAYLOAD(tb[TCA_HTB_INIT]) < sizeof(*gopt)) return -1;
294 fprintf(f, "r2q %d default %x direct_packets_stat %u",
295 gopt->rate2quantum,gopt->defcls,gopt->direct_pkts);
297 fprintf(f," ver %d.%d",gopt->version >> 16,gopt->version & 0xffff);
302 static int htb_print_xstats(struct qdisc_util *qu, FILE *f, struct rtattr *xstats)
304 struct tc_htb_xstats *st;
308 if (RTA_PAYLOAD(xstats) < sizeof(*st))
311 st = RTA_DATA(xstats);
312 fprintf(f, " lended: %u borrowed: %u giants: %u\n",
313 st->lends,st->borrows,st->giants);
314 fprintf(f, " tokens: %d ctokens: %d\n", st->tokens,st->ctokens);
318 struct qdisc_util htb_qdisc_util = {
320 .parse_qopt = htb_parse_opt,
321 .print_qopt = htb_print_opt,
322 .print_xstats = htb_print_xstats,
323 .parse_copt = htb_parse_class_opt,
324 .print_copt = htb_print_opt,
327 /* for testing of old one */
328 struct qdisc_util htb2_qdisc_util = {
330 .parse_qopt = htb_parse_opt,
331 .print_qopt = htb_print_opt,
332 .print_xstats = htb_print_xstats,
333 .parse_copt = htb_parse_class_opt,
334 .print_copt = htb_print_opt,