CAKE_MAX_TINS     205 net/sched/sch_cake.c 	struct cake_heap_entry overflow_heap[CAKE_QUEUES * CAKE_MAX_TINS];
CAKE_MAX_TINS    1377 net/sched/sch_cake.c 	static const u32 a = CAKE_MAX_TINS * CAKE_QUEUES;
CAKE_MAX_TINS    1414 net/sched/sch_cake.c 	while (i > 0 && i < CAKE_MAX_TINS * CAKE_QUEUES) {
CAKE_MAX_TINS    1474 net/sched/sch_cake.c 		for (i = CAKE_MAX_TINS * CAKE_QUEUES / 2; i >= 0; i--)
CAKE_MAX_TINS    2167 net/sched/sch_cake.c 	for (c = 0; c < CAKE_MAX_TINS; c++)
CAKE_MAX_TINS    2499 net/sched/sch_cake.c 	for (c = q->tin_cnt; c < CAKE_MAX_TINS; c++) {
CAKE_MAX_TINS    2696 net/sched/sch_cake.c 	q->tins = kvcalloc(CAKE_MAX_TINS, sizeof(struct cake_tin_data),
CAKE_MAX_TINS    2701 net/sched/sch_cake.c 	for (i = 0; i < CAKE_MAX_TINS; i++) {
CAKE_MAX_TINS    2713 net/sched/sch_cake.c 			u32 k = j * CAKE_MAX_TINS + i;