From 0174d18d8b51f6c9228c70066a987c30a8132995 Mon Sep 17 00:00:00 2001
From: Vincent Rabaud <vrabaud@google.com>
Date: Thu, 16 Jun 2016 19:22:28 +0200
Subject: [PATCH] Fix a boundary case in
 BackwardReferencesHashChainDistanceOnly.

The optimization for (len != MIN_LENGTH) actually only holds for
(len > MIN_LENGTH) but (len < MIN_LENGTH) can now happen as len can
be changed in the loop before.

Change-Id: I3f9f91a540206c80385c5fba96c3d64ab9536752
---
 src/enc/backward_references.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/enc/backward_references.c b/src/enc/backward_references.c
index 314ca894..d2ec607a 100644
--- a/src/enc/backward_references.c
+++ b/src/enc/backward_references.c
@@ -1240,7 +1240,7 @@ static int BackwardReferencesHashChainDistanceOnly(
         }
         goto next_symbol;
       }
-      if (len != MIN_LENGTH) {
+      if (len > MIN_LENGTH) {
         int code_min_length;
         double cost_total;
         offset = HashChainFindOffset(hash_chain, i);