2 # Traffic control configuration.
6 bool "QoS and/or fair queueing"
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
11 delay, and which ones to drop. This is the job of the queueing
12 disciplines, several different algorithms for how to do this
13 "fairly" have been proposed.
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.
24 To administer these schedulers, you'll need the user-level utilities
25 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
28 <http://www.linuxfoundation.org/collaborate/workgroups/networking/iproute2>.
30 This Quality of Service (QoS) support will enable you to use
31 Differentiated Services (diffserv) and Resource Reservation Protocol
32 (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/>.
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
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.
45 comment "Queueing/Scheduling"
48 tristate "Class Based Queueing (CBQ)"
50 Say Y here if you want to use the Class-Based Queueing (CBQ) packet
51 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.
55 See the top of <file:net/sched/sch_cbq.c> for more details.
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
59 want to use as leaf disciplines.
61 To compile this code as a module, choose M here: the
62 module will be called sch_cbq.
65 tristate "Hierarchical Token Bucket (HTB)"
67 Say Y here if you want to use the Hierarchical Token Buckets (HTB)
68 packet scheduling algorithm. See
69 <http://luxik.cdi.cz/~devik/qos/htb/> for complete manual and
72 HTB is very similar to CBQ regarding its goals however is has
73 different properties and different algorithm.
75 To compile this code as a module, choose M here: the
76 module will be called sch_htb.
79 tristate "Hierarchical Fair Service Curve (HFSC)"
81 Say Y here if you want to use the Hierarchical Fair Service Curve
82 (HFSC) packet scheduling algorithm.
84 To compile this code as a module, choose M here: the
85 module will be called sch_hfsc.
88 tristate "ATM Virtual Circuits (ATM)"
91 Say Y here if you want to use the ATM pseudo-scheduler. This
92 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.
96 See the top of <file:net/sched/sch_atm.c> for more details.
98 To compile this code as a module, choose M here: the
99 module will be called sch_atm.
102 tristate "Multi Band Priority Queueing (PRIO)"
104 Say Y here if you want to use an n-band priority queue packet
107 To compile this code as a module, choose M here: the
108 module will be called sch_prio.
110 config NET_SCH_MULTIQ
111 tristate "Hardware Multiqueue-aware Multi Band Queuing (MULTIQ)"
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.
116 To compile this code as a module, choose M here: the
117 module will be called sch_multiq.
120 tristate "Random Early Detection (RED)"
122 Say Y here if you want to use the Random Early Detection (RED)
123 packet scheduling algorithm.
125 See the top of <file:net/sched/sch_red.c> for more details.
127 To compile this code as a module, choose M here: the
128 module will be called sch_red.
131 tristate "Stochastic Fair Blue (SFB)"
133 Say Y here if you want to use the Stochastic Fair Blue (SFB)
134 packet scheduling algorithm.
136 See the top of <file:net/sched/sch_sfb.c> for more details.
138 To compile this code as a module, choose M here: the
139 module will be called sch_sfb.
142 tristate "Stochastic Fairness Queueing (SFQ)"
144 Say Y here if you want to use the Stochastic Fairness Queueing (SFQ)
145 packet scheduling algorithm.
147 See the top of <file:net/sched/sch_sfq.c> for more details.
149 To compile this code as a module, choose M here: the
150 module will be called sch_sfq.
153 tristate "True Link Equalizer (TEQL)"
155 Say Y here if you want to use the True Link Equalizer (TLE) packet
156 scheduling algorithm. This queueing discipline allows the combination
157 of several physical devices into one virtual device.
159 See the top of <file:net/sched/sch_teql.c> for more details.
161 To compile this code as a module, choose M here: the
162 module will be called sch_teql.
165 tristate "Token Bucket Filter (TBF)"
167 Say Y here if you want to use the Token Bucket Filter (TBF) packet
168 scheduling algorithm.
170 See the top of <file:net/sched/sch_tbf.c> for more details.
172 To compile this code as a module, choose M here: the
173 module will be called sch_tbf.
176 tristate "Credit Based Shaper (CBS)"
178 Say Y here if you want to use the Credit Based Shaper (CBS) packet
179 scheduling algorithm.
181 See the top of <file:net/sched/sch_cbs.c> for more details.
183 To compile this code as a module, choose M here: the
184 module will be called sch_cbs.
187 tristate "Earliest TxTime First (ETF)"
189 Say Y here if you want to use the Earliest TxTime First (ETF) packet
190 scheduling algorithm.
192 See the top of <file:net/sched/sch_etf.c> for more details.
194 To compile this code as a module, choose M here: the
195 module will be called sch_etf.
197 config NET_SCH_TAPRIO
198 tristate "Time Aware Priority (taprio) Scheduler"
200 Say Y here if you want to use the Time Aware Priority (taprio) packet
201 scheduling algorithm.
203 See the top of <file:net/sched/sch_taprio.c> for more details.
205 To compile this code as a module, choose M here: the
206 module will be called sch_taprio.
209 tristate "Generic Random Early Detection (GRED)"
211 Say Y here if you want to use the Generic Random Early Detection
212 (GRED) packet scheduling algorithm for some of your network devices
213 (see the top of <file:net/sched/sch_red.c> for details and
214 references about the algorithm).
216 To compile this code as a module, choose M here: the
217 module will be called sch_gred.
219 config NET_SCH_DSMARK
220 tristate "Differentiated Services marker (DSMARK)"
222 Say Y if you want to schedule packets according to the
223 Differentiated Services architecture proposed in RFC 2475.
224 Technical information on this method, with pointers to associated
225 RFCs, is available at <http://www.gta.ufrj.br/diffserv/>.
227 To compile this code as a module, choose M here: the
228 module will be called sch_dsmark.
231 tristate "Network emulator (NETEM)"
233 Say Y if you want to emulate network delay, loss, and packet
234 re-ordering. This is often useful to simulate networks when
235 testing applications or protocols.
237 To compile this driver as a module, choose M here: the module
238 will be called sch_netem.
243 tristate "Deficit Round Robin scheduler (DRR)"
245 Say Y here if you want to use the Deficit Round Robin (DRR) packet
246 scheduling algorithm.
248 To compile this driver as a module, choose M here: the module
249 will be called sch_drr.
253 config NET_SCH_MQPRIO
254 tristate "Multi-queue priority scheduler (MQPRIO)"
256 Say Y here if you want to use the Multi-queue Priority scheduler.
257 This scheduler allows QOS to be offloaded on NICs that have support
258 for offloading QOS schedulers.
260 To compile this driver as a module, choose M here: the module will
261 be called sch_mqprio.
265 config NET_SCH_SKBPRIO
266 tristate "SKB priority queue scheduler (SKBPRIO)"
268 Say Y here if you want to use the SKB priority queue
269 scheduler. This schedules packets according to skb->priority,
270 which is useful for request packets in DoS mitigation systems such
273 To compile this driver as a module, choose M here: the module will
274 be called sch_skbprio.
279 tristate "CHOose and Keep responsive flow scheduler (CHOKE)"
281 Say Y here if you want to use the CHOKe packet scheduler (CHOose
282 and Keep for responsive flows, CHOose and Kill for unresponsive
283 flows). This is a variation of RED which trys to penalize flows
284 that monopolize the queue.
286 To compile this code as a module, choose M here: the
287 module will be called sch_choke.
290 tristate "Quick Fair Queueing scheduler (QFQ)"
292 Say Y here if you want to use the Quick Fair Queueing Scheduler (QFQ)
293 packet scheduling algorithm.
295 To compile this driver as a module, choose M here: the module
296 will be called sch_qfq.
301 tristate "Controlled Delay AQM (CODEL)"
303 Say Y here if you want to use the Controlled Delay (CODEL)
304 packet scheduling algorithm.
306 To compile this driver as a module, choose M here: the module
307 will be called sch_codel.
311 config NET_SCH_FQ_CODEL
312 tristate "Fair Queue Controlled Delay AQM (FQ_CODEL)"
314 Say Y here if you want to use the FQ Controlled Delay (FQ_CODEL)
315 packet scheduling algorithm.
317 To compile this driver as a module, choose M here: the module
318 will be called sch_fq_codel.
323 tristate "Common Applications Kept Enhanced (CAKE)"
325 Say Y here if you want to use the Common Applications Kept Enhanced
326 (CAKE) queue management algorithm.
328 To compile this driver as a module, choose M here: the module
329 will be called sch_cake.
334 tristate "Fair Queue"
336 Say Y here if you want to use the FQ packet scheduling algorithm.
338 FQ does flow separation, and is able to respect pacing requirements
339 set by TCP stack into sk->sk_pacing_rate (for localy generated
342 To compile this driver as a module, choose M here: the module
343 will be called sch_fq.
348 tristate "Heavy-Hitter Filter (HHF)"
350 Say Y here if you want to use the Heavy-Hitter Filter (HHF)
351 packet scheduling algorithm.
353 To compile this driver as a module, choose M here: the module
354 will be called sch_hhf.
357 tristate "Proportional Integral controller Enhanced (PIE) scheduler"
359 Say Y here if you want to use the Proportional Integral controller
360 Enhanced scheduler packet scheduling algorithm.
361 For more information, please see
362 http://tools.ietf.org/html/draft-pan-tsvwg-pie-00
364 To compile this driver as a module, choose M here: the module
365 will be called sch_pie.
369 config NET_SCH_INGRESS
370 tristate "Ingress/classifier-action Qdisc"
371 depends on NET_CLS_ACT
375 Say Y here if you want to use classifiers for incoming and/or outgoing
376 packets. This qdisc doesn't do anything else besides running classifiers,
377 which can also have actions attached to them. In case of outgoing packets,
378 classifiers that this qdisc holds are executed in the transmit path
379 before real enqueuing to an egress qdisc happens.
383 To compile this code as a module, choose M here: the module will be
384 called sch_ingress with alias of sch_clsact.
387 tristate "Plug network traffic until release (PLUG)"
390 This queuing discipline allows userspace to plug/unplug a network
391 output queue, using the netlink interface. When it receives an
392 enqueue command it inserts a plug into the outbound queue that
393 causes following packets to enqueue until a dequeue command arrives
394 over netlink, causing the plug to be removed and resuming the normal
397 This module also provides a generic "network output buffering"
398 functionality (aka output commit), wherein upon arrival of a dequeue
399 command, only packets up to the first plug are released for delivery.
400 The Remus HA project uses this module to enable speculative execution
401 of virtual machines by allowing the generated network output to be rolled
404 For more information, please refer to <http://wiki.xenproject.org/wiki/Remus>
406 Say Y here if you are using this kernel for Xen dom0 and
407 want to protect Xen guests with Remus.
409 To compile this code as a module, choose M here: the
410 module will be called sch_plug.
412 menuconfig NET_SCH_DEFAULT
413 bool "Allow override default queue discipline"
415 Support for selection of default queuing discipline.
417 Nearly all users can safely say no here, and the default
418 of pfifo_fast will be used. Many distributions already set
419 the default value via /proc/sys/net/core/default_qdisc.
426 prompt "Default queuing discipline"
427 default DEFAULT_PFIFO_FAST
429 Select the queueing discipline that will be used by default
430 for all network devices.
433 bool "Fair Queue" if NET_SCH_FQ
436 bool "Controlled Delay" if NET_SCH_CODEL
438 config DEFAULT_FQ_CODEL
439 bool "Fair Queue Controlled Delay" if NET_SCH_FQ_CODEL
442 bool "Stochastic Fair Queue" if NET_SCH_SFQ
444 config DEFAULT_PFIFO_FAST
445 bool "Priority FIFO Fast"
448 config DEFAULT_NET_SCH
450 default "pfifo_fast" if DEFAULT_PFIFO_FAST
451 default "fq" if DEFAULT_FQ
452 default "fq_codel" if DEFAULT_FQ_CODEL
453 default "sfq" if DEFAULT_SFQ
457 comment "Classification"
463 tristate "Elementary classification (BASIC)"
466 Say Y here if you want to be able to classify packets using
467 only extended matches and actions.
469 To compile this code as a module, choose M here: the
470 module will be called cls_basic.
472 config NET_CLS_TCINDEX
473 tristate "Traffic-Control Index (TCINDEX)"
476 Say Y here if you want to be able to classify packets based on
477 traffic control indices. You will want this feature if you want
478 to implement Differentiated Services together with DSMARK.
480 To compile this code as a module, choose M here: the
481 module will be called cls_tcindex.
483 config NET_CLS_ROUTE4
484 tristate "Routing decision (ROUTE)"
486 select IP_ROUTE_CLASSID
489 If you say Y here, you will be able to classify packets
490 according to the route table entry they matched.
492 To compile this code as a module, choose M here: the
493 module will be called cls_route.
496 tristate "Netfilter mark (FW)"
499 If you say Y here, you will be able to classify packets
500 according to netfilter/firewall marks.
502 To compile this code as a module, choose M here: the
503 module will be called cls_fw.
506 tristate "Universal 32bit comparisons w/ hashing (U32)"
509 Say Y here to be able to classify packets using a universal
510 32bit pieces based comparison scheme.
512 To compile this code as a module, choose M here: the
513 module will be called cls_u32.
516 bool "Performance counters support"
517 depends on NET_CLS_U32
519 Say Y here to make u32 gather additional statistics useful for
520 fine tuning u32 classifiers.
523 bool "Netfilter marks support"
524 depends on NET_CLS_U32
526 Say Y here to be able to use netfilter marks as u32 key.
529 tristate "IPv4 Resource Reservation Protocol (RSVP)"
532 The Resource Reservation Protocol (RSVP) permits end systems to
533 request a minimum and maximum data flow rate for a connection; this
534 is important for real time data such as streaming sound or video.
536 Say Y here if you want to be able to classify outgoing packets based
537 on their RSVP requests.
539 To compile this code as a module, choose M here: the
540 module will be called cls_rsvp.
543 tristate "IPv6 Resource Reservation Protocol (RSVP6)"
546 The Resource Reservation Protocol (RSVP) permits end systems to
547 request a minimum and maximum data flow rate for a connection; this
548 is important for real time data such as streaming sound or video.
550 Say Y here if you want to be able to classify outgoing packets based
551 on their RSVP requests and you are using the IPv6 protocol.
553 To compile this code as a module, choose M here: the
554 module will be called cls_rsvp6.
557 tristate "Flow classifier"
560 If you say Y here, you will be able to classify packets based on
561 a configurable combination of packet keys. This is mostly useful
562 in combination with SFQ.
564 To compile this code as a module, choose M here: the
565 module will be called cls_flow.
567 config NET_CLS_CGROUP
568 tristate "Control Group Classifier"
570 select CGROUP_NET_CLASSID
573 Say Y here if you want to classify packets based on the control
574 cgroup of their process.
576 To compile this code as a module, choose M here: the
577 module will be called cls_cgroup.
580 tristate "BPF-based classifier"
583 If you say Y here, you will be able to classify packets based on
584 programmable BPF (JIT'ed) filters as an alternative to ematches.
586 To compile this code as a module, choose M here: the module will
589 config NET_CLS_FLOWER
590 tristate "Flower classifier"
593 If you say Y here, you will be able to classify packets based on
594 a configurable combination of packet keys and masks.
596 To compile this code as a module, choose M here: the module will
597 be called cls_flower.
599 config NET_CLS_MATCHALL
600 tristate "Match-all classifier"
603 If you say Y here, you will be able to classify packets based on
604 nothing. Every packet will match.
606 To compile this code as a module, choose M here: the module will
607 be called cls_matchall.
610 bool "Extended Matches"
613 Say Y here if you want to use extended matches on top of classifiers
614 and select the extended matches below.
616 Extended matches are small classification helpers not worth writing
617 a separate classifier for.
619 A recent version of the iproute2 package is required to use
622 config NET_EMATCH_STACK
624 depends on NET_EMATCH
627 Size of the local stack variable used while evaluating the tree of
628 ematches. Limits the depth of the tree, i.e. the number of
629 encapsulated precedences. Every level requires 4 bytes of additional
632 config NET_EMATCH_CMP
633 tristate "Simple packet data comparison"
634 depends on NET_EMATCH
636 Say Y here if you want to be able to classify packets based on
637 simple packet data comparisons for 8, 16, and 32bit values.
639 To compile this code as a module, choose M here: the
640 module will be called em_cmp.
642 config NET_EMATCH_NBYTE
643 tristate "Multi byte comparison"
644 depends on NET_EMATCH
646 Say Y here if you want to be able to classify packets based on
647 multiple byte comparisons mainly useful for IPv6 address comparisons.
649 To compile this code as a module, choose M here: the
650 module will be called em_nbyte.
652 config NET_EMATCH_U32
654 depends on NET_EMATCH
656 Say Y here if you want to be able to classify packets using
657 the famous u32 key in combination with logic relations.
659 To compile this code as a module, choose M here: the
660 module will be called em_u32.
662 config NET_EMATCH_META
664 depends on NET_EMATCH
666 Say Y here if you want to be able to classify packets based on
667 metadata such as load average, netfilter attributes, socket
668 attributes and routing decisions.
670 To compile this code as a module, choose M here: the
671 module will be called em_meta.
673 config NET_EMATCH_TEXT
674 tristate "Textsearch"
675 depends on NET_EMATCH
677 select TEXTSEARCH_KMP
679 select TEXTSEARCH_FSM
681 Say Y here if you want to be able to classify packets based on
682 textsearch comparisons.
684 To compile this code as a module, choose M here: the
685 module will be called em_text.
687 config NET_EMATCH_CANID
688 tristate "CAN Identifier"
689 depends on NET_EMATCH && (CAN=y || CAN=m)
691 Say Y here if you want to be able to classify CAN frames based
694 To compile this code as a module, choose M here: the
695 module will be called em_canid.
697 config NET_EMATCH_IPSET
699 depends on NET_EMATCH && IP_SET
701 Say Y here if you want to be able to classify packets based on
704 To compile this code as a module, choose M here: the
705 module will be called em_ipset.
707 config NET_EMATCH_IPT
708 tristate "IPtables Matches"
709 depends on NET_EMATCH && NETFILTER && NETFILTER_XTABLES
711 Say Y here to be able to classify packets based on iptables
713 Current supported match is "policy" which allows packet classification
714 based on IPsec policy that was used during decapsulation
716 To compile this code as a module, choose M here: the
717 module will be called em_ipt.
723 Say Y here if you want to use traffic control actions. Actions
724 get attached to classifiers and are invoked after a successful
725 classification. They are used to overwrite the classification
726 result, instantly drop or redirect packets, etc.
728 A recent version of the iproute2 package is required to use
731 config NET_ACT_POLICE
732 tristate "Traffic Policing"
733 depends on NET_CLS_ACT
735 Say Y here if you want to do traffic policing, i.e. strict
736 bandwidth limiting. This action replaces the existing policing
739 To compile this code as a module, choose M here: the
740 module will be called act_police.
743 tristate "Generic actions"
744 depends on NET_CLS_ACT
746 Say Y here to take generic actions such as dropping and
749 To compile this code as a module, choose M here: the
750 module will be called act_gact.
753 bool "Probability support"
754 depends on NET_ACT_GACT
756 Say Y here to use the generic action randomly or deterministically.
758 config NET_ACT_MIRRED
759 tristate "Redirecting and Mirroring"
760 depends on NET_CLS_ACT
762 Say Y here to allow packets to be mirrored or redirected to
765 To compile this code as a module, choose M here: the
766 module will be called act_mirred.
768 config NET_ACT_SAMPLE
769 tristate "Traffic Sampling"
770 depends on NET_CLS_ACT
773 Say Y here to allow packet sampling tc action. The packet sample
774 action consists of statistically choosing packets and sampling
775 them using the psample module.
777 To compile this code as a module, choose M here: the
778 module will be called act_sample.
781 tristate "IPtables targets"
782 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
784 Say Y here to be able to invoke iptables targets after successful
787 To compile this code as a module, choose M here: the
788 module will be called act_ipt.
791 tristate "Stateless NAT"
792 depends on NET_CLS_ACT
794 Say Y here to do stateless NAT on IPv4 packets. You should use
795 netfilter for NAT unless you know what you are doing.
797 To compile this code as a module, choose M here: the
798 module will be called act_nat.
801 tristate "Packet Editing"
802 depends on NET_CLS_ACT
804 Say Y here if you want to mangle the content of packets.
806 To compile this code as a module, choose M here: the
807 module will be called act_pedit.
810 tristate "Simple Example (Debug)"
811 depends on NET_CLS_ACT
813 Say Y here to add a simple action for demonstration purposes.
814 It is meant as an example and for debugging purposes. It will
815 print a configured policy string followed by the packet count
816 to the console for every packet that passes by.
820 To compile this code as a module, choose M here: the
821 module will be called act_simple.
823 config NET_ACT_SKBEDIT
824 tristate "SKB Editing"
825 depends on NET_CLS_ACT
827 Say Y here to change skb priority or queue_mapping settings.
831 To compile this code as a module, choose M here: the
832 module will be called act_skbedit.
835 tristate "Checksum Updating"
836 depends on NET_CLS_ACT && INET
839 Say Y here to update some common checksum after some direct
842 To compile this code as a module, choose M here: the
843 module will be called act_csum.
846 tristate "Vlan manipulation"
847 depends on NET_CLS_ACT
849 Say Y here to push or pop vlan headers.
853 To compile this code as a module, choose M here: the
854 module will be called act_vlan.
857 tristate "BPF based action"
858 depends on NET_CLS_ACT
860 Say Y here to execute BPF code on packets. The BPF code will decide
861 if the packet should be dropped or not.
865 To compile this code as a module, choose M here: the
866 module will be called act_bpf.
868 config NET_ACT_CONNMARK
869 tristate "Netfilter Connection Mark Retriever"
870 depends on NET_CLS_ACT && NETFILTER && IP_NF_IPTABLES
871 depends on NF_CONNTRACK && NF_CONNTRACK_MARK
873 Say Y here to allow retrieving of conn mark
877 To compile this code as a module, choose M here: the
878 module will be called act_connmark.
880 config NET_ACT_SKBMOD
881 tristate "skb data modification action"
882 depends on NET_CLS_ACT
884 Say Y here to allow modification of skb data
888 To compile this code as a module, choose M here: the
889 module will be called act_skbmod.
892 tristate "Inter-FE action based on IETF ForCES InterFE LFB"
893 depends on NET_CLS_ACT
896 Say Y here to allow for sourcing and terminating metadata
897 For details refer to netdev01 paper:
898 "Distributing Linux Traffic Control Classifier-Action Subsystem"
899 Authors: Jamal Hadi Salim and Damascene M. Joachimpillai
901 To compile this code as a module, choose M here: the
902 module will be called act_ife.
904 config NET_ACT_TUNNEL_KEY
905 tristate "IP tunnel metadata manipulation"
906 depends on NET_CLS_ACT
908 Say Y here to set/release ip tunnel metadata.
912 To compile this code as a module, choose M here: the
913 module will be called act_tunnel_key.
915 config NET_IFE_SKBMARK
916 tristate "Support to encoding decoding skb mark on IFE action"
917 depends on NET_ACT_IFE
919 config NET_IFE_SKBPRIO
920 tristate "Support to encoding decoding skb prio on IFE action"
921 depends on NET_ACT_IFE
923 config NET_IFE_SKBTCINDEX
924 tristate "Support to encoding decoding skb tcindex on IFE action"
925 depends on NET_ACT_IFE
928 bool "Incoming device classification"
929 depends on NET_CLS_U32 || NET_CLS_FW
931 Say Y here to extend the u32 and fw classifier to support
932 classification based on the incoming device. This option is
933 likely to disappear in favour of the metadata ematch.