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
151 struct cake_flow flows[CAKE_QUEUES];
268 * obtain the best features of each. Codel is excellent on flows which
270 * unresponsive flows.
744 q->flows[reduced_hash].set)) {
762 if (!q->flows[outer_hash + k].set) {
777 if (!q->flows[outer_hash + k].set) {
789 if (q->flows[outer_hash + k].set == CAKE_SET_BULK) {
790 q->hosts[q->flows[reduced_hash].srchost].srchost_bulk_flow_count--;
791 q->hosts[q->flows[reduced_hash].dsthost].dsthost_bulk_flow_count--;
818 if (q->flows[reduced_hash].set == CAKE_SET_BULK)
820 q->flows[reduced_hash].srchost = srchost_idx;
841 if (q->flows[reduced_hash].set == CAKE_SET_BULK)
843 q->flows[reduced_hash].dsthost = dsthost_idx;
1526 flow = &b->flows[idx];
1716 flow = &b->flows[idx];
1915 struct cake_flow *flow = &b->flows[q->cur_flow];
2053 q->cur_flow = flow - b->flows;
2063 /* Keep all flows with deficits out of the sparse and decaying
2754 struct cake_flow *flow = b->flows + j;
2997 flow = &b->flows[idx % CAKE_QUEUES];
3069 if (list_empty(&b->flows[j].flowchain)) {