blob: e9574138831116a59db2c39aaa2cd4ee4f28e06b [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#
2# Traffic control configuration.
Stephen Hemminger50f699b2018-07-24 12:29:01 -07003#
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
Vinicius Costa Gomes585d7632017-10-16 18:01:26 -0700175config NET_SCH_CBS
176 tristate "Credit Based Shaper (CBS)"
177 ---help---
178 Say Y here if you want to use the Credit Based Shaper (CBS) packet
179 scheduling algorithm.
180
181 See the top of <file:net/sched/sch_cbs.c> for more details.
182
183 To compile this code as a module, choose M here: the
184 module will be called sch_cbs.
185
Vinicius Costa Gomes25db26a2018-07-03 15:42:53 -0700186config NET_SCH_ETF
187 tristate "Earliest TxTime First (ETF)"
188 help
189 Say Y here if you want to use the Earliest TxTime First (ETF) packet
190 scheduling algorithm.
191
192 See the top of <file:net/sched/sch_etf.c> for more details.
193
194 To compile this code as a module, choose M here: the
195 module will be called sch_etf.
196
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100198 tristate "Generic Random Early Detection (GRED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100199 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700201 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202 (see the top of <file:net/sched/sch_red.c> for details and
203 references about the algorithm).
204
205 To compile this code as a module, choose M here: the
206 module will be called sch_gred.
207
208config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100209 tristate "Differentiated Services marker (DSMARK)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100210 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700211 Say Y if you want to schedule packets according to the
212 Differentiated Services architecture proposed in RFC 2475.
213 Technical information on this method, with pointers to associated
214 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
215
216 To compile this code as a module, choose M here: the
217 module will be called sch_dsmark.
218
219config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100220 tristate "Network emulator (NETEM)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100221 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222 Say Y if you want to emulate network delay, loss, and packet
223 re-ordering. This is often useful to simulate networks when
224 testing applications or protocols.
225
226 To compile this driver as a module, choose M here: the module
227 will be called sch_netem.
228
229 If unsure, say N.
230
Patrick McHardy13d2a1d2008-11-20 04:10:00 -0800231config NET_SCH_DRR
232 tristate "Deficit Round Robin scheduler (DRR)"
233 help
234 Say Y here if you want to use the Deficit Round Robin (DRR) packet
235 scheduling algorithm.
236
237 To compile this driver as a module, choose M here: the module
238 will be called sch_drr.
239
240 If unsure, say N.
241
John Fastabendb8970f02011-01-17 08:06:09 +0000242config NET_SCH_MQPRIO
243 tristate "Multi-queue priority scheduler (MQPRIO)"
244 help
245 Say Y here if you want to use the Multi-queue Priority scheduler.
246 This scheduler allows QOS to be offloaded on NICs that have support
247 for offloading QOS schedulers.
248
249 To compile this driver as a module, choose M here: the module will
250 be called sch_mqprio.
251
252 If unsure, say N.
253
Nishanth Devarajanaea5f6542018-07-23 19:37:41 +0530254config NET_SCH_SKBPRIO
255 tristate "SKB priority queue scheduler (SKBPRIO)"
256 help
257 Say Y here if you want to use the SKB priority queue
258 scheduler. This schedules packets according to skb->priority,
259 which is useful for request packets in DoS mitigation systems such
260 as Gatekeeper.
261
262 To compile this driver as a module, choose M here: the module will
263 be called sch_skbprio.
264
265 If unsure, say N.
266
stephen hemminger45e14432011-02-02 15:21:10 +0000267config NET_SCH_CHOKE
268 tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
269 help
270 Say Y here if you want to use the CHOKe packet scheduler (CHOose
271 and Keep for responsive flows, CHOose and Kill for unresponsive
272 flows). This is a variation of RED which trys to penalize flows
273 that monopolize the queue.
274
275 To compile this code as a module, choose M here: the
276 module will be called sch_choke.
277
stephen hemminger0545a302011-04-04 05:30:58 +0000278config NET_SCH_QFQ
279 tristate "Quick Fair Queueing scheduler (QFQ)"
280 help
281 Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
282 packet scheduling algorithm.
283
284 To compile this driver as a module, choose M here: the module
285 will be called sch_qfq.
286
287 If unsure, say N.
288
Eric Dumazet76e3cc12012-05-10 07:51:25 +0000289config NET_SCH_CODEL
290 tristate "Controlled Delay AQM (CODEL)"
291 help
292 Say Y here if you want to use the Controlled Delay (CODEL)
293 packet scheduling algorithm.
294
295 To compile this driver as a module, choose M here: the module
296 will be called sch_codel.
297
298 If unsure, say N.
299
Eric Dumazet4b549a22012-05-11 09:30:50 +0000300config NET_SCH_FQ_CODEL
301 tristate "Fair Queue Controlled Delay AQM (FQ_CODEL)"
302 help
303 Say Y here if you want to use the FQ Controlled Delay (FQ_CODEL)
304 packet scheduling algorithm.
305
306 To compile this driver as a module, choose M here: the module
307 will be called sch_fq_codel.
308
309 If unsure, say N.
310
Toke Høiland-Jørgensen046f6fd2018-07-06 17:37:19 +0200311config NET_SCH_CAKE
312 tristate "Common Applications Kept Enhanced (CAKE)"
313 help
314 Say Y here if you want to use the Common Applications Kept Enhanced
315 (CAKE) queue management algorithm.
316
317 To compile this driver as a module, choose M here: the module
318 will be called sch_cake.
319
320 If unsure, say N.
321
Eric Dumazetafe4fd02013-08-29 15:49:55 -0700322config NET_SCH_FQ
323 tristate "Fair Queue"
324 help
325 Say Y here if you want to use the FQ packet scheduling algorithm.
326
327 FQ does flow separation, and is able to respect pacing requirements
328 set by TCP stack into sk->sk_pacing_rate (for localy generated
329 traffic)
330
331 To compile this driver as a module, choose M here: the module
332 will be called sch_fq.
333
334 If unsure, say N.
335
Terry Lam10239ed2013-12-15 00:30:21 -0800336config NET_SCH_HHF
337 tristate "Heavy-Hitter Filter (HHF)"
338 help
339 Say Y here if you want to use the Heavy-Hitter Filter (HHF)
340 packet scheduling algorithm.
341
342 To compile this driver as a module, choose M here: the module
343 will be called sch_hhf.
344
Vijay Subramaniand4b36212014-01-04 17:33:55 -0800345config NET_SCH_PIE
346 tristate "Proportional Integral controller Enhanced (PIE) scheduler"
347 help
348 Say Y here if you want to use the Proportional Integral controller
349 Enhanced scheduler packet scheduling algorithm.
350 For more information, please see
351 http://tools.ietf.org/html/draft-pan-tsvwg-pie-00
352
353 To compile this driver as a module, choose M here: the module
354 will be called sch_pie.
355
356 If unsure, say N.
357
Linus Torvalds1da177e2005-04-16 15:20:36 -0700358config NET_SCH_INGRESS
Daniel Borkmann1f211a12016-01-07 22:29:47 +0100359 tristate "Ingress/classifier-action Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800360 depends on NET_CLS_ACT
Pablo Neira1cf519002015-05-13 18:19:37 +0200361 select NET_INGRESS
Daniel Borkmann1f211a12016-01-07 22:29:47 +0100362 select NET_EGRESS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100363 ---help---
Daniel Borkmann1f211a12016-01-07 22:29:47 +0100364 Say Y here if you want to use classifiers for incoming and/or outgoing
365 packets. This qdisc doesn't do anything else besides running classifiers,
366 which can also have actions attached to them. In case of outgoing packets,
367 classifiers that this qdisc holds are executed in the transmit path
368 before real enqueuing to an egress qdisc happens.
369
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370 If unsure, say Y.
371
Daniel Borkmann1f211a12016-01-07 22:29:47 +0100372 To compile this code as a module, choose M here: the module will be
373 called sch_ingress with alias of sch_clsact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700374
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000375config NET_SCH_PLUG
376 tristate "Plug network traffic until release (PLUG)"
377 ---help---
378
379 This queuing discipline allows userspace to plug/unplug a network
380 output queue, using the netlink interface. When it receives an
381 enqueue command it inserts a plug into the outbound queue that
382 causes following packets to enqueue until a dequeue command arrives
383 over netlink, causing the plug to be removed and resuming the normal
384 packet flow.
385
386 This module also provides a generic "network output buffering"
387 functionality (aka output commit), wherein upon arrival of a dequeue
388 command, only packets up to the first plug are released for delivery.
389 The Remus HA project uses this module to enable speculative execution
390 of virtual machines by allowing the generated network output to be rolled
391 back if needed.
392
Andrew Shewmaker5d330cd2014-12-03 14:07:31 -0800393 For more information, please refer to <http://wiki.xenproject.org/wiki/Remus>
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000394
395 Say Y here if you are using this kernel for Xen dom0 and
396 want to protect Xen guests with Remus.
397
398 To compile this code as a module, choose M here: the
399 module will be called sch_plug.
400
stephen hemminger8ea3e432017-04-13 08:40:53 -0700401menuconfig NET_SCH_DEFAULT
402 bool "Allow override default queue discipline"
403 ---help---
404 Support for selection of default queuing discipline.
405
406 Nearly all users can safely say no here, and the default
407 of pfifo_fast will be used. Many distributions already set
408 the default value via /proc/sys/net/core/default_qdisc.
409
410 If unsure, say N.
411
412if NET_SCH_DEFAULT
413
414choice
415 prompt "Default queuing discipline"
416 default DEFAULT_PFIFO_FAST
417 help
418 Select the queueing discipline that will be used by default
419 for all network devices.
420
421 config DEFAULT_FQ
422 bool "Fair Queue" if NET_SCH_FQ
423
424 config DEFAULT_CODEL
425 bool "Controlled Delay" if NET_SCH_CODEL
426
427 config DEFAULT_FQ_CODEL
428 bool "Fair Queue Controlled Delay" if NET_SCH_FQ_CODEL
429
430 config DEFAULT_SFQ
431 bool "Stochastic Fair Queue" if NET_SCH_SFQ
432
433 config DEFAULT_PFIFO_FAST
434 bool "Priority FIFO Fast"
435endchoice
436
437config DEFAULT_NET_SCH
438 string
439 default "pfifo_fast" if DEFAULT_PFIFO_FAST
440 default "fq" if DEFAULT_FQ
441 default "fq_codel" if DEFAULT_FQ_CODEL
442 default "sfq" if DEFAULT_SFQ
443 default "pfifo_fast"
444endif
445
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100446comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700447
448config NET_CLS
Christoph Jaeger6341e622014-12-20 15:41:11 -0500449 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450
451config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100452 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100453 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454 ---help---
455 Say Y here if you want to be able to classify packets using
456 only extended matches and actions.
457
458 To compile this code as a module, choose M here: the
459 module will be called cls_basic.
460
461config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100462 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100463 select NET_CLS
464 ---help---
465 Say Y here if you want to be able to classify packets based on
466 traffic control indices. You will want this feature if you want
467 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468
469 To compile this code as a module, choose M here: the
470 module will be called cls_tcindex.
471
472config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100473 tristate "Routing decision (ROUTE)"
Randy Dunlap034cfe42011-05-19 19:23:28 -0400474 depends on INET
Patrick McHardyc7066f72011-01-14 13:36:42 +0100475 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100476 select NET_CLS
477 ---help---
478 If you say Y here, you will be able to classify packets
479 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700480
481 To compile this code as a module, choose M here: the
482 module will be called cls_route.
483
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100485 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100486 select NET_CLS
487 ---help---
488 If you say Y here, you will be able to classify packets
489 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700490
491 To compile this code as a module, choose M here: the
492 module will be called cls_fw.
493
494config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100495 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100496 select NET_CLS
497 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200498 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100499 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700500
501 To compile this code as a module, choose M here: the
502 module will be called cls_u32.
503
504config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100505 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700506 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100507 ---help---
508 Say Y here to make u32 gather additional statistics useful for
509 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510
511config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100512 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800513 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100514 ---help---
515 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516
517config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100518 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100519 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 ---help---
521 The Resource Reservation Protocol (RSVP) permits end systems to
522 request a minimum and maximum data flow rate for a connection; this
523 is important for real time data such as streaming sound or video.
524
525 Say Y here if you want to be able to classify outgoing packets based
526 on their RSVP requests.
527
528 To compile this code as a module, choose M here: the
529 module will be called cls_rsvp.
530
531config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100532 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100533 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700534 ---help---
535 The Resource Reservation Protocol (RSVP) permits end systems to
536 request a minimum and maximum data flow rate for a connection; this
537 is important for real time data such as streaming sound or video.
538
539 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700540 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541
542 To compile this code as a module, choose M here: the
543 module will be called cls_rsvp6.
544
Patrick McHardye5dfb812008-01-31 18:37:42 -0800545config NET_CLS_FLOW
546 tristate "Flow classifier"
547 select NET_CLS
548 ---help---
549 If you say Y here, you will be able to classify packets based on
550 a configurable combination of packet keys. This is mostly useful
551 in combination with SFQ.
552
553 To compile this code as a module, choose M here: the
554 module will be called cls_flow.
555
Thomas Graff4009232008-11-07 22:56:00 -0800556config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000557 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800558 select NET_CLS
Daniel Borkmannfe1217c2013-12-29 18:27:10 +0100559 select CGROUP_NET_CLASSID
Thomas Graff4009232008-11-07 22:56:00 -0800560 depends on CGROUPS
561 ---help---
562 Say Y here if you want to classify packets based on the control
563 cgroup of their process.
564
Ben Blum8e039d82010-03-23 05:24:03 +0000565 To compile this code as a module, choose M here: the
566 module will be called cls_cgroup.
567
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100568config NET_CLS_BPF
569 tristate "BPF-based classifier"
570 select NET_CLS
571 ---help---
572 If you say Y here, you will be able to classify packets based on
573 programmable BPF (JIT'ed) filters as an alternative to ematches.
574
575 To compile this code as a module, choose M here: the module will
576 be called cls_bpf.
577
Jiri Pirko77b99002015-05-12 14:56:21 +0200578config NET_CLS_FLOWER
579 tristate "Flower classifier"
580 select NET_CLS
581 ---help---
582 If you say Y here, you will be able to classify packets based on
583 a configurable combination of packet keys and masks.
584
585 To compile this code as a module, choose M here: the module will
586 be called cls_flower.
587
Jiri Pirkobf3994d2016-07-21 12:03:11 +0200588config NET_CLS_MATCHALL
589 tristate "Match-all classifier"
590 select NET_CLS
591 ---help---
592 If you say Y here, you will be able to classify packets based on
593 nothing. Every packet will match.
594
595 To compile this code as a module, choose M here: the module will
596 be called cls_matchall.
597
Linus Torvalds1da177e2005-04-16 15:20:36 -0700598config NET_EMATCH
599 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100600 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700601 ---help---
602 Say Y here if you want to use extended matches on top of classifiers
603 and select the extended matches below.
604
605 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100606 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100608 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609 extended matches.
610
611config NET_EMATCH_STACK
612 int "Stack size"
613 depends on NET_EMATCH
614 default "32"
615 ---help---
616 Size of the local stack variable used while evaluating the tree of
617 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700618 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700619 stack space.
620
621config NET_EMATCH_CMP
622 tristate "Simple packet data comparison"
623 depends on NET_EMATCH
624 ---help---
625 Say Y here if you want to be able to classify packets based on
626 simple packet data comparisons for 8, 16, and 32bit values.
627
628 To compile this code as a module, choose M here: the
629 module will be called em_cmp.
630
631config NET_EMATCH_NBYTE
632 tristate "Multi byte comparison"
633 depends on NET_EMATCH
634 ---help---
635 Say Y here if you want to be able to classify packets based on
636 multiple byte comparisons mainly useful for IPv6 address comparisons.
637
638 To compile this code as a module, choose M here: the
639 module will be called em_nbyte.
640
641config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100642 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700643 depends on NET_EMATCH
644 ---help---
645 Say Y here if you want to be able to classify packets using
646 the famous u32 key in combination with logic relations.
647
648 To compile this code as a module, choose M here: the
649 module will be called em_u32.
650
651config NET_EMATCH_META
652 tristate "Metadata"
653 depends on NET_EMATCH
654 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800655 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700656 metadata such as load average, netfilter attributes, socket
657 attributes and routing decisions.
658
659 To compile this code as a module, choose M here: the
660 module will be called em_meta.
661
Thomas Grafd675c982005-06-23 21:00:58 -0700662config NET_EMATCH_TEXT
663 tristate "Textsearch"
664 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700665 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700666 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700667 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700668 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700669 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100670 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700671 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700672
673 To compile this code as a module, choose M here: the
674 module will be called em_text.
675
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200676config NET_EMATCH_CANID
677 tristate "CAN Identifier"
Marc Kleine-Buddea303fbf2012-11-23 00:44:57 +0000678 depends on NET_EMATCH && (CAN=y || CAN=m)
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200679 ---help---
680 Say Y here if you want to be able to classify CAN frames based
681 on CAN Identifier.
682
683 To compile this code as a module, choose M here: the
684 module will be called em_canid.
685
Florian Westphal6d4fa852012-07-11 10:56:57 +0000686config NET_EMATCH_IPSET
687 tristate "IPset"
688 depends on NET_EMATCH && IP_SET
689 ---help---
690 Say Y here if you want to be able to classify packets based on
691 ipset membership.
692
693 To compile this code as a module, choose M here: the
694 module will be called em_ipset.
695
Eyal Birgerccc007e2018-02-15 19:42:43 +0200696config NET_EMATCH_IPT
697 tristate "IPtables Matches"
698 depends on NET_EMATCH && NETFILTER && NETFILTER_XTABLES
699 ---help---
700 Say Y here to be able to classify packets based on iptables
701 matches.
702 Current supported match is "policy" which allows packet classification
703 based on IPsec policy that was used during decapsulation
704
705 To compile this code as a module, choose M here: the
706 module will be called em_ipt.
707
Linus Torvalds1da177e2005-04-16 15:20:36 -0700708config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100709 bool "Actions"
Jiri Pirko8ec15072017-06-04 18:49:28 +0200710 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700711 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100712 Say Y here if you want to use traffic control actions. Actions
713 get attached to classifiers and are invoked after a successful
714 classification. They are used to overwrite the classification
715 result, instantly drop or redirect packets, etc.
716
717 A recent version of the iproute2 package is required to use
718 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700719
720config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100721 tristate "Traffic Policing"
Stephen Hemminger50f699b2018-07-24 12:29:01 -0700722 depends on NET_CLS_ACT
Linus Torvalds1da177e2005-04-16 15:20:36 -0700723 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100724 Say Y here if you want to do traffic policing, i.e. strict
725 bandwidth limiting. This action replaces the existing policing
726 module.
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_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730
731config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100732 tristate "Generic actions"
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 to take generic actions such as dropping and
736 accepting packets.
737
738 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800739 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700740
741config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100742 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700743 depends on NET_ACT_GACT
744 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100745 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700746
747config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100748 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700749 depends on NET_CLS_ACT
750 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100751 Say Y here to allow packets to be mirrored or redirected to
752 other devices.
753
754 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800755 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700756
Yotam Gigi5c5670f2017-01-23 11:07:09 +0100757config NET_ACT_SAMPLE
758 tristate "Traffic Sampling"
759 depends on NET_CLS_ACT
760 select PSAMPLE
761 ---help---
762 Say Y here to allow packet sampling tc action. The packet sample
763 action consists of statistically choosing packets and sampling
764 them using the psample module.
765
766 To compile this code as a module, choose M here: the
767 module will be called act_sample.
768
Linus Torvalds1da177e2005-04-16 15:20:36 -0700769config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100770 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700771 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
772 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200773 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100774 classification.
775
776 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800777 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700778
Herbert Xub4219952007-09-27 12:48:05 -0700779config NET_ACT_NAT
780 tristate "Stateless NAT"
781 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700782 ---help---
783 Say Y here to do stateless NAT on IPv4 packets. You should use
784 netfilter for NAT unless you know what you are doing.
785
786 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800787 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700788
Linus Torvalds1da177e2005-04-16 15:20:36 -0700789config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100790 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700791 depends on NET_CLS_ACT
792 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100793 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700794
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100795 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800796 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700797
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700798config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100799 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700800 depends on NET_CLS_ACT
801 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100802 Say Y here to add a simple action for demonstration purposes.
803 It is meant as an example and for debugging purposes. It will
804 print a configured policy string followed by the packet count
805 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700806
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100807 If unsure, say N.
808
809 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800810 module will be called act_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100811
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700812config NET_ACT_SKBEDIT
813 tristate "SKB Editing"
814 depends on NET_CLS_ACT
815 ---help---
816 Say Y here to change skb priority or queue_mapping settings.
817
818 If unsure, say N.
819
820 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800821 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700822
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000823config NET_ACT_CSUM
824 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700825 depends on NET_CLS_ACT && INET
Davide Carattiab9d2262017-01-09 11:24:20 +0100826 select LIBCRC32C
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000827 ---help---
828 Say Y here to update some common checksum after some direct
829 packet alterations.
830
831 To compile this code as a module, choose M here: the
832 module will be called act_csum.
833
Jiri Pirkoc7e2b962014-11-19 14:05:03 +0100834config NET_ACT_VLAN
835 tristate "Vlan manipulation"
836 depends on NET_CLS_ACT
837 ---help---
838 Say Y here to push or pop vlan headers.
839
840 If unsure, say N.
841
842 To compile this code as a module, choose M here: the
843 module will be called act_vlan.
844
Jiri Pirkod23b8ad2015-01-15 09:52:39 +0100845config NET_ACT_BPF
846 tristate "BPF based action"
847 depends on NET_CLS_ACT
848 ---help---
849 Say Y here to execute BPF code on packets. The BPF code will decide
850 if the packet should be dropped or not.
851
852 If unsure, say N.
853
854 To compile this code as a module, choose M here: the
855 module will be called act_bpf.
856
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500857config NET_ACT_CONNMARK
858 tristate "Netfilter Connection Mark Retriever"
859 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
Arnd Bergmann2dbce092015-01-28 17:30:09 +0100860 depends on NF_CONNTRACK && NF_CONNTRACK_MARK
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500861 ---help---
862 Say Y here to allow retrieving of conn mark
863
864 If unsure, say N.
865
866 To compile this code as a module, choose M here: the
867 module will be called act_connmark.
868
Jamal Hadi Salim86da71b2016-09-12 20:13:09 -0400869config NET_ACT_SKBMOD
870 tristate "skb data modification action"
871 depends on NET_CLS_ACT
872 ---help---
873 Say Y here to allow modification of skb data
874
875 If unsure, say N.
876
877 To compile this code as a module, choose M here: the
878 module will be called act_skbmod.
879
Jamal Hadi Salimef6980b62016-02-27 08:08:54 -0500880config NET_ACT_IFE
881 tristate "Inter-FE action based on IETF ForCES InterFE LFB"
882 depends on NET_CLS_ACT
Yotam Gigi295a6e02017-02-01 15:30:03 +0200883 select NET_IFE
Jamal Hadi Salimef6980b62016-02-27 08:08:54 -0500884 ---help---
885 Say Y here to allow for sourcing and terminating metadata
886 For details refer to netdev01 paper:
887 "Distributing Linux Traffic Control Classifier-Action Subsystem"
888 Authors: Jamal Hadi Salim and Damascene M. Joachimpillai
889
890 To compile this code as a module, choose M here: the
891 module will be called act_ife.
892
Amir Vadaid0f6dd82016-09-08 16:23:48 +0300893config NET_ACT_TUNNEL_KEY
894 tristate "IP tunnel metadata manipulation"
895 depends on NET_CLS_ACT
896 ---help---
897 Say Y here to set/release ip tunnel metadata.
898
899 If unsure, say N.
900
901 To compile this code as a module, choose M here: the
902 module will be called act_tunnel_key.
903
Jamal Hadi Salim084e2f62016-02-27 08:08:55 -0500904config NET_IFE_SKBMARK
905 tristate "Support to encoding decoding skb mark on IFE action"
906 depends on NET_ACT_IFE
Jamal Hadi Salim084e2f62016-02-27 08:08:55 -0500907
Jamal Hadi Salim200e10f2016-02-27 08:08:56 -0500908config NET_IFE_SKBPRIO
909 tristate "Support to encoding decoding skb prio on IFE action"
910 depends on NET_ACT_IFE
Jamal Hadi Salim200e10f2016-02-27 08:08:56 -0500911
Jamal Hadi Salim408fbc22016-09-18 07:31:43 -0400912config NET_IFE_SKBTCINDEX
913 tristate "Support to encoding decoding skb tcindex on IFE action"
914 depends on NET_ACT_IFE
Jamal Hadi Salim408fbc22016-09-18 07:31:43 -0400915
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100916config NET_CLS_IND
917 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800918 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100919 ---help---
920 Say Y here to extend the u32 and fw classifier to support
921 classification based on the incoming device. This option is
922 likely to disappear in favour of the metadata ematch.
923
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800924endif # NET_SCHED
925
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700926config NET_SCH_FIFO
927 bool