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);} 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);} 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--;} 85 #define LOAD {LOADIN LOADOUT} 88 #ifndef NO_INFLATE_MASK
struct inflate_blocks_state FAR inflate_blocks_statef
union inflate_blocks_state::@24 sub
struct inflate_blocks_state::@24::@26 decode
local int inflate_flush OF((inflate_blocks_statef *, z_streamp, int))
struct inflate_blocks_state::@24::@25 trees
struct inflate_huft_s FAR inflate_huft
inflate_codes_statef * codes
local uInt inflate_mask[17]
local int inflate_flush(inflate_blocks_statef *s, z_streamp z, int r)
struct inflate_codes_state FAR inflate_codes_statef