Lines Matching refs:ip

112   const u8 *ip = (const u8 *)in_data;
114 const u8 *in_end = ip + in_len;
140 *hslot++ = ip;
146 hval = FRST (ip);
147 while (ip < in_end - 2)
149 hval = NEXT (hval, ip);
151 ref = *hslot; *hslot = ip;
155 && ref < ip /* the next test will actually take care of this, but this is faster */
157 && (off = ip - ref - 1) < MAX_OFF
158 && ip + 4 < in_end
161 && ref[0] == ip[0]
162 && ref[1] == ip[1]
163 && ref[2] == ip[2]
165 && *(const u16 *)ref == *(const u16 *)ip
166 && ref[2] == ip[2]
172 unsigned int maxlen = in_end - ip - len;
186 len++; if (ref [len] != ip [len]) break;
187 len++; if (ref [len] != ip [len]) break;
188 len++; if (ref [len] != ip [len]) break;
189 len++; if (ref [len] != ip [len]) break;
191 len++; if (ref [len] != ip [len]) break;
192 len++; if (ref [len] != ip [len]) break;
193 len++; if (ref [len] != ip [len]) break;
194 len++; if (ref [len] != ip [len]) break;
196 len++; if (ref [len] != ip [len]) break;
197 len++; if (ref [len] != ip [len]) break;
198 len++; if (ref [len] != ip [len]) break;
199 len++; if (ref [len] != ip [len]) break;
201 len++; if (ref [len] != ip [len]) break;
202 len++; if (ref [len] != ip [len]) break;
203 len++; if (ref [len] != ip [len]) break;
204 len++; if (ref [len] != ip [len]) break;
209 while (len < maxlen && ref[len] == ip[len]);
215 ip++;
230 ip += len + 1;
232 if (expect_false (ip >= in_end - 2))
236 --ip;
238 --ip;
240 hval = FRST (ip);
242 hval = NEXT (hval, ip);
243 htab[IDX (hval)] = ip;
244 ip++;
247 hval = NEXT (hval, ip);
248 htab[IDX (hval)] = ip;
249 ip++;
252 ip -= len + 1;
256 hval = NEXT (hval, ip);
257 htab[IDX (hval)] = ip;
258 ip++;
269 lit++; *op++ = *ip++;
282 while (ip < in_end)
284 lit++; *op++ = *ip++;
317 u8 const *ip = (const u8 *)in_data;
319 u8 const *const in_end = ip + in_len;
324 unsigned int ctrl = *ip++;
337 if (ip + ctrl > in_end)
345 lzf_movsb (op, ip, ctrl);
348 *op++ = *ip++;
359 if (ip >= in_end)
367 len += *ip++;
369 if (ip >= in_end)
377 ref -= *ip++;
404 while (ip < in_end);