blob: d7e00025caff22f8e2843b2063c8b60d9ac441a2 [file] [log] [blame]
Jussi Kivilinna839c8452008-07-25 16:19:09 +03001/*
2 * tc_stab.c "tc qdisc ... stab *".
3 *
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.
8 *
9 * Authors: Jussi Kivilinna, <jussi.kivilinna@mbnet.fi>
10 *
11 */
12
13#include <stdio.h>
14#include <stdlib.h>
15#include <unistd.h>
16#include <syslog.h>
17#include <fcntl.h>
18#include <math.h>
19#include <sys/socket.h>
Natanael Copadd9cc0e2014-05-27 07:40:10 +000020#include <sys/param.h>
Jussi Kivilinna839c8452008-07-25 16:19:09 +030021#include <netinet/in.h>
22#include <arpa/inet.h>
23#include <string.h>
24#include <malloc.h>
25
26#include "utils.h"
27#include "tc_util.h"
28#include "tc_core.h"
29#include "tc_common.h"
30
31static void stab_help(void)
32{
33 fprintf(stderr,
Stephen Hemminger32a121c2016-03-21 11:48:36 -070034 "Usage: ... stab [ mtu BYTES ] [ tsize SLOTS ] [ mpu BYTES ]\n"
Jussi Kivilinna839c8452008-07-25 16:19:09 +030035 " [ overhead BYTES ] [ linklayer TYPE ] ...\n"
36 " mtu : max packet size we create rate map for {2047}\n"
37 " tsize : how many slots should size table have {512}\n"
38 " mpu : minimum packet size used in rate computations\n"
39 " overhead : per-packet size overhead used in rate computations\n"
40 " linklayer : adapting to a linklayer e.g. atm\n"
41 "Example: ... stab overhead 20 linklayer atm\n");
42
43 return;
44}
45
46int check_size_table_opts(struct tc_sizespec *s)
47{
48 return s->linklayer >= LINKLAYER_ETHERNET || s->mpu != 0 ||
49 s->overhead != 0;
50}
51
52int parse_size_table(int *argcp, char ***argvp, struct tc_sizespec *sp)
53{
54 char **argv = *argvp;
55 int argc = *argcp;
56 struct tc_sizespec s;
57
58 memset(&s, 0, sizeof(s));
59
60 NEXT_ARG();
61 if (matches(*argv, "help") == 0) {
62 stab_help();
63 return -1;
64 }
65 while (argc > 0) {
66 if (matches(*argv, "mtu") == 0) {
67 NEXT_ARG();
68 if (s.mtu)
69 duparg("mtu", *argv);
Stephen Hemmingerbcb4a7a2015-08-13 14:20:40 -070070 if (get_u32(&s.mtu, *argv, 10))
Jussi Kivilinna839c8452008-07-25 16:19:09 +030071 invarg("mtu", "invalid mtu");
Jussi Kivilinna839c8452008-07-25 16:19:09 +030072 } else if (matches(*argv, "mpu") == 0) {
73 NEXT_ARG();
74 if (s.mpu)
75 duparg("mpu", *argv);
Stephen Hemmingerbcb4a7a2015-08-13 14:20:40 -070076 if (get_u32(&s.mpu, *argv, 10))
Jussi Kivilinna839c8452008-07-25 16:19:09 +030077 invarg("mpu", "invalid mpu");
Jussi Kivilinna839c8452008-07-25 16:19:09 +030078 } else if (matches(*argv, "overhead") == 0) {
79 NEXT_ARG();
80 if (s.overhead)
81 duparg("overhead", *argv);
Stephen Hemmingerbcb4a7a2015-08-13 14:20:40 -070082 if (get_integer(&s.overhead, *argv, 10))
Jussi Kivilinna839c8452008-07-25 16:19:09 +030083 invarg("overhead", "invalid overhead");
Jussi Kivilinna839c8452008-07-25 16:19:09 +030084 } else if (matches(*argv, "tsize") == 0) {
85 NEXT_ARG();
86 if (s.tsize)
87 duparg("tsize", *argv);
Stephen Hemmingerbcb4a7a2015-08-13 14:20:40 -070088 if (get_u32(&s.tsize, *argv, 10))
Jussi Kivilinna839c8452008-07-25 16:19:09 +030089 invarg("tsize", "invalid table size");
Jussi Kivilinna839c8452008-07-25 16:19:09 +030090 } else if (matches(*argv, "linklayer") == 0) {
91 NEXT_ARG();
92 if (s.linklayer != LINKLAYER_UNSPEC)
93 duparg("linklayer", *argv);
Stephen Hemmingerbcb4a7a2015-08-13 14:20:40 -070094 if (get_linklayer(&s.linklayer, *argv))
Jussi Kivilinna839c8452008-07-25 16:19:09 +030095 invarg("linklayer", "invalid linklayer");
Jussi Kivilinna839c8452008-07-25 16:19:09 +030096 } else
97 break;
98 argc--; argv++;
99 }
100
101 if (!check_size_table_opts(&s))
102 return -1;
103
104 *sp = s;
105 *argvp = argv;
106 *argcp = argc;
107 return 0;
108}
109
110void print_size_table(FILE *fp, const char *prefix, struct rtattr *rta)
111{
112 struct rtattr *tb[TCA_STAB_MAX + 1];
Stephen Hemminger32a121c2016-03-21 11:48:36 -0700113
Jussi Kivilinna839c8452008-07-25 16:19:09 +0300114 SPRINT_BUF(b1);
115
116 parse_rtattr_nested(tb, TCA_STAB_MAX, rta);
117
118 if (tb[TCA_STAB_BASE]) {
119 struct tc_sizespec s = {0};
Stephen Hemminger32a121c2016-03-21 11:48:36 -0700120
Jussi Kivilinna839c8452008-07-25 16:19:09 +0300121 memcpy(&s, RTA_DATA(tb[TCA_STAB_BASE]),
122 MIN(RTA_PAYLOAD(tb[TCA_STAB_BASE]), sizeof(s)));
123
124 fprintf(fp, "%s", prefix);
125 if (s.linklayer)
126 fprintf(fp, "linklayer %s ",
127 sprint_linklayer(s.linklayer, b1));
128 if (s.overhead)
129 fprintf(fp, "overhead %d ", s.overhead);
130 if (s.mpu)
131 fprintf(fp, "mpu %u ", s.mpu);
132 if (s.mtu)
133 fprintf(fp, "mtu %u ", s.mtu);
134 if (s.tsize)
135 fprintf(fp, "tsize %u ", s.tsize);
136 }
137
138#if 0
139 if (tb[TCA_STAB_DATA]) {
Stephen Hemminger32a121c2016-03-21 11:48:36 -0700140 unsigned int i, j, dlen;
Jussi Kivilinna839c8452008-07-25 16:19:09 +0300141 __u16 *data = RTA_DATA(tb[TCA_STAB_DATA]);
Stephen Hemminger32a121c2016-03-21 11:48:36 -0700142
Jussi Kivilinna839c8452008-07-25 16:19:09 +0300143 dlen = RTA_PAYLOAD(tb[TCA_STAB_DATA]) / sizeof(__u16);
144
145 fprintf(fp, "\n%sstab data:", prefix);
146 for (i = 0; i < dlen/12; i++) {
147 fprintf(fp, "\n%s %3u:", prefix, i * 12);
148 for (j = 0; i * 12 + j < dlen; j++)
149 fprintf(fp, " %05x", data[i * 12 + j]);
150 }
151 }
152#endif
153}