Home
last modified time | relevance | path

Searched refs:backlogs (Results 1 – 2 of 2) sorted by relevance

/linux/net/sched/
H A Dsch_fq_codel.c54 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()
267 WRITE_ONCE(q->backlogs[flow - q->flows], in dequeue_func()
268 q->backlogs[flow - q->flows] - qdisc_pkt_len(skb)); in dequeue_func()
387 memset(q->backlogs, 0, q->flows_cnt * sizeof(u32)); in fq_codel_reset()
504 kvfree(q->backlogs); in fq_codel_destroy()
543 q->backlogs = kvcalloc(q->flows_cnt, sizeof(u32), GFP_KERNEL); in fq_codel_init()
[all …]
H A Dsch_cake.c153 u32 backlogs[CAKE_QUEUES]; member
1473 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()
1982 WRITE_ONCE(b->backlogs[q->cur_flow], b->backlogs[q->cur_flow] - len); in cake_dequeue_one()
3154 qs.backlog = READ_ONCE(b->backlogs[idx % CAKE_QUEUES]); in cake_dump_class_stats()