Lines Matching defs:avail
170 The thread doesn't need to fill all avail free blocks,
498 /* heads[1] contains the number of avail bytes:
499 if (avail < mf->numHashBytes) :
502 HASH_THREAD and BT_TREAD must move position for heads[1] (avail) bytes.
604 UInt32 avail;
609 avail = h[1];
611 p->hashNumAvail = avail;
616 /* we must prevent UInt32 overflow for avail total value,
617 if avail was increased with new hash block */
618 UInt32 availSum = numProcessed + avail;
624 if (avail >= p->numHashBytes)
629 /* (avail < p->numHashBytes)
631 And (avail) - is a number of remaining bytes,
632 we fill (d) for (avail) bytes for LZ_THREAD (receiver).
638 d[0] = curPos + avail;
640 for (; avail != 0; avail--)
972 /* we don't check (lzPos) over exact avail bytes in (btBuf).
1082 UInt32 avail = p->btNumAvailBytes - 1;
1086 p->btNumAvailBytes = avail;
1094 else if (avail < (BT_HASH_BYTES_MAX - 1) - 1)
1274 const UInt32 avail = p->btNumAvailBytes - 1;
1275 p->btNumAvailBytes = avail;
1280 if (avail >= (BT_HASH_BYTES_MAX - 1) - 1)