[mirror_iproute2.git] / tc / tc_class.c

/*
 * tc_class.c		"tc class".
 *
 *		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.
 *
 * Authors:	Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
 *
 */

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

#include "utils.h"
#include "tc_util.h"
#include "tc_common.h"
#include "list.h"

struct graph_node {
	struct hlist_node hlist;
	__u32 id;
	__u32 parent_id;
	struct graph_node *parent_node;
	struct graph_node *right_node;
	void *data;
	int data_len;
	int nodes_count;
};

static struct hlist_head cls_list = {};
static struct hlist_head root_cls_list = {};

static void usage(void);

static void usage(void)
{
	fprintf(stderr,
		"Usage: tc class [ add | del | change | replace | show ] dev STRING\n"
		"       [ classid CLASSID ] [ root | parent CLASSID ]\n"
		"       [ [ QDISC_KIND ] [ help | OPTIONS ] ]\n"
		"\n"
		"       tc class show [ dev STRING ] [ root | parent CLASSID ]\n"
		"Where:\n"
		"QDISC_KIND := { prio | cbq | etc. }\n"
		"OPTIONS := ... try tc class add <desired QDISC_KIND> help\n");
}

static int tc_class_modify(int cmd, unsigned int flags, int argc, char **argv)
{
	struct {
		struct nlmsghdr	n;
		struct tcmsg		t;
		char			buf[4096];
	} req = {
		.n.nlmsg_len = NLMSG_LENGTH(sizeof(struct tcmsg)),
		.n.nlmsg_flags = NLM_F_REQUEST | flags,
		.n.nlmsg_type = cmd,
		.t.tcm_family = AF_UNSPEC,
	};
	struct qdisc_util *q = NULL;
	struct tc_estimator est = {};
	char  d[IFNAMSIZ] = {};
	char  k[FILTER_NAMESZ] = {};

	while (argc > 0) {
		if (strcmp(*argv, "dev") == 0) {
			NEXT_ARG();
			if (d[0])
				duparg("dev", *argv);
			strncpy(d, *argv, sizeof(d)-1);
		} else if (strcmp(*argv, "classid") == 0) {
			__u32 handle;

			NEXT_ARG();
			if (req.t.tcm_handle)
				duparg("classid", *argv);
			if (get_tc_classid(&handle, *argv))
				invarg("invalid class ID", *argv);
			req.t.tcm_handle = handle;
		} else if (strcmp(*argv, "handle") == 0) {
			fprintf(stderr, "Error: try \"classid\" instead of \"handle\"\n");
			return -1;
		} else if (strcmp(*argv, "root") == 0) {
			if (req.t.tcm_parent) {
				fprintf(stderr, "Error: \"root\" is duplicate parent ID.\n");
				return -1;
			}
			req.t.tcm_parent = TC_H_ROOT;
		} else if (strcmp(*argv, "parent") == 0) {
			__u32 handle;

			NEXT_ARG();
			if (req.t.tcm_parent)
				duparg("parent", *argv);
			if (get_tc_classid(&handle, *argv))
				invarg("invalid parent ID", *argv);
			req.t.tcm_parent = handle;
		} else if (matches(*argv, "estimator") == 0) {
			if (parse_estimator(&argc, &argv, &est))
				return -1;
		} else if (matches(*argv, "help") == 0) {
			usage();
		} else {
			strncpy(k, *argv, sizeof(k)-1);

			q = get_qdisc_kind(k);
			argc--; argv++;
			break;
		}
		argc--; argv++;
	}

	if (k[0])
		addattr_l(&req.n, sizeof(req), TCA_KIND, k, strlen(k)+1);
	if (est.ewma_log)
		addattr_l(&req.n, sizeof(req), TCA_RATE, &est, sizeof(est));

	if (q) {
		if (q->parse_copt == NULL) {
			fprintf(stderr, "Error: Qdisc \"%s\" is classless.\n", k);
			return 1;
		}
		if (q->parse_copt(q, argc, argv, &req.n, d))
			return 1;
	} else {
		if (argc) {
			if (matches(*argv, "help") == 0)
				usage();
			fprintf(stderr, "Garbage instead of arguments \"%s ...\". Try \"tc class help\".", *argv);
			return -1;
		}
	}

	if (d[0])  {
		ll_init_map(&rth);

		req.t.tcm_ifindex = ll_name_to_index(d);
		if (!req.t.tcm_ifindex)
			return -nodev(d);
	}

	if (rtnl_talk(&rth, &req.n, NULL) < 0)
		return 2;

	return 0;
}

static int filter_ifindex;
static __u32 filter_qdisc;
static __u32 filter_classid;

static void graph_node_add(__u32 parent_id, __u32 id, void *data,
		int len)
{
	struct graph_node *node = calloc(1, sizeof(struct graph_node));

	node->id         = id;
	node->parent_id  = parent_id;

	if (data && len) {
		node->data       = malloc(len);
		node->data_len   = len;
		memcpy(node->data, data, len);
	}

	if (parent_id == TC_H_ROOT)
		hlist_add_head(&node->hlist, &root_cls_list);
	else
		hlist_add_head(&node->hlist, &cls_list);
}

static void graph_indent(char *buf, struct graph_node *node, int is_newline,
		int add_spaces)
{
	char spaces[100] = {0};

	while (node && node->parent_node) {
		node->parent_node->right_node = node;
		node = node->parent_node;
	}
	while (node && node->right_node) {
		if (node->hlist.next)
			strcat(buf, "|    ");
		else
			strcat(buf, "     ");

		node = node->right_node;
	}

	if (is_newline) {
		if (node->hlist.next && node->nodes_count)
			strcat(buf, "|    |");
		else if (node->hlist.next)
			strcat(buf, "|     ");
		else if (node->nodes_count)
			strcat(buf, "     |");
		else if (!node->hlist.next)
			strcat(buf, "      ");
	}
	if (add_spaces > 0) {
		sprintf(spaces, "%-*s", add_spaces, "");
		strcat(buf, spaces);
	}
}

static void graph_cls_show(FILE *fp, char *buf, struct hlist_head *root_list,
		int level)
{
	struct hlist_node *n, *tmp_cls;
	char cls_id_str[256] = {};
	struct rtattr *tb[TCA_MAX + 1];
	struct qdisc_util *q;
	char str[300] = {};

	hlist_for_each_safe(n, tmp_cls, root_list) {
		struct hlist_node *c, *tmp_chld;
		struct hlist_head children = {};
		struct graph_node *cls = container_of(n, struct graph_node,
				hlist);

		hlist_for_each_safe(c, tmp_chld, &cls_list) {
			struct graph_node *child = container_of(c,
					struct graph_node, hlist);

			if (cls->id == child->parent_id) {
				hlist_del(c);
				hlist_add_head(c, &children);
				cls->nodes_count++;
				child->parent_node = cls;
			}
		}

		graph_indent(buf, cls, 0, 0);

		print_tc_classid(cls_id_str, sizeof(cls_id_str), cls->id);
		snprintf(str, sizeof(str),
			 "+---(%s)", cls_id_str);
		strcat(buf, str);

		parse_rtattr_flags(tb, TCA_MAX, (struct rtattr *)cls->data,
				   cls->data_len, NLA_F_NESTED);

		if (tb[TCA_KIND] == NULL) {
			strcat(buf, " [unknown qdisc kind] ");
		} else {
			const char *kind = rta_getattr_str(tb[TCA_KIND]);

			sprintf(str, " %s ", kind);
			strcat(buf, str);
			fprintf(fp, "%s", buf);
			buf[0] = '\0';

			q = get_qdisc_kind(kind);
			if (q && q->print_copt) {
				q->print_copt(q, fp, tb[TCA_OPTIONS]);
			}
			if (q && show_stats) {
				int cls_indent = strlen(q->id) - 2 +
					strlen(cls_id_str);
				struct rtattr *stats = NULL;

				graph_indent(buf, cls, 1, cls_indent);

				if (tb[TCA_STATS] || tb[TCA_STATS2]) {
					fprintf(fp, "\n");
					print_tcstats_attr(fp, tb, buf, &stats);
					buf[0] = '\0';
				}
				if (cls->hlist.next || cls->nodes_count) {
					strcat(buf, "\n");
					graph_indent(buf, cls, 1, 0);
				}
			}
		}
		free(cls->data);
		fprintf(fp, "%s\n", buf);
		buf[0] = '\0';

		graph_cls_show(fp, buf, &children, level + 1);
		if (!cls->hlist.next) {
			graph_indent(buf, cls, 0, 0);
			strcat(buf, "\n");
		}

		fprintf(fp, "%s", buf);
		buf[0] = '\0';
		free(cls);
	}
}

int print_class(struct nlmsghdr *n, void *arg)
{
	FILE *fp = (FILE *)arg;
	struct tcmsg *t = NLMSG_DATA(n);
	int len = n->nlmsg_len;
	struct rtattr *tb[TCA_MAX + 1];
	struct qdisc_util *q;
	char abuf[256];

	if (n->nlmsg_type != RTM_NEWTCLASS && n->nlmsg_type != RTM_DELTCLASS) {
		fprintf(stderr, "Not a class\n");
		return 0;
	}
	len -= NLMSG_LENGTH(sizeof(*t));
	if (len < 0) {
		fprintf(stderr, "Wrong len %d\n", len);
		return -1;
	}

	if (show_graph) {
		graph_node_add(t->tcm_parent, t->tcm_handle, TCA_RTA(t), len);
		return 0;
	}

	if (filter_qdisc && TC_H_MAJ(t->tcm_handle^filter_qdisc))
		return 0;

	if (filter_classid && t->tcm_handle != filter_classid)
		return 0;

	parse_rtattr_flags(tb, TCA_MAX, TCA_RTA(t), len, NLA_F_NESTED);

	if (tb[TCA_KIND] == NULL) {
		fprintf(stderr, "print_class: NULL kind\n");
		return -1;
	}

	if (n->nlmsg_type == RTM_DELTCLASS)
		fprintf(fp, "deleted ");

	abuf[0] = 0;
	if (t->tcm_handle) {
		if (filter_qdisc)
			print_tc_classid(abuf, sizeof(abuf), TC_H_MIN(t->tcm_handle));
		else
			print_tc_classid(abuf, sizeof(abuf), t->tcm_handle);
	}
	fprintf(fp, "class %s %s ", rta_getattr_str(tb[TCA_KIND]), abuf);

	if (filter_ifindex == 0)
		fprintf(fp, "dev %s ", ll_index_to_name(t->tcm_ifindex));

	if (t->tcm_parent == TC_H_ROOT)
		fprintf(fp, "root ");
	else {
		if (filter_qdisc)
			print_tc_classid(abuf, sizeof(abuf), TC_H_MIN(t->tcm_parent));
		else
			print_tc_classid(abuf, sizeof(abuf), t->tcm_parent);
		fprintf(fp, "parent %s ", abuf);
	}
	if (t->tcm_info)
		fprintf(fp, "leaf %x: ", t->tcm_info>>16);
	q = get_qdisc_kind(RTA_DATA(tb[TCA_KIND]));
	if (tb[TCA_OPTIONS]) {
		if (q && q->print_copt)
			q->print_copt(q, fp, tb[TCA_OPTIONS]);
		else
			fprintf(fp, "[cannot parse class parameters]");
	}
	fprintf(fp, "\n");
	if (show_stats) {
		struct rtattr *xstats = NULL;

		if (tb[TCA_STATS] || tb[TCA_STATS2]) {
			print_tcstats_attr(fp, tb, " ", &xstats);
			fprintf(fp, "\n");
		}
		if (q && (xstats || tb[TCA_XSTATS]) && q->print_xstats) {
			q->print_xstats(q, fp, xstats ? : tb[TCA_XSTATS]);
			fprintf(fp, "\n");
		}
	}
	fflush(fp);
	return 0;
}


static int tc_class_list(int argc, char **argv)
{
	struct tcmsg t = { .tcm_family = AF_UNSPEC };
	char d[IFNAMSIZ] = {};
	char buf[1024] = {0};

	filter_qdisc = 0;
	filter_classid = 0;

	while (argc > 0) {
		if (strcmp(*argv, "dev") == 0) {
			NEXT_ARG();
			if (d[0])
				duparg("dev", *argv);
			strncpy(d, *argv, sizeof(d)-1);
		} else if (strcmp(*argv, "qdisc") == 0) {
			NEXT_ARG();
			if (filter_qdisc)
				duparg("qdisc", *argv);
			if (get_qdisc_handle(&filter_qdisc, *argv))
				invarg("invalid qdisc ID", *argv);
		} else if (strcmp(*argv, "classid") == 0) {
			NEXT_ARG();
			if (filter_classid)
				duparg("classid", *argv);
			if (get_tc_classid(&filter_classid, *argv))
				invarg("invalid class ID", *argv);
		} else if (strcmp(*argv, "root") == 0) {
			if (t.tcm_parent) {
				fprintf(stderr, "Error: \"root\" is duplicate parent ID\n");
				return -1;
			}
			t.tcm_parent = TC_H_ROOT;
		} else if (strcmp(*argv, "parent") == 0) {
			__u32 handle;

			if (t.tcm_parent)
				duparg("parent", *argv);
			NEXT_ARG();
			if (get_tc_classid(&handle, *argv))
				invarg("invalid parent ID", *argv);
			t.tcm_parent = handle;
		} else if (matches(*argv, "help") == 0) {
			usage();
		} else {
			fprintf(stderr, "What is \"%s\"? Try \"tc class help\".\n", *argv);
			return -1;
		}

		argc--; argv++;
	}

	ll_init_map(&rth);

	if (d[0]) {
		t.tcm_ifindex = ll_name_to_index(d);
		if (!t.tcm_ifindex)
			return -nodev(d);
		filter_ifindex = t.tcm_ifindex;
	}

	if (rtnl_dump_request(&rth, RTM_GETTCLASS, &t, sizeof(t)) < 0) {
		perror("Cannot send dump request");
		return 1;
	}

	if (rtnl_dump_filter(&rth, print_class, stdout) < 0) {
		fprintf(stderr, "Dump terminated\n");
		return 1;
	}

	if (show_graph)
		graph_cls_show(stdout, &buf[0], &root_cls_list, 0);

	return 0;
}

int do_class(int argc, char **argv)
{
	if (argc < 1)
		return tc_class_list(0, NULL);
	if (matches(*argv, "add") == 0)
		return tc_class_modify(RTM_NEWTCLASS, NLM_F_EXCL|NLM_F_CREATE, argc-1, argv+1);
	if (matches(*argv, "change") == 0)
		return tc_class_modify(RTM_NEWTCLASS, 0, argc-1, argv+1);
	if (matches(*argv, "replace") == 0)
		return tc_class_modify(RTM_NEWTCLASS, NLM_F_CREATE, argc-1, argv+1);
	if (matches(*argv, "delete") == 0)
		return tc_class_modify(RTM_DELTCLASS, 0,  argc-1, argv+1);
#if 0
	if (matches(*argv, "get") == 0)
		return tc_class_get(RTM_GETTCLASS, 0,  argc-1, argv+1);
#endif
	if (matches(*argv, "list") == 0 || matches(*argv, "show") == 0
	    || matches(*argv, "lst") == 0)
		return tc_class_list(argc-1, argv+1);
	if (matches(*argv, "help") == 0) {
		usage();
		return 0;
	}
	fprintf(stderr, "Command \"%s\" is unknown, try \"tc class help\".\n", *argv);
	return -1;
}
Commit	Line	Data
aba5acdf SH	1	/*
	2	* tc_class.c "tc class".
	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>
aba5acdf SH	16	#include <fcntl.h>
	17	#include <sys/socket.h>
	18	#include <netinet/in.h>
	19	#include <arpa/inet.h>
	20	#include <string.h>
	21	#include <math.h>
	22
	23	#include "utils.h"
	24	#include "tc_util.h"
	25	#include "tc_common.h"
4952b459	26	#include "list.h"
d954b34a VK	27
	28	struct graph_node {
	29	struct hlist_node hlist;
	30	__u32 id;
	31	__u32 parent_id;
	32	struct graph_node *parent_node;
	33	struct graph_node *right_node;
	34	void *data;
	35	int data_len;
	36	int nodes_count;
	37	};
	38
	39	static struct hlist_head cls_list = {};
	40	static struct hlist_head root_cls_list = {};
aba5acdf	41
b611d516	42	static void usage(void);
aba5acdf SH	43
	44	static void usage(void)
	45	{
8589eb4e MC	46	fprintf(stderr,
	47	"Usage: tc class [ add \| del \| change \| replace \| show ] dev STRING\n"
	48	" [ classid CLASSID ] [ root \| parent CLASSID ]\n"
	49	" [ [ QDISC_KIND ] [ help \| OPTIONS ] ]\n"
	50	"\n"
	51	" tc class show [ dev STRING ] [ root \| parent CLASSID ]\n"
	52	"Where:\n"
	53	"QDISC_KIND := { prio \| cbq \| etc. }\n"
	54	"OPTIONS := ... try tc class add <desired QDISC_KIND> help\n");
aba5acdf SH	55	}
aba5acdf SH	56
32a121cb	57	static int tc_class_modify(int cmd, unsigned int flags, int argc, char **argv)
aba5acdf	58	{
aba5acdf	59	struct {
32a121cb SH	60	struct nlmsghdr n;
	61	struct tcmsg t;
	62	char buf[4096];
d17b136f PS	63	} req = {
	64	.n.nlmsg_len = NLMSG_LENGTH(sizeof(struct tcmsg)),
	65	.n.nlmsg_flags = NLM_F_REQUEST \| flags,
	66	.n.nlmsg_type = cmd,
	67	.t.tcm_family = AF_UNSPEC,
	68	};
aba5acdf	69	struct qdisc_util *q = NULL;
d17b136f	70	struct tc_estimator est = {};
b317557f SH	71	char d[IFNAMSIZ] = {};
b317557f SH	72	char k[FILTER_NAMESZ] = {};
aba5acdf SH	73
	74	while (argc > 0) {
	75	if (strcmp(*argv, "dev") == 0) {
	76	NEXT_ARG();
	77	if (d[0])
	78	duparg("dev", *argv);
	79	strncpy(d, *argv, sizeof(d)-1);
	80	} else if (strcmp(*argv, "classid") == 0) {
	81	__u32 handle;
32a121cb	82
aba5acdf SH	83	NEXT_ARG();
	84	if (req.t.tcm_handle)
	85	duparg("classid", *argv);
	86	if (get_tc_classid(&handle, *argv))
f1675d61	87	invarg("invalid class ID", *argv);
aba5acdf	88	req.t.tcm_handle = handle;
7e6b809c SH	89	} else if (strcmp(*argv, "handle") == 0) {
	90	fprintf(stderr, "Error: try \"classid\" instead of \"handle\"\n");
	91	return -1;
3d0b7439	92	} else if (strcmp(*argv, "root") == 0) {
aba5acdf SH	93	if (req.t.tcm_parent) {
aba5acdf SH	94	fprintf(stderr, "Error: \"root\" is duplicate parent ID.\n");
b611d516	95	return -1;
aba5acdf SH	96	}
	97	req.t.tcm_parent = TC_H_ROOT;
	98	} else if (strcmp(*argv, "parent") == 0) {
	99	__u32 handle;
32a121cb	100
aba5acdf SH	101	NEXT_ARG();
	102	if (req.t.tcm_parent)
	103	duparg("parent", *argv);
	104	if (get_tc_classid(&handle, *argv))
f1675d61	105	invarg("invalid parent ID", *argv);
aba5acdf SH	106	req.t.tcm_parent = handle;
	107	} else if (matches(*argv, "estimator") == 0) {
	108	if (parse_estimator(&argc, &argv, &est))
	109	return -1;
	110	} else if (matches(*argv, "help") == 0) {
	111	usage();
	112	} else {
	113	strncpy(k, *argv, sizeof(k)-1);
	114
	115	q = get_qdisc_kind(k);
	116	argc--; argv++;
	117	break;
	118	}
	119	argc--; argv++;
	120	}
	121
	122	if (k[0])
	123	addattr_l(&req.n, sizeof(req), TCA_KIND, k, strlen(k)+1);
	124	if (est.ewma_log)
	125	addattr_l(&req.n, sizeof(req), TCA_RATE, &est, sizeof(est));
	126
	127	if (q) {
	128	if (q->parse_copt == NULL) {
	129	fprintf(stderr, "Error: Qdisc \"%s\" is classless.\n", k);
b611d516	130	return 1;
aba5acdf	131	}
927e3cfb	132	if (q->parse_copt(q, argc, argv, &req.n, d))
b611d516	133	return 1;
aba5acdf SH	134	} else {
	135	if (argc) {
	136	if (matches(*argv, "help") == 0)
	137	usage();
	138	fprintf(stderr, "Garbage instead of arguments \"%s ...\". Try \"tc class help\".", *argv);
b611d516	139	return -1;
aba5acdf SH	140	}
	141	}
	142
aba5acdf	143	if (d[0]) {
7901660a	144	ll_init_map(&rth);
aba5acdf	145
fe99adbc SP	146	req.t.tcm_ifindex = ll_name_to_index(d);
	147	if (!req.t.tcm_ifindex)
	148	return -nodev(d);
aba5acdf SH	149	}
aba5acdf SH	150
86bf43c7	151	if (rtnl_talk(&rth, &req.n, NULL) < 0)
b611d516	152	return 2;
aba5acdf	153
aba5acdf SH	154	return 0;
	155	}
	156
7e569d92 SH	157	static int filter_ifindex;
	158	static __u32 filter_qdisc;
	159	static __u32 filter_classid;
aba5acdf	160
d954b34a VK	161	static void graph_node_add(__u32 parent_id, __u32 id, void *data,
	162	int len)
	163	{
f89bb021	164	struct graph_node *node = calloc(1, sizeof(struct graph_node));
d954b34a	165
d954b34a VK	166	node->id = id;
	167	node->parent_id = parent_id;
	168
	169	if (data && len) {
	170	node->data = malloc(len);
	171	node->data_len = len;
	172	memcpy(node->data, data, len);
	173	}
	174
	175	if (parent_id == TC_H_ROOT)
	176	hlist_add_head(&node->hlist, &root_cls_list);
	177	else
	178	hlist_add_head(&node->hlist, &cls_list);
	179	}
	180
	181	static void graph_indent(char buf, struct graph_node node, int is_newline,
	182	int add_spaces)
	183	{
	184	char spaces[100] = {0};
	185
	186	while (node && node->parent_node) {
	187	node->parent_node->right_node = node;
	188	node = node->parent_node;
	189	}
	190	while (node && node->right_node) {
	191	if (node->hlist.next)
	192	strcat(buf, "\| ");
	193	else
	194	strcat(buf, " ");
	195
	196	node = node->right_node;
	197	}
	198
	199	if (is_newline) {
	200	if (node->hlist.next && node->nodes_count)
	201	strcat(buf, "\| \|");
	202	else if (node->hlist.next)
	203	strcat(buf, "\| ");
	204	else if (node->nodes_count)
	205	strcat(buf, " \|");
	206	else if (!node->hlist.next)
	207	strcat(buf, " ");
	208	}
	209	if (add_spaces > 0) {
	210	sprintf(spaces, "%-*s", add_spaces, "");
	211	strcat(buf, spaces);
	212	}
	213	}
	214
	215	static void graph_cls_show(FILE fp, char buf, struct hlist_head *root_list,
	216	int level)
	217	{
	218	struct hlist_node n, tmp_cls;
	219	char cls_id_str[256] = {};
30a8842c	220	struct rtattr *tb[TCA_MAX + 1];
d954b34a	221	struct qdisc_util *q;
b8a6088e	222	char str[300] = {};
d954b34a VK	223
	224	hlist_for_each_safe(n, tmp_cls, root_list) {
	225	struct hlist_node c, tmp_chld;
	226	struct hlist_head children = {};
	227	struct graph_node *cls = container_of(n, struct graph_node,
	228	hlist);
	229
	230	hlist_for_each_safe(c, tmp_chld, &cls_list) {
	231	struct graph_node *child = container_of(c,
	232	struct graph_node, hlist);
	233
	234	if (cls->id == child->parent_id) {
	235	hlist_del(c);
	236	hlist_add_head(c, &children);
	237	cls->nodes_count++;
	238	child->parent_node = cls;
	239	}
	240	}
	241
	242	graph_indent(buf, cls, 0, 0);
	243
	244	print_tc_classid(cls_id_str, sizeof(cls_id_str), cls->id);
b8a6088e SH	245	snprintf(str, sizeof(str),
b8a6088e SH	246	"+---(%s)", cls_id_str);
d954b34a VK	247	strcat(buf, str);
d954b34a VK	248
eae5f4b5 LM	249	parse_rtattr_flags(tb, TCA_MAX, (struct rtattr *)cls->data,
eae5f4b5 LM	250	cls->data_len, NLA_F_NESTED);
d954b34a VK	251
	252	if (tb[TCA_KIND] == NULL) {
	253	strcat(buf, " [unknown qdisc kind] ");
	254	} else {
	255	const char *kind = rta_getattr_str(tb[TCA_KIND]);
	256
	257	sprintf(str, " %s ", kind);
	258	strcat(buf, str);
	259	fprintf(fp, "%s", buf);
	260	buf[0] = '\0';
	261
	262	q = get_qdisc_kind(kind);
	263	if (q && q->print_copt) {
	264	q->print_copt(q, fp, tb[TCA_OPTIONS]);
	265	}
	266	if (q && show_stats) {
	267	int cls_indent = strlen(q->id) - 2 +
	268	strlen(cls_id_str);
	269	struct rtattr *stats = NULL;
	270
	271	graph_indent(buf, cls, 1, cls_indent);
	272
	273	if (tb[TCA_STATS] \|\| tb[TCA_STATS2]) {
	274	fprintf(fp, "\n");
	275	print_tcstats_attr(fp, tb, buf, &stats);
	276	buf[0] = '\0';
	277	}
	278	if (cls->hlist.next \|\| cls->nodes_count) {
	279	strcat(buf, "\n");
	280	graph_indent(buf, cls, 1, 0);
	281	}
	282	}
	283	}
	284	free(cls->data);
	285	fprintf(fp, "%s\n", buf);
	286	buf[0] = '\0';
	287
	288	graph_cls_show(fp, buf, &children, level + 1);
	289	if (!cls->hlist.next) {
	290	graph_indent(buf, cls, 0, 0);
	291	strcat(buf, "\n");
	292	}
	293
	294	fprintf(fp, "%s", buf);
	295	buf[0] = '\0';
	296	free(cls);
	297	}
	298	}
	299
cd554f2c	300	int print_class(struct nlmsghdr n, void arg)
aba5acdf	301	{
32a121cb	302	FILE fp = (FILE )arg;
aba5acdf SH	303	struct tcmsg *t = NLMSG_DATA(n);
aba5acdf SH	304	int len = n->nlmsg_len;
30a8842c	305	struct rtattr *tb[TCA_MAX + 1];
aba5acdf SH	306	struct qdisc_util *q;
	307	char abuf[256];
	308
	309	if (n->nlmsg_type != RTM_NEWTCLASS && n->nlmsg_type != RTM_DELTCLASS) {
	310	fprintf(stderr, "Not a class\n");
	311	return 0;
	312	}
	313	len -= NLMSG_LENGTH(sizeof(*t));
	314	if (len < 0) {
	315	fprintf(stderr, "Wrong len %d\n", len);
	316	return -1;
	317	}
d954b34a VK	318
	319	if (show_graph) {
	320	graph_node_add(t->tcm_parent, t->tcm_handle, TCA_RTA(t), len);
	321	return 0;
	322	}
	323
aba5acdf SH	324	if (filter_qdisc && TC_H_MAJ(t->tcm_handle^filter_qdisc))
	325	return 0;
	326
f4a8b23d DF	327	if (filter_classid && t->tcm_handle != filter_classid)
	328	return 0;
	329
eae5f4b5	330	parse_rtattr_flags(tb, TCA_MAX, TCA_RTA(t), len, NLA_F_NESTED);
aba5acdf SH	331
aba5acdf SH	332	if (tb[TCA_KIND] == NULL) {
2373fde9	333	fprintf(stderr, "print_class: NULL kind\n");
aba5acdf SH	334	return -1;
	335	}
	336
	337	if (n->nlmsg_type == RTM_DELTCLASS)
	338	fprintf(fp, "deleted ");
	339
	340	abuf[0] = 0;
	341	if (t->tcm_handle) {
	342	if (filter_qdisc)
	343	print_tc_classid(abuf, sizeof(abuf), TC_H_MIN(t->tcm_handle));
	344	else
	345	print_tc_classid(abuf, sizeof(abuf), t->tcm_handle);
	346	}
ff24746c	347	fprintf(fp, "class %s %s ", rta_getattr_str(tb[TCA_KIND]), abuf);
aba5acdf SH	348
	349	if (filter_ifindex == 0)
	350	fprintf(fp, "dev %s ", ll_index_to_name(t->tcm_ifindex));
	351
	352	if (t->tcm_parent == TC_H_ROOT)
	353	fprintf(fp, "root ");
	354	else {
	355	if (filter_qdisc)
	356	print_tc_classid(abuf, sizeof(abuf), TC_H_MIN(t->tcm_parent));
	357	else
	358	print_tc_classid(abuf, sizeof(abuf), t->tcm_parent);
	359	fprintf(fp, "parent %s ", abuf);
	360	}
	361	if (t->tcm_info)
	362	fprintf(fp, "leaf %x: ", t->tcm_info>>16);
	363	q = get_qdisc_kind(RTA_DATA(tb[TCA_KIND]));
	364	if (tb[TCA_OPTIONS]) {
	365	if (q && q->print_copt)
	366	q->print_copt(q, fp, tb[TCA_OPTIONS]);
	367	else
	368	fprintf(fp, "[cannot parse class parameters]");
	369	}
	370	fprintf(fp, "\n");
	371	if (show_stats) {
e5879dc6	372	struct rtattr *xstats = NULL;
ae665a52	373
e5879dc6	374	if (tb[TCA_STATS] \|\| tb[TCA_STATS2]) {
e5879dc6	375	print_tcstats_attr(fp, tb, " ", &xstats);
2c5474ad	376	fprintf(fp, "\n");
aba5acdf	377	}
e5879dc6	378	if (q && (xstats \|\| tb[TCA_XSTATS]) && q->print_xstats) {
e5879dc6	379	q->print_xstats(q, fp, xstats ? : tb[TCA_XSTATS]);
aba5acdf SH	380	fprintf(fp, "\n");
	381	}
	382	}
	383	fflush(fp);
	384	return 0;
	385	}
	386
	387
d1f28cf1	388	static int tc_class_list(int argc, char **argv)
aba5acdf	389	{
d17b136f	390	struct tcmsg t = { .tcm_family = AF_UNSPEC };
b317557f	391	char d[IFNAMSIZ] = {};
d954b34a	392	char buf[1024] = {0};
aba5acdf	393
9bea14ff NK	394	filter_qdisc = 0;
	395	filter_classid = 0;
	396
aba5acdf SH	397	while (argc > 0) {
	398	if (strcmp(*argv, "dev") == 0) {
	399	NEXT_ARG();
	400	if (d[0])
	401	duparg("dev", *argv);
	402	strncpy(d, *argv, sizeof(d)-1);
	403	} else if (strcmp(*argv, "qdisc") == 0) {
	404	NEXT_ARG();
	405	if (filter_qdisc)
	406	duparg("qdisc", *argv);
	407	if (get_qdisc_handle(&filter_qdisc, *argv))
f1675d61	408	invarg("invalid qdisc ID", *argv);
f4a8b23d DF	409	} else if (strcmp(*argv, "classid") == 0) {
	410	NEXT_ARG();
	411	if (filter_classid)
	412	duparg("classid", *argv);
	413	if (get_tc_classid(&filter_classid, *argv))
f1675d61	414	invarg("invalid class ID", *argv);
aba5acdf SH	415	} else if (strcmp(*argv, "root") == 0) {
	416	if (t.tcm_parent) {
	417	fprintf(stderr, "Error: \"root\" is duplicate parent ID\n");
b611d516	418	return -1;
aba5acdf SH	419	}
	420	t.tcm_parent = TC_H_ROOT;
	421	} else if (strcmp(*argv, "parent") == 0) {
	422	__u32 handle;
32a121cb	423
aba5acdf SH	424	if (t.tcm_parent)
	425	duparg("parent", *argv);
	426	NEXT_ARG();
	427	if (get_tc_classid(&handle, *argv))
f1675d61	428	invarg("invalid parent ID", *argv);
aba5acdf SH	429	t.tcm_parent = handle;
	430	} else if (matches(*argv, "help") == 0) {
	431	usage();
	432	} else {
	433	fprintf(stderr, "What is \"%s\"? Try \"tc class help\".\n", *argv);
b611d516	434	return -1;
aba5acdf SH	435	}
	436
	437	argc--; argv++;
	438	}
	439
3d0b7439	440	ll_init_map(&rth);
aba5acdf SH	441
aba5acdf SH	442	if (d[0]) {
fe99adbc SP	443	t.tcm_ifindex = ll_name_to_index(d);
	444	if (!t.tcm_ifindex)
	445	return -nodev(d);
aba5acdf SH	446	filter_ifindex = t.tcm_ifindex;
	447	}
	448
3d0b7439	449	if (rtnl_dump_request(&rth, RTM_GETTCLASS, &t, sizeof(t)) < 0) {
aba5acdf	450	perror("Cannot send dump request");
b611d516	451	return 1;
aba5acdf SH	452	}
aba5acdf SH	453
3d0b7439	454	if (rtnl_dump_filter(&rth, print_class, stdout) < 0) {
aba5acdf	455	fprintf(stderr, "Dump terminated\n");
b611d516	456	return 1;
aba5acdf SH	457	}
aba5acdf SH	458
d954b34a VK	459	if (show_graph)
	460	graph_cls_show(stdout, &buf[0], &root_cls_list, 0);
	461
aba5acdf SH	462	return 0;
	463	}
	464
	465	int do_class(int argc, char **argv)
	466	{
	467	if (argc < 1)
	468	return tc_class_list(0, NULL);
	469	if (matches(*argv, "add") == 0)
	470	return tc_class_modify(RTM_NEWTCLASS, NLM_F_EXCL\|NLM_F_CREATE, argc-1, argv+1);
	471	if (matches(*argv, "change") == 0)
	472	return tc_class_modify(RTM_NEWTCLASS, 0, argc-1, argv+1);
	473	if (matches(*argv, "replace") == 0)
	474	return tc_class_modify(RTM_NEWTCLASS, NLM_F_CREATE, argc-1, argv+1);
	475	if (matches(*argv, "delete") == 0)
	476	return tc_class_modify(RTM_DELTCLASS, 0, argc-1, argv+1);
	477	#if 0
	478	if (matches(*argv, "get") == 0)
	479	return tc_class_get(RTM_GETTCLASS, 0, argc-1, argv+1);
	480	#endif
	481	if (matches(argv, "list") == 0 \|\| matches(argv, "show") == 0
	482	\|\| matches(*argv, "lst") == 0)
	483	return tc_class_list(argc-1, argv+1);
e5d179d8	484	if (matches(*argv, "help") == 0) {
aba5acdf	485	usage();
e5d179d8 HT	486	return 0;
e5d179d8 HT	487	}
aba5acdf SH	488	fprintf(stderr, "Command \"%s\" is unknown, try \"tc class help\".\n", *argv);
	489	return -1;
	490	}