contrib/bzip2/blocksort.c

193       nblock > 0
194       eclass exists for [0 .. nblock-1]
195       ((UChar*)eclass) [0 .. nblock-1] holds block
196       ptr exists for [0 .. nblock-1]
199       ((UChar*)eclass) [0 .. nblock-1] holds block
201       fmap [0 .. nblock-1] holds sorted order
202       bhtab [ 0 .. 2+(nblock/32) ] destroyed
215                     Int32   nblock,
232    for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
236    for (i = 0; i < nblock; i++) {
243    nBhtab = 2 + (nblock / 32);
255       SET_BH(nblock + 2*i);
256       CLEAR_BH(nblock + 2*i + 1);
267       for (i = 0; i < nblock; i++) {
269          k = fmap[i] - H; if (k < 0) k += nblock;
285          if (l >= nblock) break;
292          if (r >= nblock) break;
312       if (H > nblock || nNotDone == 0) break;
317       eclass8 [0 .. nblock-1], since the
323    for (i = 0; i < nblock; i++) {
351                UInt32  nblock,
408    k = nblock + 8;
460       if (i1 >= nblock) i1 -= nblock;
461       if (i2 >= nblock) i2 -= nblock;
488                       Int32   nblock,
515                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget
529                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget
543                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget
624                   Int32   nblock,
651          mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
733       nblock > N_OVERSHOOT
734       block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
735       ((UChar*)block32) [0 .. nblock-1] holds block
736       ptr exists for [0 .. nblock-1]
739       ((UChar*)block32) [0 .. nblock-1] holds block
742       ptr [0 .. nblock-1] holds sorted order
755                 Int32   nblock,
773    i = nblock-1;
796       block   [nblock+i] = block[i];
797       quadrant[nblock+i] = 0;
806    i = nblock-1;
898                      ptr, block, quadrant, nblock,
924             k = ptr[j]-1; if (k < 0) k += nblock;
930             k = ptr[j]-1; if (k < 0) k += nblock;
943                 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
966             for 0 <= i < nblock and 0 <= j <= nblock
1001                quadrant[a2update + nblock] = qVal;
1010                  nblock, numQSorted, nblock - numQSorted );
1020       nblock > 0
1021       arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
1022       ((UChar*)arr2)  [0 .. nblock-1] holds block
1023       arr1 exists for [0 .. nblock-1]
1026       ((UChar*)arr2) [0 .. nblock-1] holds block
1029       arr1 [0 .. nblock-1] holds sorted order
1036    Int32   nblock = s->nblock;
1044    if (nblock < 10000) {
1045       fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
1052       i = nblock+BZ_N_OVERSHOOT;
1065       budgetInit = nblock * ((wfact-1) / 3);
1068       mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
1072                     nblock,
1074                     (float)(nblock==0 ? 1 : nblock) );
1079          fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
1084    for (i = 0; i < s->nblock; i++)