Home
last modified time | relevance | path

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

/Linux-v4.19/include/net/
Dfq_impl.h74 head = &tin->new_flows; in fq_tin_dequeue()
93 if ((head == &tin->new_flows) && in fq_tin_dequeue()
180 &tin->new_flows); in fq_tin_enqueue()
240 list_for_each_entry(flow, &tin->new_flows, flowchain) in fq_tin_filter()
274 head = &tin->new_flows; in fq_tin_reset()
298 INIT_LIST_HEAD(&tin->new_flows); in fq_tin_init()
Dfq.h49 struct list_head new_flows; member
/Linux-v4.19/net/sched/
Dsch_fq_codel.c72 struct list_head new_flows; /* list of new flows */ member
215 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue()
296 head = &q->new_flows; in fq_codel_dequeue()
322 if ((head == &q->new_flows) && !list_empty(&q->old_flows)) in fq_codel_dequeue()
353 INIT_LIST_HEAD(&q->new_flows); in fq_codel_reset()
474 INIT_LIST_HEAD(&q->new_flows); in fq_codel_init()
580 list_for_each(pos, &q->new_flows) in fq_codel_dump_stats()
Dsch_fq.c83 struct fq_flow_head new_flows; member
410 fq_flow_add_tail(&q->new_flows, f); in fq_enqueue()
474 head = &q->new_flows; in fq_dequeue()
505 if ((head == &q->new_flows) && q->old_flows.first) { in fq_dequeue()
595 q->new_flows.first = NULL; in fq_reset()
819 q->new_flows.first = NULL; in fq_init()
Dsch_cake.c166 struct list_head new_flows; member
1787 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1790 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1958 head = &b->new_flows; in cake_dequeue()
2655 INIT_LIST_HEAD(&b->new_flows); in cake_init()