Searched refs:backlogs (Results 1 – 2 of 2) sorted by relevance
54 u32 *backlogs; /* backlog table [flows_cnt] */ member155 if (q->backlogs[i] > maxbacklog) { in fq_codel_drop()156 maxbacklog = q->backlogs[i]; in fq_codel_drop()176 q->backlogs[idx] -= len; in fq_codel_drop()206 q->backlogs[idx] += qdisc_pkt_len(skb); in fq_codel_enqueue()265 q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb); in dequeue_func()349 memset(q->backlogs, 0, q->flows_cnt * sizeof(u32)); in fq_codel_reset()455 kvfree(q->backlogs); in fq_codel_destroy()496 q->backlogs = kvcalloc(q->flows_cnt, sizeof(u32), GFP_KERNEL); in fq_codel_init()497 if (!q->backlogs) { in fq_codel_init()[all …]
151 u32 backlogs[CAKE_QUEUES]; member1412 return q->tins[ii.t].backlogs[ii.b]; in cake_heap_get_backlog()1538 b->backlogs[idx] -= len; in cake_drop()1767 b->backlogs[idx] += slen; in cake_enqueue()1802 b->backlogs[idx] += len; in cake_enqueue()1921 b->backlogs[q->cur_flow] -= len; in cake_dequeue_one()3007 qs.backlog = b->backlogs[idx % CAKE_QUEUES]; in cake_dump_class_stats()