Lines Matching full:flows
16 * Flows are dynamically allocated and stored in a hash table of RB trees
17 * They are also part of one Round Robin 'queues' (new or old flows)
31 * dequeue() : serves flows in Round Robin
87 struct rb_root delayed; /* for rate limited flows */
103 u32 flows; member
181 /* limit number of collected flows per round */
220 q->flows -= fcnt; in fq_gc()
263 if (q->flows >= (2U << q->fq_trees_log) && in fq_classify()
264 q->inactive_flows > q->flows/2) in fq_classify()
309 q->flows++; in fq_classify()
598 q->flows = 0; in fq_reset()
643 q->flows -= fcnt; in fq_rehash()
885 st.flows = q->flows; in fq_dump_stats()