Searched refs:flowchain (Results 1 – 5 of 5) sorted by relevance
| /Linux-v4.19/include/net/ |
| D | fq_impl.h | 81 flow = list_first_entry(head, struct fq_flow, flowchain); in fq_tin_dequeue()
85 list_move_tail(&flow->flowchain, in fq_tin_dequeue()
95 list_move_tail(&flow->flowchain, &tin->old_flows); in fq_tin_dequeue()
97 list_del_init(&flow->flowchain); in fq_tin_dequeue()
177 if (list_empty(&flow->flowchain)) { in fq_tin_enqueue()
179 list_add_tail(&flow->flowchain, in fq_tin_enqueue()
240 list_for_each_entry(flow, &tin->new_flows, flowchain) in fq_tin_filter()
242 list_for_each_entry(flow, &tin->old_flows, flowchain) in fq_tin_filter()
255 if (!list_empty(&flow->flowchain)) in fq_flow_reset()
256 list_del_init(&flow->flowchain); in fq_flow_reset()
[all …]
|
| D | fq.h | 32 struct list_head flowchain; member
|
| /Linux-v4.19/net/sched/ |
| D | sch_hhf.c | 115 struct list_head flowchain; /* chaining under hash collision */ member
189 list_for_each_entry_safe(flow, next, head, flowchain) { in seek_list()
196 if (list_is_last(&flow->flowchain, head)) in seek_list()
198 list_del(&flow->flowchain); in seek_list()
219 list_for_each_entry(flow, head, flowchain) { in alloc_new_hh()
237 INIT_LIST_HEAD(&flow->flowchain); in alloc_new_hh()
238 list_add_tail(&flow->flowchain, head); in alloc_new_hh()
489 list_for_each_entry_safe(flow, next, head, flowchain) { in hhf_destroy()
490 list_del(&flow->flowchain); in hhf_destroy()
|
| D | sch_fq_codel.c | 50 struct list_head flowchain; member
214 if (list_empty(&flow->flowchain)) { in fq_codel_enqueue()
215 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue()
302 flow = list_first_entry(head, struct fq_codel_flow, flowchain); in fq_codel_dequeue()
306 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
323 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
325 list_del_init(&flow->flowchain); in fq_codel_dequeue()
359 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_reset()
507 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_init()
685 if (list_empty(&q->flows[i].flowchain) || in fq_codel_walk()
|
| D | sch_cake.c | 129 struct list_head flowchain; member
1787 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1790 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1968 flow = list_first_entry(head, struct cake_flow, flowchain); in cake_dequeue()
1992 list_move_tail(&flow->flowchain, &b->old_flows); in cake_dequeue()
2027 list_move_tail(&flow->flowchain, in cake_dequeue()
2040 list_del_init(&flow->flowchain); in cake_dequeue()
2666 INIT_LIST_HEAD(&flow->flowchain); in cake_init()
2979 if (list_empty(&b->flows[j].flowchain) || in cake_walk()
|
