Lines Matching full:nblock
596 Int32 nblock;
1473 Int32 nblock;
1527 nblock = s->save_nblock;
1720 nblock = 0;
1745 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1746 s->ll16[nblock] = (UInt16)uc;
1747 nblock++;
1752 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1753 s->tt[nblock] = (UInt32)uc;
1754 nblock++;
1762 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1820 s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
1821 s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
1822 nblock++;
1829 /* Now we know what nblock is, we can do a better sanity
1832 if (s->origPtr < 0 || s->origPtr >= nblock)
1840 if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
1841 /* s->cftab[i] can legitimately be == nblock */
1858 for (i = 0; i < nblock; i++) {
1888 for (i = 0; i < nblock; i++) {
1954 s->save_nblock = nblock;
2213 nblock > 0
2214 eclass exists for [0 .. nblock-1]
2215 ((UChar*)eclass) [0 .. nblock-1] holds block
2216 ptr exists for [0 .. nblock-1]
2219 ((UChar*)eclass) [0 .. nblock-1] holds block
2221 fmap [0 .. nblock-1] holds sorted order
2222 bhtab [ 0 .. 2+(nblock/32) ] destroyed
2235 Int32 nblock,
2252 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
2256 for (i = 0; i < nblock; i++) {
2263 nBhtab = 2 + (nblock / 32);
2275 SET_BH(nblock + 2*i);
2276 CLEAR_BH(nblock + 2*i + 1);
2287 for (i = 0; i < nblock; i++) {
2289 k = fmap[i] - H; if (k < 0) k += nblock;
2305 if (l >= nblock) break;
2312 if (r >= nblock) break;
2332 if (H > nblock || nNotDone == 0) break;
2337 eclass8 [0 .. nblock-1], since the
2343 for (i = 0; i < nblock; i++) {
2371 UInt32 nblock,
2428 k = nblock + 8;
2480 if (i1 >= nblock) i1 -= nblock;
2481 if (i2 >= nblock) i2 -= nblock;
2508 Int32 nblock,
2535 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2549 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2563 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2644 Int32 nblock,
2671 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
2753 nblock > N_OVERSHOOT
2754 block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
2755 ((UChar*)block32) [0 .. nblock-1] holds block
2756 ptr exists for [0 .. nblock-1]
2759 ((UChar*)block32) [0 .. nblock-1] holds block
2762 ptr [0 .. nblock-1] holds sorted order
2775 Int32 nblock,
2793 i = nblock-1;
2816 block [nblock+i] = block[i];
2817 quadrant[nblock+i] = 0;
2826 i = nblock-1;
2918 ptr, block, quadrant, nblock,
2944 k = ptr[j]-1; if (k < 0) k += nblock;
2950 k = ptr[j]-1; if (k < 0) k += nblock;
2963 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
2986 for 0 <= i < nblock and 0 <= j <= nblock
3021 quadrant[a2update + nblock] = qVal;
3030 nblock, numQSorted, nblock - numQSorted );
3040 nblock > 0
3041 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
3042 ((UChar*)arr2) [0 .. nblock-1] holds block
3043 arr1 exists for [0 .. nblock-1]
3046 ((UChar*)arr2) [0 .. nblock-1] holds block
3049 arr1 [0 .. nblock-1] holds sorted order
3056 Int32 nblock = s->nblock;
3064 if (nblock < /* 10000 */1000 ) {
3065 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3072 i = nblock+BZ_N_OVERSHOOT;
3085 budgetInit = nblock * ((wfact-1) / 3);
3088 mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
3092 nblock,
3094 (float)(nblock==0 ? 1 : nblock) );
3099 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3104 for (i = 0; i < s->nblock; i++)
3531 s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
3533 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ]
3538 ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
3545 (UChar*) (&((UChar*)s->arr2)[s->nblock])
3564 for (i = 0; i < s->nblock; i++) {
3567 j = ptr[i]-1; if (j < 0) j += s->nblock;
3665 s->nblock, s->nMTF, s->nInUse );
4005 if (s->nblock > 0) {
4015 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
4020 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
4031 if (s->nblock > 0) {
4469 s->nblock = 0;
4575 s->block[s->nblock] = (UChar)ch; s->nblock++;
4578 s->block[s->nblock] = (UChar)ch; s->nblock++;
4579 s->block[s->nblock] = (UChar)ch; s->nblock++;
4582 s->block[s->nblock] = (UChar)ch; s->nblock++;
4583 s->block[s->nblock] = (UChar)ch; s->nblock++;
4584 s->block[s->nblock] = (UChar)ch; s->nblock++;
4588 s->block[s->nblock] = (UChar)ch; s->nblock++;
4589 s->block[s->nblock] = (UChar)ch; s->nblock++;
4590 s->block[s->nblock] = (UChar)ch; s->nblock++;
4591 s->block[s->nblock] = (UChar)ch; s->nblock++;
4592 s->block[s->nblock] = ((UChar)(s->state_in_len-4));
4593 s->nblock++;
4618 zs->block[zs->nblock] = (UChar)ch; \
4619 zs->nblock++; \
4647 if (s->nblock >= s->nblockMAX) break;
4663 if (s->nblock >= s->nblockMAX) break;
4739 if (s->nblock >= s->nblockMAX) {
