blob: 2274e723a3df6fdf393543281cd56bcb6284b41c [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
Andrew Shewmaker5d330cd2014-12-03 14:07:31 -080025 from the package iproute2+tc at
26 <https://www.kernel.org/pub/linux/utils/net/iproute2/>. That package
27 also contains some documentation; for more, check out
Michael Wittenc996d8b2010-11-15 19:55:34 +000028 <http://www.linuxfoundation.org/collaborate/workgroups/networking/iproute2>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070029
30 This Quality of Service (QoS) support will enable you to use
31 Differentiated Services (diffserv) and Resource Reservation Protocol
Thomas Graf52ab4ac2005-11-01 15:13:02 +010032 (RSVP) on your Linux router if you also say Y to the corresponding
33 classifiers below. Documentation and software is at
34 <http://diffserv.sourceforge.net/>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070035
36 If you say Y here and to "/proc file system" below, you will be able
37 to read status information about packet schedulers from the file
38 /proc/net/psched.
39
40 The available schedulers are listed in the following questions; you
41 can say Y to as many as you like. If unsure, say N now.
42
Roman Zippel05b8b0f2005-11-17 15:22:39 -080043if NET_SCHED
44
Thomas Graf52ab4ac2005-11-01 15:13:02 +010045comment "Queueing/Scheduling"
Thomas Graf52ab4ac2005-11-01 15:13:02 +010046
Linus Torvalds1da177e2005-04-16 15:20:36 -070047config NET_SCH_CBQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +010048 tristate "Class Based Queueing (CBQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 ---help---
50 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +010051 scheduling algorithm. This algorithm classifies the waiting packets
52 into a tree-like hierarchy of classes; the leaves of this tree are
53 in turn scheduled by separate algorithms.
Linus Torvalds1da177e2005-04-16 15:20:36 -070054
Thomas Graf52ab4ac2005-11-01 15:13:02 +010055 See the top of <file:net/sched/sch_cbq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -070056
57 CBQ is a commonly used scheduler, so if you're unsure, you should
58 say Y here. Then say Y to all the queueing algorithms below that you
Thomas Graf52ab4ac2005-11-01 15:13:02 +010059 want to use as leaf disciplines.
Linus Torvalds1da177e2005-04-16 15:20:36 -070060
61 To compile this code as a module, choose M here: the
62 module will be called sch_cbq.
63
64config NET_SCH_HTB
Thomas Graf52ab4ac2005-11-01 15:13:02 +010065 tristate "Hierarchical Token Bucket (HTB)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070066 ---help---
67 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
Thomas Graf52ab4ac2005-11-01 15:13:02 +010068 packet scheduling algorithm. See
Linus Torvalds1da177e2005-04-16 15:20:36 -070069 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
70 in-depth articles.
71
Thomas Graf52ab4ac2005-11-01 15:13:02 +010072 HTB is very similar to CBQ regarding its goals however is has
Linus Torvalds1da177e2005-04-16 15:20:36 -070073 different properties and different algorithm.
74
75 To compile this code as a module, choose M here: the
76 module will be called sch_htb.
77
78config NET_SCH_HFSC
Thomas Graf52ab4ac2005-11-01 15:13:02 +010079 tristate "Hierarchical Fair Service Curve (HFSC)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070080 ---help---
81 Say Y here if you want to use the Hierarchical Fair Service Curve
Thomas Graf52ab4ac2005-11-01 15:13:02 +010082 (HFSC) packet scheduling algorithm.
Linus Torvalds1da177e2005-04-16 15:20:36 -070083
84 To compile this code as a module, choose M here: the
85 module will be called sch_hfsc.
86
Linus Torvalds1da177e2005-04-16 15:20:36 -070087config NET_SCH_ATM
Thomas Graf52ab4ac2005-11-01 15:13:02 +010088 tristate "ATM Virtual Circuits (ATM)"
Roman Zippel05b8b0f2005-11-17 15:22:39 -080089 depends on ATM
Linus Torvalds1da177e2005-04-16 15:20:36 -070090 ---help---
91 Say Y here if you want to use the ATM pseudo-scheduler. This
Thomas Graf52ab4ac2005-11-01 15:13:02 +010092 provides a framework for invoking classifiers, which in turn
93 select classes of this queuing discipline. Each class maps
94 the flow(s) it is handling to a given virtual circuit.
95
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -070096 See the top of <file:net/sched/sch_atm.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -070097
98 To compile this code as a module, choose M here: the
99 module will be called sch_atm.
100
101config NET_SCH_PRIO
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100102 tristate "Multi Band Priority Queueing (PRIO)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100103 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104 Say Y here if you want to use an n-band priority queue packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100105 scheduler.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106
107 To compile this code as a module, choose M here: the
108 module will be called sch_prio.
109
Alexander Duyck92651942008-09-12 16:29:34 -0700110config NET_SCH_MULTIQ
111 tristate "Hardware Multiqueue-aware Multi Band Queuing (MULTIQ)"
112 ---help---
113 Say Y here if you want to use an n-band queue packet scheduler
114 to support devices that have multiple hardware transmit queues.
115
116 To compile this code as a module, choose M here: the
117 module will be called sch_multiq.
118
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119config NET_SCH_RED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100120 tristate "Random Early Detection (RED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100121 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 Say Y here if you want to use the Random Early Detection (RED)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100123 packet scheduling algorithm.
124
125 See the top of <file:net/sched/sch_red.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126
127 To compile this code as a module, choose M here: the
128 module will be called sch_red.
129
Eric Dumazete13e02a32011-02-23 10:56:17 +0000130config NET_SCH_SFB
131 tristate "Stochastic Fair Blue (SFB)"
132 ---help---
133 Say Y here if you want to use the Stochastic Fair Blue (SFB)
134 packet scheduling algorithm.
135
136 See the top of <file:net/sched/sch_sfb.c> for more details.
137
138 To compile this code as a module, choose M here: the
139 module will be called sch_sfb.
140
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141config NET_SCH_SFQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100142 tristate "Stochastic Fairness Queueing (SFQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143 ---help---
144 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700145 packet scheduling algorithm.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100146
147 See the top of <file:net/sched/sch_sfq.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_sfq.
151
152config NET_SCH_TEQL
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100153 tristate "True Link Equalizer (TEQL)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154 ---help---
155 Say Y here if you want to use the True Link Equalizer (TLE) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100156 scheduling algorithm. This queueing discipline allows the combination
157 of several physical devices into one virtual device.
158
159 See the top of <file:net/sched/sch_teql.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700160
161 To compile this code as a module, choose M here: the
162 module will be called sch_teql.
163
164config NET_SCH_TBF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100165 tristate "Token Bucket Filter (TBF)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100166 ---help---
167 Say Y here if you want to use the Token Bucket Filter (TBF) packet
168 scheduling algorithm.
169
170 See the top of <file:net/sched/sch_tbf.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171
172 To compile this code as a module, choose M here: the
173 module will be called sch_tbf.
174
175config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100176 tristate "Generic Random Early Detection (GRED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100177 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700179 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180 (see the top of <file:net/sched/sch_red.c> for details and
181 references about the algorithm).
182
183 To compile this code as a module, choose M here: the
184 module will be called sch_gred.
185
186config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100187 tristate "Differentiated Services marker (DSMARK)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100188 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700189 Say Y if you want to schedule packets according to the
190 Differentiated Services architecture proposed in RFC 2475.
191 Technical information on this method, with pointers to associated
192 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
193
194 To compile this code as a module, choose M here: the
195 module will be called sch_dsmark.
196
197config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100198 tristate "Network emulator (NETEM)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100199 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200 Say Y if you want to emulate network delay, loss, and packet
201 re-ordering. This is often useful to simulate networks when
202 testing applications or protocols.
203
204 To compile this driver as a module, choose M here: the module
205 will be called sch_netem.
206
207 If unsure, say N.
208
Patrick McHardy13d2a1d2008-11-20 04:10:00 -0800209config NET_SCH_DRR
210 tristate "Deficit Round Robin scheduler (DRR)"
211 help
212 Say Y here if you want to use the Deficit Round Robin (DRR) packet
213 scheduling algorithm.
214
215 To compile this driver as a module, choose M here: the module
216 will be called sch_drr.
217
218 If unsure, say N.
219
John Fastabendb8970f02011-01-17 08:06:09 +0000220config NET_SCH_MQPRIO
221 tristate "Multi-queue priority scheduler (MQPRIO)"
222 help
223 Say Y here if you want to use the Multi-queue Priority scheduler.
224 This scheduler allows QOS to be offloaded on NICs that have support
225 for offloading QOS schedulers.
226
227 To compile this driver as a module, choose M here: the module will
228 be called sch_mqprio.
229
230 If unsure, say N.
231
stephen hemminger45e14432011-02-02 15:21:10 +0000232config NET_SCH_CHOKE
233 tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
234 help
235 Say Y here if you want to use the CHOKe packet scheduler (CHOose
236 and Keep for responsive flows, CHOose and Kill for unresponsive
237 flows). This is a variation of RED which trys to penalize flows
238 that monopolize the queue.
239
240 To compile this code as a module, choose M here: the
241 module will be called sch_choke.
242
stephen hemminger0545a302011-04-04 05:30:58 +0000243config NET_SCH_QFQ
244 tristate "Quick Fair Queueing scheduler (QFQ)"
245 help
246 Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
247 packet scheduling algorithm.
248
249 To compile this driver as a module, choose M here: the module
250 will be called sch_qfq.
251
252 If unsure, say N.
253
Eric Dumazet76e3cc12012-05-10 07:51:25 +0000254config NET_SCH_CODEL
255 tristate "Controlled Delay AQM (CODEL)"
256 help
257 Say Y here if you want to use the Controlled Delay (CODEL)
258 packet scheduling algorithm.
259
260 To compile this driver as a module, choose M here: the module
261 will be called sch_codel.
262
263 If unsure, say N.
264
Eric Dumazet4b549a22012-05-11 09:30:50 +0000265config NET_SCH_FQ_CODEL
266 tristate "Fair Queue Controlled Delay AQM (FQ_CODEL)"
267 help
268 Say Y here if you want to use the FQ Controlled Delay (FQ_CODEL)
269 packet scheduling algorithm.
270
271 To compile this driver as a module, choose M here: the module
272 will be called sch_fq_codel.
273
274 If unsure, say N.
275
Eric Dumazetafe4fd02013-08-29 15:49:55 -0700276config NET_SCH_FQ
277 tristate "Fair Queue"
278 help
279 Say Y here if you want to use the FQ packet scheduling algorithm.
280
281 FQ does flow separation, and is able to respect pacing requirements
282 set by TCP stack into sk->sk_pacing_rate (for localy generated
283 traffic)
284
285 To compile this driver as a module, choose M here: the module
286 will be called sch_fq.
287
288 If unsure, say N.
289
Terry Lam10239ed2013-12-15 00:30:21 -0800290config NET_SCH_HHF
291 tristate "Heavy-Hitter Filter (HHF)"
292 help
293 Say Y here if you want to use the Heavy-Hitter Filter (HHF)
294 packet scheduling algorithm.
295
296 To compile this driver as a module, choose M here: the module
297 will be called sch_hhf.
298
Vijay Subramaniand4b36212014-01-04 17:33:55 -0800299config NET_SCH_PIE
300 tristate "Proportional Integral controller Enhanced (PIE) scheduler"
301 help
302 Say Y here if you want to use the Proportional Integral controller
303 Enhanced scheduler packet scheduling algorithm.
304 For more information, please see
305 http://tools.ietf.org/html/draft-pan-tsvwg-pie-00
306
307 To compile this driver as a module, choose M here: the module
308 will be called sch_pie.
309
310 If unsure, say N.
311
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312config NET_SCH_INGRESS
313 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800314 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100315 ---help---
316 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317 If unsure, say Y.
318
319 To compile this code as a module, choose M here: the
320 module will be called sch_ingress.
321
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000322config NET_SCH_PLUG
323 tristate "Plug network traffic until release (PLUG)"
324 ---help---
325
326 This queuing discipline allows userspace to plug/unplug a network
327 output queue, using the netlink interface. When it receives an
328 enqueue command it inserts a plug into the outbound queue that
329 causes following packets to enqueue until a dequeue command arrives
330 over netlink, causing the plug to be removed and resuming the normal
331 packet flow.
332
333 This module also provides a generic "network output buffering"
334 functionality (aka output commit), wherein upon arrival of a dequeue
335 command, only packets up to the first plug are released for delivery.
336 The Remus HA project uses this module to enable speculative execution
337 of virtual machines by allowing the generated network output to be rolled
338 back if needed.
339
Andrew Shewmaker5d330cd2014-12-03 14:07:31 -0800340 For more information, please refer to <http://wiki.xenproject.org/wiki/Remus>
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000341
342 Say Y here if you are using this kernel for Xen dom0 and
343 want to protect Xen guests with Remus.
344
345 To compile this code as a module, choose M here: the
346 module will be called sch_plug.
347
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100348comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349
350config NET_CLS
Christoph Jaeger6341e622014-12-20 15:41:11 -0500351 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700352
353config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100354 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100355 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700356 ---help---
357 Say Y here if you want to be able to classify packets using
358 only extended matches and actions.
359
360 To compile this code as a module, choose M here: the
361 module will be called cls_basic.
362
363config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100364 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100365 select NET_CLS
366 ---help---
367 Say Y here if you want to be able to classify packets based on
368 traffic control indices. You will want this feature if you want
369 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370
371 To compile this code as a module, choose M here: the
372 module will be called cls_tcindex.
373
374config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100375 tristate "Routing decision (ROUTE)"
Randy Dunlap034cfe42011-05-19 19:23:28 -0400376 depends on INET
Patrick McHardyc7066f72011-01-14 13:36:42 +0100377 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100378 select NET_CLS
379 ---help---
380 If you say Y here, you will be able to classify packets
381 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382
383 To compile this code as a module, choose M here: the
384 module will be called cls_route.
385
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100387 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100388 select NET_CLS
389 ---help---
390 If you say Y here, you will be able to classify packets
391 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392
393 To compile this code as a module, choose M here: the
394 module will be called cls_fw.
395
396config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100397 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100398 select NET_CLS
399 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200400 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100401 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402
403 To compile this code as a module, choose M here: the
404 module will be called cls_u32.
405
406config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100407 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100409 ---help---
410 Say Y here to make u32 gather additional statistics useful for
411 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700412
413config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100414 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800415 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100416 ---help---
417 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418
419config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100420 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100421 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422 ---help---
423 The Resource Reservation Protocol (RSVP) permits end systems to
424 request a minimum and maximum data flow rate for a connection; this
425 is important for real time data such as streaming sound or video.
426
427 Say Y here if you want to be able to classify outgoing packets based
428 on their RSVP requests.
429
430 To compile this code as a module, choose M here: the
431 module will be called cls_rsvp.
432
433config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100434 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100435 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700436 ---help---
437 The Resource Reservation Protocol (RSVP) permits end systems to
438 request a minimum and maximum data flow rate for a connection; this
439 is important for real time data such as streaming sound or video.
440
441 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700442 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443
444 To compile this code as a module, choose M here: the
445 module will be called cls_rsvp6.
446
Patrick McHardye5dfb812008-01-31 18:37:42 -0800447config NET_CLS_FLOW
448 tristate "Flow classifier"
449 select NET_CLS
450 ---help---
451 If you say Y here, you will be able to classify packets based on
452 a configurable combination of packet keys. This is mostly useful
453 in combination with SFQ.
454
455 To compile this code as a module, choose M here: the
456 module will be called cls_flow.
457
Thomas Graff4009232008-11-07 22:56:00 -0800458config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000459 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800460 select NET_CLS
Daniel Borkmannfe1217c2013-12-29 18:27:10 +0100461 select CGROUP_NET_CLASSID
Thomas Graff4009232008-11-07 22:56:00 -0800462 depends on CGROUPS
463 ---help---
464 Say Y here if you want to classify packets based on the control
465 cgroup of their process.
466
Ben Blum8e039d82010-03-23 05:24:03 +0000467 To compile this code as a module, choose M here: the
468 module will be called cls_cgroup.
469
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100470config NET_CLS_BPF
471 tristate "BPF-based classifier"
472 select NET_CLS
473 ---help---
474 If you say Y here, you will be able to classify packets based on
475 programmable BPF (JIT'ed) filters as an alternative to ematches.
476
477 To compile this code as a module, choose M here: the module will
478 be called cls_bpf.
479
Linus Torvalds1da177e2005-04-16 15:20:36 -0700480config NET_EMATCH
481 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100482 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483 ---help---
484 Say Y here if you want to use extended matches on top of classifiers
485 and select the extended matches below.
486
487 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100488 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100490 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700491 extended matches.
492
493config NET_EMATCH_STACK
494 int "Stack size"
495 depends on NET_EMATCH
496 default "32"
497 ---help---
498 Size of the local stack variable used while evaluating the tree of
499 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700500 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501 stack space.
502
503config NET_EMATCH_CMP
504 tristate "Simple packet data comparison"
505 depends on NET_EMATCH
506 ---help---
507 Say Y here if you want to be able to classify packets based on
508 simple packet data comparisons for 8, 16, and 32bit values.
509
510 To compile this code as a module, choose M here: the
511 module will be called em_cmp.
512
513config NET_EMATCH_NBYTE
514 tristate "Multi byte comparison"
515 depends on NET_EMATCH
516 ---help---
517 Say Y here if you want to be able to classify packets based on
518 multiple byte comparisons mainly useful for IPv6 address comparisons.
519
520 To compile this code as a module, choose M here: the
521 module will be called em_nbyte.
522
523config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100524 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525 depends on NET_EMATCH
526 ---help---
527 Say Y here if you want to be able to classify packets using
528 the famous u32 key in combination with logic relations.
529
530 To compile this code as a module, choose M here: the
531 module will be called em_u32.
532
533config NET_EMATCH_META
534 tristate "Metadata"
535 depends on NET_EMATCH
536 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800537 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700538 metadata such as load average, netfilter attributes, socket
539 attributes and routing decisions.
540
541 To compile this code as a module, choose M here: the
542 module will be called em_meta.
543
Thomas Grafd675c982005-06-23 21:00:58 -0700544config NET_EMATCH_TEXT
545 tristate "Textsearch"
546 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700547 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700548 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700549 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700550 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700551 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100552 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700553 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700554
555 To compile this code as a module, choose M here: the
556 module will be called em_text.
557
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200558config NET_EMATCH_CANID
559 tristate "CAN Identifier"
Marc Kleine-Buddea303fbf2012-11-23 00:44:57 +0000560 depends on NET_EMATCH && (CAN=y || CAN=m)
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200561 ---help---
562 Say Y here if you want to be able to classify CAN frames based
563 on CAN Identifier.
564
565 To compile this code as a module, choose M here: the
566 module will be called em_canid.
567
Florian Westphal6d4fa852012-07-11 10:56:57 +0000568config NET_EMATCH_IPSET
569 tristate "IPset"
570 depends on NET_EMATCH && IP_SET
571 ---help---
572 Say Y here if you want to be able to classify packets based on
573 ipset membership.
574
575 To compile this code as a module, choose M here: the
576 module will be called em_ipset.
577
Linus Torvalds1da177e2005-04-16 15:20:36 -0700578config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100579 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700580 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100581 Say Y here if you want to use traffic control actions. Actions
582 get attached to classifiers and are invoked after a successful
583 classification. They are used to overwrite the classification
584 result, instantly drop or redirect packets, etc.
585
586 A recent version of the iproute2 package is required to use
587 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588
589config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100590 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591 depends on NET_CLS_ACT
592 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100593 Say Y here if you want to do traffic policing, i.e. strict
594 bandwidth limiting. This action replaces the existing policing
595 module.
596
597 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800598 module will be called act_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599
600config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100601 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700602 depends on NET_CLS_ACT
603 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100604 Say Y here to take generic actions such as dropping and
605 accepting packets.
606
607 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800608 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609
610config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100611 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612 depends on NET_ACT_GACT
613 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100614 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700615
616config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100617 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700618 depends on NET_CLS_ACT
619 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100620 Say Y here to allow packets to be mirrored or redirected to
621 other devices.
622
623 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800624 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700625
626config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100627 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700628 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
629 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200630 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100631 classification.
632
633 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800634 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700635
Herbert Xub4219952007-09-27 12:48:05 -0700636config NET_ACT_NAT
637 tristate "Stateless NAT"
638 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700639 ---help---
640 Say Y here to do stateless NAT on IPv4 packets. You should use
641 netfilter for NAT unless you know what you are doing.
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_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700645
Linus Torvalds1da177e2005-04-16 15:20:36 -0700646config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100647 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700648 depends on NET_CLS_ACT
649 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100650 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700651
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100652 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800653 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700654
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700655config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100656 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700657 depends on NET_CLS_ACT
658 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100659 Say Y here to add a simple action for demonstration purposes.
660 It is meant as an example and for debugging purposes. It will
661 print a configured policy string followed by the packet count
662 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700663
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100664 If unsure, say N.
665
666 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800667 module will be called act_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100668
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700669config NET_ACT_SKBEDIT
670 tristate "SKB Editing"
671 depends on NET_CLS_ACT
672 ---help---
673 Say Y here to change skb priority or queue_mapping settings.
674
675 If unsure, say N.
676
677 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800678 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700679
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000680config NET_ACT_CSUM
681 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700682 depends on NET_CLS_ACT && INET
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000683 ---help---
684 Say Y here to update some common checksum after some direct
685 packet alterations.
686
687 To compile this code as a module, choose M here: the
688 module will be called act_csum.
689
Jiri Pirkoc7e2b962014-11-19 14:05:03 +0100690config NET_ACT_VLAN
691 tristate "Vlan manipulation"
692 depends on NET_CLS_ACT
693 ---help---
694 Say Y here to push or pop vlan headers.
695
696 If unsure, say N.
697
698 To compile this code as a module, choose M here: the
699 module will be called act_vlan.
700
Jiri Pirkod23b8ad2015-01-15 09:52:39 +0100701config NET_ACT_BPF
702 tristate "BPF based action"
703 depends on NET_CLS_ACT
704 ---help---
705 Say Y here to execute BPF code on packets. The BPF code will decide
706 if the packet should be dropped or not.
707
708 If unsure, say N.
709
710 To compile this code as a module, choose M here: the
711 module will be called act_bpf.
712
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500713config NET_ACT_CONNMARK
714 tristate "Netfilter Connection Mark Retriever"
715 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
Arnd Bergmann2dbce092015-01-28 17:30:09 +0100716 depends on NF_CONNTRACK && NF_CONNTRACK_MARK
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500717 ---help---
718 Say Y here to allow retrieving of conn mark
719
720 If unsure, say N.
721
722 To compile this code as a module, choose M here: the
723 module will be called act_connmark.
724
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100725config NET_CLS_IND
726 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800727 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100728 ---help---
729 Say Y here to extend the u32 and fw classifier to support
730 classification based on the incoming device. This option is
731 likely to disappear in favour of the metadata ematch.
732
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800733endif # NET_SCHED
734
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700735config NET_SCH_FIFO
736 bool