blob: 235e01acac518ad84d7917b53bb2bd524df8ce05 [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
stephen hemminger0545a302011-04-04 05:30:58 +0000242config NET_SCH_QFQ
243 tristate "Quick Fair Queueing scheduler (QFQ)"
244 help
245 Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
246 packet scheduling algorithm.
247
248 To compile this driver as a module, choose M here: the module
249 will be called sch_qfq.
250
251 If unsure, say N.
252
Eric Dumazet76e3cc12012-05-10 07:51:25 +0000253config NET_SCH_CODEL
254 tristate "Controlled Delay AQM (CODEL)"
255 help
256 Say Y here if you want to use the Controlled Delay (CODEL)
257 packet scheduling algorithm.
258
259 To compile this driver as a module, choose M here: the module
260 will be called sch_codel.
261
262 If unsure, say N.
263
Eric Dumazet4b549a22012-05-11 09:30:50 +0000264config NET_SCH_FQ_CODEL
265 tristate "Fair Queue Controlled Delay AQM (FQ_CODEL)"
266 help
267 Say Y here if you want to use the FQ Controlled Delay (FQ_CODEL)
268 packet scheduling algorithm.
269
270 To compile this driver as a module, choose M here: the module
271 will be called sch_fq_codel.
272
273 If unsure, say N.
274
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275config NET_SCH_INGRESS
276 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800277 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100278 ---help---
279 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280 If unsure, say Y.
281
282 To compile this code as a module, choose M here: the
283 module will be called sch_ingress.
284
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000285config NET_SCH_PLUG
286 tristate "Plug network traffic until release (PLUG)"
287 ---help---
288
289 This queuing discipline allows userspace to plug/unplug a network
290 output queue, using the netlink interface. When it receives an
291 enqueue command it inserts a plug into the outbound queue that
292 causes following packets to enqueue until a dequeue command arrives
293 over netlink, causing the plug to be removed and resuming the normal
294 packet flow.
295
296 This module also provides a generic "network output buffering"
297 functionality (aka output commit), wherein upon arrival of a dequeue
298 command, only packets up to the first plug are released for delivery.
299 The Remus HA project uses this module to enable speculative execution
300 of virtual machines by allowing the generated network output to be rolled
301 back if needed.
302
303 For more information, please refer to http://wiki.xensource.com/xenwiki/Remus
304
305 Say Y here if you are using this kernel for Xen dom0 and
306 want to protect Xen guests with Remus.
307
308 To compile this code as a module, choose M here: the
309 module will be called sch_plug.
310
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100311comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312
313config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100314 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315
316config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100317 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100318 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319 ---help---
320 Say Y here if you want to be able to classify packets using
321 only extended matches and actions.
322
323 To compile this code as a module, choose M here: the
324 module will be called cls_basic.
325
326config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100327 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100328 select NET_CLS
329 ---help---
330 Say Y here if you want to be able to classify packets based on
331 traffic control indices. You will want this feature if you want
332 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700333
334 To compile this code as a module, choose M here: the
335 module will be called cls_tcindex.
336
337config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100338 tristate "Routing decision (ROUTE)"
Randy Dunlap034cfe42011-05-19 19:23:28 -0400339 depends on INET
Patrick McHardyc7066f72011-01-14 13:36:42 +0100340 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100341 select NET_CLS
342 ---help---
343 If you say Y here, you will be able to classify packets
344 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345
346 To compile this code as a module, choose M here: the
347 module will be called cls_route.
348
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100350 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100351 select NET_CLS
352 ---help---
353 If you say Y here, you will be able to classify packets
354 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355
356 To compile this code as a module, choose M here: the
357 module will be called cls_fw.
358
359config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100360 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100361 select NET_CLS
362 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200363 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100364 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365
366 To compile this code as a module, choose M here: the
367 module will be called cls_u32.
368
369config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100370 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100372 ---help---
373 Say Y here to make u32 gather additional statistics useful for
374 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375
376config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100377 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800378 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100379 ---help---
380 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381
382config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100383 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100384 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700385 ---help---
386 The Resource Reservation Protocol (RSVP) permits end systems to
387 request a minimum and maximum data flow rate for a connection; this
388 is important for real time data such as streaming sound or video.
389
390 Say Y here if you want to be able to classify outgoing packets based
391 on their RSVP requests.
392
393 To compile this code as a module, choose M here: the
394 module will be called cls_rsvp.
395
396config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100397 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100398 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700399 ---help---
400 The Resource Reservation Protocol (RSVP) permits end systems to
401 request a minimum and maximum data flow rate for a connection; this
402 is important for real time data such as streaming sound or video.
403
404 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700405 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406
407 To compile this code as a module, choose M here: the
408 module will be called cls_rsvp6.
409
Patrick McHardye5dfb812008-01-31 18:37:42 -0800410config NET_CLS_FLOW
411 tristate "Flow classifier"
412 select NET_CLS
413 ---help---
414 If you say Y here, you will be able to classify packets based on
415 a configurable combination of packet keys. This is mostly useful
416 in combination with SFQ.
417
418 To compile this code as a module, choose M here: the
419 module will be called cls_flow.
420
Thomas Graff4009232008-11-07 22:56:00 -0800421config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000422 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800423 select NET_CLS
424 depends on CGROUPS
425 ---help---
426 Say Y here if you want to classify packets based on the control
427 cgroup of their process.
428
Ben Blum8e039d82010-03-23 05:24:03 +0000429 To compile this code as a module, choose M here: the
430 module will be called cls_cgroup.
431
Linus Torvalds1da177e2005-04-16 15:20:36 -0700432config NET_EMATCH
433 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100434 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435 ---help---
436 Say Y here if you want to use extended matches on top of classifiers
437 and select the extended matches below.
438
439 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100440 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100442 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 extended matches.
444
445config NET_EMATCH_STACK
446 int "Stack size"
447 depends on NET_EMATCH
448 default "32"
449 ---help---
450 Size of the local stack variable used while evaluating the tree of
451 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700452 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700453 stack space.
454
455config NET_EMATCH_CMP
456 tristate "Simple packet data comparison"
457 depends on NET_EMATCH
458 ---help---
459 Say Y here if you want to be able to classify packets based on
460 simple packet data comparisons for 8, 16, and 32bit values.
461
462 To compile this code as a module, choose M here: the
463 module will be called em_cmp.
464
465config NET_EMATCH_NBYTE
466 tristate "Multi byte comparison"
467 depends on NET_EMATCH
468 ---help---
469 Say Y here if you want to be able to classify packets based on
470 multiple byte comparisons mainly useful for IPv6 address comparisons.
471
472 To compile this code as a module, choose M here: the
473 module will be called em_nbyte.
474
475config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100476 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477 depends on NET_EMATCH
478 ---help---
479 Say Y here if you want to be able to classify packets using
480 the famous u32 key in combination with logic relations.
481
482 To compile this code as a module, choose M here: the
483 module will be called em_u32.
484
485config NET_EMATCH_META
486 tristate "Metadata"
487 depends on NET_EMATCH
488 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800489 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700490 metadata such as load average, netfilter attributes, socket
491 attributes and routing decisions.
492
493 To compile this code as a module, choose M here: the
494 module will be called em_meta.
495
Thomas Grafd675c982005-06-23 21:00:58 -0700496config NET_EMATCH_TEXT
497 tristate "Textsearch"
498 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700499 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700500 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700501 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700502 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700503 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100504 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700505 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700506
507 To compile this code as a module, choose M here: the
508 module will be called em_text.
509
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200510config NET_EMATCH_CANID
511 tristate "CAN Identifier"
Marc Kleine-Buddea303fbf2012-11-23 00:44:57 +0000512 depends on NET_EMATCH && (CAN=y || CAN=m)
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200513 ---help---
514 Say Y here if you want to be able to classify CAN frames based
515 on CAN Identifier.
516
517 To compile this code as a module, choose M here: the
518 module will be called em_canid.
519
Florian Westphal6d4fa852012-07-11 10:56:57 +0000520config NET_EMATCH_IPSET
521 tristate "IPset"
522 depends on NET_EMATCH && IP_SET
523 ---help---
524 Say Y here if you want to be able to classify packets based on
525 ipset membership.
526
527 To compile this code as a module, choose M here: the
528 module will be called em_ipset.
529
Linus Torvalds1da177e2005-04-16 15:20:36 -0700530config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100531 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100533 Say Y here if you want to use traffic control actions. Actions
534 get attached to classifiers and are invoked after a successful
535 classification. They are used to overwrite the classification
536 result, instantly drop or redirect packets, etc.
537
538 A recent version of the iproute2 package is required to use
539 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700540
541config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100542 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700543 depends on NET_CLS_ACT
544 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100545 Say Y here if you want to do traffic policing, i.e. strict
546 bandwidth limiting. This action replaces the existing policing
547 module.
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_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700551
552config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100553 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700554 depends on NET_CLS_ACT
555 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100556 Say Y here to take generic actions such as dropping and
557 accepting packets.
558
559 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800560 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700561
562config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100563 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700564 depends on NET_ACT_GACT
565 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100566 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567
568config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100569 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700570 depends on NET_CLS_ACT
571 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100572 Say Y here to allow packets to be mirrored or redirected to
573 other devices.
574
575 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800576 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700577
578config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100579 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700580 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
581 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200582 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100583 classification.
584
585 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800586 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587
Herbert Xub4219952007-09-27 12:48:05 -0700588config NET_ACT_NAT
589 tristate "Stateless NAT"
590 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700591 ---help---
592 Say Y here to do stateless NAT on IPv4 packets. You should use
593 netfilter for NAT unless you know what you are doing.
594
595 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800596 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700597
Linus Torvalds1da177e2005-04-16 15:20:36 -0700598config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100599 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600 depends on NET_CLS_ACT
601 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100602 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700603
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100604 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800605 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700606
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700607config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100608 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700609 depends on NET_CLS_ACT
610 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100611 Say Y here to add a simple action for demonstration purposes.
612 It is meant as an example and for debugging purposes. It will
613 print a configured policy string followed by the packet count
614 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700615
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100616 If unsure, say N.
617
618 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800619 module will be called act_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100620
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700621config NET_ACT_SKBEDIT
622 tristate "SKB Editing"
623 depends on NET_CLS_ACT
624 ---help---
625 Say Y here to change skb priority or queue_mapping settings.
626
627 If unsure, say N.
628
629 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800630 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700631
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000632config NET_ACT_CSUM
633 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700634 depends on NET_CLS_ACT && INET
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000635 ---help---
636 Say Y here to update some common checksum after some direct
637 packet alterations.
638
639 To compile this code as a module, choose M here: the
640 module will be called act_csum.
641
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100642config NET_CLS_IND
643 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800644 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100645 ---help---
646 Say Y here to extend the u32 and fw classifier to support
647 classification based on the incoming device. This option is
648 likely to disappear in favour of the metadata ematch.
649
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800650endif # NET_SCHED
651
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700652config NET_SCH_FIFO
653 bool