2015-04-17 06:38:31 +00:00
|
|
|
/*-
|
2004-06-12 00:10:21 +00:00
|
|
|
* 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.
|
2015-04-17 06:38:31 +00:00
|
|
|
*
|
|
|
|
* $KAME: altq_priq.c,v 1.11 2003/09/17 14:23:25 kjc Exp $
|
|
|
|
* $FreeBSD$
|
2004-06-12 00:10:21 +00:00
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* 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>
|
2013-10-26 18:59:58 +00:00
|
|
|
#include <net/if_var.h>
|
2004-06-12 00:10:21 +00:00
|
|
|
#include <netinet/in.h>
|
|
|
|
|
2013-10-27 16:25:57 +00:00
|
|
|
#include <netpfil/pf/pf.h>
|
|
|
|
#include <netpfil/pf/pf_altq.h>
|
|
|
|
#include <netpfil/pf/pf_mtag.h>
|
2015-04-16 20:22:40 +00:00
|
|
|
#include <net/altq/altq.h>
|
2004-06-12 00:57:20 +00:00
|
|
|
#ifdef ALTQ3_COMPAT
|
2015-04-16 20:22:40 +00:00
|
|
|
#include <net/altq/altq_conf.h>
|
2004-06-12 00:57:20 +00:00
|
|
|
#endif
|
2015-04-16 20:22:40 +00:00
|
|
|
#include <net/altq/altq_priq.h>
|
2004-06-12 00:10:21 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* function prototypes
|
|
|
|
*/
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
static struct priq_if *priq_attach(struct ifaltq *, u_int);
|
|
|
|
static int priq_detach(struct priq_if *);
|
|
|
|
#endif
|
|
|
|
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 *);
|
|
|
|
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
static int priqcmd_if_attach(struct priq_interface *);
|
|
|
|
static int priqcmd_if_detach(struct priq_interface *);
|
|
|
|
static int priqcmd_add_class(struct priq_add_class *);
|
|
|
|
static int priqcmd_delete_class(struct priq_delete_class *);
|
|
|
|
static int priqcmd_modify_class(struct priq_modify_class *);
|
|
|
|
static int priqcmd_add_filter(struct priq_add_filter *);
|
|
|
|
static int priqcmd_delete_filter(struct priq_delete_filter *);
|
|
|
|
static int priqcmd_class_stats(struct priq_class_stats *);
|
|
|
|
#endif /* ALTQ3_COMPAT */
|
|
|
|
|
|
|
|
static void get_class_stats(struct priq_classstats *, struct priq_class *);
|
|
|
|
static struct priq_class *clh_to_clp(struct priq_if *, u_int32_t);
|
|
|
|
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
altqdev_decl(priq);
|
|
|
|
|
|
|
|
/* pif_list keeps all priq_if's allocated. */
|
|
|
|
static struct priq_if *pif_list = NULL;
|
|
|
|
#endif /* ALTQ3_COMPAT */
|
|
|
|
|
|
|
|
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 pf_altq *a)
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
struct ifnet *ifp;
|
|
|
|
|
|
|
|
if ((ifp = ifunit(a->ifname)) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
if (!ALTQ_IS_READY(&ifp->if_snd))
|
|
|
|
return (ENODEV);
|
|
|
|
|
Merge the projects/pf/head branch, that was worked on for last six months,
into head. The most significant achievements in the new code:
o Fine grained locking, thus much better performance.
o Fixes to many problems in pf, that were specific to FreeBSD port.
New code doesn't have that many ifdefs and much less OpenBSDisms, thus
is more attractive to our developers.
Those interested in details, can browse through SVN log of the
projects/pf/head branch. And for reference, here is exact list of
revisions merged:
r232043, r232044, r232062, r232148, r232149, r232150, r232298, r232330,
r232332, r232340, r232386, r232390, r232391, r232605, r232655, r232656,
r232661, r232662, r232663, r232664, r232673, r232691, r233309, r233782,
r233829, r233830, r233834, r233835, r233836, r233865, r233866, r233868,
r233873, r234056, r234096, r234100, r234108, r234175, r234187, r234223,
r234271, r234272, r234282, r234307, r234309, r234382, r234384, r234456,
r234486, r234606, r234640, r234641, r234642, r234644, r234651, r235505,
r235506, r235535, r235605, r235606, r235826, r235991, r235993, r236168,
r236173, r236179, r236180, r236181, r236186, r236223, r236227, r236230,
r236252, r236254, r236298, r236299, r236300, r236301, r236397, r236398,
r236399, r236499, r236512, r236513, r236525, r236526, r236545, r236548,
r236553, r236554, r236556, r236557, r236561, r236570, r236630, r236672,
r236673, r236679, r236706, r236710, r236718, r237154, r237155, r237169,
r237314, r237363, r237364, r237368, r237369, r237376, r237440, r237442,
r237751, r237783, r237784, r237785, r237788, r237791, r238421, r238522,
r238523, r238524, r238525, r239173, r239186, r239644, r239652, r239661,
r239773, r240125, r240130, r240131, r240136, r240186, r240196, r240212.
I'd like to thank people who participated in early testing:
Tested by: Florian Smeets <flo freebsd.org>
Tested by: Chekaluk Vitaly <artemrts ukr.net>
Tested by: Ben Wilber <ben desync.com>
Tested by: Ian FREISLICH <ianf cloudseed.co.za>
2012-09-08 06:41:54 +00:00
|
|
|
pif = malloc(sizeof(struct priq_if), M_DEVBUF, M_NOWAIT | M_ZERO);
|
2004-06-12 00:10:21 +00:00
|
|
|
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);
|
|
|
|
|
2008-10-23 15:53:51 +00:00
|
|
|
free(pif, M_DEVBUF);
|
2004-06-12 00:10:21 +00:00
|
|
|
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)
|
|
|
|
{
|
|
|
|
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;
|
|
|
|
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_LOCK_ASSERT(ifq);
|
|
|
|
|
2004-06-12 00:10:21 +00:00
|
|
|
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
|
2015-08-21 22:02:22 +00:00
|
|
|
#ifndef ALTQ_CODEL
|
|
|
|
if (flags & PRCF_CODEL) {
|
|
|
|
#ifdef ALTQ_DEBUG
|
|
|
|
printf("priq_class_create: CODEL not configured for PRIQ!\n");
|
|
|
|
#endif
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
#endif
|
2004-06-12 00:10:21 +00:00
|
|
|
|
|
|
|
if ((cl = pif->pif_classes[pri]) != NULL) {
|
|
|
|
/* modify the class instead of creating a new one */
|
|
|
|
s = splnet();
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_LOCK(cl->cl_pif->pif_ifq);
|
2004-06-12 00:10:21 +00:00
|
|
|
if (!qempty(cl->cl_q))
|
|
|
|
priq_purgeq(cl);
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_UNLOCK(cl->cl_pif->pif_ifq);
|
2004-06-12 00:10:21 +00:00
|
|
|
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);
|
2015-08-21 22:02:22 +00:00
|
|
|
#endif
|
|
|
|
#ifdef ALTQ_CODEL
|
|
|
|
if (q_is_codel(cl->cl_q))
|
|
|
|
codel_destroy(cl->cl_codel);
|
2004-06-12 00:10:21 +00:00
|
|
|
#endif
|
|
|
|
} else {
|
2012-09-18 12:34:35 +00:00
|
|
|
cl = malloc(sizeof(struct priq_class), M_DEVBUF,
|
|
|
|
M_NOWAIT | M_ZERO);
|
2004-06-12 00:10:21 +00:00
|
|
|
if (cl == NULL)
|
|
|
|
return (NULL);
|
|
|
|
|
2012-09-18 12:34:35 +00:00
|
|
|
cl->cl_q = malloc(sizeof(class_queue_t), M_DEVBUF,
|
|
|
|
M_NOWAIT | M_ZERO);
|
2004-06-12 00:10:21 +00:00
|
|
|
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;
|
2015-08-21 22:02:22 +00:00
|
|
|
qsize(cl->cl_q) = 0;
|
2004-06-12 00:10:21 +00:00
|
|
|
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);
|
2012-09-22 12:49:36 +00:00
|
|
|
if (cl->cl_red == NULL)
|
|
|
|
goto err_ret;
|
|
|
|
qtype(cl->cl_q) = Q_RIO;
|
2004-06-12 00:10:21 +00:00
|
|
|
} 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);
|
2012-09-22 12:49:36 +00:00
|
|
|
if (cl->cl_red == NULL)
|
|
|
|
goto err_ret;
|
|
|
|
qtype(cl->cl_q) = Q_RED;
|
2004-06-12 00:10:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* ALTQ_RED */
|
2015-08-21 22:02:22 +00:00
|
|
|
#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
|
2004-06-12 00:10:21 +00:00
|
|
|
|
|
|
|
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);
|
2015-08-21 22:02:22 +00:00
|
|
|
#endif
|
|
|
|
#ifdef ALTQ_CODEL
|
|
|
|
if (q_is_codel(cl->cl_q))
|
|
|
|
codel_destroy(cl->cl_codel);
|
2004-06-12 00:10:21 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
if (cl->cl_q != NULL)
|
2008-10-23 15:53:51 +00:00
|
|
|
free(cl->cl_q, M_DEVBUF);
|
|
|
|
free(cl, M_DEVBUF);
|
2004-06-12 00:10:21 +00:00
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priq_class_destroy(struct priq_class *cl)
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
int s, pri;
|
|
|
|
|
|
|
|
s = splnet();
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_LOCK(cl->cl_pif->pif_ifq);
|
2004-06-12 00:10:21 +00:00
|
|
|
|
|
|
|
#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;
|
|
|
|
}
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_UNLOCK(cl->cl_pif->pif_ifq);
|
2004-06-12 00:10:21 +00:00
|
|
|
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);
|
2015-08-21 22:02:22 +00:00
|
|
|
#endif
|
|
|
|
#ifdef ALTQ_CODEL
|
|
|
|
if (q_is_codel(cl->cl_q))
|
|
|
|
codel_destroy(cl->cl_codel);
|
2004-06-12 00:10:21 +00:00
|
|
|
#endif
|
|
|
|
}
|
2008-10-23 15:53:51 +00:00
|
|
|
free(cl->cl_q, M_DEVBUF);
|
|
|
|
free(cl, M_DEVBUF);
|
2004-06-12 00:10:21 +00:00
|
|
|
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;
|
2007-07-03 12:46:08 +00:00
|
|
|
struct pf_mtag *t;
|
2004-06-12 00:10:21 +00:00
|
|
|
int len;
|
|
|
|
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_LOCK_ASSERT(ifq);
|
|
|
|
|
2004-06-12 00:10:21 +00:00
|
|
|
/* 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;
|
2007-07-03 12:46:08 +00:00
|
|
|
if ((t = pf_find_mtag(m)) != NULL)
|
|
|
|
cl = clh_to_clp(pif, t->qid);
|
2004-06-12 00:10:21 +00:00
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
else if ((ifq->altq_flags & ALTQF_CLASSIFY) && pktattr != NULL)
|
|
|
|
cl = pktattr->pattr_class;
|
|
|
|
#endif
|
|
|
|
if (cl == NULL) {
|
|
|
|
cl = pif->pif_default;
|
|
|
|
if (cl == NULL) {
|
|
|
|
m_freem(m);
|
|
|
|
return (ENOBUFS);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
if (pktattr != NULL)
|
|
|
|
cl->cl_pktattr = pktattr; /* save proto hdr used by ECN */
|
|
|
|
else
|
|
|
|
#endif
|
|
|
|
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;
|
|
|
|
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_LOCK_ASSERT(ifq);
|
|
|
|
|
2004-06-12 00:10:21 +00:00
|
|
|
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);
|
2015-08-21 22:02:22 +00:00
|
|
|
#endif
|
|
|
|
#ifdef ALTQ_CODEL
|
|
|
|
if (q_is_codel(cl->cl_q))
|
|
|
|
return codel_addq(cl->cl_codel, cl->cl_q, m);
|
2004-06-12 00:10:21 +00:00
|
|
|
#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);
|
2015-08-21 22:02:22 +00:00
|
|
|
#endif
|
|
|
|
#ifdef ALTQ_CODEL
|
|
|
|
if (q_is_codel(cl->cl_q))
|
|
|
|
return codel_getq(cl->cl_codel, cl->cl_q);
|
2004-06-12 00:10:21 +00:00
|
|
|
#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
|
2015-08-21 22:02:22 +00:00
|
|
|
#ifdef ALTQ_CODEL
|
|
|
|
if (q_is_codel(cl->cl_q))
|
|
|
|
codel_getstats(cl->cl_codel, &sp->codel);
|
|
|
|
#endif
|
2004-06-12 00:10:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* 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);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
|
|
|
|
static struct priq_if *
|
|
|
|
priq_attach(ifq, bandwidth)
|
|
|
|
struct ifaltq *ifq;
|
|
|
|
u_int bandwidth;
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
|
2008-10-23 15:53:51 +00:00
|
|
|
pif = malloc(sizeof(struct priq_if),
|
2004-06-12 00:10:21 +00:00
|
|
|
M_DEVBUF, M_WAITOK);
|
|
|
|
if (pif == NULL)
|
|
|
|
return (NULL);
|
|
|
|
bzero(pif, sizeof(struct priq_if));
|
|
|
|
pif->pif_bandwidth = bandwidth;
|
|
|
|
pif->pif_maxpri = -1;
|
|
|
|
pif->pif_ifq = ifq;
|
|
|
|
|
|
|
|
/* add this state to the priq list */
|
|
|
|
pif->pif_next = pif_list;
|
|
|
|
pif_list = pif;
|
|
|
|
|
|
|
|
return (pif);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priq_detach(pif)
|
|
|
|
struct priq_if *pif;
|
|
|
|
{
|
|
|
|
(void)priq_clear_interface(pif);
|
|
|
|
|
|
|
|
/* remove this interface from the pif list */
|
|
|
|
if (pif_list == pif)
|
|
|
|
pif_list = pif->pif_next;
|
|
|
|
else {
|
|
|
|
struct priq_if *p;
|
|
|
|
|
|
|
|
for (p = pif_list; p != NULL; p = p->pif_next)
|
|
|
|
if (p->pif_next == pif) {
|
|
|
|
p->pif_next = pif->pif_next;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
ASSERT(p != NULL);
|
|
|
|
}
|
|
|
|
|
2008-10-23 15:53:51 +00:00
|
|
|
free(pif, M_DEVBUF);
|
2004-06-12 00:10:21 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* priq device interface
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
priqopen(dev, flag, fmt, p)
|
|
|
|
dev_t dev;
|
|
|
|
int flag, fmt;
|
|
|
|
#if (__FreeBSD_version > 500000)
|
|
|
|
struct thread *p;
|
|
|
|
#else
|
|
|
|
struct proc *p;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
/* everything will be done when the queueing scheme is attached. */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
priqclose(dev, flag, fmt, p)
|
|
|
|
dev_t dev;
|
|
|
|
int flag, fmt;
|
|
|
|
#if (__FreeBSD_version > 500000)
|
|
|
|
struct thread *p;
|
|
|
|
#else
|
|
|
|
struct proc *p;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
int err, error = 0;
|
|
|
|
|
|
|
|
while ((pif = pif_list) != NULL) {
|
|
|
|
/* destroy all */
|
|
|
|
if (ALTQ_IS_ENABLED(pif->pif_ifq))
|
|
|
|
altq_disable(pif->pif_ifq);
|
|
|
|
|
|
|
|
err = altq_detach(pif->pif_ifq);
|
|
|
|
if (err == 0)
|
|
|
|
err = priq_detach(pif);
|
|
|
|
if (err != 0 && error == 0)
|
|
|
|
error = err;
|
|
|
|
}
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
priqioctl(dev, cmd, addr, flag, p)
|
|
|
|
dev_t dev;
|
|
|
|
ioctlcmd_t cmd;
|
|
|
|
caddr_t addr;
|
|
|
|
int flag;
|
|
|
|
#if (__FreeBSD_version > 500000)
|
|
|
|
struct thread *p;
|
|
|
|
#else
|
|
|
|
struct proc *p;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
struct priq_interface *ifacep;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
/* check super-user privilege */
|
|
|
|
switch (cmd) {
|
|
|
|
case PRIQ_GETSTATS:
|
|
|
|
break;
|
|
|
|
default:
|
2006-11-06 13:42:10 +00:00
|
|
|
#if (__FreeBSD_version > 700000)
|
|
|
|
if ((error = priv_check(p, PRIV_ALTQ_MANAGE)) != 0)
|
|
|
|
return (error);
|
|
|
|
#elsif (__FreeBSD_version > 400000)
|
2004-06-12 00:10:21 +00:00
|
|
|
if ((error = suser(p)) != 0)
|
|
|
|
return (error);
|
|
|
|
#else
|
|
|
|
if ((error = suser(p->p_ucred, &p->p_acflag)) != 0)
|
|
|
|
return (error);
|
|
|
|
#endif
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
|
|
|
|
case PRIQ_IF_ATTACH:
|
|
|
|
error = priqcmd_if_attach((struct priq_interface *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_IF_DETACH:
|
|
|
|
error = priqcmd_if_detach((struct priq_interface *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_ENABLE:
|
|
|
|
case PRIQ_DISABLE:
|
|
|
|
case PRIQ_CLEAR:
|
|
|
|
ifacep = (struct priq_interface *)addr;
|
|
|
|
if ((pif = altq_lookup(ifacep->ifname,
|
|
|
|
ALTQT_PRIQ)) == NULL) {
|
|
|
|
error = EBADF;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
case PRIQ_ENABLE:
|
|
|
|
if (pif->pif_default == NULL) {
|
|
|
|
#ifdef ALTQ_DEBUG
|
|
|
|
printf("priq: no default class\n");
|
|
|
|
#endif
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
error = altq_enable(pif->pif_ifq);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_DISABLE:
|
|
|
|
error = altq_disable(pif->pif_ifq);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_CLEAR:
|
|
|
|
priq_clear_interface(pif);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_ADD_CLASS:
|
|
|
|
error = priqcmd_add_class((struct priq_add_class *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_DEL_CLASS:
|
|
|
|
error = priqcmd_delete_class((struct priq_delete_class *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_MOD_CLASS:
|
|
|
|
error = priqcmd_modify_class((struct priq_modify_class *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_ADD_FILTER:
|
|
|
|
error = priqcmd_add_filter((struct priq_add_filter *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_DEL_FILTER:
|
|
|
|
error = priqcmd_delete_filter((struct priq_delete_filter *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRIQ_GETSTATS:
|
|
|
|
error = priqcmd_class_stats((struct priq_class_stats *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priqcmd_if_attach(ap)
|
|
|
|
struct priq_interface *ap;
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
struct ifnet *ifp;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
if ((ifp = ifunit(ap->ifname)) == NULL)
|
|
|
|
return (ENXIO);
|
|
|
|
|
|
|
|
if ((pif = priq_attach(&ifp->if_snd, ap->arg)) == NULL)
|
|
|
|
return (ENOMEM);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* set PRIQ to this ifnet structure.
|
|
|
|
*/
|
|
|
|
if ((error = altq_attach(&ifp->if_snd, ALTQT_PRIQ, pif,
|
|
|
|
priq_enqueue, priq_dequeue, priq_request,
|
|
|
|
&pif->pif_classifier, acc_classify)) != 0)
|
|
|
|
(void)priq_detach(pif);
|
|
|
|
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priqcmd_if_detach(ap)
|
|
|
|
struct priq_interface *ap;
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
if ((pif = altq_lookup(ap->ifname, ALTQT_PRIQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
if (ALTQ_IS_ENABLED(pif->pif_ifq))
|
|
|
|
altq_disable(pif->pif_ifq);
|
|
|
|
|
|
|
|
if ((error = altq_detach(pif->pif_ifq)))
|
|
|
|
return (error);
|
|
|
|
|
|
|
|
return priq_detach(pif);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priqcmd_add_class(ap)
|
|
|
|
struct priq_add_class *ap;
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
struct priq_class *cl;
|
|
|
|
int qid;
|
|
|
|
|
|
|
|
if ((pif = altq_lookup(ap->iface.ifname, ALTQT_PRIQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
if (ap->pri < 0 || ap->pri >= PRIQ_MAXPRI)
|
|
|
|
return (EINVAL);
|
|
|
|
if (pif->pif_classes[ap->pri] != NULL)
|
|
|
|
return (EBUSY);
|
|
|
|
|
|
|
|
qid = ap->pri + 1;
|
|
|
|
if ((cl = priq_class_create(pif, ap->pri,
|
|
|
|
ap->qlimit, ap->flags, qid)) == NULL)
|
|
|
|
return (ENOMEM);
|
|
|
|
|
|
|
|
/* return a class handle to the user */
|
|
|
|
ap->class_handle = cl->cl_handle;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priqcmd_delete_class(ap)
|
|
|
|
struct priq_delete_class *ap;
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
struct priq_class *cl;
|
|
|
|
|
|
|
|
if ((pif = altq_lookup(ap->iface.ifname, ALTQT_PRIQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
if ((cl = clh_to_clp(pif, ap->class_handle)) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
return priq_class_destroy(cl);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priqcmd_modify_class(ap)
|
|
|
|
struct priq_modify_class *ap;
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
struct priq_class *cl;
|
|
|
|
|
|
|
|
if ((pif = altq_lookup(ap->iface.ifname, ALTQT_PRIQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
if (ap->pri < 0 || ap->pri >= PRIQ_MAXPRI)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
if ((cl = clh_to_clp(pif, ap->class_handle)) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* if priority is changed, move the class to the new priority
|
|
|
|
*/
|
|
|
|
if (pif->pif_classes[ap->pri] != cl) {
|
|
|
|
if (pif->pif_classes[ap->pri] != NULL)
|
|
|
|
return (EEXIST);
|
|
|
|
pif->pif_classes[cl->cl_pri] = NULL;
|
|
|
|
pif->pif_classes[ap->pri] = cl;
|
|
|
|
cl->cl_pri = ap->pri;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* call priq_class_create to change class parameters */
|
|
|
|
if ((cl = priq_class_create(pif, ap->pri,
|
|
|
|
ap->qlimit, ap->flags, ap->class_handle)) == NULL)
|
|
|
|
return (ENOMEM);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priqcmd_add_filter(ap)
|
|
|
|
struct priq_add_filter *ap;
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
struct priq_class *cl;
|
|
|
|
|
|
|
|
if ((pif = altq_lookup(ap->iface.ifname, ALTQT_PRIQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
if ((cl = clh_to_clp(pif, ap->class_handle)) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
return acc_add_filter(&pif->pif_classifier, &ap->filter,
|
|
|
|
cl, &ap->filter_handle);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priqcmd_delete_filter(ap)
|
|
|
|
struct priq_delete_filter *ap;
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
|
|
|
|
if ((pif = altq_lookup(ap->iface.ifname, ALTQT_PRIQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
return acc_delete_filter(&pif->pif_classifier,
|
|
|
|
ap->filter_handle);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
priqcmd_class_stats(ap)
|
|
|
|
struct priq_class_stats *ap;
|
|
|
|
{
|
|
|
|
struct priq_if *pif;
|
|
|
|
struct priq_class *cl;
|
|
|
|
struct priq_classstats stats, *usp;
|
|
|
|
int pri, error;
|
|
|
|
|
|
|
|
if ((pif = altq_lookup(ap->iface.ifname, ALTQT_PRIQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
ap->maxpri = pif->pif_maxpri;
|
|
|
|
|
|
|
|
/* then, read the next N classes in the tree */
|
|
|
|
usp = ap->stats;
|
|
|
|
for (pri = 0; pri <= pif->pif_maxpri; pri++) {
|
|
|
|
cl = pif->pif_classes[pri];
|
|
|
|
if (cl != NULL)
|
|
|
|
get_class_stats(&stats, cl);
|
|
|
|
else
|
|
|
|
bzero(&stats, sizeof(stats));
|
|
|
|
if ((error = copyout((caddr_t)&stats, (caddr_t)usp++,
|
|
|
|
sizeof(stats))) != 0)
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef KLD_MODULE
|
|
|
|
|
|
|
|
static struct altqsw priq_sw =
|
|
|
|
{"priq", priqopen, priqclose, priqioctl};
|
|
|
|
|
|
|
|
ALTQ_MODULE(altq_priq, ALTQT_PRIQ, &priq_sw);
|
|
|
|
MODULE_DEPEND(altq_priq, altq_red, 1, 1, 1);
|
|
|
|
MODULE_DEPEND(altq_priq, altq_rio, 1, 1, 1);
|
|
|
|
|
|
|
|
#endif /* KLD_MODULE */
|
|
|
|
|
|
|
|
#endif /* ALTQ3_COMPAT */
|
|
|
|
#endif /* ALTQ_PRIQ */
|