Lines Matching defs:have
151 #define NEXT() (have ? 0 : (have = in(indp, &next)), \
152 last = have ? (have--, (int)(*next++)) : -1)
156 have offset the index, but it's faster to waste the memory */
171 if (chunk > have) { \
172 chunk -= have; \
173 have = 0; \
177 if (chunk > have) { \
178 chunk = have = 0; \
182 have -= chunk; \
188 header (two bytes) has already been read and verified. There are have bytes
196 local int lunpipe(unsigned have, unsigned char *next, struct ind *indp,
362 /* Decompress a gzip file from infile to outfile. strm is assumed to have been
377 unsigned have, flags, len;
388 have = 0; /* no input data read in yet */
406 ret = lunpipe(have, next, indp, outfile, strm);
435 while (len > have) {
436 len -= have;
437 have = 0;
442 have -= len;
465 strm->avail_in = have;
469 have = strm->avail_in;