Lines Matching full:flows
12 * Flows are dynamically allocated and stored in a hash table of RB trees
13 * They are also part of one Round Robin 'queues' (new or old flows)
27 * dequeue() : serves flows in Round Robin
101 struct rb_root delayed; /* for rate limited flows */
120 u32 flows; member
207 /* limit number of collected flows per round */
254 q->flows -= fcnt; in fq_gc()
304 if (q->flows >= (2U << q->fq_trees_log) && in fq_classify()
305 q->inactive_flows > q->flows/2) in fq_classify()
359 q->flows++; in fq_classify()
692 q->flows = 0; in fq_reset()
737 q->flows -= fcnt; in fq_rehash()
1020 st.flows = q->flows; in fq_dump_stats()