Lines Matching full:flows
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
141 sel_flow = &q->flows[idx]; in fq_pie_qdisc_enqueue()
294 if (q->flows) { in fq_pie_change()
296 "Number of flows cannot be changed"); in fq_pie_change()
302 "Number of flows must range in [1..65535]"); in fq_pie_change()
376 pie_calculate_probability(&q->p_params, &q->flows[idx].vars, in fq_pie_timer()
377 q->flows[idx].backlog); in fq_pie_timer()
417 q->flows = kvcalloc(q->flows_cnt, sizeof(struct fq_pie_flow), in fq_pie_init()
419 if (!q->flows) { in fq_pie_init()
424 struct fq_pie_flow *flow = q->flows + idx; in fq_pie_init()
508 struct fq_pie_flow *flow = q->flows + idx; in fq_pie_reset()
528 kvfree(q->flows); in fq_pie_destroy()