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