Lines Matching defs:have

101 local unsigned syncsearch OF((unsigned FAR *have, const unsigned char FAR *buf,
464 have = strm->avail_in; \
475 strm->avail_in = have; \
491 if (have == 0) goto inf_leave; \
492 have--; \
566 would all have to actually be part of the saved state in case NEEDBITS()
612 unsigned have, left; /* available input and output */
635 in = have;
736 if (copy > have) copy = have;
747 have -= copy;
757 if (have == 0) goto inf_leave;
765 } while (len && copy < have);
768 have -= copy;
778 if (have == 0) goto inf_leave;
786 } while (len && copy < have);
789 have -= copy;
883 if (copy > have) copy = have;
887 have -= copy;
913 state->have = 0;
916 while (state->have < state->ncode) {
918 state->lens[order[state->have++]] = (unsigned short)BITS(3);
921 while (state->have < 19)
922 state->lens[order[state->have++]] = 0;
934 state->have = 0;
937 while (state->have < state->nlen + state->ndist) {
945 state->lens[state->have++] = here.val;
951 if (state->have == 0) {
956 len = state->lens[state->have - 1];
974 if (state->have + copy > state->nlen + state->ndist) {
980 state->lens[state->have++] = (unsigned short)len;
987 /* check for end-of-block code (better have one) */
1022 if (have >= 6 && left >= 258) {
1345 or when out of input. When called, *have is the number of pattern bytes
1346 found in order so far, in 0..3. On return *have is updated to the new
1347 state. If on return *have equals four, then the pattern was found and the
1349 pattern. If *have is less than four, then the pattern has not been found
1351 called again with more data and the *have state. *have is initialized to
1354 local unsigned syncsearch(have, buf, len)
1355 unsigned FAR *have;
1362 got = *have;
1373 *have = got;
1401 state->have = 0;
1402 syncsearch(&(state->have), buf, len);
1406 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1412 if (state->have != 4) return Z_DATA_ERROR;