|
sl@0
|
1 |
/* inftrees.h -- header to use inftrees.c
|
|
sl@0
|
2 |
* Copyright (C) 1995-2005 Mark Adler
|
|
sl@0
|
3 |
* For conditions of distribution and use, see copyright notice in zlib.h
|
|
sl@0
|
4 |
*/
|
|
sl@0
|
5 |
|
|
sl@0
|
6 |
/* WARNING: this file should *not* be used by applications. It is
|
|
sl@0
|
7 |
part of the implementation of the compression library and is
|
|
sl@0
|
8 |
subject to change. Applications should only use zlib.h.
|
|
sl@0
|
9 |
*/
|
|
sl@0
|
10 |
|
|
sl@0
|
11 |
/* Structure for decoding tables. Each entry provides either the
|
|
sl@0
|
12 |
information needed to do the operation requested by the code that
|
|
sl@0
|
13 |
indexed that table entry, or it provides a pointer to another
|
|
sl@0
|
14 |
table that indexes more bits of the code. op indicates whether
|
|
sl@0
|
15 |
the entry is a pointer to another table, a literal, a length or
|
|
sl@0
|
16 |
distance, an end-of-block, or an invalid code. For a table
|
|
sl@0
|
17 |
pointer, the low four bits of op is the number of index bits of
|
|
sl@0
|
18 |
that table. For a length or distance, the low four bits of op
|
|
sl@0
|
19 |
is the number of extra bits to get after the code. bits is
|
|
sl@0
|
20 |
the number of bits in this code or part of the code to drop off
|
|
sl@0
|
21 |
of the bit buffer. val is the actual byte to output in the case
|
|
sl@0
|
22 |
of a literal, the base length or distance, or the offset from
|
|
sl@0
|
23 |
the current table to the next table. Each entry is four bytes. */
|
|
sl@0
|
24 |
typedef struct {
|
|
sl@0
|
25 |
unsigned char op; /* operation, extra bits, table bits */
|
|
sl@0
|
26 |
unsigned char bits; /* bits in this part of the code */
|
|
sl@0
|
27 |
unsigned short val; /* offset in table or code value */
|
|
sl@0
|
28 |
} code;
|
|
sl@0
|
29 |
|
|
sl@0
|
30 |
/* op values as set by inflate_table():
|
|
sl@0
|
31 |
00000000 - literal
|
|
sl@0
|
32 |
0000tttt - table link, tttt != 0 is the number of table index bits
|
|
sl@0
|
33 |
0001eeee - length or distance, eeee is the number of extra bits
|
|
sl@0
|
34 |
01100000 - end of block
|
|
sl@0
|
35 |
01000000 - invalid code
|
|
sl@0
|
36 |
*/
|
|
sl@0
|
37 |
|
|
sl@0
|
38 |
/* Maximum size of dynamic tree. The maximum found in a long but non-
|
|
sl@0
|
39 |
exhaustive search was 1444 code structures (852 for length/literals
|
|
sl@0
|
40 |
and 592 for distances, the latter actually the result of an
|
|
sl@0
|
41 |
exhaustive search). The true maximum is not known, but the value
|
|
sl@0
|
42 |
below is more than safe. */
|
|
sl@0
|
43 |
#define ENOUGH 2048
|
|
sl@0
|
44 |
#define MAXD 592
|
|
sl@0
|
45 |
|
|
sl@0
|
46 |
/* Type of code to build for inftable() */
|
|
sl@0
|
47 |
typedef enum {
|
|
sl@0
|
48 |
CODES,
|
|
sl@0
|
49 |
LENS,
|
|
sl@0
|
50 |
DISTS
|
|
sl@0
|
51 |
} codetype;
|
|
sl@0
|
52 |
|
|
sl@0
|
53 |
extern int inflate_table OF((codetype type, unsigned short FAR *lens,
|
|
sl@0
|
54 |
unsigned codes, code FAR * FAR *table,
|
|
sl@0
|
55 |
unsigned FAR *bits, unsigned short FAR *work));
|