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: Stephen Hemminger <shemminger@linux-foundation.org>
20 #include <sys/socket.h>
21 #include <netinet/in.h>
22 #include <arpa/inet.h>
28 #include "tc_common.h"
30 static void explain(void)
33 "Usage: ... netem [ limit PACKETS ] \n" \
34 " [ delay TIME [ JITTER [CORRELATION]]]\n" \
35 " [ distribution {uniform|normal|pareto|paretonormal} ]\n" \
36 " [ corrupt PERCENT [CORRELATION]] \n" \
37 " [ duplicate PERCENT [CORRELATION]]\n" \
38 " [ loss random PERCENT [CORRELATION]]\n" \
39 " [ loss state P13 [P31 [P32 [P23 P14]]]\n" \
40 " [ loss gemodel PERCENT [R [1-H [1-K]]]\n" \
41 " [ reorder PRECENT [CORRELATION] [ gap DISTANCE ]]\n" \
42 " [ rate RATE [PACKETOVERHEAD] [CELLSIZE] [CELLOVERHEAD]]\n");
45 static void explain1(const char *arg)
47 fprintf(stderr, "Illegal \"%s\"\n", arg);
50 /* Upper bound on size of distribution
51 * really (TCA_BUF_MAX - other headers) / sizeof (__s16)
53 #define MAX_DIST (16*1024)
55 static const double max_percent_value = 0xffffffff;
57 /* scaled value used to percent of maximum. */
58 static void set_percent(__u32 *percent, double per)
60 *percent = (unsigned) rint(per * max_percent_value);
64 /* Parse either a fraction '.3' or percent '30%
65 * return: 0 = ok, -1 = error, 1 = out of range
67 static int parse_percent(double *val, const char *str)
71 *val = strtod(str, &p) / 100.;
72 if (*p && strcmp(p, "%") )
78 static int get_percent(__u32 *percent, const char *str)
82 if (parse_percent(&per, str))
85 set_percent(percent, per);
89 void print_percent(char *buf, int len, __u32 per)
91 snprintf(buf, len, "%g%%", 100. * (double) per / max_percent_value);
94 char * sprint_percent(__u32 per, char *buf)
96 print_percent(buf, SPRINT_BSIZE-1, per);
101 * Simplistic file parser for distrbution data.
106 static int get_distribution(const char *type, __s16 *data, int maxdata)
115 snprintf(name, sizeof(name), "%s/%s.dist", get_tc_lib(), type);
116 if ((f = fopen(name, "r")) == NULL) {
117 fprintf(stderr, "No distribution data for %s (%s: %s)\n",
118 type, name, strerror(errno));
123 while (getline(&line, &len, f) != -1) {
125 if (*line == '\n' || *line == '#')
128 for (p = line; ; p = endp) {
129 x = strtol(p, &endp, 0);
134 fprintf(stderr, "%s: too much data\n",
148 #define NEXT_IS_NUMBER() (NEXT_ARG_OK() && isdigit(argv[1][0]))
150 /* Adjust for the fact that psched_ticks aren't always usecs
151 (based on kernel PSCHED_CLOCK configuration */
152 static int get_ticks(__u32 *ticks, const char *str)
156 if(get_time(&t, str))
159 if (tc_core_time2big(t)) {
160 fprintf(stderr, "Illegal %u time (too large)\n", t);
164 *ticks = tc_core_time2tick(t);
168 static int netem_parse_opt(struct qdisc_util *qu, int argc, char **argv,
173 struct tc_netem_qopt opt = { .limit = 1000 };
174 struct tc_netem_corr cor;
175 struct tc_netem_reorder reorder;
176 struct tc_netem_corrupt corrupt;
177 struct tc_netem_gimodel gimodel;
178 struct tc_netem_gemodel gemodel;
179 struct tc_netem_rate rate;
180 __s16 *dist_data = NULL;
181 __u16 loss_type = NETEM_LOSS_UNSPEC;
182 int present[__TCA_NETEM_MAX];
184 memset(&cor, 0, sizeof(cor));
185 memset(&reorder, 0, sizeof(reorder));
186 memset(&corrupt, 0, sizeof(corrupt));
187 memset(&rate, 0, sizeof(rate));
188 memset(present, 0, sizeof(present));
190 for( ; argc > 0; --argc, ++argv) {
191 if (matches(*argv, "limit") == 0) {
193 if (get_size(&opt.limit, *argv)) {
197 } else if (matches(*argv, "latency") == 0 ||
198 matches(*argv, "delay") == 0) {
200 if (get_ticks(&opt.latency, *argv)) {
205 if (NEXT_IS_NUMBER()) {
207 if (get_ticks(&opt.jitter, *argv)) {
212 if (NEXT_IS_NUMBER()) {
214 ++present[TCA_NETEM_CORR];
215 if (get_percent(&cor.delay_corr, *argv)) {
221 } else if (matches(*argv, "loss") == 0 ||
222 matches(*argv, "drop") == 0) {
223 if (opt.loss > 0 || loss_type != NETEM_LOSS_UNSPEC) {
224 explain1("duplicate loss argument\n");
229 /* Old (deprecated) random loss model syntax */
230 if (isdigit(argv[0][0]))
231 goto random_loss_model;
233 if (!strcmp(*argv, "random")) {
236 if (get_percent(&opt.loss, *argv)) {
237 explain1("loss percent");
240 if (NEXT_IS_NUMBER()) {
242 ++present[TCA_NETEM_CORR];
243 if (get_percent(&cor.loss_corr, *argv)) {
244 explain1("loss correllation");
248 } else if (!strcmp(*argv, "state")) {
252 if (parse_percent(&p13, *argv)) {
253 explain1("loss p13");
258 set_percent(&gimodel.p13, p13);
259 set_percent(&gimodel.p31, 1. - p13);
260 set_percent(&gimodel.p32, 0);
261 set_percent(&gimodel.p23, 1.);
262 loss_type = NETEM_LOSS_GI;
264 if (!NEXT_IS_NUMBER())
267 if (get_percent(&gimodel.p31, *argv)) {
268 explain1("loss p31");
272 if (!NEXT_IS_NUMBER())
275 if (get_percent(&gimodel.p32, *argv)) {
276 explain1("loss p32");
280 if (!NEXT_IS_NUMBER())
283 if (get_percent(&gimodel.p23, *argv)) {
284 explain1("loss p23");
288 } else if (!strcmp(*argv, "gemodel")) {
290 if (get_percent(&gemodel.p, *argv)) {
291 explain1("loss gemodel p");
296 set_percent(&gemodel.r, 1.);
297 set_percent(&gemodel.h, 0);
298 set_percent(&gemodel.k1, 1.);
299 loss_type = NETEM_LOSS_GE;
301 if (!NEXT_IS_NUMBER())
304 if (get_percent(&gemodel.r, *argv)) {
305 explain1("loss gemodel r");
309 if (!NEXT_IS_NUMBER())
312 if (get_percent(&gemodel.h, *argv)) {
313 explain1("loss gemodel h");
317 if (!NEXT_IS_NUMBER())
320 if (get_percent(&gemodel.k1, *argv)) {
321 explain1("loss gemodel k");
325 fprintf(stderr, "Unknown loss parameter: %s\n",
329 } else if (matches(*argv, "reorder") == 0) {
331 present[TCA_NETEM_REORDER] = 1;
332 if (get_percent(&reorder.probability, *argv)) {
336 if (NEXT_IS_NUMBER()) {
338 ++present[TCA_NETEM_CORR];
339 if (get_percent(&reorder.correlation, *argv)) {
344 } else if (matches(*argv, "corrupt") == 0) {
346 present[TCA_NETEM_CORRUPT] = 1;
347 if (get_percent(&corrupt.probability, *argv)) {
351 if (NEXT_IS_NUMBER()) {
353 ++present[TCA_NETEM_CORR];
354 if (get_percent(&corrupt.correlation, *argv)) {
359 } else if (matches(*argv, "gap") == 0) {
361 if (get_u32(&opt.gap, *argv, 0)) {
365 } else if (matches(*argv, "duplicate") == 0) {
367 if (get_percent(&opt.duplicate, *argv)) {
368 explain1("duplicate");
371 if (NEXT_IS_NUMBER()) {
373 if (get_percent(&cor.dup_corr, *argv)) {
374 explain1("duplicate");
378 } else if (matches(*argv, "distribution") == 0) {
380 dist_data = calloc(sizeof(dist_data[0]), MAX_DIST);
381 dist_size = get_distribution(*argv, dist_data, MAX_DIST);
382 if (dist_size <= 0) {
386 } else if (matches(*argv, "rate") == 0) {
387 ++present[TCA_NETEM_RATE];
389 if (get_rate(&rate.rate, *argv)) {
393 if (NEXT_IS_NUMBER()) {
395 if (get_s32(&rate.packet_overhead, *argv, 0)) {
400 if (NEXT_IS_NUMBER()) {
402 if (get_u32(&rate.cell_size, *argv, 0)) {
407 if (NEXT_IS_NUMBER()) {
409 if (get_s32(&rate.cell_overhead, *argv, 0)) {
414 } else if (strcmp(*argv, "help") == 0) {
418 fprintf(stderr, "What is \"%s\"?\n", *argv);
424 tail = NLMSG_TAIL(n);
426 if (reorder.probability) {
427 if (opt.latency == 0) {
428 fprintf(stderr, "reordering not possible without specifying some delay\n");
434 } else if (opt.gap > 0) {
435 fprintf(stderr, "gap specified without reorder probability\n");
440 if (dist_data && (opt.latency == 0 || opt.jitter == 0)) {
441 fprintf(stderr, "distribution specified but no latency and jitter values\n");
446 if (addattr_l(n, 1024, TCA_OPTIONS, &opt, sizeof(opt)) < 0)
449 if (present[TCA_NETEM_CORR] &&
450 addattr_l(n, 1024, TCA_NETEM_CORR, &cor, sizeof(cor)) < 0)
453 if (present[TCA_NETEM_REORDER] &&
454 addattr_l(n, 1024, TCA_NETEM_REORDER, &reorder, sizeof(reorder)) < 0)
457 if (present[TCA_NETEM_CORRUPT] &&
458 addattr_l(n, 1024, TCA_NETEM_CORRUPT, &corrupt, sizeof(corrupt)) < 0)
461 if (loss_type != NETEM_LOSS_UNSPEC) {
462 struct rtattr *start;
464 start = addattr_nest(n, 1024, TCA_NETEM_LOSS | NLA_F_NESTED);
465 if (loss_type == NETEM_LOSS_GI) {
466 if (addattr_l(n, 1024, NETEM_LOSS_GI,
467 &gimodel, sizeof(gimodel)) < 0)
469 } else if (loss_type == NETEM_LOSS_GE) {
470 if (addattr_l(n, 1024, NETEM_LOSS_GE,
471 &gemodel, sizeof(gemodel)) < 0)
474 fprintf(stderr, "loss in the weeds!\n");
478 addattr_nest_end(n, start);
481 if (present[TCA_NETEM_RATE] &&
482 addattr_l(n, 1024, TCA_NETEM_RATE, &rate, sizeof(rate)) < 0)
486 if (addattr_l(n, MAX_DIST * sizeof(dist_data[0]),
487 TCA_NETEM_DELAY_DIST,
488 dist_data, dist_size * sizeof(dist_data[0])) < 0)
492 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
496 static int netem_print_opt(struct qdisc_util *qu, FILE *f, struct rtattr *opt)
498 const struct tc_netem_corr *cor = NULL;
499 const struct tc_netem_reorder *reorder = NULL;
500 const struct tc_netem_corrupt *corrupt = NULL;
501 const struct tc_netem_gimodel *gimodel = NULL;
502 const struct tc_netem_gemodel *gemodel = NULL;
503 struct tc_netem_qopt qopt;
504 const struct tc_netem_rate *rate = NULL;
505 int len = RTA_PAYLOAD(opt) - sizeof(qopt);
512 fprintf(stderr, "options size error\n");
515 memcpy(&qopt, RTA_DATA(opt), sizeof(qopt));
518 struct rtattr *tb[TCA_NETEM_MAX+1];
519 parse_rtattr(tb, TCA_NETEM_MAX, RTA_DATA(opt) + sizeof(qopt),
522 if (tb[TCA_NETEM_CORR]) {
523 if (RTA_PAYLOAD(tb[TCA_NETEM_CORR]) < sizeof(*cor))
525 cor = RTA_DATA(tb[TCA_NETEM_CORR]);
527 if (tb[TCA_NETEM_REORDER]) {
528 if (RTA_PAYLOAD(tb[TCA_NETEM_REORDER]) < sizeof(*reorder))
530 reorder = RTA_DATA(tb[TCA_NETEM_REORDER]);
532 if (tb[TCA_NETEM_CORRUPT]) {
533 if (RTA_PAYLOAD(tb[TCA_NETEM_CORRUPT]) < sizeof(*corrupt))
535 corrupt = RTA_DATA(tb[TCA_NETEM_CORRUPT]);
537 if (tb[TCA_NETEM_LOSS]) {
538 struct rtattr *lb[NETEM_LOSS_MAX + 1];
540 parse_rtattr_nested(lb, NETEM_LOSS_MAX, tb[TCA_NETEM_LOSS]);
541 if (lb[NETEM_LOSS_GI])
542 gemodel = RTA_DATA(lb[NETEM_LOSS_GI]);
543 if (lb[NETEM_LOSS_GE])
544 gemodel = RTA_DATA(lb[NETEM_LOSS_GE]);
546 if (tb[TCA_NETEM_RATE]) {
547 if (RTA_PAYLOAD(tb[TCA_NETEM_RATE]) < sizeof(*rate))
549 rate = RTA_DATA(tb[TCA_NETEM_RATE]);
553 fprintf(f, "limit %d", qopt.limit);
556 fprintf(f, " delay %s", sprint_ticks(qopt.latency, b1));
559 fprintf(f, " %s", sprint_ticks(qopt.jitter, b1));
560 if (cor && cor->delay_corr)
561 fprintf(f, " %s", sprint_percent(cor->delay_corr, b1));
566 fprintf(f, " loss %s", sprint_percent(qopt.loss, b1));
567 if (cor && cor->loss_corr)
568 fprintf(f, " %s", sprint_percent(cor->loss_corr, b1));
572 fprintf(f, " loss state p13 %s", sprint_percent(gimodel->p13, b1));
573 fprintf(f, " p31 %s", sprint_percent(gimodel->p31, b1));
574 fprintf(f, " p32 %s", sprint_percent(gimodel->p32, b1));
575 fprintf(f, " p23 %s", sprint_percent(gimodel->p23, b1));
576 fprintf(f, " p14 %s", sprint_percent(gimodel->p14, b1));
580 fprintf(f, "loss gemodel p %s",
581 sprint_percent(gemodel->p, b1));
582 fprintf(f, " r %s", sprint_percent(gemodel->r, b1));
583 fprintf(f, " 1-h %s", sprint_percent(gemodel->h, b1));
584 fprintf(f, " 1-k %s", sprint_percent(gemodel->k1, b1));
587 if (qopt.duplicate) {
588 fprintf(f, " duplicate %s",
589 sprint_percent(qopt.duplicate, b1));
590 if (cor && cor->dup_corr)
591 fprintf(f, " %s", sprint_percent(cor->dup_corr, b1));
594 if (reorder && reorder->probability) {
595 fprintf(f, " reorder %s",
596 sprint_percent(reorder->probability, b1));
597 if (reorder->correlation)
599 sprint_percent(reorder->correlation, b1));
602 if (corrupt && corrupt->probability) {
603 fprintf(f, " corrupt %s",
604 sprint_percent(corrupt->probability, b1));
605 if (corrupt->correlation)
607 sprint_percent(corrupt->correlation, b1));
610 if (rate && rate->rate) {
611 fprintf(f, " rate %s", sprint_rate(rate->rate, b1));
612 if (rate->packet_overhead)
613 fprintf(f, " packetoverhead %d", rate->packet_overhead);
615 fprintf(f, " cellsize %u", rate->cell_size);
616 if (rate->cell_overhead)
617 fprintf(f, " celloverhead %d", rate->cell_overhead);
621 fprintf(f, " gap %lu", (unsigned long)qopt.gap);
626 struct qdisc_util netem_qdisc_util = {
628 .parse_qopt = netem_parse_opt,
629 .print_qopt = netem_print_opt,