#include <sys/cdefs.h>
#include <sys/param.h>
#include <sys/mbuf.h>
#include <sys/errno.h>
#include <sys/random.h>
#include <sys/kernel_types.h>
#include <sys/sysctl.h>
#include <net/if.h>
#include <net/net_osdep.h>
#include <net/classq/classq.h>
#include <libkern/libkern.h>
u_int32_t classq_verbose = 0;
SYSCTL_NODE(_net, OID_AUTO, classq, CTLFLAG_RW|CTLFLAG_LOCKED, 0, "classq");
SYSCTL_UINT(_net_classq, OID_AUTO, verbose, CTLFLAG_RW|CTLFLAG_LOCKED,
&classq_verbose, 0, "Class queue verbosity level");
void
_qinit(class_queue_t *q, int type, int lim)
{
MBUFQ_INIT(&q->mbufq);
qlimit(q) = lim;
qlen(q) = 0;
qsize(q) = 0;
qtype(q) = type;
qstate(q) = QS_RUNNING;
}
void
_addq(class_queue_t *q, struct mbuf *m)
{
MBUFQ_ENQUEUE(&q->mbufq, m);
qlen(q)++;
VERIFY(qlen(q) != 0);
qsize(q) += m_length(m);
}
void
_addq_multi(class_queue_t *q, struct mbuf *m_head, struct mbuf *m_tail,
u_int32_t cnt, u_int32_t size)
{
MBUFQ_ENQUEUE_MULTI(&q->mbufq, m_head, m_tail);
qlen(q) += cnt;
qsize(q) += size;
}
struct mbuf *
_getq(class_queue_t *q)
{
struct mbuf *m;
MBUFQ_DEQUEUE(&q->mbufq, m);
if (m == NULL) {
VERIFY(qlen(q) == 0);
if (qsize(q) > 0)
qsize(q) = 0;
return (NULL);
}
VERIFY(qlen(q) > 0);
qlen(q)--;
if (((int)qsize(q) - m_length(m)) > 0)
qsize(q) -= m_length(m);
else if (qsize(q) != 0)
qsize(q) = 0;
return (m);
}
static struct mbuf *
_getq_flow_or_scidx(class_queue_t *q, u_int32_t val, boolean_t isflowid)
{
struct mbuf *m, *m_tmp;
MBUFQ_FOREACH_SAFE(m, &q->mbufq, m_tmp) {
if ((isflowid && (val == 0 || ((m->m_flags & M_PKTHDR) &&
m->m_pkthdr.pkt_flowid == val))) ||
(!isflowid &&
MBUF_SCIDX(mbuf_get_service_class(m)) < val)) {
MBUFQ_REMOVE(&q->mbufq, m);
MBUFQ_NEXT(m) = NULL;
break;
}
}
if (m != NULL) {
u_int32_t l = m_length(m);
VERIFY(qlen(q) > 0);
qlen(q)--;
if (((int)qsize(q) - l) > 0)
qsize(q) -= l;
else if (qsize(q) != 0)
qsize(q) = 0;
}
return (m);
}
struct mbuf *
_getq_flow(class_queue_t *q, u_int32_t flow)
{
return (_getq_flow_or_scidx(q, flow, TRUE));
}
struct mbuf *
_getq_scidx_lt(class_queue_t *q, u_int32_t scidx)
{
return (_getq_flow_or_scidx(q, scidx, FALSE));
}
struct mbuf *
_getq_all(class_queue_t *q, struct mbuf **last, u_int32_t *qlenp,
u_int64_t *qsizep)
{
struct mbuf *m;
m = MBUFQ_FIRST(&q->mbufq);
if (last != NULL)
*last = MBUFQ_LAST(&q->mbufq);
MBUFQ_INIT(&q->mbufq);
if (qlenp != NULL)
*qlenp = qlen(q);
if (qsizep != NULL)
*qsizep = qsize(q);
qlen(q) = 0;
qsize(q) = 0;
return (m);
}
struct mbuf *
_getq_tail(class_queue_t *q)
{
struct mq_head *head = &q->mbufq;
struct mbuf *m = MBUFQ_LAST(head);
if (m != NULL) {
struct mbuf *n = MBUFQ_FIRST(head);
while (n != NULL) {
struct mbuf *next = MBUFQ_NEXT(n);
if (next == m) {
MBUFQ_NEXT(n) = NULL;
break;
}
n = next;
}
VERIFY(n != NULL ||
(qlen(q) == 1 && m == MBUFQ_FIRST(head)));
VERIFY(qlen(q) > 0);
--qlen(q);
if (((int)qsize(q) - m_length(m)) > 0)
qsize(q) -= m_length(m);
else if (qsize(q) != 0)
qsize(q) = 0;
if (qempty(q)) {
VERIFY(m == MBUFQ_FIRST(head));
MBUFQ_INIT(head);
} else {
VERIFY(n != NULL);
head->mq_last = &MBUFQ_NEXT(n);
}
}
return (m);
}
struct mbuf *
_getq_random(class_queue_t *q)
{
struct mq_head *head = &q->mbufq;
struct mbuf *m = NULL;
unsigned int n;
u_int32_t rnd;
n = qlen(q);
if (n == 0) {
VERIFY(MBUFQ_EMPTY(head));
if (qsize(q) > 0)
qsize(q) = 0;
return (NULL);
}
m = MBUFQ_FIRST(head);
read_random(&rnd, sizeof (rnd));
n = (rnd % n) + 1;
if (n == 1) {
if ((MBUFQ_FIRST(head) = MBUFQ_NEXT(m)) == NULL)
(head)->mq_last = &MBUFQ_FIRST(head);
} else {
struct mbuf *p = NULL;
VERIFY(n > 1);
while (n--) {
if (MBUFQ_NEXT(m) == NULL)
break;
p = m;
m = MBUFQ_NEXT(m);
}
VERIFY(p != NULL && MBUFQ_NEXT(p) == m);
if ((MBUFQ_NEXT(p) = MBUFQ_NEXT(m)) == NULL)
(head)->mq_last = &MBUFQ_NEXT(p);
}
VERIFY(qlen(q) > 0);
--qlen(q);
if (((int)qsize(q) - m_length(m)) > 0)
qsize(q) -= m_length(m);
else if (qsize(q) != 0)
qsize(q) = 0;
MBUFQ_NEXT(m) = NULL;
return (m);
}
void
_removeq(class_queue_t *q, struct mbuf *m)
{
struct mq_head *head = &q->mbufq;
struct mbuf *m0, **mtail;
m0 = MBUFQ_FIRST(head);
if (m0 == NULL)
return;
if (m0 != m) {
while (MBUFQ_NEXT(m0) != m) {
if (m0 == NULL)
return;
m0 = MBUFQ_NEXT(m0);
}
mtail = &MBUFQ_NEXT(m0);
} else {
mtail = &MBUFQ_FIRST(head);
}
*mtail = MBUFQ_NEXT(m);
if (*mtail == NULL)
head->mq_last = mtail;
VERIFY(qlen(q) > 0);
--qlen(q);
if (((int)qsize(q) - m_length(m)) > 0)
qsize(q) -= m_length(m);
else if (qsize(q) != 0)
qsize(q) = 0;
MBUFQ_NEXT(m) = NULL;
}
void
_flushq(class_queue_t *q)
{
(void) _flushq_flow(q, 0, NULL, NULL);
}
void
_flushq_flow(class_queue_t *q, u_int32_t flow, u_int32_t *cnt, u_int32_t *len)
{
MBUFQ_HEAD(mq_freeq) freeq;
struct mbuf *m, *m_tmp;
u_int32_t c = 0, l = 0;
MBUFQ_INIT(&freeq);
MBUFQ_FOREACH_SAFE(m, &q->mbufq, m_tmp) {
if (flow == 0 || ((m->m_flags & M_PKTHDR) &&
m->m_pkthdr.pkt_flowid == flow)) {
MBUFQ_REMOVE(&q->mbufq, m);
MBUFQ_NEXT(m) = NULL;
MBUFQ_ENQUEUE(&freeq, m);
l += m_length(m);
c++;
}
}
VERIFY(c == 0 || !MBUFQ_EMPTY(&freeq));
if (c > 0) {
VERIFY(qlen(q) >= c);
qlen(q) -= c;
if (((int)qsize(q) - l) > 0)
qsize(q) -= l;
else if (qsize(q) != 0)
qsize(q) = 0;
}
if (!MBUFQ_EMPTY(&freeq))
m_freem_list(MBUFQ_FIRST(&freeq));
if (cnt != NULL)
*cnt = c;
if (len != NULL)
*len = l;
}