|
|
/* Find the longest match, discarding those <= prev_length. | /* Find the longest match, discarding those <= prev_length. |
* At this point we have always match_length < MIN_MATCH | * At this point we have always match_length < MIN_MATCH |
*/ | */ |
if (hash_head != NIL && strstart - hash_head <= MAX_DIST) { |
if (hash_head != NIL && strstart - hash_head <= MAX_DIST && |
|
strstart <= window_size - MIN_LOOKAHEAD) { |
/* To simplify the code, we prevent matches with the string | /* To simplify the code, we prevent matches with the string |
* of window index 0 (in particular we have to avoid a match | * of window index 0 (in particular we have to avoid a match |
* of the string with itself at the start of the input file). | * of the string with itself at the start of the input file). |
|
|
match_length = MIN_MATCH-1; | match_length = MIN_MATCH-1; |
| |
if (hash_head != NIL && prev_length < max_lazy_match && | if (hash_head != NIL && prev_length < max_lazy_match && |
strstart - hash_head <= MAX_DIST) { |
strstart - hash_head <= MAX_DIST && |
|
strstart <= window_size - MIN_LOOKAHEAD) { |
/* To simplify the code, we prevent matches with the string | /* To simplify the code, we prevent matches with the string |
* of window index 0 (in particular we have to avoid a match | * of window index 0 (in particular we have to avoid a match |
* of the string with itself at the start of the input file). | * of the string with itself at the start of the input file). |