net/sched/sch_cake.c

1476

static const u32 a = CAKE_MAX_TINS * CAKE_QUEUES;

net/sched/sch_cake.c

1513

while (i > 0 && i < CAKE_MAX_TINS * CAKE_QUEUES) {

net/sched/sch_cake.c

1573

for (i = CAKE_MAX_TINS * CAKE_QUEUES / 2 - 1; i >= 0; i--)

net/sched/sch_cake.c

226

struct cake_heap_entry overflow_heap[CAKE_QUEUES * CAKE_MAX_TINS];

net/sched/sch_cake.c

2296

for (c = 0; c < CAKE_MAX_TINS; c++)

net/sched/sch_cake.c

2601

for (c = qd->tin_cnt; c < CAKE_MAX_TINS; c++) {

net/sched/sch_cake.c

2849

qd->tins = kvzalloc_objs(struct cake_tin_data, CAKE_MAX_TINS);

net/sched/sch_cake.c

2853

for (i = 0; i < CAKE_MAX_TINS; i++) {

net/sched/sch_cake.c

2865

u32 k = j * CAKE_MAX_TINS + i;