Searched refs:new_flows (Results 1 – 6 of 6) sorted by relevance
101 head = &tin->new_flows; in fq_tin_dequeue()120 if ((head == &tin->new_flows) && in fq_tin_dequeue()226 &tin->new_flows); in fq_tin_enqueue()279 list_for_each_entry(flow, &tin->new_flows, flowchain) in fq_tin_filter()297 if (list_empty(&tin->new_flows) && in fq_flow_reset()315 head = &tin->new_flows; in fq_tin_reset()339 INIT_LIST_HEAD(&tin->new_flows); in fq_tin_init()
49 struct list_head new_flows; member
60 struct list_head new_flows; member186 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue()237 head = &q->new_flows; in fq_pie_qdisc_dequeue()262 if (head == &q->new_flows && !list_empty(&q->old_flows)) in fq_pie_qdisc_dequeue()406 INIT_LIST_HEAD(&q->new_flows); in fq_pie_init()494 list_for_each(pos, &q->new_flows) in fq_pie_dump_stats()509 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()471 INIT_LIST_HEAD(&q->new_flows); in fq_codel_init()582 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()937 q->new_flows.first = NULL; in fq_init()
166 struct list_head new_flows; member1860 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()2745 INIT_LIST_HEAD(&b->new_flows); in cake_init()