sl@0: /* inftrees.h -- header to use inftrees.c
sl@0:  * Copyright (C) 1995-1998 Mark Adler
sl@0:  * For conditions of distribution and use, see copyright notice in zlib.h 
sl@0:  */
sl@0: 
sl@0: /* WARNING: this file should *not* be used by applications. It is
sl@0:    part of the implementation of the compression library and is
sl@0:    subject to change. Applications should only use zlib.h.
sl@0:  */
sl@0: 
sl@0: /* Huffman code lookup table entry--this entry is four bytes for machines
sl@0:    that have 16-bit pointers (e.g. PC's in the small or medium model). */
sl@0: 
sl@0: typedef struct inflate_huft_s FAR inflate_huft;
sl@0: 
sl@0: struct inflate_huft_s {
sl@0:   union {
sl@0:     struct {
sl@0:       Byte Exop;        /* number of extra bits or operation */
sl@0:       Byte Bits;        /* number of bits in this code or subcode */
sl@0:     } what;
sl@0:     uInt pad;           /* pad structure to a power of 2 (4 bytes for */
sl@0:   } word;               /*  16-bit, 8 bytes for 32-bit int's) */
sl@0:   uInt base;            /* literal, length base, distance base,
sl@0:                            or table offset */
sl@0: };
sl@0: 
sl@0: /* Maximum size of dynamic tree.  The maximum found in a long but non-
sl@0:    exhaustive search was 1004 huft structures (850 for length/literals
sl@0:    and 154 for distances, the latter actually the result of an
sl@0:    exhaustive search).  The actual maximum is not known, but the
sl@0:    value below is more than safe. */
sl@0: #define MANY 1440
sl@0: 
sl@0: extern int inflate_trees_bits OF((
sl@0:     uIntf *,                    /* 19 code lengths */
sl@0:     uIntf *,                    /* bits tree desired/actual depth */
sl@0:     inflate_huft * FAR *,       /* bits tree result */
sl@0:     inflate_huft *,             /* space for trees */
sl@0:     z_streamp));                /* for messages */
sl@0: 
sl@0: extern int inflate_trees_dynamic OF((
sl@0:     uInt,                       /* number of literal/length codes */
sl@0:     uInt,                       /* number of distance codes */
sl@0:     uIntf *,                    /* that many (total) code lengths */
sl@0:     uIntf *,                    /* literal desired/actual bit depth */
sl@0:     uIntf *,                    /* distance desired/actual bit depth */
sl@0:     inflate_huft * FAR *,       /* literal/length tree result */
sl@0:     inflate_huft * FAR *,       /* distance tree result */
sl@0:     inflate_huft *,             /* space for trees */
sl@0:     z_streamp));                /* for messages */
sl@0: 
sl@0: extern int inflate_trees_fixed OF((
sl@0:     uIntf *,                    /* literal desired/actual bit depth */
sl@0:     uIntf *,                    /* distance desired/actual bit depth */
sl@0:     const inflate_huft * FAR *,       /* literal/length tree result */
sl@0:     const inflate_huft * FAR *,       /* distance tree result */
sl@0:     z_streamp));                /* for memory allocation */