sbin/pfctl/pfctl_qstats.c

95 	struct pf_altq_node	*root = NULL, *node;
108 	for (node = root; node != NULL; node = node->next) {
109 		if (iface != NULL && strcmp(node->altq.ifname, iface))
115 		pfctl_print_altq_node(dev, node, 0, opts);
124 		for (node = root; node != NULL; node = node->next) {
125 			if (iface != NULL && strcmp(node->altq.ifname, iface))
128 			if (node->altq.local_flags & PFALTQ_FLAG_IF_REMOVED)
131 			pfctl_print_altq_node(dev, node, 0, opts);
141 	struct pf_altq_node	*node;
184 			if ((node = pfctl_find_altq_node(*root, pa.altq.qname,
186 				memcpy(&node->qstats.data, &qstats.data,
188 				update_avg(node);
196 			if ((node = pfctl_find_altq_node(*root, pa.altq.qname,
198 				memcpy(&node->qstats.data, &qstats.data,
200 				update_avg(node);
214 	struct pf_altq_node	*node;
216 	node = calloc(1, sizeof(struct pf_altq_node));
217 	if (node == NULL)
219 	memcpy(&node->altq, &altq, sizeof(struct pf_altq));
220 	memcpy(&node->qstats, &qstats, sizeof(qstats));
221 	node->next = node->children = NULL;
224 		*root = node;
230 		prev->next = node;
238 			parent->children = node;
244 			prev->next = node;
247 	update_avg(node);
254 	struct pf_altq_node	*node, *child;
256 	for (node = root; node != NULL; node = node->next) {
257 		if (!strcmp(node->altq.qname, qname)
258 		    && !(strcmp(node->altq.ifname, ifname)))
259 			return (node);
260 		if (node->children != NULL) {
261 			child = pfctl_find_altq_node(node->children, qname,
271 pfctl_print_altq_node(int dev, const struct pf_altq_node *node,
276 	if (node == NULL)
279 	print_altq(&node->altq, level, NULL, NULL);
281 	if (node->children != NULL) {
283 		for (child = node->children; child != NULL;
294 		pfctl_print_altq_nodestat(dev, node);
298 		    node->altq.qid, node->altq.ifname,
299 		    rate2str((double)(node->altq.ifbandwidth)));
301 	for (child = node->children; child != NULL;
439 pfctl_free_altq_node(struct pf_altq_node *node)
441 	while (node != NULL) {
444 		if (node->children != NULL)
445 			pfctl_free_altq_node(node->children);
446 		prev = node;
447 		node = node->next;