Lines Matching +defs:next +defs:sym
38 * - Use local copies of stream next and avail values, as well as local bit
123 state->lencode = state->distcode = state->next = state->codes;
215 unsigned sym, bits;
216 static code *next;
219 sym = 0;
220 while (sym < 144) state->lens[sym++] = 8;
221 while (sym < 256) state->lens[sym++] = 9;
222 while (sym < 280) state->lens[sym++] = 7;
223 while (sym < 288) state->lens[sym++] = 8;
224 next = fixed;
225 lenfix = next;
227 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
230 sym = 0;
231 while (sym < 32) state->lens[sym++] = 5;
232 distfix = next;
234 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
407 next = strm->next_in; \
418 strm->next_in = next; \
437 hold += (unsigned long)(*next++) << bits; \
490 next state. The NEEDBITS() macro is usually the way the state evaluates
505 and a NEEDBITS(8), then BITS(8) would return the next byte in the stream.
509 PULLBYTE() directly in order to pull just enough bytes to decode the next
527 As shown above, if the next state is also the next case, then the break
541 output to the window for the next call of inflate().
559 unsigned char FAR *next; /* next input */
560 unsigned char FAR *put; /* next output */
688 zmemcpy(state->head->extra + len, next,
693 state->check = crc32(state->check, next, copy);
695 next += copy;
707 len = (unsigned)(next[copy++]);
714 state->check = crc32(state->check, next, copy);
716 next += copy;
728 len = (unsigned)(next[copy++]);
735 state->check = crc32(state->check, next, copy);
737 next += copy;
826 zmemcpy(put, next, copy);
828 next += copy;
863 state->next = state->codes;
864 state->lencode = (code const FAR *)(state->next);
866 ret = inflate_table(CODES, state->lens, 19, &(state->next),
929 state->next = state->codes;
930 state->lencode = (code const FAR *)(state->next);
932 ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
939 state->distcode = (code const FAR *)(state->next);
942 &(state->next), &(state->distbits), state->work);
1245 unsigned next;
1248 next = 0;
1249 while (next < len && got < 4) {
1250 if ((int)(buf[next]) == (got < 2 ? 0 : 0xff))
1252 else if (buf[next])
1256 next++;
1259 return next;
1360 copy->next = copy->codes + (state->next - state->codes);