1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/os/ossrv/compressionlibs/ziplib/test/oldezlib/EZLib/inftrees.h	Fri Jun 15 03:10:57 2012 +0200
     1.3 @@ -0,0 +1,58 @@
     1.4 +/* inftrees.h -- header to use inftrees.c
     1.5 + * Copyright (C) 1995-1998 Mark Adler
     1.6 + * For conditions of distribution and use, see copyright notice in zlib.h 
     1.7 + */
     1.8 +
     1.9 +/* WARNING: this file should *not* be used by applications. It is
    1.10 +   part of the implementation of the compression library and is
    1.11 +   subject to change. Applications should only use zlib.h.
    1.12 + */
    1.13 +
    1.14 +/* Huffman code lookup table entry--this entry is four bytes for machines
    1.15 +   that have 16-bit pointers (e.g. PC's in the small or medium model). */
    1.16 +
    1.17 +typedef struct inflate_huft_s FAR inflate_huft;
    1.18 +
    1.19 +struct inflate_huft_s {
    1.20 +  union {
    1.21 +    struct {
    1.22 +      Byte Exop;        /* number of extra bits or operation */
    1.23 +      Byte Bits;        /* number of bits in this code or subcode */
    1.24 +    } what;
    1.25 +    uInt pad;           /* pad structure to a power of 2 (4 bytes for */
    1.26 +  } word;               /*  16-bit, 8 bytes for 32-bit int's) */
    1.27 +  uInt base;            /* literal, length base, distance base,
    1.28 +                           or table offset */
    1.29 +};
    1.30 +
    1.31 +/* Maximum size of dynamic tree.  The maximum found in a long but non-
    1.32 +   exhaustive search was 1004 huft structures (850 for length/literals
    1.33 +   and 154 for distances, the latter actually the result of an
    1.34 +   exhaustive search).  The actual maximum is not known, but the
    1.35 +   value below is more than safe. */
    1.36 +#define MANY 1440
    1.37 +
    1.38 +extern int inflate_trees_bits OF((
    1.39 +    uIntf *,                    /* 19 code lengths */
    1.40 +    uIntf *,                    /* bits tree desired/actual depth */
    1.41 +    inflate_huft * FAR *,       /* bits tree result */
    1.42 +    inflate_huft *,             /* space for trees */
    1.43 +    z_streamp));                /* for messages */
    1.44 +
    1.45 +extern int inflate_trees_dynamic OF((
    1.46 +    uInt,                       /* number of literal/length codes */
    1.47 +    uInt,                       /* number of distance codes */
    1.48 +    uIntf *,                    /* that many (total) code lengths */
    1.49 +    uIntf *,                    /* literal desired/actual bit depth */
    1.50 +    uIntf *,                    /* distance desired/actual bit depth */
    1.51 +    inflate_huft * FAR *,       /* literal/length tree result */
    1.52 +    inflate_huft * FAR *,       /* distance tree result */
    1.53 +    inflate_huft *,             /* space for trees */
    1.54 +    z_streamp));                /* for messages */
    1.55 +
    1.56 +extern int inflate_trees_fixed OF((
    1.57 +    uIntf *,                    /* literal desired/actual bit depth */
    1.58 +    uIntf *,                    /* distance desired/actual bit depth */
    1.59 +    const inflate_huft * FAR *,       /* literal/length tree result */
    1.60 +    const inflate_huft * FAR *,       /* distance tree result */
    1.61 +    z_streamp));                /* for memory allocation */