Home
last modified time | relevance | path

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

/Linux-v4.19/net/sched/
Dsch_fq_codel.c60 u32 *backlogs; /* backlog table [flows_cnt] */ member
161 if (q->backlogs[i] > maxbacklog) { in fq_codel_drop()
162 maxbacklog = q->backlogs[i]; in fq_codel_drop()
181 q->backlogs[idx] -= len; in fq_codel_drop()
211 q->backlogs[idx] += qdisc_pkt_len(skb); in fq_codel_enqueue()
271 q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb); in dequeue_func()
362 memset(q->backlogs, 0, q->flows_cnt * sizeof(u32)); in fq_codel_reset()
458 kvfree(q->backlogs); in fq_codel_destroy()
499 q->backlogs = kvcalloc(q->flows_cnt, sizeof(u32), GFP_KERNEL); in fq_codel_init()
500 if (!q->backlogs) { in fq_codel_init()
[all …]
Dsch_cake.c151 u32 backlogs[CAKE_QUEUES]; member
1365 return q->tins[ii.t].backlogs[ii.b]; in cake_heap_get_backlog()
1491 b->backlogs[idx] -= len; in cake_drop()
1694 b->backlogs[idx] += slen; in cake_enqueue()
1729 b->backlogs[idx] += len; in cake_enqueue()
1838 b->backlogs[q->cur_flow] -= len; in cake_dequeue_one()
2918 qs.backlog = b->backlogs[idx % CAKE_QUEUES]; in cake_dump_class_stats()
/Linux-v4.19/include/net/
Dfq_impl.h37 list_for_each_entry_continue(i, &fq->backlogs, backlogchain) in fq_rejigger_backlog()
144 list_add_tail(&flow->backlogchain, &fq->backlogs); in fq_recalc_backlog()
147 list_for_each_entry_continue_reverse(i, &fq->backlogs, in fq_recalc_backlog()
186 flow = list_first_entry_or_null(&fq->backlogs, in fq_tin_enqueue()
307 INIT_LIST_HEAD(&fq->backlogs); in fq_init()
Dfq.h70 struct list_head backlogs; member