blob: 7f34e7fd767cd9e123186712779b0c0335f20ee6 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#
2# Traffic control configuration.
3#
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -07004
Thomas Graf52ab4ac2005-11-01 15:13:02 +01005menu "QoS and/or fair queueing"
6
7config NET_SCHED
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -07008 bool "QoS and/or fair queueing"
9 ---help---
10 When the kernel has several packets to send out over a network
11 device, it has to decide which ones to send first, which ones to
Thomas Graf52ab4ac2005-11-01 15:13:02 +010012 delay, and which ones to drop. This is the job of the queueing
13 disciplines, several different algorithms for how to do this
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070014 "fairly" have been proposed.
15
16 If you say N here, you will get the standard packet scheduler, which
17 is a FIFO (first come, first served). If you say Y here, you will be
18 able to choose from among several alternative algorithms which can
19 then be attached to different network devices. This is useful for
20 example if some of your network devices are real time devices that
21 need a certain minimum data flow rate, or if you need to limit the
22 maximum data flow rate for traffic which matches specified criteria.
23 This code is considered to be experimental.
24
25 To administer these schedulers, you'll need the user-level utilities
26 from the package iproute2+tc at <ftp://ftp.tux.org/pub/net/ip-routing/>.
27 That package also contains some documentation; for more, check out
Thomas Graf52ab4ac2005-11-01 15:13:02 +010028 <http://linux-net.osdl.org/index.php/Iproute2>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070029
30 This Quality of Service (QoS) support will enable you to use
31 Differentiated Services (diffserv) and Resource Reservation Protocol
Thomas Graf52ab4ac2005-11-01 15:13:02 +010032 (RSVP) on your Linux router if you also say Y to the corresponding
33 classifiers below. Documentation and software is at
34 <http://diffserv.sourceforge.net/>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070035
36 If you say Y here and to "/proc file system" below, you will be able
37 to read status information about packet schedulers from the file
38 /proc/net/psched.
39
40 The available schedulers are listed in the following questions; you
41 can say Y to as many as you like. If unsure, say N now.
42
Linus Torvalds1da177e2005-04-16 15:20:36 -070043choice
44 prompt "Packet scheduler clock source"
45 depends on NET_SCHED
46 default NET_SCH_CLK_JIFFIES
Thomas Graf52ab4ac2005-11-01 15:13:02 +010047 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -070048 Packet schedulers need a monotonic clock that increments at a static
49 rate. The kernel provides several suitable interfaces, each with
50 different properties:
51
52 - high resolution (us or better)
53 - fast to read (minimal locking, no i/o access)
54 - synchronized on all processors
55 - handles cpu clock frequency changes
56
57 but nothing provides all of the above.
58
59config NET_SCH_CLK_JIFFIES
60 bool "Timer interrupt"
Thomas Graf52ab4ac2005-11-01 15:13:02 +010061 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -070062 Say Y here if you want to use the timer interrupt (jiffies) as clock
63 source. This clock source is fast, synchronized on all processors and
64 handles cpu clock frequency changes, but its resolution is too low
65 for accurate shaping except at very low speed.
66
67config NET_SCH_CLK_GETTIMEOFDAY
68 bool "gettimeofday"
Thomas Graf52ab4ac2005-11-01 15:13:02 +010069 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -070070 Say Y here if you want to use gettimeofday as clock source. This clock
71 source has high resolution, is synchronized on all processors and
72 handles cpu clock frequency changes, but it is slow.
73
74 Choose this if you need a high resolution clock source but can't use
75 the CPU's cycle counter.
76
Andi Kleen34cb7112005-10-13 14:41:44 -070077# don't allow on SMP x86 because they can have unsynchronized TSCs.
78# gettimeofday is a good alternative
Linus Torvalds1da177e2005-04-16 15:20:36 -070079config NET_SCH_CLK_CPU
80 bool "CPU cycle counter"
Andi Kleen34cb7112005-10-13 14:41:44 -070081 depends on ((X86_TSC || X86_64) && !SMP) || ALPHA || SPARC64 || PPC64 || IA64
Thomas Graf52ab4ac2005-11-01 15:13:02 +010082 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -070083 Say Y here if you want to use the CPU's cycle counter as clock source.
84 This is a cheap and high resolution clock source, but on some
85 architectures it is not synchronized on all processors and doesn't
86 handle cpu clock frequency changes.
87
88 The useable cycle counters are:
89
90 x86/x86_64 - Timestamp Counter
91 alpha - Cycle Counter
92 sparc64 - %ticks register
93 ppc64 - Time base
94 ia64 - Interval Time Counter
95
96 Choose this if your CPU's cycle counter is working properly.
97
98endchoice
99
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100100comment "Queueing/Scheduling"
101 depends on NET_SCHED
102
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103config NET_SCH_CBQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100104 tristate "Class Based Queueing (CBQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105 depends on NET_SCHED
106 ---help---
107 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100108 scheduling algorithm. This algorithm classifies the waiting packets
109 into a tree-like hierarchy of classes; the leaves of this tree are
110 in turn scheduled by separate algorithms.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100112 See the top of <file:net/sched/sch_cbq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113
114 CBQ is a commonly used scheduler, so if you're unsure, you should
115 say Y here. Then say Y to all the queueing algorithms below that you
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100116 want to use as leaf disciplines.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117
118 To compile this code as a module, choose M here: the
119 module will be called sch_cbq.
120
121config NET_SCH_HTB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100122 tristate "Hierarchical Token Bucket (HTB)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700123 depends on NET_SCHED
124 ---help---
125 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100126 packet scheduling algorithm. See
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
128 in-depth articles.
129
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100130 HTB is very similar to CBQ regarding its goals however is has
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 different properties and different algorithm.
132
133 To compile this code as a module, choose M here: the
134 module will be called sch_htb.
135
136config NET_SCH_HFSC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100137 tristate "Hierarchical Fair Service Curve (HFSC)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138 depends on NET_SCHED
139 ---help---
140 Say Y here if you want to use the Hierarchical Fair Service Curve
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100141 (HFSC) packet scheduling algorithm.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142
143 To compile this code as a module, choose M here: the
144 module will be called sch_hfsc.
145
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146config NET_SCH_ATM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100147 tristate "ATM Virtual Circuits (ATM)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148 depends on NET_SCHED && ATM
149 ---help---
150 Say Y here if you want to use the ATM pseudo-scheduler. This
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100151 provides a framework for invoking classifiers, which in turn
152 select classes of this queuing discipline. Each class maps
153 the flow(s) it is handling to a given virtual circuit.
154
155 See the top of <file:net/sched/sch_atm.c>) for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700156
157 To compile this code as a module, choose M here: the
158 module will be called sch_atm.
159
160config NET_SCH_PRIO
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100161 tristate "Multi Band Priority Queueing (PRIO)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162 depends on NET_SCHED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100163 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164 Say Y here if you want to use an n-band priority queue packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100165 scheduler.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166
167 To compile this code as a module, choose M here: the
168 module will be called sch_prio.
169
170config NET_SCH_RED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100171 tristate "Random Early Detection (RED)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 depends on NET_SCHED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100173 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174 Say Y here if you want to use the Random Early Detection (RED)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100175 packet scheduling algorithm.
176
177 See the top of <file:net/sched/sch_red.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178
179 To compile this code as a module, choose M here: the
180 module will be called sch_red.
181
182config NET_SCH_SFQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100183 tristate "Stochastic Fairness Queueing (SFQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184 depends on NET_SCHED
185 ---help---
186 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100187 packet scheduling algorithm .
188
189 See the top of <file:net/sched/sch_sfq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190
191 To compile this code as a module, choose M here: the
192 module will be called sch_sfq.
193
194config NET_SCH_TEQL
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100195 tristate "True Link Equalizer (TEQL)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196 depends on NET_SCHED
197 ---help---
198 Say Y here if you want to use the True Link Equalizer (TLE) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100199 scheduling algorithm. This queueing discipline allows the combination
200 of several physical devices into one virtual device.
201
202 See the top of <file:net/sched/sch_teql.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203
204 To compile this code as a module, choose M here: the
205 module will be called sch_teql.
206
207config NET_SCH_TBF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100208 tristate "Token Bucket Filter (TBF)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209 depends on NET_SCHED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100210 ---help---
211 Say Y here if you want to use the Token Bucket Filter (TBF) packet
212 scheduling algorithm.
213
214 See the top of <file:net/sched/sch_tbf.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215
216 To compile this code as a module, choose M here: the
217 module will be called sch_tbf.
218
219config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100220 tristate "Generic Random Early Detection (GRED)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700221 depends on NET_SCHED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100222 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700223 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700224 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225 (see the top of <file:net/sched/sch_red.c> for details and
226 references about the algorithm).
227
228 To compile this code as a module, choose M here: the
229 module will be called sch_gred.
230
231config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100232 tristate "Differentiated Services marker (DSMARK)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700233 depends on NET_SCHED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100234 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235 Say Y if you want to schedule packets according to the
236 Differentiated Services architecture proposed in RFC 2475.
237 Technical information on this method, with pointers to associated
238 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
239
240 To compile this code as a module, choose M here: the
241 module will be called sch_dsmark.
242
243config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100244 tristate "Network emulator (NETEM)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245 depends on NET_SCHED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100246 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247 Say Y if you want to emulate network delay, loss, and packet
248 re-ordering. This is often useful to simulate networks when
249 testing applications or protocols.
250
251 To compile this driver as a module, choose M here: the module
252 will be called sch_netem.
253
254 If unsure, say N.
255
256config NET_SCH_INGRESS
257 tristate "Ingress Qdisc"
258 depends on NET_SCHED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100259 ---help---
260 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261 If unsure, say Y.
262
263 To compile this code as a module, choose M here: the
264 module will be called sch_ingress.
265
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100266comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267 depends on NET_SCHED
Linus Torvalds1da177e2005-04-16 15:20:36 -0700268
269config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100270 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271
272config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100273 tristate "Elementary classification (BASIC)"
274 depends NET_SCHED
275 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276 ---help---
277 Say Y here if you want to be able to classify packets using
278 only extended matches and actions.
279
280 To compile this code as a module, choose M here: the
281 module will be called cls_basic.
282
283config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100284 tristate "Traffic-Control Index (TCINDEX)"
285 depends NET_SCHED
286 select NET_CLS
287 ---help---
288 Say Y here if you want to be able to classify packets based on
289 traffic control indices. You will want this feature if you want
290 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291
292 To compile this code as a module, choose M here: the
293 module will be called cls_tcindex.
294
295config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100296 tristate "Routing decision (ROUTE)"
297 depends NET_SCHED
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298 select NET_CLS_ROUTE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100299 select NET_CLS
300 ---help---
301 If you say Y here, you will be able to classify packets
302 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303
304 To compile this code as a module, choose M here: the
305 module will be called cls_route.
306
307config NET_CLS_ROUTE
308 bool
309 default n
310
311config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100312 tristate "Netfilter mark (FW)"
313 depends NET_SCHED
314 select NET_CLS
315 ---help---
316 If you say Y here, you will be able to classify packets
317 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318
319 To compile this code as a module, choose M here: the
320 module will be called cls_fw.
321
322config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100323 tristate "Universal 32bit comparisons w/ hashing (U32)"
324 depends NET_SCHED
325 select NET_CLS
326 ---help---
327 Say Y here to be able to classify packetes using a universal
328 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329
330 To compile this code as a module, choose M here: the
331 module will be called cls_u32.
332
333config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100334 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100336 ---help---
337 Say Y here to make u32 gather additional statistics useful for
338 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339
340config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100341 bool "Netfilter marks support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342 depends on NET_CLS_U32 && NETFILTER
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100343 ---help---
344 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345
346config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100347 tristate "IPv4 Resource Reservation Protocol (RSVP)"
348 depends on NET_SCHED
349 select NET_CLS
350 select NET_ESTIMATOR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351 ---help---
352 The Resource Reservation Protocol (RSVP) permits end systems to
353 request a minimum and maximum data flow rate for a connection; this
354 is important for real time data such as streaming sound or video.
355
356 Say Y here if you want to be able to classify outgoing packets based
357 on their RSVP requests.
358
359 To compile this code as a module, choose M here: the
360 module will be called cls_rsvp.
361
362config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100363 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
364 depends on NET_SCHED
365 select NET_CLS
366 select NET_ESTIMATOR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700367 ---help---
368 The Resource Reservation Protocol (RSVP) permits end systems to
369 request a minimum and maximum data flow rate for a connection; this
370 is important for real time data such as streaming sound or video.
371
372 Say Y here if you want to be able to classify outgoing packets based
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100373 on their RSVP requests and you are using the IPv6.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700374
375 To compile this code as a module, choose M here: the
376 module will be called cls_rsvp6.
377
378config NET_EMATCH
379 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100380 depends NET_SCHED
381 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382 ---help---
383 Say Y here if you want to use extended matches on top of classifiers
384 and select the extended matches below.
385
386 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100387 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700388
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100389 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390 extended matches.
391
392config NET_EMATCH_STACK
393 int "Stack size"
394 depends on NET_EMATCH
395 default "32"
396 ---help---
397 Size of the local stack variable used while evaluating the tree of
398 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700399 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700400 stack space.
401
402config NET_EMATCH_CMP
403 tristate "Simple packet data comparison"
404 depends on NET_EMATCH
405 ---help---
406 Say Y here if you want to be able to classify packets based on
407 simple packet data comparisons for 8, 16, and 32bit values.
408
409 To compile this code as a module, choose M here: the
410 module will be called em_cmp.
411
412config NET_EMATCH_NBYTE
413 tristate "Multi byte comparison"
414 depends on NET_EMATCH
415 ---help---
416 Say Y here if you want to be able to classify packets based on
417 multiple byte comparisons mainly useful for IPv6 address comparisons.
418
419 To compile this code as a module, choose M here: the
420 module will be called em_nbyte.
421
422config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100423 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700424 depends on NET_EMATCH
425 ---help---
426 Say Y here if you want to be able to classify packets using
427 the famous u32 key in combination with logic relations.
428
429 To compile this code as a module, choose M here: the
430 module will be called em_u32.
431
432config NET_EMATCH_META
433 tristate "Metadata"
434 depends on NET_EMATCH
435 ---help---
436 Say Y here if you want to be ablt to classify packets based on
437 metadata such as load average, netfilter attributes, socket
438 attributes and routing decisions.
439
440 To compile this code as a module, choose M here: the
441 module will be called em_meta.
442
Thomas Grafd675c982005-06-23 21:00:58 -0700443config NET_EMATCH_TEXT
444 tristate "Textsearch"
445 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700446 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700447 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700448 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700449 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700450 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100451 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700452 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700453
454 To compile this code as a module, choose M here: the
455 module will be called em_text.
456
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100458 bool "Actions"
459 depends on EXPERIMENTAL && NET_SCHED
460 select NET_ESTIMATOR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700461 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100462 Say Y here if you want to use traffic control actions. Actions
463 get attached to classifiers and are invoked after a successful
464 classification. They are used to overwrite the classification
465 result, instantly drop or redirect packets, etc.
466
467 A recent version of the iproute2 package is required to use
468 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469
470config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100471 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700472 depends on NET_CLS_ACT
473 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100474 Say Y here if you want to do traffic policing, i.e. strict
475 bandwidth limiting. This action replaces the existing policing
476 module.
477
478 To compile this code as a module, choose M here: the
479 module will be called police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700480
481config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100482 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483 depends on NET_CLS_ACT
484 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100485 Say Y here to take generic actions such as dropping and
486 accepting packets.
487
488 To compile this code as a module, choose M here: the
489 module will be called gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700490
491config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100492 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493 depends on NET_ACT_GACT
494 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100495 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496
497config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100498 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499 depends on NET_CLS_ACT
500 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100501 Say Y here to allow packets to be mirrored or redirected to
502 other devices.
503
504 To compile this code as a module, choose M here: the
505 module will be called mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700506
507config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100508 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
510 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100511 Say Y here to be able to invoke iptables targets after succesful
512 classification.
513
514 To compile this code as a module, choose M here: the
515 module will be called ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516
517config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100518 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700519 depends on NET_CLS_ACT
520 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100521 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100523 To compile this code as a module, choose M here: the
524 module will be called pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700526config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100527 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700528 depends on NET_CLS_ACT
529 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100530 Say Y here to add a simple action for demonstration purposes.
531 It is meant as an example and for debugging purposes. It will
532 print a configured policy string followed by the packet count
533 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700534
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100535 If unsure, say N.
536
537 To compile this code as a module, choose M here: the
538 module will be called simple.
539
540config NET_CLS_POLICE
541 bool "Traffic Policing (obsolete)"
542 depends on NET_SCHED && NET_CLS_ACT!=y
543 select NET_ESTIMATOR
544 ---help---
545 Say Y here if you want to do traffic policing, i.e. strict
546 bandwidth limiting. This option is obsoleted by the traffic
547 policer implemented as action, it stays here for compatibility
548 reasons.
549
550config NET_CLS_IND
551 bool "Incoming device classification"
552 depends on NET_SCHED && (NET_CLS_U32 || NET_CLS_FW)
553 ---help---
554 Say Y here to extend the u32 and fw classifier to support
555 classification based on the incoming device. This option is
556 likely to disappear in favour of the metadata ematch.
557
558config NET_ESTIMATOR
559 bool "Rate estimator"
560 depends on NET_SCHED
561 ---help---
562 Say Y here to allow using rate estimators to estimate the current
563 rate-of-flow for network devices, queues, etc. This module is
564 automaticaly selected if needed but can be selected manually for
565 statstical purposes.
566
567endmenu