|
sl@0
|
1 |
/* inftrees.h -- header to use inftrees.c
|
|
sl@0
|
2 |
* Copyright (C) 1995-1998 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 |
/* Huffman code lookup table entry--this entry is four bytes for machines
|
|
sl@0
|
12 |
that have 16-bit pointers (e.g. PC's in the small or medium model). */
|
|
sl@0
|
13 |
|
|
sl@0
|
14 |
typedef struct inflate_huft_s FAR inflate_huft;
|
|
sl@0
|
15 |
|
|
sl@0
|
16 |
struct inflate_huft_s {
|
|
sl@0
|
17 |
union {
|
|
sl@0
|
18 |
struct {
|
|
sl@0
|
19 |
Byte Exop; /* number of extra bits or operation */
|
|
sl@0
|
20 |
Byte Bits; /* number of bits in this code or subcode */
|
|
sl@0
|
21 |
} what;
|
|
sl@0
|
22 |
uInt pad; /* pad structure to a power of 2 (4 bytes for */
|
|
sl@0
|
23 |
} word; /* 16-bit, 8 bytes for 32-bit int's) */
|
|
sl@0
|
24 |
uInt base; /* literal, length base, distance base,
|
|
sl@0
|
25 |
or table offset */
|
|
sl@0
|
26 |
};
|
|
sl@0
|
27 |
|
|
sl@0
|
28 |
/* Maximum size of dynamic tree. The maximum found in a long but non-
|
|
sl@0
|
29 |
exhaustive search was 1004 huft structures (850 for length/literals
|
|
sl@0
|
30 |
and 154 for distances, the latter actually the result of an
|
|
sl@0
|
31 |
exhaustive search). The actual maximum is not known, but the
|
|
sl@0
|
32 |
value below is more than safe. */
|
|
sl@0
|
33 |
#define MANY 1440
|
|
sl@0
|
34 |
|
|
sl@0
|
35 |
extern int inflate_trees_bits OF((
|
|
sl@0
|
36 |
uIntf *, /* 19 code lengths */
|
|
sl@0
|
37 |
uIntf *, /* bits tree desired/actual depth */
|
|
sl@0
|
38 |
inflate_huft * FAR *, /* bits tree result */
|
|
sl@0
|
39 |
inflate_huft *, /* space for trees */
|
|
sl@0
|
40 |
z_streamp)); /* for messages */
|
|
sl@0
|
41 |
|
|
sl@0
|
42 |
extern int inflate_trees_dynamic OF((
|
|
sl@0
|
43 |
uInt, /* number of literal/length codes */
|
|
sl@0
|
44 |
uInt, /* number of distance codes */
|
|
sl@0
|
45 |
uIntf *, /* that many (total) code lengths */
|
|
sl@0
|
46 |
uIntf *, /* literal desired/actual bit depth */
|
|
sl@0
|
47 |
uIntf *, /* distance desired/actual bit depth */
|
|
sl@0
|
48 |
inflate_huft * FAR *, /* literal/length tree result */
|
|
sl@0
|
49 |
inflate_huft * FAR *, /* distance tree result */
|
|
sl@0
|
50 |
inflate_huft *, /* space for trees */
|
|
sl@0
|
51 |
z_streamp)); /* for messages */
|
|
sl@0
|
52 |
|
|
sl@0
|
53 |
extern int inflate_trees_fixed OF((
|
|
sl@0
|
54 |
uIntf *, /* literal desired/actual bit depth */
|
|
sl@0
|
55 |
uIntf *, /* distance desired/actual bit depth */
|
|
sl@0
|
56 |
const inflate_huft * FAR *, /* literal/length tree result */
|
|
sl@0
|
57 |
const inflate_huft * FAR *, /* distance tree result */
|
|
sl@0
|
58 |
z_streamp)); /* for memory allocation */
|