Home
last modified time | relevance | path

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

/Linux-v5.4/include/net/
Dfq_impl.h73 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()
Dfq.h48 struct list_head new_flows; member
/Linux-v5.4/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()
462 INIT_LIST_HEAD(&q->new_flows); in fq_codel_init()
568 list_for_each(pos, &q->new_flows) in fq_codel_dump_stats()
Dsch_fq.c92 struct fq_flow_head new_flows; member
433 fq_flow_add_tail(&q->new_flows, f); in fq_enqueue()
503 head = &q->new_flows; in fq_dequeue()
544 if ((head == &q->new_flows) && q->old_flows.first) { in fq_dequeue()
646 q->new_flows.first = NULL; in fq_reset()
878 q->new_flows.first = NULL; in fq_init()
Dsch_cake.c166 struct list_head new_flows; member
1798 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1801 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1979 head = &b->new_flows; in cake_dequeue()
2703 INIT_LIST_HEAD(&b->new_flows); in cake_init()