qhead
m = qhead(&b->queue);
next_len = m_pktlen(qhead(cl->cl_q));
return qhead(cl->cl_q);
return qhead(cl->cl_q);
return qhead(cl->q_);
for (k = 0, mp = &sc->qhead; \
sc->qtail = &sc->qhead;
struct mbuf *m = sc->qhead;
if ((sc->qhead = m->m_nextpkt) == NULL)
sc->qtail = &sc->qhead;
m->m_nextpkt = sc->qhead;
sc->qhead = m;
if (sc->qtail == &sc->qhead)
if (sc->qhead && (sc->flags & FLG_TIMEOUT) == 0) {
m_freem(sc->qhead);
struct mbuf *qhead, **qtail; /* Queue of outgoing mbuf's */
struct ieee80211_psq_head *qhead;
qhead = &psq->psq_head[0];
if ((m = qhead->head) != NULL) {
if ((qhead->head = m->m_nextpkt) == NULL)
qhead->tail = NULL;
KASSERT(qhead->len > 0, ("qhead len %d", qhead->len));
qhead->len--;
if (m == NULL && qhead == &psq->psq_head[0]) {
qhead = &psq->psq_head[1];
struct ieee80211_psq_head *qhead;
qhead = &psq->psq_head[0];
while ((m = qhead->head) != NULL) {
qhead->head = m->m_nextpkt;
qhead->tail = NULL;
qhead->len = 0;
if (qhead == &psq->psq_head[0]) { /* Algol-68 style for loop */
qhead = &psq->psq_head[1];
struct ieee80211_psq_head *qhead;
qhead = &psq->psq_head[0];
while ((m = qhead->head) != NULL &&
if ((qhead->head = m->m_nextpkt) == NULL)
qhead->tail = NULL;
KASSERT(qhead->len > 0, ("qhead len %d", qhead->len));
qhead->len--;
if (qhead == &psq->psq_head[0]) { /* Algol-68 style for loop */
qhead = &psq->psq_head[1];
struct ieee80211_psq_head *qhead;
qhead = &psq->psq_head[0];
qhead = &psq->psq_head[1];
if (qhead->tail == NULL) {
qhead->head = m;
if (qhead == &psq->psq_head[1]) {
qhead->tail->m_nextpkt = m;
age -= M_AGE_GET(qhead->head);
qhead->tail = m;
qhead->len++;
struct ieee80211_psq_head *qhead;
qhead = &psq->psq_head[0]; /* 802.11 frames */
if (qhead->head != NULL) {
parent_q = qhead->head;
qhead->head = qhead->tail = NULL;
qhead->len = 0;
qhead = &psq->psq_head[1]; /* 802.3 frames */
if (qhead->head != NULL) {
ifp_q = qhead->head;
qhead->head = qhead->tail = NULL;
qhead->len = 0;
qptr = TAILQ_LAST(&qhead, circlehead);
TAILQ_REMOVE(&qhead, qptr, links);
while (!TAILQ_EMPTY(&qhead)) {
qptr = TAILQ_FIRST(&qhead); /* save this */
TAILQ_REMOVE(&qhead, qptr, links);
TAILQ_FOREACH(qptr, &qhead, links) {
if (TAILQ_FIRST(&qhead)->dbptr->flags & flag)
TAILQ_INSERT_HEAD(&qhead, qptr, links);
TAILQ_FOREACH(qptr, &qhead, links) {
if (qptr != TAILQ_FIRST(&qhead)) {
TAILQ_REMOVE(&qhead, qptr, links);
TAILQ_INSERT_HEAD(&qhead, qptr, links);
TAILQ_FIRST(&qhead)->dbptr->size = 0;
if (TAILQ_FIRST(&qhead)->dbptr->size) {
TAILQ_FIRST(&qhead)->dbptr->key = "";
TAILQ_FIRST(&qhead)->dbptr->size = 0;
TAILQ_FIRST(&qhead)->dbptr->size = 0;
TAILQ_FIRST(&qhead)->dbptr->size = 0;
if (TAILQ_FIRST(&qhead)->dbptr->size) {
TAILQ_FIRST(&qhead)->dbptr->key = key->data;
TAILQ_FIRST(&qhead)->dbptr->size = key->size;
TAILQ_FIRST(&qhead)->dbptr->key = key->data;
TAILQ_FIRST(&qhead)->dbptr->size = key->size;
if (TAILQ_FIRST(&qhead)->dbptr->key == NULL) {
TAILQ_FIRST(&qhead)->dbptr->size = 0;
TAILQ_FIRST(&qhead)->dbptr->size = 0;
TAILQ_FIRST(&qhead)->dbptr->size = 0;
if (TAILQ_FIRST(&qhead)->dbptr->size) {
TAILQ_FIRST(&qhead)->dbptr->key = key->data;
TAILQ_FIRST(&qhead)->dbptr->size = key->size;
static TAILQ_HEAD(circlehead, circleq_entry) qhead;
TAILQ_INIT(&qhead);
static TAILQ_HEAD(dns_qhead, circleq_dnsentry) qhead;
TAILQ_INIT(&qhead);
TAILQ_FOREACH(q, &qhead, links) {
q = TAILQ_FIRST(&qhead);
TAILQ_REMOVE(&qhead, q, links);
TAILQ_REMOVE(&qhead, q, links);
TAILQ_INSERT_HEAD(&qhead, q, links);
TAILQ_INSERT_HEAD(&qhead, q, links);