Lines Matching defs:have
154 #define NEXT() (have ? 0 : (have = in(indp, &next)), \
155 last = have ? (have--, (int)(*next++)) : -1)
159 have offset the index, but it's faster to waste the memory */
174 if (chunk > have) { \
175 chunk -= have; \
176 have = 0; \
180 if (chunk > have) { \
181 chunk = have = 0; \
185 have -= chunk; \
191 header (two bytes) has already been read and verified. There are have bytes
199 local int lunpipe(unsigned have, unsigned char *next, struct ind *indp,
370 /* Decompress a gzip file from infile to outfile. strm is assumed to have been
385 unsigned have, flags, len;
396 have = 0; /* no input data read in yet */
414 ret = lunpipe(have, next, indp, outfile, strm);
443 while (len > have) {
444 len -= have;
445 have = 0;
450 have -= len;
473 strm->avail_in = have;
477 have = strm->avail_in;
