Searched refs:tins (Results 1 – 1 of 1) sorted by relevance
26 * the priority is reduced to avoid starving other tins.199 }; /* number of tins is small, so size of this struct doesn't matter much */222 struct cake_tin_data *tins; member 1469 q->tins[ii.t].overflow_idx[ii.b] = j; in cake_heap_swap() 1470 q->tins[jj.t].overflow_idx[jj.b] = i; in cake_heap_swap() 1477 return q->tins[ii.t].backlogs[ii.b]; in cake_heap_get_backlog() 1589 b = &q->tins[tin]; in cake_drop() 1716 return &qd->tins[tin]; in cake_select_tin() 1779 tin = (u32)(b - q->tins); in cake_enqueue() 1978 struct cake_tin_data *b = &q->tins[ in cake_dequeue_one() [all...]