Lines Matching full:nblock
612 Int32 nblock;
1490 Int32 nblock;
1544 nblock = s->save_nblock;
1737 nblock = 0;
1762 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1763 s->ll16[nblock] = (UInt16)uc;
1764 nblock++;
1769 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1770 s->tt[nblock] = (UInt32)uc;
1771 nblock++;
1779 if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
1837 s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
1838 s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
1839 nblock++;
1846 /* Now we know what nblock is, we can do a better sanity
1849 if (s->origPtr < 0 || s->origPtr >= nblock)
1857 if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
1858 /* s->cftab[i] can legitimately be == nblock */
1875 for (i = 0; i < nblock; i++) {
1905 for (i = 0; i < nblock; i++) {
1971 s->save_nblock = nblock;
2230 nblock > 0
2231 eclass exists for [0 .. nblock-1]
2232 ((UChar*)eclass) [0 .. nblock-1] holds block
2233 ptr exists for [0 .. nblock-1]
2236 ((UChar*)eclass) [0 .. nblock-1] holds block
2238 fmap [0 .. nblock-1] holds sorted order
2239 bhtab [ 0 .. 2+(nblock/32) ] destroyed
2252 Int32 nblock,
2269 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
2273 for (i = 0; i < nblock; i++) {
2280 nBhtab = 2 + (nblock / 32);
2292 SET_BH(nblock + 2*i);
2293 CLEAR_BH(nblock + 2*i + 1);
2304 for (i = 0; i < nblock; i++) {
2306 k = fmap[i] - H; if (k < 0) k += nblock;
2322 if (l >= nblock) break;
2329 if (r >= nblock) break;
2349 if (H > nblock || nNotDone == 0) break;
2354 eclass8 [0 .. nblock-1], since the
2360 for (i = 0; i < nblock; i++) {
2388 UInt32 nblock,
2445 k = nblock + 8;
2497 if (i1 >= nblock) i1 -= nblock;
2498 if (i2 >= nblock) i2 -= nblock;
2525 Int32 nblock,
2552 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2566 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2580 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2661 Int32 nblock,
2688 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
2770 nblock > N_OVERSHOOT
2771 block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
2772 ((UChar*)block32) [0 .. nblock-1] holds block
2773 ptr exists for [0 .. nblock-1]
2776 ((UChar*)block32) [0 .. nblock-1] holds block
2779 ptr [0 .. nblock-1] holds sorted order
2792 Int32 nblock,
2810 i = nblock-1;
2833 block [nblock+i] = block[i];
2834 quadrant[nblock+i] = 0;
2843 i = nblock-1;
2935 ptr, block, quadrant, nblock,
2961 k = ptr[j]-1; if (k < 0) k += nblock;
2967 k = ptr[j]-1; if (k < 0) k += nblock;
2980 (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
3003 for 0 <= i < nblock and 0 <= j <= nblock
3038 quadrant[a2update + nblock] = qVal;
3047 nblock, numQSorted, nblock - numQSorted );
3057 nblock > 0
3058 arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
3059 ((UChar*)arr2) [0 .. nblock-1] holds block
3060 arr1 exists for [0 .. nblock-1]
3063 ((UChar*)arr2) [0 .. nblock-1] holds block
3066 arr1 [0 .. nblock-1] holds sorted order
3073 Int32 nblock = s->nblock;
3081 if (nblock < /* 10000 */1000 ) {
3082 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3089 i = nblock+BZ_N_OVERSHOOT;
3102 budgetInit = nblock * ((wfact-1) / 3);
3105 mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
3109 nblock,
3111 (float)(nblock==0 ? 1 : nblock) );
3116 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
3121 for (i = 0; i < s->nblock; i++)
3548 s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
3550 ((UChar*)s->arr2) [ 0 .. s->nblock-1 ]
3555 ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
3562 (UChar*) (&((UChar*)s->arr2)[s->nblock])
3581 for (i = 0; i < s->nblock; i++) {
3584 j = ptr[i]-1; if (j < 0) j += s->nblock;
3682 s->nblock, s->nMTF, s->nInUse );
4022 if (s->nblock > 0) {
4032 s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
4037 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
4048 if (s->nblock > 0) {
4486 s->nblock = 0;
4592 s->block[s->nblock] = (UChar)ch; s->nblock++;
4595 s->block[s->nblock] = (UChar)ch; s->nblock++;
4596 s->block[s->nblock] = (UChar)ch; s->nblock++;
4599 s->block[s->nblock] = (UChar)ch; s->nblock++;
4600 s->block[s->nblock] = (UChar)ch; s->nblock++;
4601 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)ch; s->nblock++;
4608 s->block[s->nblock] = (UChar)ch; s->nblock++;
4609 s->block[s->nblock] = ((UChar)(s->state_in_len-4));
4610 s->nblock++;
4635 zs->block[zs->nblock] = (UChar)ch; \
4636 zs->nblock++; \
4664 if (s->nblock >= s->nblockMAX) break;
4680 if (s->nblock >= s->nblockMAX) break;
4757 if (s->nblock >= s->nblockMAX) {
