| inftrees.h (17651) | inftrees.h (33904) |
|---|---|
| 1/* inftrees.h -- header to use inftrees.c | 1/* inftrees.h -- header to use inftrees.c |
| 2 * Copyright (C) 1995-1996 Mark Adler | 2 * Copyright (C) 1995-1998 Mark Adler |
| 3 * For conditions of distribution and use, see copyright notice in zlib.h 4 */ 5 6/* WARNING: this file should *not* be used by applications. It is 7 part of the implementation of the compression library and is 8 subject to change. Applications should only use zlib.h. 9 */ 10 --- 11 unchanged lines hidden (view full) --- 22 Bytef *pad; /* pad structure to a power of 2 (4 bytes for */ 23 } word; /* 16-bit, 8 bytes for 32-bit machines) */ 24 union { 25 uInt Base; /* literal, length base, or distance base */ 26 inflate_huft *Next; /* pointer to next level of table */ 27 } more; 28}; 29 | 3 * For conditions of distribution and use, see copyright notice in zlib.h 4 */ 5 6/* WARNING: this file should *not* be used by applications. It is 7 part of the implementation of the compression library and is 8 subject to change. Applications should only use zlib.h. 9 */ 10 --- 11 unchanged lines hidden (view full) --- 22 Bytef *pad; /* pad structure to a power of 2 (4 bytes for */ 23 } word; /* 16-bit, 8 bytes for 32-bit machines) */ 24 union { 25 uInt Base; /* literal, length base, or distance base */ 26 inflate_huft *Next; /* pointer to next level of table */ 27 } more; 28}; 29 |
| 30#ifdef DEBUG 31 extern uInt inflate_hufts; 32#endif | 30/* Maximum size of dynamic tree. The maximum found in a long but non- 31 exhaustive search was 1041 huft structures (875 for length/literals 32 and 166 for distances, the latter actually the result of an 33 exhaustive search). The actual maximum is not known, but the 34 value below is more than safe. */ 35#define MANY 1440 |
| 33 34extern int inflate_trees_bits OF(( 35 uIntf *, /* 19 code lengths */ 36 uIntf *, /* bits tree desired/actual depth */ 37 inflate_huft * FAR *, /* bits tree result */ | 36 37extern int inflate_trees_bits OF(( 38 uIntf *, /* 19 code lengths */ 39 uIntf *, /* bits tree desired/actual depth */ 40 inflate_huft * FAR *, /* bits tree result */ |
| 38 z_streamp )); /* for zalloc, zfree functions */ | 41 inflate_huft *, /* space for trees */ 42 z_streamp)); /* for messages */ |
| 39 40extern int inflate_trees_dynamic OF(( 41 uInt, /* number of literal/length codes */ 42 uInt, /* number of distance codes */ 43 uIntf *, /* that many (total) code lengths */ 44 uIntf *, /* literal desired/actual bit depth */ 45 uIntf *, /* distance desired/actual bit depth */ 46 inflate_huft * FAR *, /* literal/length tree result */ 47 inflate_huft * FAR *, /* distance tree result */ | 43 44extern int inflate_trees_dynamic OF(( 45 uInt, /* number of literal/length codes */ 46 uInt, /* number of distance codes */ 47 uIntf *, /* that many (total) code lengths */ 48 uIntf *, /* literal desired/actual bit depth */ 49 uIntf *, /* distance desired/actual bit depth */ 50 inflate_huft * FAR *, /* literal/length tree result */ 51 inflate_huft * FAR *, /* distance tree result */ |
| 48 z_streamp )); /* for zalloc, zfree functions */ | 52 inflate_huft *, /* space for trees */ 53 z_streamp)); /* for messages */ |
| 49 50extern int inflate_trees_fixed OF(( 51 uIntf *, /* literal desired/actual bit depth */ 52 uIntf *, /* distance desired/actual bit depth */ 53 inflate_huft * FAR *, /* literal/length tree result */ | 54 55extern int inflate_trees_fixed OF(( 56 uIntf *, /* literal desired/actual bit depth */ 57 uIntf *, /* distance desired/actual bit depth */ 58 inflate_huft * FAR *, /* literal/length tree result */ |
| 54 inflate_huft * FAR *)); /* distance tree result */ 55 56extern int inflate_trees_free OF(( 57 inflate_huft *, /* tables to free */ 58 z_streamp )); /* for zfree function */ 59 | 59 inflate_huft * FAR *, /* distance tree result */ 60 z_streamp)); /* for memory allocation */ |