Home
last modified time | relevance | path

Searched refs:flowchain (Results 1 – 6 of 6) sorted by relevance

/linux-6.15/include/net/
H A Dfq_impl.h108 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 …]
H A Dfq.h33 struct list_head flowchain; member
/linux-6.15/net/sched/
H A Dsch_fq_pie.c50 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()
H A Dsch_hhf.c116 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()
H A Dsch_fq_codel.c45 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()
H A Dsch_cake.c130 struct list_head flowchain; member
1902 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1905 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
2078 flow = list_first_entry(head, struct cake_flow, flowchain); in cake_dequeue()
2107 list_move_tail(&flow->flowchain, &b->old_flows); in cake_dequeue()
2125 list_move_tail(&flow->flowchain, in cake_dequeue()
2142 list_del_init(&flow->flowchain); in cake_dequeue()
2768 INIT_LIST_HEAD(&flow->flowchain); in cake_init()
3084 if (list_empty(&b->flows[j].flowchain)) { in cake_walk()