2015-04-17 06:38:31 +00:00
|
|
|
/*-
|
2004-06-12 00:10:21 +00:00
|
|
|
* Copyright (c) Sun Microsystems, Inc. 1993-1998 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.
|
|
|
|
*
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the SMCC Technology
|
|
|
|
* Development Group at Sun Microsystems, Inc.
|
|
|
|
*
|
|
|
|
* 4. The name of the Sun Microsystems, Inc nor may not be used to endorse or
|
|
|
|
* promote products derived from this software without specific prior
|
|
|
|
* written permission.
|
|
|
|
*
|
|
|
|
* SUN MICROSYSTEMS DOES NOT CLAIM MERCHANTABILITY OF THIS SOFTWARE OR THE
|
|
|
|
* SUITABILITY OF THIS SOFTWARE FOR ANY PARTICULAR PURPOSE. The software is
|
|
|
|
* provided "as is" without express or implied warranty of any kind.
|
|
|
|
*
|
|
|
|
* These notices must be retained in any copies of any part of this software.
|
2015-04-17 06:38:31 +00:00
|
|
|
*
|
|
|
|
* $KAME: altq_cbq.c,v 1.19 2003/09/17 14:23:25 kjc Exp $
|
|
|
|
* $FreeBSD$
|
2004-06-12 00:10:21 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "opt_altq.h"
|
|
|
|
#include "opt_inet.h"
|
|
|
|
#include "opt_inet6.h"
|
|
|
|
#ifdef ALTQ_CBQ /* cbq is enabled by ALTQ_CBQ option in opt_altq.h */
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
#include <sys/uio.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#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>
|
|
|
|
#include <net/altq/altq_cbq.h>
|
2004-06-12 00:10:21 +00:00
|
|
|
#ifdef ALTQ3_COMPAT
|
2015-04-16 20:22:40 +00:00
|
|
|
#include <net/altq/altq_conf.h>
|
2004-06-12 00:10:21 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
/*
|
|
|
|
* Local Data structures.
|
|
|
|
*/
|
|
|
|
static cbq_state_t *cbq_list = NULL;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Forward Declarations.
|
|
|
|
*/
|
|
|
|
static int cbq_class_destroy(cbq_state_t *, struct rm_class *);
|
|
|
|
static struct rm_class *clh_to_clp(cbq_state_t *, u_int32_t);
|
|
|
|
static int cbq_clear_interface(cbq_state_t *);
|
|
|
|
static int cbq_request(struct ifaltq *, int, void *);
|
|
|
|
static int cbq_enqueue(struct ifaltq *, struct mbuf *,
|
|
|
|
struct altq_pktattr *);
|
|
|
|
static struct mbuf *cbq_dequeue(struct ifaltq *, int);
|
|
|
|
static void cbqrestart(struct ifaltq *);
|
|
|
|
static void get_class_stats(class_stats_t *, struct rm_class *);
|
|
|
|
static void cbq_purge(cbq_state_t *);
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
static int cbq_add_class(struct cbq_add_class *);
|
|
|
|
static int cbq_delete_class(struct cbq_delete_class *);
|
|
|
|
static int cbq_modify_class(struct cbq_modify_class *);
|
|
|
|
static int cbq_class_create(cbq_state_t *, struct cbq_add_class *,
|
|
|
|
struct rm_class *, struct rm_class *);
|
|
|
|
static int cbq_clear_hierarchy(struct cbq_interface *);
|
|
|
|
static int cbq_set_enable(struct cbq_interface *, int);
|
|
|
|
static int cbq_ifattach(struct cbq_interface *);
|
|
|
|
static int cbq_ifdetach(struct cbq_interface *);
|
|
|
|
static int cbq_getstats(struct cbq_getstats *);
|
|
|
|
|
|
|
|
static int cbq_add_filter(struct cbq_add_filter *);
|
|
|
|
static int cbq_delete_filter(struct cbq_delete_filter *);
|
|
|
|
#endif /* ALTQ3_COMPAT */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* int
|
|
|
|
* cbq_class_destroy(cbq_mod_state_t *, struct rm_class *) - This
|
|
|
|
* function destroys a given traffic class. Before destroying
|
|
|
|
* the class, all traffic for that class is released.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
cbq_class_destroy(cbq_state_t *cbqp, struct rm_class *cl)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* delete the class */
|
|
|
|
rmc_delete_class(&cbqp->ifnp, cl);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* free the class handle
|
|
|
|
*/
|
|
|
|
for (i = 0; i < CBQ_MAX_CLASSES; i++)
|
|
|
|
if (cbqp->cbq_class_tbl[i] == cl)
|
|
|
|
cbqp->cbq_class_tbl[i] = NULL;
|
|
|
|
|
|
|
|
if (cl == cbqp->ifnp.root_)
|
|
|
|
cbqp->ifnp.root_ = NULL;
|
|
|
|
if (cl == cbqp->ifnp.default_)
|
|
|
|
cbqp->ifnp.default_ = NULL;
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
if (cl == cbqp->ifnp.ctl_)
|
|
|
|
cbqp->ifnp.ctl_ = NULL;
|
|
|
|
#endif
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* convert class handle to class pointer */
|
|
|
|
static struct rm_class *
|
|
|
|
clh_to_clp(cbq_state_t *cbqp, u_int32_t chandle)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct rm_class *cl;
|
|
|
|
|
|
|
|
if (chandle == 0)
|
|
|
|
return (NULL);
|
|
|
|
/*
|
|
|
|
* first, try optimistically the slot matching the lower bits of
|
|
|
|
* the handle. if it fails, do the linear table search.
|
|
|
|
*/
|
|
|
|
i = chandle % CBQ_MAX_CLASSES;
|
|
|
|
if ((cl = cbqp->cbq_class_tbl[i]) != NULL &&
|
|
|
|
cl->stats_.handle == chandle)
|
|
|
|
return (cl);
|
|
|
|
for (i = 0; i < CBQ_MAX_CLASSES; i++)
|
|
|
|
if ((cl = cbqp->cbq_class_tbl[i]) != NULL &&
|
|
|
|
cl->stats_.handle == chandle)
|
|
|
|
return (cl);
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_clear_interface(cbq_state_t *cbqp)
|
|
|
|
{
|
|
|
|
int again, i;
|
|
|
|
struct rm_class *cl;
|
|
|
|
|
|
|
|
#ifdef ALTQ3_CLFIER_COMPAT
|
|
|
|
/* free the filters for this interface */
|
|
|
|
acc_discard_filters(&cbqp->cbq_classifier, NULL, 1);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* clear out the classes now */
|
|
|
|
do {
|
|
|
|
again = 0;
|
|
|
|
for (i = 0; i < CBQ_MAX_CLASSES; i++) {
|
|
|
|
if ((cl = cbqp->cbq_class_tbl[i]) != NULL) {
|
|
|
|
if (is_a_parent_class(cl))
|
|
|
|
again++;
|
|
|
|
else {
|
|
|
|
cbq_class_destroy(cbqp, cl);
|
|
|
|
cbqp->cbq_class_tbl[i] = NULL;
|
|
|
|
if (cl == cbqp->ifnp.root_)
|
|
|
|
cbqp->ifnp.root_ = NULL;
|
|
|
|
if (cl == cbqp->ifnp.default_)
|
|
|
|
cbqp->ifnp.default_ = NULL;
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
if (cl == cbqp->ifnp.ctl_)
|
|
|
|
cbqp->ifnp.ctl_ = NULL;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} while (again);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_request(struct ifaltq *ifq, int req, void *arg)
|
|
|
|
{
|
|
|
|
cbq_state_t *cbqp = (cbq_state_t *)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:
|
|
|
|
cbq_purge(cbqp);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* copy the stats info in rm_class to class_states_t */
|
|
|
|
static void
|
|
|
|
get_class_stats(class_stats_t *statsp, struct rm_class *cl)
|
|
|
|
{
|
|
|
|
statsp->xmit_cnt = cl->stats_.xmit_cnt;
|
|
|
|
statsp->drop_cnt = cl->stats_.drop_cnt;
|
|
|
|
statsp->over = cl->stats_.over;
|
|
|
|
statsp->borrows = cl->stats_.borrows;
|
|
|
|
statsp->overactions = cl->stats_.overactions;
|
|
|
|
statsp->delays = cl->stats_.delays;
|
|
|
|
|
|
|
|
statsp->depth = cl->depth_;
|
|
|
|
statsp->priority = cl->pri_;
|
|
|
|
statsp->maxidle = cl->maxidle_;
|
|
|
|
statsp->minidle = cl->minidle_;
|
|
|
|
statsp->offtime = cl->offtime_;
|
|
|
|
statsp->qmax = qlimit(cl->q_);
|
|
|
|
statsp->ns_per_byte = cl->ns_per_byte_;
|
|
|
|
statsp->wrr_allot = cl->w_allotment_;
|
|
|
|
statsp->qcnt = qlen(cl->q_);
|
|
|
|
statsp->avgidle = cl->avgidle_;
|
|
|
|
|
|
|
|
statsp->qtype = qtype(cl->q_);
|
|
|
|
#ifdef ALTQ_RED
|
|
|
|
if (q_is_red(cl->q_))
|
|
|
|
red_getstats(cl->red_, &statsp->red[0]);
|
|
|
|
#endif
|
|
|
|
#ifdef ALTQ_RIO
|
|
|
|
if (q_is_rio(cl->q_))
|
|
|
|
rio_getstats((rio_t *)cl->red_, &statsp->red[0]);
|
|
|
|
#endif
|
2015-08-21 22:02:22 +00:00
|
|
|
#ifdef ALTQ_CODEL
|
|
|
|
if (q_is_codel(cl->q_))
|
|
|
|
codel_getstats(cl->codel_, &statsp->codel);
|
|
|
|
#endif
|
2004-06-12 00:10:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
cbq_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_CBQ, a->altq_disc,
|
|
|
|
cbq_enqueue, cbq_dequeue, cbq_request, NULL, NULL);
|
|
|
|
splx(s);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
cbq_add_altq(struct pf_altq *a)
|
|
|
|
{
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
struct ifnet *ifp;
|
|
|
|
|
|
|
|
if ((ifp = ifunit(a->ifname)) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
if (!ALTQ_IS_READY(&ifp->if_snd))
|
|
|
|
return (ENODEV);
|
|
|
|
|
|
|
|
/* allocate and initialize cbq_state_t */
|
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
|
|
|
cbqp = malloc(sizeof(cbq_state_t), M_DEVBUF, M_NOWAIT | M_ZERO);
|
2004-06-12 00:10:21 +00:00
|
|
|
if (cbqp == NULL)
|
|
|
|
return (ENOMEM);
|
|
|
|
CALLOUT_INIT(&cbqp->cbq_callout);
|
|
|
|
cbqp->cbq_qlen = 0;
|
|
|
|
cbqp->ifnp.ifq_ = &ifp->if_snd; /* keep the ifq */
|
|
|
|
|
|
|
|
/* keep the state in pf_altq */
|
|
|
|
a->altq_disc = cbqp;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
cbq_remove_altq(struct pf_altq *a)
|
|
|
|
{
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
|
|
|
|
if ((cbqp = a->altq_disc) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
a->altq_disc = NULL;
|
|
|
|
|
|
|
|
cbq_clear_interface(cbqp);
|
|
|
|
|
|
|
|
if (cbqp->ifnp.default_)
|
|
|
|
cbq_class_destroy(cbqp, cbqp->ifnp.default_);
|
|
|
|
if (cbqp->ifnp.root_)
|
|
|
|
cbq_class_destroy(cbqp, cbqp->ifnp.root_);
|
|
|
|
|
|
|
|
/* deallocate cbq_state_t */
|
2008-10-23 15:53:51 +00:00
|
|
|
free(cbqp, M_DEVBUF);
|
2004-06-12 00:10:21 +00:00
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
cbq_add_queue(struct pf_altq *a)
|
|
|
|
{
|
|
|
|
struct rm_class *borrow, *parent;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
struct rm_class *cl;
|
|
|
|
struct cbq_opts *opts;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if ((cbqp = a->altq_disc) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
if (a->qid == 0)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* find a free slot in the class table. if the slot matching
|
|
|
|
* the lower bits of qid is free, use this slot. otherwise,
|
|
|
|
* use the first free slot.
|
|
|
|
*/
|
|
|
|
i = a->qid % CBQ_MAX_CLASSES;
|
|
|
|
if (cbqp->cbq_class_tbl[i] != NULL) {
|
|
|
|
for (i = 0; i < CBQ_MAX_CLASSES; i++)
|
|
|
|
if (cbqp->cbq_class_tbl[i] == NULL)
|
|
|
|
break;
|
|
|
|
if (i == CBQ_MAX_CLASSES)
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
opts = &a->pq_u.cbq_opts;
|
|
|
|
/* check parameters */
|
|
|
|
if (a->priority >= CBQ_MAXPRI)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/* Get pointers to parent and borrow classes. */
|
|
|
|
parent = clh_to_clp(cbqp, a->parent_qid);
|
|
|
|
if (opts->flags & CBQCLF_BORROW)
|
|
|
|
borrow = parent;
|
|
|
|
else
|
|
|
|
borrow = NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* A class must borrow from it's parent or it can not
|
|
|
|
* borrow at all. Hence, borrow can be null.
|
|
|
|
*/
|
|
|
|
if (parent == NULL && (opts->flags & CBQCLF_ROOTCLASS) == 0) {
|
|
|
|
printf("cbq_add_queue: no parent class!\n");
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((borrow != parent) && (borrow != NULL)) {
|
|
|
|
printf("cbq_add_class: borrow class != parent\n");
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* check parameters
|
|
|
|
*/
|
|
|
|
switch (opts->flags & CBQCLF_CLASSMASK) {
|
|
|
|
case CBQCLF_ROOTCLASS:
|
|
|
|
if (parent != NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
if (cbqp->ifnp.root_)
|
|
|
|
return (EINVAL);
|
|
|
|
break;
|
|
|
|
case CBQCLF_DEFCLASS:
|
|
|
|
if (cbqp->ifnp.default_)
|
|
|
|
return (EINVAL);
|
|
|
|
break;
|
|
|
|
case 0:
|
|
|
|
if (a->qid == 0)
|
|
|
|
return (EINVAL);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
/* more than two flags bits set */
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* create a class. if this is a root class, initialize the
|
|
|
|
* interface.
|
|
|
|
*/
|
|
|
|
if ((opts->flags & CBQCLF_CLASSMASK) == CBQCLF_ROOTCLASS) {
|
|
|
|
rmc_init(cbqp->ifnp.ifq_, &cbqp->ifnp, opts->ns_per_byte,
|
|
|
|
cbqrestart, a->qlimit, RM_MAXQUEUED,
|
|
|
|
opts->maxidle, opts->minidle, opts->offtime,
|
|
|
|
opts->flags);
|
|
|
|
cl = cbqp->ifnp.root_;
|
|
|
|
} else {
|
|
|
|
cl = rmc_newclass(a->priority,
|
|
|
|
&cbqp->ifnp, opts->ns_per_byte,
|
|
|
|
rmc_delay_action, a->qlimit, parent, borrow,
|
|
|
|
opts->maxidle, opts->minidle, opts->offtime,
|
|
|
|
opts->pktsize, opts->flags);
|
|
|
|
}
|
|
|
|
if (cl == NULL)
|
|
|
|
return (ENOMEM);
|
|
|
|
|
|
|
|
/* return handle to user space. */
|
|
|
|
cl->stats_.handle = a->qid;
|
|
|
|
cl->stats_.depth = cl->depth_;
|
|
|
|
|
|
|
|
/* save the allocated class */
|
|
|
|
cbqp->cbq_class_tbl[i] = cl;
|
|
|
|
|
|
|
|
if ((opts->flags & CBQCLF_CLASSMASK) == CBQCLF_DEFCLASS)
|
|
|
|
cbqp->ifnp.default_ = cl;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
cbq_remove_queue(struct pf_altq *a)
|
|
|
|
{
|
|
|
|
struct rm_class *cl;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if ((cbqp = a->altq_disc) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
if ((cl = clh_to_clp(cbqp, a->qid)) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/* if we are a parent class, then return an error. */
|
|
|
|
if (is_a_parent_class(cl))
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/* delete the class */
|
|
|
|
rmc_delete_class(&cbqp->ifnp, cl);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* free the class handle
|
|
|
|
*/
|
|
|
|
for (i = 0; i < CBQ_MAX_CLASSES; i++)
|
|
|
|
if (cbqp->cbq_class_tbl[i] == cl) {
|
|
|
|
cbqp->cbq_class_tbl[i] = NULL;
|
|
|
|
if (cl == cbqp->ifnp.root_)
|
|
|
|
cbqp->ifnp.root_ = NULL;
|
|
|
|
if (cl == cbqp->ifnp.default_)
|
|
|
|
cbqp->ifnp.default_ = NULL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
cbq_getqstats(struct pf_altq *a, void *ubuf, int *nbytes)
|
|
|
|
{
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
struct rm_class *cl;
|
|
|
|
class_stats_t stats;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
if ((cbqp = altq_lookup(a->ifname, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
if ((cl = clh_to_clp(cbqp, 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);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* int
|
|
|
|
* cbq_enqueue(struct ifaltq *ifq, struct mbuf *m, struct altq_pktattr *pattr)
|
|
|
|
* - Queue data packets.
|
|
|
|
*
|
|
|
|
* cbq_enqueue is set to ifp->if_altqenqueue and called by an upper
|
|
|
|
* layer (e.g. ether_output). cbq_enqueue queues the given packet
|
|
|
|
* to the cbq, then invokes the driver's start routine.
|
|
|
|
*
|
|
|
|
* Assumptions: called in splimp
|
|
|
|
* Returns: 0 if the queueing is successful.
|
|
|
|
* ENOBUFS if a packet dropping occurred as a result of
|
|
|
|
* the queueing.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_enqueue(struct ifaltq *ifq, struct mbuf *m, struct altq_pktattr *pktattr)
|
|
|
|
{
|
|
|
|
cbq_state_t *cbqp = (cbq_state_t *)ifq->altq_disc;
|
|
|
|
struct rm_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(cbqp, 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 = cbqp->ifnp.default_;
|
|
|
|
if (cl == NULL) {
|
|
|
|
m_freem(m);
|
|
|
|
return (ENOBUFS);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
if (pktattr != NULL)
|
|
|
|
cl->pktattr_ = pktattr; /* save proto hdr used by ECN */
|
|
|
|
else
|
|
|
|
#endif
|
|
|
|
cl->pktattr_ = NULL;
|
|
|
|
len = m_pktlen(m);
|
|
|
|
if (rmc_queue_packet(cl, m) != 0) {
|
|
|
|
/* drop occurred. some mbuf was freed in rmc_queue_packet. */
|
|
|
|
PKTCNTR_ADD(&cl->stats_.drop_cnt, len);
|
|
|
|
return (ENOBUFS);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* successfully queued. */
|
|
|
|
++cbqp->cbq_qlen;
|
|
|
|
IFQ_INC_LEN(ifq);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct mbuf *
|
|
|
|
cbq_dequeue(struct ifaltq *ifq, int op)
|
|
|
|
{
|
|
|
|
cbq_state_t *cbqp = (cbq_state_t *)ifq->altq_disc;
|
|
|
|
struct mbuf *m;
|
|
|
|
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_LOCK_ASSERT(ifq);
|
|
|
|
|
2004-06-12 00:10:21 +00:00
|
|
|
m = rmc_dequeue_next(&cbqp->ifnp, op);
|
|
|
|
|
|
|
|
if (m && op == ALTDQ_REMOVE) {
|
|
|
|
--cbqp->cbq_qlen; /* decrement # of packets in cbq */
|
|
|
|
IFQ_DEC_LEN(ifq);
|
|
|
|
|
|
|
|
/* Update the class. */
|
|
|
|
rmc_update_class_util(&cbqp->ifnp);
|
|
|
|
}
|
|
|
|
return (m);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* void
|
|
|
|
* cbqrestart(queue_t *) - Restart sending of data.
|
|
|
|
* called from rmc_restart in splimp via timeout after waking up
|
|
|
|
* a suspended class.
|
|
|
|
* Returns: NONE
|
|
|
|
*/
|
|
|
|
|
|
|
|
static void
|
|
|
|
cbqrestart(struct ifaltq *ifq)
|
|
|
|
{
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
struct ifnet *ifp;
|
|
|
|
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_LOCK_ASSERT(ifq);
|
|
|
|
|
2004-06-12 00:10:21 +00:00
|
|
|
if (!ALTQ_IS_ENABLED(ifq))
|
|
|
|
/* cbq must have been detached */
|
|
|
|
return;
|
|
|
|
|
|
|
|
if ((cbqp = (cbq_state_t *)ifq->altq_disc) == NULL)
|
|
|
|
/* should not happen */
|
|
|
|
return;
|
|
|
|
|
|
|
|
ifp = ifq->altq_ifp;
|
|
|
|
if (ifp->if_start &&
|
2005-08-09 10:20:02 +00:00
|
|
|
cbqp->cbq_qlen > 0 && (ifp->if_drv_flags & IFF_DRV_OACTIVE) == 0) {
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_UNLOCK(ifq);
|
2004-06-12 00:10:21 +00:00
|
|
|
(*ifp->if_start)(ifp);
|
2004-06-12 00:57:20 +00:00
|
|
|
IFQ_LOCK(ifq);
|
|
|
|
}
|
2004-06-12 00:10:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void cbq_purge(cbq_state_t *cbqp)
|
|
|
|
{
|
|
|
|
struct rm_class *cl;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < CBQ_MAX_CLASSES; i++)
|
|
|
|
if ((cl = cbqp->cbq_class_tbl[i]) != NULL)
|
|
|
|
rmc_dropall(cl);
|
|
|
|
if (ALTQ_IS_ENABLED(cbqp->ifnp.ifq_))
|
|
|
|
cbqp->ifnp.ifq_->ifq_len = 0;
|
|
|
|
}
|
|
|
|
#ifdef ALTQ3_COMPAT
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_add_class(acp)
|
|
|
|
struct cbq_add_class *acp;
|
|
|
|
{
|
|
|
|
char *ifacename;
|
|
|
|
struct rm_class *borrow, *parent;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
|
|
|
|
ifacename = acp->cbq_iface.cbq_ifacename;
|
|
|
|
if ((cbqp = altq_lookup(ifacename, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
/* check parameters */
|
|
|
|
if (acp->cbq_class.priority >= CBQ_MAXPRI ||
|
|
|
|
acp->cbq_class.maxq > CBQ_MAXQSIZE)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/* Get pointers to parent and borrow classes. */
|
|
|
|
parent = clh_to_clp(cbqp, acp->cbq_class.parent_class_handle);
|
|
|
|
borrow = clh_to_clp(cbqp, acp->cbq_class.borrow_class_handle);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* A class must borrow from it's parent or it can not
|
|
|
|
* borrow at all. Hence, borrow can be null.
|
|
|
|
*/
|
|
|
|
if (parent == NULL && (acp->cbq_class.flags & CBQCLF_ROOTCLASS) == 0) {
|
|
|
|
printf("cbq_add_class: no parent class!\n");
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((borrow != parent) && (borrow != NULL)) {
|
|
|
|
printf("cbq_add_class: borrow class != parent\n");
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
return cbq_class_create(cbqp, acp, parent, borrow);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_delete_class(dcp)
|
|
|
|
struct cbq_delete_class *dcp;
|
|
|
|
{
|
|
|
|
char *ifacename;
|
|
|
|
struct rm_class *cl;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
|
|
|
|
ifacename = dcp->cbq_iface.cbq_ifacename;
|
|
|
|
if ((cbqp = altq_lookup(ifacename, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
if ((cl = clh_to_clp(cbqp, dcp->cbq_class_handle)) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/* if we are a parent class, then return an error. */
|
|
|
|
if (is_a_parent_class(cl))
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/* if a filter has a reference to this class delete the filter */
|
|
|
|
acc_discard_filters(&cbqp->cbq_classifier, cl, 0);
|
|
|
|
|
|
|
|
return cbq_class_destroy(cbqp, cl);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_modify_class(acp)
|
|
|
|
struct cbq_modify_class *acp;
|
|
|
|
{
|
|
|
|
char *ifacename;
|
|
|
|
struct rm_class *cl;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
|
|
|
|
ifacename = acp->cbq_iface.cbq_ifacename;
|
|
|
|
if ((cbqp = altq_lookup(ifacename, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
/* Get pointer to this class */
|
|
|
|
if ((cl = clh_to_clp(cbqp, acp->cbq_class_handle)) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
if (rmc_modclass(cl, acp->cbq_class.nano_sec_per_byte,
|
|
|
|
acp->cbq_class.maxq, acp->cbq_class.maxidle,
|
|
|
|
acp->cbq_class.minidle, acp->cbq_class.offtime,
|
|
|
|
acp->cbq_class.pktsize) < 0)
|
|
|
|
return (EINVAL);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* struct rm_class *
|
|
|
|
* cbq_class_create(cbq_mod_state_t *cbqp, struct cbq_add_class *acp,
|
|
|
|
* struct rm_class *parent, struct rm_class *borrow)
|
|
|
|
*
|
|
|
|
* This function create a new traffic class in the CBQ class hierarchy of
|
|
|
|
* given paramters. The class that created is either the root, default,
|
|
|
|
* or a new dynamic class. If CBQ is not initilaized, the the root class
|
|
|
|
* will be created.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
cbq_class_create(cbqp, acp, parent, borrow)
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
struct cbq_add_class *acp;
|
|
|
|
struct rm_class *parent, *borrow;
|
|
|
|
{
|
|
|
|
struct rm_class *cl;
|
|
|
|
cbq_class_spec_t *spec = &acp->cbq_class;
|
|
|
|
u_int32_t chandle;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* allocate class handle
|
|
|
|
*/
|
|
|
|
for (i = 1; i < CBQ_MAX_CLASSES; i++)
|
|
|
|
if (cbqp->cbq_class_tbl[i] == NULL)
|
|
|
|
break;
|
|
|
|
if (i == CBQ_MAX_CLASSES)
|
|
|
|
return (EINVAL);
|
|
|
|
chandle = i; /* use the slot number as class handle */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* create a class. if this is a root class, initialize the
|
|
|
|
* interface.
|
|
|
|
*/
|
|
|
|
if ((spec->flags & CBQCLF_CLASSMASK) == CBQCLF_ROOTCLASS) {
|
|
|
|
rmc_init(cbqp->ifnp.ifq_, &cbqp->ifnp, spec->nano_sec_per_byte,
|
|
|
|
cbqrestart, spec->maxq, RM_MAXQUEUED,
|
|
|
|
spec->maxidle, spec->minidle, spec->offtime,
|
|
|
|
spec->flags);
|
|
|
|
cl = cbqp->ifnp.root_;
|
|
|
|
} else {
|
|
|
|
cl = rmc_newclass(spec->priority,
|
|
|
|
&cbqp->ifnp, spec->nano_sec_per_byte,
|
|
|
|
rmc_delay_action, spec->maxq, parent, borrow,
|
|
|
|
spec->maxidle, spec->minidle, spec->offtime,
|
|
|
|
spec->pktsize, spec->flags);
|
|
|
|
}
|
|
|
|
if (cl == NULL)
|
|
|
|
return (ENOMEM);
|
|
|
|
|
|
|
|
/* return handle to user space. */
|
|
|
|
acp->cbq_class_handle = chandle;
|
|
|
|
|
|
|
|
cl->stats_.handle = chandle;
|
|
|
|
cl->stats_.depth = cl->depth_;
|
|
|
|
|
|
|
|
/* save the allocated class */
|
|
|
|
cbqp->cbq_class_tbl[i] = cl;
|
|
|
|
|
|
|
|
if ((spec->flags & CBQCLF_CLASSMASK) == CBQCLF_DEFCLASS)
|
|
|
|
cbqp->ifnp.default_ = cl;
|
|
|
|
if ((spec->flags & CBQCLF_CLASSMASK) == CBQCLF_CTLCLASS)
|
|
|
|
cbqp->ifnp.ctl_ = cl;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_add_filter(afp)
|
|
|
|
struct cbq_add_filter *afp;
|
|
|
|
{
|
|
|
|
char *ifacename;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
struct rm_class *cl;
|
|
|
|
|
|
|
|
ifacename = afp->cbq_iface.cbq_ifacename;
|
|
|
|
if ((cbqp = altq_lookup(ifacename, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
/* Get the pointer to class. */
|
|
|
|
if ((cl = clh_to_clp(cbqp, afp->cbq_class_handle)) == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
return acc_add_filter(&cbqp->cbq_classifier, &afp->cbq_filter,
|
|
|
|
cl, &afp->cbq_filter_handle);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_delete_filter(dfp)
|
|
|
|
struct cbq_delete_filter *dfp;
|
|
|
|
{
|
|
|
|
char *ifacename;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
|
|
|
|
ifacename = dfp->cbq_iface.cbq_ifacename;
|
|
|
|
if ((cbqp = altq_lookup(ifacename, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
return acc_delete_filter(&cbqp->cbq_classifier,
|
|
|
|
dfp->cbq_filter_handle);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* cbq_clear_hierarchy deletes all classes and their filters on the
|
|
|
|
* given interface.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
cbq_clear_hierarchy(ifacep)
|
|
|
|
struct cbq_interface *ifacep;
|
|
|
|
{
|
|
|
|
char *ifacename;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
|
|
|
|
ifacename = ifacep->cbq_ifacename;
|
|
|
|
if ((cbqp = altq_lookup(ifacename, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
return cbq_clear_interface(cbqp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* static int
|
|
|
|
* cbq_set_enable(struct cbq_enable *ep) - this function processed the
|
|
|
|
* ioctl request to enable class based queueing. It searches the list
|
|
|
|
* of interfaces for the specified interface and then enables CBQ on
|
|
|
|
* that interface.
|
|
|
|
*
|
|
|
|
* Returns: 0, for no error.
|
|
|
|
* EBADF, for specified inteface not found.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_set_enable(ep, enable)
|
|
|
|
struct cbq_interface *ep;
|
|
|
|
int enable;
|
|
|
|
{
|
|
|
|
int error = 0;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
char *ifacename;
|
|
|
|
|
|
|
|
ifacename = ep->cbq_ifacename;
|
|
|
|
if ((cbqp = altq_lookup(ifacename, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
switch (enable) {
|
|
|
|
case ENABLE:
|
|
|
|
if (cbqp->ifnp.root_ == NULL || cbqp->ifnp.default_ == NULL ||
|
|
|
|
cbqp->ifnp.ctl_ == NULL) {
|
|
|
|
if (cbqp->ifnp.root_ == NULL)
|
|
|
|
printf("No Root Class for %s\n", ifacename);
|
|
|
|
if (cbqp->ifnp.default_ == NULL)
|
|
|
|
printf("No Default Class for %s\n", ifacename);
|
|
|
|
if (cbqp->ifnp.ctl_ == NULL)
|
|
|
|
printf("No Control Class for %s\n", ifacename);
|
|
|
|
error = EINVAL;
|
|
|
|
} else if ((error = altq_enable(cbqp->ifnp.ifq_)) == 0) {
|
|
|
|
cbqp->cbq_qlen = 0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case DISABLE:
|
|
|
|
error = altq_disable(cbqp->ifnp.ifq_);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_getstats(gsp)
|
|
|
|
struct cbq_getstats *gsp;
|
|
|
|
{
|
|
|
|
char *ifacename;
|
|
|
|
int i, n, nclasses;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
struct rm_class *cl;
|
|
|
|
class_stats_t stats, *usp;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
ifacename = gsp->iface.cbq_ifacename;
|
|
|
|
nclasses = gsp->nclasses;
|
|
|
|
usp = gsp->stats;
|
|
|
|
|
|
|
|
if ((cbqp = altq_lookup(ifacename, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
if (nclasses <= 0)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
for (n = 0, i = 0; n < nclasses && i < CBQ_MAX_CLASSES; n++, i++) {
|
|
|
|
while ((cl = cbqp->cbq_class_tbl[i]) == NULL)
|
|
|
|
if (++i >= CBQ_MAX_CLASSES)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
get_class_stats(&stats, cl);
|
|
|
|
stats.handle = cl->stats_.handle;
|
|
|
|
|
|
|
|
if ((error = copyout((caddr_t)&stats, (caddr_t)usp++,
|
|
|
|
sizeof(stats))) != 0)
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
gsp->nclasses = n;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_ifattach(ifacep)
|
|
|
|
struct cbq_interface *ifacep;
|
|
|
|
{
|
|
|
|
int error = 0;
|
|
|
|
char *ifacename;
|
|
|
|
cbq_state_t *new_cbqp;
|
|
|
|
struct ifnet *ifp;
|
|
|
|
|
|
|
|
ifacename = ifacep->cbq_ifacename;
|
|
|
|
if ((ifp = ifunit(ifacename)) == NULL)
|
|
|
|
return (ENXIO);
|
|
|
|
if (!ALTQ_IS_READY(&ifp->if_snd))
|
|
|
|
return (ENXIO);
|
|
|
|
|
|
|
|
/* allocate and initialize cbq_state_t */
|
2008-10-23 15:53:51 +00:00
|
|
|
new_cbqp = malloc(sizeof(cbq_state_t), M_DEVBUF, M_WAITOK);
|
2004-06-12 00:10:21 +00:00
|
|
|
if (new_cbqp == NULL)
|
|
|
|
return (ENOMEM);
|
|
|
|
bzero(new_cbqp, sizeof(cbq_state_t));
|
|
|
|
CALLOUT_INIT(&new_cbqp->cbq_callout);
|
|
|
|
|
|
|
|
new_cbqp->cbq_qlen = 0;
|
|
|
|
new_cbqp->ifnp.ifq_ = &ifp->if_snd; /* keep the ifq */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* set CBQ to this ifnet structure.
|
|
|
|
*/
|
|
|
|
error = altq_attach(&ifp->if_snd, ALTQT_CBQ, new_cbqp,
|
|
|
|
cbq_enqueue, cbq_dequeue, cbq_request,
|
|
|
|
&new_cbqp->cbq_classifier, acc_classify);
|
|
|
|
if (error) {
|
2008-10-23 15:53:51 +00:00
|
|
|
free(new_cbqp, M_DEVBUF);
|
2004-06-12 00:10:21 +00:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* prepend to the list of cbq_state_t's. */
|
|
|
|
new_cbqp->cbq_next = cbq_list;
|
|
|
|
cbq_list = new_cbqp;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
cbq_ifdetach(ifacep)
|
|
|
|
struct cbq_interface *ifacep;
|
|
|
|
{
|
|
|
|
char *ifacename;
|
|
|
|
cbq_state_t *cbqp;
|
|
|
|
|
|
|
|
ifacename = ifacep->cbq_ifacename;
|
|
|
|
if ((cbqp = altq_lookup(ifacename, ALTQT_CBQ)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
(void)cbq_set_enable(ifacep, DISABLE);
|
|
|
|
|
|
|
|
cbq_clear_interface(cbqp);
|
|
|
|
|
|
|
|
/* remove CBQ from the ifnet structure. */
|
|
|
|
(void)altq_detach(cbqp->ifnp.ifq_);
|
|
|
|
|
|
|
|
/* remove from the list of cbq_state_t's. */
|
|
|
|
if (cbq_list == cbqp)
|
|
|
|
cbq_list = cbqp->cbq_next;
|
|
|
|
else {
|
|
|
|
cbq_state_t *cp;
|
|
|
|
|
|
|
|
for (cp = cbq_list; cp != NULL; cp = cp->cbq_next)
|
|
|
|
if (cp->cbq_next == cbqp) {
|
|
|
|
cp->cbq_next = cbqp->cbq_next;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
ASSERT(cp != NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* deallocate cbq_state_t */
|
2008-10-23 15:53:51 +00:00
|
|
|
free(cbqp, M_DEVBUF);
|
2004-06-12 00:10:21 +00:00
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* cbq device interface
|
|
|
|
*/
|
|
|
|
|
|
|
|
altqdev_decl(cbq);
|
|
|
|
|
|
|
|
int
|
|
|
|
cbqopen(dev, flag, fmt, p)
|
|
|
|
dev_t dev;
|
|
|
|
int flag, fmt;
|
|
|
|
#if (__FreeBSD_version > 500000)
|
|
|
|
struct thread *p;
|
|
|
|
#else
|
|
|
|
struct proc *p;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
cbqclose(dev, flag, fmt, p)
|
|
|
|
dev_t dev;
|
|
|
|
int flag, fmt;
|
|
|
|
#if (__FreeBSD_version > 500000)
|
|
|
|
struct thread *p;
|
|
|
|
#else
|
|
|
|
struct proc *p;
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
struct ifnet *ifp;
|
|
|
|
struct cbq_interface iface;
|
|
|
|
int err, error = 0;
|
|
|
|
|
|
|
|
while (cbq_list) {
|
|
|
|
ifp = cbq_list->ifnp.ifq_->altq_ifp;
|
|
|
|
sprintf(iface.cbq_ifacename, "%s", ifp->if_xname);
|
|
|
|
err = cbq_ifdetach(&iface);
|
|
|
|
if (err != 0 && error == 0)
|
|
|
|
error = err;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
cbqioctl(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
|
|
|
|
{
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
/* check cmd for superuser only */
|
|
|
|
switch (cmd) {
|
|
|
|
case CBQ_GETSTATS:
|
|
|
|
/* currently only command that an ordinary user can call */
|
|
|
|
break;
|
|
|
|
default:
|
2006-11-06 13:42:10 +00:00
|
|
|
#if (__FreeBSD_version > 700000)
|
|
|
|
error = priv_check(p, PRIV_ALTQ_MANAGE);
|
|
|
|
#elsif (__FreeBSD_version > 400000)
|
2004-06-12 00:10:21 +00:00
|
|
|
error = suser(p);
|
|
|
|
#else
|
|
|
|
error = suser(p->p_ucred, &p->p_acflag);
|
|
|
|
#endif
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
|
|
|
|
case CBQ_ENABLE:
|
|
|
|
error = cbq_set_enable((struct cbq_interface *)addr, ENABLE);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_DISABLE:
|
|
|
|
error = cbq_set_enable((struct cbq_interface *)addr, DISABLE);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_ADD_FILTER:
|
|
|
|
error = cbq_add_filter((struct cbq_add_filter *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_DEL_FILTER:
|
|
|
|
error = cbq_delete_filter((struct cbq_delete_filter *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_ADD_CLASS:
|
|
|
|
error = cbq_add_class((struct cbq_add_class *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_DEL_CLASS:
|
|
|
|
error = cbq_delete_class((struct cbq_delete_class *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_MODIFY_CLASS:
|
|
|
|
error = cbq_modify_class((struct cbq_modify_class *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_CLEAR_HIERARCHY:
|
|
|
|
error = cbq_clear_hierarchy((struct cbq_interface *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_IF_ATTACH:
|
|
|
|
error = cbq_ifattach((struct cbq_interface *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_IF_DETACH:
|
|
|
|
error = cbq_ifdetach((struct cbq_interface *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CBQ_GETSTATS:
|
|
|
|
error = cbq_getstats((struct cbq_getstats *)addr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
/* for debug */
|
|
|
|
static void cbq_class_dump(int);
|
|
|
|
|
|
|
|
static void cbq_class_dump(i)
|
|
|
|
int i;
|
|
|
|
{
|
|
|
|
struct rm_class *cl;
|
|
|
|
rm_class_stats_t *s;
|
|
|
|
struct _class_queue_ *q;
|
|
|
|
|
|
|
|
if (cbq_list == NULL) {
|
|
|
|
printf("cbq_class_dump: no cbq_state found\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
cl = cbq_list->cbq_class_tbl[i];
|
|
|
|
|
|
|
|
printf("class %d cl=%p\n", i, cl);
|
|
|
|
if (cl != NULL) {
|
|
|
|
s = &cl->stats_;
|
|
|
|
q = cl->q_;
|
|
|
|
|
|
|
|
printf("pri=%d, depth=%d, maxrate=%d, allotment=%d\n",
|
|
|
|
cl->pri_, cl->depth_, cl->maxrate_, cl->allotment_);
|
|
|
|
printf("w_allotment=%d, bytes_alloc=%d, avgidle=%d, maxidle=%d\n",
|
|
|
|
cl->w_allotment_, cl->bytes_alloc_, cl->avgidle_,
|
|
|
|
cl->maxidle_);
|
|
|
|
printf("minidle=%d, offtime=%d, sleeping=%d, leaf=%d\n",
|
|
|
|
cl->minidle_, cl->offtime_, cl->sleeping_, cl->leaf_);
|
|
|
|
printf("handle=%d, depth=%d, packets=%d, bytes=%d\n",
|
|
|
|
s->handle, s->depth,
|
|
|
|
(int)s->xmit_cnt.packets, (int)s->xmit_cnt.bytes);
|
|
|
|
printf("over=%d\n, borrows=%d, drops=%d, overactions=%d, delays=%d\n",
|
|
|
|
s->over, s->borrows, (int)s->drop_cnt.packets,
|
|
|
|
s->overactions, s->delays);
|
|
|
|
printf("tail=%p, head=%p, qlen=%d, qlim=%d, qthresh=%d,qtype=%d\n",
|
|
|
|
q->tail_, q->head_, q->qlen_, q->qlim_,
|
|
|
|
q->qthresh_, q->qtype_);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* 0 */
|
|
|
|
|
|
|
|
#ifdef KLD_MODULE
|
|
|
|
|
|
|
|
static struct altqsw cbq_sw =
|
|
|
|
{"cbq", cbqopen, cbqclose, cbqioctl};
|
|
|
|
|
|
|
|
ALTQ_MODULE(altq_cbq, ALTQT_CBQ, &cbq_sw);
|
|
|
|
MODULE_DEPEND(altq_cbq, altq_red, 1, 1, 1);
|
|
|
|
MODULE_DEPEND(altq_cbq, altq_rio, 1, 1, 1);
|
|
|
|
|
|
|
|
#endif /* KLD_MODULE */
|
|
|
|
#endif /* ALTQ3_COMPAT */
|
|
|
|
|
|
|
|
#endif /* ALTQ_CBQ */
|