5128eecc9f 2011-02-23 kinaba: /* inftrees.c -- generate Huffman trees for efficient decoding 5128eecc9f 2011-02-23 kinaba: * Copyright (C) 1995-1998 Mark Adler 5128eecc9f 2011-02-23 kinaba: * For conditions of distribution and use, see copyright notice in zlib.h 5128eecc9f 2011-02-23 kinaba: */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: #include "zutil.h" 5128eecc9f 2011-02-23 kinaba: #include "inftrees.h" 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: #if !defined(BUILDFIXED) && !defined(STDC) 5128eecc9f 2011-02-23 kinaba: # define BUILDFIXED /* non ANSI compilers may not accept inffixed.h */ 5128eecc9f 2011-02-23 kinaba: #endif 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: const char inflate_copyright[] = 5128eecc9f 2011-02-23 kinaba: " inflate 1.1.3 Copyright 1995-1998 Mark Adler "; 5128eecc9f 2011-02-23 kinaba: /* 5128eecc9f 2011-02-23 kinaba: If you use the zlib library in a product, an acknowledgment is welcome 5128eecc9f 2011-02-23 kinaba: in the documentation of your product. If for some reason you cannot 5128eecc9f 2011-02-23 kinaba: include such an acknowledgment, I would appreciate that you keep this 5128eecc9f 2011-02-23 kinaba: copyright string in the executable of your product. 5128eecc9f 2011-02-23 kinaba: */ 5128eecc9f 2011-02-23 kinaba: struct internal_state {int dummy;}; /* for buggy compilers */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* simplify the use of the inflate_huft type with some defines */ 5128eecc9f 2011-02-23 kinaba: #define exop word.what.Exop 5128eecc9f 2011-02-23 kinaba: #define bits word.what.Bits 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: local int huft_build OF(( 5128eecc9f 2011-02-23 kinaba: uIntf *, /* code lengths in bits */ 5128eecc9f 2011-02-23 kinaba: uInt, /* number of codes */ 5128eecc9f 2011-02-23 kinaba: uInt, /* number of "simple" codes */ 5128eecc9f 2011-02-23 kinaba: const uIntf *, /* list of base values for non-simple codes */ 5128eecc9f 2011-02-23 kinaba: const uIntf *, /* list of extra bits for non-simple codes */ 5128eecc9f 2011-02-23 kinaba: inflate_huft * FAR*,/* result: starting table */ 5128eecc9f 2011-02-23 kinaba: uIntf *, /* maximum lookup bits (returns actual) */ 5128eecc9f 2011-02-23 kinaba: inflate_huft *, /* space for trees */ 5128eecc9f 2011-02-23 kinaba: uInt *, /* hufts used in space */ 5128eecc9f 2011-02-23 kinaba: uIntf * )); /* space for values */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* Tables for deflate from PKZIP's appnote.txt. */ 5128eecc9f 2011-02-23 kinaba: local const uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */ 5128eecc9f 2011-02-23 kinaba: 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 5128eecc9f 2011-02-23 kinaba: 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; 5128eecc9f 2011-02-23 kinaba: /* see note #13 above about 258 */ 5128eecc9f 2011-02-23 kinaba: local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */ 5128eecc9f 2011-02-23 kinaba: 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 5128eecc9f 2011-02-23 kinaba: 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112}; /* 112==invalid */ 5128eecc9f 2011-02-23 kinaba: local const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */ 5128eecc9f 2011-02-23 kinaba: 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 5128eecc9f 2011-02-23 kinaba: 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 5128eecc9f 2011-02-23 kinaba: 8193, 12289, 16385, 24577}; 5128eecc9f 2011-02-23 kinaba: local const uInt cpdext[30] = { /* Extra bits for distance codes */ 5128eecc9f 2011-02-23 kinaba: 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 5128eecc9f 2011-02-23 kinaba: 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 5128eecc9f 2011-02-23 kinaba: 12, 12, 13, 13}; 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* 5128eecc9f 2011-02-23 kinaba: Huffman code decoding is performed using a multi-level table lookup. 5128eecc9f 2011-02-23 kinaba: The fastest way to decode is to simply build a lookup table whose 5128eecc9f 2011-02-23 kinaba: size is determined by the longest code. However, the time it takes 5128eecc9f 2011-02-23 kinaba: to build this table can also be a factor if the data being decoded 5128eecc9f 2011-02-23 kinaba: is not very long. The most common codes are necessarily the 5128eecc9f 2011-02-23 kinaba: shortest codes, so those codes dominate the decoding time, and hence 5128eecc9f 2011-02-23 kinaba: the speed. The idea is you can have a shorter table that decodes the 5128eecc9f 2011-02-23 kinaba: shorter, more probable codes, and then point to subsidiary tables for 5128eecc9f 2011-02-23 kinaba: the longer codes. The time it costs to decode the longer codes is 5128eecc9f 2011-02-23 kinaba: then traded against the time it takes to make longer tables. 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: This results of this trade are in the variables lbits and dbits 5128eecc9f 2011-02-23 kinaba: below. lbits is the number of bits the first level table for literal/ 5128eecc9f 2011-02-23 kinaba: length codes can decode in one step, and dbits is the same thing for 5128eecc9f 2011-02-23 kinaba: the distance codes. Subsequent tables are also less than or equal to 5128eecc9f 2011-02-23 kinaba: those sizes. These values may be adjusted either when all of the 5128eecc9f 2011-02-23 kinaba: codes are shorter than that, in which case the longest code length in 5128eecc9f 2011-02-23 kinaba: bits is used, or when the shortest code is *longer* than the requested 5128eecc9f 2011-02-23 kinaba: table size, in which case the length of the shortest code in bits is 5128eecc9f 2011-02-23 kinaba: used. 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: There are two different values for the two tables, since they code a 5128eecc9f 2011-02-23 kinaba: different number of possibilities each. The literal/length table 5128eecc9f 2011-02-23 kinaba: codes 286 possible values, or in a flat code, a little over eight 5128eecc9f 2011-02-23 kinaba: bits. The distance table codes 30 possible values, or a little less 5128eecc9f 2011-02-23 kinaba: than five bits, flat. The optimum values for speed end up being 5128eecc9f 2011-02-23 kinaba: about one bit more than those, so lbits is 8+1 and dbits is 5+1. 5128eecc9f 2011-02-23 kinaba: The optimum values may differ though from machine to machine, and 5128eecc9f 2011-02-23 kinaba: possibly even between compilers. Your mileage may vary. 5128eecc9f 2011-02-23 kinaba: */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */ 5128eecc9f 2011-02-23 kinaba: #define BMAX 15 /* maximum bit length of any code */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: local int huft_build(b, n, s, d, e, t, m, hp, hn, v) 5128eecc9f 2011-02-23 kinaba: uIntf *b; /* code lengths in bits (all assumed <= BMAX) */ 5128eecc9f 2011-02-23 kinaba: uInt n; /* number of codes (assumed <= 288) */ 5128eecc9f 2011-02-23 kinaba: uInt s; /* number of simple-valued codes (0..s-1) */ 5128eecc9f 2011-02-23 kinaba: const uIntf *d; /* list of base values for non-simple codes */ 5128eecc9f 2011-02-23 kinaba: const uIntf *e; /* list of extra bits for non-simple codes */ 5128eecc9f 2011-02-23 kinaba: inflate_huft * FAR *t; /* result: starting table */ 5128eecc9f 2011-02-23 kinaba: uIntf *m; /* maximum lookup bits, returns actual */ 5128eecc9f 2011-02-23 kinaba: inflate_huft *hp; /* space for trees */ 5128eecc9f 2011-02-23 kinaba: uInt *hn; /* hufts used in space */ 5128eecc9f 2011-02-23 kinaba: uIntf *v; /* working area: values in order of bit length */ 5128eecc9f 2011-02-23 kinaba: /* Given a list of code lengths and a maximum table size, make a set of 5128eecc9f 2011-02-23 kinaba: tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR 5128eecc9f 2011-02-23 kinaba: if the given code set is incomplete (the tables are still built in this 5128eecc9f 2011-02-23 kinaba: case), Z_DATA_ERROR if the input is invalid (an over-subscribed set of 5128eecc9f 2011-02-23 kinaba: lengths), or Z_MEM_ERROR if not enough memory. */ 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: uInt a; /* counter for codes of length k */ 5128eecc9f 2011-02-23 kinaba: uInt c[BMAX+1]; /* bit length count table */ 5128eecc9f 2011-02-23 kinaba: uInt f; /* i repeats in table every f entries */ 5128eecc9f 2011-02-23 kinaba: int g; /* maximum code length */ 5128eecc9f 2011-02-23 kinaba: int h; /* table level */ 5128eecc9f 2011-02-23 kinaba: register uInt i; /* counter, current code */ 5128eecc9f 2011-02-23 kinaba: register uInt j; /* counter */ 5128eecc9f 2011-02-23 kinaba: register int k; /* number of bits in current code */ 5128eecc9f 2011-02-23 kinaba: int l; /* bits per table (returned in m) */ 5128eecc9f 2011-02-23 kinaba: uInt mask; /* (1 << w) - 1, to avoid cc -O bug on HP */ 5128eecc9f 2011-02-23 kinaba: register uIntf *p; /* pointer into c[], b[], or v[] */ 5128eecc9f 2011-02-23 kinaba: inflate_huft *q; /* points to current table */ 5128eecc9f 2011-02-23 kinaba: struct inflate_huft_s r; /* table entry for structure assignment */ 5128eecc9f 2011-02-23 kinaba: inflate_huft *u[BMAX]; /* table stack */ 5128eecc9f 2011-02-23 kinaba: register int w; /* bits before this table == (l * h) */ 5128eecc9f 2011-02-23 kinaba: uInt x[BMAX+1]; /* bit offsets, then code stack */ 5128eecc9f 2011-02-23 kinaba: uIntf *xp; /* pointer into x */ 5128eecc9f 2011-02-23 kinaba: int y; /* number of dummy codes added */ 5128eecc9f 2011-02-23 kinaba: uInt z; /* number of entries in current table */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* Generate counts for each bit length */ 5128eecc9f 2011-02-23 kinaba: p = c; 5128eecc9f 2011-02-23 kinaba: #define C0 *p++ = 0; 5128eecc9f 2011-02-23 kinaba: #define C2 C0 C0 C0 C0 5128eecc9f 2011-02-23 kinaba: #define C4 C2 C2 C2 C2 5128eecc9f 2011-02-23 kinaba: C4 /* clear c[]--assume BMAX+1 is 16 */ 5128eecc9f 2011-02-23 kinaba: p = b; i = n; 5128eecc9f 2011-02-23 kinaba: do { 5128eecc9f 2011-02-23 kinaba: c[*p++]++; /* assume all entries <= BMAX */ 5128eecc9f 2011-02-23 kinaba: } while (--i); 5128eecc9f 2011-02-23 kinaba: if (c[0] == n) /* null input--all zero length codes */ 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: *t = (inflate_huft *)Z_NULL; 5128eecc9f 2011-02-23 kinaba: *m = 0; 5128eecc9f 2011-02-23 kinaba: return Z_OK; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* Find minimum and maximum length, bound *m by those */ 5128eecc9f 2011-02-23 kinaba: l = *m; 5128eecc9f 2011-02-23 kinaba: for (j = 1; j <= BMAX; j++) 5128eecc9f 2011-02-23 kinaba: if (c[j]) 5128eecc9f 2011-02-23 kinaba: break; 5128eecc9f 2011-02-23 kinaba: k = j; /* minimum code length */ 5128eecc9f 2011-02-23 kinaba: if ((uInt)l < j) 5128eecc9f 2011-02-23 kinaba: l = j; 5128eecc9f 2011-02-23 kinaba: for (i = BMAX; i; i--) 5128eecc9f 2011-02-23 kinaba: if (c[i]) 5128eecc9f 2011-02-23 kinaba: break; 5128eecc9f 2011-02-23 kinaba: g = i; /* maximum code length */ 5128eecc9f 2011-02-23 kinaba: if ((uInt)l > i) 5128eecc9f 2011-02-23 kinaba: l = i; 5128eecc9f 2011-02-23 kinaba: *m = l; 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* Adjust last length count to fill out codes, if needed */ 5128eecc9f 2011-02-23 kinaba: for (y = 1 << j; j < i; j++, y <<= 1) 5128eecc9f 2011-02-23 kinaba: if ((y -= c[j]) < 0) 5128eecc9f 2011-02-23 kinaba: return Z_DATA_ERROR; 5128eecc9f 2011-02-23 kinaba: if ((y -= c[i]) < 0) 5128eecc9f 2011-02-23 kinaba: return Z_DATA_ERROR; 5128eecc9f 2011-02-23 kinaba: c[i] += y; 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* Generate starting offsets into the value table for each length */ 5128eecc9f 2011-02-23 kinaba: x[1] = j = 0; 5128eecc9f 2011-02-23 kinaba: p = c + 1; xp = x + 2; 5128eecc9f 2011-02-23 kinaba: while (--i) { /* note that i == g from above */ 5128eecc9f 2011-02-23 kinaba: *xp++ = (j += *p++); 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* Make a table of values in order of bit lengths */ 5128eecc9f 2011-02-23 kinaba: p = b; i = 0; 5128eecc9f 2011-02-23 kinaba: do { 5128eecc9f 2011-02-23 kinaba: if ((j = *p++) != 0) 5128eecc9f 2011-02-23 kinaba: v[x[j]++] = i; 5128eecc9f 2011-02-23 kinaba: } while (++i < n); 5128eecc9f 2011-02-23 kinaba: n = x[g]; /* set n to length of v */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* Generate the Huffman codes and for each, make the table entries */ 5128eecc9f 2011-02-23 kinaba: x[0] = i = 0; /* first Huffman code is zero */ 5128eecc9f 2011-02-23 kinaba: p = v; /* grab values in bit order */ 5128eecc9f 2011-02-23 kinaba: h = -1; /* no tables yet--level -1 */ 5128eecc9f 2011-02-23 kinaba: w = -l; /* bits decoded == (l * h) */ 5128eecc9f 2011-02-23 kinaba: u[0] = (inflate_huft *)Z_NULL; /* just to keep compilers happy */ 5128eecc9f 2011-02-23 kinaba: q = (inflate_huft *)Z_NULL; /* ditto */ 5128eecc9f 2011-02-23 kinaba: z = 0; /* ditto */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* go through the bit lengths (k already is bits in shortest code) */ 5128eecc9f 2011-02-23 kinaba: for (; k <= g; k++) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: a = c[k]; 5128eecc9f 2011-02-23 kinaba: while (a--) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: /* here i is the Huffman code of length k bits for value *p */ 5128eecc9f 2011-02-23 kinaba: /* make tables up to required level */ 5128eecc9f 2011-02-23 kinaba: while (k > w + l) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: h++; 5128eecc9f 2011-02-23 kinaba: w += l; /* previous table always l bits */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* compute minimum size table less than or equal to l bits */ 5128eecc9f 2011-02-23 kinaba: z = g - w; 5128eecc9f 2011-02-23 kinaba: z = z > (uInt)l ? l : z; /* table size upper limit */ 5128eecc9f 2011-02-23 kinaba: if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */ 5128eecc9f 2011-02-23 kinaba: { /* too few codes for k-w bit table */ 5128eecc9f 2011-02-23 kinaba: f -= a + 1; /* deduct codes from patterns left */ 5128eecc9f 2011-02-23 kinaba: xp = c + k; 5128eecc9f 2011-02-23 kinaba: if (j < z) 5128eecc9f 2011-02-23 kinaba: while (++j < z) /* try smaller tables up to z bits */ 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: if ((f <<= 1) <= *++xp) 5128eecc9f 2011-02-23 kinaba: break; /* enough codes to use up j bits */ 5128eecc9f 2011-02-23 kinaba: f -= *xp; /* else deduct codes from patterns */ 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: z = 1 << j; /* table entries for j-bit table */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* allocate new table */ 5128eecc9f 2011-02-23 kinaba: if (*hn + z > MANY) /* (note: doesn't matter for fixed) */ 5128eecc9f 2011-02-23 kinaba: return Z_MEM_ERROR; /* not enough memory */ 5128eecc9f 2011-02-23 kinaba: u[h] = q = hp + *hn; 5128eecc9f 2011-02-23 kinaba: *hn += z; 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* connect to last table, if there is one */ 5128eecc9f 2011-02-23 kinaba: if (h) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: x[h] = i; /* save pattern for backing up */ 5128eecc9f 2011-02-23 kinaba: r.bits = (Byte)l; /* bits to dump before this table */ 5128eecc9f 2011-02-23 kinaba: r.exop = (Byte)j; /* bits in this table */ 5128eecc9f 2011-02-23 kinaba: j = i >> (w - l); 5128eecc9f 2011-02-23 kinaba: r.base = (uInt)(q - u[h-1] - j); /* offset to this table */ 5128eecc9f 2011-02-23 kinaba: u[h-1][j] = r; /* connect to last table */ 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: else 5128eecc9f 2011-02-23 kinaba: *t = q; /* first table is returned result */ 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* set up table entry in r */ 5128eecc9f 2011-02-23 kinaba: r.bits = (Byte)(k - w); 5128eecc9f 2011-02-23 kinaba: if (p >= v + n) 5128eecc9f 2011-02-23 kinaba: r.exop = 128 + 64; /* out of values--invalid code */ 5128eecc9f 2011-02-23 kinaba: else if (*p < s) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: r.exop = (Byte)(*p < 256 ? 0 : 32 + 64); /* 256 is end-of-block */ 5128eecc9f 2011-02-23 kinaba: r.base = *p++; /* simple code is just the value */ 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: else 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: r.exop = (Byte)(e[*p - s] + 16 + 64);/* non-simple--look up in lists */ 5128eecc9f 2011-02-23 kinaba: r.base = d[*p++ - s]; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* fill code-like entries with r */ 5128eecc9f 2011-02-23 kinaba: f = 1 << (k - w); 5128eecc9f 2011-02-23 kinaba: for (j = i >> w; j < z; j += f) 5128eecc9f 2011-02-23 kinaba: q[j] = r; 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* backwards increment the k-bit code i */ 5128eecc9f 2011-02-23 kinaba: for (j = 1 << (k - 1); i & j; j >>= 1) 5128eecc9f 2011-02-23 kinaba: i ^= j; 5128eecc9f 2011-02-23 kinaba: i ^= j; 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* backup over finished tables */ 5128eecc9f 2011-02-23 kinaba: mask = (1 << w) - 1; /* needed on HP, cc -O bug */ 5128eecc9f 2011-02-23 kinaba: while ((i & mask) != x[h]) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: h--; /* don't need to update q */ 5128eecc9f 2011-02-23 kinaba: w -= l; 5128eecc9f 2011-02-23 kinaba: mask = (1 << w) - 1; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* Return Z_BUF_ERROR if we were given an incomplete table */ 5128eecc9f 2011-02-23 kinaba: return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: int inflate_trees_bits(c, bb, tb, hp, z) 5128eecc9f 2011-02-23 kinaba: uIntf *c; /* 19 code lengths */ 5128eecc9f 2011-02-23 kinaba: uIntf *bb; /* bits tree desired/actual depth */ 5128eecc9f 2011-02-23 kinaba: inflate_huft * FAR *tb; /* bits tree result */ 5128eecc9f 2011-02-23 kinaba: inflate_huft *hp; /* space for trees */ 5128eecc9f 2011-02-23 kinaba: z_streamp z; /* for messages */ 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: int r; 5128eecc9f 2011-02-23 kinaba: uInt hn = 0; /* hufts used in space */ 5128eecc9f 2011-02-23 kinaba: uIntf *v; /* work area for huft_build */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: if ((v = (uIntf*)ZALLOC(z, 19, sizeof(uInt))) == Z_NULL) 5128eecc9f 2011-02-23 kinaba: return Z_MEM_ERROR; 5128eecc9f 2011-02-23 kinaba: r = huft_build(c, 19, 19, (uIntf*)Z_NULL, (uIntf*)Z_NULL, 5128eecc9f 2011-02-23 kinaba: tb, bb, hp, &hn, v); 5128eecc9f 2011-02-23 kinaba: if (r == Z_DATA_ERROR) 5128eecc9f 2011-02-23 kinaba: z->msg = (char*)"oversubscribed dynamic bit lengths tree"; 5128eecc9f 2011-02-23 kinaba: else if (r == Z_BUF_ERROR || *bb == 0) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: z->msg = (char*)"incomplete dynamic bit lengths tree"; 5128eecc9f 2011-02-23 kinaba: r = Z_DATA_ERROR; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: ZFREE(z, v); 5128eecc9f 2011-02-23 kinaba: return r; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: int inflate_trees_dynamic(nl, nd, c, bl, bd, tl, td, hp, z) 5128eecc9f 2011-02-23 kinaba: uInt nl; /* number of literal/length codes */ 5128eecc9f 2011-02-23 kinaba: uInt nd; /* number of distance codes */ 5128eecc9f 2011-02-23 kinaba: uIntf *c; /* that many (total) code lengths */ 5128eecc9f 2011-02-23 kinaba: uIntf *bl; /* literal desired/actual bit depth */ 5128eecc9f 2011-02-23 kinaba: uIntf *bd; /* distance desired/actual bit depth */ 5128eecc9f 2011-02-23 kinaba: inflate_huft * FAR *tl; /* literal/length tree result */ 5128eecc9f 2011-02-23 kinaba: inflate_huft * FAR *td; /* distance tree result */ 5128eecc9f 2011-02-23 kinaba: inflate_huft *hp; /* space for trees */ 5128eecc9f 2011-02-23 kinaba: z_streamp z; /* for messages */ 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: int r; 5128eecc9f 2011-02-23 kinaba: uInt hn = 0; /* hufts used in space */ 5128eecc9f 2011-02-23 kinaba: uIntf *v; /* work area for huft_build */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* allocate work area */ 5128eecc9f 2011-02-23 kinaba: if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL) 5128eecc9f 2011-02-23 kinaba: return Z_MEM_ERROR; 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* build literal/length tree */ 5128eecc9f 2011-02-23 kinaba: r = huft_build(c, nl, 257, cplens, cplext, tl, bl, hp, &hn, v); 5128eecc9f 2011-02-23 kinaba: if (r != Z_OK || *bl == 0) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: if (r == Z_DATA_ERROR) 5128eecc9f 2011-02-23 kinaba: z->msg = (char*)"oversubscribed literal/length tree"; 5128eecc9f 2011-02-23 kinaba: else if (r != Z_MEM_ERROR) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: z->msg = (char*)"incomplete literal/length tree"; 5128eecc9f 2011-02-23 kinaba: r = Z_DATA_ERROR; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: ZFREE(z, v); 5128eecc9f 2011-02-23 kinaba: return r; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* build distance tree */ 5128eecc9f 2011-02-23 kinaba: r = huft_build(c + nl, nd, 0, cpdist, cpdext, td, bd, hp, &hn, v); 5128eecc9f 2011-02-23 kinaba: if (r != Z_OK || (*bd == 0 && nl > 257)) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: if (r == Z_DATA_ERROR) 5128eecc9f 2011-02-23 kinaba: z->msg = (char*)"oversubscribed distance tree"; 5128eecc9f 2011-02-23 kinaba: else if (r == Z_BUF_ERROR) { 5128eecc9f 2011-02-23 kinaba: #ifdef PKZIP_BUG_WORKAROUND 5128eecc9f 2011-02-23 kinaba: r = Z_OK; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: #else 5128eecc9f 2011-02-23 kinaba: z->msg = (char*)"incomplete distance tree"; 5128eecc9f 2011-02-23 kinaba: r = Z_DATA_ERROR; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: else if (r != Z_MEM_ERROR) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: z->msg = (char*)"empty distance tree with lengths"; 5128eecc9f 2011-02-23 kinaba: r = Z_DATA_ERROR; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: ZFREE(z, v); 5128eecc9f 2011-02-23 kinaba: return r; 5128eecc9f 2011-02-23 kinaba: #endif 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* done */ 5128eecc9f 2011-02-23 kinaba: ZFREE(z, v); 5128eecc9f 2011-02-23 kinaba: return Z_OK; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* build fixed tables only once--keep them here */ 5128eecc9f 2011-02-23 kinaba: #ifdef BUILDFIXED 5128eecc9f 2011-02-23 kinaba: local int fixed_built = 0; 5128eecc9f 2011-02-23 kinaba: #define FIXEDH 544 /* number of hufts used by fixed tables */ 5128eecc9f 2011-02-23 kinaba: local inflate_huft fixed_mem[FIXEDH]; 5128eecc9f 2011-02-23 kinaba: local uInt fixed_bl; 5128eecc9f 2011-02-23 kinaba: local uInt fixed_bd; 5128eecc9f 2011-02-23 kinaba: local inflate_huft *fixed_tl; 5128eecc9f 2011-02-23 kinaba: local inflate_huft *fixed_td; 5128eecc9f 2011-02-23 kinaba: #else 5128eecc9f 2011-02-23 kinaba: #include "inffixed.h" 5128eecc9f 2011-02-23 kinaba: #endif 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: int inflate_trees_fixed(bl, bd, tl, td, z) 5128eecc9f 2011-02-23 kinaba: uIntf *bl; /* literal desired/actual bit depth */ 5128eecc9f 2011-02-23 kinaba: uIntf *bd; /* distance desired/actual bit depth */ 5128eecc9f 2011-02-23 kinaba: inflate_huft * FAR *tl; /* literal/length tree result */ 5128eecc9f 2011-02-23 kinaba: inflate_huft * FAR *td; /* distance tree result */ 5128eecc9f 2011-02-23 kinaba: z_streamp z; /* for memory allocation */ 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: #ifdef BUILDFIXED 5128eecc9f 2011-02-23 kinaba: /* build fixed tables if not already */ 5128eecc9f 2011-02-23 kinaba: if (!fixed_built) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: int k; /* temporary variable */ 5128eecc9f 2011-02-23 kinaba: uInt f = 0; /* number of hufts used in fixed_mem */ 5128eecc9f 2011-02-23 kinaba: uIntf *c; /* length list for huft_build */ 5128eecc9f 2011-02-23 kinaba: uIntf *v; /* work area for huft_build */ 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* allocate memory */ 5128eecc9f 2011-02-23 kinaba: if ((c = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL) 5128eecc9f 2011-02-23 kinaba: return Z_MEM_ERROR; 5128eecc9f 2011-02-23 kinaba: if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL) 5128eecc9f 2011-02-23 kinaba: { 5128eecc9f 2011-02-23 kinaba: ZFREE(z, c); 5128eecc9f 2011-02-23 kinaba: return Z_MEM_ERROR; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* literal table */ 5128eecc9f 2011-02-23 kinaba: for (k = 0; k < 144; k++) 5128eecc9f 2011-02-23 kinaba: c[k] = 8; 5128eecc9f 2011-02-23 kinaba: for (; k < 256; k++) 5128eecc9f 2011-02-23 kinaba: c[k] = 9; 5128eecc9f 2011-02-23 kinaba: for (; k < 280; k++) 5128eecc9f 2011-02-23 kinaba: c[k] = 7; 5128eecc9f 2011-02-23 kinaba: for (; k < 288; k++) 5128eecc9f 2011-02-23 kinaba: c[k] = 8; 5128eecc9f 2011-02-23 kinaba: fixed_bl = 9; 5128eecc9f 2011-02-23 kinaba: huft_build(c, 288, 257, cplens, cplext, &fixed_tl, &fixed_bl, 5128eecc9f 2011-02-23 kinaba: fixed_mem, &f, v); 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* distance table */ 5128eecc9f 2011-02-23 kinaba: for (k = 0; k < 30; k++) 5128eecc9f 2011-02-23 kinaba: c[k] = 5; 5128eecc9f 2011-02-23 kinaba: fixed_bd = 5; 5128eecc9f 2011-02-23 kinaba: huft_build(c, 30, 0, cpdist, cpdext, &fixed_td, &fixed_bd, 5128eecc9f 2011-02-23 kinaba: fixed_mem, &f, v); 5128eecc9f 2011-02-23 kinaba: 5128eecc9f 2011-02-23 kinaba: /* done */ 5128eecc9f 2011-02-23 kinaba: ZFREE(z, v); 5128eecc9f 2011-02-23 kinaba: ZFREE(z, c); 5128eecc9f 2011-02-23 kinaba: fixed_built = 1; 5128eecc9f 2011-02-23 kinaba: } 5128eecc9f 2011-02-23 kinaba: #endif 5128eecc9f 2011-02-23 kinaba: *bl = fixed_bl; 5128eecc9f 2011-02-23 kinaba: *bd = fixed_bd; 5128eecc9f 2011-02-23 kinaba: *tl = fixed_tl; 5128eecc9f 2011-02-23 kinaba: *td = fixed_td; 5128eecc9f 2011-02-23 kinaba: return Z_OK; 5128eecc9f 2011-02-23 kinaba: }