1231387b19
In general, the time savings come from separating the active and inactive queues lists into separate interface and non-interface queue lists, and changing the rule and queue tag management from list-based to hash-bashed. In HFSC, a linear scan of the class table during each queue destroy was also eliminated. There are now two new tunables to control the hash size used for each tag set (default for each is 128): net.pf.queue_tag_hashsize net.pf.rule_tag_hashsize Reviewed by: kp MFC after: 1 week Sponsored by: RG Nets Differential Revision: https://reviews.freebsd.org/D19131
645 lines
14 KiB
C
645 lines
14 KiB
C
/*-
|
|
* Copyright (C) 2000-2003
|
|
* Sony Computer Science Laboratories Inc. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY SONY CSL AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL SONY CSL OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $KAME: altq_priq.c,v 1.11 2003/09/17 14:23:25 kjc Exp $
|
|
* $FreeBSD$
|
|
*/
|
|
/*
|
|
* priority queue
|
|
*/
|
|
|
|
#include "opt_altq.h"
|
|
#include "opt_inet.h"
|
|
#include "opt_inet6.h"
|
|
|
|
#ifdef ALTQ_PRIQ /* priq is enabled by ALTQ_PRIQ option in opt_altq.h */
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/malloc.h>
|
|
#include <sys/mbuf.h>
|
|
#include <sys/socket.h>
|
|
#include <sys/sockio.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/errno.h>
|
|
#include <sys/kernel.h>
|
|
#include <sys/queue.h>
|
|
|
|
#include <net/if.h>
|
|
#include <net/if_var.h>
|
|
#include <netinet/in.h>
|
|
|
|
#include <netpfil/pf/pf.h>
|
|
#include <netpfil/pf/pf_altq.h>
|
|
#include <netpfil/pf/pf_mtag.h>
|
|
#include <net/altq/altq.h>
|
|
#include <net/altq/altq_priq.h>
|
|
|
|
/*
|
|
* function prototypes
|
|
*/
|
|
static int priq_clear_interface(struct priq_if *);
|
|
static int priq_request(struct ifaltq *, int, void *);
|
|
static void priq_purge(struct priq_if *);
|
|
static struct priq_class *priq_class_create(struct priq_if *, int, int, int,
|
|
int);
|
|
static int priq_class_destroy(struct priq_class *);
|
|
static int priq_enqueue(struct ifaltq *, struct mbuf *, struct altq_pktattr *);
|
|
static struct mbuf *priq_dequeue(struct ifaltq *, int);
|
|
|
|
static int priq_addq(struct priq_class *, struct mbuf *);
|
|
static struct mbuf *priq_getq(struct priq_class *);
|
|
static struct mbuf *priq_pollq(struct priq_class *);
|
|
static void priq_purgeq(struct priq_class *);
|
|
|
|
|
|
static void get_class_stats(struct priq_classstats *, struct priq_class *);
|
|
static struct priq_class *clh_to_clp(struct priq_if *, u_int32_t);
|
|
|
|
|
|
int
|
|
priq_pfattach(struct pf_altq *a)
|
|
{
|
|
struct ifnet *ifp;
|
|
int s, error;
|
|
|
|
if ((ifp = ifunit(a->ifname)) == NULL || a->altq_disc == NULL)
|
|
return (EINVAL);
|
|
s = splnet();
|
|
error = altq_attach(&ifp->if_snd, ALTQT_PRIQ, a->altq_disc,
|
|
priq_enqueue, priq_dequeue, priq_request, NULL, NULL);
|
|
splx(s);
|
|
return (error);
|
|
}
|
|
|
|
int
|
|
priq_add_altq(struct ifnet * ifp, struct pf_altq *a)
|
|
{
|
|
struct priq_if *pif;
|
|
|
|
if (ifp == NULL)
|
|
return (EINVAL);
|
|
if (!ALTQ_IS_READY(&ifp->if_snd))
|
|
return (ENODEV);
|
|
|
|
pif = malloc(sizeof(struct priq_if), M_DEVBUF, M_NOWAIT | M_ZERO);
|
|
if (pif == NULL)
|
|
return (ENOMEM);
|
|
pif->pif_bandwidth = a->ifbandwidth;
|
|
pif->pif_maxpri = -1;
|
|
pif->pif_ifq = &ifp->if_snd;
|
|
|
|
/* keep the state in pf_altq */
|
|
a->altq_disc = pif;
|
|
|
|
return (0);
|
|
}
|
|
|
|
int
|
|
priq_remove_altq(struct pf_altq *a)
|
|
{
|
|
struct priq_if *pif;
|
|
|
|
if ((pif = a->altq_disc) == NULL)
|
|
return (EINVAL);
|
|
a->altq_disc = NULL;
|
|
|
|
(void)priq_clear_interface(pif);
|
|
|
|
free(pif, M_DEVBUF);
|
|
return (0);
|
|
}
|
|
|
|
int
|
|
priq_add_queue(struct pf_altq *a)
|
|
{
|
|
struct priq_if *pif;
|
|
struct priq_class *cl;
|
|
|
|
if ((pif = a->altq_disc) == NULL)
|
|
return (EINVAL);
|
|
|
|
/* check parameters */
|
|
if (a->priority >= PRIQ_MAXPRI)
|
|
return (EINVAL);
|
|
if (a->qid == 0)
|
|
return (EINVAL);
|
|
if (pif->pif_classes[a->priority] != NULL)
|
|
return (EBUSY);
|
|
if (clh_to_clp(pif, a->qid) != NULL)
|
|
return (EBUSY);
|
|
|
|
cl = priq_class_create(pif, a->priority, a->qlimit,
|
|
a->pq_u.priq_opts.flags, a->qid);
|
|
if (cl == NULL)
|
|
return (ENOMEM);
|
|
|
|
return (0);
|
|
}
|
|
|
|
int
|
|
priq_remove_queue(struct pf_altq *a)
|
|
{
|
|
struct priq_if *pif;
|
|
struct priq_class *cl;
|
|
|
|
if ((pif = a->altq_disc) == NULL)
|
|
return (EINVAL);
|
|
|
|
if ((cl = clh_to_clp(pif, a->qid)) == NULL)
|
|
return (EINVAL);
|
|
|
|
return (priq_class_destroy(cl));
|
|
}
|
|
|
|
int
|
|
priq_getqstats(struct pf_altq *a, void *ubuf, int *nbytes, int version)
|
|
{
|
|
struct priq_if *pif;
|
|
struct priq_class *cl;
|
|
struct priq_classstats stats;
|
|
int error = 0;
|
|
|
|
if ((pif = altq_lookup(a->ifname, ALTQT_PRIQ)) == NULL)
|
|
return (EBADF);
|
|
|
|
if ((cl = clh_to_clp(pif, a->qid)) == NULL)
|
|
return (EINVAL);
|
|
|
|
if (*nbytes < sizeof(stats))
|
|
return (EINVAL);
|
|
|
|
get_class_stats(&stats, cl);
|
|
|
|
if ((error = copyout((caddr_t)&stats, ubuf, sizeof(stats))) != 0)
|
|
return (error);
|
|
*nbytes = sizeof(stats);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* bring the interface back to the initial state by discarding
|
|
* all the filters and classes.
|
|
*/
|
|
static int
|
|
priq_clear_interface(struct priq_if *pif)
|
|
{
|
|
struct priq_class *cl;
|
|
int pri;
|
|
|
|
#ifdef ALTQ3_CLFIER_COMPAT
|
|
/* free the filters for this interface */
|
|
acc_discard_filters(&pif->pif_classifier, NULL, 1);
|
|
#endif
|
|
|
|
/* clear out the classes */
|
|
for (pri = 0; pri <= pif->pif_maxpri; pri++)
|
|
if ((cl = pif->pif_classes[pri]) != NULL)
|
|
priq_class_destroy(cl);
|
|
|
|
return (0);
|
|
}
|
|
|
|
static int
|
|
priq_request(struct ifaltq *ifq, int req, void *arg)
|
|
{
|
|
struct priq_if *pif = (struct priq_if *)ifq->altq_disc;
|
|
|
|
IFQ_LOCK_ASSERT(ifq);
|
|
|
|
switch (req) {
|
|
case ALTRQ_PURGE:
|
|
priq_purge(pif);
|
|
break;
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/* discard all the queued packets on the interface */
|
|
static void
|
|
priq_purge(struct priq_if *pif)
|
|
{
|
|
struct priq_class *cl;
|
|
int pri;
|
|
|
|
for (pri = 0; pri <= pif->pif_maxpri; pri++) {
|
|
if ((cl = pif->pif_classes[pri]) != NULL && !qempty(cl->cl_q))
|
|
priq_purgeq(cl);
|
|
}
|
|
if (ALTQ_IS_ENABLED(pif->pif_ifq))
|
|
pif->pif_ifq->ifq_len = 0;
|
|
}
|
|
|
|
static struct priq_class *
|
|
priq_class_create(struct priq_if *pif, int pri, int qlimit, int flags, int qid)
|
|
{
|
|
struct priq_class *cl;
|
|
int s;
|
|
|
|
#ifndef ALTQ_RED
|
|
if (flags & PRCF_RED) {
|
|
#ifdef ALTQ_DEBUG
|
|
printf("priq_class_create: RED not configured for PRIQ!\n");
|
|
#endif
|
|
return (NULL);
|
|
}
|
|
#endif
|
|
#ifndef ALTQ_CODEL
|
|
if (flags & PRCF_CODEL) {
|
|
#ifdef ALTQ_DEBUG
|
|
printf("priq_class_create: CODEL not configured for PRIQ!\n");
|
|
#endif
|
|
return (NULL);
|
|
}
|
|
#endif
|
|
|
|
if ((cl = pif->pif_classes[pri]) != NULL) {
|
|
/* modify the class instead of creating a new one */
|
|
s = splnet();
|
|
IFQ_LOCK(cl->cl_pif->pif_ifq);
|
|
if (!qempty(cl->cl_q))
|
|
priq_purgeq(cl);
|
|
IFQ_UNLOCK(cl->cl_pif->pif_ifq);
|
|
splx(s);
|
|
#ifdef ALTQ_RIO
|
|
if (q_is_rio(cl->cl_q))
|
|
rio_destroy((rio_t *)cl->cl_red);
|
|
#endif
|
|
#ifdef ALTQ_RED
|
|
if (q_is_red(cl->cl_q))
|
|
red_destroy(cl->cl_red);
|
|
#endif
|
|
#ifdef ALTQ_CODEL
|
|
if (q_is_codel(cl->cl_q))
|
|
codel_destroy(cl->cl_codel);
|
|
#endif
|
|
} else {
|
|
cl = malloc(sizeof(struct priq_class), M_DEVBUF,
|
|
M_NOWAIT | M_ZERO);
|
|
if (cl == NULL)
|
|
return (NULL);
|
|
|
|
cl->cl_q = malloc(sizeof(class_queue_t), M_DEVBUF,
|
|
M_NOWAIT | M_ZERO);
|
|
if (cl->cl_q == NULL)
|
|
goto err_ret;
|
|
}
|
|
|
|
pif->pif_classes[pri] = cl;
|
|
if (flags & PRCF_DEFAULTCLASS)
|
|
pif->pif_default = cl;
|
|
if (qlimit == 0)
|
|
qlimit = 50; /* use default */
|
|
qlimit(cl->cl_q) = qlimit;
|
|
qtype(cl->cl_q) = Q_DROPTAIL;
|
|
qlen(cl->cl_q) = 0;
|
|
qsize(cl->cl_q) = 0;
|
|
cl->cl_flags = flags;
|
|
cl->cl_pri = pri;
|
|
if (pri > pif->pif_maxpri)
|
|
pif->pif_maxpri = pri;
|
|
cl->cl_pif = pif;
|
|
cl->cl_handle = qid;
|
|
|
|
#ifdef ALTQ_RED
|
|
if (flags & (PRCF_RED|PRCF_RIO)) {
|
|
int red_flags, red_pkttime;
|
|
|
|
red_flags = 0;
|
|
if (flags & PRCF_ECN)
|
|
red_flags |= REDF_ECN;
|
|
#ifdef ALTQ_RIO
|
|
if (flags & PRCF_CLEARDSCP)
|
|
red_flags |= RIOF_CLEARDSCP;
|
|
#endif
|
|
if (pif->pif_bandwidth < 8)
|
|
red_pkttime = 1000 * 1000 * 1000; /* 1 sec */
|
|
else
|
|
red_pkttime = (int64_t)pif->pif_ifq->altq_ifp->if_mtu
|
|
* 1000 * 1000 * 1000 / (pif->pif_bandwidth / 8);
|
|
#ifdef ALTQ_RIO
|
|
if (flags & PRCF_RIO) {
|
|
cl->cl_red = (red_t *)rio_alloc(0, NULL,
|
|
red_flags, red_pkttime);
|
|
if (cl->cl_red == NULL)
|
|
goto err_ret;
|
|
qtype(cl->cl_q) = Q_RIO;
|
|
} else
|
|
#endif
|
|
if (flags & PRCF_RED) {
|
|
cl->cl_red = red_alloc(0, 0,
|
|
qlimit(cl->cl_q) * 10/100,
|
|
qlimit(cl->cl_q) * 30/100,
|
|
red_flags, red_pkttime);
|
|
if (cl->cl_red == NULL)
|
|
goto err_ret;
|
|
qtype(cl->cl_q) = Q_RED;
|
|
}
|
|
}
|
|
#endif /* ALTQ_RED */
|
|
#ifdef ALTQ_CODEL
|
|
if (flags & PRCF_CODEL) {
|
|
cl->cl_codel = codel_alloc(5, 100, 0);
|
|
if (cl->cl_codel != NULL)
|
|
qtype(cl->cl_q) = Q_CODEL;
|
|
}
|
|
#endif
|
|
|
|
return (cl);
|
|
|
|
err_ret:
|
|
if (cl->cl_red != NULL) {
|
|
#ifdef ALTQ_RIO
|
|
if (q_is_rio(cl->cl_q))
|
|
rio_destroy((rio_t *)cl->cl_red);
|
|
#endif
|
|
#ifdef ALTQ_RED
|
|
if (q_is_red(cl->cl_q))
|
|
red_destroy(cl->cl_red);
|
|
#endif
|
|
#ifdef ALTQ_CODEL
|
|
if (q_is_codel(cl->cl_q))
|
|
codel_destroy(cl->cl_codel);
|
|
#endif
|
|
}
|
|
if (cl->cl_q != NULL)
|
|
free(cl->cl_q, M_DEVBUF);
|
|
free(cl, M_DEVBUF);
|
|
return (NULL);
|
|
}
|
|
|
|
static int
|
|
priq_class_destroy(struct priq_class *cl)
|
|
{
|
|
struct priq_if *pif;
|
|
int s, pri;
|
|
|
|
s = splnet();
|
|
IFQ_LOCK(cl->cl_pif->pif_ifq);
|
|
|
|
#ifdef ALTQ3_CLFIER_COMPAT
|
|
/* delete filters referencing to this class */
|
|
acc_discard_filters(&cl->cl_pif->pif_classifier, cl, 0);
|
|
#endif
|
|
|
|
if (!qempty(cl->cl_q))
|
|
priq_purgeq(cl);
|
|
|
|
pif = cl->cl_pif;
|
|
pif->pif_classes[cl->cl_pri] = NULL;
|
|
if (pif->pif_maxpri == cl->cl_pri) {
|
|
for (pri = cl->cl_pri; pri >= 0; pri--)
|
|
if (pif->pif_classes[pri] != NULL) {
|
|
pif->pif_maxpri = pri;
|
|
break;
|
|
}
|
|
if (pri < 0)
|
|
pif->pif_maxpri = -1;
|
|
}
|
|
IFQ_UNLOCK(cl->cl_pif->pif_ifq);
|
|
splx(s);
|
|
|
|
if (cl->cl_red != NULL) {
|
|
#ifdef ALTQ_RIO
|
|
if (q_is_rio(cl->cl_q))
|
|
rio_destroy((rio_t *)cl->cl_red);
|
|
#endif
|
|
#ifdef ALTQ_RED
|
|
if (q_is_red(cl->cl_q))
|
|
red_destroy(cl->cl_red);
|
|
#endif
|
|
#ifdef ALTQ_CODEL
|
|
if (q_is_codel(cl->cl_q))
|
|
codel_destroy(cl->cl_codel);
|
|
#endif
|
|
}
|
|
free(cl->cl_q, M_DEVBUF);
|
|
free(cl, M_DEVBUF);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* priq_enqueue is an enqueue function to be registered to
|
|
* (*altq_enqueue) in struct ifaltq.
|
|
*/
|
|
static int
|
|
priq_enqueue(struct ifaltq *ifq, struct mbuf *m, struct altq_pktattr *pktattr)
|
|
{
|
|
struct priq_if *pif = (struct priq_if *)ifq->altq_disc;
|
|
struct priq_class *cl;
|
|
struct pf_mtag *t;
|
|
int len;
|
|
|
|
IFQ_LOCK_ASSERT(ifq);
|
|
|
|
/* grab class set by classifier */
|
|
if ((m->m_flags & M_PKTHDR) == 0) {
|
|
/* should not happen */
|
|
printf("altq: packet for %s does not have pkthdr\n",
|
|
ifq->altq_ifp->if_xname);
|
|
m_freem(m);
|
|
return (ENOBUFS);
|
|
}
|
|
cl = NULL;
|
|
if ((t = pf_find_mtag(m)) != NULL)
|
|
cl = clh_to_clp(pif, t->qid);
|
|
if (cl == NULL) {
|
|
cl = pif->pif_default;
|
|
if (cl == NULL) {
|
|
m_freem(m);
|
|
return (ENOBUFS);
|
|
}
|
|
}
|
|
cl->cl_pktattr = NULL;
|
|
len = m_pktlen(m);
|
|
if (priq_addq(cl, m) != 0) {
|
|
/* drop occurred. mbuf was freed in priq_addq. */
|
|
PKTCNTR_ADD(&cl->cl_dropcnt, len);
|
|
return (ENOBUFS);
|
|
}
|
|
IFQ_INC_LEN(ifq);
|
|
|
|
/* successfully queued. */
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* priq_dequeue is a dequeue function to be registered to
|
|
* (*altq_dequeue) in struct ifaltq.
|
|
*
|
|
* note: ALTDQ_POLL returns the next packet without removing the packet
|
|
* from the queue. ALTDQ_REMOVE is a normal dequeue operation.
|
|
* ALTDQ_REMOVE must return the same packet if called immediately
|
|
* after ALTDQ_POLL.
|
|
*/
|
|
static struct mbuf *
|
|
priq_dequeue(struct ifaltq *ifq, int op)
|
|
{
|
|
struct priq_if *pif = (struct priq_if *)ifq->altq_disc;
|
|
struct priq_class *cl;
|
|
struct mbuf *m;
|
|
int pri;
|
|
|
|
IFQ_LOCK_ASSERT(ifq);
|
|
|
|
if (IFQ_IS_EMPTY(ifq))
|
|
/* no packet in the queue */
|
|
return (NULL);
|
|
|
|
for (pri = pif->pif_maxpri; pri >= 0; pri--) {
|
|
if ((cl = pif->pif_classes[pri]) != NULL &&
|
|
!qempty(cl->cl_q)) {
|
|
if (op == ALTDQ_POLL)
|
|
return (priq_pollq(cl));
|
|
|
|
m = priq_getq(cl);
|
|
if (m != NULL) {
|
|
IFQ_DEC_LEN(ifq);
|
|
if (qempty(cl->cl_q))
|
|
cl->cl_period++;
|
|
PKTCNTR_ADD(&cl->cl_xmitcnt, m_pktlen(m));
|
|
}
|
|
return (m);
|
|
}
|
|
}
|
|
return (NULL);
|
|
}
|
|
|
|
static int
|
|
priq_addq(struct priq_class *cl, struct mbuf *m)
|
|
{
|
|
|
|
#ifdef ALTQ_RIO
|
|
if (q_is_rio(cl->cl_q))
|
|
return rio_addq((rio_t *)cl->cl_red, cl->cl_q, m,
|
|
cl->cl_pktattr);
|
|
#endif
|
|
#ifdef ALTQ_RED
|
|
if (q_is_red(cl->cl_q))
|
|
return red_addq(cl->cl_red, cl->cl_q, m, cl->cl_pktattr);
|
|
#endif
|
|
#ifdef ALTQ_CODEL
|
|
if (q_is_codel(cl->cl_q))
|
|
return codel_addq(cl->cl_codel, cl->cl_q, m);
|
|
#endif
|
|
if (qlen(cl->cl_q) >= qlimit(cl->cl_q)) {
|
|
m_freem(m);
|
|
return (-1);
|
|
}
|
|
|
|
if (cl->cl_flags & PRCF_CLEARDSCP)
|
|
write_dsfield(m, cl->cl_pktattr, 0);
|
|
|
|
_addq(cl->cl_q, m);
|
|
|
|
return (0);
|
|
}
|
|
|
|
static struct mbuf *
|
|
priq_getq(struct priq_class *cl)
|
|
{
|
|
#ifdef ALTQ_RIO
|
|
if (q_is_rio(cl->cl_q))
|
|
return rio_getq((rio_t *)cl->cl_red, cl->cl_q);
|
|
#endif
|
|
#ifdef ALTQ_RED
|
|
if (q_is_red(cl->cl_q))
|
|
return red_getq(cl->cl_red, cl->cl_q);
|
|
#endif
|
|
#ifdef ALTQ_CODEL
|
|
if (q_is_codel(cl->cl_q))
|
|
return codel_getq(cl->cl_codel, cl->cl_q);
|
|
#endif
|
|
return _getq(cl->cl_q);
|
|
}
|
|
|
|
static struct mbuf *
|
|
priq_pollq(cl)
|
|
struct priq_class *cl;
|
|
{
|
|
return qhead(cl->cl_q);
|
|
}
|
|
|
|
static void
|
|
priq_purgeq(struct priq_class *cl)
|
|
{
|
|
struct mbuf *m;
|
|
|
|
if (qempty(cl->cl_q))
|
|
return;
|
|
|
|
while ((m = _getq(cl->cl_q)) != NULL) {
|
|
PKTCNTR_ADD(&cl->cl_dropcnt, m_pktlen(m));
|
|
m_freem(m);
|
|
}
|
|
ASSERT(qlen(cl->cl_q) == 0);
|
|
}
|
|
|
|
static void
|
|
get_class_stats(struct priq_classstats *sp, struct priq_class *cl)
|
|
{
|
|
sp->class_handle = cl->cl_handle;
|
|
sp->qlength = qlen(cl->cl_q);
|
|
sp->qlimit = qlimit(cl->cl_q);
|
|
sp->period = cl->cl_period;
|
|
sp->xmitcnt = cl->cl_xmitcnt;
|
|
sp->dropcnt = cl->cl_dropcnt;
|
|
|
|
sp->qtype = qtype(cl->cl_q);
|
|
#ifdef ALTQ_RED
|
|
if (q_is_red(cl->cl_q))
|
|
red_getstats(cl->cl_red, &sp->red[0]);
|
|
#endif
|
|
#ifdef ALTQ_RIO
|
|
if (q_is_rio(cl->cl_q))
|
|
rio_getstats((rio_t *)cl->cl_red, &sp->red[0]);
|
|
#endif
|
|
#ifdef ALTQ_CODEL
|
|
if (q_is_codel(cl->cl_q))
|
|
codel_getstats(cl->cl_codel, &sp->codel);
|
|
#endif
|
|
}
|
|
|
|
/* convert a class handle to the corresponding class pointer */
|
|
static struct priq_class *
|
|
clh_to_clp(struct priq_if *pif, u_int32_t chandle)
|
|
{
|
|
struct priq_class *cl;
|
|
int idx;
|
|
|
|
if (chandle == 0)
|
|
return (NULL);
|
|
|
|
for (idx = pif->pif_maxpri; idx >= 0; idx--)
|
|
if ((cl = pif->pif_classes[idx]) != NULL &&
|
|
cl->cl_handle == chandle)
|
|
return (cl);
|
|
|
|
return (NULL);
|
|
}
|
|
|
|
|
|
#endif /* ALTQ_PRIQ */
|