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