blob: 8c19b6e3201e87b20ea3a9e3efc8ce08b8b452d5 [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
stephen hemminger45e14432011-02-02 15:21:10 +0000220config NET_SCH_CHOKE
221 tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
222 help
223 Say Y here if you want to use the CHOKe packet scheduler (CHOose
224 and Keep for responsive flows, CHOose and Kill for unresponsive
225 flows). This is a variation of RED which trys to penalize flows
226 that monopolize the queue.
227
228 To compile this code as a module, choose M here: the
229 module will be called sch_choke.
230
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231config NET_SCH_INGRESS
232 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800233 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100234 ---help---
235 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236 If unsure, say Y.
237
238 To compile this code as a module, choose M here: the
239 module will be called sch_ingress.
240
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100241comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242
243config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100244 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245
246config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100247 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100248 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249 ---help---
250 Say Y here if you want to be able to classify packets using
251 only extended matches and actions.
252
253 To compile this code as a module, choose M here: the
254 module will be called cls_basic.
255
256config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100257 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100258 select NET_CLS
259 ---help---
260 Say Y here if you want to be able to classify packets based on
261 traffic control indices. You will want this feature if you want
262 to implement Differentiated Services together with DSMARK.
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_tcindex.
266
267config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100268 tristate "Routing decision (ROUTE)"
Patrick McHardyc7066f72011-01-14 13:36:42 +0100269 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100270 select NET_CLS
271 ---help---
272 If you say Y here, you will be able to classify packets
273 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274
275 To compile this code as a module, choose M here: the
276 module will be called cls_route.
277
Linus Torvalds1da177e2005-04-16 15:20:36 -0700278config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100279 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100280 select NET_CLS
281 ---help---
282 If you say Y here, you will be able to classify packets
283 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700284
285 To compile this code as a module, choose M here: the
286 module will be called cls_fw.
287
288config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100289 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100290 select NET_CLS
291 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200292 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100293 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294
295 To compile this code as a module, choose M here: the
296 module will be called cls_u32.
297
298config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100299 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100301 ---help---
302 Say Y here to make u32 gather additional statistics useful for
303 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304
305config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100306 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800307 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100308 ---help---
309 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310
311config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100312 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100313 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314 ---help---
315 The Resource Reservation Protocol (RSVP) permits end systems to
316 request a minimum and maximum data flow rate for a connection; this
317 is important for real time data such as streaming sound or video.
318
319 Say Y here if you want to be able to classify outgoing packets based
320 on their RSVP requests.
321
322 To compile this code as a module, choose M here: the
323 module will be called cls_rsvp.
324
325config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100326 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100327 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328 ---help---
329 The Resource Reservation Protocol (RSVP) permits end systems to
330 request a minimum and maximum data flow rate for a connection; this
331 is important for real time data such as streaming sound or video.
332
333 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700334 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335
336 To compile this code as a module, choose M here: the
337 module will be called cls_rsvp6.
338
Patrick McHardye5dfb812008-01-31 18:37:42 -0800339config NET_CLS_FLOW
340 tristate "Flow classifier"
341 select NET_CLS
342 ---help---
343 If you say Y here, you will be able to classify packets based on
344 a configurable combination of packet keys. This is mostly useful
345 in combination with SFQ.
346
347 To compile this code as a module, choose M here: the
348 module will be called cls_flow.
349
Thomas Graff4009232008-11-07 22:56:00 -0800350config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000351 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800352 select NET_CLS
353 depends on CGROUPS
354 ---help---
355 Say Y here if you want to classify packets based on the control
356 cgroup of their process.
357
Ben Blum8e039d82010-03-23 05:24:03 +0000358 To compile this code as a module, choose M here: the
359 module will be called cls_cgroup.
360
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361config NET_EMATCH
362 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100363 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700364 ---help---
365 Say Y here if you want to use extended matches on top of classifiers
366 and select the extended matches below.
367
368 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100369 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100371 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700372 extended matches.
373
374config NET_EMATCH_STACK
375 int "Stack size"
376 depends on NET_EMATCH
377 default "32"
378 ---help---
379 Size of the local stack variable used while evaluating the tree of
380 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700381 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382 stack space.
383
384config NET_EMATCH_CMP
385 tristate "Simple packet data comparison"
386 depends on NET_EMATCH
387 ---help---
388 Say Y here if you want to be able to classify packets based on
389 simple packet data comparisons for 8, 16, and 32bit values.
390
391 To compile this code as a module, choose M here: the
392 module will be called em_cmp.
393
394config NET_EMATCH_NBYTE
395 tristate "Multi byte comparison"
396 depends on NET_EMATCH
397 ---help---
398 Say Y here if you want to be able to classify packets based on
399 multiple byte comparisons mainly useful for IPv6 address comparisons.
400
401 To compile this code as a module, choose M here: the
402 module will be called em_nbyte.
403
404config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100405 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406 depends on NET_EMATCH
407 ---help---
408 Say Y here if you want to be able to classify packets using
409 the famous u32 key in combination with logic relations.
410
411 To compile this code as a module, choose M here: the
412 module will be called em_u32.
413
414config NET_EMATCH_META
415 tristate "Metadata"
416 depends on NET_EMATCH
417 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800418 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700419 metadata such as load average, netfilter attributes, socket
420 attributes and routing decisions.
421
422 To compile this code as a module, choose M here: the
423 module will be called em_meta.
424
Thomas Grafd675c982005-06-23 21:00:58 -0700425config NET_EMATCH_TEXT
426 tristate "Textsearch"
427 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700428 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700429 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700430 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700431 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700432 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100433 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700434 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700435
436 To compile this code as a module, choose M here: the
437 module will be called em_text.
438
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100440 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100442 Say Y here if you want to use traffic control actions. Actions
443 get attached to classifiers and are invoked after a successful
444 classification. They are used to overwrite the classification
445 result, instantly drop or redirect packets, etc.
446
447 A recent version of the iproute2 package is required to use
448 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449
450config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100451 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700452 depends on NET_CLS_ACT
453 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100454 Say Y here if you want to do traffic policing, i.e. strict
455 bandwidth limiting. This action replaces the existing policing
456 module.
457
458 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800459 module will be called act_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460
461config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100462 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700463 depends on NET_CLS_ACT
464 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100465 Say Y here to take generic actions such as dropping and
466 accepting packets.
467
468 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800469 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700470
471config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100472 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700473 depends on NET_ACT_GACT
474 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100475 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476
477config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100478 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700479 depends on NET_CLS_ACT
480 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100481 Say Y here to allow packets to be mirrored or redirected to
482 other devices.
483
484 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800485 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700486
487config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100488 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
490 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200491 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100492 classification.
493
494 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800495 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496
Herbert Xub4219952007-09-27 12:48:05 -0700497config NET_ACT_NAT
498 tristate "Stateless NAT"
499 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700500 ---help---
501 Say Y here to do stateless NAT on IPv4 packets. You should use
502 netfilter for NAT unless you know what you are doing.
503
504 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800505 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700506
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100508 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509 depends on NET_CLS_ACT
510 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100511 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100513 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800514 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700516config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100517 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700518 depends on NET_CLS_ACT
519 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100520 Say Y here to add a simple action for demonstration purposes.
521 It is meant as an example and for debugging purposes. It will
522 print a configured policy string followed by the packet count
523 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700524
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100525 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_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100529
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700530config NET_ACT_SKBEDIT
531 tristate "SKB Editing"
532 depends on NET_CLS_ACT
533 ---help---
534 Say Y here to change skb priority or queue_mapping settings.
535
536 If unsure, say N.
537
538 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800539 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700540
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000541config NET_ACT_CSUM
542 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700543 depends on NET_CLS_ACT && INET
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000544 ---help---
545 Say Y here to update some common checksum after some direct
546 packet alterations.
547
548 To compile this code as a module, choose M here: the
549 module will be called act_csum.
550
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100551config NET_CLS_IND
552 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800553 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100554 ---help---
555 Say Y here to extend the u32 and fw classifier to support
556 classification based on the incoming device. This option is
557 likely to disappear in favour of the metadata ematch.
558
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800559endif # NET_SCHED
560
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700561config NET_SCH_FIFO
562 bool