Home
last modified time | relevance | path

Searched refs:tins (Results 1 - 2 of 2) sorted by relevance

/kernel/linux/linux-5.10/net/sched/
H A Dsch_cake.c26 * the priority is reduced to avoid starving other tins.
197 }; /* number of tins is small, so size of this struct doesn't matter much */
202 struct cake_tin_data *tins; member
1404 q->tins[ii.t].overflow_idx[ii.b] = j; in cake_heap_swap()
1405 q->tins[jj.t].overflow_idx[jj.b] = i; in cake_heap_swap()
1412 return q->tins[ii.t].backlogs[ii.b]; in cake_heap_get_backlog()
1524 b = &q->tins[tin]; in cake_drop()
1651 return &q->tins[tin]; in cake_select_tin()
1913 struct cake_tin_data *b = &q->tins[q->cur_tin]; in cake_dequeue_one()
1948 struct cake_tin_data *b = &q->tins[ in cake_dequeue()
[all...]
/kernel/linux/linux-6.6/net/sched/
H A Dsch_cake.c26 * the priority is reduced to avoid starving other tins.
198 }; /* number of tins is small, so size of this struct doesn't matter much */
203 struct cake_tin_data *tins; member
1405 q->tins[ii.t].overflow_idx[ii.b] = j; in cake_heap_swap()
1406 q->tins[jj.t].overflow_idx[jj.b] = i; in cake_heap_swap()
1413 return q->tins[ii.t].backlogs[ii.b]; in cake_heap_get_backlog()
1525 b = &q->tins[tin]; in cake_drop()
1652 return &q->tins[tin]; in cake_select_tin()
1914 struct cake_tin_data *b = &q->tins[q->cur_tin]; in cake_dequeue_one()
1949 struct cake_tin_data *b = &q->tins[ in cake_dequeue()
[all...]

Completed in 7 milliseconds