X-Git-Url: https://mattmccutchen.net/rsync/rsync.git/blobdiff_plain/45f133b9769fb45a329d3d41e121109d430e307d..2b6b4d539b0aab98b1cbb9d8c639cb12473aae94:/match.c

diff --git a/match.c b/match.c
index 0d8bc31b..12102158 100644
--- a/match.c
+++ b/match.c
@@ -131,7 +131,6 @@ static void hash_search(int f,struct sum_struct *s,
 	char sum2[SUM_LENGTH];
 	uint32 s1, s2, sum; 
 	schar *map;
-	extern int do_compression;
 
 	if (verbose > 2)
 		rprintf(FINFO,"hash search b=%d len=%d\n",s->n,(int)len);
@@ -214,21 +213,15 @@ static void hash_search(int f,struct sum_struct *s,
 			--k;
 		}
 
-		if (!do_compression) {
-			/* By matching early we avoid re-reading the
-			   data 3 times in the case where a token
-			   match comes a long way after last
-			   match. The 3 reads are caused by the
-			   running match, the checksum update and the
-			   literal send.
-
-			   we don't enable this for the compressed
-			   case yet as the deflated token code can't
-			   handle it. Paul is working on it */
-			if (offset-last_match >= CHUNK_SIZE+s->n && 
-			    (end-offset > CHUNK_SIZE)) {
-				matched(f,s,buf,offset - s->n, -2);
-			}
+		/* By matching early we avoid re-reading the
+		   data 3 times in the case where a token
+		   match comes a long way after last
+		   match. The 3 reads are caused by the
+		   running match, the checksum update and the
+		   literal send. */
+		if (offset-last_match >= CHUNK_SIZE+s->n && 
+		    (end-offset > CHUNK_SIZE)) {
+			matched(f,s,buf,offset - s->n, -2);
 		}
 	} while (++offset < end);