Lines Matching defs:qlen
178 int d = q->qs[x].qlen + SFQ_DEPTH;
196 if (n == p && q->max_depth == q->qs[x].qlen + 1)
211 d = q->qs[x].qlen;
235 sch->q.qlen--;
251 sch->q.qlen--;
276 if (q->qs[x].qlen == 1) { /* The flow is new */
287 if (++sch->q.qlen < q->limit-1) {
312 if (q->qs[x].qlen == 1) { /* The flow is new */
323 if (++sch->q.qlen < q->limit - 1) {
352 sch->q.qlen--;
356 if (q->qs[a].qlen == 0) {
399 unsigned int qlen;
410 qlen = sch->q.qlen;
411 while (sch->q.qlen >= q->limit-1)
413 qdisc_tree_decrease_qlen(sch, qlen - sch->q.qlen);