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