blob: 9437b27ff84de101b88b3cbe08675f002e562238 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#
2# Traffic control configuration.
3#
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -07004
Randy Dunlap85ef3e52007-10-18 21:56:38 -07005menuconfig NET_SCHED
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -07006 bool "QoS and/or fair queueing"
David Kimdon3c62f752006-11-09 16:16:21 -08007 select NET_SCH_FIFO
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -07008 ---help---
9 When the kernel has several packets to send out over a network
10 device, it has to decide which ones to send first, which ones to
Thomas Graf52ab4ac2005-11-01 15:13:02 +010011 delay, and which ones to drop. This is the job of the queueing
12 disciplines, several different algorithms for how to do this
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070013 "fairly" have been proposed.
14
15 If you say N here, you will get the standard packet scheduler, which
16 is a FIFO (first come, first served). If you say Y here, you will be
17 able to choose from among several alternative algorithms which can
18 then be attached to different network devices. This is useful for
19 example if some of your network devices are real time devices that
20 need a certain minimum data flow rate, or if you need to limit the
21 maximum data flow rate for traffic which matches specified criteria.
22 This code is considered to be experimental.
23
24 To administer these schedulers, you'll need the user-level utilities
25 from the package iproute2+tc at <ftp://ftp.tux.org/pub/net/ip-routing/>.
26 That package also contains some documentation; for more, check out
Thomas Graf52ab4ac2005-11-01 15:13:02 +010027 <http://linux-net.osdl.org/index.php/Iproute2>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070028
29 This Quality of Service (QoS) support will enable you to use
30 Differentiated Services (diffserv) and Resource Reservation Protocol
Thomas Graf52ab4ac2005-11-01 15:13:02 +010031 (RSVP) on your Linux router if you also say Y to the corresponding
32 classifiers below. Documentation and software is at
33 <http://diffserv.sourceforge.net/>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070034
35 If you say Y here and to "/proc file system" below, you will be able
36 to read status information about packet schedulers from the file
37 /proc/net/psched.
38
39 The available schedulers are listed in the following questions; you
40 can say Y to as many as you like. If unsure, say N now.
41
Roman Zippel05b8b0f2005-11-17 15:22:39 -080042if NET_SCHED
43
Thomas Graf52ab4ac2005-11-01 15:13:02 +010044comment "Queueing/Scheduling"
Thomas Graf52ab4ac2005-11-01 15:13:02 +010045
Linus Torvalds1da177e2005-04-16 15:20:36 -070046config NET_SCH_CBQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +010047 tristate "Class Based Queueing (CBQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070048 ---help---
49 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +010050 scheduling algorithm. This algorithm classifies the waiting packets
51 into a tree-like hierarchy of classes; the leaves of this tree are
52 in turn scheduled by separate algorithms.
Linus Torvalds1da177e2005-04-16 15:20:36 -070053
Thomas Graf52ab4ac2005-11-01 15:13:02 +010054 See the top of <file:net/sched/sch_cbq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -070055
56 CBQ is a commonly used scheduler, so if you're unsure, you should
57 say Y here. Then say Y to all the queueing algorithms below that you
Thomas Graf52ab4ac2005-11-01 15:13:02 +010058 want to use as leaf disciplines.
Linus Torvalds1da177e2005-04-16 15:20:36 -070059
60 To compile this code as a module, choose M here: the
61 module will be called sch_cbq.
62
63config NET_SCH_HTB
Thomas Graf52ab4ac2005-11-01 15:13:02 +010064 tristate "Hierarchical Token Bucket (HTB)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070065 ---help---
66 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
Thomas Graf52ab4ac2005-11-01 15:13:02 +010067 packet scheduling algorithm. See
Linus Torvalds1da177e2005-04-16 15:20:36 -070068 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
69 in-depth articles.
70
Thomas Graf52ab4ac2005-11-01 15:13:02 +010071 HTB is very similar to CBQ regarding its goals however is has
Linus Torvalds1da177e2005-04-16 15:20:36 -070072 different properties and different algorithm.
73
74 To compile this code as a module, choose M here: the
75 module will be called sch_htb.
76
77config NET_SCH_HFSC
Thomas Graf52ab4ac2005-11-01 15:13:02 +010078 tristate "Hierarchical Fair Service Curve (HFSC)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070079 ---help---
80 Say Y here if you want to use the Hierarchical Fair Service Curve
Thomas Graf52ab4ac2005-11-01 15:13:02 +010081 (HFSC) packet scheduling algorithm.
Linus Torvalds1da177e2005-04-16 15:20:36 -070082
83 To compile this code as a module, choose M here: the
84 module will be called sch_hfsc.
85
Linus Torvalds1da177e2005-04-16 15:20:36 -070086config NET_SCH_ATM
Thomas Graf52ab4ac2005-11-01 15:13:02 +010087 tristate "ATM Virtual Circuits (ATM)"
Roman Zippel05b8b0f2005-11-17 15:22:39 -080088 depends on ATM
Linus Torvalds1da177e2005-04-16 15:20:36 -070089 ---help---
90 Say Y here if you want to use the ATM pseudo-scheduler. This
Thomas Graf52ab4ac2005-11-01 15:13:02 +010091 provides a framework for invoking classifiers, which in turn
92 select classes of this queuing discipline. Each class maps
93 the flow(s) it is handling to a given virtual circuit.
94
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -070095 See the top of <file:net/sched/sch_atm.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -070096
97 To compile this code as a module, choose M here: the
98 module will be called sch_atm.
99
100config NET_SCH_PRIO
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100101 tristate "Multi Band Priority Queueing (PRIO)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100102 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 Say Y here if you want to use an n-band priority queue packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100104 scheduler.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105
106 To compile this code as a module, choose M here: the
107 module will be called sch_prio.
108
109config NET_SCH_RED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100110 tristate "Random Early Detection (RED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100111 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112 Say Y here if you want to use the Random Early Detection (RED)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100113 packet scheduling algorithm.
114
115 See the top of <file:net/sched/sch_red.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116
117 To compile this code as a module, choose M here: the
118 module will be called sch_red.
119
120config NET_SCH_SFQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100121 tristate "Stochastic Fairness Queueing (SFQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 ---help---
123 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700124 packet scheduling algorithm.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100125
126 See the top of <file:net/sched/sch_sfq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127
128 To compile this code as a module, choose M here: the
129 module will be called sch_sfq.
130
131config NET_SCH_TEQL
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100132 tristate "True Link Equalizer (TEQL)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 ---help---
134 Say Y here if you want to use the True Link Equalizer (TLE) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100135 scheduling algorithm. This queueing discipline allows the combination
136 of several physical devices into one virtual device.
137
138 See the top of <file:net/sched/sch_teql.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139
140 To compile this code as a module, choose M here: the
141 module will be called sch_teql.
142
143config NET_SCH_TBF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100144 tristate "Token Bucket Filter (TBF)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100145 ---help---
146 Say Y here if you want to use the Token Bucket Filter (TBF) packet
147 scheduling algorithm.
148
149 See the top of <file:net/sched/sch_tbf.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150
151 To compile this code as a module, choose M here: the
152 module will be called sch_tbf.
153
154config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100155 tristate "Generic Random Early Detection (GRED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100156 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700158 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159 (see the top of <file:net/sched/sch_red.c> for details and
160 references about the algorithm).
161
162 To compile this code as a module, choose M here: the
163 module will be called sch_gred.
164
165config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100166 tristate "Differentiated Services marker (DSMARK)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100167 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168 Say Y if you want to schedule packets according to the
169 Differentiated Services architecture proposed in RFC 2475.
170 Technical information on this method, with pointers to associated
171 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
172
173 To compile this code as a module, choose M here: the
174 module will be called sch_dsmark.
175
176config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100177 tristate "Network emulator (NETEM)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100178 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 Say Y if you want to emulate network delay, loss, and packet
180 re-ordering. This is often useful to simulate networks when
181 testing applications or protocols.
182
183 To compile this driver as a module, choose M here: the module
184 will be called sch_netem.
185
186 If unsure, say N.
187
188config NET_SCH_INGRESS
189 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800190 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100191 ---help---
192 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193 If unsure, say Y.
194
195 To compile this code as a module, choose M here: the
196 module will be called sch_ingress.
197
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100198comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199
200config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100201 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202
203config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100204 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100205 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206 ---help---
207 Say Y here if you want to be able to classify packets using
208 only extended matches and actions.
209
210 To compile this code as a module, choose M here: the
211 module will be called cls_basic.
212
213config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100214 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100215 select NET_CLS
216 ---help---
217 Say Y here if you want to be able to classify packets based on
218 traffic control indices. You will want this feature if you want
219 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220
221 To compile this code as a module, choose M here: the
222 module will be called cls_tcindex.
223
224config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100225 tristate "Routing decision (ROUTE)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 select NET_CLS_ROUTE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100227 select NET_CLS
228 ---help---
229 If you say Y here, you will be able to classify packets
230 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231
232 To compile this code as a module, choose M here: the
233 module will be called cls_route.
234
235config NET_CLS_ROUTE
236 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700237
238config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100239 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100240 select NET_CLS
241 ---help---
242 If you say Y here, you will be able to classify packets
243 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244
245 To compile this code as a module, choose M here: the
246 module will be called cls_fw.
247
248config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100249 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100250 select NET_CLS
251 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200252 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100253 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254
255 To compile this code as a module, choose M here: the
256 module will be called cls_u32.
257
258config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100259 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100261 ---help---
262 Say Y here to make u32 gather additional statistics useful for
263 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264
265config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100266 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800267 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100268 ---help---
269 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270
271config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100272 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100273 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274 ---help---
275 The Resource Reservation Protocol (RSVP) permits end systems to
276 request a minimum and maximum data flow rate for a connection; this
277 is important for real time data such as streaming sound or video.
278
279 Say Y here if you want to be able to classify outgoing packets based
280 on their RSVP requests.
281
282 To compile this code as a module, choose M here: the
283 module will be called cls_rsvp.
284
285config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100286 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100287 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700288 ---help---
289 The Resource Reservation Protocol (RSVP) permits end systems to
290 request a minimum and maximum data flow rate for a connection; this
291 is important for real time data such as streaming sound or video.
292
293 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700294 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700295
296 To compile this code as a module, choose M here: the
297 module will be called cls_rsvp6.
298
Patrick McHardye5dfb812008-01-31 18:37:42 -0800299config NET_CLS_FLOW
300 tristate "Flow classifier"
301 select NET_CLS
302 ---help---
303 If you say Y here, you will be able to classify packets based on
304 a configurable combination of packet keys. This is mostly useful
305 in combination with SFQ.
306
307 To compile this code as a module, choose M here: the
308 module will be called cls_flow.
309
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310config NET_EMATCH
311 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100312 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313 ---help---
314 Say Y here if you want to use extended matches on top of classifiers
315 and select the extended matches below.
316
317 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100318 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100320 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321 extended matches.
322
323config NET_EMATCH_STACK
324 int "Stack size"
325 depends on NET_EMATCH
326 default "32"
327 ---help---
328 Size of the local stack variable used while evaluating the tree of
329 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700330 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331 stack space.
332
333config NET_EMATCH_CMP
334 tristate "Simple packet data comparison"
335 depends on NET_EMATCH
336 ---help---
337 Say Y here if you want to be able to classify packets based on
338 simple packet data comparisons for 8, 16, and 32bit values.
339
340 To compile this code as a module, choose M here: the
341 module will be called em_cmp.
342
343config NET_EMATCH_NBYTE
344 tristate "Multi byte comparison"
345 depends on NET_EMATCH
346 ---help---
347 Say Y here if you want to be able to classify packets based on
348 multiple byte comparisons mainly useful for IPv6 address comparisons.
349
350 To compile this code as a module, choose M here: the
351 module will be called em_nbyte.
352
353config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100354 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355 depends on NET_EMATCH
356 ---help---
357 Say Y here if you want to be able to classify packets using
358 the famous u32 key in combination with logic relations.
359
360 To compile this code as a module, choose M here: the
361 module will be called em_u32.
362
363config NET_EMATCH_META
364 tristate "Metadata"
365 depends on NET_EMATCH
366 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800367 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700368 metadata such as load average, netfilter attributes, socket
369 attributes and routing decisions.
370
371 To compile this code as a module, choose M here: the
372 module will be called em_meta.
373
Thomas Grafd675c982005-06-23 21:00:58 -0700374config NET_EMATCH_TEXT
375 tristate "Textsearch"
376 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700377 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700378 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700379 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700380 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700381 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100382 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700383 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700384
385 To compile this code as a module, choose M here: the
386 module will be called em_text.
387
Linus Torvalds1da177e2005-04-16 15:20:36 -0700388config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100389 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100391 Say Y here if you want to use traffic control actions. Actions
392 get attached to classifiers and are invoked after a successful
393 classification. They are used to overwrite the classification
394 result, instantly drop or redirect packets, etc.
395
396 A recent version of the iproute2 package is required to use
397 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700398
399config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100400 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700401 depends on NET_CLS_ACT
402 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100403 Say Y here if you want to do traffic policing, i.e. strict
404 bandwidth limiting. This action replaces the existing policing
405 module.
406
407 To compile this code as a module, choose M here: the
408 module will be called police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409
410config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100411 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700412 depends on NET_CLS_ACT
413 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100414 Say Y here to take generic actions such as dropping and
415 accepting packets.
416
417 To compile this code as a module, choose M here: the
418 module will be called gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700419
420config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100421 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422 depends on NET_ACT_GACT
423 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100424 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425
426config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100427 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700428 depends on NET_CLS_ACT
429 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100430 Say Y here to allow packets to be mirrored or redirected to
431 other devices.
432
433 To compile this code as a module, choose M here: the
434 module will be called mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435
436config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100437 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
439 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200440 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100441 classification.
442
443 To compile this code as a module, choose M here: the
444 module will be called ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700445
Herbert Xub4219952007-09-27 12:48:05 -0700446config NET_ACT_NAT
447 tristate "Stateless NAT"
448 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700449 ---help---
450 Say Y here to do stateless NAT on IPv4 packets. You should use
451 netfilter for NAT unless you know what you are doing.
452
453 To compile this code as a module, choose M here: the
454 module will be called nat.
455
Linus Torvalds1da177e2005-04-16 15:20:36 -0700456config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100457 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700458 depends on NET_CLS_ACT
459 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100460 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700461
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100462 To compile this code as a module, choose M here: the
463 module will be called pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700465config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100466 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700467 depends on NET_CLS_ACT
468 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100469 Say Y here to add a simple action for demonstration purposes.
470 It is meant as an example and for debugging purposes. It will
471 print a configured policy string followed by the packet count
472 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700473
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100474 If unsure, say N.
475
476 To compile this code as a module, choose M here: the
477 module will be called simple.
478
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100479config NET_CLS_IND
480 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800481 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100482 ---help---
483 Say Y here to extend the u32 and fw classifier to support
484 classification based on the incoming device. This option is
485 likely to disappear in favour of the metadata ematch.
486
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800487endif # NET_SCHED
488
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700489config NET_SCH_FIFO
490 bool