blob: 403790cce7d2324054aa48b49c70f7d4deff8a2a [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
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100355comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700356
357config NET_CLS
Christoph Jaeger6341e622014-12-20 15:41:11 -0500358 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359
360config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100361 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100362 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700363 ---help---
364 Say Y here if you want to be able to classify packets using
365 only extended matches and actions.
366
367 To compile this code as a module, choose M here: the
368 module will be called cls_basic.
369
370config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100371 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100372 select NET_CLS
373 ---help---
374 Say Y here if you want to be able to classify packets based on
375 traffic control indices. You will want this feature if you want
376 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700377
378 To compile this code as a module, choose M here: the
379 module will be called cls_tcindex.
380
381config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100382 tristate "Routing decision (ROUTE)"
Randy Dunlap034cfe42011-05-19 19:23:28 -0400383 depends on INET
Patrick McHardyc7066f72011-01-14 13:36:42 +0100384 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100385 select NET_CLS
386 ---help---
387 If you say Y here, you will be able to classify packets
388 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389
390 To compile this code as a module, choose M here: the
391 module will be called cls_route.
392
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100394 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100395 select NET_CLS
396 ---help---
397 If you say Y here, you will be able to classify packets
398 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700399
400 To compile this code as a module, choose M here: the
401 module will be called cls_fw.
402
403config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100404 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100405 select NET_CLS
406 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200407 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100408 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409
410 To compile this code as a module, choose M here: the
411 module will be called cls_u32.
412
413config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100414 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100416 ---help---
417 Say Y here to make u32 gather additional statistics useful for
418 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700419
420config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100421 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800422 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100423 ---help---
424 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425
426config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100427 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100428 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429 ---help---
430 The Resource Reservation Protocol (RSVP) permits end systems to
431 request a minimum and maximum data flow rate for a connection; this
432 is important for real time data such as streaming sound or video.
433
434 Say Y here if you want to be able to classify outgoing packets based
435 on their RSVP requests.
436
437 To compile this code as a module, choose M here: the
438 module will be called cls_rsvp.
439
440config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100441 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100442 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 ---help---
444 The Resource Reservation Protocol (RSVP) permits end systems to
445 request a minimum and maximum data flow rate for a connection; this
446 is important for real time data such as streaming sound or video.
447
448 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700449 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450
451 To compile this code as a module, choose M here: the
452 module will be called cls_rsvp6.
453
Patrick McHardye5dfb812008-01-31 18:37:42 -0800454config NET_CLS_FLOW
455 tristate "Flow classifier"
456 select NET_CLS
457 ---help---
458 If you say Y here, you will be able to classify packets based on
459 a configurable combination of packet keys. This is mostly useful
460 in combination with SFQ.
461
462 To compile this code as a module, choose M here: the
463 module will be called cls_flow.
464
Thomas Graff4009232008-11-07 22:56:00 -0800465config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000466 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800467 select NET_CLS
Daniel Borkmannfe1217c2013-12-29 18:27:10 +0100468 select CGROUP_NET_CLASSID
Thomas Graff4009232008-11-07 22:56:00 -0800469 depends on CGROUPS
470 ---help---
471 Say Y here if you want to classify packets based on the control
472 cgroup of their process.
473
Ben Blum8e039d82010-03-23 05:24:03 +0000474 To compile this code as a module, choose M here: the
475 module will be called cls_cgroup.
476
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100477config NET_CLS_BPF
478 tristate "BPF-based classifier"
479 select NET_CLS
480 ---help---
481 If you say Y here, you will be able to classify packets based on
482 programmable BPF (JIT'ed) filters as an alternative to ematches.
483
484 To compile this code as a module, choose M here: the module will
485 be called cls_bpf.
486
Jiri Pirko77b99002015-05-12 14:56:21 +0200487config NET_CLS_FLOWER
488 tristate "Flower classifier"
489 select NET_CLS
490 ---help---
491 If you say Y here, you will be able to classify packets based on
492 a configurable combination of packet keys and masks.
493
494 To compile this code as a module, choose M here: the module will
495 be called cls_flower.
496
Jiri Pirkobf3994d2016-07-21 12:03:11 +0200497config NET_CLS_MATCHALL
498 tristate "Match-all classifier"
499 select NET_CLS
500 ---help---
501 If you say Y here, you will be able to classify packets based on
502 nothing. Every packet will match.
503
504 To compile this code as a module, choose M here: the module will
505 be called cls_matchall.
506
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507config NET_EMATCH
508 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100509 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510 ---help---
511 Say Y here if you want to use extended matches on top of classifiers
512 and select the extended matches below.
513
514 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100515 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100517 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518 extended matches.
519
520config NET_EMATCH_STACK
521 int "Stack size"
522 depends on NET_EMATCH
523 default "32"
524 ---help---
525 Size of the local stack variable used while evaluating the tree of
526 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700527 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700528 stack space.
529
530config NET_EMATCH_CMP
531 tristate "Simple packet data comparison"
532 depends on NET_EMATCH
533 ---help---
534 Say Y here if you want to be able to classify packets based on
535 simple packet data comparisons for 8, 16, and 32bit values.
536
537 To compile this code as a module, choose M here: the
538 module will be called em_cmp.
539
540config NET_EMATCH_NBYTE
541 tristate "Multi byte comparison"
542 depends on NET_EMATCH
543 ---help---
544 Say Y here if you want to be able to classify packets based on
545 multiple byte comparisons mainly useful for IPv6 address comparisons.
546
547 To compile this code as a module, choose M here: the
548 module will be called em_nbyte.
549
550config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100551 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552 depends on NET_EMATCH
553 ---help---
554 Say Y here if you want to be able to classify packets using
555 the famous u32 key in combination with logic relations.
556
557 To compile this code as a module, choose M here: the
558 module will be called em_u32.
559
560config NET_EMATCH_META
561 tristate "Metadata"
562 depends on NET_EMATCH
563 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800564 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700565 metadata such as load average, netfilter attributes, socket
566 attributes and routing decisions.
567
568 To compile this code as a module, choose M here: the
569 module will be called em_meta.
570
Thomas Grafd675c982005-06-23 21:00:58 -0700571config NET_EMATCH_TEXT
572 tristate "Textsearch"
573 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700574 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700575 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700576 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700577 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700578 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100579 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700580 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700581
582 To compile this code as a module, choose M here: the
583 module will be called em_text.
584
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200585config NET_EMATCH_CANID
586 tristate "CAN Identifier"
Marc Kleine-Buddea303fbf2012-11-23 00:44:57 +0000587 depends on NET_EMATCH && (CAN=y || CAN=m)
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200588 ---help---
589 Say Y here if you want to be able to classify CAN frames based
590 on CAN Identifier.
591
592 To compile this code as a module, choose M here: the
593 module will be called em_canid.
594
Florian Westphal6d4fa852012-07-11 10:56:57 +0000595config NET_EMATCH_IPSET
596 tristate "IPset"
597 depends on NET_EMATCH && IP_SET
598 ---help---
599 Say Y here if you want to be able to classify packets based on
600 ipset membership.
601
602 To compile this code as a module, choose M here: the
603 module will be called em_ipset.
604
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100606 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100608 Say Y here if you want to use traffic control actions. Actions
609 get attached to classifiers and are invoked after a successful
610 classification. They are used to overwrite the classification
611 result, instantly drop or redirect packets, etc.
612
613 A recent version of the iproute2 package is required to use
614 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700615
616config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100617 tristate "Traffic Policing"
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 if you want to do traffic policing, i.e. strict
621 bandwidth limiting. This action replaces the existing policing
622 module.
623
624 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800625 module will be called act_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700626
627config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100628 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700629 depends on NET_CLS_ACT
630 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100631 Say Y here to take generic actions such as dropping and
632 accepting packets.
633
634 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800635 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700636
637config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100638 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639 depends on NET_ACT_GACT
640 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100641 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700642
643config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100644 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700645 depends on NET_CLS_ACT
646 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100647 Say Y here to allow packets to be mirrored or redirected to
648 other devices.
649
650 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800651 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700652
Yotam Gigi5c5670f2017-01-23 11:07:09 +0100653config NET_ACT_SAMPLE
654 tristate "Traffic Sampling"
655 depends on NET_CLS_ACT
656 select PSAMPLE
657 ---help---
658 Say Y here to allow packet sampling tc action. The packet sample
659 action consists of statistically choosing packets and sampling
660 them using the psample module.
661
662 To compile this code as a module, choose M here: the
663 module will be called act_sample.
664
Linus Torvalds1da177e2005-04-16 15:20:36 -0700665config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100666 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700667 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
668 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200669 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100670 classification.
671
672 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800673 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700674
Herbert Xub4219952007-09-27 12:48:05 -0700675config NET_ACT_NAT
676 tristate "Stateless NAT"
677 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700678 ---help---
679 Say Y here to do stateless NAT on IPv4 packets. You should use
680 netfilter for NAT unless you know what you are doing.
681
682 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800683 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700684
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100686 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700687 depends on NET_CLS_ACT
688 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100689 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700690
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100691 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800692 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700693
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700694config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100695 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700696 depends on NET_CLS_ACT
697 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100698 Say Y here to add a simple action for demonstration purposes.
699 It is meant as an example and for debugging purposes. It will
700 print a configured policy string followed by the packet count
701 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700702
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100703 If unsure, say N.
704
705 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800706 module will be called act_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100707
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700708config NET_ACT_SKBEDIT
709 tristate "SKB Editing"
710 depends on NET_CLS_ACT
711 ---help---
712 Say Y here to change skb priority or queue_mapping settings.
713
714 If unsure, say N.
715
716 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800717 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700718
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000719config NET_ACT_CSUM
720 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700721 depends on NET_CLS_ACT && INET
Davide Carattiab9d2262017-01-09 11:24:20 +0100722 select LIBCRC32C
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000723 ---help---
724 Say Y here to update some common checksum after some direct
725 packet alterations.
726
727 To compile this code as a module, choose M here: the
728 module will be called act_csum.
729
Jiri Pirkoc7e2b962014-11-19 14:05:03 +0100730config NET_ACT_VLAN
731 tristate "Vlan manipulation"
732 depends on NET_CLS_ACT
733 ---help---
734 Say Y here to push or pop vlan headers.
735
736 If unsure, say N.
737
738 To compile this code as a module, choose M here: the
739 module will be called act_vlan.
740
Jiri Pirkod23b8ad2015-01-15 09:52:39 +0100741config NET_ACT_BPF
742 tristate "BPF based action"
743 depends on NET_CLS_ACT
744 ---help---
745 Say Y here to execute BPF code on packets. The BPF code will decide
746 if the packet should be dropped or not.
747
748 If unsure, say N.
749
750 To compile this code as a module, choose M here: the
751 module will be called act_bpf.
752
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500753config NET_ACT_CONNMARK
754 tristate "Netfilter Connection Mark Retriever"
755 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
Arnd Bergmann2dbce092015-01-28 17:30:09 +0100756 depends on NF_CONNTRACK && NF_CONNTRACK_MARK
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500757 ---help---
758 Say Y here to allow retrieving of conn mark
759
760 If unsure, say N.
761
762 To compile this code as a module, choose M here: the
763 module will be called act_connmark.
764
Jamal Hadi Salim86da71b2016-09-12 20:13:09 -0400765config NET_ACT_SKBMOD
766 tristate "skb data modification action"
767 depends on NET_CLS_ACT
768 ---help---
769 Say Y here to allow modification of skb data
770
771 If unsure, say N.
772
773 To compile this code as a module, choose M here: the
774 module will be called act_skbmod.
775
Jamal Hadi Salimef6980b2016-02-27 08:08:54 -0500776config NET_ACT_IFE
777 tristate "Inter-FE action based on IETF ForCES InterFE LFB"
778 depends on NET_CLS_ACT
Yotam Gigi295a6e02017-02-01 15:30:03 +0200779 select NET_IFE
Jamal Hadi Salimef6980b2016-02-27 08:08:54 -0500780 ---help---
781 Say Y here to allow for sourcing and terminating metadata
782 For details refer to netdev01 paper:
783 "Distributing Linux Traffic Control Classifier-Action Subsystem"
784 Authors: Jamal Hadi Salim and Damascene M. Joachimpillai
785
786 To compile this code as a module, choose M here: the
787 module will be called act_ife.
788
Amir Vadaid0f6dd82016-09-08 16:23:48 +0300789config NET_ACT_TUNNEL_KEY
790 tristate "IP tunnel metadata manipulation"
791 depends on NET_CLS_ACT
792 ---help---
793 Say Y here to set/release ip tunnel metadata.
794
795 If unsure, say N.
796
797 To compile this code as a module, choose M here: the
798 module will be called act_tunnel_key.
799
Jamal Hadi Salim084e2f62016-02-27 08:08:55 -0500800config NET_IFE_SKBMARK
801 tristate "Support to encoding decoding skb mark on IFE action"
802 depends on NET_ACT_IFE
803 ---help---
804
Jamal Hadi Salim200e10f2016-02-27 08:08:56 -0500805config NET_IFE_SKBPRIO
806 tristate "Support to encoding decoding skb prio on IFE action"
807 depends on NET_ACT_IFE
808 ---help---
809
Jamal Hadi Salim408fbc22016-09-18 07:31:43 -0400810config NET_IFE_SKBTCINDEX
811 tristate "Support to encoding decoding skb tcindex on IFE action"
812 depends on NET_ACT_IFE
813 ---help---
814
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100815config NET_CLS_IND
816 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800817 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100818 ---help---
819 Say Y here to extend the u32 and fw classifier to support
820 classification based on the incoming device. This option is
821 likely to disappear in favour of the metadata ematch.
822
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800823endif # NET_SCHED
824
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700825config NET_SCH_FIFO
826 bool