/* inflate.c -- zlib decompression * Copyright (C) 1995-2003 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ /* * Change history: * * 1.2.beta0 24 Nov 2002 * - First version -- complete rewrite of inflate to simplify code, avoid * creation of window when not needed, minimize use of window when it is * needed, make inffast.c even faster, implement gzip decoding, and to * improve code readability and style over the previous zlib inflate code * * 1.2.beta1 25 Nov 2002 * - Use pointers for available input and output checking in inffast.c * - Remove input and output counters in inffast.c * - Change inffast.c entry and loop from avail_in >= 7 to >= 6 * - Remove unnecessary second byte pull from length extra in inffast.c * - Unroll direct copy to three copies per loop in inffast.c * * 1.2.beta2 4 Dec 2002 * - Change external routine names to reduce potential conflicts * - Correct filename to inffixed.h for fixed tables in inflate.c * - Make hbuf[] unsigned char to match parameter type in inflate.c * - Change strm->next_out[-state->offset] to *(strm->next_out - state->offset) * to avoid negation problem on Alphas (64 bit) in inflate.c * * 1.2.beta3 22 Dec 2002 * - Add comments on state->bits assertion in inffast.c * - Add comments on op field in inftrees.h * - Fix bug in reuse of allocated window after inflateReset() * - Remove bit fields--back to byte structure for speed * - Remove distance extra == 0 check in inflate_fast()--only helps for lengths * - Change post-increments to pre-increments in inflate_fast(), PPC biased? * - Add compile time option, POSTINC, to use post-increments instead (Intel?) * - Make MATCH copy in inflate() much faster for when inflate_fast() not used * - Use local copies of stream next and avail values, as well as local bit * buffer and bit count in inflate()--for speed when inflate_fast() not used * * 1.2.beta4 1 Jan 2003 * - Split ptr - 257 statements in inflate_table() to avoid compiler warnings * - Move a comment on output buffer sizes from inffast.c to inflate.c * - Add comments in inffast.c to introduce the inflate_fast() routine * - Rearrange window copies in inflate_fast() for speed and simplification * - Unroll last copy for window match in inflate_fast() * - Use local copies of window variables in inflate_fast() for speed * - Pull out common write == 0 case for speed in inflate_fast() * - Make op and len in inflate_fast() unsigned for consistency * - Add FAR to lcode and dcode declarations in inflate_fast() * - Simplified bad distance check in inflate_fast() * - Added inflateBackInit(), inflateBack(), and inflateBackEnd() in new * source file infback.c to provide a call-back interface to inflate for * programs like gzip and unzip -- uses window as output buffer to avoid * window copying * * 1.2.beta5 1 Jan 2003 * - Improved inflateBack() interface to allow the caller to provide initial * input in strm. * - Fixed stored blocks bug in inflateBack() * * 1.2.beta6 4 Jan 2003 * - Added comments in inffast.c on effectiveness of POSTINC * - Typecasting all around to reduce compiler warnings * - Changed loops from while (1) or do {} while (1) to for (;;), again to * make compilers happy * - Changed type of window in inflateBackInit() to unsigned char * * * 1.2.beta7 27 Jan 2003 * - Changed many types to unsigned or unsigned short to avoid warnings * - Added inflateCopy() function * * 1.2.0 9 Mar 2003 * - Changed inflateBack() interface to provide separate opaque descriptors * for the in() and out() functions * - Changed inflateBack() argument and in_func typedef to swap the length * and buffer address return values for the input function * - Check next_in and next_out for Z_NULL on entry to inflate() * * The history for versions after 1.2.0 are in ChangeLog in zlib distribution. */ #include "zutil.h" #include "inftrees.h" #include "inflate.h" #include "inffast.h" #ifdef MAKEFIXED # ifndef BUILDFIXED # define BUILDFIXED # endif #endif /* function prototypes */ local void fixedtables OF((struct inflate_state FAR *state)); local int updatewindow OF((z_streamp strm, unsigned out)); #ifdef BUILDFIXED void makefixed OF((void)); #endif local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf, unsigned len)); int ZEXPORT inflateReset(strm) z_streamp strm; 90 { 90 struct inflate_state FAR *state; 90 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR; 90 state = (struct inflate_state FAR *)strm->state; 90 strm->total_in = strm->total_out = state->total = 0; 90 strm->msg = Z_NULL; 90 strm->adler = 1; /* to support ill-conceived Java test suite */ 90 state->mode = HEAD; 90 state->last = 0; 90 state->havedict = 0; 90 state->wsize = 0; 90 state->whave = 0; 90 state->hold = 0; 90 state->bits = 0; 90 state->lencode = state->distcode = state->next = state->codes; Tracev((stderr, "inflate: reset\n")); 90 return Z_OK; } int ZEXPORT inflateInit2_(strm, windowBits, version, stream_size) z_streamp strm; int windowBits; const char *version; int stream_size; 88 { 88 struct inflate_state FAR *state; 88 if (version == Z_NULL || version[0] != ZLIB_VERSION[0] || stream_size != (int)(sizeof(z_stream))) ###### return Z_VERSION_ERROR; 88 if (strm == Z_NULL) return Z_STREAM_ERROR; 88 strm->msg = Z_NULL; /* in case we return an error */ 88 if (strm->zalloc == (alloc_func)0) { 88 strm->zalloc = zcalloc; 88 strm->opaque = (voidpf)0; } 88 if (strm->zfree == (free_func)0) strm->zfree = zcfree; 88 state = (struct inflate_state FAR *) ZALLOC(strm, 1, sizeof(struct inflate_state)); 88 if (state == Z_NULL) return Z_MEM_ERROR; Tracev((stderr, "inflate: allocated\n")); 88 strm->state = (voidpf)state; 88 if (windowBits < 0) { 70 state->wrap = 0; 70 windowBits = -windowBits; } else { 18 state->wrap = (windowBits >> 4) + 1; #ifdef GUNZIP 18 if (windowBits < 48) windowBits &= 15; #endif } 88 if (windowBits < 8 || windowBits > 15) { ###### ZFREE(strm, state); ###### strm->state = Z_NULL; ###### return Z_STREAM_ERROR; } 88 state->wbits = (unsigned)windowBits; 88 state->window = Z_NULL; 88 return inflateReset(strm); } int ZEXPORT inflateInit_(strm, version, stream_size) z_streamp strm; const char *version; int stream_size; ###### { ###### return inflateInit2_(strm, DEF_WBITS, version, stream_size); } /* Return state with length and distance decoding tables and index sizes set to fixed code decoding. Normally this returns fixed tables from inffixed.h. If BUILDFIXED is defined, then instead this routine builds the tables the first time it's called, and returns those tables the first time and thereafter. This reduces the size of the code by about 2K bytes, in exchange for a little execution time. However, BUILDFIXED should not be used for threaded applications, since the rewriting of the tables and virgin may not be thread-safe. */ local void fixedtables(state) struct inflate_state FAR *state; 47 { #ifdef BUILDFIXED static int virgin = 1; static code *lenfix, *distfix; static code fixed[544]; /* build fixed huffman tables if first call (may not be thread safe) */ if (virgin) { unsigned sym, bits; static code *next; /* literal/length table */ sym = 0; while (sym < 144) state->lens[sym++] = 8; while (sym < 256) state->lens[sym++] = 9; while (sym < 280) state->lens[sym++] = 7; while (sym < 288) state->lens[sym++] = 8; next = fixed; lenfix = next; bits = 9; inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); /* distance table */ sym = 0; while (sym < 32) state->lens[sym++] = 5; distfix = next; bits = 5; inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); /* do this just once */ virgin = 0; } #else /* !BUILDFIXED */ # include "inffixed.h" #endif /* BUILDFIXED */ 47 state->lencode = lenfix; 47 state->lenbits = 9; 47 state->distcode = distfix; 47 state->distbits = 5; } #ifdef MAKEFIXED #include /* Write out the inffixed.h that is #include'd above. Defining MAKEFIXED also defines BUILDFIXED, so the tables are built on the fly. makefixed() writes those tables to stdout, which would be piped to inffixed.h. A small program can simply call makefixed to do this: void makefixed(void); int main(void) { makefixed(); return 0; } Then that can be linked with zlib built with MAKEFIXED defined and run: a.out > inffixed.h */ void makefixed() { unsigned low, size; struct inflate_state state; fixedtables(&state); puts(" /* inffixed.h -- table for decoding fixed codes"); puts(" * Generated automatically by makefixed()."); puts(" */"); puts(""); puts(" /* WARNING: this file should *not* be used by applications."); puts(" It is part of the implementation of this library and is"); puts(" subject to change. Applications should only use zlib.h."); puts(" */"); puts(""); size = 1U << 9; printf(" static const code lenfix[%u] = {", size); low = 0; for (;;) { if ((low % 7) == 0) printf("\n "); printf("{%u,%u,%d}", state.lencode[low].op, state.lencode[low].bits, state.lencode[low].val); if (++low == size) break; putchar(','); } puts("\n };"); size = 1U << 5; printf("\n static const code distfix[%u] = {", size); low = 0; for (;;) { if ((low % 6) == 0) printf("\n "); printf("{%u,%u,%d}", state.distcode[low].op, state.distcode[low].bits, state.distcode[low].val); if (++low == size) break; putchar(','); } puts("\n };"); } #endif /* MAKEFIXED */ /* Update the window with the last wsize (normally 32K) bytes written before returning. If window does not exist yet, create it. This is only called when a window is already in use, or when output has been written during this inflate call, but the end of the deflate stream has not been reached yet. It is also called to create a window for dictionary data when a dictionary is loaded. Providing output buffers larger than 32K to inflate() should provide a speed advantage, since only the last 32K of output is copied to the sliding window upon return from inflate(), and since all distances after the first 32K of output will fall in the output data, making match copies simpler and faster. The advantage may be dependent on the size of the processor's data caches. */ local int updatewindow(strm, out) z_streamp strm; unsigned out; 339 { 339 struct inflate_state FAR *state; 339 unsigned copy, dist; 339 state = (struct inflate_state FAR *)strm->state; /* if it hasn't been done already, allocate space for the window */ 339 if (state->window == Z_NULL) { 25 state->window = (unsigned char FAR *) ZALLOC(strm, 1U << state->wbits, sizeof(unsigned char)); 25 if (state->window == Z_NULL) return 1; } /* if window not in use yet, initialize */ 339 if (state->wsize == 0) { 25 state->wsize = 1U << state->wbits; 25 state->write = 0; 25 state->whave = 0; } /* copy state->wsize or less output bytes into the circular window */ 339 copy = out - strm->avail_out; 339 if (copy >= state->wsize) { 1 zmemcpy(state->window, strm->next_out - state->wsize, state->wsize); 1 state->write = 0; 1 state->whave = state->wsize; } else { 338 dist = state->wsize - state->write; 338 if (dist > copy) dist = copy; 338 zmemcpy(state->window + state->write, strm->next_out - copy, dist); 338 copy -= dist; 338 if (copy) { ###### zmemcpy(state->window, strm->next_out - copy, copy); ###### state->write = copy; ###### state->whave = state->wsize; } else { 338 state->write += dist; 338 if (state->write == state->wsize) state->write = 0; 338 if (state->whave < state->wsize) state->whave += dist; } } 339 return 0; } /* Macros for inflate(): */ /* check function to use adler32() for zlib or crc32() for gzip */ #ifdef GUNZIP # define UPDATE(check, buf, len) \ (state->flags ? crc32(check, buf, len) : adler32(check, buf, len)) #else # define UPDATE(check, buf, len) adler32(check, buf, len) #endif /* check macros for header crc */ #ifdef GUNZIP # define CRC2(check, word) \ do { \ hbuf[0] = (unsigned char)(word); \ hbuf[1] = (unsigned char)((word) >> 8); \ check = crc32(check, hbuf, 2); \ } while (0) # define CRC4(check, word) \ do { \ hbuf[0] = (unsigned char)(word); \ hbuf[1] = (unsigned char)((word) >> 8); \ hbuf[2] = (unsigned char)((word) >> 16); \ hbuf[3] = (unsigned char)((word) >> 24); \ check = crc32(check, hbuf, 4); \ } while (0) #endif /* Load registers with state in inflate() for speed */ #define LOAD() \ do { \ put = strm->next_out; \ left = strm->avail_out; \ next = strm->next_in; \ have = strm->avail_in; \ hold = state->hold; \ bits = state->bits; \ } while (0) /* Restore state from registers in inflate() */ #define RESTORE() \ do { \ strm->next_out = put; \ strm->avail_out = left; \ strm->next_in = next; \ strm->avail_in = have; \ state->hold = hold; \ state->bits = bits; \ } while (0) /* Clear the input bit accumulator */ #define INITBITS() \ do { \ hold = 0; \ bits = 0; \ } while (0) /* Get a byte of input into the bit accumulator, or return from inflate() if there is no input available. */ #define PULLBYTE() \ do { \ if (have == 0) goto inf_leave; \ have--; \ hold += (unsigned long)(*next++) << bits; \ bits += 8; \ } while (0) /* Assure that there are at least n bits in the bit accumulator. If there is not enough available input to do that, then return from inflate(). */ #define NEEDBITS(n) \ do { \ while (bits < (unsigned)(n)) \ PULLBYTE(); \ } while (0) /* Return the low n bits of the bit accumulator (n < 16) */ #define BITS(n) \ ((unsigned)hold & ((1U << (n)) - 1)) /* Remove n bits from the bit accumulator */ #define DROPBITS(n) \ do { \ hold >>= (n); \ bits -= (unsigned)(n); \ } while (0) /* Remove zero to seven bits as needed to go to a byte boundary */ #define BYTEBITS() \ do { \ hold >>= bits & 7; \ bits -= bits & 7; \ } while (0) /* Reverse the bytes in a 32-bit value */ #define REVERSE(q) \ ((((q) >> 24) & 0xff) + (((q) >> 8) & 0xff00) + \ (((q) & 0xff00) << 8) + (((q) & 0xff) << 24)) /* inflate() uses a state machine to process as much input data and generate as much output data as possible before returning. The state machine is structured roughly as follows: for (;;) switch (state) { ... case STATEn: if (not enough input data or output space to make progress) return; ... make progress ... state = STATEm; break; ... } so when inflate() is called again, the same case is attempted again, and if the appropriate resources are provided, the machine proceeds to the next state. The NEEDBITS() macro is usually the way the state evaluates whether it can proceed or should return. NEEDBITS() does the return if the requested bits are not available. The typical use of the BITS macros is: NEEDBITS(n); ... do something with BITS(n) ... DROPBITS(n); where NEEDBITS(n) either returns from inflate() if there isn't enough input left to load n bits into the accumulator, or it continues. BITS(n) gives the low n bits in the accumulator. When done, DROPBITS(n) drops the low n bits off the accumulator. INITBITS() clears the accumulator and sets the number of available bits to zero. BYTEBITS() discards just enough bits to put the accumulator on a byte boundary. After BYTEBITS() and a NEEDBITS(8), then BITS(8) would return the next byte in the stream. NEEDBITS(n) uses PULLBYTE() to get an available byte of input, or to return if there is no input available. The decoding of variable length codes uses PULLBYTE() directly in order to pull just enough bytes to decode the next code, and no more. Some states loop until they get enough input, making sure that enough state information is maintained to continue the loop where it left off if NEEDBITS() returns in the loop. For example, want, need, and keep would all have to actually be part of the saved state in case NEEDBITS() returns: case STATEw: while (want < need) { NEEDBITS(n); keep[want++] = BITS(n); DROPBITS(n); } state = STATEx; case STATEx: As shown above, if the next state is also the next case, then the break is omitted. A state may also return if there is not enough output space available to complete that state. Those states are copying stored data, writing a literal byte, and copying a matching string. When returning, a "goto inf_leave" is used to update the total counters, update the check value, and determine whether any progress has been made during that inflate() call in order to return the proper return code. Progress is defined as a change in either strm->avail_in or strm->avail_out. When there is a window, goto inf_leave will update the window with the last output written. If a goto inf_leave occurs in the middle of decompression and there is no window currently, goto inf_leave will create one and copy output to the window for the next call of inflate(). In this implementation, the flush parameter of inflate() only affects the return code (per zlib.h). inflate() always writes as much as possible to strm->next_out, given the space available and the provided input--the effect documented in zlib.h of Z_SYNC_FLUSH. Furthermore, inflate() always defers the allocation of and copying into a sliding window until necessary, which provides the effect documented in zlib.h for Z_FINISH when the entire input stream available. So the only thing the flush parameter actually does is: when flush is set to Z_FINISH, inflate() cannot return Z_OK. Instead it will return Z_BUF_ERROR if it has not reached the end of the stream. */ int ZEXPORT inflate(strm, flush) z_streamp strm; int flush; 454 { 454 struct inflate_state FAR *state; 454 unsigned char FAR *next; /* next input */ 454 unsigned char FAR *put; /* next output */ 454 unsigned have, left; /* available input and output */ 454 unsigned long hold; /* bit buffer */ 454 unsigned bits; /* bits in bit buffer */ 454 unsigned in, out; /* save starting available input and output */ 454 unsigned copy; /* number of stored or match bytes to copy */ 454 unsigned char FAR *from; /* where to copy match bytes from */ 454 code this; /* current decoding table entry */ 454 code last; /* parent table entry */ 454 unsigned len; /* length to copy for repeats, bits to drop */ 454 int ret; /* return code */ #ifdef GUNZIP 454 unsigned char hbuf[4]; /* buffer for gzip header crc calculation */ #endif static const unsigned short order[19] = /* permutation of code lengths */ 454 {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; 454 if (strm == Z_NULL || strm->state == Z_NULL || strm->next_out == Z_NULL || (strm->next_in == Z_NULL && strm->avail_in != 0)) ###### return Z_STREAM_ERROR; 454 state = (struct inflate_state FAR *)strm->state; 454 if (state->mode == TYPE) state->mode = TYPEDO; /* skip check */ 454 LOAD(); 454 in = have; 454 out = left; 454 ret = Z_OK; 4067 for (;;) 3614 switch (state->mode) { case HEAD: 74 if (state->wrap == 0) { 50 state->mode = TYPEDO; 50 break; } 58 NEEDBITS(16); #ifdef GUNZIP 16 if ((state->wrap & 2) && hold == 0x8b1f) { /* gzip header */ ###### state->check = crc32(0L, Z_NULL, 0); ###### CRC2(state->check, hold); ###### INITBITS(); ###### state->mode = FLAGS; ###### break; } 16 state->flags = 0; /* expect zlib header */ 16 if (!(state->wrap & 1) || /* check if zlib header allowed */ #else if ( #endif ((BITS(8) << 8) + (hold >> 8)) % 31) { ###### strm->msg = (char *)"incorrect header check"; ###### state->mode = BAD; ###### break; } 16 if (BITS(4) != Z_DEFLATED) { ###### strm->msg = (char *)"unknown compression method"; ###### state->mode = BAD; ###### break; } 16 DROPBITS(4); 16 if (BITS(4) + 8 > state->wbits) { ###### strm->msg = (char *)"invalid window size"; ###### state->mode = BAD; ###### break; } Tracev((stderr, "inflate: zlib header ok\n")); 16 strm->adler = state->check = adler32(0L, Z_NULL, 0); 16 state->mode = hold & 0x200 ? DICTID : TYPE; 16 INITBITS(); 16 break; #ifdef GUNZIP case FLAGS: ###### NEEDBITS(16); ###### state->flags = (int)(hold); ###### if ((state->flags & 0xff) != Z_DEFLATED) { ###### strm->msg = (char *)"unknown compression method"; ###### state->mode = BAD; ###### break; } ###### if (state->flags & 0xe000) { ###### strm->msg = (char *)"unknown header flags set"; ###### state->mode = BAD; ###### break; } ###### if (state->flags & 0x0200) CRC2(state->check, hold); ###### INITBITS(); ###### state->mode = TIME; case TIME: ###### NEEDBITS(32); ###### if (state->flags & 0x0200) CRC4(state->check, hold); ###### INITBITS(); ###### state->mode = OS; case OS: ###### NEEDBITS(16); ###### if (state->flags & 0x0200) CRC2(state->check, hold); ###### INITBITS(); ###### state->mode = EXLEN; case EXLEN: ###### if (state->flags & 0x0400) { ###### NEEDBITS(16); ###### state->length = (unsigned)(hold); ###### if (state->flags & 0x0200) CRC2(state->check, hold); ###### INITBITS(); } ###### state->mode = EXTRA; case EXTRA: ###### if (state->flags & 0x0400) { ###### copy = state->length; ###### if (copy > have) copy = have; ###### if (copy) { ###### if (state->flags & 0x0200) ###### state->check = crc32(state->check, next, copy); ###### have -= copy; ###### next += copy; ###### state->length -= copy; } ###### if (state->length) goto inf_leave; } ###### state->mode = NAME; case NAME: ###### if (state->flags & 0x0800) { ###### if (have == 0) goto inf_leave; ###### copy = 0; ###### do { ###### len = (unsigned)(next[copy++]); ###### } while (len && copy < have); ###### if (state->flags & 0x02000) ###### state->check = crc32(state->check, next, copy); ###### have -= copy; ###### next += copy; ###### if (len) goto inf_leave; } ###### state->mode = COMMENT; case COMMENT: ###### if (state->flags & 0x1000) { ###### if (have == 0) goto inf_leave; ###### copy = 0; ###### do { ###### len = (unsigned)(next[copy++]); ###### } while (len && copy < have); ###### if (state->flags & 0x02000) ###### state->check = crc32(state->check, next, copy); ###### have -= copy; ###### next += copy; ###### if (len) goto inf_leave; } ###### state->mode = HCRC; case HCRC: ###### if (state->flags & 0x0200) { ###### NEEDBITS(16); ###### if (hold != (state->check & 0xffff)) { ###### strm->msg = (char *)"header crc mismatch"; ###### state->mode = BAD; ###### break; } ###### INITBITS(); } ###### strm->adler = state->check = crc32(0L, Z_NULL, 0); ###### state->mode = TYPE; ###### break; #endif case DICTID: 5 NEEDBITS(32); 1 strm->adler = state->check = REVERSE(hold); 1 INITBITS(); 1 state->mode = DICT; case DICT: 2 if (state->havedict == 0) { 1 RESTORE(); 1 return Z_NEED_DICT; } 1 strm->adler = state->check = adler32(0L, Z_NULL, 0); 1 state->mode = TYPE; case TYPE: 89 if (flush == Z_BLOCK) goto inf_leave; case TYPEDO: 147 if (state->last) { 67 BYTEBITS(); 67 state->mode = CHECK; 67 break; } 151 NEEDBITS(3); 74 state->last = BITS(1); 74 DROPBITS(1); 74 switch (BITS(2)) { case 0: /* stored block */ Tracev((stderr, "inflate: stored block%s\n", state->last ? " (last)" : "")); 7 state->mode = STORED; 7 break; case 1: /* fixed block */ 47 fixedtables(state); Tracev((stderr, "inflate: fixed codes block%s\n", state->last ? " (last)" : "")); 47 state->mode = LEN; /* decode codes */ 47 break; case 2: /* dynamic block */ Tracev((stderr, "inflate: dynamic codes block%s\n", state->last ? " (last)" : "")); 20 state->mode = TABLE; 20 break; case 3: ###### strm->msg = (char *)"invalid block type"; ###### state->mode = BAD; } 74 DROPBITS(2); 74 break; case STORED: 7 BYTEBITS(); /* go to byte boundary */ 35 NEEDBITS(32); 7 if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) { ###### strm->msg = (char *)"invalid stored block lengths"; ###### state->mode = BAD; ###### break; } 7 state->length = (unsigned)hold & 0xffff; Tracev((stderr, "inflate: stored length %u\n", state->length)); 7 INITBITS(); 7 state->mode = COPY; case COPY: 19 copy = state->length; 19 if (copy) { 12 if (copy > have) copy = have; 12 if (copy > left) copy = left; 12 if (copy == 0) goto inf_leave; 9 zmemcpy(put, next, copy); 9 have -= copy; 9 next += copy; 9 left -= copy; 9 put += copy; 9 state->length -= copy; 9 break; } Tracev((stderr, "inflate: stored end\n")); 7 state->mode = TYPE; 7 break; case TABLE: 63 NEEDBITS(14); 20 state->nlen = BITS(5) + 257; 20 DROPBITS(5); 20 state->ndist = BITS(5) + 1; 20 DROPBITS(5); 20 state->ncode = BITS(4) + 4; 20 DROPBITS(4); #ifndef PKZIP_BUG_WORKAROUND 20 if (state->nlen > 286 || state->ndist > 30) { ###### strm->msg = (char *)"too many length or distance symbols"; ###### state->mode = BAD; ###### break; } #endif Tracev((stderr, "inflate: table sizes ok\n")); 20 state->have = 0; 20 state->mode = LENLENS; case LENLENS: 354 while (state->have < state->ncode) { 449 NEEDBITS(3); 322 state->lens[order[state->have++]] = (unsigned short)BITS(3); 322 DROPBITS(3); } 78 while (state->have < 19) 58 state->lens[order[state->have++]] = 0; 20 state->next = state->codes; 20 state->lencode = (code const FAR *)(state->next); 20 state->lenbits = 7; 20 ret = inflate_table(CODES, state->lens, 19, &(state->next), &(state->lenbits), state->work); 20 if (ret) { ###### strm->msg = (char *)"invalid code lengths set"; ###### state->mode = BAD; ###### break; } Tracev((stderr, "inflate: code lengths ok\n")); 20 state->have = 0; 20 state->mode = CODELENS; case CODELENS: 1660 while (state->have < state->nlen + state->ndist) { 2906 for (;;) { 2273 this = state->lencode[BITS(state->lenbits)]; 2273 if ((unsigned)(this.bits) <= bits) break; 655 PULLBYTE(); } 1618 if (this.val < 16) { 1425 NEEDBITS(this.bits); 1425 DROPBITS(this.bits); 1425 state->lens[state->have++] = this.val; } else { 193 if (this.val == 16) { 36 NEEDBITS(this.bits + 2); 29 DROPBITS(this.bits); 29 if (state->have == 0) { ###### strm->msg = (char *)"invalid bit length repeat"; ###### state->mode = BAD; ###### break; } 29 len = state->lens[state->have - 1]; 29 copy = 3 + BITS(2); 29 DROPBITS(2); } 164 else if (this.val == 17) { 107 NEEDBITS(this.bits + 3); 77 DROPBITS(this.bits); 77 len = 0; 77 copy = 3 + BITS(3); 77 DROPBITS(3); } else { 146 NEEDBITS(this.bits + 7); 75 DROPBITS(this.bits); 75 len = 0; 75 copy = 11 + BITS(7); 75 DROPBITS(7); } 181 if (state->have + copy > state->nlen + state->ndist) { ###### strm->msg = (char *)"invalid bit length repeat"; ###### state->mode = BAD; ###### break; } 4718 while (copy--) 4537 state->lens[state->have++] = (unsigned short)len; } } /* handle error breaks in while */ 20 if (state->mode == BAD) break; /* build code tables */ 20 state->next = state->codes; 20 state->lencode = (code const FAR *)(state->next); 20 state->lenbits = 9; 20 ret = inflate_table(LENS, state->lens, state->nlen, &(state->next), &(state->lenbits), state->work); 20 if (ret) { ###### strm->msg = (char *)"invalid literal/lengths set"; ###### state->mode = BAD; ###### break; } 20 state->distcode = (code const FAR *)(state->next); 20 state->distbits = 6; 20 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist, &(state->next), &(state->distbits), state->work); 20 if (ret) { ###### strm->msg = (char *)"invalid distances set"; ###### state->mode = BAD; ###### break; } Tracev((stderr, "inflate: codes ok\n")); 20 state->mode = LEN; case LEN: 2014 if (have >= 6 && left >= 258) { 185 RESTORE(); 185 inflate_fast(strm, out); 185 LOAD(); 185 break; } 3783 for (;;) { 2806 this = state->lencode[BITS(state->lenbits)]; 2806 if ((unsigned)(this.bits) <= bits) break; 1071 PULLBYTE(); } 1735 if (this.op && (this.op & 0xf0) == 0) { 21 last = this; 39 for (;;) { 30 this = state->lencode[last.val + (BITS(last.bits + last.op) >> last.bits)]; 30 if ((unsigned)(last.bits + this.bits) <= bits) break; 9 PULLBYTE(); } 21 DROPBITS(last.bits); } 1735 DROPBITS(this.bits); 1735 state->length = (unsigned)this.val; 1735 if ((int)(this.op) == 0) { Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ? "inflate: literal '%c'\n" : "inflate: literal 0x%02x\n", this.val)); 887 state->mode = LIT; 887 break; } 848 if (this.op & 32) { Tracevv((stderr, "inflate: end of block\n")); 28 state->mode = TYPE; 28 break; } 820 if (this.op & 64) { ###### strm->msg = (char *)"invalid literal/length code"; ###### state->mode = BAD; ###### break; } 820 state->extra = (unsigned)(this.op) & 15; 820 state->mode = LENEXT; case LENEXT: 820 if (state->extra) { 259 NEEDBITS(state->extra); 205 state->length += BITS(state->extra); 205 DROPBITS(state->extra); } Tracevv((stderr, "inflate: length %u\n", state->length)); 820 state->mode = DIST; case DIST: 1628 for (;;) { 1224 this = state->distcode[BITS(state->distbits)]; 1224 if ((unsigned)(this.bits) <= bits) break; 404 PULLBYTE(); } 820 if ((this.op & 0xf0) == 0) { 15 last = this; 15 for (;;) { 15 this = state->distcode[last.val + (BITS(last.bits + last.op) >> last.bits)]; 15 if ((unsigned)(last.bits + this.bits) <= bits) break; ###### PULLBYTE(); } 15 DROPBITS(last.bits); } 820 DROPBITS(this.bits); 820 if (this.op & 64) { ###### strm->msg = (char *)"invalid distance code"; ###### state->mode = BAD; ###### break; } 820 state->offset = (unsigned)this.val; 820 state->extra = (unsigned)(this.op) & 15; 820 state->mode = DISTEXT; case DISTEXT: 924 if (state->extra) { 1573 NEEDBITS(state->extra); 782 state->offset += BITS(state->extra); 782 DROPBITS(state->extra); } 820 if (state->offset > state->whave + out - left) { ###### strm->msg = (char *)"invalid distance too far back"; ###### state->mode = BAD; ###### break; } Tracevv((stderr, "inflate: distance %u\n", state->offset)); 820 state->mode = MATCH; case MATCH: 1023 if (left == 0) goto inf_leave; 948 copy = out - left; 948 if (state->offset > copy) { /* copy from window */ 227 copy = state->offset - copy; 227 if (copy > state->write) { 1 copy -= state->write; 1 from = state->window + (state->wsize - copy); } else 226 from = state->window + (state->write - copy); 227 if (copy > state->length) copy = state->length; } else { /* copy from output */ 721 from = put - state->offset; 721 copy = state->length; } 948 if (copy > left) copy = left; 948 left -= copy; 948 state->length -= copy; 49660 do { 49660 *put++ = *from++; 49660 } while (--copy); 948 if (state->length == 0) state->mode = LEN; 820 break; case LIT: 909 if (left == 0) goto inf_leave; 887 *put++ = (unsigned char)(state->length); 887 left--; 887 state->mode = LEN; 887 break; case CHECK: 91 if (state->wrap) { 114 NEEDBITS(32); 18 out -= left; 18 strm->total_out += out; 18 state->total += out; 18 if (out) 15 strm->adler = state->check = UPDATE(state->check, put - out, out); 18 out = left; 18 if (( #ifdef GUNZIP state->flags ? hold : #endif REVERSE(hold)) != state->check) { 2 strm->msg = (char *)"incorrect data check"; 2 state->mode = BAD; 2 break; } 16 INITBITS(); Tracev((stderr, "inflate: check matches trailer\n")); } #ifdef GUNZIP 65 state->mode = LENGTH; case LENGTH: 65 if (state->wrap && state->flags) { ###### NEEDBITS(32); ###### if (hold != (state->total & 0xffffffffUL)) { ###### strm->msg = (char *)"incorrect length check"; ###### state->mode = BAD; ###### break; } ###### INITBITS(); Tracev((stderr, "inflate: length matches trailer\n")); } #endif 65 state->mode = DONE; case DONE: 65 ret = Z_STREAM_END; 65 goto inf_leave; case BAD: 2 ret = Z_DATA_ERROR; 2 goto inf_leave; case MEM: ###### return Z_MEM_ERROR; case SYNC: default: ###### return Z_STREAM_ERROR; } /* Return from inflate(), updating the total counts and the check value. If there was no progress during the inflate() call, return a buffer error. Call updatewindow() to create and/or update the window state. Note: a memory error from inflate() is non-recoverable. */ inf_leave: 453 RESTORE(); 453 if (state->wsize || (state->mode < CHECK && out != strm->avail_out)) 338 if (updatewindow(strm, out)) { ###### state->mode = MEM; ###### return Z_MEM_ERROR; } 453 in -= strm->avail_in; 453 out -= strm->avail_out; 453 strm->total_in += in; 453 strm->total_out += out; 453 state->total += out; 453 if (state->wrap && out) 96 strm->adler = state->check = UPDATE(state->check, strm->next_out - out, out); 453 strm->data_type = state->bits + (state->last ? 64 : 0) + (state->mode == TYPE ? 128 : 0); 453 if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK) 143 ret = Z_BUF_ERROR; 453 return ret; } int ZEXPORT inflateEnd(strm) z_streamp strm; 88 { 88 struct inflate_state FAR *state; 88 if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0) ###### return Z_STREAM_ERROR; 88 state = (struct inflate_state FAR *)strm->state; 88 if (state->window != Z_NULL) ZFREE(strm, state->window); 88 ZFREE(strm, strm->state); 88 strm->state = Z_NULL; Tracev((stderr, "inflate: end\n")); 88 return Z_OK; } int ZEXPORT inflateSetDictionary(strm, dictionary, dictLength) z_streamp strm; const Bytef *dictionary; uInt dictLength; 1 { 1 struct inflate_state FAR *state; 1 unsigned long id; /* check state */ 1 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR; 1 state = (struct inflate_state FAR *)strm->state; 1 if (state->mode != DICT) return Z_STREAM_ERROR; /* check for correct dictionary id */ 1 id = adler32(0L, Z_NULL, 0); 1 id = adler32(id, dictionary, dictLength); 1 if (id != state->check) return Z_DATA_ERROR; /* copy dictionary to window */ 1 if (updatewindow(strm, strm->avail_out)) { ###### state->mode = MEM; ###### return Z_MEM_ERROR; } 1 if (dictLength > state->wsize) { ###### zmemcpy(state->window, dictionary + dictLength - state->wsize, state->wsize); ###### state->whave = state->wsize; } else { 1 zmemcpy(state->window + state->wsize - dictLength, dictionary, dictLength); 1 state->whave = dictLength; } 1 state->havedict = 1; Tracev((stderr, "inflate: dictionary set\n")); 1 return Z_OK; } /* Search buf[0..len-1] for the pattern: 0, 0, 0xff, 0xff. Return when found or when out of input. When called, *have is the number of pattern bytes found in order so far, in 0..3. On return *have is updated to the new state. If on return *have equals four, then the pattern was found and the return value is how many bytes were read including the last byte of the pattern. If *have is less than four, then the pattern has not been found yet and the return value is len. In the latter case, syncsearch() can be called again with more data and the *have state. *have is initialized to zero for the first call. */ local unsigned syncsearch(have, buf, len) unsigned FAR *have; unsigned char FAR *buf; unsigned len; 171 { 171 unsigned got; 171 unsigned next; 171 got = *have; 171 next = 0; 509 while (next < len && got < 4) { 338 if ((int)(buf[next]) == (got < 2 ? 0 : 0xff)) 8 got++; 330 else if (buf[next]) 330 got = 0; else ###### got = 4 - got; 338 next++; } 171 *have = got; 171 return next; } int ZEXPORT inflateSync(strm) z_streamp strm; 169 { 169 unsigned len; /* number of bytes to look at or looked at */ 169 unsigned long in, out; /* temporary to save total_in and total_out */ 169 unsigned char buf[4]; /* to restore bit buffer to byte string */ 169 struct inflate_state FAR *state; /* check parameters */ 169 if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR; 169 state = (struct inflate_state FAR *)strm->state; 169 if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR; /* if first time, start search in bit buffer */ 169 if (state->mode != SYNC) { 2 state->mode = SYNC; 2 state->hold <<= state->bits & 7; 2 state->bits -= state->bits & 7; 2 len = 0; 4 while (state->bits >= 8) { 2 buf[len++] = (unsigned char)(state->hold); 2 state->hold >>= 8; 2 state->bits -= 8; } 2 state->have = 0; 2 syncsearch(&(state->have), buf, len); } /* search available input */ 169 len = syncsearch(&(state->have), strm->next_in, strm->avail_in); 169 strm->avail_in -= len; 169 strm->next_in += len; 169 strm->total_in += len; /* return no joy or set up to restart inflate() on a new block */ 169 if (state->have != 4) return Z_DATA_ERROR; 2 in = strm->total_in; out = strm->total_out; 2 inflateReset(strm); 2 strm->total_in = in; strm->total_out = out; 2 state->mode = TYPE; 2 return Z_OK; } /* Returns true if inflate is currently at the end of a block generated by Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP implementation to provide an additional safety check. PPP uses Z_SYNC_FLUSH but removes the length bytes of the resulting empty stored block. When decompressing, PPP checks that at the end of input packet, inflate is waiting for these length bytes. */ int ZEXPORT inflateSyncPoint(strm) z_streamp strm; ###### { ###### struct inflate_state FAR *state; ###### if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR; ###### state = (struct inflate_state FAR *)strm->state; ###### return state->mode == STORED && state->bits == 0; } int ZEXPORT inflateCopy(dest, source) z_streamp dest; z_streamp source; ###### { ###### struct inflate_state FAR *state; ###### struct inflate_state FAR *copy; ###### unsigned char FAR *window; /* check input */ ###### if (dest == Z_NULL || source == Z_NULL || source->state == Z_NULL || source->zalloc == (alloc_func)0 || source->zfree == (free_func)0) ###### return Z_STREAM_ERROR; ###### state = (struct inflate_state FAR *)source->state; /* allocate space */ ###### copy = (struct inflate_state FAR *) ZALLOC(source, 1, sizeof(struct inflate_state)); ###### if (copy == Z_NULL) return Z_MEM_ERROR; ###### window = Z_NULL; ###### if (state->window != Z_NULL) { ###### window = (unsigned char FAR *) ZALLOC(source, 1U << state->wbits, sizeof(unsigned char)); ###### if (window == Z_NULL) { ###### ZFREE(source, copy); ###### return Z_MEM_ERROR; } } /* copy state */ ###### *dest = *source; ###### *copy = *state; ###### copy->lencode = copy->codes + (state->lencode - state->codes); ###### copy->distcode = copy->codes + (state->distcode - state->codes); ###### copy->next = copy->codes + (state->next - state->codes); ###### if (window != Z_NULL) ###### zmemcpy(window, state->window, 1U << state->wbits); ###### copy->window = window; ###### dest->state = (voidpf)copy; ###### return Z_OK; }