121 static inline struct sk_buff *dequeue_head(struct fq_codel_flow *flow)  in dequeue_head()  argument
123 	struct sk_buff *skb = flow->head;  in dequeue_head()
125 	flow->head = skb->next;  in dequeue_head()
131 static inline void flow_queue_add(struct fq_codel_flow *flow,  in flow_queue_add()  argument
134 	if (flow->head == NULL)  in flow_queue_add()
135 		flow->head = skb;  in flow_queue_add()
137 		flow->tail->next = skb;  in flow_queue_add()
138 	flow->tail = skb;  in flow_queue_add()
148 	struct fq_codel_flow *flow;  in fq_codel_drop()  local
169 	flow = &q->flows[idx];  in fq_codel_drop()
173 		skb = dequeue_head(flow);  in fq_codel_drop()
179 	flow->dropped += i;  in fq_codel_drop()
193 	struct fq_codel_flow *flow;  in fq_codel_enqueue()  local
208 	flow = &q->flows[idx];  in fq_codel_enqueue()
209 	flow_queue_add(flow, skb);  in fq_codel_enqueue()
213 	if (list_empty(&flow->flowchain)) {  in fq_codel_enqueue()
214 		list_add_tail(&flow->flowchain, &q->new_flows);  in fq_codel_enqueue()
216 		flow->deficit = q->quantum;  in fq_codel_enqueue()
217 		flow->dropped = 0;  in fq_codel_enqueue()
264 	struct fq_codel_flow *flow;  in dequeue_func()  local
267 	flow = container_of(vars, struct fq_codel_flow, cvars);  in dequeue_func()
268 	if (flow->head) {  in dequeue_func()
269 		skb = dequeue_head(flow);  in dequeue_func()
270 		q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb);  in dequeue_func()
290 	struct fq_codel_flow *flow;  in fq_codel_dequeue()  local
301 	flow = list_first_entry(head, struct fq_codel_flow, flowchain);  in fq_codel_dequeue()
303 	if (flow->deficit <= 0) {  in fq_codel_dequeue()
304 		flow->deficit += q->quantum;  in fq_codel_dequeue()
305 		list_move_tail(&flow->flowchain, &q->old_flows);  in fq_codel_dequeue()
313 			    &flow->cvars, &q->cstats, qdisc_pkt_len,  in fq_codel_dequeue()
316 	flow->dropped += q->cstats.drop_count - prev_drop_count;  in fq_codel_dequeue()
317 	flow->dropped += q->cstats.ecn_mark - prev_ecn_mark;  in fq_codel_dequeue()
322 			list_move_tail(&flow->flowchain, &q->old_flows);  in fq_codel_dequeue()
324 			list_del_init(&flow->flowchain);  in fq_codel_dequeue()
328 	flow->deficit -= qdisc_pkt_len(skb);  in fq_codel_dequeue()
341 static void fq_codel_flow_purge(struct fq_codel_flow *flow)  in fq_codel_flow_purge()  argument
343 	rtnl_kfree_skbs(flow->head, flow->tail);  in fq_codel_flow_purge()
344 	flow->head = NULL;  in fq_codel_flow_purge()
355 		struct fq_codel_flow *flow = q->flows + i;  in fq_codel_reset()  local
357 		fq_codel_flow_purge(flow);  in fq_codel_reset()
358 		INIT_LIST_HEAD(&flow->flowchain);  in fq_codel_reset()
359 		codel_vars_init(&flow->cvars);  in fq_codel_reset()
497 			struct fq_codel_flow *flow = q->flows + i;  in fq_codel_init()  local
499 			INIT_LIST_HEAD(&flow->flowchain);  in fq_codel_init()
500 			codel_vars_init(&flow->cvars);  in fq_codel_init()
622 		const struct fq_codel_flow *flow = &q->flows[idx];  in fq_codel_dump_class_stats()  local
627 		xstats.class_stats.deficit = flow->deficit;  in fq_codel_dump_class_stats()
629 			codel_time_to_us(flow->cvars.ldelay);  in fq_codel_dump_class_stats()
630 		xstats.class_stats.count = flow->cvars.count;  in fq_codel_dump_class_stats()
631 		xstats.class_stats.lastcount = flow->cvars.lastcount;  in fq_codel_dump_class_stats()
632 		xstats.class_stats.dropping = flow->cvars.dropping;  in fq_codel_dump_class_stats()
633 		if (flow->cvars.dropping) {  in fq_codel_dump_class_stats()
634 			codel_tdiff_t delta = flow->cvars.drop_next -  in fq_codel_dump_class_stats()
641 		if (flow->head) {  in fq_codel_dump_class_stats()
643 			skb = flow->head;  in fq_codel_dump_class_stats()
651 		qs.drops = flow->dropped;  in fq_codel_dump_class_stats()