www.pudn.com > 200410111032011273DESMD5ZLIB算法源代码.rar > Inftrees.h

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