blob: e318f458713e64248ca6fbc4f456577b9671ade1 [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
Michael Wittenc996d8b2010-11-15 19:55:34 +000027 <http://www.linuxfoundation.org/collaborate/workgroups/networking/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
Patrick McHardy13d2a1d2008-11-20 04:10:00 -0800197config NET_SCH_DRR
198 tristate "Deficit Round Robin scheduler (DRR)"
199 help
200 Say Y here if you want to use the Deficit Round Robin (DRR) packet
201 scheduling algorithm.
202
203 To compile this driver as a module, choose M here: the module
204 will be called sch_drr.
205
206 If unsure, say N.
207
John Fastabendb8970f02011-01-17 08:06:09 +0000208config NET_SCH_MQPRIO
209 tristate "Multi-queue priority scheduler (MQPRIO)"
210 help
211 Say Y here if you want to use the Multi-queue Priority scheduler.
212 This scheduler allows QOS to be offloaded on NICs that have support
213 for offloading QOS schedulers.
214
215 To compile this driver as a module, choose M here: the module will
216 be called sch_mqprio.
217
218 If unsure, say N.
219
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220config NET_SCH_INGRESS
221 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800222 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100223 ---help---
224 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225 If unsure, say Y.
226
227 To compile this code as a module, choose M here: the
228 module will be called sch_ingress.
229
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100230comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231
232config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100233 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234
235config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100236 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100237 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238 ---help---
239 Say Y here if you want to be able to classify packets using
240 only extended matches and actions.
241
242 To compile this code as a module, choose M here: the
243 module will be called cls_basic.
244
245config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100246 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100247 select NET_CLS
248 ---help---
249 Say Y here if you want to be able to classify packets based on
250 traffic control indices. You will want this feature if you want
251 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252
253 To compile this code as a module, choose M here: the
254 module will be called cls_tcindex.
255
256config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100257 tristate "Routing decision (ROUTE)"
Patrick McHardyc7066f72011-01-14 13:36:42 +0100258 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100259 select NET_CLS
260 ---help---
261 If you say Y here, you will be able to classify packets
262 according to the route table entry they matched.
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_route.
266
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100268 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100269 select NET_CLS
270 ---help---
271 If you say Y here, you will be able to classify packets
272 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273
274 To compile this code as a module, choose M here: the
275 module will be called cls_fw.
276
277config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100278 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100279 select NET_CLS
280 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200281 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100282 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283
284 To compile this code as a module, choose M here: the
285 module will be called cls_u32.
286
287config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100288 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100290 ---help---
291 Say Y here to make u32 gather additional statistics useful for
292 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293
294config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100295 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800296 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100297 ---help---
298 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299
300config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100301 tristate "IPv4 Resource Reservation Protocol (RSVP)"
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
309 on their RSVP requests.
310
311 To compile this code as a module, choose M here: the
312 module will be called cls_rsvp.
313
314config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100315 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100316 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317 ---help---
318 The Resource Reservation Protocol (RSVP) permits end systems to
319 request a minimum and maximum data flow rate for a connection; this
320 is important for real time data such as streaming sound or video.
321
322 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700323 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324
325 To compile this code as a module, choose M here: the
326 module will be called cls_rsvp6.
327
Patrick McHardye5dfb812008-01-31 18:37:42 -0800328config NET_CLS_FLOW
329 tristate "Flow classifier"
330 select NET_CLS
331 ---help---
332 If you say Y here, you will be able to classify packets based on
333 a configurable combination of packet keys. This is mostly useful
334 in combination with SFQ.
335
336 To compile this code as a module, choose M here: the
337 module will be called cls_flow.
338
Thomas Graff4009232008-11-07 22:56:00 -0800339config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000340 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800341 select NET_CLS
342 depends on CGROUPS
343 ---help---
344 Say Y here if you want to classify packets based on the control
345 cgroup of their process.
346
Ben Blum8e039d82010-03-23 05:24:03 +0000347 To compile this code as a module, choose M here: the
348 module will be called cls_cgroup.
349
Linus Torvalds1da177e2005-04-16 15:20:36 -0700350config NET_EMATCH
351 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100352 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700353 ---help---
354 Say Y here if you want to use extended matches on top of classifiers
355 and select the extended matches below.
356
357 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100358 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100360 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361 extended matches.
362
363config NET_EMATCH_STACK
364 int "Stack size"
365 depends on NET_EMATCH
366 default "32"
367 ---help---
368 Size of the local stack variable used while evaluating the tree of
369 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700370 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371 stack space.
372
373config NET_EMATCH_CMP
374 tristate "Simple packet data comparison"
375 depends on NET_EMATCH
376 ---help---
377 Say Y here if you want to be able to classify packets based on
378 simple packet data comparisons for 8, 16, and 32bit values.
379
380 To compile this code as a module, choose M here: the
381 module will be called em_cmp.
382
383config NET_EMATCH_NBYTE
384 tristate "Multi byte comparison"
385 depends on NET_EMATCH
386 ---help---
387 Say Y here if you want to be able to classify packets based on
388 multiple byte comparisons mainly useful for IPv6 address comparisons.
389
390 To compile this code as a module, choose M here: the
391 module will be called em_nbyte.
392
393config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100394 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395 depends on NET_EMATCH
396 ---help---
397 Say Y here if you want to be able to classify packets using
398 the famous u32 key in combination with logic relations.
399
400 To compile this code as a module, choose M here: the
401 module will be called em_u32.
402
403config NET_EMATCH_META
404 tristate "Metadata"
405 depends on NET_EMATCH
406 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800407 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408 metadata such as load average, netfilter attributes, socket
409 attributes and routing decisions.
410
411 To compile this code as a module, choose M here: the
412 module will be called em_meta.
413
Thomas Grafd675c982005-06-23 21:00:58 -0700414config NET_EMATCH_TEXT
415 tristate "Textsearch"
416 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700417 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700418 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700419 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700420 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700421 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100422 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700423 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700424
425 To compile this code as a module, choose M here: the
426 module will be called em_text.
427
Linus Torvalds1da177e2005-04-16 15:20:36 -0700428config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100429 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700430 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100431 Say Y here if you want to use traffic control actions. Actions
432 get attached to classifiers and are invoked after a successful
433 classification. They are used to overwrite the classification
434 result, instantly drop or redirect packets, etc.
435
436 A recent version of the iproute2 package is required to use
437 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438
439config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100440 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441 depends on NET_CLS_ACT
442 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100443 Say Y here if you want to do traffic policing, i.e. strict
444 bandwidth limiting. This action replaces the existing policing
445 module.
446
447 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800448 module will be called act_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449
450config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100451 tristate "Generic actions"
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 to take generic actions such as dropping and
455 accepting packets.
456
457 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800458 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459
460config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100461 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700462 depends on NET_ACT_GACT
463 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100464 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700465
466config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100467 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468 depends on NET_CLS_ACT
469 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100470 Say Y here to allow packets to be mirrored or redirected to
471 other devices.
472
473 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800474 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700475
476config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100477 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
479 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200480 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100481 classification.
482
483 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800484 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700485
Herbert Xub4219952007-09-27 12:48:05 -0700486config NET_ACT_NAT
487 tristate "Stateless NAT"
488 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700489 ---help---
490 Say Y here to do stateless NAT on IPv4 packets. You should use
491 netfilter for NAT unless you know what you are doing.
492
493 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800494 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700495
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100497 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700498 depends on NET_CLS_ACT
499 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100500 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100502 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800503 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700505config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100506 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700507 depends on NET_CLS_ACT
508 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100509 Say Y here to add a simple action for demonstration purposes.
510 It is meant as an example and for debugging purposes. It will
511 print a configured policy string followed by the packet count
512 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700513
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100514 If unsure, say N.
515
516 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800517 module will be called act_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100518
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700519config NET_ACT_SKBEDIT
520 tristate "SKB Editing"
521 depends on NET_CLS_ACT
522 ---help---
523 Say Y here to change skb priority or queue_mapping settings.
524
525 If unsure, say N.
526
527 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800528 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700529
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000530config NET_ACT_CSUM
531 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700532 depends on NET_CLS_ACT && INET
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000533 ---help---
534 Say Y here to update some common checksum after some direct
535 packet alterations.
536
537 To compile this code as a module, choose M here: the
538 module will be called act_csum.
539
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100540config NET_CLS_IND
541 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800542 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100543 ---help---
544 Say Y here to extend the u32 and fw classifier to support
545 classification based on the incoming device. This option is
546 likely to disappear in favour of the metadata ematch.
547
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800548endif # NET_SCHED
549
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700550config NET_SCH_FIFO
551 bool