blob: d3d7a0a66e28fbcc64a32ebc9e57a49ea712605e [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
25 from the package iproute2+tc at <ftp://ftp.tux.org/pub/net/ip-routing/>.
26 That package also contains some documentation; for more, check out
Michael Wittenc996d8b2010-11-15 19:55:34 +000027 <http://www.linuxfoundation.org/collaborate/workgroups/networking/iproute2>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070028
29 This Quality of Service (QoS) support will enable you to use
30 Differentiated Services (diffserv) and Resource Reservation Protocol
Thomas Graf52ab4ac2005-11-01 15:13:02 +010031 (RSVP) on your Linux router if you also say Y to the corresponding
32 classifiers below. Documentation and software is at
33 <http://diffserv.sourceforge.net/>.
Sam Ravnborg6a2e9b72005-07-11 21:13:56 -070034
35 If you say Y here and to "/proc file system" below, you will be able
36 to read status information about packet schedulers from the file
37 /proc/net/psched.
38
39 The available schedulers are listed in the following questions; you
40 can say Y to as many as you like. If unsure, say N now.
41
Roman Zippel05b8b0f2005-11-17 15:22:39 -080042if NET_SCHED
43
Thomas Graf52ab4ac2005-11-01 15:13:02 +010044comment "Queueing/Scheduling"
Thomas Graf52ab4ac2005-11-01 15:13:02 +010045
Linus Torvalds1da177e2005-04-16 15:20:36 -070046config NET_SCH_CBQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +010047 tristate "Class Based Queueing (CBQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070048 ---help---
49 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +010050 scheduling algorithm. This algorithm classifies the waiting packets
51 into a tree-like hierarchy of classes; the leaves of this tree are
52 in turn scheduled by separate algorithms.
Linus Torvalds1da177e2005-04-16 15:20:36 -070053
Thomas Graf52ab4ac2005-11-01 15:13:02 +010054 See the top of <file:net/sched/sch_cbq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -070055
56 CBQ is a commonly used scheduler, so if you're unsure, you should
57 say Y here. Then say Y to all the queueing algorithms below that you
Thomas Graf52ab4ac2005-11-01 15:13:02 +010058 want to use as leaf disciplines.
Linus Torvalds1da177e2005-04-16 15:20:36 -070059
60 To compile this code as a module, choose M here: the
61 module will be called sch_cbq.
62
63config NET_SCH_HTB
Thomas Graf52ab4ac2005-11-01 15:13:02 +010064 tristate "Hierarchical Token Bucket (HTB)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070065 ---help---
66 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
Thomas Graf52ab4ac2005-11-01 15:13:02 +010067 packet scheduling algorithm. See
Linus Torvalds1da177e2005-04-16 15:20:36 -070068 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
69 in-depth articles.
70
Thomas Graf52ab4ac2005-11-01 15:13:02 +010071 HTB is very similar to CBQ regarding its goals however is has
Linus Torvalds1da177e2005-04-16 15:20:36 -070072 different properties and different algorithm.
73
74 To compile this code as a module, choose M here: the
75 module will be called sch_htb.
76
77config NET_SCH_HFSC
Thomas Graf52ab4ac2005-11-01 15:13:02 +010078 tristate "Hierarchical Fair Service Curve (HFSC)"
Linus Torvalds1da177e2005-04-16 15:20:36 -070079 ---help---
80 Say Y here if you want to use the Hierarchical Fair Service Curve
Thomas Graf52ab4ac2005-11-01 15:13:02 +010081 (HFSC) packet scheduling algorithm.
Linus Torvalds1da177e2005-04-16 15:20:36 -070082
83 To compile this code as a module, choose M here: the
84 module will be called sch_hfsc.
85
Linus Torvalds1da177e2005-04-16 15:20:36 -070086config NET_SCH_ATM
Thomas Graf52ab4ac2005-11-01 15:13:02 +010087 tristate "ATM Virtual Circuits (ATM)"
Roman Zippel05b8b0f2005-11-17 15:22:39 -080088 depends on ATM
Linus Torvalds1da177e2005-04-16 15:20:36 -070089 ---help---
90 Say Y here if you want to use the ATM pseudo-scheduler. This
Thomas Graf52ab4ac2005-11-01 15:13:02 +010091 provides a framework for invoking classifiers, which in turn
92 select classes of this queuing discipline. Each class maps
93 the flow(s) it is handling to a given virtual circuit.
94
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -070095 See the top of <file:net/sched/sch_atm.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -070096
97 To compile this code as a module, choose M here: the
98 module will be called sch_atm.
99
100config NET_SCH_PRIO
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100101 tristate "Multi Band Priority Queueing (PRIO)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100102 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 Say Y here if you want to use an n-band priority queue packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100104 scheduler.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105
106 To compile this code as a module, choose M here: the
107 module will be called sch_prio.
108
Alexander Duyck92651942008-09-12 16:29:34 -0700109config NET_SCH_MULTIQ
110 tristate "Hardware Multiqueue-aware Multi Band Queuing (MULTIQ)"
111 ---help---
112 Say Y here if you want to use an n-band queue packet scheduler
113 to support devices that have multiple hardware transmit queues.
114
115 To compile this code as a module, choose M here: the
116 module will be called sch_multiq.
117
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118config NET_SCH_RED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100119 tristate "Random Early Detection (RED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100120 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 Say Y here if you want to use the Random Early Detection (RED)
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100122 packet scheduling algorithm.
123
124 See the top of <file:net/sched/sch_red.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125
126 To compile this code as a module, choose M here: the
127 module will be called sch_red.
128
Eric Dumazete13e02a2011-02-23 10:56:17 +0000129config NET_SCH_SFB
130 tristate "Stochastic Fair Blue (SFB)"
131 ---help---
132 Say Y here if you want to use the Stochastic Fair Blue (SFB)
133 packet scheduling algorithm.
134
135 See the top of <file:net/sched/sch_sfb.c> for more details.
136
137 To compile this code as a module, choose M here: the
138 module will be called sch_sfb.
139
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140config NET_SCH_SFQ
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100141 tristate "Stochastic Fairness Queueing (SFQ)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 ---help---
143 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700144 packet scheduling algorithm.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100145
146 See the top of <file:net/sched/sch_sfq.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147
148 To compile this code as a module, choose M here: the
149 module will be called sch_sfq.
150
151config NET_SCH_TEQL
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100152 tristate "True Link Equalizer (TEQL)"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153 ---help---
154 Say Y here if you want to use the True Link Equalizer (TLE) packet
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100155 scheduling algorithm. This queueing discipline allows the combination
156 of several physical devices into one virtual device.
157
158 See the top of <file:net/sched/sch_teql.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159
160 To compile this code as a module, choose M here: the
161 module will be called sch_teql.
162
163config NET_SCH_TBF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100164 tristate "Token Bucket Filter (TBF)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100165 ---help---
166 Say Y here if you want to use the Token Bucket Filter (TBF) packet
167 scheduling algorithm.
168
169 See the top of <file:net/sched/sch_tbf.c> for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170
171 To compile this code as a module, choose M here: the
172 module will be called sch_tbf.
173
174config NET_SCH_GRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100175 tristate "Generic Random Early Detection (GRED)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100176 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 Say Y here if you want to use the Generic Random Early Detection
Lucas Correia Villa Real20cc6be2005-05-03 14:34:20 -0700178 (GRED) packet scheduling algorithm for some of your network devices
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 (see the top of <file:net/sched/sch_red.c> for details and
180 references about the algorithm).
181
182 To compile this code as a module, choose M here: the
183 module will be called sch_gred.
184
185config NET_SCH_DSMARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100186 tristate "Differentiated Services marker (DSMARK)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100187 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188 Say Y if you want to schedule packets according to the
189 Differentiated Services architecture proposed in RFC 2475.
190 Technical information on this method, with pointers to associated
191 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
192
193 To compile this code as a module, choose M here: the
194 module will be called sch_dsmark.
195
196config NET_SCH_NETEM
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100197 tristate "Network emulator (NETEM)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100198 ---help---
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199 Say Y if you want to emulate network delay, loss, and packet
200 re-ordering. This is often useful to simulate networks when
201 testing applications or protocols.
202
203 To compile this driver as a module, choose M here: the module
204 will be called sch_netem.
205
206 If unsure, say N.
207
Patrick McHardy13d2a1d2008-11-20 04:10:00 -0800208config NET_SCH_DRR
209 tristate "Deficit Round Robin scheduler (DRR)"
210 help
211 Say Y here if you want to use the Deficit Round Robin (DRR) packet
212 scheduling algorithm.
213
214 To compile this driver as a module, choose M here: the module
215 will be called sch_drr.
216
217 If unsure, say N.
218
John Fastabendb8970f02011-01-17 08:06:09 +0000219config NET_SCH_MQPRIO
220 tristate "Multi-queue priority scheduler (MQPRIO)"
221 help
222 Say Y here if you want to use the Multi-queue Priority scheduler.
223 This scheduler allows QOS to be offloaded on NICs that have support
224 for offloading QOS schedulers.
225
226 To compile this driver as a module, choose M here: the module will
227 be called sch_mqprio.
228
229 If unsure, say N.
230
stephen hemminger45e14432011-02-02 15:21:10 +0000231config NET_SCH_CHOKE
232 tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
233 help
234 Say Y here if you want to use the CHOKe packet scheduler (CHOose
235 and Keep for responsive flows, CHOose and Kill for unresponsive
236 flows). This is a variation of RED which trys to penalize flows
237 that monopolize the queue.
238
239 To compile this code as a module, choose M here: the
240 module will be called sch_choke.
241
stephen hemminger0545a302011-04-04 05:30:58 +0000242config NET_SCH_QFQ
243 tristate "Quick Fair Queueing scheduler (QFQ)"
244 help
245 Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
246 packet scheduling algorithm.
247
248 To compile this driver as a module, choose M here: the module
249 will be called sch_qfq.
250
251 If unsure, say N.
252
Eric Dumazet76e3cc12012-05-10 07:51:25 +0000253config NET_SCH_CODEL
254 tristate "Controlled Delay AQM (CODEL)"
255 help
256 Say Y here if you want to use the Controlled Delay (CODEL)
257 packet scheduling algorithm.
258
259 To compile this driver as a module, choose M here: the module
260 will be called sch_codel.
261
262 If unsure, say N.
263
Eric Dumazet4b549a22012-05-11 09:30:50 +0000264config NET_SCH_FQ_CODEL
265 tristate "Fair Queue Controlled Delay AQM (FQ_CODEL)"
266 help
267 Say Y here if you want to use the FQ Controlled Delay (FQ_CODEL)
268 packet scheduling algorithm.
269
270 To compile this driver as a module, choose M here: the module
271 will be called sch_fq_codel.
272
273 If unsure, say N.
274
Eric Dumazetafe4fd02013-08-29 15:49:55 -0700275config NET_SCH_FQ
276 tristate "Fair Queue"
277 help
278 Say Y here if you want to use the FQ packet scheduling algorithm.
279
280 FQ does flow separation, and is able to respect pacing requirements
281 set by TCP stack into sk->sk_pacing_rate (for localy generated
282 traffic)
283
284 To compile this driver as a module, choose M here: the module
285 will be called sch_fq.
286
287 If unsure, say N.
288
Terry Lam10239ed2013-12-15 00:30:21 -0800289config NET_SCH_HHF
290 tristate "Heavy-Hitter Filter (HHF)"
291 help
292 Say Y here if you want to use the Heavy-Hitter Filter (HHF)
293 packet scheduling algorithm.
294
295 To compile this driver as a module, choose M here: the module
296 will be called sch_hhf.
297
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298config NET_SCH_INGRESS
299 tristate "Ingress Qdisc"
Patrick McHardy72eb7bd2008-01-31 16:57:15 -0800300 depends on NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100301 ---help---
302 Say Y here if you want to use classifiers for incoming packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303 If unsure, say Y.
304
305 To compile this code as a module, choose M here: the
306 module will be called sch_ingress.
307
Shriram Rajagopalanc3059be2012-02-05 13:51:32 +0000308config NET_SCH_PLUG
309 tristate "Plug network traffic until release (PLUG)"
310 ---help---
311
312 This queuing discipline allows userspace to plug/unplug a network
313 output queue, using the netlink interface. When it receives an
314 enqueue command it inserts a plug into the outbound queue that
315 causes following packets to enqueue until a dequeue command arrives
316 over netlink, causing the plug to be removed and resuming the normal
317 packet flow.
318
319 This module also provides a generic "network output buffering"
320 functionality (aka output commit), wherein upon arrival of a dequeue
321 command, only packets up to the first plug are released for delivery.
322 The Remus HA project uses this module to enable speculative execution
323 of virtual machines by allowing the generated network output to be rolled
324 back if needed.
325
326 For more information, please refer to http://wiki.xensource.com/xenwiki/Remus
327
328 Say Y here if you are using this kernel for Xen dom0 and
329 want to protect Xen guests with Remus.
330
331 To compile this code as a module, choose M here: the
332 module will be called sch_plug.
333
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100334comment "Classification"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335
336config NET_CLS
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100337 boolean
Linus Torvalds1da177e2005-04-16 15:20:36 -0700338
339config NET_CLS_BASIC
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100340 tristate "Elementary classification (BASIC)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100341 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342 ---help---
343 Say Y here if you want to be able to classify packets using
344 only extended matches and actions.
345
346 To compile this code as a module, choose M here: the
347 module will be called cls_basic.
348
349config NET_CLS_TCINDEX
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100350 tristate "Traffic-Control Index (TCINDEX)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100351 select NET_CLS
352 ---help---
353 Say Y here if you want to be able to classify packets based on
354 traffic control indices. You will want this feature if you want
355 to implement Differentiated Services together with DSMARK.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700356
357 To compile this code as a module, choose M here: the
358 module will be called cls_tcindex.
359
360config NET_CLS_ROUTE4
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100361 tristate "Routing decision (ROUTE)"
Randy Dunlap034cfe42011-05-19 19:23:28 -0400362 depends on INET
Patrick McHardyc7066f72011-01-14 13:36:42 +0100363 select IP_ROUTE_CLASSID
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100364 select NET_CLS
365 ---help---
366 If you say Y here, you will be able to classify packets
367 according to the route table entry they matched.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700368
369 To compile this code as a module, choose M here: the
370 module will be called cls_route.
371
Linus Torvalds1da177e2005-04-16 15:20:36 -0700372config NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100373 tristate "Netfilter mark (FW)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100374 select NET_CLS
375 ---help---
376 If you say Y here, you will be able to classify packets
377 according to netfilter/firewall marks.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378
379 To compile this code as a module, choose M here: the
380 module will be called cls_fw.
381
382config NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100383 tristate "Universal 32bit comparisons w/ hashing (U32)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100384 select NET_CLS
385 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200386 Say Y here to be able to classify packets using a universal
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100387 32bit pieces based comparison scheme.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700388
389 To compile this code as a module, choose M here: the
390 module will be called cls_u32.
391
392config CLS_U32_PERF
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100393 bool "Performance counters support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100395 ---help---
396 Say Y here to make u32 gather additional statistics useful for
397 fine tuning u32 classifiers.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700398
399config CLS_U32_MARK
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100400 bool "Netfilter marks support"
Thomas Graf82e91ff2006-11-09 15:19:14 -0800401 depends on NET_CLS_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100402 ---help---
403 Say Y here to be able to use netfilter marks as u32 key.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404
405config NET_CLS_RSVP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100406 tristate "IPv4 Resource Reservation Protocol (RSVP)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100407 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408 ---help---
409 The Resource Reservation Protocol (RSVP) permits end systems to
410 request a minimum and maximum data flow rate for a connection; this
411 is important for real time data such as streaming sound or video.
412
413 Say Y here if you want to be able to classify outgoing packets based
414 on their RSVP requests.
415
416 To compile this code as a module, choose M here: the
417 module will be called cls_rsvp.
418
419config NET_CLS_RSVP6
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100420 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100421 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422 ---help---
423 The Resource Reservation Protocol (RSVP) permits end systems to
424 request a minimum and maximum data flow rate for a connection; this
425 is important for real time data such as streaming sound or video.
426
427 Say Y here if you want to be able to classify outgoing packets based
Gabriel Craciunescu99acaeb2007-07-18 02:00:04 -0700428 on their RSVP requests and you are using the IPv6 protocol.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429
430 To compile this code as a module, choose M here: the
431 module will be called cls_rsvp6.
432
Patrick McHardye5dfb812008-01-31 18:37:42 -0800433config NET_CLS_FLOW
434 tristate "Flow classifier"
435 select NET_CLS
436 ---help---
437 If you say Y here, you will be able to classify packets based on
438 a configurable combination of packet keys. This is mostly useful
439 in combination with SFQ.
440
441 To compile this code as a module, choose M here: the
442 module will be called cls_flow.
443
Thomas Graff4009232008-11-07 22:56:00 -0800444config NET_CLS_CGROUP
Ben Blum8e039d82010-03-23 05:24:03 +0000445 tristate "Control Group Classifier"
Thomas Graff4009232008-11-07 22:56:00 -0800446 select NET_CLS
Daniel Borkmannfe1217c2013-12-29 18:27:10 +0100447 select CGROUP_NET_CLASSID
Thomas Graff4009232008-11-07 22:56:00 -0800448 depends on CGROUPS
449 ---help---
450 Say Y here if you want to classify packets based on the control
451 cgroup of their process.
452
Ben Blum8e039d82010-03-23 05:24:03 +0000453 To compile this code as a module, choose M here: the
454 module will be called cls_cgroup.
455
Daniel Borkmann7d1d65c2013-10-28 16:43:02 +0100456config NET_CLS_BPF
457 tristate "BPF-based classifier"
458 select NET_CLS
459 ---help---
460 If you say Y here, you will be able to classify packets based on
461 programmable BPF (JIT'ed) filters as an alternative to ematches.
462
463 To compile this code as a module, choose M here: the module will
464 be called cls_bpf.
465
Linus Torvalds1da177e2005-04-16 15:20:36 -0700466config NET_EMATCH
467 bool "Extended Matches"
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100468 select NET_CLS
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469 ---help---
470 Say Y here if you want to use extended matches on top of classifiers
471 and select the extended matches below.
472
473 Extended matches are small classification helpers not worth writing
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100474 a separate classifier for.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700475
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100476 A recent version of the iproute2 package is required to use
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477 extended matches.
478
479config NET_EMATCH_STACK
480 int "Stack size"
481 depends on NET_EMATCH
482 default "32"
483 ---help---
484 Size of the local stack variable used while evaluating the tree of
485 ematches. Limits the depth of the tree, i.e. the number of
Thomas Grafb8249792005-06-08 15:10:22 -0700486 encapsulated precedences. Every level requires 4 bytes of additional
Linus Torvalds1da177e2005-04-16 15:20:36 -0700487 stack space.
488
489config NET_EMATCH_CMP
490 tristate "Simple packet data comparison"
491 depends on NET_EMATCH
492 ---help---
493 Say Y here if you want to be able to classify packets based on
494 simple packet data comparisons for 8, 16, and 32bit values.
495
496 To compile this code as a module, choose M here: the
497 module will be called em_cmp.
498
499config NET_EMATCH_NBYTE
500 tristate "Multi byte comparison"
501 depends on NET_EMATCH
502 ---help---
503 Say Y here if you want to be able to classify packets based on
504 multiple byte comparisons mainly useful for IPv6 address comparisons.
505
506 To compile this code as a module, choose M here: the
507 module will be called em_nbyte.
508
509config NET_EMATCH_U32
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100510 tristate "U32 key"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511 depends on NET_EMATCH
512 ---help---
513 Say Y here if you want to be able to classify packets using
514 the famous u32 key in combination with logic relations.
515
516 To compile this code as a module, choose M here: the
517 module will be called em_u32.
518
519config NET_EMATCH_META
520 tristate "Metadata"
521 depends on NET_EMATCH
522 ---help---
Adrian Bunkbb7e8c52006-01-11 16:40:30 -0800523 Say Y here if you want to be able to classify packets based on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700524 metadata such as load average, netfilter attributes, socket
525 attributes and routing decisions.
526
527 To compile this code as a module, choose M here: the
528 module will be called em_meta.
529
Thomas Grafd675c982005-06-23 21:00:58 -0700530config NET_EMATCH_TEXT
531 tristate "Textsearch"
532 depends on NET_EMATCH
David S. Millerf2d368f2005-06-23 23:55:41 -0700533 select TEXTSEARCH
David S. Millerf7704342005-06-24 17:39:03 -0700534 select TEXTSEARCH_KMP
David S. Miller29cb9f92005-08-25 16:23:11 -0700535 select TEXTSEARCH_BM
David S. Millerf7704342005-06-24 17:39:03 -0700536 select TEXTSEARCH_FSM
Thomas Grafd675c982005-06-23 21:00:58 -0700537 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100538 Say Y here if you want to be able to classify packets based on
David S. Millerf7704342005-06-24 17:39:03 -0700539 textsearch comparisons.
Thomas Grafd675c982005-06-23 21:00:58 -0700540
541 To compile this code as a module, choose M here: the
542 module will be called em_text.
543
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200544config NET_EMATCH_CANID
545 tristate "CAN Identifier"
Marc Kleine-Buddea303fbf2012-11-23 00:44:57 +0000546 depends on NET_EMATCH && (CAN=y || CAN=m)
Rostislav Lisovyf057bbb2012-07-04 05:32:03 +0200547 ---help---
548 Say Y here if you want to be able to classify CAN frames based
549 on CAN Identifier.
550
551 To compile this code as a module, choose M here: the
552 module will be called em_canid.
553
Florian Westphal6d4fa852012-07-11 10:56:57 +0000554config NET_EMATCH_IPSET
555 tristate "IPset"
556 depends on NET_EMATCH && IP_SET
557 ---help---
558 Say Y here if you want to be able to classify packets based on
559 ipset membership.
560
561 To compile this code as a module, choose M here: the
562 module will be called em_ipset.
563
Linus Torvalds1da177e2005-04-16 15:20:36 -0700564config NET_CLS_ACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100565 bool "Actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700566 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100567 Say Y here if you want to use traffic control actions. Actions
568 get attached to classifiers and are invoked after a successful
569 classification. They are used to overwrite the classification
570 result, instantly drop or redirect packets, etc.
571
572 A recent version of the iproute2 package is required to use
573 extended matches.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700574
575config NET_ACT_POLICE
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100576 tristate "Traffic Policing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700577 depends on NET_CLS_ACT
578 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100579 Say Y here if you want to do traffic policing, i.e. strict
580 bandwidth limiting. This action replaces the existing policing
581 module.
582
583 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800584 module will be called act_police.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700585
586config NET_ACT_GACT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100587 tristate "Generic actions"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588 depends on NET_CLS_ACT
589 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100590 Say Y here to take generic actions such as dropping and
591 accepting packets.
592
593 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800594 module will be called act_gact.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700595
596config GACT_PROB
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100597 bool "Probability support"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700598 depends on NET_ACT_GACT
599 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100600 Say Y here to use the generic action randomly or deterministically.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700601
602config NET_ACT_MIRRED
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100603 tristate "Redirecting and Mirroring"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604 depends on NET_CLS_ACT
605 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100606 Say Y here to allow packets to be mirrored or redirected to
607 other devices.
608
609 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800610 module will be called act_mirred.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700611
612config NET_ACT_IPT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100613 tristate "IPtables targets"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700614 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
615 ---help---
Matt LaPlante3539c272006-06-30 18:53:46 +0200616 Say Y here to be able to invoke iptables targets after successful
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100617 classification.
618
619 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800620 module will be called act_ipt.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700621
Herbert Xub4219952007-09-27 12:48:05 -0700622config NET_ACT_NAT
623 tristate "Stateless NAT"
624 depends on NET_CLS_ACT
Herbert Xub4219952007-09-27 12:48:05 -0700625 ---help---
626 Say Y here to do stateless NAT on IPv4 packets. You should use
627 netfilter for NAT unless you know what you are doing.
628
629 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800630 module will be called act_nat.
Herbert Xub4219952007-09-27 12:48:05 -0700631
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632config NET_ACT_PEDIT
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100633 tristate "Packet Editing"
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634 depends on NET_CLS_ACT
635 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100636 Say Y here if you want to mangle the content of packets.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700637
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100638 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800639 module will be called act_pedit.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700641config NET_ACT_SIMP
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100642 tristate "Simple Example (Debug)"
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700643 depends on NET_CLS_ACT
644 ---help---
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100645 Say Y here to add a simple action for demonstration purposes.
646 It is meant as an example and for debugging purposes. It will
647 print a configured policy string followed by the packet count
648 to the console for every packet that passes by.
Jamal Hadi Salimdb753072005-04-24 20:10:16 -0700649
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100650 If unsure, say N.
651
652 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800653 module will be called act_simple.
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100654
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700655config NET_ACT_SKBEDIT
656 tristate "SKB Editing"
657 depends on NET_CLS_ACT
658 ---help---
659 Say Y here to change skb priority or queue_mapping settings.
660
661 If unsure, say N.
662
663 To compile this code as a module, choose M here: the
Jan Luebbed4ae20b2010-02-08 22:41:44 -0800664 module will be called act_skbedit.
Alexander Duyckca9b0e22008-09-12 16:30:20 -0700665
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000666config NET_ACT_CSUM
667 tristate "Checksum Updating"
David S. Miller7abac682010-08-23 20:42:11 -0700668 depends on NET_CLS_ACT && INET
Grégoire Baroneb4d4062010-08-18 13:10:35 +0000669 ---help---
670 Say Y here to update some common checksum after some direct
671 packet alterations.
672
673 To compile this code as a module, choose M here: the
674 module will be called act_csum.
675
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100676config NET_CLS_IND
677 bool "Incoming device classification"
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800678 depends on NET_CLS_U32 || NET_CLS_FW
Thomas Graf52ab4ac2005-11-01 15:13:02 +0100679 ---help---
680 Say Y here to extend the u32 and fw classifier to support
681 classification based on the incoming device. This option is
682 likely to disappear in favour of the metadata ematch.
683
Roman Zippel05b8b0f2005-11-17 15:22:39 -0800684endif # NET_SCHED
685
Randy Dunlap85ef3e52007-10-18 21:56:38 -0700686config NET_SCH_FIFO
687 bool