qlimit
statsp->qmax = qlimit(cl->q_);
cbqrestart, a->qlimit, RM_MAXQUEUED,
rmc_delay_action, a->qlimit, parent, borrow,
cl = fairq_class_create(pif, a->priority, a->qlimit, a->bandwidth,
fairq_class_create(struct fairq_if *pif, int pri, int qlimit,
if (qlimit == 0)
qlimit = 50; /* use default */
cl->cl_qlimit = qlimit;
qlimit(&cl->cl_buckets[i].queue) = qlimit;
if (qlen(&b->queue) >= qlimit(&b->queue)) {
sp->qlimit = cl->cl_qlimit;
u_int qlimit;
sp->qlimit = qlimit(cl->cl_q);
cl = hfsc_class_create(hif, &rtsc, &lssc, &ulsc, parent, a->qlimit,
struct hfsc_class *parent, int qlimit, int flags, int qid)
if (qlimit == 0)
qlimit = 50; /* use default */
qlimit(cl->cl_q) = qlimit;
qlimit(cl->cl_q) * 10/100,
qlimit(cl->cl_q) * 30/100,
if (qlen(cl->cl_q) >= qlimit(cl->cl_q)) {
u_int qlimit;
cl = priq_class_create(pif, a->priority, a->qlimit,
priq_class_create(struct priq_if *pif, int pri, int qlimit, int flags, int qid)
if (qlimit == 0)
qlimit = 50; /* use default */
qlimit(cl->cl_q) = qlimit;
qlimit(cl->cl_q) * 10/100,
qlimit(cl->cl_q) * 30/100,
if (qlen(cl->cl_q) >= qlimit(cl->cl_q)) {
sp->qlimit = qlimit(cl->cl_q);
u_int qlimit;
if (droptype == DTYPE_NODROP && qlen(q) >= qlimit(q))
if (droptype == DTYPE_NODROP && qlen(q) >= qlimit(q))
qlimit(cl->q_) = maxq;
qlimit(cl->q_) * 10/100,
qlimit(cl->q_) * 30/100,
qlimit(cl->q_) = maxq;
if (qlen(cl->q_) > qlimit(cl->q_)) {
u_int16_t qlimit; /* queue size limit */
a.qlimit = $3.qlimit;
a.qlimit = $4.qlimit;
queue_opts.qlimit = DEFAULT_QLIMIT;
queue_opts.qlimit = DEFAULT_QLIMIT;
queue_opts.qlimit = $2;
int qlimit;
pb.qlimit = pa.qlimit;
if (a->qlimit != DEFAULT_QLIMIT)
printf("qlimit %u ", a->qlimit);
if (a->qlimit != DEFAULT_QLIMIT)
printf("qlimit %u ", a->qlimit);
if (pa->qlimit == 0)
pa->qlimit = DEFAULT_QLIMIT;
cur.data.priq_stats.qlength, cur.data.priq_stats.qlimit);
cur.data.hfsc_stats.qlength, cur.data.hfsc_stats.qlimit);
cur.data.fairq_stats.qlength, cur.data.fairq_stats.qlimit);