net/sched/sch_cake.c

28  * - Each priority tin has a separate Flow Queue system, to isolate traffic
45  * bandwidth sharing threshold the tin is operating.  This determines whether a
47  * that tin in the current pass.
359 /* tin priority order for stats dumping */
1525 	/* charge packet bandwidth to this tin
1555 	u32 idx = 0, tin = 0, len;
1571 	tin = qq.t;
1574 	b = &q->tins[tin];
1580 		return idx + (tin << 16);
1604 	return idx + (tin << 16);
1667 	u32 tin, mark;
1681 		tin = 0;
1684 		tin = q->tin_order[mark - 1];
1689 		tin = q->tin_order[TC_H_MIN(skb->priority) - 1];
1694 		tin = q->tin_index[dscp];
1696 		if (unlikely(tin >= q->tin_cnt))
1697 			tin = 0;
1700 	return &q->tins[tin];
1964 /* Discard leftover packets from a tin no longer in use. */
1965 static void cake_clear_tin(struct Qdisc *sch, u16 tin)
1970 	q->cur_tin = tin;
2038 		 * - Highest-priority tin with queue and meeting schedule, or
2039 		 * - The earliest-scheduled tin with queue.
2042 		int tin, best_tin = 0;
2044 		for (tin = 0; tin < q->tin_cnt; tin++) {
2045 			b = q->tins + tin;
2054 					best_tin = tin;