Searched refs:flowchain (Results 1 – 6 of 6) sorted by relevance
| /linux-6.12.1/include/net/ |
| D | fq_impl.h | 108 flow = list_first_entry(head, struct fq_flow, flowchain); in fq_tin_dequeue()
112 list_move_tail(&flow->flowchain, in fq_tin_dequeue()
122 list_move_tail(&flow->flowchain, &tin->old_flows); in fq_tin_dequeue()
124 list_del_init(&flow->flowchain); in fq_tin_dequeue()
228 if (list_empty(&flow->flowchain)) { in fq_tin_enqueue()
230 list_add_tail(&flow->flowchain, in fq_tin_enqueue()
283 list_for_each_entry(flow, &tin->new_flows, flowchain) in fq_tin_filter()
285 list_for_each_entry(flow, &tin->old_flows, flowchain) in fq_tin_filter()
299 if (!list_empty(&flow->flowchain)) { in fq_flow_reset()
300 list_del_init(&flow->flowchain); in fq_flow_reset()
[all …]
|
| D | fq.h | 33 struct list_head flowchain; member
|
| /linux-6.12.1/net/sched/ |
| 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()
|
| D | sch_fq_pie.c | 50 struct list_head flowchain; member
187 if (list_empty(&sel_flow->flowchain)) { in fq_pie_qdisc_enqueue()
188 list_add_tail(&sel_flow->flowchain, &q->new_flows); in fq_pie_qdisc_enqueue()
252 flow = list_first_entry(head, struct fq_pie_flow, flowchain); in fq_pie_qdisc_dequeue()
256 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
271 list_move_tail(&flow->flowchain, &q->old_flows); in fq_pie_qdisc_dequeue()
273 list_del_init(&flow->flowchain); in fq_pie_qdisc_dequeue()
456 INIT_LIST_HEAD(&flow->flowchain); in fq_pie_init()
545 INIT_LIST_HEAD(&flow->flowchain); in fq_pie_reset()
|
| D | sch_fq_codel.c | 45 struct list_head flowchain; member
209 if (list_empty(&flow->flowchain)) { in fq_codel_enqueue()
210 list_add_tail(&flow->flowchain, &q->new_flows); in fq_codel_enqueue()
295 flow = list_first_entry(head, struct fq_codel_flow, flowchain); in fq_codel_dequeue()
299 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
310 list_move_tail(&flow->flowchain, &q->old_flows); in fq_codel_dequeue()
312 list_del_init(&flow->flowchain); in fq_codel_dequeue()
346 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_reset()
513 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_init()
698 if (list_empty(&q->flows[i].flowchain)) { in fq_codel_walk()
|
| D | sch_cake.c | 130 struct list_head flowchain; member
1847 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1850 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
2038 flow = list_first_entry(head, struct cake_flow, flowchain); in cake_dequeue()
2087 list_move_tail(&flow->flowchain, &b->old_flows); in cake_dequeue()
2105 list_move_tail(&flow->flowchain, in cake_dequeue()
2125 list_del_init(&flow->flowchain); in cake_dequeue()
2755 INIT_LIST_HEAD(&flow->flowchain); in cake_init()
3071 if (list_empty(&b->flows[j].flowchain)) { in cake_walk()
|