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
135 struct rb_root delayed; /* for rate limited flows */
140 u32 flows; member
141 u32 inactive_flows; /* Flows with no packet to send. */
245 /* limit number of collected flows per round */
292 q->flows -= fcnt; in fq_gc()
321 * scheduled in the future (ie no flows are eligible) in fq_fastpath_check()
324 if (q->flows != q->inactive_flows + q->throttled_flows) in fq_fastpath_check()
448 q->flows++; in fq_classify()
810 q->flows = 0; in fq_reset()
855 q->flows -= fcnt; in fq_rehash()
1235 st.flows = q->flows; in fq_dump_stats()