Lines Matching defs:have
100 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
443 have = strm->avail_in; \
454 strm->avail_in = have; \
470 if (have == 0) goto inf_leave; \
471 have--; \
550 would all have to actually be part of the saved state in case NEEDBITS()
596 unsigned have, left; /* available input and output */
619 in = have;
720 if (copy > have) copy = have;
731 have -= copy;
741 if (have == 0) goto inf_leave;
749 } while (len && copy < have);
752 have -= copy;
762 if (have == 0) goto inf_leave;
770 } while (len && copy < have);
773 have -= copy;
867 if (copy > have) copy = have;
871 have -= copy;
897 state->have = 0;
900 while (state->have < state->ncode) {
902 state->lens[order[state->have++]] = (unsigned short)BITS(3);
905 while (state->have < 19)
906 state->lens[order[state->have++]] = 0;
918 state->have = 0;
921 while (state->have < state->nlen + state->ndist) {
930 state->lens[state->have++] = here.val;
936 if (state->have == 0) {
941 len = state->lens[state->have - 1];
959 if (state->have + copy > state->nlen + state->ndist) {
965 state->lens[state->have++] = (unsigned short)len;
972 /* check for end-of-block code (better have one) */
1007 if (have >= 6 && left >= 258) {
1313 or when out of input. When called, *have is the number of pattern bytes
1314 found in order so far, in 0..3. On return *have is updated to the new
1315 state. If on return *have equals four, then the pattern was found and the
1317 pattern. If *have is less than four, then the pattern has not been found
1319 called again with more data and the *have state. *have is initialized to
1322 local unsigned syncsearch(have, buf, len)
1323 unsigned FAR *have;
1330 got = *have;
1341 *have = got;
1369 state->have = 0;
1370 syncsearch(&(state->have), buf, len);
1374 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1380 if (state->have != 4) return Z_DATA_ERROR;