nblock
dp->tblks += nblock(pentry->cinfo.size);
if (nblock && (blocklim%nblock) != 0)
K((blocklim - 1)), K(nblock));
(nblock * TBLOCK));
nblock = SYS_BLOCK / TBLOCK;
nblock = 1;
if (recno + blocks <= nblock) {
if (recno > nblock)
recno = nblock;
seekval = (off_t)blocks - (nblock - recno);
recno = nblock; /* so readtape() reads next time through */
if (read(mt, tbuf, TBLOCK*nblock) < 0) {
if (recno >= nblock || first) {
j = nblock;
j = nblock;
if (vflag && i != nblock && i != 1) {
nblock = i;
if (recno >= nblock) {
i = write(mt, (char *)tbuf, TBLOCK*nblock);
if (i != TBLOCK*nblock)
while (recno == 0 && n >= nblock) {
i = (int)write(mt, buffer, TBLOCK*nblock);
if (i != TBLOCK*nblock)
n -= nblock;
buffer += (nblock * TBLOCK);
if (recno >= nblock) {
i = (int)write(mt, (char *)tbuf, TBLOCK*nblock);
if (i != TBLOCK*nblock)
return (nblock - recno);
nblock);
if (recno > nblock)
recno = nblock;
" bytes\n", (blkcnt_t)(NotTape ? recno : nblock),
(blkcnt_t)(NotTape ? recno : nblock) * TBLOCK);
(size_t)(NotTape ? recno : nblock) * TBLOCK) < 0) {
nblock = bcheck(bp);
nblock, blocklim);
while ((sz = read(mt, tbuf, TBLOCK*nblock)) > 0) {
static int nblock = NBLOCK;
nblock = 1;
nblock = bcheck(*argv++);
calloc(sizeof (union hblock) * nblock, sizeof (char))) ==
quadrant[a2update + nblock] = qVal;
nblock, numQSorted, nblock - numQSorted );
Int32 nblock = s->nblock;
if (nblock < 10000) {
fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
i = nblock+BZ_N_OVERSHOOT;
budgetInit = nblock * ((wfact-1) / 3);
mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
nblock,
(float)(nblock==0 ? 1 : nblock) );
fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
for (i = 0; i < s->nblock; i++)
Int32 nblock,
for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
for (i = 0; i < nblock; i++) {
nBhtab = 2 + (nblock / 32);
SET_BH(nblock + 2*i);
CLEAR_BH(nblock + 2*i + 1);
for (i = 0; i < nblock; i++) {
k = fmap[i] - H; if (k < 0) k += nblock;
if (l >= nblock) break;
if (r >= nblock) break;
if (H > nblock || nNotDone == 0) break;
for (i = 0; i < nblock; i++) {
UInt32 nblock,
k = nblock + 8;
if (i1 >= nblock) i1 -= nblock;
if (i2 >= nblock) i2 -= nblock;
Int32 nblock,
ptr[j-h]+d, v+d, block, quadrant, nblock, budget
ptr[j-h]+d, v+d, block, quadrant, nblock, budget
ptr[j-h]+d, v+d, block, quadrant, nblock, budget
Int32 nblock,
mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
Int32 nblock,
i = nblock-1;
block [nblock+i] = block[i];
quadrant[nblock+i] = 0;
i = nblock-1;
ptr, block, quadrant, nblock,
k = ptr[j]-1; if (k < 0) k += nblock;
k = ptr[j]-1; if (k < 0) k += nblock;
(copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
s->nblock = 0;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = (UChar)ch; s->nblock++;
s->block[s->nblock] = ((UChar)(s->state_in_len-4));
s->nblock++;
zs->block[zs->nblock] = (UChar)ch; \
zs->nblock++; \
if (s->nblock >= s->nblockMAX) break;
if (s->nblock >= s->nblockMAX) break;
if (s->nblock >= s->nblockMAX) {
Int32 nblock;
for (i = 0; i < s->nblock; i++) {
j = ptr[i]-1; if (j < 0) j += s->nblock;
s->nblock, s->nMTF, s->nInUse );
if (s->nblock > 0) {
s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
if (s->nblock > 0) {
Int32 nblock;
nblock = s->save_nblock;
nblock = 0;
if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
s->ll16[nblock] = (UInt16)uc;
nblock++;
if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
s->tt[nblock] = (UInt32)uc;
nblock++;
if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
nblock++;
if (s->origPtr < 0 || s->origPtr >= nblock)
if (s->unzftab[i] < 0 || s->unzftab[i] > nblock)
if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
for (i = 0; i < nblock; i++) {
for (i = 0; i < nblock; i++) {
s->save_nblock = nblock;
int nblock;
nblock = howmany(len, HASHSIZE);
rmp->rm_mag.rm_oblocks += nblock;
rmp->rm_mag.rm_oblocks = nblock;
nblock--;