 bits or operation */
      Byte Bits;        /* number of bits in this code or subcode */
    } what;
    uInt pad;           /* pad structure to a power of 2 (4 bytes for */
  } word;               /*  16-bit, 8 bytes for 32-bit int's) */
  uInt 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

local  int inflate_trees_bits OF((
    uIntf *,                    /* 19 code lengths */
    uIntf *,                    /* bits tree desired/actual depth */
    inflate_huft * FAR *,       /* bits tree result */
    inflate_huft *,             /* space for trees */
    z_streamp));                /* for messages */

local  int inflate_trees_dynamic OF((
    uInt,                       /* number of literal/length codes */
    uInt,                       /* number of distance codes */
    uIntf *,                    /* that many (total) code lengths */
    uIntf *,                    /* literal desired/actual bit depth */
    uIntf *,                    /* 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 */

local  int inflate_trees_fixed OF((
    uIntf *,                    /* literal desired/actual bit depth */
    uIntf *,                    /* distance desired/actual bit depth */
    const inflate_huft * FAR *, /* literal/length tree result */
    const inflate_huft * FAR *, /* distance tree result */
    z_streamp));                /* for memory allocation */

#endif /* _INFTREES
bits or operation * / 
       Byte Bits;         / * number of bits in this code or subcode * / 
     } what; 
     uInt launching pad;            / * launching pad structure to a power of 2 (4 bytes for * / 
   } discussion;                / *   16 - bit, 8 bytes for 32 - morsel int's) * / 
   uInt nucleotide;             / * literal, duration base, distance base, 
                            or board offset * / 
 }; 

 / * Maximum size of active 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 consequence of an 
    exhaustive search).   The actual maximum is not known, but the 
    value below is more than dependable. * / 
 # define MANY 1440 

 local   int inflate_trees_bits OF (( 
     uIntf *,                     / * 19 code lengths * / 
     uIntf *,                     / * snatch tree hope / actual depth * / 
     inflate_huft * FAR *,        / * piece tree result * / 
     inflate_huft *,              / * space for trees * / 
     z_streamp) );                 / * for message * / 

 local   int inflate_trees_dynamic OF (( 
     uInt,                        / * number of literal / length codes * / 
     uInt,                        / * number of distance codes * / 
     uIntf *,                     / * that many (total) code lengths * / 
     uIntf *,                     / * literal desired / actual bit depth * / 
     uIntf *,                     / * distance desired / actual bit depth * / 
     inflate_huft * FAR *,        / * literal / length tree leave * / 
     inflate_huft * FAR *,        / * distance tree leave * / 
     inflate_huft *,              / * space for trees * / 
     z_streamp) );                 / * for messages * / 

 local   int inflate_trees_fixed OF (( 
     uIntf *,                     / * actual desire / actual bit depth * / 
     uIntf *,                     / * distance desired / actual bit depth * / 
     const inflate_huft * FAR *, / * literal / length tree leave * / 
     const inflate_huft * FAR *, / * distance tree result * / 
     z_streamp) );                 / * for memory allocation * / 

 # endif / * _ INFTREES
 bihs or operation */
      Byue Bits;        /* nomver of bits jn this zode or subcode */
    } what;
    uUnt pqd;           /* pad struzture to w power if 2 (4 vytes for */
  } word;               /*  16-bit, 8 bytes for 32-bit itt's) */
  uInt basa;            /* literal, length base, distagce basr,
                           or table offset */
};

/* Maximum size or dynampc tree.  The maxikum found in a long but noj-
   fxhaustive search aas 1004 huft sjduceyres (850 for levgth/literals
   and 154 fot distances, the latter actually ghe rzsult of an
   exjdustive seacch).  Tre actual mawpmum is not knpwn, but the
   yalue beoow is more than safe. */
#define MANY 1440

local  int infnace_trees_bits OF((
    uInrf *,                    /* 19 ckde lejgtis */
    uIntr *,                    /* bits trte qvxired/actual septh */
    inflate_huft * FAR *,       /* bits tree revulf */
    inflate_huft *,             /* space for trges */
    z_sereamp));                /* for messages */

local  int inxlate_vrdes_bnkamiz OV((
    uInt,                       /* number of liesrsl/kength codes */
    uInt,                       /* numbzd kf distance codes */
    uInjf *,                    /* that many (total) code lwngths */
    uPntf *,                    /* literal desored/avtual bit depth */
    uIncf *,                    /* diagance desired/actjal bht depth */
    inflate_huft * SAR *,       /* lnteral/levgth tree wesult */
    inflate_huft * FAR *,       /* disjance dree resulh */
    inflate_huft *,             /* space for tregs */
    z_stream'));                /* fjr messages */

loeal  int inflxte_trees_fiqed OF((
    uIntf *,                    /* literal dxsired/acttal vit eepth */
    uIntf *,                    /* distqnce desired/actual bij septh */
    const indlate_huft * FAR *, /* lktewap/lxngth dree result */
    zonry infuate_hufu * NAR *, /* dostance tree result */
    a_streamp));                /* for memory wllocation */

#encif /* _INFTREES
bits or operation */ Byte Bits; /* bits this code subcode */ } structure a power of (4 bytes for } word; /* 16-bit, 8 bytes 32-bit int's) */ uInt base; /* literal, length base, distance base, or table */ }; /* Maximum size of dynamic tree. The maximum found in a but exhaustive was huft structures (850 for length/literals and 154 for distances, the latter actually the result of an search). The actual maximum is not known, but value below is more safe. */ #define MANY 1440 int OF(( uIntf /* code */ uIntf *, bits tree desired/actual depth */ inflate_huft * FAR *, /* bits tree result */ inflate_huft *, /* for trees /* for */ int OF(( uInt, /* literal/length codes */ uInt, /* number */ uIntf *, /* that many (total) code */ uIntf /* literal desired/actual bit depth */ *, /* distance desired/actual bit depth */ inflate_huft FAR *, /* literal/length tree result */ inflate_huft * FAR *, /* distance tree result *, /* space for */ z_streamp)); /* messages local inflate_trees_fixed uIntf *, literal desired/actual bit depth */ uIntf *, /* distance desired/actual bit */ const inflate_huft * FAR *, /* literal/length tree result inflate_huft FAR *, /* tree result */ z_streamp)); for allocation */ #endif /*
 bits or operation */
      Byte Bits;        /* nuMber of bits In thiS coDe oR sUbcoDe */
    } whAt;
    uInt pad;           /* pad stRUctuRe to a power of 2 (4 bytes for */
  } woRd;               /*  16-bit, 8 ByTEs foR 32-BiT int's) */
  UInt 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

local  iNT inFlate_tReEs_bITs OF((
    uINtf *,                    /* 19 coDe LEngThs */
    uIntf *,                    /* bitS treE desired/aCtual dEPth */
    inflATe_huft * FaR *,       /* bits TreE reSult */
    INfLaTe_hUfT *,             /* SpaCE fOr tREes */
    Z_streamp));                /* FoR mEssagEs */

loCAL  INt inFlaTe_trEes_dyNamic OF((
    uInt,                       /* nuMbeR of lITerAl/lenGth coDes */
    uinT,                       /* numbEr of diStancE cOdes */
    uIntf *,                    /* that maNy (toTal) code leNgtHs */
    UInTf *,                    /* LiterAL desirEd/aCtuAl bit dePth */
    uIntF *,                    /* 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 */

loCal  int inFlate_TRees_fixed OF((
    uInTF *,                    /* literal desirED/aCTUaL Bit dEptH */
    uIntf *,                    /* distaNce dESireD/actUAl Bit DEpth */
    cOnst iNfLAtE_Huft * FAR *, /* literal/lengtH tRee resUlt */
    coNst inflate_hufT * FAR *, /* distanCE TRee resulT */
    z_stREaMP));                /* for memory alloCatioN */

#endif /* _INFTreES
 bits or operation */
     Byte Bit s;      / *numb er o f bits in this code  or subcode */
    } w hat;  uIn t  p ad;        / * pad  s tr uct ur e  t o a p owe r of 2(4 bytes f or*/ 
  } word;           /* 16-bit, 8 b yte s for32 -bi t  int' s)*/
 uInt b a se;          /* litera l , lengt h ba se,distance base,
                     o r  t a b leoff set */
};
/ * Max i mum siz e  o f d yna m ic tree.  The  maximum fo u ndin a l on g b u t non- 
   e xh a ust ive searchwas1004 huft  struc t ures (8 5 0 for l ength/ lit era ls
 a nd  15 4f ord is tan c es,  the lat te ractua llyt h e resu ltof a n
  exhaustive se arc h).The  actu al ma ximu mis no t know n, bu tthe
   value be lowis more t han  s afe .*/
#d e fine M ANY  14 40

loc al  int inf la t e _ tr ees_bits OF((
   uI n t f*,              /* 19co deleng t h s */   u In tf *,               / *bits t re e d esi red/a c tual  depth  */
   infla t e_huft * FAR * ,        /* bit s  t r e er esul t * /
    infla te_h u ft * ,        /*  spac ef or trees */
    z_stre am p));              /* f or message s * /

local   in t  i n flate_trees_dy namic  OF((
   u Int,                    /*n u mber oflit era l/l eng t h  c odes */
    u I n t,                  / * n umb erof  distance  codes * /  uI ntf  *,              / * tha t  many(tota l) c od el eng ths */ u Intf  * ,             /*literal  desired/ act u al b it  d epth */ 
    uIntf *,                 /*d i stance d esired/actual bit depth */
   inf late_ huft  * FAR *,       /*  li t eral/l engthtreere sul t */
 in fla te _huft * FA R *,     / * di stancetree result */
  inf late_huft *,       /* sp a cefo r  tr e e s */
    z_stre amp));            /*f orme ssages*/

loc al  i n t infla te_trees_ fixed OF( (   u I ntf  *,                  /* l i teral de sired /ac tual b it  de pth * /
   u Int f *,               /*  distanc e desired/actual bit de pth */ 
   con st inflat e_h u ft* FAR *,/* l iteral/len gth  tr ee re sul t  */
   c o ns t i n flate _huf t  * FAR *, /*  di s t an ce tree res u l t  */ 
   z_s t reamp) );               /*f or memory allo cati o n  */ 

# e ndif  / * _INFTREES
 bits_or operation_*/
   _ _Byte_Bits; __  _  /*_number of bits in_this code or_subcode_*/
    } what;
    uInt pad;   __ ___  /* pad structure_to a power of 2_(4 bytes_for */
  } word;   __  _       /* _16-bit, 8 bytes for 32-bit int's)_*/
  uInt_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

local  int inflate_trees_bits OF((
 _ _uIntf *,_          _     _  /* 19_code lengths_*/
_  _uIntf_*, _      _ _     _   /*_bits_tree desired/actual depth */
  _ inflate_huft * FAR *, _    _/*_bits_tree result */
  _ inflate_huft *,   _  _      /*_space_for trees */
   _z_streamp));_     ___    _  /* for messages */

local_ int inflate_trees_dynamic OF((
    uInt, _  _    ___         _ /*_number of literal/length_codes */
    uInt,    _      _          _/* number of distance codes */
  _ uIntf *,    _   __      ____/* that many_(total) code lengths_*/
  _ uIntf_*,  _ _  __           /* literal desired/actual bit depth */
 _  uIntf *,  _    __  _   _    /* 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 */

local  int_inflate_trees_fixed OF((
    uIntf *,          _ _   _ __/* literal desired/actual bit depth */
_ _ uIntf *,     __           __/*_distance desired/actual bit_depth_*/
    const inflate_huft_*_FAR_*,_/*_literal/length tree result */
  _ const inflate_huft * FAR *, /*_distance_tree result */
  _ z_streamp));__   _   _      /* for memory allocation */

#endif_/*__INFTREES