flowchain          31 include/net/fq.h 	struct list_head flowchain;
flowchain          80 include/net/fq_impl.h 	flow = list_first_entry(head, struct fq_flow, flowchain);
flowchain          84 include/net/fq_impl.h 		list_move_tail(&flow->flowchain,
flowchain          94 include/net/fq_impl.h 			list_move_tail(&flow->flowchain, &tin->old_flows);
flowchain          96 include/net/fq_impl.h 			list_del_init(&flow->flowchain);
flowchain         178 include/net/fq_impl.h 	if (list_empty(&flow->flowchain)) {
flowchain         180 include/net/fq_impl.h 		list_add_tail(&flow->flowchain,
flowchain         241 include/net/fq_impl.h 	list_for_each_entry(flow, &tin->new_flows, flowchain)
flowchain         243 include/net/fq_impl.h 	list_for_each_entry(flow, &tin->old_flows, flowchain)
flowchain         256 include/net/fq_impl.h 	if (!list_empty(&flow->flowchain))
flowchain         257 include/net/fq_impl.h 		list_del_init(&flow->flowchain);
flowchain         282 include/net/fq_impl.h 		flow = list_first_entry(head, struct fq_flow, flowchain);
flowchain         292 include/net/fq_impl.h 	INIT_LIST_HEAD(&flow->flowchain);
flowchain         129 net/sched/sch_cake.c 	struct list_head  flowchain;
flowchain        1798 net/sched/sch_cake.c 			list_add_tail(&flow->flowchain, &b->new_flows);
flowchain        1801 net/sched/sch_cake.c 			list_move_tail(&flow->flowchain, &b->new_flows);
flowchain        1989 net/sched/sch_cake.c 	flow = list_first_entry(head, struct cake_flow, flowchain);
flowchain        2038 net/sched/sch_cake.c 		list_move_tail(&flow->flowchain, &b->old_flows);
flowchain        2056 net/sched/sch_cake.c 				list_move_tail(&flow->flowchain,
flowchain        2076 net/sched/sch_cake.c 				list_del_init(&flow->flowchain);
flowchain        2715 net/sched/sch_cake.c 			INIT_LIST_HEAD(&flow->flowchain);
flowchain        3031 net/sched/sch_cake.c 			if (list_empty(&b->flows[j].flowchain) ||
flowchain          46 net/sched/sch_fq_codel.c 	struct list_head  flowchain;
flowchain         210 net/sched/sch_fq_codel.c 	if (list_empty(&flow->flowchain)) {
flowchain         211 net/sched/sch_fq_codel.c 		list_add_tail(&flow->flowchain, &q->new_flows);
flowchain         296 net/sched/sch_fq_codel.c 	flow = list_first_entry(head, struct fq_codel_flow, flowchain);
flowchain         300 net/sched/sch_fq_codel.c 		list_move_tail(&flow->flowchain, &q->old_flows);
flowchain         311 net/sched/sch_fq_codel.c 			list_move_tail(&flow->flowchain, &q->old_flows);
flowchain         313 net/sched/sch_fq_codel.c 			list_del_init(&flow->flowchain);
flowchain         347 net/sched/sch_fq_codel.c 		INIT_LIST_HEAD(&flow->flowchain);
flowchain         495 net/sched/sch_fq_codel.c 			INIT_LIST_HEAD(&flow->flowchain);
flowchain         671 net/sched/sch_fq_codel.c 		if (list_empty(&q->flows[i].flowchain) ||
flowchain         116 net/sched/sch_hhf.c 	struct list_head flowchain;	/* chaining under hash collision */
flowchain         190 net/sched/sch_hhf.c 	list_for_each_entry_safe(flow, next, head, flowchain) {
flowchain         197 net/sched/sch_hhf.c 			if (list_is_last(&flow->flowchain, head))
flowchain         199 net/sched/sch_hhf.c 			list_del(&flow->flowchain);
flowchain         220 net/sched/sch_hhf.c 		list_for_each_entry(flow, head, flowchain) {
flowchain         238 net/sched/sch_hhf.c 	INIT_LIST_HEAD(&flow->flowchain);
flowchain         239 net/sched/sch_hhf.c 	list_add_tail(&flow->flowchain, head);
flowchain         490 net/sched/sch_hhf.c 		list_for_each_entry_safe(flow, next, head, flowchain) {
flowchain         491 net/sched/sch_hhf.c 			list_del(&flow->flowchain);