]> git.proxmox.com Git - mirror_iproute2.git/blob - man/man8/tc.8
man: add -json option to tc manpage
[mirror_iproute2.git] / man / man8 / tc.8
1 .TH TC 8 "16 December 2001" "iproute2" "Linux"
2 .SH NAME
3 tc \- show / manipulate traffic control settings
4 .SH SYNOPSIS
5 .B tc
6 .RI "[ " OPTIONS " ]"
7 .B qdisc [ add | change | replace | link | delete ] dev
8 \fIDEV\fR
9 .B
10 [ parent
11 \fIqdisc-id\fR
12 .B | root ]
13 .B [ handle
14 \fIqdisc-id\fR ] qdisc
15 [ qdisc specific parameters ]
16 .P
17
18 .B tc
19 .RI "[ " OPTIONS " ]"
20 .B class [ add | change | replace | delete ] dev
21 \fIDEV\fR
22 .B parent
23 \fIqdisc-id\fR
24 .B [ classid
25 \fIclass-id\fR ] qdisc
26 [ qdisc specific parameters ]
27 .P
28
29 .B tc
30 .RI "[ " OPTIONS " ]"
31 .B filter [ add | change | replace | delete | get ] dev
32 \fIDEV\fR
33 .B [ parent
34 \fIqdisc-id\fR
35 .B | root ] [ handle \fIfilter-id\fR ]
36 .B protocol
37 \fIprotocol\fR
38 .B prio
39 \fIpriority\fR filtertype
40 [ filtertype specific parameters ]
41 .B flowid
42 \fIflow-id\fR
43
44 .B tc
45 .RI "[ " OPTIONS " ]"
46 .RI "[ " FORMAT " ]"
47 .B qdisc show [ dev
48 \fIDEV\fR
49 .B ]
50 .P
51 .B tc
52 .RI "[ " OPTIONS " ]"
53 .RI "[ " FORMAT " ]"
54 .B class show dev
55 \fIDEV\fR
56 .P
57 .B tc
58 .RI "[ " OPTIONS " ]"
59 .B filter show dev
60 \fIDEV\fR
61
62 .P
63 .ti 8
64 .IR OPTIONS " := {"
65 \fB[ -force ] -b\fR[\fIatch\fR] \fB[ filename ] \fR|
66 \fB[ \fB-n\fR[\fIetns\fR] name \fB] \fR|
67 \fB[ \fB-nm \fR| \fB-nam\fR[\fIes\fR] \fB] \fR|
68 \fB[ \fR{ \fB-cf \fR| \fB-c\fR[\fIonf\fR] \fR} \fB[ filename ] \fB] \fR}
69
70 .ti 8
71 .IR FORMAT " := {"
72 \fB\-s\fR[\fItatistics\fR] |
73 \fB\-d\fR[\fIetails\fR] |
74 \fB\-r\fR[\fIaw\fR] |
75 \fB\-p\fR[\fIretty\fR] |
76 \fB\-i\fR[\fIec\fR] |
77 \fB\-g\fR[\fIraph\fR] |
78 \fB\-j\fR[\fIjson\fR] }
79
80 .SH DESCRIPTION
81 .B Tc
82 is used to configure Traffic Control in the Linux kernel. Traffic Control consists
83 of the following:
84
85 .TP
86 SHAPING
87 When traffic is shaped, its rate of transmission is under control. Shaping may
88 be more than lowering the available bandwidth - it is also used to smooth out
89 bursts in traffic for better network behaviour. Shaping occurs on egress.
90
91 .TP
92 SCHEDULING
93 By scheduling the transmission of packets it is possible to improve interactivity
94 for traffic that needs it while still guaranteeing bandwidth to bulk transfers. Reordering
95 is also called prioritizing, and happens only on egress.
96
97 .TP
98 POLICING
99 Whereas shaping deals with transmission of traffic, policing pertains to traffic
100 arriving. Policing thus occurs on ingress.
101
102 .TP
103 DROPPING
104 Traffic exceeding a set bandwidth may also be dropped forthwith, both on
105 ingress and on egress.
106
107 .P
108 Processing of traffic is controlled by three kinds of objects: qdiscs,
109 classes and filters.
110
111 .SH QDISCS
112 .B qdisc
113 is short for 'queueing discipline' and it is elementary to
114 understanding traffic control. Whenever the kernel needs to send a
115 packet to an interface, it is
116 .B enqueued
117 to the qdisc configured for that interface. Immediately afterwards, the kernel
118 tries to get as many packets as possible from the qdisc, for giving them
119 to the network adaptor driver.
120
121 A simple QDISC is the 'pfifo' one, which does no processing at all and is a pure
122 First In, First Out queue. It does however store traffic when the network interface
123 can't handle it momentarily.
124
125 .SH CLASSES
126 Some qdiscs can contain classes, which contain further qdiscs - traffic may
127 then be enqueued in any of the inner qdiscs, which are within the
128 .B classes.
129 When the kernel tries to dequeue a packet from such a
130 .B classful qdisc
131 it can come from any of the classes. A qdisc may for example prioritize
132 certain kinds of traffic by trying to dequeue from certain classes
133 before others.
134
135 .SH FILTERS
136 A
137 .B filter
138 is used by a classful qdisc to determine in which class a packet will
139 be enqueued. Whenever traffic arrives at a class with subclasses, it needs
140 to be classified. Various methods may be employed to do so, one of these
141 are the filters. All filters attached to the class are called, until one of
142 them returns with a verdict. If no verdict was made, other criteria may be
143 available. This differs per qdisc.
144
145 It is important to notice that filters reside
146 .B within
147 qdiscs - they are not masters of what happens.
148
149 The available filters are:
150 .TP
151 basic
152 Filter packets based on an ematch expression. See
153 .BR tc-ematch (8)
154 for details.
155 .TP
156 bpf
157 Filter packets using (e)BPF, see
158 .BR tc-bpf (8)
159 for details.
160 .TP
161 cgroup
162 Filter packets based on the control group of their process. See
163 . BR tc-cgroup (8)
164 for details.
165 .TP
166 flow, flower
167 Flow-based classifiers, filtering packets based on their flow (identified by selectable keys). See
168 .BR tc-flow "(8) and"
169 .BR tc-flower (8)
170 for details.
171 .TP
172 fw
173 Filter based on fwmark. Directly maps fwmark value to traffic class. See
174 .BR tc-fw (8).
175 .TP
176 route
177 Filter packets based on routing table. See
178 .BR tc-route (8)
179 for details.
180 .TP
181 rsvp
182 Match Resource Reservation Protocol (RSVP) packets.
183 .TP
184 tcindex
185 Filter packets based on traffic control index. See
186 .BR tc-tcindex (8).
187 .TP
188 u32
189 Generic filtering on arbitrary packet data, assisted by syntax to abstract common operations. See
190 .BR tc-u32 (8)
191 for details.
192 .TP
193 matchall
194 Traffic control filter that matches every packet. See
195 .BR tc-matchall (8)
196 for details.
197
198 .SH CLASSLESS QDISCS
199 The classless qdiscs are:
200 .TP
201 choke
202 CHOKe (CHOose and Keep for responsive flows, CHOose and Kill for unresponsive
203 flows) is a classless qdisc designed to both identify and penalize flows that
204 monopolize the queue. CHOKe is a variation of RED, and the configuration is
205 similar to RED.
206 .TP
207 codel
208 CoDel (pronounced "coddle") is an adaptive "no-knobs" active queue management
209 algorithm (AQM) scheme that was developed to address the shortcomings of
210 RED and its variants.
211 .TP
212 [p|b]fifo
213 Simplest usable qdisc, pure First In, First Out behaviour. Limited in
214 packets or in bytes.
215 .TP
216 fq
217 Fair Queue Scheduler realises TCP pacing and scales to millions of concurrent
218 flows per qdisc.
219 .TP
220 fq_codel
221 Fair Queuing Controlled Delay is queuing discipline that combines Fair
222 Queuing with the CoDel AQM scheme. FQ_Codel uses a stochastic model to classify
223 incoming packets into different flows and is used to provide a fair share of the
224 bandwidth to all the flows using the queue. Each such flow is managed by the
225 CoDel queuing discipline. Reordering within a flow is avoided since Codel
226 internally uses a FIFO queue.
227 .TP
228 gred
229 Generalized Random Early Detection combines multiple RED queues in order to
230 achieve multiple drop priorities. This is required to realize Assured
231 Forwarding (RFC 2597).
232 .TP
233 hhf
234 Heavy-Hitter Filter differentiates between small flows and the opposite,
235 heavy-hitters. The goal is to catch the heavy-hitters and move them to a
236 separate queue with less priority so that bulk traffic does not affect the
237 latency of critical traffic.
238 .TP
239 ingress
240 This is a special qdisc as it applies to incoming traffic on an interface, allowing for it to be filtered and policed.
241 .TP
242 mqprio
243 The Multiqueue Priority Qdisc is a simple queuing discipline that allows
244 mapping traffic flows to hardware queue ranges using priorities and a
245 configurable priority to traffic class mapping. A traffic class in this context
246 is a set of contiguous qdisc classes which map 1:1 to a set of hardware exposed
247 queues.
248 .TP
249 multiq
250 Multiqueue is a qdisc optimized for devices with multiple Tx queues. It has
251 been added for hardware that wishes to avoid head-of-line blocking. It will
252 cycle though the bands and verify that the hardware queue associated with the
253 band is not stopped prior to dequeuing a packet.
254 .TP
255 netem
256 Network Emulator is an enhancement of the Linux traffic control facilities that
257 allow to add delay, packet loss, duplication and more other characteristics to
258 packets outgoing from a selected network interface.
259 .TP
260 pfifo_fast
261 Standard qdisc for 'Advanced Router' enabled kernels. Consists of a three-band
262 queue which honors Type of Service flags, as well as the priority that may be
263 assigned to a packet.
264 .TP
265 pie
266 Proportional Integral controller-Enhanced (PIE) is a control theoretic active
267 queue management scheme. It is based on the proportional integral controller but
268 aims to control delay.
269 .TP
270 red
271 Random Early Detection simulates physical congestion by randomly dropping
272 packets when nearing configured bandwidth allocation. Well suited to very
273 large bandwidth applications.
274 .TP
275 rr
276 Round-Robin qdisc with support for multiqueue network devices. Removed from
277 Linux since kernel version 2.6.27.
278 .TP
279 sfb
280 Stochastic Fair Blue is a classless qdisc to manage congestion based on
281 packet loss and link utilization history while trying to prevent
282 non-responsive flows (i.e. flows that do not react to congestion marking
283 or dropped packets) from impacting performance of responsive flows.
284 Unlike RED, where the marking probability has to be configured, BLUE
285 tries to determine the ideal marking probability automatically.
286 .TP
287 sfq
288 Stochastic Fairness Queueing reorders queued traffic so each 'session'
289 gets to send a packet in turn.
290 .TP
291 tbf
292 The Token Bucket Filter is suited for slowing traffic down to a precisely
293 configured rate. Scales well to large bandwidths.
294 .SH CONFIGURING CLASSLESS QDISCS
295 In the absence of classful qdiscs, classless qdiscs can only be attached at
296 the root of a device. Full syntax:
297 .P
298 .B tc qdisc add dev
299 \fIDEV\fR
300 .B root
301 QDISC QDISC-PARAMETERS
302
303 To remove, issue
304 .P
305 .B tc qdisc del dev
306 \fIDEV\fR
307 .B root
308
309 The
310 .B pfifo_fast
311 qdisc is the automatic default in the absence of a configured qdisc.
312
313 .SH CLASSFUL QDISCS
314 The classful qdiscs are:
315 .TP
316 ATM
317 Map flows to virtual circuits of an underlying asynchronous transfer mode
318 device.
319 .TP
320 CBQ
321 Class Based Queueing implements a rich linksharing hierarchy of classes.
322 It contains shaping elements as well as prioritizing capabilities. Shaping is
323 performed using link idle time calculations based on average packet size and
324 underlying link bandwidth. The latter may be ill-defined for some interfaces.
325 .TP
326 DRR
327 The Deficit Round Robin Scheduler is a more flexible replacement for Stochastic
328 Fairness Queuing. Unlike SFQ, there are no built-in queues \-\- you need to add
329 classes and then set up filters to classify packets accordingly. This can be
330 useful e.g. for using RED qdiscs with different settings for particular
331 traffic. There is no default class \-\- if a packet cannot be classified, it is
332 dropped.
333 .TP
334 DSMARK
335 Classify packets based on TOS field, change TOS field of packets based on
336 classification.
337 .TP
338 HFSC
339 Hierarchical Fair Service Curve guarantees precise bandwidth and delay allocation for leaf classes and allocates excess bandwidth fairly. Unlike HTB, it makes use of packet dropping to achieve low delays which interactive sessions benefit from.
340 .TP
341 HTB
342 The Hierarchy Token Bucket implements a rich linksharing hierarchy of
343 classes with an emphasis on conforming to existing practices. HTB facilitates
344 guaranteeing bandwidth to classes, while also allowing specification of upper
345 limits to inter-class sharing. It contains shaping elements, based on TBF and
346 can prioritize classes.
347 .TP
348 PRIO
349 The PRIO qdisc is a non-shaping container for a configurable number of
350 classes which are dequeued in order. This allows for easy prioritization
351 of traffic, where lower classes are only able to send if higher ones have
352 no packets available. To facilitate configuration, Type Of Service bits are
353 honored by default.
354 .TP
355 QFQ
356 Quick Fair Queueing is an O(1) scheduler that provides near-optimal guarantees,
357 and is the first to achieve that goal with a constant cost also with respect to
358 the number of groups and the packet length. The QFQ algorithm has no loops, and
359 uses very simple instructions and data structures that lend themselves very
360 well to a hardware implementation.
361 .SH THEORY OF OPERATION
362 Classes form a tree, where each class has a single parent.
363 A class may have multiple children. Some qdiscs allow for runtime addition
364 of classes (CBQ, HTB) while others (PRIO) are created with a static number of
365 children.
366
367 Qdiscs which allow dynamic addition of classes can have zero or more
368 subclasses to which traffic may be enqueued.
369
370 Furthermore, each class contains a
371 .B leaf qdisc
372 which by default has
373 .B pfifo
374 behaviour, although another qdisc can be attached in place. This qdisc may again
375 contain classes, but each class can have only one leaf qdisc.
376
377 When a packet enters a classful qdisc it can be
378 .B classified
379 to one of the classes within. Three criteria are available, although not all
380 qdiscs will use all three:
381 .TP
382 tc filters
383 If tc filters are attached to a class, they are consulted first
384 for relevant instructions. Filters can match on all fields of a packet header,
385 as well as on the firewall mark applied by ipchains or iptables.
386 .TP
387 Type of Service
388 Some qdiscs have built in rules for classifying packets based on the TOS field.
389 .TP
390 skb->priority
391 Userspace programs can encode a \fIclass-id\fR in the 'skb->priority' field using
392 the SO_PRIORITY option.
393 .P
394 Each node within the tree can have its own filters but higher level filters
395 may also point directly to lower classes.
396
397 If classification did not succeed, packets are enqueued to the leaf qdisc
398 attached to that class. Check qdisc specific manpages for details, however.
399
400 .SH NAMING
401 All qdiscs, classes and filters have IDs, which can either be specified
402 or be automatically assigned.
403
404 IDs consist of a
405 .BR major " number and a " minor
406 number, separated by a colon -
407 .BR major ":" minor "."
408 Both
409 .BR major " and " minor
410 are hexadecimal numbers and are limited to 16 bits. There are two special
411 values: root is signified by
412 .BR major " and " minor
413 of all ones, and unspecified is all zeros.
414
415 .TP
416 QDISCS
417 A qdisc, which potentially can have children, gets assigned a
418 .B major
419 number, called a 'handle', leaving the
420 .B minor
421 number namespace available for classes. The handle is expressed as '10:'.
422 It is customary to explicitly assign a handle to qdiscs expected to have children.
423
424 .TP
425 CLASSES
426 Classes residing under a qdisc share their qdisc
427 .B major
428 number, but each have a separate
429 .B minor
430 number called a 'classid' that has no relation to their
431 parent classes, only to their parent qdisc. The same naming custom as for
432 qdiscs applies.
433
434 .TP
435 FILTERS
436 Filters have a three part ID, which is only needed when using a hashed
437 filter hierarchy.
438
439 .SH PARAMETERS
440 The following parameters are widely used in TC. For other parameters,
441 see the man pages for individual qdiscs.
442
443 .TP
444 RATES
445 Bandwidths or rates.
446 These parameters accept a floating point number, possibly followed by
447 either a unit (both SI and IEC units supported), or a float followed by a '%'
448 character to specify the rate as a percentage of the device's speed
449 (e.g. 5%, 99.5%). Warning: specifying the rate as a percentage means a fraction
450 of the current speed; if the speed changes, the value will not be recalculated.
451 .RS
452 .TP
453 bit or a bare number
454 Bits per second
455 .TP
456 kbit
457 Kilobits per second
458 .TP
459 mbit
460 Megabits per second
461 .TP
462 gbit
463 Gigabits per second
464 .TP
465 tbit
466 Terabits per second
467 .TP
468 bps
469 Bytes per second
470 .TP
471 kbps
472 Kilobytes per second
473 .TP
474 mbps
475 Megabytes per second
476 .TP
477 gbps
478 Gigabytes per second
479 .TP
480 tbps
481 Terabytes per second
482
483 .P
484 To specify in IEC units, replace the SI prefix (k-, m-, g-, t-) with
485 IEC prefix (ki-, mi-, gi- and ti-) respectively.
486
487 .P
488 TC store rates as a 32-bit unsigned integer in bps internally,
489 so we can specify a max rate of 4294967295 bps.
490 .RE
491
492 .TP
493 TIMES
494 Length of time. Can be specified as a floating point number
495 followed by an optional unit:
496 .RS
497 .TP
498 s, sec or secs
499 Whole seconds
500 .TP
501 ms, msec or msecs
502 Milliseconds
503 .TP
504 us, usec, usecs or a bare number
505 Microseconds.
506
507 .P
508 TC defined its own time unit (equal to microsecond) and stores
509 time values as 32-bit unsigned integer, thus we can specify a max time value
510 of 4294967295 usecs.
511 .RE
512
513 .TP
514 SIZES
515 Amounts of data. Can be specified as a floating point number
516 followed by an optional unit:
517 .RS
518 .TP
519 b or a bare number
520 Bytes.
521 .TP
522 kbit
523 Kilobits
524 .TP
525 kb or k
526 Kilobytes
527 .TP
528 mbit
529 Megabits
530 .TP
531 mb or m
532 Megabytes
533 .TP
534 gbit
535 Gigabits
536 .TP
537 gb or g
538 Gigabytes
539
540 .P
541 TC stores sizes internally as 32-bit unsigned integer in byte,
542 so we can specify a max size of 4294967295 bytes.
543 .RE
544
545 .TP
546 VALUES
547 Other values without a unit.
548 These parameters are interpreted as decimal by default, but you can
549 indicate TC to interpret them as octal and hexadecimal by adding a '0'
550 or '0x' prefix respectively.
551
552 .SH TC COMMANDS
553 The following commands are available for qdiscs, classes and filter:
554 .TP
555 add
556 Add a qdisc, class or filter to a node. For all entities, a
557 .B parent
558 must be passed, either by passing its ID or by attaching directly to the root of a device.
559 When creating a qdisc or a filter, it can be named with the
560 .B handle
561 parameter. A class is named with the
562 .B \fBclassid\fR
563 parameter.
564
565 .TP
566 delete
567 A qdisc can be deleted by specifying its handle, which may also be 'root'. All subclasses and their leaf qdiscs
568 are automatically deleted, as well as any filters attached to them.
569
570 .TP
571 change
572 Some entities can be modified 'in place'. Shares the syntax of 'add', with the exception
573 that the handle cannot be changed and neither can the parent. In other words,
574 .B
575 change
576 cannot move a node.
577
578 .TP
579 replace
580 Performs a nearly atomic remove/add on an existing node id. If the node does not exist yet
581 it is created.
582
583 .TP
584 get
585 Displays a single filter given the interface \fIDEV\fR, \fIqdisc-id\fR,
586 \fIpriority\fR, \fIprotocol\fR and \fIfilter-id\fR.
587
588 .TP
589 show
590 Displays all filters attached to the given interface. A valid parent ID must be passed.
591
592 .TP
593 link
594 Only available for qdiscs and performs a replace where the node
595 must exist already.
596
597 .SH OPTIONS
598
599 .TP
600 .BR "\-b", " \-b filename", " \-batch", " \-batch filename"
601 read commands from provided file or standard input and invoke them.
602 First failure will cause termination of tc.
603
604 .TP
605 .BR "\-force"
606 don't terminate tc on errors in batch mode.
607 If there were any errors during execution of the commands, the application return code will be non zero.
608
609 .TP
610 .BR "\-n" , " \-net" , " \-netns " <NETNS>
611 switches
612 .B tc
613 to the specified network namespace
614 .IR NETNS .
615 Actually it just simplifies executing of:
616
617 .B ip netns exec
618 .IR NETNS
619 .B tc
620 .RI "[ " OPTIONS " ] " OBJECT " { " COMMAND " | "
621 .BR help " }"
622
623 to
624
625 .B tc
626 .RI "-n[etns] " NETNS " [ " OPTIONS " ] " OBJECT " { " COMMAND " | "
627 .BR help " }"
628
629 .TP
630 .BR "\-cf" , " \-conf " <FILENAME>
631 specifies path to the config file. This option is used in conjunction with other options (e.g.
632 .BR -nm ")."
633
634 .SH FORMAT
635 The show command has additional formatting options:
636
637 .TP
638 .BR "\-s" , " \-stats", " \-statistics"
639 output more statistics about packet usage.
640
641 .TP
642 .BR "\-d", " \-details"
643 output more detailed information about rates and cell sizes.
644
645 .TP
646 .BR "\-r", " \-raw"
647 output raw hex values for handles.
648
649 .TP
650 .BR "\-p", " \-pretty"
651 decode filter offset and mask values to equivalent filter commands based on TCP/IP.
652
653 .TP
654 .BR "\-iec"
655 print rates in IEC units (ie. 1K = 1024).
656
657 .TP
658 .BR "\-g", " \-graph"
659 shows classes as ASCII graph. Prints generic stats info under each class if
660 .BR "-s"
661 option was specified. Classes can be filtered only by
662 .BR "dev"
663 option.
664
665 .TP
666 .BR "\-j", " \-json"
667 Display results in JSON format.
668
669 .TP
670 .BR "\-nm" , " \-name"
671 resolve class name from
672 .B /etc/iproute2/tc_cls
673 file or from file specified by
674 .B -cf
675 option. This file is just a mapping of
676 .B classid
677 to class name:
678
679 .RS 10
680 # Here is comment
681 .RE
682 .RS 10
683 1:40 voip # Here is another comment
684 .RE
685 .RS 10
686 1:50 web
687 .RE
688 .RS 10
689 1:60 ftp
690 .RE
691 .RS 10
692 1:2 home
693 .RE
694
695 .RS
696 .B tc
697 will not fail if
698 .B -nm
699 was specified without
700 .B -cf
701 option but
702 .B /etc/iproute2/tc_cls
703 file does not exist, which makes it possible to pass
704 .B -nm
705 option for creating
706 .B tc
707 alias.
708 .RE
709
710 .SH "EXAMPLES"
711 .PP
712 tc -g class show dev eth0
713 .RS 4
714 Shows classes as ASCII graph on eth0 interface.
715 .RE
716 .PP
717 tc -g -s class show dev eth0
718 .RS 4
719 Shows classes as ASCII graph with stats info under each class.
720
721 .SH HISTORY
722 .B tc
723 was written by Alexey N. Kuznetsov and added in Linux 2.2.
724 .SH SEE ALSO
725 .BR tc-basic (8),
726 .BR tc-bfifo (8),
727 .BR tc-bpf (8),
728 .BR tc-cbq (8),
729 .BR tc-cgroup (8),
730 .BR tc-choke (8),
731 .BR tc-codel (8),
732 .BR tc-drr (8),
733 .BR tc-ematch (8),
734 .BR tc-flow (8),
735 .BR tc-flower (8),
736 .BR tc-fq (8),
737 .BR tc-fq_codel (8),
738 .BR tc-fw (8),
739 .BR tc-hfsc (7),
740 .BR tc-hfsc (8),
741 .BR tc-htb (8),
742 .BR tc-mqprio (8),
743 .BR tc-pfifo (8),
744 .BR tc-pfifo_fast (8),
745 .BR tc-red (8),
746 .BR tc-route (8),
747 .BR tc-sfb (8),
748 .BR tc-sfq (8),
749 .BR tc-stab (8),
750 .BR tc-tbf (8),
751 .BR tc-tcindex (8),
752 .BR tc-u32 (8),
753 .br
754 .RB "User documentation at " http://lartc.org/ ", but please direct bugreports and patches to: " <netdev@vger.kernel.org>
755
756 .SH AUTHOR
757 Manpage maintained by bert hubert (ahu@ds9a.nl)