Lines Matching full:nblock
612 Int32 nblock;
1488 Int32 nblock;
1542 nblock = s->save_nblock;
1735 nblock = 0;
1760 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1761 s->ll16[nblock] = (UInt16)uc;
1762 nblock++;
1767 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1768 s->tt[nblock] = (UInt32)uc;
1769 nblock++;
1777 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1835 s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
1836 s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
1837 nblock++;
1844 /* Now we know what nblock is, we can do a better sanity
1847 if (s->origPtr < 0 || s->origPtr >= nblock)
1855 if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
1856 /* s->cftab[i] can legitimately be == nblock */
1873 for (i = 0; i < nblock; i++) {
1903 for (i = 0; i < nblock; i++) {
1969 s->save_nblock = nblock;
2228 nblock > 0
2229 eclass exists for [0 .. nblock-1]
2230 ((UChar*)eclass) [0 .. nblock-1] holds block
2231 ptr exists for [0 .. nblock-1]
2234 ((UChar*)eclass) [0 .. nblock-1] holds block
2236 fmap [0 .. nblock-1] holds sorted order
2237 bhtab [ 0 .. 2+(nblock/32) ] destroyed
2250 Int32 nblock,
2267 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
2271 for (i = 0; i < nblock; i++) {
2278 nBhtab = 2 + (nblock / 32);
2290 SET_BH(nblock + 2*i);
2291 CLEAR_BH(nblock + 2*i + 1);
2302 for (i = 0; i < nblock; i++) {
2304 k = fmap[i] - H; if (k < 0) k += nblock;
2320 if (l >= nblock) break;
2327 if (r >= nblock) break;
2347 if (H > nblock || nNotDone == 0) break;
2352 eclass8 [0 .. nblock-1], since the
2358 for (i = 0; i < nblock; i++) {
2386 UInt32 nblock,
2443 k = nblock + 8;
2495 if (i1 >= nblock) i1 -= nblock;
2496 if (i2 >= nblock) i2 -= nblock;
2523 Int32 nblock,
2550 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2564 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2578 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2659 Int32 nblock,
2686 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
2768 nblock > N_OVERSHOOT
2769 block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
2770 ((UChar*)block32) [0 .. nblock-1] holds block
2771 ptr exists for [0 .. nblock-1]
2774 ((UChar*)block32) [0 .. nblock-1] holds block
2777 ptr [0 .. nblock-1] holds sorted order
2790 Int32 nblock,
2808 i = nblock-1;
2831 block [nblock+i] = block[i];
2832 quadrant[nblock+i] = 0;
2841 i = nblock-1;
2933 ptr, block, quadrant, nblock,
2959 k = ptr[j]-1; if (k < 0) k += nblock;
2965 k = ptr[j]-1; if (k < 0) k += nblock;
2978 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
3001 for 0 <= i < nblock and 0 <= j <= nblock
3036 quadrant[a2update + nblock] = qVal;
3045 nblock, numQSorted, nblock - numQSorted );
3055 nblock > 0
3056 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
3057 ((UChar*)arr2) [0 .. nblock-1] holds block
3058 arr1 exists for [0 .. nblock-1]
3061 ((UChar*)arr2) [0 .. nblock-1] holds block
3064 arr1 [0 .. nblock-1] holds sorted order
3071 Int32 nblock = s->nblock;
3079 if (nblock < /* 10000 */1000 ) {
3080 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3087 i = nblock+BZ_N_OVERSHOOT;
3100 budgetInit = nblock * ((wfact-1) / 3);
3103 mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
3107 nblock,
3109 (float)(nblock==0 ? 1 : nblock) );
3114 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3119 for (i = 0; i < s->nblock; i++)
3546 s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
3548 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ]
3553 ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
3560 (UChar*) (&((UChar*)s->arr2)[s->nblock])
3579 for (i = 0; i < s->nblock; i++) {
3582 j = ptr[i]-1; if (j < 0) j += s->nblock;
3680 s->nblock, s->nMTF, s->nInUse );
4020 if (s->nblock > 0) {
4030 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
4035 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
4046 if (s->nblock > 0) {
4484 s->nblock = 0;
4590 s->block[s->nblock] = (UChar)ch; s->nblock++;
4593 s->block[s->nblock] = (UChar)ch; s->nblock++;
4594 s->block[s->nblock] = (UChar)ch; s->nblock++;
4597 s->block[s->nblock] = (UChar)ch; s->nblock++;
4598 s->block[s->nblock] = (UChar)ch; s->nblock++;
4599 s->block[s->nblock] = (UChar)ch; s->nblock++;
4603 s->block[s->nblock] = (UChar)ch; s->nblock++;
4604 s->block[s->nblock] = (UChar)ch; s->nblock++;
4605 s->block[s->nblock] = (UChar)ch; s->nblock++;
4606 s->block[s->nblock] = (UChar)ch; s->nblock++;
4607 s->block[s->nblock] = ((UChar)(s->state_in_len-4));
4608 s->nblock++;
4633 zs->block[zs->nblock] = (UChar)ch; \
4634 zs->nblock++; \
4662 if (s->nblock >= s->nblockMAX) break;
4678 if (s->nblock >= s->nblockMAX) break;
4754 if (s->nblock >= s->nblockMAX) {
