1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/compressionlibs/ziplib/test/oldezlib/EZLib/infutil.h Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,98 @@
1.4 +/* infutil.h -- types and macros common to blocks and codes
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 +#ifndef _INFUTIL_H
1.15 +#define _INFUTIL_H
1.16 +
1.17 +typedef enum {
1.18 + TYPE, /* get type bits (3, including end bit) */
1.19 + LENS, /* get lengths for stored */
1.20 + STORED, /* processing stored block */
1.21 + TABLE, /* get table lengths */
1.22 + BTREE, /* get bit lengths tree for a dynamic block */
1.23 + DTREE, /* get length, distance trees for a dynamic block */
1.24 + CODES, /* processing fixed or dynamic block */
1.25 + DRY, /* output remaining window bytes */
1.26 + DONE, /* finished last block, done */
1.27 + BAD} /* got a data error--stuck here */
1.28 +inflate_block_mode;
1.29 +
1.30 +/* inflate blocks semi-private state */
1.31 +struct inflate_blocks_state {
1.32 +
1.33 + /* mode */
1.34 + inflate_block_mode mode; /* current inflate_block mode */
1.35 +
1.36 + /* mode dependent information */
1.37 + union {
1.38 + uInt left; /* if STORED, bytes left to copy */
1.39 + struct {
1.40 + uInt table; /* table lengths (14 bits) */
1.41 + uInt index; /* index into blens (or border) */
1.42 + uIntf *blens; /* bit lengths of codes */
1.43 + uInt bb; /* bit length tree depth */
1.44 + inflate_huft *tb; /* bit length decoding tree */
1.45 + } trees; /* if DTREE, decoding info for trees */
1.46 + struct {
1.47 + inflate_codes_statef
1.48 + *codes;
1.49 + } decode; /* if CODES, current state */
1.50 + } sub; /* submode */
1.51 + uInt last; /* true if this block is the last block */
1.52 +
1.53 + /* mode independent information */
1.54 + uInt bitk; /* bits in bit buffer */
1.55 + uLong bitb; /* bit buffer */
1.56 + inflate_huft *hufts; /* single malloc for tree space */
1.57 + Bytef *window; /* sliding window */
1.58 + Bytef *end; /* one byte after sliding window */
1.59 + Bytef *read; /* window read pointer */
1.60 + Bytef *write; /* window write pointer */
1.61 + check_func checkfn; /* check function */
1.62 + uLong check; /* check on output */
1.63 +
1.64 +};
1.65 +
1.66 +
1.67 +/* defines for inflate input/output */
1.68 +/* update pointers and return */
1.69 +#define UPDBITS {s->bitb=b;s->bitk=k;}
1.70 +#define UPDIN {z->avail_in=n;z->total_in+=p-z->next_in;z->next_in=p;}
1.71 +#define UPDOUT {s->write=q;}
1.72 +#define UPDATE {UPDBITS UPDIN UPDOUT}
1.73 +#define LEAVE {UPDATE return inflate_flush(s,z,r);}
1.74 +/* get bytes and bits */
1.75 +#define LOADIN {p=z->next_in;n=z->avail_in;b=s->bitb;k=s->bitk;}
1.76 +#define NEEDBYTE {if(n)r=Z_OK;else LEAVE}
1.77 +#define NEXTBYTE (n--,*p++)
1.78 +#define NEEDBITS(j) {while(k<(j)){NEEDBYTE;b|=((uLong)NEXTBYTE)<<k;k+=8;}}
1.79 +#define DUMPBITS(j) {b>>=(j);k-=(j);}
1.80 +/* output bytes */
1.81 +#define WAVAIL (uInt)(q<s->read?s->read-q-1:s->end-q)
1.82 +#define LOADOUT {q=s->write;m=(uInt)WAVAIL;}
1.83 +#define WRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}}
1.84 +#define FLUSH {UPDOUT r=inflate_flush(s,z,r); LOADOUT}
1.85 +#define NEEDOUT {if(m==0){WRAP if(m==0){FLUSH WRAP if(m==0) LEAVE}}r=Z_OK;}
1.86 +#define OUTBYTE(a) {*q++=(Byte)(a);m--;}
1.87 +/* load local pointers */
1.88 +#define LOAD {LOADIN LOADOUT}
1.89 +
1.90 +/* masks for lower bits (size given to avoid silly warnings with Visual C++) */
1.91 +extern const uInt inflate_mask[17];
1.92 +
1.93 +/* copy as much as possible from the sliding window to the output area */
1.94 +extern int inflate_flush OF((
1.95 + inflate_blocks_statef *,
1.96 + z_streamp ,
1.97 + int));
1.98 +
1.99 +struct internal_state {int dummy;}; /* for buggy compilers */
1.100 +
1.101 +#endif