qlen
unsigned int qlen;
size_t qlen;
qlen = (n + 1) * sizeof(*hent->h_aliases);
if ((size_t)(ep - bp) < qlen)
memcpy(bp, aliases, qlen);
bp += qlen;
qlen = (n + 1) * sizeof(*hent->h_addr_list);
if ((size_t)(ep - bp) < qlen)
memcpy(bp, addr_ptrs, qlen);
listen(fd, (int)bindaddr->qlen) == -1) {
size_t qlen;
qlen = 0;
if ((n = recv(fd, &buf[qlen], sizeof(buf) - qlen, 0)) < 0) {
qlen += n;
if (qlen >= sizeof(buf)) {
if ((qlen >= 2) && (buf[qlen - 2] == '\r') &&
(buf[qlen - 1] == '\n'))
buf[qlen - 2] = '\0';
qlen(rqp->rq_q) = 0;
q_stats->q_len = qlen(rqp->rq_q);
if (drop_early(rp) && qlen(q) > 1) {
if (droptype == DTYPE_NODROP && qlen(q) >= qlimit(q))
statsp->qcnt = qlen(cl->q_);
qlen(q)++;
qlen(q)--;
qlen(q)--;
n = cprng_fast32() % qlen(q) + 1;
qlen(q)--;
qlen(q)--;
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)) {
ASSERT(qlen(cl->cl_q) == 0);
sp->qlength = qlen(cl->cl_q);
qlen(cl->cl_q) = 0;
if (jif->jif_separate && qlen(cl->cl_q) >= jif->jif_qlimit) {
ASSERT(qlen(cl->cl_q) == 0);
qlen(cl->cl_q) = 0;
if (qlen(cl->cl_q) >= qlimit(cl->cl_q)) {
ASSERT(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))
qlen(rqp->rq_q) = 0;
q_stats->q_len = qlen(rqp->rq_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) {
qlen(rqp->rq_q) = 0;
q_stats->q_len[i] = rp->rio_precstate[i].qlen;
int qlen; /* queue length */
if ((qlen(cl->q_) <= 0) || TS_LT(nowp, &borrowed->undertime_)) {
if ((qlen(cl->q_) <= 1) || TS_LT(&now, &borrowed->undertime_)) {
ASSERT(qlen(cl->q_) > 0);
qlen(q)++;
ASSERT(qlen(q) == 1);
qlen(q)--;
ASSERT(qlen(q) == 1);
qlen(q)--;
ASSERT(qlen(q) == 1);
n = cprng_fast32() % qlen(q) + 1;
qlen(q)--;
qlen(q)--;
ASSERT(qlen(q) == 0);
qlen(cl->q_) = 0;
if (qlen(cl->q_) > qlimit(cl->q_)) {
if (!cl->sleeping_ && (qlen(cl->q_) > cl->qthresh_))
#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)))
rtw_txsoft_blk_setup(struct rtw_txsoft_blk *tsb, u_int qlen)
tsb->tsb_ndesc = qlen;
tsb->tsb_desc = malloc(qlen * sizeof(*tsb->tsb_desc), M_DEVBUF,
int qlen[RTW_NTXPRI] =
rc = rtw_txsoft_blk_setup(&tsbs[pri], qlen[pri]);
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;
uint32_t qlen;
return (l->qlen);
l->qlen++;
l->qlen--;
txq.qlen = htole16(sc->sc_tx_ring_ndescs);
uint16_t qlen;
{ offsetof(struct ixl_hmc_rxq, qlen), 13, 89 },
rxq.qlen = htole16(sc->sc_rx_ring_ndescs);
uint16_t qlen;
{ offsetof(struct ixl_hmc_txq, qlen), 13, 33 + 128 },
(_q_)->qlen--; \
if ((_q_)->qlen == 0) { \
(_q_)->qlen--; \
if ((_q_)->qlen == 0) { \
sstfq->left.qlen, sstfq->right.qlen,
sstfq->lopri.qlen);
sstfq->lopri.qlen++;
sstfq->left.qlen++;
sstfq->right.qlen++;
queue->qlen--;
sstfq->left.qlen, sstfq->right.qlen, sstfq->lopri.qlen);
RF_ASSERT(sstfq->left.qlen == 0);
RF_ASSERT(sstfq->right.qlen == 0);
RF_ASSERT(sstfq->lopri.qlen == 0);
RF_ASSERT(sstfq->right.qlen == 0);
scanq->left.qlen, scanq->right.qlen, scanq->lopri.qlen);
RF_ASSERT(scanq->left.qlen == 0);
RF_ASSERT(scanq->right.qlen == 0);
RF_ASSERT(scanq->lopri.qlen == 0);
RF_ASSERT(scanq->right.qlen == 0);
cscanq->left.qlen, cscanq->right.qlen,
cscanq->lopri.qlen);
RF_ASSERT(cscanq->right.qlen == 0);
RF_ASSERT(cscanq->left.qlen == 0);
RF_ASSERT(cscanq->lopri.qlen == 0);
cscanq->left.qlen = 0;
r->raidPtr->raidid, n, sstfq->left.qlen,
sstfq->right.qlen, sstfq->lopri.qlen);
#define QSUM(_sstfq_) (((_sstfq_)->lopri.qlen)+((_sstfq_)->left.qlen)+((_sstfq_)->right.qlen))
int qlen;
void *qbuf, size_t qlen,
msg = kmem_alloc(sizeof(*msg) + qlen, KM_SLEEP);
msg->rm_len = htole32(sizeof(*msg) + qlen);
msg->rm_infobuflen = htole32(qlen);
if (qlen != 0) {
memcpy((char*)msg + 20, qbuf, qlen);
kmem_free(msg, sizeof(*msg) + qlen);
int qlen;
IEEE80211_NODE_SAVEQ_DEQUEUE(ni, m, qlen);
if (qlen != 0)
int qlen;
IEEE80211_NODE_SAVEQ_DEQUEUE(ni, m, qlen);
if (qlen != 0) {
ether_snprintf(ebuf, sizeof(ebuf), ni->ni_macaddr), qlen);
IEEE80211_NODE_SAVEQ_DRAIN(ni, qlen);
if (qlen != 0 && ic->ic_set_tim != NULL)
int i, qlen;
int qlen, age;
_IEEE80211_NODE_SAVEQ_ENQUEUE(ni, m, qlen, age);
ether_sprintf(ni->ni_macaddr), age, qlen);
if (qlen == 1)
int qlen;
chan->qlen--;
assert(chan->qlen == 0);
while (chan->qlen > 0) {
chan->qlen--;
if (chan->qlen > CHANNEL_MAXQLEN)
if (chan->qlen > CHANNEL_MAXQLEN) {
chan->qlen++;
*qlen = atoi(buff2);
get_pr_status(printername pn, bool_t *avail, bool_t *printing, int *qlen, bool_t *needs_operator, char *status, size_t statuslen)
*qlen = 0;
get_pr_status(printername pn, bool_t *avail, bool_t *printing, int *qlen, bool_t *needs_operator, char *status, size_t statuslen)
*qlen = 0;
rp->stat, rp->qlen, rp->qshown, rp->cm);
printf("qlen = %d, status = '%s'\n", rp->qlen, rp->status);
arg->just_mine, &res.qlen, &res.qshown);
&res.qlen, &res.needs_operator, &status[0], sizeof(status));