Home | History | Annotate | Download | only in examples

Lines Matching refs:have

155 #define NEXT() (have ? 0 : (have = in(indp, &next)), \
156 last = have ? (have--, (int)(*next++)) : -1)
160 have offset the index, but it's faster to waste the memory */
175 if (chunk > have) { \
176 chunk -= have; \
177 have = 0; \
181 if (chunk > have) { \
182 chunk = have = 0; \
186 have -= chunk; \
192 header (two bytes) has already been read and verified. There are have bytes
200 local int lunpipe(unsigned have, z_const unsigned char *next, struct ind *indp,
371 /* Decompress a gzip file from infile to outfile. strm is assumed to have been
386 unsigned have, flags, len;
397 have = 0; /* no input data read in yet */
415 ret = lunpipe(have, next, indp, outfile, strm);
444 while (len > have) {
445 len -= have;
446 have = 0;
451 have -= len;
474 strm->avail_in = have;
478 have = strm->avail_in;