The OpenD Programming Language

module gamut.codecs.miniz;

version(encodePNG)
{
    version = encodeDecodePNG;
}
version(decodePNG)
{
    version = encodeDecodePNG;
}
version(encodeDecodePNG):

// To be able to use this and win about 5% of PNG loading time, this needs:
// - to disable adler32 checking (like STB) on the PNG decoder size, with flags that trickle down
// - to pass the flags that avoids zlib header parsing if it's an iphone PNG (CgBI chunk)
// Probably we can't use the simple zlib-like wrappers for this?

/* miniz.c 3.0.0 - public domain deflate/inflate, zlib-subset, ZIP reading/writing/appending, PNG writing
   See "unlicense" statement at the end of this file.
   Rich Geldreich <richgel99@gmail.com>, last updated Oct. 13, 2013
   Implements RFC 1950: http://www.ietf.org/rfc/rfc1950.txt and RFC 1951: http://www.ietf.org/rfc/rfc1951.txt

   Most API's defined in miniz.c are optional. For example, to disable the archive related functions just define
   MINIZ_NO_ARCHIVE_APIS, or to get rid of all stdio usage define MINIZ_NO_STDIO (see the list below for more macros).

   * Low-level Deflate/Inflate implementation notes:

     Compression: Use the "tdefl" API's. The compressor supports raw, static, and dynamic blocks, lazy or
     greedy parsing, match length filtering, RLE-only, and Huffman-only streams. It performs and compresses
     approximately as well as zlib.

     Decompression: Use the "tinfl" API's. The entire decompressor is implemented as a single function
     coroutine: see tinfl_decompress(). It supports decompression into a 32KB (or larger power of 2) wrapping buffer, or into a memory
     block large enough to hold the entire file.

     The low-level tdefl/tinfl API's do not make any use of dynamic memory allocation.

   * zlib-style API notes:

     miniz.c implements a fairly large subset of zlib. There's enough functionality present for it to be a drop-in
     zlib replacement in many apps:
        The z_stream struct, optional memory allocation callbacks
        deflateInit/deflateInit2/deflate/deflateReset/deflateEnd/deflateBound
        inflateInit/inflateInit2/inflate/inflateReset/inflateEnd
        compress, compress2, compressBound, uncompress
        CRC-32, Adler-32 - Using modern, minimal code size, CPU cache friendly routines.
        Supports raw deflate streams or standard zlib streams with adler-32 checking.

     Limitations:
      The callback API's are not implemented yet. No support for gzip headers or zlib static dictionaries.
      I've tried to closely emulate zlib's various flavors of stream flushing and return status codes, but
      there are no guarantees that miniz.c pulls this off perfectly.

   * PNG writing: See the tdefl_write_image_to_png_file_in_memory() function, originally written by
     Alex Evans. Supports 1-4 bytes/pixel images.

   * ZIP archive API notes:

     The ZIP archive API's where designed with simplicity and efficiency in mind, with just enough abstraction to
     get the job done with minimal fuss. There are simple API's to retrieve file information, read files from
     existing archives, create new archives, append new files to existing archives, or clone archive data from
     one archive to another. It supports archives located in memory or the heap, on disk (using stdio.h),
     or you can specify custom file read/write callbacks.

     - Archive reading: Just call this function to read a single file from a disk archive:

      void *mz_zip_extract_archive_file_to_heap(const char *pZip_filename, const char *pArchive_name,
        size_t *pSize, mz_uint zip_flags);

     For more complex cases, use the "mz_zip_reader" functions. Upon opening an archive, the entire central
     directory is located and read as-is into memory, and subsequent file access only occurs when reading individual files.

     - Archives file scanning: The simple way is to use this function to scan a loaded archive for a specific file:

     int mz_zip_reader_locate_file(mz_zip_archive *pZip, const char *pName, const char *pComment, mz_uint flags);

     The locate operation can optionally check file comments too, which (as one example) can be used to identify
     multiple versions of the same file in an archive. This function uses a simple linear search through the central
     directory, so it's not very fast.

     Alternately, you can iterate through all the files in an archive (using mz_zip_reader_get_num_files()) and
     retrieve detailed info on each file by calling mz_zip_reader_file_stat().

     - Archive creation: Use the "mz_zip_writer" functions. The ZIP writer immediately writes compressed file data
     to disk and builds an exact image of the central directory in memory. The central directory image is written
     all at once at the end of the archive file when the archive is finalized.

     The archive writer can optionally align each file's local header and file data to any power of 2 alignment,
     which can be useful when the archive will be read from optical media. Also, the writer supports placing
     arbitrary data blobs at the very beginning of ZIP archives. Archives written using either feature are still
     readable by any ZIP tool.

     - Archive appending: The simple way to add a single file to an archive is to call this function:

      mz_bool mz_zip_add_mem_to_archive_file_in_place(const char *pZip_filename, const char *pArchive_name,
        const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags);

     The archive will be created if it doesn't already exist, otherwise it'll be appended to.
     Note the appending is done in-place and is not an atomic operation, so if something goes wrong
     during the operation it's possible the archive could be left without a central directory (although the local
     file headers and file data will be fine, so the archive will be recoverable).

     For more complex archive modification scenarios:
     1. The safest way is to use a mz_zip_reader to read the existing archive, cloning only those bits you want to
     preserve into a new archive using using the mz_zip_writer_add_from_zip_reader() function (which compiles the
     compressed file data as-is). When you're done, delete the old archive and rename the newly written archive, and
     you're done. This is safe but requires a bunch of temporary disk space or heap memory.

     2. Or, you can convert an mz_zip_reader in-place to an mz_zip_writer using mz_zip_writer_init_from_reader(),
     append new files as needed, then finalize the archive which will write an updated central directory to the
     original archive. (This is basically what mz_zip_add_mem_to_archive_file_in_place() does.) There's a
     possibility that the archive's central directory could be lost with this method if anything goes wrong, though.

     - ZIP archive support limitations:
     No spanning support. Extraction functions can only handle unencrypted, stored or deflated files.
     Requires streams capable of seeking.

   * This is a header file library, like stb_image.c. To get only a header file, either cut and paste the
     below header, or create miniz.h, #define MINIZ_HEADER_FILE_ONLY, and then include miniz.c from it.

   * Important: For best perf. be sure to customize the below macros for your target platform:
     #define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1
     #define MINIZ_LITTLE_ENDIAN 1
     #define MINIZ_HAS_64BIT_REGISTERS 1

   * On platforms using glibc, Be sure to "#define _LARGEFILE64_SOURCE 1" before including miniz.c to ensure miniz
     uses the 64-bit variants: fopen64(), stat64(), etc. Otherwise you won't be able to process large files
     (i.e. 32-bit stat() fails for me on files > 0x7FFFFFFF bytes).
*/

import core.stdc.stdlib: malloc, free, realloc;
import core.stdc.string: memset, memcpy;
import core.stdc.config: c_long, c_ulong;

nothrow @nogc:

version(LittleEndian)
    enum MINIZ_LITTLE_ENDIAN = 1;
else
    enum MINIZ_LITTLE_ENDIAN = 0;

/* ------------------- zlib-style API Definitions. */

/* For more compatibility with zlib, miniz.c uses unsigned long for some parameters/struct members. 
   Beware: mz_ulong can be either 32 or 64-bits! */
alias mz_ulong = c_ulong;

/* mz_free() internally uses the MZ_FREE() macro (which by default calls free() unless you've 
   modified the MZ_MALLOC macro) to release a block allocated from the heap. */
alias mz_free = free;

enum MZ_ADLER32_INIT = 1;
enum MZ_CRC32_INIT = 0;

/* Compression strategies. */
enum
{
    MZ_DEFAULT_STRATEGY = 0,
    MZ_FILTERED = 1,
    MZ_HUFFMAN_ONLY = 2,
    MZ_RLE = 3,
    MZ_FIXED = 4
}

/* Method */
public enum MZ_DEFLATED = 8;

/* Heap allocation callbacks.
Note that mz_alloc_func parameter types purposely differ from zlib's: items/size is size_t, not 
unsigned long. */
alias mz_alloc_func   = void* function(void *opaque, size_t items, size_t size);
alias mz_free_func    = void function(void *opaque, void *address);
alias mz_realloc_func = void* function(void *opaque, void *address, size_t items, size_t size);

void* MZ_MAX_voidp(void* a, void* b)
{
    return (((a) > (b)) ? (a) : (b));
}

int MZ_MAX_int(int a, int b)
{
    return (a > b) ? a : b;
}

size_t MZ_MAX_size_t(size_t a, size_t b)
{
    return (a > b) ? a : b;
}


mz_ulong MZ_MAX_mz_ulong(mz_ulong a, mz_ulong b)
{
    return (a > b) ? a : b;
}

int MZ_MIN_int(int a, int b)
{
    return (a < b) ? a : b;
}

uint MZ_MIN_uint(uint a, uint b)
{
    return (a < b) ? a : b;
}

size_t MZ_MIN_size_t(size_t a, size_t b)
{
    return (a < b) ? a : b;
}

/* Compression levels: 0-9 are the standard zlib-style levels, 10 is best possible compression 
   (not zlib compatible, and may be very slow), MZ_DEFAULT_COMPRESSION=MZ_DEFAULT_LEVEL. */
enum
{
    MZ_NO_COMPRESSION = 0,
    MZ_BEST_SPEED = 1,
    MZ_BEST_COMPRESSION = 9,
    MZ_UBER_COMPRESSION = 10,
    MZ_DEFAULT_LEVEL = 6,
    MZ_DEFAULT_COMPRESSION = -1
}

enum MZ_VERSION = "11.0.2";
enum MZ_VERNUM = 0xB002;
enum MZ_VER_MAJOR = 11;
enum MZ_VER_MINOR = 2;
enum MZ_VER_REVISION = 0;
enum MZ_VER_SUBREVISION = 0;

/* Flush values. For typical usage you only need MZ_NO_FLUSH and MZ_FINISH. The other values are 
   for advanced use (refer to the zlib docs). */
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
};

/* Window bits */
enum MZ_DEFAULT_WINDOW_BITS = 15;

struct mz_internal_state;

/* Compression/decompression stream struct. */
struct mz_stream
{
    const(ubyte)* next_in;     /* pointer to next byte to read */
    uint avail_in;            /* number of bytes available at next_in */
    mz_ulong total_in;        /* total number of bytes consumed so far */

    ubyte *next_out;           /* pointer to next byte to write */
    uint avail_out;           /* number of bytes that can be written to next_out */
    mz_ulong total_out;       /* total number of bytes produced so far */

    ubyte *msg;                /* error msg (unused) */
    mz_internal_state *state; /* internal state, allocated by zalloc/zfree */

    mz_alloc_func zalloc;     /* optional heap allocation function (defaults to malloc) */
    mz_free_func zfree;       /* optional heap free function (defaults to free) */
    void *opaque;             /* heap alloc function user pointer */

    int data_type;            /* data_type (unused) */
    mz_ulong adler;           /* adler32 of the source or uncompressed data */
    mz_ulong reserved;        /* not used */
}


/* Redefine zlib-compatible names to miniz equivalents, so miniz.c can be used as a drop-in 
   replacement for the subset of zlib that miniz.c supports. */

// start of miniz_common.h

/* ------------------- Types and macros */
alias mz_uint8 = ubyte;
alias mz_int16 = short;
alias mz_uint16 = ushort;
alias mz_uint32 = uint;
alias mz_uint = uint;
alias mz_int64 = long;
alias mz_uint64 = ulong;
alias mz_bool = int;

enum MZ_FALSE = 0;
enum MZ_TRUE = 1;

alias MZ_MALLOC = malloc;
alias MZ_FREE = free;
alias MZ_REALLOC = realloc;

version(LittleEndian)
{
    ushort MZ_READ_LE16(const(void)* p)
    {
        return *cast(const(mz_uint16)*)p;
    }

    uint MZ_READ_LE32(const(void)* p)
    {
        return *cast(const(mz_uint32)*)p;
    }
}
else
{
    ushort MZ_READ_LE16(const(void)* p)
    {
        // (interstingly, in miniz original source the macro return a uint32 on BigEndian and a uint16 on LittleEndian, meh)
        const(mz_uint8)* b = cast(const(ubyte)*) p;
        return b[0] | (b[1] << 8);
    }

    uint MZ_READ_LE32(const(void)* p)
    {
        const(mz_uint8)* b = cast(const(ubyte)*) p;
        return b[0] | (b[1] << 8) | (b[1] << 16) | (b[1] << 24);
    }
}

ulong MZ_READ_LE64(const(void)* p)
{
    return cast(ulong) MZ_READ_LE32(p) | ( cast(ulong)(MZ_READ_LE32( (cast(ubyte*)p) + 4)) << 32 );
}

enum MZ_UINT16_MAX = 0xFFFFU;
enum MZ_UINT32_MAX = 0xFFFFFFFFU;

// end of miniz_common.h

static assert(mz_uint16.sizeof == 2);
static assert(mz_uint32.sizeof == 4);
static assert(mz_uint64.sizeof == 8);


/* ------------------- zlib-style API's */

/* mz_adler32() returns the initial adler-32 value to use when called with ptr==null. */
mz_ulong mz_adler32(mz_ulong adler, const(ubyte) *ptr, size_t buf_len)
{
    mz_uint32 i, s1 = cast(mz_uint32)(adler & 0xffff), s2 = cast(mz_uint32)(adler >> 16);
    size_t block_len = buf_len % 5552;
    if (!ptr)
        return MZ_ADLER32_INIT;
    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;
    }
    return (s2 << 16) + s1;
}

enum compactCRC32 = false;
/* Karl Malbrain's compact CRC-32. See "A compact CCITT crc16 and crc32 C implementation that balances processor cache usage against speed": http://www.geocities.com/malbrain/ */
static if (compactCRC32)
{
    /* mz_crc32() returns the initial CRC-32 value to use when called with ptr==null. */
    mz_ulong mz_crc32(mz_ulong crc, const mz_uint8 *ptr, size_t buf_len)
    {
        __gshared static immutable mz_uint32[16] s_crc32 =
        [
            0, 0x1db71064, 0x3b6e20c8, 0x26d930ac, 0x76dc4190, 0x6b6b51f4, 0x4db26158, 0x5005713c,
            0xedb88320, 0xf00f9344, 0xd6d6a3e8, 0xcb61b38c, 0x9b64c2b0, 0x86d3d2d4, 0xa00ae278, 0xbdbdf21c
        ];
        mz_uint32 crcu32 = cast(mz_uint32)crc;
        if (!ptr)
            return MZ_CRC32_INIT;
        crcu32 = ~crcu32;
        while (buf_len--)
        {
            mz_uint8 b = *ptr++;
            crcu32 = (crcu32 >> 4) ^ s_crc32[(crcu32 & 0xF) ^ (b & 0xF)];
            crcu32 = (crcu32 >> 4) ^ s_crc32[(crcu32 & 0xF) ^ (b >> 4)];
        }
        return ~crcu32;
    }

}
else
{
    /* Faster, but larger CPU cache footprint.
       mz_crc32() returns the initial CRC-32 value to use when called with ptr==null.
     */
    mz_ulong mz_crc32(mz_ulong crc, const mz_uint8 *ptr, size_t buf_len)
    {
        __gshared static immutable mz_uint32[256] s_crc_table =
            [
              0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535,
              0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD,
              0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D,
              0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC,
              0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4,
              0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C,
              0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC,
              0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
              0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB,
              0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F,
              0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB,
              0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E,
              0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA,
              0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE,
              0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A,
              0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9,
              0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409,
              0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81,
              0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739,
              0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8,
              0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268,
              0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0,
              0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8,
              0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
              0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF,
              0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703,
              0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7,
              0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A,
              0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE,
              0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242,
              0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6,
              0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45,
              0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D,
              0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5,
              0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605,
              0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94,
              0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D
            ];

        mz_uint32 crc32 = cast(mz_uint32)crc ^ 0xFFFFFFFF;
        const(mz_uint8)*pByte_buf = cast(const(mz_uint8)*)ptr;

        while (buf_len >= 4)
        {
            crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[0]) & 0xFF];
            crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[1]) & 0xFF];
            crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[2]) & 0xFF];
            crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[3]) & 0xFF];
            pByte_buf += 4;
            buf_len -= 4;
        }

        while (buf_len)
        {
            crc32 = (crc32 >> 8) ^ s_crc_table[(crc32 ^ pByte_buf[0]) & 0xFF];
            ++pByte_buf;
            --buf_len;
        }

        return ~crc32;
    }
}

void mz_free(void *p)
{
    MZ_FREE(p);
}

void *miniz_def_alloc_func(void *opaque, size_t items, size_t size)
{
    return MZ_MALLOC(items * size);
}

void miniz_def_free_func(void *opaque, void *address)
{
    MZ_FREE(address);
}

void *miniz_def_realloc_func(void *opaque, void *address, size_t items, size_t size)
{
    return MZ_REALLOC(address, items * size);
}

/* Returns the version string of miniz.c. */
const(char)* mz_version()
{
    return MZ_VERSION.ptr;
}

/* mz_deflateInit() initializes a compressor with default options: */
/* Parameters: */
/*  pStream must point to an initialized mz_stream struct. */
/*  level must be between [MZ_NO_COMPRESSION, MZ_BEST_COMPRESSION]. */
/*  level 1 enables a specially optimized compression function that's been optimized purely for performance, not ratio. */
/*  (This special func. is currently only enabled when MINIZ_USE_UNALIGNED_LOADS_AND_STORES and MINIZ_LITTLE_ENDIAN are defined.) */
/* Return values: */
/*  MZ_OK on success. */
/*  MZ_STREAM_ERROR if the stream is bogus. */
/*  MZ_PARAM_ERROR if the input parameters are bogus. */
/*  MZ_MEM_ERROR on out of memory. */
int mz_deflateInit(mz_stream* pStream, int level)
{
    return mz_deflateInit2(pStream, level, MZ_DEFLATED, MZ_DEFAULT_WINDOW_BITS, 9, MZ_DEFAULT_STRATEGY);
}


/* mz_deflateInit2() is like mz_deflate(), except with more control: */
/* Additional parameters: */
/*   method must be MZ_DEFLATED */
/*   window_bits must be MZ_DEFAULT_WINDOW_BITS (to wrap the deflate stream with zlib header/adler-32 footer) or -MZ_DEFAULT_WINDOW_BITS (raw deflate/no header or footer) */
/*   mem_level must be between [1, 9] (it's checked but ignored by miniz.c) */
int mz_deflateInit2(mz_stream* pStream, int level, int method, int window_bits, int mem_level, int strategy)
{
    tdefl_compressor *pComp;
    mz_uint comp_flags = TDEFL_COMPUTE_ADLER32 | tdefl_create_comp_flags_from_zip_params(level, window_bits, strategy);

    if (!pStream)
        return MZ_STREAM_ERROR;
    if ((method != MZ_DEFLATED) || ((mem_level < 1) || (mem_level > 9)) || ((window_bits != MZ_DEFAULT_WINDOW_BITS) && (-window_bits != MZ_DEFAULT_WINDOW_BITS)))
        return MZ_PARAM_ERROR;

    pStream.data_type = 0;
    pStream.adler = MZ_ADLER32_INIT;
    pStream.msg = null;
    pStream.reserved = 0;
    pStream.total_in = 0;
    pStream.total_out = 0;
    if (!pStream.zalloc)
        pStream.zalloc = &miniz_def_alloc_func;
    if (!pStream.zfree)
        pStream.zfree = &miniz_def_free_func;

    pComp = cast(tdefl_compressor *) pStream.zalloc(pStream.opaque, 1, tdefl_compressor.sizeof);
    if (!pComp)
        return MZ_MEM_ERROR;

    pStream.state = cast(mz_internal_state *)pComp;

    if (tdefl_init(pComp, null, null, comp_flags) != TDEFL_STATUS_OKAY)
    {
        mz_deflateEnd(pStream);
        return MZ_PARAM_ERROR;
    }

    return MZ_OK;
}

/* Quickly resets a compressor without having to reallocate anything. Same as calling mz_deflateEnd() followed by mz_deflateInit()/mz_deflateInit2(). */
int mz_deflateReset(mz_stream* pStream)
{
    if ((!pStream) || (!pStream.state) || (!pStream.zalloc) || (!pStream.zfree))
        return MZ_STREAM_ERROR;
    pStream.total_in = pStream.total_out = 0;
    tdefl_init(cast(tdefl_compressor *)pStream.state, null, null, (cast(tdefl_compressor *)pStream.state).m_flags);
    return MZ_OK;
}

/* mz_deflate() compresses the input to output, consuming as much of the input and producing as much output as possible. */
/* Parameters: */
/*   pStream is the stream to read from and write to. You must initialize/update the next_in, avail_in, next_out, and avail_out members. */
/*   flush may be MZ_NO_FLUSH, MZ_PARTIAL_FLUSH/MZ_SYNC_FLUSH, MZ_FULL_FLUSH, or MZ_FINISH. */
/* Return values: */
/*   MZ_OK on success (when flushing, or if more input is needed but not available, and/or there's more output to be written but the output buffer is full). */
/*   MZ_STREAM_END if all input has been consumed and all output bytes have been written. Don't call mz_deflate() on the stream anymore. */
/*   MZ_STREAM_ERROR if the stream is bogus. */
/*   MZ_PARAM_ERROR if one of the parameters is invalid. */
/*   MZ_BUF_ERROR if no forward progress is possible because the input and/or output buffers are empty. (Fill up the input buffer or free up some output space and try again.) */
int mz_deflate(mz_stream* pStream, int flush)
{
    size_t in_bytes, out_bytes;
    mz_ulong orig_total_in, orig_total_out;
    int mz_status = MZ_OK;

    if ((!pStream) || (!pStream.state) || (flush < 0) || (flush > MZ_FINISH) || (!pStream.next_out))
        return MZ_STREAM_ERROR;
    if (!pStream.avail_out)
        return MZ_BUF_ERROR;

    if (flush == MZ_PARTIAL_FLUSH)
        flush = MZ_SYNC_FLUSH;

    if ((cast(tdefl_compressor *)pStream.state).m_prev_return_status == TDEFL_STATUS_DONE)
        return (flush == MZ_FINISH) ? MZ_STREAM_END : MZ_BUF_ERROR;

    orig_total_in = pStream.total_in;
    orig_total_out = pStream.total_out;
    for (;;)
    {
        tdefl_status defl_status;
        in_bytes = pStream.avail_in;
        out_bytes = pStream.avail_out;

        defl_status = tdefl_compress(cast(tdefl_compressor *)pStream.state, pStream.next_in, &in_bytes, 
                                     pStream.next_out, &out_bytes, cast(tdefl_flush)flush);
        pStream.next_in += cast(mz_uint)in_bytes;
        pStream.avail_in -= cast(mz_uint)in_bytes;
        pStream.total_in += cast(mz_uint)in_bytes;
        pStream.adler = tdefl_get_adler32(cast(tdefl_compressor *)pStream.state);

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

        if (defl_status < 0)
        {
            mz_status = MZ_STREAM_ERROR;
            break;
        }
        else if (defl_status == TDEFL_STATUS_DONE)
        {
            mz_status = MZ_STREAM_END;
            break;
        }
        else if (!pStream.avail_out)
            break;
        else if ((!pStream.avail_in) && (flush != MZ_FINISH))
        {
            if ((flush) || (pStream.total_in != orig_total_in) || (pStream.total_out != orig_total_out))
                break;
            return MZ_BUF_ERROR; /* Can't make forward progress without some input.
 */
        }
    }
    return mz_status;
}

/* mz_deflateEnd() deinitializes a compressor: */
/* Return values: */
/*  MZ_OK on success. */
/*  MZ_STREAM_ERROR if the stream is bogus. */
int mz_deflateEnd(mz_stream* pStream)
{
    if (!pStream)
        return MZ_STREAM_ERROR;
    if (pStream.state)
    {
        pStream.zfree(pStream.opaque, pStream.state);
        pStream.state = null;
    }
    return MZ_OK;
}

/* mz_deflateBound() returns a (very) conservative upper bound on the amount of data that could be generated by deflate(), assuming flush is set to only MZ_NO_FLUSH or MZ_FINISH. */
mz_ulong mz_deflateBound(mz_stream* pStream, mz_ulong source_len)
{
    /* This is really over conservative. (And lame, but it's actually pretty tricky to compute a true upper bound given the way tdefl's blocking works.) */
    return MZ_MAX_mz_ulong(128 + (source_len * 110) / 100, 128 + source_len + ((source_len / (31 * 1024)) + 1) * 5);
}

/** Single-call compression functions mz_compress() and mz_compress2():
    Returns MZ_OK on success, or one of the error codes from mz_deflate() on failure. */
int mz_compress2(ubyte *pDest, mz_ulong *pDest_len, const(ubyte)* pSource, mz_ulong source_len, int level)
{
    int status;
    mz_stream stream;
    memset(&stream, 0, stream.sizeof);

    /* In case mz_ulong is 64-bits (argh I hate longs). */
    if (cast(mz_uint64)(source_len | *pDest_len) > 0xFFFFFFFFU)
        return MZ_PARAM_ERROR;

    stream.next_in = pSource;
    stream.avail_in = cast(mz_uint32)source_len;
    stream.next_out = pDest;
    stream.avail_out = cast(mz_uint32)*pDest_len;

    status = mz_deflateInit(&stream, level);
    if (status != MZ_OK)
        return status;

    status = mz_deflate(&stream, MZ_FINISH);
    if (status != MZ_STREAM_END)
    {
        mz_deflateEnd(&stream);
        return (status == MZ_OK) ? MZ_BUF_ERROR : status;
    }

    *pDest_len = stream.total_out;
    return mz_deflateEnd(&stream);
}

///ditto
int mz_compress(ubyte* pDest, mz_ulong *pDest_len, const(ubyte)* pSource, mz_ulong source_len)
{
    return mz_compress2(pDest, pDest_len, pSource, source_len, MZ_DEFAULT_COMPRESSION);
}

/* mz_compressBound() returns a (very) conservative upper bound on the amount of data that could
be generated by calling mz_compress(). */
mz_ulong mz_compressBound(mz_ulong source_len)
{
    return mz_deflateBound(null, source_len);
}

struct inflate_state
{
    tinfl_decompressor m_decomp;
    mz_uint m_dict_ofs, m_dict_avail, m_first_call, m_has_flushed;
    int m_window_bits;
    mz_uint8[TINFL_LZ_DICT_SIZE] m_dict;
    tinfl_status m_last_status;
}

/* mz_inflateInit2() is like mz_inflateInit() with an additional option that controls the window 
   size and whether or not the stream has been wrapped with a zlib header/footer: 
/* window_bits must be MZ_DEFAULT_WINDOW_BITS (to parse zlib header/footer) or -MZ_DEFAULT_WINDOW_BITS 
   (raw deflate). */
int mz_inflateInit2(mz_stream* 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 = &miniz_def_alloc_func;
    if (!pStream.zfree)
        pStream.zfree = &miniz_def_free_func;

    pDecomp = cast(inflate_state *)pStream.zalloc(pStream.opaque, 1, inflate_state.sizeof);
    if (!pDecomp)
        return MZ_MEM_ERROR;

    pStream.state = cast(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;
}

/* Initializes a decompressor. */
int mz_inflateInit(mz_stream* pStream)
{
    return mz_inflateInit2(pStream, MZ_DEFAULT_WINDOW_BITS);
}

/* Quickly resets a compressor without having to reallocate anything. Same as calling 
   mz_inflateEnd() followed by mz_inflateInit()/mz_inflateInit2(). */
int mz_inflateReset(mz_stream* pStream)
{
    inflate_state *pDecomp;
    if (!pStream)
        return MZ_STREAM_ERROR;

    pStream.data_type = 0;
    pStream.adler = 0;
    pStream.msg = null;
    pStream.total_in = 0;
    pStream.total_out = 0;
    pStream.reserved = 0;

    pDecomp = cast(inflate_state *)pStream.state;

    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;
}

/* Decompresses the input stream to the output, consuming only as much of the input as needed, and 
   writing as much to the output as possible. */
/* Parameters: */
/*   pStream is the stream to read from and write to. You must initialize/update the next_in, 
     avail_in, next_out, and avail_out members. */
/*   flush may be MZ_NO_FLUSH, MZ_SYNC_FLUSH, or MZ_FINISH. */
/*   On the first call, if flush is MZ_FINISH it's assumed the input and output buffers are both 
     sized large enough to decompress the entire stream in a single call (this is slightly faster). */
/*   MZ_FINISH implies that there are no more source bytes available beside what's already in the 
     input buffer, and that the output buffer is large enough to hold the rest of the decompressed data. */
/* Return values: */
/*   MZ_OK on success. Either more input is needed but not available, and/or there's more output 
     to be written but the output buffer is full. */
/*   MZ_STREAM_END if all needed input has been consumed and all output bytes have been written. 
     For zlib streams, the adler-32 of the decompressed data has also been verified. */
/*   MZ_STREAM_ERROR if the stream is bogus. */
/*   MZ_DATA_ERROR if the deflate stream is invalid. */
/*   MZ_PARAM_ERROR if one of the parameters is invalid. */
/*   MZ_BUF_ERROR if no forward progress is possible because the input buffer is empty but the 
     inflater needs more input to continue, or if the output buffer is not large enough. Call 
     mz_inflate() again */
/*   with more input data, or with more room in the output buffer (except when using single call 
     decompression, described above). */
int mz_inflate(mz_stream* pStream, int flush)
{
    return mz_inflate2(pStream, flush, TINFL_FLAG_COMPUTE_ADLER32);
}

// Same with decom_flags control.
// You can use TINFL_FLAG_DO_NOT_COMPUTE_ADLER32 if input is trusted.
int mz_inflate2(mz_stream* pStream, int flush, int decomp_flags)
{
    inflate_state *pState;
    mz_uint n, first_call;

    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 = cast(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 += cast(mz_uint)in_bytes;
        pStream.avail_in -= cast(mz_uint)in_bytes;
        pStream.total_in += cast(mz_uint)in_bytes;
        pStream.adler = tinfl_get_adler32(&pState.m_decomp);
        pStream.next_out += cast(mz_uint)out_bytes;
        pStream.avail_out -= cast(mz_uint)out_bytes;
        pStream.total_out += cast(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_uint(pState.m_dict_avail, pStream.avail_out);
        memcpy(pStream.next_out, pState.m_dict.ptr + 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.ptr, 
                                  pState.m_dict.ptr + pState.m_dict_ofs, &out_bytes, decomp_flags);
        pState.m_last_status = status;

        pStream.next_in += cast(mz_uint)in_bytes;
        pStream.avail_in -= cast(mz_uint)in_bytes;
        pStream.total_in += cast(mz_uint)in_bytes;
        pStream.adler = tinfl_get_adler32(&pState.m_decomp);

        pState.m_dict_avail = cast(mz_uint)out_bytes;

        n = MZ_MIN_uint(pState.m_dict_avail, pStream.avail_out);
        memcpy(pStream.next_out, pState.m_dict.ptr + 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;
}

/* Deinitializes a decompressor. */
int mz_inflateEnd(mz_stream* pStream)
{
    if (!pStream)
        return MZ_STREAM_ERROR;
    if (pStream.state)
    {
        pStream.zfree(pStream.opaque, pStream.state);
        pStream.state = null;
    }
    return MZ_OK;
}

/* Single-call decompression. */
/* Returns MZ_OK on success, or one of the error codes from mz_inflate() on failure. */
int mz_uncompress2(ubyte *pDest, mz_ulong *pDest_len, const(ubyte)* pSource, mz_ulong *pSource_len)
{
    return mz_uncompress3(pDest, pDest_len, pSource, pSource_len, MZ_DEFAULT_WINDOW_BITS, false);
}

/// Same, but also specify window_bits, in case the stream has no header. This is useful for iPhone PNG.
/// Also allows to skip Adler32 check.
int mz_uncompress3(ubyte *pDest, mz_ulong *pDest_len, 
                   const(ubyte)* pSource, mz_ulong *pSource_len,
                   int window_bits,
                   bool trusted_input)
{
    mz_stream stream = void;
    int status;
    memset(&stream, 0, stream.sizeof);

    /* In case mz_ulong is 64-bits (argh I hate longs). */
    if (cast(mz_uint64)(*pSource_len | *pDest_len) > 0xFFFFFFFFU)
        return MZ_PARAM_ERROR;

    stream.next_in = pSource;
    stream.avail_in = cast(mz_uint32)*pSource_len;
    stream.next_out = pDest;
    stream.avail_out = cast(mz_uint32)*pDest_len;

    status = mz_inflateInit2(&stream, window_bits);
    if (status != MZ_OK)
        return status;

    status = mz_inflate2(&stream, MZ_FINISH, trusted_input ? TINFL_FLAG_DO_NOT_COMPUTE_ADLER32 : TINFL_FLAG_COMPUTE_ADLER32);
    *pSource_len = *pSource_len - stream.avail_in;
    if (status != MZ_STREAM_END)
    {
        mz_inflateEnd(&stream);
        return ((status == MZ_BUF_ERROR) && (!stream.avail_in)) ? MZ_DATA_ERROR : status;
    }
    *pDest_len = stream.total_out;

    return mz_inflateEnd(&stream);
}

/* Single-call decompression. */
/* Returns MZ_OK on success, or one of the error codes from mz_inflate() on failure. */
int mz_uncompress(ubyte *pDest, mz_ulong *pDest_len, const(ubyte)* pSource, mz_ulong source_len)
{
    return mz_uncompress2(pDest, pDest_len, pSource, &source_len);
}

/* Returns a string description of the specified error code, or null if the error code is invalid. */
const(char)* mz_error(int err)
{
    if (err == MZ_STREAM_END)
        return "stream end".ptr;
    if (err == MZ_NEED_DICT)
        return "need dictionary".ptr;
    if (err == MZ_ERRNO)
        return "file error".ptr;
    if (err == MZ_STREAM_ERROR)
        return "stream error".ptr;
    if (err == MZ_DATA_ERROR)
        return "data error".ptr;
    if (err == MZ_MEM_ERROR)
        return "out of memory".ptr;
    if (err == MZ_BUF_ERROR)
        return "buf error".ptr;
    if (err == MZ_VERSION_ERROR)
        return "version error".ptr;
    if (err == MZ_PARAM_ERROR)
        return "parameter error".ptr;
    return null;
}



enum ZLIB_COMPATIBLE_NAMES = true;
static if (ZLIB_COMPATIBLE_NAMES)
{
    alias Byte = char;
    alias uInt = uint;
    alias uLong = mz_ulong;
    alias intf = int;
    alias voidpf = void*;
    alias uLongf = uLong;
    alias voidp = void*;
    alias voidpc = const(void)*;

    enum Z_null = 0;
    alias Z_NO_FLUSH = MZ_NO_FLUSH;
    alias Z_PARTIAL_FLUSH = MZ_PARTIAL_FLUSH;
    alias Z_SYNC_FLUSH = MZ_SYNC_FLUSH;
    alias Z_FULL_FLUSH = MZ_FULL_FLUSH;
    alias Z_FINISH = MZ_FINISH;
    alias Z_BLOCK = MZ_BLOCK;
    alias Z_OK = MZ_OK;
    alias Z_STREAM_END = MZ_STREAM_END;
    alias Z_NEED_DICT = MZ_NEED_DICT;
    alias Z_ERRNO = MZ_ERRNO;
    alias Z_STREAM_ERROR = MZ_STREAM_ERROR;
    alias Z_DATA_ERROR = MZ_DATA_ERROR;
    alias Z_MEM_ERROR = MZ_MEM_ERROR;
    alias Z_BUF_ERROR = MZ_BUF_ERROR;
    alias Z_VERSION_ERROR = MZ_VERSION_ERROR;
    alias Z_PARAM_ERROR = MZ_PARAM_ERROR;
    alias Z_NO_COMPRESSION = MZ_NO_COMPRESSION;
    alias Z_BEST_SPEED = MZ_BEST_SPEED;
    alias Z_BEST_COMPRESSION = MZ_BEST_COMPRESSION;
    alias Z_DEFAULT_COMPRESSION = MZ_DEFAULT_COMPRESSION;
    alias Z_DEFAULT_STRATEGY = MZ_DEFAULT_STRATEGY;
    alias Z_FILTERED = MZ_FILTERED;
    alias Z_HUFFMAN_ONLY = MZ_HUFFMAN_ONLY;
    alias Z_RLE = MZ_RLE;
    alias Z_FIXED = MZ_FIXED;
    alias Z_DEFLATED = MZ_DEFLATED;
    alias Z_DEFAULT_WINDOW_BITS = MZ_DEFAULT_WINDOW_BITS;
    alias alloc_func = mz_alloc_func;
    alias free_func = mz_free_func;
    alias internal_state = mz_internal_state;
    alias z_stream = mz_stream;
    //alias deflateInit = mz_deflateInit;
    //alias deflateInit2 = mz_deflateInit2;
    //alias deflateReset = mz_deflateReset;
    //alias deflate = mz_deflate;
    //alias deflateEnd = mz_deflateEnd;
    //alias deflateBound = mz_deflateBound;
    //alias compress = mz_compress;
    //alias compress2 = mz_compress2;
    //alias compressBound = mz_compressBound;
    alias inflateInit = mz_inflateInit;
    alias inflateInit2 = mz_inflateInit2;
    alias inflateReset = mz_inflateReset;
    alias inflate = mz_inflate;
    alias inflateEnd = mz_inflateEnd;
    alias uncompress = mz_uncompress;
    alias uncompress2 = mz_uncompress2;
    alias crc32 = mz_crc32;
    alias adler32 = mz_adler32;
    enum MAX_WBITS = 15;
    enum MAX_MEM_LEVEL = 9;
    alias zError = mz_error;
    alias ZLIB_VERSION = MZ_VERSION;
    alias ZLIB_VERNUM = MZ_VERNUM;
    alias ZLIB_VER_MAJOR = MZ_VER_MAJOR;
    alias ZLIB_VER_MINOR = MZ_VER_MINOR;
    alias ZLIB_VER_REVISION = MZ_VER_REVISION;
    alias ZLIB_VER_SUBREVISION = MZ_VER_SUBREVISION;
    alias zlibVersion = mz_version;
    enum zlib_version = mz_version();
}


/*
  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/>
*/

// miniz_tinfl.h

/* Decompression flags used by tinfl_decompress(). */
/* TINFL_FLAG_PARSE_ZLIB_HEADER: If set, the input has a valid zlib header and ends with an adler32 checksum (it's a valid zlib stream). Otherwise, the input is a raw deflate stream. */
/* TINFL_FLAG_HAS_MORE_INPUT: If set, there are more input bytes available beyond the end of the supplied input buffer. If clear, the input buffer contains all remaining input. */
/* TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF: If set, the output buffer is large enough to hold the entire decompressed stream. If clear, the output buffer is at least the size of the dictionary (typically 32KB). */
/* TINFL_FLAG_COMPUTE_ADLER32: Force adler-32 checksum computation of the decompressed bytes. */
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,        // _forces_ adler compute

    // _forces_ reported adler to be UB, this can be useful when the input is 
    // trusted and you do not want to compute checksum
    TINFL_FLAG_DO_NOT_COMPUTE_ADLER32 = 16 
}

/* Max size of LZ dictionary. */
enum TINFL_LZ_DICT_SIZE = 32768;

/* Return status. */
alias tinfl_status = int;
enum : tinfl_status
{
    /* This flags indicates the inflator needs 1 or more input bytes to make forward progress, but the caller is indicating that no more are available. The compressed data */
    /* is probably corrupted. If you call the inflator again with more bytes it'll try to continue processing the input but this is a BAD sign (either the data is corrupted or you called it incorrectly). */
    /* If you call it again with no input you'll just get TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS again. */
    TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS = -4,

    /* This flag indicates that one or more of the input parameters was obviously bogus. (You can try calling it again, but if you get this error the calling code is wrong.) */
    TINFL_STATUS_BAD_PARAM = -3,

    /* This flags indicate the inflator is finished but the adler32 check of the uncompressed data didn't match. If you call it again it'll return TINFL_STATUS_DONE. */
    TINFL_STATUS_ADLER32_MISMATCH = -2,

    /* This flags indicate the inflator has somehow failed (bad code, corrupted input, etc.). If you call it again without resetting via tinfl_init() it it'll just keep on returning the same status failure code. */
    TINFL_STATUS_FAILED = -1,

    /* Any status code less than TINFL_STATUS_DONE must indicate a failure. */

    /* This flag indicates the inflator has returned every byte of uncompressed data that it can, has consumed every byte that it needed, has successfully reached the end of the deflate stream, and */
    /* if zlib headers and adler32 checking enabled that it has successfully checked the uncompressed data's adler32. If you call it again you'll just get TINFL_STATUS_DONE over and over again. */
    TINFL_STATUS_DONE = 0,

    /* This flag indicates the inflator MUST have more input data (even 1 byte) before it can make any more forward progress, or you need to clear the TINFL_FLAG_HAS_MORE_INPUT */
    /* flag on the next call if you don't have any more source data. If the source data was somehow corrupted it's also possible (but unlikely) for the inflator to keep on demanding input to */
    /* proceed, so be sure to properly set the TINFL_FLAG_HAS_MORE_INPUT flag. */
    TINFL_STATUS_NEEDS_MORE_INPUT = 1,

    /* This flag indicates the inflator definitely has 1 or more bytes of uncompressed data available, but it cannot write this data into the output buffer. */
    /* Note if the source compressed data was corrupted it's possible for the inflator to return a lot of uncompressed data to the caller. I've been assuming you know how much uncompressed data to expect */
    /* (either exact or worst case) and will stop calling the inflator and fail after receiving too much. In pure streaming scenarios where you have no idea how many bytes to expect this may not be possible */
    /* so I may need to add some code to address this. */
    TINFL_STATUS_HAS_MORE_OUTPUT = 2
}

void tinfl_init(tinfl_decompressor* r)
{
    r.m_state = 0;
}

uint tinfl_get_adler32(tinfl_decompressor* r)
{
    return r.m_check_adler32;
}

/* 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
}

enum TINFL_USE_64BIT_BITBUF = true;
alias tinfl_bit_buf_t = mz_uint64 ;

struct tinfl_decompressor
{
    mz_uint32 m_state, m_num_bits, m_zhdr0, m_zhdr1, m_z_adler32, m_final, m_type, m_check_adler32, m_dist, m_counter, m_num_extra;
    mz_uint32[TINFL_MAX_HUFF_TABLES] m_table_sizes;
    tinfl_bit_buf_t m_bit_buf;
    size_t m_dist_from_out_buf_start;
    mz_int16[TINFL_FAST_LOOKUP_SIZE][TINFL_MAX_HUFF_TABLES] m_look_up;
    mz_int16[TINFL_MAX_HUFF_SYMBOLS_0 * 2] m_tree_0;
    mz_int16[TINFL_MAX_HUFF_SYMBOLS_1 * 2] m_tree_1;
    mz_int16[TINFL_MAX_HUFF_SYMBOLS_2 * 2] m_tree_2;
    mz_uint8[TINFL_MAX_HUFF_SYMBOLS_0] m_code_size_0;
    mz_uint8[TINFL_MAX_HUFF_SYMBOLS_1] m_code_size_1;
    mz_uint8[TINFL_MAX_HUFF_SYMBOLS_2] m_code_size_2;
    mz_uint8[4] m_raw_header;
    mz_uint8[TINFL_MAX_HUFF_SYMBOLS_0 + TINFL_MAX_HUFF_SYMBOLS_1 + 137] m_len_codes;
}

// miniz_infl.c


/* ------------------- Low-level Decompression (completely independent from all compression API's) */

alias TINFL_MEMCPY = memcpy;
alias TINFL_MEMSET = memset;


void tinfl_clear_tree(tinfl_decompressor* r)
{
    if (r.m_type == 0)
        r.m_tree_0[] = 0;
    else if (r.m_type == 1)
        r.m_tree_1[] = 0;
    else
        r.m_tree_2[] = 0;
}

/* 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. */
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)
{
    __gshared static immutable mz_uint16[31] s_length_base = [ 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 ];
    __gshared static immutable mz_uint8[31] s_length_extra = [ 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 ];
    __gshared static immutable mz_uint16[32] s_dist_base = [ 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 ];
    __gshared static immutable mz_uint8[32] s_dist_extra = [ 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 ];
    __gshared static immutable mz_uint8[19] s_length_dezigzag = [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];
    __gshared static immutable mz_uint16[3] s_min_table_sizes = [ 257, 1, 4 ];

    mz_int16*[3] pTrees;
    mz_uint8*[3] pCode_sizes;

    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(mz_uint8*) pIn_buf_end = pIn_buf_next + *pIn_buf_size;
    mz_uint8 *pOut_buf_cur = pOut_buf_next;
    mz_uint8 *pOut_buf_end = pOut_buf_next ? pOut_buf_next + *pOut_buf_size : null;
    size_t out_buf_size_mask = (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF) ? cast(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 ((!pOut_buf_start) || (!pOut_buf_next) || (!pIn_buf_size) || (!pOut_buf_size))
    {
        return TINFL_STATUS_BAD_PARAM;
    }
    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;
    }

    pTrees[0] = r.m_tree_0.ptr;
    pTrees[1] = r.m_tree_1.ptr;
    pTrees[2] = r.m_tree_2.ptr;
    pCode_sizes[0] = r.m_code_size_0.ptr;
    pCode_sizes[1] = r.m_code_size_1.ptr;
    pCode_sizes[2] = r.m_code_size_2.ptr;

    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;

    uint c, c2;
    //int counterBits;
    int bits_;
    size_t nn;
    mz_uint s;
    
    int tree_next, tree_cur;
    mz_int16 *pLookUp;
    mz_int16 *pTree;
    mz_uint8 *pCode_size;
    mz_uint i, j, used_syms, total, sym_index;
    mz_uint[17] next_code;
    mz_uint[16] total_syms;
    mz_uint32 i2, i3, s1, s2;
    mz_uint code_len2;
    mz_uint8 *pSrc;
    mz_uint extra_bits;
    int temp;

    switch (r.m_state)
    {
        case 0:
            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)
            {
                while (pIn_buf_cur >= pIn_buf_end)
                {                                       
                    status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                    r.m_state = 1;
                    goto common_exit;
                    case 1:
                }
                r.m_zhdr0 = *pIn_buf_cur++;     

                while (pIn_buf_cur >= pIn_buf_end)
                {                                       
                    status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                    r.m_state = 2;
                    goto common_exit;
                    case 2:
                }
                r.m_zhdr1 = *pIn_buf_cur++;

                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) < cast(size_t)(cast(size_t)1 << (8U + (r.m_zhdr0 >> 4)))));
                if (counter)
                {
                    for (;;)
                    {
                        status = TINFL_STATUS_FAILED;
                        r.m_state = 36;
                        goto common_exit; 
                        case 36:
                    }
                }
            }

            do
            {
                if (num_bits < cast(mz_uint)(3))
                {
                    do
                    {
                        while (pIn_buf_cur >= pIn_buf_end)
                        {                                       
                            status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                            r.m_state = 3;
                            goto common_exit;
                            case 3:
                        }
                        c = *pIn_buf_cur++;
                        bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                        num_bits += 8;
                    } while (num_bits < cast(mz_uint)(3));
                }
                r.m_final = bit_buf & ((1 << (3)) - 1);
                bit_buf >>= (3);
                num_bits -= (3);

                r.m_type = r.m_final >> 1;
                if (r.m_type == 0)
                {
                    if (num_bits < cast(mz_uint)(num_bits & 7))
                    {
                        do
                        {
                            while (pIn_buf_cur >= pIn_buf_end)
                            {                                       
                                status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                r.m_state = 5;
                                goto common_exit;
                                case 5:
                            }
                            c = *pIn_buf_cur++;
                            bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                            num_bits += 8;
                        } while (num_bits < cast(mz_uint)(num_bits & 7));
                    }
                    bit_buf >>= (num_bits & 7);
                    num_bits -= (num_bits & 7);

                    for (counter = 0; counter < 4; ++counter)
                    {
                        if (num_bits)
                        {
                            //TINFL_GET_BITS(6, r.m_raw_header[counter], 8);
                            if (num_bits < cast(mz_uint)(8))
                            {
                                do
                                {
                                    while (pIn_buf_cur >= pIn_buf_end)
                                    {
                                        status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                        r.m_state = 6;
                                        goto common_exit;
                                        case 6:
                                    }
                                    c = *pIn_buf_cur++;
                                    bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                                    num_bits += 8;
                                } while (num_bits < cast(mz_uint)(8));
                            }

                            r.m_raw_header[counter] = bit_buf & ((1 << (8)) - 1);
                            bit_buf >>= (8);
                            num_bits -= (8);
                        }
                        else
                        {
                            while (pIn_buf_cur >= pIn_buf_end)
                            {
                                status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                r.m_state = 7;
                                goto common_exit;
                                case 7:
                            }
                            r.m_raw_header[counter] = *pIn_buf_cur++;
                        }
                    }
                    if ((counter = (r.m_raw_header[0] | (r.m_raw_header[1] << 8))) != cast(mz_uint)(0xFFFF ^ (r.m_raw_header[2] | (r.m_raw_header[3] << 8))))
                    {
                        for (;;)
                        {
                            status = TINFL_STATUS_FAILED;
                            r.m_state = 39;
                            goto common_exit; 
                            case 39:
                        }
                    }
                    while ((counter) && (num_bits))
                    {
                        //TINFL_GET_BITS(51, dist, 8);
                        if (num_bits < cast(mz_uint)(8))
                        {
                            do
                            {
                                while (pIn_buf_cur >= pIn_buf_end)
                                {
                                    status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                    r.m_state = 51;
                                    goto common_exit;
                                    case 51:
                                }
                                c = *pIn_buf_cur++;
                                bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                                num_bits += 8;
                            } while (num_bits < cast(mz_uint)(8));
                        }
                        dist = bit_buf & ((1 << (8)) - 1);
                        bit_buf >>= (8);
                        num_bits -= (8);

                        while (pOut_buf_cur >= pOut_buf_end)
                        {
                            status = TINFL_STATUS_HAS_MORE_OUTPUT;
                            r.m_state = 52;
                            goto common_exit;
                            case 52:
                        }
                        *pOut_buf_cur++ = cast(mz_uint8)dist;
                        counter--;
                    }
                    while (counter)
                    {
                        while (pOut_buf_cur >= pOut_buf_end)
                        {
                            status = TINFL_STATUS_HAS_MORE_OUTPUT;
                            r.m_state = 9;
                            goto common_exit;
                            case 9:
                        }
                        while (pIn_buf_cur >= pIn_buf_end)
                        {
                            status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                            r.m_state = 38;
                            goto common_exit;
                            case 38:
                        }
                        nn = MZ_MIN_size_t(MZ_MIN_size_t(cast(size_t)(pOut_buf_end - pOut_buf_cur), cast(size_t)(pIn_buf_end - pIn_buf_cur)), counter);
                        TINFL_MEMCPY(pOut_buf_cur, pIn_buf_cur, nn);
                        pIn_buf_cur += nn;
                        pOut_buf_cur += nn;
                        counter -= cast(mz_uint)nn;
                    }
                }
                else if (r.m_type == 3)
                {
                    for (;;)
                    {
                        status = TINFL_STATUS_FAILED;
                        r.m_state = 10;
                        goto common_exit; 
                        case 10:
                    }
                }
                else
                {
                    if (r.m_type == 1)
                    {
                        mz_uint8 *p = r.m_code_size_0.ptr;
                        r.m_table_sizes[0] = 288;
                        r.m_table_sizes[1] = 32;
                        TINFL_MEMSET(r.m_code_size_1.ptr, 5, 32);
                        for (i2 = 0; i2 <= 143; ++i2)
                            *p++ = 8;
                        for (; i2 <= 255; ++i2)
                            *p++ = 9;
                        for (; i2 <= 279; ++i2)
                            *p++ = 7;
                        for (; i2 <= 287; ++i2)
                            *p++ = 8;
                    }
                    else
                    {
                        for (counter = 0; counter < 3; counter++)
                        {
                            //TINFL_GET_BITS(11, r.m_table_sizes[counter], "\05\05\04"[counter]);

                            bits_ = "\05\05\04"[counter];
                            if (num_bits < cast(mz_uint)(bits_))
                            {
                                do
                                {
                                    while (pIn_buf_cur >= pIn_buf_end)
                                    {
                                        status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                        r.m_state = 11;
                                        goto common_exit;
                                        case 11:
                                    }
                                    c = *pIn_buf_cur++;
                                    bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                                    num_bits += 8;
                                } while (num_bits < cast(mz_uint)(bits_));
                            }

                            r.m_table_sizes[counter] = cast(ubyte)(bit_buf) & ((1 << (bits_)) - 1);
                            bit_buf >>= (bits_);
                            num_bits -= (bits_);

                            r.m_table_sizes[counter] += s_min_table_sizes[counter];
                        }
                        r.m_code_size_2[] = 0;
                        for (counter = 0; counter < r.m_table_sizes[2]; counter++)
                        {
                            //TINFL_GET_BITS(14, s, 3);
                            bits_ = 3;
                            if (num_bits < cast(mz_uint)(bits_))
                            {
                                do
                                {
                                    while (pIn_buf_cur >= pIn_buf_end)
                                    {
                                        status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                        r.m_state = 14;
                                        goto common_exit;
                                        case 14:
                                    }
                                    c = *pIn_buf_cur++;
                                    bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                                    num_bits += 8;
                                } while (num_bits < cast(mz_uint)(bits_));
                            }
                            s = cast(mz_uint)(bit_buf) & ((1 << (bits_)) - 1);
                            bit_buf >>= (bits_);
                            num_bits -= (bits_);

                            r.m_code_size_2[s_length_dezigzag[counter]] = cast(mz_uint8)s;
                        }
                        r.m_table_sizes[2] = 19;
                    }
                    for (; cast(int)r.m_type >= 0; r.m_type--)
                    {
   
                        pLookUp = r.m_look_up[r.m_type].ptr;
                        pTree = pTrees[r.m_type];
                        pCode_size = pCode_sizes[r.m_type];
                        total_syms[] = 0;
                        TINFL_MEMSET(pLookUp, 0, r.m_look_up[0].sizeof);
                        tinfl_clear_tree(r);
                        for (i = 0; i < r.m_table_sizes[r.m_type]; ++i)
                            total_syms[pCode_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))
                        {
                            for (;;)
                            {
                                status = TINFL_STATUS_FAILED;
                                r.m_state = 35;
                                goto common_exit; 
                                case 35:
                            }
                        }
                        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 = pCode_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 = cast(mz_int16)((code_size << 9) | sym_index);
                                while (rev_code < TINFL_FAST_LOOKUP_SIZE)
                                {
                                    pLookUp[rev_code] = k;
                                    rev_code += (1 << code_size);
                                }
                                continue;
                            }
                            if (0 == (tree_cur = pLookUp[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)]))
                            {
                                pLookUp[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = cast(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 (!pTree[-tree_cur - 1])
                                {
                                    pTree[-tree_cur - 1] = cast(mz_int16)tree_next;
                                    tree_cur = tree_next;
                                    tree_next -= 2;
                                }
                                else
                                    tree_cur = pTree[-tree_cur - 1];
                            }
                            tree_cur -= ((rev_code >>= 1) & 1);
                            pTree[-tree_cur - 1] = cast(mz_int16)sym_index;
                        }
                        if (r.m_type == 2)
                        {
                            for (counter = 0; counter < (r.m_table_sizes[0] + r.m_table_sizes[1]);)
                            {
                                //TINFL_HUFF_DECODE(16, dist, r.m_look_up[2], r.m_tree_2);
                                
                                
                                if (num_bits < 15)
                                {
                                    if ((pIn_buf_end - pIn_buf_cur) < 2)
                                    {
                                        //TINFL_HUFF_BITBUF_FILL(state_index, pLookUp, pTree);
                                        do
                                        {
                                            temp = r.m_look_up[2][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)];
                                            if (temp >= 0)
                                            {
                                                code_len2 = temp >> 9;
                                                if ((code_len2) && (num_bits >= code_len2))
                                                    break;
                                            }
                                            else if (num_bits > TINFL_FAST_LOOKUP_BITS)
                                            {
                                                code_len2 = TINFL_FAST_LOOKUP_BITS;
                                                do
                                                {
                                                    temp = r.m_tree_2[cast(size_t)(~temp + ((bit_buf >> code_len2++) & 1))];
                                                } while ((temp < 0) && (num_bits >= (code_len2 + 1)));
                                                if (temp >= 0)
                                                    break;
                                            }
                                            //TINFL_GET_BYTE(state_index, c);
                                            while (pIn_buf_cur >= pIn_buf_end)
                                            {                                       
                                                status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                                r.m_state = 16;
                                                goto common_exit;
                                                case 16:
                                            }
                                            c = *pIn_buf_cur++;

                                            bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                                            num_bits += 8;
                                        } while (num_bits < 15);
                                    }
                                    else
                                    {
                                        bit_buf |= ((cast(tinfl_bit_buf_t)pIn_buf_cur[0]) << num_bits) | ((cast(tinfl_bit_buf_t)pIn_buf_cur[1]) << (num_bits + 8));
                                        pIn_buf_cur += 2;
                                        num_bits += 16;
                                    }
                                }
                                if ((temp = r.m_look_up[2][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
                                    code_len2 = temp >> 9, temp &= 511;
                                else
                                {
                                    code_len2 = TINFL_FAST_LOOKUP_BITS;
                                    do
                                    {
                                        temp = r.m_tree_2[cast(size_t)(~temp + ((bit_buf >> code_len2++) & 1))];
                                    } while (temp < 0);
                                }
                                dist = temp;
                                bit_buf >>= code_len2;
                                num_bits -= code_len2;

                                if (dist < 16)
                                {
                                    r.m_len_codes[counter++] = cast(mz_uint8)dist;
                                    continue;
                                }
                                if ((dist == 16) && (!counter))
                                {
                                    for (;;)
                                    {
                                        status = TINFL_STATUS_FAILED;
                                        r.m_state = 17;
                                        goto common_exit; 
                                        case 17:
                                    }
                                }
                                num_extra = "\02\03\07"[dist - 16];

                                //TINFL_GET_BITS(18, s, num_extra);
                                if (num_bits < cast(mz_uint)(num_extra))
                                {
                                    do
                                    {
                                        while (pIn_buf_cur >= pIn_buf_end)
                                        {                                       
                                            status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                            r.m_state = 18;
                                            goto common_exit;
                                            case 18:
                                        }
                                        c2 = *pIn_buf_cur++;
                                        bit_buf |= ((cast(tinfl_bit_buf_t)c2) << num_bits);
                                        num_bits += 8;
                                    } while (num_bits < cast(mz_uint)(num_extra));
                                }
                                s = (cast(uint)bit_buf) & ((1 << (num_extra)) - 1);
                                bit_buf >>= (num_extra);
                                num_bits -= (num_extra);


                                s += "\03\03\013"[dist - 16];
                                TINFL_MEMSET(r.m_len_codes.ptr + 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)
                            {
                                for (;;)
                                {
                                    status = TINFL_STATUS_FAILED;
                                    r.m_state = 21;
                                    goto common_exit; 
                                    case 21:
                                }
                            }
                            TINFL_MEMCPY(r.m_code_size_0.ptr, r.m_len_codes.ptr, r.m_table_sizes[0]);
                            TINFL_MEMCPY(r.m_code_size_1.ptr, r.m_len_codes.ptr + r.m_table_sizes[0], r.m_table_sizes[1]);
                        }
                    }
                    for (;;)
                    {
                        for (;;)
                        {
                            if (((pIn_buf_end - pIn_buf_cur) < 4) || ((pOut_buf_end - pOut_buf_cur) < 2))
                            {
                                // TINFL_HUFF_DECODE(state_index, sym, pLookUp,           pTree)
                                // TINFL_HUFF_DECODE(23,       counter, r.m_look_up[0], r.m_tree_0);

                                //int temp;
                                //mz_uint code_len;
                                if (num_bits < 15)
                                {
                                    if ((pIn_buf_end - pIn_buf_cur) < 2)
                                    {
                                        //TINFL_HUFF_BITBUF_FILL(state_index, pLookUp, pTree);
                                        do
                                        {
                                            temp = r.m_look_up[0][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)];
                                            if (temp >= 0)
                                            {
                                                code_len2 = temp >> 9;
                                                if ((code_len2) && (num_bits >= code_len2))
                                                    break;
                                            }
                                            else if (num_bits > TINFL_FAST_LOOKUP_BITS)
                                            {
                                                code_len2 = TINFL_FAST_LOOKUP_BITS;
                                                do
                                                {
                                                    temp = r.m_tree_0[cast(size_t)(~temp + ((bit_buf >> code_len2++) & 1))];
                                                } while ((temp < 0) && (num_bits >= (code_len2 + 1)));
                                                if (temp >= 0)
                                                    break;
                                            }
                                            //TINFL_GET_BYTE(state_index, c);
                                            while (pIn_buf_cur >= pIn_buf_end)
                                            {
                                                status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                                r.m_state = 23;
                                                goto common_exit;
                                                case 23:
                                            }
                                            c = *pIn_buf_cur++;
                                            bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                                            num_bits += 8;
                                        } while (num_bits < 15);
                                    }
                                    else
                                    {
                                        bit_buf |= ((cast(tinfl_bit_buf_t)pIn_buf_cur[0]) << num_bits) | ((cast(tinfl_bit_buf_t)pIn_buf_cur[1]) << (num_bits + 8));
                                        pIn_buf_cur += 2;
                                        num_bits += 16;
                                    }
                                }
                                if ((temp = r.m_look_up[0][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
                                    code_len2 = temp >> 9, temp &= 511;
                                else
                                {
                                    code_len2 = TINFL_FAST_LOOKUP_BITS;
                                    do
                                    {
                                        temp = r.m_tree_0[cast(size_t)(~temp + ((bit_buf >> code_len2++) & 1))];
                                    } while (temp < 0);
                                }
                                counter = temp;
                                bit_buf >>= code_len2;
                                num_bits -= code_len2;

                                if (counter >= 256)
                                    break;
                                while (pOut_buf_cur >= pOut_buf_end)
                                {
                                    status = TINFL_STATUS_HAS_MORE_OUTPUT;
                                    r.m_state = 24;
                                    goto common_exit;
                                    case 24:
                                }
                                *pOut_buf_cur++ = cast(mz_uint8)counter;
                            }
                            else
                            {
                                int sym2;
                                mz_uint code_len;

                                if (num_bits < 30)
                                {
                                    bit_buf |= ((cast(tinfl_bit_buf_t)MZ_READ_LE32(pIn_buf_cur)) << num_bits);
                                    pIn_buf_cur += 4;
                                    num_bits += 32;
                                }
                                if ((sym2 = r.m_look_up[0][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
                                    code_len = sym2 >> 9;
                                else
                                {
                                    code_len = TINFL_FAST_LOOKUP_BITS;
                                    do
                                    {
                                        sym2 = r.m_tree_0[cast(size_t)(~sym2 + ((bit_buf >> code_len++) & 1))];
                                    } while (sym2 < 0);
                                }
                                counter = sym2;
                                bit_buf >>= code_len;
                                num_bits -= code_len;
                                if (counter & 256)
                                    break;

                                if ((sym2 = r.m_look_up[0][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
                                    code_len = sym2 >> 9;
                                else
                                {
                                    code_len = TINFL_FAST_LOOKUP_BITS;
                                    do
                                    {
                                        sym2 = r.m_tree_0[cast(size_t)(~sym2 + ((bit_buf >> code_len++) & 1))];
                                    } while (sym2 < 0);
                                }
                                bit_buf >>= code_len;
                                num_bits -= code_len;

                                pOut_buf_cur[0] = cast(mz_uint8)counter;
                                if (sym2 & 256)
                                {
                                    pOut_buf_cur++;
                                    counter = sym2;
                                    break;
                                }
                                pOut_buf_cur[1] = cast(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)
                        {
                            //TINFL_GET_BITS(25, extra_bits, num_extra);
                            if (num_bits < cast(mz_uint)(num_extra))
                            {
                                do
                                {
                                    while (pIn_buf_cur >= pIn_buf_end)
                                    {                                       
                                        status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                        r.m_state = 25;
                                        goto common_exit;
                                        case 25:
                                    }
                                    c = *pIn_buf_cur++;
                                    bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                                    num_bits += 8;
                                } while (num_bits < cast(mz_uint)(num_extra));
                            }
                            extra_bits = (cast(uint)bit_buf) & ((1 << (num_extra)) - 1);
                            bit_buf >>= (num_extra);
                            num_bits -= (num_extra);


                            counter += extra_bits;
                        }

                        //TINFL_HUFF_DECODE(state_index, sym, pLookUp, pTree)
                        //TINFL_HUFF_DECODE(26, dist, r.m_look_up[1], r.m_tree_1);
//                        int temp;
  //                      mz_uint code_len;
                        if (num_bits < 15)
                        {
                            if ((pIn_buf_end - pIn_buf_cur) < 2)
                            {
                                //TINFL_HUFF_BITBUF_FILL(state_index, pLookUp, pTree);
                                do
                                {
                                    temp = r.m_look_up[1][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)];
                                    if (temp >= 0)
                                    {
                                        code_len2 = temp >> 9;
                                        if ((code_len2) && (num_bits >= code_len2))
                                            break;
                                    }
                                    else if (num_bits > TINFL_FAST_LOOKUP_BITS)
                                    {
                                        code_len2 = TINFL_FAST_LOOKUP_BITS;
                                        do
                                        {
                                            temp = r.m_tree_1[cast(size_t)(~temp + ((bit_buf >> code_len2++) & 1))];
                                        } while ((temp < 0) && (num_bits >= (code_len2 + 1)));
                                        if (temp >= 0)
                                            break;
                                    }
                                    //TINFL_GET_BYTE(state_index, c);
                                    while (pIn_buf_cur >= pIn_buf_end)
                                    {
                                        status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                        r.m_state = 26;
                                        goto common_exit;
                                        case 26:
                                    }
                                    c = *pIn_buf_cur++;
                                    bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                                    num_bits += 8;
                                } while (num_bits < 15);
                            }
                            else
                            {
                                bit_buf |= ((cast(tinfl_bit_buf_t)pIn_buf_cur[0]) << num_bits) | ((cast(tinfl_bit_buf_t)pIn_buf_cur[1]) << (num_bits + 8));
                                pIn_buf_cur += 2;
                                num_bits += 16;
                            }
                        }
                        if ((temp = r.m_look_up[1][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
                            code_len2 = temp >> 9, temp &= 511;
                        else
                        {
                            code_len2 = TINFL_FAST_LOOKUP_BITS;
                            do
                            {
                                temp = r.m_tree_1[cast(size_t)(~temp + ((bit_buf >> code_len2++) & 1))];
                            } while (temp < 0);
                        }
                        dist = temp;
                        bit_buf >>= code_len2;
                        num_bits -= code_len2;

                        num_extra = s_dist_extra[dist];
                        dist = s_dist_base[dist];
                        if (num_extra)
                        {
                            if (num_bits < cast(mz_uint)(num_extra))
                            {
                                do
                                {
                                    while (pIn_buf_cur >= pIn_buf_end)
                                    {                                       
                                        status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                        r.m_state = 27;
                                        goto common_exit;
                                        case 27:
                                    }
                                    c2 = *pIn_buf_cur++;
                                    bit_buf |= ((cast(tinfl_bit_buf_t)c2) << num_bits);
                                    num_bits += 8;
                                } while (num_bits < cast(mz_uint)(num_extra));
                            }
                            extra_bits = (cast(uint)bit_buf) & ((1 << (num_extra)) - 1);
                            bit_buf >>= (num_extra);
                            num_bits -= (num_extra);
                            
                            dist += extra_bits;
                        }

                        dist_from_out_buf_start = pOut_buf_cur - pOut_buf_start;
                        if ((dist == 0 || dist > dist_from_out_buf_start || dist_from_out_buf_start == 0) && (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF))
                        {
                            for (;;)
                            {
                                status = TINFL_STATUS_FAILED;
                                r.m_state = 37;
                                goto common_exit; 
                                case 37:
                            }
                        }

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

                        if ((MZ_MAX_voidp(pOut_buf_cur, pSrc) + counter) > pOut_buf_end)
                        {
                            while (counter--)
                            {
                                while (pOut_buf_cur >= pOut_buf_end)
                                {
                                    status = TINFL_STATUS_HAS_MORE_OUTPUT;
                                    r.m_state = 53;
                                    goto common_exit;
                                    case 53:
                                }
                                *pOut_buf_cur++ = pOut_buf_start[(dist_from_out_buf_start++ - dist) & out_buf_size_mask];
                            }
                            continue;
                        }
                        else if ((counter >= 9) && (counter <= dist))
                        {
                            const mz_uint8 *pSrc_end = pSrc + (counter & ~7);
                            do
                            {
                                memcpy(pOut_buf_cur, pSrc, mz_uint32.sizeof*2);
                                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;
                            }
                        }
                        while(counter>2)
                        {
                            pOut_buf_cur[0] = pSrc[0];
                            pOut_buf_cur[1] = pSrc[1];
                            pOut_buf_cur[2] = pSrc[2];
                            pOut_buf_cur += 3;
                            pSrc += 3;
                            counter -= 3;
                        }
                        if (counter > 0)
                        {
                            pOut_buf_cur[0] = pSrc[0];
                            if (counter > 1)
                                pOut_buf_cur[1] = pSrc[1];
                            pOut_buf_cur += counter;
                        }
                    }
                }
            } while (!(r.m_final & 1));

            /* Ensure byte alignment and put back any bytes from the bitbuf if we've looked ahead too far on gzip, or other Deflate streams followed by arbitrary data. */
            /* I'm being super conservative here. A number of simplifications can be made to the byte alignment part, and the Adler32 check shouldn't ever need to worry about reading from the bitbuf now. */
            
            //TINFL_SKIP_BITS(32, num_bits & 7);
            if (num_bits < cast(mz_uint)(num_bits & 7))
            {
                do
                {
                    while (pIn_buf_cur >= pIn_buf_end)
                    {                                       
                        status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                        r.m_state = 32;
                        goto common_exit;
                        case 32:
                    }
                    c = *pIn_buf_cur++;
                    bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                    num_bits += 8;
                } while (num_bits < cast(mz_uint)(num_bits & 7));
            }
            bit_buf >>= (num_bits & 7);
            num_bits -= (num_bits & 7);

            while ((pIn_buf_cur > pIn_buf_next) && (num_bits >= 8))
            {
                --pIn_buf_cur;
                num_bits -= 8;
            }
            bit_buf &= ~(~cast(tinfl_bit_buf_t)0 << num_bits);
            assert(!num_bits); /* if this assert fires then we've read beyond the end of non-deflate/zlib streams with following data (such as gzip streams). */

            if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER)
            {
                for (counter = 0; counter < 4; ++counter)
                {
                    if (num_bits)
                    {
                        //TINFL_GET_BITS(41, s, 8);
                        if (num_bits < cast(mz_uint)(8))
                        {
                            do
                            {
                                while (pIn_buf_cur >= pIn_buf_end)
                                {                                       
                                    status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                                    r.m_state = 41;
                                    goto common_exit;
                                    case 41:
                                }
                                c = *pIn_buf_cur++;
                                bit_buf |= ((cast(tinfl_bit_buf_t)c) << num_bits);
                                num_bits += 8;
                            } while (num_bits < cast(mz_uint)(8));
                        }
                        s = bit_buf & ((1 << (8)) - 1);
                        bit_buf >>= (8);
                        num_bits -= (8);
                    }
                    else
                    {
                        //TINFL_GET_BYTE(42, s);
                        while (pIn_buf_cur >= pIn_buf_end)
                        {
                            status = (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) ? TINFL_STATUS_NEEDS_MORE_INPUT : TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS;
                            r.m_state = 42;
                            goto common_exit;
                            case 42:
                        }
                        s = *pIn_buf_cur++;
                    }
                    r.m_z_adler32 = (r.m_z_adler32 << 8) | s;
                }
            }

            for (;;)
            {
                status = TINFL_STATUS_DONE;
                r.m_state = 34;
                goto common_exit; 
                case 34:
            }
            break;

            default:
                assert(false);
        }
    

    common_exit:
    
    /* As long as we aren't telling the caller that we NEED more input to make forward progress: */
    /* Put back any bytes from the bitbuf in case we've looked ahead too far on gzip, or other Deflate streams followed by arbitrary data. */
    /* We need to be very careful here to NOT push back any bytes we definitely know we need to make forward progress, though, or we'll lock the caller up into an inf loop. */
    if ((status != TINFL_STATUS_NEEDS_MORE_INPUT) && (status != TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS))
    {
        while ((pIn_buf_cur > pIn_buf_next) && (num_bits >= 8))
        {
            --pIn_buf_cur;
            num_bits -= 8;
        }
    }
    r.m_num_bits = num_bits;
    r.m_bit_buf = bit_buf & ~(~cast(tinfl_bit_buf_t)0 << num_bits);
    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;

    // invalid flag combination
    assert( !((decomp_flags & TINFL_FLAG_COMPUTE_ADLER32) && (decomp_flags & TINFL_FLAG_DO_NOT_COMPUTE_ADLER32)));

    bool checkAdler32 = (decomp_flags & (TINFL_FLAG_PARSE_ZLIB_HEADER | TINFL_FLAG_COMPUTE_ADLER32)) && (status >= 0);
    if (decomp_flags & TINFL_FLAG_DO_NOT_COMPUTE_ADLER32)
        checkAdler32 = false;

    if (checkAdler32)
    {
        const(mz_uint8)*ptr = pOut_buf_next;
        size_t buf_len = *pOut_buf_size;
        
        s1 = r.m_check_adler32 & 0xffff;
        s2 = r.m_check_adler32 >> 16;
        size_t block_len = buf_len % 5552;
        while (buf_len)
        {
            for (i3 = 0; i3 + 7 < block_len; i3 += 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 (; i3 < block_len; ++i3)
                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;
}

/* Higher level helper functions. */
/* High level decompression functions: */
/* tinfl_decompress_mem_to_heap() decompresses a block in memory to a heap block allocated via malloc(). */
/* On entry: */
/*  pSrc_buf, src_buf_len: Pointer and size of the Deflate or zlib source data to decompress. */
/* On return: */
/*  Function returns a pointer to the decompressed data, or null on failure. */
/*  *pOut_len will be set to the decompressed data's size, which could be larger than src_buf_len on uncompressible data. */
/*  The caller must call mz_free() on the returned block when it's no longer needed. */
void *tinfl_decompress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags)
{
    tinfl_decompressor decomp;
    void *pBuf = null, pNew_buf;
    size_t src_buf_ofs = 0, out_buf_capacity = 0;
    *pOut_len = 0;
    tinfl_init(&decomp);
    for (;;)
    {
        size_t src_buf_size = src_buf_len - src_buf_ofs, dst_buf_size = out_buf_capacity - *pOut_len, new_out_buf_capacity;
        tinfl_status status = tinfl_decompress(&decomp, cast(const mz_uint8 *)pSrc_buf + src_buf_ofs, &src_buf_size, cast(mz_uint8 *)pBuf, pBuf ? cast(mz_uint8 *)pBuf + *pOut_len : null, &dst_buf_size,
                                                (flags & ~TINFL_FLAG_HAS_MORE_INPUT) | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF);
        if ((status < 0) || (status == TINFL_STATUS_NEEDS_MORE_INPUT))
        {
            MZ_FREE(pBuf);
            *pOut_len = 0;
            return null;
        }
        src_buf_ofs += src_buf_size;
        *pOut_len += dst_buf_size;
        if (status == TINFL_STATUS_DONE)
            break;
        new_out_buf_capacity = out_buf_capacity * 2;
        if (new_out_buf_capacity < 128)
            new_out_buf_capacity = 128;
        pNew_buf = MZ_REALLOC(pBuf, new_out_buf_capacity);
        if (!pNew_buf)
        {
            MZ_FREE(pBuf);
            *pOut_len = 0;
            return null;
        }
        pBuf = pNew_buf;
        out_buf_capacity = new_out_buf_capacity;
    }
    return pBuf;
}

/* tinfl_decompress_mem_to_mem() decompresses a block in memory to another block in memory. */
/* Returns TINFL_DECOMPRESS_MEM_TO_MEM_FAILED on failure, or the number of bytes written on success. */
enum TINFL_DECOMPRESS_MEM_TO_MEM_FAILED = cast(size_t)(-1);
size_t tinfl_decompress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags)
{
    tinfl_decompressor decomp;
    tinfl_status status;
    tinfl_init(&decomp);
    status = tinfl_decompress(&decomp, cast(const mz_uint8 *)pSrc_buf, &src_buf_len, cast(mz_uint8 *)pOut_buf, cast(mz_uint8 *)pOut_buf, &out_buf_len, (flags & ~TINFL_FLAG_HAS_MORE_INPUT) | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF);
    return (status != TINFL_STATUS_DONE) ? TINFL_DECOMPRESS_MEM_TO_MEM_FAILED : out_buf_len;
}


/* tinfl_decompress_mem_to_callback() decompresses a block in memory to an internal 32KB buffer, and a user provided callback function will be called to flush the buffer. */
/* Returns 1 on success or 0 on failure. */
alias tinfl_put_buf_func_ptr = int function(const(void)* pBuf, int len, void *pUser);
int tinfl_decompress_mem_to_callback(const(void)*pIn_buf, 
                                     size_t *pIn_buf_size, 
                                     tinfl_put_buf_func_ptr pPut_buf_func, 
                                     void *pPut_buf_user, int flags)
{
    int result = 0;
    tinfl_decompressor decomp;
    mz_uint8 *pDict = cast(mz_uint8 *)MZ_MALLOC(TINFL_LZ_DICT_SIZE);
    size_t in_buf_ofs = 0, dict_ofs = 0;
    if (!pDict)
        return TINFL_STATUS_FAILED;
    memset(pDict,0,TINFL_LZ_DICT_SIZE);
    tinfl_init(&decomp);
    for (;;)
    {
        size_t in_buf_size = *pIn_buf_size - in_buf_ofs, dst_buf_size = TINFL_LZ_DICT_SIZE - dict_ofs;
        tinfl_status status = tinfl_decompress(&decomp, cast(const mz_uint8 *)pIn_buf + in_buf_ofs, &in_buf_size, pDict, pDict + dict_ofs, &dst_buf_size,
                                                (flags & ~(TINFL_FLAG_HAS_MORE_INPUT | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF)));
        in_buf_ofs += in_buf_size;
        if ((dst_buf_size) && (!(*pPut_buf_func)(pDict + dict_ofs, cast(int)dst_buf_size, pPut_buf_user)))
            break;
        if (status != TINFL_STATUS_HAS_MORE_OUTPUT)
        {
            result = (status == TINFL_STATUS_DONE);
            break;
        }
        dict_ofs = (dict_ofs + dst_buf_size) & (TINFL_LZ_DICT_SIZE - 1);
    }
    MZ_FREE(pDict);
    *pIn_buf_size = in_buf_ofs;
    return result;
}

/* Allocate the tinfl_decompressor structure in C so that */
/* non-C language bindings to tinfl_ API don't need to worry about */
/* structure size and allocation mechanism. */
tinfl_decompressor *tinfl_decompressor_alloc()
{
    tinfl_decompressor *pDecomp = cast(tinfl_decompressor*) MZ_MALLOC(tinfl_decompressor.sizeof);
    if (pDecomp)
        tinfl_init(pDecomp);
    return pDecomp;
}

void tinfl_decompressor_free(tinfl_decompressor *pDecomp)
{
    MZ_FREE(pDecomp);
}


// Note: The miniz compressor wasn't translated yet, since it will only benefit PNG encoding which is already not that bad.
// However, PNG decoding being faster is way more intersting.



// miniz_def.h

/* ------------------- Low-level Compression API Definitions */

/* Set TDEFL_LESS_MEMORY to 1 to use less memory (compression will be slightly slower, and raw/dynamic blocks will be output more frequently). */
enum TDEFL_LESS_MEMORY = 0;

/* tdefl_init() compression flags logically OR'd together (low 12 bits contain the max. number of probes per dictionary search): */
/* TDEFL_DEFAULT_MAX_PROBES: The compressor defaults to 128 dictionary probes per dictionary search. 0=Huffman only, 1=Huffman+LZ (fastest/crap compression), 4095=Huffman+LZ (slowest/best compression). */
enum
{
    TDEFL_HUFFMAN_ONLY = 0,
    TDEFL_DEFAULT_MAX_PROBES = 128,
    TDEFL_MAX_PROBES_MASK = 0xFFF
}

/* TDEFL_WRITE_ZLIB_HEADER: If set, the compressor outputs a zlib header before the deflate data, and the Adler-32 of the source data at the end. Otherwise, you'll get raw deflate data. */
/* TDEFL_COMPUTE_ADLER32: Always compute the adler-32 of the input data (even when not writing zlib headers). */
/* TDEFL_GREEDY_PARSING_FLAG: Set to use faster greedy parsing, instead of more efficient lazy parsing. */
/* TDEFL_NONDETERMINISTIC_PARSING_FLAG: Enable to decrease the compressor's initialization time to the minimum, but the output may vary from run to run given the same input (depending on the contents of memory). */
/* TDEFL_RLE_MATCHES: Only look for RLE matches (matches with a distance of 1) */
/* TDEFL_FILTER_MATCHES: Discards matches <= 5 chars if enabled. */
/* TDEFL_FORCE_ALL_STATIC_BLOCKS: Disable usage of optimized Huffman tables. */
/* TDEFL_FORCE_ALL_RAW_BLOCKS: Only use raw (uncompressed) deflate blocks. */
/* The low 12 bits are reserved to control the max # of hash probes per dictionary lookup (see TDEFL_MAX_PROBES_MASK). */
enum
{
    TDEFL_WRITE_ZLIB_HEADER = 0x01000,
    TDEFL_COMPUTE_ADLER32 = 0x02000,
    TDEFL_GREEDY_PARSING_FLAG = 0x04000,
    TDEFL_NONDETERMINISTIC_PARSING_FLAG = 0x08000,
    TDEFL_RLE_MATCHES = 0x10000,
    TDEFL_FILTER_MATCHES = 0x20000,
    TDEFL_FORCE_ALL_STATIC_BLOCKS = 0x40000,
    TDEFL_FORCE_ALL_RAW_BLOCKS = 0x80000
}


/+

/* Compresses an image to a compressed PNG file in memory. */
/* On entry: */
/*  pImage, w, h, and num_chans describe the image to compress. num_chans may be 1, 2, 3, or 4. */
/*  The image pitch in bytes per scanline will be w*num_chans. The leftmost pixel on the top scanline is stored first in memory. */
/*  level may range from [0,10], use MZ_NO_COMPRESSION, MZ_BEST_SPEED, MZ_BEST_COMPRESSION, etc. or a decent default is MZ_DEFAULT_LEVEL */
/*  If flip is true, the image will be flipped on the Y axis (useful for OpenGL apps). */
/* On return: */
/*  Function returns a pointer to the compressed data, or null on failure. */
/*  *pLen_out will be set to the size of the PNG image file. */
/*  The caller must mz_free() the returned heap block (which will typically be larger than *pLen_out) when it's no longer needed. */
MINIZ_EXPORT void *tdefl_write_image_to_png_file_in_memory_ex(const void *pImage, int w, int h, int num_chans, size_t *pLen_out, mz_uint level, mz_bool flip);
MINIZ_EXPORT void *tdefl_write_image_to_png_file_in_memory(const void *pImage, int w, int h, int num_chans, size_t *pLen_out);

+/

/* Output stream interface. The compressor uses this interface to write compressed data. It'll typically be called TDEFL_OUT_BUF_SIZE at a time. */
alias tdefl_put_buf_func_ptr = mz_bool function(const(void)* pBuf, int len, void *pUser);

enum
{
    TDEFL_MAX_HUFF_TABLES = 3,
    TDEFL_MAX_HUFF_SYMBOLS_0 = 288,
    TDEFL_MAX_HUFF_SYMBOLS_1 = 32,
    TDEFL_MAX_HUFF_SYMBOLS_2 = 19,
    TDEFL_LZ_DICT_SIZE = 32768,
    TDEFL_LZ_DICT_SIZE_MASK = TDEFL_LZ_DICT_SIZE - 1,
    TDEFL_MIN_MATCH_LEN = 3,
    TDEFL_MAX_MATCH_LEN = 258
}

/* TDEFL_OUT_BUF_SIZE MUST be large enough to hold a single entire compressed output block (using static/fixed Huffman codes). */
static if(TDEFL_LESS_MEMORY)
{
    enum
    {
        TDEFL_LZ_CODE_BUF_SIZE = 24 * 1024,
        TDEFL_OUT_BUF_SIZE = (TDEFL_LZ_CODE_BUF_SIZE * 13) / 10,
        TDEFL_MAX_HUFF_SYMBOLS = 288,
        TDEFL_LZ_HASH_BITS = 12,
        TDEFL_LEVEL1_HASH_SIZE_MASK = 4095,
        TDEFL_LZ_HASH_SHIFT = (TDEFL_LZ_HASH_BITS + 2) / 3,
        TDEFL_LZ_HASH_SIZE = 1 << TDEFL_LZ_HASH_BITS
    }
}
else
{
    enum
    {
        TDEFL_LZ_CODE_BUF_SIZE = 64 * 1024,
        TDEFL_OUT_BUF_SIZE = (TDEFL_LZ_CODE_BUF_SIZE * 13) / 10,
        TDEFL_MAX_HUFF_SYMBOLS = 288,
        TDEFL_LZ_HASH_BITS = 15,
        TDEFL_LEVEL1_HASH_SIZE_MASK = 4095,
        TDEFL_LZ_HASH_SHIFT = (TDEFL_LZ_HASH_BITS + 2) / 3,
        TDEFL_LZ_HASH_SIZE = 1 << TDEFL_LZ_HASH_BITS
    }
}

/* The low-level tdefl functions below may be used directly if the above helper functions aren't flexible enough. The low-level functions don't make any heap allocations, unlike the above helper functions. */
alias tdefl_status = int;
enum : tdefl_status 
{
    TDEFL_STATUS_BAD_PARAM = -2,
    TDEFL_STATUS_PUT_BUF_FAILED = -1,
    TDEFL_STATUS_OKAY = 0,
    TDEFL_STATUS_DONE = 1
}

/* Must map to MZ_NO_FLUSH, MZ_SYNC_FLUSH, etc. enums */
alias tdefl_flush = int;
enum : tdefl_flush
{
    TDEFL_NO_FLUSH = 0,
    TDEFL_SYNC_FLUSH = 2,
    TDEFL_FULL_FLUSH = 3,
    TDEFL_FINISH = 4
}

/* tdefl's compression state structure. */
struct tdefl_compressor
{
    tdefl_put_buf_func_ptr m_pPut_buf_func;
    void *m_pPut_buf_user;
    mz_uint m_flags;
    mz_uint[2] m_max_probes;
    int m_greedy_parsing;
    mz_uint m_adler32, m_lookahead_pos, m_lookahead_size, m_dict_size;
    mz_uint8 *m_pLZ_code_buf, m_pLZ_flags, m_pOutput_buf, m_pOutput_buf_end;
    mz_uint m_num_flags_left, m_total_lz_bytes, m_lz_code_buf_dict_pos, m_bits_in, m_bit_buffer;
    mz_uint m_saved_match_dist, m_saved_match_len, m_saved_lit, m_output_flush_ofs, m_output_flush_remaining, m_finished, m_block_index, m_wants_to_finish;
    tdefl_status m_prev_return_status;
    const(void)* m_pIn_buf;
    void* m_pOut_buf;
    size_t* m_pIn_buf_size, m_pOut_buf_size;
    tdefl_flush m_flush;
    const(mz_uint8)* m_pSrc;
    size_t m_src_buf_left, m_out_buf_ofs;
    mz_uint8[TDEFL_LZ_DICT_SIZE + TDEFL_MAX_MATCH_LEN - 1] m_dict;
    mz_uint16[TDEFL_MAX_HUFF_SYMBOLS][TDEFL_MAX_HUFF_TABLES] m_huff_count;
    mz_uint16[TDEFL_MAX_HUFF_SYMBOLS][TDEFL_MAX_HUFF_TABLES] m_huff_codes;
    mz_uint8[TDEFL_MAX_HUFF_SYMBOLS][TDEFL_MAX_HUFF_TABLES] m_huff_code_sizes;
    mz_uint8[TDEFL_LZ_CODE_BUF_SIZE] m_lz_code_buf;
    mz_uint16[TDEFL_LZ_DICT_SIZE] m_next;
    mz_uint16[TDEFL_LZ_HASH_SIZE] m_hash;
    mz_uint8[TDEFL_OUT_BUF_SIZE] m_output_buf;
}


// miniz_def.c

/* ------------------- Low-level Compression (independent from all decompression API's) */

/* Purposely making these tables static for faster init and thread safety. */
static immutable mz_uint16[256] s_tdefl_len_sym =
[
    257, 258, 259, 260, 261, 262, 263, 264, 265, 265, 266, 266, 267, 267, 268, 268, 269, 269, 269, 269, 270, 270, 270, 270, 271, 271, 271, 271, 272, 272, 272, 272,
    273, 273, 273, 273, 273, 273, 273, 273, 274, 274, 274, 274, 274, 274, 274, 274, 275, 275, 275, 275, 275, 275, 275, 275, 276, 276, 276, 276, 276, 276, 276, 276,
    277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 277, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278, 278,
    279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 279, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280, 280,
    281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281, 281,
    282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282, 282,
    283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283, 283,
    284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 284, 285
];

static immutable mz_uint8[256] s_tdefl_len_extra =
[
    0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
    4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 0
];

static immutable mz_uint8[512] s_tdefl_small_dist_sym =
[
    0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11,
    11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13,
    13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
    14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
    14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
    15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
    16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
    16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,
    16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
    17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
    17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
    17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17
];

static immutable mz_uint8[512] s_tdefl_small_dist_extra =
[
    0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5,
    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
    6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
    6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
    7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
    7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
    7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
    7, 7, 7, 7, 7, 7, 7, 7
];

static immutable mz_uint8[128] s_tdefl_large_dist_sym =
[
    0, 0, 18, 19, 20, 20, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
    26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
    28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29
];

static immutable mz_uint8[128] s_tdefl_large_dist_extra =
[
    0, 0, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
    12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13,
    13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13
];

/* Radix sorts tdefl_sym_freq[] array by 16-bit key m_key. Returns ptr to sorted values. */
struct tdefl_sym_freq
{
    mz_uint16 m_key, m_sym_index;
}

static tdefl_sym_freq *tdefl_radix_sort_syms(mz_uint num_syms, tdefl_sym_freq *pSyms0, tdefl_sym_freq *pSyms1)
{
    mz_uint32 total_passes = 2, pass_shift, pass, i;
    mz_uint32[256 * 2] hist = void;
    tdefl_sym_freq* pCur_syms = pSyms0, 
                    pNew_syms = pSyms1;
    hist[] = 0;
    for (i = 0; i < num_syms; i++)
    {
        mz_uint freq = pSyms0[i].m_key;
        hist[freq & 0xFF]++;
        hist[256 + ((freq >> 8) & 0xFF)]++;
    }
    while ((total_passes > 1) && (num_syms == hist[(total_passes - 1) * 256]))
        total_passes--;
    for (pass_shift = 0, pass = 0; pass < total_passes; pass++, pass_shift += 8)
    {
        const mz_uint32 *pHist = &hist[pass << 8];
        mz_uint[256] offsets = void;
        mz_uint cur_ofs = 0;
        for (i = 0; i < 256; i++)
        {
            offsets[i] = cur_ofs;
            cur_ofs += pHist[i];
        }
        for (i = 0; i < num_syms; i++)
            pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] = pCur_syms[i];
        {
            tdefl_sym_freq *t = pCur_syms;
            pCur_syms = pNew_syms;
            pNew_syms = t;
        }
    }
    return pCur_syms;
}

/* tdefl_calculate_minimum_redundancy() originally written by: Alistair Moffat, alistair@cs.mu.oz.au, Jyrki Katajainen, jyrki@diku.dk, November 1996. */
static void tdefl_calculate_minimum_redundancy(tdefl_sym_freq *A, int n)
{
    int root, leaf, next, avbl, used, dpth;
    if (n == 0)
        return;
    else if (n == 1)
    {
        A[0].m_key = 1;
        return;
    }
    A[0].m_key += A[1].m_key;
    root = 0;
    leaf = 2;
    for (next = 1; next < n - 1; next++)
    {
        if (leaf >= n || A[root].m_key < A[leaf].m_key)
        {
            A[next].m_key = A[root].m_key;
            A[root++].m_key = cast(mz_uint16)next;
        }
        else
            A[next].m_key = A[leaf++].m_key;
        if (leaf >= n || (root < next && A[root].m_key < A[leaf].m_key))
        {
            A[next].m_key = cast(mz_uint16)(A[next].m_key + A[root].m_key);
            A[root++].m_key = cast(mz_uint16)next;
        }
        else
            A[next].m_key = cast(mz_uint16)(A[next].m_key + A[leaf++].m_key);
    }
    A[n - 2].m_key = 0;
    for (next = n - 3; next >= 0; next--)
        A[next].m_key = cast(ushort)( A[A[next].m_key].m_key + 1 );
    avbl = 1;
    used = dpth = 0;
    root = n - 2;
    next = n - 1;
    while (avbl > 0)
    {
        while (root >= 0 && cast(int)A[root].m_key == dpth)
        {
            used++;
            root--;
        }
        while (avbl > used)
        {
            A[next--].m_key = cast(mz_uint16)(dpth);
            avbl--;
        }
        avbl = 2 * used;
        dpth++;
        used = 0;
    }
}

/* Limits canonical Huffman code table's max code size. */
enum
{
    TDEFL_MAX_SUPPORTED_HUFF_CODESIZE = 32
};
static void tdefl_huffman_enforce_max_code_size(int *pNum_codes, int code_list_len, int max_code_size)
{
    int i;
    mz_uint32 total = 0;
    if (code_list_len <= 1)
        return;
    for (i = max_code_size + 1; i <= TDEFL_MAX_SUPPORTED_HUFF_CODESIZE; i++)
        pNum_codes[max_code_size] += pNum_codes[i];
    for (i = max_code_size; i > 0; i--)
        total += ((cast(mz_uint32)pNum_codes[i]) << (max_code_size - i));
    while (total != (1UL << max_code_size))
    {
        pNum_codes[max_code_size]--;
        for (i = max_code_size - 1; i > 0; i--)
            if (pNum_codes[i])
            {
                pNum_codes[i]--;
                pNum_codes[i + 1] += 2;
                break;
            }
        total--;
    }
}

static void tdefl_optimize_huffman_table(tdefl_compressor *d, int table_num, int table_len, int code_size_limit, int static_table)
{
    int i, j, l;
    int[1 + TDEFL_MAX_SUPPORTED_HUFF_CODESIZE] num_codes = void;
    mz_uint[TDEFL_MAX_SUPPORTED_HUFF_CODESIZE + 1] next_code;
    num_codes[] = 0;
    if (static_table)
    {
        for (i = 0; i < table_len; i++)
            num_codes[d.m_huff_code_sizes[table_num][i]]++;
    }
    else
    {
        tdefl_sym_freq[TDEFL_MAX_HUFF_SYMBOLS] syms0;
        tdefl_sym_freq[TDEFL_MAX_HUFF_SYMBOLS] syms1;
        tdefl_sym_freq* pSyms;
        int num_used_syms = 0;
        const mz_uint16 *pSym_count = &d.m_huff_count[table_num][0];
        for (i = 0; i < table_len; i++)
            if (pSym_count[i])
            {
                syms0[num_used_syms].m_key = cast(mz_uint16)pSym_count[i];
                syms0[num_used_syms++].m_sym_index = cast(mz_uint16)i;
            }

        pSyms = tdefl_radix_sort_syms(num_used_syms, syms0.ptr, syms1.ptr);
        tdefl_calculate_minimum_redundancy(pSyms, num_used_syms);

        for (i = 0; i < num_used_syms; i++)
            num_codes[pSyms[i].m_key]++;

        tdefl_huffman_enforce_max_code_size(num_codes.ptr, num_used_syms, code_size_limit);

        d.m_huff_code_sizes[table_num][] = 0;
        d.m_huff_codes[table_num][] = 0;
        for (i = 1, j = num_used_syms; i <= code_size_limit; i++)
            for (l = num_codes[i]; l > 0; l--)
                d.m_huff_code_sizes[table_num][pSyms[--j].m_sym_index] = cast(mz_uint8)(i);
    }

    next_code[1] = 0;
    for (j = 0, i = 2; i <= code_size_limit; i++)
        next_code[i] = j = ((j + num_codes[i - 1]) << 1);

    for (i = 0; i < table_len; i++)
    {
        mz_uint rev_code = 0, code, code_size;
        if ((code_size = d.m_huff_code_sizes[table_num][i]) == 0)
            continue;
        code = next_code[code_size]++;
        for (l = code_size; l > 0; l--, code >>= 1)
            rev_code = (rev_code << 1) | (code & 1);
        d.m_huff_codes[table_num][i] = cast(mz_uint16)rev_code;
    }
}

/*
#define TDEFL_PUT_BITS(b, l)
do
{
    mz_uint bits = b;
    mz_uint len = l;
    assert(bits <= ((1U << len) - 1U));
    d.m_bit_buffer |= (bits << d.m_bits_in);
    d.m_bits_in += len;
    while (d.m_bits_in >= 8)
    {
        if (d.m_pOutput_buf < d.m_pOutput_buf_end)
            *d.m_pOutput_buf++ = (mz_uint8)(d.m_bit_buffer);
        d.m_bit_buffer >>= 8;
        d.m_bits_in -= 8;
    }
}
*/
 
    /*

    */
/*

*/

__gshared static immutable mz_uint8[19] s_tdefl_packed_code_size_syms_swizzle = 
[ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];

static void tdefl_start_dynamic_block(tdefl_compressor *d)
{
    int num_lit_codes, num_dist_codes, num_bit_lengths;
    mz_uint i, total_code_sizes_to_pack, num_packed_code_sizes, rle_z_count, rle_repeat_count, packed_code_sizes_index;
    mz_uint8[TDEFL_MAX_HUFF_SYMBOLS_0 + TDEFL_MAX_HUFF_SYMBOLS_1] code_sizes_to_pack;
    mz_uint8[TDEFL_MAX_HUFF_SYMBOLS_0 + TDEFL_MAX_HUFF_SYMBOLS_1] packed_code_sizes;
    mz_uint8 prev_code_size = 0xFF;

    d.m_huff_count[0][256] = 1;

    tdefl_optimize_huffman_table(d, 0, TDEFL_MAX_HUFF_SYMBOLS_0, 15, MZ_FALSE);
    tdefl_optimize_huffman_table(d, 1, TDEFL_MAX_HUFF_SYMBOLS_1, 15, MZ_FALSE);

    for (num_lit_codes = 286; num_lit_codes > 257; num_lit_codes--)
        if (d.m_huff_code_sizes[0][num_lit_codes - 1])
            break;
    for (num_dist_codes = 30; num_dist_codes > 1; num_dist_codes--)
        if (d.m_huff_code_sizes[1][num_dist_codes - 1])
            break;

    memcpy(code_sizes_to_pack.ptr, &d.m_huff_code_sizes[0][0], num_lit_codes);
    memcpy(code_sizes_to_pack.ptr + num_lit_codes, &d.m_huff_code_sizes[1][0], num_dist_codes);
    total_code_sizes_to_pack = num_lit_codes + num_dist_codes;
    num_packed_code_sizes = 0;
    rle_z_count = 0;
    rle_repeat_count = 0;

    memset(&d.m_huff_count[2][0], 0, (d.m_huff_count[2][0]).sizeof * TDEFL_MAX_HUFF_SYMBOLS_2);

    void TDEFL_RLE_PREV_CODE_SIZE() pure nothrow @nogc
    {
        if (rle_repeat_count)
        {
            if (rle_repeat_count < 3)
            {
                d.m_huff_count[2][prev_code_size] = cast(mz_uint16)(d.m_huff_count[2][prev_code_size] + rle_repeat_count);
                while (rle_repeat_count--)
                    packed_code_sizes[num_packed_code_sizes++] = prev_code_size;
            }
            else
            {
                d.m_huff_count[2][16] = cast(mz_uint16)(d.m_huff_count[2][16] + 1);
                packed_code_sizes[num_packed_code_sizes++] = 16;
                packed_code_sizes[num_packed_code_sizes++] = cast(mz_uint8)(rle_repeat_count - 3);
            }
            rle_repeat_count = 0;
        }
    }

    void TDEFL_RLE_ZERO_CODE_SIZE()
    {
        if (rle_z_count)
        {
            if (rle_z_count < 3)
            {
                d.m_huff_count[2][0] = cast(mz_uint16)(d.m_huff_count[2][0] + rle_z_count);
                while (rle_z_count--)
                    packed_code_sizes[num_packed_code_sizes++] = 0;
            }
            else if (rle_z_count <= 10)
            {
                d.m_huff_count[2][17] = cast(mz_uint16)(d.m_huff_count[2][17] + 1);
                packed_code_sizes[num_packed_code_sizes++] = 17;
                packed_code_sizes[num_packed_code_sizes++] = cast(mz_uint8)(rle_z_count - 3);
            }
            else
            {
                d.m_huff_count[2][18] = cast(mz_uint16)(d.m_huff_count[2][18] + 1);
                packed_code_sizes[num_packed_code_sizes++] = 18;
                packed_code_sizes[num_packed_code_sizes++] = cast(mz_uint8)(rle_z_count - 11);
            }
            rle_z_count = 0;
        }
    }

    void TDEFL_PUT_BITS(mz_uint b, mz_uint l)
    {
        mz_uint bits = b;
        mz_uint len = l;
        assert(bits <= ((1U << len) - 1U));
        d.m_bit_buffer |= (bits << d.m_bits_in);
        d.m_bits_in += len;
        while (d.m_bits_in >= 8)
        {
            if (d.m_pOutput_buf < d.m_pOutput_buf_end)
                *d.m_pOutput_buf++ = cast(mz_uint8)(d.m_bit_buffer);
            d.m_bit_buffer >>= 8;
            d.m_bits_in -= 8;
        }
    }

    for (i = 0; i < total_code_sizes_to_pack; i++)
    {
        mz_uint8 code_size = code_sizes_to_pack[i];
        if (!code_size)
        {
            TDEFL_RLE_PREV_CODE_SIZE();
            if (++rle_z_count == 138)
            {
                TDEFL_RLE_ZERO_CODE_SIZE();
            }
        }
        else
        {
            TDEFL_RLE_ZERO_CODE_SIZE();
            if (code_size != prev_code_size)
            {
                TDEFL_RLE_PREV_CODE_SIZE();
                d.m_huff_count[2][code_size] = cast(mz_uint16)(d.m_huff_count[2][code_size] + 1);
                packed_code_sizes[num_packed_code_sizes++] = code_size;
            }
            else if (++rle_repeat_count == 6)
            {
                TDEFL_RLE_PREV_CODE_SIZE();
            }
        }
        prev_code_size = code_size;
    }
    if (rle_repeat_count)
    {
        TDEFL_RLE_PREV_CODE_SIZE();
    }
    else
    {
        TDEFL_RLE_ZERO_CODE_SIZE();
    }

    tdefl_optimize_huffman_table(d, 2, TDEFL_MAX_HUFF_SYMBOLS_2, 7, MZ_FALSE);

    TDEFL_PUT_BITS(2, 2);

    TDEFL_PUT_BITS(num_lit_codes - 257, 5);
    TDEFL_PUT_BITS(num_dist_codes - 1, 5);

    for (num_bit_lengths = 18; num_bit_lengths >= 0; num_bit_lengths--)
        if (d.m_huff_code_sizes[2][s_tdefl_packed_code_size_syms_swizzle[num_bit_lengths]])
            break;
    num_bit_lengths = MZ_MAX_int(4, (num_bit_lengths + 1));
    TDEFL_PUT_BITS(num_bit_lengths - 4, 4);
    for (i = 0; cast(int)i < num_bit_lengths; i++)
        TDEFL_PUT_BITS(d.m_huff_code_sizes[2][s_tdefl_packed_code_size_syms_swizzle[i]], 3);

    for (packed_code_sizes_index = 0; packed_code_sizes_index < num_packed_code_sizes;)
    {
        mz_uint code = packed_code_sizes[packed_code_sizes_index++];
        assert(code < TDEFL_MAX_HUFF_SYMBOLS_2);
        TDEFL_PUT_BITS(d.m_huff_codes[2][code], d.m_huff_code_sizes[2][code]);
        if (code >= 16)
            TDEFL_PUT_BITS(packed_code_sizes[packed_code_sizes_index++], "\02\03\07"[code - 16]);
    }
}

static void tdefl_start_static_block(tdefl_compressor *d)
{
    mz_uint i;
    mz_uint8 *p = &d.m_huff_code_sizes[0][0];

    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;

    memset(d.m_huff_code_sizes[1].ptr, 5, 32);

    tdefl_optimize_huffman_table(d, 0, 288, 15, MZ_TRUE);
    tdefl_optimize_huffman_table(d, 1, 32, 15, MZ_TRUE);

    void TDEFL_PUT_BITS(mz_uint b, mz_uint l)
    {
        mz_uint bits = b;
        mz_uint len = l;
        assert(bits <= ((1U << len) - 1U));
        d.m_bit_buffer |= (bits << d.m_bits_in);
        d.m_bits_in += len;
        while (d.m_bits_in >= 8)
        {
            if (d.m_pOutput_buf < d.m_pOutput_buf_end)
                *d.m_pOutput_buf++ = cast(mz_uint8)(d.m_bit_buffer);
            d.m_bit_buffer >>= 8;
            d.m_bits_in -= 8;
        }
    }

    TDEFL_PUT_BITS(1, 2);
}

__gshared static immutable mz_uint[17] mz_bitmasks 
  = [ 0x0000, 0x0001, 0x0003, 0x0007, 0x000F, 0x001F, 0x003F, 0x007F, 0x00FF, 0x01FF, 0x03FF, 0x07FF, 0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF ];

   
static mz_bool tdefl_compress_lz_codes(tdefl_compressor *d)
{
    mz_uint flags;
    mz_uint8 *pLZ_codes;

    void TDEFL_PUT_BITS(mz_uint b, mz_uint l)
    {
        mz_uint bits = b;
        mz_uint len = l;
        assert(bits <= ((1U << len) - 1U));
        d.m_bit_buffer |= (bits << d.m_bits_in);
        d.m_bits_in += len;
        while (d.m_bits_in >= 8)
        {
            if (d.m_pOutput_buf < d.m_pOutput_buf_end)
                *d.m_pOutput_buf++ = cast(mz_uint8)(d.m_bit_buffer);
            d.m_bit_buffer >>= 8;
            d.m_bits_in -= 8;
        }
    }

    flags = 1;
    for (pLZ_codes = d.m_lz_code_buf.ptr; pLZ_codes < d.m_pLZ_code_buf; flags >>= 1)
    {
        if (flags == 1)
            flags = *pLZ_codes++ | 0x100;
        if (flags & 1)
        {
            mz_uint sym, num_extra_bits;
            mz_uint match_len = pLZ_codes[0], match_dist = (pLZ_codes[1] | (pLZ_codes[2] << 8));
            pLZ_codes += 3;

            assert(d.m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]);
            TDEFL_PUT_BITS(d.m_huff_codes[0][s_tdefl_len_sym[match_len]], d.m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]);
            TDEFL_PUT_BITS(match_len & mz_bitmasks[s_tdefl_len_extra[match_len]], s_tdefl_len_extra[match_len]);

            if (match_dist < 512)
            {
                sym = s_tdefl_small_dist_sym[match_dist];
                num_extra_bits = s_tdefl_small_dist_extra[match_dist];
            }
            else
            {
                sym = s_tdefl_large_dist_sym[match_dist >> 8];
                num_extra_bits = s_tdefl_large_dist_extra[match_dist >> 8];
            }
            assert(d.m_huff_code_sizes[1][sym]);
            TDEFL_PUT_BITS(d.m_huff_codes[1][sym], d.m_huff_code_sizes[1][sym]);
            TDEFL_PUT_BITS(match_dist & mz_bitmasks[num_extra_bits], num_extra_bits);
        }
        else
        {
            mz_uint lit = *pLZ_codes++;
            assert(d.m_huff_code_sizes[0][lit]);
            TDEFL_PUT_BITS(d.m_huff_codes[0][lit], d.m_huff_code_sizes[0][lit]);
        }
    }

    TDEFL_PUT_BITS(d.m_huff_codes[0][256], d.m_huff_code_sizes[0][256]);

    return (d.m_pOutput_buf < d.m_pOutput_buf_end);
}

static mz_bool tdefl_compress_block(tdefl_compressor *d, mz_bool static_block)
{
    if (static_block)
        tdefl_start_static_block(d);
    else
        tdefl_start_dynamic_block(d);
    return tdefl_compress_lz_codes(d);
}

static int tdefl_flush_block(tdefl_compressor *d, int flush)
{
    mz_uint saved_bit_buf, saved_bits_in;
    mz_uint8 *pSaved_output_buf;
    mz_bool comp_block_succeeded = MZ_FALSE;
    int n, use_raw_block = ((d.m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS) != 0) && (d.m_lookahead_pos - d.m_lz_code_buf_dict_pos) <= d.m_dict_size;
    mz_uint8 *pOutput_buf_start = ((d.m_pPut_buf_func == null) && ((*d.m_pOut_buf_size - d.m_out_buf_ofs) >= TDEFL_OUT_BUF_SIZE)) 
                                ? (cast(mz_uint8 *)d.m_pOut_buf + d.m_out_buf_ofs)
                                : d.m_output_buf.ptr;

    d.m_pOutput_buf = pOutput_buf_start;
    d.m_pOutput_buf_end = d.m_pOutput_buf + TDEFL_OUT_BUF_SIZE - 16;

    assert(!d.m_output_flush_remaining);
    d.m_output_flush_ofs = 0;
    d.m_output_flush_remaining = 0;

    *d.m_pLZ_flags = cast(mz_uint8)(*d.m_pLZ_flags >> d.m_num_flags_left);
    d.m_pLZ_code_buf -= (d.m_num_flags_left == 8);

    void TDEFL_PUT_BITS(mz_uint b, mz_uint l)
    {
        mz_uint bits = b;
        mz_uint len = l;
        assert(bits <= ((1U << len) - 1U));
        d.m_bit_buffer |= (bits << d.m_bits_in);
        d.m_bits_in += len;
        while (d.m_bits_in >= 8)
        {
            if (d.m_pOutput_buf < d.m_pOutput_buf_end)
                *d.m_pOutput_buf++ = cast(mz_uint8)(d.m_bit_buffer);
            d.m_bit_buffer >>= 8;
            d.m_bits_in -= 8;
        }
    }

    if ((d.m_flags & TDEFL_WRITE_ZLIB_HEADER) && (!d.m_block_index))
    {
        const mz_uint8 cmf = 0x78;
        mz_uint8 flg, flevel = 3;
        mz_uint header, i, mz_un = (s_tdefl_num_probes).sizeof / mz_uint.sizeof;

        /* Determine compression level by reversing the process in tdefl_create_comp_flags_from_zip_params() */
        for (i = 0; i < mz_un; i++)
            if (s_tdefl_num_probes[i] == (d.m_flags & 0xFFF)) break;

        if (i < 2)
            flevel = 0;
        else if (i < 6)
            flevel = 1;
        else if (i == 6)
            flevel = 2;

        header = cmf << 8 | (flevel << 6);
        header += 31 - (header % 31);
        flg = header & 0xFF;

        TDEFL_PUT_BITS(cmf, 8);
        TDEFL_PUT_BITS(flg, 8);
    }

    TDEFL_PUT_BITS(flush == TDEFL_FINISH, 1);

    pSaved_output_buf = d.m_pOutput_buf;
    saved_bit_buf = d.m_bit_buffer;
    saved_bits_in = d.m_bits_in;

    if (!use_raw_block)
        comp_block_succeeded = tdefl_compress_block(d, (d.m_flags & TDEFL_FORCE_ALL_STATIC_BLOCKS) || (d.m_total_lz_bytes < 48));

    /* If the block gets expanded, forget the current contents of the output buffer and send a raw block instead. */
    if (((use_raw_block) || ((d.m_total_lz_bytes) && ((d.m_pOutput_buf - pSaved_output_buf + 1U) >= d.m_total_lz_bytes))) &&
        ((d.m_lookahead_pos - d.m_lz_code_buf_dict_pos) <= d.m_dict_size))
    {
        mz_uint i;
        d.m_pOutput_buf = pSaved_output_buf;
        d.m_bit_buffer = saved_bit_buf, d.m_bits_in = saved_bits_in;
        TDEFL_PUT_BITS(0, 2);
        if (d.m_bits_in)
        {
            TDEFL_PUT_BITS(0, 8 - d.m_bits_in);
        }
        for (i = 2; i; --i, d.m_total_lz_bytes ^= 0xFFFF)
        {
            TDEFL_PUT_BITS(d.m_total_lz_bytes & 0xFFFF, 16);
        }
        for (i = 0; i < d.m_total_lz_bytes; ++i)
        {
            TDEFL_PUT_BITS(d.m_dict[(d.m_lz_code_buf_dict_pos + i) & TDEFL_LZ_DICT_SIZE_MASK], 8);
        }
    }
    /* Check for the extremely unlikely (if not impossible) case of the compressed block not fitting into the output buffer when using dynamic codes. */
    else if (!comp_block_succeeded)
    {
        d.m_pOutput_buf = pSaved_output_buf;
        d.m_bit_buffer = saved_bit_buf, d.m_bits_in = saved_bits_in;
        tdefl_compress_block(d, MZ_TRUE);
    }

    if (flush)
    {
        if (flush == TDEFL_FINISH)
        {
            if (d.m_bits_in)
            {
                TDEFL_PUT_BITS(0, 8 - d.m_bits_in);
            }
            if (d.m_flags & TDEFL_WRITE_ZLIB_HEADER)
            {
                mz_uint i, a = d.m_adler32;
                for (i = 0; i < 4; i++)
                {
                    TDEFL_PUT_BITS((a >> 24) & 0xFF, 8);
                    a <<= 8;
                }
            }
        }
        else
        {
            mz_uint i, z = 0;
            TDEFL_PUT_BITS(0, 3);
            if (d.m_bits_in)
            {
                TDEFL_PUT_BITS(0, 8 - d.m_bits_in);
            }
            for (i = 2; i; --i, z ^= 0xFFFF)
            {
                TDEFL_PUT_BITS(z & 0xFFFF, 16);
            }
        }
    }

    assert(d.m_pOutput_buf < d.m_pOutput_buf_end);

    memset(&d.m_huff_count[0][0], 0, (d.m_huff_count[0][0]).sizeof * TDEFL_MAX_HUFF_SYMBOLS_0);
    memset(&d.m_huff_count[1][0], 0, (d.m_huff_count[1][0]).sizeof * TDEFL_MAX_HUFF_SYMBOLS_1);

    d.m_pLZ_code_buf = d.m_lz_code_buf.ptr + 1;
    d.m_pLZ_flags = d.m_lz_code_buf.ptr;
    d.m_num_flags_left = 8;
    d.m_lz_code_buf_dict_pos += d.m_total_lz_bytes;
    d.m_total_lz_bytes = 0;
    d.m_block_index++;

    if ((n = cast(int)(d.m_pOutput_buf - pOutput_buf_start)) != 0)
    {
        if (d.m_pPut_buf_func)
        {
            *d.m_pIn_buf_size = d.m_pSrc - cast(const mz_uint8 *)d.m_pIn_buf;
            if (!(*d.m_pPut_buf_func)(d.m_output_buf.ptr, n, d.m_pPut_buf_user))
                return (d.m_prev_return_status = TDEFL_STATUS_PUT_BUF_FAILED);
        }
        else if (pOutput_buf_start == d.m_output_buf.ptr)
        {
            int bytes_to_copy = cast(int)MZ_MIN_size_t(cast(size_t)n, cast(size_t)(*d.m_pOut_buf_size - d.m_out_buf_ofs));
            memcpy(cast(mz_uint8 *)d.m_pOut_buf + d.m_out_buf_ofs, d.m_output_buf.ptr, bytes_to_copy);
            d.m_out_buf_ofs += bytes_to_copy;
            if ((n -= bytes_to_copy) != 0)
            {
                d.m_output_flush_ofs = bytes_to_copy;
                d.m_output_flush_remaining = n;
            }
        }
        else
        {
            d.m_out_buf_ofs += n;
        }
    }

    return d.m_output_flush_remaining;
}

ushort TDEFL_READ_UNALIGNED_WORD(const(void)* p)
{
    return *cast(const(mz_uint16)*)(p);
}
alias TDEFL_READ_UNALIGNED_WORD2 = TDEFL_READ_UNALIGNED_WORD;

version(LittleEndian)
{
    mz_uint32 TDEFL_READ_UNALIGNED_WORD32(const(mz_uint8)* p)
    {
        return *cast(const(mz_uint32)*)(p);
    }
}

void tdefl_find_match(tdefl_compressor *d, mz_uint lookahead_pos, mz_uint max_dist, mz_uint max_match_len, mz_uint *pMatch_dist, mz_uint *pMatch_len)
{
    mz_uint dist, pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK, match_len = *pMatch_len, probe_pos = pos, next_probe_pos, probe_len;
    mz_uint num_probes_left = d.m_max_probes[match_len >= 32];
    const(mz_uint16)*s = cast(const(mz_uint16)*)(d.m_dict.ptr + pos);
    const(mz_uint16)*p, q;
    mz_uint16 c01 = TDEFL_READ_UNALIGNED_WORD(&d.m_dict[pos + match_len - 1]), s01 = TDEFL_READ_UNALIGNED_WORD2(s);
    assert(max_match_len <= TDEFL_MAX_MATCH_LEN);
    if (max_match_len <= match_len)
        return;
    for (;;)
    {
        for (;;)
        {
            if (--num_probes_left == 0)
                return;

            next_probe_pos = d.m_next[probe_pos];
            if ((!next_probe_pos) || ((dist = cast(mz_uint16)(lookahead_pos - next_probe_pos)) > max_dist))
                return;
            probe_pos = next_probe_pos & TDEFL_LZ_DICT_SIZE_MASK;
            if (TDEFL_READ_UNALIGNED_WORD(&d.m_dict[probe_pos + match_len - 1]) == c01)
                break;

            next_probe_pos = d.m_next[probe_pos];
            if ((!next_probe_pos) || ((dist = cast(mz_uint16)(lookahead_pos - next_probe_pos)) > max_dist))
                return;
            probe_pos = next_probe_pos & TDEFL_LZ_DICT_SIZE_MASK;
            if (TDEFL_READ_UNALIGNED_WORD(&d.m_dict[probe_pos + match_len - 1]) == c01)
                break;

            next_probe_pos = d.m_next[probe_pos];
            if ((!next_probe_pos) || ((dist = cast(mz_uint16)(lookahead_pos - next_probe_pos)) > max_dist))
                return;
            probe_pos = next_probe_pos & TDEFL_LZ_DICT_SIZE_MASK;
            if (TDEFL_READ_UNALIGNED_WORD(&d.m_dict[probe_pos + match_len - 1]) == c01)
                break;
        }
        if (!dist)
            break;
        q = cast(const(mz_uint16)*)(d.m_dict.ptr + probe_pos);
        if (TDEFL_READ_UNALIGNED_WORD2(q) != s01)
            continue;
        p = s;
        probe_len = 32;
        do
        {
        } while ((TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) &&
                    (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (--probe_len > 0));
        if (!probe_len)
        {
            *pMatch_dist = dist;
            *pMatch_len = MZ_MIN_uint(max_match_len, cast(mz_uint)TDEFL_MAX_MATCH_LEN);
            break;
        }
        else if ((probe_len = (cast(mz_uint)(p - s) * 2) + cast(mz_uint)(*cast(const(mz_uint8)*)p == *cast(const(mz_uint8)*)q)) > match_len)
        {
            *pMatch_dist = dist;
            if ((*pMatch_len = match_len = MZ_MIN_uint(max_match_len, probe_len)) == max_match_len)
                break;
            c01 = TDEFL_READ_UNALIGNED_WORD(&d.m_dict[pos + match_len - 1]);
        }
    }
}

version(LittleEndian)
{
    mz_bool tdefl_compress_fast(tdefl_compressor *d)
    {
        /* Faster, minimally featured LZRW1-style match+parse loop with better register utilization. Intended for applications where raw throughput is valued more highly than ratio. */
        mz_uint lookahead_pos = d.m_lookahead_pos, 
                lookahead_size = d.m_lookahead_size, 
                dict_size = d.m_dict_size, 
                total_lz_bytes = d.m_total_lz_bytes, 
                num_flags_left = d.m_num_flags_left;
        mz_uint8 *pLZ_code_buf = d.m_pLZ_code_buf, 
                  pLZ_flags = d.m_pLZ_flags;
        mz_uint cur_pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK;

        while ((d.m_src_buf_left) || ((d.m_flush) && (lookahead_size)))
        {
            const mz_uint TDEFL_COMP_FAST_LOOKAHEAD_SIZE = 4096;
            mz_uint dst_pos = (lookahead_pos + lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK;
            mz_uint num_bytes_to_process = cast(mz_uint)MZ_MIN_size_t(d.m_src_buf_left, TDEFL_COMP_FAST_LOOKAHEAD_SIZE - lookahead_size);
            d.m_src_buf_left -= num_bytes_to_process;
            lookahead_size += num_bytes_to_process;

            while (num_bytes_to_process)
            {
                mz_uint32 n = MZ_MIN_uint(TDEFL_LZ_DICT_SIZE - dst_pos, num_bytes_to_process);
                memcpy(d.m_dict.ptr + dst_pos, d.m_pSrc, n);
                if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1))
                    memcpy(d.m_dict.ptr + TDEFL_LZ_DICT_SIZE + dst_pos, d.m_pSrc, MZ_MIN_uint(n, (TDEFL_MAX_MATCH_LEN - 1) - dst_pos));
                d.m_pSrc += n;
                dst_pos = (dst_pos + n) & TDEFL_LZ_DICT_SIZE_MASK;
                num_bytes_to_process -= n;
            }

            dict_size = MZ_MIN_uint(TDEFL_LZ_DICT_SIZE - lookahead_size, dict_size);
            if ((!d.m_flush) && (lookahead_size < TDEFL_COMP_FAST_LOOKAHEAD_SIZE))
                break;

            while (lookahead_size >= 4)
            {
                mz_uint cur_match_dist, cur_match_len = 1;
                mz_uint8 *pCur_dict = d.m_dict.ptr + cur_pos;
                mz_uint first_trigram = TDEFL_READ_UNALIGNED_WORD32(pCur_dict) & 0xFFFFFF;
                mz_uint hash = (first_trigram ^ (first_trigram >> (24 - (TDEFL_LZ_HASH_BITS - 8)))) & TDEFL_LEVEL1_HASH_SIZE_MASK;
                mz_uint probe_pos = d.m_hash[hash];
                d.m_hash[hash] = cast(mz_uint16)lookahead_pos;

                if (    ((cur_match_dist = cast(mz_uint16)(lookahead_pos - probe_pos)) <= dict_size) 
                     && ((TDEFL_READ_UNALIGNED_WORD32(d.m_dict.ptr + (probe_pos &= TDEFL_LZ_DICT_SIZE_MASK)) & 0xFFFFFF) == first_trigram))
                {
                    const(mz_uint16) *p = cast(const(mz_uint16)*)pCur_dict;
                    const(mz_uint16) *q = cast(const(mz_uint16)*)(d.m_dict.ptr + probe_pos);
                    mz_uint32 probe_len = 32;
                    do
                    {
                    } while ((TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) &&
                             (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (TDEFL_READ_UNALIGNED_WORD2(++p) == TDEFL_READ_UNALIGNED_WORD2(++q)) && (--probe_len > 0));
                    cur_match_len = (cast(mz_uint)(p - cast(const mz_uint16 *)pCur_dict) * 2) + cast(mz_uint)(*cast(const(mz_uint8)*)p == *cast(const(mz_uint8)*)q);
                    if (!probe_len)
                        cur_match_len = cur_match_dist ? TDEFL_MAX_MATCH_LEN : 0;

                    if ((cur_match_len < TDEFL_MIN_MATCH_LEN) || ((cur_match_len == TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 8U * 1024U)))
                    {
                        cur_match_len = 1;
                        *pLZ_code_buf++ = cast(mz_uint8)first_trigram;
                        *pLZ_flags = cast(mz_uint8)(*pLZ_flags >> 1);
                        d.m_huff_count[0][cast(mz_uint8)first_trigram]++;
                    }
                    else
                    {
                        mz_uint32 s0, s1;
                        cur_match_len = MZ_MIN_uint(cur_match_len, lookahead_size);

                        assert((cur_match_len >= TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 1) && (cur_match_dist <= TDEFL_LZ_DICT_SIZE));

                        cur_match_dist--;

                        pLZ_code_buf[0] = cast(mz_uint8)(cur_match_len - TDEFL_MIN_MATCH_LEN);
                        *cast(mz_uint16 *)(&pLZ_code_buf[1]) = cast(mz_uint16)cur_match_dist;
                        pLZ_code_buf += 3;
                        *pLZ_flags = cast(mz_uint8)((*pLZ_flags >> 1) | 0x80);

                        s0 = s_tdefl_small_dist_sym[cur_match_dist & 511];
                        s1 = s_tdefl_large_dist_sym[cur_match_dist >> 8];
                        d.m_huff_count[1][(cur_match_dist < 512) ? s0 : s1]++;

                        d.m_huff_count[0][s_tdefl_len_sym[cur_match_len - TDEFL_MIN_MATCH_LEN]]++;
                    }
                }
                else
                {
                    *pLZ_code_buf++ = cast(mz_uint8)first_trigram;
                    *pLZ_flags = cast(mz_uint8)(*pLZ_flags >> 1);
                    d.m_huff_count[0][cast(mz_uint8)first_trigram]++;
                }

                if (--num_flags_left == 0)
                {
                    num_flags_left = 8;
                    pLZ_flags = pLZ_code_buf++;
                }

                total_lz_bytes += cur_match_len;
                lookahead_pos += cur_match_len;
                dict_size = MZ_MIN_uint(dict_size + cur_match_len, cast(mz_uint)TDEFL_LZ_DICT_SIZE);
                cur_pos = (cur_pos + cur_match_len) & TDEFL_LZ_DICT_SIZE_MASK;
                assert(lookahead_size >= cur_match_len);
                lookahead_size -= cur_match_len;

                if (pLZ_code_buf > &d.m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8])
                {
                    int n;
                    d.m_lookahead_pos = lookahead_pos;
                    d.m_lookahead_size = lookahead_size;
                    d.m_dict_size = dict_size;
                    d.m_total_lz_bytes = total_lz_bytes;
                    d.m_pLZ_code_buf = pLZ_code_buf;
                    d.m_pLZ_flags = pLZ_flags;
                    d.m_num_flags_left = num_flags_left;
                    if ((n = tdefl_flush_block(d, 0)) != 0)
                        return (n < 0) ? MZ_FALSE : MZ_TRUE;
                    total_lz_bytes = d.m_total_lz_bytes;
                    pLZ_code_buf = d.m_pLZ_code_buf;
                    pLZ_flags = d.m_pLZ_flags;
                    num_flags_left = d.m_num_flags_left;
                }
            }

            while (lookahead_size)
            {
                mz_uint8 lit = d.m_dict[cur_pos];

                total_lz_bytes++;
                *pLZ_code_buf++ = lit;
                *pLZ_flags = cast(mz_uint8)(*pLZ_flags >> 1);
                if (--num_flags_left == 0)
                {
                    num_flags_left = 8;
                    pLZ_flags = pLZ_code_buf++;
                }

                d.m_huff_count[0][lit]++;

                lookahead_pos++;
                dict_size = MZ_MIN_uint(dict_size + 1, cast(mz_uint)TDEFL_LZ_DICT_SIZE);
                cur_pos = (cur_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK;
                lookahead_size--;

                if (pLZ_code_buf > &d.m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8])
                {
                    int n;
                    d.m_lookahead_pos = lookahead_pos;
                    d.m_lookahead_size = lookahead_size;
                    d.m_dict_size = dict_size;
                    d.m_total_lz_bytes = total_lz_bytes;
                    d.m_pLZ_code_buf = pLZ_code_buf;
                    d.m_pLZ_flags = pLZ_flags;
                    d.m_num_flags_left = num_flags_left;
                    if ((n = tdefl_flush_block(d, 0)) != 0)
                        return (n < 0) ? MZ_FALSE : MZ_TRUE;
                    total_lz_bytes = d.m_total_lz_bytes;
                    pLZ_code_buf = d.m_pLZ_code_buf;
                    pLZ_flags = d.m_pLZ_flags;
                    num_flags_left = d.m_num_flags_left;
                }
            }
        }

        d.m_lookahead_pos = lookahead_pos;
        d.m_lookahead_size = lookahead_size;
        d.m_dict_size = dict_size;
        d.m_total_lz_bytes = total_lz_bytes;
        d.m_pLZ_code_buf = pLZ_code_buf;
        d.m_pLZ_flags = pLZ_flags;
        d.m_num_flags_left = num_flags_left;
        return MZ_TRUE;
    }
}

void tdefl_record_literal(tdefl_compressor *d, mz_uint8 lit)
{
    d.m_total_lz_bytes++;
    *d.m_pLZ_code_buf++ = lit;
    *d.m_pLZ_flags = cast(mz_uint8)(*d.m_pLZ_flags >> 1);
    if (--d.m_num_flags_left == 0)
    {
        d.m_num_flags_left = 8;
        d.m_pLZ_flags = d.m_pLZ_code_buf++;
    }
    d.m_huff_count[0][lit]++;
}

void tdefl_record_match(tdefl_compressor *d, mz_uint match_len, mz_uint match_dist)
{
    mz_uint32 s0, s1;

    assert((match_len >= TDEFL_MIN_MATCH_LEN) && (match_dist >= 1) && (match_dist <= TDEFL_LZ_DICT_SIZE));

    d.m_total_lz_bytes += match_len;

    d.m_pLZ_code_buf[0] = cast(mz_uint8)(match_len - TDEFL_MIN_MATCH_LEN);

    match_dist -= 1;
    d.m_pLZ_code_buf[1] = cast(mz_uint8)(match_dist & 0xFF);
    d.m_pLZ_code_buf[2] = cast(mz_uint8)(match_dist >> 8);
    d.m_pLZ_code_buf += 3;

    *d.m_pLZ_flags = cast(mz_uint8)((*d.m_pLZ_flags >> 1) | 0x80);
    if (--d.m_num_flags_left == 0)
    {
        d.m_num_flags_left = 8;
        d.m_pLZ_flags = d.m_pLZ_code_buf++;
    }

    s0 = s_tdefl_small_dist_sym[match_dist & 511];
    s1 = s_tdefl_large_dist_sym[(match_dist >> 8) & 127];
    d.m_huff_count[1][(match_dist < 512) ? s0 : s1]++;
    d.m_huff_count[0][s_tdefl_len_sym[match_len - TDEFL_MIN_MATCH_LEN]]++;
}

mz_bool tdefl_compress_normal(tdefl_compressor *d)
{
    const(mz_uint8)* pSrc = d.m_pSrc;
    size_t src_buf_left = d.m_src_buf_left;
    tdefl_flush flush = d.m_flush;

    while ((src_buf_left) || ((flush) && (d.m_lookahead_size)))
    {
        mz_uint len_to_move, cur_match_dist, cur_match_len, cur_pos;
        /* Update dictionary and hash chains. Keeps the lookahead size equal to TDEFL_MAX_MATCH_LEN. */
        if ((d.m_lookahead_size + d.m_dict_size) >= (TDEFL_MIN_MATCH_LEN - 1))
        {
            mz_uint dst_pos = (d.m_lookahead_pos + d.m_lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK, ins_pos = d.m_lookahead_pos + d.m_lookahead_size - 2;
            mz_uint hash = (d.m_dict[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] << TDEFL_LZ_HASH_SHIFT) ^ d.m_dict[(ins_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK];
            mz_uint num_bytes_to_process = cast(mz_uint)MZ_MIN_size_t(src_buf_left, TDEFL_MAX_MATCH_LEN - d.m_lookahead_size);
            const mz_uint8 *pSrc_end = pSrc ? pSrc + num_bytes_to_process : null;
            src_buf_left -= num_bytes_to_process;
            d.m_lookahead_size += num_bytes_to_process;
            while (pSrc != pSrc_end)
            {
                mz_uint8 c = *pSrc++;
                d.m_dict[dst_pos] = c;
                if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1))
                    d.m_dict[TDEFL_LZ_DICT_SIZE + dst_pos] = c;
                hash = ((hash << TDEFL_LZ_HASH_SHIFT) ^ c) & (TDEFL_LZ_HASH_SIZE - 1);
                d.m_next[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] = d.m_hash[hash];
                d.m_hash[hash] = cast(mz_uint16)(ins_pos);
                dst_pos = (dst_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK;
                ins_pos++;
            }
        }
        else
        {
            while ((src_buf_left) && (d.m_lookahead_size < TDEFL_MAX_MATCH_LEN))
            {
                mz_uint8 c = *pSrc++;
                mz_uint dst_pos = (d.m_lookahead_pos + d.m_lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK;
                src_buf_left--;
                d.m_dict[dst_pos] = c;
                if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1))
                    d.m_dict[TDEFL_LZ_DICT_SIZE + dst_pos] = c;
                if ((++d.m_lookahead_size + d.m_dict_size) >= TDEFL_MIN_MATCH_LEN)
                {
                    mz_uint ins_pos = d.m_lookahead_pos + (d.m_lookahead_size - 1) - 2;
                    mz_uint hash = ((d.m_dict[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] << (TDEFL_LZ_HASH_SHIFT * 2)) ^ (d.m_dict[(ins_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK] << TDEFL_LZ_HASH_SHIFT) ^ c) & (TDEFL_LZ_HASH_SIZE - 1);
                    d.m_next[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] = d.m_hash[hash];
                    d.m_hash[hash] = cast(mz_uint16)(ins_pos);
                }
            }
        }
        d.m_dict_size = MZ_MIN_uint(TDEFL_LZ_DICT_SIZE - d.m_lookahead_size, d.m_dict_size);
        if ((!flush) && (d.m_lookahead_size < TDEFL_MAX_MATCH_LEN))
            break;

        /* Simple lazy/greedy parsing state machine. */
        len_to_move = 1;
        cur_match_dist = 0;
        cur_match_len = d.m_saved_match_len ? d.m_saved_match_len : (TDEFL_MIN_MATCH_LEN - 1);
        cur_pos = d.m_lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK;
        if (d.m_flags & (TDEFL_RLE_MATCHES | TDEFL_FORCE_ALL_RAW_BLOCKS))
        {
            if ((d.m_dict_size) && (!(d.m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS)))
            {
                mz_uint8 c = d.m_dict[(cur_pos - 1) & TDEFL_LZ_DICT_SIZE_MASK];
                cur_match_len = 0;
                while (cur_match_len < d.m_lookahead_size)
                {
                    if (d.m_dict[cur_pos + cur_match_len] != c)
                        break;
                    cur_match_len++;
                }
                if (cur_match_len < TDEFL_MIN_MATCH_LEN)
                    cur_match_len = 0;
                else
                    cur_match_dist = 1;
            }
        }
        else
        {
            tdefl_find_match(d, d.m_lookahead_pos, d.m_dict_size, d.m_lookahead_size, &cur_match_dist, &cur_match_len);
        }
        if (((cur_match_len == TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 8U * 1024U)) || (cur_pos == cur_match_dist) || ((d.m_flags & TDEFL_FILTER_MATCHES) && (cur_match_len <= 5)))
        {
            cur_match_dist = cur_match_len = 0;
        }
        if (d.m_saved_match_len)
        {
            if (cur_match_len > d.m_saved_match_len)
            {
                tdefl_record_literal(d, cast(mz_uint8)d.m_saved_lit);
                if (cur_match_len >= 128)
                {
                    tdefl_record_match(d, cur_match_len, cur_match_dist);
                    d.m_saved_match_len = 0;
                    len_to_move = cur_match_len;
                }
                else
                {
                    d.m_saved_lit = d.m_dict[cur_pos];
                    d.m_saved_match_dist = cur_match_dist;
                    d.m_saved_match_len = cur_match_len;
                }
            }
            else
            {
                tdefl_record_match(d, d.m_saved_match_len, d.m_saved_match_dist);
                len_to_move = d.m_saved_match_len - 1;
                d.m_saved_match_len = 0;
            }
        }
        else if (!cur_match_dist)
            tdefl_record_literal(d, d.m_dict[MZ_MIN_size_t(cur_pos, (d.m_dict).sizeof - 1)]);
        else if ((d.m_greedy_parsing) || (d.m_flags & TDEFL_RLE_MATCHES) || (cur_match_len >= 128))
        {
            tdefl_record_match(d, cur_match_len, cur_match_dist);
            len_to_move = cur_match_len;
        }
        else
        {
            d.m_saved_lit = d.m_dict[MZ_MIN_size_t(cur_pos, (d.m_dict).sizeof - 1)];
            d.m_saved_match_dist = cur_match_dist;
            d.m_saved_match_len = cur_match_len;
        }
        /* Move the lookahead forward by len_to_move bytes. */
        d.m_lookahead_pos += len_to_move;
        assert(d.m_lookahead_size >= len_to_move);
        d.m_lookahead_size -= len_to_move;
        d.m_dict_size = MZ_MIN_uint(d.m_dict_size + len_to_move, cast(mz_uint)TDEFL_LZ_DICT_SIZE);
        /* Check if it's time to flush the current LZ codes to the internal output buffer. */
        if ((d.m_pLZ_code_buf > &d.m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8]) ||
            ((d.m_total_lz_bytes > 31 * 1024) && ((((cast(mz_uint)(d.m_pLZ_code_buf - d.m_lz_code_buf.ptr) * 115) >> 7) >= d.m_total_lz_bytes) || (d.m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS))))
        {
            int n;
            d.m_pSrc = pSrc;
            d.m_src_buf_left = src_buf_left;
            if ((n = tdefl_flush_block(d, 0)) != 0)
                return (n < 0) ? MZ_FALSE : MZ_TRUE;
        }
    }

    d.m_pSrc = pSrc;
    d.m_src_buf_left = src_buf_left;
    return MZ_TRUE;
}

tdefl_status tdefl_flush_output_buffer(tdefl_compressor *d)
{
    if (d.m_pIn_buf_size)
    {
        *d.m_pIn_buf_size = d.m_pSrc - cast(const mz_uint8 *)d.m_pIn_buf;
    }

    if (d.m_pOut_buf_size)
    {
        size_t n = MZ_MIN_size_t(*d.m_pOut_buf_size - d.m_out_buf_ofs, d.m_output_flush_remaining);
        memcpy(cast(mz_uint8 *)d.m_pOut_buf + d.m_out_buf_ofs, d.m_output_buf.ptr + d.m_output_flush_ofs, n);
        d.m_output_flush_ofs += cast(mz_uint)n;
        d.m_output_flush_remaining -= cast(mz_uint)n;
        d.m_out_buf_ofs += n;

        *d.m_pOut_buf_size = d.m_out_buf_ofs;
    }

    return (d.m_finished && !d.m_output_flush_remaining) ? TDEFL_STATUS_DONE : TDEFL_STATUS_OKAY;
}

/* Compresses a block of data, consuming as much of the specified input buffer as possible, and writing as much compressed data to the specified output buffer as possible. */
tdefl_status tdefl_compress(tdefl_compressor *d, const void *pIn_buf, size_t *pIn_buf_size, void *pOut_buf, size_t *pOut_buf_size, tdefl_flush flush)
{
    if (!d)
    {
        if (pIn_buf_size)
            *pIn_buf_size = 0;
        if (pOut_buf_size)
            *pOut_buf_size = 0;
        return TDEFL_STATUS_BAD_PARAM;
    }

    d.m_pIn_buf = pIn_buf;
    d.m_pIn_buf_size = pIn_buf_size;
    d.m_pOut_buf = pOut_buf;
    d.m_pOut_buf_size = pOut_buf_size;
    d.m_pSrc = cast(const mz_uint8 *)(pIn_buf);
    d.m_src_buf_left = pIn_buf_size ? *pIn_buf_size : 0;
    d.m_out_buf_ofs = 0;
    d.m_flush = flush;

    if (((d.m_pPut_buf_func != null) == ((pOut_buf != null) || (pOut_buf_size != null))) || (d.m_prev_return_status != TDEFL_STATUS_OKAY) ||
        (d.m_wants_to_finish && (flush != TDEFL_FINISH)) || (pIn_buf_size && *pIn_buf_size && !pIn_buf) || (pOut_buf_size && *pOut_buf_size && !pOut_buf))
    {
        if (pIn_buf_size)
            *pIn_buf_size = 0;
        if (pOut_buf_size)
            *pOut_buf_size = 0;
        return (d.m_prev_return_status = TDEFL_STATUS_BAD_PARAM);
    }
    d.m_wants_to_finish |= (flush == TDEFL_FINISH);

    if ((d.m_output_flush_remaining) || (d.m_finished))
        return (d.m_prev_return_status = tdefl_flush_output_buffer(d));

    version(LittleEndian)
    {
        if (((d.m_flags & TDEFL_MAX_PROBES_MASK) == 1) &&
            ((d.m_flags & TDEFL_GREEDY_PARSING_FLAG) != 0) &&
            ((d.m_flags & (TDEFL_FILTER_MATCHES | TDEFL_FORCE_ALL_RAW_BLOCKS | TDEFL_RLE_MATCHES)) == 0))
        {
            if (!tdefl_compress_fast(d))
                return d.m_prev_return_status;
        }
        else
        {
            if (!tdefl_compress_normal(d))
                return d.m_prev_return_status;
        }
    }
    else
    {
        if (!tdefl_compress_normal(d))
            return d.m_prev_return_status;
    }

    if ((d.m_flags & (TDEFL_WRITE_ZLIB_HEADER | TDEFL_COMPUTE_ADLER32)) && (pIn_buf))
        d.m_adler32 = cast(mz_uint32)mz_adler32(d.m_adler32, cast(const mz_uint8 *)pIn_buf, d.m_pSrc - cast(const mz_uint8 *)pIn_buf);

    if ((flush) && (!d.m_lookahead_size) && (!d.m_src_buf_left) && (!d.m_output_flush_remaining))
    {
        if (tdefl_flush_block(d, flush) < 0)
            return d.m_prev_return_status;
        d.m_finished = (flush == TDEFL_FINISH);
        if (flush == TDEFL_FULL_FLUSH)
        {
            d.m_hash[] = 0;
            d.m_next[] = 0;
            d.m_dict_size = 0;
        }
    }

    return (d.m_prev_return_status = tdefl_flush_output_buffer(d));
}

/* tdefl_compress_buffer() is only usable when the tdefl_init() is called with a non-null tdefl_put_buf_func_ptr. */
/* tdefl_compress_buffer() always consumes the entire input buffer. */
tdefl_status tdefl_compress_buffer(tdefl_compressor *d, const void *pIn_buf, size_t in_buf_size, tdefl_flush flush)
{
    assert(d.m_pPut_buf_func);
    return tdefl_compress(d, pIn_buf, &in_buf_size, null, null, flush);
}

/* Initializes the compressor. */
/* There is no corresponding deinit() function because the tdefl API's do not dynamically allocate memory. */
/* pBut_buf_func: If null, output data will be supplied to the specified callback. In this case, the user should call the tdefl_compress_buffer() API for compression. */
/* If pBut_buf_func is null the user should always call the tdefl_compress() API. */
/* flags: See the above enums (TDEFL_HUFFMAN_ONLY, TDEFL_WRITE_ZLIB_HEADER, etc.) */
tdefl_status tdefl_init(tdefl_compressor *d, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags)
{
    d.m_pPut_buf_func = pPut_buf_func;
    d.m_pPut_buf_user = pPut_buf_user;
    d.m_flags = cast(mz_uint)(flags);
    d.m_max_probes[0] = 1 + ((flags & 0xFFF) + 2) / 3;
    d.m_greedy_parsing = (flags & TDEFL_GREEDY_PARSING_FLAG) != 0;
    d.m_max_probes[1] = 1 + (((flags & 0xFFF) >> 2) + 2) / 3;
    if (!(flags & TDEFL_NONDETERMINISTIC_PARSING_FLAG))
    {
        d.m_hash[] = 0;
    }
    d.m_lookahead_pos = d.m_lookahead_size = d.m_dict_size = d.m_total_lz_bytes = d.m_lz_code_buf_dict_pos = d.m_bits_in = 0;
    d.m_output_flush_ofs = d.m_output_flush_remaining = d.m_finished = d.m_block_index = d.m_bit_buffer = d.m_wants_to_finish = 0;
    d.m_pLZ_code_buf = d.m_lz_code_buf.ptr + 1;
    d.m_pLZ_flags = d.m_lz_code_buf.ptr;
    *d.m_pLZ_flags = 0;
    d.m_num_flags_left = 8;
    d.m_pOutput_buf = d.m_output_buf.ptr;
    d.m_pOutput_buf_end = d.m_output_buf.ptr;
    d.m_prev_return_status = TDEFL_STATUS_OKAY;
    d.m_saved_match_dist = d.m_saved_match_len = d.m_saved_lit = 0;
    d.m_adler32 = 1;
    d.m_pIn_buf = null;
    d.m_pOut_buf = null;
    d.m_pIn_buf_size = null;
    d.m_pOut_buf_size = null;
    d.m_flush = TDEFL_NO_FLUSH;
    d.m_pSrc = null;
    d.m_src_buf_left = 0;
    d.m_out_buf_ofs = 0;
    if (!(flags & TDEFL_NONDETERMINISTIC_PARSING_FLAG))
    {
        d.m_dict[] = 0;
    }
    memset(&d.m_huff_count[0][0], 0, (d.m_huff_count[0][0]).sizeof * TDEFL_MAX_HUFF_SYMBOLS_0);
    memset(&d.m_huff_count[1][0], 0, (d.m_huff_count[1][0]).sizeof * TDEFL_MAX_HUFF_SYMBOLS_1);
    return TDEFL_STATUS_OKAY;
}

tdefl_status tdefl_get_prev_return_status(tdefl_compressor *d)
{
    return d.m_prev_return_status;
}

mz_uint32 tdefl_get_adler32(tdefl_compressor *d)
{
    return d.m_adler32;
}

/* tdefl_compress_mem_to_output() compresses a block to an output stream. The above helpers use this function internally. */
mz_bool tdefl_compress_mem_to_output(const void *pBuf, size_t buf_len, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags)
{
    tdefl_compressor *pComp;
    mz_bool succeeded;
    if (((buf_len) && (!pBuf)) || (!pPut_buf_func))
        return MZ_FALSE;
    pComp = cast(tdefl_compressor *) MZ_MALLOC(tdefl_compressor.sizeof);
    if (!pComp)
        return MZ_FALSE;
    succeeded = (tdefl_init(pComp, pPut_buf_func, pPut_buf_user, flags) == TDEFL_STATUS_OKAY);
    succeeded = succeeded && (tdefl_compress_buffer(pComp, pBuf, buf_len, TDEFL_FINISH) == TDEFL_STATUS_DONE);
    MZ_FREE(pComp);
    return succeeded;
}

struct tdefl_output_buffer
{
    size_t m_size        = 0, 
           m_capacity    = 0;
    mz_uint8 *m_pBuf     = null;
    mz_bool m_expandable = 0;
}

mz_bool tdefl_output_buffer_putter(const void *pBuf, int len, void *pUser)
{
    tdefl_output_buffer *p = cast(tdefl_output_buffer *)pUser;
    size_t new_size = p.m_size + len;
    if (new_size > p.m_capacity)
    {
        size_t new_capacity = p.m_capacity;
        mz_uint8 *pNew_buf;
        if (!p.m_expandable)
            return MZ_FALSE;
        do
        {
            new_capacity = MZ_MAX_size_t(128U, new_capacity << 1U);
        } while (new_size > new_capacity);
        pNew_buf = cast(mz_uint8 *)MZ_REALLOC(p.m_pBuf, new_capacity);
        if (!pNew_buf)
            return MZ_FALSE;
        p.m_pBuf = pNew_buf;
        p.m_capacity = new_capacity;
    }
    memcpy(cast(mz_uint8 *)p.m_pBuf + p.m_size, pBuf, len);
    p.m_size = new_size;
    return MZ_TRUE;
}

/* High level compression functions: */
/* tdefl_compress_mem_to_heap() compresses a block in memory to a heap block allocated via malloc(). */
/* On entry: */
/*  pSrc_buf, src_buf_len: Pointer and size of source block to compress. */
/*  flags: The max match finder probes (default is 128) logically OR'd against the above flags. Higher probes are slower but improve compression. */
/* On return: */
/*  Function returns a pointer to the compressed data, or null on failure. */
/*  *pOut_len will be set to the compressed data's size, which could be larger than src_buf_len on uncompressible data. */
/*  The caller must free() the returned block when it's no longer needed. */
void *tdefl_compress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags)
{
    tdefl_output_buffer out_buf;
    if (!pOut_len)
        return null;
    else
        *pOut_len = 0;
    out_buf.m_expandable = MZ_TRUE;
    if (!tdefl_compress_mem_to_output(pSrc_buf, src_buf_len, &tdefl_output_buffer_putter, &out_buf, flags))
        return null;
    *pOut_len = out_buf.m_size;
    return out_buf.m_pBuf;
}

/* tdefl_compress_mem_to_mem() compresses a block in memory to another block in memory. */
/* Returns 0 on failure. */
size_t tdefl_compress_mem_to_mem(void *pOut_buf, size_t out_buf_len, const void *pSrc_buf, size_t src_buf_len, int flags)
{
    tdefl_output_buffer out_buf;
    if (!pOut_buf)
        return 0;
    out_buf.m_pBuf = cast(mz_uint8 *)pOut_buf;
    out_buf.m_capacity = out_buf_len;
    if (!tdefl_compress_mem_to_output(pSrc_buf, src_buf_len, &tdefl_output_buffer_putter, &out_buf, flags))
        return 0;
    return out_buf.m_size;
}

static immutable mz_uint[11] s_tdefl_num_probes = [ 0, 1, 6, 32, 16, 32, 128, 256, 512, 768, 1500 ];

/* Create tdefl_compress() flags given zlib-style compression parameters. */
/* level may range from [0,10] (where 10 is absolute max compression, but may be much slower on some files) */
/* window_bits may be -15 (raw deflate) or 15 (zlib) */
/* strategy may be either MZ_DEFAULT_STRATEGY, MZ_FILTERED, MZ_HUFFMAN_ONLY, MZ_RLE, or MZ_FIXED */
/* level may actually range from [0,10] (10 is a "hidden" max level, where we want a bit more compression and it's fine if throughput to fall off a cliff on some files). */
mz_uint tdefl_create_comp_flags_from_zip_params(int level, int window_bits, int strategy)
{
    mz_uint comp_flags = s_tdefl_num_probes[(level >= 0) ? MZ_MIN_int(10, level) : MZ_DEFAULT_LEVEL] | ((level <= 3) ? TDEFL_GREEDY_PARSING_FLAG : 0);
    if (window_bits > 0)
        comp_flags |= TDEFL_WRITE_ZLIB_HEADER;

    if (!level)
        comp_flags |= TDEFL_FORCE_ALL_RAW_BLOCKS;
    else if (strategy == MZ_FILTERED)
        comp_flags |= TDEFL_FILTER_MATCHES;
    else if (strategy == MZ_HUFFMAN_ONLY)
        comp_flags &= ~TDEFL_MAX_PROBES_MASK;
    else if (strategy == MZ_FIXED)
        comp_flags |= TDEFL_FORCE_ALL_STATIC_BLOCKS;
    else if (strategy == MZ_RLE)
        comp_flags |= TDEFL_RLE_MATCHES;

    return comp_flags;
}


tdefl_compressor *tdefl_compressor_alloc()
{
    return cast(tdefl_compressor *) MZ_MALLOC(tdefl_compressor.sizeof);
}

void tdefl_compressor_free(tdefl_compressor *pComp)
{
    MZ_FREE(pComp);
}