Lines Matching defs:flows
29 * flows from each other. This prevents a burst on one flow from increasing
34 * Codel and Blue AQM algorithms. This serves flows fairly, and signals
150 struct cake_flow flows[CAKE_QUEUES];
267 * obtain the best features of each. Codel is excellent on flows which
269 * unresponsive flows.
743 q->flows[reduced_hash].set)) {
761 if (!q->flows[outer_hash + k].set) {
776 if (!q->flows[outer_hash + k].set) {
788 if (q->flows[outer_hash + k].set == CAKE_SET_BULK) {
789 q->hosts[q->flows[reduced_hash].srchost].srchost_bulk_flow_count--;
790 q->hosts[q->flows[reduced_hash].dsthost].dsthost_bulk_flow_count--;
817 if (q->flows[reduced_hash].set == CAKE_SET_BULK)
819 q->flows[reduced_hash].srchost = srchost_idx;
840 if (q->flows[reduced_hash].set == CAKE_SET_BULK)
842 q->flows[reduced_hash].dsthost = dsthost_idx;
1525 flow = &b->flows[idx];
1715 flow = &b->flows[idx];
1914 struct cake_flow *flow = &b->flows[q->cur_flow];
2052 q->cur_flow = flow - b->flows;
2062 /* Keep all flows with deficits out of the sparse and decaying
2756 struct cake_flow *flow = b->flows + j;
2999 flow = &b->flows[idx % CAKE_QUEUES];
3071 if (list_empty(&b->flows[j].flowchain) ||