Home
last modified time | relevance | path

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

/net/sched/
Dsch_fq_codel.c67 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()
341 INIT_LIST_HEAD(&q->new_flows); in fq_codel_reset()
470 INIT_LIST_HEAD(&q->new_flows); in fq_codel_init()
576 list_for_each(pos, &q->new_flows) in fq_codel_dump_stats()
Dsch_fq.c92 struct fq_flow_head new_flows; member
438 fq_flow_add_tail(&q->new_flows, f); in fq_enqueue()
502 head = &q->new_flows; in fq_dequeue()
543 if ((head == &q->new_flows) && q->old_flows.first) { in fq_dequeue()
645 q->new_flows.first = NULL; in fq_reset()
880 q->new_flows.first = NULL; in fq_init()
Dsch_cake.c166 struct list_head new_flows; member
1826 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1829 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
2007 head = &b->new_flows; in cake_dequeue()
2736 INIT_LIST_HEAD(&b->new_flows); in cake_init()