net/sched/sch_cake.c

80 #define CAKE_QUEUES (1024)
151 	struct cake_flow flows[CAKE_QUEUES];
152 	u32	backlogs[CAKE_QUEUES];
153 	u32	tags[CAKE_QUEUES]; /* for set association */
154 	u16	overflow_idx[CAKE_QUEUES];
155 	struct cake_host hosts[CAKE_QUEUES]; /* for triple isolation */
205 	struct cake_heap_entry overflow_heap[CAKE_QUEUES * CAKE_MAX_TINS];
300 static u16 quantum_div[CAKE_QUEUES + 1] = {0};
739 	reduced_hash = flow_hash % CAKE_QUEUES;
801 			srchost_idx = srchost_hash % CAKE_QUEUES;
824 			dsthost_idx = dsthost_hash % CAKE_QUEUES;
1418 	static const u32 a = CAKE_MAX_TINS * CAKE_QUEUES;
1455 	while (i > 0 && i < CAKE_MAX_TINS * CAKE_QUEUES) {
1515 		for (i = CAKE_MAX_TINS * CAKE_QUEUES / 2 - 1; i >= 0; i--)
1683 		if (TC_H_MIN(res.classid) <= CAKE_QUEUES)
1685 		if (TC_H_MAJ(res.classid) <= (CAKE_QUEUES << 16))
1941 	for (q->cur_flow = 0; q->cur_flow < CAKE_QUEUES; q->cur_flow++)
2094 		WARN_ON(host_load > CAKE_QUEUES);
2747 	for (i = 1; i <= CAKE_QUEUES; i++)
2765 		for (j = 0; j < CAKE_QUEUES; j++) {
3008 	if (idx < CAKE_QUEUES * q->tin_cnt) {
3010 			&q->tins[q->tin_order[idx / CAKE_QUEUES]];
3013 		flow = &b->flows[idx % CAKE_QUEUES];
3024 		qs.backlog = b->backlogs[idx % CAKE_QUEUES];
3084 		for (j = 0; j < CAKE_QUEUES; j++) {
3089 			if (!tc_qdisc_stats_dump(sch, i * CAKE_QUEUES + j + 1,