sl@0: /* Portions Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
sl@0: * All rights reserved.
sl@0: */
sl@0:
sl@0: /* infback.cpp -- inflate using a call-back interface
sl@0: * Copyright (C) 1995-2005 Mark Adler
sl@0: * For conditions of distribution and use, see copyright notice in zlib.h
sl@0: */
sl@0:
sl@0: /*
sl@0: This code is largely copied from inflate.c. Normally either infback.o or
sl@0: inflate.o would be linked into an application--not both. The interface
sl@0: with inffast.c is retained so that optimized assembler-coded versions of
sl@0: inflate_fast() can be used with either inflate.c or infback.c.
sl@0: */
sl@0:
sl@0: #include "zutil.h"
sl@0: #include "inftrees.h"
sl@0: #include "inflate.h"
sl@0: #include "inffast.h"
sl@0:
sl@0: /* function prototypes */
sl@0: local void fixedtables OF((struct inflate_state FAR *state));
sl@0:
sl@0: /*
sl@0: strm provides memory allocation functions in zalloc and zfree, or
sl@0: Z_NULL to use the library memory allocation functions.
sl@0:
sl@0: windowBits is in the range 8..15, and window is a user-supplied
sl@0: window and output buffer that is 2**windowBits bytes.
sl@0: */
sl@0:
sl@0: #ifdef __SYMBIAN32__
sl@0: EXPORT_C int inflateBackInit__r(z_streamp strm, int windowBits,unsigned char FAR * window,const char * version,int stream_size)
sl@0: #else
sl@0: int ZEXPORT inflateBackInit_(strm, windowBits, window, version, stream_size)
sl@0: z_streamp strm;
sl@0: int windowBits;
sl@0: unsigned char FAR *window;
sl@0: const char *version;
sl@0: int stream_size;
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0: struct inflate_state FAR *state;
sl@0:
sl@0: if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
sl@0: stream_size != (int)(sizeof(z_stream)))
sl@0: return Z_VERSION_ERROR;
sl@0: if (strm == Z_NULL || window == Z_NULL ||
sl@0: windowBits < 8 || windowBits > 15)
sl@0: return Z_STREAM_ERROR;
sl@0: strm->msg = Z_NULL; /* in case we return an error */
sl@0: if (strm->zalloc == (alloc_func)0) {
sl@0: strm->zalloc = zcalloc;
sl@0: strm->opaque = (voidpf)0;
sl@0: }
sl@0: if (strm->zfree == (free_func)0) strm->zfree = zcfree;
sl@0: state = (struct inflate_state FAR *)ZALLOC(strm, 1,
sl@0: sizeof(struct inflate_state));
sl@0: if (state == Z_NULL) return Z_MEM_ERROR;
sl@0: Tracev((stderr, "inflate: allocated\n"));
sl@0: strm->state = (struct internal_state FAR *)state;
sl@0: state->dmax = 32768U;
sl@0: state->wbits = windowBits;
sl@0: state->wsize = 1U << windowBits;
sl@0: state->window = window;
sl@0: state->write = 0;
sl@0: state->whave = 0;
sl@0: return Z_OK;
sl@0: }
sl@0:
sl@0:
sl@0: /*
sl@0: Return state with length and distance decoding tables and index sizes set to
sl@0: fixed code decoding. Normally this returns fixed tables from inffixed.h.
sl@0: If BUILDFIXED is defined, then instead this routine builds the tables the
sl@0: first time it's called, and returns those tables the first time and
sl@0: thereafter. This reduces the size of the code by about 2K bytes, in
sl@0: exchange for a little execution time. However, BUILDFIXED should not be
sl@0: used for threaded applications, since the rewriting of the tables and virgin
sl@0: may not be thread-safe.
sl@0: */
sl@0:
sl@0: #ifdef __SYMBIAN32__
sl@0: local void fixedtables(struct inflate_state FAR * state)
sl@0: #else
sl@0: local void fixedtables(state)
sl@0: struct inflate_state FAR *state;
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0: #ifdef BUILDFIXED
sl@0: static int virgin = 1;
sl@0: static code *lenfix, *distfix;
sl@0: static code fixed[544];
sl@0:
sl@0: /* build fixed huffman tables if first call (may not be thread safe) */
sl@0: if (virgin) {
sl@0: unsigned sym, bits;
sl@0: static code *next;
sl@0:
sl@0: /* literal/length table */
sl@0: sym = 0;
sl@0: while (sym < 144) state->lens[sym++] = 8;
sl@0: while (sym < 256) state->lens[sym++] = 9;
sl@0: while (sym < 280) state->lens[sym++] = 7;
sl@0: while (sym < 288) state->lens[sym++] = 8;
sl@0: next = fixed;
sl@0: lenfix = next;
sl@0: bits = 9;
sl@0: inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
sl@0:
sl@0: /* distance table */
sl@0: sym = 0;
sl@0: while (sym < 32) state->lens[sym++] = 5;
sl@0: distfix = next;
sl@0: bits = 5;
sl@0: inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
sl@0:
sl@0: /* do this just once */
sl@0: virgin = 0;
sl@0: }
sl@0: #else /* !BUILDFIXED */
sl@0: # include "inffixed.h"
sl@0: #endif /* BUILDFIXED */
sl@0: state->lencode = lenfix;
sl@0: state->lenbits = 9;
sl@0: state->distcode = distfix;
sl@0: state->distbits = 5;
sl@0: }
sl@0:
sl@0:
sl@0: /* Macros for inflateBack(): */
sl@0:
sl@0: /* Load returned state from inflate_fast() */
sl@0: #define LOAD() \
sl@0: do { \
sl@0: put = strm->next_out; \
sl@0: left = strm->avail_out; \
sl@0: next = strm->next_in; \
sl@0: have = strm->avail_in; \
sl@0: hold = state->hold; \
sl@0: bits = state->bits; \
sl@0: } while (0)
sl@0:
sl@0: /* Set state from registers for inflate_fast() */
sl@0: #define RESTORE() \
sl@0: do { \
sl@0: strm->next_out = put; \
sl@0: strm->avail_out = left; \
sl@0: strm->next_in = next; \
sl@0: strm->avail_in = have; \
sl@0: state->hold = hold; \
sl@0: state->bits = bits; \
sl@0: } while (0)
sl@0:
sl@0: /* Clear the input bit accumulator */
sl@0: #define INITBITS() \
sl@0: do { \
sl@0: hold = 0; \
sl@0: bits = 0; \
sl@0: } while (0)
sl@0:
sl@0: /* Assure that some input is available. If input is requested, but denied,
sl@0: then return a Z_BUF_ERROR from inflateBack(). */
sl@0: #define PULL() \
sl@0: do { \
sl@0: if (have == 0) { \
sl@0: have = in(in_desc, &next); \
sl@0: if (have == 0) { \
sl@0: next = Z_NULL; \
sl@0: ret = Z_BUF_ERROR; \
sl@0: goto inf_leave; \
sl@0: } \
sl@0: } \
sl@0: } while (0)
sl@0:
sl@0: /* Get a byte of input into the bit accumulator, or return from inflateBack()
sl@0: with an error if there is no input available. */
sl@0: #define PULLBYTE() \
sl@0: do { \
sl@0: PULL(); \
sl@0: have--; \
sl@0: hold += (unsigned long)(*next++) << bits; \
sl@0: bits += 8; \
sl@0: } while (0)
sl@0:
sl@0: /* Assure that there are at least n bits in the bit accumulator. If there is
sl@0: not enough available input to do that, then return from inflateBack() with
sl@0: an error. */
sl@0: #define NEEDBITS(n) \
sl@0: do { \
sl@0: while (bits < (unsigned)(n)) \
sl@0: PULLBYTE(); \
sl@0: } while (0)
sl@0:
sl@0: /* Return the low n bits of the bit accumulator (n < 16) */
sl@0: #define BITS(n) \
sl@0: ((unsigned)hold & ((1U << (n)) - 1))
sl@0:
sl@0: /* Remove n bits from the bit accumulator */
sl@0: #define DROPBITS(n) \
sl@0: do { \
sl@0: hold >>= (n); \
sl@0: bits -= (unsigned)(n); \
sl@0: } while (0)
sl@0:
sl@0: /* Remove zero to seven bits as needed to go to a byte boundary */
sl@0: #define BYTEBITS() \
sl@0: do { \
sl@0: hold >>= bits & 7; \
sl@0: bits -= bits & 7; \
sl@0: } while (0)
sl@0:
sl@0: /* Assure that some output space is available, by writing out the window
sl@0: if it's full. If the write fails, return from inflateBack() with a
sl@0: Z_BUF_ERROR. */
sl@0: #define ROOM() \
sl@0: do { \
sl@0: if (left == 0) { \
sl@0: put = state->window; \
sl@0: left = state->wsize; \
sl@0: state->whave = left; \
sl@0: if (out(out_desc, put, left)) { \
sl@0: ret = Z_BUF_ERROR; \
sl@0: goto inf_leave; \
sl@0: } \
sl@0: } \
sl@0: } while (0)
sl@0:
sl@0: /*
sl@0: strm provides the memory allocation functions and window buffer on input,
sl@0: and provides information on the unused input on return. For Z_DATA_ERROR
sl@0: returns, strm will also provide an error message.
sl@0:
sl@0: in() and out() are the call-back input and output functions. When
sl@0: inflateBack() needs more input, it calls in(). When inflateBack() has
sl@0: filled the window with output, or when it completes with data in the
sl@0: window, it calls out() to write out the data. The application must not
sl@0: change the provided input until in() is called again or inflateBack()
sl@0: returns. The application must not change the window/output buffer until
sl@0: inflateBack() returns.
sl@0:
sl@0: in() and out() are called with a descriptor parameter provided in the
sl@0: inflateBack() call. This parameter can be a structure that provides the
sl@0: information required to do the read or write, as well as accumulated
sl@0: information on the input and output such as totals and check values.
sl@0:
sl@0: in() should return zero on failure. out() should return non-zero on
sl@0: failure. If either in() or out() fails, than inflateBack() returns a
sl@0: Z_BUF_ERROR. strm->next_in can be checked for Z_NULL to see whether it
sl@0: was in() or out() that caused in the error. Otherwise, inflateBack()
sl@0: returns Z_STREAM_END on success, Z_DATA_ERROR for an deflate format
sl@0: error, or Z_MEM_ERROR if it could not allocate memory for the state.
sl@0: inflateBack() can also return Z_STREAM_ERROR if the input parameters
sl@0: are not correct, i.e. strm is Z_NULL or the state was not initialized.
sl@0: */
sl@0:
sl@0: #ifdef __SYMBIAN32__
sl@0: EXPORT_C int inflateBack_r(z_streamp strm,in_func in, void FAR * in_desc,out_func out,void FAR * out_desc)
sl@0: #else
sl@0: int ZEXPORT inflateBack(strm, in, in_desc, out, out_desc)
sl@0: z_streamp strm;
sl@0: in_func in;
sl@0: void FAR *in_desc;
sl@0: out_func out;
sl@0: void FAR *out_desc;
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0: struct inflate_state FAR *state;
sl@0: unsigned char FAR *next; /* next input */
sl@0: unsigned char FAR *put; /* next output */
sl@0: unsigned have, left; /* available input and output */
sl@0: unsigned long hold; /* bit buffer */
sl@0: unsigned bits; /* bits in bit buffer */
sl@0: unsigned copy; /* number of stored or match bytes to copy */
sl@0: unsigned char FAR *from; /* where to copy match bytes from */
sl@0:
sl@0: /* Need to replace "this" variable with "current" as "this" is a reserved
sl@0: * keyword in C++ which is prefectly fine for a c code. As this file
sl@0: * has been changed to C++ "this" needs to be changed.
sl@0: */
sl@0: # define this current
sl@0: code this; /* current decoding table entry */
sl@0: code last; /* parent table entry */
sl@0: unsigned len; /* length to copy for repeats, bits to drop */
sl@0: int ret; /* return code */
sl@0: static const unsigned short order[19] = /* permutation of code lengths */
sl@0: {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
sl@0:
sl@0: /* Check that the strm exists and that the state was initialized */
sl@0: if (strm == Z_NULL || strm->state == Z_NULL)
sl@0: return Z_STREAM_ERROR;
sl@0: state = (struct inflate_state FAR *)strm->state;
sl@0:
sl@0: /* Reset the state */
sl@0: strm->msg = Z_NULL;
sl@0: state->mode = TYPE;
sl@0: state->last = 0;
sl@0: state->whave = 0;
sl@0: next = strm->next_in;
sl@0: have = next != Z_NULL ? strm->avail_in : 0;
sl@0: hold = 0;
sl@0: bits = 0;
sl@0: put = state->window;
sl@0: left = state->wsize;
sl@0:
sl@0: /* Inflate until end of block marked as last */
sl@0: for (;;)
sl@0: switch (state->mode) {
sl@0: case TYPE:
sl@0: /* determine and dispatch block type */
sl@0: if (state->last) {
sl@0: BYTEBITS();
sl@0: state->mode = DONE;
sl@0: break;
sl@0: }
sl@0: NEEDBITS(3);
sl@0: state->last = BITS(1);
sl@0: DROPBITS(1);
sl@0: switch (BITS(2)) {
sl@0: case 0: /* stored block */
sl@0: Tracev((stderr, "inflate: stored block%s\n",
sl@0: state->last ? " (last)" : ""));
sl@0: state->mode = STORED;
sl@0: break;
sl@0: case 1: /* fixed block */
sl@0: fixedtables(state);
sl@0: Tracev((stderr, "inflate: fixed codes block%s\n",
sl@0: state->last ? " (last)" : ""));
sl@0: state->mode = LEN; /* decode codes */
sl@0: break;
sl@0: case 2: /* dynamic block */
sl@0: Tracev((stderr, "inflate: dynamic codes block%s\n",
sl@0: state->last ? " (last)" : ""));
sl@0: state->mode = TABLE;
sl@0: break;
sl@0: case 3:
sl@0: strm->msg = (char *)"invalid block type";
sl@0: state->mode = BAD;
sl@0: }
sl@0: DROPBITS(2);
sl@0: break;
sl@0:
sl@0: case STORED:
sl@0: /* get and verify stored block length */
sl@0: BYTEBITS(); /* go to byte boundary */
sl@0: NEEDBITS(32);
sl@0: if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
sl@0: strm->msg = (char *)"invalid stored block lengths";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0: state->length = (unsigned)hold & 0xffff;
sl@0: Tracev((stderr, "inflate: stored length %u\n",
sl@0: state->length));
sl@0: INITBITS();
sl@0:
sl@0: /* copy stored block from input to output */
sl@0: while (state->length != 0) {
sl@0: copy = state->length;
sl@0: PULL();
sl@0: ROOM();
sl@0: if (copy > have) copy = have;
sl@0: if (copy > left) copy = left;
sl@0: zmemcpy(put, next, copy);
sl@0: have -= copy;
sl@0: next += copy;
sl@0: left -= copy;
sl@0: put += copy;
sl@0: state->length -= copy;
sl@0: }
sl@0: Tracev((stderr, "inflate: stored end\n"));
sl@0: state->mode = TYPE;
sl@0: break;
sl@0:
sl@0: case TABLE:
sl@0: /* get dynamic table entries descriptor */
sl@0: NEEDBITS(14);
sl@0: state->nlen = BITS(5) + 257;
sl@0: DROPBITS(5);
sl@0: state->ndist = BITS(5) + 1;
sl@0: DROPBITS(5);
sl@0: state->ncode = BITS(4) + 4;
sl@0: DROPBITS(4);
sl@0: #ifndef PKZIP_BUG_WORKAROUND
sl@0: if (state->nlen > 286 || state->ndist > 30) {
sl@0: strm->msg = (char *)"too many length or distance symbols";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0: #endif
sl@0: Tracev((stderr, "inflate: table sizes ok\n"));
sl@0:
sl@0: /* get code length code lengths (not a typo) */
sl@0: state->have = 0;
sl@0: while (state->have < state->ncode) {
sl@0: NEEDBITS(3);
sl@0: state->lens[order[state->have++]] = (unsigned short)BITS(3);
sl@0: DROPBITS(3);
sl@0: }
sl@0: while (state->have < 19)
sl@0: state->lens[order[state->have++]] = 0;
sl@0: state->next = state->codes;
sl@0: state->lencode = (code const FAR *)(state->next);
sl@0: state->lenbits = 7;
sl@0: ret = inflate_table(CODES, state->lens, 19, &(state->next),
sl@0: &(state->lenbits), state->work);
sl@0: if (ret) {
sl@0: strm->msg = (char *)"invalid code lengths set";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0: Tracev((stderr, "inflate: code lengths ok\n"));
sl@0:
sl@0: /* get length and distance code code lengths */
sl@0: state->have = 0;
sl@0: while (state->have < state->nlen + state->ndist) {
sl@0: for (;;) {
sl@0: this = state->lencode[BITS(state->lenbits)];
sl@0: if ((unsigned)(this.bits) <= bits) break;
sl@0: PULLBYTE();
sl@0: }
sl@0: if (this.val < 16) {
sl@0: NEEDBITS(this.bits);
sl@0: DROPBITS(this.bits);
sl@0: state->lens[state->have++] = this.val;
sl@0: }
sl@0: else {
sl@0: if (this.val == 16) {
sl@0: NEEDBITS(this.bits + 2);
sl@0: DROPBITS(this.bits);
sl@0: if (state->have == 0) {
sl@0: strm->msg = (char *)"invalid bit length repeat";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0: len = (unsigned)(state->lens[state->have - 1]);
sl@0: copy = 3 + BITS(2);
sl@0: DROPBITS(2);
sl@0: }
sl@0: else if (this.val == 17) {
sl@0: NEEDBITS(this.bits + 3);
sl@0: DROPBITS(this.bits);
sl@0: len = 0;
sl@0: copy = 3 + BITS(3);
sl@0: DROPBITS(3);
sl@0: }
sl@0: else {
sl@0: NEEDBITS(this.bits + 7);
sl@0: DROPBITS(this.bits);
sl@0: len = 0;
sl@0: copy = 11 + BITS(7);
sl@0: DROPBITS(7);
sl@0: }
sl@0: if (state->have + copy > state->nlen + state->ndist) {
sl@0: strm->msg = (char *)"invalid bit length repeat";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0: while (copy--)
sl@0: state->lens[state->have++] = (unsigned short)len;
sl@0: }
sl@0: }
sl@0:
sl@0: /* handle error breaks in while */
sl@0: if (state->mode == BAD) break;
sl@0:
sl@0: /* build code tables */
sl@0: state->next = state->codes;
sl@0: state->lencode = (code const FAR *)(state->next);
sl@0: state->lenbits = 9;
sl@0: ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
sl@0: &(state->lenbits), state->work);
sl@0: if (ret) {
sl@0: strm->msg = (char *)"invalid literal/lengths set";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0: state->distcode = (code const FAR *)(state->next);
sl@0: state->distbits = 6;
sl@0: ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
sl@0: &(state->next), &(state->distbits), state->work);
sl@0: if (ret) {
sl@0: strm->msg = (char *)"invalid distances set";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0: Tracev((stderr, "inflate: codes ok\n"));
sl@0: state->mode = LEN;
sl@0:
sl@0: case LEN:
sl@0: /* use inflate_fast() if we have enough input and output */
sl@0: if (have >= 6 && left >= 258) {
sl@0: RESTORE();
sl@0: if (state->whave < state->wsize)
sl@0: state->whave = state->wsize - left;
sl@0: inflate_fast(strm, state->wsize);
sl@0: LOAD();
sl@0: break;
sl@0: }
sl@0:
sl@0: /* get a literal, length, or end-of-block code */
sl@0: for (;;) {
sl@0: this = state->lencode[BITS(state->lenbits)];
sl@0: if ((unsigned)(this.bits) <= bits) break;
sl@0: PULLBYTE();
sl@0: }
sl@0: if (this.op && (this.op & 0xf0) == 0) {
sl@0: last = this;
sl@0: for (;;) {
sl@0: this = state->lencode[last.val +
sl@0: (BITS(last.bits + last.op) >> last.bits)];
sl@0: if ((unsigned)(last.bits + this.bits) <= bits) break;
sl@0: PULLBYTE();
sl@0: }
sl@0: DROPBITS(last.bits);
sl@0: }
sl@0: DROPBITS(this.bits);
sl@0: state->length = (unsigned)this.val;
sl@0:
sl@0: /* process literal */
sl@0: if (this.op == 0) {
sl@0: Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?
sl@0: "inflate: literal '%c'\n" :
sl@0: "inflate: literal 0x%02x\n", this.val));
sl@0: ROOM();
sl@0: *put++ = (unsigned char)(state->length);
sl@0: left--;
sl@0: state->mode = LEN;
sl@0: break;
sl@0: }
sl@0:
sl@0: /* process end of block */
sl@0: if (this.op & 32) {
sl@0: Tracevv((stderr, "inflate: end of block\n"));
sl@0: state->mode = TYPE;
sl@0: break;
sl@0: }
sl@0:
sl@0: /* invalid code */
sl@0: if (this.op & 64) {
sl@0: strm->msg = (char *)"invalid literal/length code";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0:
sl@0: /* length code -- get extra bits, if any */
sl@0: state->extra = (unsigned)(this.op) & 15;
sl@0: if (state->extra != 0) {
sl@0: NEEDBITS(state->extra);
sl@0: state->length += BITS(state->extra);
sl@0: DROPBITS(state->extra);
sl@0: }
sl@0: Tracevv((stderr, "inflate: length %u\n", state->length));
sl@0:
sl@0: /* get distance code */
sl@0: for (;;) {
sl@0: this = state->distcode[BITS(state->distbits)];
sl@0: if ((unsigned)(this.bits) <= bits) break;
sl@0: PULLBYTE();
sl@0: }
sl@0: if ((this.op & 0xf0) == 0) {
sl@0: last = this;
sl@0: for (;;) {
sl@0: this = state->distcode[last.val +
sl@0: (BITS(last.bits + last.op) >> last.bits)];
sl@0: if ((unsigned)(last.bits + this.bits) <= bits) break;
sl@0: PULLBYTE();
sl@0: }
sl@0: DROPBITS(last.bits);
sl@0: }
sl@0: DROPBITS(this.bits);
sl@0: if (this.op & 64) {
sl@0: strm->msg = (char *)"invalid distance code";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0: state->offset = (unsigned)this.val;
sl@0:
sl@0: /* get distance extra bits, if any */
sl@0: state->extra = (unsigned)(this.op) & 15;
sl@0: if (state->extra != 0) {
sl@0: NEEDBITS(state->extra);
sl@0: state->offset += BITS(state->extra);
sl@0: DROPBITS(state->extra);
sl@0: }
sl@0: if (state->offset > state->wsize - (state->whave < state->wsize ?
sl@0: left : 0)) {
sl@0: strm->msg = (char *)"invalid distance too far back";
sl@0: state->mode = BAD;
sl@0: break;
sl@0: }
sl@0: Tracevv((stderr, "inflate: distance %u\n", state->offset));
sl@0:
sl@0: /* copy match from window to output */
sl@0: do {
sl@0: ROOM();
sl@0: copy = state->wsize - state->offset;
sl@0: if (copy < left) {
sl@0: from = put + copy;
sl@0: copy = left - copy;
sl@0: }
sl@0: else {
sl@0: from = put - state->offset;
sl@0: copy = left;
sl@0: }
sl@0: if (copy > state->length) copy = state->length;
sl@0: state->length -= copy;
sl@0: left -= copy;
sl@0: do {
sl@0: *put++ = *from++;
sl@0: } while (--copy);
sl@0: } while (state->length != 0);
sl@0: break;
sl@0:
sl@0: case DONE:
sl@0: /* inflate stream terminated properly -- write leftover output */
sl@0: ret = Z_STREAM_END;
sl@0: if (left < state->wsize) {
sl@0: if (out(out_desc, state->window, state->wsize - left))
sl@0: ret = Z_BUF_ERROR;
sl@0: }
sl@0: goto inf_leave;
sl@0:
sl@0: case BAD:
sl@0: ret = Z_DATA_ERROR;
sl@0: goto inf_leave;
sl@0:
sl@0: default: /* can't happen, but makes compilers happy */
sl@0: ret = Z_STREAM_ERROR;
sl@0: goto inf_leave;
sl@0: }
sl@0:
sl@0: /* Return unused input */
sl@0: inf_leave:
sl@0: strm->next_in = next;
sl@0: strm->avail_in = have;
sl@0: return ret;
sl@0: }
sl@0:
sl@0:
sl@0: #ifdef __SYMBIAN32__
sl@0: EXPORT_C int inflateBackEnd_r(z_streamp strm)
sl@0: #else
sl@0: int ZEXPORT inflateBackEnd(strm)
sl@0: z_streamp strm;
sl@0: #endif //__SYMBIAN32__
sl@0: {
sl@0: if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
sl@0: return Z_STREAM_ERROR;
sl@0: ZFREE(strm, strm->state);
sl@0: strm->state = Z_NULL;
sl@0: Tracev((stderr, "inflate: end\n"));
sl@0: return Z_OK;
sl@0: }