Cross Reference: /src/external/bsd/bzip2/dist/blocksort.c

Lines Matching refs:nblock
195       nblock > 0
196       eclass exists for [0 .. nblock-1]
197       ((UChar*)eclass) [0 .. nblock-1] holds block
198       ptr exists for [0 .. nblock-1]
201       ((UChar*)eclass) [0 .. nblock-1] holds block
203       fmap [0 .. nblock-1] holds sorted order
204       bhtab [ 0 .. 2+(nblock/32) ] destroyed
217                     Int32   nblock,
234    for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
238    for (i = 0; i < nblock; i++) {
245    nBhtab = 2 + (nblock / 32);
257       SET_BH(nblock + 2*i);
258       CLEAR_BH(nblock + 2*i + 1);
269       for (i = 0; i < nblock; i++) {
271          k = fmap[i] - H; if (k < 0) k += nblock;
287          if (l >= nblock) break;
294          if (r >= nblock) break;
314       if (H > nblock || nNotDone == 0) break;
319       eclass8 [0 .. nblock-1], since the
325    for (i = 0; i < nblock; i++) {
353                UInt32  nblock,
410    k = nblock + 8;
462       if (i1 >= nblock) i1 -= nblock;
463       if (i2 >= nblock) i2 -= nblock;
490                       Int32   nblock,
517                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget 
531                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget 
545                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget 
626                   Int32   nblock,
653          mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
735       nblock > N_OVERSHOOT
736       block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
737       ((UChar*)block32) [0 .. nblock-1] holds block
738       ptr exists for [0 .. nblock-1]
741       ((UChar*)block32) [0 .. nblock-1] holds block
744       ptr [0 .. nblock-1] holds sorted order
757                 Int32   nblock,
775    i = nblock-1;
798       block   [nblock+i] = block[i];
799       quadrant[nblock+i] = 0;
808    i = nblock-1;
900                      ptr, block, quadrant, nblock, 
926             k = ptr[j]-1; if (k < 0) k += nblock;
932             k = ptr[j]-1; if (k < 0) k += nblock;
945                 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
968             for 0 <= i < nblock and 0 <= j <= nblock
1003                quadrant[a2update + nblock] = qVal;
1012                  nblock, numQSorted, nblock - numQSorted );
1022       nblock > 0
1023       arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
1024       ((UChar*)arr2)  [0 .. nblock-1] holds block
1025       arr1 exists for [0 .. nblock-1]
1028       ((UChar*)arr2) [0 .. nblock-1] holds block
1031       arr1 [0 .. nblock-1] holds sorted order
1038    Int32   nblock = s->nblock;
1046    if (nblock < 10000) {
1047       fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
1054       i = nblock+BZ_N_OVERSHOOT;
1067       budgetInit = nblock * ((wfact-1) / 3);
1070       mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
1074                     nblock, 
1076                     (float)(nblock==0 ? 1 : nblock) ); 
1081          fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
1086    for (i = 0; i < s->nblock; i++)
OpenGrok
