Lines Matching full:nblock
1040 Int32 nblock;
1447 Int32 nblock;
1501 nblock = s->save_nblock;
1694 nblock = 0;
1719 if (nblock >= nblockMAX) { retVal = (-4); goto save_state_and_return; };;
1720 s->ll16[nblock] = (UInt16)uc;
1721 nblock++;
1726 if (nblock >= nblockMAX) { retVal = (-4); goto save_state_and_return; };;
1727 s->tt[nblock] = (UInt32)uc;
1728 nblock++;
1736 if (nblock >= nblockMAX) { retVal = (-4); goto save_state_and_return; };;
1794 s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
1795 s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
1796 nblock++;
1806 if (s->origPtr < 0 || s->origPtr >= nblock)
1814 if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
1832 for (i = 0; i < nblock; i++) {
1862 for (i = 0; i < nblock; i++) {
1928 s->save_nblock = nblock;
2063 Int32 nblock,
2080 for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
2084 for (i = 0; i < nblock; i++) {
2091 nBhtab = 2 + (nblock / 32);
2096 bhtab[(nblock + 2*i) >> 5] |= (1 << ((nblock + 2*i) & 31));
2097 bhtab[(nblock + 2*i + 1) >> 5] &= ~(1 << ((nblock + 2*i + 1) & 31));
2108 for (i = 0; i < nblock; i++) {
2110 k = fmap[i] - H; if (k < 0) k += nblock;
2126 if (l >= nblock) break;
2133 if (r >= nblock) break;
2153 if (H > nblock || nNotDone == 0) break;
2164 for (i = 0; i < nblock; i++) {
2178 UInt32 nblock,
2235 k = nblock + 8;
2287 if (i1 >= nblock) i1 -= nblock;
2288 if (i2 >= nblock) i2 -= nblock;
2307 Int32 nblock,
2334 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2348 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2362 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
2393 Int32 nblock,
2420 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
2493 Int32 nblock,
2511 i = nblock-1;
2534 block [nblock+i] = block[i];
2535 quadrant[nblock+i] = 0;
2544 i = nblock-1;
2628 ptr, block, quadrant, nblock,
2647 k = ptr[j]-1; if (k < 0) k += nblock;
2653 k = ptr[j]-1; if (k < 0) k += nblock;
2660 { if (!((copyStart[ss]-1 == copyEnd[ss]) || (copyStart[ss] == 0 && copyEnd[ss] == nblock-1))) bz_internal_error ( 1007 ); }
2678 quadrant[a2update + nblock] = qVal;
2686 vex_printf(" %d pointers, %d sorted, %d scanned\n",nblock,numQSorted,nblock - numQSorted);
2695 Int32 nblock = s->nblock;
2703 if (nblock < 1000 ) {
2704 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
2711 i = nblock+(2 + 12 + 18 + 2);
2717 budgetInit = nblock * ((wfact-1) / 3);
2720 mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
2722 vex_printf(" %d work, %d block, ratio %5.2f\n",budgetInit - budget,nblock,(float)(budgetInit - budget) / (float)(nblock==0 ? 1 : nblock));
2731 fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
2736 for (i = 0; i < s->nblock; i++)
2954 for (i = 0; i < s->nblock; i++) {
2957 j = ptr[i]-1; if (j < 0) j += s->nblock;
3042 vex_printf(" %d in block, %d after MTF & 1-2 coding, " "%d+2 syms in use\n",s->nblock,s->nMTF,s->nInUse);
3384 if (s->nblock > 0) {
3392 vex_printf(" block %d: crc = 0x%08x, " "combined CRC = 0x%08x, size = %d\n",s->blockNo,s->blockCRC,s->combinedCRC,s->nblock);
3399 s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
3410 if (s->nblock > 0) {
3608 s->nblock = 0;
3714 s->block[s->nblock] = (UChar)ch; s->nblock++;
3717 s->block[s->nblock] = (UChar)ch; s->nblock++;
3718 s->block[s->nblock] = (UChar)ch; s->nblock++;
3721 s->block[s->nblock] = (UChar)ch; s->nblock++;
3722 s->block[s->nblock] = (UChar)ch; s->nblock++;
3723 s->block[s->nblock] = (UChar)ch; s->nblock++;
3727 s->block[s->nblock] = (UChar)ch; s->nblock++;
3728 s->block[s->nblock] = (UChar)ch; s->nblock++;
3729 s->block[s->nblock] = (UChar)ch; s->nblock++;
3730 s->block[s->nblock] = (UChar)ch; s->nblock++;
3731 s->block[s->nblock] = ((UChar)(s->state_in_len-4));
3732 s->nblock++;
3756 if (s->nblock >= s->nblockMAX) break;
3760 { UInt32 zchh = (UInt32)((UInt32)(*((UChar*)(s->strm->next_in)))); if (zchh != s->state_in_ch && s->state_in_len == 1) { UChar ch = (UChar)(s->state_in_ch); { s->blockCRC = (s->blockCRC << 8) ^ BZ2_crc32Table[(s->blockCRC >> 24) ^ ((UChar)ch)]; }; s->inUse[s->state_in_ch] = ((Bool)1); s->block[s->nblock] = (UChar)ch; s->nblock++; s->state_in_ch = zchh; } else if (zchh != s->state_in_ch || s->state_in_len == 255) { if (s->state_in_ch < 256) add_pair_to_block ( s ); s->state_in_ch = zchh; s->state_in_len = 1; } else { s->state_in_len++; } };
3772 if (s->nblock >= s->nblockMAX) break;
3778 { UInt32 zchh = (UInt32)((UInt32)(*((UChar*)(s->strm->next_in)))); if (zchh != s->state_in_ch && s->state_in_len == 1) { UChar ch = (UChar)(s->state_in_ch); { s->blockCRC = (s->blockCRC << 8) ^ BZ2_crc32Table[(s->blockCRC >> 24) ^ ((UChar)ch)]; }; s->inUse[s->state_in_ch] = ((Bool)1); s->block[s->nblock] = (UChar)ch; s->nblock++; s->state_in_ch = zchh; } else if (zchh != s->state_in_ch || s->state_in_len == 255) { if (s->state_in_ch < 256) add_pair_to_block ( s ); s->state_in_ch = zchh; s->state_in_len = 1; } else { s->state_in_len++; } };
3848 if (s->nblock >= s->nblockMAX) {
