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 WRITE_ONCE(q->backlogs[idx], q->backlogs[idx] - len); in fq_codel_drop() 207 WRITE_ONCE(q->backlogs[idx], q->backlogs[idx] + qdisc_pkt_len(skb)); in fq_codel_enqueue() 228 * in q->backlogs[] to find a fat flow. in fq_codel_enqueue() 242 * but in this case, our parents wont increase their backlogs. in fq_codel_enqueue() 267 WRITE_ONCE(q->backlogs[flo in dequeue_func() [all...]
153 u32 backlogs[CAKE_QUEUES]; member1473 return q->tins[ii.t].backlogs[ii.b]; in cake_heap_get_backlog()1602 WRITE_ONCE(b->backlogs[idx], b->backlogs[idx] - len); in cake_drop()1833 WRITE_ONCE(b->backlogs[idx], b->backlogs[idx] + slen); in cake_enqueue()1870 WRITE_ONCE(b->backlogs[idx], b->backlogs[idx] + len - ack_pkt_len); in cake_enqueue()1983 WRITE_ONCE(b->backlogs[q->cur_flow], b->backlogs[q->cur_flow] - len); in cake_dequeue_one()3155 qs.backlog = READ_ONCE(b->backlogs[idx % CAKE_QUEUES]); in cake_dump_class_stats()