blob: a7a5583d4f68471885953b4bcdfc0727e8f3fcbf [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
Eric Dumazete13e02a32011-02-23 10:56:17 +0000129config NET_SCH_SFB
130 tristate "Stochastic Fair Blue (SFB)"
131 ---help---
132 Say Y here if you want to use the Stochastic Fair Blue (SFB)
133 packet scheduling algorithm.
134
135 See the top of <file:net/sched/sch_sfb.c> for more details.
136
137 To compile this code as a module, choose M here: the
138 module will be called sch_sfb.
139
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140config NET_SCH_SFQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100141 tristate "Stochastic Fairness Queueing (SFQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 ---help---
143 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700144 packet scheduling algorithm.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100145
146 See the top of <file:net/sched/sch_sfq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147
148 To compile this code as a module, choose M here: the
149 module will be called sch_sfq.
150
151config NET_SCH_TEQL
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100152 tristate "True Link Equalizer (TEQL)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153 ---help---
154 Say Y here if you want to use the True Link Equalizer (TLE) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100155 scheduling algorithm. This queueing discipline allows the combination
156 of several physical devices into one virtual device.
157
158 See the top of <file:net/sched/sch_teql.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_teql.
162
163config NET_SCH_TBF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100164 tristate "Token Bucket Filter (TBF)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100165 ---help---
166 Say Y here if you want to use the Token Bucket Filter (TBF) packet
167 scheduling algorithm.
168
169 See the top of <file:net/sched/sch_tbf.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170
171 To compile this code as a module, choose M here: the
172 module will be called sch_tbf.
173
174config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100175 tristate "Generic Random Early Detection (GRED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100176 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700178 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 (see the top of <file:net/sched/sch_red.c> for details and
180 references about the algorithm).
181
182 To compile this code as a module, choose M here: the
183 module will be called sch_gred.
184
185config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100186 tristate "Differentiated Services marker (DSMARK)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100187 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188 Say Y if you want to schedule packets according to the
189 Differentiated Services architecture proposed in RFC 2475.
190 Technical information on this method, with pointers to associated
191 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
192
193 To compile this code as a module, choose M here: the
194 module will be called sch_dsmark.
195
196config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100197 tristate "Network emulator (NETEM)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100198 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199 Say Y if you want to emulate network delay, loss, and packet
200 re-ordering. This is often useful to simulate networks when
201 testing applications or protocols.
202
203 To compile this driver as a module, choose M here: the module
204 will be called sch_netem.
205
206 If unsure, say N.
207
Patrick McHardy13d2a1d2008-11-20 04:10:00 -0800208config NET_SCH_DRR
209 tristate "Deficit Round Robin scheduler (DRR)"
210 help
211 Say Y here if you want to use the Deficit Round Robin (DRR) packet
212 scheduling algorithm.
213
214 To compile this driver as a module, choose M here: the module
215 will be called sch_drr.
216
217 If unsure, say N.
218
John Fastabendb8970f02011-01-17 08:06:09 +0000219config NET_SCH_MQPRIO
220 tristate "Multi-queue priority scheduler (MQPRIO)"
221 help
222 Say Y here if you want to use the Multi-queue Priority scheduler.
223 This scheduler allows QOS to be offloaded on NICs that have support
224 for offloading QOS schedulers.
225
226 To compile this driver as a module, choose M here: the module will
227 be called sch_mqprio.
228
229 If unsure, say N.
230
stephen hemminger45e14432011-02-02 15:21:10 +0000231config NET_SCH_CHOKE
232 tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
233 help
234 Say Y here if you want to use the CHOKe packet scheduler (CHOose
235 and Keep for responsive flows, CHOose and Kill for unresponsive
236 flows). This is a variation of RED which trys to penalize flows
237 that monopolize the queue.
238
239 To compile this code as a module, choose M here: the
240 module will be called sch_choke.
241
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242config NET_SCH_INGRESS
243 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800244 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100245 ---help---
246 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247 If unsure, say Y.
248
249 To compile this code as a module, choose M here: the
250 module will be called sch_ingress.
251
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100252comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253
254config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100255 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700256
257config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100258 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100259 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 ---help---
261 Say Y here if you want to be able to classify packets using
262 only extended matches and actions.
263
264 To compile this code as a module, choose M here: the
265 module will be called cls_basic.
266
267config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100268 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100269 select NET_CLS
270 ---help---
271 Say Y here if you want to be able to classify packets based on
272 traffic control indices. You will want this feature if you want
273 to implement Differentiated Services together with DSMARK.
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_tcindex.
277
278config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100279 tristate "Routing decision (ROUTE)"
Patrick McHardyc7066f72011-01-14 13:36:42 +0100280 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100281 select NET_CLS
282 ---help---
283 If you say Y here, you will be able to classify packets
284 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285
286 To compile this code as a module, choose M here: the
287 module will be called cls_route.
288
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100290 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100291 select NET_CLS
292 ---help---
293 If you say Y here, you will be able to classify packets
294 according to netfilter/firewall marks.
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_fw.
298
299config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100300 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100301 select NET_CLS
302 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200303 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100304 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305
306 To compile this code as a module, choose M here: the
307 module will be called cls_u32.
308
309config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100310 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100312 ---help---
313 Say Y here to make u32 gather additional statistics useful for
314 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315
316config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100317 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800318 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100319 ---help---
320 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321
322config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100323 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100324 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325 ---help---
326 The Resource Reservation Protocol (RSVP) permits end systems to
327 request a minimum and maximum data flow rate for a connection; this
328 is important for real time data such as streaming sound or video.
329
330 Say Y here if you want to be able to classify outgoing packets based
331 on their RSVP requests.
332
333 To compile this code as a module, choose M here: the
334 module will be called cls_rsvp.
335
336config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100337 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100338 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339 ---help---
340 The Resource Reservation Protocol (RSVP) permits end systems to
341 request a minimum and maximum data flow rate for a connection; this
342 is important for real time data such as streaming sound or video.
343
344 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700345 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346
347 To compile this code as a module, choose M here: the
348 module will be called cls_rsvp6.
349
Patrick McHardye5dfb812008-01-31 18:37:42 -0800350config NET_CLS_FLOW
351 tristate "Flow classifier"
352 select NET_CLS
353 ---help---
354 If you say Y here, you will be able to classify packets based on
355 a configurable combination of packet keys. This is mostly useful
356 in combination with SFQ.
357
358 To compile this code as a module, choose M here: the
359 module will be called cls_flow.
360
Thomas Graff4009232008-11-07 22:56:00 -0800361config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000362 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800363 select NET_CLS
364 depends on CGROUPS
365 ---help---
366 Say Y here if you want to classify packets based on the control
367 cgroup of their process.
368
Ben Blum8e039d82010-03-23 05:24:03 +0000369 To compile this code as a module, choose M here: the
370 module will be called cls_cgroup.
371
Linus Torvalds1da177e2005-04-16 15:20:36 -0700372config NET_EMATCH
373 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100374 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375 ---help---
376 Say Y here if you want to use extended matches on top of classifiers
377 and select the extended matches below.
378
379 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100380 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100382 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383 extended matches.
384
385config NET_EMATCH_STACK
386 int "Stack size"
387 depends on NET_EMATCH
388 default "32"
389 ---help---
390 Size of the local stack variable used while evaluating the tree of
391 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700392 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393 stack space.
394
395config NET_EMATCH_CMP
396 tristate "Simple packet data comparison"
397 depends on NET_EMATCH
398 ---help---
399 Say Y here if you want to be able to classify packets based on
400 simple packet data comparisons for 8, 16, and 32bit values.
401
402 To compile this code as a module, choose M here: the
403 module will be called em_cmp.
404
405config NET_EMATCH_NBYTE
406 tristate "Multi byte comparison"
407 depends on NET_EMATCH
408 ---help---
409 Say Y here if you want to be able to classify packets based on
410 multiple byte comparisons mainly useful for IPv6 address comparisons.
411
412 To compile this code as a module, choose M here: the
413 module will be called em_nbyte.
414
415config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100416 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700417 depends on NET_EMATCH
418 ---help---
419 Say Y here if you want to be able to classify packets using
420 the famous u32 key in combination with logic relations.
421
422 To compile this code as a module, choose M here: the
423 module will be called em_u32.
424
425config NET_EMATCH_META
426 tristate "Metadata"
427 depends on NET_EMATCH
428 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800429 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700430 metadata such as load average, netfilter attributes, socket
431 attributes and routing decisions.
432
433 To compile this code as a module, choose M here: the
434 module will be called em_meta.
435
Thomas Grafd675c982005-06-23 21:00:58 -0700436config NET_EMATCH_TEXT
437 tristate "Textsearch"
438 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700439 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700440 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700441 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700442 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700443 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100444 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700445 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700446
447 To compile this code as a module, choose M here: the
448 module will be called em_text.
449
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100451 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700452 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100453 Say Y here if you want to use traffic control actions. Actions
454 get attached to classifiers and are invoked after a successful
455 classification. They are used to overwrite the classification
456 result, instantly drop or redirect packets, etc.
457
458 A recent version of the iproute2 package is required to use
459 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460
461config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100462 tristate "Traffic Policing"
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 if you want to do traffic policing, i.e. strict
466 bandwidth limiting. This action replaces the existing policing
467 module.
468
469 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800470 module will be called act_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700471
472config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100473 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474 depends on NET_CLS_ACT
475 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100476 Say Y here to take generic actions such as dropping and
477 accepting packets.
478
479 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800480 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481
482config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100483 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484 depends on NET_ACT_GACT
485 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100486 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700487
488config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100489 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700490 depends on NET_CLS_ACT
491 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100492 Say Y here to allow packets to be mirrored or redirected to
493 other devices.
494
495 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800496 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497
498config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100499 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700500 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
501 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200502 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100503 classification.
504
505 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800506 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507
Herbert Xub4219952007-09-27 12:48:05 -0700508config NET_ACT_NAT
509 tristate "Stateless NAT"
510 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700511 ---help---
512 Say Y here to do stateless NAT on IPv4 packets. You should use
513 netfilter for NAT unless you know what you are doing.
514
515 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800516 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700517
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100519 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 depends on NET_CLS_ACT
521 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100522 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700523
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100524 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800525 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700526
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700527config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100528 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700529 depends on NET_CLS_ACT
530 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100531 Say Y here to add a simple action for demonstration purposes.
532 It is meant as an example and for debugging purposes. It will
533 print a configured policy string followed by the packet count
534 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700535
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100536 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_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100540
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700541config NET_ACT_SKBEDIT
542 tristate "SKB Editing"
543 depends on NET_CLS_ACT
544 ---help---
545 Say Y here to change skb priority or queue_mapping settings.
546
547 If unsure, say N.
548
549 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800550 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700551
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000552config NET_ACT_CSUM
553 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700554 depends on NET_CLS_ACT && INET
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000555 ---help---
556 Say Y here to update some common checksum after some direct
557 packet alterations.
558
559 To compile this code as a module, choose M here: the
560 module will be called act_csum.
561
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100562config NET_CLS_IND
563 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800564 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100565 ---help---
566 Say Y here to extend the u32 and fw classifier to support
567 classification based on the incoming device. This option is
568 likely to disappear in favour of the metadata ematch.
569
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800570endif # NET_SCHED
571
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700572config NET_SCH_FIFO
573 bool