255                     Int32   nblock,  in fallbackSort()  argument
272    for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;  in fallbackSort()
276    for (i = 0; i < nblock; i++) {  in fallbackSort()
283    nBhtab = 2 + (nblock / 32);  in fallbackSort()
295       SET_BH(nblock + 2*i);  in fallbackSort()
296       CLEAR_BH(nblock + 2*i + 1);  in fallbackSort()
307       for (i = 0; i < nblock; i++) {  in fallbackSort()
309          k = fmap[i] - H; if (k < 0) k += nblock;  in fallbackSort()
325          if (l >= nblock) break;  in fallbackSort()
332          if (r >= nblock) break;  in fallbackSort()
352       if (H > nblock || nNotDone == 0) break;  in fallbackSort()
363    for (i = 0; i < nblock; i++) {  in fallbackSort()
391                UInt32  nblock,  in mainGtU()  argument
448    k = nblock + 8;  in mainGtU()
500       if (i1 >= nblock) i1 -= nblock;  in mainGtU()
501       if (i2 >= nblock) i2 -= nblock;  in mainGtU()
528                       Int32   nblock,  in mainSimpleSort()  argument
555                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget   in mainSimpleSort()
569                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget   in mainSimpleSort()
583                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget   in mainSimpleSort()
664                   Int32   nblock,  in mainQSort3()  argument
691          mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );  in mainQSort3()
795                 Int32   nblock,  in mainSort()  argument
813    i = nblock-1;  in mainSort()
836       block   [nblock+i] = block[i];  in mainSort()
837       quadrant[nblock+i] = 0;  in mainSort()
846    i = nblock-1;  in mainSort()
938                      ptr, block, quadrant, nblock,   in mainSort()
964             k = ptr[j]-1; if (k < 0) k += nblock;  in mainSort()
970             k = ptr[j]-1; if (k < 0) k += nblock;  in mainSort()
983                 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),  in mainSort()
1041                quadrant[a2update + nblock] = qVal;  in mainSort()
1050                  nblock, numQSorted, nblock - numQSorted );  in mainSort()
1076    Int32   nblock = s->nblock;  in BZ2_blockSort()  local
1084    if (nblock < 10000) {  in BZ2_blockSort()
1085       fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );  in BZ2_blockSort()
1092       i = nblock+BZ_N_OVERSHOOT;  in BZ2_blockSort()
1105       budgetInit = nblock * ((wfact-1) / 3);  in BZ2_blockSort()
1108       mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );  in BZ2_blockSort()
1112                     nblock,   in BZ2_blockSort()
1114                     (float)(nblock==0 ? 1 : nblock) );   in BZ2_blockSort()
1119          fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );  in BZ2_blockSort()
1124    for (i = 0; i < s->nblock; i++)  in BZ2_blockSort()