| /kernel/linux/linux-5.10/include/net/ |
| H A D | fq_impl.h | 75 head = &tin->old_flows; in fq_tin_dequeue()
85 &tin->old_flows); in fq_tin_dequeue()
91 /* force a pass through old_flows to prevent starvation */ in fq_tin_dequeue()
93 !list_empty(&tin->old_flows)) { in fq_tin_dequeue()
94 list_move_tail(&flow->flowchain, &tin->old_flows); in fq_tin_dequeue()
243 list_for_each_entry(flow, &tin->old_flows, flowchain) in fq_tin_filter()
277 head = &tin->old_flows; in fq_tin_reset()
300 INIT_LIST_HEAD(&tin->old_flows); in fq_tin_init()
|
| H A D | fq.h | 19 * @flowchain: can be linked to fq_tin's new_flows or old_flows. Used for DRR++
45 * @old_flows: linked list of fq_flow
49 struct list_head old_flows; member
|
| /kernel/linux/linux-6.6/include/net/ |
| H A D | fq_impl.h | 103 head = &tin->old_flows; in fq_tin_dequeue()
113 &tin->old_flows); in fq_tin_dequeue()
119 /* force a pass through old_flows to prevent starvation */ in fq_tin_dequeue()
121 !list_empty(&tin->old_flows)) { in fq_tin_dequeue()
122 list_move_tail(&flow->flowchain, &tin->old_flows); in fq_tin_dequeue()
285 list_for_each_entry(flow, &tin->old_flows, flowchain) in fq_tin_filter()
302 list_empty(&tin->old_flows)) in fq_flow_reset()
321 head = &tin->old_flows; in fq_tin_reset()
344 INIT_LIST_HEAD(&tin->old_flows); in fq_tin_init()
|
| H A D | fq.h | 23 * @flowchain: can be linked to fq_tin's new_flows or old_flows. Used for DRR++
46 * @old_flows: linked list of fq_flow
50 struct list_head old_flows; member
|
| /kernel/linux/linux-5.10/net/sched/ |
| H A D | sch_fq_pie.c | 59 struct list_head old_flows; member
246 head = &q->old_flows; in fq_pie_qdisc_dequeue()
255 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
268 /* force a pass through old_flows to prevent starvation */ in fq_pie_qdisc_dequeue()
269 if (head == &q->new_flows && !list_empty(&q->old_flows)) in fq_pie_qdisc_dequeue()
270 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
427 INIT_LIST_HEAD(&q->old_flows); in fq_pie_init()
517 list_for_each(pos, &q->old_flows) in fq_pie_dump_stats()
530 INIT_LIST_HEAD(&q->old_flows); in fq_pie_reset()
|
| H A D | sch_fq_codel.c | 67 struct list_head old_flows; /* list of old flows */ member
291 head = &q->old_flows; in fq_codel_dequeue()
299 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
308 /* force a pass through old_flows to prevent starvation */ in fq_codel_dequeue()
309 if ((head == &q->new_flows) && !list_empty(&q->old_flows)) in fq_codel_dequeue()
310 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
341 INIT_LIST_HEAD(&q->old_flows); in fq_codel_reset()
468 INIT_LIST_HEAD(&q->old_flows); in fq_codel_init()
576 list_for_each(pos, &q->old_flows) in fq_codel_dump_stats()
|
| H A D | sch_fq.c | 99 struct fq_flow_head old_flows; member
176 fq_flow_add_tail(&q->old_flows, f); in fq_flow_unset_throttled()
550 head = &q->old_flows; in fq_dequeue()
564 fq_flow_add_tail(&q->old_flows, f); in fq_dequeue()
587 /* force a pass through old_flows to prevent starvation */ in fq_dequeue()
588 if ((head == &q->new_flows) && q->old_flows.first) { in fq_dequeue()
589 fq_flow_add_tail(&q->old_flows, f); in fq_dequeue()
690 q->old_flows.first = NULL; in fq_reset()
945 q->old_flows.first = NULL; in fq_init()
|
| H A D | sch_cake.c | 167 struct list_head old_flows; member
2043 head = &b->old_flows; in cake_dequeue()
2100 list_move_tail(&flow->flowchain, &b->old_flows); in cake_dequeue()
2749 INIT_LIST_HEAD(&b->old_flows); in cake_init()
|
| /kernel/linux/linux-6.6/net/sched/ |
| H A D | sch_fq_pie.c | 59 struct list_head old_flows; member
246 head = &q->old_flows; in fq_pie_qdisc_dequeue()
255 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
268 /* force a pass through old_flows to prevent starvation */ in fq_pie_qdisc_dequeue()
269 if (head == &q->new_flows && !list_empty(&q->old_flows)) in fq_pie_qdisc_dequeue()
270 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
426 INIT_LIST_HEAD(&q->old_flows); in fq_pie_init()
516 list_for_each(pos, &q->old_flows) in fq_pie_dump_stats()
529 INIT_LIST_HEAD(&q->old_flows); in fq_pie_reset()
|
| H A D | sch_fq_codel.c | 67 struct list_head old_flows; /* list of old flows */ member
291 head = &q->old_flows; in fq_codel_dequeue()
299 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
308 /* force a pass through old_flows to prevent starvation */ in fq_codel_dequeue()
309 if ((head == &q->new_flows) && !list_empty(&q->old_flows)) in fq_codel_dequeue()
310 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
341 INIT_LIST_HEAD(&q->old_flows); in fq_codel_reset()
472 INIT_LIST_HEAD(&q->old_flows); in fq_codel_init()
585 list_for_each(pos, &q->old_flows) in fq_codel_dump_stats()
|
| H A D | sch_fq.c | 99 struct fq_flow_head old_flows; member
176 fq_flow_add_tail(&q->old_flows, f); in fq_flow_unset_throttled()
550 head = &q->old_flows; in fq_dequeue()
564 fq_flow_add_tail(&q->old_flows, f); in fq_dequeue()
587 /* force a pass through old_flows to prevent starvation */ in fq_dequeue()
588 if ((head == &q->new_flows) && q->old_flows.first) { in fq_dequeue()
589 fq_flow_add_tail(&q->old_flows, f); in fq_dequeue()
690 q->old_flows.first = NULL; in fq_reset()
942 q->old_flows.first = NULL; in fq_init()
|
| H A D | sch_cake.c | 168 struct list_head old_flows; member
2044 head = &b->old_flows; in cake_dequeue()
2101 list_move_tail(&flow->flowchain, &b->old_flows); in cake_dequeue()
2747 INIT_LIST_HEAD(&b->old_flows); in cake_init()
|