From: Denis Vlasenko <vda.linux@googlemail.com>
Date: Sun, 7 Jan 2007 19:39:54 +0000 (-0000)
Subject: gzip cleanup part #7
X-Git-Tag: 1_4_0~82
X-Git-Url: https://git.librecmc.org/?a=commitdiff_plain;h=ef87d46b8c6ac3be21bcd6f1cad6533289e33f42;p=oweals%2Fbusybox.git

gzip cleanup part #7
---

diff --git a/archival/gzip.c b/archival/gzip.c
index 758c70a4b..76836951f 100644
--- a/archival/gzip.c
+++ b/archival/gzip.c
@@ -616,9 +616,11 @@ static void copy_block(char *buf, unsigned len, int header)
  *    (except for the last MIN_MATCH-1 bytes of the input file).
  */
 #define INSERT_STRING(s, match_head) \
-   (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \
-    prev[(s) & WMASK] = match_head = head[ins_h], \
-    head[ins_h] = (s))
+{ \
+	UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]); \
+	prev[(s) & WMASK] = match_head = head[ins_h]; \
+	head[ins_h] = (s); \
+}
 
 /* ===========================================================================
  * Initialize the "longest match" routines for a new file
@@ -898,9 +900,7 @@ static ulg deflate(void)
 		 * match is not better, output the previous match:
 		 */
 		if (prev_length >= MIN_MATCH && match_length <= prev_length) {
-
 			check_match(strstart - 1, prev_match, prev_length);
-
 			flush = ct_tally(strstart - 1 - prev_match, prev_length - MIN_MATCH);
 
 			/* Insert in hash table all strings up to the end of the match.