diff options
Diffstat (limited to 'inftrees.h')
| -rw-r--r-- | inftrees.h | 46 |
1 files changed, 26 insertions, 20 deletions
| @@ -16,12 +16,18 @@ | |||
| 16 | indicates an unused code. If a code with exop == -128 is looked up, | 16 | indicates an unused code. If a code with exop == -128 is looked up, |
| 17 | this implies an error in the data. */ | 17 | this implies an error in the data. */ |
| 18 | 18 | ||
| 19 | #if defined(STDC) || defined(sgi) | ||
| 20 | typedef signed char Char; | ||
| 21 | #else | ||
| 22 | typedef char Char; /* just hope that char is signed */ | ||
| 23 | #endif | ||
| 24 | |||
| 19 | typedef struct inflate_huft_s inflate_huft; | 25 | typedef struct inflate_huft_s inflate_huft; |
| 20 | struct inflate_huft_s { | 26 | struct inflate_huft_s { |
| 21 | union { | 27 | union { |
| 22 | struct { | 28 | struct { |
| 23 | char Exop; /* number of extra bits or operation */ | 29 | Char Exop; /* number of extra bits or operation */ |
| 24 | char Bits; /* number of bits in this code or subcode */ | 30 | Byte Bits; /* number of bits in this code or subcode */ |
| 25 | } what; | 31 | } what; |
| 26 | Byte *pad; /* pad structure to a power of 2 (4 bytes for */ | 32 | Byte *pad; /* pad structure to a power of 2 (4 bytes for */ |
| 27 | } word; /* 16-bit, 8 bytes for 32-bit machines) */ | 33 | } word; /* 16-bit, 8 bytes for 32-bit machines) */ |
| @@ -36,27 +42,27 @@ struct inflate_huft_s { | |||
| 36 | #endif | 42 | #endif |
| 37 | 43 | ||
| 38 | extern int inflate_trees_bits __P(( | 44 | extern int inflate_trees_bits __P(( |
| 39 | uInt *, /* 19 code lengths */ | 45 | uInt *, /* 19 code lengths */ |
| 40 | uInt *, /* bits tree desired/actual depth */ | 46 | uInt *, /* bits tree desired/actual depth */ |
| 41 | inflate_huft **, /* bits tree result */ | 47 | inflate_huft **, /* bits tree result */ |
| 42 | z_stream *)); /* for zalloc, zfree functions */ | 48 | z_stream *)); /* for zalloc, zfree functions */ |
| 43 | 49 | ||
| 44 | extern int inflate_trees_dynamic __P(( | 50 | extern int inflate_trees_dynamic __P(( |
| 45 | uInt, /* number of literal/length codes */ | 51 | uInt, /* number of literal/length codes */ |
| 46 | uInt, /* number of distance codes */ | 52 | uInt, /* number of distance codes */ |
| 47 | uInt *, /* that many (total) code lengths */ | 53 | uInt *, /* that many (total) code lengths */ |
| 48 | uInt *, /* literal desired/actual bit depth */ | 54 | uInt *, /* literal desired/actual bit depth */ |
| 49 | uInt *, /* distance desired/actual bit depth */ | 55 | uInt *, /* distance desired/actual bit depth */ |
| 50 | inflate_huft **, /* literal/length tree result */ | 56 | inflate_huft **, /* literal/length tree result */ |
| 51 | inflate_huft **, /* distance tree result */ | 57 | inflate_huft **, /* distance tree result */ |
| 52 | z_stream *)); /* for zalloc, zfree functions */ | 58 | z_stream *)); /* for zalloc, zfree functions */ |
| 53 | 59 | ||
| 54 | extern int inflate_trees_fixed __P(( | 60 | extern int inflate_trees_fixed __P(( |
| 55 | uInt *, /* literal desired/actual bit depth */ | 61 | uInt *, /* literal desired/actual bit depth */ |
| 56 | uInt *, /* distance desired/actual bit depth */ | 62 | uInt *, /* distance desired/actual bit depth */ |
| 57 | inflate_huft **, /* literal/length tree result */ | 63 | inflate_huft **, /* literal/length tree result */ |
| 58 | inflate_huft **)); /* distance tree result */ | 64 | inflate_huft **)); /* distance tree result */ |
| 59 | 65 | ||
| 60 | extern int inflate_trees_free __P(( | 66 | extern int inflate_trees_free __P(( |
| 61 | inflate_huft *, /* tables to free */ | 67 | inflate_huft *, /* tables to free */ |
| 62 | z_stream *)); /* for zfree function */ | 68 | z_stream *)); /* for zfree function */ |