Lines Matching refs:t
281 Int32 v, t, i, j, gs, ge, totc, bt, bc, iter; in sendMTFValues() local
308 for (t = 0; t < BZ_N_GROUPS; t++) in sendMTFValues()
310 s->len[t][v] = BZ_GREATER_ICOST; in sendMTFValues()
365 for (t = 0; t < nGroups; t++) fave[t] = 0; in sendMTFValues()
367 for (t = 0; t < nGroups; t++) in sendMTFValues()
369 s->rfreq[t][v] = 0; in sendMTFValues()
397 for (t = 0; t < nGroups; t++) cost[t] = 0; in sendMTFValues()
432 for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]; in sendMTFValues()
441 for (t = 0; t < nGroups; t++) in sendMTFValues()
442 if (cost[t] < bc) { bc = cost[t]; bt = t; }; in sendMTFValues()
480 for (t = 0; t < nGroups; t++) in sendMTFValues()
481 VPrintf1 ( "%d ", fave[t] ); in sendMTFValues()
490 for (t = 0; t < nGroups; t++) in sendMTFValues()
491 BZ2_hbMakeCodeLengths ( &(s->len[t][0]), &(s->rfreq[t][0]), in sendMTFValues()
522 for (t = 0; t < nGroups; t++) { in sendMTFValues()
526 if (s->len[t][i] > maxLen) maxLen = s->len[t][i]; in sendMTFValues()
527 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in sendMTFValues()
531 BZ2_hbAssignCodes ( &(s->code[t][0]), &(s->len[t][0]), in sendMTFValues()
572 for (t = 0; t < nGroups; t++) { in sendMTFValues()
573 Int32 curr = s->len[t][0]; in sendMTFValues()
576 while (curr < s->len[t][i]) { bsW(s,2,2); curr++; /* 10 */ }; in sendMTFValues()
577 while (curr > s->len[t][i]) { bsW(s,2,3); curr--; /* 11 */ }; in sendMTFValues()