qlen
unsigned int qlen;
_listen(fd, (int)bindaddr->qlen);
int i, qlen;
qlen = textleaf->crc_len - 2;
if (len < qlen * 4)
qlen = len/4;
for (i = 0; i < qlen; i ++)
if (len <= qlen * 4)
buf[qlen * 4] = 0;
#define ISP_NXT_QENTRY(idx, qlen) (((idx) + 1) & ((qlen)-1))
#define ISP_QFREE(in, out, qlen) \
((in == out)? (qlen - 1) : ((in > out)? \
((qlen - 1) - (in - out)) : (out - in - 1)))
int error = 0, qlen, msi_enable;
qlen = RE_IFQ_MAXLEN;
if (sc->re_tx_desc_cnt > qlen)
qlen = sc->re_tx_desc_cnt;
ifq_set_maxlen(&ifp->if_snd, qlen);
int qlen = so->so_qlen;
if (soavailconn > 0 && qlen > soavailconn)
qlen = soavailconn;
kn->kn_data = qlen;
statsp->qcnt = qlen(cl->q_);
qlen(q)--;
n = krandom() % qlen(q) + 1;
qlen(q)--;
qlen(q)--;
qlen(q)++;
qlen(q)--;
if (qlen(&b->queue) >= qlimit(&b->queue)) {
KKASSERT(qlen(&b->queue) == 0);
sp->qlength += qlen(&b->queue);
sp->qlength = qlen(cl->cl_q);
qlen(cl->cl_q) = 0;
if (qlen(cl->cl_q) == 1)
if (qlen(cl->cl_q) >= qlimit(cl->cl_q)) {
KKASSERT(qlen(cl->cl_q) == 0);
qlen(cl->cl_q) = 0;
if (qlen(cl->cl_q) >= qlimit(cl->cl_q)) {
KKASSERT(qlen(cl->cl_q) == 0);
sp->qlength = qlen(cl->cl_q);
avg += (qlen(q) << FP_SHIFT) - (avg >> rp->red_wshift);
if (avg >= rp->red_thmin_s && qlen(q) > 1) {
if (droptype == DTYPE_NODROP && qlen(q) >= qlimit(q))
avg += (prec->qlen << FP_SHIFT) - (avg >> rp->rio_wshift);
if (avg >= prec->th_min_s && prec->qlen > 1) {
if (droptype == DTYPE_NODROP && qlen(q) >= qlimit(q))
rp->rio_precstate[i].qlen++;
if (--rp->rio_precstate[i].qlen == 0) {
int qlen; /* queue length */
if ((qlen(cl->q_) <= 0) || TV_LT(nowp, &borrowed->undertime_)) {
if ((qlen(cl->q_) <= 1) || TV_LT(&now, &borrowed->undertime_)) {
KKASSERT(qlen(cl->q_) > 0);
qlen(cl->q_) = 0;
if (qlen(cl->q_) > qlimit(cl->q_)) {
if (!cl->sleeping_ && (qlen(cl->q_) > cl->qthresh_))
int i, q, qlen;
qlen = -1;
TUNABLE_INT_FETCH(qlenname, &qlen);
if (qlen > 0) {
if_printf(ifp, "qlenmax -> %d\n", qlen);
ifq_set_maxlen(ifq, qlen);
priv->qlen++;
priv->qlen--;
priv->qlen--;
if (priv->qlen > MP_MAX_QUEUE_LEN) {
priv->qlen--;
priv->qlen--;
priv->qlen = 0;
int qlen; /* fraq queue length */
if (k != sc->qlen || k > MAX_MBUFQ || *mp || mp != sc->qtail) \
sc->qlen--;
sc->qlen++;
if (sc->qlen >= MAX_MBUFQ)
sc->qlen++;
if (sc->qlen == 1)
short qlen; /* Length of queue */
((ng_bt3c_node_qlen_ep *)(rsp->data))->qlen =
((ng_bt3c_node_qlen_ep *)(rsp->data))->qlen =
if (((ng_bt3c_node_qlen_ep *)(msg->data))->qlen <= 0) {
(msg->data))->qlen; /* XXX */
(msg->data))->qlen; /* XXX */
int qlen;
qlen = IF_QLEN(&sc->outq);
if (qlen == 1)
int error = 0, queue, qlen;
qlen = ((ng_ubt_node_qlen_ep *) (msg->data))->qlen;
q->maxlen = qlen;
((ng_ubt_node_qlen_ep *) (rsp->data))->qlen = q->maxlen;
int32_t qlen; /* queue length */
int32_t qlen; /* queue length */
int qlen;
qlen = sc->outq.ifq_len;
if (qlen == 1) {
struct mbuf *ieee80211_node_psq_dequeue(struct ieee80211_node *ni, int *qlen);
int qlen;
m = ieee80211_node_psq_dequeue(ni, &qlen);
if (qlen != 0) {
"recv ps-poll, send packet, %u still queued", qlen);
ieee80211_node_psq_dequeue(struct ieee80211_node *ni, int *qlen)
if (qlen != NULL)
*qlen = psq->psq_len;
int qlen;
qlen = psq->psq_len;
return qlen;
int qlen, age;
qlen = ++(psq->psq_len);
"save frame with age %d, %u now queued", age, qlen);
if (qlen == 1 && vap->iv_set_tim != NULL)
int qlen = 0;
qlen++;
qlen++;
if (qlen > 5)
printf("Enque. Size: %d\n", qlen);
int qlen = 0;
qlen++;
qlen++;
if (qlen > 5)
printf("Enque. Size: %d\n", qlen);
uint64_t qlen;
qlen = 0;
qlen = q->nstats.priq.qlength;
qlen = q->nstats.hfsc.qlength;
qlen = q->nstats.fairq.qlength;
qlen = 0;
else if (qlen)
"%9jdQ", (intmax_t)qlen);