blob: 475df8449be9eee788a700a238b655534a23ff9d [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
114config NET_SCH_RED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100115 tristate "Random Early Detection (RED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100116 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 Say Y here if you want to use the Random Early Detection (RED)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100118 packet scheduling algorithm.
119
120 See the top of <file:net/sched/sch_red.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121
122 To compile this code as a module, choose M here: the
123 module will be called sch_red.
124
125config NET_SCH_SFQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100126 tristate "Stochastic Fairness Queueing (SFQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127 ---help---
128 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100129 packet scheduling algorithm .
130
131 See the top of <file:net/sched/sch_sfq.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_sfq.
135
136config NET_SCH_TEQL
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100137 tristate "True Link Equalizer (TEQL)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138 ---help---
139 Say Y here if you want to use the True Link Equalizer (TLE) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100140 scheduling algorithm. This queueing discipline allows the combination
141 of several physical devices into one virtual device.
142
143 See the top of <file:net/sched/sch_teql.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144
145 To compile this code as a module, choose M here: the
146 module will be called sch_teql.
147
148config NET_SCH_TBF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100149 tristate "Token Bucket Filter (TBF)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100150 ---help---
151 Say Y here if you want to use the Token Bucket Filter (TBF) packet
152 scheduling algorithm.
153
154 See the top of <file:net/sched/sch_tbf.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_tbf.
158
159config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100160 tristate "Generic Random Early Detection (GRED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100161 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700163 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164 (see the top of <file:net/sched/sch_red.c> for details and
165 references about the algorithm).
166
167 To compile this code as a module, choose M here: the
168 module will be called sch_gred.
169
170config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100171 tristate "Differentiated Services marker (DSMARK)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100172 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173 Say Y if you want to schedule packets according to the
174 Differentiated Services architecture proposed in RFC 2475.
175 Technical information on this method, with pointers to associated
176 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
177
178 To compile this code as a module, choose M here: the
179 module will be called sch_dsmark.
180
181config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100182 tristate "Network emulator (NETEM)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100183 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184 Say Y if you want to emulate network delay, loss, and packet
185 re-ordering. This is often useful to simulate networks when
186 testing applications or protocols.
187
188 To compile this driver as a module, choose M here: the module
189 will be called sch_netem.
190
191 If unsure, say N.
192
193config NET_SCH_INGRESS
194 tristate "Ingress Qdisc"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100195 ---help---
196 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197 If unsure, say Y.
198
199 To compile this code as a module, choose M here: the
200 module will be called sch_ingress.
201
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100202comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203
204config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100205 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206
207config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100208 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100209 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210 ---help---
211 Say Y here if you want to be able to classify packets using
212 only extended matches and actions.
213
214 To compile this code as a module, choose M here: the
215 module will be called cls_basic.
216
217config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100218 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100219 select NET_CLS
220 ---help---
221 Say Y here if you want to be able to classify packets based on
222 traffic control indices. You will want this feature if you want
223 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700224
225 To compile this code as a module, choose M here: the
226 module will be called cls_tcindex.
227
228config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100229 tristate "Routing decision (ROUTE)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700230 select NET_CLS_ROUTE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100231 select NET_CLS
232 ---help---
233 If you say Y here, you will be able to classify packets
234 according to the route table entry they matched.
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_route.
238
239config NET_CLS_ROUTE
240 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241
242config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100243 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100244 select NET_CLS
245 ---help---
246 If you say Y here, you will be able to classify packets
247 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248
249 To compile this code as a module, choose M here: the
250 module will be called cls_fw.
251
252config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100253 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100254 select NET_CLS
255 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200256 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100257 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258
259 To compile this code as a module, choose M here: the
260 module will be called cls_u32.
261
262config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100263 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100265 ---help---
266 Say Y here to make u32 gather additional statistics useful for
267 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700268
269config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100270 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800271 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100272 ---help---
273 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274
275config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100276 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100277 select NET_CLS
278 select NET_ESTIMATOR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279 ---help---
280 The Resource Reservation Protocol (RSVP) permits end systems to
281 request a minimum and maximum data flow rate for a connection; this
282 is important for real time data such as streaming sound or video.
283
284 Say Y here if you want to be able to classify outgoing packets based
285 on their RSVP requests.
286
287 To compile this code as a module, choose M here: the
288 module will be called cls_rsvp.
289
290config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100291 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100292 select NET_CLS
293 select NET_ESTIMATOR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294 ---help---
295 The Resource Reservation Protocol (RSVP) permits end systems to
296 request a minimum and maximum data flow rate for a connection; this
297 is important for real time data such as streaming sound or video.
298
299 Say Y here if you want to be able to classify outgoing packets based
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100300 on their RSVP requests and you are using the IPv6.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301
302 To compile this code as a module, choose M here: the
303 module will be called cls_rsvp6.
304
305config NET_EMATCH
306 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100307 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700308 ---help---
309 Say Y here if you want to use extended matches on top of classifiers
310 and select the extended matches below.
311
312 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100313 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100315 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316 extended matches.
317
318config NET_EMATCH_STACK
319 int "Stack size"
320 depends on NET_EMATCH
321 default "32"
322 ---help---
323 Size of the local stack variable used while evaluating the tree of
324 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700325 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326 stack space.
327
328config NET_EMATCH_CMP
329 tristate "Simple packet data comparison"
330 depends on NET_EMATCH
331 ---help---
332 Say Y here if you want to be able to classify packets based on
333 simple packet data comparisons for 8, 16, and 32bit values.
334
335 To compile this code as a module, choose M here: the
336 module will be called em_cmp.
337
338config NET_EMATCH_NBYTE
339 tristate "Multi byte comparison"
340 depends on NET_EMATCH
341 ---help---
342 Say Y here if you want to be able to classify packets based on
343 multiple byte comparisons mainly useful for IPv6 address comparisons.
344
345 To compile this code as a module, choose M here: the
346 module will be called em_nbyte.
347
348config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100349 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700350 depends on NET_EMATCH
351 ---help---
352 Say Y here if you want to be able to classify packets using
353 the famous u32 key in combination with logic relations.
354
355 To compile this code as a module, choose M here: the
356 module will be called em_u32.
357
358config NET_EMATCH_META
359 tristate "Metadata"
360 depends on NET_EMATCH
361 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800362 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700363 metadata such as load average, netfilter attributes, socket
364 attributes and routing decisions.
365
366 To compile this code as a module, choose M here: the
367 module will be called em_meta.
368
Thomas Grafd675c982005-06-23 21:00:58 -0700369config NET_EMATCH_TEXT
370 tristate "Textsearch"
371 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700372 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700373 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700374 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700375 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700376 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100377 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700378 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700379
380 To compile this code as a module, choose M here: the
381 module will be called em_text.
382
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100384 bool "Actions"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100385 select NET_ESTIMATOR
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100387 Say Y here if you want to use traffic control actions. Actions
388 get attached to classifiers and are invoked after a successful
389 classification. They are used to overwrite the classification
390 result, instantly drop or redirect packets, etc.
391
392 A recent version of the iproute2 package is required to use
393 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394
395config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100396 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700397 depends on NET_CLS_ACT
398 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100399 Say Y here if you want to do traffic policing, i.e. strict
400 bandwidth limiting. This action replaces the existing policing
401 module.
402
403 To compile this code as a module, choose M here: the
404 module will be called police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405
406config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100407 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408 depends on NET_CLS_ACT
409 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100410 Say Y here to take generic actions such as dropping and
411 accepting packets.
412
413 To compile this code as a module, choose M here: the
414 module will be called gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415
416config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100417 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418 depends on NET_ACT_GACT
419 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100420 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700421
422config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100423 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700424 depends on NET_CLS_ACT
425 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100426 Say Y here to allow packets to be mirrored or redirected to
427 other devices.
428
429 To compile this code as a module, choose M here: the
430 module will be called mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700431
432config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100433 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700434 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
435 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200436 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100437 classification.
438
439 To compile this code as a module, choose M here: the
440 module will be called ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441
442config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100443 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700444 depends on NET_CLS_ACT
445 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100446 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700447
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100448 To compile this code as a module, choose M here: the
449 module will be called pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700451config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100452 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700453 depends on NET_CLS_ACT
454 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100455 Say Y here to add a simple action for demonstration purposes.
456 It is meant as an example and for debugging purposes. It will
457 print a configured policy string followed by the packet count
458 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700459
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100460 If unsure, say N.
461
462 To compile this code as a module, choose M here: the
463 module will be called simple.
464
465config NET_CLS_POLICE
466 bool "Traffic Policing (obsolete)"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800467 depends on NET_CLS_ACT!=y
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100468 select NET_ESTIMATOR
469 ---help---
470 Say Y here if you want to do traffic policing, i.e. strict
471 bandwidth limiting. This option is obsoleted by the traffic
472 policer implemented as action, it stays here for compatibility
473 reasons.
474
475config NET_CLS_IND
476 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800477 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100478 ---help---
479 Say Y here to extend the u32 and fw classifier to support
480 classification based on the incoming device. This option is
481 likely to disappear in favour of the metadata ematch.
482
483config NET_ESTIMATOR
484 bool "Rate estimator"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100485 ---help---
486 Say Y here to allow using rate estimators to estimate the current
487 rate-of-flow for network devices, queues, etc. This module is
Matt LaPlante3539c272006-06-30 18:53:46 +0200488 automatically selected if needed but can be selected manually for
489 statistical purposes.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100490
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800491endif # NET_SCHED
492
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100493endmenu