Lines Matching full:nblock
650 Int32 nblock;
1528 Int32 nblock;
1582 nblock = s->save_nblock;
1776 nblock = 0;
1801 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1802 s->ll16[nblock] = (UInt16)uc;
1803 nblock++;
1808 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1809 s->tt[nblock] = (UInt32)uc;
1810 nblock++;
1818 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1876 s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
1877 s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
1878 nblock++;
1885 /* Now we know what nblock is, we can do a better sanity
1888 if (s->origPtr < 0 || s->origPtr >= nblock)
1896 if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
1897 /* s->cftab[i] can legitimately be == nblock */
1914 for (i = 0; i < nblock; i++) {
1944 for (i = 0; i < nblock; i++) {
2010 s->save_nblock = nblock;
2268 nblock > 0
2269 eclass exists for [0 .. nblock-1]
2270 ((UChar*)eclass) [0 .. nblock-1] holds block
2271 ptr exists for [0 .. nblock-1]
2274 ((UChar*)eclass) [0 .. nblock-1] holds block
2276 fmap [0 .. nblock-1] holds sorted order
2277 bhtab [ 0 .. 2+(nblock/32) ] destroyed
2290 Int32 nblock,
2307 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
2311 for (i = 0; i < nblock; i++) {
2318 nBhtab = 2 + (nblock / 32);
2330 SET_BH(nblock + 2*i);
2331 CLEAR_BH(nblock + 2*i + 1);
2342 for (i = 0; i < nblock; i++) {
2344 k = fmap[i] - H; if (k < 0) k += nblock;
2360 if (l >= nblock) break;
2367 if (r >= nblock) break;
2387 if (H > nblock || nNotDone == 0) break;
2392 eclass8 [0 .. nblock-1], since the
2398 for (i = 0; i < nblock; i++) {
2425 UInt32 nblock,
2482 k = nblock + 8;
2534 if (i1 >= nblock) i1 -= nblock;
2535 if (i2 >= nblock) i2 -= nblock;
2562 Int32 nblock,
2589 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2603 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2617 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2697 Int32 nblock,
2724 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
2806 nblock > N_OVERSHOOT
2807 block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
2808 ((UChar*)block32) [0 .. nblock-1] holds block
2809 ptr exists for [0 .. nblock-1]
2812 ((UChar*)block32) [0 .. nblock-1] holds block
2815 ptr [0 .. nblock-1] holds sorted order
2828 Int32 nblock,
2846 i = nblock-1;
2869 block [nblock+i] = block[i];
2870 quadrant[nblock+i] = 0;
2879 i = nblock-1;
2971 ptr, block, quadrant, nblock,
2997 k = ptr[j]-1; if (k < 0) k += nblock;
3004 k = ptr[j]-1; if (k < 0) k += nblock;
3017 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
3040 for 0 <= i < nblock and 0 <= j <= nblock
3075 quadrant[a2update + nblock] = qVal;
3084 nblock, numQSorted, nblock - numQSorted );
3094 nblock > 0
3095 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
3096 ((UChar*)arr2) [0 .. nblock-1] holds block
3097 arr1 exists for [0 .. nblock-1]
3100 ((UChar*)arr2) [0 .. nblock-1] holds block
3103 arr1 [0 .. nblock-1] holds sorted order
3111 Int32 nblock = s->nblock;
3119 if (nblock < /* 10000 */1000 ) {
3120 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3127 i = nblock+BZ_N_OVERSHOOT;
3140 budgetInit = nblock * ((wfact-1) / 3);
3143 mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
3147 nblock,
3149 (float)(nblock==0 ? 1 : nblock) );
3154 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3159 for (i = 0; i < s->nblock; i++)
3585 s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
3587 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ]
3592 ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
3599 (UChar*) (&((UChar*)s->arr2)[s->nblock])
3618 for (i = 0; i < s->nblock; i++) {
3621 j = ptr[i]-1; if (j < 0) j += s->nblock;
3719 s->nblock, s->nMTF, s->nInUse );
4060 if (s->nblock > 0) {
4070 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
4075 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
4086 if (s->nblock > 0) {
4524 s->nblock = 0;
4630 s->block[s->nblock] = (UChar)ch; s->nblock++;
4633 s->block[s->nblock] = (UChar)ch; s->nblock++;
4634 s->block[s->nblock] = (UChar)ch; s->nblock++;
4637 s->block[s->nblock] = (UChar)ch; s->nblock++;
4638 s->block[s->nblock] = (UChar)ch; s->nblock++;
4639 s->block[s->nblock] = (UChar)ch; s->nblock++;
4643 s->block[s->nblock] = (UChar)ch; s->nblock++;
4644 s->block[s->nblock] = (UChar)ch; s->nblock++;
4645 s->block[s->nblock] = (UChar)ch; s->nblock++;
4646 s->block[s->nblock] = (UChar)ch; s->nblock++;
4647 s->block[s->nblock] = ((UChar)(s->state_in_len-4));
4648 s->nblock++;
4673 zs->block[zs->nblock] = (UChar)ch; \
4674 zs->nblock++; \
4702 if (s->nblock >= s->nblockMAX) break;
4718 if (s->nblock >= s->nblockMAX) break;
4794 if (s->nblock >= s->nblockMAX) {
