blob: c03a32a0418e6f95477f106637d96231c2e6af42 [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
Eric Dumazetafe4fd02013-08-29 15:49:55 -0700275config NET_SCH_FQ
276 tristate "Fair Queue"
277 help
278 Say Y here if you want to use the FQ packet scheduling algorithm.
279
280 FQ does flow separation, and is able to respect pacing requirements
281 set by TCP stack into sk->sk_pacing_rate (for localy generated
282 traffic)
283
284 To compile this driver as a module, choose M here: the module
285 will be called sch_fq.
286
287 If unsure, say N.
288
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289config NET_SCH_INGRESS
290 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800291 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100292 ---help---
293 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294 If unsure, say Y.
295
296 To compile this code as a module, choose M here: the
297 module will be called sch_ingress.
298
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000299config NET_SCH_PLUG
300 tristate "Plug network traffic until release (PLUG)"
301 ---help---
302
303 This queuing discipline allows userspace to plug/unplug a network
304 output queue, using the netlink interface. When it receives an
305 enqueue command it inserts a plug into the outbound queue that
306 causes following packets to enqueue until a dequeue command arrives
307 over netlink, causing the plug to be removed and resuming the normal
308 packet flow.
309
310 This module also provides a generic "network output buffering"
311 functionality (aka output commit), wherein upon arrival of a dequeue
312 command, only packets up to the first plug are released for delivery.
313 The Remus HA project uses this module to enable speculative execution
314 of virtual machines by allowing the generated network output to be rolled
315 back if needed.
316
317 For more information, please refer to http://wiki.xensource.com/xenwiki/Remus
318
319 Say Y here if you are using this kernel for Xen dom0 and
320 want to protect Xen guests with Remus.
321
322 To compile this code as a module, choose M here: the
323 module will be called sch_plug.
324
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100325comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326
327config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100328 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329
330config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100331 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100332 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700333 ---help---
334 Say Y here if you want to be able to classify packets using
335 only extended matches and actions.
336
337 To compile this code as a module, choose M here: the
338 module will be called cls_basic.
339
340config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100341 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100342 select NET_CLS
343 ---help---
344 Say Y here if you want to be able to classify packets based on
345 traffic control indices. You will want this feature if you want
346 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700347
348 To compile this code as a module, choose M here: the
349 module will be called cls_tcindex.
350
351config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100352 tristate "Routing decision (ROUTE)"
Randy Dunlap034cfe42011-05-19 19:23:28 -0400353 depends on INET
Patrick McHardyc7066f72011-01-14 13:36:42 +0100354 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100355 select NET_CLS
356 ---help---
357 If you say Y here, you will be able to classify packets
358 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359
360 To compile this code as a module, choose M here: the
361 module will be called cls_route.
362
Linus Torvalds1da177e2005-04-16 15:20:36 -0700363config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100364 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100365 select NET_CLS
366 ---help---
367 If you say Y here, you will be able to classify packets
368 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700369
370 To compile this code as a module, choose M here: the
371 module will be called cls_fw.
372
373config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100374 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100375 select NET_CLS
376 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200377 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100378 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700379
380 To compile this code as a module, choose M here: the
381 module will be called cls_u32.
382
383config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100384 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700385 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100386 ---help---
387 Say Y here to make u32 gather additional statistics useful for
388 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389
390config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100391 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800392 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100393 ---help---
394 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395
396config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100397 tristate "IPv4 Resource Reservation Protocol (RSVP)"
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
405 on their RSVP requests.
406
407 To compile this code as a module, choose M here: the
408 module will be called cls_rsvp.
409
410config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100411 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100412 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413 ---help---
414 The Resource Reservation Protocol (RSVP) permits end systems to
415 request a minimum and maximum data flow rate for a connection; this
416 is important for real time data such as streaming sound or video.
417
418 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700419 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700420
421 To compile this code as a module, choose M here: the
422 module will be called cls_rsvp6.
423
Patrick McHardye5dfb812008-01-31 18:37:42 -0800424config NET_CLS_FLOW
425 tristate "Flow classifier"
426 select NET_CLS
427 ---help---
428 If you say Y here, you will be able to classify packets based on
429 a configurable combination of packet keys. This is mostly useful
430 in combination with SFQ.
431
432 To compile this code as a module, choose M here: the
433 module will be called cls_flow.
434
Thomas Graff4009232008-11-07 22:56:00 -0800435config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000436 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800437 select NET_CLS
438 depends on CGROUPS
439 ---help---
440 Say Y here if you want to classify packets based on the control
441 cgroup of their process.
442
Ben Blum8e039d82010-03-23 05:24:03 +0000443 To compile this code as a module, choose M here: the
444 module will be called cls_cgroup.
445
Linus Torvalds1da177e2005-04-16 15:20:36 -0700446config NET_EMATCH
447 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100448 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449 ---help---
450 Say Y here if you want to use extended matches on top of classifiers
451 and select the extended matches below.
452
453 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100454 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700455
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100456 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457 extended matches.
458
459config NET_EMATCH_STACK
460 int "Stack size"
461 depends on NET_EMATCH
462 default "32"
463 ---help---
464 Size of the local stack variable used while evaluating the tree of
465 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700466 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700467 stack space.
468
469config NET_EMATCH_CMP
470 tristate "Simple packet data comparison"
471 depends on NET_EMATCH
472 ---help---
473 Say Y here if you want to be able to classify packets based on
474 simple packet data comparisons for 8, 16, and 32bit values.
475
476 To compile this code as a module, choose M here: the
477 module will be called em_cmp.
478
479config NET_EMATCH_NBYTE
480 tristate "Multi byte comparison"
481 depends on NET_EMATCH
482 ---help---
483 Say Y here if you want to be able to classify packets based on
484 multiple byte comparisons mainly useful for IPv6 address comparisons.
485
486 To compile this code as a module, choose M here: the
487 module will be called em_nbyte.
488
489config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100490 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700491 depends on NET_EMATCH
492 ---help---
493 Say Y here if you want to be able to classify packets using
494 the famous u32 key in combination with logic relations.
495
496 To compile this code as a module, choose M here: the
497 module will be called em_u32.
498
499config NET_EMATCH_META
500 tristate "Metadata"
501 depends on NET_EMATCH
502 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800503 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504 metadata such as load average, netfilter attributes, socket
505 attributes and routing decisions.
506
507 To compile this code as a module, choose M here: the
508 module will be called em_meta.
509
Thomas Grafd675c982005-06-23 21:00:58 -0700510config NET_EMATCH_TEXT
511 tristate "Textsearch"
512 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700513 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700514 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700515 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700516 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700517 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100518 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700519 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700520
521 To compile this code as a module, choose M here: the
522 module will be called em_text.
523
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200524config NET_EMATCH_CANID
525 tristate "CAN Identifier"
Marc Kleine-Buddea303fbf2012-11-23 00:44:57 +0000526 depends on NET_EMATCH && (CAN=y || CAN=m)
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200527 ---help---
528 Say Y here if you want to be able to classify CAN frames based
529 on CAN Identifier.
530
531 To compile this code as a module, choose M here: the
532 module will be called em_canid.
533
Florian Westphal6d4fa852012-07-11 10:56:57 +0000534config NET_EMATCH_IPSET
535 tristate "IPset"
536 depends on NET_EMATCH && IP_SET
537 ---help---
538 Say Y here if you want to be able to classify packets based on
539 ipset membership.
540
541 To compile this code as a module, choose M here: the
542 module will be called em_ipset.
543
Linus Torvalds1da177e2005-04-16 15:20:36 -0700544config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100545 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700546 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100547 Say Y here if you want to use traffic control actions. Actions
548 get attached to classifiers and are invoked after a successful
549 classification. They are used to overwrite the classification
550 result, instantly drop or redirect packets, etc.
551
552 A recent version of the iproute2 package is required to use
553 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700554
555config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100556 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700557 depends on NET_CLS_ACT
558 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100559 Say Y here if you want to do traffic policing, i.e. strict
560 bandwidth limiting. This action replaces the existing policing
561 module.
562
563 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800564 module will be called act_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700565
566config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100567 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700568 depends on NET_CLS_ACT
569 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100570 Say Y here to take generic actions such as dropping and
571 accepting packets.
572
573 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800574 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700575
576config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100577 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700578 depends on NET_ACT_GACT
579 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100580 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700581
582config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100583 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700584 depends on NET_CLS_ACT
585 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100586 Say Y here to allow packets to be mirrored or redirected to
587 other devices.
588
589 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800590 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591
592config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100593 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700594 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
595 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200596 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100597 classification.
598
599 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800600 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700601
Herbert Xub4219952007-09-27 12:48:05 -0700602config NET_ACT_NAT
603 tristate "Stateless NAT"
604 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700605 ---help---
606 Say Y here to do stateless NAT on IPv4 packets. You should use
607 netfilter for NAT unless you know what you are doing.
608
609 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800610 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700611
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100613 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700614 depends on NET_CLS_ACT
615 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100616 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700617
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100618 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800619 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700621config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100622 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700623 depends on NET_CLS_ACT
624 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100625 Say Y here to add a simple action for demonstration purposes.
626 It is meant as an example and for debugging purposes. It will
627 print a configured policy string followed by the packet count
628 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700629
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100630 If unsure, say N.
631
632 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800633 module will be called act_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100634
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700635config NET_ACT_SKBEDIT
636 tristate "SKB Editing"
637 depends on NET_CLS_ACT
638 ---help---
639 Say Y here to change skb priority or queue_mapping settings.
640
641 If unsure, say N.
642
643 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800644 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700645
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000646config NET_ACT_CSUM
647 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700648 depends on NET_CLS_ACT && INET
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000649 ---help---
650 Say Y here to update some common checksum after some direct
651 packet alterations.
652
653 To compile this code as a module, choose M here: the
654 module will be called act_csum.
655
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100656config NET_CLS_IND
657 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800658 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100659 ---help---
660 Say Y here to extend the u32 and fw classifier to support
661 classification based on the incoming device. This option is
662 likely to disappear in favour of the metadata ematch.
663
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800664endif # NET_SCHED
665
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700666config NET_SCH_FIFO
667 bool