Lines Matching refs:tins
26 * 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;
1405 q->tins[ii.t].overflow_idx[ii.b] = j;
1406 q->tins[jj.t].overflow_idx[jj.b] = i;
1413 return q->tins[ii.t].backlogs[ii.b];
1525 b = &q->tins[tin];
1652 return &q->tins[tin];
1914 struct cake_tin_data *b = &q->tins[q->cur_tin];
1949 struct cake_tin_data *b = &q->tins[q->cur_tin];
1993 b = q->tins;
2016 b = q->tins + tin;
2031 b = q->tins + best_tin;
2208 if (q->tins[i].decaying_flow_count) {
2211 q->tins[i].cparams.target);
2231 if (!q->tins)
2300 struct cake_tin_data *b = &q->tins[0];
2330 struct cake_tin_data *b = &q->tins[i];
2422 struct cake_tin_data *b = &q->tins[i];
2464 cake_set_rate(&q->tins[0], rate, mtu,
2466 cake_set_rate(&q->tins[1], rate >> 4, mtu,
2468 cake_set_rate(&q->tins[2], rate >> 1, mtu,
2470 cake_set_rate(&q->tins[3], rate >> 2, mtu,
2474 q->tins[0].tin_quantum = quantum;
2475 q->tins[1].tin_quantum = quantum >> 4;
2476 q->tins[2].tin_quantum = quantum >> 1;
2477 q->tins[3].tin_quantum = quantum >> 2;
2484 /* Simplified Diffserv structure with 3 tins.
2501 cake_set_rate(&q->tins[0], rate, mtu,
2503 cake_set_rate(&q->tins[1], rate >> 4, mtu,
2505 cake_set_rate(&q->tins[2], rate >> 2, mtu,
2509 q->tins[0].tin_quantum = quantum;
2510 q->tins[1].tin_quantum = quantum >> 4;
2511 q->tins[2].tin_quantum = quantum >> 2;
2546 q->tins[c].cparams.mtu_time = q->tins[ft].cparams.mtu_time;
2549 q->rate_ns = q->tins[ft].tin_rate_ns;
2550 q->rate_shft = q->tins[ft].tin_rate_shft;
2683 if (q->tins) {
2698 kvfree(q->tins);
2738 q->tins = kvcalloc(CAKE_MAX_TINS, sizeof(struct cake_tin_data),
2740 if (!q->tins)
2744 struct cake_tin_data *b = q->tins + i;
2894 struct cake_tin_data *b = &q->tins[q->tin_order[i]];
2994 &q->tins[q->tin_order[idx / CAKE_QUEUES]];
3066 struct cake_tin_data *b = &q->tins[q->tin_order[i]];