bzip2-36/bzip2/blocksort.c

218    Int32 ftab[257];
231    for (i = 0; i < 257;    i++) ftab[i] = 0;
232    for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
233    for (i = 0; i < 256;    i++) ftabCopy[i] = ftab[i];
234    for (i = 1; i < 257;    i++) ftab[i] += ftab[i-1];
238       k = ftab[j] - 1;
239       ftab[j] = k;
245    for (i = 0; i < 256; i++) SET_BH(ftab[i]);
741       ftab [0 .. 65536 ] destroyed
746 #define BIGFREQ(b) (ftab[((b)+1) << 8] - ftab[(b) << 8])
754                 UInt32* ftab,
770    for (i = 65536; i >= 0; i--) ftab[i] = 0;
777       ftab[j]++;
780       ftab[j]++;
783       ftab[j]++;
786       ftab[j]++;
791       ftab[j]++;
803    for (i = 1; i <= 65536; i++) ftab[i] += ftab[i-1];
809       j = ftab[s] -1;
810       ftab[s] = j;
813       j = ftab[s] -1;
814       ftab[s] = j;
817       j = ftab[s] -1;
818       ftab[s] = j;
821       j = ftab[s] -1;
822       ftab[s] = j;
827       j = ftab[s] -1;
828       ftab[s] = j;
833       Now ftab contains the first loc of every small bucket.
889             if ( ! (ftab[sb] & SETMASK) ) {
890                Int32 lo = ftab[sb]   & CLEARMASK;
891                Int32 hi = (ftab[sb+1] & CLEARMASK) - 1;
905             ftab[sb] |= SETMASK;
920             copyStart[j] =  ftab[(j << 8) + ss]     & CLEARMASK;
921             copyEnd  [j] = (ftab[(j << 8) + ss + 1] & CLEARMASK) - 1;
923          for (j = ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) {
929          for (j = (ftab[(ss+1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) {
946       for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK;
990          Int32 bbStart  = ftab[ss << 8] & CLEARMASK;
991          Int32 bbSize   = (ftab[(ss+1) << 8] & CLEARMASK) - bbStart;
1028       ftab [ 0 .. 65536 ] destroyed
1035    UInt32* ftab   = s->ftab;
1045       fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
1068       mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
1079          fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );