2 Copyright (C) 1999-2007 id Software, Inc. and contributors.
3 For a list of contributors, see the accompanying CONTRIBUTORS file.
5 This file is part of GtkRadiant.
7 GtkRadiant is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 GtkRadiant is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GtkRadiant; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 /*****************************************************************************
25 * desc: IO on .zip files using portions of zlib
28 *****************************************************************************/
35 // TTimo added for safe_malloc wrapping
38 /* unzip.h -- IO for uncompress .zip files using zlib
39 Version 0.15 beta, Mar 19th, 1998,
41 Copyright (C) 1998 Gilles Vollant
43 This unzip package allow extract file from .ZIP file, compatible with PKZip 2.04g
44 WinZip, InfoZip tools and compatible.
45 Encryption and multi volume ZipFile (span) are not supported.
46 Old compressions used by old PKZip 1.x are not supported
48 THIS IS AN ALPHA VERSION. AT THIS STAGE OF DEVELOPPEMENT, SOMES API OR STRUCTURE
49 CAN CHANGE IN FUTURE VERSION !!
50 I WAIT FEEDBACK at mail info@winimage.com
51 Visit also http://www.winimage.com/zLibDll/unzip.htm for evolution
53 Condition of use and distribution are the same than zlib :
55 This software is provided 'as-is', without any express or implied
56 warranty. In no event will the authors be held liable for any damages
57 arising from the use of this software.
59 Permission is granted to anyone to use this software for any purpose,
60 including commercial applications, and to alter it and redistribute it
61 freely, subject to the following restrictions:
63 1. The origin of this software must not be misrepresented; you must not
64 claim that you wrote the original software. If you use this software
65 in a product, an acknowledgment in the product documentation would be
66 appreciated but is not required.
67 2. Altered source versions must be plainly marked as such, and must not be
68 misrepresented as being the original software.
69 3. This notice may not be removed or altered from any source distribution.
73 /* for more info about .ZIP format, see
74 ftp://ftp.cdrom.com/pub/infozip/doc/appnote-970311-iz.zip
75 PkWare has also a specification at :
76 ftp://ftp.pkware.com/probdesc.zip */
78 /* zlib.h -- interface of the 'zlib' general purpose compression library
79 version 1.1.3, July 9th, 1998
81 Copyright (C) 1995-1998 Jean-loup Gailly and Mark Adler
83 This software is provided 'as-is', without any express or implied
84 warranty. In no event will the authors be held liable for any damages
85 arising from the use of this software.
87 Permission is granted to anyone to use this software for any purpose,
88 including commercial applications, and to alter it and redistribute it
89 freely, subject to the following restrictions:
91 1. The origin of this software must not be misrepresented; you must not
92 claim that you wrote the original software. If you use this software
93 in a product, an acknowledgment in the product documentation would be
94 appreciated but is not required.
95 2. Altered source versions must be plainly marked as such, and must not be
96 misrepresented as being the original software.
97 3. This notice may not be removed or altered from any source distribution.
99 Jean-loup Gailly Mark Adler
100 jloup@gzip.org madler@alumni.caltech.edu
103 The data format used by the zlib library is described by RFCs (Request for
104 Comments) 1950 to 1952 in the files ftp://ds.internic.net/rfc/rfc1950.txt
105 (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).
108 /* zconf.h -- configuration of the zlib compression library
109 * Copyright (C) 1995-1998 Jean-loup Gailly.
110 * For conditions of distribution and use, see copyright notice in zlib.h
117 /* Maximum value for memLevel in deflateInit2 */
118 #ifndef MAX_MEM_LEVEL
120 # define MAX_MEM_LEVEL 8
122 # define MAX_MEM_LEVEL 9
126 /* Maximum value for windowBits in deflateInit2 and inflateInit2.
127 * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files
128 * created by gzip. (Files created by minigzip can still be extracted by
132 # define MAX_WBITS 15 /* 32K LZ77 window */
135 /* The memory requirements for deflate are (in bytes):
136 (1 << (windowBits+2)) + (1 << (memLevel+9))
137 that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values)
138 plus a few kilobytes for small objects. For example, if you want to reduce
139 the default memory requirements from 256K to 128K, compile with
140 make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
141 Of course this will generally degrade compression (there's no free lunch).
143 The memory requirements for inflate are (in bytes) 1 << windowBits
144 that is, 32K for windowBits=15 (default value) plus a few kilobytes
148 /* Type declarations */
150 #ifndef OF /* function prototypes */
151 #define OF( args ) args
154 typedef unsigned char Byte; /* 8 bits */
155 typedef unsigned int uInt; /* 16 bits or more */
156 typedef unsigned long uLong; /* 32 bits or more */
160 # define SEEK_SET 0 /* Seek from beginning of file. */
161 # define SEEK_CUR 1 /* Seek from current position. */
162 # define SEEK_END 2 /* Set file pointer to EOF plus "offset" */
165 #endif /* _ZCONF_H */
167 #define ZLIB_VERSION "1.1.3"
170 The 'zlib' compression library provides in-memory compression and
171 decompression functions, including integrity checks of the uncompressed
172 data. This version of the library supports only one compression method
173 (deflation) but other algorithms will be added later and will have the same
176 Compression can be done in a single step if the buffers are large
177 enough (for example if an input file is mmap'ed), or can be done by
178 repeated calls of the compression function. In the latter case, the
179 application must provide more input and/or consume the output
180 (providing more output space) before each call.
182 The library also supports reading and writing files in gzip (.gz) format
183 with an interface similar to that of stdio.
185 The library does not install any signal handler. The decoder checks
186 the consistency of the compressed data, so the library should never
187 crash even in case of corrupted input.
191 The application must update next_in and avail_in when avail_in has
192 dropped to zero. It must update next_out and avail_out when avail_out
193 has dropped to zero. The application must initialize zalloc, zfree and
194 opaque before calling the init function. All other fields are set by the
195 compression library and must not be updated by the application.
197 The opaque value provided by the application will be passed as the first
198 parameter for calls of zalloc and zfree. This can be useful for custom
199 memory management. The compression library attaches no meaning to the
202 zalloc must return Z_NULL if there is not enough memory for the object.
203 If zlib is used in a multi-threaded application, zalloc and zfree must be
206 On 16-bit systems, the functions zalloc and zfree must be able to allocate
207 exactly 65536 bytes, but will not be required to allocate more than this
208 if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS,
209 pointers returned by zalloc for objects of exactly 65536 bytes *must*
210 have their offset normalized to zero. The default allocation function
211 provided by this library ensures this (see zutil.c). To reduce memory
212 requirements and avoid any allocation of 64K objects, at the expense of
213 compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h).
215 The fields total_in and total_out can be used for statistics or
216 progress reports. After compression, total_in holds the total size of
217 the uncompressed data and may be saved for use in the decompressor
218 (particularly if the decompressor wants to decompress everything in
225 #define Z_PARTIAL_FLUSH 1 /* will be removed, use Z_SYNC_FLUSH instead */
226 #define Z_SYNC_FLUSH 2
227 #define Z_FULL_FLUSH 3
229 /* Allowed flush values; see deflate() below for details */
232 #define Z_STREAM_END 1
233 #define Z_NEED_DICT 2
234 #define Z_ERRNO ( -1 )
235 #define Z_STREAM_ERROR ( -2 )
236 #define Z_DATA_ERROR ( -3 )
237 #define Z_MEM_ERROR ( -4 )
238 #define Z_BUF_ERROR ( -5 )
239 #define Z_VERSION_ERROR ( -6 )
240 /* Return codes for the compression/decompression functions. Negative
241 * values are errors, positive values are used for special but normal events.
244 #define Z_NO_COMPRESSION 0
245 #define Z_BEST_SPEED 1
246 #define Z_BEST_COMPRESSION 9
247 #define Z_DEFAULT_COMPRESSION ( -1 )
248 /* compression levels */
251 #define Z_HUFFMAN_ONLY 2
252 #define Z_DEFAULT_STRATEGY 0
253 /* compression strategy; see deflateInit2() below for details */
258 /* Possible values of the data_type field */
261 /* The deflate compression method (the only one supported in this version) */
263 #define Z_NULL 0 /* for initializing zalloc, zfree, opaque */
265 #define zlib_version zlibVersion()
266 /* for compatibility with versions < 1.0.2 */
268 /* basic functions */
270 const char * zlibVersion OF( (void) );
271 /* The application can compare zlibVersion and ZLIB_VERSION for consistency.
272 If the first character differs, the library code actually used is
273 not compatible with the zlib.h header file used by the application.
274 This check is automatically made by deflateInit and inflateInit.
278 int deflateInit OF((z_streamp strm, int level));
280 Initializes the internal stream state for compression. The fields
281 zalloc, zfree and opaque must be initialized before by the caller.
282 If zalloc and zfree are set to Z_NULL, deflateInit updates them to
283 use default allocation functions.
285 The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9:
286 1 gives best speed, 9 gives best compression, 0 gives no compression at
287 all (the input data is simply copied a block at a time).
288 Z_DEFAULT_COMPRESSION requests a default compromise between speed and
289 compression (currently equivalent to level 6).
291 deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not
292 enough memory, Z_STREAM_ERROR if level is not a valid compression level,
293 Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible
294 with the version assumed by the caller (ZLIB_VERSION).
295 msg is set to null if there is no error message. deflateInit does not
296 perform any compression: this will be done by deflate().
300 int deflate OF( ( z_streamp strm, int flush ) );
302 deflate compresses as much data as possible, and stops when the input
303 buffer becomes empty or the output buffer becomes full. It may introduce some
304 output latency (reading input without producing any output) except when
307 The detailed semantics are as follows. deflate performs one or both of the
310 - Compress more input starting at next_in and update next_in and avail_in
311 accordingly. If not all input can be processed (because there is not
312 enough room in the output buffer), next_in and avail_in are updated and
313 processing will resume at this point for the next call of deflate().
315 - Provide more output starting at next_out and update next_out and avail_out
316 accordingly. This action is forced if the parameter flush is non zero.
317 Forcing flush frequently degrades the compression ratio, so this parameter
318 should be set only when necessary (in interactive applications).
319 Some output may be provided even if flush is not set.
321 Before the call of deflate(), the application should ensure that at least
322 one of the actions is possible, by providing more input and/or consuming
323 more output, and updating avail_in or avail_out accordingly; avail_out
324 should never be zero before the call. The application can consume the
325 compressed output when it wants, for example when the output buffer is full
326 (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK
327 and with zero avail_out, it must be called again after making room in the
328 output buffer because there might be more output pending.
330 If the parameter flush is set to Z_SYNC_FLUSH, all pending output is
331 flushed to the output buffer and the output is aligned on a byte boundary, so
332 that the decompressor can get all input data available so far. (In particular
333 avail_in is zero after the call if enough output space has been provided
334 before the call.) Flushing may degrade compression for some compression
335 algorithms and so it should be used only when necessary.
337 If flush is set to Z_FULL_FLUSH, all output is flushed as with
338 Z_SYNC_FLUSH, and the compression state is reset so that decompression can
339 restart from this point if previous compressed data has been damaged or if
340 random access is desired. Using Z_FULL_FLUSH too often can seriously degrade
343 If deflate returns with avail_out == 0, this function must be called again
344 with the same value of the flush parameter and more output space (updated
345 avail_out), until the flush is complete (deflate returns with non-zero
348 If the parameter flush is set to Z_FINISH, pending input is processed,
349 pending output is flushed and deflate returns with Z_STREAM_END if there
350 was enough output space; if deflate returns with Z_OK, this function must be
351 called again with Z_FINISH and more output space (updated avail_out) but no
352 more input data, until it returns with Z_STREAM_END or an error. After
353 deflate has returned Z_STREAM_END, the only possible operations on the
354 stream are deflateReset or deflateEnd.
356 Z_FINISH can be used immediately after deflateInit if all the compression
357 is to be done in a single step. In this case, avail_out must be at least
358 0.1% larger than avail_in plus 12 bytes. If deflate does not return
359 Z_STREAM_END, then it must be called again as described above.
361 deflate() sets strm->adler to the adler32 checksum of all input read
362 so (that is, total_in bytes).
364 deflate() may update data_type if it can make a good guess about
365 the input data type (Z_ASCII or Z_BINARY). In doubt, the data is considered
366 binary. This field is only for information purposes and does not affect
367 the compression algorithm in any manner.
369 deflate() returns Z_OK if some progress has been made (more input
370 processed or more output produced), Z_STREAM_END if all input has been
371 consumed and all output has been produced (only when flush is set to
372 Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example
373 if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible
374 (for example avail_in or avail_out was zero).
378 int deflateEnd OF( (z_streamp strm) );
380 All dynamically allocated data structures for this stream are freed.
381 This function discards any unprocessed input and does not flush any
384 deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the
385 stream state was inconsistent, Z_DATA_ERROR if the stream was freed
386 prematurely (some input or output was discarded). In the error case,
387 msg may be set but then points to a static string (which must not be
393 int inflateInit OF((z_streamp strm));
395 Initializes the internal stream state for decompression. The fields
396 next_in, avail_in, zalloc, zfree and opaque must be initialized before by
397 the caller. If next_in is not Z_NULL and avail_in is large enough (the exact
398 value depends on the compression method), inflateInit determines the
399 compression method from the zlib header and allocates all data structures
400 accordingly; otherwise the allocation will be deferred to the first call of
401 inflate. If zalloc and zfree are set to Z_NULL, inflateInit updates them to
402 use default allocation functions.
404 inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough
405 memory, Z_VERSION_ERROR if the zlib library version is incompatible with the
406 version assumed by the caller. msg is set to null if there is no error
407 message. inflateInit does not perform any decompression apart from reading
408 the zlib header if present: this will be done by inflate(). (So next_in and
409 avail_in may be modified, but next_out and avail_out are unchanged.)
413 int inflate OF( ( z_streamp strm, int flush ) );
415 inflate decompresses as much data as possible, and stops when the input
416 buffer becomes empty or the output buffer becomes full. It may some
417 introduce some output latency (reading input without producing any output)
418 except when forced to flush.
420 The detailed semantics are as follows. inflate performs one or both of the
423 - Decompress more input starting at next_in and update next_in and avail_in
424 accordingly. If not all input can be processed (because there is not
425 enough room in the output buffer), next_in is updated and processing
426 will resume at this point for the next call of inflate().
428 - Provide more output starting at next_out and update next_out and avail_out
429 accordingly. inflate() provides as much output as possible, until there
430 is no more input data or no more space in the output buffer (see below
431 about the flush parameter).
433 Before the call of inflate(), the application should ensure that at least
434 one of the actions is possible, by providing more input and/or consuming
435 more output, and updating the next_* and avail_* values accordingly.
436 The application can consume the uncompressed output when it wants, for
437 example when the output buffer is full (avail_out == 0), or after each
438 call of inflate(). If inflate returns Z_OK and with zero avail_out, it
439 must be called again after making room in the output buffer because there
440 might be more output pending.
442 If the parameter flush is set to Z_SYNC_FLUSH, inflate flushes as much
443 output as possible to the output buffer. The flushing behavior of inflate is
444 not specified for values of the flush parameter other than Z_SYNC_FLUSH
445 and Z_FINISH, but the current implementation actually flushes as much output
448 inflate() should normally be called until it returns Z_STREAM_END or an
449 error. However if all decompression is to be performed in a single step
450 (a single call of inflate), the parameter flush should be set to
451 Z_FINISH. In this case all pending input is processed and all pending
452 output is flushed; avail_out must be large enough to hold all the
453 uncompressed data. (The size of the uncompressed data may have been saved
454 by the compressor for this purpose.) The next operation on this stream must
455 be inflateEnd to deallocate the decompression state. The use of Z_FINISH
456 is never required, but can be used to inform inflate that a faster routine
457 may be used for the single inflate() call.
459 If a preset dictionary is needed at this point (see inflateSetDictionary
460 below), inflate sets strm-adler to the adler32 checksum of the
461 dictionary chosen by the compressor and returns Z_NEED_DICT; otherwise
462 it sets strm->adler to the adler32 checksum of all output produced
463 so (that is, total_out bytes) and returns Z_OK, Z_STREAM_END or
464 an error code as described below. At the end of the stream, inflate()
465 checks that its computed adler32 checksum is equal to that saved by the
466 compressor and returns Z_STREAM_END only if the checksum is correct.
468 inflate() returns Z_OK if some progress has been made (more input processed
469 or more output produced), Z_STREAM_END if the end of the compressed data has
470 been reached and all uncompressed output has been produced, Z_NEED_DICT if a
471 preset dictionary is needed at this point, Z_DATA_ERROR if the input data was
472 corrupted (input stream not conforming to the zlib format or incorrect
473 adler32 checksum), Z_STREAM_ERROR if the stream structure was inconsistent
474 (for example if next_in or next_out was NULL), Z_MEM_ERROR if there was not
475 enough memory, Z_BUF_ERROR if no progress is possible or if there was not
476 enough room in the output buffer when Z_FINISH is used. In the Z_DATA_ERROR
477 case, the application may then call inflateSync to look for a good
482 int inflateEnd OF( (z_streamp strm) );
484 All dynamically allocated data structures for this stream are freed.
485 This function discards any unprocessed input and does not flush any
488 inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state
489 was inconsistent. In the error case, msg may be set but then points to a
490 static string (which must not be deallocated).
493 /* Advanced functions */
496 The following functions are needed only in some special applications.
500 int deflateInit2 OF((z_streamp strm,
507 This is another version of deflateInit with more compression options. The
508 fields next_in, zalloc, zfree and opaque must be initialized before by
511 The method parameter is the compression method. It must be Z_DEFLATED in
512 this version of the library.
514 The windowBits parameter is the base two logarithm of the window size
515 (the size of the history buffer). It should be in the range 8..15 for this
516 version of the library. Larger values of this parameter result in better
517 compression at the expense of memory usage. The default value is 15 if
518 deflateInit is used instead.
520 The memLevel parameter specifies how much memory should be allocated
521 for the internal compression state. memLevel=1 uses minimum memory but
522 is slow and reduces compression ratio; memLevel=9 uses maximum memory
523 for optimal speed. The default value is 8. See zconf.h for total memory
524 usage as a function of windowBits and memLevel.
526 The strategy parameter is used to tune the compression algorithm. Use the
527 value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a
528 filter (or predictor), or Z_HUFFMAN_ONLY to force Huffman encoding only (no
529 string match). Filtered data consists mostly of small values with a
530 somewhat random distribution. In this case, the compression algorithm is
531 tuned to compress them better. The effect of Z_FILTERED is to force more
532 Huffman coding and less string matching; it is somewhat intermediate
533 between Z_DEFAULT and Z_HUFFMAN_ONLY. The strategy parameter only affects
534 the compression ratio but not the correctness of the compressed output even
535 if it is not set appropriately.
537 deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
538 memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid
539 method). msg is set to null if there is no error message. deflateInit2 does
540 not perform any compression: this will be done by deflate().
543 int deflateSetDictionary OF( ( z_streamp strm,
544 const Byte * dictionary,
547 Initializes the compression dictionary from the given byte sequence
548 without producing any compressed output. This function must be called
549 immediately after deflateInit, deflateInit2 or deflateReset, before any
550 call of deflate. The compressor and decompressor must use exactly the same
551 dictionary (see inflateSetDictionary).
553 The dictionary should consist of strings (byte sequences) that are likely
554 to be encountered later in the data to be compressed, with the most commonly
555 used strings preferably put towards the end of the dictionary. Using a
556 dictionary is most useful when the data to be compressed is short and can be
557 predicted with good accuracy; the data can then be compressed better than
558 with the default empty dictionary.
560 Depending on the size of the compression data structures selected by
561 deflateInit or deflateInit2, a part of the dictionary may in effect be
562 discarded, for example if the dictionary is larger than the window size in
563 deflate or deflate2. Thus the strings most likely to be useful should be
564 put at the end of the dictionary, not at the front.
566 Upon return of this function, strm->adler is set to the Adler32 value
567 of the dictionary; the decompressor may later use this value to determine
568 which dictionary has been used by the compressor. (The Adler32 value
569 applies to the whole dictionary even if only a subset of the dictionary is
570 actually used by the compressor.)
572 deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a
573 parameter is invalid (such as NULL dictionary) or the stream state is
574 inconsistent (for example if deflate has already been called for this stream
575 or if the compression method is bsort). deflateSetDictionary does not
576 perform any compression: this will be done by deflate().
579 int deflateCopy OF( ( z_streamp dest,
580 z_streamp source ) );
582 Sets the destination stream as a complete copy of the source stream.
584 This function can be useful when several compression strategies will be
585 tried, for example when there are several ways of pre-processing the input
586 data with a filter. The streams that will be discarded should then be freed
587 by calling deflateEnd. Note that deflateCopy duplicates the internal
588 compression state which can be quite large, so this strategy is slow and
589 can consume lots of memory.
591 deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not
592 enough memory, Z_STREAM_ERROR if the source stream state was inconsistent
593 (such as zalloc being NULL). msg is left unchanged in both source and
597 int deflateReset OF( (z_streamp strm) );
599 This function is equivalent to deflateEnd followed by deflateInit,
600 but does not free and reallocate all the internal compression state.
601 The stream will keep the same compression level and any other attributes
602 that may have been set by deflateInit2.
604 deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
605 stream state was inconsistent (such as zalloc or state being NULL).
608 int deflateParams OF( ( z_streamp strm,
612 Dynamically update the compression level and compression strategy. The
613 interpretation of level and strategy is as in deflateInit2. This can be
614 used to switch between compression and straight copy of the input data, or
615 to switch to a different kind of input data requiring a different
616 strategy. If the compression level is changed, the input available so far
617 is compressed with the old level (and may be flushed); the new level will
618 take effect only at the next call of deflate().
620 Before the call of deflateParams, the stream state must be set as for
621 a call of deflate(), since the currently available input may have to
622 be compressed and flushed. In particular, strm->avail_out must be non-zero.
624 deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source
625 stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR
626 if strm->avail_out was zero.
630 int inflateInit2 OF((z_streamp strm,
633 This is another version of inflateInit with an extra parameter. The
634 fields next_in, avail_in, zalloc, zfree and opaque must be initialized
635 before by the caller.
637 The windowBits parameter is the base two logarithm of the maximum window
638 size (the size of the history buffer). It should be in the range 8..15 for
639 this version of the library. The default value is 15 if inflateInit is used
640 instead. If a compressed stream with a larger window size is given as
641 input, inflate() will return with the error code Z_DATA_ERROR instead of
642 trying to allocate a larger window.
644 inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
645 memory, Z_STREAM_ERROR if a parameter is invalid (such as a negative
646 memLevel). msg is set to null if there is no error message. inflateInit2
647 does not perform any decompression apart from reading the zlib header if
648 present: this will be done by inflate(). (So next_in and avail_in may be
649 modified, but next_out and avail_out are unchanged.)
652 int inflateSetDictionary OF( ( z_streamp strm,
653 const Byte * dictionary,
656 Initializes the decompression dictionary from the given uncompressed byte
657 sequence. This function must be called immediately after a call of inflate
658 if this call returned Z_NEED_DICT. The dictionary chosen by the compressor
659 can be determined from the Adler32 value returned by this call of
660 inflate. The compressor and decompressor must use exactly the same
661 dictionary (see deflateSetDictionary).
663 inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a
664 parameter is invalid (such as NULL dictionary) or the stream state is
665 inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the
666 expected one (incorrect Adler32 value). inflateSetDictionary does not
667 perform any decompression: this will be done by subsequent calls of
671 int inflateSync OF( (z_streamp strm) );
673 Skips invalid compressed data until a full flush point (see above the
674 description of deflate with Z_FULL_FLUSH) can be found, or until all
675 available input is skipped. No output is provided.
677 inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR
678 if no more input was provided, Z_DATA_ERROR if no flush point has been found,
679 or Z_STREAM_ERROR if the stream structure was inconsistent. In the success
680 case, the application may save the current current value of total_in which
681 indicates where valid compressed data was found. In the error case, the
682 application may repeatedly call inflateSync, providing more input each time,
683 until success or end of the input data.
686 int inflateReset OF( (z_streamp strm) );
688 This function is equivalent to inflateEnd followed by inflateInit,
689 but does not free and reallocate all the internal decompression state.
690 The stream will keep attributes that may have been set by inflateInit2.
692 inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
693 stream state was inconsistent (such as zalloc or state being NULL).
697 /* utility functions */
700 The following utility functions are implemented on top of the
701 basic stream-oriented functions. To simplify the interface, some
702 default options are assumed (compression level and memory usage,
703 standard memory allocation functions). The source code of these
704 utility functions can easily be modified if you need special options.
707 int compress OF( ( Byte * dest, uLong * destLen,
708 const Byte * source, uLong sourceLen ) );
710 Compresses the source buffer into the destination buffer. sourceLen is
711 the byte length of the source buffer. Upon entry, destLen is the total
712 size of the destination buffer, which must be at least 0.1% larger than
713 sourceLen plus 12 bytes. Upon exit, destLen is the actual size of the
715 This function can be used to compress a whole file at once if the
716 input file is mmap'ed.
717 compress returns Z_OK if success, Z_MEM_ERROR if there was not
718 enough memory, Z_BUF_ERROR if there was not enough room in the output
722 int compress2 OF( ( Byte * dest, uLong * destLen,
723 const Byte * source, uLong sourceLen,
726 Compresses the source buffer into the destination buffer. The level
727 parameter has the same meaning as in deflateInit. sourceLen is the byte
728 length of the source buffer. Upon entry, destLen is the total size of the
729 destination buffer, which must be at least 0.1% larger than sourceLen plus
730 12 bytes. Upon exit, destLen is the actual size of the compressed buffer.
732 compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
733 memory, Z_BUF_ERROR if there was not enough room in the output buffer,
734 Z_STREAM_ERROR if the level parameter is invalid.
737 int uncompress OF( ( Byte * dest, uLong * destLen,
738 const Byte * source, uLong sourceLen ) );
740 Decompresses the source buffer into the destination buffer. sourceLen is
741 the byte length of the source buffer. Upon entry, destLen is the total
742 size of the destination buffer, which must be large enough to hold the
743 entire uncompressed data. (The size of the uncompressed data must have
744 been saved previously by the compressor and transmitted to the decompressor
745 by some mechanism outside the scope of this compression library.)
746 Upon exit, destLen is the actual size of the compressed buffer.
747 This function can be used to decompress a whole file at once if the
748 input file is mmap'ed.
750 uncompress returns Z_OK if success, Z_MEM_ERROR if there was not
751 enough memory, Z_BUF_ERROR if there was not enough room in the output
752 buffer, or Z_DATA_ERROR if the input data was corrupted.
756 typedef voidp gzFile;
758 gzFile gzopen OF( ( const char *path, const char *mode ) );
760 Opens a gzip (.gz) file for reading or writing. The mode parameter
761 is as in fopen ("rb" or "wb") but can also include a compression level
762 ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for
763 Huffman only compression as in "wb1h". (See the description
764 of deflateInit2 for more information about the strategy parameter.)
766 gzopen can be used to read a file which is not in gzip format; in this
767 case gzread will directly read from the file without decompression.
769 gzopen returns NULL if the file could not be opened or if there was
770 insufficient memory to allocate the (de)compression state; errno
771 can be checked to distinguish the two cases (if errno is zero, the
772 zlib error is Z_MEM_ERROR). */
774 gzFile gzdopen OF( ( int fd, const char *mode ) );
776 gzdopen() associates a gzFile with the file descriptor fd. File
777 descriptors are obtained from calls like open, dup, creat, pipe or
778 fileno (in the file has been previously opened with fopen).
779 The mode parameter is as in gzopen.
780 The next call of gzclose on the returned gzFile will also close the
781 file descriptor fd, just like fclose(fdopen(fd), mode) closes the file
782 descriptor fd. If you want to keep fd open, use gzdopen(dup(fd), mode).
783 gzdopen returns NULL if there was insufficient memory to allocate
784 the (de)compression state.
787 int gzsetparams OF( ( gzFile file, int level, int strategy ) );
789 Dynamically update the compression level or strategy. See the description
790 of deflateInit2 for the meaning of these parameters.
791 gzsetparams returns Z_OK if success, or Z_STREAM_ERROR if the file was not
795 int gzread OF( ( gzFile file, voidp buf, unsigned len ) );
797 Reads the given number of uncompressed bytes from the compressed file.
798 If the input file was not in gzip format, gzread copies the given number
799 of bytes into the buffer.
800 gzread returns the number of uncompressed bytes actually read (0 for
801 end of file, -1 for error). */
803 int gzwrite OF( ( gzFile file,
804 const voidp buf, unsigned len ) );
806 Writes the given number of uncompressed bytes into the compressed file.
807 gzwrite returns the number of uncompressed bytes actually written
808 (0 in case of error).
811 int gzprintf OF( ( gzFile file, const char *format, ... ) );
813 Converts, formats, and writes the args to the compressed file under
814 control of the format string, as in fprintf. gzprintf returns the number of
815 uncompressed bytes actually written (0 in case of error).
818 int gzputs OF( ( gzFile file, const char *s ) );
820 Writes the given null-terminated string to the compressed file, excluding
821 the terminating null character.
822 gzputs returns the number of characters written, or -1 in case of error.
825 char * gzgets OF( ( gzFile file, char *buf, int len ) );
827 Reads bytes from the compressed file until len-1 characters are read, or
828 a newline character is read and transferred to buf, or an end-of-file
829 condition is encountered. The string is then terminated with a null
831 gzgets returns buf, or Z_NULL in case of error.
834 int gzputc OF( ( gzFile file, int c ) );
836 Writes c, converted to an unsigned char, into the compressed file.
837 gzputc returns the value that was written, or -1 in case of error.
840 int gzgetc OF( (gzFile file) );
842 Reads one byte from the compressed file. gzgetc returns this byte
843 or -1 in case of end of file or error.
846 int gzflush OF( ( gzFile file, int flush ) );
848 Flushes all pending output into the compressed file. The parameter
849 flush is as in the deflate() function. The return value is the zlib
850 error number (see function gzerror below). gzflush returns Z_OK if
851 the flush parameter is Z_FINISH and all output could be flushed.
852 gzflush should be called only when strictly necessary because it can
856 long gzseek OF( ( gzFile file,
857 long offset, int whence ) );
859 Sets the starting position for the next gzread or gzwrite on the
860 given compressed file. The offset represents a number of bytes in the
861 uncompressed data stream. The whence parameter is defined as in lseek(2);
862 the value SEEK_END is not supported.
863 If the file is opened for reading, this function is emulated but can be
864 extremely slow. If the file is opened for writing, only forward seeks are
865 supported; gzseek then compresses a sequence of zeroes up to the new
868 gzseek returns the resulting offset location as measured in bytes from
869 the beginning of the uncompressed stream, or -1 in case of error, in
870 particular if the file is opened for writing and the new starting position
871 would be before the current position.
874 int gzrewind OF( (gzFile file) );
876 Rewinds the given file. This function is supported only for reading.
878 gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET)
881 long gztell OF( (gzFile file) );
883 Returns the starting position for the next gzread or gzwrite on the
884 given compressed file. This position represents a number of bytes in the
885 uncompressed data stream.
887 gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR)
890 int gzeof OF( (gzFile file) );
892 Returns 1 when EOF has previously been detected reading the given
893 input stream, otherwise zero.
896 int gzclose OF( (gzFile file) );
898 Flushes all pending output if necessary, closes the compressed file
899 and deallocates all the (de)compression state. The return value is the zlib
900 error number (see function gzerror below).
903 const char * gzerror OF( ( gzFile file, int *errnum ) );
905 Returns the error message for the last error which occurred on the
906 given compressed file. errnum is set to zlib error number. If an
907 error occurred in the file system and not in the compression library,
908 errnum is set to Z_ERRNO and the application may consult errno
909 to get the exact error code.
912 /* checksum functions */
915 These functions are not related to compression but are exported
916 anyway because they might be useful in applications using the
920 uLong adler32 OF( ( uLong adler, const Byte * buf, uInt len ) );
923 Update a running Adler-32 checksum with the bytes buf[0..len-1] and
924 return the updated checksum. If buf is NULL, this function returns
925 the required initial value for the checksum.
926 An Adler-32 checksum is almost as reliable as a CRC32 but can be computed
927 much faster. Usage example:
929 uLong adler = adler32(0L, Z_NULL, 0);
931 while (read_buffer(buffer, length) != EOF) {
932 adler = adler32(adler, buffer, length);
934 if (adler != original_adler) error();
937 uLong crc32 OF( ( uLong crc, const Byte * buf, uInt len ) );
939 Update a running crc with the bytes buf[0..len-1] and return the updated
940 crc. If buf is NULL, this function returns the required initial value
941 for the crc. Pre- and post-conditioning (one's complement) is performed
942 within this function so it shouldn't be done by the application.
945 uLong crc = crc32(0L, Z_NULL, 0);
947 while (read_buffer(buffer, length) != EOF) {
948 crc = crc32(crc, buffer, length);
950 if (crc != original_crc) error();
953 // private stuff to not include cmdlib.h
955 ============================================================================
959 ============================================================================
963 #define __BIG_ENDIAN__
966 #ifdef __BIG_ENDIAN__
968 short __LittleShort( short l ){
972 b2 = ( l >> 8 ) & 255;
974 return ( b1 << 8 ) + b2;
977 short __BigShort( short l ){
982 int __LittleLong( int l ){
986 b2 = ( l >> 8 ) & 255;
987 b3 = ( l >> 16 ) & 255;
988 b4 = ( l >> 24 ) & 255;
990 return ( (int)b1 << 24 ) + ( (int)b2 << 16 ) + ( (int)b3 << 8 ) + b4;
993 int __BigLong( int l ){
998 float __LittleFloat( float l ){
999 union {byte b[4]; float f; } in, out;
1010 float __BigFloat( float l ){
1018 short __BigShort( short l ){
1022 b2 = ( l >> 8 ) & 255;
1024 return ( b1 << 8 ) + b2;
1027 short __LittleShort( short l ){
1032 int __BigLong( int l ){
1036 b2 = ( l >> 8 ) & 255;
1037 b3 = ( l >> 16 ) & 255;
1038 b4 = ( l >> 24 ) & 255;
1040 return ( (int)b1 << 24 ) + ( (int)b2 << 16 ) + ( (int)b3 << 8 ) + b4;
1043 int __LittleLong( int l ){
1047 float __BigFloat( float l ){
1048 union {byte b[4]; float f; } in, out;
1059 float __LittleFloat( float l ){
1070 /* various hacks, don't look :) */
1072 /* deflateInit and inflateInit are macros to allow checking the zlib version
1073 * and the compiler's view of z_stream:
1075 int deflateInit_ OF( ( z_streamp strm, int level,
1076 const char *version, int stream_size ) );
1077 int inflateInit_ OF( ( z_streamp strm,
1078 const char *version, int stream_size ) );
1079 int deflateInit2_ OF( ( z_streamp strm, int level, int method,
1080 int windowBits, int memLevel,
1081 int strategy, const char *version,
1082 int stream_size ) );
1083 int inflateInit2_ OF( ( z_streamp strm, int windowBits,
1084 const char *version, int stream_size ) );
1085 #define deflateInit( strm, level ) \
1086 deflateInit_( ( strm ), ( level ), ZLIB_VERSION, sizeof( z_stream ) )
1087 #define inflateInit( strm ) \
1088 inflateInit_( ( strm ), ZLIB_VERSION, sizeof( z_stream ) )
1089 #define deflateInit2( strm, level, method, windowBits, memLevel, strategy ) \
1090 deflateInit2_( ( strm ),( level ),( method ),( windowBits ),( memLevel ), \
1091 ( strategy ), ZLIB_VERSION, sizeof( z_stream ) )
1092 #define inflateInit2( strm, windowBits ) \
1093 inflateInit2_( ( strm ), ( windowBits ), ZLIB_VERSION, sizeof( z_stream ) )
1096 const char * zError OF( (int err) );
1097 int inflateSyncPoint OF( (z_streamp z) );
1098 const uLong * get_crc_table OF( (void) );
1100 typedef unsigned char uch;
1101 typedef unsigned short ush;
1102 typedef unsigned long ulg;
1104 extern const char *z_errmsg[10]; /* indexed by 2-zlib_error */
1105 /* (size given to avoid silly warnings with Visual C++) */
1107 #define ERR_MSG( err ) z_errmsg[Z_NEED_DICT - ( err )]
1109 #define ERR_RETURN( strm,err ) \
1110 return ( strm->msg = (char*)ERR_MSG( err ), ( err ) )
1111 /* To be used only when the state is known to be valid */
1113 /* common constants */
1116 # define DEF_WBITS MAX_WBITS
1118 /* default windowBits for decompression. MAX_WBITS is for compression only */
1120 #if MAX_MEM_LEVEL >= 8
1121 # define DEF_MEM_LEVEL 8
1123 # define DEF_MEM_LEVEL MAX_MEM_LEVEL
1125 /* default memLevel */
1127 #define STORED_BLOCK 0
1128 #define STATIC_TREES 1
1130 /* The three kinds of block type */
1133 #define MAX_MATCH 258
1134 /* The minimum and maximum match lengths */
1136 #define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */
1138 /* target dependencies */
1140 /* Common defaults */
1143 # define OS_CODE 0x03 /* assume Unix */
1147 # define F_OPEN( name, mode ) fopen( ( name ), ( mode ) )
1152 #ifdef HAVE_STRERROR
1153 extern char *strerror OF( (int) );
1154 # define zstrerror( errnum ) strerror( errnum )
1156 # define zstrerror( errnum ) ""
1159 #define zmemcpy memcpy
1160 #define zmemcmp memcmp
1161 #define zmemzero( dest, len ) memset( dest, 0, len )
1163 /* Diagnostic functions */
1166 # define Assert( cond,msg ) assert( cond );
1167 //{if(!(cond)) Sys_Error(msg);}
1168 # define Trace( x ) {if ( z_verbose >= 0 ) {Sys_Error x ; }}
1169 # define Tracev( x ) {if ( z_verbose > 0 ) {Sys_Error x ; }}
1170 # define Tracevv( x ) {if ( z_verbose > 1 ) {Sys_Error x ; }}
1171 # define Tracec( c,x ) {if ( z_verbose > 0 && ( c ) ) {Sys_Error x ; }}
1172 # define Tracecv( c,x ) {if ( z_verbose > 1 && ( c ) ) {Sys_Error x ; }}
1174 # define Assert( cond,msg )
1176 # define Tracev( x )
1177 # define Tracevv( x )
1178 # define Tracec( c,x )
1179 # define Tracecv( c,x )
1183 typedef uLong ( *check_func ) OF ( ( uLong check, const Byte * buf, uInt len ) );
1184 voidp zcalloc OF( ( voidp opaque, unsigned items, unsigned size ) );
1185 void zcfree OF( ( voidp opaque, voidp ptr ) );
1187 #define ZALLOC( strm, items, size ) \
1188 ( *( ( strm )->zalloc ) )( ( strm )->opaque, ( items ), ( size ) )
1189 #define ZFREE( strm, addr ) ( *( ( strm )->zfree ) )( ( strm )->opaque, (voidp)( addr ) )
1190 #define TRY_FREE( s, p ) {if ( p ) {ZFREE( s, p ); }}
1193 #if !defined( unix ) && !defined( CASESENSITIVITYDEFAULT_YES ) && \
1194 !defined( CASESENSITIVITYDEFAULT_NO )
1195 #define CASESENSITIVITYDEFAULT_NO
1200 #define UNZ_BUFSIZE ( 65536 )
1203 #ifndef UNZ_MAXFILENAMEINZIP
1204 #define UNZ_MAXFILENAMEINZIP ( 256 )
1208 # define ALLOC( size ) ( safe_malloc( size ) )
1211 # define TRYFREE( p ) {if ( p ) {free( p ); }}
1214 #define SIZECENTRALDIRITEM ( 0x2e )
1215 #define SIZEZIPLOCALHEADER ( 0x1e )
1219 /* ===========================================================================
1220 Read a byte from a gz_stream; update next_in and avail_in. Return EOF
1222 IN assertion: the stream s has been sucessfully opened for reading.
1226 static int unzlocal_getByte(FILE *fin,int *pi)
1229 int err = fread(&c, 1, 1, fin);
1245 /* ===========================================================================
1246 Reads a long in LSB order from the given gz_stream. Sets
1248 static int unzlocal_getShort( FILE* fin, uLong *pX ){
1251 fread( &v, sizeof( v ), 1, fin );
1253 *pX = __LittleShort( v );
1261 err = unzlocal_getByte(fin,&i);
1265 err = unzlocal_getByte(fin,&i);
1276 static int unzlocal_getLong( FILE *fin, uLong *pX ){
1279 fread( &v, sizeof( v ), 1, fin );
1281 *pX = __LittleLong( v );
1289 err = unzlocal_getByte(fin,&i);
1293 err = unzlocal_getByte(fin,&i);
1297 err = unzlocal_getByte(fin,&i);
1298 x += ((uLong)i)<<16;
1301 err = unzlocal_getByte(fin,&i);
1302 x += ((uLong)i)<<24;
1313 /* My own strcmpi / strcasecmp */
1314 static int strcmpcasenosensitive_internal( const char* fileName1,const char* fileName2 ){
1317 char c1 = *( fileName1++ );
1318 char c2 = *( fileName2++ );
1319 if ( ( c1 >= 'a' ) && ( c1 <= 'z' ) ) {
1322 if ( ( c2 >= 'a' ) && ( c2 <= 'z' ) ) {
1326 return ( ( c2 == '\0' ) ? 0 : -1 );
1341 #ifdef CASESENSITIVITYDEFAULT_NO
1342 #define CASESENSITIVITYDEFAULTVALUE 2
1344 #define CASESENSITIVITYDEFAULTVALUE 1
1347 #ifndef STRCMPCASENOSENTIVEFUNCTION
1348 #define STRCMPCASENOSENTIVEFUNCTION strcmpcasenosensitive_internal
1352 Compare two filename (fileName1,fileName2).
1353 If iCaseSenisivity = 1, comparision is case sensitivity (like strcmp)
1354 If iCaseSenisivity = 2, comparision is not case sensitivity (like strcmpi
1356 If iCaseSenisivity = 0, case sensitivity is defaut of your operating system
1357 (like 1 on Unix, 2 on Windows)
1360 extern int unzStringFileNameCompare( const char* fileName1,const char* fileName2,int iCaseSensitivity ){
1361 if ( iCaseSensitivity == 0 ) {
1362 iCaseSensitivity = CASESENSITIVITYDEFAULTVALUE;
1365 if ( iCaseSensitivity == 1 ) {
1366 return strcmp( fileName1,fileName2 );
1369 return STRCMPCASENOSENTIVEFUNCTION( fileName1,fileName2 );
1372 #define BUFREADCOMMENT ( 0x400 )
1375 Locate the Central directory of a zipfile (at the end, just before
1378 static uLong unzlocal_SearchCentralDir( FILE *fin ){
1382 uLong uMaxBack = 0xffff; /* maximum size of global comment */
1383 uLong uPosFound = 0;
1385 if ( fseek( fin,0,SEEK_END ) != 0 ) {
1390 uSizeFile = ftell( fin );
1392 if ( uMaxBack > uSizeFile ) {
1393 uMaxBack = uSizeFile;
1396 buf = (unsigned char*)safe_malloc( BUFREADCOMMENT + 4 );
1397 if ( buf == NULL ) {
1402 while ( uBackRead < uMaxBack )
1404 uLong uReadSize,uReadPos ;
1406 if ( uBackRead + BUFREADCOMMENT > uMaxBack ) {
1407 uBackRead = uMaxBack;
1410 uBackRead += BUFREADCOMMENT;
1412 uReadPos = uSizeFile - uBackRead ;
1414 uReadSize = ( ( BUFREADCOMMENT + 4 ) < ( uSizeFile - uReadPos ) ) ?
1415 ( BUFREADCOMMENT + 4 ) : ( uSizeFile - uReadPos );
1416 if ( fseek( fin,uReadPos,SEEK_SET ) != 0 ) {
1420 if ( fread( buf,(uInt)uReadSize,1,fin ) != 1 ) {
1424 for ( i = (int)uReadSize - 3; ( i-- ) > 0; )
1425 if ( ( ( *( buf + i ) ) == 0x50 ) && ( ( *( buf + i + 1 ) ) == 0x4b ) &&
1426 ( ( *( buf + i + 2 ) ) == 0x05 ) && ( ( *( buf + i + 3 ) ) == 0x06 ) ) {
1427 uPosFound = uReadPos + i;
1431 if ( uPosFound != 0 ) {
1439 extern unzFile unzReOpen( const char* path, unzFile file ){
1443 fin = fopen( path,"rb" );
1444 if ( fin == NULL ) {
1448 s = (unz_s*)safe_malloc( sizeof( unz_s ) );
1449 memcpy( s, (unz_s*)file, sizeof( unz_s ) );
1456 Open a Zip file. path contain the full pathname (by example,
1457 on a Windows NT computer "c:\\test\\zlib109.zip" or on an Unix computer
1459 If the zipfile cannot be opened (file don't exist or in not valid), the
1460 return value is NULL.
1461 Else, the return value is a unzFile Handle, usable with other function
1462 of this unzip package.
1464 extern unzFile unzOpen( const char* path ){
1467 uLong central_pos,uL;
1470 uLong number_disk; /* number of the current dist, used for
1471 spaning ZIP, unsupported, always 0*/
1472 uLong number_disk_with_CD; /* number the the disk with central dir, used
1473 for spaning ZIP, unsupported, always 0*/
1474 uLong number_entry_CD; /* total number of entries in
1476 (same than number_entry on nospan) */
1480 fin = fopen( path,"rb" );
1481 if ( fin == NULL ) {
1485 central_pos = unzlocal_SearchCentralDir( fin );
1486 if ( central_pos == 0 ) {
1490 if ( fseek( fin,central_pos,SEEK_SET ) != 0 ) {
1494 /* the signature, already checked */
1495 if ( unzlocal_getLong( fin,&uL ) != UNZ_OK ) {
1499 /* number of this disk */
1500 if ( unzlocal_getShort( fin,&number_disk ) != UNZ_OK ) {
1504 /* number of the disk with the start of the central directory */
1505 if ( unzlocal_getShort( fin,&number_disk_with_CD ) != UNZ_OK ) {
1509 /* total number of entries in the central dir on this disk */
1510 if ( unzlocal_getShort( fin,&us.gi.number_entry ) != UNZ_OK ) {
1514 /* total number of entries in the central dir */
1515 if ( unzlocal_getShort( fin,&number_entry_CD ) != UNZ_OK ) {
1519 if ( ( number_entry_CD != us.gi.number_entry ) ||
1520 ( number_disk_with_CD != 0 ) ||
1521 ( number_disk != 0 ) ) {
1522 err = UNZ_BADZIPFILE;
1525 /* size of the central directory */
1526 if ( unzlocal_getLong( fin,&us.size_central_dir ) != UNZ_OK ) {
1530 /* offset of start of central directory with respect to the
1531 starting disk number */
1532 if ( unzlocal_getLong( fin,&us.offset_central_dir ) != UNZ_OK ) {
1536 /* zipfile comment length */
1537 if ( unzlocal_getShort( fin,&us.gi.size_comment ) != UNZ_OK ) {
1541 if ( ( central_pos < us.offset_central_dir + us.size_central_dir ) &&
1542 ( err == UNZ_OK ) ) {
1543 err = UNZ_BADZIPFILE;
1546 if ( err != UNZ_OK ) {
1552 us.byte_before_the_zipfile = central_pos -
1553 ( us.offset_central_dir + us.size_central_dir );
1554 us.central_pos = central_pos;
1555 us.pfile_in_zip_read = NULL;
1558 s = (unz_s*)safe_malloc( sizeof( unz_s ) );
1560 // unzGoToFirstFile((unzFile)s);
1566 Close a ZipFile opened with unzipOpen.
1567 If there is files inside the .Zip opened with unzipOpenCurrentFile (see later),
1568 these files MUST be closed with unzipCloseCurrentFile before call unzipClose.
1569 return UNZ_OK if there is no problem. */
1570 extern int unzClose( unzFile file ){
1572 if ( file == NULL ) {
1573 return UNZ_PARAMERROR;
1577 if ( s->pfile_in_zip_read != NULL ) {
1578 unzCloseCurrentFile( file );
1588 Write info about the ZipFile in the *pglobal_info structure.
1589 No preparation of the structure is needed
1590 return UNZ_OK if there is no problem. */
1591 extern int unzGetGlobalInfo( unzFile file,unz_global_info *pglobal_info ){
1593 if ( file == NULL ) {
1594 return UNZ_PARAMERROR;
1597 *pglobal_info = s->gi;
1603 Translate date/time from Dos format to tm_unz (readable more easilty)
1605 static void unzlocal_DosDateToTmuDate( uLong ulDosDate, tm_unz* ptm ){
1607 uDate = (uLong)( ulDosDate >> 16 );
1608 ptm->tm_mday = (uInt)( uDate & 0x1f ) ;
1609 ptm->tm_mon = (uInt)( ( ( ( uDate ) & 0x1E0 ) / 0x20 ) - 1 ) ;
1610 ptm->tm_year = (uInt)( ( ( uDate & 0x0FE00 ) / 0x0200 ) + 1980 ) ;
1612 ptm->tm_hour = (uInt) ( ( ulDosDate & 0xF800 ) / 0x800 );
1613 ptm->tm_min = (uInt) ( ( ulDosDate & 0x7E0 ) / 0x20 ) ;
1614 ptm->tm_sec = (uInt) ( 2 * ( ulDosDate & 0x1f ) ) ;
1618 Get Info about the current file in the zipfile, with internal only info
1620 static int unzlocal_GetCurrentFileInfoInternal( unzFile file,
1621 unz_file_info *pfile_info,
1622 unz_file_info_internal
1623 *pfile_info_internal,
1625 uLong fileNameBufferSize,
1627 uLong extraFieldBufferSize,
1629 uLong commentBufferSize ){
1631 unz_file_info file_info;
1632 unz_file_info_internal file_info_internal;
1637 if ( file == NULL ) {
1638 return UNZ_PARAMERROR;
1641 if ( fseek( s->file,s->pos_in_central_dir + s->byte_before_the_zipfile,SEEK_SET ) != 0 ) {
1646 /* we check the magic */
1647 if ( err == UNZ_OK ) {
1648 if ( unzlocal_getLong( s->file,&uMagic ) != UNZ_OK ) {
1651 else if ( uMagic != 0x02014b50 ) {
1652 err = UNZ_BADZIPFILE;
1656 if ( unzlocal_getShort( s->file,&file_info.version ) != UNZ_OK ) {
1660 if ( unzlocal_getShort( s->file,&file_info.version_needed ) != UNZ_OK ) {
1664 if ( unzlocal_getShort( s->file,&file_info.flag ) != UNZ_OK ) {
1668 if ( unzlocal_getShort( s->file,&file_info.compression_method ) != UNZ_OK ) {
1672 if ( unzlocal_getLong( s->file,&file_info.dosDate ) != UNZ_OK ) {
1676 unzlocal_DosDateToTmuDate( file_info.dosDate,&file_info.tmu_date );
1678 if ( unzlocal_getLong( s->file,&file_info.crc ) != UNZ_OK ) {
1682 if ( unzlocal_getLong( s->file,&file_info.compressed_size ) != UNZ_OK ) {
1686 if ( unzlocal_getLong( s->file,&file_info.uncompressed_size ) != UNZ_OK ) {
1690 if ( unzlocal_getShort( s->file,&file_info.size_filename ) != UNZ_OK ) {
1694 if ( unzlocal_getShort( s->file,&file_info.size_file_extra ) != UNZ_OK ) {
1698 if ( unzlocal_getShort( s->file,&file_info.size_file_comment ) != UNZ_OK ) {
1702 if ( unzlocal_getShort( s->file,&file_info.disk_num_start ) != UNZ_OK ) {
1706 if ( unzlocal_getShort( s->file,&file_info.internal_fa ) != UNZ_OK ) {
1710 if ( unzlocal_getLong( s->file,&file_info.external_fa ) != UNZ_OK ) {
1714 if ( unzlocal_getLong( s->file,&file_info_internal.offset_curfile ) != UNZ_OK ) {
1718 lSeek += file_info.size_filename;
1719 if ( ( err == UNZ_OK ) && ( szFileName != NULL ) ) {
1721 if ( file_info.size_filename < fileNameBufferSize ) {
1722 *( szFileName + file_info.size_filename ) = '\0';
1723 uSizeRead = file_info.size_filename;
1726 uSizeRead = fileNameBufferSize;
1729 if ( ( file_info.size_filename > 0 ) && ( fileNameBufferSize > 0 ) ) {
1730 if ( fread( szFileName,(uInt)uSizeRead,1,s->file ) != 1 ) {
1738 if ( ( err == UNZ_OK ) && ( extraField != NULL ) ) {
1740 if ( file_info.size_file_extra < extraFieldBufferSize ) {
1741 uSizeRead = file_info.size_file_extra;
1744 uSizeRead = extraFieldBufferSize;
1748 if ( fseek( s->file,lSeek,SEEK_CUR ) == 0 ) {
1755 if ( ( file_info.size_file_extra > 0 ) && ( extraFieldBufferSize > 0 ) ) {
1756 if ( fread( extraField,(uInt)uSizeRead,1,s->file ) != 1 ) {
1760 lSeek += file_info.size_file_extra - uSizeRead;
1763 lSeek += file_info.size_file_extra;
1767 if ( ( err == UNZ_OK ) && ( szComment != NULL ) ) {
1769 if ( file_info.size_file_comment < commentBufferSize ) {
1770 *( szComment + file_info.size_file_comment ) = '\0';
1771 uSizeRead = file_info.size_file_comment;
1774 uSizeRead = commentBufferSize;
1778 if ( fseek( s->file,lSeek,SEEK_CUR ) == 0 ) {
1785 if ( ( file_info.size_file_comment > 0 ) && ( commentBufferSize > 0 ) ) {
1786 if ( fread( szComment,(uInt)uSizeRead,1,s->file ) != 1 ) {
1790 lSeek += file_info.size_file_comment - uSizeRead;
1793 lSeek += file_info.size_file_comment;
1796 if ( ( err == UNZ_OK ) && ( pfile_info != NULL ) ) {
1797 *pfile_info = file_info;
1800 if ( ( err == UNZ_OK ) && ( pfile_info_internal != NULL ) ) {
1801 *pfile_info_internal = file_info_internal;
1810 Write info about the ZipFile in the *pglobal_info structure.
1811 No preparation of the structure is needed
1812 return UNZ_OK if there is no problem.
1814 extern int unzGetCurrentFileInfo( unzFile file, unz_file_info *pfile_info,
1815 char *szFileName, uLong fileNameBufferSize,
1816 void *extraField, uLong extraFieldBufferSize,
1817 char *szComment, uLong commentBufferSize ){
1818 return unzlocal_GetCurrentFileInfoInternal( file,pfile_info,NULL,
1819 szFileName,fileNameBufferSize,
1820 extraField,extraFieldBufferSize,
1821 szComment,commentBufferSize );
1825 Set the current file of the zipfile to the first file.
1826 return UNZ_OK if there is no problem
1828 extern int unzGoToFirstFile( unzFile file ){
1831 if ( file == NULL ) {
1832 return UNZ_PARAMERROR;
1835 s->pos_in_central_dir = s->offset_central_dir;
1837 err = unzlocal_GetCurrentFileInfoInternal( file,&s->cur_file_info,
1838 &s->cur_file_info_internal,
1839 NULL,0,NULL,0,NULL,0 );
1840 s->current_file_ok = ( err == UNZ_OK );
1846 Set the current file of the zipfile to the next file.
1847 return UNZ_OK if there is no problem
1848 return UNZ_END_OF_LIST_OF_FILE if the actual file was the latest.
1850 extern int unzGoToNextFile( unzFile file ){
1854 if ( file == NULL ) {
1855 return UNZ_PARAMERROR;
1858 if ( !s->current_file_ok ) {
1859 return UNZ_END_OF_LIST_OF_FILE;
1861 if ( s->num_file + 1 == s->gi.number_entry ) {
1862 return UNZ_END_OF_LIST_OF_FILE;
1865 s->pos_in_central_dir += SIZECENTRALDIRITEM + s->cur_file_info.size_filename +
1866 s->cur_file_info.size_file_extra + s->cur_file_info.size_file_comment ;
1868 err = unzlocal_GetCurrentFileInfoInternal( file,&s->cur_file_info,
1869 &s->cur_file_info_internal,
1870 NULL,0,NULL,0,NULL,0 );
1871 s->current_file_ok = ( err == UNZ_OK );
1877 Try locate the file szFileName in the zipfile.
1878 For the iCaseSensitivity signification, see unzipStringFileNameCompare
1881 UNZ_OK if the file is found. It becomes the current file.
1882 UNZ_END_OF_LIST_OF_FILE if the file is not found
1884 extern int unzLocateFile( unzFile file, const char *szFileName, int iCaseSensitivity ){
1889 uLong num_fileSaved;
1890 uLong pos_in_central_dirSaved;
1893 if ( file == NULL ) {
1894 return UNZ_PARAMERROR;
1897 if ( strlen( szFileName ) >= UNZ_MAXFILENAMEINZIP ) {
1898 return UNZ_PARAMERROR;
1902 if ( !s->current_file_ok ) {
1903 return UNZ_END_OF_LIST_OF_FILE;
1906 num_fileSaved = s->num_file;
1907 pos_in_central_dirSaved = s->pos_in_central_dir;
1909 err = unzGoToFirstFile( file );
1911 while ( err == UNZ_OK )
1913 char szCurrentFileName[UNZ_MAXFILENAMEINZIP + 1];
1914 unzGetCurrentFileInfo( file,NULL,
1915 szCurrentFileName,sizeof( szCurrentFileName ) - 1,
1917 if ( unzStringFileNameCompare( szCurrentFileName,
1918 szFileName,iCaseSensitivity ) == 0 ) {
1921 err = unzGoToNextFile( file );
1924 s->num_file = num_fileSaved ;
1925 s->pos_in_central_dir = pos_in_central_dirSaved ;
1931 Read the static header of the current zipfile
1932 Check the coherency of the static header and info in the end of central
1933 directory about this file
1934 store in *piSizeVar the size of extra info in static header
1935 (filename and size of extra field data)
1937 static int unzlocal_CheckCurrentFileCoherencyHeader( unz_s* s, uInt* piSizeVar,
1938 uLong *poffset_local_extrafield,
1939 uInt *psize_local_extrafield ){
1940 uLong uMagic,uData,uFlags;
1941 uLong size_filename;
1942 uLong size_extra_field;
1946 *poffset_local_extrafield = 0;
1947 *psize_local_extrafield = 0;
1949 if ( fseek( s->file,s->cur_file_info_internal.offset_curfile +
1950 s->byte_before_the_zipfile,SEEK_SET ) != 0 ) {
1955 if ( err == UNZ_OK ) {
1956 if ( unzlocal_getLong( s->file,&uMagic ) != UNZ_OK ) {
1959 else if ( uMagic != 0x04034b50 ) {
1960 err = UNZ_BADZIPFILE;
1964 if ( unzlocal_getShort( s->file,&uData ) != UNZ_OK ) {
1968 else if ((err==UNZ_OK) && (uData!=s->cur_file_info.wVersion))
1971 if ( unzlocal_getShort( s->file,&uFlags ) != UNZ_OK ) {
1975 if ( unzlocal_getShort( s->file,&uData ) != UNZ_OK ) {
1978 else if ( ( err == UNZ_OK ) && ( uData != s->cur_file_info.compression_method ) ) {
1979 err = UNZ_BADZIPFILE;
1982 if ( ( err == UNZ_OK ) && ( s->cur_file_info.compression_method != 0 ) &&
1983 ( s->cur_file_info.compression_method != Z_DEFLATED ) ) {
1984 err = UNZ_BADZIPFILE;
1987 if ( unzlocal_getLong( s->file,&uData ) != UNZ_OK ) { /* date/time */
1991 if ( unzlocal_getLong( s->file,&uData ) != UNZ_OK ) { /* crc */
1994 else if ( ( err == UNZ_OK ) && ( uData != s->cur_file_info.crc ) &&
1995 ( ( uFlags & 8 ) == 0 ) ) {
1996 err = UNZ_BADZIPFILE;
1999 if ( unzlocal_getLong( s->file,&uData ) != UNZ_OK ) { /* size compr */
2002 else if ( ( err == UNZ_OK ) && ( uData != s->cur_file_info.compressed_size ) &&
2003 ( ( uFlags & 8 ) == 0 ) ) {
2004 err = UNZ_BADZIPFILE;
2007 if ( unzlocal_getLong( s->file,&uData ) != UNZ_OK ) { /* size uncompr */
2010 else if ( ( err == UNZ_OK ) && ( uData != s->cur_file_info.uncompressed_size ) &&
2011 ( ( uFlags & 8 ) == 0 ) ) {
2012 err = UNZ_BADZIPFILE;
2016 if ( unzlocal_getShort( s->file,&size_filename ) != UNZ_OK ) {
2019 else if ( ( err == UNZ_OK ) && ( size_filename != s->cur_file_info.size_filename ) ) {
2020 err = UNZ_BADZIPFILE;
2023 *piSizeVar += (uInt)size_filename;
2025 if ( unzlocal_getShort( s->file,&size_extra_field ) != UNZ_OK ) {
2028 *poffset_local_extrafield = s->cur_file_info_internal.offset_curfile +
2029 SIZEZIPLOCALHEADER + size_filename;
2030 *psize_local_extrafield = (uInt)size_extra_field;
2032 *piSizeVar += (uInt)size_extra_field;
2038 Open for reading data the current file in the zipfile.
2039 If there is no error and the file is opened, the return value is UNZ_OK.
2041 extern int unzOpenCurrentFile( unzFile file ){
2046 file_in_zip_read_info_s* pfile_in_zip_read_info;
2047 uLong offset_local_extrafield; /* offset of the static extra field */
2048 uInt size_local_extrafield; /* size of the static extra field */
2050 if ( file == NULL ) {
2051 return UNZ_PARAMERROR;
2054 if ( !s->current_file_ok ) {
2055 return UNZ_PARAMERROR;
2058 if ( s->pfile_in_zip_read != NULL ) {
2059 unzCloseCurrentFile( file );
2062 if ( unzlocal_CheckCurrentFileCoherencyHeader( s,&iSizeVar,
2063 &offset_local_extrafield,&size_local_extrafield ) != UNZ_OK ) {
2064 return UNZ_BADZIPFILE;
2067 pfile_in_zip_read_info = (file_in_zip_read_info_s*)
2068 safe_malloc( sizeof( file_in_zip_read_info_s ) );
2069 if ( pfile_in_zip_read_info == NULL ) {
2070 return UNZ_INTERNALERROR;
2073 pfile_in_zip_read_info->read_buffer = (char*)safe_malloc( UNZ_BUFSIZE );
2074 pfile_in_zip_read_info->offset_local_extrafield = offset_local_extrafield;
2075 pfile_in_zip_read_info->size_local_extrafield = size_local_extrafield;
2076 pfile_in_zip_read_info->pos_local_extrafield = 0;
2078 if ( pfile_in_zip_read_info->read_buffer == NULL ) {
2079 free( pfile_in_zip_read_info );
2080 return UNZ_INTERNALERROR;
2083 pfile_in_zip_read_info->stream_initialised = 0;
2085 if ( ( s->cur_file_info.compression_method != 0 ) &&
2086 ( s->cur_file_info.compression_method != Z_DEFLATED ) ) {
2087 err = UNZ_BADZIPFILE;
2089 Store = s->cur_file_info.compression_method == 0;
2091 pfile_in_zip_read_info->crc32_wait = s->cur_file_info.crc;
2092 pfile_in_zip_read_info->crc32 = 0;
2093 pfile_in_zip_read_info->compression_method =
2094 s->cur_file_info.compression_method;
2095 pfile_in_zip_read_info->file = s->file;
2096 pfile_in_zip_read_info->byte_before_the_zipfile = s->byte_before_the_zipfile;
2098 pfile_in_zip_read_info->stream.total_out = 0;
2101 pfile_in_zip_read_info->stream.zalloc = (alloc_func)0;
2102 pfile_in_zip_read_info->stream.zfree = (free_func)0;
2103 pfile_in_zip_read_info->stream.opaque = (voidp)0;
2105 err = inflateInit2( &pfile_in_zip_read_info->stream, -MAX_WBITS );
2106 if ( err == Z_OK ) {
2107 pfile_in_zip_read_info->stream_initialised = 1;
2109 /* windowBits is passed < 0 to tell that there is no zlib header.
2110 * Note that in this case inflate *requires* an extra "dummy" byte
2111 * after the compressed stream in order to complete decompression and
2112 * return Z_STREAM_END.
2113 * In unzip, i don't wait absolutely Z_STREAM_END because I known the
2114 * size of both compressed and uncompressed data
2117 pfile_in_zip_read_info->rest_read_compressed =
2118 s->cur_file_info.compressed_size ;
2119 pfile_in_zip_read_info->rest_read_uncompressed =
2120 s->cur_file_info.uncompressed_size ;
2123 pfile_in_zip_read_info->pos_in_zipfile =
2124 s->cur_file_info_internal.offset_curfile + SIZEZIPLOCALHEADER +
2127 pfile_in_zip_read_info->stream.avail_in = (uInt)0;
2130 s->pfile_in_zip_read = pfile_in_zip_read_info;
2136 Read bytes from the current file.
2137 buf contain buffer where data must be copied
2138 len the size of buf.
2140 return the number of byte copied if somes bytes are copied
2141 return 0 if the end of file was reached
2142 return <0 with error code if there is an error
2143 (UNZ_ERRNO for IO error, or zLib error for uncompress error)
2145 extern int unzReadCurrentFile( unzFile file, void *buf, unsigned len ){
2149 file_in_zip_read_info_s* pfile_in_zip_read_info;
2150 if ( file == NULL ) {
2151 return UNZ_PARAMERROR;
2154 pfile_in_zip_read_info = s->pfile_in_zip_read;
2156 if ( pfile_in_zip_read_info == NULL ) {
2157 return UNZ_PARAMERROR;
2161 if ( ( pfile_in_zip_read_info->read_buffer == NULL ) ) {
2162 return UNZ_END_OF_LIST_OF_FILE;
2168 pfile_in_zip_read_info->stream.next_out = (Byte*)buf;
2170 pfile_in_zip_read_info->stream.avail_out = (uInt)len;
2172 if ( len > pfile_in_zip_read_info->rest_read_uncompressed ) {
2173 pfile_in_zip_read_info->stream.avail_out =
2174 (uInt)pfile_in_zip_read_info->rest_read_uncompressed;
2177 while ( pfile_in_zip_read_info->stream.avail_out > 0 )
2179 if ( ( pfile_in_zip_read_info->stream.avail_in == 0 ) &&
2180 ( pfile_in_zip_read_info->rest_read_compressed > 0 ) ) {
2181 uInt uReadThis = UNZ_BUFSIZE;
2182 if ( pfile_in_zip_read_info->rest_read_compressed < uReadThis ) {
2183 uReadThis = (uInt)pfile_in_zip_read_info->rest_read_compressed;
2185 if ( uReadThis == 0 ) {
2188 if ( s->cur_file_info.compressed_size == pfile_in_zip_read_info->rest_read_compressed ) {
2189 if ( fseek( pfile_in_zip_read_info->file,
2190 pfile_in_zip_read_info->pos_in_zipfile +
2191 pfile_in_zip_read_info->byte_before_the_zipfile,SEEK_SET ) != 0 ) {
2195 if ( fread( pfile_in_zip_read_info->read_buffer,uReadThis,1,
2196 pfile_in_zip_read_info->file ) != 1 ) {
2199 pfile_in_zip_read_info->pos_in_zipfile += uReadThis;
2201 pfile_in_zip_read_info->rest_read_compressed -= uReadThis;
2203 pfile_in_zip_read_info->stream.next_in =
2204 (Byte*)pfile_in_zip_read_info->read_buffer;
2205 pfile_in_zip_read_info->stream.avail_in = (uInt)uReadThis;
2208 if ( pfile_in_zip_read_info->compression_method == 0 ) {
2210 if ( pfile_in_zip_read_info->stream.avail_out <
2211 pfile_in_zip_read_info->stream.avail_in ) {
2212 uDoCopy = pfile_in_zip_read_info->stream.avail_out ;
2215 uDoCopy = pfile_in_zip_read_info->stream.avail_in ;
2218 for ( i = 0; i < uDoCopy; i++ )
2219 *( pfile_in_zip_read_info->stream.next_out + i ) =
2220 *( pfile_in_zip_read_info->stream.next_in + i );
2222 pfile_in_zip_read_info->crc32 = crc32( pfile_in_zip_read_info->crc32,
2223 pfile_in_zip_read_info->stream.next_out,
2225 pfile_in_zip_read_info->rest_read_uncompressed -= uDoCopy;
2226 pfile_in_zip_read_info->stream.avail_in -= uDoCopy;
2227 pfile_in_zip_read_info->stream.avail_out -= uDoCopy;
2228 pfile_in_zip_read_info->stream.next_out += uDoCopy;
2229 pfile_in_zip_read_info->stream.next_in += uDoCopy;
2230 pfile_in_zip_read_info->stream.total_out += uDoCopy;
2235 uLong uTotalOutBefore,uTotalOutAfter;
2236 const Byte *bufBefore;
2238 int flush = Z_SYNC_FLUSH;
2240 uTotalOutBefore = pfile_in_zip_read_info->stream.total_out;
2241 bufBefore = pfile_in_zip_read_info->stream.next_out;
2244 if ((pfile_in_zip_read_info->rest_read_uncompressed ==
2245 pfile_in_zip_read_info->stream.avail_out) &&
2246 (pfile_in_zip_read_info->rest_read_compressed == 0))
2249 err = inflate( &pfile_in_zip_read_info->stream,flush );
2251 uTotalOutAfter = pfile_in_zip_read_info->stream.total_out;
2252 uOutThis = uTotalOutAfter - uTotalOutBefore;
2254 pfile_in_zip_read_info->crc32 =
2255 crc32( pfile_in_zip_read_info->crc32,bufBefore,
2256 (uInt)( uOutThis ) );
2258 pfile_in_zip_read_info->rest_read_uncompressed -=
2261 iRead += (uInt)( uTotalOutAfter - uTotalOutBefore );
2263 if ( err == Z_STREAM_END ) {
2264 return ( iRead == 0 ) ? UNZ_EOF : iRead;
2266 if ( err != Z_OK ) {
2272 if ( err == Z_OK ) {
2280 Give the current position in uncompressed data
2282 extern long unztell( unzFile file ){
2284 file_in_zip_read_info_s* pfile_in_zip_read_info;
2285 if ( file == NULL ) {
2286 return UNZ_PARAMERROR;
2289 pfile_in_zip_read_info = s->pfile_in_zip_read;
2291 if ( pfile_in_zip_read_info == NULL ) {
2292 return UNZ_PARAMERROR;
2295 return (long)pfile_in_zip_read_info->stream.total_out;
2300 return 1 if the end of file was reached, 0 elsewhere
2302 extern int unzeof( unzFile file ){
2304 file_in_zip_read_info_s* pfile_in_zip_read_info;
2305 if ( file == NULL ) {
2306 return UNZ_PARAMERROR;
2309 pfile_in_zip_read_info = s->pfile_in_zip_read;
2311 if ( pfile_in_zip_read_info == NULL ) {
2312 return UNZ_PARAMERROR;
2315 if ( pfile_in_zip_read_info->rest_read_uncompressed == 0 ) {
2326 Read extra field from the current file (opened by unzOpenCurrentFile)
2327 This is the static-header version of the extra field (sometimes, there is
2328 more info in the static-header version than in the central-header)
2330 if buf==NULL, it return the size of the static extra field that can be read
2332 if buf!=NULL, len is the size of the buffer, the extra header is copied in
2334 the return value is the number of bytes copied in buf, or (if <0)
2337 extern int unzGetLocalExtrafield( unzFile file,void *buf,unsigned len ){
2339 file_in_zip_read_info_s* pfile_in_zip_read_info;
2343 if ( file == NULL ) {
2344 return UNZ_PARAMERROR;
2347 pfile_in_zip_read_info = s->pfile_in_zip_read;
2349 if ( pfile_in_zip_read_info == NULL ) {
2350 return UNZ_PARAMERROR;
2353 size_to_read = ( pfile_in_zip_read_info->size_local_extrafield -
2354 pfile_in_zip_read_info->pos_local_extrafield );
2356 if ( buf == NULL ) {
2357 return (int)size_to_read;
2360 if ( len > size_to_read ) {
2361 read_now = (uInt)size_to_read;
2364 read_now = (uInt)len ;
2367 if ( read_now == 0 ) {
2371 if ( fseek( pfile_in_zip_read_info->file,
2372 pfile_in_zip_read_info->offset_local_extrafield +
2373 pfile_in_zip_read_info->pos_local_extrafield,SEEK_SET ) != 0 ) {
2377 if ( fread( buf,(uInt)size_to_read,1,pfile_in_zip_read_info->file ) != 1 ) {
2381 return (int)read_now;
2385 Close the file in zip opened with unzipOpenCurrentFile
2386 Return UNZ_CRCERROR if all the file was read but the CRC is not good
2388 extern int unzCloseCurrentFile( unzFile file ){
2392 file_in_zip_read_info_s* pfile_in_zip_read_info;
2393 if ( file == NULL ) {
2394 return UNZ_PARAMERROR;
2397 pfile_in_zip_read_info = s->pfile_in_zip_read;
2399 if ( pfile_in_zip_read_info == NULL ) {
2400 return UNZ_PARAMERROR;
2404 if ( pfile_in_zip_read_info->rest_read_uncompressed == 0 ) {
2405 if ( pfile_in_zip_read_info->crc32 != pfile_in_zip_read_info->crc32_wait ) {
2411 free( pfile_in_zip_read_info->read_buffer );
2412 pfile_in_zip_read_info->read_buffer = NULL;
2413 if ( pfile_in_zip_read_info->stream_initialised ) {
2414 inflateEnd( &pfile_in_zip_read_info->stream );
2417 pfile_in_zip_read_info->stream_initialised = 0;
2418 free( pfile_in_zip_read_info );
2420 s->pfile_in_zip_read = NULL;
2427 Get the global comment string of the ZipFile, in the szComment buffer.
2428 uSizeBuf is the size of the szComment buffer.
2429 return the number of byte copied or an error code <0
2431 extern int unzGetGlobalComment( unzFile file, char *szComment, uLong uSizeBuf ){
2434 if ( file == NULL ) {
2435 return UNZ_PARAMERROR;
2439 uReadThis = uSizeBuf;
2440 if ( uReadThis > s->gi.size_comment ) {
2441 uReadThis = s->gi.size_comment;
2444 if ( fseek( s->file,s->central_pos + 22,SEEK_SET ) != 0 ) {
2448 if ( uReadThis > 0 ) {
2450 if ( fread( szComment,(uInt)uReadThis,1,s->file ) != 1 ) {
2455 if ( ( szComment != NULL ) && ( uSizeBuf > s->gi.size_comment ) ) {
2456 *( szComment + s->gi.size_comment ) = '\0';
2458 return (int)uReadThis;
2461 /* crc32.c -- compute the CRC-32 of a data stream
2462 * Copyright (C) 1995-1998 Mark Adler
2463 * For conditions of distribution and use, see copyright notice in zlib.h
2467 #ifdef DYNAMIC_CRC_TABLE
2469 static int crc_table_empty = 1;
2470 static uLong crc_table[256];
2471 static void make_crc_table OF( (void) );
2474 Generate a table for a byte-wise 32-bit CRC calculation on the polynomial:
2475 x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1.
2477 Polynomials over GF(2) are represented in binary, one bit per coefficient,
2478 with the lowest powers in the most significant bit. Then adding polynomials
2479 is just exclusive-or, and multiplying a polynomial by x is a right shift by
2480 one. If we call the above polynomial p, and represent a byte as the
2481 polynomial q, also with the lowest power in the most significant bit (so the
2482 byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
2483 where a mod b means the remainder after dividing a by b.
2485 This calculation is done using the shift-register method of multiplying and
2486 taking the remainder. The register is initialized to zero, and for each
2487 incoming bit, x^32 is added mod p to the register if the bit is a one (where
2488 x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by
2489 x (which is shifting right by one and adding x^32 mod p if the bit shifted
2490 out is a one). We start with the highest power (least significant bit) of
2491 q and repeat for all eight bits of q.
2493 The table is simply the CRC of all possible eight bit values. This is all
2494 the information needed to generate CRC's on data a byte at a time for all
2495 combinations of CRC register values and incoming bytes.
2497 static void make_crc_table(){
2500 uLong poly; /* polynomial exclusive-or pattern */
2501 /* terms of polynomial defining this crc (except x^32): */
2502 static const Byte p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};
2504 /* make exclusive-or pattern from polynomial (0xedb88320L) */
2506 for ( n = 0; n < sizeof( p ) / sizeof( Byte ); n++ )
2507 poly |= 1L << ( 31 - p[n] );
2509 for ( n = 0; n < 256; n++ )
2512 for ( k = 0; k < 8; k++ )
2513 c = c & 1 ? poly ^ ( c >> 1 ) : c >> 1;
2516 crc_table_empty = 0;
2519 /* ========================================================================
2520 * Table of CRC-32's of all single-byte values (made by make_crc_table)
2522 static const uLong crc_table[256] = {
2523 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
2524 0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
2525 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
2526 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL,
2527 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L,
2528 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
2529 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L,
2530 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
2531 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L,
2532 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL,
2533 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L,
2534 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
2535 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L,
2536 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL,
2537 0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL,
2538 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
2539 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL,
2540 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
2541 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L,
2542 0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L,
2543 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL,
2544 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L,
2545 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L,
2546 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
2547 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L,
2548 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L,
2549 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L,
2550 0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L,
2551 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L,
2552 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
2553 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL,
2554 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
2555 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L,
2556 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL,
2557 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL,
2558 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
2559 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL,
2560 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L,
2561 0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL,
2562 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
2563 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL,
2564 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
2565 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L,
2566 0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL,
2567 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L,
2568 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L,
2569 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L,
2570 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
2571 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L,
2572 0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L,
2573 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
2578 /* =========================================================================
2579 * This function can be used by asm versions of crc32()
2582 const uLong * get_crc_table(){
2583 #ifdef DYNAMIC_CRC_TABLE
2584 if ( crc_table_empty ) {
2588 return (const uLong *)crc_table;
2592 /* ========================================================================= */
2593 #define DO1( buf ) crc = crc_table[( (int)crc ^ ( *buf++ ) ) & 0xff] ^ ( crc >> 8 );
2594 #define DO2( buf ) DO1( buf ); DO1( buf );
2595 #define DO4( buf ) DO2( buf ); DO2( buf );
2596 #define DO8( buf ) DO4( buf ); DO4( buf );
2598 /* ========================================================================= */
2600 uLong crc32( uLong crc, const Byte *buf, uInt len ){
2601 if ( buf == Z_NULL ) {
2604 #ifdef DYNAMIC_CRC_TABLE
2605 if ( crc_table_empty ) {
2609 crc = crc ^ 0xffffffffL;
2620 return crc ^ 0xffffffffL;
2624 /* infblock.h -- header to use infblock.c
2625 * Copyright (C) 1995-1998 Mark Adler
2626 * For conditions of distribution and use, see copyright notice in zlib.h
2629 /* WARNING: this file should *not* be used by applications. It is
2630 part of the implementation of the compression library and is
2631 subject to change. Applications should only use zlib.h.
2634 struct inflate_blocks_state;
2635 typedef struct inflate_blocks_state inflate_blocks_statef;
2637 extern inflate_blocks_statef * inflate_blocks_new OF( (
2639 check_func c, /* check function */
2640 uInt w ) ); /* window size */
2642 extern int inflate_blocks OF( (
2643 inflate_blocks_statef *,
2645 int ) ); /* initial return code */
2647 extern void inflate_blocks_reset OF( (
2648 inflate_blocks_statef *,
2650 uLong * ) ); /* check value on output */
2652 extern int inflate_blocks_free OF( (
2653 inflate_blocks_statef *,
2656 extern void inflate_set_dictionary OF( (
2657 inflate_blocks_statef * s,
2658 const Byte * d, /* dictionary */
2659 uInt n ) ); /* dictionary length */
2661 extern int inflate_blocks_sync_point OF( (
2662 inflate_blocks_statef * s ) );
2664 /* simplify the use of the inflate_huft type with some defines */
2665 #define exop word.what.Exop
2666 #define bits word.what.Bits
2668 /* Table for deflate from PKZIP's appnote.txt. */
2669 static const uInt border[] = { /* Order of the bit length code lengths */
2670 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15
2673 /* inftrees.h -- header to use inftrees.c
2674 * Copyright (C) 1995-1998 Mark Adler
2675 * For conditions of distribution and use, see copyright notice in zlib.h
2678 /* WARNING: this file should *not* be used by applications. It is
2679 part of the implementation of the compression library and is
2680 subject to change. Applications should only use zlib.h.
2683 /* Huffman code lookup table entry--this entry is four bytes for machines
2684 that have 16-bit pointers (e.g. PC's in the small or medium model). */
2686 typedef struct inflate_huft_s inflate_huft;
2688 struct inflate_huft_s {
2691 Byte Exop; /* number of extra bits or operation */
2692 Byte Bits; /* number of bits in this code or subcode */
2694 uInt pad; /* pad structure to a power of 2 (4 bytes for */
2695 } word; /* 16-bit, 8 bytes for 32-bit int's) */
2696 uInt base; /* literal, length base, distance base,
2700 /* Maximum size of dynamic tree. The maximum found in a long but non-
2701 exhaustive search was 1004 huft structures (850 for length/literals
2702 and 154 for distances, the latter actually the result of an
2703 exhaustive search). The actual maximum is not known, but the
2704 value below is more than safe. */
2707 extern int inflate_trees_bits OF( (
2708 uInt *, /* 19 code lengths */
2709 uInt *, /* bits tree desired/actual depth */
2710 inflate_huft * *, /* bits tree result */
2711 inflate_huft *, /* space for trees */
2712 z_streamp ) ); /* for messages */
2714 extern int inflate_trees_dynamic OF( (
2715 uInt, /* number of literal/length codes */
2716 uInt, /* number of distance codes */
2717 uInt *, /* that many (total) code lengths */
2718 uInt *, /* literal desired/actual bit depth */
2719 uInt *, /* distance desired/actual bit depth */
2720 inflate_huft * *, /* literal/length tree result */
2721 inflate_huft * *, /* distance tree result */
2722 inflate_huft *, /* space for trees */
2723 z_streamp ) ); /* for messages */
2725 extern int inflate_trees_fixed OF( (
2726 uInt *, /* literal desired/actual bit depth */
2727 uInt *, /* distance desired/actual bit depth */
2728 inflate_huft * *, /* literal/length tree result */
2729 inflate_huft * *, /* distance tree result */
2730 z_streamp ) ); /* for memory allocation */
2733 /* infcodes.h -- header to use infcodes.c
2734 * Copyright (C) 1995-1998 Mark Adler
2735 * For conditions of distribution and use, see copyright notice in zlib.h
2738 /* WARNING: this file should *not* be used by applications. It is
2739 part of the implementation of the compression library and is
2740 subject to change. Applications should only use zlib.h.
2743 struct inflate_codes_state;
2744 typedef struct inflate_codes_state inflate_codes_statef;
2746 extern inflate_codes_statef *inflate_codes_new OF( (
2748 inflate_huft *, inflate_huft *,
2751 extern int inflate_codes OF( (
2752 inflate_blocks_statef *,
2756 extern void inflate_codes_free OF( (
2757 inflate_codes_statef *,
2760 /* infutil.h -- types and macros common to blocks and codes
2761 * Copyright (C) 1995-1998 Mark Adler
2762 * For conditions of distribution and use, see copyright notice in zlib.h
2765 /* WARNING: this file should *not* be used by applications. It is
2766 part of the implementation of the compression library and is
2767 subject to change. Applications should only use zlib.h.
2774 TYPE, /* get type bits (3, including end bit) */
2775 LENS, /* get lengths for stored */
2776 STORED, /* processing stored block */
2777 TABLE, /* get table lengths */
2778 BTREE, /* get bit lengths tree for a dynamic block */
2779 DTREE, /* get length, distance trees for a dynamic block */
2780 CODES, /* processing fixed or dynamic block */
2781 DRY, /* output remaining window bytes */
2782 DONE, /* finished last block, done */
2784 } /* got a data error--stuck here */
2787 /* inflate blocks semi-private state */
2788 struct inflate_blocks_state {
2791 inflate_block_mode mode; /* current inflate_block mode */
2793 /* mode dependent information */
2795 uInt left; /* if STORED, bytes left to copy */
2797 uInt table; /* table lengths (14 bits) */
2798 uInt index; /* index into blens (or border) */
2799 uInt *blens; /* bit lengths of codes */
2800 uInt bb; /* bit length tree depth */
2801 inflate_huft *tb; /* bit length decoding tree */
2802 } trees; /* if DTREE, decoding info for trees */
2804 inflate_codes_statef
2806 } decode; /* if CODES, current state */
2807 } sub; /* submode */
2808 uInt last; /* true if this block is the last block */
2810 /* mode independent information */
2811 uInt bitk; /* bits in bit buffer */
2812 uLong bitb; /* bit buffer */
2813 inflate_huft *hufts; /* single safe_malloc for tree space */
2814 Byte *window; /* sliding window */
2815 Byte *end; /* one byte after sliding window */
2816 Byte *read; /* window read pointer */
2817 Byte *write; /* window write pointer */
2818 check_func checkfn; /* check function */
2819 uLong check; /* check on output */
2824 /* defines for inflate input/output */
2825 /* update pointers and return */
2826 #define UPDBITS {s->bitb = b; s->bitk = k; }
2827 #define UPDIN {z->avail_in = n; z->total_in += p - z->next_in; z->next_in = p; }
2828 #define UPDOUT {s->write = q; }
2829 #define UPDATE {UPDBITS UPDIN UPDOUT}
2830 #define LEAVE {UPDATE return inflate_flush( s,z,r ); }
2831 /* get bytes and bits */
2832 #define LOADIN {p = z->next_in; n = z->avail_in; b = s->bitb; k = s->bitk; }
2833 #define NEEDBYTE {if ( n ) {r = Z_OK; }else LEAVE}
2834 #define NEXTBYTE ( n--,*p++ )
2835 #define NEEDBITS( j ) {while ( k < ( j ) ) {NEEDBYTE; b |= ( (uLong)NEXTBYTE ) << k; k += 8; }}
2836 #define DUMPBITS( j ) {b >>= ( j ); k -= ( j ); }
2838 #define WAVAIL (uInt)( q < s->read ? s->read - q - 1 : s->end - q )
2839 #define LOADOUT {q = s->write; m = (uInt)WAVAIL; }
2840 #define WRAP {if ( q == s->end && s->read != s->window ) {q = s->window; m = (uInt)WAVAIL; }}
2841 #define FLUSH {UPDOUT r = inflate_flush( s,z,r ); LOADOUT}
2842 #define NEEDOUT {if ( m == 0 ) {WRAP if ( m == 0 ) {FLUSH WRAP if ( m == 0 ) {LEAVE}} r = Z_OK; }}
2843 #define OUTBYTE( a ) {*q++ = (Byte)( a ); m--; }
2844 /* load static pointers */
2845 #define LOAD {LOADIN LOADOUT}
2847 /* masks for lower bits (size given to avoid silly warnings with Visual C++) */
2848 extern uInt inflate_mask[17];
2850 /* copy as much as possible from the sliding window to the output area */
2851 extern int inflate_flush OF( (
2852 inflate_blocks_statef *,
2860 Notes beyond the 1.93a appnote.txt:
2862 1. Distance pointers never point before the beginning of the output
2864 2. Distance pointers can point back across blocks, up to 32k away.
2865 3. There is an implied maximum of 7 bits for the bit length table and
2866 15 bits for the actual data.
2867 4. If only one code exists, then it is encoded using one bit. (Zero
2868 would be more efficient, but perhaps a little confusing.) If two
2869 codes exist, they are coded using one bit each (0 and 1).
2870 5. There is no way of sending zero distance codes--a dummy must be
2871 sent if there are none. (History: a pre 2.0 version of PKZIP would
2872 store blocks with no distance codes, but this was discovered to be
2873 too harsh a criterion.) Valid only for 1.93a. 2.04c does allow
2874 zero distance codes, which is sent as one code of zero bits in
2876 6. There are up to 286 literal/length codes. Code 256 represents the
2877 end-of-block. Note however that the static length tree defines
2878 288 codes just to fill out the Huffman codes. Codes 286 and 287
2879 cannot be used though, since there is no length base or extra bits
2880 defined for them. Similarily, there are up to 30 distance codes.
2881 However, static trees define 32 codes (all 5 bits) to fill out the
2882 Huffman codes, but the last two had better not show up in the data.
2883 7. Unzip can check dynamic Huffman blocks for complete code sets.
2884 The exception is that a single code would not be complete (see #4).
2885 8. The five bits following the block type is really the number of
2886 literal codes sent minus 257.
2887 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits
2888 (1+6+6). Therefore, to output three times the length, you output
2889 three codes (1+1+1), whereas to output four times the same length,
2890 you only need two codes (1+3). Hmm.
2891 10. In the tree reconstruction algorithm, Code = Code + Increment
2892 only if BitLength(i) is not zero. (Pretty obvious.)
2893 11. Correction: 4 Bits: # of Bit Length codes - 4 (4 - 19)
2894 12. Note: length code 284 can represent 227-258, but length code 285
2895 really is 258. The last length deserves its own, short code
2896 since it gets used a lot in very redundant files. The length
2897 258 is special since 258 - 3 (the min match length) is 255.
2898 13. The literal/length and distance code bit lengths are read as a
2899 single stream of lengths. It is possible (and advantageous) for
2900 a repeat code (16, 17, or 18) to go across the boundary between
2901 the two sets of lengths.
2906 void inflate_blocks_reset( inflate_blocks_statef *s, z_streamp z, uLong *c ){
2907 if ( c != Z_NULL ) {
2910 if ( s->mode == BTREE || s->mode == DTREE ) {
2911 ZFREE( z, s->sub.trees.blens );
2913 if ( s->mode == CODES ) {
2914 inflate_codes_free( s->sub.decode.codes, z );
2919 s->read = s->write = s->window;
2920 if ( s->checkfn != Z_NULL ) {
2921 z->adler = s->check = ( *s->checkfn )( 0L, (const Byte *)Z_NULL, 0 );
2923 Tracev( ( "inflate: blocks reset\n" ) );
2928 inflate_blocks_statef *inflate_blocks_new( z_streamp z, check_func c, uInt w ){
2929 inflate_blocks_statef *s;
2931 if ( ( s = (inflate_blocks_statef *)ZALLOC
2932 ( z,1,sizeof( struct inflate_blocks_state ) ) ) == Z_NULL ) {
2936 (inflate_huft *)ZALLOC( z, sizeof( inflate_huft ), MANY ) ) == Z_NULL ) {
2940 if ( ( s->window = (Byte *)ZALLOC( z, 1, w ) ) == Z_NULL ) {
2941 ZFREE( z, s->hufts );
2945 s->end = s->window + w;
2948 Tracev( ( "inflate: blocks allocated\n" ) );
2949 inflate_blocks_reset( s, z, Z_NULL );
2955 int inflate_blocks( inflate_blocks_statef *s, z_streamp z, int r ){
2956 uInt t; /* temporary storage */
2957 uLong b; /* bit buffer */
2958 uInt k; /* bits in bit buffer */
2959 Byte *p; /* input data pointer */
2960 uInt n; /* bytes available there */
2961 Byte *q; /* output window write pointer */
2962 uInt m; /* bytes to end of window or read pointer */
2964 /* copy input/output information to locals (UPDATE macro restores) */
2967 /* process input based on current state */
2968 while ( 1 ) switch ( s->mode )
2976 case 0: /* stored */
2977 Tracev( ( "inflate: stored block%s\n",
2978 s->last ? " (last)" : "" ) );
2980 t = k & 7; /* go to byte boundary */
2982 s->mode = LENS; /* get length of stored block */
2985 Tracev( ( "inflate: fixed codes block%s\n",
2986 s->last ? " (last)" : "" ) );
2989 inflate_huft *tl, *td;
2991 inflate_trees_fixed( &bl, &bd, &tl, &td, z );
2992 s->sub.decode.codes = inflate_codes_new( bl, bd, tl, td, z );
2993 if ( s->sub.decode.codes == Z_NULL ) {
3001 case 2: /* dynamic */
3002 Tracev( ( "inflate: dynamic codes block%s\n",
3003 s->last ? " (last)" : "" ) );
3007 case 3: /* illegal */
3010 z->msg = (char*)"invalid block type";
3017 if ( ( ( ( ~b ) >> 16 ) & 0xffff ) != ( b & 0xffff ) ) {
3019 z->msg = (char*)"invalid stored block lengths";
3023 s->sub.left = (uInt)b & 0xffff;
3024 b = k = 0; /* dump bits */
3025 Tracev( ( "inflate: stored length %u\n", s->sub.left ) );
3026 s->mode = s->sub.left ? STORED : ( s->last ? DRY : TYPE );
3043 if ( ( s->sub.left -= t ) != 0 ) {
3046 Tracev( ( "inflate: stored end, %lu total out\n",
3047 z->total_out + ( q >= s->read ? q - s->read :
3048 ( s->end - s->read ) + ( q - s->window ) ) ) );
3049 s->mode = s->last ? DRY : TYPE;
3053 s->sub.trees.table = t = (uInt)b & 0x3fff;
3054 #ifndef PKZIP_BUG_WORKAROUND
3055 if ( ( t & 0x1f ) > 29 || ( ( t >> 5 ) & 0x1f ) > 29 ) {
3057 z->msg = (char*)"too many length or distance symbols";
3062 t = 258 + ( t & 0x1f ) + ( ( t >> 5 ) & 0x1f );
3063 if ( ( s->sub.trees.blens = (uInt*)ZALLOC( z, t, sizeof( uInt ) ) ) == Z_NULL ) {
3068 s->sub.trees.index = 0;
3069 Tracev( ( "inflate: table sizes ok\n" ) );
3072 while ( s->sub.trees.index < 4 + ( s->sub.trees.table >> 10 ) )
3075 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
3078 while ( s->sub.trees.index < 19 )
3079 s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
3080 s->sub.trees.bb = 7;
3081 t = inflate_trees_bits( s->sub.trees.blens, &s->sub.trees.bb,
3082 &s->sub.trees.tb, s->hufts, z );
3084 ZFREE( z, s->sub.trees.blens );
3086 if ( r == Z_DATA_ERROR ) {
3091 s->sub.trees.index = 0;
3092 Tracev( ( "inflate: bits tree ok\n" ) );
3095 while ( t = s->sub.trees.table,
3096 s->sub.trees.index < 258 + ( t & 0x1f ) + ( ( t >> 5 ) & 0x1f ) )
3101 t = s->sub.trees.bb;
3103 h = s->sub.trees.tb + ( (uInt)b & inflate_mask[t] );
3108 s->sub.trees.blens[s->sub.trees.index++] = c;
3110 else /* c == 16..18 */
3112 i = c == 18 ? 7 : c - 14;
3113 j = c == 18 ? 11 : 3;
3116 j += (uInt)b & inflate_mask[i];
3118 i = s->sub.trees.index;
3119 t = s->sub.trees.table;
3120 if ( i + j > 258 + ( t & 0x1f ) + ( ( t >> 5 ) & 0x1f ) ||
3121 ( c == 16 && i < 1 ) ) {
3122 ZFREE( z, s->sub.trees.blens );
3124 z->msg = (char*)"invalid bit length repeat";
3128 c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
3130 s->sub.trees.blens[i++] = c;
3132 s->sub.trees.index = i;
3135 s->sub.trees.tb = Z_NULL;
3138 inflate_huft *tl, *td;
3139 inflate_codes_statef *c;
3141 bl = 9; /* must be <= 9 for lookahead assumptions */
3142 bd = 6; /* must be <= 9 for lookahead assumptions */
3143 t = s->sub.trees.table;
3144 t = inflate_trees_dynamic( 257 + ( t & 0x1f ), 1 + ( ( t >> 5 ) & 0x1f ),
3145 s->sub.trees.blens, &bl, &bd, &tl, &td,
3147 ZFREE( z, s->sub.trees.blens );
3149 if ( t == (uInt)Z_DATA_ERROR ) {
3155 Tracev( ( "inflate: trees ok\n" ) );
3156 if ( ( c = inflate_codes_new( bl, bd, tl, td, z ) ) == Z_NULL ) {
3160 s->sub.decode.codes = c;
3165 if ( ( r = inflate_codes( s, z, r ) ) != Z_STREAM_END ) {
3166 return inflate_flush( s, z, r );
3169 inflate_codes_free( s->sub.decode.codes, z );
3171 Tracev( ( "inflate: codes end, %lu total out\n",
3172 z->total_out + ( q >= s->read ? q - s->read :
3173 ( s->end - s->read ) + ( q - s->window ) ) ) );
3181 if ( s->read != s->write ) {
3199 int inflate_blocks_free( inflate_blocks_statef *s, z_streamp z ){
3200 inflate_blocks_reset( s, z, Z_NULL );
3201 ZFREE( z, s->window );
3202 ZFREE( z, s->hufts );
3204 Tracev( ( "inflate: blocks freed\n" ) );
3210 void inflate_set_dictionary( inflate_blocks_statef *s, const Byte *d, uInt n ){
3211 zmemcpy( s->window, d, n );
3212 s->read = s->write = s->window + n;
3216 /* Returns true if inflate is currently at the end of a block generated
3217 * by Z_SYNC_FLUSH or Z_FULL_FLUSH.
3218 * IN assertion: s != Z_NULL
3221 int inflate_blocks_sync_point( inflate_blocks_statef *s ){
3222 return s->mode == LENS;
3226 /* And'ing with mask[n] masks the lower n bits */
3227 uInt inflate_mask[17] = {
3229 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff,
3230 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff
3233 /* copy as much as possible from the sliding window to the output area */
3235 int inflate_flush( inflate_blocks_statef *s, z_streamp z, int r ){
3240 /* static copies of source and destination pointers */
3244 /* compute number of bytes to copy as as end of window */
3245 n = (uInt)( ( q <= s->write ? s->write : s->end ) - q );
3246 if ( n > z->avail_out ) {
3249 if ( n && r == Z_BUF_ERROR ) {
3253 /* update counters */
3257 /* update check information */
3258 if ( s->checkfn != Z_NULL ) {
3259 z->adler = s->check = ( *s->checkfn )( s->check, q, n );
3262 /* copy as as end of window */
3267 /* see if more to copy at beginning of window */
3268 if ( q == s->end ) {
3271 if ( s->write == s->end ) {
3272 s->write = s->window;
3275 /* compute bytes to copy */
3276 n = (uInt)( s->write - q );
3277 if ( n > z->avail_out ) {
3280 if ( n && r == Z_BUF_ERROR ) {
3284 /* update counters */
3288 /* update check information */
3289 if ( s->checkfn != Z_NULL ) {
3290 z->adler = s->check = ( *s->checkfn )( s->check, q, n );
3299 /* update pointers */
3308 /* inftrees.c -- generate Huffman trees for efficient decoding
3309 * Copyright (C) 1995-1998 Mark Adler
3310 * For conditions of distribution and use, see copyright notice in zlib.h
3314 const char inflate_copyright[] =
3315 " inflate 1.1.3 Copyright 1995-1998 Mark Adler ";
3319 If you use the zlib library in a product, an acknowledgment is welcome
3320 in the documentation of your product. If for some reason you cannot
3321 include such an acknowledgment, I would appreciate that you keep this
3322 copyright string in the executable of your product.
3325 /* simplify the use of the inflate_huft type with some defines */
3326 #define exop word.what.Exop
3327 #define bits word.what.Bits
3330 static int huft_build OF( (
3331 uInt *, /* code lengths in bits */
3332 uInt, /* number of codes */
3333 uInt, /* number of "simple" codes */
3334 const uInt *, /* list of base values for non-simple codes */
3335 const uInt *, /* list of extra bits for non-simple codes */
3336 inflate_huft * *, /* result: starting table */
3337 uInt *, /* maximum lookup bits (returns actual) */
3338 inflate_huft *, /* space for trees */
3339 uInt *, /* hufts used in space */
3340 uInt * ) ); /* space for values */
3342 /* Tables for deflate from PKZIP's appnote.txt. */
3343 static const uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */
3344 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
3345 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0
3347 /* see note #13 above about 258 */
3348 static const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */
3349 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2,
3350 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112
3351 }; /* 112==invalid */
3352 static const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */
3353 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
3354 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
3355 8193, 12289, 16385, 24577
3357 static const uInt cpdext[30] = { /* Extra bits for distance codes */
3358 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6,
3359 7, 7, 8, 8, 9, 9, 10, 10, 11, 11,
3364 Huffman code decoding is performed using a multi-level table lookup.
3365 The fastest way to decode is to simply build a lookup table whose
3366 size is determined by the longest code. However, the time it takes
3367 to build this table can also be a factor if the data being decoded
3368 is not very long. The most common codes are necessarily the
3369 shortest codes, so those codes dominate the decoding time, and hence
3370 the speed. The idea is you can have a shorter table that decodes the
3371 shorter, more probable codes, and then point to subsidiary tables for
3372 the longer codes. The time it costs to decode the longer codes is
3373 then traded against the time it takes to make longer tables.
3375 This results of this trade are in the variables lbits and dbits
3376 below. lbits is the number of bits the first level table for literal/
3377 length codes can decode in one step, and dbits is the same thing for
3378 the distance codes. Subsequent tables are also less than or equal to
3379 those sizes. These values may be adjusted either when all of the
3380 codes are shorter than that, in which case the longest code length in
3381 bits is used, or when the shortest code is *longer* than the requested
3382 table size, in which case the length of the shortest code in bits is
3385 There are two different values for the two tables, since they code a
3386 different number of possibilities each. The literal/length table
3387 codes 286 possible values, or in a flat code, a little over eight
3388 bits. The distance table codes 30 possible values, or a little less
3389 than five bits, flat. The optimum values for speed end up being
3390 about one bit more than those, so lbits is 8+1 and dbits is 5+1.
3391 The optimum values may differ though from machine to machine, and
3392 possibly even between compilers. Your mileage may vary.
3396 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
3397 #define BMAX 15 /* maximum bit length of any code */
3399 static int huft_build( uInt *b, uInt n, uInt s, const uInt *d, const uInt *e, inflate_huft ** t, uInt *m, inflate_huft *hp, uInt *hn, uInt *v ){
3400 //uInt *b; /* code lengths in bits (all assumed <= BMAX) */
3401 //uInt n; /* number of codes (assumed <= 288) */
3402 //uInt s; /* number of simple-valued codes (0..s-1) */
3403 //const uInt *d; /* list of base values for non-simple codes */
3404 //const uInt *e; /* list of extra bits for non-simple codes */
3405 //inflate_huft ** t; /* result: starting table */
3406 //uInt *m; /* maximum lookup bits, returns actual */
3407 //inflate_huft *hp; /* space for trees */
3408 //uInt *hn; /* hufts used in space */
3409 //uInt *v; /* working area: values in order of bit length */
3410 /* Given a list of code lengths and a maximum table size, make a set of
3411 tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR
3412 if the given code set is incomplete (the tables are still built in this
3413 case), Z_DATA_ERROR if the input is invalid (an over-subscribed set of
3414 lengths), or Z_MEM_ERROR if not enough memory. */
3416 uInt a; /* counter for codes of length k */
3417 uInt c[BMAX + 1]; /* bit length count table */
3418 uInt f; /* i repeats in table every f entries */
3419 int g; /* maximum code length */
3420 int h; /* table level */
3421 register uInt i; /* counter, current code */
3422 register uInt j; /* counter */
3423 register int k; /* number of bits in current code */
3424 int l; /* bits per table (returned in m) */
3425 uInt mask; /* (1 << w) - 1, to avoid cc -O bug on HP */
3426 register uInt *p; /* pointer into c[], b[], or v[] */
3427 inflate_huft *q; /* points to current table */
3428 struct inflate_huft_s r; /* table entry for structure assignment */
3429 inflate_huft *u[BMAX]; /* table stack */
3430 register int w; /* bits before this table == (l * h) */
3431 uInt x[BMAX + 1]; /* bit offsets, then code stack */
3432 uInt *xp; /* pointer into x */
3433 int y; /* number of dummy codes added */
3434 uInt z; /* number of entries in current table */
3437 /* Generate counts for each bit length */
3439 #define C0 *p++ = 0;
3440 #define C2 C0 C0 C0 C0
3441 #define C4 C2 C2 C2 C2
3442 C4 /* clear c[]--assume BMAX+1 is 16 */
3445 c[*p++]++; /* assume all entries <= BMAX */
3447 if ( c[0] == n ) { /* null input--all zero length codes */
3448 *t = (inflate_huft *)Z_NULL;
3454 /* Find minimum and maximum length, bound *m by those */
3456 for ( j = 1; j <= BMAX; j++ )
3460 k = j; /* minimum code length */
3461 if ( (uInt)l < j ) {
3464 for ( i = BMAX; i; i-- )
3468 g = i; /* maximum code length */
3469 if ( (uInt)l > i ) {
3475 /* Adjust last length count to fill out codes, if needed */
3476 for ( y = 1 << j; j < i; j++, y <<= 1 )
3477 if ( ( y -= c[j] ) < 0 ) {
3478 return Z_DATA_ERROR;
3480 if ( ( y -= c[i] ) < 0 ) {
3481 return Z_DATA_ERROR;
3486 /* Generate starting offsets into the value table for each length */
3488 p = c + 1; xp = x + 2;
3489 while ( --i ) { /* note that i == g from above */
3490 *xp++ = ( j += *p++ );
3494 /* Make a table of values in order of bit lengths */
3497 if ( ( j = *p++ ) != 0 ) {
3500 } while ( ++i < n );
3501 n = x[g]; /* set n to length of v */
3504 /* Generate the Huffman codes and for each, make the table entries */
3505 x[0] = i = 0; /* first Huffman code is zero */
3506 p = v; /* grab values in bit order */
3507 h = -1; /* no tables yet--level -1 */
3508 w = -l; /* bits decoded == (l * h) */
3509 u[0] = (inflate_huft *)Z_NULL; /* just to keep compilers happy */
3510 q = (inflate_huft *)Z_NULL; /* ditto */
3513 /* go through the bit lengths (k already is bits in shortest code) */
3514 for (; k <= g; k++ )
3519 /* here i is the Huffman code of length k bits for value *p */
3520 /* make tables up to required level */
3524 w += l; /* previous table always l bits */
3526 /* compute minimum size table less than or equal to l bits */
3528 z = z > (uInt)l ? l : z; /* table size upper limit */
3529 if ( ( f = 1 << ( j = k - w ) ) > a + 1 ) { /* try a k-w bit table */
3530 /* too few codes for k-w bit table */
3531 f -= a + 1; /* deduct codes from patterns left */
3534 while ( ++j < z ) /* try smaller tables up to z bits */
3536 if ( ( f <<= 1 ) <= *++xp ) {
3537 break; /* enough codes to use up j bits */
3539 f -= *xp; /* else deduct codes from patterns */
3543 z = 1 << j; /* table entries for j-bit table */
3545 /* allocate new table */
3546 if ( *hn + z > MANY ) { /* (note: doesn't matter for fixed) */
3547 return Z_MEM_ERROR; /* not enough memory */
3549 u[h] = q = hp + *hn;
3552 /* connect to last table, if there is one */
3554 x[h] = i; /* save pattern for backing up */
3555 r.bits = (Byte)l; /* bits to dump before this table */
3556 r.exop = (Byte)j; /* bits in this table */
3558 r.base = (uInt)( q - u[h - 1] - j ); /* offset to this table */
3559 u[h - 1][j] = r; /* connect to last table */
3562 *t = q; /* first table is returned result */
3566 /* set up table entry in r */
3567 r.bits = (Byte)( k - w );
3569 r.exop = 128 + 64; /* out of values--invalid code */
3571 else if ( *p < s ) {
3572 r.exop = (Byte)( *p < 256 ? 0 : 32 + 64 ); /* 256 is end-of-block */
3573 r.base = *p++; /* simple code is just the value */
3577 r.exop = (Byte)( e[*p - s] + 16 + 64 ); /* non-simple--look up in lists */
3578 r.base = d[*p++ - s];
3581 /* fill code-like entries with r */
3583 for ( j = i >> w; j < z; j += f )
3586 /* backwards increment the k-bit code i */
3587 for ( j = 1 << ( k - 1 ); i &j; j >>= 1 )
3591 /* backup over finished tables */
3592 mask = ( 1 << w ) - 1; /* needed on HP, cc -O bug */
3593 while ( ( i & mask ) != x[h] )
3595 h--; /* don't need to update q */
3597 mask = ( 1 << w ) - 1;
3603 /* Return Z_BUF_ERROR if we were given an incomplete table */
3604 return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK;
3609 int inflate_trees_bits( uInt *c, uInt *bb, inflate_huft * *tb, inflate_huft *hp, z_streamp z ){
3610 //uInt *c; /* 19 code lengths */
3611 //uInt *bb; /* bits tree desired/actual depth */
3612 //inflate_huft * *tb; /* bits tree result */
3613 //inflate_huft *hp; /* space for trees */
3614 //z_streamp z; /* for messages */
3616 uInt hn = 0; /* hufts used in space */
3617 uInt *v; /* work area for huft_build */
3619 if ( ( v = (uInt*)ZALLOC( z, 19, sizeof( uInt ) ) ) == Z_NULL ) {
3622 r = huft_build( c, 19, 19, (uInt*)Z_NULL, (uInt*)Z_NULL,
3623 tb, bb, hp, &hn, v );
3624 if ( r == Z_DATA_ERROR ) {
3625 z->msg = (char*)"oversubscribed dynamic bit lengths tree";
3627 else if ( r == Z_BUF_ERROR || *bb == 0 ) {
3628 z->msg = (char*)"incomplete dynamic bit lengths tree";
3637 int inflate_trees_dynamic( uInt nl, uInt nd, uInt *c, uInt *bl, uInt *bd, inflate_huft * *tl, inflate_huft * *td, inflate_huft *hp, z_streamp z ){
3638 //uInt nl; /* number of literal/length codes */
3639 //uInt nd; /* number of distance codes */
3640 //uInt *c; /* that many (total) code lengths */
3641 //uInt *bl; /* literal desired/actual bit depth */
3642 //uInt *bd; /* distance desired/actual bit depth */
3643 //inflate_huft * *tl; /* literal/length tree result */
3644 //inflate_huft * *td; /* distance tree result */
3645 //inflate_huft *hp; /* space for trees */
3646 //z_streamp z; /* for messages */
3648 uInt hn = 0; /* hufts used in space */
3649 uInt *v; /* work area for huft_build */
3651 /* allocate work area */
3652 if ( ( v = (uInt*)ZALLOC( z, 288, sizeof( uInt ) ) ) == Z_NULL ) {
3656 /* build literal/length tree */
3657 r = huft_build( c, nl, 257, cplens, cplext, tl, bl, hp, &hn, v );
3658 if ( r != Z_OK || *bl == 0 ) {
3659 if ( r == Z_DATA_ERROR ) {
3660 z->msg = (char*)"oversubscribed literal/length tree";
3662 else if ( r != Z_MEM_ERROR ) {
3663 z->msg = (char*)"incomplete literal/length tree";
3670 /* build distance tree */
3671 r = huft_build( c + nl, nd, 0, cpdist, cpdext, td, bd, hp, &hn, v );
3672 if ( r != Z_OK || ( *bd == 0 && nl > 257 ) ) {
3673 if ( r == Z_DATA_ERROR ) {
3674 z->msg = (char*)"oversubscribed distance tree";
3676 else if ( r == Z_BUF_ERROR ) {
3677 #ifdef PKZIP_BUG_WORKAROUND
3681 z->msg = (char*)"incomplete distance tree";
3684 else if ( r != Z_MEM_ERROR ) {
3685 z->msg = (char*)"empty distance tree with lengths";
3699 /* inffixed.h -- table for decoding fixed codes
3700 * Generated automatically by the maketree.c program
3703 /* WARNING: this file should *not* be used by applications. It is
3704 part of the implementation of the compression library and is
3705 subject to change. Applications should only use zlib.h.
3708 static uInt fixed_bl = 9;
3709 static uInt fixed_bd = 5;
3710 static inflate_huft fixed_tl[] = {
3711 {{{96,7}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115},
3712 {{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},192},
3713 {{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},160},
3714 {{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},224},
3715 {{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},144},
3716 {{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},208},
3717 {{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},176},
3718 {{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},240},
3719 {{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227},
3720 {{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},200},
3721 {{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},168},
3722 {{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},232},
3723 {{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},152},
3724 {{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},216},
3725 {{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},184},
3726 {{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},248},
3727 {{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163},
3728 {{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},196},
3729 {{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},164},
3730 {{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},228},
3731 {{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},148},
3732 {{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},212},
3733 {{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},180},
3734 {{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},244},
3735 {{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0},
3736 {{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},204},
3737 {{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},172},
3738 {{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},236},
3739 {{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},156},
3740 {{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},220},
3741 {{{82,7}},27}, {{{0,8}},110}, {{{0,8}},46}, {{{0,9}},188},
3742 {{{0,8}},14}, {{{0,8}},142}, {{{0,8}},78}, {{{0,9}},252},
3743 {{{96,7}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131},
3744 {{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},194},
3745 {{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},162},
3746 {{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},226},
3747 {{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},146},
3748 {{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},210},
3749 {{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},178},
3750 {{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},242},
3751 {{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258},
3752 {{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},202},
3753 {{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},170},
3754 {{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},234},
3755 {{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},154},
3756 {{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},218},
3757 {{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},186},
3758 {{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},250},
3759 {{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195},
3760 {{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},198},
3761 {{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},166},
3762 {{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},230},
3763 {{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},150},
3764 {{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},214},
3765 {{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},182},
3766 {{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},246},
3767 {{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0},
3768 {{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},206},
3769 {{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},174},
3770 {{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},238},
3771 {{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},158},
3772 {{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},222},
3773 {{{82,7}},27}, {{{0,8}},111}, {{{0,8}},47}, {{{0,9}},190},
3774 {{{0,8}},15}, {{{0,8}},143}, {{{0,8}},79}, {{{0,9}},254},
3775 {{{96,7}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115},
3776 {{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},193},
3777 {{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},161},
3778 {{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},225},
3779 {{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},145},
3780 {{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},209},
3781 {{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},177},
3782 {{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},241},
3783 {{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227},
3784 {{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},201},
3785 {{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},169},
3786 {{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},233},
3787 {{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},153},
3788 {{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},217},
3789 {{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},185},
3790 {{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},249},
3791 {{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163},
3792 {{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},197},
3793 {{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},165},
3794 {{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},229},
3795 {{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},149},
3796 {{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},213},
3797 {{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},181},
3798 {{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},245},
3799 {{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0},
3800 {{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},205},
3801 {{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},173},
3802 {{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},237},
3803 {{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},157},
3804 {{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},221},
3805 {{{82,7}},27}, {{{0,8}},110}, {{{0,8}},46}, {{{0,9}},189},
3806 {{{0,8}},14}, {{{0,8}},142}, {{{0,8}},78}, {{{0,9}},253},
3807 {{{96,7}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131},
3808 {{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},195},
3809 {{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},163},
3810 {{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},227},
3811 {{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},147},
3812 {{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},211},
3813 {{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},179},
3814 {{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},243},
3815 {{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258},
3816 {{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},203},
3817 {{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},171},
3818 {{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},235},
3819 {{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},155},
3820 {{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},219},
3821 {{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},187},
3822 {{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},251},
3823 {{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195},
3824 {{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},199},
3825 {{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},167},
3826 {{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},231},
3827 {{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},151},
3828 {{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},215},
3829 {{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},183},
3830 {{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},247},
3831 {{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0},
3832 {{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},207},
3833 {{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},175},
3834 {{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},239},
3835 {{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},159},
3836 {{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},223},
3837 {{{82,7}},27}, {{{0,8}},111}, {{{0,8}},47}, {{{0,9}},191},
3838 {{{0,8}},15}, {{{0,8}},143}, {{{0,8}},79}, {{{0,9}},255}
3840 static inflate_huft fixed_td[] = {
3841 {{{80,5}},1}, {{{87,5}},257}, {{{83,5}},17}, {{{91,5}},4097},
3842 {{{81,5}},5}, {{{89,5}},1025}, {{{85,5}},65}, {{{93,5}},16385},
3843 {{{80,5}},3}, {{{88,5}},513}, {{{84,5}},33}, {{{92,5}},8193},
3844 {{{82,5}},9}, {{{90,5}},2049}, {{{86,5}},129}, {{{192,5}},24577},
3845 {{{80,5}},2}, {{{87,5}},385}, {{{83,5}},25}, {{{91,5}},6145},
3846 {{{81,5}},7}, {{{89,5}},1537}, {{{85,5}},97}, {{{93,5}},24577},
3847 {{{80,5}},4}, {{{88,5}},769}, {{{84,5}},49}, {{{92,5}},12289},
3848 {{{82,5}},13}, {{{90,5}},3073}, {{{86,5}},193}, {{{192,5}},24577}
3852 int inflate_trees_fixed( uInt *bl, uInt *bd, inflate_huft * *tl, inflate_huft * *td, z_streamp z ){
3853 //uInt *bl; /* literal desired/actual bit depth */
3854 //uInt *bd; /* distance desired/actual bit depth */
3855 //inflate_huft * *tl; /* literal/length tree result */
3856 //inflate_huft * *td; /* distance tree result */
3857 //z_streamp z; /* for memory allocation */
3866 /* simplify the use of the inflate_huft type with some defines */
3867 #define exop word.what.Exop
3868 #define bits word.what.Bits
3870 /* macros for bit input with no checking and for returning unused bytes */
3871 #define GRABBITS( j ) {while ( k < ( j ) ) {b |= ( (uLong)NEXTBYTE ) << k; k += 8; }}
3872 #define UNGRAB {c = z->avail_in - n; c = ( k >> 3 ) < c ? k >> 3 : c; n += c; p -= c; k -= c << 3; }
3874 /* Called with number of bytes left to write in window at least 258
3875 (the maximum string length) and number of input bytes available
3876 at least ten. The ten bytes are six bytes for the longest length/
3877 distance pair plus four bytes for overloading the bit buffer. */
3880 int inflate_fast( uInt bl, uInt bd, inflate_huft *tl, inflate_huft *td, inflate_blocks_statef *s, z_streamp z ){
3881 inflate_huft *t; /* temporary pointer */
3882 uInt e; /* extra bits or operation */
3883 uLong b; /* bit buffer */
3884 uInt k; /* bits in bit buffer */
3885 Byte *p; /* input data pointer */
3886 uInt n; /* bytes available there */
3887 Byte *q; /* output window write pointer */
3888 uInt m; /* bytes to end of window or read pointer */
3889 uInt ml; /* mask for literal/length tree */
3890 uInt md; /* mask for distance tree */
3891 uInt c; /* bytes to copy */
3892 uInt d; /* distance back to copy from */
3893 Byte *r; /* copy source pointer */
3895 /* load input, output, bit values */
3898 /* initialize masks */
3899 ml = inflate_mask[bl];
3900 md = inflate_mask[bd];
3902 /* do until not enough input or output space for fast loop */
3903 do { /* assume called with m >= 258 && n >= 10 */
3904 /* get literal/length code */
3905 GRABBITS( 20 ) /* max bits for literal/length code */
3906 if ( ( e = ( t = tl + ( (uInt)b & ml ) )->exop ) == 0 ) {
3908 Tracevv( ( t->base >= 0x20 && t->base < 0x7f ?
3909 "inflate: * literal '%c'\n" :
3910 "inflate: * literal 0x%02x\n", t->base ) );
3911 *q++ = (Byte)t->base;
3918 /* get extra bits for length */
3920 c = t->base + ( (uInt)b & inflate_mask[e] );
3922 Tracevv( ( "inflate: * length %u\n", c ) );
3924 /* decode distance base of block to copy */
3925 GRABBITS( 15 ); /* max bits for distance code */
3926 e = ( t = td + ( (uInt)b & md ) )->exop;
3930 /* get extra bits to add to distance base */
3932 GRABBITS( e ) /* get extra bits (up to 13) */
3933 d = t->base + ( (uInt)b & inflate_mask[e] );
3935 Tracevv( ( "inflate: * distance %u\n", d ) );
3939 if ( (uInt)( q - s->window ) >= d ) { /* offset before dest */
3942 *q++ = *r++; c--; /* minimum count is three, */
3943 *q++ = *r++; c--; /* so unroll loop a little */
3945 else /* else offset after destination */
3947 e = d - (uInt)( q - s->window ); /* bytes from offset to end */
3948 r = s->end - e; /* pointer to offset */
3949 if ( c > e ) { /* if source crosses, */
3950 c -= e; /* copy to end of window */
3954 r = s->window; /* copy rest from start of window */
3957 do { /* copy all or what's left */
3962 else if ( ( e & 64 ) == 0 ) {
3964 e = ( t += ( (uInt)b & inflate_mask[e] ) )->exop;
3968 z->msg = (char*)"invalid distance code";
3971 return Z_DATA_ERROR;
3976 if ( ( e & 64 ) == 0 ) {
3978 if ( ( e = ( t += ( (uInt)b & inflate_mask[e] ) )->exop ) == 0 ) {
3980 Tracevv( ( t->base >= 0x20 && t->base < 0x7f ?
3981 "inflate: * literal '%c'\n" :
3982 "inflate: * literal 0x%02x\n", t->base ) );
3983 *q++ = (Byte)t->base;
3988 else if ( e & 32 ) {
3989 Tracevv( ( "inflate: * end of block\n" ) );
3992 return Z_STREAM_END;
3996 z->msg = (char*)"invalid literal/length code";
3999 return Z_DATA_ERROR;
4002 } while ( m >= 258 && n >= 10 );
4004 /* not enough input or output--restore pointers and return */
4011 /* infcodes.c -- process literals and length/distance pairs
4012 * Copyright (C) 1995-1998 Mark Adler
4013 * For conditions of distribution and use, see copyright notice in zlib.h
4016 /* simplify the use of the inflate_huft type with some defines */
4017 #define exop word.what.Exop
4018 #define bits word.what.Bits
4020 typedef enum { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */
4021 START, /* x: set up for LEN */
4022 LEN, /* i: get length/literal/eob next */
4023 LENEXT, /* i: getting length extra (have base) */
4024 DIST, /* i: get distance next */
4025 DISTEXT, /* i: getting distance extra */
4026 COPY, /* o: copying bytes in window, waiting for space */
4027 LIT, /* o: got literal, waiting for output space */
4028 WASH, /* o: got eob, possibly still output waiting */
4029 END, /* x: got eob and all data flushed */
4031 } /* x: got error */
4034 /* inflate codes private state */
4035 struct inflate_codes_state {
4038 inflate_codes_mode mode; /* current inflate_codes mode */
4040 /* mode dependent information */
4044 inflate_huft *tree; /* pointer into tree */
4045 uInt need; /* bits needed */
4046 } code; /* if LEN or DIST, where in tree */
4047 uInt lit; /* if LIT, literal */
4049 uInt get; /* bits to get for extra */
4050 uInt dist; /* distance back to copy from */
4051 } copy; /* if EXT or COPY, where and how much */
4052 } sub; /* submode */
4054 /* mode independent information */
4055 Byte lbits; /* ltree bits decoded per branch */
4056 Byte dbits; /* dtree bits decoder per branch */
4057 inflate_huft *ltree; /* literal/length/eob tree */
4058 inflate_huft *dtree; /* distance tree */
4063 inflate_codes_statef *inflate_codes_new( uInt bl, uInt bd, inflate_huft *tl, inflate_huft *td, z_streamp z ){
4064 inflate_codes_statef *c;
4066 if ( ( c = (inflate_codes_statef *)
4067 ZALLOC( z,1,sizeof( struct inflate_codes_state ) ) ) != Z_NULL ) {
4069 c->lbits = (Byte)bl;
4070 c->dbits = (Byte)bd;
4073 Tracev( ( "inflate: codes new\n" ) );
4080 int inflate_codes( inflate_blocks_statef *s, z_streamp z, int r ){
4081 uInt j; /* temporary storage */
4082 inflate_huft *t; /* temporary pointer */
4083 uInt e; /* extra bits or operation */
4084 uLong b; /* bit buffer */
4085 uInt k; /* bits in bit buffer */
4086 Byte *p; /* input data pointer */
4087 uInt n; /* bytes available there */
4088 Byte *q; /* output window write pointer */
4089 uInt m; /* bytes to end of window or read pointer */
4090 Byte *f; /* pointer to copy strings from */
4091 inflate_codes_statef *c = s->sub.decode.codes; /* codes state */
4093 /* copy input/output information to locals (UPDATE macro restores) */
4096 /* process input and output based on current state */
4097 while ( 1 ) switch ( c->mode )
4098 { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */
4099 case START: /* x: set up for LEN */
4101 if ( m >= 258 && n >= 10 ) {
4103 r = inflate_fast( c->lbits, c->dbits, c->ltree, c->dtree, s, z );
4106 c->mode = r == Z_STREAM_END ? WASH : BADCODE;
4111 c->sub.code.need = c->lbits;
4112 c->sub.code.tree = c->ltree;
4114 case LEN: /* i: get length/literal/eob next */
4115 j = c->sub.code.need;
4117 t = c->sub.code.tree + ( (uInt)b & inflate_mask[j] );
4119 e = (uInt)( t->exop );
4120 if ( e == 0 ) { /* literal */
4121 c->sub.lit = t->base;
4122 Tracevv( ( t->base >= 0x20 && t->base < 0x7f ?
4123 "inflate: literal '%c'\n" :
4124 "inflate: literal 0x%02x\n", t->base ) );
4128 if ( e & 16 ) { /* length */
4129 c->sub.copy.get = e & 15;
4134 if ( ( e & 64 ) == 0 ) { /* next table */
4135 c->sub.code.need = e;
4136 c->sub.code.tree = t + t->base;
4139 if ( e & 32 ) { /* end of block */
4140 Tracevv( ( "inflate: end of block\n" ) );
4144 c->mode = BADCODE; /* invalid code */
4145 z->msg = (char*)"invalid literal/length code";
4148 case LENEXT: /* i: getting length extra (have base) */
4149 j = c->sub.copy.get;
4151 c->len += (uInt)b & inflate_mask[j];
4153 c->sub.code.need = c->dbits;
4154 c->sub.code.tree = c->dtree;
4155 Tracevv( ( "inflate: length %u\n", c->len ) );
4157 case DIST: /* i: get distance next */
4158 j = c->sub.code.need;
4160 t = c->sub.code.tree + ( (uInt)b & inflate_mask[j] );
4162 e = (uInt)( t->exop );
4163 if ( e & 16 ) { /* distance */
4164 c->sub.copy.get = e & 15;
4165 c->sub.copy.dist = t->base;
4169 if ( ( e & 64 ) == 0 ) { /* next table */
4170 c->sub.code.need = e;
4171 c->sub.code.tree = t + t->base;
4174 c->mode = BADCODE; /* invalid code */
4175 z->msg = (char*)"invalid distance code";
4178 case DISTEXT: /* i: getting distance extra */
4179 j = c->sub.copy.get;
4181 c->sub.copy.dist += (uInt)b & inflate_mask[j];
4183 Tracevv( ( "inflate: distance %u\n", c->sub.copy.dist ) );
4185 case COPY: /* o: copying bytes in window, waiting for space */
4186 #ifndef __TURBOC__ /* Turbo C bug for following expression */
4187 f = (uInt)( q - s->window ) < c->sub.copy.dist ?
4188 s->end - ( c->sub.copy.dist - ( q - s->window ) ) :
4189 q - c->sub.copy.dist;
4191 f = q - c->sub.copy.dist;
4192 if ( (uInt)( q - s->window ) < c->sub.copy.dist ) {
4193 f = s->end - ( c->sub.copy.dist - (uInt)( q - s->window ) );
4200 if ( f == s->end ) {
4207 case LIT: /* o: got literal, waiting for output space */
4209 OUTBYTE( c->sub.lit )
4212 case WASH: /* o: got eob, possibly more output */
4213 if ( k > 7 ) { /* return unused byte, if any */
4214 Assert( k < 16, "inflate_codes grabbed too many bytes" )
4217 p--; /* can always return one */
4220 if ( s->read != s->write ) {
4227 case BADCODE: /* x: got error */
4234 #ifdef NEED_DUMMY_RETURN
4235 return Z_STREAM_ERROR; /* Some dumb compilers complain without this */
4241 void inflate_codes_free( inflate_codes_statef *c, z_streamp z ){
4243 Tracev( ( "inflate: codes free\n" ) );
4247 /* adler32.c -- compute the Adler-32 checksum of a data stream
4248 * Copyright (C) 1995-1998 Mark Adler
4249 * For conditions of distribution and use, see copyright notice in zlib.h
4252 #define BASE 65521L /* largest prime smaller than 65536 */
4254 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
4261 #define DO1( buf,i ) {s1 += buf[i]; s2 += s1; }
4262 #define DO2( buf,i ) DO1( buf,i ); DO1( buf,i + 1 );
4263 #define DO4( buf,i ) DO2( buf,i ); DO2( buf,i + 2 );
4264 #define DO8( buf,i ) DO4( buf,i ); DO4( buf,i + 4 );
4265 #define DO16( buf ) DO8( buf,0 ); DO8( buf,8 );
4267 /* ========================================================================= */
4269 uLong adler32( uLong adler, const Byte *buf, uInt len ){
4270 unsigned long s1 = adler & 0xffff;
4271 unsigned long s2 = ( adler >> 16 ) & 0xffff;
4274 if ( buf == Z_NULL ) {
4279 k = len < NMAX ? len : NMAX;
4295 return ( s2 << 16 ) | s1;
4300 /* infblock.h -- header to use infblock.c
4301 * Copyright (C) 1995-1998 Mark Adler
4302 * For conditions of distribution and use, see copyright notice in zlib.h
4305 /* WARNING: this file should *not* be used by applications. It is
4306 part of the implementation of the compression library and is
4307 subject to change. Applications should only use zlib.h.
4310 extern inflate_blocks_statef * inflate_blocks_new OF( (
4312 check_func c, /* check function */
4313 uInt w ) ); /* window size */
4315 extern int inflate_blocks OF( (
4316 inflate_blocks_statef *,
4318 int ) ); /* initial return code */
4320 extern void inflate_blocks_reset OF( (
4321 inflate_blocks_statef *,
4323 uLong * ) ); /* check value on output */
4325 extern int inflate_blocks_free OF( (
4326 inflate_blocks_statef *,
4329 extern void inflate_set_dictionary OF( (
4330 inflate_blocks_statef * s,
4331 const Byte * d, /* dictionary */
4332 uInt n ) ); /* dictionary length */
4334 extern int inflate_blocks_sync_point OF( (
4335 inflate_blocks_statef * s ) );
4338 imMETHOD, /* waiting for method byte */
4339 imFLAG, /* waiting for flag byte */
4340 imDICT4, /* four dictionary check bytes to go */
4341 imDICT3, /* three dictionary check bytes to go */
4342 imDICT2, /* two dictionary check bytes to go */
4343 imDICT1, /* one dictionary check byte to go */
4344 imDICT0, /* waiting for inflateSetDictionary */
4345 imBLOCKS, /* decompressing blocks */
4346 imCHECK4, /* four check bytes to go */
4347 imCHECK3, /* three check bytes to go */
4348 imCHECK2, /* two check bytes to go */
4349 imCHECK1, /* one check byte to go */
4350 imDONE, /* finished check, done */
4352 } /* got an error--stay here */
4355 /* inflate private state */
4356 struct internal_state {
4359 inflate_mode mode; /* current inflate mode */
4361 /* mode dependent information */
4363 uInt method; /* if FLAGS, method byte */
4365 uLong was; /* computed check value */
4366 uLong need; /* stream check value */
4367 } check; /* if CHECK, check values to compare */
4368 uInt marker; /* if BAD, inflateSync's marker bytes count */
4369 } sub; /* submode */
4371 /* mode independent information */
4372 int nowrap; /* flag for no wrapper */
4373 uInt wbits; /* log2(window size) (8..15, defaults to 15) */
4374 inflate_blocks_statef
4375 *blocks; /* current inflate_blocks state */
4381 int inflateReset( z_streamp z ){
4382 if ( z == Z_NULL || z->state == Z_NULL ) {
4383 return Z_STREAM_ERROR;
4385 z->total_in = z->total_out = 0;
4387 z->state->mode = z->state->nowrap ? imBLOCKS : imMETHOD;
4388 inflate_blocks_reset( z->state->blocks, z, Z_NULL );
4389 Tracev( ( "inflate: reset\n" ) );
4395 int inflateEnd( z_streamp z ){
4396 if ( z == Z_NULL || z->state == Z_NULL || z->zfree == Z_NULL ) {
4397 return Z_STREAM_ERROR;
4399 if ( z->state->blocks != Z_NULL ) {
4400 inflate_blocks_free( z->state->blocks, z );
4402 ZFREE( z, z->state );
4404 Tracev( ( "inflate: end\n" ) );
4410 int inflateInit2_( z_streamp z, int w, const char *version, int stream_size ){
4411 if ( version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
4412 stream_size != sizeof( z_stream ) ) {
4413 return Z_VERSION_ERROR;
4416 /* initialize state */
4417 if ( z == Z_NULL ) {
4418 return Z_STREAM_ERROR;
4421 if ( z->zalloc == Z_NULL ) {
4422 z->zalloc = ( void *( * )( void *, unsigned, unsigned ) )zcalloc;
4423 z->opaque = (voidp)0;
4425 if ( z->zfree == Z_NULL ) {
4426 z->zfree = ( void ( * )( void *, void * ) )zcfree;
4428 if ( ( z->state = (struct internal_state *)
4429 ZALLOC( z,1,sizeof( struct internal_state ) ) ) == Z_NULL ) {
4432 z->state->blocks = Z_NULL;
4434 /* handle undocumented nowrap option (no zlib header or check) */
4435 z->state->nowrap = 0;
4438 z->state->nowrap = 1;
4441 /* set window size */
4442 if ( w < 8 || w > 15 ) {
4444 return Z_STREAM_ERROR;
4446 z->state->wbits = (uInt)w;
4448 /* create inflate_blocks state */
4449 if ( ( z->state->blocks =
4450 inflate_blocks_new( z, z->state->nowrap ? Z_NULL : adler32, (uInt)1 << w ) )
4455 Tracev( ( "inflate: allocated\n" ) );
4464 int inflateInit_( z_streamp z, const char *version, int stream_size ){
4465 return inflateInit2_( z, DEF_WBITS, version, stream_size );
4469 #define iNEEDBYTE {if ( z->avail_in == 0 ) {return r; } r = f; }
4470 #define iNEXTBYTE ( z->avail_in--,z->total_in++,*z->next_in++ )
4473 int inflate( z_streamp z, int f ){
4477 if ( z == Z_NULL || z->state == Z_NULL || z->next_in == Z_NULL ) {
4478 return Z_STREAM_ERROR;
4480 f = f == Z_FINISH ? Z_BUF_ERROR : Z_OK;
4482 while ( 1 ) switch ( z->state->mode )
4486 if ( ( ( z->state->sub.method = iNEXTBYTE ) & 0xf ) != Z_DEFLATED ) {
4487 z->state->mode = imBAD;
4488 z->msg = (char*)"unknown compression method";
4489 z->state->sub.marker = 5; /* can't try inflateSync */
4492 if ( ( z->state->sub.method >> 4 ) + 8 > z->state->wbits ) {
4493 z->state->mode = imBAD;
4494 z->msg = (char*)"invalid window size";
4495 z->state->sub.marker = 5; /* can't try inflateSync */
4498 z->state->mode = imFLAG;
4502 if ( ( ( z->state->sub.method << 8 ) + b ) % 31 ) {
4503 z->state->mode = imBAD;
4504 z->msg = (char*)"incorrect header check";
4505 z->state->sub.marker = 5; /* can't try inflateSync */
4508 Tracev( ( "inflate: zlib header ok\n" ) );
4509 if ( !( b & PRESET_DICT ) ) {
4510 z->state->mode = imBLOCKS;
4513 z->state->mode = imDICT4;
4516 z->state->sub.check.need = (uLong)iNEXTBYTE << 24;
4517 z->state->mode = imDICT3;
4520 z->state->sub.check.need += (uLong)iNEXTBYTE << 16;
4521 z->state->mode = imDICT2;
4524 z->state->sub.check.need += (uLong)iNEXTBYTE << 8;
4525 z->state->mode = imDICT1;
4528 z->state->sub.check.need += (uLong)iNEXTBYTE;
4529 z->adler = z->state->sub.check.need;
4530 z->state->mode = imDICT0;
4533 z->state->mode = imBAD;
4534 z->msg = (char*)"need dictionary";
4535 z->state->sub.marker = 0; /* can try inflateSync */
4536 return Z_STREAM_ERROR;
4538 r = inflate_blocks( z->state->blocks, z, r );
4539 if ( r == Z_DATA_ERROR ) {
4540 z->state->mode = imBAD;
4541 z->state->sub.marker = 0; /* can try inflateSync */
4547 if ( r != Z_STREAM_END ) {
4551 inflate_blocks_reset( z->state->blocks, z, &z->state->sub.check.was );
4552 if ( z->state->nowrap ) {
4553 z->state->mode = imDONE;
4556 z->state->mode = imCHECK4;
4559 z->state->sub.check.need = (uLong)iNEXTBYTE << 24;
4560 z->state->mode = imCHECK3;
4563 z->state->sub.check.need += (uLong)iNEXTBYTE << 16;
4564 z->state->mode = imCHECK2;
4567 z->state->sub.check.need += (uLong)iNEXTBYTE << 8;
4568 z->state->mode = imCHECK1;
4571 z->state->sub.check.need += (uLong)iNEXTBYTE;
4573 if ( z->state->sub.check.was != z->state->sub.check.need ) {
4574 z->state->mode = imBAD;
4575 z->msg = (char*)"incorrect data check";
4576 z->state->sub.marker = 5; /* can't try inflateSync */
4579 Tracev( ( "inflate: zlib check ok\n" ) );
4580 z->state->mode = imDONE;
4582 return Z_STREAM_END;
4584 return Z_DATA_ERROR;
4586 return Z_STREAM_ERROR;
4588 #ifdef NEED_DUMMY_RETURN
4589 return Z_STREAM_ERROR; /* Some dumb compilers complain without this */
4595 int inflateSetDictionary( z_streamp z, const Byte *dictionary, uInt dictLength ){
4596 uInt length = dictLength;
4598 if ( z == Z_NULL || z->state == Z_NULL || z->state->mode != imDICT0 ) {
4599 return Z_STREAM_ERROR;
4602 if ( adler32( 1L, dictionary, dictLength ) != z->adler ) {
4603 return Z_DATA_ERROR;
4607 if ( length >= ( (uInt)1 << z->state->wbits ) ) {
4608 length = ( 1 << z->state->wbits ) - 1;
4609 dictionary += dictLength - length;
4611 inflate_set_dictionary( z->state->blocks, dictionary, length );
4612 z->state->mode = imBLOCKS;
4618 int inflateSync( z_streamp z ){
4619 uInt n; /* number of bytes to look at */
4620 Byte *p; /* pointer to bytes */
4621 uInt m; /* number of marker bytes found in a row */
4622 uLong r, w; /* temporaries to save total_in and total_out */
4625 if ( z == Z_NULL || z->state == Z_NULL ) {
4626 return Z_STREAM_ERROR;
4628 if ( z->state->mode != imBAD ) {
4629 z->state->mode = imBAD;
4630 z->state->sub.marker = 0;
4632 if ( ( n = z->avail_in ) == 0 ) {
4636 m = z->state->sub.marker;
4639 while ( n && m < 4 )
4641 static const Byte mark[4] = {0, 0, 0xff, 0xff};
4642 if ( *p == mark[m] ) {
4655 z->total_in += p - z->next_in;
4658 z->state->sub.marker = m;
4660 /* return no joy or set up to restart on a new block */
4662 return Z_DATA_ERROR;
4664 r = z->total_in; w = z->total_out;
4666 z->total_in = r; z->total_out = w;
4667 z->state->mode = imBLOCKS;
4672 /* Returns true if inflate is currently at the end of a block generated
4673 * by Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP
4674 * implementation to provide an additional safety check. PPP uses Z_SYNC_FLUSH
4675 * but removes the length bytes of the resulting empty stored block. When
4676 * decompressing, PPP checks that at the end of input packet, inflate is
4677 * waiting for these length bytes.
4680 int inflateSyncPoint( z_streamp z ){
4681 if ( z == Z_NULL || z->state == Z_NULL || z->state->blocks == Z_NULL ) {
4682 return Z_STREAM_ERROR;
4684 return inflate_blocks_sync_point( z->state->blocks );
4689 voidp zcalloc( voidp opaque, unsigned items, unsigned size ){
4691 items += size - size; /* make compiler happy */
4693 return (voidp)safe_malloc( items * size );
4696 void zcfree( voidp opaque, voidp ptr ){
4699 return; /* make compiler happy */