Home
last modified time | relevance | path

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

/net/sched/
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()
Dsch_fq_codel.c46 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()
347 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_reset()
495 INIT_LIST_HEAD(&flow->flowchain); in fq_codel_init()
671 if (list_empty(&q->flows[i].flowchain) || in fq_codel_walk()
Dsch_cake.c129 struct list_head flowchain; member
1798 list_add_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1801 list_move_tail(&flow->flowchain, &b->new_flows); in cake_enqueue()
1989 flow = list_first_entry(head, struct cake_flow, flowchain); in cake_dequeue()
2038 list_move_tail(&flow->flowchain, &b->old_flows); in cake_dequeue()
2056 list_move_tail(&flow->flowchain, in cake_dequeue()
2076 list_del_init(&flow->flowchain); in cake_dequeue()
2715 INIT_LIST_HEAD(&flow->flowchain); in cake_init()
3031 if (list_empty(&b->flows[j].flowchain) || in cake_walk()