Lines Matching refs:tins
26 * 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;
1404 q->tins[ii.t].overflow_idx[ii.b] = j;
1405 q->tins[jj.t].overflow_idx[jj.b] = i;
1412 return q->tins[ii.t].backlogs[ii.b];
1524 b = &q->tins[tin];
1651 return &q->tins[tin];
1913 struct cake_tin_data *b = &q->tins[q->cur_tin];
1948 struct cake_tin_data *b = &q->tins[q->cur_tin];
1992 b = q->tins;
2015 b = q->tins + tin;
2030 b = q->tins + best_tin;
2207 if (q->tins[i].decaying_flow_count) {
2210 q->tins[i].cparams.target);
2230 if (!q->tins)
2299 struct cake_tin_data *b = &q->tins[0];
2329 struct cake_tin_data *b = &q->tins[i];
2421 struct cake_tin_data *b = &q->tins[i];
2463 cake_set_rate(&q->tins[0], rate, mtu,
2465 cake_set_rate(&q->tins[1], rate >> 4, mtu,
2467 cake_set_rate(&q->tins[2], rate >> 1, mtu,
2469 cake_set_rate(&q->tins[3], rate >> 2, mtu,
2473 q->tins[0].tin_quantum = quantum;
2474 q->tins[1].tin_quantum = quantum >> 4;
2475 q->tins[2].tin_quantum = quantum >> 1;
2476 q->tins[3].tin_quantum = quantum >> 2;
2483 /* Simplified Diffserv structure with 3 tins.
2500 cake_set_rate(&q->tins[0], rate, mtu,
2502 cake_set_rate(&q->tins[1], rate >> 4, mtu,
2504 cake_set_rate(&q->tins[2], rate >> 2, mtu,
2508 q->tins[0].tin_quantum = quantum;
2509 q->tins[1].tin_quantum = quantum >> 4;
2510 q->tins[2].tin_quantum = quantum >> 2;
2545 q->tins[c].cparams.mtu_time = q->tins[ft].cparams.mtu_time;
2548 q->rate_ns = q->tins[ft].tin_rate_ns;
2549 q->rate_shft = q->tins[ft].tin_rate_shft;
2685 if (q->tins) {
2700 kvfree(q->tins);
2740 q->tins = kvcalloc(CAKE_MAX_TINS, sizeof(struct cake_tin_data),
2742 if (!q->tins)
2746 struct cake_tin_data *b = q->tins + i;
2896 struct cake_tin_data *b = &q->tins[q->tin_order[i]];
2996 &q->tins[q->tin_order[idx / CAKE_QUEUES]];
3068 struct cake_tin_data *b = &q->tins[q->tin_order[i]];