Lines Matching full:nblock
619 Int32 nblock;
1499 Int32 nblock;
1553 nblock = s->save_nblock;
1746 nblock = 0;
1771 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1772 s->ll16[nblock] = (UInt16)uc;
1773 nblock++;
1778 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1779 s->tt[nblock
1780 nblock++;
1788 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1846 s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
1847 s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
1848 nblock++;
1855 /* Now we know what nblock is, we can do a better sanity
1858 if (s->origPtr < 0 || s->origPtr >= nblock)
1866 if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
1867 /* s->cftab[i] can legitimately be == nblock */
1884 for (i = 0; i < nblock; i++) {
1914 for (i = 0; i < nblock; i++) {
1980 s->save_nblock = nblock;
2239 nblock > 0
2240 eclass exists for [0 .. nblock-1]
2241 ((UChar*)eclass) [0 .. nblock-1] holds block
2242 ptr exists for [0 .. nblock-1]
2245 ((UChar*)eclass) [0 .. nblock-1] holds block
2247 fmap [0 .. nblock-1] holds sorted order
2248 bhtab [ 0 .. 2+(nblock/32) ] destroyed
2261 Int32 nblock,
2278 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
2282 for (i = 0; i < nblock; i++) {
2289 nBhtab = 2 + (nblock / 32);
2301 SET_BH(nblock + 2*i);
2302 CLEAR_BH(nblock + 2*i + 1);
2313 for (i = 0; i < nblock; i++) {
2315 k = fmap[i] - H; if (k < 0) k += nblock;
2331 if (l >= nblock) break;
2338 if (r >= nblock) break;
2358 if (H > nblock || nNotDone == 0) break;
2363 eclass8 [0 .. nblock-1], since the
2369 for (i = 0; i < nblock; i++) {
2397 UInt32 nblock,
2454 k = nblock + 8;
2506 if (i1 >= nblock) i1 -= nblock;
2507 if (i2 >= nblock) i2 -= nblock;
2534 Int32 nblock,
2561 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2575 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2589 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2670 Int32 nblock,
2697 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
2779 nblock > N_OVERSHOOT
2780 block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
2781 ((UChar*)block32) [0 .. nblock-1] holds block
2782 ptr exists for [0 .. nblock-1]
2785 ((UChar*)block32) [0 .. nblock-1] holds block
2788 ptr [0 .. nblock-1] holds sorted order
2801 Int32 nblock,
2819 i = nblock-1;
2842 block [nblock+i] = block[i];
2843 quadrant[nblock+i] = 0;
2852 i = nblock-1;
2944 ptr, block, quadrant, nblock,
2970 k = ptr[j]-1; if (k < 0) k += nblock;
2976 k = ptr[j]-1; if (k < 0) k += nblock;
2989 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
3012 for 0 <= i < nblock and 0 <= j <= nblock
3047 quadrant[a2update + nblock] = qVal;
3056 nblock, numQSorted, nblock - numQSorted );
3066 nblock > 0
3067 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
3068 ((UChar*)arr2) [0 .. nblock-1] holds block
3069 arr1 exists for [0 .. nblock-1]
3072 ((UChar*)arr2) [0 .. nblock-1] holds block
3075 arr1 [0 .. nblock-1] holds sorted order
3082 Int32 nblock = s->nblock;
3090 if (nblock < /* 10000 */1000 ) {
3091 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3098 i = nblock+BZ_N_OVERSHOOT;
3111 budgetInit = nblock * ((wfact-1) / 3);
3114 mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
3118 nblock,
3120 (float)(nblock==0 ? 1 : nblock) );
3125 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3130 for (i = 0; i < s->nblock; i++)
3557 s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
3559 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ]
3564 ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
3571 (UChar*) (&((UChar*)s->arr2)[s->nblock])
3590 for (i = 0; i < s->nblock; i++) {
3593 j = ptr[i]-1; if (j < 0) j += s->nblock;
3691 s->nblock, s->nMTF, s->nInUse );
4031 if (s->nblock > 0) {
4041 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
4046 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
4057 if (s->nblock > 0) {
4495 s->nblock = 0;
4601 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++;
4608 s->block[s->nblock] = (UChar)ch; s->nblock++;
4609 s->block[s->nblock] = (UChar)ch; s->nblock++;
4610 s->block[s->nblock] = (UChar)ch; s->nblock++;
4614 s->block[s->nblock] = (UChar)ch; s->nblock++;
4615 s->block[s->nblock] = (UChar)ch; s->nblock++;
4616 s->block[s->nblock] = (UChar)ch; s->nblock++;
4617 s->block[s->nblock] = (UChar)ch; s->nblock++;
4618 s->block[s->nblock] = ((UChar)(s->state_in_len-4));
4619 s->nblock++;
4644 zs->block[zs->nblock] = (UChar)ch; \
4645 zs->nblock++; \
4673 if (s->nblock >= s->nblockMAX) break;
4689 if (s->nblock >= s->nblockMAX) break;
4765 if (s->nblock >= s->nblockMAX) {
