diff options
| author | Mark Adler <madler@alumni.caltech.edu> | 2011-09-09 23:08:07 -0700 |
|---|---|---|
| committer | Mark Adler <madler@alumni.caltech.edu> | 2011-09-09 23:08:07 -0700 |
| commit | bdde4e09d21edff02ea5093b7f6eccbf166b272f (patch) | |
| tree | a64632a98a6bea6e5df864d6e5b6f2e51ea69c1c /infutil.h | |
| parent | 1c71d8b13b54f91ddec361d3053ecce26e6ff761 (diff) | |
| download | zlib-bdde4e09d21edff02ea5093b7f6eccbf166b272f.tar.gz zlib-bdde4e09d21edff02ea5093b7f6eccbf166b272f.tar.bz2 zlib-bdde4e09d21edff02ea5093b7f6eccbf166b272f.zip | |
zlib 0.92v0.92
Diffstat (limited to 'infutil.h')
| -rw-r--r-- | infutil.h | 56 |
1 files changed, 28 insertions, 28 deletions
| @@ -13,42 +13,42 @@ struct inflate_blocks_state { | |||
| 13 | 13 | ||
| 14 | /* mode */ | 14 | /* mode */ |
| 15 | enum { | 15 | enum { |
| 16 | TYPE, /* get type bits (3, including end bit) */ | 16 | TYPE, /* get type bits (3, including end bit) */ |
| 17 | LENS, /* get lengths for stored */ | 17 | LENS, /* get lengths for stored */ |
| 18 | STORED, /* processing stored block */ | 18 | STORED, /* processing stored block */ |
| 19 | TABLE, /* get table lengths */ | 19 | TABLE, /* get table lengths */ |
| 20 | BTREE, /* get bit lengths tree for a dynamic block */ | 20 | BTREE, /* get bit lengths tree for a dynamic block */ |
| 21 | DTREE, /* get length, distance trees for a dynamic block */ | 21 | DTREE, /* get length, distance trees for a dynamic block */ |
| 22 | CODES, /* processing fixed or dynamic block */ | 22 | CODES, /* processing fixed or dynamic block */ |
| 23 | DRY, /* output remaining window bytes */ | 23 | DRY, /* output remaining window bytes */ |
| 24 | DONE, /* finished last block, done */ | 24 | DONE, /* finished last block, done */ |
| 25 | BAD} /* got a data error--stuck here */ | 25 | BAD} /* got a data error--stuck here */ |
| 26 | mode; /* current inflate_block mode */ | 26 | mode; /* current inflate_block mode */ |
| 27 | 27 | ||
| 28 | /* mode dependent information */ | 28 | /* mode dependent information */ |
| 29 | union { | 29 | union { |
| 30 | uInt left; /* if STORED, bytes left to copy */ | 30 | uInt left; /* if STORED, bytes left to copy */ |
| 31 | struct { | 31 | struct { |
| 32 | uInt table; /* table lengths (14 bits) */ | 32 | uInt table; /* table lengths (14 bits) */ |
| 33 | uInt index; /* index into blens (or border) */ | 33 | uInt index; /* index into blens (or border) */ |
| 34 | uInt *blens; /* bit lengths of codes */ | 34 | uInt *blens; /* bit lengths of codes */ |
| 35 | uInt bb; /* bit length tree depth */ | 35 | uInt bb; /* bit length tree depth */ |
| 36 | inflate_huft *tb; /* bit length decoding tree */ | 36 | inflate_huft *tb; /* bit length decoding tree */ |
| 37 | } trees; /* if DTREE, decoding info for trees */ | 37 | } trees; /* if DTREE, decoding info for trees */ |
| 38 | struct inflate_codes_state | 38 | struct inflate_codes_state |
| 39 | *codes; /* if CODES, current state */ | 39 | *codes; /* if CODES, current state */ |
| 40 | } sub; /* submode */ | 40 | } sub; /* submode */ |
| 41 | uInt last; /* true if this block is the last block */ | 41 | uInt last; /* true if this block is the last block */ |
| 42 | 42 | ||
| 43 | /* mode independent information */ | 43 | /* mode independent information */ |
| 44 | uInt bitk; /* bits in bit buffer */ | 44 | uInt bitk; /* bits in bit buffer */ |
| 45 | uLong bitb; /* bit buffer */ | 45 | uLong bitb; /* bit buffer */ |
| 46 | Byte *window; /* sliding window */ | 46 | Byte *window; /* sliding window */ |
| 47 | Byte *end; /* one byte after sliding window */ | 47 | Byte *end; /* one byte after sliding window */ |
| 48 | Byte *read; /* window read pointer */ | 48 | Byte *read; /* window read pointer */ |
| 49 | Byte *write; /* window write pointer */ | 49 | Byte *write; /* window write pointer */ |
| 50 | check_func checkfn; /* check function */ | 50 | check_func checkfn; /* check function */ |
| 51 | uLong check; /* check on output */ | 51 | uLong check; /* check on output */ |
| 52 | 52 | ||
| 53 | }; | 53 | }; |
| 54 | 54 | ||