net/sched/sch_cake.c

1479

static const u32 a = CAKE_MAX_TINS * CAKE_QUEUES;

net/sched/sch_cake.c

1516

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

net/sched/sch_cake.c

152

struct cake_flow flows[CAKE_QUEUES];

net/sched/sch_cake.c

153

u32 backlogs[CAKE_QUEUES];

net/sched/sch_cake.c

154

u32 tags[CAKE_QUEUES]; /* for set association */

net/sched/sch_cake.c

155

u16 overflow_idx[CAKE_QUEUES];

net/sched/sch_cake.c

156

struct cake_host hosts[CAKE_QUEUES]; /* for triple isolation */

net/sched/sch_cake.c

1576

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

net/sched/sch_cake.c

1744

if (TC_H_MIN(res.classid) <= CAKE_QUEUES)

net/sched/sch_cake.c

1746

if (TC_H_MAJ(res.classid) <= (CAKE_QUEUES << 16))

net/sched/sch_cake.c

2002

for (q->cur_flow = 0; q->cur_flow < CAKE_QUEUES; q->cur_flow++)

net/sched/sch_cake.c

226

struct cake_heap_entry overflow_heap[CAKE_QUEUES * CAKE_MAX_TINS];

net/sched/sch_cake.c

2861

for (i = 1; i <= CAKE_QUEUES; i++)

net/sched/sch_cake.c

2878

for (j = 0; j < CAKE_QUEUES; j++) {

net/sched/sch_cake.c

311

static u16 quantum_div[CAKE_QUEUES + 1] = {0};

net/sched/sch_cake.c

3139

if (idx < CAKE_QUEUES * q->tin_cnt) {

net/sched/sch_cake.c

3141

&q->tins[q->tin_order[idx / CAKE_QUEUES]];

net/sched/sch_cake.c

3144

flow = &b->flows[idx % CAKE_QUEUES];

net/sched/sch_cake.c

3155

qs.backlog = READ_ONCE(b->backlogs[idx % CAKE_QUEUES]);

net/sched/sch_cake.c

3219

for (j = 0; j < CAKE_QUEUES; j++) {

net/sched/sch_cake.c

3224

if (!tc_qdisc_stats_dump(sch, i * CAKE_QUEUES + j + 1,

net/sched/sch_cake.c

666

q->hosts[flow->srchost].srchost_bulk_flow_count < CAKE_QUEUES))

net/sched/sch_cake.c

684

q->hosts[flow->dsthost].dsthost_bulk_flow_count < CAKE_QUEUES))

net/sched/sch_cake.c

801

reduced_hash = flow_hash % CAKE_QUEUES;

net/sched/sch_cake.c

864

srchost_idx = srchost_hash % CAKE_QUEUES;

net/sched/sch_cake.c

888

dsthost_idx = dsthost_hash % CAKE_QUEUES;