1022       UInt32* ftab;  member
2066    Int32 ftab[257];  in fallbackSort()  local
2079    for (i = 0; i < 257; i++) ftab[i] = 0;  in fallbackSort()
2080    for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;  in fallbackSort()
2081    for (i = 0; i < 256; i++) ftabCopy[i] = ftab[i];  in fallbackSort()
2082    for (i = 1; i < 257; i++) ftab[i] += ftab[i-1];  in fallbackSort()
2086       k = ftab[j] - 1;  in fallbackSort()
2087       ftab[j] = k;  in fallbackSort()
2093    for (i = 0; i < 256; i++) bhtab[(ftab[i]) >> 5] |= (1 << ((ftab[i]) & 31));  in fallbackSort()
2492                 UInt32* ftab,  in mainSort()  argument
2508    for (i = 65536; i >= 0; i--) ftab[i] = 0;  in mainSort()
2515       ftab[j]++;  in mainSort()
2518       ftab[j]++;  in mainSort()
2521       ftab[j]++;  in mainSort()
2524       ftab[j]++;  in mainSort()
2529       ftab[j]++;  in mainSort()
2541    for (i = 1; i <= 65536; i++) ftab[i] += ftab[i-1];  in mainSort()
2547       j = ftab[s] -1;  in mainSort()
2548       ftab[s] = j;  in mainSort()
2551       j = ftab[s] -1;  in mainSort()
2552       ftab[s] = j;  in mainSort()
2555       j = ftab[s] -1;  in mainSort()
2556       ftab[s] = j;  in mainSort()
2559       j = ftab[s] -1;  in mainSort()
2560       ftab[s] = j;  in mainSort()
2565       j = ftab[s] -1;  in mainSort()
2566       ftab[s] = j;  in mainSort()
2589 …while ( (ftab[((runningOrder[j-h])+1) << 8] - ftab[(runningOrder[j-h]) << 8]) > (ftab[((vv)+1) << …  in mainSort()
2619             if ( ! (ftab[sb] & (1 << 21)) ) {  in mainSort()
2620                Int32 lo = ftab[sb] & (~((1 << 21)));  in mainSort()
2621                Int32 hi = (ftab[sb+1] & (~((1 << 21)))) - 1;  in mainSort()
2635             ftab[sb] |= (1 << 21);  in mainSort()
2643             copyStart[j] = ftab[(j << 8) + ss] & (~((1 << 21)));  in mainSort()
2644             copyEnd [j] = (ftab[(j << 8) + ss + 1] & (~((1 << 21)))) - 1;  in mainSort()
2646          for (j = ftab[ss << 8] & (~((1 << 21))); j < copyStart[ss]; j++) {  in mainSort()
2652          for (j = (ftab[(ss+1) << 8] & (~((1 << 21)))) - 1; j > copyEnd[ss]; j--) {  in mainSort()
2662       for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= (1 << 21);  in mainSort()
2667          Int32 bbStart = ftab[ss << 8] & (~((1 << 21)));  in mainSort()
2668          Int32 bbSize = (ftab[(ss+1) << 8] & (~((1 << 21)))) - bbStart;  in mainSort()
2694    UInt32* ftab = s->ftab;  in BZ2_blockSort()  local
2704       fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );  in BZ2_blockSort()
2720       mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );  in BZ2_blockSort()
2731          fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );  in BZ2_blockSort()
3662    s->ftab = ((void *)0);  in BZ2_bzCompressInit()
3667    s->ftab = (strm->bzalloc)(strm->opaque,(65537 * sizeof(UInt32)),1);  in BZ2_bzCompressInit()
3669    if (s->arr1 == ((void *)0) || s->arr2 == ((void *)0) || s->ftab == ((void *)0)) {  in BZ2_bzCompressInit()
3672       if (s->ftab != ((void *)0)) (strm->bzfree)(strm->opaque,(s->ftab));  in BZ2_bzCompressInit()
3936    if (s->ftab != ((void *)0)) (strm->bzfree)(strm->opaque,(s->ftab));  in BZ2_bzCompressEnd()