| /kernel/linux/linux-5.10/include/net/ |
| H A D | fq_impl.h | 80 flow = list_first_entry(head, struct fq_flow, flowchain); in fq_tin_dequeue()
84 list_move_tail(&flow->flowchain, in fq_tin_dequeue()
94 list_move_tail(&flow->flowchain, &tin->old_flows); in fq_tin_dequeue()
96 list_del_init(&flow->flowchain); in fq_tin_dequeue()
178 if (list_empty(&flow->flowchain)) { in fq_tin_enqueue()
180 list_add_tail(&flow->flowchain, in fq_tin_enqueue()
241 list_for_each_entry(flow, &tin->new_flows, flowchain) in fq_tin_filter()
243 list_for_each_entry(flow, &tin->old_flows, flowchain) in fq_tin_filter()
256 if (!list_empty(&flow->flowchain)) in fq_flow_reset()
257 list_del_init(&flow->flowchain); in fq_flow_reset()
[all...] |
| H A D | fq.h | 19 * @flowchain: can be linked to fq_tin's new_flows or old_flows. Used for DRR++
31 struct list_head flowchain; member
|
| /kernel/linux/linux-6.6/include/net/ |
| H A D | fq_impl.h | 108 flow = list_first_entry(head, struct fq_flow, flowchain); in fq_tin_dequeue()
112 list_move_tail(&flow->flowchain, in fq_tin_dequeue()
122 list_move_tail(&flow->flowchain, &tin->old_flows); in fq_tin_dequeue()
124 list_del_init(&flow->flowchain); in fq_tin_dequeue()
228 if (list_empty(&flow->flowchain)) { in fq_tin_enqueue()
230 list_add_tail(&flow->flowchain, in fq_tin_enqueue()
283 list_for_each_entry(flow, &tin->new_flows, flowchain) in fq_tin_filter()
285 list_for_each_entry(flow, &tin->old_flows, flowchain) in fq_tin_filter()
299 if (!list_empty(&flow->flowchain)) { in fq_flow_reset()
300 list_del_init(&flow->flowchain); in fq_flow_reset()
[all...] |
| H A D | fq.h | 23 * @flowchain: can be linked to fq_tin's new_flows or old_flows. Used for DRR++
33 struct list_head flowchain; member
|
| /kernel/linux/linux-5.10/net/sched/ |
| H A D | sch_hhf.c | 116 struct list_head flowchain; /* chaining under hash collision */ member
190 list_for_each_entry_safe(flow, next, head, flowchain) { in seek_list()
197 if (list_is_last(&flow->flowchain, head)) in seek_list()
199 list_del(&flow->flowchain); in seek_list()
220 list_for_each_entry(flow, head, flowchain) { in alloc_new_hh()
238 INIT_LIST_HEAD(&flow->flowchain); in alloc_new_hh()
239 list_add_tail(&flow->flowchain, head); in alloc_new_hh()
490 list_for_each_entry_safe(flow, next, head, flowchain) { in hhf_destroy()
491 list_del(&flow->flowchain); in hhf_destroy()
|
| H A D | sch_fq_pie.c | 40 * @flowchain: flowchain for the flow
49 struct list_head flowchain; member
186 if (list_empty(&sel_flow->flowchain)) { in fq_pie_qdisc_enqueue()
187 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue()
251 flow = list_first_entry(head, struct fq_pie_flow, flowchain); in fq_pie_qdisc_dequeue()
255 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
270 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
272 list_del_init(&flow->flowchain); in fq_pie_qdisc_dequeue()
450 INIT_LIST_HEAD(&flow->flowchain); in fq_pie_init()
[all...] |
| H A D | sch_fq_codel.c | 45 struct list_head flowchain; member
209 if (list_empty(&flow->flowchain)) { in fq_codel_enqueue()
210 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue()
295 flow = list_first_entry(head, struct fq_codel_flow, flowchain); in fq_codel_dequeue()
299 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
310 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
312 list_del_init(&flow->flowchain); in fq_codel_dequeue()
346 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_reset()
500 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_init()
676 if (list_empty(&q->flows[i].flowchain) || in fq_codel_walk()
[all...] |
| H A D | sch_cake.c | 129 struct list_head flowchain; member
1853 /* flowchain */ in cake_enqueue()
1860 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1863 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
2051 flow = list_first_entry(head, struct cake_flow, flowchain); in cake_dequeue()
2100 list_move_tail(&flow->flowchain, &b->old_flows); in cake_dequeue()
2115 /* keep in the flowchain until the state has in cake_dequeue()
2118 list_move_tail(&flow->flowchain, in cake_dequeue()
2137 /* remove empty queue from the flowchain */ in cake_dequeue()
2138 list_del_init(&flow->flowchain); in cake_dequeue()
[all...] |
| /kernel/linux/linux-6.6/net/sched/ |
| H A D | sch_hhf.c | 116 struct list_head flowchain; /* chaining under hash collision */ member
190 list_for_each_entry_safe(flow, next, head, flowchain) { in seek_list()
197 if (list_is_last(&flow->flowchain, head)) in seek_list()
199 list_del(&flow->flowchain); in seek_list()
220 list_for_each_entry(flow, head, flowchain) { in alloc_new_hh()
238 INIT_LIST_HEAD(&flow->flowchain); in alloc_new_hh()
239 list_add_tail(&flow->flowchain, head); in alloc_new_hh()
490 list_for_each_entry_safe(flow, next, head, flowchain) { in hhf_destroy()
491 list_del(&flow->flowchain); in hhf_destroy()
|
| H A D | sch_fq_pie.c | 40 * @flowchain: flowchain for the flow
49 struct list_head flowchain; member
186 if (list_empty(&sel_flow->flowchain)) { in fq_pie_qdisc_enqueue()
187 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue()
251 flow = list_first_entry(head, struct fq_pie_flow, flowchain); in fq_pie_qdisc_dequeue()
255 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
270 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
272 list_del_init(&flow->flowchain); in fq_pie_qdisc_dequeue()
449 INIT_LIST_HEAD(&flow->flowchain); in fq_pie_init()
[all...] |
| H A D | sch_fq_codel.c | 45 struct list_head flowchain; member
209 if (list_empty(&flow->flowchain)) { in fq_codel_enqueue()
210 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue()
295 flow = list_first_entry(head, struct fq_codel_flow, flowchain); in fq_codel_dequeue()
299 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
310 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
312 list_del_init(&flow->flowchain); in fq_codel_dequeue()
346 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_reset()
504 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_init()
685 if (list_empty(&q->flows[i].flowchain)) { in fq_codel_walk()
[all...] |
| H A D | sch_cake.c | 130 struct list_head flowchain; member
1854 /* flowchain */ in cake_enqueue()
1861 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1864 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
2052 flow = list_first_entry(head, struct cake_flow, flowchain); in cake_dequeue()
2101 list_move_tail(&flow->flowchain, &b->old_flows); in cake_dequeue()
2116 /* keep in the flowchain until the state has in cake_dequeue()
2119 list_move_tail(&flow->flowchain, in cake_dequeue()
2138 /* remove empty queue from the flowchain */ in cake_dequeue()
2139 list_del_init(&flow->flowchain); in cake_dequeue()
[all...] |