Lines Matching defs:have

100 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
463 have = strm->avail_in; \
474 strm->avail_in = have; \
490 if (have == 0) goto inf_leave; \
491 have--; \
570 would all have to actually be part of the saved state in case NEEDBITS()
616 unsigned have, left; /* available input and output */
639 in = have;
740 if (copy > have) copy = have;
751 have -= copy;
761 if (have == 0) goto inf_leave;
769 } while (len && copy < have);
772 have -= copy;
782 if (have == 0) goto inf_leave;
790 } while (len && copy < have);
793 have -= copy;
887 if (copy > have) copy = have;
891 have -= copy;
917 state->have = 0;
920 while (state->have < state->ncode) {
922 state->lens[order[state->have++]] = (unsigned short)BITS(3);
925 while (state->have < 19)
926 state->lens[order[state->have++]] = 0;
938 state->have = 0;
941 while (state->have < state->nlen + state->ndist) {
949 state->lens[state->have++] = here.val;
955 if (state->have == 0) {
960 len = state->lens[state->have - 1];
978 if (state->have + copy > state->nlen + state->ndist) {
984 state->lens[state->have++] = (unsigned short)len;
991 /* check for end-of-block code (better have one) */
1026 if (have >= 6 && left >= 258) {
1334 or when out of input. When called, *have is the number of pattern bytes
1335 found in order so far, in 0..3. On return *have is updated to the new
1336 state. If on return *have equals four, then the pattern was found and the
1338 pattern. If *have is less than four, then the pattern has not been found
1340 called again with more data and the *have state. *have is initialized to
1343 local unsigned syncsearch(have, buf, len)
1344 unsigned FAR *have;
1351 got = *have;
1362 *have = got;
1390 state->have = 0;
1391 syncsearch(&(state->have), buf, len);
1395 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1401 if (state->have != 4) return Z_DATA_ERROR;