/* tinfl.c v1.11 - public domain inflate with zlib header parsing/adler32 checking (inflate-only subset of miniz.c)

See "unlicense" statement at the end of this file.

Rich Geldreich <richgel99@gmail.com>, last updated May 20, 2011

Implements RFC 1950: http://www.ietf.org/rfc/rfc1950.txt and RFC 1951: http://www.ietf.org/rfc/rfc1951.txt

The entire decompressor coroutine is implemented in tinfl_decompress(). The other functions are optional high-level helpers.

*/

#ifndef TINFL_HEADER_INCLUDED

#define TINFL_HEADER_INCLUDED

typedef PHYSFS_uint8 mz_uint8;

typedef PHYSFS_sint16 mz_int16;

typedef PHYSFS_uint16 mz_uint16;

typedef PHYSFS_uint32 mz_uint32;

typedef unsigned int mz_uint;

typedef PHYSFS_uint64 mz_uint64;

/* For more compatibility with zlib, miniz.c uses unsigned long for some parameters/struct members. */

typedef unsigned long mz_ulong;

/* Heap allocation callbacks. */

typedef void *(*mz_alloc_func)(void *opaque, unsigned int items, unsigned int size);

typedef void (*mz_free_func)(void *opaque, void *address);

#if defined(_M_IX86) || defined(_M_X64)

/* Set MINIZ_USE_UNALIGNED_LOADS_AND_STORES to 1 if integer loads and stores to unaligned addresses are acceptable on the target platform (slightly faster). */

#define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1

/* Set MINIZ_LITTLE_ENDIAN to 1 if the processor is little endian. */

#define MINIZ_LITTLE_ENDIAN 1

#endif

#if defined(_WIN64) || defined(__MINGW64__) || defined(_LP64) || defined(__LP64__)

/* Set MINIZ_HAS_64BIT_REGISTERS to 1 if the processor has 64-bit general purpose registers (enables 64-bit bitbuffer in inflator) */

#define MINIZ_HAS_64BIT_REGISTERS 1

#endif

/* Works around MSVC's spammy "warning C4127: conditional expression is constant" message. */

#ifdef _MSC_VER

#define MZ_MACRO_END while (0, 0)

#else

#define MZ_MACRO_END while (0)

#endif

/* Decompression flags. */

enum

{

TINFL_FLAG_PARSE_ZLIB_HEADER = 1,

TINFL_FLAG_HAS_MORE_INPUT = 2,

TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF = 4,

TINFL_FLAG_COMPUTE_ADLER32 = 8

};

struct tinfl_decompressor_tag; typedef struct tinfl_decompressor_tag tinfl_decompressor;

/* Max size of LZ dictionary. */

#define TINFL_LZ_DICT_SIZE 32768

/* Return status. */

typedef enum

{

TINFL_STATUS_BAD_PARAM = -3,

TINFL_STATUS_ADLER32_MISMATCH = -2,

TINFL_STATUS_FAILED = -1,

TINFL_STATUS_DONE = 0,

TINFL_STATUS_NEEDS_MORE_INPUT = 1,

TINFL_STATUS_HAS_MORE_OUTPUT = 2

} tinfl_status;

/* Initializes the decompressor to its initial state. */

#define tinfl_init(r) do { (r)->m_state = 0; } MZ_MACRO_END

#define tinfl_get_adler32(r) (r)->m_check_adler32

/* Main low-level decompressor coroutine function. This is the only function actually needed for decompression. All the other functions are just high-level helpers for improved usability. */

/* This is a universal API, i.e. it can be used as a building block to build any desired higher level decompression API. In the limit case, it can be called once per every byte input or output. */

static tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_next, size_t *pIn_buf_size, mz_uint8 *pOut_buf_start, mz_uint8 *pOut_buf_next, size_t *pOut_buf_size, const mz_uint32 decomp_flags);

/* Internal/private bits follow. */

enum

{

TINFL_MAX_HUFF_TABLES = 3, TINFL_MAX_HUFF_SYMBOLS_0 = 288, TINFL_MAX_HUFF_SYMBOLS_1 = 32, TINFL_MAX_HUFF_SYMBOLS_2 = 19,

TINFL_FAST_LOOKUP_BITS = 10, TINFL_FAST_LOOKUP_SIZE = 1 << TINFL_FAST_LOOKUP_BITS

};

typedef struct

{

mz_uint8 m_code_size[TINFL_MAX_HUFF_SYMBOLS_0];

mz_int16 m_look_up[TINFL_FAST_LOOKUP_SIZE], m_tree[TINFL_MAX_HUFF_SYMBOLS_0 * 2];

} tinfl_huff_table;

#if MINIZ_HAS_64BIT_REGISTERS

#define TINFL_USE_64BIT_BITBUF 1

#endif

#if TINFL_USE_64BIT_BITBUF

typedef mz_uint64 tinfl_bit_buf_t;

#define TINFL_BITBUF_SIZE (64)

#else

typedef mz_uint32 tinfl_bit_buf_t;

#define TINFL_BITBUF_SIZE (32)

#endif

struct tinfl_decompressor_tag

};

#endif /* #ifdef TINFL_HEADER_INCLUDED */

/* ------------------- End of Header: Implementation follows. (If you only want the header, define MINIZ_HEADER_FILE_ONLY.) */

#ifndef TINFL_HEADER_FILE_ONLY

#define MZ_MAX(a,b) (((a)>(b))?(a):(b))

#define MZ_MIN(a,b) (((a)<(b))?(a):(b))

#define MZ_CLEAR_OBJ(obj) memset(&(obj), 0, sizeof(obj))

#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN

#define MZ_READ_LE16(p) *((const mz_uint16 *)(p))

#define MZ_READ_LE32(p) *((const mz_uint32 *)(p))

#else

#define MZ_READ_LE16(p) ((mz_uint32)(((const mz_uint8 *)(p))[0]) | ((mz_uint32)(((const mz_uint8 *)(p))[1]) << 8U))

#define MZ_READ_LE32(p) ((mz_uint32)(((const mz_uint8 *)(p))[0]) | ((mz_uint32)(((const mz_uint8 *)(p))[1]) << 8U) | ((mz_uint32)(((const mz_uint8 *)(p))[2]) << 16U) | ((mz_uint32)(((const mz_uint8 *)(p))[3]) << 24U))

#endif

#define TINFL_MEMCPY(d, s, l) memcpy(d, s, l)

#define TINFL_MEMSET(p, c, l) memset(p, c, l)

#define TINFL_CR_BEGIN switch(r->m_state) { case 0:

#define TINFL_CR_RETURN(state_index, result) do { status = result; r->m_state = state_index; goto common_exit; case state_index:; } MZ_MACRO_END

#define TINFL_CR_RETURN_FOREVER(state_index, result) do { for ( ; ; ) { TINFL_CR_RETURN(state_index, result); } } MZ_MACRO_END

#define TINFL_CR_FINISH }

/* TODO: If the caller has indicated that there's no more input, and we attempt to read beyond the input buf, then something is wrong with the input because the inflator never */

/* reads ahead more than it needs to. Currently TINFL_GET_BYTE() pads the end of the stream with 0's in this scenario. */

#define TINFL_GET_BYTE(state_index, c) do { \

if (pIn_buf_cur >= pIn_buf_end) { \

for ( ; ; ) { \

if (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) { \

TINFL_CR_RETURN(state_index, TINFL_STATUS_NEEDS_MORE_INPUT); \

if (pIn_buf_cur < pIn_buf_end) { \

c = *pIn_buf_cur++; \

break; \

} \

} else { \

c = 0; \

break; \

} \

} \

} else c = *pIn_buf_cur++; } MZ_MACRO_END

#define TINFL_NEED_BITS(state_index, n) do { mz_uint c; TINFL_GET_BYTE(state_index, c); bit_buf |= (((tinfl_bit_buf_t)c) << num_bits); num_bits += 8; } while (num_bits < (mz_uint)(n))

#define TINFL_SKIP_BITS(state_index, n) do { if (num_bits < (mz_uint)(n)) { TINFL_NEED_BITS(state_index, n); } bit_buf >>= (n); num_bits -= (n); } MZ_MACRO_END

#define TINFL_GET_BITS(state_index, b, n) do { if (num_bits < (mz_uint)(n)) { TINFL_NEED_BITS(state_index, n); } b = bit_buf & ((1 << (n)) - 1); bit_buf >>= (n); num_bits -= (n); } MZ_MACRO_END

/* TINFL_HUFF_BITBUF_FILL() is only used rarely, when the number of bytes remaining in the input buffer falls below 2. */

/* It reads just enough bytes from the input stream that are needed to decode the next Huffman code (and absolutely no more). It works by trying to fully decode a */

/* Huffman code by using whatever bits are currently present in the bit buffer. If this fails, it reads another byte, and tries again until it succeeds or until the */

/* bit buffer contains >=15 bits (deflate's max. Huffman code size). */

#define TINFL_HUFF_BITBUF_FILL(state_index, pHuff) \

do { \

temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]; \

if (temp >= 0) { \

code_len = temp >> 9; \

if ((code_len) && (num_bits >= code_len)) \

break; \

} else if (num_bits > TINFL_FAST_LOOKUP_BITS) { \

code_len = TINFL_FAST_LOOKUP_BITS; \

do { \

temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)]; \

} while ((temp < 0) && (num_bits >= (code_len + 1))); if (temp >= 0) break; \

} TINFL_GET_BYTE(state_index, c); bit_buf |= (((tinfl_bit_buf_t)c) << num_bits); num_bits += 8; \

} while (num_bits < 15);

/* TINFL_HUFF_DECODE() decodes the next Huffman coded symbol. It's more complex than you would initially expect because the zlib API expects the decompressor to never read */

/* beyond the final byte of the deflate stream. (In other words, when this macro wants to read another byte from the input, it REALLY needs another byte in order to fully */

/* decode the next Huffman code.) Handling this properly is particularly important on raw deflate (non-zlib) streams, which aren't followed by a byte aligned adler-32. */

/* The slow path is only executed at the very end of the input buffer. */

#define TINFL_HUFF_DECODE(state_index, sym, pHuff) do { \

int temp; mz_uint code_len, c; \

if (num_bits < 15) { \

if ((pIn_buf_end - pIn_buf_cur) < 2) { \

TINFL_HUFF_BITBUF_FILL(state_index, pHuff); \

} else { \

bit_buf |= (((tinfl_bit_buf_t)pIn_buf_cur[0]) << num_bits) | (((tinfl_bit_buf_t)pIn_buf_cur[1]) << (num_bits + 8)); pIn_buf_cur += 2; num_bits += 16; \

} \

} \

if ((temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0) \

code_len = temp >> 9, temp &= 511; \

else { \

code_len = TINFL_FAST_LOOKUP_BITS; do { temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)]; } while (temp < 0); \

} sym = temp; bit_buf >>= code_len; num_bits -= code_len; } MZ_MACRO_END

static tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_next, size_t *pIn_buf_size, mz_uint8 *pOut_buf_start, mz_uint8 *pOut_buf_next, size_t *pOut_buf_size, const mz_uint32 decomp_flags)

{

static const int s_length_base[31] = { 3,4,5,6,7,8,9,10,11,13, 15,17,19,23,27,31,35,43,51,59, 67,83,99,115,131,163,195,227,258,0,0 };

static const int s_length_extra[31]= { 0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0,0,0 };

static const int s_dist_base[32] = { 1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193, 257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0};

static const int s_dist_extra[32] = { 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13};

static const mz_uint8 s_length_dezigzag[19] = { 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15 };

static const int s_min_table_sizes[3] = { 257, 1, 4 };

tinfl_status status = TINFL_STATUS_FAILED; mz_uint32 num_bits, dist, counter, num_extra; tinfl_bit_buf_t bit_buf;

const mz_uint8 *pIn_buf_cur = pIn_buf_next, *const pIn_buf_end = pIn_buf_next + *pIn_buf_size;

mz_uint8 *pOut_buf_cur = pOut_buf_next, *const pOut_buf_end = pOut_buf_next + *pOut_buf_size;

size_t out_buf_size_mask = (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF) ? (size_t)-1 : ((pOut_buf_next - pOut_buf_start) + *pOut_buf_size) - 1, dist_from_out_buf_start;

/* Ensure the output buffer's size is a power of 2, unless the output buffer is large enough to hold the entire output file (in which case it doesn't matter). */

if (((out_buf_size_mask + 1) & out_buf_size_mask) || (pOut_buf_next < pOut_buf_start)) { *pIn_buf_size = *pOut_buf_size = 0; return TINFL_STATUS_BAD_PARAM; }

num_bits = r->m_num_bits; bit_buf = r->m_bit_buf; dist = r->m_dist; counter = r->m_counter; num_extra = r->m_num_extra; dist_from_out_buf_start = r->m_dist_from_out_buf_start;

TINFL_CR_BEGIN

bit_buf = num_bits = dist = counter = num_extra = r->m_zhdr0 = r->m_zhdr1 = 0; r->m_z_adler32 = r->m_check_adler32 = 1;

if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER)

{

TINFL_GET_BYTE(1, r->m_zhdr0); TINFL_GET_BYTE(2, r->m_zhdr1);

counter = (((r->m_zhdr0 * 256 + r->m_zhdr1) % 31 != 0) || (r->m_zhdr1 & 32) || ((r->m_zhdr0 & 15) != 8));

if (!(decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF)) counter |= (((1U << (8U + (r->m_zhdr0 >> 4))) > 32768U) || ((out_buf_size_mask + 1) < (size_t)(1U << (8U + (r->m_zhdr0 >> 4)))));

if (counter) { TINFL_CR_RETURN_FOREVER(36, TINFL_STATUS_FAILED); }

}

do

{

TINFL_GET_BITS(3, r->m_final, 3); r->m_type = r->m_final >> 1;

if (r->m_type == 0)

{

TINFL_SKIP_BITS(5, num_bits & 7);

for (counter = 0; counter < 4; ++counter) { if (num_bits) TINFL_GET_BITS(6, r->m_raw_header[counter], 8); else TINFL_GET_BYTE(7, r->m_raw_header[counter]); }

if ((counter = (r->m_raw_header[0] | (r->m_raw_header[1] << 8))) != (mz_uint)(0xFFFF ^ (r->m_raw_header[2] | (r->m_raw_header[3] << 8)))) { TINFL_CR_RETURN_FOREVER(39, TINFL_STATUS_FAILED); }

while ((counter) && (num_bits))

{

TINFL_GET_BITS(51, dist, 8);

while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(52, TINFL_STATUS_HAS_MORE_OUTPUT); }

*pOut_buf_cur++ = (mz_uint8)dist;

counter--;

}

while (counter)

{

size_t n; while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(9, TINFL_STATUS_HAS_MORE_OUTPUT); }

while (pIn_buf_cur >= pIn_buf_end)

{

if (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT)

{

TINFL_CR_RETURN(38, TINFL_STATUS_NEEDS_MORE_INPUT);

}

else

{

TINFL_CR_RETURN_FOREVER(40, TINFL_STATUS_FAILED);

}

}

n = MZ_MIN(MZ_MIN((size_t)(pOut_buf_end - pOut_buf_cur), (size_t)(pIn_buf_end - pIn_buf_cur)), counter);

TINFL_MEMCPY(pOut_buf_cur, pIn_buf_cur, n); pIn_buf_cur += n; pOut_buf_cur += n; counter -= (mz_uint)n;

}

}

else if (r->m_type == 3)

{

TINFL_CR_RETURN_FOREVER(10, TINFL_STATUS_FAILED);

}

else

{

if (r->m_type == 1)

{

mz_uint8 *p = r->m_tables[0].m_code_size; mz_uint i;

r->m_table_sizes[0] = 288; r->m_table_sizes[1] = 32; TINFL_MEMSET(r->m_tables[1].m_code_size, 5, 32);

for ( i = 0; i <= 143; ++i) *p++ = 8; for ( ; i <= 255; ++i) *p++ = 9; for ( ; i <= 279; ++i) *p++ = 7; for ( ; i <= 287; ++i) *p++ = 8;

}

else

{

for (counter = 0; counter < 3; counter++) { TINFL_GET_BITS(11, r->m_table_sizes[counter], "\05\05\04"[counter]); r->m_table_sizes[counter] += s_min_table_sizes[counter]; }

MZ_CLEAR_OBJ(r->m_tables[2].m_code_size); for (counter = 0; counter < r->m_table_sizes[2]; counter++) { mz_uint s; TINFL_GET_BITS(14, s, 3); r->m_tables[2].m_code_size[s_length_dezigzag[counter]] = (mz_uint8)s; }

r->m_table_sizes[2] = 19;

}

for ( ; (int)r->m_type >= 0; r->m_type--)

{

int tree_next, tree_cur; tinfl_huff_table *pTable;

mz_uint i, j, used_syms, total, sym_index, next_code[17], total_syms[16]; pTable = &r->m_tables[r->m_type]; MZ_CLEAR_OBJ(total_syms); MZ_CLEAR_OBJ(pTable->m_look_up); MZ_CLEAR_OBJ(pTable->m_tree);

for (i = 0; i < r->m_table_sizes[r->m_type]; ++i) total_syms[pTable->m_code_size[i]]++;

used_syms = 0, total = 0; next_code[0] = next_code[1] = 0;

for (i = 1; i <= 15; ++i) { used_syms += total_syms[i]; next_code[i + 1] = (total = ((total + total_syms[i]) << 1)); }

if ((65536 != total) && (used_syms > 1))

{

TINFL_CR_RETURN_FOREVER(35, TINFL_STATUS_FAILED);

}

for (tree_next = -1, sym_index = 0; sym_index < r->m_table_sizes[r->m_type]; ++sym_index)

{

mz_uint rev_code = 0, l, cur_code, code_size = pTable->m_code_size[sym_index]; if (!code_size) continue;

cur_code = next_code[code_size]++; for (l = code_size; l > 0; l--, cur_code >>= 1) rev_code = (rev_code << 1) | (cur_code & 1);

if (code_size <= TINFL_FAST_LOOKUP_BITS) { mz_int16 k = (mz_int16)((code_size << 9) | sym_index); while (rev_code < TINFL_FAST_LOOKUP_SIZE) { pTable->m_look_up[rev_code] = k; rev_code += (1 << code_size); } continue; }

if (0 == (tree_cur = pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)])) { pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = (mz_int16)tree_next; tree_cur = tree_next; tree_next -= 2; }

rev_code >>= (TINFL_FAST_LOOKUP_BITS - 1);

for (j = code_size; j > (TINFL_FAST_LOOKUP_BITS + 1); j--)

{

tree_cur -= ((rev_code >>= 1) & 1);

if (!pTable->m_tree[-tree_cur - 1]) { pTable->m_tree[-tree_cur - 1] = (mz_int16)tree_next; tree_cur = tree_next; tree_next -= 2; } else tree_cur = pTable->m_tree[-tree_cur - 1];

}

tree_cur -= ((rev_code >>= 1) & 1); pTable->m_tree[-tree_cur - 1] = (mz_int16)sym_index;

}

if (r->m_type == 2)

{

for (counter = 0; counter < (r->m_table_sizes[0] + r->m_table_sizes[1]); )

{

mz_uint s; TINFL_HUFF_DECODE(16, dist, &r->m_tables[2]); if (dist < 16) { r->m_len_codes[counter++] = (mz_uint8)dist; continue; }

if ((dist == 16) && (!counter))

{

TINFL_CR_RETURN_FOREVER(17, TINFL_STATUS_FAILED);

}

num_extra = "\02\03\07"[dist - 16]; TINFL_GET_BITS(18, s, num_extra); s += "\03\03\013"[dist - 16];

TINFL_MEMSET(r->m_len_codes + counter, (dist == 16) ? r->m_len_codes[counter - 1] : 0, s); counter += s;

}

if ((r->m_table_sizes[0] + r->m_table_sizes[1]) != counter)

{

TINFL_CR_RETURN_FOREVER(21, TINFL_STATUS_FAILED);

}

TINFL_MEMCPY(r->m_tables[0].m_code_size, r->m_len_codes, r->m_table_sizes[0]); TINFL_MEMCPY(r->m_tables[1].m_code_size, r->m_len_codes + r->m_table_sizes[0], r->m_table_sizes[1]);

}

}

for ( ; ; )

{

mz_uint8 *pSrc;

for ( ; ; )

{

if (((pIn_buf_end - pIn_buf_cur) < 4) || ((pOut_buf_end - pOut_buf_cur) < 2))

{

TINFL_HUFF_DECODE(23, counter, &r->m_tables[0]);

if (counter >= 256)

break;

while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(24, TINFL_STATUS_HAS_MORE_OUTPUT); }

*pOut_buf_cur++ = (mz_uint8)counter;

}

else

{

int sym2; mz_uint code_len;

#if TINFL_USE_64BIT_BITBUF

if (num_bits < 30) { bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE32(pIn_buf_cur)) << num_bits); pIn_buf_cur += 4; num_bits += 32; }

#else

if (num_bits < 15) { bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE16(pIn_buf_cur)) << num_bits); pIn_buf_cur += 2; num_bits += 16; }

#endif

if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)

code_len = sym2 >> 9;

else

{

code_len = TINFL_FAST_LOOKUP_BITS; do { sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)]; } while (sym2 < 0);

}

counter = sym2; bit_buf >>= code_len; num_bits -= code_len;

if (counter & 256)

break;

#if !TINFL_USE_64BIT_BITBUF

if (num_bits < 15) { bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE16(pIn_buf_cur)) << num_bits); pIn_buf_cur += 2; num_bits += 16; }

#endif

if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)

code_len = sym2 >> 9;

else

{

code_len = TINFL_FAST_LOOKUP_BITS; do { sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)]; } while (sym2 < 0);

}

bit_buf >>= code_len; num_bits -= code_len;

pOut_buf_cur[0] = (mz_uint8)counter;

if (sym2 & 256)

{

pOut_buf_cur++;

counter = sym2;

break;

}

pOut_buf_cur[1] = (mz_uint8)sym2;

pOut_buf_cur += 2;

}

}

if ((counter &= 511) == 256) break;

num_extra = s_length_extra[counter - 257]; counter = s_length_base[counter - 257];

if (num_extra) { mz_uint extra_bits; TINFL_GET_BITS(25, extra_bits, num_extra); counter += extra_bits; }

TINFL_HUFF_DECODE(26, dist, &r->m_tables[1]);

num_extra = s_dist_extra[dist]; dist = s_dist_base[dist];

if (num_extra) { mz_uint extra_bits; TINFL_GET_BITS(27, extra_bits, num_extra); dist += extra_bits; }

dist_from_out_buf_start = pOut_buf_cur - pOut_buf_start;

if ((dist > dist_from_out_buf_start) && (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF))

{

TINFL_CR_RETURN_FOREVER(37, TINFL_STATUS_FAILED);

}

pSrc = pOut_buf_start + ((dist_from_out_buf_start - dist) & out_buf_size_mask);

if ((MZ_MAX(pOut_buf_cur, pSrc) + counter) > pOut_buf_end)

{

while (counter--)

{

while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(53, TINFL_STATUS_HAS_MORE_OUTPUT); }

*pOut_buf_cur++ = pOut_buf_start[(dist_from_out_buf_start++ - dist) & out_buf_size_mask];

}

continue;

}

#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES

else if ((counter >= 9) && (counter <= dist))

{

const mz_uint8 *pSrc_end = pSrc + (counter & ~7);

do

{

((mz_uint32 *)pOut_buf_cur)[0] = ((const mz_uint32 *)pSrc)[0];

((mz_uint32 *)pOut_buf_cur)[1] = ((const mz_uint32 *)pSrc)[1];

pOut_buf_cur += 8;

} while ((pSrc += 8) < pSrc_end);

if ((counter &= 7) < 3)

{

if (counter)

{

pOut_buf_cur[0] = pSrc[0];

if (counter > 1)

pOut_buf_cur[1] = pSrc[1];

pOut_buf_cur += counter;

}

continue;

}

}

#endif

do

{

pOut_buf_cur[0] = pSrc[0];

pOut_buf_cur[1] = pSrc[1];

pOut_buf_cur[2] = pSrc[2];

pOut_buf_cur += 3; pSrc += 3;

} while ((int)(counter -= 3) > 2);

if ((int)counter > 0)

{

pOut_buf_cur[0] = pSrc[0];

if ((int)counter > 1)

pOut_buf_cur[1] = pSrc[1];

pOut_buf_cur += counter;

}

}

}

} while (!(r->m_final & 1));

if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER)

{

TINFL_SKIP_BITS(32, num_bits & 7); for (counter = 0; counter < 4; ++counter) { mz_uint s; if (num_bits) TINFL_GET_BITS(41, s, 8); else TINFL_GET_BYTE(42, s); r->m_z_adler32 = (r->m_z_adler32 << 8) | s; }

}

TINFL_CR_RETURN_FOREVER(34, TINFL_STATUS_DONE);

TINFL_CR_FINISH

common_exit:

r->m_num_bits = num_bits; r->m_bit_buf = bit_buf; r->m_dist = dist; r->m_counter = counter; r->m_num_extra = num_extra; r->m_dist_from_out_buf_start = dist_from_out_buf_start;

*pIn_buf_size = pIn_buf_cur - pIn_buf_next; *pOut_buf_size = pOut_buf_cur - pOut_buf_next;

if ((decomp_flags & (TINFL_FLAG_PARSE_ZLIB_HEADER | TINFL_FLAG_COMPUTE_ADLER32)) && (status >= 0))

{

const mz_uint8 *ptr = pOut_buf_next; size_t buf_len = *pOut_buf_size;

mz_uint32 i, s1 = r->m_check_adler32 & 0xffff, s2 = r->m_check_adler32 >> 16; size_t block_len = buf_len % 5552;

while (buf_len)

{

for (i = 0; i + 7 < block_len; i += 8, ptr += 8)

{

s1 += ptr[0], s2 += s1; s1 += ptr[1], s2 += s1; s1 += ptr[2], s2 += s1; s1 += ptr[3], s2 += s1;

s1 += ptr[4], s2 += s1; s1 += ptr[5], s2 += s1; s1 += ptr[6], s2 += s1; s1 += ptr[7], s2 += s1;

}

for ( ; i < block_len; ++i) s1 += *ptr++, s2 += s1;

s1 %= 65521U, s2 %= 65521U; buf_len -= block_len; block_len = 5552;

}

r->m_check_adler32 = (s2 << 16) + s1; if ((status == TINFL_STATUS_DONE) && (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER) && (r->m_check_adler32 != r->m_z_adler32)) status = TINFL_STATUS_ADLER32_MISMATCH;

}

return status;

}

/* Flush values. For typical usage you only need MZ_NO_FLUSH and MZ_FINISH. The other stuff is for advanced use. */

enum { MZ_NO_FLUSH = 0, MZ_PARTIAL_FLUSH = 1, MZ_SYNC_FLUSH = 2, MZ_FULL_FLUSH = 3, MZ_FINISH = 4, MZ_BLOCK = 5 };

/* Return status codes. MZ_PARAM_ERROR is non-standard. */

enum { MZ_OK = 0, MZ_STREAM_END = 1, MZ_NEED_DICT = 2, MZ_ERRNO = -1, MZ_STREAM_ERROR = -2, MZ_DATA_ERROR = -3, MZ_MEM_ERROR = -4, MZ_BUF_ERROR = -5, MZ_VERSION_ERROR = -6, MZ_PARAM_ERROR = -10000 };

/* Compression levels. */

enum { MZ_NO_COMPRESSION = 0, MZ_BEST_SPEED = 1, MZ_BEST_COMPRESSION = 9, MZ_DEFAULT_COMPRESSION = -1 };

/* Window bits */

#define MZ_DEFAULT_WINDOW_BITS 15

struct mz_internal_state;

/* Compression/decompression stream struct. */

typedef struct mz_stream_s

} mz_stream;

typedef mz_stream *mz_streamp;

typedef struct

{

tinfl_decompressor m_decomp;

mz_uint m_dict_ofs, m_dict_avail, m_first_call, m_has_flushed; int m_window_bits;

mz_uint8 m_dict[TINFL_LZ_DICT_SIZE];

tinfl_status m_last_status;

} inflate_state;

static int mz_inflateInit2(mz_streamp pStream, int window_bits)

{

inflate_state *pDecomp;

if (!pStream) return MZ_STREAM_ERROR;

if ((window_bits != MZ_DEFAULT_WINDOW_BITS) && (-window_bits != MZ_DEFAULT_WINDOW_BITS)) return MZ_PARAM_ERROR;

pStream->data_type = 0;

pStream->adler = 0;

pStream->msg = NULL;

pStream->total_in = 0;

pStream->total_out = 0;

pStream->reserved = 0;

/* if (!pStream->zalloc) pStream->zalloc = def_alloc_func; */

/* if (!pStream->zfree) pStream->zfree = def_free_func; */

pDecomp = (inflate_state*)pStream->zalloc(pStream->opaque, 1, sizeof(inflate_state));

if (!pDecomp) return MZ_MEM_ERROR;

pStream->state = (struct mz_internal_state *)pDecomp;

tinfl_init(&pDecomp->m_decomp);

pDecomp->m_dict_ofs = 0;

pDecomp->m_dict_avail = 0;

pDecomp->m_last_status = TINFL_STATUS_NEEDS_MORE_INPUT;

pDecomp->m_first_call = 1;

pDecomp->m_has_flushed = 0;

pDecomp->m_window_bits = window_bits;

return MZ_OK;

}

static int mz_inflate(mz_streamp pStream, int flush)

{

inflate_state* pState;

mz_uint n, first_call, decomp_flags = TINFL_FLAG_COMPUTE_ADLER32;

size_t in_bytes, out_bytes, orig_avail_in;

tinfl_status status;

if ((!pStream) || (!pStream->state)) return MZ_STREAM_ERROR;

if (flush == MZ_PARTIAL_FLUSH) flush = MZ_SYNC_FLUSH;

if ((flush) && (flush != MZ_SYNC_FLUSH) && (flush != MZ_FINISH)) return MZ_STREAM_ERROR;

pState = (inflate_state*)pStream->state;

if (pState->m_window_bits > 0) decomp_flags |= TINFL_FLAG_PARSE_ZLIB_HEADER;

orig_avail_in = pStream->avail_in;

first_call = pState->m_first_call; pState->m_first_call = 0;

if (pState->m_last_status < 0) return MZ_DATA_ERROR;

if (pState->m_has_flushed && (flush != MZ_FINISH)) return MZ_STREAM_ERROR;

pState->m_has_flushed |= (flush == MZ_FINISH);

if ((flush == MZ_FINISH) && (first_call))

{

/* MZ_FINISH on the first call implies that the input and output buffers are large enough to hold the entire compressed/decompressed file. */

decomp_flags |= TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF;

in_bytes = pStream->avail_in; out_bytes = pStream->avail_out;

status = tinfl_decompress(&pState->m_decomp, pStream->next_in, &in_bytes, pStream->next_out, pStream->next_out, &out_bytes, decomp_flags);

pState->m_last_status = status;

pStream->next_in += (mz_uint)in_bytes; pStream->avail_in -= (mz_uint)in_bytes; pStream->total_in += (mz_uint)in_bytes;

pStream->adler = tinfl_get_adler32(&pState->m_decomp);

pStream->next_out += (mz_uint)out_bytes; pStream->avail_out -= (mz_uint)out_bytes; pStream->total_out += (mz_uint)out_bytes;

if (status < 0)

return MZ_DATA_ERROR;

else if (status != TINFL_STATUS_DONE)

{

pState->m_last_status = TINFL_STATUS_FAILED;

return MZ_BUF_ERROR;

}

return MZ_STREAM_END;

}

/* flush != MZ_FINISH then we must assume there's more input. */

if (flush != MZ_FINISH) decomp_flags |= TINFL_FLAG_HAS_MORE_INPUT;

if (pState->m_dict_avail)

{

n = MZ_MIN(pState->m_dict_avail, pStream->avail_out);

memcpy(pStream->next_out, pState->m_dict + pState->m_dict_ofs, n);

pStream->next_out += n; pStream->avail_out -= n; pStream->total_out += n;

pState->m_dict_avail -= n; pState->m_dict_ofs = (pState->m_dict_ofs + n) & (TINFL_LZ_DICT_SIZE - 1);

return ((pState->m_last_status == TINFL_STATUS_DONE) && (!pState->m_dict_avail)) ? MZ_STREAM_END : MZ_OK;

}

for ( ; ; )

{

in_bytes = pStream->avail_in;

out_bytes = TINFL_LZ_DICT_SIZE - pState->m_dict_ofs;

status = tinfl_decompress(&pState->m_decomp, pStream->next_in, &in_bytes, pState->m_dict, pState->m_dict + pState->m_dict_ofs, &out_bytes, decomp_flags);

pState->m_last_status = status;

pStream->next_in += (mz_uint)in_bytes; pStream->avail_in -= (mz_uint)in_bytes;

pStream->total_in += (mz_uint)in_bytes; pStream->adler = tinfl_get_adler32(&pState->m_decomp);

pState->m_dict_avail = (mz_uint)out_bytes;

n = MZ_MIN(pState->m_dict_avail, pStream->avail_out);

memcpy(pStream->next_out, pState->m_dict + pState->m_dict_ofs, n);

pStream->next_out += n; pStream->avail_out -= n; pStream->total_out += n;

pState->m_dict_avail -= n; pState->m_dict_ofs = (pState->m_dict_ofs + n) & (TINFL_LZ_DICT_SIZE - 1);

if (status < 0)

return MZ_DATA_ERROR; /* Stream is corrupted (there could be some uncompressed data left in the output dictionary - oh well). */

else if ((status == TINFL_STATUS_NEEDS_MORE_INPUT) && (!orig_avail_in))

return MZ_BUF_ERROR; /* Signal caller that we can't make forward progress without supplying more input or by setting flush to MZ_FINISH. */

else if (flush == MZ_FINISH)

{

/* The output buffer MUST be large to hold the remaining uncompressed data when flush==MZ_FINISH. */

if (status == TINFL_STATUS_DONE)

return pState->m_dict_avail ? MZ_BUF_ERROR : MZ_STREAM_END;

/* status here must be TINFL_STATUS_HAS_MORE_OUTPUT, which means there's at least 1 more byte on the way. If there's no more room left in the output buffer then something is wrong. */

else if (!pStream->avail_out)

return MZ_BUF_ERROR;

}

else if ((status == TINFL_STATUS_DONE) || (!pStream->avail_in) || (!pStream->avail_out) || (pState->m_dict_avail))

break;

}

return ((status == TINFL_STATUS_DONE) && (!pState->m_dict_avail)) ? MZ_STREAM_END : MZ_OK;

}

static int mz_inflateEnd(mz_streamp pStream)

{

if (!pStream)

return MZ_STREAM_ERROR;

if (pStream->state)

{

pStream->zfree(pStream->opaque, pStream->state);

pStream->state = NULL;

}

return MZ_OK;

}

/* make this a drop-in replacement for zlib... */

#define voidpf void*

#define uInt unsigned int

#define z_stream mz_stream

#define inflateInit2 mz_inflateInit2

#define inflate mz_inflate

#define inflateEnd mz_inflateEnd

#define Z_SYNC_FLUSH MZ_SYNC_FLUSH

#define Z_FINISH MZ_FINISH

#define Z_OK MZ_OK

#define Z_STREAM_END MZ_STREAM_END

#define Z_NEED_DICT MZ_NEED_DICT

#define Z_ERRNO MZ_ERRNO

#define Z_STREAM_ERROR MZ_STREAM_ERROR

#define Z_DATA_ERROR MZ_DATA_ERROR

#define Z_MEM_ERROR MZ_MEM_ERROR

#define Z_BUF_ERROR MZ_BUF_ERROR

#define Z_VERSION_ERROR MZ_VERSION_ERROR

#define MAX_WBITS 15

#endif /* #ifndef TINFL_HEADER_FILE_ONLY */

/*

This is free and unencumbered software released into the public domain.

Anyone is free to copy, modify, publish, use, compile, sell, or

distribute this software, either in source code form or as a compiled

binary, for any purpose, commercial or non-commercial, and by any

means.

In jurisdictions that recognize copyright laws, the author or authors

of this software dedicate any and all copyright interest in the

software to the public domain. We make this dedication for the benefit

of the public at large and to the detriment of our heirs and

successors. We intend this dedication to be an overt act of

relinquishment in perpetuity of all present and future rights to this

software under copyright law.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,

EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF

MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.

IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR

OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,

ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR

OTHER DEALINGS IN THE SOFTWARE.

For more information, please refer to <http://unlicense.org/>

*/