Searched refs:flowchain (Results 1 – 4 of 4) sorted by relevance
| /net/sched/ |
| A D | sch_fq_pie.c | 50 struct list_head flowchain; member
190 if (list_empty(&sel_flow->flowchain)) { in fq_pie_qdisc_enqueue()
191 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue()
254 flow = list_first_entry(head, struct fq_pie_flow, flowchain); in fq_pie_qdisc_dequeue()
258 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
273 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
275 list_del_init(&flow->flowchain); in fq_pie_qdisc_dequeue()
458 INIT_LIST_HEAD(&flow->flowchain); in fq_pie_init()
547 INIT_LIST_HEAD(&flow->flowchain); in fq_pie_reset()
|
| A D | sch_hhf.c | 116 struct list_head flowchain; /* chaining under hash collision */ member
190 list_for_each_entry_safe(flow, next, head, flowchain) { in seek_list()
197 if (list_is_last(&flow->flowchain, head)) in seek_list()
199 list_del(&flow->flowchain); in seek_list()
220 list_for_each_entry(flow, head, flowchain) { in alloc_new_hh()
238 INIT_LIST_HEAD(&flow->flowchain); in alloc_new_hh()
239 list_add_tail(&flow->flowchain, head); in alloc_new_hh()
490 list_for_each_entry_safe(flow, next, head, flowchain) { in hhf_destroy()
491 list_del(&flow->flowchain); in hhf_destroy()
|
| A D | sch_fq_codel.c | 45 struct list_head flowchain; member
210 if (list_empty(&flow->flowchain)) { in fq_codel_enqueue()
211 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue()
296 flow = list_first_entry(head, struct fq_codel_flow, flowchain); in fq_codel_dequeue()
300 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
311 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
313 list_del_init(&flow->flowchain); in fq_codel_dequeue()
345 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_reset()
512 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_init()
697 if (list_empty(&q->flows[i].flowchain)) { in fq_codel_walk()
|
| A D | sch_cake.c | 130 struct list_head flowchain; member
1905 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1908 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
2081 flow = list_first_entry(head, struct cake_flow, flowchain); in cake_dequeue()
2110 list_move_tail(&flow->flowchain, &b->old_flows); in cake_dequeue()
2128 list_move_tail(&flow->flowchain, in cake_dequeue()
2145 list_del_init(&flow->flowchain); in cake_dequeue()
2771 INIT_LIST_HEAD(&flow->flowchain); in cake_init()
3087 if (list_empty(&b->flows[j].flowchain)) { in cake_walk()
|
Completed in 14 milliseconds