Lines Matching full:ftab
601 UInt32* ftab;
2264 Int32 ftab[257];
2277 for (i = 0; i < 257; i++) ftab[i] = 0;
2278 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
2279 for (i = 0; i < 256; i++) ftabCopy[i] = ftab[i];
2280 for (i = 1; i < 257; i++) ftab[i] += ftab[i-1];
2284 k = ftab[j] - 1;
2285 ftab[j] = k;
2291 for (i = 0; i < 256; i++) SET_BH(ftab[i]);
2787 ftab [0 .. 65536 ] destroyed
2792 #define BIGFREQ(b) (ftab[((b)+1) << 8] - ftab[(b) << 8])
2800 UInt32* ftab,
2816 for (i = 65536; i >= 0; i--) ftab[i] = 0;
2823 ftab[j]++;
2826 ftab[j]++;
2829 ftab[j]++;
2832 ftab[j]++;
2837 ftab[j]++;
2849 for (i = 1; i <= 65536; i++) ftab[i] += ftab[i-1];
2855 j = ftab[s] -1;
2856 ftab[s] = j;
2859 j = ftab[s] -1;
2860 ftab[s] = j;
2863 j = ftab[s] -1;
2864 ftab[s] = j;
2867 j = ftab[s] -1;
2868 ftab[s] = j;
2873 j = ftab[s] -1;
2874 ftab[s] = j;
2879 Now ftab contains the first loc of every small bucket.
2935 if ( ! (ftab[sb] & SETMASK) ) {
2936 Int32 lo = ftab[sb] & CLEARMASK;
2937 Int32 hi = (ftab[sb+1] & CLEARMASK) - 1;
2951 ftab[sb] |= SETMASK;
2966 copyStart[j] = ftab[(j << 8) + ss] & CLEARMASK;
2967 copyEnd [j] = (ftab[(j << 8) + ss + 1] & CLEARMASK) - 1;
2969 for (j = ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) {
2975 for (j = (ftab[(ss+1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) {
2992 for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK;
3036 Int32 bbStart = ftab[ss << 8] & CLEARMASK;
3037 Int32 bbSize = (ftab[(ss+1) << 8] & CLEARMASK) - bbStart;
3074 ftab [ 0 .. 65536 ] destroyed
3081 UInt32* ftab = s->ftab;
3091 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3114 mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
3125 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
4549 s->ftab = NULL;
4554 s->ftab = BZALLOC( 65537 * sizeof(UInt32) );
4556 if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) {
4559 if (s->ftab != NULL) BZFREE(s->ftab);
4853 if (s->ftab != NULL) BZFREE(s->ftab);
