Lines Matching defs:flows
29 * Packets are classified (internal classifier or external) on flows.
30 * This is a Stochastic model (as we use a hash, several flows
34 * so that new flows have priority on old ones.
53 struct fq_codel_flow *flows; /* Flows table [flows_cnt] */
55 u32 flows_cnt; /* number of flows */
66 struct list_head new_flows; /* list of new flows */
67 struct list_head old_flows; /* list of old flows */
148 * This might sound expensive, but with 1024 flows, we scan
164 flow = &q->flows[idx];
204 flow = &q->flows[idx];
265 q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb);
343 struct fq_codel_flow *flow = q->flows + i;
381 if (q->flows)
452 kvfree(q->flows);
484 if (!q->flows) {
485 q->flows = kvcalloc(q->flows_cnt,
488 if (!q->flows) {
498 struct fq_codel_flow *flow = q->flows + i;
511 kvfree(q->flows);
512 q->flows = NULL;
629 const struct fq_codel_flow *flow = &q->flows[idx];
676 if (list_empty(&q->flows[i].flowchain) ||