Lines Matching refs:have
24 local int gz_load(state, buf, len, have)
28 unsigned *have;
33 *have = 0;
35 get = len - *have;
38 ret = read(state->fd, buf + *have, get);
41 *have += (unsigned)ret;
42 } while (*have < len);
85 /* Look for gzip header, set up for inflate or copy. state->x.have must be 0.
155 state->x.have = 0;
165 state->x.have = strm->avail_in;
174 On return, state->x.have and state->x.next point to the just decompressed
176 the next gzip stream or raw data, once state->x.have is depleted. Returns 0
215 state->x.have = had - strm->avail_out;
216 state->x.next = strm->next_out - state->x.have;
226 /* Fetch data and put it in the output buffer. Assumes state->x.have is 0.
246 if (gz_load(state, state->out, state->size << 1, &(state->x.have))
257 } while (state->x.have == 0 && (!state->eof || strm->avail_in));
271 if (state->x.have) {
272 n = GT_OFF(state->x.have) || (z_off64_t)state->x.have > len ?
273 (unsigned)len : state->x.have;
274 state->x.have -= n;
325 if (state->x.have) {
326 if (state->x.have < n)
327 n = state->x.have;
330 state->x.have -= n;
362 n = state->x.have;
363 state->x.have = 0;
468 if (state->x.have) {
469 state->x.have--;
514 if (state->x.have == 0) {
515 state->x.have = 1;
523 /* if no room, give up (must have already done a gzungetc()) */
524 if (state->x.have == (state->size << 1)) {
531 unsigned char *src = state->out + state->x.have;
537 state->x.have++;
580 if (state->x.have == 0 && gz_fetch(state) == -1)
582 if (state->x.have == 0) { /* end of file */
584 break; /* return what we have */
588 n = state->x.have > left ? left : state->x.have;
595 state->x.have -= n;
622 if (state->mode == GZ_READ && state->how == LOOK && state->x.have == 0)