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
138 struct rb_root delayed; /* for rate limited flows */
143 u32 flows; member
144 u32 inactive_flows; /* Flows with no packet to send. */
248 /* limit number of collected flows per round */
295 q->flows -= fcnt; in fq_gc()
324 * scheduled in the future (ie no flows are eligible) in fq_fastpath_check()
327 if (q->flows != q->inactive_flows + q->throttled_flows) in fq_fastpath_check()
336 /* Ordering invariants fall apart if some delayed flows in fq_fastpath_check()
458 q->flows++; in fq_classify()
831 q->flows = 0; in fq_reset()
876 q->flows -= fcnt; in fq_rehash()
1301 st.flows = q->flows; in fq_dump_stats()