├── miniz.h ├── .travis.yml ├── .gitignore ├── makefile ├── COPYRIGHT.md ├── mini_gzip.h ├── README.md ├── mini_gzip.c ├── mini_gzip_testprog.c └── miniz.c /miniz.h: -------------------------------------------------------------------------------- 1 | #define MINIZ_HEADER_FILE_ONLY 2 | #include "miniz.c" 3 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: c 2 | compiler: 3 | - clang 4 | - gcc 5 | script: 6 | - make test 7 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Object files 2 | *.o 3 | 4 | # Libraries 5 | *.lib 6 | *.a 7 | 8 | # Shared objects (inc. Windows DLLs) 9 | *.dll 10 | *.so 11 | *.so.* 12 | *.dylib 13 | 14 | # Executables 15 | *.exe 16 | *.out 17 | *.app 18 | -------------------------------------------------------------------------------- /makefile: -------------------------------------------------------------------------------- 1 | SRCS+= mini_gzip.c miniz.c 2 | CFLAGS= -D_POSIX_C_SOURCE=200112L -D_BSD_SOURCE 3 | CFLAGS+= -g -std=c99 -pedantic 4 | CFLAGS+= -DTEST_PROG 5 | CFLAGS+= -DMINI_GZ_DEBUG 6 | 7 | all: mini_gzip 8 | 9 | mini_gzip: mini_gzip.c mini_gzip_testprog.c miniz.c makefile 10 | gcc $(CFLAGS) -Wall -c mini_gzip.c 11 | gcc $(CFLAGS) -Wall -c mini_gzip_testprog.c 12 | gcc $(CFLAGS) -Wall -c miniz.c 13 | gcc $(CFLAGS) -Wall mini_gzip.o mini_gzip_testprog.o miniz.o -o mini_gzip 14 | 15 | clean: 16 | rm -rf mini_gzip mini_gzip.d* *.o 17 | rm -rf data* 18 | 19 | test: mini_gzip 20 | 21 | cp mini_gzip data 22 | #cp /etc/services data 23 | chmod 644 data 24 | 25 | @echo "# ------------------ Compress with gzip(1), uncompress with mini_gzip" 26 | @ls -la data 27 | gzip -c data > data.gz 28 | ./mini_gzip -d data.gz data.o 29 | @ls -la data.o 30 | diff data.o data 31 | 32 | notyet: 33 | @echo "# ------------------ Compress with mini_gzip and gzip and compare" 34 | gzip -9c data > data_sys_gzip.gz 35 | @ls -la data_sys_gzip.gz 36 | 37 | ./mini_gzip -9c data data_mini_gzip.gz 38 | @ls -la data_mini_gzip.gz 39 | 40 | gunzip -9c data_mini_gzip.gz > data_mini_gzip_unpacked 41 | diff data_mini_gzip_unpacked data 42 | -------------------------------------------------------------------------------- /COPYRIGHT.md: -------------------------------------------------------------------------------- 1 | Copyright (c) 2015, Wojciech Adam Koszek 2 | All rights reserved. 3 | 4 | Redistribution and use in source and binary forms, with or without 5 | modification, are permitted provided that the following conditions 6 | are met: 7 | 1. Redistributions of source code must retain the above copyright 8 | notice, this list of conditions and the following disclaimer. 9 | 2. Redistributions in binary form must reproduce the above copyright 10 | notice, this list of conditions and the following disclaimer in the 11 | documentation and/or other materials provided with the distribution. 12 | 13 | THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 14 | ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 15 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 16 | ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 17 | FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 18 | DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 19 | OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 20 | HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 21 | LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 22 | OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 23 | SUCH DAMAGE. 24 | 25 | 26 | -------------------------------------------------------------------------------- /mini_gzip.h: -------------------------------------------------------------------------------- 1 | #ifndef _MINI_GZIP_H_ 2 | #define _MINI_GZIP_H_ 3 | 4 | #include 5 | #include 6 | 7 | #define MAX_PATH_LEN 1024 8 | #define MINI_GZ_MIN(a, b) ((a) < (b) ? (a) : (b)) 9 | 10 | struct mini_gzip { 11 | size_t total_len; 12 | size_t data_len; 13 | size_t chunk_size; 14 | 15 | uint32_t magic; 16 | #define MINI_GZIP_MAGIC 0xbeebb00b 17 | 18 | uint16_t fcrc; 19 | uint16_t fextra_len; 20 | 21 | uint8_t *hdr_ptr; 22 | uint8_t *fextra_ptr; 23 | uint8_t *fname_ptr; 24 | uint8_t *fcomment_ptr; 25 | 26 | uint8_t *data_ptr; 27 | uint8_t pad[3]; 28 | }; 29 | 30 | /* mini_gzip.c */ 31 | extern int mini_gz_start(struct mini_gzip *gz_ptr, void *mem, size_t mem_len); 32 | extern void mini_gz_chunksize_set(struct mini_gzip *gz_ptr, int chunk_size); 33 | extern void mini_gz_init(struct mini_gzip *gz_ptr); 34 | extern int mini_gz_unpack(struct mini_gzip *gz_ptr, void *mem_out, size_t mem_out_len); 35 | 36 | #define func_fprintf fprintf 37 | #define func_fflush fflush 38 | 39 | #define MINI_GZ_STREAM stderr 40 | 41 | #ifdef MINI_GZ_DEBUG 42 | #define GZAS(comp, ...) do { \ 43 | if (!((comp))) { \ 44 | func_fprintf(MINI_GZ_STREAM, "Error: "); \ 45 | func_fprintf(MINI_GZ_STREAM, __VA_ARGS__); \ 46 | func_fprintf(MINI_GZ_STREAM, ", %s:%d\n", __func__, __LINE__); \ 47 | func_fflush(MINI_GZ_STREAM); \ 48 | exit(1); \ 49 | } \ 50 | } while (0) 51 | 52 | #define GZDBG(...) do { \ 53 | func_fprintf(MINI_GZ_STREAM, "%s:%d ", __func__, __LINE__); \ 54 | func_fprintf(MINI_GZ_STREAM, __VA_ARGS__); \ 55 | func_fprintf(MINI_GZ_STREAM, "\n"); \ 56 | } while (0) 57 | #else /* MINI_GZ_DEBUG */ 58 | #define GZAS(comp, ...) 59 | #define GZDBG(...) 60 | #endif 61 | 62 | #endif 63 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | mini_gzip - embeddable, minimal, in-memory GZIP API 2 | =================================================== 3 | 4 | [![Build Status](https://travis-ci.org/wkoszek/mini_gzip.svg?branch=master)](https://travis-ci.org/wkoszek/mini_gzip) 5 | 6 | Embeddable, minimal GZIP functionality, with API designed to work from 7 | memory. Only supports decompression for now. 8 | 9 | I wrote it when I needed a small piece of code to give me decompression in 10 | an embedded system I was working with, and I found out that most of the 11 | GZIP-related programs use POSIX `FILE` API, which made the examples not work 12 | for my case. 13 | 14 | The `mini_gzip` is based on `miniz` library 15 | (https://code.google.com/p/miniz/), which provides an API for operating on 16 | data compressed according to deflate algorithm. Added is a layer which 17 | provides a container for the GZIP files and let me do some verification. 18 | 19 | # To build 20 | 21 | Everything should be fairly self-contained, and built with: 22 | 23 | make 24 | 25 | # How to use 26 | 27 | The API operates on `struct mini_gzip` structures, which are containers for 28 | the memory with GZIPed data. You must call `mini_gz_init()` on the structure 29 | 1st for the rest of the API to work correctly. Next, you must call 30 | `mini_gz_start(&gz, mem_in, size)`, where `gz` is the initialized container 31 | and with GZIPed data pointed by `mem_in` of the size of `size`. To unpack, 32 | you call `mini_gz_unpack(&gz, mem_out, memsize)`, where the first argument 33 | is the initialized container, the second `mem_out` is a pointer to the 34 | output memory, and `memsize` is its lenght. It's important to have enough 35 | bytes in the output buffer for decompressed data. 36 | 37 | # To test 38 | 39 | Simple test is provided: 40 | 41 | make test 42 | 43 | To test by yourself, you can do: 44 | 45 | ~~~shell 46 | wk:/w/repos/mini_gzip> ls -la miniz.o 47 | -rw-r--r-- 1 wk staff 114348 20 paź 09:46 miniz.o 48 | wk:/w/repos/mini_gzip> md5 miniz.o 49 | MD5 (miniz.o) = e6199aade2020b6040fa160baee47d68 50 | wk:/w/repos/mini_gzip> gzip miniz.o 51 | wk:/w/repos/mini_gzip> ls -la miniz.o.gz 52 | -rw-r--r-- 1 wk staff 44965 20 paź 09:46 miniz.o.gz 53 | wk:/w/repos/mini_gzip> ./mini_gzip miniz.o.gz miniz.o 54 | flag_c: 0 is_gzipped: 1 55 | in_fn: miniz.o.gz out_fn: miniz.o level 6 56 | --- testing decompression -- 57 | out_len = 114348 58 | ret = 114348 59 | wk:/w/repos/mini_gzip> md5 miniz.o 60 | MD5 (miniz.o) = e6199aade2020b6040fa160baee47d68 61 | ~~~ 62 | 63 | # References 64 | 65 | After publishing `mini_gzip` on HackerNews, byuu (http://byuu.org/) mentioned he has much leaner implementation of GZIP: 66 | 67 | - https://gitlab.com/higan/higan/blob/master/nall/decode/gzip.hpp 68 | - https://gitlab.com/higan/higan/blob/master/nall/decode/inflate.hpp 69 | 70 | # Author 71 | 72 | - Wojciech Adam Koszek, [wojciech@koszek.com](mailto:wojciech@koszek.com) 73 | - [http://www.koszek.com](http://www.koszek.com) 74 | -------------------------------------------------------------------------------- /mini_gzip.c: -------------------------------------------------------------------------------- 1 | /* 2 | * BSD 2-clause license 3 | * Copyright (c) 2013 Wojciech A. Koszek 4 | * 5 | * Based on: 6 | * 7 | * https://github.com/strake/gzip.git 8 | * 9 | * I had to rewrite it, since strake's version was powered by UNIX FILE* API, 10 | * while the key objective was to perform memory-to-memory operations 11 | */ 12 | 13 | #include 14 | #include 15 | #include 16 | 17 | #ifdef MINI_GZ_DEBUG 18 | #include 19 | #endif 20 | 21 | #include "miniz.h" 22 | #include "mini_gzip.h" 23 | 24 | int 25 | mini_gz_start(struct mini_gzip *gz_ptr, void *mem, size_t mem_len) 26 | { 27 | uint8_t *hptr, *hauxptr, *mem8_ptr; 28 | uint16_t fextra_len; 29 | 30 | assert(gz_ptr != NULL); 31 | 32 | mem8_ptr = (uint8_t *)mem; 33 | hptr = mem8_ptr + 0; // .gz header 34 | hauxptr = mem8_ptr + 10; // auxillary header 35 | 36 | gz_ptr->hdr_ptr = hptr; 37 | gz_ptr->data_ptr = 0; 38 | gz_ptr->data_len = 0; 39 | gz_ptr->total_len = mem_len; 40 | gz_ptr->chunk_size = 1024; 41 | 42 | if (hptr[0] != 0x1F || hptr[1] != 0x8B) { 43 | GZDBG("hptr[0] = %02x hptr[1] = %02x\n", hptr[0], hptr[1]); 44 | return (-1); 45 | } 46 | if (hptr[2] != 8) { 47 | return (-2); 48 | } 49 | if (hptr[3] & 0x4) { 50 | fextra_len = hauxptr[1] << 8 | hauxptr[0]; 51 | gz_ptr->fextra_len = fextra_len; 52 | hauxptr += 2; 53 | gz_ptr->fextra_ptr = hauxptr; 54 | } 55 | if (hptr[3] & 0x8) { 56 | gz_ptr->fname_ptr = hauxptr; 57 | while (*hauxptr != '\0') { 58 | hauxptr++; 59 | } 60 | hauxptr++; 61 | } 62 | if (hptr[3] & 0x10) { 63 | gz_ptr->fcomment_ptr = hauxptr; 64 | while (*hauxptr != '\0') { 65 | hauxptr++; 66 | } 67 | hauxptr++; 68 | } 69 | if (hptr[3] & 0x2) /* FCRC */ { 70 | gz_ptr->fcrc = (*(uint16_t *)hauxptr); 71 | hauxptr += 2; 72 | } 73 | gz_ptr->data_ptr = hauxptr; 74 | gz_ptr->data_len = mem_len - (hauxptr - hptr); 75 | gz_ptr->magic = MINI_GZIP_MAGIC; 76 | return (0); 77 | } 78 | 79 | void 80 | mini_gz_chunksize_set(struct mini_gzip *gz_ptr, int chunk_size) 81 | { 82 | 83 | assert(gz_ptr != 0); 84 | assert(gz_ptr->magic == MINI_GZIP_MAGIC); 85 | gz_ptr->chunk_size = chunk_size; 86 | } 87 | 88 | void 89 | mini_gz_init(struct mini_gzip *gz_ptr) 90 | { 91 | 92 | memset(gz_ptr, 0xffffffff, sizeof(*gz_ptr)); 93 | gz_ptr->magic = MINI_GZIP_MAGIC; 94 | mini_gz_chunksize_set(gz_ptr, 1024); 95 | } 96 | 97 | 98 | int 99 | mini_gz_unpack(struct mini_gzip *gz_ptr, void *mem_out, size_t mem_out_len) 100 | { 101 | z_stream s; 102 | int ret, in_bytes_avail, bytes_to_read; 103 | 104 | assert(gz_ptr != 0); 105 | assert(gz_ptr->data_len > 0); 106 | assert(gz_ptr->magic == MINI_GZIP_MAGIC); 107 | 108 | memset (&s, 0, sizeof (z_stream)); 109 | inflateInit2(&s, -MZ_DEFAULT_WINDOW_BITS); 110 | in_bytes_avail = gz_ptr->data_len; 111 | s.avail_out = mem_out_len; 112 | s.next_in = gz_ptr->data_ptr; 113 | s.next_out = mem_out; 114 | for (;;) { 115 | bytes_to_read = MINI_GZ_MIN(gz_ptr->chunk_size, in_bytes_avail); 116 | s.avail_in += bytes_to_read; 117 | ret = mz_inflate(&s, MZ_SYNC_FLUSH); 118 | in_bytes_avail -= bytes_to_read; 119 | if (s.avail_out == 0 && in_bytes_avail != 0) { 120 | return (-3); 121 | } 122 | assert(ret != MZ_BUF_ERROR); 123 | if (ret == MZ_PARAM_ERROR) { 124 | return (-1); 125 | } 126 | if (ret == MZ_DATA_ERROR) { 127 | return (-2); 128 | } 129 | if (ret == MZ_STREAM_END) { 130 | break; 131 | } 132 | } 133 | ret = inflateEnd(&s); 134 | if (ret != Z_OK) { 135 | return (-4); 136 | } 137 | return (s.total_out); 138 | } 139 | -------------------------------------------------------------------------------- /mini_gzip_testprog.c: -------------------------------------------------------------------------------- 1 | /* 2 | * BSD 2-clause license 3 | * Copyright (c) 2013 Wojciech A. Koszek 4 | * 5 | * Based on: 6 | * 7 | * https://github.com/strake/gzip.git 8 | * 9 | * I had to rewrite it, since strake's version was powered by UNIX FILE* API, 10 | * while the key objective was to perform memory-to-memory operations 11 | */ 12 | 13 | #include 14 | #include 15 | #include 16 | 17 | #include 18 | #include 19 | #include 20 | #include 21 | 22 | #include "miniz.h" 23 | #include "mini_gzip.h" 24 | 25 | int 26 | main(int argc, char **argv) 27 | { 28 | struct mini_gzip gz; 29 | struct stat st; 30 | char in_fn[MAX_PATH_LEN], out_fn[MAX_PATH_LEN]; 31 | char *sptr, *mem_in, *mem_out; 32 | int level, flag_c, o, in_fd, out_fd, ret, is_gzipped, out_len; 33 | 34 | level = 6; 35 | flag_c = 0; 36 | while ((o = getopt(argc, argv, "cd123456789")) != -1) { 37 | switch (o) { 38 | case 'd': 39 | level = 0; 40 | break; 41 | case 'c': 42 | flag_c = 1; 43 | break; 44 | case '0': case '1': case '2': case '3': case '4': 45 | case '5': case '6': case '7': case '8': case '9': 46 | assert(o != '0'); 47 | level = o - '0'; 48 | break; 49 | default: 50 | abort(); 51 | break; 52 | } 53 | } 54 | 55 | argc -= optind; 56 | argv += optind; 57 | 58 | GZAS(argc == 2, "2 file names must be passed: input and output file"); 59 | 60 | is_gzipped = 0; 61 | sptr = strstr(argv[0], ".gz"); 62 | if (sptr != NULL) { 63 | is_gzipped = 1; 64 | } 65 | printf("flag_c: %d is_gzipped: %d\n", flag_c, is_gzipped); 66 | 67 | if (is_gzipped) { 68 | GZAS(flag_c == 0, "Requesting to compress .gz file? Looks wrong"); 69 | } else { 70 | GZAS(flag_c == 1, "Requesting to decompress normal file?"); 71 | } 72 | 73 | snprintf(in_fn, sizeof(in_fn) - 1, "%s", argv[0]); 74 | snprintf(out_fn, sizeof(out_fn) - 1, "%s", argv[1]); 75 | 76 | printf("in_fn: %s out_fn: %s level %d\n", in_fn, out_fn, level); 77 | 78 | mem_in = calloc(1024*1024, 1); 79 | mem_out = calloc(1024*1024, 1); 80 | GZAS(mem_in != NULL, "Couldn't allocate memory for input file"); 81 | GZAS(mem_out != NULL, "Couldn't allocate memory for output file"); 82 | 83 | in_fd = open(in_fn, O_RDONLY); 84 | GZAS(in_fd != -1, "Couldn't open file %s for reading", in_fn); 85 | ret = fstat(in_fd, &st); 86 | GZAS(ret == 0, "Couldn't call fstat(), %d returned", ret); 87 | ret = read(in_fd, mem_in, st.st_size); 88 | GZAS(ret == st.st_size, "Read only %d bytes, %jd expected", ret, 89 | (uintmax_t)st.st_size); 90 | out_fd = open(out_fn, O_WRONLY|O_CREAT, st.st_mode); 91 | GZAS(out_fd != -1, "Couldn't create output file '%s' for writing", 92 | out_fn); 93 | 94 | if (flag_c) { 95 | abort(); 96 | #if 0 97 | mini_gz_init(&gz); 98 | printf("COMP\n"); 99 | out_len = mini_gz_pack(&gz, level, mem_in, st.st_size, mem_out, 100 | 1024*1024); 101 | printf("out_len = %d\n", out_len); 102 | ret = write(out_fd, mem_out, out_len); 103 | printf("ret = %d\n", ret); 104 | GZAS(ret == out_len, "Wrote only %d bytes, expected %d", ret, out_len); 105 | #endif 106 | } else { 107 | printf("--- testing decompression --\n"); 108 | ret = mini_gz_start(&gz, mem_in, st.st_size); 109 | GZAS(ret == 0, "mini_gz_start() failed, ret=%d", ret); 110 | out_len = mini_gz_unpack(&gz, mem_out, 1024*1024); 111 | printf("out_len = %d\n", out_len); 112 | ret = write(out_fd, mem_out, out_len); 113 | printf("ret = %d\n", ret); 114 | GZAS(ret == out_len, "Wrote only %d bytes, expected %d", ret, out_len); 115 | } 116 | close(in_fd); 117 | close(out_fd); 118 | 119 | return 0; 120 | } 121 | -------------------------------------------------------------------------------- /miniz.c: -------------------------------------------------------------------------------- 1 | /* miniz.c v1.12 - public domain deflate/inflate 2 | See "unlicense" statement at the end of this file. 3 | Rich Geldreich , last updated April 12, 2012 4 | Implements RFC 1950: http://www.ietf.org/rfc/rfc1950.txt and RFC 1951: http://www.ietf.org/rfc/rfc1951.txt 5 | 6 | * Change History 7 | 4/12/12 v1.12 - More comments, added low-level example5.c, fixed a couple minor level_and_flags issues in the archive API's. 8 | level_and_flags can now be set to MZ_DEFAULT_COMPRESSION. Thanks to Bruce Dawson for the feedback/bug report. 9 | 5/28/11 v1.11 - Added statement from unlicense.org 10 | 5/27/11 v1.10 - Substantial compressor optimizations: 11 | Level 1 is now ~4x faster than before. The L1 compressor's throughput now varies between 70-110MB/sec. on a 12 | Core i7 (actual throughput varies depending on the type of data, and x64 vs. x86). 13 | Improved baseline L2-L9 compression perf. Also, greatly improved compression perf. issues on some file types. 14 | Refactored the compression code for better readability and maintainability. 15 | Added level 10 compression level (L10 has slightly better ratio than level 9, but could have a potentially large 16 | drop in throughput on some files). 17 | 5/15/11 v1.09 - Initial stable release. 18 | 19 | * Low-level Deflate/Inflate implementation notes: 20 | 21 | Compression: Use the "tdefl" API's. The compressor supports raw, static, and dynamic blocks, lazy or 22 | greedy parsing, match length filtering, RLE-only, and Huffman-only streams. It performs and compresses 23 | approximately as well as zlib. 24 | 25 | Decompression: Use the "tinfl" API's. The entire decompressor is implemented as a single function 26 | coroutine: see tinfl_decompress(). It supports decompression into a 32KB (or larger power of 2) wrapping buffer, or into a memory 27 | block large enough to hold the entire file. 28 | 29 | The low-level tdefl/tinfl API's do not make any use of dynamic memory allocation. 30 | 31 | * zlib-style API notes: 32 | 33 | miniz.c implements a fairly large subset of zlib. There's enough functionality present for it to be a drop-in 34 | zlib replacement in many apps: 35 | The z_stream struct, optional memory allocation callbacks 36 | deflateInit/deflateInit2/deflate/deflateReset/deflateEnd/deflateBound 37 | inflateInit/inflateInit2/inflate/inflateEnd 38 | compress, compress2, compressBound, uncompress 39 | CRC-32, Adler-32 - Using modern, minimal code size, CPU cache friendly routines. 40 | Supports raw deflate streams or standard zlib streams with adler-32 checking. 41 | 42 | Limitations: 43 | The callback API's are not implemented yet. No support for gzip headers or zlib static dictionaries. 44 | I've tried to closely emulate zlib's various flavors of stream flushing and return status codes, but 45 | there are no guarantees that miniz.c pulls this off perfectly. 46 | 47 | * PNG writing: See the tdefl_write_image_to_png_file_in_memory() function, originally written by 48 | Alex Evans. Supports 1-4 bytes/pixel images. 49 | 50 | * This is a header file library, like stb_image.c. To get only a header file, either cut and paste the 51 | below header, or create miniz.h, #define MINIZ_HEADER_FILE_ONLY, and then include miniz.c from it. 52 | 53 | * Important: For best perf. be sure to customize the below macros for your target platform: 54 | #define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 0 55 | #define MINIZ_LITTLE_ENDIAN 1 56 | #define MINIZ_HAS_64BIT_REGISTERS 1 57 | */ 58 | 59 | #ifndef MINIZ_HEADER_INCLUDED 60 | #define MINIZ_HEADER_INCLUDED 61 | 62 | #include 63 | 64 | // Defines to completely disable specific portions of miniz.c: 65 | // If all macros here are defined the only functionality remaining will be CRC-32, adler-32, tinfl, and tdefl. 66 | 67 | // Define MINIZ_NO_ZLIB_APIS to remove all ZLIB-style compression/decompression API's. 68 | //#define MINIZ_NO_ZLIB_APIS 69 | 70 | // Define MINIZ_NO_ZLIB_COMPATIBLE_NAME to disable zlib names, to prevent conflicts against stock zlib. 71 | //#define MINIZ_NO_ZLIB_COMPATIBLE_NAMES 72 | 73 | // Define MINIZ_NO_MALLOC to disable all calls to malloc, free, and realloc. 74 | // Note if MINIZ_NO_MALLOC is defined then the user must always provide custom user alloc/free/realloc 75 | // callbacks to the zlib and archive API's, and a few stand-alone helper API's which don't provide custom user 76 | // functions (such as tdefl_compress_mem_to_heap() and tinfl_decompress_mem_to_heap()) won't work. 77 | //#define MINIZ_NO_MALLOC 78 | 79 | #if defined(_M_IX86) || defined(_M_X64) || defined(__i386__) || defined(__i386) || defined(__i486__) || defined(__i486) || defined(i386) || defined(__ia64__) || defined(__x86_64__) 80 | // MINIZ_X86_OR_X64_CPU is only used to help set the below macros. 81 | #define MINIZ_X86_OR_X64_CPU 1 82 | #endif 83 | 84 | #if (__BYTE_ORDER__==__ORDER_LITTLE_ENDIAN__) || MINIZ_X86_OR_X64_CPU 85 | // Set MINIZ_LITTLE_ENDIAN to 1 if the processor is little endian. 86 | #define MINIZ_LITTLE_ENDIAN 1 87 | #endif 88 | 89 | #if MINIZ_X86_OR_X64_CPU 90 | // Set MINIZ_USE_UNALIGNED_LOADS_AND_STORES to 1 on CPU's that permit efficient integer loads and stores from unaligned addresses. 91 | #define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1 92 | #endif 93 | 94 | #define MINIZ_HAS_64BIT_REGISTERS 1 95 | 96 | // ------------------- zlib-style API Definitions. 97 | 98 | // For more compatibility with zlib, miniz.c uses unsigned long for some parameters/struct members. 99 | typedef unsigned long mz_ulong; 100 | 101 | // Heap allocation callbacks. 102 | // Note that mz_alloc_func parameter types purpsosely differ from zlib's: items/size is size_t, not unsigned long. 103 | typedef void *(*mz_alloc_func)(void *opaque, size_t items, size_t size); 104 | typedef void (*mz_free_func)(void *opaque, void *address); 105 | typedef void *(*mz_realloc_func)(void *opaque, void *address, size_t items, size_t size); 106 | 107 | #define MZ_ADLER32_INIT (1) 108 | // mz_adler32() returns the initial adler-32 value to use when called with ptr==NULL. 109 | mz_ulong mz_adler32(mz_ulong adler, const unsigned char *ptr, size_t buf_len); 110 | 111 | #define MZ_CRC32_INIT (0) 112 | // mz_crc32() returns the initial CRC-32 value to use when called with ptr==NULL. 113 | mz_ulong mz_crc32(mz_ulong crc, const unsigned char *ptr, size_t buf_len); 114 | 115 | // Compression strategies. 116 | enum { MZ_DEFAULT_STRATEGY = 0, MZ_FILTERED = 1, MZ_HUFFMAN_ONLY = 2, MZ_RLE = 3, MZ_FIXED = 4 }; 117 | 118 | // Method 119 | #define MZ_DEFLATED 8 120 | 121 | #ifndef MINIZ_NO_ZLIB_APIS 122 | 123 | #define MZ_VERSION "9.1.12" 124 | #define MZ_VERNUM 0x91C0 125 | #define MZ_VER_MAJOR 9 126 | #define MZ_VER_MINOR 1 127 | #define MZ_VER_REVISION 12 128 | #define MZ_VER_SUBREVISION 0 129 | 130 | // 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). 131 | enum { MZ_NO_FLUSH = 0, MZ_PARTIAL_FLUSH = 1, MZ_SYNC_FLUSH = 2, MZ_FULL_FLUSH = 3, MZ_FINISH = 4, MZ_BLOCK = 5 }; 132 | 133 | // Return status codes. MZ_PARAM_ERROR is non-standard. 134 | 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 }; 135 | 136 | // 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. 137 | 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 }; 138 | 139 | // Window bits 140 | #define MZ_DEFAULT_WINDOW_BITS 15 141 | 142 | struct mz_internal_state; 143 | 144 | // Compression/decompression stream struct. 145 | typedef struct mz_stream_s 146 | { 147 | const unsigned char *next_in; // pointer to next byte to read 148 | unsigned int avail_in; // number of bytes available at next_in 149 | mz_ulong total_in; // total number of bytes consumed so far 150 | 151 | unsigned char *next_out; // pointer to next byte to write 152 | unsigned int avail_out; // number of bytes that can be written to next_out 153 | mz_ulong total_out; // total number of bytes produced so far 154 | 155 | char *msg; // error msg (unused) 156 | struct mz_internal_state *state; // internal state, allocated by zalloc/zfree 157 | 158 | mz_alloc_func zalloc; // optional heap allocation function (defaults to malloc) 159 | mz_free_func zfree; // optional heap free function (defaults to free) 160 | void *opaque; // heap alloc function user pointer 161 | 162 | int data_type; // data_type (unused) 163 | mz_ulong adler; // adler32 of the source or uncompressed data 164 | mz_ulong crc32; // crc32 of the source or uncompressed data 165 | mz_ulong reserved; 166 | } mz_stream; 167 | 168 | typedef mz_stream *mz_streamp; 169 | 170 | // Returns the version string of miniz.c. 171 | const char *mz_version(void); 172 | 173 | // mz_deflateInit() initializes a compressor with default options: 174 | // Parameters: 175 | // pStream must point to an initialized mz_stream struct. 176 | // level must be between [MZ_NO_COMPRESSION, MZ_BEST_COMPRESSION]. 177 | // level 1 enables a specially optimized compression function that's been optimized purely for performance, not ratio. 178 | // (This special func. is currently only enabled when MINIZ_USE_UNALIGNED_LOADS_AND_STORES and MINIZ_LITTLE_ENDIAN are defined.) 179 | // Return values: 180 | // MZ_OK on success. 181 | // MZ_STREAM_ERROR if the stream is bogus. 182 | // MZ_PARAM_ERROR if the input parameters are bogus. 183 | // MZ_MEM_ERROR on out of memory. 184 | int mz_deflateInit(mz_streamp pStream, int level); 185 | 186 | // mz_deflateInit2() is like mz_deflate(), except with more control: 187 | // Additional parameters: 188 | // method must be MZ_DEFLATED 189 | // 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) 190 | // mem_level must be between [1, 9] (it's checked but ignored by miniz.c) 191 | int mz_deflateInit2(mz_streamp pStream, int level, int method, int window_bits, int mem_level, int strategy); 192 | 193 | // Quickly resets a compressor without having to reallocate anything. Same as calling mz_deflateEnd() followed by mz_deflateInit()/mz_deflateInit2(). 194 | int mz_deflateReset(mz_streamp pStream); 195 | 196 | // mz_deflate() compresses the input to output, consuming as much of the input and producing as much output as possible. 197 | // Parameters: 198 | // 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. 199 | // flush may be MZ_NO_FLUSH, MZ_PARTIAL_FLUSH/MZ_SYNC_FLUSH, MZ_FULL_FLUSH, or MZ_FINISH. 200 | // Return values: 201 | // 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). 202 | // 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. 203 | // MZ_STREAM_ERROR if the stream is bogus. 204 | // MZ_PARAM_ERROR if one of the parameters is invalid. 205 | // 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.) 206 | int mz_deflate(mz_streamp pStream, int flush); 207 | 208 | // mz_deflateEnd() deinitializes a compressor: 209 | // Return values: 210 | // MZ_OK on success. 211 | // MZ_STREAM_ERROR if the stream is bogus. 212 | int mz_deflateEnd(mz_streamp pStream); 213 | 214 | // 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. 215 | mz_ulong mz_deflateBound(mz_streamp pStream, mz_ulong source_len); 216 | 217 | // Single-call compression functions mz_compress() and mz_compress2(): 218 | // Returns MZ_OK on success, or one of the error codes from mz_deflate() on failure. 219 | int mz_compress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len); 220 | int mz_compress2(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len, int level); 221 | 222 | // mz_compressBound() returns a (very) conservative upper bound on the amount of data that could be generated by calling mz_compress(). 223 | mz_ulong mz_compressBound(mz_ulong source_len); 224 | 225 | // Initializes a decompressor. 226 | int mz_inflateInit(mz_streamp pStream); 227 | 228 | // 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: 229 | // window_bits must be MZ_DEFAULT_WINDOW_BITS (to parse zlib header/footer) or -MZ_DEFAULT_WINDOW_BITS (raw deflate). 230 | int mz_inflateInit2(mz_streamp pStream, int window_bits); 231 | 232 | // 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. 233 | // Parameters: 234 | // 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. 235 | // flush may be MZ_NO_FLUSH, MZ_SYNC_FLUSH, or MZ_FINISH. 236 | // 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). 237 | // 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. 238 | // Return values: 239 | // 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. 240 | // 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. 241 | // MZ_STREAM_ERROR if the stream is bogus. 242 | // MZ_DATA_ERROR if the deflate stream is invalid. 243 | // MZ_PARAM_ERROR if one of the parameters is invalid. 244 | // 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 245 | // with more input data, or with more room in the output buffer (except when using single call decompression, described above). 246 | int mz_inflate(mz_streamp pStream, int flush); 247 | 248 | // Deinitializes a decompressor. 249 | int mz_inflateEnd(mz_streamp pStream); 250 | 251 | // Single-call decompression. 252 | // Returns MZ_OK on success, or one of the error codes from mz_inflate() on failure. 253 | int mz_uncompress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len); 254 | 255 | // Returns a string description of the specified error code, or NULL if the error code is invalid. 256 | const char *mz_error(int err); 257 | 258 | // 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. 259 | // Define MINIZ_NO_ZLIB_COMPATIBLE_NAMES to disable zlib-compatibility if you use zlib in the same project. 260 | #ifndef MINIZ_NO_ZLIB_COMPATIBLE_NAMES 261 | typedef unsigned char Byte; 262 | typedef unsigned int uInt; 263 | typedef mz_ulong uLong; 264 | typedef Byte Bytef; 265 | typedef uInt uIntf; 266 | typedef char charf; 267 | typedef int intf; 268 | typedef void *voidpf; 269 | typedef uLong uLongf; 270 | typedef void *voidp; 271 | typedef void *const voidpc; 272 | #define Z_NULL 0 273 | #define Z_NO_FLUSH MZ_NO_FLUSH 274 | #define Z_PARTIAL_FLUSH MZ_PARTIAL_FLUSH 275 | #define Z_SYNC_FLUSH MZ_SYNC_FLUSH 276 | #define Z_FULL_FLUSH MZ_FULL_FLUSH 277 | #define Z_FINISH MZ_FINISH 278 | #define Z_BLOCK MZ_BLOCK 279 | #define Z_OK MZ_OK 280 | #define Z_STREAM_END MZ_STREAM_END 281 | #define Z_NEED_DICT MZ_NEED_DICT 282 | #define Z_ERRNO MZ_ERRNO 283 | #define Z_STREAM_ERROR MZ_STREAM_ERROR 284 | #define Z_DATA_ERROR MZ_DATA_ERROR 285 | #define Z_MEM_ERROR MZ_MEM_ERROR 286 | #define Z_BUF_ERROR MZ_BUF_ERROR 287 | #define Z_VERSION_ERROR MZ_VERSION_ERROR 288 | #define Z_PARAM_ERROR MZ_PARAM_ERROR 289 | #define Z_NO_COMPRESSION MZ_NO_COMPRESSION 290 | #define Z_BEST_SPEED MZ_BEST_SPEED 291 | #define Z_BEST_COMPRESSION MZ_BEST_COMPRESSION 292 | #define Z_DEFAULT_COMPRESSION MZ_DEFAULT_COMPRESSION 293 | #define Z_DEFAULT_STRATEGY MZ_DEFAULT_STRATEGY 294 | #define Z_FILTERED MZ_FILTERED 295 | #define Z_HUFFMAN_ONLY MZ_HUFFMAN_ONLY 296 | #define Z_RLE MZ_RLE 297 | #define Z_FIXED MZ_FIXED 298 | #define Z_DEFLATED MZ_DEFLATED 299 | #define Z_DEFAULT_WINDOW_BITS MZ_DEFAULT_WINDOW_BITS 300 | #define alloc_func mz_alloc_func 301 | #define free_func mz_free_func 302 | #define internal_state mz_internal_state 303 | #define z_stream mz_stream 304 | #define deflateInit mz_deflateInit 305 | #define deflateInit2 mz_deflateInit2 306 | #define deflateReset mz_deflateReset 307 | #define deflate mz_deflate 308 | #define deflateEnd mz_deflateEnd 309 | #define deflateBound mz_deflateBound 310 | #define compress mz_compress 311 | #define compress2 mz_compress2 312 | #define compressBound mz_compressBound 313 | #define inflateInit mz_inflateInit 314 | #define inflateInit2 mz_inflateInit2 315 | #define inflate mz_inflate 316 | #define inflateEnd mz_inflateEnd 317 | #define uncompress mz_uncompress 318 | #define z_crc32 mz_crc32 319 | #define z_adler32 mz_adler32 320 | #define MAX_WBITS 15 321 | #define MAX_MEM_LEVEL 9 322 | #define zError mz_error 323 | #define ZLIB_VERSION MZ_VERSION 324 | #define ZLIB_VERNUM MZ_VERNUM 325 | #define ZLIB_VER_MAJOR MZ_VER_MAJOR 326 | #define ZLIB_VER_MINOR MZ_VER_MINOR 327 | #define ZLIB_VER_REVISION MZ_VER_REVISION 328 | #define ZLIB_VER_SUBREVISION MZ_VER_SUBREVISION 329 | #define zlibVersion mz_version 330 | #define zlib_version mz_version() 331 | #endif // #ifndef MINIZ_NO_ZLIB_COMPATIBLE_NAMES 332 | 333 | #endif // MINIZ_NO_ZLIB_APIS 334 | 335 | // ------------------- Types and macros 336 | 337 | typedef unsigned char mz_uint8; 338 | typedef signed short mz_int16; 339 | typedef unsigned short mz_uint16; 340 | typedef unsigned int mz_uint32; 341 | typedef unsigned int mz_uint; 342 | typedef long long mz_int64; 343 | typedef unsigned long long mz_uint64; 344 | typedef int mz_bool; 345 | 346 | #define MZ_FALSE (0) 347 | #define MZ_TRUE (1) 348 | 349 | #ifndef __WIN__ 350 | #define MZ_MACRO_END while (0) 351 | #else 352 | // Works around MSVC's spammy "warning C4127: conditional expression is constant" message. 353 | #define MZ_MACRO_END while (0, 0) 354 | #endif 355 | 356 | // ------------------- Low-level Decompression API Definitions 357 | 358 | // Decompression flags used by tinfl_decompress(). 359 | // 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. 360 | // 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. 361 | // 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). 362 | // TINFL_FLAG_COMPUTE_ADLER32: Force adler-32 checksum computation of the decompressed bytes. 363 | enum 364 | { 365 | TINFL_FLAG_PARSE_ZLIB_HEADER = 1, 366 | TINFL_FLAG_HAS_MORE_INPUT = 2, 367 | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF = 4, 368 | TINFL_FLAG_COMPUTE_ADLER32 = 8 369 | }; 370 | 371 | // High level decompression functions: 372 | // tinfl_decompress_mem_to_heap() decompresses a block in memory to a heap block allocated via malloc(). 373 | // On entry: 374 | // pSrc_buf, src_buf_len: Pointer and size of the Deflate or zlib source data to decompress. 375 | // On return: 376 | // Function returns a pointer to the decompressed data, or NULL on failure. 377 | // *pOut_len will be set to the decompressed data's size, which could be larger than src_buf_len on uncompressible data. 378 | // The caller must free() the returned block when it's no longer needed. 379 | void *tinfl_decompress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags); 380 | 381 | // tinfl_decompress_mem_to_mem() decompresses a block in memory to another block in memory. 382 | // Returns TINFL_DECOMPRESS_MEM_TO_MEM_FAILED on failure, or the number of bytes written on success. 383 | #define TINFL_DECOMPRESS_MEM_TO_MEM_FAILED ((size_t)(-1)) 384 | 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); 385 | 386 | // 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. 387 | // Returns 1 on success or 0 on failure. 388 | typedef int (*tinfl_put_buf_func_ptr)(const void* pBuf, int len, void *pUser); 389 | 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); 390 | 391 | struct tinfl_decompressor_tag; typedef struct tinfl_decompressor_tag tinfl_decompressor; 392 | 393 | // Max size of LZ dictionary. 394 | #define TINFL_LZ_DICT_SIZE 32768 395 | 396 | // Return status. 397 | typedef enum 398 | { 399 | TINFL_STATUS_BAD_PARAM = -3, 400 | TINFL_STATUS_ADLER32_MISMATCH = -2, 401 | TINFL_STATUS_FAILED = -1, 402 | TINFL_STATUS_DONE = 0, 403 | TINFL_STATUS_NEEDS_MORE_INPUT = 1, 404 | TINFL_STATUS_HAS_MORE_OUTPUT = 2 405 | } tinfl_status; 406 | 407 | // Initializes the decompressor to its initial state. 408 | #define tinfl_init(r) do { (r)->m_state = 0; } MZ_MACRO_END 409 | #define tinfl_get_adler32(r) (r)->m_check_adler32 410 | #define tinfl_get_crc32(r) (r)->m_check_crc32 411 | 412 | // 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. 413 | // 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. 414 | 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); 415 | 416 | // Internal/private bits follow. 417 | enum 418 | { 419 | TINFL_MAX_HUFF_TABLES = 3, TINFL_MAX_HUFF_SYMBOLS_0 = 288, TINFL_MAX_HUFF_SYMBOLS_1 = 32, TINFL_MAX_HUFF_SYMBOLS_2 = 19, 420 | TINFL_FAST_LOOKUP_BITS = 10, TINFL_FAST_LOOKUP_SIZE = 1 << TINFL_FAST_LOOKUP_BITS 421 | }; 422 | 423 | typedef struct 424 | { 425 | mz_uint8 m_code_size[TINFL_MAX_HUFF_SYMBOLS_0]; 426 | mz_int16 m_look_up[TINFL_FAST_LOOKUP_SIZE], m_tree[TINFL_MAX_HUFF_SYMBOLS_0 * 2]; 427 | } tinfl_huff_table; 428 | 429 | #if MINIZ_HAS_64BIT_REGISTERS 430 | #define TINFL_USE_64BIT_BITBUF 1 431 | #endif 432 | 433 | #if TINFL_USE_64BIT_BITBUF 434 | typedef mz_uint64 tinfl_bit_buf_t; 435 | #define TINFL_BITBUF_SIZE (64) 436 | #else 437 | typedef mz_uint32 tinfl_bit_buf_t; 438 | #define TINFL_BITBUF_SIZE (32) 439 | #endif 440 | 441 | struct tinfl_decompressor_tag 442 | { 443 | mz_uint32 m_state, m_num_bits, m_zhdr0, m_zhdr1, m_z_adler32, m_z_crc32, m_final, m_type, m_check_adler32, m_check_crc32, m_dist, m_counter, m_num_extra, m_table_sizes[TINFL_MAX_HUFF_TABLES]; 444 | tinfl_bit_buf_t m_bit_buf; 445 | size_t m_dist_from_out_buf_start; 446 | tinfl_huff_table m_tables[TINFL_MAX_HUFF_TABLES]; 447 | mz_uint8 m_raw_header[4], m_len_codes[TINFL_MAX_HUFF_SYMBOLS_0 + TINFL_MAX_HUFF_SYMBOLS_1 + 137]; 448 | }; 449 | 450 | // ------------------- Low-level Compression API Definitions 451 | 452 | // Set TDEFL_LESS_MEMORY to 1 to use less memory (compression will be slightly slower, and raw/dynamic blocks will be output more frequently). 453 | #define TDEFL_LESS_MEMORY 0 454 | 455 | // tdefl_init() compression flags logically OR'd together (low 12 bits contain the max. number of probes per dictionary search): 456 | // 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). 457 | enum 458 | { 459 | TDEFL_HUFFMAN_ONLY = 0, TDEFL_DEFAULT_MAX_PROBES = 128, TDEFL_MAX_PROBES_MASK = 0xFFF 460 | }; 461 | 462 | // 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. 463 | // TDEFL_COMPUTE_ADLER32: Always compute the adler-32 of the input data (even when not writing zlib headers). 464 | // TDEFL_COMPUTE_CRC32: Always compute the crc-32 of the input data. 465 | // TDEFL_GREEDY_PARSING_FLAG: Set to use faster greedy parsing, instead of more efficient lazy parsing. 466 | // 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). 467 | // TDEFL_RLE_MATCHES: Only look for RLE matches (matches with a distance of 1) 468 | // TDEFL_FILTER_MATCHES: Discards matches <= 5 chars if enabled. 469 | // TDEFL_FORCE_ALL_STATIC_BLOCKS: Disable usage of optimized Huffman tables. 470 | // TDEFL_FORCE_ALL_RAW_BLOCKS: Only use raw (uncompressed) deflate blocks. 471 | enum 472 | { 473 | TDEFL_WRITE_ZLIB_HEADER = 0x001000, 474 | TDEFL_COMPUTE_ADLER32 = 0x002000, 475 | TDEFL_COMPUTE_CRC32 = 0x004000, 476 | TDEFL_GREEDY_PARSING_FLAG = 0x008000, 477 | TDEFL_NONDETERMINISTIC_PARSING_FLAG = 0x010000, 478 | TDEFL_RLE_MATCHES = 0x020000, 479 | TDEFL_FILTER_MATCHES = 0x040000, 480 | TDEFL_FORCE_ALL_STATIC_BLOCKS = 0x080000, 481 | TDEFL_FORCE_ALL_RAW_BLOCKS = 0x100000, 482 | }; 483 | 484 | // High level compression functions: 485 | // tdefl_compress_mem_to_heap() compresses a block in memory to a heap block allocated via malloc(). 486 | // On entry: 487 | // pSrc_buf, src_buf_len: Pointer and size of source block to compress. 488 | // flags: The max match finder probes (default is 128) logically OR'd against the above flags. Higher probes are slower but improve compression. 489 | // On return: 490 | // Function returns a pointer to the compressed data, or NULL on failure. 491 | // *pOut_len will be set to the compressed data's size, which could be larger than src_buf_len on uncompressible data. 492 | // The caller must free() the returned block when it's no longer needed. 493 | void *tdefl_compress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags); 494 | 495 | // tdefl_compress_mem_to_mem() compresses a block in memory to another block in memory. 496 | // Returns 0 on failure. 497 | 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); 498 | 499 | // Compresses an image to a compressed PNG file in memory. 500 | // On entry: 501 | // pImage, w, h, and num_chans describe the image to compress. num_chans may be 1, 2, 3, or 4. 502 | // On return: 503 | // Function returns a pointer to the compressed data, or NULL on failure. 504 | // *pLen_out will be set to the size of the PNG image file. 505 | // The caller must free() the returned heap block (which will typically be larger than *pLen_out) when it's no longer needed. 506 | void *tdefl_write_image_to_png_file_in_memory(const void *pImage, int w, int h, int num_chans, size_t *pLen_out); 507 | 508 | // Output stream interface. The compressor uses this interface to write compressed data. It'll typically be called TDEFL_OUT_BUF_SIZE at a time. 509 | typedef mz_bool (*tdefl_put_buf_func_ptr)(const void* pBuf, int len, void *pUser); 510 | 511 | // tdefl_compress_mem_to_output() compresses a block to an output stream. The above helpers use this function internally. 512 | 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); 513 | 514 | 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 }; 515 | 516 | // TDEFL_OUT_BUF_SIZE MUST be large enough to hold a single entire compressed output block (using static/fixed Huffman codes). 517 | #if TDEFL_LESS_MEMORY 518 | 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 }; 519 | #else 520 | 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 }; 521 | #endif 522 | 523 | // 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. 524 | typedef enum 525 | { 526 | TDEFL_STATUS_BAD_PARAM = -2, 527 | TDEFL_STATUS_PUT_BUF_FAILED = -1, 528 | TDEFL_STATUS_OKAY = 0, 529 | TDEFL_STATUS_DONE = 1, 530 | } tdefl_status; 531 | 532 | // Must map to MZ_NO_FLUSH, MZ_SYNC_FLUSH, etc. enums 533 | typedef enum 534 | { 535 | TDEFL_NO_FLUSH = 0, 536 | TDEFL_SYNC_FLUSH = 2, 537 | TDEFL_FULL_FLUSH = 3, 538 | TDEFL_FINISH = 4 539 | } tdefl_flush; 540 | 541 | // tdefl's compression state structure. 542 | typedef struct 543 | { 544 | tdefl_put_buf_func_ptr m_pPut_buf_func; 545 | void *m_pPut_buf_user; 546 | mz_uint m_flags, m_max_probes[2]; 547 | int m_greedy_parsing; 548 | mz_uint m_adler32, m_crc32, m_lookahead_pos, m_lookahead_size, m_dict_size; 549 | mz_uint8 *m_pLZ_code_buf, *m_pLZ_flags, *m_pOutput_buf, *m_pOutput_buf_end; 550 | mz_uint m_num_flags_left, m_total_lz_bytes, m_lz_code_buf_dict_pos, m_bits_in, m_bit_buffer; 551 | 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; 552 | tdefl_status m_prev_return_status; 553 | const void *m_pIn_buf; 554 | void *m_pOut_buf; 555 | size_t *m_pIn_buf_size, *m_pOut_buf_size; 556 | tdefl_flush m_flush; 557 | const mz_uint8 *m_pSrc; 558 | size_t m_src_buf_left, m_out_buf_ofs; 559 | mz_uint8 m_dict[TDEFL_LZ_DICT_SIZE + TDEFL_MAX_MATCH_LEN - 1]; 560 | mz_uint16 m_huff_count[TDEFL_MAX_HUFF_TABLES][TDEFL_MAX_HUFF_SYMBOLS]; 561 | mz_uint16 m_huff_codes[TDEFL_MAX_HUFF_TABLES][TDEFL_MAX_HUFF_SYMBOLS]; 562 | mz_uint8 m_huff_code_sizes[TDEFL_MAX_HUFF_TABLES][TDEFL_MAX_HUFF_SYMBOLS]; 563 | mz_uint8 m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE]; 564 | mz_uint16 m_next[TDEFL_LZ_DICT_SIZE]; 565 | mz_uint16 m_hash[TDEFL_LZ_HASH_SIZE]; 566 | mz_uint8 m_output_buf[TDEFL_OUT_BUF_SIZE]; 567 | } tdefl_compressor; 568 | 569 | // Initializes the compressor. 570 | // There is no corresponding deinit() function because the tdefl API's do not dynamically allocate memory. 571 | // 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. 572 | // If pBut_buf_func is NULL the user should always call the tdefl_compress() API. 573 | // flags: See the above enums (TDEFL_HUFFMAN_ONLY, TDEFL_WRITE_ZLIB_HEADER, etc.) 574 | tdefl_status tdefl_init(tdefl_compressor *d, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags); 575 | 576 | // 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. 577 | 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); 578 | 579 | // tdefl_compress_buffer() is only usable when the tdefl_init() is called with a non-NULL tdefl_put_buf_func_ptr. 580 | // tdefl_compress_buffer() always consumes the entire input buffer. 581 | tdefl_status tdefl_compress_buffer(tdefl_compressor *d, const void *pIn_buf, size_t in_buf_size, tdefl_flush flush); 582 | 583 | tdefl_status tdefl_get_prev_return_status(tdefl_compressor *d); 584 | mz_uint32 tdefl_get_adler32(tdefl_compressor *d); 585 | mz_uint32 tdefl_get_crc32(tdefl_compressor *d); 586 | 587 | // Create tdefl_compress() flags given zlib-style compression parameters. 588 | // level may range from [0,10] (where 10 is absolute max compression, but may be much slower on some files) 589 | // window_bits may be -15 (raw deflate) or 15 (zlib) 590 | // strategy may be either MZ_DEFAULT_STRATEGY, MZ_FILTERED, MZ_HUFFMAN_ONLY, MZ_RLE, or MZ_FIXED 591 | mz_uint tdefl_create_comp_flags_from_zip_params(int level, int window_bits, int strategy); 592 | 593 | #endif // MINIZ_HEADER_INCLUDED 594 | 595 | // ------------------- End of Header: Implementation follows. (If you only want the header, define MINIZ_HEADER_FILE_ONLY.) 596 | 597 | #ifndef MINIZ_HEADER_FILE_ONLY 598 | 599 | typedef unsigned char mz_validate_uint16[sizeof(mz_uint16)==2 ? 1 : -1]; 600 | typedef unsigned char mz_validate_uint32[sizeof(mz_uint32)==4 ? 1 : -1]; 601 | typedef unsigned char mz_validate_uint64[sizeof(mz_uint64)==8 ? 1 : -1]; 602 | 603 | #include 604 | #include 605 | 606 | #define MZ_ASSERT(x) assert(x) 607 | 608 | #ifdef MINIZ_NO_MALLOC 609 | #define MZ_MALLOC(x) NULL 610 | #define MZ_FREE(x) x, ((void)0) 611 | #define MZ_REALLOC(p, x) NULL 612 | #else 613 | #define MZ_MALLOC(x) malloc(x) 614 | #define MZ_FREE(x) free(x) 615 | #define MZ_REALLOC(p, x) realloc(p, x) 616 | #endif 617 | 618 | #define MZ_MAX(a,b) (((a)>(b))?(a):(b)) 619 | #define MZ_MIN(a,b) (((a)<(b))?(a):(b)) 620 | #define MZ_CLEAR_OBJ(obj) memset(&(obj), 0, sizeof(obj)) 621 | 622 | #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN 623 | #define MZ_READ_LE16(p) *((const mz_uint16 *)(p)) 624 | #define MZ_READ_LE32(p) *((const mz_uint32 *)(p)) 625 | #else 626 | #define MZ_READ_LE16(p) ((mz_uint32)(((const mz_uint8 *)(p))[0]) | ((mz_uint32)(((const mz_uint8 *)(p))[1]) << 8U)) 627 | #define MZ_READ_LE32(p) ((mz_uint32)(((const mz_uint8 *)(p))[0]) | ((mz_uint32)(((const mz_uint8 *)(p))[1]) << 8U) | ((mz_uint32)(((const mz_uint8 *)(p))[2]) << 16U) | ((mz_uint32)(((const mz_uint8 *)(p))[3]) << 24U)) 628 | #endif 629 | 630 | #if !defined(_MSC_VER) && !defined(__MINGW32__) && !defined(__MINGW64__) && !defined(__forceinline) 631 | #define __forceinline 632 | #endif 633 | 634 | // ------------------- zlib-style API's 635 | 636 | static void *def_alloc_func(void *opaque, size_t items, size_t size) { (void)opaque; return MZ_MALLOC(items * size); } 637 | static void def_free_func(void *opaque, void *address) { (void)opaque, MZ_FREE(address); } 638 | 639 | mz_ulong mz_adler32(mz_ulong adler, const unsigned char *ptr, size_t buf_len) 640 | { 641 | mz_uint32 i, s1 = (mz_uint32)(adler & 0xffff), s2 = (mz_uint32)(adler >> 16); size_t block_len = buf_len % 5552; 642 | if (!ptr) return MZ_ADLER32_INIT; 643 | while (buf_len) { 644 | for (i = 0; i + 7 < block_len; i += 8, ptr += 8) { 645 | s1 += ptr[0], s2 += s1; s1 += ptr[1], s2 += s1; s1 += ptr[2], s2 += s1; s1 += ptr[3], s2 += s1; 646 | s1 += ptr[4], s2 += s1; s1 += ptr[5], s2 += s1; s1 += ptr[6], s2 += s1; s1 += ptr[7], s2 += s1; 647 | } 648 | for ( ; i < block_len; ++i) s1 += *ptr++, s2 += s1; 649 | s1 %= 65521U, s2 %= 65521U; buf_len -= block_len; block_len = 5552; 650 | } 651 | return (s2 << 16) + s1; 652 | } 653 | 654 | // 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/ 655 | mz_ulong mz_crc32(mz_ulong crc, const mz_uint8 *ptr, size_t buf_len) 656 | { 657 | static const mz_uint32 s_crc32[16] = { 0, 0x1db71064, 0x3b6e20c8, 0x26d930ac, 0x76dc4190, 0x6b6b51f4, 0x4db26158, 0x5005713c, 658 | 0xedb88320, 0xf00f9344, 0xd6d6a3e8, 0xcb61b38c, 0x9b64c2b0, 0x86d3d2d4, 0xa00ae278, 0xbdbdf21c }; 659 | if (!ptr) return MZ_CRC32_INIT; 660 | crc = ~crc; while (buf_len--) { mz_uint8 b = *ptr++; crc = (crc >> 4) ^ s_crc32[(crc & 0xF) ^ (b & 0xF)]; crc = (crc >> 4) ^ s_crc32[(crc & 0xF) ^ (b >> 4)]; } return ~crc; 661 | } 662 | 663 | #ifndef MINIZ_NO_ZLIB_APIS 664 | 665 | const char *mz_version(void) 666 | { 667 | return MZ_VERSION; 668 | } 669 | 670 | int mz_deflateInit(mz_streamp pStream, int level) 671 | { 672 | return mz_deflateInit2(pStream, level, MZ_DEFLATED, MZ_DEFAULT_WINDOW_BITS, 9, MZ_DEFAULT_STRATEGY); 673 | } 674 | 675 | int mz_deflateInit2(mz_streamp pStream, int level, int method, int window_bits, int mem_level, int strategy) 676 | { 677 | tdefl_compressor *pComp; 678 | mz_uint comp_flags = TDEFL_COMPUTE_ADLER32 | TDEFL_COMPUTE_CRC32 | tdefl_create_comp_flags_from_zip_params(level, window_bits, strategy); 679 | 680 | if (!pStream) return MZ_STREAM_ERROR; 681 | 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; 682 | 683 | pStream->data_type = 0; 684 | pStream->adler = MZ_ADLER32_INIT; 685 | pStream->crc32 = MZ_CRC32_INIT; 686 | pStream->msg = NULL; 687 | pStream->reserved = 0; 688 | pStream->total_in = 0; 689 | pStream->total_out = 0; 690 | if (!pStream->zalloc) pStream->zalloc = def_alloc_func; 691 | if (!pStream->zfree) pStream->zfree = def_free_func; 692 | 693 | pComp = (tdefl_compressor *)pStream->zalloc(pStream->opaque, 1, sizeof(tdefl_compressor)); 694 | if (!pComp) 695 | return MZ_MEM_ERROR; 696 | 697 | pStream->state = (struct mz_internal_state *)pComp; 698 | 699 | if (tdefl_init(pComp, NULL, NULL, comp_flags) != TDEFL_STATUS_OKAY) 700 | { 701 | mz_deflateEnd(pStream); 702 | return MZ_PARAM_ERROR; 703 | } 704 | 705 | return MZ_OK; 706 | } 707 | 708 | int mz_deflateReset(mz_streamp pStream) 709 | { 710 | if ((!pStream) || (!pStream->state) || (!pStream->zalloc) || (!pStream->zfree)) return MZ_STREAM_ERROR; 711 | pStream->total_in = pStream->total_out = 0; 712 | tdefl_init((tdefl_compressor*)pStream->state, NULL, NULL, ((tdefl_compressor*)pStream->state)->m_flags); 713 | return MZ_OK; 714 | } 715 | 716 | int mz_deflate(mz_streamp pStream, int flush) 717 | { 718 | size_t in_bytes, out_bytes; 719 | mz_ulong orig_total_in, orig_total_out; 720 | int mz_status = MZ_OK; 721 | 722 | if ((!pStream) || (!pStream->state) || (flush < 0) || (flush > MZ_FINISH) || (!pStream->next_out)) return MZ_STREAM_ERROR; 723 | if (!pStream->avail_out) return MZ_BUF_ERROR; 724 | 725 | if (flush == MZ_PARTIAL_FLUSH) flush = MZ_SYNC_FLUSH; 726 | 727 | if (((tdefl_compressor*)pStream->state)->m_prev_return_status == TDEFL_STATUS_DONE) 728 | return (flush == MZ_FINISH) ? MZ_STREAM_END : MZ_BUF_ERROR; 729 | 730 | orig_total_in = pStream->total_in; orig_total_out = pStream->total_out; 731 | for ( ; ; ) 732 | { 733 | tdefl_status defl_status; 734 | in_bytes = pStream->avail_in; out_bytes = pStream->avail_out; 735 | 736 | defl_status = tdefl_compress((tdefl_compressor*)pStream->state, pStream->next_in, &in_bytes, pStream->next_out, &out_bytes, (tdefl_flush)flush); 737 | pStream->next_in += (mz_uint)in_bytes; pStream->avail_in -= (mz_uint)in_bytes; 738 | pStream->total_in += (mz_uint)in_bytes; pStream->adler = tdefl_get_adler32((tdefl_compressor*)pStream->state); pStream->crc32 = tdefl_get_crc32((tdefl_compressor*)pStream->state); 739 | 740 | pStream->next_out += (mz_uint)out_bytes; pStream->avail_out -= (mz_uint)out_bytes; 741 | pStream->total_out += (mz_uint)out_bytes; 742 | 743 | if (defl_status < 0) 744 | { 745 | mz_status = MZ_STREAM_ERROR; 746 | break; 747 | } 748 | else if (defl_status == TDEFL_STATUS_DONE) 749 | { 750 | mz_status = MZ_STREAM_END; 751 | break; 752 | } 753 | else if (!pStream->avail_out) 754 | break; 755 | else if ((!pStream->avail_in) && (flush != MZ_FINISH)) 756 | { 757 | if ((flush) || (pStream->total_in != orig_total_in) || (pStream->total_out != orig_total_out)) 758 | break; 759 | return MZ_BUF_ERROR; // Can't make forward progress without some input. 760 | } 761 | } 762 | return mz_status; 763 | } 764 | 765 | int mz_deflateEnd(mz_streamp pStream) 766 | { 767 | if (!pStream) return MZ_STREAM_ERROR; 768 | if (pStream->state) 769 | { 770 | pStream->zfree(pStream->opaque, pStream->state); 771 | pStream->state = NULL; 772 | } 773 | return MZ_OK; 774 | } 775 | 776 | mz_ulong mz_deflateBound(mz_streamp pStream, mz_ulong source_len) 777 | { 778 | (void)pStream; 779 | // 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.) 780 | return MZ_MAX(128 + (source_len * 110) / 100, 128 + source_len + ((source_len / (31 * 1024)) + 1) * 5); 781 | } 782 | 783 | int mz_compress2(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len, int level) 784 | { 785 | int status; 786 | mz_stream stream; 787 | memset(&stream, 0, sizeof(stream)); 788 | 789 | // In case mz_ulong is 64-bits (argh I hate longs). 790 | if ((source_len | *pDest_len) > 0xFFFFFFFFU) return MZ_PARAM_ERROR; 791 | 792 | stream.next_in = pSource; 793 | stream.avail_in = (mz_uint32)source_len; 794 | stream.next_out = pDest; 795 | stream.avail_out = (mz_uint32)*pDest_len; 796 | 797 | status = mz_deflateInit(&stream, level); 798 | if (status != MZ_OK) return status; 799 | 800 | status = mz_deflate(&stream, MZ_FINISH); 801 | if (status != MZ_STREAM_END) 802 | { 803 | mz_deflateEnd(&stream); 804 | return (status == MZ_OK) ? MZ_BUF_ERROR : status; 805 | } 806 | 807 | *pDest_len = stream.total_out; 808 | return mz_deflateEnd(&stream); 809 | } 810 | 811 | int mz_compress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len) 812 | { 813 | return mz_compress2(pDest, pDest_len, pSource, source_len, MZ_DEFAULT_COMPRESSION); 814 | } 815 | 816 | mz_ulong mz_compressBound(mz_ulong source_len) 817 | { 818 | return mz_deflateBound(NULL, source_len); 819 | } 820 | 821 | typedef struct 822 | { 823 | tinfl_decompressor m_decomp; 824 | mz_uint m_dict_ofs, m_dict_avail, m_first_call, m_has_flushed; int m_window_bits; 825 | mz_uint8 m_dict[TINFL_LZ_DICT_SIZE]; 826 | tinfl_status m_last_status; 827 | } inflate_state; 828 | 829 | int mz_inflateInit2(mz_streamp pStream, int window_bits) 830 | { 831 | inflate_state *pDecomp; 832 | if (!pStream) return MZ_STREAM_ERROR; 833 | if ((window_bits != MZ_DEFAULT_WINDOW_BITS) && (-window_bits != MZ_DEFAULT_WINDOW_BITS)) return MZ_PARAM_ERROR; 834 | 835 | pStream->data_type = 0; 836 | pStream->adler = 0; 837 | pStream->crc32 = 0; 838 | pStream->msg = NULL; 839 | pStream->total_in = 0; 840 | pStream->total_out = 0; 841 | pStream->reserved = 0; 842 | if (!pStream->zalloc) pStream->zalloc = def_alloc_func; 843 | if (!pStream->zfree) pStream->zfree = def_free_func; 844 | 845 | pDecomp = (inflate_state*)pStream->zalloc(pStream->opaque, 1, sizeof(inflate_state)); 846 | if (!pDecomp) return MZ_MEM_ERROR; 847 | 848 | pStream->state = (struct mz_internal_state *)pDecomp; 849 | 850 | tinfl_init(&pDecomp->m_decomp); 851 | pDecomp->m_dict_ofs = 0; 852 | pDecomp->m_dict_avail = 0; 853 | pDecomp->m_last_status = TINFL_STATUS_NEEDS_MORE_INPUT; 854 | pDecomp->m_first_call = 1; 855 | pDecomp->m_has_flushed = 0; 856 | pDecomp->m_window_bits = window_bits; 857 | 858 | return MZ_OK; 859 | } 860 | 861 | int mz_inflateInit(mz_streamp pStream) 862 | { 863 | return mz_inflateInit2(pStream, MZ_DEFAULT_WINDOW_BITS); 864 | } 865 | 866 | int mz_inflate(mz_streamp pStream, int flush) 867 | { 868 | inflate_state* pState; 869 | mz_uint n, first_call, decomp_flags = TINFL_FLAG_COMPUTE_ADLER32; 870 | size_t in_bytes, out_bytes, orig_avail_in; 871 | tinfl_status status; 872 | 873 | if ((!pStream) || (!pStream->state)) return MZ_STREAM_ERROR; 874 | if (flush == MZ_PARTIAL_FLUSH) flush = MZ_SYNC_FLUSH; 875 | if ((flush) && (flush != MZ_SYNC_FLUSH) && (flush != MZ_FINISH)) return MZ_STREAM_ERROR; 876 | 877 | pState = (inflate_state*)pStream->state; 878 | if (pState->m_window_bits > 0) decomp_flags |= TINFL_FLAG_PARSE_ZLIB_HEADER; 879 | orig_avail_in = pStream->avail_in; 880 | 881 | first_call = pState->m_first_call; pState->m_first_call = 0; 882 | if (pState->m_last_status < 0) return MZ_DATA_ERROR; 883 | 884 | if (pState->m_has_flushed && (flush != MZ_FINISH)) return MZ_STREAM_ERROR; 885 | pState->m_has_flushed |= (flush == MZ_FINISH); 886 | 887 | if ((flush == MZ_FINISH) && (first_call)) 888 | { 889 | // MZ_FINISH on the first call implies that the input and output buffers are large enough to hold the entire compressed/decompressed file. 890 | decomp_flags |= TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF; 891 | in_bytes = pStream->avail_in; out_bytes = pStream->avail_out; 892 | status = tinfl_decompress(&pState->m_decomp, pStream->next_in, &in_bytes, pStream->next_out, pStream->next_out, &out_bytes, decomp_flags); 893 | pState->m_last_status = status; 894 | pStream->next_in += (mz_uint)in_bytes; pStream->avail_in -= (mz_uint)in_bytes; pStream->total_in += (mz_uint)in_bytes; 895 | pStream->adler = tinfl_get_adler32(&pState->m_decomp); 896 | pStream->crc32 = tinfl_get_crc32(&pState->m_decomp); 897 | pStream->next_out += (mz_uint)out_bytes; pStream->avail_out -= (mz_uint)out_bytes; pStream->total_out += (mz_uint)out_bytes; 898 | 899 | if (status < 0) 900 | return MZ_DATA_ERROR; 901 | else if (status != TINFL_STATUS_DONE) 902 | { 903 | pState->m_last_status = TINFL_STATUS_FAILED; 904 | return MZ_BUF_ERROR; 905 | } 906 | return MZ_STREAM_END; 907 | } 908 | // flush != MZ_FINISH then we must assume there's more input. 909 | if (flush != MZ_FINISH) decomp_flags |= TINFL_FLAG_HAS_MORE_INPUT; 910 | 911 | if (pState->m_dict_avail) 912 | { 913 | n = MZ_MIN(pState->m_dict_avail, pStream->avail_out); 914 | memcpy(pStream->next_out, pState->m_dict + pState->m_dict_ofs, n); 915 | pStream->next_out += n; pStream->avail_out -= n; pStream->total_out += n; 916 | pState->m_dict_avail -= n; pState->m_dict_ofs = (pState->m_dict_ofs + n) & (TINFL_LZ_DICT_SIZE - 1); 917 | return ((pState->m_last_status == TINFL_STATUS_DONE) && (!pState->m_dict_avail)) ? MZ_STREAM_END : MZ_OK; 918 | } 919 | 920 | for ( ; ; ) 921 | { 922 | in_bytes = pStream->avail_in; 923 | out_bytes = TINFL_LZ_DICT_SIZE - pState->m_dict_ofs; 924 | 925 | status = tinfl_decompress(&pState->m_decomp, pStream->next_in, &in_bytes, pState->m_dict, pState->m_dict + pState->m_dict_ofs, &out_bytes, decomp_flags); 926 | pState->m_last_status = status; 927 | 928 | pStream->next_in += (mz_uint)in_bytes; pStream->avail_in -= (mz_uint)in_bytes; 929 | pStream->total_in += (mz_uint)in_bytes; pStream->adler = tinfl_get_adler32(&pState->m_decomp); pStream->crc32 = tinfl_get_crc32(&pState->m_decomp); 930 | 931 | pState->m_dict_avail = (mz_uint)out_bytes; 932 | 933 | n = MZ_MIN(pState->m_dict_avail, pStream->avail_out); 934 | memcpy(pStream->next_out, pState->m_dict + pState->m_dict_ofs, n); 935 | pStream->next_out += n; pStream->avail_out -= n; pStream->total_out += n; 936 | pState->m_dict_avail -= n; pState->m_dict_ofs = (pState->m_dict_ofs + n) & (TINFL_LZ_DICT_SIZE - 1); 937 | 938 | if (status < 0) 939 | return MZ_DATA_ERROR; // Stream is corrupted (there could be some uncompressed data left in the output dictionary - oh well). 940 | else if ((status == TINFL_STATUS_NEEDS_MORE_INPUT) && (!orig_avail_in)) 941 | return MZ_BUF_ERROR; // Signal caller that we can't make forward progress without supplying more input or by setting flush to MZ_FINISH. 942 | else if (flush == MZ_FINISH) 943 | { 944 | // The output buffer MUST be large to hold the remaining uncompressed data when flush==MZ_FINISH. 945 | if (status == TINFL_STATUS_DONE) 946 | return pState->m_dict_avail ? MZ_BUF_ERROR : MZ_STREAM_END; 947 | // 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. 948 | else if (!pStream->avail_out) 949 | return MZ_BUF_ERROR; 950 | } 951 | else if ((status == TINFL_STATUS_DONE) || (!pStream->avail_in) || (!pStream->avail_out) || (pState->m_dict_avail)) 952 | break; 953 | } 954 | 955 | return ((status == TINFL_STATUS_DONE) && (!pState->m_dict_avail)) ? MZ_STREAM_END : MZ_OK; 956 | } 957 | 958 | int mz_inflateEnd(mz_streamp pStream) 959 | { 960 | if (!pStream) 961 | return MZ_STREAM_ERROR; 962 | if (pStream->state) 963 | { 964 | pStream->zfree(pStream->opaque, pStream->state); 965 | pStream->state = NULL; 966 | } 967 | return MZ_OK; 968 | } 969 | 970 | int mz_uncompress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len) 971 | { 972 | mz_stream stream; 973 | int status; 974 | memset(&stream, 0, sizeof(stream)); 975 | 976 | // In case mz_ulong is 64-bits (argh I hate longs). 977 | if ((source_len | *pDest_len) > 0xFFFFFFFFU) return MZ_PARAM_ERROR; 978 | 979 | stream.next_in = pSource; 980 | stream.avail_in = (mz_uint32)source_len; 981 | stream.next_out = pDest; 982 | stream.avail_out = (mz_uint32)*pDest_len; 983 | 984 | status = mz_inflateInit(&stream); 985 | if (status != MZ_OK) 986 | return status; 987 | 988 | status = mz_inflate(&stream, MZ_FINISH); 989 | if (status != MZ_STREAM_END) 990 | { 991 | mz_inflateEnd(&stream); 992 | return ((status == MZ_BUF_ERROR) && (!stream.avail_in)) ? MZ_DATA_ERROR : status; 993 | } 994 | *pDest_len = stream.total_out; 995 | 996 | return mz_inflateEnd(&stream); 997 | } 998 | 999 | const char *mz_error(int err) 1000 | { 1001 | static struct { int m_err; const char *m_pDesc; } s_error_descs[] = 1002 | { 1003 | { MZ_OK, "" }, { MZ_STREAM_END, "stream end" }, { MZ_NEED_DICT, "need dictionary" }, { MZ_ERRNO, "file error" }, { MZ_STREAM_ERROR, "stream error" }, 1004 | { MZ_DATA_ERROR, "data error" }, { MZ_MEM_ERROR, "out of memory" }, { MZ_BUF_ERROR, "buf error" }, { MZ_VERSION_ERROR, "version error" }, { MZ_PARAM_ERROR, "parameter error" } 1005 | }; 1006 | mz_uint i; for (i = 0; i < sizeof(s_error_descs) / sizeof(s_error_descs[0]); ++i) if (s_error_descs[i].m_err == err) return s_error_descs[i].m_pDesc; 1007 | return NULL; 1008 | } 1009 | 1010 | #endif //MINIZ_NO_ZLIB_APIS 1011 | 1012 | // ------------------- Low-level Decompression (completely independent from all compression API's) 1013 | 1014 | #define TINFL_MEMCPY(d, s, l) memcpy(d, s, l) 1015 | #define TINFL_MEMSET(p, c, l) memset(p, c, l) 1016 | 1017 | #define TINFL_CR_BEGIN switch(r->m_state) { case 0: 1018 | #define TINFL_CR_RETURN(state_index, result) do { status = result; r->m_state = state_index; goto common_exit; case state_index:; } MZ_MACRO_END 1019 | #define TINFL_CR_RETURN_FOREVER(state_index, result) do { for ( ; ; ) { TINFL_CR_RETURN(state_index, result); } } MZ_MACRO_END 1020 | #define TINFL_CR_FINISH } 1021 | 1022 | // TODO: If the caller has indicated that there's no more input, and we attempt to read beyond the input buf, then something is wrong with the input because the inflator never 1023 | // reads ahead more than it needs to. Currently TINFL_GET_BYTE() pads the end of the stream with 0's in this scenario. 1024 | #define TINFL_GET_BYTE(state_index, c) do { \ 1025 | if (pIn_buf_cur >= pIn_buf_end) { \ 1026 | for ( ; ; ) { \ 1027 | if (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) { \ 1028 | TINFL_CR_RETURN(state_index, TINFL_STATUS_NEEDS_MORE_INPUT); \ 1029 | if (pIn_buf_cur < pIn_buf_end) { \ 1030 | c = *pIn_buf_cur++; \ 1031 | break; \ 1032 | } \ 1033 | } else { \ 1034 | c = 0; \ 1035 | break; \ 1036 | } \ 1037 | } \ 1038 | } else c = *pIn_buf_cur++; } MZ_MACRO_END 1039 | 1040 | #define TINFL_NEED_BITS(state_index, n) do { mz_uint c; TINFL_GET_BYTE(state_index, c); bit_buf |= (((tinfl_bit_buf_t)c) << num_bits); num_bits += 8; } while (num_bits < (mz_uint)(n)) 1041 | #define TINFL_SKIP_BITS(state_index, n) do { if (num_bits < (mz_uint)(n)) { TINFL_NEED_BITS(state_index, n); } bit_buf >>= (n); num_bits -= (n); } MZ_MACRO_END 1042 | #define TINFL_GET_BITS(state_index, b, n) do { if (num_bits < (mz_uint)(n)) { TINFL_NEED_BITS(state_index, n); } b = bit_buf & ((1 << (n)) - 1); bit_buf >>= (n); num_bits -= (n); } MZ_MACRO_END 1043 | 1044 | // TINFL_HUFF_BITBUF_FILL() is only used rarely, when the number of bytes remaining in the input buffer falls below 2. 1045 | // It reads just enough bytes from the input stream that are needed to decode the next Huffman code (and absolutely no more). It works by trying to fully decode a 1046 | // Huffman code by using whatever bits are currently present in the bit buffer. If this fails, it reads another byte, and tries again until it succeeds or until the 1047 | // bit buffer contains >=15 bits (deflate's max. Huffman code size). 1048 | #define TINFL_HUFF_BITBUF_FILL(state_index, pHuff) \ 1049 | do { \ 1050 | temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]; \ 1051 | if (temp >= 0) { \ 1052 | code_len = temp >> 9; \ 1053 | if ((code_len) && (num_bits >= code_len)) \ 1054 | break; \ 1055 | } else if (num_bits > TINFL_FAST_LOOKUP_BITS) { \ 1056 | code_len = TINFL_FAST_LOOKUP_BITS; \ 1057 | do { \ 1058 | temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)]; \ 1059 | } while ((temp < 0) && (num_bits >= (code_len + 1))); if (temp >= 0) break; \ 1060 | } TINFL_GET_BYTE(state_index, c); bit_buf |= (((tinfl_bit_buf_t)c) << num_bits); num_bits += 8; \ 1061 | } while (num_bits < 15); 1062 | 1063 | // TINFL_HUFF_DECODE() decodes the next Huffman coded symbol. It's more complex than you would initially expect because the zlib API expects the decompressor to never read 1064 | // beyond the final byte of the deflate stream. (In other words, when this macro wants to read another byte from the input, it REALLY needs another byte in order to fully 1065 | // decode the next Huffman code.) Handling this properly is particularly important on raw deflate (non-zlib) streams, which aren't followed by a byte aligned adler-32. 1066 | // The slow path is only executed at the very end of the input buffer. 1067 | #define TINFL_HUFF_DECODE(state_index, sym, pHuff) do { \ 1068 | int temp; mz_uint code_len, c; \ 1069 | if (num_bits < 15) { \ 1070 | if ((pIn_buf_end - pIn_buf_cur) < 2) { \ 1071 | TINFL_HUFF_BITBUF_FILL(state_index, pHuff); \ 1072 | } else { \ 1073 | bit_buf |= (((tinfl_bit_buf_t)pIn_buf_cur[0]) << num_bits) | (((tinfl_bit_buf_t)pIn_buf_cur[1]) << (num_bits + 8)); pIn_buf_cur += 2; num_bits += 16; \ 1074 | } \ 1075 | } \ 1076 | if ((temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0) \ 1077 | code_len = temp >> 9, temp &= 511; \ 1078 | else { \ 1079 | code_len = TINFL_FAST_LOOKUP_BITS; do { temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)]; } while (temp < 0); \ 1080 | } sym = temp; bit_buf >>= code_len; num_bits -= code_len; } MZ_MACRO_END 1081 | 1082 | 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) 1083 | { 1084 | static const int s_length_base[31] = { 3,4,5,6,7,8,9,10,11,13, 15,17,19,23,27,31,35,43,51,59, 67,83,99,115,131,163,195,227,258,0,0 }; 1085 | static const int s_length_extra[31]= { 0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0,0,0 }; 1086 | static const int s_dist_base[32] = { 1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193, 257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0}; 1087 | static const int s_dist_extra[32] = { 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13}; 1088 | static const mz_uint8 s_length_dezigzag[19] = { 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15 }; 1089 | static const int s_min_table_sizes[3] = { 257, 1, 4 }; 1090 | 1091 | tinfl_status status = TINFL_STATUS_FAILED; mz_uint32 num_bits, dist, counter, num_extra; tinfl_bit_buf_t bit_buf; 1092 | const mz_uint8 *pIn_buf_cur = pIn_buf_next, *const pIn_buf_end = pIn_buf_next + *pIn_buf_size; 1093 | mz_uint8 *pOut_buf_cur = pOut_buf_next, *const pOut_buf_end = pOut_buf_next + *pOut_buf_size; 1094 | size_t out_buf_size_mask = (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF) ? (size_t)-1 : ((pOut_buf_next - pOut_buf_start) + *pOut_buf_size) - 1, dist_from_out_buf_start; 1095 | 1096 | // 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). 1097 | 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; } 1098 | 1099 | 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; 1100 | TINFL_CR_BEGIN 1101 | 1102 | bit_buf = num_bits = dist = counter = num_extra = r->m_zhdr0 = r->m_zhdr1 = 0; r->m_z_adler32 = r->m_check_adler32 = 1; 1103 | if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER) 1104 | { 1105 | TINFL_GET_BYTE(1, r->m_zhdr0); TINFL_GET_BYTE(2, r->m_zhdr1); 1106 | counter = (((r->m_zhdr0 * 256 + r->m_zhdr1) % 31 != 0) || (r->m_zhdr1 & 32) || ((r->m_zhdr0 & 15) != 8)); 1107 | if (!(decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF)) counter |= (((1U << (8U + (r->m_zhdr0 >> 4))) > 32768U) || ((out_buf_size_mask + 1) < (size_t)(1U << (8U + (r->m_zhdr0 >> 4))))); 1108 | if (counter) { TINFL_CR_RETURN_FOREVER(36, TINFL_STATUS_FAILED); } 1109 | } 1110 | 1111 | do 1112 | { 1113 | TINFL_GET_BITS(3, r->m_final, 3); r->m_type = r->m_final >> 1; 1114 | if (r->m_type == 0) 1115 | { 1116 | TINFL_SKIP_BITS(5, num_bits & 7); 1117 | for (counter = 0; counter < 4; ++counter) { if (num_bits) TINFL_GET_BITS(6, r->m_raw_header[counter], 8); else TINFL_GET_BYTE(7, r->m_raw_header[counter]); } 1118 | if ((counter = (r->m_raw_header[0] | (r->m_raw_header[1] << 8))) != (mz_uint)(0xFFFF ^ (r->m_raw_header[2] | (r->m_raw_header[3] << 8)))) { TINFL_CR_RETURN_FOREVER(39, TINFL_STATUS_FAILED); } 1119 | while ((counter) && (num_bits)) 1120 | { 1121 | TINFL_GET_BITS(51, dist, 8); 1122 | while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(52, TINFL_STATUS_HAS_MORE_OUTPUT); } 1123 | *pOut_buf_cur++ = (mz_uint8)dist; 1124 | counter--; 1125 | } 1126 | while (counter) 1127 | { 1128 | size_t n; while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(9, TINFL_STATUS_HAS_MORE_OUTPUT); } 1129 | while (pIn_buf_cur >= pIn_buf_end) 1130 | { 1131 | if (decomp_flags & TINFL_FLAG_HAS_MORE_INPUT) 1132 | { 1133 | TINFL_CR_RETURN(38, TINFL_STATUS_NEEDS_MORE_INPUT); 1134 | } 1135 | else 1136 | { 1137 | TINFL_CR_RETURN_FOREVER(40, TINFL_STATUS_FAILED); 1138 | } 1139 | } 1140 | n = MZ_MIN(MZ_MIN((size_t)(pOut_buf_end - pOut_buf_cur), (size_t)(pIn_buf_end - pIn_buf_cur)), counter); 1141 | TINFL_MEMCPY(pOut_buf_cur, pIn_buf_cur, n); pIn_buf_cur += n; pOut_buf_cur += n; counter -= (mz_uint)n; 1142 | } 1143 | } 1144 | else if (r->m_type == 3) 1145 | { 1146 | TINFL_CR_RETURN_FOREVER(10, TINFL_STATUS_FAILED); 1147 | } 1148 | else 1149 | { 1150 | if (r->m_type == 1) 1151 | { 1152 | mz_uint8 *p = r->m_tables[0].m_code_size; mz_uint i; 1153 | r->m_table_sizes[0] = 288; r->m_table_sizes[1] = 32; TINFL_MEMSET(r->m_tables[1].m_code_size, 5, 32); 1154 | 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; 1155 | } 1156 | else 1157 | { 1158 | for (counter = 0; counter < 3; counter++) { TINFL_GET_BITS(11, r->m_table_sizes[counter], "\05\05\04"[counter]); r->m_table_sizes[counter] += s_min_table_sizes[counter]; } 1159 | MZ_CLEAR_OBJ(r->m_tables[2].m_code_size); for (counter = 0; counter < r->m_table_sizes[2]; counter++) { mz_uint s; TINFL_GET_BITS(14, s, 3); r->m_tables[2].m_code_size[s_length_dezigzag[counter]] = (mz_uint8)s; } 1160 | r->m_table_sizes[2] = 19; 1161 | } 1162 | for ( ; (int)r->m_type >= 0; r->m_type--) 1163 | { 1164 | int tree_next, tree_cur; tinfl_huff_table *pTable; 1165 | mz_uint i, j, used_syms, total, sym_index, next_code[17], total_syms[16]; pTable = &r->m_tables[r->m_type]; MZ_CLEAR_OBJ(total_syms); MZ_CLEAR_OBJ(pTable->m_look_up); MZ_CLEAR_OBJ(pTable->m_tree); 1166 | for (i = 0; i < r->m_table_sizes[r->m_type]; ++i) total_syms[pTable->m_code_size[i]]++; 1167 | used_syms = 0, total = 0; next_code[0] = next_code[1] = 0; 1168 | for (i = 1; i <= 15; ++i) { used_syms += total_syms[i]; next_code[i + 1] = (total = ((total + total_syms[i]) << 1)); } 1169 | if ((65536 != total) && (used_syms > 1)) 1170 | { 1171 | TINFL_CR_RETURN_FOREVER(35, TINFL_STATUS_FAILED); 1172 | } 1173 | for (tree_next = -1, sym_index = 0; sym_index < r->m_table_sizes[r->m_type]; ++sym_index) 1174 | { 1175 | mz_uint rev_code = 0, l, cur_code, code_size = pTable->m_code_size[sym_index]; if (!code_size) continue; 1176 | cur_code = next_code[code_size]++; for (l = code_size; l > 0; l--, cur_code >>= 1) rev_code = (rev_code << 1) | (cur_code & 1); 1177 | if (code_size <= TINFL_FAST_LOOKUP_BITS) { mz_int16 k = (mz_int16)((code_size << 9) | sym_index); while (rev_code < TINFL_FAST_LOOKUP_SIZE) { pTable->m_look_up[rev_code] = k; rev_code += (1 << code_size); } continue; } 1178 | if (0 == (tree_cur = pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)])) { pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = (mz_int16)tree_next; tree_cur = tree_next; tree_next -= 2; } 1179 | rev_code >>= (TINFL_FAST_LOOKUP_BITS - 1); 1180 | for (j = code_size; j > (TINFL_FAST_LOOKUP_BITS + 1); j--) 1181 | { 1182 | tree_cur -= ((rev_code >>= 1) & 1); 1183 | if (!pTable->m_tree[-tree_cur - 1]) { pTable->m_tree[-tree_cur - 1] = (mz_int16)tree_next; tree_cur = tree_next; tree_next -= 2; } else tree_cur = pTable->m_tree[-tree_cur - 1]; 1184 | } 1185 | tree_cur -= ((rev_code >>= 1) & 1); pTable->m_tree[-tree_cur - 1] = (mz_int16)sym_index; 1186 | } 1187 | if (r->m_type == 2) 1188 | { 1189 | for (counter = 0; counter < (r->m_table_sizes[0] + r->m_table_sizes[1]); ) 1190 | { 1191 | mz_uint s; TINFL_HUFF_DECODE(16, dist, &r->m_tables[2]); if (dist < 16) { r->m_len_codes[counter++] = (mz_uint8)dist; continue; } 1192 | if ((dist == 16) && (!counter)) 1193 | { 1194 | TINFL_CR_RETURN_FOREVER(17, TINFL_STATUS_FAILED); 1195 | } 1196 | num_extra = "\02\03\07"[dist - 16]; TINFL_GET_BITS(18, s, num_extra); s += "\03\03\013"[dist - 16]; 1197 | TINFL_MEMSET(r->m_len_codes + counter, (dist == 16) ? r->m_len_codes[counter - 1] : 0, s); counter += s; 1198 | } 1199 | if ((r->m_table_sizes[0] + r->m_table_sizes[1]) != counter) 1200 | { 1201 | TINFL_CR_RETURN_FOREVER(21, TINFL_STATUS_FAILED); 1202 | } 1203 | TINFL_MEMCPY(r->m_tables[0].m_code_size, r->m_len_codes, r->m_table_sizes[0]); TINFL_MEMCPY(r->m_tables[1].m_code_size, r->m_len_codes + r->m_table_sizes[0], r->m_table_sizes[1]); 1204 | } 1205 | } 1206 | for ( ; ; ) 1207 | { 1208 | mz_uint8 *pSrc; 1209 | for ( ; ; ) 1210 | { 1211 | if (((pIn_buf_end - pIn_buf_cur) < 4) || ((pOut_buf_end - pOut_buf_cur) < 2)) 1212 | { 1213 | TINFL_HUFF_DECODE(23, counter, &r->m_tables[0]); 1214 | if (counter >= 256) 1215 | break; 1216 | while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(24, TINFL_STATUS_HAS_MORE_OUTPUT); } 1217 | *pOut_buf_cur++ = (mz_uint8)counter; 1218 | } 1219 | else 1220 | { 1221 | int sym2; mz_uint code_len; 1222 | #if TINFL_USE_64BIT_BITBUF 1223 | if (num_bits < 30) { bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE32(pIn_buf_cur)) << num_bits); pIn_buf_cur += 4; num_bits += 32; } 1224 | #else 1225 | if (num_bits < 15) { bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE16(pIn_buf_cur)) << num_bits); pIn_buf_cur += 2; num_bits += 16; } 1226 | #endif 1227 | if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0) 1228 | code_len = sym2 >> 9; 1229 | else 1230 | { 1231 | code_len = TINFL_FAST_LOOKUP_BITS; do { sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)]; } while (sym2 < 0); 1232 | } 1233 | counter = sym2; bit_buf >>= code_len; num_bits -= code_len; 1234 | if (counter & 256) 1235 | break; 1236 | 1237 | #if !TINFL_USE_64BIT_BITBUF 1238 | if (num_bits < 15) { bit_buf |= (((tinfl_bit_buf_t)MZ_READ_LE16(pIn_buf_cur)) << num_bits); pIn_buf_cur += 2; num_bits += 16; } 1239 | #endif 1240 | if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0) 1241 | code_len = sym2 >> 9; 1242 | else 1243 | { 1244 | code_len = TINFL_FAST_LOOKUP_BITS; do { sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)]; } while (sym2 < 0); 1245 | } 1246 | bit_buf >>= code_len; num_bits -= code_len; 1247 | 1248 | pOut_buf_cur[0] = (mz_uint8)counter; 1249 | if (sym2 & 256) 1250 | { 1251 | pOut_buf_cur++; 1252 | counter = sym2; 1253 | break; 1254 | } 1255 | pOut_buf_cur[1] = (mz_uint8)sym2; 1256 | pOut_buf_cur += 2; 1257 | } 1258 | } 1259 | if ((counter &= 511) == 256) break; 1260 | 1261 | num_extra = s_length_extra[counter - 257]; counter = s_length_base[counter - 257]; 1262 | if (num_extra) { mz_uint extra_bits; TINFL_GET_BITS(25, extra_bits, num_extra); counter += extra_bits; } 1263 | 1264 | TINFL_HUFF_DECODE(26, dist, &r->m_tables[1]); 1265 | num_extra = s_dist_extra[dist]; dist = s_dist_base[dist]; 1266 | if (num_extra) { mz_uint extra_bits; TINFL_GET_BITS(27, extra_bits, num_extra); dist += extra_bits; } 1267 | 1268 | dist_from_out_buf_start = pOut_buf_cur - pOut_buf_start; 1269 | if ((dist > dist_from_out_buf_start) && (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF)) 1270 | { 1271 | TINFL_CR_RETURN_FOREVER(37, TINFL_STATUS_FAILED); 1272 | } 1273 | 1274 | pSrc = pOut_buf_start + ((dist_from_out_buf_start - dist) & out_buf_size_mask); 1275 | 1276 | if ((MZ_MAX(pOut_buf_cur, pSrc) + counter) > pOut_buf_end) 1277 | { 1278 | while (counter--) 1279 | { 1280 | while (pOut_buf_cur >= pOut_buf_end) { TINFL_CR_RETURN(53, TINFL_STATUS_HAS_MORE_OUTPUT); } 1281 | *pOut_buf_cur++ = pOut_buf_start[(dist_from_out_buf_start++ - dist) & out_buf_size_mask]; 1282 | } 1283 | continue; 1284 | } 1285 | #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1286 | else if ((counter >= 9) && (counter <= dist)) 1287 | { 1288 | const mz_uint8 *pSrc_end = pSrc + (counter & ~7); 1289 | do 1290 | { 1291 | ((mz_uint32 *)pOut_buf_cur)[0] = ((const mz_uint32 *)pSrc)[0]; 1292 | ((mz_uint32 *)pOut_buf_cur)[1] = ((const mz_uint32 *)pSrc)[1]; 1293 | pOut_buf_cur += 8; 1294 | } while ((pSrc += 8) < pSrc_end); 1295 | if ((counter &= 7) < 3) 1296 | { 1297 | if (counter) 1298 | { 1299 | pOut_buf_cur[0] = pSrc[0]; 1300 | if (counter > 1) 1301 | pOut_buf_cur[1] = pSrc[1]; 1302 | pOut_buf_cur += counter; 1303 | } 1304 | continue; 1305 | } 1306 | } 1307 | #endif 1308 | do 1309 | { 1310 | pOut_buf_cur[0] = pSrc[0]; 1311 | pOut_buf_cur[1] = pSrc[1]; 1312 | pOut_buf_cur[2] = pSrc[2]; 1313 | pOut_buf_cur += 3; pSrc += 3; 1314 | } while ((int)(counter -= 3) > 2); 1315 | if ((int)counter > 0) 1316 | { 1317 | pOut_buf_cur[0] = pSrc[0]; 1318 | if ((int)counter > 1) 1319 | pOut_buf_cur[1] = pSrc[1]; 1320 | pOut_buf_cur += counter; 1321 | } 1322 | } 1323 | } 1324 | } while (!(r->m_final & 1)); 1325 | if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER) 1326 | { 1327 | TINFL_SKIP_BITS(32, num_bits & 7); for (counter = 0; counter < 4; ++counter) { mz_uint s; if (num_bits) TINFL_GET_BITS(41, s, 8); else TINFL_GET_BYTE(42, s); r->m_z_adler32 = (r->m_z_adler32 << 8) | s; } 1328 | } 1329 | TINFL_CR_RETURN_FOREVER(34, TINFL_STATUS_DONE); 1330 | TINFL_CR_FINISH 1331 | 1332 | common_exit: 1333 | r->m_num_bits = num_bits; r->m_bit_buf = bit_buf; r->m_dist = dist; r->m_counter = counter; r->m_num_extra = num_extra; r->m_dist_from_out_buf_start = dist_from_out_buf_start; 1334 | *pIn_buf_size = pIn_buf_cur - pIn_buf_next; *pOut_buf_size = pOut_buf_cur - pOut_buf_next; 1335 | if ((decomp_flags & (TINFL_FLAG_PARSE_ZLIB_HEADER | TINFL_FLAG_COMPUTE_ADLER32)) && (status >= 0)) 1336 | { 1337 | const mz_uint8 *ptr = pOut_buf_next; size_t buf_len = *pOut_buf_size; 1338 | mz_uint32 i, s1 = r->m_check_adler32 & 0xffff, s2 = r->m_check_adler32 >> 16; size_t block_len = buf_len % 5552; 1339 | while (buf_len) 1340 | { 1341 | for (i = 0; i + 7 < block_len; i += 8, ptr += 8) 1342 | { 1343 | s1 += ptr[0], s2 += s1; s1 += ptr[1], s2 += s1; s1 += ptr[2], s2 += s1; s1 += ptr[3], s2 += s1; 1344 | s1 += ptr[4], s2 += s1; s1 += ptr[5], s2 += s1; s1 += ptr[6], s2 += s1; s1 += ptr[7], s2 += s1; 1345 | } 1346 | for ( ; i < block_len; ++i) s1 += *ptr++, s2 += s1; 1347 | s1 %= 65521U, s2 %= 65521U; buf_len -= block_len; block_len = 5552; 1348 | } 1349 | 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; 1350 | } 1351 | return status; 1352 | } 1353 | 1354 | // Higher level helper functions. 1355 | void *tinfl_decompress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags) 1356 | { 1357 | tinfl_decompressor decomp; void *pBuf = NULL, *pNew_buf; size_t src_buf_ofs = 0, out_buf_capacity = 0; 1358 | *pOut_len = 0; 1359 | tinfl_init(&decomp); 1360 | for ( ; ; ) 1361 | { 1362 | size_t src_buf_size = src_buf_len - src_buf_ofs, dst_buf_size = out_buf_capacity - *pOut_len, new_out_buf_capacity; 1363 | tinfl_status status = tinfl_decompress(&decomp, (const mz_uint8*)pSrc_buf + src_buf_ofs, &src_buf_size, (mz_uint8*)pBuf, pBuf ? (mz_uint8*)pBuf + *pOut_len : NULL, &dst_buf_size, 1364 | (flags & ~TINFL_FLAG_HAS_MORE_INPUT) | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF); 1365 | if ((status < 0) || (status == TINFL_STATUS_NEEDS_MORE_INPUT)) 1366 | { 1367 | MZ_FREE(pBuf); *pOut_len = 0; return NULL; 1368 | } 1369 | src_buf_ofs += src_buf_size; 1370 | *pOut_len += dst_buf_size; 1371 | if (status == TINFL_STATUS_DONE) break; 1372 | new_out_buf_capacity = out_buf_capacity * 2; if (new_out_buf_capacity < 128) new_out_buf_capacity = 128; 1373 | pNew_buf = MZ_REALLOC(pBuf, new_out_buf_capacity); 1374 | if (!pNew_buf) 1375 | { 1376 | MZ_FREE(pBuf); *pOut_len = 0; return NULL; 1377 | } 1378 | pBuf = pNew_buf; out_buf_capacity = new_out_buf_capacity; 1379 | } 1380 | return pBuf; 1381 | } 1382 | 1383 | 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) 1384 | { 1385 | tinfl_decompressor decomp; tinfl_status status; tinfl_init(&decomp); 1386 | status = tinfl_decompress(&decomp, (const mz_uint8*)pSrc_buf, &src_buf_len, (mz_uint8*)pOut_buf, (mz_uint8*)pOut_buf, &out_buf_len, (flags & ~TINFL_FLAG_HAS_MORE_INPUT) | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF); 1387 | return (status != TINFL_STATUS_DONE) ? TINFL_DECOMPRESS_MEM_TO_MEM_FAILED : out_buf_len; 1388 | } 1389 | 1390 | 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) 1391 | { 1392 | int result = 0; 1393 | tinfl_decompressor decomp; 1394 | mz_uint8 *pDict = (mz_uint8*)MZ_MALLOC(TINFL_LZ_DICT_SIZE); size_t in_buf_ofs = 0, dict_ofs = 0; 1395 | if (!pDict) 1396 | return TINFL_STATUS_FAILED; 1397 | tinfl_init(&decomp); 1398 | for ( ; ; ) 1399 | { 1400 | size_t in_buf_size = *pIn_buf_size - in_buf_ofs, dst_buf_size = TINFL_LZ_DICT_SIZE - dict_ofs; 1401 | tinfl_status status = tinfl_decompress(&decomp, (const mz_uint8*)pIn_buf + in_buf_ofs, &in_buf_size, pDict, pDict + dict_ofs, &dst_buf_size, 1402 | (flags & ~(TINFL_FLAG_HAS_MORE_INPUT | TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF))); 1403 | in_buf_ofs += in_buf_size; 1404 | if ((dst_buf_size) && (!(*pPut_buf_func)(pDict + dict_ofs, (int)dst_buf_size, pPut_buf_user))) 1405 | break; 1406 | if (status != TINFL_STATUS_HAS_MORE_OUTPUT) 1407 | { 1408 | result = (status == TINFL_STATUS_DONE); 1409 | break; 1410 | } 1411 | dict_ofs = (dict_ofs + dst_buf_size) & (TINFL_LZ_DICT_SIZE - 1); 1412 | } 1413 | MZ_FREE(pDict); 1414 | *pIn_buf_size = in_buf_ofs; 1415 | return result; 1416 | } 1417 | 1418 | // ------------------- Low-level Compression (independent from all decompression API's) 1419 | 1420 | // Purposely making these tables static for faster init and thread safety. 1421 | static const mz_uint16 s_tdefl_len_sym[256] = { 1422 | 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, 1423 | 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, 1424 | 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, 1425 | 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, 1426 | 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, 1427 | 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, 1428 | 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, 1429 | 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 }; 1430 | 1431 | static const mz_uint8 s_tdefl_len_extra[256] = { 1432 | 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, 1433 | 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, 1434 | 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, 1435 | 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 }; 1436 | 1437 | static const mz_uint8 s_tdefl_small_dist_sym[512] = { 1438 | 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, 1439 | 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, 1440 | 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, 1441 | 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, 1442 | 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, 1443 | 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, 1444 | 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, 1445 | 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, 1446 | 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, 1447 | 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, 1448 | 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, 1449 | 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 }; 1450 | 1451 | static const mz_uint8 s_tdefl_small_dist_extra[512] = { 1452 | 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, 1453 | 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, 1454 | 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, 1455 | 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, 1456 | 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, 1457 | 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, 1458 | 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, 1459 | 7,7,7,7,7,7,7,7 }; 1460 | 1461 | static const mz_uint8 s_tdefl_large_dist_sym[128] = { 1462 | 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, 1463 | 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, 1464 | 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 }; 1465 | 1466 | static const mz_uint8 s_tdefl_large_dist_extra[128] = { 1467 | 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, 1468 | 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, 1469 | 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 }; 1470 | 1471 | // Radix sorts tdefl_sym_freq[] array by 16-bit key m_key. Returns ptr to sorted values. 1472 | typedef struct { mz_uint16 m_key, m_sym_index; } tdefl_sym_freq; 1473 | static tdefl_sym_freq* tdefl_radix_sort_syms(mz_uint num_syms, tdefl_sym_freq* pSyms0, tdefl_sym_freq* pSyms1) 1474 | { 1475 | mz_uint32 total_passes = 2, pass_shift, pass, i, hist[256 * 2]; tdefl_sym_freq* pCur_syms = pSyms0, *pNew_syms = pSyms1; MZ_CLEAR_OBJ(hist); 1476 | for (i = 0; i < num_syms; i++) { mz_uint freq = pSyms0[i].m_key; hist[freq & 0xFF]++; hist[256 + ((freq >> 8) & 0xFF)]++; } 1477 | while ((total_passes > 1) && (num_syms == hist[(total_passes - 1) * 256])) total_passes--; 1478 | for (pass_shift = 0, pass = 0; pass < total_passes; pass++, pass_shift += 8) 1479 | { 1480 | const mz_uint32* pHist = &hist[pass << 8]; 1481 | mz_uint offsets[256], cur_ofs = 0; 1482 | for (i = 0; i < 256; i++) { offsets[i] = cur_ofs; cur_ofs += pHist[i]; } 1483 | for (i = 0; i < num_syms; i++) pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] = pCur_syms[i]; 1484 | { tdefl_sym_freq* t = pCur_syms; pCur_syms = pNew_syms; pNew_syms = t; } 1485 | } 1486 | return pCur_syms; 1487 | } 1488 | 1489 | // tdefl_calculate_minimum_redundancy() originally written by: Alistair Moffat, alistair@cs.mu.oz.au, Jyrki Katajainen, jyrki@diku.dk, November 1996. 1490 | static void tdefl_calculate_minimum_redundancy(tdefl_sym_freq *A, int n) 1491 | { 1492 | int root, leaf, next, avbl, used, dpth; 1493 | if (n==0) return; else if (n==1) { A[0].m_key = 1; return; } 1494 | A[0].m_key += A[1].m_key; root = 0; leaf = 2; 1495 | for (next=1; next < n-1; next++) 1496 | { 1497 | if (leaf>=n || A[root].m_key=n || (root=0; next--) A[next].m_key = A[A[next].m_key].m_key+1; 1501 | avbl = 1; used = dpth = 0; root = n-2; next = n-1; 1502 | while (avbl>0) 1503 | { 1504 | while (root>=0 && (int)A[root].m_key==dpth) { used++; root--; } 1505 | while (avbl>used) { A[next--].m_key = (mz_uint16)(dpth); avbl--; } 1506 | avbl = 2*used; dpth++; used = 0; 1507 | } 1508 | } 1509 | 1510 | // Limits canonical Huffman code table's max code size. 1511 | enum { TDEFL_MAX_SUPPORTED_HUFF_CODESIZE = 32 }; 1512 | static void tdefl_huffman_enforce_max_code_size(int *pNum_codes, int code_list_len, int max_code_size) 1513 | { 1514 | int i; mz_uint32 total = 0; if (code_list_len <= 1) return; 1515 | for (i = max_code_size + 1; i <= TDEFL_MAX_SUPPORTED_HUFF_CODESIZE; i++) pNum_codes[max_code_size] += pNum_codes[i]; 1516 | for (i = max_code_size; i > 0; i--) total += (((mz_uint32)pNum_codes[i]) << (max_code_size - i)); 1517 | while (total != (1UL << max_code_size)) 1518 | { 1519 | pNum_codes[max_code_size]--; 1520 | for (i = max_code_size - 1; i > 0; i--) if (pNum_codes[i]) { pNum_codes[i]--; pNum_codes[i + 1] += 2; break; } 1521 | total--; 1522 | } 1523 | } 1524 | 1525 | static void tdefl_optimize_huffman_table(tdefl_compressor *d, int table_num, int table_len, int code_size_limit, int static_table) 1526 | { 1527 | int i, j, l, num_codes[1 + TDEFL_MAX_SUPPORTED_HUFF_CODESIZE]; mz_uint next_code[TDEFL_MAX_SUPPORTED_HUFF_CODESIZE + 1]; MZ_CLEAR_OBJ(num_codes); 1528 | if (static_table) 1529 | { 1530 | for (i = 0; i < table_len; i++) num_codes[d->m_huff_code_sizes[table_num][i]]++; 1531 | } 1532 | else 1533 | { 1534 | tdefl_sym_freq syms0[TDEFL_MAX_HUFF_SYMBOLS], syms1[TDEFL_MAX_HUFF_SYMBOLS], *pSyms; 1535 | int num_used_syms = 0; 1536 | const mz_uint16 *pSym_count = &d->m_huff_count[table_num][0]; 1537 | for (i = 0; i < table_len; i++) if (pSym_count[i]) { syms0[num_used_syms].m_key = (mz_uint16)pSym_count[i]; syms0[num_used_syms++].m_sym_index = (mz_uint16)i; } 1538 | 1539 | pSyms = tdefl_radix_sort_syms(num_used_syms, syms0, syms1); tdefl_calculate_minimum_redundancy(pSyms, num_used_syms); 1540 | 1541 | for (i = 0; i < num_used_syms; i++) num_codes[pSyms[i].m_key]++; 1542 | 1543 | tdefl_huffman_enforce_max_code_size(num_codes, num_used_syms, code_size_limit); 1544 | 1545 | MZ_CLEAR_OBJ(d->m_huff_code_sizes[table_num]); MZ_CLEAR_OBJ(d->m_huff_codes[table_num]); 1546 | for (i = 1, j = num_used_syms; i <= code_size_limit; i++) 1547 | for (l = num_codes[i]; l > 0; l--) d->m_huff_code_sizes[table_num][pSyms[--j].m_sym_index] = (mz_uint8)(i); 1548 | } 1549 | 1550 | next_code[1] = 0; for (j = 0, i = 2; i <= code_size_limit; i++) next_code[i] = j = ((j + num_codes[i - 1]) << 1); 1551 | 1552 | for (i = 0; i < table_len; i++) 1553 | { 1554 | mz_uint rev_code = 0, code, code_size; if ((code_size = d->m_huff_code_sizes[table_num][i]) == 0) continue; 1555 | code = next_code[code_size]++; for (l = code_size; l > 0; l--, code >>= 1) rev_code = (rev_code << 1) | (code & 1); 1556 | d->m_huff_codes[table_num][i] = (mz_uint16)rev_code; 1557 | } 1558 | } 1559 | 1560 | #define TDEFL_PUT_BITS(b, l) do { \ 1561 | mz_uint bits = b; mz_uint len = l; MZ_ASSERT(bits <= ((1U << len) - 1U)); \ 1562 | d->m_bit_buffer |= (bits << d->m_bits_in); d->m_bits_in += len; \ 1563 | while (d->m_bits_in >= 8) { \ 1564 | if (d->m_pOutput_buf < d->m_pOutput_buf_end) \ 1565 | *d->m_pOutput_buf++ = (mz_uint8)(d->m_bit_buffer); \ 1566 | d->m_bit_buffer >>= 8; \ 1567 | d->m_bits_in -= 8; \ 1568 | } \ 1569 | } MZ_MACRO_END 1570 | 1571 | #define TDEFL_RLE_PREV_CODE_SIZE() { if (rle_repeat_count) { \ 1572 | if (rle_repeat_count < 3) { \ 1573 | d->m_huff_count[2][prev_code_size] = (mz_uint16)(d->m_huff_count[2][prev_code_size] + rle_repeat_count); \ 1574 | while (rle_repeat_count--) packed_code_sizes[num_packed_code_sizes++] = prev_code_size; \ 1575 | } else { \ 1576 | d->m_huff_count[2][16] = (mz_uint16)(d->m_huff_count[2][16] + 1); packed_code_sizes[num_packed_code_sizes++] = 16; packed_code_sizes[num_packed_code_sizes++] = (mz_uint8)(rle_repeat_count - 3); \ 1577 | } rle_repeat_count = 0; } } 1578 | 1579 | #define TDEFL_RLE_ZERO_CODE_SIZE() { if (rle_z_count) { \ 1580 | if (rle_z_count < 3) { \ 1581 | d->m_huff_count[2][0] = (mz_uint16)(d->m_huff_count[2][0] + rle_z_count); while (rle_z_count--) packed_code_sizes[num_packed_code_sizes++] = 0; \ 1582 | } else if (rle_z_count <= 10) { \ 1583 | d->m_huff_count[2][17] = (mz_uint16)(d->m_huff_count[2][17] + 1); packed_code_sizes[num_packed_code_sizes++] = 17; packed_code_sizes[num_packed_code_sizes++] = (mz_uint8)(rle_z_count - 3); \ 1584 | } else { \ 1585 | d->m_huff_count[2][18] = (mz_uint16)(d->m_huff_count[2][18] + 1); packed_code_sizes[num_packed_code_sizes++] = 18; packed_code_sizes[num_packed_code_sizes++] = (mz_uint8)(rle_z_count - 11); \ 1586 | } rle_z_count = 0; } } 1587 | 1588 | static mz_uint8 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 }; 1589 | 1590 | static void tdefl_start_dynamic_block(tdefl_compressor *d) 1591 | { 1592 | 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; 1593 | mz_uint8 code_sizes_to_pack[TDEFL_MAX_HUFF_SYMBOLS_0 + TDEFL_MAX_HUFF_SYMBOLS_1], packed_code_sizes[TDEFL_MAX_HUFF_SYMBOLS_0 + TDEFL_MAX_HUFF_SYMBOLS_1], prev_code_size = 0xFF; 1594 | 1595 | d->m_huff_count[0][256] = 1; 1596 | 1597 | tdefl_optimize_huffman_table(d, 0, TDEFL_MAX_HUFF_SYMBOLS_0, 15, MZ_FALSE); 1598 | tdefl_optimize_huffman_table(d, 1, TDEFL_MAX_HUFF_SYMBOLS_1, 15, MZ_FALSE); 1599 | 1600 | for (num_lit_codes = 286; num_lit_codes > 257; num_lit_codes--) if (d->m_huff_code_sizes[0][num_lit_codes - 1]) break; 1601 | for (num_dist_codes = 30; num_dist_codes > 1; num_dist_codes--) if (d->m_huff_code_sizes[1][num_dist_codes - 1]) break; 1602 | 1603 | memcpy(code_sizes_to_pack, &d->m_huff_code_sizes[0][0], num_lit_codes); 1604 | memcpy(code_sizes_to_pack + num_lit_codes, &d->m_huff_code_sizes[1][0], num_dist_codes); 1605 | total_code_sizes_to_pack = num_lit_codes + num_dist_codes; num_packed_code_sizes = 0; rle_z_count = 0; rle_repeat_count = 0; 1606 | 1607 | memset(&d->m_huff_count[2][0], 0, sizeof(d->m_huff_count[2][0]) * TDEFL_MAX_HUFF_SYMBOLS_2); 1608 | for (i = 0; i < total_code_sizes_to_pack; i++) 1609 | { 1610 | mz_uint8 code_size = code_sizes_to_pack[i]; 1611 | if (!code_size) 1612 | { 1613 | TDEFL_RLE_PREV_CODE_SIZE(); 1614 | if (++rle_z_count == 138) { TDEFL_RLE_ZERO_CODE_SIZE(); } 1615 | } 1616 | else 1617 | { 1618 | TDEFL_RLE_ZERO_CODE_SIZE(); 1619 | if (code_size != prev_code_size) 1620 | { 1621 | TDEFL_RLE_PREV_CODE_SIZE(); 1622 | d->m_huff_count[2][code_size] = (mz_uint16)(d->m_huff_count[2][code_size] + 1); packed_code_sizes[num_packed_code_sizes++] = code_size; 1623 | } 1624 | else if (++rle_repeat_count == 6) 1625 | { 1626 | TDEFL_RLE_PREV_CODE_SIZE(); 1627 | } 1628 | } 1629 | prev_code_size = code_size; 1630 | } 1631 | if (rle_repeat_count) { TDEFL_RLE_PREV_CODE_SIZE(); } else { TDEFL_RLE_ZERO_CODE_SIZE(); } 1632 | 1633 | tdefl_optimize_huffman_table(d, 2, TDEFL_MAX_HUFF_SYMBOLS_2, 7, MZ_FALSE); 1634 | 1635 | TDEFL_PUT_BITS(2, 2); 1636 | 1637 | TDEFL_PUT_BITS(num_lit_codes - 257, 5); 1638 | TDEFL_PUT_BITS(num_dist_codes - 1, 5); 1639 | 1640 | 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; 1641 | num_bit_lengths = MZ_MAX(4, (num_bit_lengths + 1)); TDEFL_PUT_BITS(num_bit_lengths - 4, 4); 1642 | for (i = 0; (int)i < num_bit_lengths; i++) TDEFL_PUT_BITS(d->m_huff_code_sizes[2][s_tdefl_packed_code_size_syms_swizzle[i]], 3); 1643 | 1644 | for (packed_code_sizes_index = 0; packed_code_sizes_index < num_packed_code_sizes; ) 1645 | { 1646 | mz_uint code = packed_code_sizes[packed_code_sizes_index++]; MZ_ASSERT(code < TDEFL_MAX_HUFF_SYMBOLS_2); 1647 | TDEFL_PUT_BITS(d->m_huff_codes[2][code], d->m_huff_code_sizes[2][code]); 1648 | if (code >= 16) TDEFL_PUT_BITS(packed_code_sizes[packed_code_sizes_index++], "\02\03\07"[code - 16]); 1649 | } 1650 | } 1651 | 1652 | static void tdefl_start_static_block(tdefl_compressor *d) 1653 | { 1654 | mz_uint i; 1655 | mz_uint8 *p = &d->m_huff_code_sizes[0][0]; 1656 | 1657 | for (i = 0; i <= 143; ++i) *p++ = 8; 1658 | for ( ; i <= 255; ++i) *p++ = 9; 1659 | for ( ; i <= 279; ++i) *p++ = 7; 1660 | for ( ; i <= 287; ++i) *p++ = 8; 1661 | 1662 | memset(d->m_huff_code_sizes[1], 5, 32); 1663 | 1664 | tdefl_optimize_huffman_table(d, 0, 288, 15, MZ_TRUE); 1665 | tdefl_optimize_huffman_table(d, 1, 32, 15, MZ_TRUE); 1666 | 1667 | TDEFL_PUT_BITS(1, 2); 1668 | } 1669 | 1670 | static const mz_uint mz_bitmasks[17] = { 0x0000, 0x0001, 0x0003, 0x0007, 0x000F, 0x001F, 0x003F, 0x007F, 0x00FF, 0x01FF, 0x03FF, 0x07FF, 0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF }; 1671 | 1672 | #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN && MINIZ_HAS_64BIT_REGISTERS 1673 | static mz_bool tdefl_compress_lz_codes(tdefl_compressor *d) 1674 | { 1675 | mz_uint flags; 1676 | mz_uint8 *pLZ_codes; 1677 | mz_uint8 *pOutput_buf = d->m_pOutput_buf; 1678 | mz_uint8 *pLZ_code_buf_end = d->m_pLZ_code_buf; 1679 | mz_uint64 bit_buffer = d->m_bit_buffer; 1680 | mz_uint bits_in = d->m_bits_in; 1681 | 1682 | #define TDEFL_PUT_BITS_FAST(b, l) { bit_buffer |= (((mz_uint64)(b)) << bits_in); bits_in += (l); } 1683 | 1684 | flags = 1; 1685 | for (pLZ_codes = d->m_lz_code_buf; pLZ_codes < pLZ_code_buf_end; flags >>= 1) 1686 | { 1687 | if (flags == 1) 1688 | flags = *pLZ_codes++ | 0x100; 1689 | 1690 | if (flags & 1) 1691 | { 1692 | mz_uint s0, s1, n0, n1, sym, num_extra_bits; 1693 | mz_uint match_len = pLZ_codes[0], match_dist = *(const mz_uint16 *)(pLZ_codes + 1); pLZ_codes += 3; 1694 | 1695 | MZ_ASSERT(d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]); 1696 | TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][s_tdefl_len_sym[match_len]], d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]); 1697 | TDEFL_PUT_BITS_FAST(match_len & mz_bitmasks[s_tdefl_len_extra[match_len]], s_tdefl_len_extra[match_len]); 1698 | 1699 | // This sequence coaxes MSVC into using cmov's vs. jmp's. 1700 | s0 = s_tdefl_small_dist_sym[match_dist & 511]; 1701 | n0 = s_tdefl_small_dist_extra[match_dist & 511]; 1702 | s1 = s_tdefl_large_dist_sym[match_dist >> 8]; 1703 | n1 = s_tdefl_large_dist_extra[match_dist >> 8]; 1704 | sym = (match_dist < 512) ? s0 : s1; 1705 | num_extra_bits = (match_dist < 512) ? n0 : n1; 1706 | 1707 | MZ_ASSERT(d->m_huff_code_sizes[1][sym]); 1708 | TDEFL_PUT_BITS_FAST(d->m_huff_codes[1][sym], d->m_huff_code_sizes[1][sym]); 1709 | TDEFL_PUT_BITS_FAST(match_dist & mz_bitmasks[num_extra_bits], num_extra_bits); 1710 | } 1711 | else 1712 | { 1713 | mz_uint lit = *pLZ_codes++; 1714 | MZ_ASSERT(d->m_huff_code_sizes[0][lit]); 1715 | TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]); 1716 | 1717 | if (((flags & 2) == 0) && (pLZ_codes < pLZ_code_buf_end)) 1718 | { 1719 | flags >>= 1; 1720 | lit = *pLZ_codes++; 1721 | MZ_ASSERT(d->m_huff_code_sizes[0][lit]); 1722 | TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]); 1723 | 1724 | if (((flags & 2) == 0) && (pLZ_codes < pLZ_code_buf_end)) 1725 | { 1726 | flags >>= 1; 1727 | lit = *pLZ_codes++; 1728 | MZ_ASSERT(d->m_huff_code_sizes[0][lit]); 1729 | TDEFL_PUT_BITS_FAST(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]); 1730 | } 1731 | } 1732 | } 1733 | 1734 | if (pOutput_buf >= d->m_pOutput_buf_end) 1735 | return MZ_FALSE; 1736 | 1737 | *(mz_uint64*)pOutput_buf = bit_buffer; 1738 | pOutput_buf += (bits_in >> 3); 1739 | bit_buffer >>= (bits_in & ~7); 1740 | bits_in &= 7; 1741 | } 1742 | 1743 | #undef TDEFL_PUT_BITS_FAST 1744 | 1745 | d->m_pOutput_buf = pOutput_buf; 1746 | d->m_bits_in = 0; 1747 | d->m_bit_buffer = 0; 1748 | 1749 | while (bits_in) 1750 | { 1751 | mz_uint32 n = MZ_MIN(bits_in, 16); 1752 | TDEFL_PUT_BITS((mz_uint)bit_buffer & mz_bitmasks[n], n); 1753 | bit_buffer >>= n; 1754 | bits_in -= n; 1755 | } 1756 | 1757 | TDEFL_PUT_BITS(d->m_huff_codes[0][256], d->m_huff_code_sizes[0][256]); 1758 | 1759 | return (d->m_pOutput_buf < d->m_pOutput_buf_end); 1760 | } 1761 | #else 1762 | static mz_bool tdefl_compress_lz_codes(tdefl_compressor *d) 1763 | { 1764 | mz_uint flags; 1765 | mz_uint8 *pLZ_codes; 1766 | 1767 | flags = 1; 1768 | for (pLZ_codes = d->m_lz_code_buf; pLZ_codes < d->m_pLZ_code_buf; flags >>= 1) 1769 | { 1770 | if (flags == 1) 1771 | flags = *pLZ_codes++ | 0x100; 1772 | if (flags & 1) 1773 | { 1774 | mz_uint sym, num_extra_bits; 1775 | mz_uint match_len = pLZ_codes[0], match_dist = (pLZ_codes[1] | (pLZ_codes[2] << 8)); pLZ_codes += 3; 1776 | 1777 | MZ_ASSERT(d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]); 1778 | 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]]); 1779 | TDEFL_PUT_BITS(match_len & mz_bitmasks[s_tdefl_len_extra[match_len]], s_tdefl_len_extra[match_len]); 1780 | 1781 | if (match_dist < 512) 1782 | { 1783 | sym = s_tdefl_small_dist_sym[match_dist]; num_extra_bits = s_tdefl_small_dist_extra[match_dist]; 1784 | } 1785 | else 1786 | { 1787 | sym = s_tdefl_large_dist_sym[match_dist >> 8]; num_extra_bits = s_tdefl_large_dist_extra[match_dist >> 8]; 1788 | } 1789 | MZ_ASSERT(d->m_huff_code_sizes[1][sym]); 1790 | TDEFL_PUT_BITS(d->m_huff_codes[1][sym], d->m_huff_code_sizes[1][sym]); 1791 | TDEFL_PUT_BITS(match_dist & mz_bitmasks[num_extra_bits], num_extra_bits); 1792 | } 1793 | else 1794 | { 1795 | mz_uint lit = *pLZ_codes++; 1796 | MZ_ASSERT(d->m_huff_code_sizes[0][lit]); 1797 | TDEFL_PUT_BITS(d->m_huff_codes[0][lit], d->m_huff_code_sizes[0][lit]); 1798 | } 1799 | } 1800 | 1801 | TDEFL_PUT_BITS(d->m_huff_codes[0][256], d->m_huff_code_sizes[0][256]); 1802 | 1803 | return (d->m_pOutput_buf < d->m_pOutput_buf_end); 1804 | } 1805 | #endif // MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN && MINIZ_HAS_64BIT_REGISTERS 1806 | 1807 | static mz_bool tdefl_compress_block(tdefl_compressor *d, mz_bool static_block) 1808 | { 1809 | if (static_block) 1810 | tdefl_start_static_block(d); 1811 | else 1812 | tdefl_start_dynamic_block(d); 1813 | return tdefl_compress_lz_codes(d); 1814 | } 1815 | 1816 | static int tdefl_flush_block(tdefl_compressor *d, int flush) 1817 | { 1818 | mz_uint saved_bit_buf, saved_bits_in; 1819 | mz_uint8 *pSaved_output_buf; 1820 | mz_bool comp_block_succeeded = MZ_FALSE; 1821 | 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; 1822 | 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)) ? ((mz_uint8 *)d->m_pOut_buf + d->m_out_buf_ofs) : d->m_output_buf; 1823 | 1824 | d->m_pOutput_buf = pOutput_buf_start; 1825 | d->m_pOutput_buf_end = d->m_pOutput_buf + TDEFL_OUT_BUF_SIZE - 16; 1826 | 1827 | MZ_ASSERT(!d->m_output_flush_remaining); 1828 | d->m_output_flush_ofs = 0; 1829 | d->m_output_flush_remaining = 0; 1830 | 1831 | *d->m_pLZ_flags = (mz_uint8)(*d->m_pLZ_flags >> d->m_num_flags_left); 1832 | d->m_pLZ_code_buf -= (d->m_num_flags_left == 8); 1833 | 1834 | if ((d->m_flags & TDEFL_WRITE_ZLIB_HEADER) && (!d->m_block_index)) 1835 | { 1836 | TDEFL_PUT_BITS(0x78, 8); TDEFL_PUT_BITS(0x01, 8); 1837 | } 1838 | 1839 | TDEFL_PUT_BITS(flush == TDEFL_FINISH, 1); 1840 | 1841 | pSaved_output_buf = d->m_pOutput_buf; saved_bit_buf = d->m_bit_buffer; saved_bits_in = d->m_bits_in; 1842 | 1843 | if (!use_raw_block) 1844 | comp_block_succeeded = tdefl_compress_block(d, (d->m_flags & TDEFL_FORCE_ALL_STATIC_BLOCKS) || (d->m_total_lz_bytes < 48)); 1845 | 1846 | // If the block gets expanded, forget the current contents of the output buffer and send a raw block instead. 1847 | if ( ((use_raw_block) || ((d->m_total_lz_bytes) && ((d->m_pOutput_buf - pSaved_output_buf + 1U) >= d->m_total_lz_bytes))) && 1848 | ((d->m_lookahead_pos - d->m_lz_code_buf_dict_pos) <= d->m_dict_size) ) 1849 | { 1850 | mz_uint i; d->m_pOutput_buf = pSaved_output_buf; d->m_bit_buffer = saved_bit_buf, d->m_bits_in = saved_bits_in; 1851 | TDEFL_PUT_BITS(0, 2); 1852 | if (d->m_bits_in) { TDEFL_PUT_BITS(0, 8 - d->m_bits_in); } 1853 | for (i = 2; i; --i, d->m_total_lz_bytes ^= 0xFFFF) 1854 | { 1855 | TDEFL_PUT_BITS(d->m_total_lz_bytes & 0xFFFF, 16); 1856 | } 1857 | for (i = 0; i < d->m_total_lz_bytes; ++i) 1858 | { 1859 | TDEFL_PUT_BITS(d->m_dict[(d->m_lz_code_buf_dict_pos + i) & TDEFL_LZ_DICT_SIZE_MASK], 8); 1860 | } 1861 | } 1862 | // Check for the extremely unlikely (if not impossible) case of the compressed block not fitting into the output buffer when using dynamic codes. 1863 | else if (!comp_block_succeeded) 1864 | { 1865 | d->m_pOutput_buf = pSaved_output_buf; d->m_bit_buffer = saved_bit_buf, d->m_bits_in = saved_bits_in; 1866 | tdefl_compress_block(d, MZ_TRUE); 1867 | } 1868 | 1869 | if (flush) 1870 | { 1871 | if (flush == TDEFL_FINISH) 1872 | { 1873 | if (d->m_bits_in) { TDEFL_PUT_BITS(0, 8 - d->m_bits_in); } 1874 | 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; } } 1875 | } 1876 | else 1877 | { 1878 | 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); } 1879 | } 1880 | } 1881 | 1882 | MZ_ASSERT(d->m_pOutput_buf < d->m_pOutput_buf_end); 1883 | 1884 | memset(&d->m_huff_count[0][0], 0, sizeof(d->m_huff_count[0][0]) * TDEFL_MAX_HUFF_SYMBOLS_0); 1885 | memset(&d->m_huff_count[1][0], 0, sizeof(d->m_huff_count[1][0]) * TDEFL_MAX_HUFF_SYMBOLS_1); 1886 | 1887 | d->m_pLZ_code_buf = d->m_lz_code_buf + 1; d->m_pLZ_flags = d->m_lz_code_buf; 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++; 1888 | 1889 | if ((n = (int)(d->m_pOutput_buf - pOutput_buf_start)) != 0) 1890 | { 1891 | if (d->m_pPut_buf_func) 1892 | { 1893 | *d->m_pIn_buf_size = d->m_pSrc - (const mz_uint8 *)d->m_pIn_buf; 1894 | if (!(*d->m_pPut_buf_func)(d->m_output_buf, n, d->m_pPut_buf_user)) 1895 | return (d->m_prev_return_status = TDEFL_STATUS_PUT_BUF_FAILED); 1896 | } 1897 | else if (pOutput_buf_start == d->m_output_buf) 1898 | { 1899 | int bytes_to_copy = (int)MZ_MIN((size_t)n, (size_t)(*d->m_pOut_buf_size - d->m_out_buf_ofs)); 1900 | memcpy((mz_uint8 *)d->m_pOut_buf + d->m_out_buf_ofs, d->m_output_buf, bytes_to_copy); 1901 | d->m_out_buf_ofs += bytes_to_copy; 1902 | if ((n -= bytes_to_copy) != 0) 1903 | { 1904 | d->m_output_flush_ofs = bytes_to_copy; 1905 | d->m_output_flush_remaining = n; 1906 | } 1907 | } 1908 | else 1909 | { 1910 | d->m_out_buf_ofs += n; 1911 | } 1912 | } 1913 | 1914 | return d->m_output_flush_remaining; 1915 | } 1916 | 1917 | #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1918 | #define TDEFL_READ_UNALIGNED_WORD(p) *(const mz_uint16*)(p) 1919 | static __forceinline 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) 1920 | 1921 | { 1922 | mz_uint dist, pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK, match_len = *pMatch_len, probe_pos = pos, next_probe_pos, probe_len; 1923 | mz_uint num_probes_left = d->m_max_probes[match_len >= 32]; 1924 | const mz_uint16 *s = (const mz_uint16*)(d->m_dict + pos), *p, *q; 1925 | mz_uint16 c01 = TDEFL_READ_UNALIGNED_WORD(&d->m_dict[pos + match_len - 1]), s01 = TDEFL_READ_UNALIGNED_WORD(s); 1926 | MZ_ASSERT(max_match_len <= TDEFL_MAX_MATCH_LEN); if (max_match_len <= match_len) return; 1927 | for ( ; ; ) 1928 | { 1929 | for ( ; ; ) 1930 | { 1931 | if (--num_probes_left == 0) return; 1932 | #define TDEFL_PROBE \ 1933 | next_probe_pos = d->m_next[probe_pos]; \ 1934 | if ((!next_probe_pos) || ((dist = (mz_uint16)(lookahead_pos - next_probe_pos)) > max_dist)) return; \ 1935 | probe_pos = next_probe_pos & TDEFL_LZ_DICT_SIZE_MASK; \ 1936 | if (TDEFL_READ_UNALIGNED_WORD(&d->m_dict[probe_pos + match_len - 1]) == c01) break; 1937 | TDEFL_PROBE; TDEFL_PROBE; TDEFL_PROBE; 1938 | } 1939 | if (!dist) break; q = (const mz_uint16*)(d->m_dict + probe_pos); if (TDEFL_READ_UNALIGNED_WORD(q) != s01) continue; p = s; probe_len = 32; 1940 | do { } while ( (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && 1941 | (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (--probe_len > 0) ); 1942 | if (!probe_len) 1943 | { 1944 | *pMatch_dist = dist; *pMatch_len = MZ_MIN(max_match_len, TDEFL_MAX_MATCH_LEN); break; 1945 | } 1946 | else if ((probe_len = ((mz_uint)(p - s) * 2) + (mz_uint)(*(const mz_uint8*)p == *(const mz_uint8*)q)) > match_len) 1947 | { 1948 | *pMatch_dist = dist; if ((*pMatch_len = match_len = MZ_MIN(max_match_len, probe_len)) == max_match_len) break; 1949 | c01 = TDEFL_READ_UNALIGNED_WORD(&d->m_dict[pos + match_len - 1]); 1950 | } 1951 | } 1952 | } 1953 | #else 1954 | static __forceinline 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) 1955 | { 1956 | mz_uint dist, pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK, match_len = *pMatch_len, probe_pos = pos, next_probe_pos, probe_len; 1957 | mz_uint num_probes_left = d->m_max_probes[match_len >= 32]; 1958 | const mz_uint8 *s = d->m_dict + pos, *p, *q; 1959 | mz_uint8 c0 = d->m_dict[pos + match_len], c1 = d->m_dict[pos + match_len - 1]; 1960 | MZ_ASSERT(max_match_len <= TDEFL_MAX_MATCH_LEN); if (max_match_len <= match_len) return; 1961 | for ( ; ; ) 1962 | { 1963 | for ( ; ; ) 1964 | { 1965 | if (--num_probes_left == 0) return; 1966 | #define TDEFL_PROBE \ 1967 | next_probe_pos = d->m_next[probe_pos]; \ 1968 | if ((!next_probe_pos) || ((dist = (mz_uint16)(lookahead_pos - next_probe_pos)) > max_dist)) return; \ 1969 | probe_pos = next_probe_pos & TDEFL_LZ_DICT_SIZE_MASK; \ 1970 | if ((d->m_dict[probe_pos + match_len] == c0) && (d->m_dict[probe_pos + match_len - 1] == c1)) break; 1971 | TDEFL_PROBE; TDEFL_PROBE; TDEFL_PROBE; 1972 | } 1973 | if (!dist) break; p = s; q = d->m_dict + probe_pos; for (probe_len = 0; probe_len < max_match_len; probe_len++) if (*p++ != *q++) break; 1974 | if (probe_len > match_len) 1975 | { 1976 | *pMatch_dist = dist; if ((*pMatch_len = match_len = probe_len) == max_match_len) return; 1977 | c0 = d->m_dict[pos + match_len]; c1 = d->m_dict[pos + match_len - 1]; 1978 | } 1979 | } 1980 | } 1981 | #endif // #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1982 | 1983 | #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN 1984 | static mz_bool tdefl_compress_fast(tdefl_compressor *d) 1985 | { 1986 | // Faster, minimally featured LZRW1-style match+parse loop with better register utilization. Intended for applications where raw throughput is valued more highly than ratio. 1987 | 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; 1988 | mz_uint8 *pLZ_code_buf = d->m_pLZ_code_buf, *pLZ_flags = d->m_pLZ_flags; 1989 | mz_uint cur_pos = lookahead_pos & TDEFL_LZ_DICT_SIZE_MASK; 1990 | 1991 | while ((d->m_src_buf_left) || ((d->m_flush) && (lookahead_size))) 1992 | { 1993 | const mz_uint TDEFL_COMP_FAST_LOOKAHEAD_SIZE = 4096; 1994 | mz_uint dst_pos = (lookahead_pos + lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK; 1995 | mz_uint num_bytes_to_process = (mz_uint)MZ_MIN(d->m_src_buf_left, TDEFL_COMP_FAST_LOOKAHEAD_SIZE - lookahead_size); 1996 | d->m_src_buf_left -= num_bytes_to_process; 1997 | lookahead_size += num_bytes_to_process; 1998 | 1999 | while (num_bytes_to_process) 2000 | { 2001 | mz_uint32 n = MZ_MIN(TDEFL_LZ_DICT_SIZE - dst_pos, num_bytes_to_process); 2002 | memcpy(d->m_dict + dst_pos, d->m_pSrc, n); 2003 | if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1)) 2004 | memcpy(d->m_dict + TDEFL_LZ_DICT_SIZE + dst_pos, d->m_pSrc, MZ_MIN(n, (TDEFL_MAX_MATCH_LEN - 1) - dst_pos)); 2005 | d->m_pSrc += n; 2006 | dst_pos = (dst_pos + n) & TDEFL_LZ_DICT_SIZE_MASK; 2007 | num_bytes_to_process -= n; 2008 | } 2009 | 2010 | dict_size = MZ_MIN(TDEFL_LZ_DICT_SIZE - lookahead_size, dict_size); 2011 | if ((!d->m_flush) && (lookahead_size < TDEFL_COMP_FAST_LOOKAHEAD_SIZE)) break; 2012 | 2013 | while (lookahead_size >= 4) 2014 | { 2015 | mz_uint cur_match_dist, cur_match_len = 1; 2016 | mz_uint8 *pCur_dict = d->m_dict + cur_pos; 2017 | mz_uint first_trigram = (*(const mz_uint32 *)pCur_dict) & 0xFFFFFF; 2018 | mz_uint hash = (first_trigram ^ (first_trigram >> (24 - (TDEFL_LZ_HASH_BITS - 8)))) & TDEFL_LEVEL1_HASH_SIZE_MASK; 2019 | mz_uint probe_pos = d->m_hash[hash]; 2020 | d->m_hash[hash] = (mz_uint16)lookahead_pos; 2021 | 2022 | if (((cur_match_dist = (mz_uint16)(lookahead_pos - probe_pos)) <= dict_size) && ((*(const mz_uint32 *)(d->m_dict + (probe_pos &= TDEFL_LZ_DICT_SIZE_MASK)) & 0xFFFFFF) == first_trigram)) 2023 | { 2024 | const mz_uint16 *p = (const mz_uint16 *)pCur_dict; 2025 | const mz_uint16 *q = (const mz_uint16 *)(d->m_dict + probe_pos); 2026 | mz_uint32 probe_len = 32; 2027 | do { } while ( (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && 2028 | (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (TDEFL_READ_UNALIGNED_WORD(++p) == TDEFL_READ_UNALIGNED_WORD(++q)) && (--probe_len > 0) ); 2029 | cur_match_len = ((mz_uint)(p - (const mz_uint16 *)pCur_dict) * 2) + (mz_uint)(*(const mz_uint8 *)p == *(const mz_uint8 *)q); 2030 | if (!probe_len) 2031 | cur_match_len = cur_match_dist ? TDEFL_MAX_MATCH_LEN : 0; 2032 | 2033 | if ((cur_match_len < TDEFL_MIN_MATCH_LEN) || ((cur_match_len == TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 8U*1024U))) 2034 | { 2035 | cur_match_len = 1; 2036 | *pLZ_code_buf++ = (mz_uint8)first_trigram; 2037 | *pLZ_flags = (mz_uint8)(*pLZ_flags >> 1); 2038 | d->m_huff_count[0][(mz_uint8)first_trigram]++; 2039 | } 2040 | else 2041 | { 2042 | mz_uint32 s0, s1; 2043 | cur_match_len = MZ_MIN(cur_match_len, lookahead_size); 2044 | 2045 | MZ_ASSERT((cur_match_len >= TDEFL_MIN_MATCH_LEN) && (cur_match_dist >= 1) && (cur_match_dist <= TDEFL_LZ_DICT_SIZE)); 2046 | 2047 | cur_match_dist--; 2048 | 2049 | pLZ_code_buf[0] = (mz_uint8)(cur_match_len - TDEFL_MIN_MATCH_LEN); 2050 | *(mz_uint16 *)(&pLZ_code_buf[1]) = (mz_uint16)cur_match_dist; 2051 | pLZ_code_buf += 3; 2052 | *pLZ_flags = (mz_uint8)((*pLZ_flags >> 1) | 0x80); 2053 | 2054 | s0 = s_tdefl_small_dist_sym[cur_match_dist & 511]; 2055 | s1 = s_tdefl_large_dist_sym[cur_match_dist >> 8]; 2056 | d->m_huff_count[1][(cur_match_dist < 512) ? s0 : s1]++; 2057 | 2058 | d->m_huff_count[0][s_tdefl_len_sym[cur_match_len - TDEFL_MIN_MATCH_LEN]]++; 2059 | } 2060 | } 2061 | else 2062 | { 2063 | *pLZ_code_buf++ = (mz_uint8)first_trigram; 2064 | *pLZ_flags = (mz_uint8)(*pLZ_flags >> 1); 2065 | d->m_huff_count[0][(mz_uint8)first_trigram]++; 2066 | } 2067 | 2068 | if (--num_flags_left == 0) { num_flags_left = 8; pLZ_flags = pLZ_code_buf++; } 2069 | 2070 | total_lz_bytes += cur_match_len; 2071 | lookahead_pos += cur_match_len; 2072 | dict_size = MZ_MIN(dict_size + cur_match_len, TDEFL_LZ_DICT_SIZE); 2073 | cur_pos = (cur_pos + cur_match_len) & TDEFL_LZ_DICT_SIZE_MASK; 2074 | MZ_ASSERT(lookahead_size >= cur_match_len); 2075 | lookahead_size -= cur_match_len; 2076 | 2077 | if (pLZ_code_buf > &d->m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8]) 2078 | { 2079 | int n; 2080 | d->m_lookahead_pos = lookahead_pos; d->m_lookahead_size = lookahead_size; d->m_dict_size = dict_size; 2081 | 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; 2082 | if ((n = tdefl_flush_block(d, 0)) != 0) 2083 | return (n < 0) ? MZ_FALSE : MZ_TRUE; 2084 | 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; 2085 | } 2086 | } 2087 | 2088 | while (lookahead_size) 2089 | { 2090 | mz_uint8 lit = d->m_dict[cur_pos]; 2091 | 2092 | total_lz_bytes++; 2093 | *pLZ_code_buf++ = lit; 2094 | *pLZ_flags = (mz_uint8)(*pLZ_flags >> 1); 2095 | if (--num_flags_left == 0) { num_flags_left = 8; pLZ_flags = pLZ_code_buf++; } 2096 | 2097 | d->m_huff_count[0][lit]++; 2098 | 2099 | lookahead_pos++; 2100 | dict_size = MZ_MIN(dict_size + 1, TDEFL_LZ_DICT_SIZE); 2101 | cur_pos = (cur_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK; 2102 | lookahead_size--; 2103 | 2104 | if (pLZ_code_buf > &d->m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8]) 2105 | { 2106 | int n; 2107 | d->m_lookahead_pos = lookahead_pos; d->m_lookahead_size = lookahead_size; d->m_dict_size = dict_size; 2108 | 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; 2109 | if ((n = tdefl_flush_block(d, 0)) != 0) 2110 | return (n < 0) ? MZ_FALSE : MZ_TRUE; 2111 | 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; 2112 | } 2113 | } 2114 | } 2115 | 2116 | d->m_lookahead_pos = lookahead_pos; d->m_lookahead_size = lookahead_size; d->m_dict_size = dict_size; 2117 | 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; 2118 | return MZ_TRUE; 2119 | } 2120 | #endif // MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN 2121 | 2122 | static __forceinline void tdefl_record_literal(tdefl_compressor *d, mz_uint8 lit) 2123 | { 2124 | d->m_total_lz_bytes++; 2125 | *d->m_pLZ_code_buf++ = lit; 2126 | *d->m_pLZ_flags = (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++; } 2127 | d->m_huff_count[0][lit]++; 2128 | } 2129 | 2130 | static __forceinline void tdefl_record_match(tdefl_compressor *d, mz_uint match_len, mz_uint match_dist) 2131 | { 2132 | mz_uint32 s0, s1; 2133 | 2134 | MZ_ASSERT((match_len >= TDEFL_MIN_MATCH_LEN) && (match_dist >= 1) && (match_dist <= TDEFL_LZ_DICT_SIZE)); 2135 | 2136 | d->m_total_lz_bytes += match_len; 2137 | 2138 | d->m_pLZ_code_buf[0] = (mz_uint8)(match_len - TDEFL_MIN_MATCH_LEN); 2139 | 2140 | match_dist -= 1; 2141 | d->m_pLZ_code_buf[1] = (mz_uint8)(match_dist & 0xFF); 2142 | d->m_pLZ_code_buf[2] = (mz_uint8)(match_dist >> 8); d->m_pLZ_code_buf += 3; 2143 | 2144 | *d->m_pLZ_flags = (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++; } 2145 | 2146 | s0 = s_tdefl_small_dist_sym[match_dist & 511]; s1 = s_tdefl_large_dist_sym[match_dist >> 8]; 2147 | d->m_huff_count[1][(match_dist < 512) ? s0 : s1]++; 2148 | 2149 | d->m_huff_count[0][s_tdefl_len_sym[match_len - TDEFL_MIN_MATCH_LEN]]++; 2150 | } 2151 | 2152 | static mz_bool tdefl_compress_normal(tdefl_compressor *d) 2153 | { 2154 | const mz_uint8 *pSrc = d->m_pSrc; size_t src_buf_left = d->m_src_buf_left; 2155 | tdefl_flush flush = d->m_flush; 2156 | 2157 | while ((src_buf_left) || ((flush) && (d->m_lookahead_size))) 2158 | { 2159 | mz_uint len_to_move, cur_match_dist, cur_match_len, cur_pos; 2160 | // Update dictionary and hash chains. Keeps the lookahead size equal to TDEFL_MAX_MATCH_LEN. 2161 | if ((d->m_lookahead_size + d->m_dict_size) >= (TDEFL_MIN_MATCH_LEN - 1)) 2162 | { 2163 | 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; 2164 | 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]; 2165 | mz_uint num_bytes_to_process = (mz_uint)MZ_MIN(src_buf_left, TDEFL_MAX_MATCH_LEN - d->m_lookahead_size); 2166 | const mz_uint8 *pSrc_end = pSrc + num_bytes_to_process; 2167 | src_buf_left -= num_bytes_to_process; 2168 | d->m_lookahead_size += num_bytes_to_process; 2169 | while (pSrc != pSrc_end) 2170 | { 2171 | 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; 2172 | hash = ((hash << TDEFL_LZ_HASH_SHIFT) ^ c) & (TDEFL_LZ_HASH_SIZE - 1); 2173 | d->m_next[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] = d->m_hash[hash]; d->m_hash[hash] = (mz_uint16)(ins_pos); 2174 | dst_pos = (dst_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK; ins_pos++; 2175 | } 2176 | } 2177 | else 2178 | { 2179 | while ((src_buf_left) && (d->m_lookahead_size < TDEFL_MAX_MATCH_LEN)) 2180 | { 2181 | mz_uint8 c = *pSrc++; 2182 | mz_uint dst_pos = (d->m_lookahead_pos + d->m_lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK; 2183 | src_buf_left--; 2184 | d->m_dict[dst_pos] = c; 2185 | if (dst_pos < (TDEFL_MAX_MATCH_LEN - 1)) 2186 | d->m_dict[TDEFL_LZ_DICT_SIZE + dst_pos] = c; 2187 | if ((++d->m_lookahead_size + d->m_dict_size) >= TDEFL_MIN_MATCH_LEN) 2188 | { 2189 | mz_uint ins_pos = d->m_lookahead_pos + (d->m_lookahead_size - 1) - 2; 2190 | 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); 2191 | d->m_next[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] = d->m_hash[hash]; d->m_hash[hash] = (mz_uint16)(ins_pos); 2192 | } 2193 | } 2194 | } 2195 | d->m_dict_size = MZ_MIN(TDEFL_LZ_DICT_SIZE - d->m_lookahead_size, d->m_dict_size); 2196 | if ((!flush) && (d->m_lookahead_size < TDEFL_MAX_MATCH_LEN)) 2197 | break; 2198 | 2199 | // Simple lazy/greedy parsing state machine. 2200 | 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; 2201 | if (d->m_flags & (TDEFL_RLE_MATCHES | TDEFL_FORCE_ALL_RAW_BLOCKS)) 2202 | { 2203 | if ((d->m_dict_size) && (!(d->m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS))) 2204 | { 2205 | mz_uint8 c = d->m_dict[(cur_pos - 1) & TDEFL_LZ_DICT_SIZE_MASK]; 2206 | 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++; } 2207 | if (cur_match_len < TDEFL_MIN_MATCH_LEN) cur_match_len = 0; else cur_match_dist = 1; 2208 | } 2209 | } 2210 | else 2211 | { 2212 | tdefl_find_match(d, d->m_lookahead_pos, d->m_dict_size, d->m_lookahead_size, &cur_match_dist, &cur_match_len); 2213 | } 2214 | 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))) 2215 | { 2216 | cur_match_dist = cur_match_len = 0; 2217 | } 2218 | if (d->m_saved_match_len) 2219 | { 2220 | if (cur_match_len > d->m_saved_match_len) 2221 | { 2222 | tdefl_record_literal(d, (mz_uint8)d->m_saved_lit); 2223 | if (cur_match_len >= 128) 2224 | { 2225 | tdefl_record_match(d, cur_match_len, cur_match_dist); 2226 | d->m_saved_match_len = 0; len_to_move = cur_match_len; 2227 | } 2228 | else 2229 | { 2230 | 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; 2231 | } 2232 | } 2233 | else 2234 | { 2235 | tdefl_record_match(d, d->m_saved_match_len, d->m_saved_match_dist); 2236 | len_to_move = d->m_saved_match_len - 1; d->m_saved_match_len = 0; 2237 | } 2238 | } 2239 | else if (!cur_match_dist) 2240 | tdefl_record_literal(d, d->m_dict[cur_pos]); 2241 | else if ((d->m_greedy_parsing) || (d->m_flags & TDEFL_RLE_MATCHES) || (cur_match_len >= 128)) 2242 | { 2243 | tdefl_record_match(d, cur_match_len, cur_match_dist); 2244 | len_to_move = cur_match_len; 2245 | } 2246 | else 2247 | { 2248 | 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; 2249 | } 2250 | // Move the lookahead forward by len_to_move bytes. 2251 | d->m_lookahead_pos += len_to_move; 2252 | MZ_ASSERT(d->m_lookahead_size >= len_to_move); 2253 | d->m_lookahead_size -= len_to_move; 2254 | d->m_dict_size = MZ_MIN(d->m_dict_size + len_to_move, TDEFL_LZ_DICT_SIZE); 2255 | // Check if it's time to flush the current LZ codes to the internal output buffer. 2256 | if ( (d->m_pLZ_code_buf > &d->m_lz_code_buf[TDEFL_LZ_CODE_BUF_SIZE - 8]) || 2257 | ( (d->m_total_lz_bytes > 31*1024) && (((((mz_uint)(d->m_pLZ_code_buf - d->m_lz_code_buf) * 115) >> 7) >= d->m_total_lz_bytes) || (d->m_flags & TDEFL_FORCE_ALL_RAW_BLOCKS))) ) 2258 | { 2259 | int n; 2260 | d->m_pSrc = pSrc; d->m_src_buf_left = src_buf_left; 2261 | if ((n = tdefl_flush_block(d, 0)) != 0) 2262 | return (n < 0) ? MZ_FALSE : MZ_TRUE; 2263 | } 2264 | } 2265 | 2266 | d->m_pSrc = pSrc; d->m_src_buf_left = src_buf_left; 2267 | return MZ_TRUE; 2268 | } 2269 | 2270 | static tdefl_status tdefl_flush_output_buffer(tdefl_compressor *d) 2271 | { 2272 | if (d->m_pIn_buf_size) 2273 | { 2274 | *d->m_pIn_buf_size = d->m_pSrc - (const mz_uint8 *)d->m_pIn_buf; 2275 | } 2276 | 2277 | if (d->m_pOut_buf_size) 2278 | { 2279 | size_t n = MZ_MIN(*d->m_pOut_buf_size - d->m_out_buf_ofs, d->m_output_flush_remaining); 2280 | memcpy((mz_uint8 *)d->m_pOut_buf + d->m_out_buf_ofs, d->m_output_buf + d->m_output_flush_ofs, n); 2281 | d->m_output_flush_ofs += (mz_uint)n; 2282 | d->m_output_flush_remaining -= (mz_uint)n; 2283 | d->m_out_buf_ofs += n; 2284 | 2285 | *d->m_pOut_buf_size = d->m_out_buf_ofs; 2286 | } 2287 | 2288 | return (d->m_finished && !d->m_output_flush_remaining) ? TDEFL_STATUS_DONE : TDEFL_STATUS_OKAY; 2289 | } 2290 | 2291 | 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) 2292 | { 2293 | if (!d) 2294 | { 2295 | if (pIn_buf_size) *pIn_buf_size = 0; 2296 | if (pOut_buf_size) *pOut_buf_size = 0; 2297 | return TDEFL_STATUS_BAD_PARAM; 2298 | } 2299 | 2300 | d->m_pIn_buf = pIn_buf; d->m_pIn_buf_size = pIn_buf_size; 2301 | d->m_pOut_buf = pOut_buf; d->m_pOut_buf_size = pOut_buf_size; 2302 | d->m_pSrc = (const mz_uint8 *)(pIn_buf); d->m_src_buf_left = pIn_buf_size ? *pIn_buf_size : 0; 2303 | d->m_out_buf_ofs = 0; 2304 | d->m_flush = flush; 2305 | 2306 | if ( ((d->m_pPut_buf_func != NULL) == ((pOut_buf != NULL) || (pOut_buf_size != NULL))) || (d->m_prev_return_status != TDEFL_STATUS_OKAY) || 2307 | (d->m_wants_to_finish && (flush != TDEFL_FINISH)) || (pIn_buf_size && *pIn_buf_size && !pIn_buf) || (pOut_buf_size && *pOut_buf_size && !pOut_buf) ) 2308 | { 2309 | if (pIn_buf_size) *pIn_buf_size = 0; 2310 | if (pOut_buf_size) *pOut_buf_size = 0; 2311 | return (d->m_prev_return_status = TDEFL_STATUS_BAD_PARAM); 2312 | } 2313 | d->m_wants_to_finish |= (flush == TDEFL_FINISH); 2314 | 2315 | if ((d->m_output_flush_remaining) || (d->m_finished)) 2316 | return (d->m_prev_return_status = tdefl_flush_output_buffer(d)); 2317 | 2318 | #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN 2319 | if (((d->m_flags & TDEFL_MAX_PROBES_MASK) == 1) && 2320 | ((d->m_flags & TDEFL_GREEDY_PARSING_FLAG) != 0) && 2321 | ((d->m_flags & (TDEFL_FILTER_MATCHES | TDEFL_FORCE_ALL_RAW_BLOCKS | TDEFL_RLE_MATCHES)) == 0)) 2322 | { 2323 | if (!tdefl_compress_fast(d)) 2324 | return d->m_prev_return_status; 2325 | } 2326 | else 2327 | #endif // #if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN 2328 | { 2329 | if (!tdefl_compress_normal(d)) 2330 | return d->m_prev_return_status; 2331 | } 2332 | 2333 | if ((d->m_flags & (TDEFL_WRITE_ZLIB_HEADER | TDEFL_COMPUTE_ADLER32)) && (pIn_buf)) 2334 | d->m_adler32 = (mz_uint32)mz_adler32(d->m_adler32, (const mz_uint8 *)pIn_buf, d->m_pSrc - (const mz_uint8 *)pIn_buf); 2335 | 2336 | if (d->m_flags & TDEFL_COMPUTE_CRC32) 2337 | d->m_crc32 = (mz_uint32)mz_crc32(d->m_crc32, (const mz_uint8 *)pIn_buf, d->m_pSrc - (const mz_uint8 *)pIn_buf); 2338 | 2339 | if ((flush) && (!d->m_lookahead_size) && (!d->m_src_buf_left) && (!d->m_output_flush_remaining)) 2340 | { 2341 | if (tdefl_flush_block(d, flush) < 0) 2342 | return d->m_prev_return_status; 2343 | d->m_finished = (flush == TDEFL_FINISH); 2344 | if (flush == TDEFL_FULL_FLUSH) { MZ_CLEAR_OBJ(d->m_hash); MZ_CLEAR_OBJ(d->m_next); d->m_dict_size = 0; } 2345 | } 2346 | 2347 | return (d->m_prev_return_status = tdefl_flush_output_buffer(d)); 2348 | } 2349 | 2350 | tdefl_status tdefl_compress_buffer(tdefl_compressor *d, const void *pIn_buf, size_t in_buf_size, tdefl_flush flush) 2351 | { 2352 | MZ_ASSERT(d->m_pPut_buf_func); return tdefl_compress(d, pIn_buf, &in_buf_size, NULL, NULL, flush); 2353 | } 2354 | 2355 | tdefl_status tdefl_init(tdefl_compressor *d, tdefl_put_buf_func_ptr pPut_buf_func, void *pPut_buf_user, int flags) 2356 | { 2357 | d->m_pPut_buf_func = pPut_buf_func; d->m_pPut_buf_user = pPut_buf_user; 2358 | d->m_flags = (mz_uint)(flags); d->m_max_probes[0] = 1 + ((flags & 0xFFF) + 2) / 3; d->m_greedy_parsing = (flags & TDEFL_GREEDY_PARSING_FLAG) != 0; 2359 | d->m_max_probes[1] = 1 + (((flags & 0xFFF) >> 2) + 2) / 3; 2360 | if (!(flags & TDEFL_NONDETERMINISTIC_PARSING_FLAG)) MZ_CLEAR_OBJ(d->m_hash); 2361 | 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; 2362 | 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; 2363 | d->m_pLZ_code_buf = d->m_lz_code_buf + 1; d->m_pLZ_flags = d->m_lz_code_buf; d->m_num_flags_left = 8; 2364 | d->m_pOutput_buf = d->m_output_buf; d->m_pOutput_buf_end = d->m_output_buf; d->m_prev_return_status = TDEFL_STATUS_OKAY; 2365 | d->m_saved_match_dist = d->m_saved_match_len = d->m_saved_lit = 0; d->m_adler32 = 1; d->m_crc32 = 1; 2366 | d->m_pIn_buf = NULL; d->m_pOut_buf = NULL; 2367 | d->m_pIn_buf_size = NULL; d->m_pOut_buf_size = NULL; 2368 | d->m_flush = TDEFL_NO_FLUSH; d->m_pSrc = NULL; d->m_src_buf_left = 0; d->m_out_buf_ofs = 0; 2369 | memset(&d->m_huff_count[0][0], 0, sizeof(d->m_huff_count[0][0]) * TDEFL_MAX_HUFF_SYMBOLS_0); 2370 | memset(&d->m_huff_count[1][0], 0, sizeof(d->m_huff_count[1][0]) * TDEFL_MAX_HUFF_SYMBOLS_1); 2371 | return TDEFL_STATUS_OKAY; 2372 | } 2373 | 2374 | tdefl_status tdefl_get_prev_return_status(tdefl_compressor *d) 2375 | { 2376 | return d->m_prev_return_status; 2377 | } 2378 | 2379 | mz_uint32 tdefl_get_adler32(tdefl_compressor *d) 2380 | { 2381 | return d->m_adler32; 2382 | } 2383 | 2384 | mz_uint32 tdefl_get_crc32(tdefl_compressor *d) 2385 | { 2386 | return d->m_crc32; 2387 | } 2388 | 2389 | 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) 2390 | { 2391 | tdefl_compressor *pComp; mz_bool succeeded; if (((buf_len) && (!pBuf)) || (!pPut_buf_func)) return MZ_FALSE; 2392 | pComp = (tdefl_compressor*)MZ_MALLOC(sizeof(tdefl_compressor)); if (!pComp) return MZ_FALSE; 2393 | succeeded = (tdefl_init(pComp, pPut_buf_func, pPut_buf_user, flags) == TDEFL_STATUS_OKAY); 2394 | succeeded = succeeded && (tdefl_compress_buffer(pComp, pBuf, buf_len, TDEFL_FINISH) == TDEFL_STATUS_DONE); 2395 | MZ_FREE(pComp); return succeeded; 2396 | } 2397 | 2398 | typedef struct 2399 | { 2400 | size_t m_size, m_capacity; 2401 | mz_uint8 *m_pBuf; 2402 | mz_bool m_expandable; 2403 | } tdefl_output_buffer; 2404 | 2405 | static mz_bool tdefl_output_buffer_putter(const void *pBuf, int len, void *pUser) 2406 | { 2407 | tdefl_output_buffer *p = (tdefl_output_buffer *)pUser; 2408 | size_t new_size = p->m_size + len; 2409 | if (new_size > p->m_capacity) 2410 | { 2411 | size_t new_capacity = p->m_capacity; mz_uint8 *pNew_buf; if (!p->m_expandable) return MZ_FALSE; 2412 | do { new_capacity = MZ_MAX(128U, new_capacity << 1U); } while (new_size > new_capacity); 2413 | pNew_buf = (mz_uint8*)MZ_REALLOC(p->m_pBuf, new_capacity); if (!pNew_buf) return MZ_FALSE; 2414 | p->m_pBuf = pNew_buf; p->m_capacity = new_capacity; 2415 | } 2416 | memcpy((mz_uint8*)p->m_pBuf + p->m_size, pBuf, len); p->m_size = new_size; 2417 | return MZ_TRUE; 2418 | } 2419 | 2420 | void *tdefl_compress_mem_to_heap(const void *pSrc_buf, size_t src_buf_len, size_t *pOut_len, int flags) 2421 | { 2422 | tdefl_output_buffer out_buf; MZ_CLEAR_OBJ(out_buf); 2423 | if (!pOut_len) return MZ_FALSE; else *pOut_len = 0; 2424 | out_buf.m_expandable = MZ_TRUE; 2425 | if (!tdefl_compress_mem_to_output(pSrc_buf, src_buf_len, tdefl_output_buffer_putter, &out_buf, flags)) return NULL; 2426 | *pOut_len = out_buf.m_size; return out_buf.m_pBuf; 2427 | } 2428 | 2429 | 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) 2430 | { 2431 | tdefl_output_buffer out_buf; MZ_CLEAR_OBJ(out_buf); 2432 | if (!pOut_buf) return 0; 2433 | out_buf.m_pBuf = (mz_uint8*)pOut_buf; out_buf.m_capacity = out_buf_len; 2434 | if (!tdefl_compress_mem_to_output(pSrc_buf, src_buf_len, tdefl_output_buffer_putter, &out_buf, flags)) return 0; 2435 | return out_buf.m_size; 2436 | } 2437 | 2438 | static const mz_uint s_tdefl_num_probes[11] = { 0, 1, 6, 32, 16, 32, 128, 256, 512, 768, 1500 }; 2439 | 2440 | // 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). 2441 | mz_uint tdefl_create_comp_flags_from_zip_params(int level, int window_bits, int strategy) 2442 | { 2443 | mz_uint comp_flags = s_tdefl_num_probes[(level >= 0) ? MZ_MIN(10, level) : MZ_DEFAULT_LEVEL] | ((level <= 3) ? TDEFL_GREEDY_PARSING_FLAG : 0); 2444 | if (window_bits > 0) comp_flags |= TDEFL_WRITE_ZLIB_HEADER; 2445 | 2446 | if (!level) comp_flags |= TDEFL_FORCE_ALL_RAW_BLOCKS; 2447 | else if (strategy == MZ_FILTERED) comp_flags |= TDEFL_FILTER_MATCHES; 2448 | else if (strategy == MZ_HUFFMAN_ONLY) comp_flags &= ~TDEFL_MAX_PROBES_MASK; 2449 | else if (strategy == MZ_FIXED) comp_flags |= TDEFL_FORCE_ALL_STATIC_BLOCKS; 2450 | else if (strategy == MZ_RLE) comp_flags |= TDEFL_RLE_MATCHES; 2451 | 2452 | return comp_flags; 2453 | } 2454 | 2455 | #ifdef _MSC_VER 2456 | #pragma warning (push) 2457 | #pragma warning (disable:4204) // nonstandard extension used : non-constant aggregate initializer (also supported by GNU C and C99, so no big deal) 2458 | #endif 2459 | 2460 | // Simple PNG writer function by Alex Evans, 2011. Released into the public domain: https://gist.github.com/908299, more context at 2461 | // http://altdevblogaday.org/2011/04/06/a-smaller-jpg-encoder/. 2462 | void *tdefl_write_image_to_png_file_in_memory(const void *pImage, int w, int h, int num_chans, size_t *pLen_out) 2463 | { 2464 | tdefl_compressor *pComp = (tdefl_compressor *)MZ_MALLOC(sizeof(tdefl_compressor)); tdefl_output_buffer out_buf; int i, bpl = w * num_chans, y, z; mz_uint32 c; *pLen_out = 0; 2465 | if (!pComp) return NULL; 2466 | MZ_CLEAR_OBJ(out_buf); out_buf.m_expandable = MZ_TRUE; out_buf.m_capacity = 57+MZ_MAX(64, (1+bpl)*h); if (NULL == (out_buf.m_pBuf = (mz_uint8*)MZ_MALLOC(out_buf.m_capacity))) { MZ_FREE(pComp); return NULL; } 2467 | // write dummy header 2468 | for (z = 41; z; --z) tdefl_output_buffer_putter(&z, 1, &out_buf); 2469 | // compress image data 2470 | tdefl_init(pComp, tdefl_output_buffer_putter, &out_buf, TDEFL_DEFAULT_MAX_PROBES | TDEFL_WRITE_ZLIB_HEADER); 2471 | for (y = 0; y < h; ++y) { tdefl_compress_buffer(pComp, &z, 1, TDEFL_NO_FLUSH); tdefl_compress_buffer(pComp, (mz_uint8*)pImage + y * bpl, bpl, TDEFL_NO_FLUSH); } 2472 | if (tdefl_compress_buffer(pComp, NULL, 0, TDEFL_FINISH) != TDEFL_STATUS_DONE) { MZ_FREE(pComp); MZ_FREE(out_buf.m_pBuf); return NULL; } 2473 | // write real header 2474 | *pLen_out = out_buf.m_size-41; 2475 | { 2476 | mz_uint8 pnghdr[41]={0x89,0x50,0x4e,0x47,0x0d,0x0a,0x1a,0x0a,0x00,0x00,0x00,0x0d,0x49,0x48,0x44,0x52, 2477 | 0,0,(mz_uint8)(w>>8),(mz_uint8)w,0,0,(mz_uint8)(h>>8),(mz_uint8)h,8,"\0\0\04\02\06"[num_chans],0,0,0,0,0,0,0, 2478 | (mz_uint8)(*pLen_out>>24),(mz_uint8)(*pLen_out>>16),(mz_uint8)(*pLen_out>>8),(mz_uint8)*pLen_out,0x49,0x44,0x41,0x54}; 2479 | c=(mz_uint32)mz_crc32(MZ_CRC32_INIT,pnghdr+12,17); for (i=0; i<4; ++i, c<<=8) ((mz_uint8*)(pnghdr+29))[i]=(mz_uint8)(c>>24); 2480 | memcpy(out_buf.m_pBuf, pnghdr, 41); 2481 | } 2482 | // write footer (IDAT CRC-32, followed by IEND chunk) 2483 | if (!tdefl_output_buffer_putter("\0\0\0\0\0\0\0\0\x49\x45\x4e\x44\xae\x42\x60\x82", 16, &out_buf)) { *pLen_out = 0; MZ_FREE(pComp); MZ_FREE(out_buf.m_pBuf); return NULL; } 2484 | c = (mz_uint32)mz_crc32(MZ_CRC32_INIT,out_buf.m_pBuf+41-4, *pLen_out+4); for (i=0; i<4; ++i, c<<=8) (out_buf.m_pBuf+out_buf.m_size-16)[i] = (mz_uint8)(c >> 24); 2485 | // compute final size of file, grab compressed data buffer and return 2486 | *pLen_out += 57; MZ_FREE(pComp); return out_buf.m_pBuf; 2487 | } 2488 | 2489 | #ifdef _MSC_VER 2490 | #pragma warning (pop) 2491 | #endif 2492 | 2493 | #endif // MINIZ_HEADER_FILE_ONLY 2494 | 2495 | /* 2496 | This is free and unencumbered software released into the public domain. 2497 | 2498 | Anyone is free to copy, modify, publish, use, compile, sell, or 2499 | distribute this software, either in source code form or as a compiled 2500 | binary, for any purpose, commercial or non-commercial, and by any 2501 | means. 2502 | 2503 | In jurisdictions that recognize copyright laws, the author or authors 2504 | of this software dedicate any and all copyright interest in the 2505 | software to the public domain. We make this dedication for the benefit 2506 | of the public at large and to the detriment of our heirs and 2507 | successors. We intend this dedication to be an overt act of 2508 | relinquishment in perpetuity of all present and future rights to this 2509 | software under copyright law. 2510 | 2511 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 2512 | EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 2513 | MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 2514 | IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR 2515 | OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, 2516 | ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR 2517 | OTHER DEALINGS IN THE SOFTWARE. 2518 | 2519 | For more information, please refer to 2520 | */ 2521 | --------------------------------------------------------------------------------