271 static void fallbackSort(UInt32* fmap, UInt32* eclass, UInt32* bhtab, Int32 nblock, Int32 verb) {  in fallbackSort()  argument
287     for (i = 0; i < nblock; i++)  in fallbackSort()
294     for (i = 0; i < nblock; i++) {  in fallbackSort()
301     nBhtab = 2 + (nblock / 32);  in fallbackSort()
315         SET_BH(nblock + 2 * i);  in fallbackSort()
316         CLEAR_BH(nblock + 2 * i + 1);  in fallbackSort()
326         for (i = 0; i < nblock; i++) {  in fallbackSort()
331                 k += nblock;  in fallbackSort()
349             if (l >= nblock)  in fallbackSort()
360             if (r >= nblock)  in fallbackSort()
384         if (H > nblock || nNotDone == 0)  in fallbackSort()
396     for (i = 0; i < nblock; i++) {  in fallbackSort()
422                                UInt32 nblock,  in mainGtU()  argument
514     k = nblock + 8;  in mainGtU()
606         if (i1 >= nblock)  in mainGtU()
607             i1 -= nblock;  in mainGtU()
608         if (i2 >= nblock)  in mainGtU()
609             i2 -= nblock;  in mainGtU()
631                            Int32 nblock,  in mainSimpleSort()  argument
658             while (mainGtU(ptr[j - h] + d, v + d, block, quadrant, nblock, budget)) {  in mainSimpleSort()
672             while (mainGtU(ptr[j - h] + d, v + d, block, quadrant, nblock, budget)) {  in mainSimpleSort()
686             while (mainGtU(ptr[j - h] + d, v + d, block, quadrant, nblock, budget)) {  in mainSimpleSort()
786                        Int32 nblock,  in mainQSort3()  argument
810             mainSimpleSort(ptr, block, quadrant, nblock, lo, hi, d, budget);  in mainQSort3()
932                      Int32 nblock,  in mainSort()  argument
951     i = nblock - 1;  in mainSort()
974         block[nblock + i] = block[i];  in mainSort()
975         quadrant[nblock + i] = 0;  in mainSort()
986     i = nblock - 1;  in mainSort()
1082                         mainQSort3(ptr, block, quadrant, nblock, lo, hi, BZ_N_RADIX, budget);  in mainSort()
1109                     k += nblock;  in mainSort()
1117                     k += nblock;  in mainSort()
1129                     (copyStart[ss] == 0 && copyEnd[ss] == nblock - 1),  in mainSort()
1188                     quadrant[a2update + nblock] = qVal;  in mainSort()
1196                  nblock,  in mainSort()
1198                  nblock - numQSorted);  in mainSort()
1222     Int32 nblock = s->nblock;  in BZ2_blockSort()  local
1230     if (nblock < 10000) {  in BZ2_blockSort()
1231         fallbackSort(s->arr1, s->arr2, ftab, nblock, verb);  in BZ2_blockSort()
1239         i = nblock + BZ_N_OVERSHOOT;  in BZ2_blockSort()
1255         budgetInit = nblock * ((wfact - 1) / 3);  in BZ2_blockSort()
1258         mainSort(ptr, block, quadrant, ftab, nblock, verb, &budget);  in BZ2_blockSort()
1262                      nblock,  in BZ2_blockSort()
1263                      (float)(budgetInit - budget) / (float)(nblock == 0 ? 1 : nblock));  in BZ2_blockSort()
1268             fallbackSort(s->arr1, s->arr2, ftab, nblock, verb);  in BZ2_blockSort()
1273     for (i = 0; i < s->nblock; i++)  in BZ2_blockSort()