Lines Matching refs:tin
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.
358 /* tin priority order for stats dumping */
1475 /* charge packet bandwidth to this tin
1505 u32 idx = 0, tin = 0, len;
1521 tin = qq.t;
1524 b = &q->tins[tin];
1530 return idx + (tin << 16);
1555 return idx + (tin << 16);
1618 u32 tin, mark;
1632 tin = 0;
1635 tin = q->tin_order[mark - 1];
1640 tin = q->tin_order[TC_H_MIN(skb->priority) - 1];
1645 tin = q->tin_index[dscp];
1647 if (unlikely(tin >= q->tin_cnt))
1648 tin = 0;
1651 return &q->tins[tin];
1933 /* Discard leftover packets from a tin no longer in use. */
1934 static void cake_clear_tin(struct Qdisc *sch, u16 tin)
1939 q->cur_tin = tin;
2008 * - Highest-priority tin with queue and meeting schedule, or
2009 * - The earliest-scheduled tin with queue.
2012 int tin, best_tin = 0;
2014 for (tin = 0; tin < q->tin_cnt; tin++) {
2015 b = q->tins + tin;
2024 best_tin = tin;