Lines Matching refs:strm
54 strm->avail_in >= 6
55 strm->avail_out >= 258
56 start >= strm->avail_out
70 Therefore if strm->avail_in >= 6, then there is enough input to avoid
75 requires strm->avail_out >= 258 for each loop to avoid checking for
86 /* 16 8 */ unsigned char FAR *in; /* esi rsi local strm->next_in */
88 /* 32 16 */ unsigned char FAR *out; /* edi rdi local strm->next_out */
92 /* 64 32 */ code const FAR *lcode; /* ebp rbp local strm->lencode */
93 /* 72 36 */ code const FAR *dcode; /* r11 local strm->distcode */
94 /* 80 40 */ size_t /*unsigned long */hold; /* edx rdx local strm->hold */
95 /* 88 44 */ unsigned bits; /* ebx rbx local strm->bits */
106 void inflate_fast(strm, start)
107 z_streamp strm;
108 unsigned start; /* inflate()'s starting value for strm->avail_out */
125 state = (struct inflate_state FAR *)strm->state;
127 ar.in = strm->next_in;
128 ar.last = ar.in + (strm->avail_in - PAD_AVAIL_IN);
129 ar.out = strm->next_out;
130 ar.beg = ar.out - (start - strm->avail_out);
131 ar.end = ar.out + (strm->avail_out - PAD_AVAIL_OUT);
155 strm->msg = "invalid literal/length code";
157 strm->msg = "invalid distance code";
159 strm->msg = "invalid distance too far back";
173 strm->next_in = ar.in;
174 strm->next_out = ar.out;
175 strm->avail_in = (unsigned)(ar.in < ar.last ?
178 strm->avail_out = (unsigned)(ar.out < ar.end ?