Searched refs:backlogs (Results 1 – 2 of 2) sorted by relevance
54 u32 *backlogs; /* backlog table [flows_cnt] */ member 155 if (q->backlogs[i] > maxbacklog) { in fq_codel_drop() 156 maxbacklog = q->backlogs[i]; in fq_codel_drop() 177 q->backlogs[idx] -= len; in fq_codel_drop() 207 q->backlogs[idx] += qdisc_pkt_len(skb); in fq_codel_enqueue() 227 * in q->backlogs[] to find a fat flow. in fq_codel_enqueue() 241 * but in this case, our parents wont increase their backlogs. in fq_codel_enqueue() 266 q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb); in dequeue_func() 348 memset(q->backlogs, 0, q->flows_cnt * sizeof(u32)); in fq_codel_reset() 465 kvfree(q->backlogs); in fq_codel_destroy() [all...]
153 u32 backlogs[CAKE_QUEUES]; member 1471 return q->tins[ii.t].backlogs[ii.b]; in cake_heap_get_backlog() 1597 b->backlogs[idx] -= len; in cake_drop() 1827 b->backlogs[idx] += slen; in cake_enqueue() 1864 b->backlogs[idx] += len - ack_pkt_len; in cake_enqueue() 1979 b->backlogs[q->cur_flow] -= len; in cake_dequeue_one() 3140 qs.backlog = b->backlogs[idx % CAKE_QUEUES]; in cake_dump_class_stats()