29  * Packets are classified (internal classifier or external) on flows.
30  * This is a Stochastic model (as we use a hash, several flows
33  * Flows are linked onto two (Round Robin) lists,
34  * so that new flows have priority on old ones.
53 	struct fq_codel_flow *flows;	/* Flows table [flows_cnt] */  member
55 	u32		flows_cnt;	/* number of flows */
66 	struct list_head new_flows;	/* list of new flows */
67 	struct list_head old_flows;	/* list of old flows */
148 	 * This might sound expensive, but with 1024 flows, we scan  in fq_codel_drop()
164 	flow = &q->flows[idx];  in fq_codel_drop()
204 	flow = &q->flows[idx];  in fq_codel_enqueue()
265 		q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb);  in dequeue_func()
343 		struct fq_codel_flow *flow = q->flows + i;  in fq_codel_reset()
380 		if (q->flows)  in fq_codel_change()
465 	kvfree(q->flows);  in fq_codel_destroy()
497 	if (!q->flows) {  in fq_codel_init()
498 		q->flows = kvcalloc(q->flows_cnt,  in fq_codel_init()
501 		if (!q->flows) {  in fq_codel_init()
511 			struct fq_codel_flow *flow = q->flows + i;  in fq_codel_init()
524 	kvfree(q->flows);  in fq_codel_init()
525 	q->flows = NULL;  in fq_codel_init()
651 		const struct fq_codel_flow *flow = &q->flows[idx];  in fq_codel_dump_class_stats()
698 		if (list_empty(&q->flows[i].flowchain)) {  in fq_codel_walk()