Lines Matching refs:flows

22  *   - Packets are classified on flows.
23  *   - This is a Stochastic model (as we use a hash, several flows might
27  *     so that new flows have priority on old ones.
58 	struct fq_pie_flow *flows;
152 	sel_flow = &q->flows[idx];
308 		if (q->flows) {
310 					   "Number of flows cannot be changed");
316 					   "Number of flows must range in [1..65536]");
397 	/* Limit this expensive loop to 2048 flows per round. */
401 					  &q->flows[q->flows_cursor].vars,
402 					  q->flows[q->flows_cursor].backlog);
449 	q->flows = kvcalloc(q->flows_cnt, sizeof(struct fq_pie_flow),
451 	if (!q->flows) {
456 		struct fq_pie_flow *flow = q->flows + idx;
541 		struct fq_pie_flow *flow = q->flows + idx;
559 	kvfree(q->flows);