From ec65031c65c10110cbbefbeb222984813782ebb3 Mon Sep 17 00:00:00 2001

From: Phil Sutter <psutter@redhat.com>

Date: Mon, 7 Mar 2016 20:45:51 +0100

Subject: [PATCH] man8: scrub trailing whitespace

Bugzilla: https://bugzilla.redhat.com/show_bug.cgi?id=1251186

Upstream Status: iproute2.git commit 5699275b424c6

commit 5699275b424c637edc60f46c89071d4e8f4edde3

Author: Stephen Hemminger <shemming@brocade.com>

Date:   Mon Nov 23 15:41:37 2015 -0800

    man8: scrub trailing whitespace

    Remove extraneous whitespace

---

 man/man8/bridge.8         |   6 +-

 man/man8/ip-addrlabel.8   |   5 +-

 man/man8/ip-neighbour.8   |   4 +-

 man/man8/ip-ntable.8      |   4 +-

 man/man8/ip-rule.8        |   2 +-

 man/man8/ip-xfrm.8        |   2 +-

 man/man8/ip.8             |   2 +-

 man/man8/routel.8         |  20 +++---

 man/man8/rtacct.8         |   1 -

 man/man8/rtmon.8          |   8 +--

 man/man8/ss.8             |   6 +-

 man/man8/tc-bfifo.8       |  32 ++++-----

 man/man8/tc-cbq-details.8 | 178 +++++++++++++++++++++++-----------------------

 man/man8/tc-cbq.8         | 158 ++++++++++++++++++++--------------------

 man/man8/tc-drr.8         |   1 -

 man/man8/tc-htb.8         |  80 ++++++++++-----------

 man/man8/tc-netem.8       |  22 +++---

 man/man8/tc-pfifo_fast.8  |  14 ++--

 man/man8/tc-prio.8        |  28 ++++----

 man/man8/tc-red.8         |  62 ++++++++--------

 man/man8/tc-sfq.8         |  40 +++++------

 man/man8/tc-tbf.8         |  48 ++++++-------

 man/man8/tc.8             |   1 -

 23 files changed, 351 insertions(+), 373 deletions(-)

diff --git a/man/man8/bridge.8 b/man/man8/bridge.8

index 4fcf2e8..3cda7d6 100644

--- a/man/man8/bridge.8

+++ b/man/man8/bridge.8

@@ -84,7 +84,7 @@ bridge \- show / manipulate bridge addresses and devices

 .BR "bridge vlan" " { " add " | " del " } "

 .B  dev

 .IR DEV

-.B  vid 

+.B  vid

 .IR VID " [ "

 .BR  pvid " ] [ " untagged " ]  [ "

 .BR  self " ]  [ " master " ] "

@@ -142,7 +142,7 @@ to

 - Bridge port.

 .TP

-.B fdb 

+.B fdb

 - Forwarding Database entry.

 .TP

@@ -340,7 +340,7 @@ If omitted the default value is used.

 .BI via " DEVICE"

 device name of the outgoing interface for the

 VXLAN device driver to reach the

-remote VXLAN tunnel endpoint. 

+remote VXLAN tunnel endpoint.

 .SS bridge fdb append - append a forwarding database entry

 This command adds a new fdb entry with an already known

diff --git a/man/man8/ip-addrlabel.8 b/man/man8/ip-addrlabel.8

index 5fc18fe..51ef572 100644

--- a/man/man8/ip-addrlabel.8

+++ b/man/man8/ip-addrlabel.8

@@ -7,8 +7,8 @@ ip-addrlabel \- protocol address label management

 .in +8

 .ti -8

 .B ip

-.RI "[ " OPTIONS " ]" 

-.B addrlabel 

+.RI "[ " OPTIONS " ]"

+.B addrlabel

 .RI " { " COMMAND " | "

 .BR help " }"

 .sp

@@ -66,4 +66,3 @@ flush all address labels in the kernel. This does not restore any default settin

 .SH AUTHOR

 Manpage by Yoshifuji Hideaki / 吉藤英明

-

diff --git a/man/man8/ip-neighbour.8 b/man/man8/ip-neighbour.8

index f3068f4..c94c654 100644

--- a/man/man8/ip-neighbour.8

+++ b/man/man8/ip-neighbour.8

@@ -38,9 +38,9 @@ ip-neighbour \- neighbour/arp tables management.

 .BR permanent " | " noarp " | " stale " | " reachable " }"

 .SH DESCRIPTION

-The 

+The

 .B ip neigh

-command manipulates 

+command manipulates

 .I neighbour

 objects that establish bindings between protocol addresses and

 link layer addresses for hosts sharing the same link.

diff --git a/man/man8/ip-ntable.8 b/man/man8/ip-ntable.8

index 2b95632..4f0f2e5 100644

--- a/man/man8/ip-ntable.8

+++ b/man/man8/ip-ntable.8

@@ -60,7 +60,7 @@ ip-ntable - neighbour table configuration

 .SH DESCRIPTION

 .I ip ntable

-controls the parameters for the neighbour tables. 

+controls the parameters for the neighbour tables.

 .SS ip ntable show - list the ip neighbour tables

@@ -103,4 +103,4 @@ default value (3) to 8 packets.

 .BR ip (8)

 .SH AUTHOR

-Manpage by Stephen Hemminger 

+Manpage by Stephen Hemminger

diff --git a/man/man8/ip-rule.8 b/man/man8/ip-rule.8

index 2594ff3..0661061 100644

--- a/man/man8/ip-rule.8

+++ b/man/man8/ip-rule.8

@@ -62,7 +62,7 @@ ip-rule \- routing policy database management

 .SH DESCRIPTION

 .I ip rule

-manipulates rules 

+manipulates rules

 in the routing policy database control the route selection algorithm.

 .P

diff --git a/man/man8/ip-xfrm.8 b/man/man8/ip-xfrm.8

index a9c5890..aa04804 100644

--- a/man/man8/ip-xfrm.8

+++ b/man/man8/ip-xfrm.8

@@ -119,7 +119,7 @@ ip-xfrm \- transform configuration

 .ti -8

 .IR ALGO " :="

-.RB "{ " enc " | " auth " } " 

+.RB "{ " enc " | " auth " } "

 .IR ALGO-NAME " " ALGO-KEYMAT " |"

 .br

 .B auth-trunc

diff --git a/man/man8/ip.8 b/man/man8/ip.8

index c28cee0..a95264d 100644

--- a/man/man8/ip.8

+++ b/man/man8/ip.8

@@ -12,7 +12,7 @@ ip \- show / manipulate routing, devices, policy routing and tunnels

 .sp

 .ti -8

-.B ip 

+.B ip

 .RB "[ " -force " ] "

 .BI "-batch " filename

 .sp

diff --git a/man/man8/routel.8 b/man/man8/routel.8

index cdf8f55..82d580f 100644

--- a/man/man8/routel.8

+++ b/man/man8/routel.8

@@ -1,16 +1,16 @@

 .TH "ROUTEL" "8" "3 Jan, 2008" "iproute2" "Linux"

 .SH "NAME"

-.LP 

+.LP

 routel \- list routes with pretty output format

 .br

 routef \- flush routes

 .SH "SYNTAX"

-.LP 

+.LP

 routel [\fItablenr\fP [\fIraw ip args...\fP]]

-.br 

+.br

 routef

 .SH "DESCRIPTION"

-.LP 

+.LP

 These programs are a set of helper scripts you can use instead of raw iproute2 commands.

 .br

 The routel script will list routes in a format that some might consider easier to interpret then the ip route list equivalent.

@@ -18,15 +18,15 @@ The routel script will list routes in a format that some might consider easier t

 The routef script does not take any arguments and will simply flush the routing table down the drain. Beware! This means deleting all routes which will make your network unusable!

 .SH "FILES"

-.LP 

-\fI/usr/bin/routef\fP 

-.br 

-\fI/usr/bin/routel\fP 

+.LP

+\fI/usr/bin/routef\fP

+.br

+\fI/usr/bin/routel\fP

 .SH "AUTHORS"

-.LP 

+.LP

 The routel script was written by Stephen R. van den Berg <srb@cuci.nl>, 1999/04/18 and donated to the public domain.

 .br

 This manual page was written by Andreas Henriksson  <andreas@fatal.se>, for the Debian GNU/Linux system.

 .SH "SEE ALSO"

-.LP 

+.LP

 ip(8)

diff --git a/man/man8/rtacct.8 b/man/man8/rtacct.8

index fb9afe8..b10839f 100644

--- a/man/man8/rtacct.8

+++ b/man/man8/rtacct.8

@@ -45,4 +45,3 @@ Time interval to average rates. Default value is 60 seconds.

 .SH SEE ALSO

 lnstat(8)

-

diff --git a/man/man8/rtmon.8 b/man/man8/rtmon.8

index 0538752..38a2b77 100644

--- a/man/man8/rtmon.8

+++ b/man/man8/rtmon.8

@@ -10,11 +10,11 @@ This manual page documents briefly the

 command.

 .PP

 .B rtmon

-listens on 

-.I netlink 

+listens on

+.I netlink

 socket and monitors routing table changes.

-.I rtmon 

+.I rtmon

 can be started before the first network configuration command is issued.

 For example if you insert:

@@ -61,7 +61,7 @@ to display logged output from file.

 .SH SEE ALSO

 .BR ip (8)

 .SH AUTHOR

-.B rtmon 

+.B rtmon

 was written by Alexey Kuznetsov <kuznet@ms2.inr.ac.ru>.

 .PP

 This manual page was written by Michael Prokop <mika@grml.org>,

diff --git a/man/man8/ss.8 b/man/man8/ss.8

index 6afbabb..f4d5264 100644

--- a/man/man8/ss.8

+++ b/man/man8/ss.8

@@ -12,7 +12,7 @@ to

 It can display more TCP and state informations than other tools.

 .SH OPTIONS

-When no option is used ss displays a list of 

+When no option is used ss displays a list of

 open non-listening sockets (e.g. TCP/UNIX/UDP) that have established connection.

 .TP

 .B \-h, \-\-help

@@ -189,10 +189,10 @@ List all the tcp sockets in state FIN-WAIT-1 for our apache to network 193.233.7

 .BR /usr/share/doc/iproute-doc/ss.html " (package iproute­doc)",

 .br

 .BR RFC " 793 "

-- https://tools.ietf.org/rfc/rfc793.txt (TCP states) 

+- https://tools.ietf.org/rfc/rfc793.txt (TCP states)

 .SH AUTHOR

-.I ss 

+.I ss

 was written by Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>.

 .PP

 This manual page was written by Michael Prokop <mika@grml.org>

diff --git a/man/man8/tc-bfifo.8 b/man/man8/tc-bfifo.8

index f04090c..3e29032 100644

--- a/man/man8/tc-bfifo.8

+++ b/man/man8/tc-bfifo.8

@@ -6,37 +6,37 @@ bfifo \- Byte limited First In, First Out queue

 .SH SYNOPSIS

 .B tc qdisc ... add pfifo

-.B [ limit 

+.B [ limit

 packets

 .B ]

 .P

 .B tc qdisc ... add bfifo

-.B [ limit 

+.B [ limit

 bytes

 .B ]

 .SH DESCRIPTION

 The pfifo and bfifo qdiscs are unadorned First In, First Out queues. They are the

-simplest queues possible and therefore have no overhead. 

+simplest queues possible and therefore have no overhead.

 .B pfifo

-constrains the queue size as measured in packets. 

+constrains the queue size as measured in packets.

 .B bfifo

 does so as measured in bytes.

-Like all non-default qdiscs, they maintain statistics. This might be a reason to prefer 

+Like all non-default qdiscs, they maintain statistics. This might be a reason to prefer

 pfifo or bfifo over the default.

 .SH ALGORITHM

 A list of packets is maintained, when a packet is enqueued it gets inserted at the tail of

-a list. When a packet needs to be sent out to the network, it is taken from the head of the list. 

+a list. When a packet needs to be sent out to the network, it is taken from the head of the list.

 If the list is too long, no further packets are allowed on. This is called 'tail drop'.

 .SH PARAMETERS

-.TP 

+.TP

 limit

-Maximum queue size. Specified in bytes for bfifo, in packets for pfifo. For pfifo, defaults 

-to the interface txqueuelen, as specified with 

+Maximum queue size. Specified in bytes for bfifo, in packets for pfifo. For pfifo, defaults

+to the interface txqueuelen, as specified with

 .BR ifconfig (8)

 or

 .BR ip (8).

@@ -48,20 +48,20 @@ The range for this parameter is [0, UINT32_MAX] bytes.

 Note: The link layer header was considered when counting packets length.

 .SH OUTPUT

-The output of 

+The output of

 .B tc -s qdisc ls

-contains the limit, either in packets or in bytes, and the number of bytes 

-and packets actually sent. An unsent and dropped packet only appears between braces 

+contains the limit, either in packets or in bytes, and the number of bytes

+and packets actually sent. An unsent and dropped packet only appears between braces

 and is not counted as 'Sent'.

-In this example, the queue length is 100 packets, 45894 bytes were sent over 681 packets. 

+In this example, the queue length is 100 packets, 45894 bytes were sent over 681 packets.

 No packets were dropped, and as the pfifo queue does not slow down packets, there were also no

 overlimits:

 .P

 .nf

-# tc -s qdisc ls dev eth0 

+# tc -s qdisc ls dev eth0

 qdisc pfifo 8001: dev eth0 limit 100p

- Sent 45894 bytes 681 pkts (dropped 0, overlimits 0) 

+ Sent 45894 bytes 681 pkts (dropped 0, overlimits 0)

 .fi

 If a backlog occurs, this is displayed as well.

@@ -72,5 +72,3 @@ If a backlog occurs, this is displayed as well.

 Alexey N. Kuznetsov, <kuznet@ms2.inr.ac.ru>

 This manpage maintained by bert hubert <ahu@ds9a.nl>

-

-

diff --git a/man/man8/tc-cbq-details.8 b/man/man8/tc-cbq-details.8

index 86353b5..9368103 100644

--- a/man/man8/tc-cbq-details.8

+++ b/man/man8/tc-cbq-details.8

@@ -5,54 +5,54 @@ CBQ \- Class Based Queueing

 .B tc qdisc ... dev

 dev

 .B  ( parent

-classid 

-.B | root) [ handle 

-major: 

+classid

+.B | root) [ handle

+major:

 .B ] cbq avpkt

 bytes

 .B bandwidth

 rate

-.B [ cell 

+.B [ cell

 bytes

 .B ] [ ewma

 log

 .B ] [ mpu

 bytes

-.B ] 

+.B ]

 .B tc class ... dev

 dev

-.B parent 

+.B parent

 major:[minor]

-.B [ classid 

+.B [ classid

 major:minor

 .B ] cbq allot

 bytes

-.B [ bandwidth 

-rate 

-.B ] [ rate 

+.B [ bandwidth

+rate

+.B ] [ rate

 rate

 .B ] prio

 priority

 .B [ weight

 weight

-.B ] [ minburst 

+.B ] [ minburst

+packets

+.B ] [ maxburst

 packets

-.B ] [ maxburst 

-packets 

-.B ] [ ewma 

+.B ] [ ewma

 log

 .B ] [ cell

 bytes

 .B ] avpkt

 bytes

 .B [ mpu

-bytes 

+bytes

 .B ] [ bounded isolated ] [ split

 handle

 .B & defmap

 defmap

-.B ] [ estimator 

+.B ] [ estimator

 interval timeconstant

 .B ]

@@ -60,7 +60,7 @@ interval timeconstant

 Class Based Queueing is a classful qdisc that implements a rich

 linksharing hierarchy of classes. It contains shaping elements as

 well as prioritizing capabilities. Shaping is performed using link

-idle time calculations based on the timing of dequeue events and 

+idle time calculations based on the timing of dequeue events and

 underlying link bandwidth.

 .SH SHAPING ALGORITHM

@@ -71,10 +71,10 @@ When shaping a 10mbit/s connection to 1mbit/s, the link will

 be idle 90% of the time. If it isn't, it needs to be throttled so that it

 IS idle 90% of the time.

-From the kernel's perspective, this is hard to measure, so CBQ instead 

-derives the idle time from the number of microseconds (in fact, jiffies) 

-that elapse between  requests from the device driver for more data. Combined 

-with the  knowledge of packet sizes, this is used to approximate how full or 

+From the kernel's perspective, this is hard to measure, so CBQ instead

+derives the idle time from the number of microseconds (in fact, jiffies)

+that elapse between  requests from the device driver for more data. Combined

+with the  knowledge of packet sizes, this is used to approximate how full or

 empty the link is.

 This is rather circumspect and doesn't always arrive at proper

@@ -84,9 +84,9 @@ perhaps because of a badly implemented driver? A PCMCIA network card

 will also never achieve 100mbit/s because of the way the bus is

 designed - again, how do we calculate the idle time?

-The physical link bandwidth may be ill defined in case of not-quite-real 

-network devices like PPP over Ethernet or PPTP over TCP/IP. The effective 

-bandwidth in that case is probably determined by the efficiency of pipes 

+The physical link bandwidth may be ill defined in case of not-quite-real

+network devices like PPP over Ethernet or PPTP over TCP/IP. The effective

+bandwidth in that case is probably determined by the efficiency of pipes

 to userspace - which not defined.

 During operations, the effective idletime is measured using an

@@ -104,59 +104,59 @@ CBQ throttles and is then 'overlimit'.

 Conversely, an idle link might amass a huge avgidle, which would then

 allow infinite bandwidths after a few hours of silence. To prevent

-this, avgidle is capped at 

+this, avgidle is capped at

 .B maxidle.

 If overlimit, in theory, the CBQ could throttle itself for exactly the

 amount of time that was calculated to pass between packets, and then

 pass one packet, and throttle again. Due to timer resolution constraints,

-this may not be feasible, see the 

+this may not be feasible, see the

 .B minburst

 parameter below.

 .SH CLASSIFICATION

 Within the one CBQ instance many classes may exist. Each of these classes

-contains another qdisc, by default 

+contains another qdisc, by default

 .BR tc-pfifo (8).

-When enqueueing a packet, CBQ starts at the root and uses various methods to 

+When enqueueing a packet, CBQ starts at the root and uses various methods to

 determine which class should receive the data. If a verdict is reached, this

 process is repeated for the recipient class which might have further

 means of classifying traffic to its children, if any.

-CBQ has the following methods available to classify a packet to any child 

+CBQ has the following methods available to classify a packet to any child

 classes.

 .TP

 (i)

 .B skb->priority class encoding.

-Can be set from userspace by an application with the 

+Can be set from userspace by an application with the

 .B SO_PRIORITY

 setsockopt.

-The 

+The

 .B skb->priority class encoding

-only applies if the skb->priority holds a major:minor handle of an existing 

+only applies if the skb->priority holds a major:minor handle of an existing

 class within  this qdisc.

 .TP

 (ii)

 tc filters attached to the class.

 .TP

 (iii)

-The defmap of a class, as set with the 

+The defmap of a class, as set with the

 .B split & defmap

 parameters. The defmap may contain instructions for each possible Linux packet

 priority.

 .P

-Each class also has a 

+Each class also has a

 .B level.

 Leaf nodes, attached to the bottom of the class hierarchy, have a level of 0.

 .SH CLASSIFICATION ALGORITHM

-Classification is a loop, which terminates when a leaf class is found. At any 

+Classification is a loop, which terminates when a leaf class is found. At any

 point the loop may jump to the fallback algorithm.

 The loop consists of the following steps:

-.TP 

+.TP

 (i)

 If the packet is generated locally and has a valid classid encoded within its

 .B skb->priority,

@@ -169,40 +169,40 @@ a class which is not a leaf class, restart loop from the class returned.

 If it is a leaf, choose it and terminate.

 .TP

 (iii)

-If the tc filters did not return a class, but did return a classid, 

-try to find a class with that id within this qdisc. 

+If the tc filters did not return a class, but did return a classid,

+try to find a class with that id within this qdisc.

 Check if the found class is of a lower

 .B level

 than the current class. If so, and the returned class is not a leaf node,

 restart the loop at the found class. If it is a leaf node, terminate.

-If we found an upward reference to a higher level, enter the fallback 

+If we found an upward reference to a higher level, enter the fallback

 algorithm.

 .TP

 (iv)

 If the tc filters did not return a class, nor a valid reference to one,

 consider the minor number of the reference to be the priority. Retrieve

 a class from the defmap of this class for the priority. If this did not

-contain a class, consult the defmap of this class for the 

+contain a class, consult the defmap of this class for the

+.B BEST_EFFORT

+class. If this is an upward reference, or no

 .B BEST_EFFORT

-class. If this is an upward reference, or no 

-.B BEST_EFFORT 

 class was defined,

 enter the fallback algorithm. If a valid class was found, and it is not a

-leaf node, restart the loop at this class. If it is a leaf, choose it and 

+leaf node, restart the loop at this class. If it is a leaf, choose it and

 terminate. If

-neither the priority distilled from the classid, nor the 

-.B BEST_EFFORT 

+neither the priority distilled from the classid, nor the

+.B BEST_EFFORT

 priority yielded a class, enter the fallback algorithm.

 .P

 The fallback algorithm resides outside of the loop and is as follows.

 .TP

 (i)

-Consult the defmap of the class at which the jump to fallback occurred. If 

-the defmap contains a class for the 

+Consult the defmap of the class at which the jump to fallback occurred. If

+the defmap contains a class for the

 .B

 priority

-of the class (which is related to the TOS field), choose this class and 

-terminate. 

+of the class (which is related to the TOS field), choose this class and

+terminate.

 .TP

 (ii)

 Consult the map for a class for the

@@ -212,28 +212,28 @@ priority. If found, choose it, and terminate.

 (iii)

 Choose the class at which break out to the fallback algorithm occurred. Terminate.

 .P

-The packet is enqueued to the class which was chosen when either algorithm 

+The packet is enqueued to the class which was chosen when either algorithm

 terminated. It is therefore possible for a packet to be enqueued *not* at a

 leaf node, but in the middle of the hierarchy.

 .SH LINK SHARING ALGORITHM

-When dequeuing for sending to the network device, CBQ decides which of its 

+When dequeuing for sending to the network device, CBQ decides which of its

 classes will be allowed to send. It does so with a Weighted Round Robin process

 in which each class with packets gets a chance to send in turn. The WRR process

-starts by asking the highest priority classes (lowest numerically - 

+starts by asking the highest priority classes (lowest numerically -

 highest semantically) for packets, and will continue to do so until they

-have no more data to offer, in which case the process repeats for lower 

+have no more data to offer, in which case the process repeats for lower

 priorities.

 .B CERTAINTY ENDS HERE, ANK PLEASE HELP

 Each class is not allowed to send at length though - they can only dequeue a

-configurable amount of data during each round. 

+configurable amount of data during each round.

 If a class is about to go overlimit, and it is not

 .B bounded

 it will try to borrow avgidle from siblings that are not

-.B isolated. 

+.B isolated.

 This process is repeated from the bottom upwards. If a class is unable

 to borrow enough avgidle to send a packet, it is throttled and not asked

 for a packet for enough time for the avgidle to increase above zero.

@@ -244,7 +244,7 @@ for a packet for enough time for the avgidle to increase above zero.

 .SH QDISC

 The root qdisc of a CBQ class tree has the following parameters:

-.TP 

+.TP

 parent major:minor | root

 This mandatory parameter determines the place of the CBQ instance, either at the

 .B root

@@ -259,22 +259,22 @@ For calculations, the average packet size must be known. It is silently capped

 at a minimum of 2/3 of the interface MTU. Mandatory.

 .TP

 bandwidth rate

-To determine the idle time, CBQ must know the bandwidth of your underlying 

+To determine the idle time, CBQ must know the bandwidth of your underlying

 physical interface, or parent qdisc. This is a vital parameter, more about it

 later. Mandatory.

 .TP

 cell

 The cell size determines he granularity of packet transmission time calculations. Has a sensible default.

-.TP 

+.TP

 mpu

 A zero sized packet may still take time to transmit. This value is the lower

 cap for packet transmission time calculations - packets smaller than this value

 are still deemed to have this size. Defaults to zero.

 .TP

 ewma log

-When CBQ needs to measure the average idle time, it does so using an 

+When CBQ needs to measure the average idle time, it does so using an

 Exponentially Weighted Moving Average which smooths out measurements into

-a moving average. The EWMA LOG determines how much smoothing occurs. Defaults 

+a moving average. The EWMA LOG determines how much smoothing occurs. Defaults

 to 5. Lower values imply greater sensitivity. Must be between 0 and 31.

 .P

 A CBQ qdisc does not shape out of its own accord. It only needs to know certain

@@ -283,35 +283,35 @@ parameters about the underlying link. Actual shaping is done in classes.

 .SH CLASSES

 Classes have a host of parameters to configure their operation.

-.TP 

+.TP

 parent major:minor

-Place of this class within the hierarchy. If attached directly to a qdisc 

+Place of this class within the hierarchy. If attached directly to a qdisc

 and not to another class, minor can be omitted. Mandatory.

-.TP 

+.TP

 classid major:minor

 Like qdiscs, classes can be named. The major number must be equal to the

-major number of the qdisc to which it belongs. Optional, but needed if this 

+major number of the qdisc to which it belongs. Optional, but needed if this

 class is going to have children.

-.TP 

+.TP

 weight weight

-When dequeuing to the interface, classes are tried for traffic in a 

+When dequeuing to the interface, classes are tried for traffic in a

 round-robin fashion. Classes with a higher configured qdisc will generally

 have more traffic to offer during each round, so it makes sense to allow

 it to dequeue more traffic. All weights under a class are normalized, so

-only the ratios matter. Defaults to the configured rate, unless the priority 

+only the ratios matter. Defaults to the configured rate, unless the priority

 of this class is maximal, in which case it is set to 1.

-.TP 

+.TP

 allot bytes

 Allot specifies how many bytes a qdisc can dequeue

-during each round of the process. This parameter is weighted using the 

+during each round of the process. This parameter is weighted using the

 renormalized class weight described above.

-.TP 

+.TP

 priority priority

-In the round-robin process, classes with the lowest priority field are tried 

+In the round-robin process, classes with the lowest priority field are tried

 for packets first. Mandatory.

-.TP 

+.TP

 rate rate

 Maximum rate this class and all its children combined can send at. Mandatory.

@@ -321,7 +321,7 @@ This is different from the bandwidth specified when creating a CBQ disc. Only

 used to determine maxidle and offtime, which are only calculated when