X-Git-Url: https://git.cworth.org/git?a=blobdiff_plain;f=unpack.c;fp=unpack.c;h=00dae749f62a6a12a929bc7c05f8cfa3dced3ef6;hb=0095746c83f59e1f45c9e803d61e205ab6cbfa83;hp=b1f3ef3836ce72eae0a2ada17a3302990080d8e9;hpb=8ba3484138b5d1e72fd4ef49d27159263cb6bea6;p=gzip

diff --git a/unpack.c b/unpack.c
index b1f3ef3..00dae74 100644
--- a/unpack.c
+++ b/unpack.c
@@ -97,7 +97,6 @@ local void read_tree()
     int len;  /* bit length */
     int base; /* base offset for a sequence of leaves */
     int n;
-    int max_leaves;
 
     /* Read the original input size, MSB first */
     orig_len = 0;
@@ -110,15 +109,11 @@ local void read_tree()
 
     /* Get the number of leaves at each bit length */
     n = 0;
-    max_leaves = 1;
     for (len = 1; len <= max_len; len++) {
 	leaves[len] = (int)get_byte();
-	if (leaves[len] > max_leaves - (len == max_len))
-	    error("too many leaves in Huffman tree");
-	max_leaves = (max_leaves - leaves[len] + 1) * 2 - 1;
 	n += leaves[len];
     }
-    if (n >= LITERALS) {
+    if (n > LITERALS) {
 	error("too many leaves in Huffman tree");
     }
     Trace((stderr, "orig_len %lu, max_len %d, leaves %d\n",