Lines Matching defs:CAKE_QUEUES
79 #define CAKE_QUEUES (1024)
150 struct cake_flow flows[CAKE_QUEUES];
151 u32 backlogs[CAKE_QUEUES];
152 u32 tags[CAKE_QUEUES]; /* for set association */
153 u16 overflow_idx[CAKE_QUEUES];
154 struct cake_host hosts[CAKE_QUEUES]; /* for triple isolation */
204 struct cake_heap_entry overflow_heap[CAKE_QUEUES * CAKE_MAX_TINS];
299 static u16 quantum_div[CAKE_QUEUES + 1] = {0};
738 reduced_hash = flow_hash % CAKE_QUEUES;
800 srchost_idx = srchost_hash % CAKE_QUEUES;
823 dsthost_idx = dsthost_hash % CAKE_QUEUES;
1417 static const u32 a = CAKE_MAX_TINS * CAKE_QUEUES;
1454 while (i > 0 && i < CAKE_MAX_TINS * CAKE_QUEUES) {
1514 for (i = CAKE_MAX_TINS * CAKE_QUEUES / 2; i >= 0; i--)
1682 if (TC_H_MIN(res.classid) <= CAKE_QUEUES)
1684 if (TC_H_MAJ(res.classid) <= (CAKE_QUEUES << 16))
1940 for (q->cur_flow = 0; q->cur_flow < CAKE_QUEUES; q->cur_flow++)
2093 WARN_ON(host_load > CAKE_QUEUES);
2737 for (i = 1; i <= CAKE_QUEUES; i++)
2755 for (j = 0; j < CAKE_QUEUES; j++) {
2994 if (idx < CAKE_QUEUES * q->tin_cnt) {
2996 &q->tins[q->tin_order[idx / CAKE_QUEUES]];
2999 flow = &b->flows[idx % CAKE_QUEUES];
3010 qs.backlog = b->backlogs[idx % CAKE_QUEUES];
3070 for (j = 0; j < CAKE_QUEUES; j++) {
3076 if (arg->fn(sch, i * CAKE_QUEUES + j + 1, arg) < 0) {