blob: 36543b6fcef31230a3a7dd64990668d09841f9cb [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
Alexander Duyck92651942008-09-12 16:29:34 -0700109config NET_SCH_MULTIQ
110 tristate "Hardware Multiqueue-aware Multi Band Queuing (MULTIQ)"
111 ---help---
112 Say Y here if you want to use an n-band queue packet scheduler
113 to support devices that have multiple hardware transmit queues.
114
115 To compile this code as a module, choose M here: the
116 module will be called sch_multiq.
117
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118config NET_SCH_RED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100119 tristate "Random Early Detection (RED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100120 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 Say Y here if you want to use the Random Early Detection (RED)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100122 packet scheduling algorithm.
123
124 See the top of <file:net/sched/sch_red.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125
126 To compile this code as a module, choose M here: the
127 module will be called sch_red.
128
129config NET_SCH_SFQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100130 tristate "Stochastic Fairness Queueing (SFQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 ---help---
132 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700133 packet scheduling algorithm.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100134
135 See the top of <file:net/sched/sch_sfq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136
137 To compile this code as a module, choose M here: the
138 module will be called sch_sfq.
139
140config NET_SCH_TEQL
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100141 tristate "True Link Equalizer (TEQL)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 ---help---
143 Say Y here if you want to use the True Link Equalizer (TLE) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100144 scheduling algorithm. This queueing discipline allows the combination
145 of several physical devices into one virtual device.
146
147 See the top of <file:net/sched/sch_teql.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148
149 To compile this code as a module, choose M here: the
150 module will be called sch_teql.
151
152config NET_SCH_TBF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100153 tristate "Token Bucket Filter (TBF)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100154 ---help---
155 Say Y here if you want to use the Token Bucket Filter (TBF) packet
156 scheduling algorithm.
157
158 See the top of <file:net/sched/sch_tbf.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159
160 To compile this code as a module, choose M here: the
161 module will be called sch_tbf.
162
163config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100164 tristate "Generic Random Early Detection (GRED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100165 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700167 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168 (see the top of <file:net/sched/sch_red.c> for details and
169 references about the algorithm).
170
171 To compile this code as a module, choose M here: the
172 module will be called sch_gred.
173
174config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100175 tristate "Differentiated Services marker (DSMARK)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100176 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 Say Y if you want to schedule packets according to the
178 Differentiated Services architecture proposed in RFC 2475.
179 Technical information on this method, with pointers to associated
180 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
181
182 To compile this code as a module, choose M here: the
183 module will be called sch_dsmark.
184
185config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100186 tristate "Network emulator (NETEM)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100187 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188 Say Y if you want to emulate network delay, loss, and packet
189 re-ordering. This is often useful to simulate networks when
190 testing applications or protocols.
191
192 To compile this driver as a module, choose M here: the module
193 will be called sch_netem.
194
195 If unsure, say N.
196
197config NET_SCH_INGRESS
198 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800199 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100200 ---help---
201 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202 If unsure, say Y.
203
204 To compile this code as a module, choose M here: the
205 module will be called sch_ingress.
206
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100207comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208
209config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100210 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700211
212config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100213 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100214 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 ---help---
216 Say Y here if you want to be able to classify packets using
217 only extended matches and actions.
218
219 To compile this code as a module, choose M here: the
220 module will be called cls_basic.
221
222config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100223 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100224 select NET_CLS
225 ---help---
226 Say Y here if you want to be able to classify packets based on
227 traffic control indices. You will want this feature if you want
228 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229
230 To compile this code as a module, choose M here: the
231 module will be called cls_tcindex.
232
233config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100234 tristate "Routing decision (ROUTE)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235 select NET_CLS_ROUTE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100236 select NET_CLS
237 ---help---
238 If you say Y here, you will be able to classify packets
239 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240
241 To compile this code as a module, choose M here: the
242 module will be called cls_route.
243
244config NET_CLS_ROUTE
245 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246
247config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100248 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100249 select NET_CLS
250 ---help---
251 If you say Y here, you will be able to classify packets
252 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253
254 To compile this code as a module, choose M here: the
255 module will be called cls_fw.
256
257config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100258 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100259 select NET_CLS
260 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200261 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100262 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700263
264 To compile this code as a module, choose M here: the
265 module will be called cls_u32.
266
267config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100268 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100270 ---help---
271 Say Y here to make u32 gather additional statistics useful for
272 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273
274config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100275 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800276 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100277 ---help---
278 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279
280config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100281 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100282 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283 ---help---
284 The Resource Reservation Protocol (RSVP) permits end systems to
285 request a minimum and maximum data flow rate for a connection; this
286 is important for real time data such as streaming sound or video.
287
288 Say Y here if you want to be able to classify outgoing packets based
289 on their RSVP requests.
290
291 To compile this code as a module, choose M here: the
292 module will be called cls_rsvp.
293
294config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100295 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100296 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297 ---help---
298 The Resource Reservation Protocol (RSVP) permits end systems to
299 request a minimum and maximum data flow rate for a connection; this
300 is important for real time data such as streaming sound or video.
301
302 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700303 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304
305 To compile this code as a module, choose M here: the
306 module will be called cls_rsvp6.
307
Patrick McHardye5dfb812008-01-31 18:37:42 -0800308config NET_CLS_FLOW
309 tristate "Flow classifier"
310 select NET_CLS
311 ---help---
312 If you say Y here, you will be able to classify packets based on
313 a configurable combination of packet keys. This is mostly useful
314 in combination with SFQ.
315
316 To compile this code as a module, choose M here: the
317 module will be called cls_flow.
318
Thomas Graff4009232008-11-07 22:56:00 -0800319config NET_CLS_CGROUP
320 bool "Control Group Classifier"
321 select NET_CLS
322 depends on CGROUPS
323 ---help---
324 Say Y here if you want to classify packets based on the control
325 cgroup of their process.
326
327 To compile this code as a module, choose M here: the
328 module will be called cls_cgroup.
329
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330config NET_EMATCH
331 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100332 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700333 ---help---
334 Say Y here if you want to use extended matches on top of classifiers
335 and select the extended matches below.
336
337 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100338 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100340 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341 extended matches.
342
343config NET_EMATCH_STACK
344 int "Stack size"
345 depends on NET_EMATCH
346 default "32"
347 ---help---
348 Size of the local stack variable used while evaluating the tree of
349 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700350 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351 stack space.
352
353config NET_EMATCH_CMP
354 tristate "Simple packet data comparison"
355 depends on NET_EMATCH
356 ---help---
357 Say Y here if you want to be able to classify packets based on
358 simple packet data comparisons for 8, 16, and 32bit values.
359
360 To compile this code as a module, choose M here: the
361 module will be called em_cmp.
362
363config NET_EMATCH_NBYTE
364 tristate "Multi byte comparison"
365 depends on NET_EMATCH
366 ---help---
367 Say Y here if you want to be able to classify packets based on
368 multiple byte comparisons mainly useful for IPv6 address comparisons.
369
370 To compile this code as a module, choose M here: the
371 module will be called em_nbyte.
372
373config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100374 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375 depends on NET_EMATCH
376 ---help---
377 Say Y here if you want to be able to classify packets using
378 the famous u32 key in combination with logic relations.
379
380 To compile this code as a module, choose M here: the
381 module will be called em_u32.
382
383config NET_EMATCH_META
384 tristate "Metadata"
385 depends on NET_EMATCH
386 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800387 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700388 metadata such as load average, netfilter attributes, socket
389 attributes and routing decisions.
390
391 To compile this code as a module, choose M here: the
392 module will be called em_meta.
393
Thomas Grafd675c982005-06-23 21:00:58 -0700394config NET_EMATCH_TEXT
395 tristate "Textsearch"
396 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700397 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700398 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700399 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700400 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700401 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100402 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700403 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700404
405 To compile this code as a module, choose M here: the
406 module will be called em_text.
407
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100409 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700410 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100411 Say Y here if you want to use traffic control actions. Actions
412 get attached to classifiers and are invoked after a successful
413 classification. They are used to overwrite the classification
414 result, instantly drop or redirect packets, etc.
415
416 A recent version of the iproute2 package is required to use
417 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418
419config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100420 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700421 depends on NET_CLS_ACT
422 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100423 Say Y here if you want to do traffic policing, i.e. strict
424 bandwidth limiting. This action replaces the existing policing
425 module.
426
427 To compile this code as a module, choose M here: the
428 module will be called police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429
430config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100431 tristate "Generic actions"
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 take generic actions such as dropping and
435 accepting packets.
436
437 To compile this code as a module, choose M here: the
438 module will be called gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439
440config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100441 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442 depends on NET_ACT_GACT
443 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100444 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700445
446config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100447 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700448 depends on NET_CLS_ACT
449 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100450 Say Y here to allow packets to be mirrored or redirected to
451 other devices.
452
453 To compile this code as a module, choose M here: the
454 module will be called mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700455
456config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100457 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700458 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
459 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200460 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100461 classification.
462
463 To compile this code as a module, choose M here: the
464 module will be called ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700465
Herbert Xub4219952007-09-27 12:48:05 -0700466config NET_ACT_NAT
467 tristate "Stateless NAT"
468 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700469 ---help---
470 Say Y here to do stateless NAT on IPv4 packets. You should use
471 netfilter for NAT unless you know what you are doing.
472
473 To compile this code as a module, choose M here: the
474 module will be called nat.
475
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100477 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478 depends on NET_CLS_ACT
479 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100480 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100482 To compile this code as a module, choose M here: the
483 module will be called pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700485config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100486 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700487 depends on NET_CLS_ACT
488 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100489 Say Y here to add a simple action for demonstration purposes.
490 It is meant as an example and for debugging purposes. It will
491 print a configured policy string followed by the packet count
492 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700493
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100494 If unsure, say N.
495
496 To compile this code as a module, choose M here: the
497 module will be called simple.
498
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700499config NET_ACT_SKBEDIT
500 tristate "SKB Editing"
501 depends on NET_CLS_ACT
502 ---help---
503 Say Y here to change skb priority or queue_mapping settings.
504
505 If unsure, say N.
506
507 To compile this code as a module, choose M here: the
508 module will be called skbedit.
509
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100510config NET_CLS_IND
511 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800512 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100513 ---help---
514 Say Y here to extend the u32 and fw classifier to support
515 classification based on the incoming device. This option is
516 likely to disappear in favour of the metadata ematch.
517
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800518endif # NET_SCHED
519
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700520config NET_SCH_FIFO
521 bool