tin_cnt           208 net/sched/sch_cake.c 	u16		tin_cnt;
tin_cnt          1572 net/sched/sch_cake.c 	else if (mark && mark <= q->tin_cnt)
tin_cnt          1577 net/sched/sch_cake.c 		 TC_H_MIN(skb->priority) <= q->tin_cnt)
tin_cnt          1583 net/sched/sch_cake.c 		if (unlikely(tin >= q->tin_cnt))
tin_cnt          1928 net/sched/sch_cake.c 			if (q->cur_tin >= q->tin_cnt) {
tin_cnt          1952 net/sched/sch_cake.c 		for (tin = 0; tin < q->tin_cnt; tin++) {
tin_cnt          2144 net/sched/sch_cake.c 		for (i = 0; i < q->tin_cnt; i++) {
tin_cnt          2237 net/sched/sch_cake.c 	q->tin_cnt = 1;
tin_cnt          2260 net/sched/sch_cake.c 	q->tin_cnt = 8;
tin_cnt          2264 net/sched/sch_cake.c 	for (i = 0; i < q->tin_cnt; i++) {
tin_cnt          2354 net/sched/sch_cake.c 	q->tin_cnt = 8;
tin_cnt          2361 net/sched/sch_cake.c 	for (i = 0; i < q->tin_cnt; i++) {
tin_cnt          2401 net/sched/sch_cake.c 	q->tin_cnt = 4;
tin_cnt          2444 net/sched/sch_cake.c 	q->tin_cnt = 3;
tin_cnt          2499 net/sched/sch_cake.c 	for (c = q->tin_cnt; c < CAKE_MAX_TINS; c++) {
tin_cnt          2855 net/sched/sch_cake.c 	for (i = 0; i < q->tin_cnt; i++) {
tin_cnt          2954 net/sched/sch_cake.c 	if (idx < CAKE_QUEUES * q->tin_cnt) {
tin_cnt          3027 net/sched/sch_cake.c 	for (i = 0; i < q->tin_cnt; i++) {