u32 min_len;
u32 num_matches = 0;
- if (bytes_remaining <= LZ_BT_HASH_BYTES)
+ if (unlikely(bytes_remaining <= mf->base.params.min_match_len + 1))
goto out;
if (mf->digram_tab) {
u32 hash;
u32 cur_match;
- if (bytes_remaining <= LZ_BT_HASH_BYTES)
+ if (unlikely(bytes_remaining <= mf->base.params.min_match_len + 1))
goto out;
/* Update the digram table. */