Lines Matching defs:have

127 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
437 have = strm->avail_in; \
448 strm->avail_in = have; \
464 if (have == 0) goto inf_leave; \
465 have--; \
544 would all have to actually be part of the saved state in case NEEDBITS()
590 unsigned have, left; /* available input and output */
613 in = have;
712 if (copy > have) copy = have;
723 have -= copy;
733 if (have == 0) goto inf_leave;
741 } while (len && copy < have);
744 have -= copy;
754 if (have == 0) goto inf_leave;
762 } while (len && copy < have);
765 have -= copy;
852 if (copy > have) copy = have;
856 have -= copy;
882 state->have = 0;
885 while (state->have < state->ncode) {
887 state->lens[order[state->have++]] = (unsigned short)BITS(3);
890 while (state->have < 19)
891 state->lens[order[state->have++]] = 0;
903 state->have = 0;
906 while (state->have < state->nlen + state->ndist) {
915 state->lens[state->have++] = this.val;
921 if (state->have == 0) {
926 len = state->lens[state->have - 1];
944 if (state->have + copy > state->nlen + state->ndist) {
950 state->lens[state->have++] = (unsigned short)len;
980 if (have >= 6 && left >= 258) {
1259 or when out of input. When called, *have is the number of pattern bytes
1260 found in order so far, in 0..3. On return *have is updated to the new
1261 state. If on return *have equals four, then the pattern was found and the
1263 pattern. If *have is less than four, then the pattern has not been found
1265 called again with more data and the *have state. *have is initialized to
1268 local unsigned syncsearch(have, buf, len)
1269 unsigned FAR *have;
1276 got = *have;
1287 *have = got;
1315 state->have = 0;
1316 syncsearch(&(state->have), buf, len);
1320 len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
1326 if (state->have != 4) return Z_DATA_ERROR;