[mirror_iproute2.git] / tc / q_mqprio.c

/*
 * q_mqprio.c	MQ prio qdisc
 *
 *		This program is free software; you can redistribute it and/or
 *		modify it under the terms of the GNU General Public License
 *		as published by the Free Software Foundation; either version
 *		2 of the License, or (at your option) any later version.
 *
 * Author:	John Fastabend, <john.r.fastabend@intel.com>
 */

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <syslog.h>
#include <fcntl.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <string.h>

#include "utils.h"
#include "tc_util.h"

static void explain(void)
{
	fprintf(stderr, "Usage: ... mqprio [num_tc NUMBER] [map P0 P1 ...]\n");
	fprintf(stderr, "                  [queues count1@offset1 count2@offset2 ...] ");
	fprintf(stderr, "[hw 1|0]\n");
}

static int mqprio_parse_opt(struct qdisc_util *qu, int argc,
			    char **argv, struct nlmsghdr *n)
{
	int idx;
	struct tc_mqprio_qopt opt = {
				     8,
				     {0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 1, 1, 3, 3, 3, 3},
				     1,
				    };

	while (argc > 0) {
		idx = 0;
		if (strcmp(*argv, "num_tc") == 0) {
			NEXT_ARG();
			if (get_u8(&opt.num_tc, *argv, 10)) {
				fprintf(stderr, "Illegal \"num_tc\"\n");
				return -1;
			}
		} else if (strcmp(*argv, "map") == 0) {
			while (idx < TC_QOPT_MAX_QUEUE && NEXT_ARG_OK()) {
				NEXT_ARG();
				if (get_u8(&opt.prio_tc_map[idx], *argv, 10)) {
					PREV_ARG();
					break;
				}
				idx++;
			}
			for ( ; idx < TC_QOPT_MAX_QUEUE; idx++)
				opt.prio_tc_map[idx] = 0;
		} else if (strcmp(*argv, "queues") == 0) {
			char *tmp, *tok;

			while (idx < TC_QOPT_MAX_QUEUE && NEXT_ARG_OK()) {
				NEXT_ARG();

				tmp = strdup(*argv);
				if (!tmp)
					break;

				tok = strtok(tmp, "@");
				if (get_u16(&opt.count[idx], tok, 10)) {
					free(tmp);
					PREV_ARG();
					break;
				}
				tok = strtok(NULL, "@");
				if (get_u16(&opt.offset[idx], tok, 10)) {
					free(tmp);
					PREV_ARG();
					break;
				}
				free(tmp);
				idx++;
			}
		} else if (strcmp(*argv, "hw") == 0) {
			NEXT_ARG();
			if (get_u8(&opt.hw, *argv, 10)) {
				fprintf(stderr, "Illegal \"hw\"\n");
				return -1;
			}
			idx++;
		} else if (strcmp(*argv, "help") == 0) {
			explain();
			return -1;
		} else {
			fprintf(stderr, "Unknown argument\n");
			return -1;
		}
		argc--; argv++;
	}

	addattr_l(n, 1024, TCA_OPTIONS, &opt, sizeof(opt));
	return 0;
}

static int mqprio_print_opt(struct qdisc_util *qu, FILE *f, struct rtattr *opt)
{
	int i;
	struct tc_mqprio_qopt *qopt;

	if (opt == NULL)
		return 0;

	qopt = RTA_DATA(opt);

	fprintf(f, " tc %u map ", qopt->num_tc);
	for (i = 0; i <= TC_PRIO_MAX; i++)
		fprintf(f, "%u ", qopt->prio_tc_map[i]);
	fprintf(f, "\n             queues:");
	for (i = 0; i < qopt->num_tc; i++)
		fprintf(f, "(%u:%u) ", qopt->offset[i],
			qopt->offset[i] + qopt->count[i] - 1);
	return 0;
}

struct qdisc_util mqprio_qdisc_util = {
	.id		= "mqprio",
	.parse_qopt	= mqprio_parse_opt,
	.print_qopt	= mqprio_print_opt,
};
Commit	Line	Data
91495304 JF	1	/*
	2	* q_mqprio.c MQ prio qdisc
	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	* Author: John Fastabend, <john.r.fastabend@intel.com>
	10	*/
	11
	12	#include <stdio.h>
	13	#include <stdlib.h>
	14	#include <unistd.h>
	15	#include <syslog.h>
	16	#include <fcntl.h>
	17	#include <sys/socket.h>
	18	#include <netinet/in.h>
	19	#include <arpa/inet.h>
	20	#include <string.h>
	21
	22	#include "utils.h"
	23	#include "tc_util.h"
	24
	25	static void explain(void)
	26	{
	27	fprintf(stderr, "Usage: ... mqprio [num_tc NUMBER] [map P0 P1 ...]\n");
892eba30 JF	28	fprintf(stderr, " [queues count1@offset1 count2@offset2 ...] ");
892eba30 JF	29	fprintf(stderr, "[hw 1\|0]\n");
91495304 JF	30	}
	31
	32	static int mqprio_parse_opt(struct qdisc_util *qu, int argc,
	33	char *argv, struct nlmsghdr n)
	34	{
	35	int idx;
	36	struct tc_mqprio_qopt opt = {
	37	8,
	38	{0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 1, 1, 3, 3, 3, 3},
	39	1,
	40	};
	41
	42	while (argc > 0) {
	43	idx = 0;
	44	if (strcmp(*argv, "num_tc") == 0) {
	45	NEXT_ARG();
	46	if (get_u8(&opt.num_tc, *argv, 10)) {
	47	fprintf(stderr, "Illegal \"num_tc\"\n");
	48	return -1;
	49	}
	50	} else if (strcmp(*argv, "map") == 0) {
	51	while (idx < TC_QOPT_MAX_QUEUE && NEXT_ARG_OK()) {
	52	NEXT_ARG();
	53	if (get_u8(&opt.prio_tc_map[idx], *argv, 10)) {
	54	PREV_ARG();
	55	break;
	56	}
	57	idx++;
	58	}
	59	for ( ; idx < TC_QOPT_MAX_QUEUE; idx++)
	60	opt.prio_tc_map[idx] = 0;
892eba30 JF	61	} else if (strcmp(*argv, "queues") == 0) {
	62	char tmp, tok;
	63
91495304 JF	64	while (idx < TC_QOPT_MAX_QUEUE && NEXT_ARG_OK()) {
91495304 JF	65	NEXT_ARG();
892eba30 JF	66
	67	tmp = strdup(*argv);
	68	if (!tmp)
	69	break;
	70
	71	tok = strtok(tmp, "@");
	72	if (get_u16(&opt.count[idx], tok, 10)) {
	73	free(tmp);
91495304 JF	74	PREV_ARG();
	75	break;
	76	}
892eba30 JF	77	tok = strtok(NULL, "@");
	78	if (get_u16(&opt.offset[idx], tok, 10)) {
	79	free(tmp);
91495304 JF	80	PREV_ARG();
	81	break;
	82	}
892eba30	83	free(tmp);
91495304 JF	84	idx++;
	85	}
	86	} else if (strcmp(*argv, "hw") == 0) {
	87	NEXT_ARG();
	88	if (get_u8(&opt.hw, *argv, 10)) {
	89	fprintf(stderr, "Illegal \"hw\"\n");
	90	return -1;
	91	}
	92	idx++;
	93	} else if (strcmp(*argv, "help") == 0) {
	94	explain();
	95	return -1;
	96	} else {
	97	fprintf(stderr, "Unknown argument\n");
	98	return -1;
	99	}
	100	argc--; argv++;
	101	}
	102
	103	addattr_l(n, 1024, TCA_OPTIONS, &opt, sizeof(opt));
	104	return 0;
	105	}
	106
d1f28cf1	107	static int mqprio_print_opt(struct qdisc_util qu, FILE f, struct rtattr *opt)
91495304 JF	108	{
	109	int i;
	110	struct tc_mqprio_qopt *qopt;
	111
	112	if (opt == NULL)
	113	return 0;
	114
	115	qopt = RTA_DATA(opt);
	116
	117	fprintf(f, " tc %u map ", qopt->num_tc);
	118	for (i = 0; i <= TC_PRIO_MAX; i++)
e2a4536a	119	fprintf(f, "%u ", qopt->prio_tc_map[i]);
91495304 JF	120	fprintf(f, "\n queues:");
91495304 JF	121	for (i = 0; i < qopt->num_tc; i++)
e2a4536a	122	fprintf(f, "(%u:%u) ", qopt->offset[i],
91495304 JF	123	qopt->offset[i] + qopt->count[i] - 1);
	124	return 0;
	125	}
	126
	127	struct qdisc_util mqprio_qdisc_util = {
	128	.id = "mqprio",
	129	.parse_qopt = mqprio_parse_opt,
	130	.print_qopt = mqprio_print_opt,
	131	};