blob: e70ed26485a2915454f3e50b38ad925aa274004b [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 Dumazete13e02a2011-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
Daniel Borkmann1f211a12016-01-07 22:29:47 +0100313 tristate "Ingress/classifier-action Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800314 depends on NET_CLS_ACT
Pablo Neira1cf519002015-05-13 18:19:37 +0200315 select NET_INGRESS
Daniel Borkmann1f211a12016-01-07 22:29:47 +0100316 select NET_EGRESS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100317 ---help---
Daniel Borkmann1f211a12016-01-07 22:29:47 +0100318 Say Y here if you want to use classifiers for incoming and/or outgoing
319 packets. This qdisc doesn't do anything else besides running classifiers,
320 which can also have actions attached to them. In case of outgoing packets,
321 classifiers that this qdisc holds are executed in the transmit path
322 before real enqueuing to an egress qdisc happens.
323
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324 If unsure, say Y.
325
Daniel Borkmann1f211a12016-01-07 22:29:47 +0100326 To compile this code as a module, choose M here: the module will be
327 called sch_ingress with alias of sch_clsact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000329config NET_SCH_PLUG
330 tristate "Plug network traffic until release (PLUG)"
331 ---help---
332
333 This queuing discipline allows userspace to plug/unplug a network
334 output queue, using the netlink interface. When it receives an
335 enqueue command it inserts a plug into the outbound queue that
336 causes following packets to enqueue until a dequeue command arrives
337 over netlink, causing the plug to be removed and resuming the normal
338 packet flow.
339
340 This module also provides a generic "network output buffering"
341 functionality (aka output commit), wherein upon arrival of a dequeue
342 command, only packets up to the first plug are released for delivery.
343 The Remus HA project uses this module to enable speculative execution
344 of virtual machines by allowing the generated network output to be rolled
345 back if needed.
346
Andrew Shewmaker5d330cd2014-12-03 14:07:31 -0800347 For more information, please refer to <http://wiki.xenproject.org/wiki/Remus>
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000348
349 Say Y here if you are using this kernel for Xen dom0 and
350 want to protect Xen guests with Remus.
351
352 To compile this code as a module, choose M here: the
353 module will be called sch_plug.
354
stephen hemminger8ea3e432017-04-13 08:40:53 -0700355menuconfig NET_SCH_DEFAULT
356 bool "Allow override default queue discipline"
357 ---help---
358 Support for selection of default queuing discipline.
359
360 Nearly all users can safely say no here, and the default
361 of pfifo_fast will be used. Many distributions already set
362 the default value via /proc/sys/net/core/default_qdisc.
363
364 If unsure, say N.
365
366if NET_SCH_DEFAULT
367
368choice
369 prompt "Default queuing discipline"
370 default DEFAULT_PFIFO_FAST
371 help
372 Select the queueing discipline that will be used by default
373 for all network devices.
374
375 config DEFAULT_FQ
376 bool "Fair Queue" if NET_SCH_FQ
377
378 config DEFAULT_CODEL
379 bool "Controlled Delay" if NET_SCH_CODEL
380
381 config DEFAULT_FQ_CODEL
382 bool "Fair Queue Controlled Delay" if NET_SCH_FQ_CODEL
383
384 config DEFAULT_SFQ
385 bool "Stochastic Fair Queue" if NET_SCH_SFQ
386
387 config DEFAULT_PFIFO_FAST
388 bool "Priority FIFO Fast"
389endchoice
390
391config DEFAULT_NET_SCH
392 string
393 default "pfifo_fast" if DEFAULT_PFIFO_FAST
394 default "fq" if DEFAULT_FQ
395 default "fq_codel" if DEFAULT_FQ_CODEL
396 default "sfq" if DEFAULT_SFQ
397 default "pfifo_fast"
398endif
399
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100400comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700401
402config NET_CLS
Christoph Jaeger6341e622014-12-20 15:41:11 -0500403 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404
405config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100406 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100407 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408 ---help---
409 Say Y here if you want to be able to classify packets using
410 only extended matches and actions.
411
412 To compile this code as a module, choose M here: the
413 module will be called cls_basic.
414
415config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100416 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100417 select NET_CLS
418 ---help---
419 Say Y here if you want to be able to classify packets based on
420 traffic control indices. You will want this feature if you want
421 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422
423 To compile this code as a module, choose M here: the
424 module will be called cls_tcindex.
425
426config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100427 tristate "Routing decision (ROUTE)"
Randy Dunlap034cfe42011-05-19 19:23:28 -0400428 depends on INET
Patrick McHardyc7066f72011-01-14 13:36:42 +0100429 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100430 select NET_CLS
431 ---help---
432 If you say Y here, you will be able to classify packets
433 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700434
435 To compile this code as a module, choose M here: the
436 module will be called cls_route.
437
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100439 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100440 select NET_CLS
441 ---help---
442 If you say Y here, you will be able to classify packets
443 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700444
445 To compile this code as a module, choose M here: the
446 module will be called cls_fw.
447
448config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100449 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100450 select NET_CLS
451 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200452 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100453 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454
455 To compile this code as a module, choose M here: the
456 module will be called cls_u32.
457
458config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100459 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100461 ---help---
462 Say Y here to make u32 gather additional statistics useful for
463 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464
465config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100466 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800467 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100468 ---help---
469 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700470
471config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100472 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100473 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474 ---help---
475 The Resource Reservation Protocol (RSVP) permits end systems to
476 request a minimum and maximum data flow rate for a connection; this
477 is important for real time data such as streaming sound or video.
478
479 Say Y here if you want to be able to classify outgoing packets based
480 on their RSVP requests.
481
482 To compile this code as a module, choose M here: the
483 module will be called cls_rsvp.
484
485config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100486 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100487 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488 ---help---
489 The Resource Reservation Protocol (RSVP) permits end systems to
490 request a minimum and maximum data flow rate for a connection; this
491 is important for real time data such as streaming sound or video.
492
493 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700494 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495
496 To compile this code as a module, choose M here: the
497 module will be called cls_rsvp6.
498
Patrick McHardye5dfb812008-01-31 18:37:42 -0800499config NET_CLS_FLOW
500 tristate "Flow classifier"
501 select NET_CLS
502 ---help---
503 If you say Y here, you will be able to classify packets based on
504 a configurable combination of packet keys. This is mostly useful
505 in combination with SFQ.
506
507 To compile this code as a module, choose M here: the
508 module will be called cls_flow.
509
Thomas Graff4009232008-11-07 22:56:00 -0800510config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000511 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800512 select NET_CLS
Daniel Borkmannfe1217c2013-12-29 18:27:10 +0100513 select CGROUP_NET_CLASSID
Thomas Graff4009232008-11-07 22:56:00 -0800514 depends on CGROUPS
515 ---help---
516 Say Y here if you want to classify packets based on the control
517 cgroup of their process.
518
Ben Blum8e039d82010-03-23 05:24:03 +0000519 To compile this code as a module, choose M here: the
520 module will be called cls_cgroup.
521
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100522config NET_CLS_BPF
523 tristate "BPF-based classifier"
524 select NET_CLS
525 ---help---
526 If you say Y here, you will be able to classify packets based on
527 programmable BPF (JIT'ed) filters as an alternative to ematches.
528
529 To compile this code as a module, choose M here: the module will
530 be called cls_bpf.
531
Jiri Pirko77b99002015-05-12 14:56:21 +0200532config NET_CLS_FLOWER
533 tristate "Flower classifier"
534 select NET_CLS
535 ---help---
536 If you say Y here, you will be able to classify packets based on
537 a configurable combination of packet keys and masks.
538
539 To compile this code as a module, choose M here: the module will
540 be called cls_flower.
541
Jiri Pirkobf3994d2016-07-21 12:03:11 +0200542config NET_CLS_MATCHALL
543 tristate "Match-all classifier"
544 select NET_CLS
545 ---help---
546 If you say Y here, you will be able to classify packets based on
547 nothing. Every packet will match.
548
549 To compile this code as a module, choose M here: the module will
550 be called cls_matchall.
551
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552config NET_EMATCH
553 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100554 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700555 ---help---
556 Say Y here if you want to use extended matches on top of classifiers
557 and select the extended matches below.
558
559 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100560 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700561
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100562 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563 extended matches.
564
565config NET_EMATCH_STACK
566 int "Stack size"
567 depends on NET_EMATCH
568 default "32"
569 ---help---
570 Size of the local stack variable used while evaluating the tree of
571 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700572 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700573 stack space.
574
575config NET_EMATCH_CMP
576 tristate "Simple packet data comparison"
577 depends on NET_EMATCH
578 ---help---
579 Say Y here if you want to be able to classify packets based on
580 simple packet data comparisons for 8, 16, and 32bit values.
581
582 To compile this code as a module, choose M here: the
583 module will be called em_cmp.
584
585config NET_EMATCH_NBYTE
586 tristate "Multi byte comparison"
587 depends on NET_EMATCH
588 ---help---
589 Say Y here if you want to be able to classify packets based on
590 multiple byte comparisons mainly useful for IPv6 address comparisons.
591
592 To compile this code as a module, choose M here: the
593 module will be called em_nbyte.
594
595config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100596 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700597 depends on NET_EMATCH
598 ---help---
599 Say Y here if you want to be able to classify packets using
600 the famous u32 key in combination with logic relations.
601
602 To compile this code as a module, choose M here: the
603 module will be called em_u32.
604
605config NET_EMATCH_META
606 tristate "Metadata"
607 depends on NET_EMATCH
608 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800609 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700610 metadata such as load average, netfilter attributes, socket
611 attributes and routing decisions.
612
613 To compile this code as a module, choose M here: the
614 module will be called em_meta.
615
Thomas Grafd675c982005-06-23 21:00:58 -0700616config NET_EMATCH_TEXT
617 tristate "Textsearch"
618 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700619 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700620 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700621 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700622 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700623 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100624 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700625 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700626
627 To compile this code as a module, choose M here: the
628 module will be called em_text.
629
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200630config NET_EMATCH_CANID
631 tristate "CAN Identifier"
Marc Kleine-Buddea303fbf2012-11-23 00:44:57 +0000632 depends on NET_EMATCH && (CAN=y || CAN=m)
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200633 ---help---
634 Say Y here if you want to be able to classify CAN frames based
635 on CAN Identifier.
636
637 To compile this code as a module, choose M here: the
638 module will be called em_canid.
639
Florian Westphal6d4fa852012-07-11 10:56:57 +0000640config NET_EMATCH_IPSET
641 tristate "IPset"
642 depends on NET_EMATCH && IP_SET
643 ---help---
644 Say Y here if you want to be able to classify packets based on
645 ipset membership.
646
647 To compile this code as a module, choose M here: the
648 module will be called em_ipset.
649
Linus Torvalds1da177e2005-04-16 15:20:36 -0700650config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100651 bool "Actions"
Jiri Pirko8ec15072017-06-04 18:49:28 +0200652 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700653 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100654 Say Y here if you want to use traffic control actions. Actions
655 get attached to classifiers and are invoked after a successful
656 classification. They are used to overwrite the classification
657 result, instantly drop or redirect packets, etc.
658
659 A recent version of the iproute2 package is required to use
660 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700661
662config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100663 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700664 depends on NET_CLS_ACT
665 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100666 Say Y here if you want to do traffic policing, i.e. strict
667 bandwidth limiting. This action replaces the existing policing
668 module.
669
670 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800671 module will be called act_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700672
673config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100674 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675 depends on NET_CLS_ACT
676 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100677 Say Y here to take generic actions such as dropping and
678 accepting packets.
679
680 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800681 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700682
683config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100684 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685 depends on NET_ACT_GACT
686 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100687 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700688
689config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100690 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700691 depends on NET_CLS_ACT
692 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100693 Say Y here to allow packets to be mirrored or redirected to
694 other devices.
695
696 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800697 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700698
Yotam Gigi5c5670f2017-01-23 11:07:09 +0100699config NET_ACT_SAMPLE
700 tristate "Traffic Sampling"
701 depends on NET_CLS_ACT
702 select PSAMPLE
703 ---help---
704 Say Y here to allow packet sampling tc action. The packet sample
705 action consists of statistically choosing packets and sampling
706 them using the psample module.
707
708 To compile this code as a module, choose M here: the
709 module will be called act_sample.
710
Linus Torvalds1da177e2005-04-16 15:20:36 -0700711config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100712 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700713 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
714 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200715 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100716 classification.
717
718 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800719 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700720
Herbert Xub4219952007-09-27 12:48:05 -0700721config NET_ACT_NAT
722 tristate "Stateless NAT"
723 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700724 ---help---
725 Say Y here to do stateless NAT on IPv4 packets. You should use
726 netfilter for NAT unless you know what you are doing.
727
728 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800729 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700730
Linus Torvalds1da177e2005-04-16 15:20:36 -0700731config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100732 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700733 depends on NET_CLS_ACT
734 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100735 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700736
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100737 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800738 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700739
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700740config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100741 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700742 depends on NET_CLS_ACT
743 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100744 Say Y here to add a simple action for demonstration purposes.
745 It is meant as an example and for debugging purposes. It will
746 print a configured policy string followed by the packet count
747 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700748
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100749 If unsure, say N.
750
751 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800752 module will be called act_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100753
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700754config NET_ACT_SKBEDIT
755 tristate "SKB Editing"
756 depends on NET_CLS_ACT
757 ---help---
758 Say Y here to change skb priority or queue_mapping settings.
759
760 If unsure, say N.
761
762 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800763 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700764
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000765config NET_ACT_CSUM
766 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700767 depends on NET_CLS_ACT && INET
Davide Carattiab9d2262017-01-09 11:24:20 +0100768 select LIBCRC32C
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000769 ---help---
770 Say Y here to update some common checksum after some direct
771 packet alterations.
772
773 To compile this code as a module, choose M here: the
774 module will be called act_csum.
775
Jiri Pirkoc7e2b962014-11-19 14:05:03 +0100776config NET_ACT_VLAN
777 tristate "Vlan manipulation"
778 depends on NET_CLS_ACT
779 ---help---
780 Say Y here to push or pop vlan headers.
781
782 If unsure, say N.
783
784 To compile this code as a module, choose M here: the
785 module will be called act_vlan.
786
Jiri Pirkod23b8ad2015-01-15 09:52:39 +0100787config NET_ACT_BPF
788 tristate "BPF based action"
789 depends on NET_CLS_ACT
790 ---help---
791 Say Y here to execute BPF code on packets. The BPF code will decide
792 if the packet should be dropped or not.
793
794 If unsure, say N.
795
796 To compile this code as a module, choose M here: the
797 module will be called act_bpf.
798
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500799config NET_ACT_CONNMARK
800 tristate "Netfilter Connection Mark Retriever"
801 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
Arnd Bergmann2dbce092015-01-28 17:30:09 +0100802 depends on NF_CONNTRACK && NF_CONNTRACK_MARK
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500803 ---help---
804 Say Y here to allow retrieving of conn mark
805
806 If unsure, say N.
807
808 To compile this code as a module, choose M here: the
809 module will be called act_connmark.
810
Jamal Hadi Salim86da71b2016-09-12 20:13:09 -0400811config NET_ACT_SKBMOD
812 tristate "skb data modification action"
813 depends on NET_CLS_ACT
814 ---help---
815 Say Y here to allow modification of skb data
816
817 If unsure, say N.
818
819 To compile this code as a module, choose M here: the
820 module will be called act_skbmod.
821
Jamal Hadi Salimef6980b2016-02-27 08:08:54 -0500822config NET_ACT_IFE
823 tristate "Inter-FE action based on IETF ForCES InterFE LFB"
824 depends on NET_CLS_ACT
Yotam Gigi295a6e02017-02-01 15:30:03 +0200825 select NET_IFE
Jamal Hadi Salimef6980b2016-02-27 08:08:54 -0500826 ---help---
827 Say Y here to allow for sourcing and terminating metadata
828 For details refer to netdev01 paper:
829 "Distributing Linux Traffic Control Classifier-Action Subsystem"
830 Authors: Jamal Hadi Salim and Damascene M. Joachimpillai
831
832 To compile this code as a module, choose M here: the
833 module will be called act_ife.
834
Amir Vadaid0f6dd82016-09-08 16:23:48 +0300835config NET_ACT_TUNNEL_KEY
836 tristate "IP tunnel metadata manipulation"
837 depends on NET_CLS_ACT
838 ---help---
839 Say Y here to set/release ip tunnel metadata.
840
841 If unsure, say N.
842
843 To compile this code as a module, choose M here: the
844 module will be called act_tunnel_key.
845
Jamal Hadi Salim084e2f62016-02-27 08:08:55 -0500846config NET_IFE_SKBMARK
847 tristate "Support to encoding decoding skb mark on IFE action"
848 depends on NET_ACT_IFE
849 ---help---
850
Jamal Hadi Salim200e10f2016-02-27 08:08:56 -0500851config NET_IFE_SKBPRIO
852 tristate "Support to encoding decoding skb prio on IFE action"
853 depends on NET_ACT_IFE
854 ---help---
855
Jamal Hadi Salim408fbc22016-09-18 07:31:43 -0400856config NET_IFE_SKBTCINDEX
857 tristate "Support to encoding decoding skb tcindex on IFE action"
858 depends on NET_ACT_IFE
859 ---help---
860
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100861config NET_CLS_IND
862 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800863 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100864 ---help---
865 Say Y here to extend the u32 and fw classifier to support
866 classification based on the incoming device. This option is
867 likely to disappear in favour of the metadata ematch.
868
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800869endif # NET_SCHED
870
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700871config NET_SCH_FIFO
872 bool