Lines Matching defs:have

107 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
415 have = strm->avail_in; \
426 strm->avail_in = have; \
442 if (have == 0) goto inf_leave; \
443 have--; \
522 would all have to actually be part of the saved state in case NEEDBITS()
568 unsigned have, left; /* available input and output */
591 in = have;
694 if (copy > have) copy = have;
705 have -= copy;
716 if (have == 0) goto inf_leave;
724 } while (len && copy < have);
727 have -= copy;
738 if (have == 0) goto inf_leave;
746 } while (len && copy < have);
749 have -= copy;
841 if (copy > have) copy = have;
845 have -= copy;
871 state->have = 0;
875 while (state->have < state->ncode) {
877 state->lens[order[state->have++]] = (unsigned short)BITS(3);
880 while (state->have < 19)
881 state->lens[order[state->have++]] = 0;
893 state->have = 0;
897 while (state->have < state->nlen + state->ndist) {
906 state->lens[state->have++] = this.val;
912 if (state->have == 0) {
917 len = state->lens[state->have - 1];
935 if (state->have + copy > state->nlen + state->ndist) {
941 state->lens[state->have++] = (unsigned short)len;
972 if (have >= 6 && left >= 258) {
1257 or when out of input. When called, *have is the number of pattern bytes
1258 found in order so far, in 0..3. On return *have is updated to the new
1259 state. If on return *have equals four, then the pattern was found and the
1261 pattern. If *have is less than four, then the pattern has not been found
1263 called again with more data and the *have state. *have is initialized to
1266 local unsigned syncsearch(have, buf, len)
1267 unsigned FAR *have;
1274 got = *have;
1285 *have = got;
1313 state->have = 0;
1314 (void) syncsearch(&(state->have), buf, len);
1318 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1324 if (state->have != 4) return Z_DATA_ERROR;