Lines Matching refs:ftab
272 Int32 ftab[257]; in fallbackSort() local
286 ftab[i] = 0; in fallbackSort()
288 ftab[eclass8[i]]++; in fallbackSort()
290 ftabCopy[i] = ftab[i]; in fallbackSort()
292 ftab[i] += ftab[i - 1]; in fallbackSort()
296 k = ftab[j] - 1; in fallbackSort()
297 ftab[j] = k; in fallbackSort()
305 SET_BH(ftab[i]); in fallbackSort()
924 #define BIGFREQ(b) (ftab[((b) + 1) << 8] - ftab[(b) << 8])
931 UInt32* ftab, in mainSort() argument
948 ftab[i] = 0; in mainSort()
955 ftab[j]++; in mainSort()
958 ftab[j]++; in mainSort()
961 ftab[j]++; in mainSort()
964 ftab[j]++; in mainSort()
969 ftab[j]++; in mainSort()
983 ftab[i] += ftab[i - 1]; in mainSort()
989 j = ftab[s] - 1; in mainSort()
990 ftab[s] = j; in mainSort()
993 j = ftab[s] - 1; in mainSort()
994 ftab[s] = j; in mainSort()
997 j = ftab[s] - 1; in mainSort()
998 ftab[s] = j; in mainSort()
1001 j = ftab[s] - 1; in mainSort()
1002 ftab[s] = j; in mainSort()
1007 j = ftab[s] - 1; in mainSort()
1008 ftab[s] = j; in mainSort()
1071 if (!(ftab[sb] & SETMASK)) { in mainSort()
1072 Int32 lo = ftab[sb] & CLEARMASK; in mainSort()
1073 Int32 hi = (ftab[sb + 1] & CLEARMASK) - 1; in mainSort()
1088 ftab[sb] |= SETMASK; in mainSort()
1103 copyStart[j] = ftab[(j << 8) + ss] & CLEARMASK; in mainSort()
1104 copyEnd[j] = (ftab[(j << 8) + ss + 1] & CLEARMASK) - 1; in mainSort()
1106 for (j = ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) { in mainSort()
1114 for (j = (ftab[(ss + 1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) { in mainSort()
1132 for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK; in mainSort()
1176 Int32 bbStart = ftab[ss << 8] & CLEARMASK; in mainSort()
1177 Int32 bbSize = (ftab[(ss + 1) << 8] & CLEARMASK) - bbStart; in mainSort()
1221 UInt32* ftab = s->ftab; in BZ2_blockSort() local
1231 fallbackSort(s->arr1, s->arr2, ftab, nblock, verb); in BZ2_blockSort()
1258 mainSort(ptr, block, quadrant, ftab, nblock, verb, &budget); in BZ2_blockSort()
1268 fallbackSort(s->arr1, s->arr2, ftab, nblock, verb); in BZ2_blockSort()