q_prio.c revision dcfb7a77f8709125e97c313cb8ab6ec4d87468f4 
1/*
2 * q_prio.c		PRIO.
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:	Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
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 <sys/socket.h>
19#include <netinet/in.h>
20#include <arpa/inet.h>
21#include <string.h>
22
23#include "utils.h"
24#include "tc_util.h"
25
26static void explain(void)
27{
28	fprintf(stderr, "Usage: ... prio bands NUMBER priomap P1 P2...[multiqueue]\n");
29}
30
31#define usage() return(-1)
32
33static int prio_parse_opt(struct qdisc_util *qu, int argc, char **argv, struct nlmsghdr *n)
34{
35	int ok=0;
36	int pmap_mode = 0;
37	int idx = 0;
38	struct tc_prio_qopt opt={3,{ 1, 2, 2, 2, 1, 2, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1 }};
39	struct rtattr *nest;
40	unsigned char mq = 0;
41
42	while (argc > 0) {
43		if (strcmp(*argv, "bands") == 0) {
44			if (pmap_mode)
45				explain();
46			NEXT_ARG();
47			if (get_integer(&opt.bands, *argv, 10)) {
48				fprintf(stderr, "Illegal \"bands\"\n");
49				return -1;
50			}
51			ok++;
52		} else if (strcmp(*argv, "priomap") == 0) {
53			if (pmap_mode) {
54				fprintf(stderr, "Error: duplicate priomap\n");
55				return -1;
56			}
57			pmap_mode = 1;
58		} else if (strcmp(*argv, "multiqueue") == 0) {
59			mq = 1;
60		} else if (strcmp(*argv, "help") == 0) {
61			explain();
62			return -1;
63		} else {
64			unsigned band;
65			if (!pmap_mode) {
66				fprintf(stderr, "What is \"%s\"?\n", *argv);
67				explain();
68				return -1;
69			}
70			if (get_unsigned(&band, *argv, 10)) {
71				fprintf(stderr, "Illegal \"priomap\" element\n");
72				return -1;
73			}
74			if (band > opt.bands) {
75				fprintf(stderr, "\"priomap\" element is out of bands\n");
76				return -1;
77			}
78			if (idx > TC_PRIO_MAX) {
79				fprintf(stderr, "\"priomap\" index > TC_PRIO_MAX=%u\n", TC_PRIO_MAX);
80				return -1;
81			}
82			opt.priomap[idx++] = band;
83		}
84		argc--; argv++;
85	}
86
87/*
88	if (pmap_mode) {
89		for (; idx < TC_PRIO_MAX; idx++)
90			opt.priomap[idx] = opt.priomap[TC_PRIO_BESTEFFORT];
91	}
92*/
93	nest = addattr_nest_compat(n, 1024, TCA_OPTIONS, &opt, sizeof(opt));
94	if (mq)
95		addattr_l(n, 1024, TCA_PRIO_MQ, NULL, 0);
96	addattr_nest_compat_end(n, nest);
97	return 0;
98}
99
100int prio_print_opt(struct qdisc_util *qu, FILE *f, struct rtattr *opt)
101{
102	int i;
103	struct tc_prio_qopt *qopt;
104	struct rtattr *tb[TCA_PRIO_MAX+1];
105
106	if (opt == NULL)
107		return 0;
108
109	if (parse_rtattr_nested_compat(tb, TCA_PRIO_MAX, opt, qopt,
110					sizeof(*qopt)))
111                return -1;
112
113	fprintf(f, "bands %u priomap ", qopt->bands);
114	for (i=0; i<=TC_PRIO_MAX; i++)
115		fprintf(f, " %d", qopt->priomap[i]);
116
117	if (tb[TCA_PRIO_MQ])
118		fprintf(f, " multiqueue: %s ",
119		    *(unsigned char *)RTA_DATA(tb[TCA_PRIO_MQ]) ? "on" : "off");
120
121	return 0;
122}
123
124struct qdisc_util prio_qdisc_util = {
125	.id	 	= "prio",
126	.parse_qopt	= prio_parse_opt,
127	.print_qopt	= prio_print_opt,
128};
129
130