113   const u8 *ref;  in lzf_compress()  local
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()
153           && ref > (u8 *)in_data  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()
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()