blob: daa33432b7166e1c9af818835441be1b102d8d73 [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
313 tristate "Ingress 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
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100316 ---help---
317 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318 If unsure, say Y.
319
320 To compile this code as a module, choose M here: the
321 module will be called sch_ingress.
322
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000323config NET_SCH_PLUG
324 tristate "Plug network traffic until release (PLUG)"
325 ---help---
326
327 This queuing discipline allows userspace to plug/unplug a network
328 output queue, using the netlink interface. When it receives an
329 enqueue command it inserts a plug into the outbound queue that
330 causes following packets to enqueue until a dequeue command arrives
331 over netlink, causing the plug to be removed and resuming the normal
332 packet flow.
333
334 This module also provides a generic "network output buffering"
335 functionality (aka output commit), wherein upon arrival of a dequeue
336 command, only packets up to the first plug are released for delivery.
337 The Remus HA project uses this module to enable speculative execution
338 of virtual machines by allowing the generated network output to be rolled
339 back if needed.
340
Andrew Shewmaker5d330cd2014-12-03 14:07:31 -0800341 For more information, please refer to <http://wiki.xenproject.org/wiki/Remus>
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000342
343 Say Y here if you are using this kernel for Xen dom0 and
344 want to protect Xen guests with Remus.
345
346 To compile this code as a module, choose M here: the
347 module will be called sch_plug.
348
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100349comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700350
351config NET_CLS
Christoph Jaeger6341e622014-12-20 15:41:11 -0500352 bool
Linus Torvalds1da177e2005-04-16 15:20:36 -0700353
354config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100355 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100356 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357 ---help---
358 Say Y here if you want to be able to classify packets using
359 only extended matches and actions.
360
361 To compile this code as a module, choose M here: the
362 module will be called cls_basic.
363
364config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100365 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100366 select NET_CLS
367 ---help---
368 Say Y here if you want to be able to classify packets based on
369 traffic control indices. You will want this feature if you want
370 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371
372 To compile this code as a module, choose M here: the
373 module will be called cls_tcindex.
374
375config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100376 tristate "Routing decision (ROUTE)"
Randy Dunlap034cfe42011-05-19 19:23:28 -0400377 depends on INET
Patrick McHardyc7066f72011-01-14 13:36:42 +0100378 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100379 select NET_CLS
380 ---help---
381 If you say Y here, you will be able to classify packets
382 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383
384 To compile this code as a module, choose M here: the
385 module will be called cls_route.
386
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100388 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100389 select NET_CLS
390 ---help---
391 If you say Y here, you will be able to classify packets
392 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393
394 To compile this code as a module, choose M here: the
395 module will be called cls_fw.
396
397config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100398 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100399 select NET_CLS
400 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200401 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100402 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403
404 To compile this code as a module, choose M here: the
405 module will be called cls_u32.
406
407config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100408 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100410 ---help---
411 Say Y here to make u32 gather additional statistics useful for
412 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413
414config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100415 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800416 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100417 ---help---
418 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700419
420config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100421 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100422 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423 ---help---
424 The Resource Reservation Protocol (RSVP) permits end systems to
425 request a minimum and maximum data flow rate for a connection; this
426 is important for real time data such as streaming sound or video.
427
428 Say Y here if you want to be able to classify outgoing packets based
429 on their RSVP requests.
430
431 To compile this code as a module, choose M here: the
432 module will be called cls_rsvp.
433
434config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100435 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100436 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437 ---help---
438 The Resource Reservation Protocol (RSVP) permits end systems to
439 request a minimum and maximum data flow rate for a connection; this
440 is important for real time data such as streaming sound or video.
441
442 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700443 on their RSVP requests and you are using the IPv6 protocol.
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_rsvp6.
447
Patrick McHardye5dfb812008-01-31 18:37:42 -0800448config NET_CLS_FLOW
449 tristate "Flow classifier"
450 select NET_CLS
451 ---help---
452 If you say Y here, you will be able to classify packets based on
453 a configurable combination of packet keys. This is mostly useful
454 in combination with SFQ.
455
456 To compile this code as a module, choose M here: the
457 module will be called cls_flow.
458
Thomas Graff4009232008-11-07 22:56:00 -0800459config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000460 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800461 select NET_CLS
Daniel Borkmannfe1217c2013-12-29 18:27:10 +0100462 select CGROUP_NET_CLASSID
Thomas Graff4009232008-11-07 22:56:00 -0800463 depends on CGROUPS
464 ---help---
465 Say Y here if you want to classify packets based on the control
466 cgroup of their process.
467
Ben Blum8e039d82010-03-23 05:24:03 +0000468 To compile this code as a module, choose M here: the
469 module will be called cls_cgroup.
470
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100471config NET_CLS_BPF
472 tristate "BPF-based classifier"
473 select NET_CLS
474 ---help---
475 If you say Y here, you will be able to classify packets based on
476 programmable BPF (JIT'ed) filters as an alternative to ematches.
477
478 To compile this code as a module, choose M here: the module will
479 be called cls_bpf.
480
Jiri Pirko77b99002015-05-12 14:56:21 +0200481config NET_CLS_FLOWER
482 tristate "Flower classifier"
483 select NET_CLS
484 ---help---
485 If you say Y here, you will be able to classify packets based on
486 a configurable combination of packet keys and masks.
487
488 To compile this code as a module, choose M here: the module will
489 be called cls_flower.
490
Linus Torvalds1da177e2005-04-16 15:20:36 -0700491config NET_EMATCH
492 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100493 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700494 ---help---
495 Say Y here if you want to use extended matches on top of classifiers
496 and select the extended matches below.
497
498 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100499 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700500
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100501 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502 extended matches.
503
504config NET_EMATCH_STACK
505 int "Stack size"
506 depends on NET_EMATCH
507 default "32"
508 ---help---
509 Size of the local stack variable used while evaluating the tree of
510 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700511 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512 stack space.
513
514config NET_EMATCH_CMP
515 tristate "Simple packet data comparison"
516 depends on NET_EMATCH
517 ---help---
518 Say Y here if you want to be able to classify packets based on
519 simple packet data comparisons for 8, 16, and 32bit values.
520
521 To compile this code as a module, choose M here: the
522 module will be called em_cmp.
523
524config NET_EMATCH_NBYTE
525 tristate "Multi byte comparison"
526 depends on NET_EMATCH
527 ---help---
528 Say Y here if you want to be able to classify packets based on
529 multiple byte comparisons mainly useful for IPv6 address comparisons.
530
531 To compile this code as a module, choose M here: the
532 module will be called em_nbyte.
533
534config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100535 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536 depends on NET_EMATCH
537 ---help---
538 Say Y here if you want to be able to classify packets using
539 the famous u32 key in combination with logic relations.
540
541 To compile this code as a module, choose M here: the
542 module will be called em_u32.
543
544config NET_EMATCH_META
545 tristate "Metadata"
546 depends on NET_EMATCH
547 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800548 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700549 metadata such as load average, netfilter attributes, socket
550 attributes and routing decisions.
551
552 To compile this code as a module, choose M here: the
553 module will be called em_meta.
554
Thomas Grafd675c982005-06-23 21:00:58 -0700555config NET_EMATCH_TEXT
556 tristate "Textsearch"
557 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700558 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700559 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700560 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700561 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700562 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100563 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700564 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700565
566 To compile this code as a module, choose M here: the
567 module will be called em_text.
568
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200569config NET_EMATCH_CANID
570 tristate "CAN Identifier"
Marc Kleine-Buddea303fbf2012-11-23 00:44:57 +0000571 depends on NET_EMATCH && (CAN=y || CAN=m)
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200572 ---help---
573 Say Y here if you want to be able to classify CAN frames based
574 on CAN Identifier.
575
576 To compile this code as a module, choose M here: the
577 module will be called em_canid.
578
Florian Westphal6d4fa852012-07-11 10:56:57 +0000579config NET_EMATCH_IPSET
580 tristate "IPset"
581 depends on NET_EMATCH && IP_SET
582 ---help---
583 Say Y here if you want to be able to classify packets based on
584 ipset membership.
585
586 To compile this code as a module, choose M here: the
587 module will be called em_ipset.
588
Linus Torvalds1da177e2005-04-16 15:20:36 -0700589config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100590 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100592 Say Y here if you want to use traffic control actions. Actions
593 get attached to classifiers and are invoked after a successful
594 classification. They are used to overwrite the classification
595 result, instantly drop or redirect packets, etc.
596
597 A recent version of the iproute2 package is required to use
598 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599
600config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100601 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700602 depends on NET_CLS_ACT
603 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100604 Say Y here if you want to do traffic policing, i.e. strict
605 bandwidth limiting. This action replaces the existing policing
606 module.
607
608 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800609 module will be called act_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700610
611config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100612 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700613 depends on NET_CLS_ACT
614 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100615 Say Y here to take generic actions such as dropping and
616 accepting packets.
617
618 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800619 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620
621config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100622 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700623 depends on NET_ACT_GACT
624 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100625 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700626
627config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100628 tristate "Redirecting and Mirroring"
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 allow packets to be mirrored or redirected to
632 other devices.
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_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700636
637config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100638 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
640 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200641 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100642 classification.
643
644 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800645 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700646
Herbert Xub4219952007-09-27 12:48:05 -0700647config NET_ACT_NAT
648 tristate "Stateless NAT"
649 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700650 ---help---
651 Say Y here to do stateless NAT on IPv4 packets. You should use
652 netfilter for NAT unless you know what you are doing.
653
654 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800655 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700656
Linus Torvalds1da177e2005-04-16 15:20:36 -0700657config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100658 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700659 depends on NET_CLS_ACT
660 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100661 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700662
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100663 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800664 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700665
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700666config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100667 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700668 depends on NET_CLS_ACT
669 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100670 Say Y here to add a simple action for demonstration purposes.
671 It is meant as an example and for debugging purposes. It will
672 print a configured policy string followed by the packet count
673 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700674
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100675 If unsure, say N.
676
677 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800678 module will be called act_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100679
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700680config NET_ACT_SKBEDIT
681 tristate "SKB Editing"
682 depends on NET_CLS_ACT
683 ---help---
684 Say Y here to change skb priority or queue_mapping settings.
685
686 If unsure, say N.
687
688 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800689 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700690
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000691config NET_ACT_CSUM
692 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700693 depends on NET_CLS_ACT && INET
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000694 ---help---
695 Say Y here to update some common checksum after some direct
696 packet alterations.
697
698 To compile this code as a module, choose M here: the
699 module will be called act_csum.
700
Jiri Pirkoc7e2b962014-11-19 14:05:03 +0100701config NET_ACT_VLAN
702 tristate "Vlan manipulation"
703 depends on NET_CLS_ACT
704 ---help---
705 Say Y here to push or pop vlan headers.
706
707 If unsure, say N.
708
709 To compile this code as a module, choose M here: the
710 module will be called act_vlan.
711
Jiri Pirkod23b8ad2015-01-15 09:52:39 +0100712config NET_ACT_BPF
713 tristate "BPF based action"
714 depends on NET_CLS_ACT
715 ---help---
716 Say Y here to execute BPF code on packets. The BPF code will decide
717 if the packet should be dropped or not.
718
719 If unsure, say N.
720
721 To compile this code as a module, choose M here: the
722 module will be called act_bpf.
723
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500724config NET_ACT_CONNMARK
725 tristate "Netfilter Connection Mark Retriever"
726 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
Arnd Bergmann2dbce092015-01-28 17:30:09 +0100727 depends on NF_CONNTRACK && NF_CONNTRACK_MARK
Felix Fietkau22a5dc02015-01-18 16:35:14 -0500728 ---help---
729 Say Y here to allow retrieving of conn mark
730
731 If unsure, say N.
732
733 To compile this code as a module, choose M here: the
734 module will be called act_connmark.
735
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100736config NET_CLS_IND
737 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800738 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100739 ---help---
740 Say Y here to extend the u32 and fw classifier to support
741 classification based on the incoming device. This option is
742 likely to disappear in favour of the metadata ematch.
743
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800744endif # NET_SCHED
745
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700746config NET_SCH_FIFO
747 bool