blob: b4662888bdbd9d6df32cb8c25d2ba2ca6188953d [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"
David Kimdon3c62f752006-11-09 16:16:21 -08009 select NET_SCH_FIFO
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070010 ---help---
11 When the kernel has several packets to send out over a network
12 device, it has to decide which ones to send first, which ones to
Thomas Graf52ab4ac2005-11-01 15:13:02 +010013 delay, and which ones to drop. This is the job of the queueing
14 disciplines, several different algorithms for how to do this
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070015 "fairly" have been proposed.
16
17 If you say N here, you will get the standard packet scheduler, which
18 is a FIFO (first come, first served). If you say Y here, you will be
19 able to choose from among several alternative algorithms which can
20 then be attached to different network devices. This is useful for
21 example if some of your network devices are real time devices that
22 need a certain minimum data flow rate, or if you need to limit the
23 maximum data flow rate for traffic which matches specified criteria.
24 This code is considered to be experimental.
25
26 To administer these schedulers, you'll need the user-level utilities
27 from the package iproute2+tc at <ftp://ftp.tux.org/pub/net/ip-routing/>.
28 That package also contains some documentation; for more, check out
Thomas Graf52ab4ac2005-11-01 15:13:02 +010029 <http://linux-net.osdl.org/index.php/Iproute2>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070030
31 This Quality of Service (QoS) support will enable you to use
32 Differentiated Services (diffserv) and Resource Reservation Protocol
Thomas Graf52ab4ac2005-11-01 15:13:02 +010033 (RSVP) on your Linux router if you also say Y to the corresponding
34 classifiers below. Documentation and software is at
35 <http://diffserv.sourceforge.net/>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070036
37 If you say Y here and to "/proc file system" below, you will be able
38 to read status information about packet schedulers from the file
39 /proc/net/psched.
40
41 The available schedulers are listed in the following questions; you
42 can say Y to as many as you like. If unsure, say N now.
43
David Kimdon3c62f752006-11-09 16:16:21 -080044config NET_SCH_FIFO
45 bool
46
Roman Zippel05b8b0f2005-11-17 15:22:39 -080047if NET_SCHED
48
Thomas Graf52ab4ac2005-11-01 15:13:02 +010049comment "Queueing/Scheduling"
Thomas Graf52ab4ac2005-11-01 15:13:02 +010050
Linus Torvalds1da177e2005-04-16 15:20:36 -070051config NET_SCH_CBQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +010052 tristate "Class Based Queueing (CBQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070053 ---help---
54 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +010055 scheduling algorithm. This algorithm classifies the waiting packets
56 into a tree-like hierarchy of classes; the leaves of this tree are
57 in turn scheduled by separate algorithms.
Linus Torvalds1da177e2005-04-16 15:20:36 -070058
Thomas Graf52ab4ac2005-11-01 15:13:02 +010059 See the top of <file:net/sched/sch_cbq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -070060
61 CBQ is a commonly used scheduler, so if you're unsure, you should
62 say Y here. Then say Y to all the queueing algorithms below that you
Thomas Graf52ab4ac2005-11-01 15:13:02 +010063 want to use as leaf disciplines.
Linus Torvalds1da177e2005-04-16 15:20:36 -070064
65 To compile this code as a module, choose M here: the
66 module will be called sch_cbq.
67
68config NET_SCH_HTB
Thomas Graf52ab4ac2005-11-01 15:13:02 +010069 tristate "Hierarchical Token Bucket (HTB)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070070 ---help---
71 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
Thomas Graf52ab4ac2005-11-01 15:13:02 +010072 packet scheduling algorithm. See
Linus Torvalds1da177e2005-04-16 15:20:36 -070073 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
74 in-depth articles.
75
Thomas Graf52ab4ac2005-11-01 15:13:02 +010076 HTB is very similar to CBQ regarding its goals however is has
Linus Torvalds1da177e2005-04-16 15:20:36 -070077 different properties and different algorithm.
78
79 To compile this code as a module, choose M here: the
80 module will be called sch_htb.
81
82config NET_SCH_HFSC
Thomas Graf52ab4ac2005-11-01 15:13:02 +010083 tristate "Hierarchical Fair Service Curve (HFSC)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070084 ---help---
85 Say Y here if you want to use the Hierarchical Fair Service Curve
Thomas Graf52ab4ac2005-11-01 15:13:02 +010086 (HFSC) packet scheduling algorithm.
Linus Torvalds1da177e2005-04-16 15:20:36 -070087
88 To compile this code as a module, choose M here: the
89 module will be called sch_hfsc.
90
Linus Torvalds1da177e2005-04-16 15:20:36 -070091config NET_SCH_ATM
Thomas Graf52ab4ac2005-11-01 15:13:02 +010092 tristate "ATM Virtual Circuits (ATM)"
Roman Zippel05b8b0f2005-11-17 15:22:39 -080093 depends on ATM
Linus Torvalds1da177e2005-04-16 15:20:36 -070094 ---help---
95 Say Y here if you want to use the ATM pseudo-scheduler. This
Thomas Graf52ab4ac2005-11-01 15:13:02 +010096 provides a framework for invoking classifiers, which in turn
97 select classes of this queuing discipline. Each class maps
98 the flow(s) it is handling to a given virtual circuit.
99
100 See the top of <file:net/sched/sch_atm.c>) for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101
102 To compile this code as a module, choose M here: the
103 module will be called sch_atm.
104
105config NET_SCH_PRIO
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100106 tristate "Multi Band Priority Queueing (PRIO)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100107 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108 Say Y here if you want to use an n-band priority queue packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100109 scheduler.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110
111 To compile this code as a module, choose M here: the
112 module will be called sch_prio.
113
Peter P Waskiewicz Jrd62733c2007-06-28 21:04:31 -0700114config NET_SCH_RR
115 tristate "Multi Band Round Robin Queuing (RR)"
116 select NET_SCH_PRIO
117 ---help---
118 Say Y here if you want to use an n-band round robin packet
119 scheduler.
120
121 The module uses sch_prio for its framework and is aliased as
122 sch_rr, so it will load sch_prio, although it is referred
123 to using sch_rr.
124
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125config NET_SCH_RED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100126 tristate "Random Early Detection (RED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100127 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128 Say Y here if you want to use the Random Early Detection (RED)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100129 packet scheduling algorithm.
130
131 See the top of <file:net/sched/sch_red.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132
133 To compile this code as a module, choose M here: the
134 module will be called sch_red.
135
136config NET_SCH_SFQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100137 tristate "Stochastic Fairness Queueing (SFQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138 ---help---
139 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100140 packet scheduling algorithm .
141
142 See the top of <file:net/sched/sch_sfq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143
144 To compile this code as a module, choose M here: the
145 module will be called sch_sfq.
146
147config NET_SCH_TEQL
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100148 tristate "True Link Equalizer (TEQL)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149 ---help---
150 Say Y here if you want to use the True Link Equalizer (TLE) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100151 scheduling algorithm. This queueing discipline allows the combination
152 of several physical devices into one virtual device.
153
154 See the top of <file:net/sched/sch_teql.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155
156 To compile this code as a module, choose M here: the
157 module will be called sch_teql.
158
159config NET_SCH_TBF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100160 tristate "Token Bucket Filter (TBF)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100161 ---help---
162 Say Y here if you want to use the Token Bucket Filter (TBF) packet
163 scheduling algorithm.
164
165 See the top of <file:net/sched/sch_tbf.c> for more details.
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_tbf.
169
170config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100171 tristate "Generic Random Early Detection (GRED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100172 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700174 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 (see the top of <file:net/sched/sch_red.c> for details and
176 references about the algorithm).
177
178 To compile this code as a module, choose M here: the
179 module will be called sch_gred.
180
181config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100182 tristate "Differentiated Services marker (DSMARK)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100183 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184 Say Y if you want to schedule packets according to the
185 Differentiated Services architecture proposed in RFC 2475.
186 Technical information on this method, with pointers to associated
187 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
188
189 To compile this code as a module, choose M here: the
190 module will be called sch_dsmark.
191
192config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100193 tristate "Network emulator (NETEM)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100194 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 Say Y if you want to emulate network delay, loss, and packet
196 re-ordering. This is often useful to simulate networks when
197 testing applications or protocols.
198
199 To compile this driver as a module, choose M here: the module
200 will be called sch_netem.
201
202 If unsure, say N.
203
204config NET_SCH_INGRESS
205 tristate "Ingress Qdisc"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100206 ---help---
207 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208 If unsure, say Y.
209
210 To compile this code as a module, choose M here: the
211 module will be called sch_ingress.
212
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100213comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214
215config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100216 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700217
218config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100219 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100220 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700221 ---help---
222 Say Y here if you want to be able to classify packets using
223 only extended matches and actions.
224
225 To compile this code as a module, choose M here: the
226 module will be called cls_basic.
227
228config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100229 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100230 select NET_CLS
231 ---help---
232 Say Y here if you want to be able to classify packets based on
233 traffic control indices. You will want this feature if you want
234 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235
236 To compile this code as a module, choose M here: the
237 module will be called cls_tcindex.
238
239config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100240 tristate "Routing decision (ROUTE)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241 select NET_CLS_ROUTE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100242 select NET_CLS
243 ---help---
244 If you say Y here, you will be able to classify packets
245 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246
247 To compile this code as a module, choose M here: the
248 module will be called cls_route.
249
250config NET_CLS_ROUTE
251 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252
253config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100254 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100255 select NET_CLS
256 ---help---
257 If you say Y here, you will be able to classify packets
258 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259
260 To compile this code as a module, choose M here: the
261 module will be called cls_fw.
262
263config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100264 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100265 select NET_CLS
266 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200267 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100268 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269
270 To compile this code as a module, choose M here: the
271 module will be called cls_u32.
272
273config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100274 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100276 ---help---
277 Say Y here to make u32 gather additional statistics useful for
278 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279
280config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100281 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800282 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100283 ---help---
284 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285
286config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100287 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100288 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289 ---help---
290 The Resource Reservation Protocol (RSVP) permits end systems to
291 request a minimum and maximum data flow rate for a connection; this
292 is important for real time data such as streaming sound or video.
293
294 Say Y here if you want to be able to classify outgoing packets based
295 on their RSVP requests.
296
297 To compile this code as a module, choose M here: the
298 module will be called cls_rsvp.
299
300config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100301 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100302 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303 ---help---
304 The Resource Reservation Protocol (RSVP) permits end systems to
305 request a minimum and maximum data flow rate for a connection; this
306 is important for real time data such as streaming sound or video.
307
308 Say Y here if you want to be able to classify outgoing packets based
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100309 on their RSVP requests and you are using the IPv6.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310
311 To compile this code as a module, choose M here: the
312 module will be called cls_rsvp6.
313
314config NET_EMATCH
315 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100316 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317 ---help---
318 Say Y here if you want to use extended matches on top of classifiers
319 and select the extended matches below.
320
321 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100322 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100324 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325 extended matches.
326
327config NET_EMATCH_STACK
328 int "Stack size"
329 depends on NET_EMATCH
330 default "32"
331 ---help---
332 Size of the local stack variable used while evaluating the tree of
333 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700334 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335 stack space.
336
337config NET_EMATCH_CMP
338 tristate "Simple packet data comparison"
339 depends on NET_EMATCH
340 ---help---
341 Say Y here if you want to be able to classify packets based on
342 simple packet data comparisons for 8, 16, and 32bit values.
343
344 To compile this code as a module, choose M here: the
345 module will be called em_cmp.
346
347config NET_EMATCH_NBYTE
348 tristate "Multi byte comparison"
349 depends on NET_EMATCH
350 ---help---
351 Say Y here if you want to be able to classify packets based on
352 multiple byte comparisons mainly useful for IPv6 address comparisons.
353
354 To compile this code as a module, choose M here: the
355 module will be called em_nbyte.
356
357config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100358 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359 depends on NET_EMATCH
360 ---help---
361 Say Y here if you want to be able to classify packets using
362 the famous u32 key in combination with logic relations.
363
364 To compile this code as a module, choose M here: the
365 module will be called em_u32.
366
367config NET_EMATCH_META
368 tristate "Metadata"
369 depends on NET_EMATCH
370 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800371 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700372 metadata such as load average, netfilter attributes, socket
373 attributes and routing decisions.
374
375 To compile this code as a module, choose M here: the
376 module will be called em_meta.
377
Thomas Grafd675c982005-06-23 21:00:58 -0700378config NET_EMATCH_TEXT
379 tristate "Textsearch"
380 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700381 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700382 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700383 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700384 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700385 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100386 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700387 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700388
389 To compile this code as a module, choose M here: the
390 module will be called em_text.
391
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100393 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100395 Say Y here if you want to use traffic control actions. Actions
396 get attached to classifiers and are invoked after a successful
397 classification. They are used to overwrite the classification
398 result, instantly drop or redirect packets, etc.
399
400 A recent version of the iproute2 package is required to use
401 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402
403config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100404 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405 depends on NET_CLS_ACT
406 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100407 Say Y here if you want to do traffic policing, i.e. strict
408 bandwidth limiting. This action replaces the existing policing
409 module.
410
411 To compile this code as a module, choose M here: the
412 module will be called police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413
414config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100415 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416 depends on NET_CLS_ACT
417 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100418 Say Y here to take generic actions such as dropping and
419 accepting packets.
420
421 To compile this code as a module, choose M here: the
422 module will be called gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423
424config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100425 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426 depends on NET_ACT_GACT
427 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100428 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429
430config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100431 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700432 depends on NET_CLS_ACT
433 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100434 Say Y here to allow packets to be mirrored or redirected to
435 other devices.
436
437 To compile this code as a module, choose M here: the
438 module will be called mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439
440config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100441 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
443 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200444 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100445 classification.
446
447 To compile this code as a module, choose M here: the
448 module will be called ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449
450config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100451 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700452 depends on NET_CLS_ACT
453 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100454 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700455
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100456 To compile this code as a module, choose M here: the
457 module will be called pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700458
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700459config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100460 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700461 depends on NET_CLS_ACT
462 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100463 Say Y here to add a simple action for demonstration purposes.
464 It is meant as an example and for debugging purposes. It will
465 print a configured policy string followed by the packet count
466 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700467
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100468 If unsure, say N.
469
470 To compile this code as a module, choose M here: the
471 module will be called simple.
472
473config NET_CLS_POLICE
474 bool "Traffic Policing (obsolete)"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800475 depends on NET_CLS_ACT!=y
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100476 ---help---
477 Say Y here if you want to do traffic policing, i.e. strict
478 bandwidth limiting. This option is obsoleted by the traffic
479 policer implemented as action, it stays here for compatibility
480 reasons.
481
482config NET_CLS_IND
483 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800484 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100485 ---help---
486 Say Y here to extend the u32 and fw classifier to support
487 classification based on the incoming device. This option is
488 likely to disappear in favour of the metadata ematch.
489
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800490endif # NET_SCHED
491
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100492endmenu