diff options
author | Mark Adler <madler@alumni.caltech.edu> | 2011-09-09 23:24:33 -0700 |
---|---|---|
committer | Mark Adler <madler@alumni.caltech.edu> | 2011-09-09 23:24:33 -0700 |
commit | 0484693e1723bbab791c56f95597bd7dbe867d03 (patch) | |
tree | 8f31dbed98b4390da74a90b484f2accf8f8a3a8e | |
parent | 9811b53dd9e8f67015c7199fff12b5bfc6965330 (diff) | |
download | zlib-0484693e1723bbab791c56f95597bd7dbe867d03.tar.gz zlib-0484693e1723bbab791c56f95597bd7dbe867d03.tar.bz2 zlib-0484693e1723bbab791c56f95597bd7dbe867d03.zip |
zlib 1.2.2.2v1.2.2.2
-rw-r--r-- | ChangeLog | 21 | ||||
-rw-r--r-- | FAQ | 26 | ||||
-rw-r--r-- | Makefile | 2 | ||||
-rw-r--r-- | Makefile.in | 2 | ||||
-rw-r--r-- | README | 9 | ||||
-rw-r--r-- | adler32.c | 115 | ||||
-rw-r--r-- | as400/zlib.inc | 6 | ||||
-rwxr-xr-x | configure | 5 | ||||
-rw-r--r-- | contrib/README.contrib | 3 | ||||
-rw-r--r-- | contrib/delphi/ZLib.pas | 2 | ||||
-rw-r--r-- | contrib/infback9/inftree9.c | 4 | ||||
-rw-r--r-- | contrib/masmx86/gvmat32.asm | 56 | ||||
-rw-r--r-- | contrib/masmx86/inffas32.asm | 21 | ||||
-rw-r--r-- | contrib/vstudio/readme.txt | 2 | ||||
-rw-r--r-- | contrib/vstudio/vc7/zlib.rc | 6 | ||||
-rw-r--r-- | crc32.c | 2 | ||||
-rw-r--r-- | deflate.c | 25 | ||||
-rw-r--r-- | examples/README.examples | 29 | ||||
-rw-r--r-- | examples/fitblk.c | 235 | ||||
-rw-r--r-- | examples/gzappend.c (renamed from contrib/gzappend/gzappend.c) | 0 | ||||
-rw-r--r-- | examples/gzjoin.c | 447 | ||||
-rw-r--r-- | examples/gzlog.c | 413 | ||||
-rw-r--r-- | examples/gzlog.h | 58 | ||||
-rw-r--r-- | examples/zlib_how.html | 522 | ||||
-rw-r--r-- | examples/zpipe.c | 191 | ||||
-rw-r--r-- | gzio.c | 8 | ||||
-rw-r--r-- | infback.c | 1 | ||||
-rw-r--r-- | inffast.c | 13 | ||||
-rw-r--r-- | inflate.c | 16 | ||||
-rw-r--r-- | inflate.h | 1 | ||||
-rw-r--r-- | inftrees.c | 4 | ||||
-rw-r--r--[-rwxr-xr-x] | make_vms.com (renamed from old/Make_vms.com) | 23 | ||||
-rw-r--r-- | qnx/package.qpg | 10 | ||||
-rw-r--r-- | trees.c | 18 | ||||
-rw-r--r-- | win32/zlib1.rc | 8 | ||||
-rw-r--r-- | zlib.3 | 4 | ||||
-rw-r--r-- | zlib.h | 25 | ||||
-rw-r--r-- | zutil.c | 5 | ||||
-rw-r--r-- | zutil.h | 17 |
39 files changed, 2178 insertions, 177 deletions
@@ -1,6 +1,26 @@ | |||
1 | 1 | ||
2 | ChangeLog file for zlib | 2 | ChangeLog file for zlib |
3 | 3 | ||
4 | Changes in 1.2.2.2 (30 December 2004) | ||
5 | - Replace structure assignments in deflate.c and inflate.c with zmemcpy to | ||
6 | avoid implicit memcpy calls (portability for no-library compilation) | ||
7 | - Increase sprintf() buffer size in gzdopen() to allow for large numbers | ||
8 | - Add INFLATE_STRICT to check distances against zlib header | ||
9 | - Improve WinCE errno handling and comments [Chang] | ||
10 | - Remove comment about no gzip header processing in FAQ | ||
11 | - Add Z_FIXED strategy option to deflateInit2() to force fixed trees | ||
12 | - Add updated make_vms.com [Coghlan], update README | ||
13 | - Create a new "examples" directory, move gzappend.c there, add zpipe.c, | ||
14 | fitblk.c, gzlog.[ch], gzjoin.c, and zlib_how.html. | ||
15 | - Add FAQ entry and comments in deflate.c on uninitialized memory access | ||
16 | - Add Solaris 9 make options in configure [Gilbert] | ||
17 | - Allow strerror() usage in gzio.c for STDC | ||
18 | - Fix DecompressBuf in contrib/delphi/ZLib.pas [ManChesTer] | ||
19 | - Update contrib/masmx86/inffas32.asm and gvmat32.asm [Vollant] | ||
20 | - Use z_off_t for adler32_combine() and crc32_combine() lengths | ||
21 | - Make adler32() much faster for small len | ||
22 | - Use OS_CODE in deflate() default gzip header | ||
23 | |||
4 | Changes in 1.2.2.1 (31 October 2004) | 24 | Changes in 1.2.2.1 (31 October 2004) |
5 | - Allow inflateSetDictionary() call for raw inflate | 25 | - Allow inflateSetDictionary() call for raw inflate |
6 | - Fix inflate header crc check bug for file names and comments | 26 | - Fix inflate header crc check bug for file names and comments |
@@ -20,6 +40,7 @@ Changes in 1.2.2.1 (31 October 2004) | |||
20 | - Do not define an exit() prototype in zutil.c unless DEBUG defined | 40 | - Do not define an exit() prototype in zutil.c unless DEBUG defined |
21 | - Remove prototype of exit() from zutil.c, example.c, minigzip.c [Truta] | 41 | - Remove prototype of exit() from zutil.c, example.c, minigzip.c [Truta] |
22 | - Add comment in zlib.h for Z_NO_FLUSH parameter to deflate() | 42 | - Add comment in zlib.h for Z_NO_FLUSH parameter to deflate() |
43 | - Fix Darwin build version identification [Peterson] | ||
23 | 44 | ||
24 | Changes in 1.2.2 (3 October 2004) | 45 | Changes in 1.2.2 (3 October 2004) |
25 | - Update zlib.h comments on gzip in-memory processing | 46 | - Update zlib.h comments on gzip in-memory processing |
@@ -148,13 +148,6 @@ The lastest zlib FAQ is at http://www.gzip.org/zlib/zlib_faq.html | |||
148 | format using deflateInit2(). You can also request that inflate decode | 148 | format using deflateInit2(). You can also request that inflate decode |
149 | the gzip format using inflateInit2(). Read zlib.h for more details. | 149 | the gzip format using inflateInit2(). Read zlib.h for more details. |
150 | 150 | ||
151 | Note that you cannot specify special gzip header contents (e.g. a file | ||
152 | name or modification date), nor will inflate tell you what was in the | ||
153 | gzip header. If you need to customize the header or see what's in it, | ||
154 | you can use the raw deflate and inflate operations and the crc32() | ||
155 | function and roll your own gzip encoding and decoding. Read the gzip | ||
156 | RFC 1952 for details of the header and trailer format. | ||
157 | |||
158 | 21. Is zlib thread-safe? | 151 | 21. Is zlib thread-safe? |
159 | 152 | ||
160 | Yes. However any library routines that zlib uses and any application- | 153 | Yes. However any library routines that zlib uses and any application- |
@@ -295,20 +288,29 @@ The lastest zlib FAQ is at http://www.gzip.org/zlib/zlib_faq.html | |||
295 | were downright silly. So now, we simply make sure that the code always | 288 | were downright silly. So now, we simply make sure that the code always |
296 | works. | 289 | works. |
297 | 290 | ||
298 | 36. Will zlib read the (insert any ancient or arcane format here) compressed | 291 | 36. Valgrind (or some similar memory access checker) says that deflate is |
292 | performing a conditional jump that depends on an uninitialized value. | ||
293 | Isn't that a bug? | ||
294 | |||
295 | No. That is intentional for performance reasons, and the output of | ||
296 | deflate is not affected. This only started showing up recently since | ||
297 | zlib 1.2.x uses malloc() by default for allocations, whereas earlier | ||
298 | versions used calloc(), which zeros out the allocated memory. | ||
299 | |||
300 | 37. Will zlib read the (insert any ancient or arcane format here) compressed | ||
299 | data format? | 301 | data format? |
300 | 302 | ||
301 | Probably not. Look in the comp.compression FAQ for pointers to various | 303 | Probably not. Look in the comp.compression FAQ for pointers to various |
302 | formats and associated software. | 304 | formats and associated software. |
303 | 305 | ||
304 | 37. How can I encrypt/decrypt zip files with zlib? | 306 | 38. How can I encrypt/decrypt zip files with zlib? |
305 | 307 | ||
306 | zlib doesn't support encryption. The original PKZIP encryption is very weak | 308 | zlib doesn't support encryption. The original PKZIP encryption is very weak |
307 | and can be broken with freely available programs. To get strong encryption, | 309 | and can be broken with freely available programs. To get strong encryption, |
308 | use GnuPG, http://www.gnupg.org/ , which already includes zlib compression. | 310 | use GnuPG, http://www.gnupg.org/ , which already includes zlib compression. |
309 | For PKZIP compatible "encryption", look at http://www.info-zip.org/ | 311 | For PKZIP compatible "encryption", look at http://www.info-zip.org/ |
310 | 312 | ||
311 | 38. What's the difference between the "gzip" and "deflate" HTTP 1.1 encodings? | 313 | 39. What's the difference between the "gzip" and "deflate" HTTP 1.1 encodings? |
312 | 314 | ||
313 | "gzip" is the gzip format, and "deflate" is the zlib format. They should | 315 | "gzip" is the gzip format, and "deflate" is the zlib format. They should |
314 | probably have called the second one "zlib" instead to avoid confusion | 316 | probably have called the second one "zlib" instead to avoid confusion |
@@ -324,14 +326,14 @@ The lastest zlib FAQ is at http://www.gzip.org/zlib/zlib_faq.html | |||
324 | 326 | ||
325 | Bottom line: use the gzip format for HTTP 1.1 encoding. | 327 | Bottom line: use the gzip format for HTTP 1.1 encoding. |
326 | 328 | ||
327 | 39. Does zlib support the new "Deflate64" format introduced by PKWare? | 329 | 40. Does zlib support the new "Deflate64" format introduced by PKWare? |
328 | 330 | ||
329 | No. PKWare has apparently decided to keep that format proprietary, since | 331 | No. PKWare has apparently decided to keep that format proprietary, since |
330 | they have not documented it as they have previous compression formats. | 332 | they have not documented it as they have previous compression formats. |
331 | In any case, the compression improvements are so modest compared to other | 333 | In any case, the compression improvements are so modest compared to other |
332 | more modern approaches, that it's not worth the effort to implement. | 334 | more modern approaches, that it's not worth the effort to implement. |
333 | 335 | ||
334 | 40. Can you please sign these lengthy legal documents and fax them back to us | 336 | 41. Can you please sign these lengthy legal documents and fax them back to us |
335 | so that we can use your software in our product? | 337 | so that we can use your software in our product? |
336 | 338 | ||
337 | No. Go away. Shoo. | 339 | No. Go away. Shoo. |
@@ -30,7 +30,7 @@ CPP=$(CC) -E | |||
30 | 30 | ||
31 | LIBS=libz.a | 31 | LIBS=libz.a |
32 | SHAREDLIB=libz.so | 32 | SHAREDLIB=libz.so |
33 | SHAREDLIBV=libz.so.1.2.2.1 | 33 | SHAREDLIBV=libz.so.1.2.2.2 |
34 | SHAREDLIBM=libz.so.1 | 34 | SHAREDLIBM=libz.so.1 |
35 | 35 | ||
36 | AR=ar rc | 36 | AR=ar rc |
diff --git a/Makefile.in b/Makefile.in index 7a6bd9a..29f53de 100644 --- a/Makefile.in +++ b/Makefile.in | |||
@@ -30,7 +30,7 @@ CPP=$(CC) -E | |||
30 | 30 | ||
31 | LIBS=libz.a | 31 | LIBS=libz.a |
32 | SHAREDLIB=libz.so | 32 | SHAREDLIB=libz.so |
33 | SHAREDLIBV=libz.so.1.2.2.1 | 33 | SHAREDLIBV=libz.so.1.2.2.2 |
34 | SHAREDLIBM=libz.so.1 | 34 | SHAREDLIBM=libz.so.1 |
35 | 35 | ||
36 | AR=ar rc | 36 | AR=ar rc |
@@ -1,6 +1,6 @@ | |||
1 | ZLIB DATA COMPRESSION LIBRARY | 1 | ZLIB DATA COMPRESSION LIBRARY |
2 | 2 | ||
3 | zlib 1.2.2.1 is a general purpose data compression library. All the code is | 3 | zlib 1.2.2.2 is a general purpose data compression library. All the code is |
4 | thread safe. The data format used by the zlib library is described by RFCs | 4 | thread safe. The data format used by the zlib library is described by RFCs |
5 | (Request for Comments) 1950 to 1952 in the files | 5 | (Request for Comments) 1950 to 1952 in the files |
6 | http://www.ietf.org/rfc/rfc1950.txt (zlib format), rfc1951.txt (deflate format) | 6 | http://www.ietf.org/rfc/rfc1950.txt (zlib format), rfc1951.txt (deflate format) |
@@ -16,9 +16,8 @@ minigzip.c. | |||
16 | 16 | ||
17 | To compile all files and run the test program, follow the instructions given at | 17 | To compile all files and run the test program, follow the instructions given at |
18 | the top of Makefile. In short "make test; make install" should work for most | 18 | the top of Makefile. In short "make test; make install" should work for most |
19 | machines. For Unix: "./configure; make test; make install" For MSDOS, use one | 19 | machines. For Unix: "./configure; make test; make install". For MSDOS, use one |
20 | of the special makefiles such as Makefile.msc. For VMS, use Make_vms.com or | 20 | of the special makefiles such as Makefile.msc. For VMS, use make_vms.com. |
21 | descrip.mms. | ||
22 | 21 | ||
23 | Questions about zlib should be sent to <zlib@gzip.org>, or to Gilles Vollant | 22 | Questions about zlib should be sent to <zlib@gzip.org>, or to Gilles Vollant |
24 | <info@winimage.com> for the Windows DLL version. The zlib home page is | 23 | <info@winimage.com> for the Windows DLL version. The zlib home page is |
@@ -34,7 +33,7 @@ Mark Nelson <markn@ieee.org> wrote an article about zlib for the Jan. 1997 | |||
34 | issue of Dr. Dobb's Journal; a copy of the article is available in | 33 | issue of Dr. Dobb's Journal; a copy of the article is available in |
35 | http://dogma.net/markn/articles/zlibtool/zlibtool.htm | 34 | http://dogma.net/markn/articles/zlibtool/zlibtool.htm |
36 | 35 | ||
37 | The changes made in version 1.2.2.1 are documented in the file ChangeLog. | 36 | The changes made in version 1.2.2.2 are documented in the file ChangeLog. |
38 | 37 | ||
39 | Unsupported third party contributions are provided in directory "contrib". | 38 | Unsupported third party contributions are provided in directory "contrib". |
40 | 39 | ||
@@ -12,12 +12,13 @@ | |||
12 | #define NMAX 5552 | 12 | #define NMAX 5552 |
13 | /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ | 13 | /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ |
14 | 14 | ||
15 | #define DO1(buf,i) {s1 += buf[i]; s2 += s1;} | 15 | #define DO1(buf,i) {adler += (buf)[i]; sum2 += adler;} |
16 | #define DO2(buf,i) DO1(buf,i); DO1(buf,i+1); | 16 | #define DO2(buf,i) DO1(buf,i); DO1(buf,i+1); |
17 | #define DO4(buf,i) DO2(buf,i); DO2(buf,i+2); | 17 | #define DO4(buf,i) DO2(buf,i); DO2(buf,i+2); |
18 | #define DO8(buf,i) DO4(buf,i); DO4(buf,i+4); | 18 | #define DO8(buf,i) DO4(buf,i); DO4(buf,i+4); |
19 | #define DO16(buf) DO8(buf,0); DO8(buf,8); | 19 | #define DO16(buf) DO8(buf,0); DO8(buf,8); |
20 | 20 | ||
21 | /* use NO_DIVIDE if your processor does not do division in hardware */ | ||
21 | #ifdef NO_DIVIDE | 22 | #ifdef NO_DIVIDE |
22 | # define MOD(a) \ | 23 | # define MOD(a) \ |
23 | do { \ | 24 | do { \ |
@@ -39,8 +40,17 @@ | |||
39 | if (a >= (BASE << 1)) a -= (BASE << 1); \ | 40 | if (a >= (BASE << 1)) a -= (BASE << 1); \ |
40 | if (a >= BASE) a -= BASE; \ | 41 | if (a >= BASE) a -= BASE; \ |
41 | } while (0) | 42 | } while (0) |
43 | # define MOD4(a) \ | ||
44 | do { \ | ||
45 | if (a >= (BASE << 4)) a -= (BASE << 4); \ | ||
46 | if (a >= (BASE << 3)) a -= (BASE << 3); \ | ||
47 | if (a >= (BASE << 2)) a -= (BASE << 2); \ | ||
48 | if (a >= (BASE << 1)) a -= (BASE << 1); \ | ||
49 | if (a >= BASE) a -= BASE; \ | ||
50 | } while (0) | ||
42 | #else | 51 | #else |
43 | # define MOD(a) a %= BASE | 52 | # define MOD(a) a %= BASE |
53 | # define MOD4(a) a %= BASE | ||
44 | #endif | 54 | #endif |
45 | 55 | ||
46 | /* ========================================================================= */ | 56 | /* ========================================================================= */ |
@@ -49,48 +59,91 @@ uLong ZEXPORT adler32(adler, buf, len) | |||
49 | const Bytef *buf; | 59 | const Bytef *buf; |
50 | uInt len; | 60 | uInt len; |
51 | { | 61 | { |
52 | unsigned long s1 = adler & 0xffff; | 62 | unsigned long sum2; |
53 | unsigned long s2 = (adler >> 16) & 0xffff; | 63 | unsigned n; |
54 | int k; | 64 | |
65 | /* split Adler-32 into component sums */ | ||
66 | sum2 = (adler >> 16) & 0xffff; | ||
67 | adler &= 0xffff; | ||
68 | |||
69 | /* in case user likes doing a byte at a time, keep it fast */ | ||
70 | if (len == 1) { | ||
71 | adler += buf[0]; | ||
72 | if (adler >= BASE) | ||
73 | adler -= BASE; | ||
74 | sum2 += adler; | ||
75 | if (sum2 >= BASE) | ||
76 | sum2 -= BASE; | ||
77 | return adler | (sum2 << 16); | ||
78 | } | ||
55 | 79 | ||
56 | if (buf == Z_NULL) return 1L; | 80 | /* initial Adler-32 value (deferred check for len == 1 speed) */ |
81 | if (buf == Z_NULL) | ||
82 | return 1L; | ||
57 | 83 | ||
58 | while (len > 0) { | 84 | /* in case short lengths are provided, keep it somewhat fast */ |
59 | k = len < NMAX ? (int)len : NMAX; | 85 | if (len < 16) { |
60 | len -= k; | 86 | while (len--) { |
61 | while (k >= 16) { | 87 | adler += *buf++; |
88 | sum2 += adler; | ||
89 | } | ||
90 | if (adler >= BASE) | ||
91 | adler -= BASE; | ||
92 | MOD4(sum2); /* only added so many BASE's */ | ||
93 | return adler | (sum2 << 16); | ||
94 | } | ||
95 | |||
96 | /* do length NMAX blocks -- requires just one modulo operation */ | ||
97 | while (len >= NMAX) { | ||
98 | len -= NMAX; | ||
99 | n = NMAX / 16; /* NMAX is divisible by 16 */ | ||
100 | do { | ||
101 | DO16(buf); /* 16 sums unrolled */ | ||
102 | buf += 16; | ||
103 | } while (--n); | ||
104 | MOD(adler); | ||
105 | MOD(sum2); | ||
106 | } | ||
107 | |||
108 | /* do remaining bytes (less than NMAX, still just one modulo) */ | ||
109 | if (len) { /* avoid modulos if none remaining */ | ||
110 | while (len >= 16) { | ||
111 | len -= 16; | ||
62 | DO16(buf); | 112 | DO16(buf); |
63 | buf += 16; | 113 | buf += 16; |
64 | k -= 16; | ||
65 | } | 114 | } |
66 | if (k != 0) do { | 115 | while (len--) { |
67 | s1 += *buf++; | 116 | adler += *buf++; |
68 | s2 += s1; | 117 | sum2 += adler; |
69 | } while (--k); | 118 | } |
70 | MOD(s1); | 119 | MOD(adler); |
71 | MOD(s2); | 120 | MOD(sum2); |
72 | } | 121 | } |
73 | return (s2 << 16) | s1; | 122 | |
123 | /* return recombined sums */ | ||
124 | return adler | (sum2 << 16); | ||
74 | } | 125 | } |
75 | 126 | ||
76 | /* ========================================================================= */ | 127 | /* ========================================================================= */ |
77 | uLong ZEXPORT adler32_combine(adler1, adler2, len2) | 128 | uLong ZEXPORT adler32_combine(adler1, adler2, len2) |
78 | uLong adler1; | 129 | uLong adler1; |
79 | uLong adler2; | 130 | uLong adler2; |
80 | uLong len2; | 131 | z_off_t len2; |
81 | { | 132 | { |
82 | unsigned long s1; | 133 | unsigned long sum1; |
83 | unsigned long s2; | 134 | unsigned long sum2; |
135 | unsigned rem; | ||
84 | 136 | ||
85 | len2 %= BASE; | 137 | /* the derivation of this formula is left as an exercise for the reader */ |
86 | s1 = adler1 & 0xffff; | 138 | rem = (unsigned)(len2 % BASE); |
87 | s2 = len2 * s1; | 139 | sum1 = adler1 & 0xffff; |
88 | MOD(s2); | 140 | sum2 = rem * sum1; |
89 | s1 += (adler2 & 0xffff) + BASE - 1; | 141 | MOD(sum2); |
90 | s2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - len2; | 142 | sum1 += (adler2 & 0xffff) + BASE - 1; |
91 | if (s1 > BASE) s1 -= BASE; | 143 | sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem; |
92 | if (s1 > BASE) s1 -= BASE; | 144 | if (sum1 > BASE) sum1 -= BASE; |
93 | if (s2 > (BASE << 1)) s2 -= (BASE << 1); | 145 | if (sum1 > BASE) sum1 -= BASE; |
94 | if (s2 > BASE) s2 -= BASE; | 146 | if (sum2 > (BASE << 1)) sum2 -= (BASE << 1); |
95 | return (s2 << 16) | s1; | 147 | if (sum2 > BASE) sum2 -= BASE; |
148 | return sum1 | (sum2 << 16); | ||
96 | } | 149 | } |
diff --git a/as400/zlib.inc b/as400/zlib.inc index f85473e..04c3309 100644 --- a/as400/zlib.inc +++ b/as400/zlib.inc | |||
@@ -1,7 +1,7 @@ | |||
1 | * ZLIB.INC - Interface to the general purpose compression library | 1 | * ZLIB.INC - Interface to the general purpose compression library |
2 | * | 2 | * |
3 | * ILE RPG400 version by Patrick Monnerat, DATASPHERE. | 3 | * ILE RPG400 version by Patrick Monnerat, DATASPHERE. |
4 | * Version 1.2.2.1 | 4 | * Version 1.2.2.2 |
5 | * | 5 | * |
6 | * | 6 | * |
7 | * WARNING: | 7 | * WARNING: |
@@ -20,8 +20,8 @@ | |||
20 | * Constants | 20 | * Constants |
21 | ************************************************************************** | 21 | ************************************************************************** |
22 | * | 22 | * |
23 | D ZLIB_VERSION C '1.2.2.1' Header's version | 23 | D ZLIB_VERSION C '1.2.2.2' Header's version |
24 | D ZLIB_VERNUM C X'1221' | 24 | D ZLIB_VERNUM C X'1222' |
25 | * | 25 | * |
26 | D Z_NO_FLUSH C 0 | 26 | D Z_NO_FLUSH C 0 |
27 | D Z_SYNC_FLUSH C 2 | 27 | D Z_SYNC_FLUSH C 2 |
@@ -89,7 +89,7 @@ if test "$gcc" -eq 1 && ($cc -c $cflags $test.c) 2>/dev/null; then | |||
89 | SHAREDLIB=libz$shared_ext | 89 | SHAREDLIB=libz$shared_ext |
90 | SHAREDLIBV=libz.$VER$shared_ext | 90 | SHAREDLIBV=libz.$VER$shared_ext |
91 | SHAREDLIBM=libz.$VER1$shared_ext | 91 | SHAREDLIBM=libz.$VER1$shared_ext |
92 | LDSHARED=${LDSHARED-"$cc -dynamiclib -install_name $libdir/$SHAREDLIBV -compatibility_version $VER2 -current_version $VER"};; | 92 | LDSHARED=${LDSHARED-"$cc -dynamiclib -install_name $libdir/$SHAREDLIBM -compatibility_version $VER1 -current_version $VER"};; |
93 | *) LDSHARED=${LDSHARED-"$cc -shared"};; | 93 | *) LDSHARED=${LDSHARED-"$cc -shared"};; |
94 | esac | 94 | esac |
95 | else | 95 | else |
@@ -125,6 +125,9 @@ else | |||
125 | SunOS\ 4*) SFLAGS=${CFLAGS-"-O2 -PIC"} | 125 | SunOS\ 4*) SFLAGS=${CFLAGS-"-O2 -PIC"} |
126 | CFLAGS=${CFLAGS-"-O2"} | 126 | CFLAGS=${CFLAGS-"-O2"} |
127 | LDSHARED=${LDSHARED-"ld"};; | 127 | LDSHARED=${LDSHARED-"ld"};; |
128 | SunStudio\ 9*) SFLAGS=${CFLAGS-"-DUSE_MMAP -fast -xcode=pic32 -xtarget=ultra3 -xarch=v9b"} | ||
129 | CFLAGS=${CFLAGS-"-DUSE_MMAP -fast -xtarget=ultra3 -xarch=v9b"} | ||
130 | LDSHARED=${LDSHARED-"cc -xarch=v9b"};; | ||
128 | UNIX_System_V\ 4.2.0) | 131 | UNIX_System_V\ 4.2.0) |
129 | SFLAGS=${CFLAGS-"-KPIC -O"} | 132 | SFLAGS=${CFLAGS-"-KPIC -O"} |
130 | CFLAGS=${CFLAGS-"-O"} | 133 | CFLAGS=${CFLAGS-"-O"} |
diff --git a/contrib/README.contrib b/contrib/README.contrib index 7778980..732d48c 100644 --- a/contrib/README.contrib +++ b/contrib/README.contrib | |||
@@ -22,9 +22,6 @@ delphi/ by Cosmin Truta <cosmint@cs.ubbcluj.ro> | |||
22 | dotzlib/ by Henrik Ravn <henrik@ravn.com> | 22 | dotzlib/ by Henrik Ravn <henrik@ravn.com> |
23 | Support for Microsoft .Net and Visual C++ .Net | 23 | Support for Microsoft .Net and Visual C++ .Net |
24 | 24 | ||
25 | gzappend/ by Mark Adler <madler@alumni.caltech.edu> | ||
26 | append to a gzip file -- illustrates the use of Z_BLOCK | ||
27 | |||
28 | infback9/ by Mark Adler <madler@alumni.caltech.edu> | 25 | infback9/ by Mark Adler <madler@alumni.caltech.edu> |
29 | Unsupported diffs to infback to decode the deflate64 format | 26 | Unsupported diffs to infback to decode the deflate64 format |
30 | 27 | ||
diff --git a/contrib/delphi/ZLib.pas b/contrib/delphi/ZLib.pas index 8853866..b9d33e2 100644 --- a/contrib/delphi/ZLib.pas +++ b/contrib/delphi/ZLib.pas | |||
@@ -344,7 +344,7 @@ begin | |||
344 | strm.avail_out := OutBytes; | 344 | strm.avail_out := OutBytes; |
345 | DCheck(inflateInit_(strm, zlib_version, sizeof(strm))); | 345 | DCheck(inflateInit_(strm, zlib_version, sizeof(strm))); |
346 | try | 346 | try |
347 | while DCheck(inflate(strm, Z_FINISH)) <> Z_STREAM_END do | 347 | while DCheck(inflate(strm, Z_NO_FLUSH)) <> Z_STREAM_END do |
348 | begin | 348 | begin |
349 | P := OutBuf; | 349 | P := OutBuf; |
350 | Inc(OutBytes, BufInc); | 350 | Inc(OutBytes, BufInc); |
diff --git a/contrib/infback9/inftree9.c b/contrib/infback9/inftree9.c index 7325873..29bef6a 100644 --- a/contrib/infback9/inftree9.c +++ b/contrib/infback9/inftree9.c | |||
@@ -9,7 +9,7 @@ | |||
9 | #define MAXBITS 15 | 9 | #define MAXBITS 15 |
10 | 10 | ||
11 | const char inflate9_copyright[] = | 11 | const char inflate9_copyright[] = |
12 | " inflate9 1.2.2.1 Copyright 1995-2004 Mark Adler "; | 12 | " inflate9 1.2.2.2 Copyright 1995-2004 Mark Adler "; |
13 | /* | 13 | /* |
14 | If you use the zlib library in a product, an acknowledgment is welcome | 14 | If you use the zlib library in a product, an acknowledgment is welcome |
15 | in the documentation of your product. If for some reason you cannot | 15 | in the documentation of your product. If for some reason you cannot |
@@ -64,7 +64,7 @@ unsigned short FAR *work; | |||
64 | static const unsigned short lext[31] = { /* Length codes 257..285 extra */ | 64 | static const unsigned short lext[31] = { /* Length codes 257..285 extra */ |
65 | 128, 128, 128, 128, 128, 128, 128, 128, 129, 129, 129, 129, | 65 | 128, 128, 128, 128, 128, 128, 128, 128, 129, 129, 129, 129, |
66 | 130, 130, 130, 130, 131, 131, 131, 131, 132, 132, 132, 132, | 66 | 130, 130, 130, 130, 131, 131, 131, 131, 132, 132, 132, 132, |
67 | 133, 133, 133, 133, 144, 77, 207}; | 67 | 133, 133, 133, 133, 144, 72, 199}; |
68 | static const unsigned short dbase[32] = { /* Distance codes 0..31 base */ | 68 | static const unsigned short dbase[32] = { /* Distance codes 0..31 base */ |
69 | 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, | 69 | 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, |
70 | 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, | 70 | 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, |
diff --git a/contrib/masmx86/gvmat32.asm b/contrib/masmx86/gvmat32.asm index ec360e6..e841a7f 100644 --- a/contrib/masmx86/gvmat32.asm +++ b/contrib/masmx86/gvmat32.asm | |||
@@ -47,21 +47,25 @@ | |||
47 | 47 | ||
48 | 48 | ||
49 | 49 | ||
50 | ; all the +4 offsets are due to the addition of pending_buf_size (in zlib | 50 | ; all the +addstr offsets are due to the addition of pending_buf_size in zlib 1.04 |
51 | ; and adding gzhead and gzindex in zlib 1.2.2.1 | ||
51 | ; in the deflate_state structure since the asm code was first written | 52 | ; in the deflate_state structure since the asm code was first written |
52 | ; (if you compile with zlib 1.0.4 or older, remove the +4). | 53 | ; (if you compile with zlib 1.0.4 or older, set addstr to 0). |
54 | ; (if you compiler with zlib between 1.04 and 1.2.1, set addstr to 4) | ||
53 | ; Note : these value are good with a 8 bytes boundary pack structure | 55 | ; Note : these value are good with a 8 bytes boundary pack structure |
54 | dep_chain_length equ 70h+4 | 56 | |
55 | dep_window equ 2ch+4 | 57 | addstr equ 4+8 |
56 | dep_strstart equ 60h+4 | 58 | dep_chain_length equ 70h+addstr |
57 | dep_prev_length equ 6ch+4 | 59 | dep_window equ 2ch+addstr |
58 | dep_nice_match equ 84h+4 | 60 | dep_strstart equ 60h+addstr |
59 | dep_w_size equ 20h+4 | 61 | dep_prev_length equ 6ch+addstr |
60 | dep_prev equ 34h+4 | 62 | dep_nice_match equ 84h+addstr |
61 | dep_w_mask equ 28h+4 | 63 | dep_w_size equ 20h+addstr |
62 | dep_good_match equ 80h+4 | 64 | dep_prev equ 34h+addstr |
63 | dep_match_start equ 64h+4 | 65 | dep_w_mask equ 28h+addstr |
64 | dep_lookahead equ 68h+4 | 66 | dep_good_match equ 80h+addstr |
67 | dep_match_start equ 64h+addstr | ||
68 | dep_lookahead equ 68h+addstr | ||
65 | 69 | ||
66 | 70 | ||
67 | _TEXT segment | 71 | _TEXT segment |
@@ -597,19 +601,19 @@ curmatch equ esp + 60 | |||
597 | ;;; program to crash horribly, without so much as a warning at | 601 | ;;; program to crash horribly, without so much as a warning at |
598 | ;;; compile time. Sigh.) | 602 | ;;; compile time. Sigh.) |
599 | 603 | ||
600 | dsWSize equ 36 | 604 | dsWSize equ 36+addstr-4 |
601 | dsWMask equ 44 | 605 | dsWMask equ 44+addstr-4 |
602 | dsWindow equ 48 | 606 | dsWindow equ 48+addstr-4 |
603 | dsPrev equ 56 | 607 | dsPrev equ 56+addstr-4 |
604 | dsMatchLen equ 88 | 608 | dsMatchLen equ 88+addstr-4 |
605 | dsPrevMatch equ 92 | 609 | dsPrevMatch equ 92+addstr-4 |
606 | dsStrStart equ 100 | 610 | dsStrStart equ 100+addstr-4 |
607 | dsMatchStart equ 104 | 611 | dsMatchStart equ 104+addstr-4 |
608 | dsLookahead equ 108 | 612 | dsLookahead equ 108+addstr-4 |
609 | dsPrevLen equ 112 | 613 | dsPrevLen equ 112+addstr-4 |
610 | dsMaxChainLen equ 116 | 614 | dsMaxChainLen equ 116+addstr-4 |
611 | dsGoodMatch equ 132 | 615 | dsGoodMatch equ 132+addstr-4 |
612 | dsNiceMatch equ 136 | 616 | dsNiceMatch equ 136+addstr-4 |
613 | 617 | ||
614 | 618 | ||
615 | ;;; match.asm -- Pentium-Pro-optimized version of longest_match() | 619 | ;;; match.asm -- Pentium-Pro-optimized version of longest_match() |
diff --git a/contrib/masmx86/inffas32.asm b/contrib/masmx86/inffas32.asm index 7d76e1c..531bcef 100644 --- a/contrib/masmx86/inffas32.asm +++ b/contrib/masmx86/inffas32.asm | |||
@@ -84,17 +84,20 @@ dd 2147483647 | |||
84 | dd 4294967295 | 84 | dd 4294967295 |
85 | 85 | ||
86 | 86 | ||
87 | ; head was added in zlib 1.2.2.1, so we add addstr | ||
88 | ; set addstr to 0 with zlib 1.2.1 of below | ||
89 | addstr equ 4 | ||
87 | 90 | ||
88 | mode_state equ 0 ;/* state->mode */ | 91 | mode_state equ 0 ;/* state->mode */ |
89 | wsize_state equ 32 ;/* state->wsize */ | 92 | wsize_state equ 32+addstr ;/* state->wsize */ |
90 | write_state equ (36+4) ;/* state->write */ | 93 | write_state equ (36+4+addstr) ;/* state->write */ |
91 | window_state equ (40+4) ;/* state->window */ | 94 | window_state equ (40+4+addstr) ;/* state->window */ |
92 | hold_state equ (44+4) ;/* state->hold */ | 95 | hold_state equ (44+4+addstr) ;/* state->hold */ |
93 | bits_state equ (48+4) ;/* state->bits */ | 96 | bits_state equ (48+4+addstr) ;/* state->bits */ |
94 | lencode_state equ (64+4) ;/* state->lencode */ | 97 | lencode_state equ (64+4+addstr) ;/* state->lencode */ |
95 | distcode_state equ (68+4) ;/* state->distcode */ | 98 | distcode_state equ (68+4+addstr) ;/* state->distcode */ |
96 | lenbits_state equ (72+4) ;/* state->lenbits */ | 99 | lenbits_state equ (72+4+addstr) ;/* state->lenbits */ |
97 | distbits_state equ (76+4) ;/* state->distbits */ | 100 | distbits_state equ (76+4+addstr) ;/* state->distbits */ |
98 | 101 | ||
99 | 102 | ||
100 | ;;SECTION .text | 103 | ;;SECTION .text |
diff --git a/contrib/vstudio/readme.txt b/contrib/vstudio/readme.txt index 3a4b85c..e709d1b 100644 --- a/contrib/vstudio/readme.txt +++ b/contrib/vstudio/readme.txt | |||
@@ -1,4 +1,4 @@ | |||
1 | Building instructions for the DLL versions of Zlib 1.21 | 1 | Building instructions for the DLL versions of Zlib 1.2.x |
2 | ======================================================= | 2 | ======================================================= |
3 | 3 | ||
4 | This directory contains projects that build zlib and minizip using | 4 | This directory contains projects that build zlib and minizip using |
diff --git a/contrib/vstudio/vc7/zlib.rc b/contrib/vstudio/vc7/zlib.rc index cb779f7..d35cef0 100644 --- a/contrib/vstudio/vc7/zlib.rc +++ b/contrib/vstudio/vc7/zlib.rc | |||
@@ -2,8 +2,8 @@ | |||
2 | 2 | ||
3 | #define IDR_VERSION1 1 | 3 | #define IDR_VERSION1 1 |
4 | IDR_VERSION1 VERSIONINFO MOVEABLE IMPURE LOADONCALL DISCARDABLE | 4 | IDR_VERSION1 VERSIONINFO MOVEABLE IMPURE LOADONCALL DISCARDABLE |
5 | FILEVERSION 1,2,2,1 | 5 | FILEVERSION 1,2,2,2 |
6 | PRODUCTVERSION 1,2,2,1 | 6 | PRODUCTVERSION 1,2,2,2 |
7 | FILEFLAGSMASK VS_FFI_FILEFLAGSMASK | 7 | FILEFLAGSMASK VS_FFI_FILEFLAGSMASK |
8 | FILEFLAGS 0 | 8 | FILEFLAGS 0 |
9 | FILEOS VOS_DOS_WINDOWS32 | 9 | FILEOS VOS_DOS_WINDOWS32 |
@@ -17,7 +17,7 @@ BEGIN | |||
17 | 17 | ||
18 | BEGIN | 18 | BEGIN |
19 | VALUE "FileDescription", "zlib data compression library\0" | 19 | VALUE "FileDescription", "zlib data compression library\0" |
20 | VALUE "FileVersion", "1.2.2.1\0" | 20 | VALUE "FileVersion", "1.2.2.2\0" |
21 | VALUE "InternalName", "zlib\0" | 21 | VALUE "InternalName", "zlib\0" |
22 | VALUE "OriginalFilename", "zlib.dll\0" | 22 | VALUE "OriginalFilename", "zlib.dll\0" |
23 | VALUE "ProductName", "ZLib.DLL\0" | 23 | VALUE "ProductName", "ZLib.DLL\0" |
@@ -369,7 +369,7 @@ local void gf2_matrix_square(square, mat) | |||
369 | uLong ZEXPORT crc32_combine(crc1, crc2, len2) | 369 | uLong ZEXPORT crc32_combine(crc1, crc2, len2) |
370 | uLong crc1; | 370 | uLong crc1; |
371 | uLong crc2; | 371 | uLong crc2; |
372 | uLong len2; | 372 | z_off_t len2; |
373 | { | 373 | { |
374 | int n; | 374 | int n; |
375 | unsigned long row; | 375 | unsigned long row; |
@@ -52,7 +52,7 @@ | |||
52 | #include "deflate.h" | 52 | #include "deflate.h" |
53 | 53 | ||
54 | const char deflate_copyright[] = | 54 | const char deflate_copyright[] = |
55 | " deflate 1.2.2.1 Copyright 1995-2004 Jean-loup Gailly "; | 55 | " deflate 1.2.2.2 Copyright 1995-2004 Jean-loup Gailly "; |
56 | /* | 56 | /* |
57 | If you use the zlib library in a product, an acknowledgment is welcome | 57 | If you use the zlib library in a product, an acknowledgment is welcome |
58 | in the documentation of your product. If for some reason you cannot | 58 | in the documentation of your product. If for some reason you cannot |
@@ -264,7 +264,7 @@ int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy, | |||
264 | #endif | 264 | #endif |
265 | if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED || | 265 | if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED || |
266 | windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || | 266 | windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || |
267 | strategy < 0 || strategy > Z_RLE) { | 267 | strategy < 0 || strategy > Z_FIXED) { |
268 | return Z_STREAM_ERROR; | 268 | return Z_STREAM_ERROR; |
269 | } | 269 | } |
270 | if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */ | 270 | if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */ |
@@ -432,7 +432,7 @@ int ZEXPORT deflateParams(strm, level, strategy) | |||
432 | #else | 432 | #else |
433 | if (level == Z_DEFAULT_COMPRESSION) level = 6; | 433 | if (level == Z_DEFAULT_COMPRESSION) level = 6; |
434 | #endif | 434 | #endif |
435 | if (level < 0 || level > 9 || strategy < 0 || strategy > Z_RLE) { | 435 | if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) { |
436 | return Z_STREAM_ERROR; | 436 | return Z_STREAM_ERROR; |
437 | } | 437 | } |
438 | func = configuration_table[s->level].func; | 438 | func = configuration_table[s->level].func; |
@@ -573,7 +573,7 @@ int ZEXPORT deflate (strm, flush) | |||
573 | put_byte(s, s->level == 9 ? 2 : | 573 | put_byte(s, s->level == 9 ? 2 : |
574 | (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ? | 574 | (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ? |
575 | 4 : 0)); | 575 | 4 : 0)); |
576 | put_byte(s, 255); | 576 | put_byte(s, OS_CODE); |
577 | s->status = BUSY_STATE; | 577 | s->status = BUSY_STATE; |
578 | } | 578 | } |
579 | else { | 579 | else { |
@@ -892,12 +892,12 @@ int ZEXPORT deflateCopy (dest, source) | |||
892 | 892 | ||
893 | ss = source->state; | 893 | ss = source->state; |
894 | 894 | ||
895 | *dest = *source; | 895 | zmemcpy(dest, source, sizeof(z_stream)); |
896 | 896 | ||
897 | ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state)); | 897 | ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state)); |
898 | if (ds == Z_NULL) return Z_MEM_ERROR; | 898 | if (ds == Z_NULL) return Z_MEM_ERROR; |
899 | dest->state = (struct internal_state FAR *) ds; | 899 | dest->state = (struct internal_state FAR *) ds; |
900 | *ds = *ss; | 900 | zmemcpy(ds, ss, sizeof(deflate_state)); |
901 | ds->strm = dest; | 901 | ds->strm = dest; |
902 | 902 | ||
903 | ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte)); | 903 | ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte)); |
@@ -1057,7 +1057,12 @@ local uInt longest_match(s, cur_match) | |||
1057 | match = s->window + cur_match; | 1057 | match = s->window + cur_match; |
1058 | 1058 | ||
1059 | /* Skip to next match if the match length cannot increase | 1059 | /* Skip to next match if the match length cannot increase |
1060 | * or if the match length is less than 2: | 1060 | * or if the match length is less than 2. Note that the checks below |
1061 | * for insufficient lookahead only occur occasionally for performance | ||
1062 | * reasons. Therefore uninitialized memory will be accessed, and | ||
1063 | * conditional jumps will be made that depend on those values. | ||
1064 | * However the length of the match is limited to the lookahead, so | ||
1065 | * the output of deflate is not affected by the uninitialized values. | ||
1061 | */ | 1066 | */ |
1062 | #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) | 1067 | #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) |
1063 | /* This code assumes sizeof(unsigned short) == 2. Do not use | 1068 | /* This code assumes sizeof(unsigned short) == 2. Do not use |
@@ -1457,12 +1462,12 @@ local block_state deflate_fast(s, flush) | |||
1457 | * of the string with itself at the start of the input file). | 1462 | * of the string with itself at the start of the input file). |
1458 | */ | 1463 | */ |
1459 | #ifdef FASTEST | 1464 | #ifdef FASTEST |
1460 | if ((s->strategy < Z_HUFFMAN_ONLY) || | 1465 | if ((s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) || |
1461 | (s->strategy == Z_RLE && s->strstart - hash_head == 1)) { | 1466 | (s->strategy == Z_RLE && s->strstart - hash_head == 1)) { |
1462 | s->match_length = longest_match_fast (s, hash_head); | 1467 | s->match_length = longest_match_fast (s, hash_head); |
1463 | } | 1468 | } |
1464 | #else | 1469 | #else |
1465 | if (s->strategy < Z_HUFFMAN_ONLY) { | 1470 | if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) { |
1466 | s->match_length = longest_match (s, hash_head); | 1471 | s->match_length = longest_match (s, hash_head); |
1467 | } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) { | 1472 | } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) { |
1468 | s->match_length = longest_match_fast (s, hash_head); | 1473 | s->match_length = longest_match_fast (s, hash_head); |
@@ -1566,7 +1571,7 @@ local block_state deflate_slow(s, flush) | |||
1566 | * of window index 0 (in particular we have to avoid a match | 1571 | * of window index 0 (in particular we have to avoid a match |
1567 | * of the string with itself at the start of the input file). | 1572 | * of the string with itself at the start of the input file). |
1568 | */ | 1573 | */ |
1569 | if (s->strategy < Z_HUFFMAN_ONLY) { | 1574 | if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) { |
1570 | s->match_length = longest_match (s, hash_head); | 1575 | s->match_length = longest_match (s, hash_head); |
1571 | } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) { | 1576 | } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) { |
1572 | s->match_length = longest_match_fast (s, hash_head); | 1577 | s->match_length = longest_match_fast (s, hash_head); |
diff --git a/examples/README.examples b/examples/README.examples new file mode 100644 index 0000000..1084525 --- /dev/null +++ b/examples/README.examples | |||
@@ -0,0 +1,29 @@ | |||
1 | This directory contains examples of the use of zlib. | ||
2 | |||
3 | fitblk.c | ||
4 | compress just enough input to nearly fill a requested output size | ||
5 | - zlib isn't designed to do this, but fitblk does it anyway | ||
6 | |||
7 | gzappend.c | ||
8 | append to a gzip file | ||
9 | - illustrates the use of the Z_BLOCK flush parameter for inflate() | ||
10 | - illustrates the use of deflatePrime() to start at any bit | ||
11 | |||
12 | gzjoin.c | ||
13 | join gzip files without recalculating the crc or recompressing | ||
14 | - illustrates the use of the Z_BLOCK flush parameter for inflate() | ||
15 | - illustrates the use of crc32_combine() | ||
16 | |||
17 | gzlog.c | ||
18 | gzlog.h | ||
19 | efficiently maintain a message log file in gzip format | ||
20 | - illustrates use of raw deflate and Z_SYNC_FLUSH | ||
21 | - illustrates use of gzip header extra field | ||
22 | |||
23 | zlib_how.html | ||
24 | painfully comprehensive description of zpipe.c (see below) | ||
25 | - describes in excruciating detail the use of deflate() and inflate() | ||
26 | |||
27 | zpipe.c | ||
28 | reads and writes zlib streams from stdin to stdout | ||
29 | - illustrates the proper use of deflate() and inflate() | ||
diff --git a/examples/fitblk.c b/examples/fitblk.c new file mode 100644 index 0000000..5f83114 --- /dev/null +++ b/examples/fitblk.c | |||
@@ -0,0 +1,235 @@ | |||
1 | /* fitblk.c: example of fitting compressed output to a specified size | ||
2 | Not copyrighted -- provided to the public domain | ||
3 | Version 1.1 25 November 2004 Mark Adler */ | ||
4 | |||
5 | /* Version history: | ||
6 | 1.0 24 Nov 2004 First version | ||
7 | 1.1 25 Nov 2004 Change deflateInit2() to deflateInit() | ||
8 | Use fixed-size, stack-allocated raw buffers | ||
9 | Simplify code moving compression to subroutines | ||
10 | Use assert() for internal errors | ||
11 | Add detailed description of approach | ||
12 | */ | ||
13 | |||
14 | /* Approach to just fitting a requested compressed size: | ||
15 | |||
16 | fitblk performs three compression passes on a portion of the input | ||
17 | data in order to determine how much of that input will compress to | ||
18 | nearly the requested output block size. The first pass generates | ||
19 | enough deflate blocks to produce output to fill the requested | ||
20 | output size plus a specfied excess amount (see the EXCESS define | ||
21 | below). The last deflate block may go quite a bit past that, but | ||
22 | is discarded. The second pass decompresses and recompresses just | ||
23 | the compressed data that fit in the requested plus excess sized | ||
24 | buffer. The deflate process is terminated after that amount of | ||
25 | input, which is less than the amount consumed on the first pass. | ||
26 | The last deflate block of the result will be of a comparable size | ||
27 | to the final product, so that the header for that deflate block and | ||
28 | the compression ratio for that block will be about the same as in | ||
29 | the final product. The third compression pass decompresses the | ||
30 | result of the second step, but only the compressed data up to the | ||
31 | requested size minus an amount to allow the compressed stream to | ||
32 | complete (see the MARGIN define below). That will result in a | ||
33 | final compressed stream whose length is less than or equal to the | ||
34 | requested size. Assuming sufficient input and a requested size | ||
35 | greater than a few hundred bytes, the shortfall will typically be | ||
36 | less than ten bytes. | ||
37 | |||
38 | If the input is short enough that the first compression completes | ||
39 | before filling the requested output size, then that compressed | ||
40 | stream is return with no recompression. | ||
41 | |||
42 | EXCESS is chosen to be just greater than the shortfall seen in a | ||
43 | two pass approach similar to the above. That shortfall is due to | ||
44 | the last deflate block compressing more efficiently with a smaller | ||
45 | header on the second pass. EXCESS is set to be large enough so | ||
46 | that there is enough uncompressed data for the second pass to fill | ||
47 | out the requested size, and small enough so that the final deflate | ||
48 | block of the second pass will be close in size to the final deflate | ||
49 | block of the third and final pass. MARGIN is chosen to be just | ||
50 | large enough to assure that the final compression has enough room | ||
51 | to complete in all cases. | ||
52 | */ | ||
53 | |||
54 | #include <stdio.h> | ||
55 | #include <stdlib.h> | ||
56 | #include <assert.h> | ||
57 | #include "zlib.h" | ||
58 | |||
59 | #define local static | ||
60 | |||
61 | /* print nastygram and leave */ | ||
62 | local void quit(char *why) | ||
63 | { | ||
64 | fprintf(stderr, "fitblk abort: %s\n", why); | ||
65 | exit(1); | ||
66 | } | ||
67 | |||
68 | #define RAWLEN 4096 /* intermediate uncompressed buffer size */ | ||
69 | |||
70 | /* compress from file to def until provided buffer is full or end of | ||
71 | input reached; return last deflate() return value, or Z_ERRNO if | ||
72 | there was read error on the file */ | ||
73 | local int partcompress(FILE *in, z_streamp def) | ||
74 | { | ||
75 | int ret, flush; | ||
76 | char raw[RAWLEN]; | ||
77 | |||
78 | flush = Z_NO_FLUSH; | ||
79 | do { | ||
80 | def->avail_in = fread(raw, 1, RAWLEN, in); | ||
81 | if (ferror(in)) | ||
82 | return Z_ERRNO; | ||
83 | def->next_in = raw; | ||
84 | if (feof(in)) | ||
85 | flush = Z_FINISH; | ||
86 | ret = deflate(def, flush); | ||
87 | assert(ret != Z_STREAM_ERROR); | ||
88 | } while (def->avail_out != 0 && flush == Z_NO_FLUSH); | ||
89 | return ret; | ||
90 | } | ||
91 | |||
92 | /* recompress from inf's input to def's output; the input for inf and | ||
93 | the output for def are set in those structures before calling; | ||
94 | return last deflate() return value, or Z_MEM_ERROR if inflate() | ||
95 | was not able to allocate enough memory when it needed to */ | ||
96 | local int recompress(z_streamp inf, z_streamp def) | ||
97 | { | ||
98 | int ret, flush; | ||
99 | char raw[RAWLEN]; | ||
100 | |||
101 | flush = Z_NO_FLUSH; | ||
102 | do { | ||
103 | /* decompress */ | ||
104 | inf->avail_out = RAWLEN; | ||
105 | inf->next_out = raw; | ||
106 | ret = inflate(inf, Z_NO_FLUSH); | ||
107 | assert(ret != Z_STREAM_ERROR && ret != Z_DATA_ERROR && | ||
108 | ret != Z_NEED_DICT); | ||
109 | if (ret == Z_MEM_ERROR) | ||
110 | return ret; | ||
111 | |||
112 | /* compress what was decompresed until done or no room */ | ||
113 | def->avail_in = RAWLEN - inf->avail_out; | ||
114 | def->next_in = raw; | ||
115 | if (inf->avail_out != 0) | ||
116 | flush = Z_FINISH; | ||
117 | ret = deflate(def, flush); | ||
118 | assert(ret != Z_STREAM_ERROR); | ||
119 | } while (ret != Z_STREAM_END && def->avail_out != 0); | ||
120 | return ret; | ||
121 | } | ||
122 | |||
123 | #define EXCESS 256 /* empirically determined stream overage */ | ||
124 | #define MARGIN 8 /* amount to back off for completion */ | ||
125 | |||
126 | /* compress from stdin to fixed-size block on stdout */ | ||
127 | int main(int argc, char **argv) | ||
128 | { | ||
129 | int ret; /* return code */ | ||
130 | unsigned size; /* requested fixed output block size */ | ||
131 | unsigned have; /* bytes written by deflate() call */ | ||
132 | char *blk; /* intermediate and final stream */ | ||
133 | char *tmp; /* close to desired size stream */ | ||
134 | z_stream def, inf; /* zlib deflate and inflate states */ | ||
135 | |||
136 | /* get requested output size */ | ||
137 | if (argc != 2) | ||
138 | quit("need one argument: size of output block"); | ||
139 | ret = strtol(argv[1], argv + 1, 10); | ||
140 | if (argv[1][0] != 0) | ||
141 | quit("argument must be a number"); | ||
142 | if (ret < 8) /* 8 is minimum zlib stream size */ | ||
143 | quit("need positive size of 8 or greater"); | ||
144 | size = (unsigned)ret; | ||
145 | |||
146 | /* allocate memory for buffers and compression engine */ | ||
147 | blk = malloc(size + EXCESS); | ||
148 | def.zalloc = Z_NULL; | ||
149 | def.zfree = Z_NULL; | ||
150 | def.opaque = Z_NULL; | ||
151 | ret = deflateInit(&def, Z_DEFAULT_COMPRESSION); | ||
152 | if (ret != Z_OK || blk == NULL) | ||
153 | quit("out of memory"); | ||
154 | |||
155 | /* compress from stdin until output full, or no more input */ | ||
156 | def.avail_out = size + EXCESS; | ||
157 | def.next_out = blk; | ||
158 | ret = partcompress(stdin, &def); | ||
159 | if (ret == Z_ERRNO) | ||
160 | quit("error reading input"); | ||
161 | |||
162 | /* if it all fit, then size was undersubscribed -- done! */ | ||
163 | if (ret == Z_STREAM_END && def.avail_out >= EXCESS) { | ||
164 | /* write block to stdout */ | ||
165 | have = size + EXCESS - def.avail_out; | ||
166 | ret = fwrite(blk, 1, have, stdout); | ||
167 | if (ret != have || ferror(stdout)) | ||
168 | quit("error writing output"); | ||
169 | |||
170 | /* clean up and print results to stderr */ | ||
171 | ret = deflateEnd(&def); | ||
172 | assert(ret != Z_STREAM_ERROR); | ||
173 | free(blk); | ||
174 | fprintf(stderr, | ||
175 | "%u bytes unused out of %u requested (all input)\n", | ||
176 | size - have, size); | ||
177 | return 0; | ||
178 | } | ||
179 | |||
180 | /* it didn't all fit -- set up for recompression */ | ||
181 | inf.zalloc = Z_NULL; | ||
182 | inf.zfree = Z_NULL; | ||
183 | inf.opaque = Z_NULL; | ||
184 | inf.avail_in = 0; | ||
185 | inf.next_in = Z_NULL; | ||
186 | ret = inflateInit(&inf); | ||
187 | tmp = malloc(size + EXCESS); | ||
188 | if (ret != Z_OK || tmp == NULL) | ||
189 | quit("out of memory"); | ||
190 | ret = deflateReset(&def); | ||
191 | assert(ret != Z_STREAM_ERROR); | ||
192 | |||
193 | /* do first recompression close to the right amount */ | ||
194 | inf.avail_in = size + EXCESS; | ||
195 | inf.next_in = blk; | ||
196 | def.avail_out = size + EXCESS; | ||
197 | def.next_out = tmp; | ||
198 | ret = recompress(&inf, &def); | ||
199 | if (ret == Z_MEM_ERROR) | ||
200 | quit("out of memory"); | ||
201 | |||
202 | /* set up for next reocmpression */ | ||
203 | ret = inflateReset(&inf); | ||
204 | assert(ret != Z_STREAM_ERROR); | ||
205 | ret = deflateReset(&def); | ||
206 | assert(ret != Z_STREAM_ERROR); | ||
207 | |||
208 | /* do second and final recompression (third compression) */ | ||
209 | inf.avail_in = size - MARGIN; /* assure stream will complete */ | ||
210 | inf.next_in = tmp; | ||
211 | def.avail_out = size; | ||
212 | def.next_out = blk; | ||
213 | ret = recompress(&inf, &def); | ||
214 | if (ret == Z_MEM_ERROR) | ||
215 | quit("out of memory"); | ||
216 | assert(ret == Z_STREAM_END); /* otherwise MARGIN too small */ | ||
217 | |||
218 | /* done -- write block to stdout */ | ||
219 | have = size - def.avail_out; | ||
220 | ret = fwrite(blk, 1, have, stdout); | ||
221 | if (ret != have || ferror(stdout)) | ||
222 | quit("error writing output"); | ||
223 | |||
224 | /* clean up and print results to stderr */ | ||
225 | free(tmp); | ||
226 | ret = inflateEnd(&inf); | ||
227 | assert(ret != Z_STREAM_ERROR); | ||
228 | ret = deflateEnd(&def); | ||
229 | assert(ret != Z_STREAM_ERROR); | ||
230 | free(blk); | ||
231 | fprintf(stderr, | ||
232 | "%u bytes unused out of %u requested (%lu input)\n", | ||
233 | size - have, size, def.total_in); | ||
234 | return 0; | ||
235 | } | ||
diff --git a/contrib/gzappend/gzappend.c b/examples/gzappend.c index e9e878e..e9e878e 100644 --- a/contrib/gzappend/gzappend.c +++ b/examples/gzappend.c | |||
diff --git a/examples/gzjoin.c b/examples/gzjoin.c new file mode 100644 index 0000000..7434c5b --- /dev/null +++ b/examples/gzjoin.c | |||
@@ -0,0 +1,447 @@ | |||
1 | /* gzjoin -- command to join gzip files into one gzip file | ||
2 | |||
3 | Copyright (C) 2004 Mark Adler, all rights reserved | ||
4 | version 1.0, 11 Dec 2004 | ||
5 | |||
6 | This software is provided 'as-is', without any express or implied | ||
7 | warranty. In no event will the author be held liable for any damages | ||
8 | arising from the use of this software. | ||
9 | |||
10 | Permission is granted to anyone to use this software for any purpose, | ||
11 | including commercial applications, and to alter it and redistribute it | ||
12 | freely, subject to the following restrictions: | ||
13 | |||
14 | 1. The origin of this software must not be misrepresented; you must not | ||
15 | claim that you wrote the original software. If you use this software | ||
16 | in a product, an acknowledgment in the product documentation would be | ||
17 | appreciated but is not required. | ||
18 | 2. Altered source versions must be plainly marked as such, and must not be | ||
19 | misrepresented as being the original software. | ||
20 | 3. This notice may not be removed or altered from any source distribution. | ||
21 | |||
22 | Mark Adler madler@alumni.caltech.edu | ||
23 | */ | ||
24 | |||
25 | /* | ||
26 | * Change history: | ||
27 | * | ||
28 | * 1.0 11 Dec 2004 - First version | ||
29 | */ | ||
30 | |||
31 | /* | ||
32 | gzjoin takes one or more gzip files on the command line and writes out a | ||
33 | single gzip file that will uncompress to the concatenation of the | ||
34 | uncompressed data from the individual gzip files. gzjoin does this without | ||
35 | having to recompress any of the data and without having to calculate a new | ||
36 | crc32 for the concatenated uncompressed data. gzjoin does however have to | ||
37 | decompress all of the input data in order to find the bits in the compressed | ||
38 | data that need to be modified to concatenate the streams. | ||
39 | |||
40 | gzjoin does not do an integrity check on the input gzip files other than | ||
41 | checking the gzip header and decompressing the compressed data. They are | ||
42 | otherwise assumed to be complete and correct. | ||
43 | |||
44 | Each joint between gzip files removes at least 18 bytes of previous trailer | ||
45 | and subsequent header, and inserts an average of about three bytes to the | ||
46 | compressed data in order to connect the streams. The output gzip file | ||
47 | has a minimal ten-byte gzip header with no file name or modification time. | ||
48 | |||
49 | This program was written to illustrate the use of the Z_BLOCK option of | ||
50 | inflate() and the crc32_combine() function. gzjoin will not compile with | ||
51 | versions of zlib earlier than 1.2.3. | ||
52 | */ | ||
53 | |||
54 | #include <stdio.h> /* fputs(), fprintf(), fwrite(), putc() */ | ||
55 | #include <stdlib.h> /* exit(), malloc(), free() */ | ||
56 | #include <fcntl.h> /* open() */ | ||
57 | #include <unistd.h> /* close(), read(), lseek() */ | ||
58 | #include "zlib.h" | ||
59 | /* crc32(), crc32_combine(), inflateInit2(), inflate(), inflateEnd() */ | ||
60 | |||
61 | #define local static | ||
62 | |||
63 | /* exit with an error (return a value to allow use in an expression) */ | ||
64 | local int bail(char *why1, char *why2) | ||
65 | { | ||
66 | fprintf(stderr, "gzjoin error: %s%s, output incomplete\n", why1, why2); | ||
67 | exit(1); | ||
68 | return 0; | ||
69 | } | ||
70 | |||
71 | /* -- simple buffered file input with access to the buffer -- */ | ||
72 | |||
73 | #define CHUNK 32768 /* must be a power of two and fit in unsigned */ | ||
74 | |||
75 | /* bin buffered input file type */ | ||
76 | typedef struct { | ||
77 | char *name; /* name of file for error messages */ | ||
78 | int fd; /* file descriptor */ | ||
79 | unsigned left; /* bytes remaining at next */ | ||
80 | unsigned char *next; /* next byte to read */ | ||
81 | unsigned char *buf; /* allocated buffer of length CHUNK */ | ||
82 | } bin; | ||
83 | |||
84 | /* close a buffered file and free allocated memory */ | ||
85 | local void bclose(bin *in) | ||
86 | { | ||
87 | if (in != NULL) { | ||
88 | if (in->fd != -1) | ||
89 | close(in->fd); | ||
90 | if (in->buf != NULL) | ||
91 | free(in->buf); | ||
92 | free(in); | ||
93 | } | ||
94 | } | ||
95 | |||
96 | /* open a buffered file for input, return a pointer to type bin, or NULL on | ||
97 | failure */ | ||
98 | local bin *bopen(char *name) | ||
99 | { | ||
100 | bin *in; | ||
101 | |||
102 | in = malloc(sizeof(bin)); | ||
103 | if (in == NULL) | ||
104 | return NULL; | ||
105 | in->buf = malloc(CHUNK); | ||
106 | in->fd = open(name, O_RDONLY, 0); | ||
107 | if (in->buf == NULL || in->fd == -1) { | ||
108 | bclose(in); | ||
109 | return NULL; | ||
110 | } | ||
111 | in->left = 0; | ||
112 | in->next = in->buf; | ||
113 | in->name = name; | ||
114 | return in; | ||
115 | } | ||
116 | |||
117 | /* load buffer from file, return -1 on read error, 0 or 1 on success, with | ||
118 | 1 indicating that end-of-file was reached */ | ||
119 | local int bload(bin *in) | ||
120 | { | ||
121 | ssize_t len; | ||
122 | |||
123 | if (in == NULL) | ||
124 | return -1; | ||
125 | if (in->left != 0) | ||
126 | return 0; | ||
127 | in->next = in->buf; | ||
128 | do { | ||
129 | len = read(in->fd, in->buf + in->left, CHUNK - in->left); | ||
130 | if (len < 0) | ||
131 | return -1; | ||
132 | in->left += (unsigned)len; | ||
133 | } while (len != 0 && in->left < CHUNK); | ||
134 | return len == 0 ? 1 : 0; | ||
135 | } | ||
136 | |||
137 | /* get a byte from the file, bail if end of file */ | ||
138 | #define bget(in) (in->left ? 0 : bload(in), \ | ||
139 | in->left ? (in->left--, *(in->next)++) : \ | ||
140 | bail("unexpected end of file on ", in->name)) | ||
141 | |||
142 | /* get a four-byte little-endian unsigned integer from file */ | ||
143 | local unsigned long bget4(bin *in) | ||
144 | { | ||
145 | unsigned long val; | ||
146 | |||
147 | val = bget(in); | ||
148 | val += (unsigned long)(bget(in)) << 8; | ||
149 | val += (unsigned long)(bget(in)) << 16; | ||
150 | val += (unsigned long)(bget(in)) << 24; | ||
151 | return val; | ||
152 | } | ||
153 | |||
154 | /* skip bytes in file */ | ||
155 | local void bskip(bin *in, unsigned skip) | ||
156 | { | ||
157 | /* check pointer */ | ||
158 | if (in == NULL) | ||
159 | return; | ||
160 | |||
161 | /* easy case -- skip bytes in buffer */ | ||
162 | if (skip <= in->left) { | ||
163 | in->left -= skip; | ||
164 | in->next += skip; | ||
165 | return; | ||
166 | } | ||
167 | |||
168 | /* skip what's in buffer, discard buffer contents */ | ||
169 | skip -= in->left; | ||
170 | in->left = 0; | ||
171 | |||
172 | /* seek past multiples of CHUNK bytes */ | ||
173 | if (skip > CHUNK) { | ||
174 | unsigned left; | ||
175 | |||
176 | left = skip & (CHUNK - 1); | ||
177 | if (left == 0) { | ||
178 | /* exact number of chunks: seek all the way minus one byte to check | ||
179 | for end-of-file with a read */ | ||
180 | lseek(in->fd, skip - 1, SEEK_CUR); | ||
181 | if (read(in->fd, in->buf, 1) != 1) | ||
182 | bail("unexpected end of file on ", in->name); | ||
183 | return; | ||
184 | } | ||
185 | |||
186 | /* skip the integral chunks, update skip with remainder */ | ||
187 | lseek(in->fd, skip - left, SEEK_CUR); | ||
188 | skip = left; | ||
189 | } | ||
190 | |||
191 | /* read more input and skip remainder */ | ||
192 | bload(in); | ||
193 | if (skip > in->left) | ||
194 | bail("unexpected end of file on ", in->name); | ||
195 | in->left -= skip; | ||
196 | in->next += skip; | ||
197 | } | ||
198 | |||
199 | /* -- end of buffered input functions -- */ | ||
200 | |||
201 | /* skip the gzip header from file in */ | ||
202 | local void gzhead(bin *in) | ||
203 | { | ||
204 | int flags; | ||
205 | |||
206 | /* verify gzip magic header and compression method */ | ||
207 | if (bget(in) != 0x1f || bget(in) != 0x8b || bget(in) != 8) | ||
208 | bail(in->name, " is not a valid gzip file"); | ||
209 | |||
210 | /* get and verify flags */ | ||
211 | flags = bget(in); | ||
212 | if ((flags & 0xe0) != 0) | ||
213 | bail("unknown reserved bits set in ", in->name); | ||
214 | |||
215 | /* skip modification time, extra flags, and os */ | ||
216 | bskip(in, 6); | ||
217 | |||
218 | /* skip extra field if present */ | ||
219 | if (flags & 4) { | ||
220 | unsigned len; | ||
221 | |||
222 | len = bget(in); | ||
223 | len += (unsigned)(bget(in)) << 8; | ||
224 | bskip(in, len); | ||
225 | } | ||
226 | |||
227 | /* skip file name if present */ | ||
228 | if (flags & 8) | ||
229 | while (bget(in) != 0) | ||
230 | ; | ||
231 | |||
232 | /* skip comment if present */ | ||
233 | if (flags & 16) | ||
234 | while (bget(in) != 0) | ||
235 | ; | ||
236 | |||
237 | /* skip header crc if present */ | ||
238 | if (flags & 2) | ||
239 | bskip(in, 2); | ||
240 | } | ||
241 | |||
242 | /* write a four-byte little-endian unsigned integer to out */ | ||
243 | local void put4(unsigned long val, FILE *out) | ||
244 | { | ||
245 | putc(val & 0xff, out); | ||
246 | putc((val >> 8) & 0xff, out); | ||
247 | putc((val >> 16) & 0xff, out); | ||
248 | putc((val >> 24) & 0xff, out); | ||
249 | } | ||
250 | |||
251 | /* Load up zlib stream from buffered input, bail if end of file */ | ||
252 | local void zpull(z_streamp strm, bin *in) | ||
253 | { | ||
254 | if (in->left == 0) | ||
255 | bload(in); | ||
256 | if (in->left == 0) | ||
257 | bail("unexpected end of file on ", in->name); | ||
258 | strm->avail_in = in->left; | ||
259 | strm->next_in = in->next; | ||
260 | } | ||
261 | |||
262 | /* Write header for gzip file to out and initialize trailer. */ | ||
263 | local void gzinit(unsigned long *crc, unsigned long *tot, FILE *out) | ||
264 | { | ||
265 | fwrite("\x1f\x8b\x08\0\0\0\0\0\0\xff", 1, 10, out); | ||
266 | *crc = crc32(0L, Z_NULL, 0); | ||
267 | *tot = 0; | ||
268 | } | ||
269 | |||
270 | /* Copy the compressed data from name, zeroing the last block bit of the last | ||
271 | block if clr is true, and adding empty blocks as needed to get to a byte | ||
272 | boundary. If clr is false, then the last block becomes the last block of | ||
273 | the output, and the gzip trailer is written. crc and tot maintains the | ||
274 | crc and length (modulo 2^32) of the output for the trailer. The resulting | ||
275 | gzip file is written to out. gzinit() must be called before the first call | ||
276 | of gzcopy() to write the gzip header and to initialize crc and tot. */ | ||
277 | local void gzcopy(char *name, int clr, unsigned long *crc, unsigned long *tot, | ||
278 | FILE *out) | ||
279 | { | ||
280 | int ret; /* return value from zlib functions */ | ||
281 | int pos; /* where the "last block" bit is in byte */ | ||
282 | int last; /* true if processing the last block */ | ||
283 | bin *in; /* buffered input file */ | ||
284 | unsigned char *start; /* start of compressed data in buffer */ | ||
285 | unsigned char *junk; /* buffer for uncompressed data -- discarded */ | ||
286 | z_off_t len; /* length of uncompressed data (support > 4 GB) */ | ||
287 | z_stream strm; /* zlib inflate stream */ | ||
288 | |||
289 | /* open gzip file and skip header */ | ||
290 | in = bopen(name); | ||
291 | if (in == NULL) | ||
292 | bail("could not open ", name); | ||
293 | gzhead(in); | ||
294 | |||
295 | /* allocate buffer for uncompressed data and initialize raw inflate | ||
296 | stream */ | ||
297 | junk = malloc(CHUNK); | ||
298 | strm.zalloc = Z_NULL; | ||
299 | strm.zfree = Z_NULL; | ||
300 | strm.opaque = Z_NULL; | ||
301 | strm.avail_in = 0; | ||
302 | strm.next_in = Z_NULL; | ||
303 | ret = inflateInit2(&strm, -15); | ||
304 | if (junk == NULL || ret != Z_OK) | ||
305 | bail("out of memory", ""); | ||
306 | |||
307 | /* inflate and copy compressed data, clear last-block bit if requested */ | ||
308 | len = 0; | ||
309 | zpull(&strm, in); | ||
310 | start = strm.next_in; | ||
311 | last = start[0] & 1; | ||
312 | if (last && clr) | ||
313 | start[0] &= ~1; | ||
314 | strm.avail_out = 0; | ||
315 | for (;;) { | ||
316 | /* if input used and output done, write used input and get more */ | ||
317 | if (strm.avail_in == 0 && strm.avail_out != 0) { | ||
318 | fwrite(start, 1, strm.next_in - start, out); | ||
319 | start = in->buf; | ||
320 | in->left = 0; | ||
321 | zpull(&strm, in); | ||
322 | } | ||
323 | |||
324 | /* decompress -- return early when end-of-block reached */ | ||
325 | strm.avail_out = CHUNK; | ||
326 | strm.next_out = junk; | ||
327 | ret = inflate(&strm, Z_BLOCK); | ||
328 | switch (ret) { | ||
329 | case Z_MEM_ERROR: | ||
330 | bail("out of memory", ""); | ||
331 | case Z_DATA_ERROR: | ||
332 | bail("invalid compressed data in ", in->name); | ||
333 | } | ||
334 | |||
335 | /* update length of uncompressed data */ | ||
336 | len += CHUNK - strm.avail_out; | ||
337 | |||
338 | /* check for block boundary (only get this when block copied out) */ | ||
339 | if (strm.data_type & 128) { | ||
340 | /* if that was the last block, then done */ | ||
341 | if (last) | ||
342 | break; | ||
343 | |||
344 | /* number of unused bits in last byte */ | ||
345 | pos = strm.data_type & 7; | ||
346 | |||
347 | /* find the next last-block bit */ | ||
348 | if (pos != 0) { | ||
349 | /* next last-block bit is in last used byte */ | ||
350 | pos = 0x100 >> pos; | ||
351 | last = strm.next_in[-1] & pos; | ||
352 | if (last && clr) | ||
353 | strm.next_in[-1] &= ~pos; | ||
354 | } | ||
355 | else { | ||
356 | /* next last-block bit is in next unused byte */ | ||
357 | if (strm.avail_in == 0) { | ||
358 | /* don't have that byte yet -- get it */ | ||
359 | fwrite(start, 1, strm.next_in - start, out); | ||
360 | start = in->buf; | ||
361 | in->left = 0; | ||
362 | zpull(&strm, in); | ||
363 | } | ||
364 | last = strm.next_in[0] & 1; | ||
365 | if (last && clr) | ||
366 | strm.next_in[0] &= ~1; | ||
367 | } | ||
368 | } | ||
369 | } | ||
370 | |||
371 | /* update buffer with unused input */ | ||
372 | in->left = strm.avail_in; | ||
373 | in->next = strm.next_in; | ||
374 | |||
375 | /* copy used input, write empty blocks to get to byte boundary */ | ||
376 | pos = strm.data_type & 7; | ||
377 | fwrite(start, 1, in->next - start - 1, out); | ||
378 | last = in->next[-1]; | ||
379 | if (pos == 0 || !clr) | ||
380 | /* already at byte boundary, or last file: write last byte */ | ||
381 | putc(last, out); | ||
382 | else { | ||
383 | /* append empty blocks to last byte */ | ||
384 | last &= ((0x100 >> pos) - 1); /* assure unused bits are zero */ | ||
385 | if (pos & 1) { | ||
386 | /* odd -- append an empty stored block */ | ||
387 | putc(last, out); | ||
388 | if (pos == 1) | ||
389 | putc(0, out); /* two more bits in block header */ | ||
390 | fwrite("\0\0\xff\xff", 1, 4, out); | ||
391 | } | ||
392 | else { | ||
393 | /* even -- append 1, 2, or 3 empty fixed blocks */ | ||
394 | switch (pos) { | ||
395 | case 6: | ||
396 | putc(last | 8, out); | ||
397 | last = 0; | ||
398 | case 4: | ||
399 | putc(last | 0x20, out); | ||
400 | last = 0; | ||
401 | case 2: | ||
402 | putc(last | 0x80, out); | ||
403 | putc(0, out); | ||
404 | } | ||
405 | } | ||
406 | } | ||
407 | |||
408 | /* update crc and tot */ | ||
409 | *crc = crc32_combine(*crc, bget4(in), len); | ||
410 | *tot += (unsigned long)len; | ||
411 | |||
412 | /* clean up */ | ||
413 | inflateEnd(&strm); | ||
414 | free(junk); | ||
415 | bclose(in); | ||
416 | |||
417 | /* write trailer if this is the last gzip file */ | ||
418 | if (!clr) { | ||
419 | put4(*crc, out); | ||
420 | put4(*tot, out); | ||
421 | } | ||
422 | } | ||
423 | |||
424 | /* join the gzip files on the command line, write result to stdout */ | ||
425 | int main(int argc, char **argv) | ||
426 | { | ||
427 | unsigned long crc, tot; /* running crc and total uncompressed length */ | ||
428 | |||
429 | /* skip command name */ | ||
430 | argc--; | ||
431 | argv++; | ||
432 | |||
433 | /* show usage if no arguments */ | ||
434 | if (argc == 0) { | ||
435 | fputs("gzjoin usage: gzjoin f1.gz [f2.gz [f3.gz ...]] > fjoin.gz\n", | ||
436 | stderr); | ||
437 | return 0; | ||
438 | } | ||
439 | |||
440 | /* join gzip files on command line and write to stdout */ | ||
441 | gzinit(&crc, &tot, stdout); | ||
442 | while (argc--) | ||
443 | gzcopy(*argv++, argc, &crc, &tot, stdout); | ||
444 | |||
445 | /* done */ | ||
446 | return 0; | ||
447 | } | ||
diff --git a/examples/gzlog.c b/examples/gzlog.c new file mode 100644 index 0000000..f71f817 --- /dev/null +++ b/examples/gzlog.c | |||
@@ -0,0 +1,413 @@ | |||
1 | /* | ||
2 | * gzlog.c | ||
3 | * Copyright (C) 2004 Mark Adler | ||
4 | * For conditions of distribution and use, see copyright notice in gzlog.h | ||
5 | * version 1.0, 26 Nov 2004 | ||
6 | * | ||
7 | */ | ||
8 | |||
9 | #include <string.h> /* memcmp() */ | ||
10 | #include <stdlib.h> /* malloc(), free(), NULL */ | ||
11 | #include <sys/types.h> /* size_t, off_t */ | ||
12 | #include <unistd.h> /* read(), close(), sleep(), ftruncate(), */ | ||
13 | /* lseek() */ | ||
14 | #include <fcntl.h> /* open() */ | ||
15 | #include <sys/file.h> /* flock() */ | ||
16 | #include "zlib.h" /* deflateInit2(), deflate(), deflateEnd() */ | ||
17 | |||
18 | #include "gzlog.h" /* interface */ | ||
19 | #define local static | ||
20 | |||
21 | /* log object structure */ | ||
22 | typedef struct { | ||
23 | int id; /* object identifier */ | ||
24 | int fd; /* log file descriptor */ | ||
25 | off_t extra; /* offset of extra "ap" subfield */ | ||
26 | off_t mark_off; /* offset of marked data */ | ||
27 | off_t last_off; /* offset of last block */ | ||
28 | unsigned long crc; /* uncompressed crc */ | ||
29 | unsigned long len; /* uncompressed length (modulo 2^32) */ | ||
30 | unsigned stored; /* length of current stored block */ | ||
31 | } gz_log; | ||
32 | |||
33 | #define GZLOGID 19334 /* gz_log object identifier */ | ||
34 | |||
35 | #define LOCK_RETRY 1 /* retry lock once a second */ | ||
36 | #define LOCK_PATIENCE 1200 /* try about twenty minutes before forcing */ | ||
37 | |||
38 | /* acquire a lock on a file */ | ||
39 | local int lock(int fd) | ||
40 | { | ||
41 | int patience; | ||
42 | |||
43 | /* try to lock every LOCK_RETRY seconds for LOCK_PATIENCE seconds */ | ||
44 | patience = LOCK_PATIENCE; | ||
45 | do { | ||
46 | if (flock(fd, LOCK_EX + LOCK_NB) == 0) | ||
47 | return 0; | ||
48 | (void)sleep(LOCK_RETRY); | ||
49 | patience -= LOCK_RETRY; | ||
50 | } while (patience > 0); | ||
51 | |||
52 | /* we've run out of patience -- give up */ | ||
53 | return -1; | ||
54 | } | ||
55 | |||
56 | /* release lock */ | ||
57 | local void unlock(int fd) | ||
58 | { | ||
59 | (void)flock(fd, LOCK_UN); | ||
60 | } | ||
61 | |||
62 | /* release a log object */ | ||
63 | local void log_clean(gz_log *log) | ||
64 | { | ||
65 | unlock(log->fd); | ||
66 | (void)close(log->fd); | ||
67 | free(log); | ||
68 | } | ||
69 | |||
70 | /* read an unsigned long from a byte buffer little-endian */ | ||
71 | local unsigned long make_ulg(unsigned char *buf) | ||
72 | { | ||
73 | int n; | ||
74 | unsigned long val; | ||
75 | |||
76 | val = (unsigned long)(*buf++); | ||
77 | for (n = 8; n < 32; n += 8) | ||
78 | val += (unsigned long)(*buf++) << n; | ||
79 | return val; | ||
80 | } | ||
81 | |||
82 | /* read an off_t from a byte buffer little-endian */ | ||
83 | local off_t make_off(unsigned char *buf) | ||
84 | { | ||
85 | int n; | ||
86 | off_t val; | ||
87 | |||
88 | val = (off_t)(*buf++); | ||
89 | for (n = 8; n < 64; n += 8) | ||
90 | val += (off_t)(*buf++) << n; | ||
91 | return val; | ||
92 | } | ||
93 | |||
94 | /* write an unsigned long little-endian to byte buffer */ | ||
95 | local void dice_ulg(unsigned long val, unsigned char *buf) | ||
96 | { | ||
97 | int n; | ||
98 | |||
99 | for (n = 0; n < 4; n++) { | ||
100 | *buf++ = val & 0xff; | ||
101 | val >>= 8; | ||
102 | } | ||
103 | } | ||
104 | |||
105 | /* write an off_t little-endian to byte buffer */ | ||
106 | local void dice_off(off_t val, unsigned char *buf) | ||
107 | { | ||
108 | int n; | ||
109 | |||
110 | for (n = 0; n < 8; n++) { | ||
111 | *buf++ = val & 0xff; | ||
112 | val >>= 8; | ||
113 | } | ||
114 | } | ||
115 | |||
116 | /* initial, empty gzip file for appending */ | ||
117 | local char empty_gz[] = { | ||
118 | 0x1f, 0x8b, /* magic gzip id */ | ||
119 | 8, /* compression method is deflate */ | ||
120 | 4, /* there is an extra field */ | ||
121 | 0, 0, 0, 0, /* no modification time provided */ | ||
122 | 0, 0xff, /* no extra flags, no OS */ | ||
123 | 20, 0, 'a', 'p', 16, 0, /* extra field with "ap" subfield */ | ||
124 | 32, 0, 0, 0, 0, 0, 0, 0, /* offset of uncompressed data */ | ||
125 | 32, 0, 0, 0, 0, 0, 0, 0, /* offset of last block */ | ||
126 | 1, 0, 0, 0xff, 0xff, /* empty stored block (last) */ | ||
127 | 0, 0, 0, 0, /* crc */ | ||
128 | 0, 0, 0, 0 /* uncompressed length */ | ||
129 | }; | ||
130 | |||
131 | /* initialize a log object with locking */ | ||
132 | void *gzlog_open(char *path) | ||
133 | { | ||
134 | unsigned xlen; | ||
135 | unsigned char temp[20]; | ||
136 | unsigned sub_len; | ||
137 | int good; | ||
138 | gz_log *log; | ||
139 | |||
140 | /* allocate log structure */ | ||
141 | log = malloc(sizeof(gz_log)); | ||
142 | if (log == NULL) | ||
143 | return NULL; | ||
144 | log->id = GZLOGID; | ||
145 | |||
146 | /* open file, creating it if necessary, and locking it */ | ||
147 | log->fd = open(path, O_RDWR | O_CREAT, 0600); | ||
148 | if (log->fd < 0) { | ||
149 | free(log); | ||
150 | return NULL; | ||
151 | } | ||
152 | if (lock(log->fd)) { | ||
153 | close(log->fd); | ||
154 | free(log); | ||
155 | return NULL; | ||
156 | } | ||
157 | |||
158 | /* if file is empty, write new gzip stream */ | ||
159 | if (lseek(log->fd, 0, SEEK_END) == 0) { | ||
160 | if (write(log->fd, empty_gz, sizeof(empty_gz)) != sizeof(empty_gz)) { | ||
161 | log_clean(log); | ||
162 | return NULL; | ||
163 | } | ||
164 | } | ||
165 | |||
166 | /* check gzip header */ | ||
167 | (void)lseek(log->fd, 0, SEEK_SET); | ||
168 | if (read(log->fd, temp, 12) != 12 || temp[0] != 0x1f || | ||
169 | temp[1] != 0x8b || temp[2] != 8 || (temp[3] & 4) == 0) { | ||
170 | log_clean(log); | ||
171 | return NULL; | ||
172 | } | ||
173 | |||
174 | /* process extra field to find "ap" sub-field */ | ||
175 | xlen = temp[10] + (temp[11] << 8); | ||
176 | good = 0; | ||
177 | while (xlen) { | ||
178 | if (xlen < 4 || read(log->fd, temp, 4) != 4) | ||
179 | break; | ||
180 | sub_len = temp[2]; | ||
181 | sub_len += temp[3] << 8; | ||
182 | xlen -= 4; | ||
183 | if (memcmp(temp, "ap", 2) == 0 && sub_len == 16) { | ||
184 | good = 1; | ||
185 | break; | ||
186 | } | ||
187 | if (xlen < sub_len) | ||
188 | break; | ||
189 | (void)lseek(log->fd, sub_len, SEEK_CUR); | ||
190 | xlen -= sub_len; | ||
191 | } | ||
192 | if (!good) { | ||
193 | log_clean(log); | ||
194 | return NULL; | ||
195 | } | ||
196 | |||
197 | /* read in "ap" sub-field */ | ||
198 | log->extra = lseek(log->fd, 0, SEEK_CUR); | ||
199 | if (read(log->fd, temp, 16) != 16) { | ||
200 | log_clean(log); | ||
201 | return NULL; | ||
202 | } | ||
203 | log->mark_off = make_off(temp); | ||
204 | log->last_off = make_off(temp + 8); | ||
205 | |||
206 | /* get crc, length of gzip file */ | ||
207 | (void)lseek(log->fd, log->last_off, SEEK_SET); | ||
208 | if (read(log->fd, temp, 13) != 13 || | ||
209 | memcmp(temp, "\001\000\000\377\377", 5) != 0) { | ||
210 | log_clean(log); | ||
211 | return NULL; | ||
212 | } | ||
213 | log->crc = make_ulg(temp + 5); | ||
214 | log->len = make_ulg(temp + 9); | ||
215 | |||
216 | /* set up to write over empty last block */ | ||
217 | (void)lseek(log->fd, log->last_off + 5, SEEK_SET); | ||
218 | log->stored = 0; | ||
219 | return (void *)log; | ||
220 | } | ||
221 | |||
222 | /* maximum amount to put in a stored block before starting a new one */ | ||
223 | #define MAX_BLOCK 16384 | ||
224 | |||
225 | /* write a block to a log object */ | ||
226 | int gzlog_write(void *obj, char *data, size_t len) | ||
227 | { | ||
228 | size_t some; | ||
229 | unsigned char temp[5]; | ||
230 | gz_log *log; | ||
231 | |||
232 | /* check object */ | ||
233 | log = (gz_log *)obj; | ||
234 | if (log == NULL || log->id != GZLOGID) | ||
235 | return 1; | ||
236 | |||
237 | /* write stored blocks until all of the input is written */ | ||
238 | do { | ||
239 | some = MAX_BLOCK - log->stored; | ||
240 | if (some > len) | ||
241 | some = len; | ||
242 | if (write(log->fd, data, some) != some) | ||
243 | return 1; | ||
244 | log->crc = crc32(log->crc, data, some); | ||
245 | log->len += some; | ||
246 | len -= some; | ||
247 | data += some; | ||
248 | log->stored += some; | ||
249 | |||
250 | /* if the stored block is full, end it and start another */ | ||
251 | if (log->stored == MAX_BLOCK) { | ||
252 | (void)lseek(log->fd, log->last_off, SEEK_SET); | ||
253 | temp[0] = 0; | ||
254 | dice_ulg(log->stored + ((unsigned long)(~log->stored) << 16), | ||
255 | temp + 1); | ||
256 | if (write(log->fd, temp, 5) != 5) | ||
257 | return 1; | ||
258 | log->last_off = lseek(log->fd, log->stored, SEEK_CUR); | ||
259 | (void)lseek(log->fd, 5, SEEK_CUR); | ||
260 | log->stored = 0; | ||
261 | } | ||
262 | } while (len); | ||
263 | return 0; | ||
264 | } | ||
265 | |||
266 | /* recompress the remaining stored deflate data in place */ | ||
267 | local int recomp(gz_log *log) | ||
268 | { | ||
269 | z_stream strm; | ||
270 | size_t len, max; | ||
271 | unsigned char *in; | ||
272 | unsigned char *out; | ||
273 | unsigned char temp[16]; | ||
274 | |||
275 | /* allocate space and read it all in (it's around 1 MB) */ | ||
276 | len = log->last_off - log->mark_off; | ||
277 | max = len + (len >> 12) + (len >> 14) + 11; | ||
278 | out = malloc(max); | ||
279 | if (out == NULL) | ||
280 | return 1; | ||
281 | in = malloc(len); | ||
282 | if (in == NULL) { | ||
283 | free(out); | ||
284 | return 1; | ||
285 | } | ||
286 | (void)lseek(log->fd, log->mark_off, SEEK_SET); | ||
287 | if (read(log->fd, in, len) != len) { | ||
288 | free(in); | ||
289 | free(out); | ||
290 | return 1; | ||
291 | } | ||
292 | |||
293 | /* recompress in memory, decoding stored data as we go */ | ||
294 | /* note: this assumes that unsigned is four bytes or more */ | ||
295 | /* consider not making that assumption */ | ||
296 | strm.zalloc = Z_NULL; | ||
297 | strm.zfree = Z_NULL; | ||
298 | strm.opaque = Z_NULL; | ||
299 | if (deflateInit2(&strm, Z_BEST_COMPRESSION, Z_DEFLATED, -15, 8, | ||
300 | Z_DEFAULT_STRATEGY) != Z_OK) { | ||
301 | free(in); | ||
302 | free(out); | ||
303 | return 1; | ||
304 | } | ||
305 | strm.next_in = in; | ||
306 | strm.avail_out = max; | ||
307 | strm.next_out = out; | ||
308 | while (len >= 5) { | ||
309 | if (strm.next_in[0] != 0) | ||
310 | break; | ||
311 | strm.avail_in = strm.next_in[1] + (strm.next_in[2] << 8); | ||
312 | strm.next_in += 5; | ||
313 | len -= 5; | ||
314 | if (strm.avail_in != 0) { | ||
315 | if (len < strm.avail_in) | ||
316 | break; | ||
317 | len -= strm.avail_in; | ||
318 | (void)deflate(&strm, Z_NO_FLUSH); | ||
319 | if (strm.avail_in != 0 || strm.avail_out == 0) | ||
320 | break; | ||
321 | } | ||
322 | } | ||
323 | (void)deflate(&strm, Z_SYNC_FLUSH); | ||
324 | (void)deflateEnd(&strm); | ||
325 | free(in); | ||
326 | if (len != 0 || strm.avail_out == 0) { | ||
327 | free(out); | ||
328 | return 1; | ||
329 | } | ||
330 | |||
331 | /* overwrite stored data with compressed data */ | ||
332 | (void)lseek(log->fd, log->mark_off, SEEK_SET); | ||
333 | len = max - strm.avail_out; | ||
334 | if (write(log->fd, out, len) != len) { | ||
335 | free(out); | ||
336 | return 1; | ||
337 | } | ||
338 | free(out); | ||
339 | |||
340 | /* write last empty block, crc, and length */ | ||
341 | log->mark_off = log->last_off = lseek(log->fd, 0, SEEK_CUR); | ||
342 | temp[0] = 1; | ||
343 | dice_ulg(0xffffL << 16, temp + 1); | ||
344 | dice_ulg(log->crc, temp + 5); | ||
345 | dice_ulg(log->len, temp + 9); | ||
346 | if (write(log->fd, temp, 13) != 13) | ||
347 | return 1; | ||
348 | |||
349 | /* truncate file to discard remaining stored data and old trailer */ | ||
350 | ftruncate(log->fd, lseek(log->fd, 0, SEEK_CUR)); | ||
351 | |||
352 | /* update extra field to point to new last empty block */ | ||
353 | (void)lseek(log->fd, log->extra, SEEK_SET); | ||
354 | dice_off(log->mark_off, temp); | ||
355 | dice_off(log->last_off, temp + 8); | ||
356 | if (write(log->fd, temp, 16) != 16) | ||
357 | return 1; | ||
358 | return 0; | ||
359 | } | ||
360 | |||
361 | /* maximum accumulation of stored blocks before compressing */ | ||
362 | #define MAX_STORED 1048576 | ||
363 | |||
364 | /* close log object */ | ||
365 | int gzlog_close(void *obj) | ||
366 | { | ||
367 | unsigned char temp[8]; | ||
368 | gz_log *log; | ||
369 | |||
370 | /* check object */ | ||
371 | log = (gz_log *)obj; | ||
372 | if (log == NULL || log->id != GZLOGID) | ||
373 | return 1; | ||
374 | |||
375 | /* go to start of most recent block being written */ | ||
376 | (void)lseek(log->fd, log->last_off, SEEK_SET); | ||
377 | |||
378 | /* if some stuff was put there, update block */ | ||
379 | if (log->stored) { | ||
380 | temp[0] = 0; | ||
381 | dice_ulg(log->stored + ((unsigned long)(~log->stored) << 16), | ||
382 | temp + 1); | ||
383 | if (write(log->fd, temp, 5) != 5) | ||
384 | return 1; | ||
385 | log->last_off = lseek(log->fd, log->stored, SEEK_CUR); | ||
386 | } | ||
387 | |||
388 | /* write last block (empty) */ | ||
389 | if (write(log->fd, "\001\000\000\377\377", 5) != 5) | ||
390 | return 1; | ||
391 | |||
392 | /* write updated crc and uncompressed length */ | ||
393 | dice_ulg(log->crc, temp); | ||
394 | dice_ulg(log->len, temp + 4); | ||
395 | if (write(log->fd, temp, 8) != 8) | ||
396 | return 1; | ||
397 | |||
398 | /* put offset of that last block in gzip extra block */ | ||
399 | (void)lseek(log->fd, log->extra + 8, SEEK_SET); | ||
400 | dice_off(log->last_off, temp); | ||
401 | if (write(log->fd, temp, 8) != 8) | ||
402 | return 1; | ||
403 | |||
404 | /* if more than 1 MB stored, then time to compress it */ | ||
405 | if (log->last_off - log->mark_off > MAX_STORED) { | ||
406 | if (recomp(log)) | ||
407 | return 1; | ||
408 | } | ||
409 | |||
410 | /* unlock and close file */ | ||
411 | log_clean(log); | ||
412 | return 0; | ||
413 | } | ||
diff --git a/examples/gzlog.h b/examples/gzlog.h new file mode 100644 index 0000000..a800bd5 --- /dev/null +++ b/examples/gzlog.h | |||
@@ -0,0 +1,58 @@ | |||
1 | /* gzlog.h | ||
2 | Copyright (C) 2004 Mark Adler, all rights reserved | ||
3 | version 1.0, 26 Nov 2004 | ||
4 | |||
5 | This software is provided 'as-is', without any express or implied | ||
6 | warranty. In no event will the author be held liable for any damages | ||
7 | arising from the use of this software. | ||
8 | |||
9 | Permission is granted to anyone to use this software for any purpose, | ||
10 | including commercial applications, and to alter it and redistribute it | ||
11 | freely, subject to the following restrictions: | ||
12 | |||
13 | 1. The origin of this software must not be misrepresented; you must not | ||
14 | claim that you wrote the original software. If you use this software | ||
15 | in a product, an acknowledgment in the product documentation would be | ||
16 | appreciated but is not required. | ||
17 | 2. Altered source versions must be plainly marked as such, and must not be | ||
18 | misrepresented as being the original software. | ||
19 | 3. This notice may not be removed or altered from any source distribution. | ||
20 | |||
21 | Mark Adler madler@alumni.caltech.edu | ||
22 | */ | ||
23 | |||
24 | /* | ||
25 | The gzlog object allows writing short messages to a gzipped log file, | ||
26 | opening the log file locked for small bursts, and then closing it. The log | ||
27 | object works by appending stored data to the gzip file until 1 MB has been | ||
28 | accumulated. At that time, the stored data is compressed, and replaces the | ||
29 | uncompressed data in the file. The log file is truncated to its new size at | ||
30 | that time. After closing, the log file is always valid gzip file that can | ||
31 | decompressed to recover what was written. | ||
32 | |||
33 | A gzip header "extra" field contains two file offsets for appending. The | ||
34 | first points to just after the last compressed data. The second points to | ||
35 | the last stored block in the deflate stream, which is empty. All of the | ||
36 | data between those pointers is uncompressed. | ||
37 | */ | ||
38 | |||
39 | /* Open a gzlog object, creating the log file if it does not exist. Return | ||
40 | NULL on error. Note that gzlog_open() could take a long time to return if | ||
41 | there is difficulty in locking the file. */ | ||
42 | void *gzlog_open(char *path); | ||
43 | |||
44 | /* Write to a gzlog object. Return non-zero on error. This function will | ||
45 | simply write data to the file uncompressed. Compression of the data | ||
46 | will not occur until gzlog_close() is called. It is expected that | ||
47 | gzlog_write() is used for a short message, and then gzlog_close() is | ||
48 | called. If a large amount of data is to be written, then the application | ||
49 | should write no more than 1 MB at a time with gzlog_write() before | ||
50 | calling gzlog_close() and then gzlog_open() again. */ | ||
51 | int gzlog_write(void *log, char *data, size_t len); | ||
52 | |||
53 | /* Close a gzlog object. Return non-zero on error. The log file is locked | ||
54 | until this function is called. This function will compress stored data | ||
55 | at the end of the gzip file if at least 1 MB has been accumulated. Note | ||
56 | that the file will not be a valid gzip file until this function completes. | ||
57 | */ | ||
58 | int gzlog_close(void *log); | ||
diff --git a/examples/zlib_how.html b/examples/zlib_how.html new file mode 100644 index 0000000..b2bda6b --- /dev/null +++ b/examples/zlib_how.html | |||
@@ -0,0 +1,522 @@ | |||
1 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN" | ||
2 | "http://www.w3.org/TR/REC-html40/loose.dtd"> | ||
3 | <html> | ||
4 | <head> | ||
5 | <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> | ||
6 | <title>zlib Usage Example</title> | ||
7 | <!-- Copyright (c) 2004 Mark Adler. --> | ||
8 | </head> | ||
9 | <body bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#00A000"> | ||
10 | <h2 align="center"> zlib Usage Example </h2> | ||
11 | We often get questions about how the <tt>deflate()</tt> and <tt>inflate()</tt> functions should be used. | ||
12 | Users wonder when they should provide more input, when they should use more output, | ||
13 | what to do with a <tt>Z_BUF_ERROR</tt>, how to make sure the process terminates properly, and | ||
14 | so on. So for those who have read <tt>zlib.h</tt> (a few times), and | ||
15 | would like further edification, below is an annotated example in C of simple routines to compress and decompress | ||
16 | from an input file to an output file using <tt>deflate()</tt> and <tt>inflate()</tt> respectively. The | ||
17 | annotations are interspersed between lines of the code. So please read between the lines. | ||
18 | We hope this helps explain some of the intricacies of <em>zlib</em>. | ||
19 | <p> | ||
20 | Without further adieu, here is the program <a href="zpipe.c"><tt>zpipe.c</tt></a>: | ||
21 | <pre><b> | ||
22 | /* zpipe.c: example of proper use of zlib's inflate() and deflate() | ||
23 | Not copyrighted -- provided to the public domain | ||
24 | Version 1.2 9 November 2004 Mark Adler */ | ||
25 | |||
26 | /* Version history: | ||
27 | 1.0 30 Oct 2004 First version | ||
28 | 1.1 8 Nov 2004 Add void casting for unused return values | ||
29 | Use switch statement for inflate() return values | ||
30 | 1.2 9 Nov 2004 Add assertions to document zlib guarantees | ||
31 | */ | ||
32 | </b></pre><!-- --> | ||
33 | We now include the header files for the required definitions. From | ||
34 | <tt>stdio.h</tt> we use <tt>fopen()</tt>, <tt>fread()</tt>, <tt>fwrite()</tt>, | ||
35 | <tt>feof()</tt>, <tt>ferror()</tt>, and <tt>fclose()</tt> for file i/o, and | ||
36 | <tt>fputs()</tt> for error messages. From <tt>string.h</tt> we use | ||
37 | <tt>strcmp()</tt> for command line argument processing. | ||
38 | From <tt>assert.h</tt> we use the <tt>assert()</tt> macro. | ||
39 | From <tt>zlib.h</tt> | ||
40 | we use the basic compression functions <tt>deflateInit()</tt>, | ||
41 | <tt>deflate()</tt>, and <tt>deflateEnd()</tt>, and the basic decompression | ||
42 | functions <tt>inflateInit()</tt>, <tt>inflate()</tt>, and | ||
43 | <tt>inflateEnd()</tt>. | ||
44 | <pre><b> | ||
45 | #include <stdio.h> | ||
46 | #include <string.h> | ||
47 | #include <assert.h> | ||
48 | #include "zlib.h" | ||
49 | </b></pre><!-- --> | ||
50 | <tt>CHUNK</tt> is simply the buffer size for feeding data to and pulling data | ||
51 | from the <em>zlib</em> routines. Larger buffer sizes would be more efficient, | ||
52 | especially for <tt>inflate()</tt>. If the memory is available, buffers sizes | ||
53 | on the order of 128K or 256K bytes should be used. | ||
54 | <pre><b> | ||
55 | #define CHUNK 16384 | ||
56 | </b></pre><!-- --> | ||
57 | The <tt>def()</tt> routine compresses data from an input file to an output file. The output data | ||
58 | will be in the <em>zlib</em> format, which is different from the <em>gzip</em> or <em>zip</em> | ||
59 | formats. The <em>zlib</em> format has a very small header of only two bytes to identify it as | ||
60 | a <em>zlib</em> stream and to provide decoding information, and a four-byte trailer with a fast | ||
61 | check value to verify the integrity of the uncompressed data after decoding. | ||
62 | <pre><b> | ||
63 | /* Compress from file source to file dest until EOF on source. | ||
64 | def() returns Z_OK on success, Z_MEM_ERROR if memory could not be | ||
65 | allocated for processing, Z_STREAM_ERROR if an invalid compression | ||
66 | level is supplied, Z_VERSION_ERROR if the version of zlib.h and the | ||
67 | version of the library linked do not match, or Z_ERRNO if there is | ||
68 | an error reading or writing the files. */ | ||
69 | int def(FILE *source, FILE *dest, int level) | ||
70 | { | ||
71 | </b></pre> | ||
72 | Here are the local variables for <tt>def()</tt>. <tt>ret</tt> will be used for <em>zlib</em> | ||
73 | return codes. <tt>flush</tt> will keep track of the current flushing state for <tt>deflate()</tt>, | ||
74 | which is either no flushing, or flush to completion after the end of the input file is reached. | ||
75 | <tt>have</tt> is the amount of data returned from <tt>deflate()</tt>. The <tt>strm</tt> structure | ||
76 | is used to pass information to and from the <em>zlib</em> routines, and to maintain the | ||
77 | <tt>deflate()</tt> state. <tt>in</tt> and <tt>out</tt> are the input and output buffers for | ||
78 | <tt>deflate()</tt>. | ||
79 | <pre><b> | ||
80 | int ret, flush; | ||
81 | unsigned have; | ||
82 | z_stream strm; | ||
83 | char in[CHUNK]; | ||
84 | char out[CHUNK]; | ||
85 | </b></pre><!-- --> | ||
86 | The first thing we do is to initialize the <em>zlib</em> state for compression using | ||
87 | <tt>deflateInit()</tt>. This must be done before the first use of <tt>deflate()</tt>. | ||
88 | The <tt>zalloc</tt>, <tt>zfree</tt>, and <tt>opaque</tt> fields in the <tt>strm</tt> | ||
89 | structure must be initialized before calling <tt>deflateInit()</tt>. Here they are | ||
90 | set to the <em>zlib</em> constant <tt>Z_NULL</tt> to request that <em>zlib</em> use | ||
91 | the default memory allocation routines. An application may also choose to provide | ||
92 | custom memory allocation routines here. <tt>deflateInit()</tt> will allocate on the | ||
93 | order of 256K bytes for the internal state. | ||
94 | (See <a href="zlib_tech.html"><em>zlib Technical Details</em></a>.) | ||
95 | <p> | ||
96 | <tt>deflateInit()</tt> is called with a pointer to the structure to be initialized and | ||
97 | the compression level, which is an integer in the range of -1 to 9. Lower compression | ||
98 | levels result in faster execution, but less compression. Higher levels result in | ||
99 | greater compression, but slower execution. The <em>zlib</em> constant Z_DEFAULT_COMPRESSION, | ||
100 | equal to -1, | ||
101 | provides a good compromise between compression and speed and is equivalent to level 6. | ||
102 | Level 0 actually does no compression at all, and in fact expands the data slightly to produce | ||
103 | the <em>zlib</em> format (it is not a byte-for-byte copy of the input). | ||
104 | More advanced applications of <em>zlib</em> | ||
105 | may use <tt>deflateInit2()</tt> here instead. Such an application may want to reduce how | ||
106 | much memory will be used, at some price in compression. Or it may need to request a | ||
107 | <em>gzip</em> header and trailer instead of a <em>zlib</em> header and trailer, or raw | ||
108 | encoding with no header or trailer at all. | ||
109 | <p> | ||
110 | We must check the return value of <tt>deflateInit()</tt> against the <em>zlib</em> constant | ||
111 | <tt>Z_OK</tt> to make sure that it was able to | ||
112 | allocate memory for the internal state, and that the provided arguments were valid. | ||
113 | <tt>deflateInit()</tt> will also check that the version of <em>zlib</em> that the <tt>zlib.h</tt> | ||
114 | file came from matches the version of <em>zlib</em> actually linked with the program. This | ||
115 | is especially important for environments in which <em>zlib</em> is a shared library. | ||
116 | <p> | ||
117 | Note that an application can initialize multiple, independent <em>zlib</em> streams, which can | ||
118 | operate in parallel. The state information maintained in the structure allows the <em>zlib</em> | ||
119 | routines to be reentrant. | ||
120 | <pre><b> | ||
121 | /* allocate deflate state */ | ||
122 | strm.zalloc = Z_NULL; | ||
123 | strm.zfree = Z_NULL; | ||
124 | strm.opaque = Z_NULL; | ||
125 | ret = deflateInit(&strm, level); | ||
126 | if (ret != Z_OK) | ||
127 | return ret; | ||
128 | </b></pre><!-- --> | ||
129 | With the pleasantries out of the way, now we can get down to business. The outer <tt>do</tt>-loop | ||
130 | reads all of the input file and exits at the bottom of the loop once end-of-file is reached. | ||
131 | This loop contains the only call of <tt>deflate()</tt>. So we must make sure that all of the | ||
132 | input data has been processed and that all of the output data has been generated and consumed | ||
133 | before we fall out of the loop at the bottom. | ||
134 | <pre><b> | ||
135 | /* compress until end of file */ | ||
136 | do { | ||
137 | </b></pre> | ||
138 | We start off by reading data from the input file. The number of bytes read is put directly | ||
139 | into <tt>avail_in</tt>, and a pointer to those bytes is put into <tt>next_in</tt>. We also | ||
140 | check to see if end-of-file on the input has been reached. If we are at the end of file, then <tt>flush</tt> is set to the | ||
141 | <em>zlib</em> constant <tt>Z_FINISH</tt>, which is later passed to <tt>deflate()</tt> to | ||
142 | indicate that this is the last chunk of input data to compress. We need to use <tt>feof()</tt> | ||
143 | to check for end-of-file as opposed to seeing if fewer than <tt>CHUNK</tt> bytes have been read. The | ||
144 | reason is that if the input file length is an exact multiple of <tt>CHUNK</tt>, we will miss | ||
145 | the fact that we got to the end-of-file, and not know to tell <tt>deflate()</tt> to finish | ||
146 | up the compressed stream. If we are not yet at the end of the input, then the <em>zlib</em> | ||
147 | constant <tt>Z_NO_FLUSH</tt> will be passed to <tt>deflate</tt> to indicate that we are still | ||
148 | in the middle of the uncompressed data. | ||
149 | <p> | ||
150 | If there is an error in reading from the input file, the process is aborted with | ||
151 | <tt>deflateEnd()</tt> being called to free the allocated <em>zlib</em> state before returning | ||
152 | the error. We wouldn't want a memory leak, now would we? <tt>deflateEnd()</tt> can be called | ||
153 | at any time after the state has been initialized. Once that's done, <tt>deflateInit()</tt> (or | ||
154 | <tt>deflateInit2()</tt>) would have to be called to start a new compression process. There is | ||
155 | no point here in checking the <tt>deflateEnd()</tt> return code. The deallocation can't fail. | ||
156 | <pre><b> | ||
157 | strm.avail_in = fread(in, 1, CHUNK, source); | ||
158 | if (ferror(source)) { | ||
159 | (void)deflateEnd(&strm); | ||
160 | return Z_ERRNO; | ||
161 | } | ||
162 | flush = feof(source) ? Z_FINISH : Z_NO_FLUSH; | ||
163 | strm.next_in = in; | ||
164 | </b></pre><!-- --> | ||
165 | The inner <tt>do</tt>-loop passes our chunk of input data to <tt>deflate()</tt>, and then | ||
166 | keeps calling <tt>deflate()</tt> until it is done producing output. Once there is no more | ||
167 | new output, <tt>deflate()</tt> is guaranteed to have consumed all of the input, i.e., | ||
168 | <tt>avail_in</tt> will be zero. | ||
169 | <pre><b> | ||
170 | /* run deflate() on input until output buffer not full, finish | ||
171 | compression if all of source has been read in */ | ||
172 | do { | ||
173 | </b></pre> | ||
174 | Output space is provided to <tt>deflate()</tt> by setting <tt>avail_out</tt> to the number | ||
175 | of available output bytes and <tt>next_out</tt> to a pointer to that space. | ||
176 | <pre><b> | ||
177 | strm.avail_out = CHUNK; | ||
178 | strm.next_out = out; | ||
179 | </b></pre> | ||
180 | Now we call the compression engine itself, <tt>deflate()</tt>. It takes as many of the | ||
181 | <tt>avail_in</tt> bytes at <tt>next_in</tt> as it can process, and writes as many as | ||
182 | <tt>avail_out</tt> bytes to <tt>next_out</tt>. Those counters and pointers are then | ||
183 | updated past the input data consumed and the output data written. It is the amount of | ||
184 | output space available that may limit how much input is consumed. | ||
185 | Hence the inner loop to make sure that | ||
186 | all of the input is consumed by providing more output space each time. Since <tt>avail_in</tt> | ||
187 | and <tt>next_in</tt> are updated by <tt>deflate()</tt>, we don't have to mess with those | ||
188 | between <tt>deflate()</tt> calls until it's all used up. | ||
189 | <p> | ||
190 | The parameters to <tt>deflate()</tt> are a pointer to the <tt>strm</tt> structure containing | ||
191 | the input and output information and the internal compression engine state, and a parameter | ||
192 | indicating whether and how to flush data to the output. Normally <tt>deflate</tt> will consume | ||
193 | several K bytes of input data before producing any output (except for the header), in order | ||
194 | to accumulate statistics on the data for optimum compression. It will then put out a burst of | ||
195 | compressed data, and proceed to consume more input before the next burst. Eventually, | ||
196 | <tt>deflate()</tt> | ||
197 | must be told to terminate the stream, complete the compression with provided input data, and | ||
198 | write out the trailer check value. <tt>deflate()</tt> will continue to compress normally as long | ||
199 | as the flush parameter is <tt>Z_NO_FLUSH</tt>. Once the <tt>Z_FINISH</tt> parameter is provided, | ||
200 | <tt>deflate()</tt> will begin to complete the compressed output stream. However depending on how | ||
201 | much output space is provided, <tt>deflate()</tt> may have to be called several times until it | ||
202 | has provided the complete compressed stream, even after it has consumed all of the input. The flush | ||
203 | parameter must continue to be <tt>Z_FINISH</tt> for those subsequent calls. | ||
204 | <p> | ||
205 | There are other values of the flush parameter that are used in more advanced applications. You can | ||
206 | force <tt>deflate()</tt> to produce a burst of output that encodes all of the input data provided | ||
207 | so far, even if it wouldn't have otherwise, for example to control data latency on a link with | ||
208 | compressed data. You can also ask that <tt>deflate()</tt> do that as well as erase any history up to | ||
209 | that point so that what follows can be decompressed independently, for example for random access | ||
210 | applications. Both requests will degrade compression by an amount depending on how often such | ||
211 | requests are made. | ||
212 | <p> | ||
213 | <tt>deflate()</tt> has a return value that can indicate errors, yet we do not check it here. Why | ||
214 | not? Well, it turns out that <tt>deflate()</tt> can do no wrong here. Let's go through | ||
215 | <tt>deflate()</tt>'s return values and dispense with them one by one. The possible values are | ||
216 | <tt>Z_OK</tt>, <tt>Z_STREAM_END</tt>, <tt>Z_STREAM_ERROR</tt>, or <tt>Z_BUF_ERROR</tt>. <tt>Z_OK</tt> | ||
217 | is, well, ok. <tt>Z_STREAM_END</tt> is also ok and will be returned for the last call of | ||
218 | <tt>deflate()</tt>. This is already guaranteed by calling <tt>deflate()</tt> with <tt>Z_FINISH</tt> | ||
219 | until it has no more output. <tt>Z_STREAM_ERROR</tt> is only possible if the stream is not | ||
220 | initialized properly, but we did initialize it properly. There is no harm in checking for | ||
221 | <tt>Z_STREAM_ERROR</tt> here, for example to check for the possibility that some | ||
222 | other part of the application inadvertently clobbered the memory containing the <em>zlib</em> state. | ||
223 | <tt>Z_BUF_ERROR</tt> will be explained further below, but | ||
224 | suffice it to say that this is simply an indication that <tt>deflate()</tt> could not consume | ||
225 | more input or produce more output. <tt>deflate()</tt> can be called again with more output space | ||
226 | or more available input, which it will be in this code. | ||
227 | <pre><b> | ||
228 | ret = deflate(&strm, flush); /* no bad return value */ | ||
229 | assert(ret != Z_STREAM_ERROR); /* state not clobbered */ | ||
230 | </b></pre> | ||
231 | Now we compute how much output <tt>deflate()</tt> provided on the last call, which is the | ||
232 | difference between how much space was provided before the call, and how much output space | ||
233 | is still available after the call. Then that data, if any, is written to the output file. | ||
234 | We can then reuse the output buffer for the next call of <tt>deflate()</tt>. Again if there | ||
235 | is a file i/o error, we call <tt>deflateEnd()</tt> before returning to avoid a memory leak. | ||
236 | <pre><b> | ||
237 | have = CHUNK - strm.avail_out; | ||
238 | if (fwrite(out, 1, have, dest) != have || ferror(dest)) { | ||
239 | (void)deflateEnd(&strm); | ||
240 | return Z_ERRNO; | ||
241 | } | ||
242 | </b></pre> | ||
243 | The inner <tt>do</tt>-loop is repeated until the last <tt>deflate()</tt> call fails to fill the | ||
244 | provided output buffer. Then we know that <tt>deflate()</tt> has done as much as it can with | ||
245 | the provided input, and that all of that input has been consumed. We can then fall out of this | ||
246 | loop and reuse the input buffer. | ||
247 | <p> | ||
248 | The way we tell that <tt>deflate()</tt> has no more output is by seeing that it did not fill | ||
249 | the output buffer, leaving <tt>avail_out</tt> greater than zero. However suppose that | ||
250 | <tt>deflate()</tt> has no more output, but just so happened to exactly fill the output buffer! | ||
251 | <tt>avail_out</tt> is zero, and we can't tell that <tt>deflate()</tt> has done all it can. | ||
252 | As far as we know, <tt>deflate()</tt> | ||
253 | has more output for us. So we call it again. But now <tt>deflate()</tt> produces no output | ||
254 | at all, and <tt>avail_out</tt> remains unchanged as <tt>CHUNK</tt>. That <tt>deflate()</tt> call | ||
255 | wasn't able to do anything, either consume input or produce output, and so it returns | ||
256 | <tt>Z_BUF_ERROR</tt>. (See, I told you I'd cover this later.) However this is not a problem at | ||
257 | all. Now we finally have the desired indication that <tt>deflate()</tt> is really done, | ||
258 | and so we drop out of the inner loop to provide more input to <tt>deflate()</tt>. | ||
259 | <p> | ||
260 | With <tt>flush</tt> set to <tt>Z_FINISH</tt>, this final set of <tt>deflate()</tt> calls will | ||
261 | complete the output stream. Once that is done, subsequent calls of <tt>deflate()</tt> would return | ||
262 | <tt>Z_STREAM_ERROR</tt> if the flush parameter is not <tt>Z_FINISH</tt>, and do no more processing | ||
263 | until the state is reinitialized. | ||
264 | <p> | ||
265 | Some applications of <em>zlib</em> have two loops that call <tt>deflate()</tt> | ||
266 | instead of the single inner loop we have here. The first loop would call | ||
267 | without flushing and feed all of the data to <tt>deflate()</tt>. The second loop would call | ||
268 | <tt>deflate()</tt> with no more | ||
269 | data and the <tt>Z_FINISH</tt> parameter to complete the process. As you can see from this | ||
270 | example, that can be avoided by simply keeping track of the current flush state. | ||
271 | <pre><b> | ||
272 | } while (strm.avail_out == 0); | ||
273 | assert(strm.avail_in == 0); /* all input will be used */ | ||
274 | </b></pre><!-- --> | ||
275 | Now we check to see if we have already processed all of the input file. That information was | ||
276 | saved in the <tt>flush</tt> variable, so we see if that was set to <tt>Z_FINISH</tt>. If so, | ||
277 | then we're done and we fall out of the outer loop. We're guaranteed to get <tt>Z_STREAM_END</tt> | ||
278 | from the last <tt>deflate()</tt> call, since we ran it until the last chunk of input was | ||
279 | consumed and all of the output was generated. | ||
280 | <pre><b> | ||
281 | /* done when last data in file processed */ | ||
282 | } while (flush != Z_FINISH); | ||
283 | assert(ret == Z_STREAM_END); /* stream will be complete */ | ||
284 | </b></pre><!-- --> | ||
285 | The process is complete, but we still need to deallocate the state to avoid a memory leak | ||
286 | (or rather more like a memory hemorrhage if you didn't do this). Then | ||
287 | finally we can return with a happy return value. | ||
288 | <pre><b> | ||
289 | /* clean up and return */ | ||
290 | (void)deflateEnd(&strm); | ||
291 | return Z_OK; | ||
292 | } | ||
293 | </b></pre><!-- --> | ||
294 | Now we do the same thing for decompression in the <tt>inf()</tt> routine. <tt>inf()</tt> | ||
295 | decompresses what is hopefully a valid <em>zlib</em> stream from the input file and writes the | ||
296 | uncompressed data to the output file. Much of the discussion above for <tt>def()</tt> | ||
297 | applies to <tt>inf()</tt> as well, so the discussion here will focus on the differences between | ||
298 | the two. | ||
299 | <pre><b> | ||
300 | /* Decompress from file source to file dest until stream ends or EOF. | ||
301 | inf() returns Z_OK on success, Z_MEM_ERROR if memory could not be | ||
302 | allocated for processing, Z_DATA_ERROR if the deflate data is | ||
303 | invalid or incomplete, Z_VERSION_ERROR if the version of zlib.h and | ||
304 | the version of the library linked do not match, or Z_ERRNO if there | ||
305 | is an error reading or writing the files. */ | ||
306 | int inf(FILE *source, FILE *dest) | ||
307 | { | ||
308 | </b></pre> | ||
309 | The local variables have the same functionality as they do for <tt>def()</tt>. The | ||
310 | only difference is that there is no <tt>flush</tt> variable, since <tt>inflate()</tt> | ||
311 | can tell from the <em>zlib</em> stream itself when the stream is complete. | ||
312 | <pre><b> | ||
313 | int ret; | ||
314 | unsigned have; | ||
315 | z_stream strm; | ||
316 | char in[CHUNK]; | ||
317 | char out[CHUNK]; | ||
318 | </b></pre><!-- --> | ||
319 | The initialization of the state is the same, except that there is no compression level, | ||
320 | of course, and two more elements of the structure are initialized. <tt>avail_in</tt> | ||
321 | and <tt>next_in</tt> must be initialized before calling <tt>inflateInit()</tt>. This | ||
322 | is because the application has the option to provide the start of the zlib stream in | ||
323 | order for <tt>inflateInit()</tt> to have access to information about the compression | ||
324 | method to aid in memory allocation. In the current implementation of <em>zlib</em> | ||
325 | (up through versions 1.2.x), the method-dependent memory allocations are deferred to the first call of | ||
326 | <tt>inflate()</tt> anyway. However those fields must be initialized since later versions | ||
327 | of <em>zlib</em> that provide more compression methods may take advantage of this interface. | ||
328 | In any case, no decompression is performed by <tt>inflateInit()</tt>, so the | ||
329 | <tt>avail_out</tt> and <tt>next_out</tt> fields do not need to be initialized before calling. | ||
330 | <p> | ||
331 | Here <tt>avail_in</tt> is set to zero and <tt>next_in</tt> is set to <tt>Z_NULL</tt> to | ||
332 | indicate that no input data is being provided. | ||
333 | <pre><b> | ||
334 | /* allocate inflate state */ | ||
335 | strm.zalloc = Z_NULL; | ||
336 | strm.zfree = Z_NULL; | ||
337 | strm.opaque = Z_NULL; | ||
338 | strm.avail_in = 0; | ||
339 | strm.next_in = Z_NULL; | ||
340 | ret = inflateInit(&strm); | ||
341 | if (ret != Z_OK) | ||
342 | return ret; | ||
343 | </b></pre><!-- --> | ||
344 | The outer <tt>do</tt>-loop decompresses input until <tt>inflate()</tt> indicates | ||
345 | that it has reached the end of the compressed data and has produced all of the uncompressed | ||
346 | output. This is in contrast to <tt>def()</tt> which processes all of the input file. | ||
347 | If end-of-file is reached before the compressed data self-terminates, then the compressed | ||
348 | data is incomplete and an error is returned. | ||
349 | <pre><b> | ||
350 | /* decompress until deflate stream ends or end of file */ | ||
351 | do { | ||
352 | </b></pre> | ||
353 | We read input data and set the <tt>strm</tt> structure accordingly. If we've reached the | ||
354 | end of the input file, then we leave the outer loop and report an error, since the | ||
355 | compressed data is incomplete. Note that we may read more data than is eventually consumed | ||
356 | by <tt>inflate()</tt>, if the input file continues past the <em>zlib</em> stream. | ||
357 | For applications where <em>zlib</em> streams are embedded in other data, this routine would | ||
358 | need to be modified to return the unused data, or at least indicate how much of the input | ||
359 | data was not used, so the application would know where to pick up after the <em>zlib</em> stream. | ||
360 | <pre><b> | ||
361 | strm.avail_in = fread(in, 1, CHUNK, source); | ||
362 | if (ferror(source)) { | ||
363 | (void)inflateEnd(&strm); | ||
364 | return Z_ERRNO; | ||
365 | } | ||
366 | if (strm.avail_in == 0) | ||
367 | break; | ||
368 | strm.next_in = in; | ||
369 | </b></pre><!-- --> | ||
370 | The inner <tt>do</tt>-loop has the same function it did in <tt>def()</tt>, which is to | ||
371 | keep calling <tt>inflate()</tt> until has generated all of the output it can with the | ||
372 | provided input. | ||
373 | <pre><b> | ||
374 | /* run inflate() on input until output buffer not full */ | ||
375 | do { | ||
376 | </b></pre> | ||
377 | Just like in <tt>def()</tt>, the same output space is provided for each call of <tt>inflate()</tt>. | ||
378 | <pre><b> | ||
379 | strm.avail_out = CHUNK; | ||
380 | strm.next_out = out; | ||
381 | </b></pre> | ||
382 | Now we run the decompression engine itself. There is no need to adjust the flush parameter, since | ||
383 | the <em>zlib</em> format is self-terminating. The main difference here is that there are | ||
384 | return values that we need to pay attention to. <tt>Z_DATA_ERROR</tt> | ||
385 | indicates that <tt>inflate()</tt> detected an error in the <em>zlib</em> compressed data format, | ||
386 | which means that either the data is not a <em>zlib</em> stream to begin with, or that the data was | ||
387 | corrupted somewhere along the way since it was compressed. The other error to be processed is | ||
388 | <tt>Z_MEM_ERROR</tt>, which can occur since memory allocation is deferred until <tt>inflate()</tt> | ||
389 | needs it, unlike <tt>deflate()</tt>, whose memory is allocated at the start by <tt>deflateInit()</tt>. | ||
390 | <p> | ||
391 | Advanced applications may use | ||
392 | <tt>deflateSetDictionary()</tt> to prime <tt>deflate()</tt> with a set of likely data to improve the | ||
393 | first 32K or so of compression. This is noted in the <em>zlib</em> header, so <tt>inflate()</tt> | ||
394 | requests that that dictionary be provided before it can start to decompress. Without the dictionary, | ||
395 | correct decompression is not possible. For this routine, we have no idea what the dictionary is, | ||
396 | so the <tt>Z_NEED_DICT</tt> indication is converted to a <tt>Z_DATA_ERROR</tt>. | ||
397 | <p> | ||
398 | <tt>inflate()</tt> can also return <tt>Z_STREAM_ERROR</tt>, which should not be possible here, | ||
399 | but could be checked for as noted above for <tt>def()</tt>. <tt>Z_BUF_ERROR</tt> does not need to be | ||
400 | checked for here, for the same reasons noted for <tt>def()</tt>. <tt>Z_STREAM_END</tt> will be | ||
401 | checked for later. | ||
402 | <pre><b> | ||
403 | ret = inflate(&strm, Z_NO_FLUSH); | ||
404 | assert(ret != Z_STREAM_ERROR); /* state not clobbered */ | ||
405 | switch (ret) { | ||
406 | case Z_NEED_DICT: | ||
407 | ret = Z_DATA_ERROR; /* and fall through */ | ||
408 | case Z_DATA_ERROR: | ||
409 | case Z_MEM_ERROR: | ||
410 | (void)inflateEnd(&strm); | ||
411 | return ret; | ||
412 | } | ||
413 | </b></pre> | ||
414 | The output of <tt>inflate()</tt> is handled identically to that of <tt>deflate()</tt>. | ||
415 | <pre><b> | ||
416 | have = CHUNK - strm.avail_out; | ||
417 | if (fwrite(out, 1, have, dest) != have || ferror(dest)) { | ||
418 | (void)inflateEnd(&strm); | ||
419 | return Z_ERRNO; | ||
420 | } | ||
421 | </b></pre> | ||
422 | The inner <tt>do</tt>-loop ends when <tt>inflate()</tt> has no more output as indicated | ||
423 | by not filling the output buffer, just as for <tt>deflate()</tt>. | ||
424 | <pre><b> | ||
425 | } while (strm.avail_out == 0); | ||
426 | assert(strm.avail_in == 0); /* all input will be used */ | ||
427 | </b></pre><!-- --> | ||
428 | The outer <tt>do</tt>-loop ends when <tt>inflate()</tt> reports that it has reached the | ||
429 | end of the input <em>zlib</em> stream, has completed the decompression and integrity | ||
430 | check, and has provided all of the output. This is indicated by the <tt>inflate()</tt> | ||
431 | return value <tt>Z_STREAM_END</tt>. The inner loop is guaranteed to leave <tt>ret</tt> | ||
432 | equal to <tt>Z_STREAM_END</tt> if the last chunk of the input file read contained the end | ||
433 | of the <em>zlib</em> stream. So if the return value is not <tt>Z_STREAM_END</tt>, the | ||
434 | loop continues to read more input. | ||
435 | <pre><b> | ||
436 | /* done when inflate() says it's done */ | ||
437 | } while (ret != Z_STREAM_END); | ||
438 | </b></pre><!-- --> | ||
439 | At this point, decompression successfully completed, or we broke out of the loop due to no | ||
440 | more data being available from the input file. If the last <tt>inflate()</tt> return value | ||
441 | is not <tt>Z_STREAM_END</tt>, then the <em>zlib</em> stream was incomplete and a data error | ||
442 | is returned. Otherwise, we return with a happy return value. Of course, <tt>inflateEnd()</tt> | ||
443 | is called first to avoid a memory leak. | ||
444 | <pre><b> | ||
445 | /* clean up and return */ | ||
446 | (void)inflateEnd(&strm); | ||
447 | return ret == Z_STREAM_END ? Z_OK : Z_DATA_ERROR; | ||
448 | } | ||
449 | </b></pre><!-- --> | ||
450 | That ends the routines that directly use <em>zlib</em>. The following routines make this | ||
451 | a command-line program by running data through the above routines from <tt>stdin</tt> to | ||
452 | <tt>stdout</tt>, and handling any errors reported by <tt>def()</tt> or <tt>inf()</tt>. | ||
453 | <p> | ||
454 | <tt>zerr()</tt> is used to interpret the possible error codes from <tt>def()</tt> | ||
455 | and <tt>inf()</tt>, as detailed in their comments above, and print out an error message. | ||
456 | Note that these are only a subset of the possible return values from <tt>deflate()</tt> | ||
457 | and <tt>inflate()</tt>. | ||
458 | <pre><b> | ||
459 | /* report a zlib or i/o error */ | ||
460 | void zerr(int ret) | ||
461 | { | ||
462 | fputs("zpipe: ", stderr); | ||
463 | switch (ret) { | ||
464 | case Z_ERRNO: | ||
465 | if (ferror(stdin)) | ||
466 | fputs("error reading stdin\n", stderr); | ||
467 | if (ferror(stdout)) | ||
468 | fputs("error writing stdout\n", stderr); | ||
469 | break; | ||
470 | case Z_STREAM_ERROR: | ||
471 | fputs("invalid compression level\n", stderr); | ||
472 | break; | ||
473 | case Z_DATA_ERROR: | ||
474 | fputs("invalid or incomplete deflate data\n", stderr); | ||
475 | break; | ||
476 | case Z_MEM_ERROR: | ||
477 | fputs("out of memory\n", stderr); | ||
478 | break; | ||
479 | case Z_VERSION_ERROR: | ||
480 | fputs("zlib version mismatch!\n", stderr); | ||
481 | } | ||
482 | } | ||
483 | </b></pre><!-- --> | ||
484 | Here is the <tt>main()</tt> routine used to test <tt>def()</tt> and <tt>inf()</tt>. The | ||
485 | <tt>zpipe</tt> command is simply a compression pipe from <tt>stdin</tt> to <tt>stdout</tt>, if | ||
486 | no arguments are given, or it is a decompression pipe if <tt>zpipe -d</tt> is used. If any other | ||
487 | arguments are provided, no compression or decompression is performed. Instead a usage | ||
488 | message is displayed. Examples are <tt>zpipe < foo.txt > foo.txt.z</tt> to compress, and | ||
489 | <tt>zpipe -d < foo.txt.z > foo.txt</tt> to decompress. | ||
490 | <pre><b> | ||
491 | /* compress or decompress from stdin to stdout */ | ||
492 | int main(int argc, char **argv) | ||
493 | { | ||
494 | int ret; | ||
495 | |||
496 | /* do compression if no arguments */ | ||
497 | if (argc == 1) { | ||
498 | ret = def(stdin, stdout, Z_DEFAULT_COMPRESSION); | ||
499 | if (ret != Z_OK) | ||
500 | zerr(ret); | ||
501 | return ret; | ||
502 | } | ||
503 | |||
504 | /* do decompression if -d specified */ | ||
505 | else if (argc == 2 && strcmp(argv[1], "-d") == 0) { | ||
506 | ret = inf(stdin, stdout); | ||
507 | if (ret != Z_OK) | ||
508 | zerr(ret); | ||
509 | return ret; | ||
510 | } | ||
511 | |||
512 | /* otherwise, report usage */ | ||
513 | else { | ||
514 | fputs("zpipe usage: zpipe [-d] < source > dest\n", stderr); | ||
515 | return 1; | ||
516 | } | ||
517 | } | ||
518 | </b></pre> | ||
519 | <hr> | ||
520 | <i>Copyright (c) 2004 by Mark Adler<br>Last modified 13 November 2004</i> | ||
521 | </body> | ||
522 | </html> | ||
diff --git a/examples/zpipe.c b/examples/zpipe.c new file mode 100644 index 0000000..a602d59 --- /dev/null +++ b/examples/zpipe.c | |||
@@ -0,0 +1,191 @@ | |||
1 | /* zpipe.c: example of proper use of zlib's inflate() and deflate() | ||
2 | Not copyrighted -- provided to the public domain | ||
3 | Version 1.2 9 November 2004 Mark Adler */ | ||
4 | |||
5 | /* Version history: | ||
6 | 1.0 30 Oct 2004 First version | ||
7 | 1.1 8 Nov 2004 Add void casting for unused return values | ||
8 | Use switch statement for inflate() return values | ||
9 | 1.2 9 Nov 2004 Add assertions to document zlib guarantees | ||
10 | */ | ||
11 | |||
12 | #include <stdio.h> | ||
13 | #include <string.h> | ||
14 | #include <assert.h> | ||
15 | #include "zlib.h" | ||
16 | |||
17 | #define CHUNK 16384 | ||
18 | |||
19 | /* Compress from file source to file dest until EOF on source. | ||
20 | def() returns Z_OK on success, Z_MEM_ERROR if memory could not be | ||
21 | allocated for processing, Z_STREAM_ERROR if an invalid compression | ||
22 | level is supplied, Z_VERSION_ERROR if the version of zlib.h and the | ||
23 | version of the library linked do not match, or Z_ERRNO if there is | ||
24 | an error reading or writing the files. */ | ||
25 | int def(FILE *source, FILE *dest, int level) | ||
26 | { | ||
27 | int ret, flush; | ||
28 | unsigned have; | ||
29 | z_stream strm; | ||
30 | char in[CHUNK]; | ||
31 | char out[CHUNK]; | ||
32 | |||
33 | /* allocate deflate state */ | ||
34 | strm.zalloc = Z_NULL; | ||
35 | strm.zfree = Z_NULL; | ||
36 | strm.opaque = Z_NULL; | ||
37 | ret = deflateInit(&strm, level); | ||
38 | if (ret != Z_OK) | ||
39 | return ret; | ||
40 | |||
41 | /* compress until end of file */ | ||
42 | do { | ||
43 | strm.avail_in = fread(in, 1, CHUNK, source); | ||
44 | if (ferror(source)) { | ||
45 | (void)deflateEnd(&strm); | ||
46 | return Z_ERRNO; | ||
47 | } | ||
48 | flush = feof(source) ? Z_FINISH : Z_NO_FLUSH; | ||
49 | strm.next_in = in; | ||
50 | |||
51 | /* run deflate() on input until output buffer not full, finish | ||
52 | compression if all of source has been read in */ | ||
53 | do { | ||
54 | strm.avail_out = CHUNK; | ||
55 | strm.next_out = out; | ||
56 | ret = deflate(&strm, flush); /* no bad return value */ | ||
57 | assert(ret != Z_STREAM_ERROR); /* state not clobbered */ | ||
58 | have = CHUNK - strm.avail_out; | ||
59 | if (fwrite(out, 1, have, dest) != have || ferror(dest)) { | ||
60 | (void)deflateEnd(&strm); | ||
61 | return Z_ERRNO; | ||
62 | } | ||
63 | } while (strm.avail_out == 0); | ||
64 | assert(strm.avail_in == 0); /* all input will be used */ | ||
65 | |||
66 | /* done when last data in file processed */ | ||
67 | } while (flush != Z_FINISH); | ||
68 | assert(ret == Z_STREAM_END); /* stream will be complete */ | ||
69 | |||
70 | /* clean up and return */ | ||
71 | (void)deflateEnd(&strm); | ||
72 | return Z_OK; | ||
73 | } | ||
74 | |||
75 | /* Decompress from file source to file dest until stream ends or EOF. | ||
76 | inf() returns Z_OK on success, Z_MEM_ERROR if memory could not be | ||
77 | allocated for processing, Z_DATA_ERROR if the deflate data is | ||
78 | invalid or incomplete, Z_VERSION_ERROR if the version of zlib.h and | ||
79 | the version of the library linked do not match, or Z_ERRNO if there | ||
80 | is an error reading or writing the files. */ | ||
81 | int inf(FILE *source, FILE *dest) | ||
82 | { | ||
83 | int ret; | ||
84 | unsigned have; | ||
85 | z_stream strm; | ||
86 | char in[CHUNK]; | ||
87 | char out[CHUNK]; | ||
88 | |||
89 | /* allocate inflate state */ | ||
90 | strm.zalloc = Z_NULL; | ||
91 | strm.zfree = Z_NULL; | ||
92 | strm.opaque = Z_NULL; | ||
93 | strm.avail_in = 0; | ||
94 | strm.next_in = Z_NULL; | ||
95 | ret = inflateInit(&strm); | ||
96 | if (ret != Z_OK) | ||
97 | return ret; | ||
98 | |||
99 | /* decompress until deflate stream ends or end of file */ | ||
100 | do { | ||
101 | strm.avail_in = fread(in, 1, CHUNK, source); | ||
102 | if (ferror(source)) { | ||
103 | (void)inflateEnd(&strm); | ||
104 | return Z_ERRNO; | ||
105 | } | ||
106 | if (strm.avail_in == 0) | ||
107 | break; | ||
108 | strm.next_in = in; | ||
109 | |||
110 | /* run inflate() on input until output buffer not full */ | ||
111 | do { | ||
112 | strm.avail_out = CHUNK; | ||
113 | strm.next_out = out; | ||
114 | ret = inflate(&strm, Z_NO_FLUSH); | ||
115 | assert(ret != Z_STREAM_ERROR); /* state not clobbered */ | ||
116 | switch (ret) { | ||
117 | case Z_NEED_DICT: | ||
118 | ret = Z_DATA_ERROR; /* and fall through */ | ||
119 | case Z_DATA_ERROR: | ||
120 | case Z_MEM_ERROR: | ||
121 | (void)inflateEnd(&strm); | ||
122 | return ret; | ||
123 | } | ||
124 | have = CHUNK - strm.avail_out; | ||
125 | if (fwrite(out, 1, have, dest) != have || ferror(dest)) { | ||
126 | (void)inflateEnd(&strm); | ||
127 | return Z_ERRNO; | ||
128 | } | ||
129 | } while (strm.avail_out == 0); | ||
130 | assert(strm.avail_in == 0); /* all input will be used */ | ||
131 | |||
132 | /* done when inflate() says it's done */ | ||
133 | } while (ret != Z_STREAM_END); | ||
134 | |||
135 | /* clean up and return */ | ||
136 | (void)inflateEnd(&strm); | ||
137 | return ret == Z_STREAM_END ? Z_OK : Z_DATA_ERROR; | ||
138 | } | ||
139 | |||
140 | /* report a zlib or i/o error */ | ||
141 | void zerr(int ret) | ||
142 | { | ||
143 | fputs("zpipe: ", stderr); | ||
144 | switch (ret) { | ||
145 | case Z_ERRNO: | ||
146 | if (ferror(stdin)) | ||
147 | fputs("error reading stdin\n", stderr); | ||
148 | if (ferror(stdout)) | ||
149 | fputs("error writing stdout\n", stderr); | ||
150 | break; | ||
151 | case Z_STREAM_ERROR: | ||
152 | fputs("invalid compression level\n", stderr); | ||
153 | break; | ||
154 | case Z_DATA_ERROR: | ||
155 | fputs("invalid or incomplete deflate data\n", stderr); | ||
156 | break; | ||
157 | case Z_MEM_ERROR: | ||
158 | fputs("out of memory\n", stderr); | ||
159 | break; | ||
160 | case Z_VERSION_ERROR: | ||
161 | fputs("zlib version mismatch!\n", stderr); | ||
162 | } | ||
163 | } | ||
164 | |||
165 | /* compress or decompress from stdin to stdout */ | ||
166 | int main(int argc, char **argv) | ||
167 | { | ||
168 | int ret; | ||
169 | |||
170 | /* do compression if no arguments */ | ||
171 | if (argc == 1) { | ||
172 | ret = def(stdin, stdout, Z_DEFAULT_COMPRESSION); | ||
173 | if (ret != Z_OK) | ||
174 | zerr(ret); | ||
175 | return ret; | ||
176 | } | ||
177 | |||
178 | /* do decompression if -d specified */ | ||
179 | else if (argc == 2 && strcmp(argv[1], "-d") == 0) { | ||
180 | ret = inf(stdin, stdout); | ||
181 | if (ret != Z_OK) | ||
182 | zerr(ret); | ||
183 | return ret; | ||
184 | } | ||
185 | |||
186 | /* otherwise, report usage */ | ||
187 | else { | ||
188 | fputs("zpipe usage: zpipe [-d] < source > dest\n", stderr); | ||
189 | return 1; | ||
190 | } | ||
191 | } | ||
@@ -220,7 +220,7 @@ gzFile ZEXPORT gzdopen (fd, mode) | |||
220 | int fd; | 220 | int fd; |
221 | const char *mode; | 221 | const char *mode; |
222 | { | 222 | { |
223 | char name[20]; | 223 | char name[46]; /* allow for up to 128-bit integers */ |
224 | 224 | ||
225 | if (fd < 0) return (gzFile)Z_NULL; | 225 | if (fd < 0) return (gzFile)Z_NULL; |
226 | sprintf(name, "<fd:%d>", fd); /* for debugging */ | 226 | sprintf(name, "<fd:%d>", fd); /* for debugging */ |
@@ -959,6 +959,12 @@ int ZEXPORT gzclose (file) | |||
959 | return destroy((gz_stream*)file); | 959 | return destroy((gz_stream*)file); |
960 | } | 960 | } |
961 | 961 | ||
962 | #ifdef STDC | ||
963 | # define zstrerror(errnum) strerror(errnum) | ||
964 | #else | ||
965 | # define zstrerror(errnum) "" | ||
966 | #endif | ||
967 | |||
962 | /* =========================================================================== | 968 | /* =========================================================================== |
963 | Returns the error message for the last error which occured on the | 969 | Returns the error message for the last error which occured on the |
964 | given compressed file. errnum is set to zlib error number. If an | 970 | given compressed file. errnum is set to zlib error number. If an |
@@ -51,6 +51,7 @@ int stream_size; | |||
51 | if (state == Z_NULL) return Z_MEM_ERROR; | 51 | if (state == Z_NULL) return Z_MEM_ERROR; |
52 | Tracev((stderr, "inflate: allocated\n")); | 52 | Tracev((stderr, "inflate: allocated\n")); |
53 | strm->state = (voidpf)state; | 53 | strm->state = (voidpf)state; |
54 | state->dmax = 32768U; | ||
54 | state->wbits = windowBits; | 55 | state->wbits = windowBits; |
55 | state->wsize = 1U << windowBits; | 56 | state->wsize = 1U << windowBits; |
56 | state->window = window; | 57 | state->window = window; |
@@ -74,6 +74,9 @@ unsigned start; /* inflate()'s starting value for strm->avail_out */ | |||
74 | unsigned char FAR *out; /* local strm->next_out */ | 74 | unsigned char FAR *out; /* local strm->next_out */ |
75 | unsigned char FAR *beg; /* inflate()'s initial strm->next_out */ | 75 | unsigned char FAR *beg; /* inflate()'s initial strm->next_out */ |
76 | unsigned char FAR *end; /* while out < end, enough space available */ | 76 | unsigned char FAR *end; /* while out < end, enough space available */ |
77 | #ifdef INFLATE_STRICT | ||
78 | unsigned dmax; /* maximum distance from zlib header */ | ||
79 | #endif | ||
77 | unsigned wsize; /* window size or zero if not using window */ | 80 | unsigned wsize; /* window size or zero if not using window */ |
78 | unsigned whave; /* valid bytes in the window */ | 81 | unsigned whave; /* valid bytes in the window */ |
79 | unsigned write; /* window write index */ | 82 | unsigned write; /* window write index */ |
@@ -98,6 +101,9 @@ unsigned start; /* inflate()'s starting value for strm->avail_out */ | |||
98 | out = strm->next_out - OFF; | 101 | out = strm->next_out - OFF; |
99 | beg = out - (start - strm->avail_out); | 102 | beg = out - (start - strm->avail_out); |
100 | end = out + (strm->avail_out - 257); | 103 | end = out + (strm->avail_out - 257); |
104 | #ifdef INFLATE_STRICT | ||
105 | dmax = state->dmax; | ||
106 | #endif | ||
101 | wsize = state->wsize; | 107 | wsize = state->wsize; |
102 | whave = state->whave; | 108 | whave = state->whave; |
103 | write = state->write; | 109 | write = state->write; |
@@ -167,6 +173,13 @@ unsigned start; /* inflate()'s starting value for strm->avail_out */ | |||
167 | } | 173 | } |
168 | } | 174 | } |
169 | dist += (unsigned)hold & ((1U << op) - 1); | 175 | dist += (unsigned)hold & ((1U << op) - 1); |
176 | #ifdef INFLATE_STRICT | ||
177 | if (dist > dmax) { | ||
178 | strm->msg = (char *)"invalid distance too far back"; | ||
179 | state->mode = BAD; | ||
180 | break; | ||
181 | } | ||
182 | #endif | ||
170 | hold >>= op; | 183 | hold >>= op; |
171 | bits -= op; | 184 | bits -= op; |
172 | Tracevv((stderr, "inflate: distance %u\n", dist)); | 185 | Tracevv((stderr, "inflate: distance %u\n", dist)); |
@@ -113,6 +113,7 @@ z_streamp strm; | |||
113 | state->mode = HEAD; | 113 | state->mode = HEAD; |
114 | state->last = 0; | 114 | state->last = 0; |
115 | state->havedict = 0; | 115 | state->havedict = 0; |
116 | state->dmax = 32768U; | ||
116 | state->head = Z_NULL; | 117 | state->head = Z_NULL; |
117 | state->wsize = 0; | 118 | state->wsize = 0; |
118 | state->whave = 0; | 119 | state->whave = 0; |
@@ -600,11 +601,13 @@ int flush; | |||
600 | break; | 601 | break; |
601 | } | 602 | } |
602 | DROPBITS(4); | 603 | DROPBITS(4); |
603 | if (BITS(4) + 8 > state->wbits) { | 604 | len = BITS(4) + 8; |
605 | if (len > state->wbits) { | ||
604 | strm->msg = (char *)"invalid window size"; | 606 | strm->msg = (char *)"invalid window size"; |
605 | state->mode = BAD; | 607 | state->mode = BAD; |
606 | break; | 608 | break; |
607 | } | 609 | } |
610 | state->dmax = 1U << len; | ||
608 | Tracev((stderr, "inflate: zlib header ok\n")); | 611 | Tracev((stderr, "inflate: zlib header ok\n")); |
609 | strm->adler = state->check = adler32(0L, Z_NULL, 0); | 612 | strm->adler = state->check = adler32(0L, Z_NULL, 0); |
610 | state->mode = hold & 0x200 ? DICTID : TYPE; | 613 | state->mode = hold & 0x200 ? DICTID : TYPE; |
@@ -1009,6 +1012,13 @@ int flush; | |||
1009 | state->offset += BITS(state->extra); | 1012 | state->offset += BITS(state->extra); |
1010 | DROPBITS(state->extra); | 1013 | DROPBITS(state->extra); |
1011 | } | 1014 | } |
1015 | #ifdef INFLATE_STRICT | ||
1016 | if (state->offset > state->dmax) { | ||
1017 | strm->msg = (char *)"invalid distance too far back"; | ||
1018 | state->mode = BAD; | ||
1019 | break; | ||
1020 | } | ||
1021 | #endif | ||
1012 | if (state->offset > state->whave + out - left) { | 1022 | if (state->offset > state->whave + out - left) { |
1013 | strm->msg = (char *)"invalid distance too far back"; | 1023 | strm->msg = (char *)"invalid distance too far back"; |
1014 | state->mode = BAD; | 1024 | state->mode = BAD; |
@@ -1322,8 +1332,8 @@ z_streamp source; | |||
1322 | } | 1332 | } |
1323 | 1333 | ||
1324 | /* copy state */ | 1334 | /* copy state */ |
1325 | *dest = *source; | 1335 | zmemcpy(dest, source, sizeof(z_stream)); |
1326 | *copy = *state; | 1336 | zmemcpy(copy, state, sizeof(struct inflate_state)); |
1327 | copy->lencode = copy->codes + (state->lencode - state->codes); | 1337 | copy->lencode = copy->codes + (state->lencode - state->codes); |
1328 | copy->distcode = copy->codes + (state->distcode - state->codes); | 1338 | copy->distcode = copy->codes + (state->distcode - state->codes); |
1329 | copy->next = copy->codes + (state->next - state->codes); | 1339 | copy->next = copy->codes + (state->next - state->codes); |
@@ -80,6 +80,7 @@ struct inflate_state { | |||
80 | int wrap; /* bit 0 true for zlib, bit 1 true for gzip */ | 80 | int wrap; /* bit 0 true for zlib, bit 1 true for gzip */ |
81 | int havedict; /* true if dictionary provided */ | 81 | int havedict; /* true if dictionary provided */ |
82 | int flags; /* gzip header method and flags (0 if zlib) */ | 82 | int flags; /* gzip header method and flags (0 if zlib) */ |
83 | unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */ | ||
83 | unsigned long check; /* protected copy of check value */ | 84 | unsigned long check; /* protected copy of check value */ |
84 | unsigned long total; /* protected copy of output count */ | 85 | unsigned long total; /* protected copy of output count */ |
85 | gz_headerp head; /* where to save gzip header information */ | 86 | gz_headerp head; /* where to save gzip header information */ |
@@ -9,7 +9,7 @@ | |||
9 | #define MAXBITS 15 | 9 | #define MAXBITS 15 |
10 | 10 | ||
11 | const char inflate_copyright[] = | 11 | const char inflate_copyright[] = |
12 | " inflate 1.2.2.1 Copyright 1995-2004 Mark Adler "; | 12 | " inflate 1.2.2.2 Copyright 1995-2004 Mark Adler "; |
13 | /* | 13 | /* |
14 | If you use the zlib library in a product, an acknowledgment is welcome | 14 | If you use the zlib library in a product, an acknowledgment is welcome |
15 | in the documentation of your product. If for some reason you cannot | 15 | in the documentation of your product. If for some reason you cannot |
@@ -62,7 +62,7 @@ unsigned short FAR *work; | |||
62 | 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; | 62 | 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; |
63 | static const unsigned short lext[31] = { /* Length codes 257..285 extra */ | 63 | static const unsigned short lext[31] = { /* Length codes 257..285 extra */ |
64 | 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, | 64 | 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, |
65 | 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 77, 207}; | 65 | 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 199}; |
66 | static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ | 66 | static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ |
67 | 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, | 67 | 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, |
68 | 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, | 68 | 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, |
diff --git a/old/Make_vms.com b/make_vms.com index 4fe3013..e6587cd 100755..100644 --- a/old/Make_vms.com +++ b/make_vms.com | |||
@@ -32,25 +32,24 @@ $ CALL MAKE adler32.OBJ "CC ''CCOPT' adler32" - | |||
32 | $ CALL MAKE compress.OBJ "CC ''CCOPT' compress" - | 32 | $ CALL MAKE compress.OBJ "CC ''CCOPT' compress" - |
33 | compress.c zlib.h zconf.h | 33 | compress.c zlib.h zconf.h |
34 | $ CALL MAKE crc32.OBJ "CC ''CCOPT' crc32" - | 34 | $ CALL MAKE crc32.OBJ "CC ''CCOPT' crc32" - |
35 | crc32.c zlib.h zconf.h | 35 | crc32.c crc32.h zlib.h zconf.h zutil.h |
36 | $ CALL MAKE deflate.OBJ "CC ''CCOPT' deflate" - | 36 | $ CALL MAKE deflate.OBJ "CC ''CCOPT' deflate" - |
37 | deflate.c deflate.h zutil.h zlib.h zconf.h | 37 | deflate.c deflate.h zutil.h zlib.h zconf.h |
38 | $ CALL MAKE gzio.OBJ "CC ''CCOPT' gzio" - | 38 | $ CALL MAKE gzio.OBJ "CC ''CCOPT' gzio /define=""NO_vsnprintf""" - |
39 | gzio.c zutil.h zlib.h zconf.h | 39 | gzio.c zutil.h zlib.h zconf.h |
40 | $ CALL MAKE infblock.OBJ "CC ''CCOPT' infblock" - | 40 | $ CALL MAKE infback.OBJ "CC ''CCOPT' infback" - |
41 | infblock.c zutil.h zlib.h zconf.h infblock.h | 41 | infback.c zutil.h zlib.h zconf.h - |
42 | $ CALL MAKE infcodes.OBJ "CC ''CCOPT' infcodes" - | 42 | "inftrees.h inflate.h inffast.h inffixed.h" |
43 | infcodes.c zutil.h zlib.h zconf.h inftrees.h | ||
44 | $ CALL MAKE inffast.OBJ "CC ''CCOPT' inffast" - | 43 | $ CALL MAKE inffast.OBJ "CC ''CCOPT' inffast" - |
45 | inffast.c zutil.h zlib.h zconf.h inffast.h | 44 | inffast.c zutil.h zlib.h zconf.h - |
45 | "inftrees.h inflate.h inffast.h" | ||
46 | $ CALL MAKE inflate.OBJ "CC ''CCOPT' inflate" - | 46 | $ CALL MAKE inflate.OBJ "CC ''CCOPT' inflate" - |
47 | inflate.c zutil.h zlib.h zconf.h infblock.h | 47 | inflate.c zutil.h zlib.h zconf.h - |
48 | "inftrees.h inflate.h inffast.h inffixed.h" | ||
48 | $ CALL MAKE inftrees.OBJ "CC ''CCOPT' inftrees" - | 49 | $ CALL MAKE inftrees.OBJ "CC ''CCOPT' inftrees" - |
49 | inftrees.c zutil.h zlib.h zconf.h inftrees.h | 50 | inftrees.c zutil.h zlib.h zconf.h inftrees.h |
50 | $ CALL MAKE infutil.OBJ "CC ''CCOPT' infutil" - | ||
51 | infutil.c zutil.h zlib.h zconf.h inftrees.h infutil.h | ||
52 | $ CALL MAKE trees.OBJ "CC ''CCOPT' trees" - | 51 | $ CALL MAKE trees.OBJ "CC ''CCOPT' trees" - |
53 | trees.c deflate.h zutil.h zlib.h zconf.h | 52 | trees.c trees.h deflate.h zutil.h zlib.h zconf.h |
54 | $ CALL MAKE uncompr.OBJ "CC ''CCOPT' uncompr" - | 53 | $ CALL MAKE uncompr.OBJ "CC ''CCOPT' uncompr" - |
55 | uncompr.c zlib.h zconf.h | 54 | uncompr.c zlib.h zconf.h |
56 | $ CALL MAKE zutil.OBJ "CC ''CCOPT' zutil" - | 55 | $ CALL MAKE zutil.OBJ "CC ''CCOPT' zutil" - |
@@ -65,7 +64,7 @@ $ write sys$output "Building minigzip..." | |||
65 | $ CALL MAKE minigzip.OBJ "CC ''CCOPT' minigzip" - | 64 | $ CALL MAKE minigzip.OBJ "CC ''CCOPT' minigzip" - |
66 | minigzip.c zlib.h zconf.h | 65 | minigzip.c zlib.h zconf.h |
67 | $ call make minigzip.exe - | 66 | $ call make minigzip.exe - |
68 | "LINK minigzip,libz.olb/lib,x11vms:xvmsutils.olb/lib" - | 67 | "LINK minigzip,libz.olb/lib" - |
69 | minigzip.obj libz.olb | 68 | minigzip.obj libz.olb |
70 | $ else | 69 | $ else |
71 | $ mms/macro=('comp') | 70 | $ mms/macro=('comp') |
diff --git a/qnx/package.qpg b/qnx/package.qpg index e80311c..03cd351 100644 --- a/qnx/package.qpg +++ b/qnx/package.qpg | |||
@@ -25,10 +25,10 @@ | |||
25 | <QPG:Files> | 25 | <QPG:Files> |
26 | <QPG:Add file="../zconf.h" install="/opt/include/" user="root:sys" permission="644"/> | 26 | <QPG:Add file="../zconf.h" install="/opt/include/" user="root:sys" permission="644"/> |
27 | <QPG:Add file="../zlib.h" install="/opt/include/" user="root:sys" permission="644"/> | 27 | <QPG:Add file="../zlib.h" install="/opt/include/" user="root:sys" permission="644"/> |
28 | <QPG:Add file="../libz.so.1.2.2.1" install="/opt/lib/" user="root:bin" permission="644"/> | 28 | <QPG:Add file="../libz.so.1.2.2.2" install="/opt/lib/" user="root:bin" permission="644"/> |
29 | <QPG:Add file="libz.so" install="/opt/lib/" component="dev" filetype="symlink" linkto="libz.so.1.2.2.1"/> | 29 | <QPG:Add file="libz.so" install="/opt/lib/" component="dev" filetype="symlink" linkto="libz.so.1.2.2.2"/> |
30 | <QPG:Add file="libz.so.1" install="/opt/lib/" filetype="symlink" linkto="libz.so.1.2.2.1"/> | 30 | <QPG:Add file="libz.so.1" install="/opt/lib/" filetype="symlink" linkto="libz.so.1.2.2.2"/> |
31 | <QPG:Add file="../libz.so.1.2.2.1" install="/opt/lib/" component="slib"/> | 31 | <QPG:Add file="../libz.so.1.2.2.2" install="/opt/lib/" component="slib"/> |
32 | </QPG:Files> | 32 | </QPG:Files> |
33 | 33 | ||
34 | <QPG:PackageFilter> | 34 | <QPG:PackageFilter> |
@@ -63,7 +63,7 @@ | |||
63 | </QPM:ProductDescription> | 63 | </QPM:ProductDescription> |
64 | 64 | ||
65 | <QPM:ReleaseDescription> | 65 | <QPM:ReleaseDescription> |
66 | <QPM:ReleaseVersion>1.2.2.1</QPM:ReleaseVersion> | 66 | <QPM:ReleaseVersion>1.2.2.2</QPM:ReleaseVersion> |
67 | <QPM:ReleaseUrgency>Medium</QPM:ReleaseUrgency> | 67 | <QPM:ReleaseUrgency>Medium</QPM:ReleaseUrgency> |
68 | <QPM:ReleaseStability>Stable</QPM:ReleaseStability> | 68 | <QPM:ReleaseStability>Stable</QPM:ReleaseStability> |
69 | <QPM:ReleaseNoteMinor></QPM:ReleaseNoteMinor> | 69 | <QPM:ReleaseNoteMinor></QPM:ReleaseNoteMinor> |
@@ -934,22 +934,6 @@ void _tr_flush_block(s, buf, stored_len, eof) | |||
934 | if (stored_len > 0 && s->strm->data_type == Z_UNKNOWN) | 934 | if (stored_len > 0 && s->strm->data_type == Z_UNKNOWN) |
935 | set_data_type(s); | 935 | set_data_type(s); |
936 | 936 | ||
937 | #ifdef DEBUG | ||
938 | /* Write out literal/length frequencies for benchmarking */ | ||
939 | if (z_verbose) { | ||
940 | FILE *freq; | ||
941 | freq = fopen("defreq.txt", "a"); | ||
942 | if (freq != NULL) { | ||
943 | int n; | ||
944 | fputs("ltree:", freq); | ||
945 | for (n = 0; n < L_CODES; n++) | ||
946 | fprintf(freq, " %d", s->dyn_ltree[n].Freq); | ||
947 | putc('\n', freq); | ||
948 | fclose(freq); | ||
949 | } | ||
950 | } | ||
951 | #endif | ||
952 | |||
953 | /* Construct the literal and distance trees */ | 937 | /* Construct the literal and distance trees */ |
954 | build_tree(s, (tree_desc *)(&(s->l_desc))); | 938 | build_tree(s, (tree_desc *)(&(s->l_desc))); |
955 | Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, | 939 | Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, |
@@ -999,7 +983,7 @@ void _tr_flush_block(s, buf, stored_len, eof) | |||
999 | #ifdef FORCE_STATIC | 983 | #ifdef FORCE_STATIC |
1000 | } else if (static_lenb >= 0) { /* force static trees */ | 984 | } else if (static_lenb >= 0) { /* force static trees */ |
1001 | #else | 985 | #else |
1002 | } else if (static_lenb == opt_lenb) { | 986 | } else if (s->strategy == Z_FIXED || static_lenb == opt_lenb) { |
1003 | #endif | 987 | #endif |
1004 | send_bits(s, (STATIC_TREES<<1)+eof, 3); | 988 | send_bits(s, (STATIC_TREES<<1)+eof, 3); |
1005 | compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree); | 989 | compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree); |
diff --git a/win32/zlib1.rc b/win32/zlib1.rc index 2e98542..1d37694 100644 --- a/win32/zlib1.rc +++ b/win32/zlib1.rc | |||
@@ -5,8 +5,8 @@ VS_VERSION_INFO VERSIONINFO | |||
5 | #else | 5 | #else |
6 | VS_VERSION_INFO VERSIONINFO MOVEABLE IMPURE LOADONCALL DISCARDABLE | 6 | VS_VERSION_INFO VERSIONINFO MOVEABLE IMPURE LOADONCALL DISCARDABLE |
7 | #endif | 7 | #endif |
8 | FILEVERSION 1,2,2,1 | 8 | FILEVERSION 1,2,2,2 |
9 | PRODUCTVERSION 1,2,2,1 | 9 | PRODUCTVERSION 1,2,2,2 |
10 | FILEFLAGSMASK VS_FFI_FILEFLAGSMASK | 10 | FILEFLAGSMASK VS_FFI_FILEFLAGSMASK |
11 | #ifdef _DEBUG | 11 | #ifdef _DEBUG |
12 | FILEFLAGS 1 | 12 | FILEFLAGS 1 |
@@ -23,12 +23,12 @@ BEGIN | |||
23 | //language ID = U.S. English, char set = Windows, Multilingual | 23 | //language ID = U.S. English, char set = Windows, Multilingual |
24 | BEGIN | 24 | BEGIN |
25 | VALUE "FileDescription", "zlib data compression library\0" | 25 | VALUE "FileDescription", "zlib data compression library\0" |
26 | VALUE "FileVersion", "1.2.2.1\0" | 26 | VALUE "FileVersion", "1.2.2.2\0" |
27 | VALUE "InternalName", "zlib1.dll\0" | 27 | VALUE "InternalName", "zlib1.dll\0" |
28 | VALUE "LegalCopyright", "(C) 1995-2004 Jean-loup Gailly & Mark Adler\0" | 28 | VALUE "LegalCopyright", "(C) 1995-2004 Jean-loup Gailly & Mark Adler\0" |
29 | VALUE "OriginalFilename", "zlib1.dll\0" | 29 | VALUE "OriginalFilename", "zlib1.dll\0" |
30 | VALUE "ProductName", "zlib\0" | 30 | VALUE "ProductName", "zlib\0" |
31 | VALUE "ProductVersion", "1.2.2.1\0" | 31 | VALUE "ProductVersion", "1.2.2.2\0" |
32 | VALUE "Comments","DLL support by Alessandro Iacopetti & Gilles Vollant\0" | 32 | VALUE "Comments","DLL support by Alessandro Iacopetti & Gilles Vollant\0" |
33 | END | 33 | END |
34 | END | 34 | END |
@@ -1,4 +1,4 @@ | |||
1 | .TH ZLIB 3 "31 October 2004" | 1 | .TH ZLIB 3 "30 December 2004" |
2 | .SH NAME | 2 | .SH NAME |
3 | zlib \- compression/decompression library | 3 | zlib \- compression/decompression library |
4 | .SH SYNOPSIS | 4 | .SH SYNOPSIS |
@@ -133,7 +133,7 @@ before asking for help. | |||
133 | Send questions and/or comments to zlib@gzip.org, | 133 | Send questions and/or comments to zlib@gzip.org, |
134 | or (for the Windows DLL version) to Gilles Vollant (info@winimage.com). | 134 | or (for the Windows DLL version) to Gilles Vollant (info@winimage.com). |
135 | .SH AUTHORS | 135 | .SH AUTHORS |
136 | Version 1.2.2.1 | 136 | Version 1.2.2.2 |
137 | Copyright (C) 1995-2004 Jean-loup Gailly (jloup@gzip.org) | 137 | Copyright (C) 1995-2004 Jean-loup Gailly (jloup@gzip.org) |
138 | and Mark Adler (madler@alumni.caltech.edu). | 138 | and Mark Adler (madler@alumni.caltech.edu). |
139 | .LP | 139 | .LP |
@@ -1,5 +1,5 @@ | |||
1 | /* zlib.h -- interface of the 'zlib' general purpose compression library | 1 | /* zlib.h -- interface of the 'zlib' general purpose compression library |
2 | version 1.2.2.1, October 31st, 2004 | 2 | version 1.2.2.2, December 30th, 2004 |
3 | 3 | ||
4 | Copyright (C) 1995-2004 Jean-loup Gailly and Mark Adler | 4 | Copyright (C) 1995-2004 Jean-loup Gailly and Mark Adler |
5 | 5 | ||
@@ -37,8 +37,8 @@ | |||
37 | extern "C" { | 37 | extern "C" { |
38 | #endif | 38 | #endif |
39 | 39 | ||
40 | #define ZLIB_VERSION "1.2.2.1" | 40 | #define ZLIB_VERSION "1.2.2.2" |
41 | #define ZLIB_VERNUM 0x1221 | 41 | #define ZLIB_VERNUM 0x1222 |
42 | 42 | ||
43 | /* | 43 | /* |
44 | The 'zlib' compression library provides in-memory compression and | 44 | The 'zlib' compression library provides in-memory compression and |
@@ -189,6 +189,7 @@ typedef gz_header FAR *gz_headerp; | |||
189 | #define Z_FILTERED 1 | 189 | #define Z_FILTERED 1 |
190 | #define Z_HUFFMAN_ONLY 2 | 190 | #define Z_HUFFMAN_ONLY 2 |
191 | #define Z_RLE 3 | 191 | #define Z_RLE 3 |
192 | #define Z_FIXED 4 | ||
192 | #define Z_DEFAULT_STRATEGY 0 | 193 | #define Z_DEFAULT_STRATEGY 0 |
193 | /* compression strategy; see deflateInit2() below for details */ | 194 | /* compression strategy; see deflateInit2() below for details */ |
194 | 195 | ||
@@ -391,11 +392,11 @@ ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush)); | |||
391 | The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH, | 392 | The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH, |
392 | Z_FINISH, or Z_BLOCK. Z_SYNC_FLUSH requests that inflate() flush as much | 393 | Z_FINISH, or Z_BLOCK. Z_SYNC_FLUSH requests that inflate() flush as much |
393 | output as possible to the output buffer. Z_BLOCK requests that inflate() stop | 394 | output as possible to the output buffer. Z_BLOCK requests that inflate() stop |
394 | if and when it get to the next deflate block boundary. When decoding the zlib | 395 | if and when it gets to the next deflate block boundary. When decoding the |
395 | or gzip format, this will cause inflate() to return immediately after the | 396 | zlib or gzip format, this will cause inflate() to return immediately after |
396 | header and before the first block. When doing a raw inflate, inflate() will | 397 | the header and before the first block. When doing a raw inflate, inflate() |
397 | go ahead and process the first block, and will return when it gets to the end | 398 | will go ahead and process the first block, and will return when it gets to |
398 | of that block, or when it runs out of data. | 399 | the end of that block, or when it runs out of data. |
399 | 400 | ||
400 | The Z_BLOCK option assists in appending to or combining deflate streams. | 401 | The Z_BLOCK option assists in appending to or combining deflate streams. |
401 | Also to assist in this, on return inflate() will set strm->data_type to the | 402 | Also to assist in this, on return inflate() will set strm->data_type to the |
@@ -524,7 +525,9 @@ ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm, | |||
524 | Z_DEFAULT and Z_HUFFMAN_ONLY. Z_RLE is designed to be almost as fast as | 525 | Z_DEFAULT and Z_HUFFMAN_ONLY. Z_RLE is designed to be almost as fast as |
525 | Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy | 526 | Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy |
526 | parameter only affects the compression ratio but not the correctness of the | 527 | parameter only affects the compression ratio but not the correctness of the |
527 | compressed output even if it is not set appropriately. | 528 | compressed output even if it is not set appropriately. Z_FIXED prevents the |
529 | use of dynamic Huffman codes, allowing for a simpler decoder for special | ||
530 | applications. | ||
528 | 531 | ||
529 | deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough | 532 | deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough |
530 | memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid | 533 | memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid |
@@ -1230,7 +1233,7 @@ ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len)); | |||
1230 | */ | 1233 | */ |
1231 | 1234 | ||
1232 | ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2, | 1235 | ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2, |
1233 | uLong len2)); | 1236 | z_off_t len2)); |
1234 | /* | 1237 | /* |
1235 | Combine two Adler-32 checksums into one. For two sequences of bytes, seq1 | 1238 | Combine two Adler-32 checksums into one. For two sequences of bytes, seq1 |
1236 | and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for | 1239 | and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for |
@@ -1254,7 +1257,7 @@ ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len)); | |||
1254 | if (crc != original_crc) error(); | 1257 | if (crc != original_crc) error(); |
1255 | */ | 1258 | */ |
1256 | 1259 | ||
1257 | ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, uLong len2)); | 1260 | ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2)); |
1258 | 1261 | ||
1259 | /* | 1262 | /* |
1260 | Combine two CRC-32 check values into one. For two sequences of bytes, | 1263 | Combine two CRC-32 check values into one. For two sequences of bytes, |
@@ -137,7 +137,10 @@ const char * ZEXPORT zError(err) | |||
137 | } | 137 | } |
138 | 138 | ||
139 | #if defined(_WIN32_WCE) | 139 | #if defined(_WIN32_WCE) |
140 | /* does not exist on WCE */ | 140 | /* The Microsoft C Run-Time Library for Windows CE doesn't have |
141 | * errno. We define it as a global variable to simplify porting. | ||
142 | * Its value is always 0 and should not be used. | ||
143 | */ | ||
141 | int errno = 0; | 144 | int errno = 0; |
142 | #endif | 145 | #endif |
143 | 146 | ||
@@ -22,6 +22,14 @@ | |||
22 | # include <stdlib.h> | 22 | # include <stdlib.h> |
23 | #endif | 23 | #endif |
24 | #ifdef NO_ERRNO_H | 24 | #ifdef NO_ERRNO_H |
25 | # ifdef _WIN32_WCE | ||
26 | /* The Microsoft C Run-Time Library for Windows CE doesn't have | ||
27 | * errno. We define it as a global variable to simplify porting. | ||
28 | * Its value is always 0 and should not be used. We rename it to | ||
29 | * avoid conflict with other libraries that use the same workaround. | ||
30 | */ | ||
31 | # define errno z_errno | ||
32 | # endif | ||
25 | extern int errno; | 33 | extern int errno; |
26 | #else | 34 | #else |
27 | # include <errno.h> | 35 | # include <errno.h> |
@@ -193,15 +201,6 @@ extern const char * const z_errmsg[10]; /* indexed by 2-zlib_error */ | |||
193 | # define NO_vsnprintf | 201 | # define NO_vsnprintf |
194 | #endif | 202 | #endif |
195 | 203 | ||
196 | #ifdef HAVE_STRERROR | ||
197 | # ifndef VMS | ||
198 | extern char *strerror OF((int)); | ||
199 | # endif | ||
200 | # define zstrerror(errnum) strerror(errnum) | ||
201 | #else | ||
202 | # define zstrerror(errnum) "" | ||
203 | #endif | ||
204 | |||
205 | #if defined(pyr) | 204 | #if defined(pyr) |
206 | # define NO_MEMCPY | 205 | # define NO_MEMCPY |
207 | #endif | 206 | #endif |