Home
last modified time | relevance | path

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

/net/sched/
Dsch_fq_pie.c60 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()
Dsch_fq_codel.c66 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()
Dsch_fq.c97 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()
Dsch_cake.c166 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()