Home
last modified time | relevance | path

Searched refs:new_flows (Results 1 – 6 of 6) sorted by relevance

/linux-6.15/include/net/
H A Dfq_impl.h101 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 Dfq.h49 struct list_head new_flows; member
/linux-6.15/net/sched/
H A Dsch_fq_pie.c61 struct list_head new_flows; member
191 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue()
247 head = &q->new_flows; in fq_pie_qdisc_dequeue()
272 if (head == &q->new_flows && !list_empty(&q->old_flows)) in fq_pie_qdisc_dequeue()
434 INIT_LIST_HEAD(&q->new_flows); in fq_pie_init()
523 list_for_each(pos, &q->new_flows) in fq_pie_dump_stats()
538 INIT_LIST_HEAD(&q->new_flows); in fq_pie_reset()
H A Dsch_fq_codel.c66 struct list_head new_flows; /* list of new flows */ member
211 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue()
290 head = &q->new_flows; in fq_codel_dequeue()
310 if ((head == &q->new_flows) && !list_empty(&q->old_flows)) in fq_codel_dequeue()
339 INIT_LIST_HEAD(&q->new_flows); in fq_codel_reset()
479 INIT_LIST_HEAD(&q->new_flows); in fq_codel_init()
594 list_for_each(pos, &q->new_flows) in fq_codel_dump_stats()
H A Dsch_fq.c103 struct fq_flow_head new_flows; member
202 &pband->new_flows : in fq_flow_add_tail()
642 if (pband->new_flows.first) in fq_pband_head_select()
643 return &pband->new_flows; in fq_pband_head_select()
725 if (head == &pband->new_flows) { in fq_dequeue()
827 q->band_flows[idx].new_flows.first = NULL; in fq_reset()
1177 q->band_flows[i].new_flows.first = NULL; in fq_init()
H A Dsch_cake.c167 struct list_head new_flows; member
1902 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1905 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
2068 head = &b->new_flows; in cake_dequeue()
2757 INIT_LIST_HEAD(&b->new_flows); in cake_init()