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.
359 /* tin priority order for stats dumping */
1476 /* charge packet bandwidth to this tin
1506 u32 idx = 0, tin = 0, len;
1522 tin = qq.t;
1525 b = &q->tins[tin];
1531 return idx + (tin << 16);
1556 return idx + (tin << 16);
1619 u32 tin, mark;
1633 tin = 0;
1636 tin = q->tin_order[mark - 1];
1641 tin = q->tin_order[TC_H_MIN(skb->priority) - 1];
1646 tin = q->tin_index[dscp];
1648 if (unlikely(tin >= q->tin_cnt))
1649 tin = 0;
1652 return &q->tins[tin];
1934 /* Discard leftover packets from a tin no longer in use. */
1935 static void cake_clear_tin(struct Qdisc *sch, u16 tin)
1940 q->cur_tin = tin;
2009 * - Highest-priority tin with queue and meeting schedule, or
2010 * - The earliest-scheduled tin with queue.
2013 int tin, best_tin = 0;
2015 for (tin = 0; tin < q->tin_cnt; tin++) {
2016 b = q->tins + tin;
2025 best_tin = tin;