Lines Matching defs:nblock
596 Int32 nblock;
1475 Int32 nblock;
1529 nblock = s->save_nblock;
1722 nblock = 0;
1747 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1748 s->ll16[nblock] = (UInt16)uc;
1749 nblock++;
1754 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1755 s->tt[nblock] = (UInt32)uc;
1756 nblock++;
1764 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1822 s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
1823 s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
1824 nblock++;
1831 /* Now we know what nblock is, we can do a better sanity
1834 if (s->origPtr < 0 || s->origPtr >= nblock)
1842 if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
1843 /* s->cftab[i] can legitimately be == nblock */
1860 for (i = 0; i < nblock; i++) {
1890 for (i = 0; i < nblock; i++) {
1956 s->save_nblock = nblock;
2215 nblock > 0
2216 eclass exists for [0 .. nblock-1]
2217 ((UChar*)eclass) [0 .. nblock-1] holds block
2218 ptr exists for [0 .. nblock-1]
2221 ((UChar*)eclass) [0 .. nblock-1] holds block
2223 fmap [0 .. nblock-1] holds sorted order
2224 bhtab [ 0 .. 2+(nblock/32) ] destroyed
2237 Int32 nblock,
2254 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
2258 for (i = 0; i < nblock; i++) {
2265 nBhtab = 2 + (nblock / 32);
2277 SET_BH(nblock + 2*i);
2278 CLEAR_BH(nblock + 2*i + 1);
2289 for (i = 0; i < nblock; i++) {
2291 k = fmap[i] - H; if (k < 0) k += nblock;
2307 if (l >= nblock) break;
2314 if (r >= nblock) break;
2334 if (H > nblock || nNotDone == 0) break;
2339 eclass8 [0 .. nblock-1], since the
2345 for (i = 0; i < nblock; i++) {
2373 UInt32 nblock,
2430 k = nblock + 8;
2482 if (i1 >= nblock) i1 -= nblock;
2483 if (i2 >= nblock) i2 -= nblock;
2510 Int32 nblock,
2537 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2551 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2565 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2646 Int32 nblock,
2673 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
2755 nblock > N_OVERSHOOT
2756 block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
2757 ((UChar*)block32) [0 .. nblock-1] holds block
2758 ptr exists for [0 .. nblock-1]
2761 ((UChar*)block32) [0 .. nblock-1] holds block
2764 ptr [0 .. nblock-1] holds sorted order
2777 Int32 nblock,
2795 i = nblock-1;
2818 block [nblock+i] = block[i];
2819 quadrant[nblock+i] = 0;
2828 i = nblock-1;
2920 ptr, block, quadrant, nblock,
2946 k = ptr[j]-1; if (k < 0) k += nblock;
2952 k = ptr[j]-1; if (k < 0) k += nblock;
2965 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
2988 for 0 <= i < nblock and 0 <= j <= nblock
3023 quadrant[a2update + nblock] = qVal;
3032 nblock, numQSorted, nblock - numQSorted );
3042 nblock > 0
3043 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
3044 ((UChar*)arr2) [0 .. nblock-1] holds block
3045 arr1 exists for [0 .. nblock-1]
3048 ((UChar*)arr2) [0 .. nblock-1] holds block
3051 arr1 [0 .. nblock-1] holds sorted order
3058 Int32 nblock = s->nblock;
3066 if (nblock < /* 10000 */1000 ) {
3067 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3074 i = nblock+BZ_N_OVERSHOOT;
3087 budgetInit = nblock * ((wfact-1) / 3);
3090 mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
3094 nblock,
3096 (float)(nblock==0 ? 1 : nblock) );
3101 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3106 for (i = 0; i < s->nblock; i++)
3533 s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
3535 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ]
3540 ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
3547 (UChar*) (&((UChar*)s->arr2)[s->nblock])
3566 for (i = 0; i < s->nblock; i++) {
3569 j = ptr[i]-1; if (j < 0) j += s->nblock;
3667 s->nblock, s->nMTF, s->nInUse );
4007 if (s->nblock > 0) {
4017 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
4022 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
4033 if (s->nblock > 0) {
4471 s->nblock = 0;
4577 s->block[s->nblock] = (UChar)ch; s->nblock++;
4580 s->block[s->nblock] = (UChar)ch; s->nblock++;
4581 s->block[s->nblock] = (UChar)ch; s->nblock++;
4584 s->block[s->nblock] = (UChar)ch; s->nblock++;
4585 s->block[s->nblock] = (UChar)ch; s->nblock++;
4586 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)ch; s->nblock++;
4593 s->block[s->nblock] = (UChar)ch; s->nblock++;
4594 s->block[s->nblock] = ((UChar)(s->state_in_len-4));
4595 s->nblock++;
4620 zs->block[zs->nblock] = (UChar)ch; \
4621 zs->nblock++; \
4649 if (s->nblock >= s->nblockMAX) break;
4665 if (s->nblock >= s->nblockMAX) break;
4741 if (s->nblock >= s->nblockMAX) {
