109   const u8 *ip = (const u8 *)in_data;  in lzf_compress()  local
111   const u8 *in_end  = ip + in_len;  in lzf_compress()
139   hval = FRST (ip);  in lzf_compress()
140   while (ip < in_end - 2)  in lzf_compress()
144       hval = NEXT (hval, ip);  in lzf_compress()
146       ref = *hslot + LZF_HSLOT_BIAS; *hslot = ip - LZF_HSLOT_BIAS;  in lzf_compress()
150           && ref < ip /* the next test will actually take care of this, but this is faster */  in lzf_compress()
152           && (off = ip - ref - 1) < MAX_OFF  in lzf_compress()
154           && ref[2] == ip[2]  in lzf_compress()
156           && ((ref[1] << 8) | ref[0]) == ((ip[1] << 8) | ip[0])  in lzf_compress()
158           && *(u16 *)ref == *(u16 *)ip  in lzf_compress()
164           unsigned int maxlen = in_end - ip - len;  in lzf_compress()
178                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
179                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
180                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
181                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
183                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
184                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
185                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
186                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
188                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
189                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
190                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
191                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
193                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
194                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
195                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
196                   len++; if (ref [len] != ip [len]) break;  in lzf_compress()
201               while (len < maxlen && ref[len] == ip[len]);  in lzf_compress()
207           ip++;  in lzf_compress()
223           ip += len + 1;  in lzf_compress()
225           if (expect_false (ip >= in_end - 2))  in lzf_compress()
229           --ip;  in lzf_compress()
231           --ip;  in lzf_compress()
233           hval = FRST (ip);  in lzf_compress()
235           hval = NEXT (hval, ip);  in lzf_compress()
236           htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;  in lzf_compress()
237           ip++;  in lzf_compress()
240           hval = NEXT (hval, ip);  in lzf_compress()
241           htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;  in lzf_compress()
242           ip++;  in lzf_compress()
245           ip -= len + 1;  in lzf_compress()
249               hval = NEXT (hval, ip);  in lzf_compress()
250               htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;  in lzf_compress()
251               ip++;  in lzf_compress()
262           lit++; *op++ = *ip++;  in lzf_compress()
275   while (ip < in_end)  in lzf_compress()
277       lit++; *op++ = *ip++;  in lzf_compress()