Code Coverage: vinyl-cache/lib/libvgz/inftrees.h
 
82217aa4fc7094b3610340078afaf78cd95a8ec9
 
0
/* inftrees.h -- header to use inftrees.c
1
 * Copyright (C) 1995-2005, 2010 Mark Adler
2
 * For conditions of distribution and use, see copyright notice in zlib.h
3
 */
4
5
/* WARNING: this file should *not* be used by applications. It is
6
   part of the implementation of the compression library and is
7
   subject to change. Applications should only use zlib.h.
8
 */
9
10
/* Structure for decoding tables.  Each entry provides either the
11
   information needed to do the operation requested by the code that
12
   indexed that table entry, or it provides a pointer to another
13
   table that indexes more bits of the code.  op indicates whether
14
   the entry is a pointer to another table, a literal, a length or
15
   distance, an end-of-block, or an invalid code.  For a table
16
   pointer, the low four bits of op is the number of index bits of
17
   that table.  For a length or distance, the low four bits of op
18
   is the number of extra bits to get after the code.  bits is
19
   the number of bits in this code or part of the code to drop off
20
   of the bit buffer.  val is the actual byte to output in the case
21
   of a literal, the base length or distance, or the offset from
22
   the current table to the next table.  Each entry is four bytes. */
23
typedef struct {
24
    unsigned char op;           /* operation, extra bits, table bits */
25
    unsigned char bits;         /* bits in this part of the code */
26
    unsigned short val;         /* offset in table or code value */
27
} code;
28
29
/* op values as set by inflate_table():
30
    00000000 - literal
31
    0000tttt - table link, tttt != 0 is the number of table index bits
32
    0001eeee - length or distance, eeee is the number of extra bits
33
    01100000 - end of block
34
    01000000 - invalid code
35
 */
36
37
/* Maximum size of the dynamic table.  The maximum number of code structures is
38
   1444, which is the sum of 852 for literal/length codes and 592 for distance
39
   codes.  These values were found by exhaustive searches using the program
40
   examples/enough.c found in the zlib distribution.  The arguments to that
41
   program are the number of symbols, the initial root table size, and the
42
   maximum bit length of a code.  "enough 286 9 15" for literal/length codes
43
   returns 852, and "enough 30 6 15" for distance codes returns 592. The
44
   initial root table size (9 or 6) is found in the fifth argument of the
45
   inflate_table() calls in inflate.c and infback.c.  If the root table size is
46
   changed, then these maximum sizes would be need to be recalculated and
47
   updated. */
48 13489
#define ENOUGH_LENS 852
49 701
#define ENOUGH_DISTS 592
50
#define ENOUGH (ENOUGH_LENS+ENOUGH_DISTS)
51
52
/* Type of code to build for inflate_table() */
53
typedef enum {
54
    CODES,
55
    LENS,
56
    DISTS
57
} codetype;
58
59
int ZLIB_INTERNAL inflate_table (codetype type, unsigned short FAR *lens,
60
                             unsigned codes, code FAR * FAR *table,
61
                             unsigned FAR *bits, unsigned short FAR *work);