Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | # |
| 2 | # Traffic control configuration. |
| 3 | # |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 4 | |
Randy Dunlap | 85ef3e5 | 2007-10-18 21:56:38 -0700 | [diff] [blame] | 5 | menuconfig NET_SCHED |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 6 | bool "QoS and/or fair queueing" |
David Kimdon | 3c62f75 | 2006-11-09 16:16:21 -0800 | [diff] [blame] | 7 | select NET_SCH_FIFO |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 8 | ---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 Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 11 | delay, and which ones to drop. This is the job of the queueing |
| 12 | disciplines, several different algorithms for how to do this |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 13 | "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 Witten | c996d8b | 2010-11-15 19:55:34 +0000 | [diff] [blame] | 27 | <http://www.linuxfoundation.org/collaborate/workgroups/networking/iproute2>. |
Sam Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 28 | |
| 29 | This Quality of Service (QoS) support will enable you to use |
| 30 | Differentiated Services (diffserv) and Resource Reservation Protocol |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 31 | (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 Ravnborg | 6a2e9b7 | 2005-07-11 21:13:56 -0700 | [diff] [blame] | 34 | |
| 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 Zippel | 05b8b0f | 2005-11-17 15:22:39 -0800 | [diff] [blame] | 42 | if NET_SCHED |
| 43 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 44 | comment "Queueing/Scheduling" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 45 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 46 | config NET_SCH_CBQ |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 47 | tristate "Class Based Queueing (CBQ)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 48 | ---help--- |
| 49 | Say Y here if you want to use the Class-Based Queueing (CBQ) packet |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 50 | 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 Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 53 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 54 | See the top of <file:net/sched/sch_cbq.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 55 | |
| 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 Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 58 | want to use as leaf disciplines. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 59 | |
| 60 | To compile this code as a module, choose M here: the |
| 61 | module will be called sch_cbq. |
| 62 | |
| 63 | config NET_SCH_HTB |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 64 | tristate "Hierarchical Token Bucket (HTB)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 65 | ---help--- |
| 66 | Say Y here if you want to use the Hierarchical Token Buckets (HTB) |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 67 | packet scheduling algorithm. See |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 68 | <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and |
| 69 | in-depth articles. |
| 70 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 71 | HTB is very similar to CBQ regarding its goals however is has |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 72 | 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 | |
| 77 | config NET_SCH_HFSC |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 78 | tristate "Hierarchical Fair Service Curve (HFSC)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 79 | ---help--- |
| 80 | Say Y here if you want to use the Hierarchical Fair Service Curve |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 81 | (HFSC) packet scheduling algorithm. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 82 | |
| 83 | To compile this code as a module, choose M here: the |
| 84 | module will be called sch_hfsc. |
| 85 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 86 | config NET_SCH_ATM |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 87 | tristate "ATM Virtual Circuits (ATM)" |
Roman Zippel | 05b8b0f | 2005-11-17 15:22:39 -0800 | [diff] [blame] | 88 | depends on ATM |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 89 | ---help--- |
| 90 | Say Y here if you want to use the ATM pseudo-scheduler. This |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 91 | 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 Craciunescu | 99acaeb | 2007-07-18 02:00:04 -0700 | [diff] [blame] | 95 | See the top of <file:net/sched/sch_atm.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 96 | |
| 97 | To compile this code as a module, choose M here: the |
| 98 | module will be called sch_atm. |
| 99 | |
| 100 | config NET_SCH_PRIO |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 101 | tristate "Multi Band Priority Queueing (PRIO)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 102 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 103 | Say Y here if you want to use an n-band priority queue packet |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 104 | scheduler. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 105 | |
| 106 | To compile this code as a module, choose M here: the |
| 107 | module will be called sch_prio. |
| 108 | |
Alexander Duyck | 9265194 | 2008-09-12 16:29:34 -0700 | [diff] [blame] | 109 | config 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 Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 118 | config NET_SCH_RED |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 119 | tristate "Random Early Detection (RED)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 120 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 121 | Say Y here if you want to use the Random Early Detection (RED) |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 122 | packet scheduling algorithm. |
| 123 | |
| 124 | See the top of <file:net/sched/sch_red.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 125 | |
| 126 | To compile this code as a module, choose M here: the |
| 127 | module will be called sch_red. |
| 128 | |
Eric Dumazet | e13e02a3 | 2011-02-23 10:56:17 +0000 | [diff] [blame] | 129 | config 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 Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 140 | config NET_SCH_SFQ |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 141 | tristate "Stochastic Fairness Queueing (SFQ)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 142 | ---help--- |
| 143 | Say Y here if you want to use the Stochastic Fairness Queueing (SFQ) |
Gabriel Craciunescu | 99acaeb | 2007-07-18 02:00:04 -0700 | [diff] [blame] | 144 | packet scheduling algorithm. |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 145 | |
| 146 | See the top of <file:net/sched/sch_sfq.c> for more details. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 147 | |
| 148 | To compile this code as a module, choose M here: the |
| 149 | module will be called sch_sfq. |
| 150 | |
| 151 | config NET_SCH_TEQL |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 152 | tristate "True Link Equalizer (TEQL)" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 153 | ---help--- |
| 154 | Say Y here if you want to use the True Link Equalizer (TLE) packet |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 155 | 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 Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 159 | |
| 160 | To compile this code as a module, choose M here: the |
| 161 | module will be called sch_teql. |
| 162 | |
| 163 | config NET_SCH_TBF |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 164 | tristate "Token Bucket Filter (TBF)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 165 | ---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 Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 170 | |
| 171 | To compile this code as a module, choose M here: the |
| 172 | module will be called sch_tbf. |
| 173 | |
| 174 | config NET_SCH_GRED |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 175 | tristate "Generic Random Early Detection (GRED)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 176 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 177 | Say Y here if you want to use the Generic Random Early Detection |
Lucas Correia Villa Real | 20cc6be | 2005-05-03 14:34:20 -0700 | [diff] [blame] | 178 | (GRED) packet scheduling algorithm for some of your network devices |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 179 | (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 | |
| 185 | config NET_SCH_DSMARK |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 186 | tristate "Differentiated Services marker (DSMARK)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 187 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 188 | 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 | |
| 196 | config NET_SCH_NETEM |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 197 | tristate "Network emulator (NETEM)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 198 | ---help--- |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 199 | 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 McHardy | 13d2a1d | 2008-11-20 04:10:00 -0800 | [diff] [blame] | 208 | config 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 Fastabend | b8970f0 | 2011-01-17 08:06:09 +0000 | [diff] [blame] | 219 | config 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 hemminger | 45e1443 | 2011-02-02 15:21:10 +0000 | [diff] [blame] | 231 | config 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 hemminger | 0545a30 | 2011-04-04 05:30:58 +0000 | [diff] [blame] | 242 | config 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 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 253 | config NET_SCH_INGRESS |
| 254 | tristate "Ingress Qdisc" |
Patrick McHardy | 72eb7bd | 2008-01-31 16:57:15 -0800 | [diff] [blame] | 255 | depends on NET_CLS_ACT |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 256 | ---help--- |
| 257 | Say Y here if you want to use classifiers for incoming packets. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 258 | If unsure, say Y. |
| 259 | |
| 260 | To compile this code as a module, choose M here: the |
| 261 | module will be called sch_ingress. |
| 262 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 263 | comment "Classification" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 264 | |
| 265 | config NET_CLS |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 266 | boolean |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 267 | |
| 268 | config NET_CLS_BASIC |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 269 | tristate "Elementary classification (BASIC)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 270 | select NET_CLS |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 271 | ---help--- |
| 272 | Say Y here if you want to be able to classify packets using |
| 273 | only extended matches and actions. |
| 274 | |
| 275 | To compile this code as a module, choose M here: the |
| 276 | module will be called cls_basic. |
| 277 | |
| 278 | config NET_CLS_TCINDEX |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 279 | tristate "Traffic-Control Index (TCINDEX)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 280 | select NET_CLS |
| 281 | ---help--- |
| 282 | Say Y here if you want to be able to classify packets based on |
| 283 | traffic control indices. You will want this feature if you want |
| 284 | to implement Differentiated Services together with DSMARK. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 285 | |
| 286 | To compile this code as a module, choose M here: the |
| 287 | module will be called cls_tcindex. |
| 288 | |
| 289 | config NET_CLS_ROUTE4 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 290 | tristate "Routing decision (ROUTE)" |
Randy Dunlap | 034cfe4 | 2011-05-19 19:23:28 -0400 | [diff] [blame] | 291 | depends on INET |
Patrick McHardy | c7066f7 | 2011-01-14 13:36:42 +0100 | [diff] [blame] | 292 | select IP_ROUTE_CLASSID |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 293 | select NET_CLS |
| 294 | ---help--- |
| 295 | If you say Y here, you will be able to classify packets |
| 296 | according to the route table entry they matched. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 297 | |
| 298 | To compile this code as a module, choose M here: the |
| 299 | module will be called cls_route. |
| 300 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 301 | config NET_CLS_FW |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 302 | tristate "Netfilter mark (FW)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 303 | select NET_CLS |
| 304 | ---help--- |
| 305 | If you say Y here, you will be able to classify packets |
| 306 | according to netfilter/firewall marks. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 307 | |
| 308 | To compile this code as a module, choose M here: the |
| 309 | module will be called cls_fw. |
| 310 | |
| 311 | config NET_CLS_U32 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 312 | tristate "Universal 32bit comparisons w/ hashing (U32)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 313 | select NET_CLS |
| 314 | ---help--- |
Matt LaPlante | 3539c27 | 2006-06-30 18:53:46 +0200 | [diff] [blame] | 315 | Say Y here to be able to classify packets using a universal |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 316 | 32bit pieces based comparison scheme. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 317 | |
| 318 | To compile this code as a module, choose M here: the |
| 319 | module will be called cls_u32. |
| 320 | |
| 321 | config CLS_U32_PERF |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 322 | bool "Performance counters support" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 323 | depends on NET_CLS_U32 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 324 | ---help--- |
| 325 | Say Y here to make u32 gather additional statistics useful for |
| 326 | fine tuning u32 classifiers. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 327 | |
| 328 | config CLS_U32_MARK |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 329 | bool "Netfilter marks support" |
Thomas Graf | 82e91ff | 2006-11-09 15:19:14 -0800 | [diff] [blame] | 330 | depends on NET_CLS_U32 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 331 | ---help--- |
| 332 | Say Y here to be able to use netfilter marks as u32 key. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 333 | |
| 334 | config NET_CLS_RSVP |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 335 | tristate "IPv4 Resource Reservation Protocol (RSVP)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 336 | select NET_CLS |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 337 | ---help--- |
| 338 | The Resource Reservation Protocol (RSVP) permits end systems to |
| 339 | request a minimum and maximum data flow rate for a connection; this |
| 340 | is important for real time data such as streaming sound or video. |
| 341 | |
| 342 | Say Y here if you want to be able to classify outgoing packets based |
| 343 | on their RSVP requests. |
| 344 | |
| 345 | To compile this code as a module, choose M here: the |
| 346 | module will be called cls_rsvp. |
| 347 | |
| 348 | config NET_CLS_RSVP6 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 349 | tristate "IPv6 Resource Reservation Protocol (RSVP6)" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 350 | select NET_CLS |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 351 | ---help--- |
| 352 | The Resource Reservation Protocol (RSVP) permits end systems to |
| 353 | request a minimum and maximum data flow rate for a connection; this |
| 354 | is important for real time data such as streaming sound or video. |
| 355 | |
| 356 | Say Y here if you want to be able to classify outgoing packets based |
Gabriel Craciunescu | 99acaeb | 2007-07-18 02:00:04 -0700 | [diff] [blame] | 357 | on their RSVP requests and you are using the IPv6 protocol. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 358 | |
| 359 | To compile this code as a module, choose M here: the |
| 360 | module will be called cls_rsvp6. |
| 361 | |
Patrick McHardy | e5dfb81 | 2008-01-31 18:37:42 -0800 | [diff] [blame] | 362 | config NET_CLS_FLOW |
| 363 | tristate "Flow classifier" |
| 364 | select NET_CLS |
| 365 | ---help--- |
| 366 | If you say Y here, you will be able to classify packets based on |
| 367 | a configurable combination of packet keys. This is mostly useful |
| 368 | in combination with SFQ. |
| 369 | |
| 370 | To compile this code as a module, choose M here: the |
| 371 | module will be called cls_flow. |
| 372 | |
Thomas Graf | f400923 | 2008-11-07 22:56:00 -0800 | [diff] [blame] | 373 | config NET_CLS_CGROUP |
Ben Blum | 8e039d8 | 2010-03-23 05:24:03 +0000 | [diff] [blame] | 374 | tristate "Control Group Classifier" |
Thomas Graf | f400923 | 2008-11-07 22:56:00 -0800 | [diff] [blame] | 375 | select NET_CLS |
| 376 | depends on CGROUPS |
| 377 | ---help--- |
| 378 | Say Y here if you want to classify packets based on the control |
| 379 | cgroup of their process. |
| 380 | |
Ben Blum | 8e039d8 | 2010-03-23 05:24:03 +0000 | [diff] [blame] | 381 | To compile this code as a module, choose M here: the |
| 382 | module will be called cls_cgroup. |
| 383 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 384 | config NET_EMATCH |
| 385 | bool "Extended Matches" |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 386 | select NET_CLS |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 387 | ---help--- |
| 388 | Say Y here if you want to use extended matches on top of classifiers |
| 389 | and select the extended matches below. |
| 390 | |
| 391 | Extended matches are small classification helpers not worth writing |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 392 | a separate classifier for. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 393 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 394 | A recent version of the iproute2 package is required to use |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 395 | extended matches. |
| 396 | |
| 397 | config NET_EMATCH_STACK |
| 398 | int "Stack size" |
| 399 | depends on NET_EMATCH |
| 400 | default "32" |
| 401 | ---help--- |
| 402 | Size of the local stack variable used while evaluating the tree of |
| 403 | ematches. Limits the depth of the tree, i.e. the number of |
Thomas Graf | b824979 | 2005-06-08 15:10:22 -0700 | [diff] [blame] | 404 | encapsulated precedences. Every level requires 4 bytes of additional |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 405 | stack space. |
| 406 | |
| 407 | config NET_EMATCH_CMP |
| 408 | tristate "Simple packet data comparison" |
| 409 | depends on NET_EMATCH |
| 410 | ---help--- |
| 411 | Say Y here if you want to be able to classify packets based on |
| 412 | simple packet data comparisons for 8, 16, and 32bit values. |
| 413 | |
| 414 | To compile this code as a module, choose M here: the |
| 415 | module will be called em_cmp. |
| 416 | |
| 417 | config NET_EMATCH_NBYTE |
| 418 | tristate "Multi byte comparison" |
| 419 | depends on NET_EMATCH |
| 420 | ---help--- |
| 421 | Say Y here if you want to be able to classify packets based on |
| 422 | multiple byte comparisons mainly useful for IPv6 address comparisons. |
| 423 | |
| 424 | To compile this code as a module, choose M here: the |
| 425 | module will be called em_nbyte. |
| 426 | |
| 427 | config NET_EMATCH_U32 |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 428 | tristate "U32 key" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 429 | depends on NET_EMATCH |
| 430 | ---help--- |
| 431 | Say Y here if you want to be able to classify packets using |
| 432 | the famous u32 key in combination with logic relations. |
| 433 | |
| 434 | To compile this code as a module, choose M here: the |
| 435 | module will be called em_u32. |
| 436 | |
| 437 | config NET_EMATCH_META |
| 438 | tristate "Metadata" |
| 439 | depends on NET_EMATCH |
| 440 | ---help--- |
Adrian Bunk | bb7e8c5 | 2006-01-11 16:40:30 -0800 | [diff] [blame] | 441 | Say Y here if you want to be able to classify packets based on |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 442 | metadata such as load average, netfilter attributes, socket |
| 443 | attributes and routing decisions. |
| 444 | |
| 445 | To compile this code as a module, choose M here: the |
| 446 | module will be called em_meta. |
| 447 | |
Thomas Graf | d675c98 | 2005-06-23 21:00:58 -0700 | [diff] [blame] | 448 | config NET_EMATCH_TEXT |
| 449 | tristate "Textsearch" |
| 450 | depends on NET_EMATCH |
David S. Miller | f2d368f | 2005-06-23 23:55:41 -0700 | [diff] [blame] | 451 | select TEXTSEARCH |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 452 | select TEXTSEARCH_KMP |
David S. Miller | 29cb9f9 | 2005-08-25 16:23:11 -0700 | [diff] [blame] | 453 | select TEXTSEARCH_BM |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 454 | select TEXTSEARCH_FSM |
Thomas Graf | d675c98 | 2005-06-23 21:00:58 -0700 | [diff] [blame] | 455 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 456 | Say Y here if you want to be able to classify packets based on |
David S. Miller | f770434 | 2005-06-24 17:39:03 -0700 | [diff] [blame] | 457 | textsearch comparisons. |
Thomas Graf | d675c98 | 2005-06-23 21:00:58 -0700 | [diff] [blame] | 458 | |
| 459 | To compile this code as a module, choose M here: the |
| 460 | module will be called em_text. |
| 461 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 462 | config NET_CLS_ACT |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 463 | bool "Actions" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 464 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 465 | Say Y here if you want to use traffic control actions. Actions |
| 466 | get attached to classifiers and are invoked after a successful |
| 467 | classification. They are used to overwrite the classification |
| 468 | result, instantly drop or redirect packets, etc. |
| 469 | |
| 470 | A recent version of the iproute2 package is required to use |
| 471 | extended matches. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 472 | |
| 473 | config NET_ACT_POLICE |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 474 | tristate "Traffic Policing" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 475 | depends on NET_CLS_ACT |
| 476 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 477 | Say Y here if you want to do traffic policing, i.e. strict |
| 478 | bandwidth limiting. This action replaces the existing policing |
| 479 | module. |
| 480 | |
| 481 | To compile this code as a module, choose M here: the |
Jan Luebbe | d4ae20b | 2010-02-08 22:41:44 -0800 | [diff] [blame] | 482 | module will be called act_police. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 483 | |
| 484 | config NET_ACT_GACT |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 485 | tristate "Generic actions" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 486 | depends on NET_CLS_ACT |
| 487 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 488 | Say Y here to take generic actions such as dropping and |
| 489 | accepting packets. |
| 490 | |
| 491 | To compile this code as a module, choose M here: the |
Jan Luebbe | d4ae20b | 2010-02-08 22:41:44 -0800 | [diff] [blame] | 492 | module will be called act_gact. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 493 | |
| 494 | config GACT_PROB |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 495 | bool "Probability support" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 496 | depends on NET_ACT_GACT |
| 497 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 498 | Say Y here to use the generic action randomly or deterministically. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 499 | |
| 500 | config NET_ACT_MIRRED |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 501 | tristate "Redirecting and Mirroring" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 502 | depends on NET_CLS_ACT |
| 503 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 504 | Say Y here to allow packets to be mirrored or redirected to |
| 505 | other devices. |
| 506 | |
| 507 | To compile this code as a module, choose M here: the |
Jan Luebbe | d4ae20b | 2010-02-08 22:41:44 -0800 | [diff] [blame] | 508 | module will be called act_mirred. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 509 | |
| 510 | config NET_ACT_IPT |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 511 | tristate "IPtables targets" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 512 | depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES |
| 513 | ---help--- |
Matt LaPlante | 3539c27 | 2006-06-30 18:53:46 +0200 | [diff] [blame] | 514 | Say Y here to be able to invoke iptables targets after successful |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 515 | classification. |
| 516 | |
| 517 | To compile this code as a module, choose M here: the |
Jan Luebbe | d4ae20b | 2010-02-08 22:41:44 -0800 | [diff] [blame] | 518 | module will be called act_ipt. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 519 | |
Herbert Xu | b421995 | 2007-09-27 12:48:05 -0700 | [diff] [blame] | 520 | config NET_ACT_NAT |
| 521 | tristate "Stateless NAT" |
| 522 | depends on NET_CLS_ACT |
Herbert Xu | b421995 | 2007-09-27 12:48:05 -0700 | [diff] [blame] | 523 | ---help--- |
| 524 | Say Y here to do stateless NAT on IPv4 packets. You should use |
| 525 | netfilter for NAT unless you know what you are doing. |
| 526 | |
| 527 | To compile this code as a module, choose M here: the |
Jan Luebbe | d4ae20b | 2010-02-08 22:41:44 -0800 | [diff] [blame] | 528 | module will be called act_nat. |
Herbert Xu | b421995 | 2007-09-27 12:48:05 -0700 | [diff] [blame] | 529 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 530 | config NET_ACT_PEDIT |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 531 | tristate "Packet Editing" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 532 | depends on NET_CLS_ACT |
| 533 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 534 | Say Y here if you want to mangle the content of packets. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 535 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 536 | To compile this code as a module, choose M here: the |
Jan Luebbe | d4ae20b | 2010-02-08 22:41:44 -0800 | [diff] [blame] | 537 | module will be called act_pedit. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 538 | |
Jamal Hadi Salim | db75307 | 2005-04-24 20:10:16 -0700 | [diff] [blame] | 539 | config NET_ACT_SIMP |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 540 | tristate "Simple Example (Debug)" |
Jamal Hadi Salim | db75307 | 2005-04-24 20:10:16 -0700 | [diff] [blame] | 541 | depends on NET_CLS_ACT |
| 542 | ---help--- |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 543 | Say Y here to add a simple action for demonstration purposes. |
| 544 | It is meant as an example and for debugging purposes. It will |
| 545 | print a configured policy string followed by the packet count |
| 546 | to the console for every packet that passes by. |
Jamal Hadi Salim | db75307 | 2005-04-24 20:10:16 -0700 | [diff] [blame] | 547 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 548 | If unsure, say N. |
| 549 | |
| 550 | To compile this code as a module, choose M here: the |
Jan Luebbe | d4ae20b | 2010-02-08 22:41:44 -0800 | [diff] [blame] | 551 | module will be called act_simple. |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 552 | |
Alexander Duyck | ca9b0e2 | 2008-09-12 16:30:20 -0700 | [diff] [blame] | 553 | config NET_ACT_SKBEDIT |
| 554 | tristate "SKB Editing" |
| 555 | depends on NET_CLS_ACT |
| 556 | ---help--- |
| 557 | Say Y here to change skb priority or queue_mapping settings. |
| 558 | |
| 559 | If unsure, say N. |
| 560 | |
| 561 | To compile this code as a module, choose M here: the |
Jan Luebbe | d4ae20b | 2010-02-08 22:41:44 -0800 | [diff] [blame] | 562 | module will be called act_skbedit. |
Alexander Duyck | ca9b0e2 | 2008-09-12 16:30:20 -0700 | [diff] [blame] | 563 | |
Grégoire Baron | eb4d406 | 2010-08-18 13:10:35 +0000 | [diff] [blame] | 564 | config NET_ACT_CSUM |
| 565 | tristate "Checksum Updating" |
David S. Miller | 7abac68 | 2010-08-23 20:42:11 -0700 | [diff] [blame] | 566 | depends on NET_CLS_ACT && INET |
Grégoire Baron | eb4d406 | 2010-08-18 13:10:35 +0000 | [diff] [blame] | 567 | ---help--- |
| 568 | Say Y here to update some common checksum after some direct |
| 569 | packet alterations. |
| 570 | |
| 571 | To compile this code as a module, choose M here: the |
| 572 | module will be called act_csum. |
| 573 | |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 574 | config NET_CLS_IND |
| 575 | bool "Incoming device classification" |
Roman Zippel | 05b8b0f | 2005-11-17 15:22:39 -0800 | [diff] [blame] | 576 | depends on NET_CLS_U32 || NET_CLS_FW |
Thomas Graf | 52ab4ac | 2005-11-01 15:13:02 +0100 | [diff] [blame] | 577 | ---help--- |
| 578 | Say Y here to extend the u32 and fw classifier to support |
| 579 | classification based on the incoming device. This option is |
| 580 | likely to disappear in favour of the metadata ematch. |
| 581 | |
Roman Zippel | 05b8b0f | 2005-11-17 15:22:39 -0800 | [diff] [blame] | 582 | endif # NET_SCHED |
| 583 | |
Randy Dunlap | 85ef3e5 | 2007-10-18 21:56:38 -0700 | [diff] [blame] | 584 | config NET_SCH_FIFO |
| 585 | bool |