2 * Copyright (c) 2008 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * $DragonFly: src/sys/net/altq/altq_fairq.c,v 1.2 2008/05/14 11:59:23 sephe Exp $
37 * Matt: I gutted altq_priq.c and used it as a skeleton on which to build
38 * fairq. The fairq algorithm is completely different then priq, of course,
39 * but because I used priq's skeleton I believe I should include priq's
42 * Copyright (C) 2000-2003
43 * Sony Computer Science Laboratories Inc. All rights reserved.
45 * Redistribution and use in source and binary forms, with or without
46 * modification, are permitted provided that the following conditions
48 * 1. Redistributions of source code must retain the above copyright
49 * notice, this list of conditions and the following disclaimer.
50 * 2. Redistributions in binary form must reproduce the above copyright
51 * notice, this list of conditions and the following disclaimer in the
52 * documentation and/or other materials provided with the distribution.
54 * THIS SOFTWARE IS PROVIDED BY SONY CSL AND CONTRIBUTORS ``AS IS'' AND
55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57 * ARE DISCLAIMED. IN NO EVENT SHALL SONY CSL OR CONTRIBUTORS BE LIABLE
58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
68 * FAIRQ - take traffic classified by keep state (hashed into
69 * pf->state_hash) and bucketize it. Fairly extract
70 * the first packet from each bucket in a round-robin fashion.
72 * TODO - better overall qlimit support (right now it is per-bucket).
73 * - NOTE: red etc is per bucket, not overall.
74 * - better service curve support.
78 * altq on em0 fairq bandwidth 650Kb queue { std, bulk }
79 * queue std priority 3 bandwidth 200Kb \
80 * fairq (buckets 64, default, hogs 1Kb) qlimit 50
81 * queue bulk priority 2 bandwidth 100Kb \
82 * fairq (buckets 64, hogs 1Kb) qlimit 50
84 * NOTE: When the aggregate bandwidth is less than the link bandwidth
85 * any remaining bandwidth is dynamically assigned using the
86 * existing bandwidth specs as weightings.
88 * pass out on em0 from any to any keep state queue std
89 * pass out on em0 inet proto tcp ..... port ... keep state queue bulk
93 #include "opt_inet6.h"
95 #ifdef ALTQ_FAIRQ /* fairq is enabled in the kernel conf */
97 #include <sys/param.h>
98 #include <sys/malloc.h>
100 #include <sys/socket.h>
101 #include <sys/sockio.h>
102 #include <sys/systm.h>
103 #include <sys/proc.h>
104 #include <sys/errno.h>
105 #include <sys/kernel.h>
106 #include <sys/queue.h>
107 #include <sys/thread.h>
110 #include <net/ifq_var.h>
111 #include <netinet/in.h>
113 #include <net/pf/pfvar.h>
114 #include <net/altq/altq.h>
115 #include <net/altq/altq_fairq.h>
117 #include <sys/thread2.h>
120 * function prototypes
122 static int fairq_clear_interface(struct fairq_if *);
123 static int fairq_request(struct ifaltq *, int, void *);
124 static void fairq_purge(struct fairq_if *);
125 static struct fairq_class *fairq_class_create(struct fairq_if *, int,
126 int, u_int, struct fairq_opts *, int);
127 static int fairq_class_destroy(struct fairq_class *);
128 static int fairq_enqueue(struct ifaltq *, struct mbuf *,
129 struct altq_pktattr *);
130 static struct mbuf *fairq_dequeue(struct ifaltq *, struct mbuf *, int);
132 static int fairq_addq(struct fairq_class *, struct mbuf *, int hash);
133 static struct mbuf *fairq_getq(struct fairq_class *, uint64_t);
134 static struct mbuf *fairq_pollq(struct fairq_class *, uint64_t, int *);
135 static fairq_bucket_t *fairq_selectq(struct fairq_class *, int);
136 static void fairq_purgeq(struct fairq_class *);
138 static void get_class_stats(struct fairq_classstats *,
139 struct fairq_class *);
140 static struct fairq_class *clh_to_clp(struct fairq_if *, uint32_t);
143 fairq_pfattach(struct pf_altq *a, struct ifaltq *ifq)
145 return altq_attach(ifq, ALTQT_FAIRQ, a->altq_disc,
146 fairq_enqueue, fairq_dequeue,
147 fairq_request, NULL, NULL);
151 fairq_add_altq(struct pf_altq *a)
153 struct fairq_if *pif;
156 if ((ifp = ifunit(a->ifname)) == NULL)
158 if (!ifq_is_ready(&ifp->if_snd))
161 pif = kmalloc(sizeof(*pif), M_ALTQ, M_WAITOK | M_ZERO);
162 pif->pif_bandwidth = a->ifbandwidth;
163 pif->pif_maxpri = -1;
164 pif->pif_ifq = &ifp->if_snd;
165 ifq_purge(&ifp->if_snd);
167 /* keep the state in pf_altq */
174 fairq_remove_altq(struct pf_altq *a)
176 struct fairq_if *pif;
178 if ((pif = a->altq_disc) == NULL)
182 fairq_clear_interface(pif);
189 fairq_add_queue_locked(struct pf_altq *a, struct fairq_if *pif)
191 struct fairq_class *cl;
193 KKASSERT(a->priority < FAIRQ_MAXPRI);
194 KKASSERT(a->qid != 0);
196 if (pif->pif_classes[a->priority] != NULL)
198 if (clh_to_clp(pif, a->qid) != NULL)
201 cl = fairq_class_create(pif, a->priority, a->qlimit, a->bandwidth,
202 &a->pq_u.fairq_opts, a->qid);
210 fairq_add_queue(struct pf_altq *a)
212 struct fairq_if *pif;
216 /* check parameters */
217 if (a->priority >= FAIRQ_MAXPRI)
222 /* XXX not MP safe */
223 if ((pif = a->altq_disc) == NULL)
228 error = fairq_add_queue_locked(a, pif);
235 fairq_remove_queue_locked(struct pf_altq *a, struct fairq_if *pif)
237 struct fairq_class *cl;
239 if ((cl = clh_to_clp(pif, a->qid)) == NULL)
242 return (fairq_class_destroy(cl));
246 fairq_remove_queue(struct pf_altq *a)
248 struct fairq_if *pif;
252 /* XXX not MP safe */
253 if ((pif = a->altq_disc) == NULL)
258 error = fairq_remove_queue_locked(a, pif);
265 fairq_getqstats(struct pf_altq *a, void *ubuf, int *nbytes)
267 struct fairq_if *pif;
268 struct fairq_class *cl;
269 struct fairq_classstats stats;
273 if (*nbytes < sizeof(stats))
276 /* XXX not MP safe */
277 if ((pif = altq_lookup(a->ifname, ALTQT_FAIRQ)) == NULL)
283 if ((cl = clh_to_clp(pif, a->qid)) == NULL) {
288 get_class_stats(&stats, cl);
292 if ((error = copyout((caddr_t)&stats, ubuf, sizeof(stats))) != 0)
294 *nbytes = sizeof(stats);
299 * bring the interface back to the initial state by discarding
300 * all the filters and classes.
303 fairq_clear_interface(struct fairq_if *pif)
305 struct fairq_class *cl;
308 /* clear out the classes */
309 for (pri = 0; pri <= pif->pif_maxpri; pri++) {
310 if ((cl = pif->pif_classes[pri]) != NULL)
311 fairq_class_destroy(cl);
318 fairq_request(struct ifaltq *ifq, int req, void *arg)
320 struct fairq_if *pif = (struct fairq_if *)ifq->altq_disc;
332 /* discard all the queued packets on the interface */
334 fairq_purge(struct fairq_if *pif)
336 struct fairq_class *cl;
339 for (pri = 0; pri <= pif->pif_maxpri; pri++) {
340 if ((cl = pif->pif_classes[pri]) != NULL && cl->cl_head)
343 if (ifq_is_enabled(pif->pif_ifq))
344 pif->pif_ifq->ifq_len = 0;
347 static struct fairq_class *
348 fairq_class_create(struct fairq_if *pif, int pri, int qlimit,
349 u_int bandwidth, struct fairq_opts *opts, int qid)
351 struct fairq_class *cl;
352 int flags = opts->flags;
353 u_int nbuckets = opts->nbuckets;
357 if (flags & FARF_RED) {
359 kprintf("fairq_class_create: RED not configured for FAIRQ!\n");
366 if (nbuckets > FAIRQ_MAX_BUCKETS)
367 nbuckets = FAIRQ_MAX_BUCKETS;
368 /* enforce power-of-2 size */
369 while ((nbuckets ^ (nbuckets - 1)) != ((nbuckets << 1) - 1))
372 if ((cl = pif->pif_classes[pri]) != NULL) {
373 /* modify the class instead of creating a new one */
379 if (cl->cl_qtype == Q_RIO)
380 rio_destroy((rio_t *)cl->cl_red);
383 if (cl->cl_qtype == Q_RED)
384 red_destroy(cl->cl_red);
387 cl = kmalloc(sizeof(*cl), M_ALTQ, M_WAITOK | M_ZERO);
388 cl->cl_nbuckets = nbuckets;
389 cl->cl_nbucket_mask = nbuckets - 1;
391 cl->cl_buckets = kmalloc(sizeof(*cl->cl_buckets) *
393 M_ALTQ, M_WAITOK | M_ZERO);
397 pif->pif_classes[pri] = cl;
398 if (flags & FARF_DEFAULTCLASS)
399 pif->pif_default = cl;
401 qlimit = 50; /* use default */
402 cl->cl_qlimit = qlimit;
403 for (i = 0; i < cl->cl_nbuckets; ++i) {
404 qlimit(&cl->cl_buckets[i].queue) = qlimit;
406 cl->cl_bandwidth = bandwidth / 8; /* cvt to bytes per second */
407 cl->cl_qtype = Q_DROPTAIL;
408 cl->cl_flags = flags & FARF_USERFLAGS;
410 if (pri > pif->pif_maxpri)
411 pif->pif_maxpri = pri;
414 cl->cl_hogs_m1 = opts->hogs_m1 / 8;
415 cl->cl_lssc_m1 = opts->lssc_m1 / 8; /* NOT YET USED */
416 cl->cl_bw_current = 0;
419 if (flags & (FARF_RED|FARF_RIO)) {
420 int red_flags, red_pkttime;
423 if (flags & FARF_ECN)
424 red_flags |= REDF_ECN;
426 if (flags & FARF_CLEARDSCP)
427 red_flags |= RIOF_CLEARDSCP;
429 if (pif->pif_bandwidth < 8)
430 red_pkttime = 1000 * 1000 * 1000; /* 1 sec */
432 red_pkttime = (int64_t)pif->pif_ifq->altq_ifp->if_mtu
433 * 1000 * 1000 * 1000 / (pif->pif_bandwidth / 8);
435 if (flags & FARF_RIO) {
436 cl->cl_red = (red_t *)rio_alloc(0, NULL,
437 red_flags, red_pkttime);
438 if (cl->cl_red != NULL)
439 cl->cl_qtype = Q_RIO;
442 if (flags & FARF_RED) {
443 cl->cl_red = red_alloc(0, 0,
444 cl->cl_qlimit * 10/100,
445 cl->cl_qlimit * 30/100,
446 red_flags, red_pkttime);
447 if (cl->cl_red != NULL)
448 cl->cl_qtype = Q_RED;
451 #endif /* ALTQ_RED */
457 fairq_class_destroy(struct fairq_class *cl)
459 struct fairq_if *pif;
468 pif->pif_classes[cl->cl_pri] = NULL;
469 if (pif->pif_poll_cache == cl)
470 pif->pif_poll_cache = NULL;
471 if (pif->pif_maxpri == cl->cl_pri) {
472 for (pri = cl->cl_pri; pri >= 0; pri--)
473 if (pif->pif_classes[pri] != NULL) {
474 pif->pif_maxpri = pri;
478 pif->pif_maxpri = -1;
482 if (cl->cl_red != NULL) {
484 if (cl->cl_qtype == Q_RIO)
485 rio_destroy((rio_t *)cl->cl_red);
488 if (cl->cl_qtype == Q_RED)
489 red_destroy(cl->cl_red);
492 kfree(cl->cl_buckets, M_ALTQ);
493 cl->cl_head = NULL; /* sanity */
494 cl->cl_polled = NULL; /* sanity */
495 cl->cl_buckets = NULL; /* sanity */
502 * fairq_enqueue is an enqueue function to be registered to
503 * (*altq_enqueue) in struct ifaltq.
506 fairq_enqueue(struct ifaltq *ifq, struct mbuf *m, struct altq_pktattr *pktattr)
508 struct fairq_if *pif = (struct fairq_if *)ifq->altq_disc;
509 struct fairq_class *cl;
516 /* grab class set by classifier */
517 if ((m->m_flags & M_PKTHDR) == 0) {
518 /* should not happen */
519 if_printf(ifq->altq_ifp, "altq: packet does not have pkthdr\n");
525 if (m->m_pkthdr.fw_flags & PF_MBUF_STRUCTURE) {
526 cl = clh_to_clp(pif, m->m_pkthdr.pf.qid);
527 if (m->m_pkthdr.pf.flags & PF_TAG_STATE_HASHED)
528 hash = (int)m->m_pkthdr.pf.state_hash;
536 cl = pif->pif_default;
543 cl->cl_flags |= FARF_HAS_PACKETS;
544 cl->cl_pktattr = NULL;
546 if (fairq_addq(cl, m, hash) != 0) {
547 /* drop occurred. mbuf was freed in fairq_addq. */
548 PKTCNTR_ADD(&cl->cl_dropcnt, len);
560 * fairq_dequeue is a dequeue function to be registered to
561 * (*altq_dequeue) in struct ifaltq.
563 * note: ALTDQ_POLL returns the next packet without removing the packet
564 * from the queue. ALTDQ_REMOVE is a normal dequeue operation.
565 * ALTDQ_REMOVE must return the same packet if called immediately
569 fairq_dequeue(struct ifaltq *ifq, struct mbuf *mpolled, int op)
571 struct fairq_if *pif = (struct fairq_if *)ifq->altq_disc;
572 struct fairq_class *cl;
573 struct fairq_class *best_cl;
576 uint64_t cur_time = read_machclk();
582 if (ifq_is_empty(ifq)) {
583 /* no packet in the queue */
584 KKASSERT(mpolled == NULL);
589 if (pif->pif_poll_cache && op == ALTDQ_REMOVE) {
590 best_cl = pif->pif_poll_cache;
591 m = fairq_getq(best_cl, cur_time);
592 pif->pif_poll_cache = NULL;
595 PKTCNTR_ADD(&best_cl->cl_xmitcnt, m_pktlen(m));
600 best_scale = 0xFFFFFFFFU;
602 for (pri = pif->pif_maxpri; pri >= 0; pri--) {
603 if ((cl = pif->pif_classes[pri]) == NULL)
605 if ((cl->cl_flags & FARF_HAS_PACKETS) == 0)
607 m = fairq_pollq(cl, cur_time, &hit_limit);
609 cl->cl_flags &= ~FARF_HAS_PACKETS;
614 * We can halt the search immediately if the queue
615 * did not hit its bandwidth limit.
617 if (hit_limit == 0) {
624 * Otherwise calculate the scale factor and select
625 * the queue with the lowest scale factor. This
626 * apportions any unused bandwidth weighted by
627 * the relative bandwidth specification.
629 scale = cl->cl_bw_current * 100 / cl->cl_bandwidth;
630 if (scale < best_scale) {
637 if (op == ALTDQ_POLL) {
638 pif->pif_poll_cache = best_cl;
640 } else if (best_cl) {
641 m = fairq_getq(best_cl, cur_time);
642 KKASSERT(best_m == m);
644 PKTCNTR_ADD(&best_cl->cl_xmitcnt, m_pktlen(m));
650 KKASSERT(mpolled == NULL || mpolled == m);
655 fairq_addq(struct fairq_class *cl, struct mbuf *m, int hash)
662 * If the packet doesn't have any keep state put it on the end of
663 * our queue. XXX this can result in out of order delivery.
667 b = cl->cl_head->prev;
669 b = &cl->cl_buckets[0];
671 hindex = hash & cl->cl_nbucket_mask;
672 b = &cl->cl_buckets[hindex];
676 * Add the bucket to the end of the circular list of active buckets.
678 * As a special case we add the bucket to the beginning of the list
679 * instead of the end if it was not previously on the list and if
680 * its traffic is less then the hog level.
682 if (b->in_use == 0) {
684 if (cl->cl_head == NULL) {
689 b->next = cl->cl_head;
690 b->prev = cl->cl_head->prev;
694 if (b->bw_delta && cl->cl_hogs_m1) {
695 bw = b->bw_bytes * machclk_freq / b->bw_delta;
696 if (bw < cl->cl_hogs_m1)
703 if (cl->cl_qtype == Q_RIO)
704 return rio_addq((rio_t *)cl->cl_red, &b->queue, m, cl->cl_pktattr);
707 if (cl->cl_qtype == Q_RED)
708 return red_addq(cl->cl_red, &b->queue, m, cl->cl_pktattr);
710 if (qlen(&b->queue) >= qlimit(&b->queue)) {
715 if (cl->cl_flags & FARF_CLEARDSCP)
716 write_dsfield(m, cl->cl_pktattr, 0);
724 fairq_getq(struct fairq_class *cl, uint64_t cur_time)
729 b = fairq_selectq(cl, 0);
733 else if (cl->cl_qtype == Q_RIO)
734 m = rio_getq((rio_t *)cl->cl_red, &b->queue);
737 else if (cl->cl_qtype == Q_RED)
738 m = red_getq(cl->cl_red, &b->queue);
741 m = _getq(&b->queue);
744 * Calculate the BW change
750 * Per-class bandwidth calculation
752 delta = (cur_time - cl->cl_last_time);
753 if (delta > machclk_freq * 8)
754 delta = machclk_freq * 8;
755 cl->cl_bw_delta += delta;
756 cl->cl_bw_bytes += m->m_pkthdr.len;
757 cl->cl_last_time = cur_time;
758 if (cl->cl_bw_delta > machclk_freq) {
759 cl->cl_bw_delta -= cl->cl_bw_delta >> 2;
760 cl->cl_bw_bytes -= cl->cl_bw_bytes >> 2;
764 * Per-bucket bandwidth calculation
766 delta = (cur_time - b->last_time);
767 if (delta > machclk_freq * 8)
768 delta = machclk_freq * 8;
769 b->bw_delta += delta;
770 b->bw_bytes += m->m_pkthdr.len;
771 b->last_time = cur_time;
772 if (b->bw_delta > machclk_freq) {
773 b->bw_delta -= b->bw_delta >> 2;
774 b->bw_bytes -= b->bw_bytes >> 2;
781 * Figure out what the next packet would be if there were no limits. If
782 * this class hits its bandwidth limit *hit_limit is set to no-zero, otherwise
783 * it is set to 0. A non-NULL mbuf is returned either way.
786 fairq_pollq(struct fairq_class *cl, uint64_t cur_time, int *hit_limit)
794 b = fairq_selectq(cl, 1);
797 m = qhead(&b->queue);
800 * Did this packet exceed the class bandwidth? Calculate the
801 * bandwidth component of the packet.
803 * - Calculate bytes per second
805 delta = cur_time - cl->cl_last_time;
806 if (delta > machclk_freq * 8)
807 delta = machclk_freq * 8;
808 cl->cl_bw_delta += delta;
809 cl->cl_last_time = cur_time;
810 if (cl->cl_bw_delta) {
811 bw = cl->cl_bw_bytes * machclk_freq / cl->cl_bw_delta;
813 if (bw > cl->cl_bandwidth)
815 cl->cl_bw_current = bw;
817 kprintf("BW %6lld relative to %6u %d queue %p\n",
818 bw, cl->cl_bandwidth, *hit_limit, b);
825 * Locate the next queue we want to pull a packet out of. This code
826 * is also responsible for removing empty buckets from the circular list.
830 fairq_selectq(struct fairq_class *cl, int ispoll)
835 if (ispoll == 0 && cl->cl_polled) {
837 cl->cl_polled = NULL;
841 while ((b = cl->cl_head) != NULL) {
843 * Remove empty queues from consideration
845 if (qempty(&b->queue)) {
847 cl->cl_head = b->next;
848 if (cl->cl_head == b) {
851 b->next->prev = b->prev;
852 b->prev->next = b->next;
858 * Advance the round robin. Queues with bandwidths less
859 * then the hog bandwidth are allowed to burst.
861 if (cl->cl_hogs_m1 == 0) {
862 cl->cl_head = b->next;
863 } else if (b->bw_delta) {
864 bw = b->bw_bytes * machclk_freq / b->bw_delta;
865 if (bw >= cl->cl_hogs_m1) {
866 cl->cl_head = b->next;
884 fairq_purgeq(struct fairq_class *cl)
889 while ((b = fairq_selectq(cl, 0)) != NULL) {
890 while ((m = _getq(&b->queue)) != NULL) {
891 PKTCNTR_ADD(&cl->cl_dropcnt, m_pktlen(m));
894 KKASSERT(qlen(&b->queue) == 0);
899 get_class_stats(struct fairq_classstats *sp, struct fairq_class *cl)
903 sp->class_handle = cl->cl_handle;
904 sp->qlimit = cl->cl_qlimit;
905 sp->xmit_cnt = cl->cl_xmitcnt;
906 sp->drop_cnt = cl->cl_dropcnt;
907 sp->qtype = cl->cl_qtype;
913 sp->qlength += qlen(&b->queue);
915 } while (b != cl->cl_head);
919 if (cl->cl_qtype == Q_RED)
920 red_getstats(cl->cl_red, &sp->red[0]);
923 if (cl->cl_qtype == Q_RIO)
924 rio_getstats((rio_t *)cl->cl_red, &sp->red[0]);
928 /* convert a class handle to the corresponding class pointer */
929 static struct fairq_class *
930 clh_to_clp(struct fairq_if *pif, uint32_t chandle)
932 struct fairq_class *cl;
938 for (idx = pif->pif_maxpri; idx >= 0; idx--)
939 if ((cl = pif->pif_classes[idx]) != NULL &&
940 cl->cl_handle == chandle)
946 #endif /* ALTQ_FAIRQ */