X-Git-Url: https://git.gag.com/?a=blobdiff_plain;f=unpack.c;h=e450c0e79b26de2af0b435457ac33bfa02f14270;hb=361a1fb8599b8e1ed356be7e2a629c0d5c833b8f;hp=00dae749f62a6a12a929bc7c05f8cfa3dced3ef6;hpb=0095746c83f59e1f45c9e803d61e205ab6cbfa83;p=debian%2Fgzip diff --git a/unpack.c b/unpack.c index 00dae74..e450c0e 100644 --- a/unpack.c +++ b/unpack.c @@ -1,17 +1,25 @@ /* unpack.c -- decompress files in pack format. - * Copyright (C) 1992-1993 Jean-loup Gailly - * This is free software; you can redistribute it and/or modify it under the - * terms of the GNU General Public License, see the file COPYING. - */ -#ifdef RCSID -static char rcsid[] = "$Id: unpack.c,v 1.4 1993/06/11 19:25:36 jloup Exp $"; -#endif + Copyright (C) 1997, 1999, 2006, 2009-2012 Free Software Foundation, Inc. + Copyright (C) 1992-1993 Jean-loup Gailly + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 3, or (at your option) + any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software Foundation, + Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include #include "tailor.h" #include "gzip.h" -#include "crypt.h" #define MIN(a,b) ((a) <= (b) ? (a) : (b)) /* The arguments must not have side effects. */ @@ -86,8 +94,8 @@ local int valid; /* number of valid bits in bitbuf */ /* Local functions */ -local void read_tree OF((void)); -local void build_tree OF((void)); +local void read_tree (void); +local void build_tree (void); /* =========================================================================== * Read the Huffman tree. @@ -97,6 +105,7 @@ local void read_tree() int len; /* bit length */ int base; /* base offset for a sequence of leaves */ int n; + int max_leaves = 1; /* Read the original input size, MSB first */ orig_len = 0; @@ -104,20 +113,23 @@ local void read_tree() max_len = (int)get_byte(); /* maximum bit length of Huffman codes */ if (max_len > MAX_BITLEN) { - error("invalid compressed data -- Huffman code > 32 bits"); + gzip_error ("invalid compressed data -- Huffman code > 32 bits"); } /* Get the number of leaves at each bit length */ n = 0; for (len = 1; len <= max_len; len++) { - leaves[len] = (int)get_byte(); - n += leaves[len]; + leaves[len] = (int)get_byte(); + if (max_leaves - (len == max_len) < leaves[len]) + gzip_error ("too many leaves in Huffman tree"); + max_leaves = (max_leaves - leaves[len] + 1) * 2 - 1; + n += leaves[len]; } - if (n > LITERALS) { - error("too many leaves in Huffman tree"); + if (LITERALS <= n) { + gzip_error ("too many leaves in Huffman tree"); } Trace((stderr, "orig_len %lu, max_len %d, leaves %d\n", - orig_len, max_len, n)); + orig_len, max_len, n)); /* There are at least 2 and at most 256 leaves of length max_len. * (Pack arbitrarily rejects empty files and files consisting of * a single byte even repeated.) To fit the last leaf count in a @@ -130,12 +142,12 @@ local void read_tree() /* Now read the leaves themselves */ base = 0; for (len = 1; len <= max_len; len++) { - /* Remember where the literals of this length start in literal[] : */ - lit_base[len] = base; - /* And read the literals: */ - for (n = leaves[len]; n > 0; n--) { - literal[base++] = (uch)get_byte(); - } + /* Remember where the literals of this length start in literal[] : */ + lit_base[len] = base; + /* And read the literals: */ + for (n = leaves[len]; n > 0; n--) { + literal[base++] = (uch)get_byte(); + } } leaves[max_len]++; /* Now include the EOB code in the Huffman tree */ } @@ -150,17 +162,17 @@ local void build_tree() uch *prefixp; /* pointer in prefix_len */ for (len = max_len; len >= 1; len--) { - /* The number of parent nodes at this level is half the total - * number of nodes at parent level: - */ - nodes >>= 1; - parents[len] = nodes; - /* Update lit_base by the appropriate bias to skip the parent nodes - * (which are not represented in the literal array): - */ - lit_base[len] -= nodes; - /* Restore nodes to be parents+leaves: */ - nodes += leaves[len]; + /* The number of parent nodes at this level is half the total + * number of nodes at parent level: + */ + nodes >>= 1; + parents[len] = nodes; + /* Update lit_base by the appropriate bias to skip the parent nodes + * (which are not represented in the literal array): + */ + lit_base[len] -= nodes; + /* Restore nodes to be parents+leaves: */ + nodes += leaves[len]; } /* Construct the prefix table, from shortest leaves to longest ones. * The shortest code is all ones, so we start at the end of the table. @@ -168,8 +180,8 @@ local void build_tree() peek_bits = MIN(max_len, MAX_PEEK); prefixp = &prefix_len[1< prefix_len) *--prefixp = 0; @@ -205,35 +217,35 @@ int unpack(in, out) /* Decode the input data: */ for (;;) { - /* Since eob is the longest code and not shorter than max_len, + /* Since eob is the longest code and not shorter than max_len, * we can peek at max_len bits without having the risk of reading * beyond the end of file. - */ - look_bits(peek, peek_bits, peek_mask); - len = prefix_len[peek]; - if (len > 0) { - peek >>= peek_bits - len; /* discard the extra bits */ - } else { - /* Code of more than peek_bits bits, we must traverse the tree */ - ulg mask = peek_mask; - len = peek_bits; - do { + */ + look_bits(peek, peek_bits, peek_mask); + len = prefix_len[peek]; + if (len > 0) { + peek >>= peek_bits - len; /* discard the extra bits */ + } else { + /* Code of more than peek_bits bits, we must traverse the tree */ + ulg mask = peek_mask; + len = peek_bits; + do { len++, mask = (mask<<1)+1; - look_bits(peek, len, mask); - } while (peek < (unsigned)parents[len]); - /* loop as long as peek is a parent node */ - } - /* At this point, peek is the next complete code, of len bits */ - if (peek == eob && len == max_len) break; /* end of file? */ - put_ubyte(literal[peek+lit_base[len]]); - Tracev((stderr,"%02d %04x %c\n", len, peek, - literal[peek+lit_base[len]])); - skip_bits(len); + look_bits(peek, len, mask); + } while (peek < (unsigned)parents[len]); + /* loop as long as peek is a parent node */ + } + /* At this point, peek is the next complete code, of len bits */ + if (peek == eob && len == max_len) break; /* end of file? */ + put_ubyte(literal[peek+lit_base[len]]); + Tracev((stderr,"%02d %04x %c\n", len, peek, + literal[peek+lit_base[len]])); + skip_bits(len); } /* for (;;) */ flush_window(); if (orig_len != (ulg)(bytes_out & 0xffffffff)) { - error("invalid compressed data--length error"); + gzip_error ("invalid compressed data--length error"); } return OK; }