[iproute/f17] Add support for fq_codel (#886958)

Petr Šabata psabata at fedoraproject.org
Thu Dec 20 16:59:17 UTC 2012


commit 13893f58be4a9ea66e5b04f3622e6591ce5ff7fe
Author: Petr Šabata <contyk at redhat.com>
Date:   Thu Dec 20 17:59:10 2012 +0100

    Add support for fq_codel (#886958)

 iproute.spec                          |    9 +-
 iproute2-3.3.0-fq_codel-headers.patch |  125 +++++++
 iproute2-3.3.0-fq_codel.patch         |  616 +++++++++++++++++++++++++++++++++
 3 files changed, 749 insertions(+), 1 deletions(-)
---
diff --git a/iproute.spec b/iproute.spec
index ac610cb..e6f110d 100644
--- a/iproute.spec
+++ b/iproute.spec
@@ -2,7 +2,7 @@
 Summary:            Advanced IP routing and network device configuration tools
 Name:               iproute
 Version:            3.3.0
-Release:            4%{?dist}
+Release:            5%{?dist}
 Group:              Applications/System
 URL:                http://kernel.org/pub/linux/utils/net/%{name}2/
 Source0:            http://kernel.org/pub/linux/utils/net/%{name}2/%{name}2-%{version}.tar.gz
@@ -21,6 +21,8 @@ Patch9:             iproute2-2.6.39-create-peer-veth-without-a-name.patch
 Patch10:            iproute2-2.6.39-lnstat-dump-to-stdout.patch
 Patch11:            iproute2-3.7.0-ss-change-default-filter-to-include-all-soc.patch
 Patch12:            iproute2-3.7.0-ipv6-nexthop.patch
+Patch13:            iproute2-3.3.0-fq_codel.patch
+Patch14:            iproute2-3.3.0-fq_codel-headers.patch
 License:            GPLv2+ and Public Domain
 BuildRequires:      tex(latex) tex(dvips) linuxdoc-tools
 BuildRequires:      flex linux-atm-libs-devel psutils db4-devel bison
@@ -69,6 +71,8 @@ sed -i "s/_VERSION_/%{version}/" man/man8/ss.8
 %patch10 -p1 -b .lnstat-dump-to-stdout
 %patch11 -p1 -b .ss-list-all
 %patch12 -p1 -b .ipv6-nexthop
+%patch13 -p1 -b .fq_codel
+%patch14 -p1 -b .fq_codel-headers
 
 %build
 export LIBDIR=/%{_libdir}
@@ -179,6 +183,9 @@ done
 %{_includedir}/libnetlink.h
 
 %changelog
+* Thu Dec 20 2012 Petr Šabata <contyk at redhat.com> - 3.3.0-5
+- Add support for fq_codel (#886958)
+
 * Thu Dec 20 2012 Petr Šabata <contyk at redhat.com> - 3.3.0-4
 - Support IPv6 addresses for route's nexthop
 
diff --git a/iproute2-3.3.0-fq_codel-headers.patch b/iproute2-3.3.0-fq_codel-headers.patch
new file mode 100644
index 0000000..bb17ebc
--- /dev/null
+++ b/iproute2-3.3.0-fq_codel-headers.patch
@@ -0,0 +1,125 @@
+diff --git a/include/linux/pkt_sched.h b/include/linux/pkt_sched.h
+index 0d5b793..32aef0a 100644
+--- a/include/linux/pkt_sched.h
++++ b/include/linux/pkt_sched.h
+@@ -127,6 +127,27 @@ struct tc_multiq_qopt {
+ 	__u16	max_bands;		/* Maximum number of queues */
+ };
+ 
++/* PLUG section */
++
++#define TCQ_PLUG_BUFFER                0
++#define TCQ_PLUG_RELEASE_ONE           1
++#define TCQ_PLUG_RELEASE_INDEFINITE    2
++#define TCQ_PLUG_LIMIT                 3
++
++struct tc_plug_qopt {
++	/* TCQ_PLUG_BUFFER: Inset a plug into the queue and
++	 *  buffer any incoming packets
++	 * TCQ_PLUG_RELEASE_ONE: Dequeue packets from queue head
++	 *   to beginning of the next plug.
++	 * TCQ_PLUG_RELEASE_INDEFINITE: Dequeue all packets from queue.
++	 *   Stop buffering packets until the next TCQ_PLUG_BUFFER
++	 *   command is received (just act as a pass-thru queue).
++	 * TCQ_PLUG_LIMIT: Increase/decrease queue size
++	 */
++	int             action;
++	__u32           limit;
++};
++
+ /* TBF section */
+ 
+ struct tc_tbf_qopt {
+@@ -488,6 +509,7 @@ enum {
+ 	TCA_NETEM_CORRUPT,
+ 	TCA_NETEM_LOSS,
+ 	TCA_NETEM_RATE,
++	TCA_NETEM_ECN,
+ 	__TCA_NETEM_MAX,
+ };
+ 
+@@ -633,4 +655,84 @@ struct tc_qfq_stats {
+ 	__u32 lmax;
+ };
+ 
++/* CODEL */
++
++enum {
++	TCA_CODEL_UNSPEC,
++	TCA_CODEL_TARGET,
++	TCA_CODEL_LIMIT,
++	TCA_CODEL_INTERVAL,
++	TCA_CODEL_ECN,
++	__TCA_CODEL_MAX
++};
++
++#define TCA_CODEL_MAX	(__TCA_CODEL_MAX - 1)
++
++struct tc_codel_xstats {
++	__u32	maxpacket; /* largest packet we've seen so far */
++	__u32	count;	   /* how many drops we've done since the last time we
++			    * entered dropping state
++			    */
++	__u32	lastcount; /* count at entry to dropping state */
++	__u32	ldelay;    /* in-queue delay seen by most recently dequeued packet */
++	__s32	drop_next; /* time to drop next packet */
++	__u32	drop_overlimit; /* number of time max qdisc packet limit was hit */
++	__u32	ecn_mark;  /* number of packets we ECN marked instead of dropped */
++	__u32	dropping;  /* are we in dropping state ? */
++};
++
++/* FQ_CODEL */
++
++enum {
++	TCA_FQ_CODEL_UNSPEC,
++	TCA_FQ_CODEL_TARGET,
++	TCA_FQ_CODEL_LIMIT,
++	TCA_FQ_CODEL_INTERVAL,
++	TCA_FQ_CODEL_ECN,
++	TCA_FQ_CODEL_FLOWS,
++	TCA_FQ_CODEL_QUANTUM,
++	__TCA_FQ_CODEL_MAX
++};
++
++#define TCA_FQ_CODEL_MAX	(__TCA_FQ_CODEL_MAX - 1)
++
++enum {
++	TCA_FQ_CODEL_XSTATS_QDISC,
++	TCA_FQ_CODEL_XSTATS_CLASS,
++};
++
++struct tc_fq_codel_qd_stats {
++	__u32	maxpacket;	/* largest packet we've seen so far */
++	__u32	drop_overlimit; /* number of time max qdisc
++				 * packet limit was hit
++				 */
++	__u32	ecn_mark;	/* number of packets we ECN marked
++				 * instead of being dropped
++				 */
++	__u32	new_flow_count; /* number of time packets
++				 * created a 'new flow'
++				 */
++	__u32	new_flows_len;	/* count of flows in new list */
++	__u32	old_flows_len;	/* count of flows in old list */
++};
++
++struct tc_fq_codel_cl_stats {
++	__s32	deficit;
++	__u32	ldelay;		/* in-queue delay seen by most recently
++				 * dequeued packet
++				 */
++	__u32	count;
++	__u32	lastcount;
++	__u32	dropping;
++	__s32	drop_next;
++};
++
++struct tc_fq_codel_xstats {
++	__u32	type;
++	union {
++		struct tc_fq_codel_qd_stats qdisc_stats;
++		struct tc_fq_codel_cl_stats class_stats;
++	};
++};
++
+ #endif
diff --git a/iproute2-3.3.0-fq_codel.patch b/iproute2-3.3.0-fq_codel.patch
new file mode 100644
index 0000000..49e9163
--- /dev/null
+++ b/iproute2-3.3.0-fq_codel.patch
@@ -0,0 +1,616 @@
+From 863db0e7223be89230f1ee83bf86e5910d26b314 Mon Sep 17 00:00:00 2001
+From: =?UTF-8?q?Petr=20=C5=A0abata?= <contyk at redhat.com>
+Date: Thu, 20 Dec 2012 17:41:28 +0100
+Subject: [PATCH] Add fq_codel
+MIME-Version: 1.0
+Content-Type: text/plain; charset=UTF-8
+Content-Transfer-Encoding: 8bit
+
+Signed-off-by: Petr Šabata <contyk at redhat.com>
+---
+ man/man8/tc-fq_codel.8 | 108 +++++++++++++++++++++++
+ man/man8/tc.8          |  16 ++--
+ tc/Makefile            |   2 +
+ tc/q_codel.c           | 188 +++++++++++++++++++++++++++++++++++++++
+ tc/q_fq_codel.c        | 232 +++++++++++++++++++++++++++++++++++++++++++++++++
+ 5 files changed, 539 insertions(+), 7 deletions(-)
+ create mode 100644 man/man8/tc-fq_codel.8
+ create mode 100644 tc/q_codel.c
+ create mode 100644 tc/q_fq_codel.c
+
+diff --git a/man/man8/tc-fq_codel.8 b/man/man8/tc-fq_codel.8
+new file mode 100644
+index 0000000..8b43c10
+--- /dev/null
++++ b/man/man8/tc-fq_codel.8
+@@ -0,0 +1,108 @@
++.TH FQ_CoDel 8 "4 June 2012" "iproute2" "Linux"
++.SH NAME
++CoDel \- Fair Queuing (FQ) with Controlled Delay (CoDel)
++.SH SYNOPSIS
++.B tc qdisc ... fq_codel
++[
++.B limit
++PACKETS ] [
++.B flows
++NUMBER ] [
++.B target
++TIME ] [
++.B interval
++TIME ] [
++.B quantum
++BYTES ] [
++.B ecn
++|
++.B noecn
++]
++
++.SH DESCRIPTION
++FQ_Codel (Fair Queuing Controled Delay) is queuing discipline that combines Fair
++Queuing with the CoDel AQM scheme. FQ_Codel uses a stochastic model to classify
++incoming packets into different flows and is used to provide a fair share of the
++bandwidth to all the flows using the queue. Each such flow is managed by the
++CoDel queuing discipline. Reordering within a flow is avoided since Codel
++internally uses a FIFO queue.
++
++.SH PARAMETERS
++.SS limit
++has the same semantics as
++.B codel
++and is the hard limit on the real queue size.
++When this limit is reached, incoming packets are dropped. Default is 10240
++packets.
++
++.SS flows
++is the number of flows into which the incoming packets are classified. Due to
++the stochastic nature of hashing, multiple flows may end up being hashed into
++the same slot. Newer flows have priority over older ones. This parameter can be
++set only at load time since memory has to be allocated for the hash table.
++Default value is 1024.
++
++.SS target
++has the same semantics as
++.B codel
++and is the acceptable minimum
++standing/persistent queue delay. This minimum delay is identified by tracking
++the local minimum queue delay that packets experience.  Default value is 5ms.
++
++.SS interval
++has the same semantics as
++.B codel
++and is used to ensure that the measured minimum delay does not become too stale.
++The minimum delay must be experienced in the last epoch of length .B interval.
++It should be set on the order of the worst-case RTT through the bottleneck to
++give endpoints sufficient time to react.  Default value is 100ms.
++
++.SS quantum
++is the number of bytes used as 'deficit' in the fair queuing algorithm. Default
++is set to 1514 bytes which corresponds to the Ethernet MTU plus the hardware
++header length of 14 bytes.
++
++.SS ecn | noecn
++has the same semantics as
++.B codel
++and can be used to mark packets instead of dropping them.  If
++.B ecn
++has been enabled,
++.B noecn
++can be used to turn it off and vice-a-versa. Unlike
++.B codel, ecn
++is turned on by default.
++
++.SH EXAMPLES
++#tc qdisc add   dev eth0 root fq_codel
++.br
++#tc -s qdisc show
++.br
++qdisc fq_codel 8002: dev eth0 root refcnt 2 limit 10240p flows 1024 quantum 1514
++ target 5.0ms interval 100.0ms ecn
++   Sent 428514 bytes 2269 pkt (dropped 0, overlimits 0 requeues 0)
++   backlog 0b 0p requeues 0
++    maxpacket 256 drop_overlimit 0 new_flow_count 0 ecn_mark 0
++    new_flows_len 0 old_flows_len 0
++
++#tc qdisc add dev eth0 root fq_codel limit 2000 target 3ms interval 40ms noecn
++.br
++#tc -s qdisc show
++.br
++qdisc fq_codel 8003: dev eth0 root refcnt 2 limit 2000p flows 1024 quantum 1514
++target 3.0ms interval 40.0ms
++ Sent 2588985006 bytes 1783629 pkt (dropped 0, overlimits 0 requeues 34869)
++ backlog 0b 0p requeues 34869
++  maxpacket 65226 drop_overlimit 0 new_flow_count 73 ecn_mark 0
++  new_flows_len 1 old_flows_len 3
++
++
++.SH SEE ALSO
++.BR tc (8),
++.BR tc-codel (8),
++.BR tc-red (8)
++
++.SH AUTHORS
++FQ_CoDel was implemented by Eric Dumazet. This manpage was written
++by Vijay Subramanian. Please report corrections to the Linux Networking
++mailing list <netdev at vger.kernel.org>.
+diff --git a/man/man8/tc.8 b/man/man8/tc.8
+index fc8095e..953a06f 100644
+--- a/man/man8/tc.8
++++ b/man/man8/tc.8
+@@ -366,20 +366,22 @@ print rates in IEC units (ie. 1K = 1024).
+ .B tc
+ was written by Alexey N. Kuznetsov and added in Linux 2.2.
+ .SH SEE ALSO
++.BR tc-bfifo (8),
+ .BR tc-cbq (8),
+ .BR tc-choke (8),
++.BR tc-codel (8),
+ .BR tc-drr (8),
+-.BR tc-htb (8),
+-.BR tc-hfsc (8),
++.BR tc-fq_codel (8),
+ .BR tc-hfsc (7),
+-.BR tc-sfb (8),
+-.BR tc-sfq (8),
+-.BR tc-red (8),
+-.BR tc-tbf (8),
++.BR tc-hfsc (8),
++.BR tc-htb (8),
+ .BR tc-pfifo (8),
+-.BR tc-bfifo (8),
+ .BR tc-pfifo_fast (8),
++.BR tc-red (8),
++.BR tc-sfb (8),
++.BR tc-sfq (8),
+ .BR tc-stab (8),
++.BR tc-tbf (8),
+ .br
+ .RB "User documentation at " http://lartc.org/ ", but please direct bugreports and patches to: " <netdev at vger.kernel.org>
+ 
+diff --git a/tc/Makefile b/tc/Makefile
+index f523adc..c1c7647 100644
+--- a/tc/Makefile
++++ b/tc/Makefile
+@@ -47,6 +47,8 @@ TCMODULES += em_cmp.o
+ TCMODULES += em_u32.o
+ TCMODULES += em_meta.o
+ TCMODULES += q_mqprio.o
++TCMODULES += q_codel.o
++TCMODULES += q_fq_codel.o
+ 
+ TCSO :=
+ ifeq ($(TC_CONFIG_ATM),y)
+diff --git a/tc/q_codel.c b/tc/q_codel.c
+new file mode 100644
+index 0000000..826285a
+--- /dev/null
++++ b/tc/q_codel.c
+@@ -0,0 +1,188 @@
++/*
++ * Codel - The Controlled-Delay Active Queue Management algorithm
++ *
++ *  Copyright (C) 2011-2012 Kathleen Nichols <nichols at pollere.com>
++ *  Copyright (C) 2011-2012 Van Jacobson <van at pollere.com>
++ *  Copyright (C) 2012 Michael D. Taht <dave.taht at bufferbloat.net>
++ *  Copyright (C) 2012 Eric Dumazet <edumazet at google.com>
++ *
++ * Redistribution and use in source and binary forms, with or without
++ * modification, are permitted provided that the following conditions
++ * are met:
++ * 1. Redistributions of source code must retain the above copyright
++ *    notice, this list of conditions, and the following disclaimer,
++ *    without modification.
++ * 2. Redistributions in binary form must reproduce the above copyright
++ *    notice, this list of conditions and the following disclaimer in the
++ *    documentation and/or other materials provided with the distribution.
++ * 3. The names of the authors may not be used to endorse or promote products
++ *    derived from this software without specific prior written permission.
++ *
++ * Alternatively, provided that this notice is retained in full, this
++ * software may be distributed under the terms of the GNU General
++ * Public License ("GPL") version 2, in which case the provisions of the
++ * GPL apply INSTEAD OF those given above.
++ *
++ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
++ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
++ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
++ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
++ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
++ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
++ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
++ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
++ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
++ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
++ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
++ * DAMAGE.
++ *
++ */
++
++#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: ... codel [ limit PACKETS ] [ target TIME]\n");
++	fprintf(stderr, "                 [ interval TIME ] [ ecn ]\n");
++}
++
++static int codel_parse_opt(struct qdisc_util *qu, int argc, char **argv,
++			   struct nlmsghdr *n)
++{
++	unsigned limit = 0;
++	unsigned target = 0;
++	unsigned interval = 0;
++	int ecn = -1;
++	struct rtattr *tail;
++
++	while (argc > 0) {
++		if (strcmp(*argv, "limit") == 0) {
++			NEXT_ARG();
++			if (get_unsigned(&limit, *argv, 0)) {
++				fprintf(stderr, "Illegal \"limit\"\n");
++				return -1;
++			}
++		} else if (strcmp(*argv, "target") == 0) {
++			NEXT_ARG();
++			if (get_time(&target, *argv)) {
++				fprintf(stderr, "Illegal \"target\"\n");
++				return -1;
++			}
++		} else if (strcmp(*argv, "interval") == 0) {
++			NEXT_ARG();
++			if (get_time(&interval, *argv)) {
++				fprintf(stderr, "Illegal \"interval\"\n");
++				return -1;
++			}
++		} else if (strcmp(*argv, "ecn") == 0) {
++			ecn = 1;
++		} else if (strcmp(*argv, "noecn") == 0) {
++			ecn = 0;
++		} else if (strcmp(*argv, "help") == 0) {
++			explain();
++			return -1;
++		} else {
++			fprintf(stderr, "What is \"%s\"?\n", *argv);
++			explain();
++			return -1;
++		}
++		argc--; argv++;
++	}
++
++	tail = NLMSG_TAIL(n);
++	addattr_l(n, 1024, TCA_OPTIONS, NULL, 0);
++	if (limit)
++		addattr_l(n, 1024, TCA_CODEL_LIMIT, &limit, sizeof(limit));
++	if (interval)
++		addattr_l(n, 1024, TCA_CODEL_INTERVAL, &interval, sizeof(interval));
++	if (target)
++		addattr_l(n, 1024, TCA_CODEL_TARGET, &target, sizeof(target));
++	if (ecn != -1)
++		addattr_l(n, 1024, TCA_CODEL_ECN, &ecn, sizeof(ecn));
++	tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
++	return 0;
++}
++
++static int codel_print_opt(struct qdisc_util *qu, FILE *f, struct rtattr *opt)
++{
++	struct rtattr *tb[TCA_CODEL_MAX + 1];
++	unsigned limit;
++	unsigned interval;
++	unsigned target;
++	unsigned ecn;
++	SPRINT_BUF(b1);
++
++	if (opt == NULL)
++		return 0;
++
++	parse_rtattr_nested(tb, TCA_CODEL_MAX, opt);
++
++	if (tb[TCA_CODEL_LIMIT] &&
++	    RTA_PAYLOAD(tb[TCA_CODEL_LIMIT]) >= sizeof(__u32)) {
++		limit = rta_getattr_u32(tb[TCA_CODEL_LIMIT]);
++		fprintf(f, "limit %up ", limit);
++	}
++	if (tb[TCA_CODEL_TARGET] &&
++	    RTA_PAYLOAD(tb[TCA_CODEL_TARGET]) >= sizeof(__u32)) {
++		target = rta_getattr_u32(tb[TCA_CODEL_TARGET]);
++		fprintf(f, "target %s ", sprint_time(target, b1));
++	}
++	if (tb[TCA_CODEL_INTERVAL] &&
++	    RTA_PAYLOAD(tb[TCA_CODEL_INTERVAL]) >= sizeof(__u32)) {
++		interval = rta_getattr_u32(tb[TCA_CODEL_INTERVAL]);
++		fprintf(f, "interval %s ", sprint_time(interval, b1));
++	}
++	if (tb[TCA_CODEL_ECN] &&
++	    RTA_PAYLOAD(tb[TCA_CODEL_ECN]) >= sizeof(__u32)) {
++		ecn = rta_getattr_u32(tb[TCA_CODEL_ECN]);
++		if (ecn)
++			fprintf(f, "ecn ");
++	}
++
++	return 0;
++}
++
++static int codel_print_xstats(struct qdisc_util *qu, FILE *f,
++			      struct rtattr *xstats)
++{
++	struct tc_codel_xstats *st;
++	SPRINT_BUF(b1);
++
++	if (xstats == NULL)
++		return 0;
++
++	if (RTA_PAYLOAD(xstats) < sizeof(*st))
++		return -1;
++
++	st = RTA_DATA(xstats);
++	fprintf(f, "  count %u lastcount %u ldelay %s",
++		st->count, st->lastcount, sprint_time(st->ldelay, b1));
++	if (st->dropping)
++		fprintf(f, " dropping");
++	if (st->drop_next < 0)
++		fprintf(f, " drop_next -%s", sprint_time(-st->drop_next, b1));
++	else
++		fprintf(f, " drop_next %s", sprint_time(st->drop_next, b1));
++	fprintf(f, "\n  maxpacket %u ecn_mark %u drop_overlimit %u",
++		st->maxpacket, st->ecn_mark, st->drop_overlimit);
++	return 0;
++
++}
++
++struct qdisc_util codel_qdisc_util = {
++	.id		= "codel",
++	.parse_qopt	= codel_parse_opt,
++	.print_qopt	= codel_print_opt,
++	.print_xstats	= codel_print_xstats,
++};
+diff --git a/tc/q_fq_codel.c b/tc/q_fq_codel.c
+new file mode 100644
+index 0000000..1d3bfa2
+--- /dev/null
++++ b/tc/q_fq_codel.c
+@@ -0,0 +1,232 @@
++/*
++ * Fair Queue Codel
++ *
++ *  Copyright (C) 2012 Eric Dumazet <edumazet at google.com>
++ *
++ * Redistribution and use in source and binary forms, with or without
++ * modification, are permitted provided that the following conditions
++ * are met:
++ * 1. Redistributions of source code must retain the above copyright
++ *    notice, this list of conditions, and the following disclaimer,
++ *    without modification.
++ * 2. Redistributions in binary form must reproduce the above copyright
++ *    notice, this list of conditions and the following disclaimer in the
++ *    documentation and/or other materials provided with the distribution.
++ * 3. The names of the authors may not be used to endorse or promote products
++ *    derived from this software without specific prior written permission.
++ *
++ * Alternatively, provided that this notice is retained in full, this
++ * software may be distributed under the terms of the GNU General
++ * Public License ("GPL") version 2, in which case the provisions of the
++ * GPL apply INSTEAD OF those given above.
++ *
++ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
++ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
++ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
++ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
++ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
++ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
++ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
++ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
++ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
++ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
++ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
++ * DAMAGE.
++ *
++ */
++
++#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: ... fq_codel [ limit PACKETS ] [ flows NUMBER ]\n");
++	fprintf(stderr, "                    [ target TIME] [ interval TIME ]\n");
++	fprintf(stderr, "                    [ quantum BYTES ] [ [no]ecn ]\n");
++}
++
++static int fq_codel_parse_opt(struct qdisc_util *qu, int argc, char **argv,
++			      struct nlmsghdr *n)
++{
++	unsigned limit = 0;
++	unsigned flows = 0;
++	unsigned target = 0;
++	unsigned interval = 0;
++	unsigned quantum = 0;
++	int ecn = -1;
++	struct rtattr *tail;
++
++	while (argc > 0) {
++		if (strcmp(*argv, "limit") == 0) {
++			NEXT_ARG();
++			if (get_unsigned(&limit, *argv, 0)) {
++				fprintf(stderr, "Illegal \"limit\"\n");
++				return -1;
++			}
++		} else if (strcmp(*argv, "flows") == 0) {
++			NEXT_ARG();
++			if (get_unsigned(&flows, *argv, 0)) {
++				fprintf(stderr, "Illegal \"flows\"\n");
++				return -1;
++			}
++		} else if (strcmp(*argv, "quantum") == 0) {
++			NEXT_ARG();
++			if (get_unsigned(&quantum, *argv, 0)) {
++				fprintf(stderr, "Illegal \"quantum\"\n");
++				return -1;
++			}
++		} else if (strcmp(*argv, "target") == 0) {
++			NEXT_ARG();
++			if (get_time(&target, *argv)) {
++				fprintf(stderr, "Illegal \"target\"\n");
++				return -1;
++			}
++		} else if (strcmp(*argv, "interval") == 0) {
++			NEXT_ARG();
++			if (get_time(&interval, *argv)) {
++				fprintf(stderr, "Illegal \"interval\"\n");
++				return -1;
++			}
++		} else if (strcmp(*argv, "ecn") == 0) {
++			ecn = 1;
++		} else if (strcmp(*argv, "noecn") == 0) {
++			ecn = 0;
++		} else if (strcmp(*argv, "help") == 0) {
++			explain();
++			return -1;
++		} else {
++			fprintf(stderr, "What is \"%s\"?\n", *argv);
++			explain();
++			return -1;
++		}
++		argc--; argv++;
++	}
++
++	tail = NLMSG_TAIL(n);
++	addattr_l(n, 1024, TCA_OPTIONS, NULL, 0);
++	if (limit)
++		addattr_l(n, 1024, TCA_FQ_CODEL_LIMIT, &limit, sizeof(limit));
++	if (flows)
++		addattr_l(n, 1024, TCA_FQ_CODEL_FLOWS, &flows, sizeof(flows));
++	if (quantum)
++		addattr_l(n, 1024, TCA_FQ_CODEL_QUANTUM, &quantum, sizeof(quantum));
++	if (interval)
++		addattr_l(n, 1024, TCA_FQ_CODEL_INTERVAL, &interval, sizeof(interval));
++	if (target)
++		addattr_l(n, 1024, TCA_FQ_CODEL_TARGET, &target, sizeof(target));
++	if (ecn != -1)
++		addattr_l(n, 1024, TCA_FQ_CODEL_ECN, &ecn, sizeof(ecn));
++	tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
++	return 0;
++}
++
++static int fq_codel_print_opt(struct qdisc_util *qu, FILE *f, struct rtattr *opt)
++{
++	struct rtattr *tb[TCA_FQ_CODEL_MAX + 1];
++	unsigned limit;
++	unsigned flows;
++	unsigned interval;
++	unsigned target;
++	unsigned ecn;
++	unsigned quantum;
++	SPRINT_BUF(b1);
++
++	if (opt == NULL)
++		return 0;
++
++	parse_rtattr_nested(tb, TCA_FQ_CODEL_MAX, opt);
++
++	if (tb[TCA_FQ_CODEL_LIMIT] &&
++	    RTA_PAYLOAD(tb[TCA_FQ_CODEL_LIMIT]) >= sizeof(__u32)) {
++		limit = rta_getattr_u32(tb[TCA_FQ_CODEL_LIMIT]);
++		fprintf(f, "limit %up ", limit);
++	}
++	if (tb[TCA_FQ_CODEL_FLOWS] &&
++	    RTA_PAYLOAD(tb[TCA_FQ_CODEL_FLOWS]) >= sizeof(__u32)) {
++		flows = rta_getattr_u32(tb[TCA_FQ_CODEL_FLOWS]);
++		fprintf(f, "flows %u ", flows);
++	}
++	if (tb[TCA_FQ_CODEL_QUANTUM] &&
++	    RTA_PAYLOAD(tb[TCA_FQ_CODEL_QUANTUM]) >= sizeof(__u32)) {
++		quantum = rta_getattr_u32(tb[TCA_FQ_CODEL_QUANTUM]);
++		fprintf(f, "quantum %u ", quantum);
++	}
++	if (tb[TCA_FQ_CODEL_TARGET] &&
++	    RTA_PAYLOAD(tb[TCA_FQ_CODEL_TARGET]) >= sizeof(__u32)) {
++		target = rta_getattr_u32(tb[TCA_FQ_CODEL_TARGET]);
++		fprintf(f, "target %s ", sprint_time(target, b1));
++	}
++	if (tb[TCA_FQ_CODEL_INTERVAL] &&
++	    RTA_PAYLOAD(tb[TCA_FQ_CODEL_INTERVAL]) >= sizeof(__u32)) {
++		interval = rta_getattr_u32(tb[TCA_FQ_CODEL_INTERVAL]);
++		fprintf(f, "interval %s ", sprint_time(interval, b1));
++	}
++	if (tb[TCA_FQ_CODEL_ECN] &&
++	    RTA_PAYLOAD(tb[TCA_FQ_CODEL_ECN]) >= sizeof(__u32)) {
++		ecn = rta_getattr_u32(tb[TCA_FQ_CODEL_ECN]);
++		if (ecn)
++			fprintf(f, "ecn ");
++	}
++
++	return 0;
++}
++
++static int fq_codel_print_xstats(struct qdisc_util *qu, FILE *f,
++				 struct rtattr *xstats)
++{
++	struct tc_fq_codel_xstats *st;
++	SPRINT_BUF(b1);
++
++	if (xstats == NULL)
++		return 0;
++
++	if (RTA_PAYLOAD(xstats) < sizeof(*st))
++		return -1;
++
++	st = RTA_DATA(xstats);
++	if (st->type == TCA_FQ_CODEL_XSTATS_QDISC) {
++		fprintf(f, "  maxpacket %u drop_overlimit %u new_flow_count %u ecn_mark %u",
++			st->qdisc_stats.maxpacket,
++			st->qdisc_stats.drop_overlimit,
++			st->qdisc_stats.new_flow_count,
++			st->qdisc_stats.ecn_mark);
++		fprintf(f, "\n  new_flows_len %u old_flows_len %u",
++			st->qdisc_stats.new_flows_len,
++			st->qdisc_stats.old_flows_len);
++	}
++	if (st->type == TCA_FQ_CODEL_XSTATS_CLASS) {
++		fprintf(f, "  deficit %d count %u lastcount %u ldelay %s",
++			st->class_stats.deficit,
++			st->class_stats.count,
++			st->class_stats.lastcount,
++			sprint_time(st->class_stats.ldelay, b1));
++		if (st->class_stats.dropping) {
++			fprintf(f, " dropping");
++			if (st->class_stats.drop_next < 0)
++				fprintf(f, " drop_next -%s",
++					sprint_time(-st->class_stats.drop_next, b1));
++			else
++				fprintf(f, " drop_next %s",
++					sprint_time(st->class_stats.drop_next, b1));
++		}
++	}
++	return 0;
++
++}
++
++struct qdisc_util fq_codel_qdisc_util = {
++	.id		= "fq_codel",
++	.parse_qopt	= fq_codel_parse_opt,
++	.print_qopt	= fq_codel_print_opt,
++	.print_xstats	= fq_codel_print_xstats,
++};
+-- 
+1.7.11.7
+


More information about the scm-commits mailing list