21  *   - Packets are classified on flows.
22  *   - This is a Stochastic model (as we use a hash, several flows might
25  *   - Flows are linked onto two (Round Robin) lists,
26  *     so that new flows have priority on old ones.
57 	struct fq_pie_flow *flows;  member
150 	sel_flow = &q->flows[idx];  in fq_pie_qdisc_enqueue()
305 		if (q->flows) {  in fq_pie_change()
307 					   "Number of flows cannot be changed");  in fq_pie_change()
313 					   "Number of flows must range in [1..65536]");  in fq_pie_change()
388 	/* Limit this expensive loop to 2048 flows per round. */  in fq_pie_timer()
392 					  &q->flows[q->flows_cursor].vars,  in fq_pie_timer()
393 					  q->flows[q->flows_cursor].backlog);  in fq_pie_timer()
440 	q->flows = kvcalloc(q->flows_cnt, sizeof(struct fq_pie_flow),  in fq_pie_init()
442 	if (!q->flows) {  in fq_pie_init()
447 		struct fq_pie_flow *flow = q->flows + idx;  in fq_pie_init()
531 		struct fq_pie_flow *flow = q->flows + idx;  in fq_pie_reset()
549 	kvfree(q->flows);  in fq_pie_destroy()