blob: 4f7ef0db302b56eaf1e32c2d7ce90c84d686be51 [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
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
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208config NET_SCH_INGRESS
209 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800210 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100211 ---help---
212 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213 If unsure, say Y.
214
215 To compile this code as a module, choose M here: the
216 module will be called sch_ingress.
217
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100218comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700219
220config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100221 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222
223config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100224 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100225 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 ---help---
227 Say Y here if you want to be able to classify packets using
228 only extended matches and actions.
229
230 To compile this code as a module, choose M here: the
231 module will be called cls_basic.
232
233config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100234 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100235 select NET_CLS
236 ---help---
237 Say Y here if you want to be able to classify packets based on
238 traffic control indices. You will want this feature if you want
239 to implement Differentiated Services together with DSMARK.
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_tcindex.
243
244config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100245 tristate "Routing decision (ROUTE)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246 select NET_CLS_ROUTE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100247 select NET_CLS
248 ---help---
249 If you say Y here, you will be able to classify packets
250 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251
252 To compile this code as a module, choose M here: the
253 module will be called cls_route.
254
255config NET_CLS_ROUTE
256 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257
258config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100259 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100260 select NET_CLS
261 ---help---
262 If you say Y here, you will be able to classify packets
263 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264
265 To compile this code as a module, choose M here: the
266 module will be called cls_fw.
267
268config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100269 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100270 select NET_CLS
271 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200272 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100273 32bit pieces based comparison scheme.
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_u32.
277
278config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100279 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100281 ---help---
282 Say Y here to make u32 gather additional statistics useful for
283 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700284
285config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100286 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800287 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100288 ---help---
289 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290
291config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100292 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100293 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294 ---help---
295 The Resource Reservation Protocol (RSVP) permits end systems to
296 request a minimum and maximum data flow rate for a connection; this
297 is important for real time data such as streaming sound or video.
298
299 Say Y here if you want to be able to classify outgoing packets based
300 on their RSVP requests.
301
302 To compile this code as a module, choose M here: the
303 module will be called cls_rsvp.
304
305config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100306 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100307 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700308 ---help---
309 The Resource Reservation Protocol (RSVP) permits end systems to
310 request a minimum and maximum data flow rate for a connection; this
311 is important for real time data such as streaming sound or video.
312
313 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700314 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315
316 To compile this code as a module, choose M here: the
317 module will be called cls_rsvp6.
318
Patrick McHardye5dfb812008-01-31 18:37:42 -0800319config NET_CLS_FLOW
320 tristate "Flow classifier"
321 select NET_CLS
322 ---help---
323 If you say Y here, you will be able to classify packets based on
324 a configurable combination of packet keys. This is mostly useful
325 in combination with SFQ.
326
327 To compile this code as a module, choose M here: the
328 module will be called cls_flow.
329
Thomas Graff4009232008-11-07 22:56:00 -0800330config NET_CLS_CGROUP
331 bool "Control Group Classifier"
332 select NET_CLS
333 depends on CGROUPS
334 ---help---
335 Say Y here if you want to classify packets based on the control
336 cgroup of their process.
337
338 To compile this code as a module, choose M here: the
339 module will be called cls_cgroup.
340
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341config NET_EMATCH
342 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100343 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700344 ---help---
345 Say Y here if you want to use extended matches on top of classifiers
346 and select the extended matches below.
347
348 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100349 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700350
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100351 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700352 extended matches.
353
354config NET_EMATCH_STACK
355 int "Stack size"
356 depends on NET_EMATCH
357 default "32"
358 ---help---
359 Size of the local stack variable used while evaluating the tree of
360 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700361 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700362 stack space.
363
364config NET_EMATCH_CMP
365 tristate "Simple packet data comparison"
366 depends on NET_EMATCH
367 ---help---
368 Say Y here if you want to be able to classify packets based on
369 simple packet data comparisons for 8, 16, and 32bit values.
370
371 To compile this code as a module, choose M here: the
372 module will be called em_cmp.
373
374config NET_EMATCH_NBYTE
375 tristate "Multi byte comparison"
376 depends on NET_EMATCH
377 ---help---
378 Say Y here if you want to be able to classify packets based on
379 multiple byte comparisons mainly useful for IPv6 address comparisons.
380
381 To compile this code as a module, choose M here: the
382 module will be called em_nbyte.
383
384config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100385 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386 depends on NET_EMATCH
387 ---help---
388 Say Y here if you want to be able to classify packets using
389 the famous u32 key in combination with logic relations.
390
391 To compile this code as a module, choose M here: the
392 module will be called em_u32.
393
394config NET_EMATCH_META
395 tristate "Metadata"
396 depends on NET_EMATCH
397 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800398 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700399 metadata such as load average, netfilter attributes, socket
400 attributes and routing decisions.
401
402 To compile this code as a module, choose M here: the
403 module will be called em_meta.
404
Thomas Grafd675c982005-06-23 21:00:58 -0700405config NET_EMATCH_TEXT
406 tristate "Textsearch"
407 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700408 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700409 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700410 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700411 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700412 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100413 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700414 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700415
416 To compile this code as a module, choose M here: the
417 module will be called em_text.
418
Linus Torvalds1da177e2005-04-16 15:20:36 -0700419config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100420 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700421 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100422 Say Y here if you want to use traffic control actions. Actions
423 get attached to classifiers and are invoked after a successful
424 classification. They are used to overwrite the classification
425 result, instantly drop or redirect packets, etc.
426
427 A recent version of the iproute2 package is required to use
428 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429
430config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100431 tristate "Traffic Policing"
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 if you want to do traffic policing, i.e. strict
435 bandwidth limiting. This action replaces the existing policing
436 module.
437
438 To compile this code as a module, choose M here: the
439 module will be called police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700440
441config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100442 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 depends on NET_CLS_ACT
444 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100445 Say Y here to take generic actions such as dropping and
446 accepting packets.
447
448 To compile this code as a module, choose M here: the
449 module will be called gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450
451config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100452 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700453 depends on NET_ACT_GACT
454 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100455 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700456
457config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100458 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459 depends on NET_CLS_ACT
460 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100461 Say Y here to allow packets to be mirrored or redirected to
462 other devices.
463
464 To compile this code as a module, choose M here: the
465 module will be called mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700466
467config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100468 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
470 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200471 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100472 classification.
473
474 To compile this code as a module, choose M here: the
475 module will be called ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476
Herbert Xub4219952007-09-27 12:48:05 -0700477config NET_ACT_NAT
478 tristate "Stateless NAT"
479 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700480 ---help---
481 Say Y here to do stateless NAT on IPv4 packets. You should use
482 netfilter for NAT unless you know what you are doing.
483
484 To compile this code as a module, choose M here: the
485 module will be called nat.
486
Linus Torvalds1da177e2005-04-16 15:20:36 -0700487config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100488 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489 depends on NET_CLS_ACT
490 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100491 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700492
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100493 To compile this code as a module, choose M here: the
494 module will be called pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700496config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100497 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700498 depends on NET_CLS_ACT
499 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100500 Say Y here to add a simple action for demonstration purposes.
501 It is meant as an example and for debugging purposes. It will
502 print a configured policy string followed by the packet count
503 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700504
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100505 If unsure, say N.
506
507 To compile this code as a module, choose M here: the
508 module will be called simple.
509
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700510config NET_ACT_SKBEDIT
511 tristate "SKB Editing"
512 depends on NET_CLS_ACT
513 ---help---
514 Say Y here to change skb priority or queue_mapping settings.
515
516 If unsure, say N.
517
518 To compile this code as a module, choose M here: the
519 module will be called skbedit.
520
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100521config NET_CLS_IND
522 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800523 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100524 ---help---
525 Say Y here to extend the u32 and fw classifier to support
526 classification based on the incoming device. This option is
527 likely to disappear in favour of the metadata ematch.
528
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800529endif # NET_SCHED
530
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700531config NET_SCH_FIFO
532 bool