anchor.diff:              int lo = _ftab[sb] & CLEARMASK;
               int hi = (_ftab[sb + 1] & CLEARMASK) - 1;
               if (hi > lo) {
  -              _mainQSort3(ptr, block, quadrant, nblock,
  -                         lo, hi, BZ_N_RADIX);
  +              _mainQSort3(
  +                  ptr,
  +                  block,
  +                  quadrant,
  +                  nblock,
  +                  lo,
  +                  hi,
  +                  BZ_N_RADIX);
                 numQSorted += (hi - lo + 1);
                 if (_budget < 0) {
                   return;
  
positive.code:       }
  
        for (j = _ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) {
          int k = ptr[j]-1; if (k < 0) k += nblock;
          int c1 = block[k];
          if (bigDone[c1] == 0) {
             ptr[ copyStart[c1]++ ] = k;
          }
        }
  
        for (j = (_ftab[(ss+1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) {
          int k = ptr[j] - 1;
          if (k < 0) {
            k += nblock;
  
negative.code:       }
  
        _assert((copyStart[ss] - 1 == copyEnd[ss]) ||
            // Extremely rare case missing in bzip2-1.0.0 and 1.0.1.
            // Necessity for this case is demonstrated by compressing
            // a sequence of approximately 48.5 million of character
            // 251; 1.0.0/1.0.1 will then die here.
            (copyStart[ss] == 0 && copyEnd[ss] == nblock - 1));
  
        for (j = 0; j <= 255; j++) {
          _ftab[(j << 8) + ss] |= SETMASK;
  