Searched refs:backlogs (Results 1 - 6 of 6) sorted by relevance
| /kernel/linux/linux-5.10/include/net/ |
| H A D | fq_impl.h | 36 list_for_each_entry_continue(i, &fq->backlogs, backlogchain) in fq_rejigger_backlog()
145 list_add_tail(&flow->backlogchain, &fq->backlogs); in fq_recalc_backlog()
148 list_for_each_entry_continue_reverse(i, &fq->backlogs, in fq_recalc_backlog()
187 flow = list_first_entry_or_null(&fq->backlogs, in fq_tin_enqueue()
308 INIT_LIST_HEAD(&fq->backlogs); in fq_init()
|
| H A D | fq.h | 62 * @backlogs: linked to fq_flows. Used to maintain fat flows for efficient
69 struct list_head backlogs; member
|
| /kernel/linux/linux-5.10/net/sched/ |
| H A D | sch_fq_codel.c | 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()
176 q->backlogs[idx] -= len; in fq_codel_drop()
206 q->backlogs[idx] += qdisc_pkt_len(skb); in fq_codel_enqueue()
226 * in q->backlogs[] to find a fat flow. in fq_codel_enqueue()
240 * but in this case, our parents wont increase their backlogs. 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()
451 kvfree(q->backlogs); in fq_codel_destroy()
[all...] |
| H A D | sch_cake.c | 151 u32 backlogs[CAKE_QUEUES]; member
1412 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()
3010 qs.backlog = b->backlogs[idx % CAKE_QUEUES]; in cake_dump_class_stats()
|
| /kernel/linux/linux-6.6/net/sched/ |
| H A D | sch_fq_codel.c | 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()
176 q->backlogs[idx] -= len; in fq_codel_drop()
206 q->backlogs[idx] += qdisc_pkt_len(skb); in fq_codel_enqueue()
226 * in q->backlogs[] to find a fat flow. in fq_codel_enqueue()
240 * but in this case, our parents wont increase their backlogs. 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()
[all...] |
| H A D | sch_cake.c | 152 u32 backlogs[CAKE_QUEUES]; member
1413 return q->tins[ii.t].backlogs[ii.b]; in cake_heap_get_backlog()
1539 b->backlogs[idx] -= len; in cake_drop()
1768 b->backlogs[idx] += slen; in cake_enqueue()
1803 b->backlogs[idx] += len; in cake_enqueue()
1922 b->backlogs[q->cur_flow] -= len; in cake_dequeue_one()
3008 qs.backlog = b->backlogs[idx % CAKE_QUEUES]; in cake_dump_class_stats()
|
Completed in 11 milliseconds