Lines Matching defs:have
100 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
408 have = strm->avail_in; \
419 strm->avail_in = have; \
435 if (have == 0) goto inf_leave; \
436 have--; \
515 would all have to actually be part of the saved state in case NEEDBITS()
561 unsigned have, left; /* available input and output */
584 in = have;
683 if (copy > have) copy = have;
694 have -= copy;
704 if (have == 0) goto inf_leave;
712 } while (len && copy < have);
715 have -= copy;
725 if (have == 0) goto inf_leave;
733 } while (len && copy < have);
736 have -= copy;
823 if (copy > have) copy = have;
827 have -= copy;
853 state->have = 0;
856 while (state->have < state->ncode) {
858 state->lens[order[state->have++]] = (unsigned short)BITS(3);
861 while (state->have < 19)
862 state->lens[order[state->have++]] = 0;
874 state->have = 0;
877 while (state->have < state->nlen + state->ndist) {
886 state->lens[state->have++] = this.val;
892 if (state->have == 0) {
897 len = state->lens[state->have - 1];
915 if (state->have + copy > state->nlen + state->ndist) {
921 state->lens[state->have++] = (unsigned short)len;
951 if (have >= 6 && left >= 258) {
1230 or when out of input. When called, *have is the number of pattern bytes
1231 found in order so far, in 0..3. On return *have is updated to the new
1232 state. If on return *have equals four, then the pattern was found and the
1234 pattern. If *have is less than four, then the pattern has not been found
1236 called again with more data and the *have state. *have is initialized to
1239 local unsigned syncsearch(have, buf, len)
1240 unsigned FAR *have;
1247 got = *have;
1258 *have = got;
1286 state->have = 0;
1287 syncsearch(&(state->have), buf, len);
1291 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1297 if (state->have != 4) return Z_DATA_ERROR;
