FreeBSD/Linux Kernel Cross Reference
sys/lib/libz/infutil.h
1 /* $NetBSD: infutil.h,v 1.7 2005/02/26 22:58:57 perry Exp $ */
2
3 /* infutil.h -- types and macros common to blocks and codes
4 * Copyright (C) 1995-2002 Mark Adler
5 * For conditions of distribution and use, see copyright notice in zlib.h
6 */
7
8 /* WARNING: this file should *not* be used by applications. It is
9 part of the implementation of the compression library and is
10 subject to change. Applications should only use zlib.h.
11 */
12
13 #ifndef _INFUTIL_H
14 #define _INFUTIL_H
15
16 typedef enum {
17 TYPE, /* get type bits (3, including end bit) */
18 LENS, /* get lengths for stored */
19 STORED, /* processing stored block */
20 TABLE, /* get table lengths */
21 BTREE, /* get bit lengths tree for a dynamic block */
22 DTREE, /* get length, distance trees for a dynamic block */
23 CODES, /* processing fixed or dynamic block */
24 DRY, /* output remaining window bytes */
25 DONE, /* finished last block, done */
26 BAD} /* got a data error--stuck here */
27 inflate_block_mode;
28
29 /* inflate blocks semi-private state */
30 struct inflate_blocks_state {
31
32 /* mode */
33 inflate_block_mode mode; /* current inflate_block mode */
34
35 /* mode dependent information */
36 union {
37 uInt left; /* if STORED, bytes left to copy */
38 struct {
39 uInt table; /* table lengths (14 bits) */
40 uInt index; /* index into blens (or border) */
41 uIntf *blens; /* bit lengths of codes */
42 uInt bb; /* bit length tree depth */
43 inflate_huft *tb; /* bit length decoding tree */
44 } trees; /* if DTREE, decoding info for trees */
45 struct {
46 inflate_codes_statef
47 *codes;
48 } decode; /* if CODES, current state */
49 } sub; /* submode */
50 uInt last; /* true if this block is the last block */
51
52 /* mode independent information */
53 uInt bitk; /* bits in bit buffer */
54 uLong bitb; /* bit buffer */
55 inflate_huft *hufts; /* single malloc for tree space */
56 Bytef *window; /* sliding window */
57 Bytef *end; /* one byte after sliding window */
58 Bytef *read; /* window read pointer */
59 Bytef *write; /* window write pointer */
60
61 };
62
63
64 /* defines for inflate input/output */
65 /* update pointers and return */
66 #define UPDBITS {s->bitb=b;s->bitk=k;}
67 #define UPDIN {z->avail_in=n;z->total_in+=p-z->next_in;z->next_in=p;}
68 #define UPDOUT {s->write=q;}
69 #define UPDATE {UPDBITS UPDIN UPDOUT}
70 #define LEAVE {UPDATE return inflate_flush(s,z,r);}
71 /* get bytes and bits */
72 #define LOADIN {p=z->next_in;n=z->avail_in;b=s->bitb;k=s->bitk;}
73 #define NEEDBYTE {if(n)r=Z_OK;else LEAVE}
74 #define NEXTBYTE (n--,*p++)
75 #define NEEDBITS(j) {while(k<(j)){NEEDBYTE;b|=((uLong)NEXTBYTE)<<k;k+=8;}}
76 #define DUMPBITS(j) {b>>=(j);k-=(j);}
77 /* output bytes */
78 #define WAVAIL (uInt)(q<s->read?s->read-q-1:s->end-q)
79 #define LOADOUT {q=s->write;m=(uInt)WAVAIL;}
80 #define WRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}}
81 #define FLUSH {UPDOUT r=inflate_flush(s,z,r); LOADOUT}
82 #define NEEDOUT {if(m==0){WRAP if(m==0){FLUSH WRAP if(m==0) LEAVE}}r=Z_OK;}
83 #define OUTBYTE(a) {*q++=(Byte)(a);m--;}
84 /* load local pointers */
85 #define LOAD {LOADIN LOADOUT}
86
87 /* masks for lower bits (size given to avoid silly warnings with Visual C++) */
88 extern const uInt inflate_mask[17];
89
90 /* copy as much as possible from the sliding window to the output area */
91 extern int inflate_flush __P((
92 inflate_blocks_statef *,
93 z_streamp ,
94 int));
95
96 struct internal_state {int dummy;}; /* for buggy compilers */
97
98 #endif
Cache object: 9be688b4011461316eda55ca363463c6
|