int32_t* budget)
{
int32_t i, j;
- int32_t numQSorted;
Bool bigDone[256];
/* bbox: moved to EState to save stack
int32_t runningOrder[256];
* The main sorting loop.
*/
- numQSorted = 0;
-
for (i = 0; /*i <= 255*/; i++) {
int32_t ss;
lo, hi, BZ_N_RADIX, budget
);
if (*budget < 0) return;
- numQSorted += (hi - lo + 1);
}
}
ftab[sb] |= SETMASK;
for (j = 0; j <= 255; j++)
ftab[(j << 8) + ss] |= SETMASK;
+ if (i == 255)
+ break;
+
/*
* Step 3:
* The [ss] big bucket is now done. Record this fact,
*/
bigDone[ss] = True;
- if (i == 255)
- break;
-
{
int32_t bbStart = ftab[ss << 8] & CLEARMASK;
int32_t bbSize = (ftab[(ss+1) << 8] & CLEARMASK) - bbStart;