CAKE_QUEUES       150 net/sched/sch_cake.c 	struct cake_flow flows[CAKE_QUEUES];
CAKE_QUEUES       151 net/sched/sch_cake.c 	u32	backlogs[CAKE_QUEUES];
CAKE_QUEUES       152 net/sched/sch_cake.c 	u32	tags[CAKE_QUEUES]; /* for set association */
CAKE_QUEUES       153 net/sched/sch_cake.c 	u16	overflow_idx[CAKE_QUEUES];
CAKE_QUEUES       154 net/sched/sch_cake.c 	struct cake_host hosts[CAKE_QUEUES]; /* for triple isolation */
CAKE_QUEUES       205 net/sched/sch_cake.c 	struct cake_heap_entry overflow_heap[CAKE_QUEUES * CAKE_MAX_TINS];
CAKE_QUEUES       300 net/sched/sch_cake.c static u16 quantum_div[CAKE_QUEUES + 1] = {0};
CAKE_QUEUES       702 net/sched/sch_cake.c 	reduced_hash = flow_hash % CAKE_QUEUES;
CAKE_QUEUES       764 net/sched/sch_cake.c 			srchost_idx = srchost_hash % CAKE_QUEUES;
CAKE_QUEUES       787 net/sched/sch_cake.c 			dsthost_idx = dsthost_hash % CAKE_QUEUES;
CAKE_QUEUES      1377 net/sched/sch_cake.c 	static const u32 a = CAKE_MAX_TINS * CAKE_QUEUES;
CAKE_QUEUES      1414 net/sched/sch_cake.c 	while (i > 0 && i < CAKE_MAX_TINS * CAKE_QUEUES) {
CAKE_QUEUES      1474 net/sched/sch_cake.c 		for (i = CAKE_MAX_TINS * CAKE_QUEUES / 2; i >= 0; i--)
CAKE_QUEUES      1618 net/sched/sch_cake.c 		if (TC_H_MIN(res.classid) <= CAKE_QUEUES)
CAKE_QUEUES      1620 net/sched/sch_cake.c 		if (TC_H_MAJ(res.classid) <= (CAKE_QUEUES << 16))
CAKE_QUEUES      1878 net/sched/sch_cake.c 	for (q->cur_flow = 0; q->cur_flow < CAKE_QUEUES; q->cur_flow++)
CAKE_QUEUES      2031 net/sched/sch_cake.c 		WARN_ON(host_load > CAKE_QUEUES);
CAKE_QUEUES      2693 net/sched/sch_cake.c 	for (i = 1; i <= CAKE_QUEUES; i++)
CAKE_QUEUES      2711 net/sched/sch_cake.c 		for (j = 0; j < CAKE_QUEUES; j++) {
CAKE_QUEUES      2954 net/sched/sch_cake.c 	if (idx < CAKE_QUEUES * q->tin_cnt) {
CAKE_QUEUES      2956 net/sched/sch_cake.c 			&q->tins[q->tin_order[idx / CAKE_QUEUES]];
CAKE_QUEUES      2959 net/sched/sch_cake.c 		flow = &b->flows[idx % CAKE_QUEUES];
CAKE_QUEUES      2970 net/sched/sch_cake.c 		qs.backlog = b->backlogs[idx % CAKE_QUEUES];
CAKE_QUEUES      3030 net/sched/sch_cake.c 		for (j = 0; j < CAKE_QUEUES; j++) {
CAKE_QUEUES      3036 net/sched/sch_cake.c 			if (arg->fn(sch, i * CAKE_QUEUES + j + 1, arg) < 0) {