Lines Matching full:flows
22 * - Packets are classified on flows.
23 * - This is a Stochastic model (as we use a hash, several flows might
26 * - Flows are linked onto two (Round Robin) lists,
27 * so that new flows have priority on old ones.
58 struct fq_pie_flow *flows; member
152 sel_flow = &q->flows[idx]; in fq_pie_qdisc_enqueue()
307 if (q->flows) { in fq_pie_change()
309 "Number of flows cannot be changed"); in fq_pie_change()
315 "Number of flows must range in [1..65536]"); in fq_pie_change()
399 /* Limit this expensive loop to 2048 flows per round. */ in fq_pie_timer()
403 &q->flows[q->flows_cursor].vars, in fq_pie_timer()
404 q->flows[q->flows_cursor].backlog); in fq_pie_timer()
451 q->flows = kvcalloc(q->flows_cnt, sizeof(struct fq_pie_flow), in fq_pie_init()
453 if (!q->flows) { in fq_pie_init()
458 struct fq_pie_flow *flow = q->flows + idx; in fq_pie_init()
543 struct fq_pie_flow *flow = q->flows + idx; in fq_pie_reset()
561 kvfree(q->flows); in fq_pie_destroy()