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.
787 q->flows[reduced_hash].set)) {
805 if (!q->flows[outer_hash + k].set) {
820 if (!q->flows[outer_hash + k].set) {
835 if (q->flows[outer_hash + k].set == CAKE_SET_BULK) {
836 cake_dec_srchost_bulk_flow_count(q, &q->flows[outer_hash + k], flow_mode);
837 cake_dec_dsthost_bulk_flow_count(q, &q->flows[outer_hash + k], flow_mode);
862 q->flows[reduced_hash].srchost = srchost_idx;
864 if (q->flows[reduced_hash].set == CAKE_SET_BULK)
865 cake_inc_srchost_bulk_flow_count(q, &q->flows[reduced_hash], flow_mode);
886 q->flows[reduced_hash].dsthost = dsthost_idx;
888 if (q->flows[reduced_hash].set == CAKE_SET_BULK)
889 cake_inc_dsthost_bulk_flow_count(q, &q->flows[reduced_hash], flow_mode);
1569 flow = &b->flows[idx];
1758 flow = &b->flows[idx];
1956 struct cake_flow *flow = &b->flows[q->cur_flow];
2093 q->cur_flow = flow - b->flows;
2098 /* Keep all flows with deficits out of the sparse and decaying
2781 struct cake_flow *flow = b->flows + j;
3028 flow = &b->flows[idx % CAKE_QUEUES];
3100 if (list_empty(&b->flows[j].flowchain)) {