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()231 &tin->new_flows); in fq_tin_enqueue()283 list_for_each_entry(flow, &tin->new_flows, flowchain) in fq_tin_filter()301 if (list_empty(&tin->new_flows) && in fq_flow_reset()319 head = &tin->new_flows; in fq_tin_reset()343 INIT_LIST_HEAD(&tin->new_flows); in fq_tin_init()
49 struct list_head new_flows; member
61 struct list_head new_flows; member 191 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue() 247 head = &q->new_flows; in fq_pie_qdisc_dequeue() 272 if (head == &q->new_flows && !list_empty(&q->old_flows)) in fq_pie_qdisc_dequeue() 436 INIT_LIST_HEAD(&q->new_flows); in fq_pie_init() 525 list_for_each(pos, &q->new_flows) in fq_pie_dump_stats() 540 INIT_LIST_HEAD(&q->new_flows); in fq_pie_reset()
66 struct list_head new_flows; /* list of new flows */ member 211 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue() 292 head = &q->new_flows; in fq_codel_dequeue() 312 if ((head == &q->new_flows) && !list_empty(&q->old_flows)) in fq_codel_dequeue() 378 INIT_LIST_HEAD(&q->new_flows); in fq_codel_change() 520 INIT_LIST_HEAD(&q->new_flows); in fq_codel_init() 637 list_for_each(pos, &q->new_flows) in fq_codel_tcf_block()
103 struct fq_flow_head new_flows; member 202 &pband->new_flows : in fq_flow_add_tail() 699 if (pband->new_flows.first) in fq_dequeue() 700 return &pband->new_flows; in fq_dequeue() 782 if (head == &pband->new_flows) { in fq_flow_purge() 883 q->band_flows[idx].new_flows.first = NULL;1236 q->band_flows[i].new_flows.first = NULL; in fq_dump()
168 struct list_head new_flows; member 1925 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue() 1928 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue() 2137 head = &b->new_flows; in cake_dequeue() 2872 INIT_LIST_HEAD(&b->new_flows); in cake_init()