Searched refs:new_flows (Results 1 – 6 of 6) sorted by relevance
73 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()
48 struct list_head new_flows; member
60 struct list_head new_flows; member179 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue()230 head = &q->new_flows; in fq_pie_qdisc_dequeue()255 if (head == &q->new_flows && !list_empty(&q->old_flows)) in fq_pie_qdisc_dequeue()402 INIT_LIST_HEAD(&q->new_flows); in fq_pie_init()490 list_for_each(pos, &q->new_flows) in fq_pie_dump_stats()505 INIT_LIST_HEAD(&q->new_flows); in fq_pie_reset()
66 struct list_head new_flows; /* list of new flows */ member210 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()461 INIT_LIST_HEAD(&q->new_flows); in fq_codel_init()567 list_for_each(pos, &q->new_flows) in fq_codel_dump_stats()
97 struct fq_flow_head new_flows; member482 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()940 q->new_flows.first = NULL; in fq_init()
166 struct list_head new_flows; member1856 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()1859 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()2037 head = &b->new_flows; in cake_dequeue()2740 INIT_LIST_HEAD(&b->new_flows); in cake_init()
