Searched refs:new_flows (Results 1 - 12 of 12) sorted by relevance
/kernel/linux/linux-5.10/include/net/ |
H A D | fq_impl.h | 73 head = &tin->new_flows; in fq_tin_dequeue() 92 if ((head == &tin->new_flows) && in fq_tin_dequeue() 181 &tin->new_flows); in fq_tin_enqueue() 241 list_for_each_entry(flow, &tin->new_flows, flowchain) in fq_tin_filter() 275 head = &tin->new_flows; in fq_tin_reset() 299 INIT_LIST_HEAD(&tin->new_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++ 44 * @new_flows: linked list of fq_flow 48 struct list_head new_flows; member
|
/kernel/linux/linux-6.6/include/net/ |
H A D | fq_impl.h | 101 head = &tin->new_flows; in fq_tin_dequeue() 120 if ((head == &tin->new_flows) && in fq_tin_dequeue() 231 &tin->new_flows); in fq_tin_enqueue() 283 list_for_each_entry(flow, &tin->new_flows, flowchain) in fq_tin_filter() 301 if (list_empty(&tin->new_flows) && in fq_flow_reset() 319 head = &tin->new_flows; in fq_tin_reset() 343 INIT_LIST_HEAD(&tin->new_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++ 45 * @new_flows: linked list of fq_flow 49 struct list_head new_flows; member
|
/kernel/linux/linux-5.10/net/sched/ |
H A D | sch_fq_pie.c | 60 struct list_head new_flows; member 187 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue() 244 head = &q->new_flows; in fq_pie_qdisc_dequeue() 269 if (head == &q->new_flows && !list_empty(&q->old_flows)) in fq_pie_qdisc_dequeue() 426 INIT_LIST_HEAD(&q->new_flows); in fq_pie_init() 514 list_for_each(pos, &q->new_flows) in fq_pie_dump_stats() 529 INIT_LIST_HEAD(&q->new_flows); in fq_pie_reset()
|
H A D | sch_fq_codel.c | 66 struct list_head new_flows; /* list of new flows */ member 210 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue() 289 head = &q->new_flows; in fq_codel_dequeue() 309 if ((head == &q->new_flows) && !list_empty(&q->old_flows)) in fq_codel_dequeue() 340 INIT_LIST_HEAD(&q->new_flows); in fq_codel_reset() 467 INIT_LIST_HEAD(&q->new_flows); in fq_codel_init() 573 list_for_each(pos, &q->new_flows) in fq_codel_dump_stats()
|
H A D | sch_fq.c | 97 struct fq_flow_head new_flows; member 482 fq_flow_add_tail(&q->new_flows, f); in fq_enqueue() 548 head = &q->new_flows; in fq_dequeue() 588 if ((head == &q->new_flows) && q->old_flows.first) { in fq_dequeue() 689 q->new_flows.first = NULL; in fq_reset() 944 q->new_flows.first = NULL; in fq_init()
|
H A D | sch_cake.c | 166 struct list_head new_flows; member 1860 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue() 1863 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue() 2041 head = &b->new_flows; in cake_dequeue() 2748 INIT_LIST_HEAD(&b->new_flows); in cake_init()
|
/kernel/linux/linux-6.6/net/sched/ |
H A D | sch_fq_pie.c | 60 struct list_head new_flows; member 187 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue() 244 head = &q->new_flows; in fq_pie_qdisc_dequeue() 269 if (head == &q->new_flows && !list_empty(&q->old_flows)) in fq_pie_qdisc_dequeue() 425 INIT_LIST_HEAD(&q->new_flows); in fq_pie_init() 513 list_for_each(pos, &q->new_flows) in fq_pie_dump_stats() 528 INIT_LIST_HEAD(&q->new_flows); in fq_pie_reset()
|
H A D | sch_fq_codel.c | 66 struct list_head new_flows; /* list of new flows */ member 210 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue() 289 head = &q->new_flows; in fq_codel_dequeue() 309 if ((head == &q->new_flows) && !list_empty(&q->old_flows)) in fq_codel_dequeue() 340 INIT_LIST_HEAD(&q->new_flows); in fq_codel_reset() 471 INIT_LIST_HEAD(&q->new_flows); in fq_codel_init() 582 list_for_each(pos, &q->new_flows) in fq_codel_dump_stats()
|
H A D | sch_fq.c | 97 struct fq_flow_head new_flows; member 482 fq_flow_add_tail(&q->new_flows, f); in fq_enqueue() 548 head = &q->new_flows; in fq_dequeue() 588 if ((head == &q->new_flows) && q->old_flows.first) { in fq_dequeue() 689 q->new_flows.first = NULL; in fq_reset() 941 q->new_flows.first = NULL; in fq_init()
|
H A D | sch_cake.c | 167 struct list_head new_flows; member 1861 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue() 1864 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue() 2042 head = &b->new_flows; in cake_dequeue() 2746 INIT_LIST_HEAD(&b->new_flows); in cake_init()
|
Completed in 17 milliseconds