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];
308 if (q->flows) {
310 "Number of flows cannot be changed");
316 "Number of flows must range in [1..65536]");
390 /* Limit this expensive loop to 2048 flows per round. */
394 &q->flows[q->flows_cursor].vars,
395 q->flows[q->flows_cursor].backlog);
441 q->flows = kvcalloc(q->flows_cnt, sizeof(struct fq_pie_flow),
443 if (!q->flows) {
448 struct fq_pie_flow *flow = q->flows + idx;
532 struct fq_pie_flow *flow = q->flows + idx;
550 kvfree(q->flows);