mirror of https://github.com/lukechilds/node.git
isaacs
13 years ago
committed by
Ryan Dahl
Ryan Dahl
49 changed files with 17615 additions and 7 deletions
@ -0,0 +1,25 @@ |
|||
/* zlib.h -- interface of the 'zlib' general purpose compression library |
|||
version 1.2.4, March 14th, 2010 |
|||
|
|||
Copyright (C) 1995-2010 Jean-loup Gailly and Mark Adler |
|||
|
|||
This software is provided 'as-is', without any express or implied |
|||
warranty. In no event will the authors be held liable for any damages |
|||
arising from the use of this software. |
|||
|
|||
Permission is granted to anyone to use this software for any purpose, |
|||
including commercial applications, and to alter it and redistribute it |
|||
freely, subject to the following restrictions: |
|||
|
|||
1. The origin of this software must not be misrepresented; you must not |
|||
claim that you wrote the original software. If you use this software |
|||
in a product, an acknowledgment in the product documentation would be |
|||
appreciated but is not required. |
|||
2. Altered source versions must be plainly marked as such, and must not be |
|||
misrepresented as being the original software. |
|||
3. This notice may not be removed or altered from any source distribution. |
|||
|
|||
Jean-loup Gailly |
|||
Mark Adler |
|||
|
|||
*/ |
|||
@ -0,0 +1,12 @@ |
|||
Name: zlib |
|||
URL: http://zlib.net/ |
|||
Version: 1.2.3 |
|||
|
|||
Description: |
|||
General purpose compression library |
|||
|
|||
Local Modifications: |
|||
A few minor changes, all marked with "Google": |
|||
- Added #ifdefs to avoid compile warnings when NO_GZCOMPRESS is defined. |
|||
- Removed use of strerror for WinCE in gzio.c. |
|||
- Added 'int z_errno' global for WinCE, to which 'errno' is defined in zutil.h. |
|||
@ -0,0 +1,149 @@ |
|||
/* adler32.c -- compute the Adler-32 checksum of a data stream
|
|||
* Copyright (C) 1995-2004 Mark Adler |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* @(#) $Id: adler32.c,v 3.6 2005/08/04 19:14:14 tor%cs.brown.edu Exp $ */ |
|||
|
|||
#define ZLIB_INTERNAL |
|||
#include "zlib.h" |
|||
|
|||
#define BASE 65521UL /* largest prime smaller than 65536 */ |
|||
#define NMAX 5552 |
|||
/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ |
|||
|
|||
#define DO1(buf,i) {adler += (buf)[i]; sum2 += adler;} |
|||
#define DO2(buf,i) DO1(buf,i); DO1(buf,i+1); |
|||
#define DO4(buf,i) DO2(buf,i); DO2(buf,i+2); |
|||
#define DO8(buf,i) DO4(buf,i); DO4(buf,i+4); |
|||
#define DO16(buf) DO8(buf,0); DO8(buf,8); |
|||
|
|||
/* use NO_DIVIDE if your processor does not do division in hardware */ |
|||
#ifdef NO_DIVIDE |
|||
# define MOD(a) \ |
|||
do { \ |
|||
if (a >= (BASE << 16)) a -= (BASE << 16); \ |
|||
if (a >= (BASE << 15)) a -= (BASE << 15); \ |
|||
if (a >= (BASE << 14)) a -= (BASE << 14); \ |
|||
if (a >= (BASE << 13)) a -= (BASE << 13); \ |
|||
if (a >= (BASE << 12)) a -= (BASE << 12); \ |
|||
if (a >= (BASE << 11)) a -= (BASE << 11); \ |
|||
if (a >= (BASE << 10)) a -= (BASE << 10); \ |
|||
if (a >= (BASE << 9)) a -= (BASE << 9); \ |
|||
if (a >= (BASE << 8)) a -= (BASE << 8); \ |
|||
if (a >= (BASE << 7)) a -= (BASE << 7); \ |
|||
if (a >= (BASE << 6)) a -= (BASE << 6); \ |
|||
if (a >= (BASE << 5)) a -= (BASE << 5); \ |
|||
if (a >= (BASE << 4)) a -= (BASE << 4); \ |
|||
if (a >= (BASE << 3)) a -= (BASE << 3); \ |
|||
if (a >= (BASE << 2)) a -= (BASE << 2); \ |
|||
if (a >= (BASE << 1)) a -= (BASE << 1); \ |
|||
if (a >= BASE) a -= BASE; \ |
|||
} while (0) |
|||
# define MOD4(a) \ |
|||
do { \ |
|||
if (a >= (BASE << 4)) a -= (BASE << 4); \ |
|||
if (a >= (BASE << 3)) a -= (BASE << 3); \ |
|||
if (a >= (BASE << 2)) a -= (BASE << 2); \ |
|||
if (a >= (BASE << 1)) a -= (BASE << 1); \ |
|||
if (a >= BASE) a -= BASE; \ |
|||
} while (0) |
|||
#else |
|||
# define MOD(a) a %= BASE |
|||
# define MOD4(a) a %= BASE |
|||
#endif |
|||
|
|||
/* ========================================================================= */ |
|||
uLong ZEXPORT adler32(adler, buf, len) |
|||
uLong adler; |
|||
const Bytef *buf; |
|||
uInt len; |
|||
{ |
|||
unsigned long sum2; |
|||
unsigned n; |
|||
|
|||
/* split Adler-32 into component sums */ |
|||
sum2 = (adler >> 16) & 0xffff; |
|||
adler &= 0xffff; |
|||
|
|||
/* in case user likes doing a byte at a time, keep it fast */ |
|||
if (len == 1) { |
|||
adler += buf[0]; |
|||
if (adler >= BASE) |
|||
adler -= BASE; |
|||
sum2 += adler; |
|||
if (sum2 >= BASE) |
|||
sum2 -= BASE; |
|||
return adler | (sum2 << 16); |
|||
} |
|||
|
|||
/* initial Adler-32 value (deferred check for len == 1 speed) */ |
|||
if (buf == Z_NULL) |
|||
return 1L; |
|||
|
|||
/* in case short lengths are provided, keep it somewhat fast */ |
|||
if (len < 16) { |
|||
while (len--) { |
|||
adler += *buf++; |
|||
sum2 += adler; |
|||
} |
|||
if (adler >= BASE) |
|||
adler -= BASE; |
|||
MOD4(sum2); /* only added so many BASE's */ |
|||
return adler | (sum2 << 16); |
|||
} |
|||
|
|||
/* do length NMAX blocks -- requires just one modulo operation */ |
|||
while (len >= NMAX) { |
|||
len -= NMAX; |
|||
n = NMAX / 16; /* NMAX is divisible by 16 */ |
|||
do { |
|||
DO16(buf); /* 16 sums unrolled */ |
|||
buf += 16; |
|||
} while (--n); |
|||
MOD(adler); |
|||
MOD(sum2); |
|||
} |
|||
|
|||
/* do remaining bytes (less than NMAX, still just one modulo) */ |
|||
if (len) { /* avoid modulos if none remaining */ |
|||
while (len >= 16) { |
|||
len -= 16; |
|||
DO16(buf); |
|||
buf += 16; |
|||
} |
|||
while (len--) { |
|||
adler += *buf++; |
|||
sum2 += adler; |
|||
} |
|||
MOD(adler); |
|||
MOD(sum2); |
|||
} |
|||
|
|||
/* return recombined sums */ |
|||
return adler | (sum2 << 16); |
|||
} |
|||
|
|||
/* ========================================================================= */ |
|||
uLong ZEXPORT adler32_combine(adler1, adler2, len2) |
|||
uLong adler1; |
|||
uLong adler2; |
|||
z_off_t len2; |
|||
{ |
|||
unsigned long sum1; |
|||
unsigned long sum2; |
|||
unsigned rem; |
|||
|
|||
/* the derivation of this formula is left as an exercise for the reader */ |
|||
rem = (unsigned)(len2 % BASE); |
|||
sum1 = adler1 & 0xffff; |
|||
sum2 = rem * sum1; |
|||
MOD(sum2); |
|||
sum1 += (adler2 & 0xffff) + BASE - 1; |
|||
sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem; |
|||
if (sum1 > BASE) sum1 -= BASE; |
|||
if (sum1 > BASE) sum1 -= BASE; |
|||
if (sum2 > (BASE << 1)) sum2 -= (BASE << 1); |
|||
if (sum2 > BASE) sum2 -= BASE; |
|||
return sum1 | (sum2 << 16); |
|||
} |
|||
@ -0,0 +1,79 @@ |
|||
/* compress.c -- compress a memory buffer
|
|||
* Copyright (C) 1995-2003 Jean-loup Gailly. |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* @(#) $Id: compress.c,v 3.6 2005/08/04 19:14:14 tor%cs.brown.edu Exp $ */ |
|||
|
|||
#define ZLIB_INTERNAL |
|||
#include "zlib.h" |
|||
|
|||
/* ===========================================================================
|
|||
Compresses the source buffer into the destination buffer. The level |
|||
parameter has the same meaning as in deflateInit. sourceLen is the byte |
|||
length of the source buffer. Upon entry, destLen is the total size of the |
|||
destination buffer, which must be at least 0.1% larger than sourceLen plus |
|||
12 bytes. Upon exit, destLen is the actual size of the compressed buffer. |
|||
|
|||
compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough |
|||
memory, Z_BUF_ERROR if there was not enough room in the output buffer, |
|||
Z_STREAM_ERROR if the level parameter is invalid. |
|||
*/ |
|||
int ZEXPORT compress2 (dest, destLen, source, sourceLen, level) |
|||
Bytef *dest; |
|||
uLongf *destLen; |
|||
const Bytef *source; |
|||
uLong sourceLen; |
|||
int level; |
|||
{ |
|||
z_stream stream; |
|||
int err; |
|||
|
|||
stream.next_in = (Bytef*)source; |
|||
stream.avail_in = (uInt)sourceLen; |
|||
#ifdef MAXSEG_64K |
|||
/* Check for source > 64K on 16-bit machine: */ |
|||
if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR; |
|||
#endif |
|||
stream.next_out = dest; |
|||
stream.avail_out = (uInt)*destLen; |
|||
if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR; |
|||
|
|||
stream.zalloc = (alloc_func)0; |
|||
stream.zfree = (free_func)0; |
|||
stream.opaque = (voidpf)0; |
|||
|
|||
err = deflateInit(&stream, level); |
|||
if (err != Z_OK) return err; |
|||
|
|||
err = deflate(&stream, Z_FINISH); |
|||
if (err != Z_STREAM_END) { |
|||
deflateEnd(&stream); |
|||
return err == Z_OK ? Z_BUF_ERROR : err; |
|||
} |
|||
*destLen = stream.total_out; |
|||
|
|||
err = deflateEnd(&stream); |
|||
return err; |
|||
} |
|||
|
|||
/* ===========================================================================
|
|||
*/ |
|||
int ZEXPORT compress (dest, destLen, source, sourceLen) |
|||
Bytef *dest; |
|||
uLongf *destLen; |
|||
const Bytef *source; |
|||
uLong sourceLen; |
|||
{ |
|||
return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION); |
|||
} |
|||
|
|||
/* ===========================================================================
|
|||
If the default memLevel or windowBits for deflateInit() is changed, then |
|||
this function needs to be updated. |
|||
*/ |
|||
uLong ZEXPORT compressBound (sourceLen) |
|||
uLong sourceLen; |
|||
{ |
|||
return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) + 11; |
|||
} |
|||
@ -0,0 +1,67 @@ |
|||
Change in 1.01e (12 feb 05) |
|||
- Fix in zipOpen2 for globalcomment (Rolf Kalbermatter) |
|||
- Fix possible memory leak in unzip.c (Zoran Stevanovic) |
|||
|
|||
Change in 1.01b (20 may 04) |
|||
- Integrate patch from Debian package (submited by Mark Brown) |
|||
- Add tools mztools from Xavier Roche |
|||
|
|||
Change in 1.01 (8 may 04) |
|||
- fix buffer overrun risk in unzip.c (Xavier Roche) |
|||
- fix a minor buffer insecurity in minizip.c (Mike Whittaker) |
|||
|
|||
Change in 1.00: (10 sept 03) |
|||
- rename to 1.00 |
|||
- cosmetic code change |
|||
|
|||
Change in 0.22: (19 May 03) |
|||
- crypting support (unless you define NOCRYPT) |
|||
- append file in existing zipfile |
|||
|
|||
Change in 0.21: (10 Mar 03) |
|||
- bug fixes |
|||
|
|||
Change in 0.17: (27 Jan 02) |
|||
- bug fixes |
|||
|
|||
Change in 0.16: (19 Jan 02) |
|||
- Support of ioapi for virtualize zip file access |
|||
|
|||
Change in 0.15: (19 Mar 98) |
|||
- fix memory leak in minizip.c |
|||
|
|||
Change in 0.14: (10 Mar 98) |
|||
- fix bugs in minizip.c sample for zipping big file |
|||
- fix problem in month in date handling |
|||
- fix bug in unzlocal_GetCurrentFileInfoInternal in unzip.c for |
|||
comment handling |
|||
|
|||
Change in 0.13: (6 Mar 98) |
|||
- fix bugs in zip.c |
|||
- add real minizip sample |
|||
|
|||
Change in 0.12: (4 Mar 98) |
|||
- add zip.c and zip.h for creates .zip file |
|||
- fix change_file_date in miniunz.c for Unix (Jean-loup Gailly) |
|||
- fix miniunz.c for file without specific record for directory |
|||
|
|||
Change in 0.11: (3 Mar 98) |
|||
- fix bug in unzGetCurrentFileInfo for get extra field and comment |
|||
- enhance miniunz sample, remove the bad unztst.c sample |
|||
|
|||
Change in 0.10: (2 Mar 98) |
|||
- fix bug in unzReadCurrentFile |
|||
- rename unzip* to unz* function and structure |
|||
- remove Windows-like hungary notation variable name |
|||
- modify some structure in unzip.h |
|||
- add somes comment in source |
|||
- remove unzipGetcCurrentFile function |
|||
- replace ZUNZEXPORT by ZEXPORT |
|||
- add unzGetLocalExtrafield for get the local extrafield info |
|||
- add a new sample, miniunz.c |
|||
|
|||
Change in 0.4: (25 Feb 98) |
|||
- suppress the type unzipFileInZip. |
|||
Only on file in the zipfile can be open at the same time |
|||
- fix somes typo in code |
|||
- added tm_unz structure in unzip_file_info (date/time in readable format) |
|||
@ -0,0 +1,25 @@ |
|||
CC=cc |
|||
CFLAGS=-O -I../.. |
|||
|
|||
UNZ_OBJS = miniunz.o unzip.o ioapi.o ../../libz.a |
|||
ZIP_OBJS = minizip.o zip.o ioapi.o ../../libz.a |
|||
|
|||
.c.o: |
|||
$(CC) -c $(CFLAGS) $*.c |
|||
|
|||
all: miniunz minizip |
|||
|
|||
miniunz: $(UNZ_OBJS) |
|||
$(CC) $(CFLAGS) -o $@ $(UNZ_OBJS) |
|||
|
|||
minizip: $(ZIP_OBJS) |
|||
$(CC) $(CFLAGS) -o $@ $(ZIP_OBJS) |
|||
|
|||
test: miniunz minizip |
|||
./minizip test readme.txt |
|||
./miniunz -l test.zip |
|||
mv readme.txt readme.old |
|||
./miniunz test.zip |
|||
|
|||
clean: |
|||
/bin/rm -f *.o *~ minizip miniunz |
|||
@ -0,0 +1,132 @@ |
|||
/* crypt.h -- base code for crypt/uncrypt ZIPfile
|
|||
|
|||
|
|||
Version 1.01e, February 12th, 2005 |
|||
|
|||
Copyright (C) 1998-2005 Gilles Vollant |
|||
|
|||
This code is a modified version of crypting code in Infozip distribution |
|||
|
|||
The encryption/decryption parts of this source code (as opposed to the |
|||
non-echoing password parts) were originally written in Europe. The |
|||
whole source package can be freely distributed, including from the USA. |
|||
(Prior to January 2000, re-export from the US was a violation of US law.) |
|||
|
|||
This encryption code is a direct transcription of the algorithm from |
|||
Roger Schlafly, described by Phil Katz in the file appnote.txt. This |
|||
file (appnote.txt) is distributed with the PKZIP program (even in the |
|||
version without encryption capabilities). |
|||
|
|||
If you don't need crypting in your application, just define symbols |
|||
NOCRYPT and NOUNCRYPT. |
|||
|
|||
This code support the "Traditional PKWARE Encryption". |
|||
|
|||
The new AES encryption added on Zip format by Winzip (see the page |
|||
http://www.winzip.com/aes_info.htm ) and PKWare PKZip 5.x Strong
|
|||
Encryption is not supported. |
|||
*/ |
|||
|
|||
#define CRC32(c, b) ((*(pcrc_32_tab+(((int)(c) ^ (b)) & 0xff))) ^ ((c) >> 8)) |
|||
|
|||
/***********************************************************************
|
|||
* Return the next byte in the pseudo-random sequence |
|||
*/ |
|||
static int decrypt_byte(unsigned long* pkeys, const unsigned long* pcrc_32_tab) |
|||
{ |
|||
unsigned temp; /* POTENTIAL BUG: temp*(temp^1) may overflow in an
|
|||
* unpredictable manner on 16-bit systems; not a problem |
|||
* with any known compiler so far, though */ |
|||
|
|||
temp = ((unsigned)(*(pkeys+2)) & 0xffff) | 2; |
|||
return (int)(((temp * (temp ^ 1)) >> 8) & 0xff); |
|||
} |
|||
|
|||
/***********************************************************************
|
|||
* Update the encryption keys with the next byte of plain text |
|||
*/ |
|||
static int update_keys(unsigned long* pkeys,const unsigned long* pcrc_32_tab,int c) |
|||
{ |
|||
(*(pkeys+0)) = CRC32((*(pkeys+0)), c); |
|||
(*(pkeys+1)) += (*(pkeys+0)) & 0xff; |
|||
(*(pkeys+1)) = (*(pkeys+1)) * 134775813L + 1; |
|||
{ |
|||
register int keyshift = (int)((*(pkeys+1)) >> 24); |
|||
(*(pkeys+2)) = CRC32((*(pkeys+2)), keyshift); |
|||
} |
|||
return c; |
|||
} |
|||
|
|||
|
|||
/***********************************************************************
|
|||
* Initialize the encryption keys and the random header according to |
|||
* the given password. |
|||
*/ |
|||
static void init_keys(const char* passwd,unsigned long* pkeys,const unsigned long* pcrc_32_tab) |
|||
{ |
|||
*(pkeys+0) = 305419896L; |
|||
*(pkeys+1) = 591751049L; |
|||
*(pkeys+2) = 878082192L; |
|||
while (*passwd != '\0') { |
|||
update_keys(pkeys,pcrc_32_tab,(int)*passwd); |
|||
passwd++; |
|||
} |
|||
} |
|||
|
|||
#define zdecode(pkeys,pcrc_32_tab,c) \ |
|||
(update_keys(pkeys,pcrc_32_tab,c ^= decrypt_byte(pkeys,pcrc_32_tab))) |
|||
|
|||
#define zencode(pkeys,pcrc_32_tab,c,t) \ |
|||
(t=decrypt_byte(pkeys,pcrc_32_tab), update_keys(pkeys,pcrc_32_tab,c), t^(c)) |
|||
|
|||
#ifdef INCLUDECRYPTINGCODE_IFCRYPTALLOWED |
|||
|
|||
#define RAND_HEAD_LEN 12 |
|||
/* "last resort" source for second part of crypt seed pattern */ |
|||
# ifndef ZCR_SEED2 |
|||
# define ZCR_SEED2 3141592654UL /* use PI as default pattern */ |
|||
# endif |
|||
|
|||
static int crypthead(passwd, buf, bufSize, pkeys, pcrc_32_tab, crcForCrypting) |
|||
const char *passwd; /* password string */ |
|||
unsigned char *buf; /* where to write header */ |
|||
int bufSize; |
|||
unsigned long* pkeys; |
|||
const unsigned long* pcrc_32_tab; |
|||
unsigned long crcForCrypting; |
|||
{ |
|||
int n; /* index in random header */ |
|||
int t; /* temporary */ |
|||
int c; /* random byte */ |
|||
unsigned char header[RAND_HEAD_LEN-2]; /* random header */ |
|||
static unsigned calls = 0; /* ensure different random header each time */ |
|||
|
|||
if (bufSize<RAND_HEAD_LEN) |
|||
return 0; |
|||
|
|||
/* First generate RAND_HEAD_LEN-2 random bytes. We encrypt the
|
|||
* output of rand() to get less predictability, since rand() is |
|||
* often poorly implemented. |
|||
*/ |
|||
if (++calls == 1) |
|||
{ |
|||
srand((unsigned)(time(NULL) ^ ZCR_SEED2)); |
|||
} |
|||
init_keys(passwd, pkeys, pcrc_32_tab); |
|||
for (n = 0; n < RAND_HEAD_LEN-2; n++) |
|||
{ |
|||
c = (rand() >> 7) & 0xff; |
|||
header[n] = (unsigned char)zencode(pkeys, pcrc_32_tab, c, t); |
|||
} |
|||
/* Encrypt random header (last two bytes is high word of crc) */ |
|||
init_keys(passwd, pkeys, pcrc_32_tab); |
|||
for (n = 0; n < RAND_HEAD_LEN-2; n++) |
|||
{ |
|||
buf[n] = (unsigned char)zencode(pkeys, pcrc_32_tab, header[n], t); |
|||
} |
|||
buf[n++] = zencode(pkeys, pcrc_32_tab, (int)(crcForCrypting >> 16) & 0xff, t); |
|||
buf[n++] = zencode(pkeys, pcrc_32_tab, (int)(crcForCrypting >> 24) & 0xff, t); |
|||
return n; |
|||
} |
|||
|
|||
#endif |
|||
@ -0,0 +1,180 @@ |
|||
/* ioapi.c -- IO base function header for compress/uncompress .zip
|
|||
files using zlib + zip or unzip API |
|||
|
|||
Version 1.01e, February 12th, 2005 |
|||
|
|||
Copyright (C) 1998-2005 Gilles Vollant |
|||
*/ |
|||
|
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
|
|||
#if defined(USE_SYSTEM_ZLIB) |
|||
#include <zlib.h> |
|||
#else |
|||
#include "zlib.h" |
|||
#endif |
|||
|
|||
#include "ioapi.h" |
|||
|
|||
/* I've found an old Unix (a SunOS 4.1.3_U1) without all SEEK_* defined.... */ |
|||
|
|||
#ifndef SEEK_CUR |
|||
#define SEEK_CUR 1 |
|||
#endif |
|||
|
|||
#ifndef SEEK_END |
|||
#define SEEK_END 2 |
|||
#endif |
|||
|
|||
#ifndef SEEK_SET |
|||
#define SEEK_SET 0 |
|||
#endif |
|||
|
|||
voidpf ZCALLBACK fopen_file_func OF(( |
|||
voidpf opaque, |
|||
const char* filename, |
|||
int mode)); |
|||
|
|||
uLong ZCALLBACK fread_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream, |
|||
void* buf, |
|||
uLong size)); |
|||
|
|||
uLong ZCALLBACK fwrite_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream, |
|||
const void* buf, |
|||
uLong size)); |
|||
|
|||
long ZCALLBACK ftell_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream)); |
|||
|
|||
long ZCALLBACK fseek_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream, |
|||
uLong offset, |
|||
int origin)); |
|||
|
|||
int ZCALLBACK fclose_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream)); |
|||
|
|||
int ZCALLBACK ferror_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream)); |
|||
|
|||
|
|||
voidpf ZCALLBACK fopen_file_func (opaque, filename, mode) |
|||
voidpf opaque; |
|||
const char* filename; |
|||
int mode; |
|||
{ |
|||
FILE* file = NULL; |
|||
const char* mode_fopen = NULL; |
|||
if ((mode & ZLIB_FILEFUNC_MODE_READWRITEFILTER)==ZLIB_FILEFUNC_MODE_READ) |
|||
mode_fopen = "rb"; |
|||
else |
|||
if (mode & ZLIB_FILEFUNC_MODE_EXISTING) |
|||
mode_fopen = "r+b"; |
|||
else |
|||
if (mode & ZLIB_FILEFUNC_MODE_CREATE) |
|||
mode_fopen = "wb"; |
|||
|
|||
if ((filename!=NULL) && (mode_fopen != NULL)) |
|||
file = fopen(filename, mode_fopen); |
|||
return file; |
|||
} |
|||
|
|||
|
|||
uLong ZCALLBACK fread_file_func (opaque, stream, buf, size) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
void* buf; |
|||
uLong size; |
|||
{ |
|||
uLong ret; |
|||
ret = (uLong)fread(buf, 1, (size_t)size, (FILE *)stream); |
|||
return ret; |
|||
} |
|||
|
|||
|
|||
uLong ZCALLBACK fwrite_file_func (opaque, stream, buf, size) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
const void* buf; |
|||
uLong size; |
|||
{ |
|||
uLong ret; |
|||
ret = (uLong)fwrite(buf, 1, (size_t)size, (FILE *)stream); |
|||
return ret; |
|||
} |
|||
|
|||
long ZCALLBACK ftell_file_func (opaque, stream) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
{ |
|||
long ret; |
|||
ret = ftell((FILE *)stream); |
|||
return ret; |
|||
} |
|||
|
|||
long ZCALLBACK fseek_file_func (opaque, stream, offset, origin) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
uLong offset; |
|||
int origin; |
|||
{ |
|||
int fseek_origin=0; |
|||
long ret; |
|||
switch (origin) |
|||
{ |
|||
case ZLIB_FILEFUNC_SEEK_CUR : |
|||
fseek_origin = SEEK_CUR; |
|||
break; |
|||
case ZLIB_FILEFUNC_SEEK_END : |
|||
fseek_origin = SEEK_END; |
|||
break; |
|||
case ZLIB_FILEFUNC_SEEK_SET : |
|||
fseek_origin = SEEK_SET; |
|||
break; |
|||
default: return -1; |
|||
} |
|||
ret = 0; |
|||
fseek((FILE *)stream, offset, fseek_origin); |
|||
return ret; |
|||
} |
|||
|
|||
int ZCALLBACK fclose_file_func (opaque, stream) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
{ |
|||
int ret; |
|||
ret = fclose((FILE *)stream); |
|||
return ret; |
|||
} |
|||
|
|||
int ZCALLBACK ferror_file_func (opaque, stream) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
{ |
|||
int ret; |
|||
ret = ferror((FILE *)stream); |
|||
return ret; |
|||
} |
|||
|
|||
void fill_fopen_filefunc (pzlib_filefunc_def) |
|||
zlib_filefunc_def* pzlib_filefunc_def; |
|||
{ |
|||
pzlib_filefunc_def->zopen_file = fopen_file_func; |
|||
pzlib_filefunc_def->zread_file = fread_file_func; |
|||
pzlib_filefunc_def->zwrite_file = fwrite_file_func; |
|||
pzlib_filefunc_def->ztell_file = ftell_file_func; |
|||
pzlib_filefunc_def->zseek_file = fseek_file_func; |
|||
pzlib_filefunc_def->zclose_file = fclose_file_func; |
|||
pzlib_filefunc_def->zerror_file = ferror_file_func; |
|||
pzlib_filefunc_def->opaque = NULL; |
|||
} |
|||
@ -0,0 +1,75 @@ |
|||
/* ioapi.h -- IO base function header for compress/uncompress .zip
|
|||
files using zlib + zip or unzip API |
|||
|
|||
Version 1.01e, February 12th, 2005 |
|||
|
|||
Copyright (C) 1998-2005 Gilles Vollant |
|||
*/ |
|||
|
|||
#ifndef _ZLIBIOAPI_H |
|||
#define _ZLIBIOAPI_H |
|||
|
|||
|
|||
#define ZLIB_FILEFUNC_SEEK_CUR (1) |
|||
#define ZLIB_FILEFUNC_SEEK_END (2) |
|||
#define ZLIB_FILEFUNC_SEEK_SET (0) |
|||
|
|||
#define ZLIB_FILEFUNC_MODE_READ (1) |
|||
#define ZLIB_FILEFUNC_MODE_WRITE (2) |
|||
#define ZLIB_FILEFUNC_MODE_READWRITEFILTER (3) |
|||
|
|||
#define ZLIB_FILEFUNC_MODE_EXISTING (4) |
|||
#define ZLIB_FILEFUNC_MODE_CREATE (8) |
|||
|
|||
|
|||
#ifndef ZCALLBACK |
|||
|
|||
#if (defined(WIN32) || defined (WINDOWS) || defined (_WINDOWS)) && defined(CALLBACK) && defined (USEWINDOWS_CALLBACK) |
|||
#define ZCALLBACK CALLBACK |
|||
#else |
|||
#define ZCALLBACK |
|||
#endif |
|||
#endif |
|||
|
|||
#ifdef __cplusplus |
|||
extern "C" { |
|||
#endif |
|||
|
|||
typedef voidpf (ZCALLBACK *open_file_func) OF((voidpf opaque, const char* filename, int mode)); |
|||
typedef uLong (ZCALLBACK *read_file_func) OF((voidpf opaque, voidpf stream, void* buf, uLong size)); |
|||
typedef uLong (ZCALLBACK *write_file_func) OF((voidpf opaque, voidpf stream, const void* buf, uLong size)); |
|||
typedef long (ZCALLBACK *tell_file_func) OF((voidpf opaque, voidpf stream)); |
|||
typedef long (ZCALLBACK *seek_file_func) OF((voidpf opaque, voidpf stream, uLong offset, int origin)); |
|||
typedef int (ZCALLBACK *close_file_func) OF((voidpf opaque, voidpf stream)); |
|||
typedef int (ZCALLBACK *testerror_file_func) OF((voidpf opaque, voidpf stream)); |
|||
|
|||
typedef struct zlib_filefunc_def_s |
|||
{ |
|||
open_file_func zopen_file; |
|||
read_file_func zread_file; |
|||
write_file_func zwrite_file; |
|||
tell_file_func ztell_file; |
|||
seek_file_func zseek_file; |
|||
close_file_func zclose_file; |
|||
testerror_file_func zerror_file; |
|||
voidpf opaque; |
|||
} zlib_filefunc_def; |
|||
|
|||
|
|||
|
|||
void fill_fopen_filefunc OF((zlib_filefunc_def* pzlib_filefunc_def)); |
|||
|
|||
#define ZREAD(filefunc,filestream,buf,size) ((*((filefunc).zread_file))((filefunc).opaque,filestream,buf,size)) |
|||
#define ZWRITE(filefunc,filestream,buf,size) ((*((filefunc).zwrite_file))((filefunc).opaque,filestream,buf,size)) |
|||
#define ZTELL(filefunc,filestream) ((*((filefunc).ztell_file))((filefunc).opaque,filestream)) |
|||
#define ZSEEK(filefunc,filestream,pos,mode) ((*((filefunc).zseek_file))((filefunc).opaque,filestream,pos,mode)) |
|||
#define ZCLOSE(filefunc,filestream) ((*((filefunc).zclose_file))((filefunc).opaque,filestream)) |
|||
#define ZERROR(filefunc,filestream) ((*((filefunc).zerror_file))((filefunc).opaque,filestream)) |
|||
|
|||
|
|||
#ifdef __cplusplus |
|||
} |
|||
#endif |
|||
|
|||
#endif |
|||
|
|||
@ -0,0 +1,270 @@ |
|||
/* iowin32.c -- IO base function header for compress/uncompress .zip
|
|||
files using zlib + zip or unzip API |
|||
This IO API version uses the Win32 API (for Microsoft Windows) |
|||
|
|||
Version 1.01e, February 12th, 2005 |
|||
|
|||
Copyright (C) 1998-2005 Gilles Vollant |
|||
*/ |
|||
|
|||
#include <stdlib.h> |
|||
|
|||
#include "zlib.h" |
|||
#include "ioapi.h" |
|||
#include "iowin32.h" |
|||
|
|||
#ifndef INVALID_HANDLE_VALUE |
|||
#define INVALID_HANDLE_VALUE (0xFFFFFFFF) |
|||
#endif |
|||
|
|||
#ifndef INVALID_SET_FILE_POINTER |
|||
#define INVALID_SET_FILE_POINTER ((DWORD)-1) |
|||
#endif |
|||
|
|||
voidpf ZCALLBACK win32_open_file_func OF(( |
|||
voidpf opaque, |
|||
const char* filename, |
|||
int mode)); |
|||
|
|||
uLong ZCALLBACK win32_read_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream, |
|||
void* buf, |
|||
uLong size)); |
|||
|
|||
uLong ZCALLBACK win32_write_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream, |
|||
const void* buf, |
|||
uLong size)); |
|||
|
|||
long ZCALLBACK win32_tell_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream)); |
|||
|
|||
long ZCALLBACK win32_seek_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream, |
|||
uLong offset, |
|||
int origin)); |
|||
|
|||
int ZCALLBACK win32_close_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream)); |
|||
|
|||
int ZCALLBACK win32_error_file_func OF(( |
|||
voidpf opaque, |
|||
voidpf stream)); |
|||
|
|||
typedef struct |
|||
{ |
|||
HANDLE hf; |
|||
int error; |
|||
} WIN32FILE_IOWIN; |
|||
|
|||
voidpf ZCALLBACK win32_open_file_func (opaque, filename, mode) |
|||
voidpf opaque; |
|||
const char* filename; |
|||
int mode; |
|||
{ |
|||
const char* mode_fopen = NULL; |
|||
DWORD dwDesiredAccess,dwCreationDisposition,dwShareMode,dwFlagsAndAttributes ; |
|||
HANDLE hFile = 0; |
|||
voidpf ret=NULL; |
|||
|
|||
dwDesiredAccess = dwShareMode = dwFlagsAndAttributes = 0; |
|||
|
|||
if ((mode & ZLIB_FILEFUNC_MODE_READWRITEFILTER)==ZLIB_FILEFUNC_MODE_READ) |
|||
{ |
|||
dwDesiredAccess = GENERIC_READ; |
|||
dwCreationDisposition = OPEN_EXISTING; |
|||
dwShareMode = FILE_SHARE_READ; |
|||
} |
|||
else |
|||
if (mode & ZLIB_FILEFUNC_MODE_EXISTING) |
|||
{ |
|||
dwDesiredAccess = GENERIC_WRITE | GENERIC_READ; |
|||
dwCreationDisposition = OPEN_EXISTING; |
|||
} |
|||
else |
|||
if (mode & ZLIB_FILEFUNC_MODE_CREATE) |
|||
{ |
|||
dwDesiredAccess = GENERIC_WRITE | GENERIC_READ; |
|||
dwCreationDisposition = CREATE_ALWAYS; |
|||
} |
|||
|
|||
if ((filename!=NULL) && (dwDesiredAccess != 0)) |
|||
hFile = CreateFile((LPCTSTR)filename, dwDesiredAccess, dwShareMode, NULL, |
|||
dwCreationDisposition, dwFlagsAndAttributes, NULL); |
|||
|
|||
if (hFile == INVALID_HANDLE_VALUE) |
|||
hFile = NULL; |
|||
|
|||
if (hFile != NULL) |
|||
{ |
|||
WIN32FILE_IOWIN w32fiow; |
|||
w32fiow.hf = hFile; |
|||
w32fiow.error = 0; |
|||
ret = malloc(sizeof(WIN32FILE_IOWIN)); |
|||
if (ret==NULL) |
|||
CloseHandle(hFile); |
|||
else *((WIN32FILE_IOWIN*)ret) = w32fiow; |
|||
} |
|||
return ret; |
|||
} |
|||
|
|||
|
|||
uLong ZCALLBACK win32_read_file_func (opaque, stream, buf, size) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
void* buf; |
|||
uLong size; |
|||
{ |
|||
uLong ret=0; |
|||
HANDLE hFile = NULL; |
|||
if (stream!=NULL) |
|||
hFile = ((WIN32FILE_IOWIN*)stream) -> hf; |
|||
if (hFile != NULL) |
|||
if (!ReadFile(hFile, buf, size, &ret, NULL)) |
|||
{ |
|||
DWORD dwErr = GetLastError(); |
|||
if (dwErr == ERROR_HANDLE_EOF) |
|||
dwErr = 0; |
|||
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr; |
|||
} |
|||
|
|||
return ret; |
|||
} |
|||
|
|||
|
|||
uLong ZCALLBACK win32_write_file_func (opaque, stream, buf, size) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
const void* buf; |
|||
uLong size; |
|||
{ |
|||
uLong ret=0; |
|||
HANDLE hFile = NULL; |
|||
if (stream!=NULL) |
|||
hFile = ((WIN32FILE_IOWIN*)stream) -> hf; |
|||
|
|||
if (hFile !=NULL) |
|||
if (!WriteFile(hFile, buf, size, &ret, NULL)) |
|||
{ |
|||
DWORD dwErr = GetLastError(); |
|||
if (dwErr == ERROR_HANDLE_EOF) |
|||
dwErr = 0; |
|||
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr; |
|||
} |
|||
|
|||
return ret; |
|||
} |
|||
|
|||
long ZCALLBACK win32_tell_file_func (opaque, stream) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
{ |
|||
long ret=-1; |
|||
HANDLE hFile = NULL; |
|||
if (stream!=NULL) |
|||
hFile = ((WIN32FILE_IOWIN*)stream) -> hf; |
|||
if (hFile != NULL) |
|||
{ |
|||
DWORD dwSet = SetFilePointer(hFile, 0, NULL, FILE_CURRENT); |
|||
if (dwSet == INVALID_SET_FILE_POINTER) |
|||
{ |
|||
DWORD dwErr = GetLastError(); |
|||
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr; |
|||
ret = -1; |
|||
} |
|||
else |
|||
ret=(long)dwSet; |
|||
} |
|||
return ret; |
|||
} |
|||
|
|||
long ZCALLBACK win32_seek_file_func (opaque, stream, offset, origin) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
uLong offset; |
|||
int origin; |
|||
{ |
|||
DWORD dwMoveMethod=0xFFFFFFFF; |
|||
HANDLE hFile = NULL; |
|||
|
|||
long ret=-1; |
|||
if (stream!=NULL) |
|||
hFile = ((WIN32FILE_IOWIN*)stream) -> hf; |
|||
switch (origin) |
|||
{ |
|||
case ZLIB_FILEFUNC_SEEK_CUR : |
|||
dwMoveMethod = FILE_CURRENT; |
|||
break; |
|||
case ZLIB_FILEFUNC_SEEK_END : |
|||
dwMoveMethod = FILE_END; |
|||
break; |
|||
case ZLIB_FILEFUNC_SEEK_SET : |
|||
dwMoveMethod = FILE_BEGIN; |
|||
break; |
|||
default: return -1; |
|||
} |
|||
|
|||
if (hFile != NULL) |
|||
{ |
|||
DWORD dwSet = SetFilePointer(hFile, offset, NULL, dwMoveMethod); |
|||
if (dwSet == INVALID_SET_FILE_POINTER) |
|||
{ |
|||
DWORD dwErr = GetLastError(); |
|||
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr; |
|||
ret = -1; |
|||
} |
|||
else |
|||
ret=0; |
|||
} |
|||
return ret; |
|||
} |
|||
|
|||
int ZCALLBACK win32_close_file_func (opaque, stream) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
{ |
|||
int ret=-1; |
|||
|
|||
if (stream!=NULL) |
|||
{ |
|||
HANDLE hFile; |
|||
hFile = ((WIN32FILE_IOWIN*)stream) -> hf; |
|||
if (hFile != NULL) |
|||
{ |
|||
CloseHandle(hFile); |
|||
ret=0; |
|||
} |
|||
free(stream); |
|||
} |
|||
return ret; |
|||
} |
|||
|
|||
int ZCALLBACK win32_error_file_func (opaque, stream) |
|||
voidpf opaque; |
|||
voidpf stream; |
|||
{ |
|||
int ret=-1; |
|||
if (stream!=NULL) |
|||
{ |
|||
ret = ((WIN32FILE_IOWIN*)stream) -> error; |
|||
} |
|||
return ret; |
|||
} |
|||
|
|||
void fill_win32_filefunc (pzlib_filefunc_def) |
|||
zlib_filefunc_def* pzlib_filefunc_def; |
|||
{ |
|||
pzlib_filefunc_def->zopen_file = win32_open_file_func; |
|||
pzlib_filefunc_def->zread_file = win32_read_file_func; |
|||
pzlib_filefunc_def->zwrite_file = win32_write_file_func; |
|||
pzlib_filefunc_def->ztell_file = win32_tell_file_func; |
|||
pzlib_filefunc_def->zseek_file = win32_seek_file_func; |
|||
pzlib_filefunc_def->zclose_file = win32_close_file_func; |
|||
pzlib_filefunc_def->zerror_file = win32_error_file_func; |
|||
pzlib_filefunc_def->opaque=NULL; |
|||
} |
|||
@ -0,0 +1,21 @@ |
|||
/* iowin32.h -- IO base function header for compress/uncompress .zip
|
|||
files using zlib + zip or unzip API |
|||
This IO API version uses the Win32 API (for Microsoft Windows) |
|||
|
|||
Version 1.01e, February 12th, 2005 |
|||
|
|||
Copyright (C) 1998-2005 Gilles Vollant |
|||
*/ |
|||
|
|||
#include <windows.h> |
|||
|
|||
|
|||
#ifdef __cplusplus |
|||
extern "C" { |
|||
#endif |
|||
|
|||
void fill_win32_filefunc OF((zlib_filefunc_def* pzlib_filefunc_def)); |
|||
|
|||
#ifdef __cplusplus |
|||
} |
|||
#endif |
|||
@ -0,0 +1,585 @@ |
|||
/*
|
|||
miniunz.c |
|||
Version 1.01e, February 12th, 2005 |
|||
|
|||
Copyright (C) 1998-2005 Gilles Vollant |
|||
*/ |
|||
|
|||
|
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include <time.h> |
|||
#include <errno.h> |
|||
#include <fcntl.h> |
|||
|
|||
#ifdef unix |
|||
# include <unistd.h> |
|||
# include <utime.h> |
|||
#else |
|||
# include <direct.h> |
|||
# include <io.h> |
|||
#endif |
|||
|
|||
#include "unzip.h" |
|||
|
|||
#define CASESENSITIVITY (0) |
|||
#define WRITEBUFFERSIZE (8192) |
|||
#define MAXFILENAME (256) |
|||
|
|||
#ifdef WIN32 |
|||
#define USEWIN32IOAPI |
|||
#include "iowin32.h" |
|||
#endif |
|||
/*
|
|||
mini unzip, demo of unzip package |
|||
|
|||
usage : |
|||
Usage : miniunz [-exvlo] file.zip [file_to_extract] [-d extractdir] |
|||
|
|||
list the file in the zipfile, and print the content of FILE_ID.ZIP or README.TXT |
|||
if it exists |
|||
*/ |
|||
|
|||
|
|||
/* change_file_date : change the date/time of a file
|
|||
filename : the filename of the file where date/time must be modified |
|||
dosdate : the new date at the MSDos format (4 bytes) |
|||
tmu_date : the SAME new date at the tm_unz format */ |
|||
void change_file_date(filename,dosdate,tmu_date) |
|||
const char *filename; |
|||
uLong dosdate; |
|||
tm_unz tmu_date; |
|||
{ |
|||
#ifdef WIN32 |
|||
HANDLE hFile; |
|||
FILETIME ftm,ftLocal,ftCreate,ftLastAcc,ftLastWrite; |
|||
|
|||
hFile = CreateFile(filename,GENERIC_READ | GENERIC_WRITE, |
|||
0,NULL,OPEN_EXISTING,0,NULL); |
|||
GetFileTime(hFile,&ftCreate,&ftLastAcc,&ftLastWrite); |
|||
DosDateTimeToFileTime((WORD)(dosdate>>16),(WORD)dosdate,&ftLocal); |
|||
LocalFileTimeToFileTime(&ftLocal,&ftm); |
|||
SetFileTime(hFile,&ftm,&ftLastAcc,&ftm); |
|||
CloseHandle(hFile); |
|||
#else |
|||
#ifdef unix |
|||
struct utimbuf ut; |
|||
struct tm newdate; |
|||
newdate.tm_sec = tmu_date.tm_sec; |
|||
newdate.tm_min=tmu_date.tm_min; |
|||
newdate.tm_hour=tmu_date.tm_hour; |
|||
newdate.tm_mday=tmu_date.tm_mday; |
|||
newdate.tm_mon=tmu_date.tm_mon; |
|||
if (tmu_date.tm_year > 1900) |
|||
newdate.tm_year=tmu_date.tm_year - 1900; |
|||
else |
|||
newdate.tm_year=tmu_date.tm_year ; |
|||
newdate.tm_isdst=-1; |
|||
|
|||
ut.actime=ut.modtime=mktime(&newdate); |
|||
utime(filename,&ut); |
|||
#endif |
|||
#endif |
|||
} |
|||
|
|||
|
|||
/* mymkdir and change_file_date are not 100 % portable
|
|||
As I don't know well Unix, I wait feedback for the unix portion */ |
|||
|
|||
int mymkdir(dirname) |
|||
const char* dirname; |
|||
{ |
|||
int ret=0; |
|||
#ifdef WIN32 |
|||
ret = mkdir(dirname); |
|||
#else |
|||
#ifdef unix |
|||
ret = mkdir (dirname,0775); |
|||
#endif |
|||
#endif |
|||
return ret; |
|||
} |
|||
|
|||
int makedir (newdir) |
|||
char *newdir; |
|||
{ |
|||
char *buffer ; |
|||
char *p; |
|||
int len = (int)strlen(newdir); |
|||
|
|||
if (len <= 0) |
|||
return 0; |
|||
|
|||
buffer = (char*)malloc(len+1); |
|||
strcpy(buffer,newdir); |
|||
|
|||
if (buffer[len-1] == '/') { |
|||
buffer[len-1] = '\0'; |
|||
} |
|||
if (mymkdir(buffer) == 0) |
|||
{ |
|||
free(buffer); |
|||
return 1; |
|||
} |
|||
|
|||
p = buffer+1; |
|||
while (1) |
|||
{ |
|||
char hold; |
|||
|
|||
while(*p && *p != '\\' && *p != '/') |
|||
p++; |
|||
hold = *p; |
|||
*p = 0; |
|||
if ((mymkdir(buffer) == -1) && (errno == ENOENT)) |
|||
{ |
|||
printf("couldn't create directory %s\n",buffer); |
|||
free(buffer); |
|||
return 0; |
|||
} |
|||
if (hold == 0) |
|||
break; |
|||
*p++ = hold; |
|||
} |
|||
free(buffer); |
|||
return 1; |
|||
} |
|||
|
|||
void do_banner() |
|||
{ |
|||
printf("MiniUnz 1.01b, demo of zLib + Unz package written by Gilles Vollant\n"); |
|||
printf("more info at http://www.winimage.com/zLibDll/unzip.html\n\n"); |
|||
} |
|||
|
|||
void do_help() |
|||
{ |
|||
printf("Usage : miniunz [-e] [-x] [-v] [-l] [-o] [-p password] file.zip [file_to_extr.] [-d extractdir]\n\n" \ |
|||
" -e Extract without pathname (junk paths)\n" \ |
|||
" -x Extract with pathname\n" \ |
|||
" -v list files\n" \ |
|||
" -l list files\n" \ |
|||
" -d directory to extract into\n" \ |
|||
" -o overwrite files without prompting\n" \ |
|||
" -p extract crypted file using password\n\n"); |
|||
} |
|||
|
|||
|
|||
int do_list(uf) |
|||
unzFile uf; |
|||
{ |
|||
uLong i; |
|||
unz_global_info gi; |
|||
int err; |
|||
|
|||
err = unzGetGlobalInfo (uf,&gi); |
|||
if (err!=UNZ_OK) |
|||
printf("error %d with zipfile in unzGetGlobalInfo \n",err); |
|||
printf(" Length Method Size Ratio Date Time CRC-32 Name\n"); |
|||
printf(" ------ ------ ---- ----- ---- ---- ------ ----\n"); |
|||
for (i=0;i<gi.number_entry;i++) |
|||
{ |
|||
char filename_inzip[256]; |
|||
unz_file_info file_info; |
|||
uLong ratio=0; |
|||
const char *string_method; |
|||
char charCrypt=' '; |
|||
err = unzGetCurrentFileInfo(uf,&file_info,filename_inzip,sizeof(filename_inzip),NULL,0,NULL,0); |
|||
if (err!=UNZ_OK) |
|||
{ |
|||
printf("error %d with zipfile in unzGetCurrentFileInfo\n",err); |
|||
break; |
|||
} |
|||
if (file_info.uncompressed_size>0) |
|||
ratio = (file_info.compressed_size*100)/file_info.uncompressed_size; |
|||
|
|||
/* display a '*' if the file is crypted */ |
|||
if ((file_info.flag & 1) != 0) |
|||
charCrypt='*'; |
|||
|
|||
if (file_info.compression_method==0) |
|||
string_method="Stored"; |
|||
else |
|||
if (file_info.compression_method==Z_DEFLATED) |
|||
{ |
|||
uInt iLevel=(uInt)((file_info.flag & 0x6)/2); |
|||
if (iLevel==0) |
|||
string_method="Defl:N"; |
|||
else if (iLevel==1) |
|||
string_method="Defl:X"; |
|||
else if ((iLevel==2) || (iLevel==3)) |
|||
string_method="Defl:F"; /* 2:fast , 3 : extra fast*/ |
|||
} |
|||
else |
|||
string_method="Unkn. "; |
|||
|
|||
printf("%7lu %6s%c%7lu %3lu%% %2.2lu-%2.2lu-%2.2lu %2.2lu:%2.2lu %8.8lx %s\n", |
|||
file_info.uncompressed_size,string_method, |
|||
charCrypt, |
|||
file_info.compressed_size, |
|||
ratio, |
|||
(uLong)file_info.tmu_date.tm_mon + 1, |
|||
(uLong)file_info.tmu_date.tm_mday, |
|||
(uLong)file_info.tmu_date.tm_year % 100, |
|||
(uLong)file_info.tmu_date.tm_hour,(uLong)file_info.tmu_date.tm_min, |
|||
(uLong)file_info.crc,filename_inzip); |
|||
if ((i+1)<gi.number_entry) |
|||
{ |
|||
err = unzGoToNextFile(uf); |
|||
if (err!=UNZ_OK) |
|||
{ |
|||
printf("error %d with zipfile in unzGoToNextFile\n",err); |
|||
break; |
|||
} |
|||
} |
|||
} |
|||
|
|||
return 0; |
|||
} |
|||
|
|||
|
|||
int do_extract_currentfile(uf,popt_extract_without_path,popt_overwrite,password) |
|||
unzFile uf; |
|||
const int* popt_extract_without_path; |
|||
int* popt_overwrite; |
|||
const char* password; |
|||
{ |
|||
char filename_inzip[256]; |
|||
char* filename_withoutpath; |
|||
char* p; |
|||
int err=UNZ_OK; |
|||
FILE *fout=NULL; |
|||
void* buf; |
|||
uInt size_buf; |
|||
|
|||
unz_file_info file_info; |
|||
uLong ratio=0; |
|||
err = unzGetCurrentFileInfo(uf,&file_info,filename_inzip,sizeof(filename_inzip),NULL,0,NULL,0); |
|||
|
|||
if (err!=UNZ_OK) |
|||
{ |
|||
printf("error %d with zipfile in unzGetCurrentFileInfo\n",err); |
|||
return err; |
|||
} |
|||
|
|||
size_buf = WRITEBUFFERSIZE; |
|||
buf = (void*)malloc(size_buf); |
|||
if (buf==NULL) |
|||
{ |
|||
printf("Error allocating memory\n"); |
|||
return UNZ_INTERNALERROR; |
|||
} |
|||
|
|||
p = filename_withoutpath = filename_inzip; |
|||
while ((*p) != '\0') |
|||
{ |
|||
if (((*p)=='/') || ((*p)=='\\')) |
|||
filename_withoutpath = p+1; |
|||
p++; |
|||
} |
|||
|
|||
if ((*filename_withoutpath)=='\0') |
|||
{ |
|||
if ((*popt_extract_without_path)==0) |
|||
{ |
|||
printf("creating directory: %s\n",filename_inzip); |
|||
mymkdir(filename_inzip); |
|||
} |
|||
} |
|||
else |
|||
{ |
|||
const char* write_filename; |
|||
int skip=0; |
|||
|
|||
if ((*popt_extract_without_path)==0) |
|||
write_filename = filename_inzip; |
|||
else |
|||
write_filename = filename_withoutpath; |
|||
|
|||
err = unzOpenCurrentFilePassword(uf,password); |
|||
if (err!=UNZ_OK) |
|||
{ |
|||
printf("error %d with zipfile in unzOpenCurrentFilePassword\n",err); |
|||
} |
|||
|
|||
if (((*popt_overwrite)==0) && (err==UNZ_OK)) |
|||
{ |
|||
char rep=0; |
|||
FILE* ftestexist; |
|||
ftestexist = fopen(write_filename,"rb"); |
|||
if (ftestexist!=NULL) |
|||
{ |
|||
fclose(ftestexist); |
|||
do |
|||
{ |
|||
char answer[128]; |
|||
int ret; |
|||
|
|||
printf("The file %s exists. Overwrite ? [y]es, [n]o, [A]ll: ",write_filename); |
|||
ret = scanf("%1s",answer); |
|||
if (ret != 1) |
|||
{ |
|||
exit(EXIT_FAILURE); |
|||
} |
|||
rep = answer[0] ; |
|||
if ((rep>='a') && (rep<='z')) |
|||
rep -= 0x20; |
|||
} |
|||
while ((rep!='Y') && (rep!='N') && (rep!='A')); |
|||
} |
|||
|
|||
if (rep == 'N') |
|||
skip = 1; |
|||
|
|||
if (rep == 'A') |
|||
*popt_overwrite=1; |
|||
} |
|||
|
|||
if ((skip==0) && (err==UNZ_OK)) |
|||
{ |
|||
fout=fopen(write_filename,"wb"); |
|||
|
|||
/* some zipfile don't contain directory alone before file */ |
|||
if ((fout==NULL) && ((*popt_extract_without_path)==0) && |
|||
(filename_withoutpath!=(char*)filename_inzip)) |
|||
{ |
|||
char c=*(filename_withoutpath-1); |
|||
*(filename_withoutpath-1)='\0'; |
|||
makedir(write_filename); |
|||
*(filename_withoutpath-1)=c; |
|||
fout=fopen(write_filename,"wb"); |
|||
} |
|||
|
|||
if (fout==NULL) |
|||
{ |
|||
printf("error opening %s\n",write_filename); |
|||
} |
|||
} |
|||
|
|||
if (fout!=NULL) |
|||
{ |
|||
printf(" extracting: %s\n",write_filename); |
|||
|
|||
do |
|||
{ |
|||
err = unzReadCurrentFile(uf,buf,size_buf); |
|||
if (err<0) |
|||
{ |
|||
printf("error %d with zipfile in unzReadCurrentFile\n",err); |
|||
break; |
|||
} |
|||
if (err>0) |
|||
if (fwrite(buf,err,1,fout)!=1) |
|||
{ |
|||
printf("error in writing extracted file\n"); |
|||
err=UNZ_ERRNO; |
|||
break; |
|||
} |
|||
} |
|||
while (err>0); |
|||
if (fout) |
|||
fclose(fout); |
|||
|
|||
if (err==0) |
|||
change_file_date(write_filename,file_info.dosDate, |
|||
file_info.tmu_date); |
|||
} |
|||
|
|||
if (err==UNZ_OK) |
|||
{ |
|||
err = unzCloseCurrentFile (uf); |
|||
if (err!=UNZ_OK) |
|||
{ |
|||
printf("error %d with zipfile in unzCloseCurrentFile\n",err); |
|||
} |
|||
} |
|||
else |
|||
unzCloseCurrentFile(uf); /* don't lose the error */ |
|||
} |
|||
|
|||
free(buf); |
|||
return err; |
|||
} |
|||
|
|||
|
|||
int do_extract(uf,opt_extract_without_path,opt_overwrite,password) |
|||
unzFile uf; |
|||
int opt_extract_without_path; |
|||
int opt_overwrite; |
|||
const char* password; |
|||
{ |
|||
uLong i; |
|||
unz_global_info gi; |
|||
int err; |
|||
FILE* fout=NULL; |
|||
|
|||
err = unzGetGlobalInfo (uf,&gi); |
|||
if (err!=UNZ_OK) |
|||
printf("error %d with zipfile in unzGetGlobalInfo \n",err); |
|||
|
|||
for (i=0;i<gi.number_entry;i++) |
|||
{ |
|||
if (do_extract_currentfile(uf,&opt_extract_without_path, |
|||
&opt_overwrite, |
|||
password) != UNZ_OK) |
|||
break; |
|||
|
|||
if ((i+1)<gi.number_entry) |
|||
{ |
|||
err = unzGoToNextFile(uf); |
|||
if (err!=UNZ_OK) |
|||
{ |
|||
printf("error %d with zipfile in unzGoToNextFile\n",err); |
|||
break; |
|||
} |
|||
} |
|||
} |
|||
|
|||
return 0; |
|||
} |
|||
|
|||
int do_extract_onefile(uf,filename,opt_extract_without_path,opt_overwrite,password) |
|||
unzFile uf; |
|||
const char* filename; |
|||
int opt_extract_without_path; |
|||
int opt_overwrite; |
|||
const char* password; |
|||
{ |
|||
int err = UNZ_OK; |
|||
if (unzLocateFile(uf,filename,CASESENSITIVITY)!=UNZ_OK) |
|||
{ |
|||
printf("file %s not found in the zipfile\n",filename); |
|||
return 2; |
|||
} |
|||
|
|||
if (do_extract_currentfile(uf,&opt_extract_without_path, |
|||
&opt_overwrite, |
|||
password) == UNZ_OK) |
|||
return 0; |
|||
else |
|||
return 1; |
|||
} |
|||
|
|||
|
|||
int main(argc,argv) |
|||
int argc; |
|||
char *argv[]; |
|||
{ |
|||
const char *zipfilename=NULL; |
|||
const char *filename_to_extract=NULL; |
|||
const char *password=NULL; |
|||
char filename_try[MAXFILENAME+16] = ""; |
|||
int i; |
|||
int opt_do_list=0; |
|||
int opt_do_extract=1; |
|||
int opt_do_extract_withoutpath=0; |
|||
int opt_overwrite=0; |
|||
int opt_extractdir=0; |
|||
const char *dirname=NULL; |
|||
unzFile uf=NULL; |
|||
|
|||
do_banner(); |
|||
if (argc==1) |
|||
{ |
|||
do_help(); |
|||
return 0; |
|||
} |
|||
else |
|||
{ |
|||
for (i=1;i<argc;i++) |
|||
{ |
|||
if ((*argv[i])=='-') |
|||
{ |
|||
const char *p=argv[i]+1; |
|||
|
|||
while ((*p)!='\0') |
|||
{ |
|||
char c=*(p++);; |
|||
if ((c=='l') || (c=='L')) |
|||
opt_do_list = 1; |
|||
if ((c=='v') || (c=='V')) |
|||
opt_do_list = 1; |
|||
if ((c=='x') || (c=='X')) |
|||
opt_do_extract = 1; |
|||
if ((c=='e') || (c=='E')) |
|||
opt_do_extract = opt_do_extract_withoutpath = 1; |
|||
if ((c=='o') || (c=='O')) |
|||
opt_overwrite=1; |
|||
if ((c=='d') || (c=='D')) |
|||
{ |
|||
opt_extractdir=1; |
|||
dirname=argv[i+1]; |
|||
} |
|||
|
|||
if (((c=='p') || (c=='P')) && (i+1<argc)) |
|||
{ |
|||
password=argv[i+1]; |
|||
i++; |
|||
} |
|||
} |
|||
} |
|||
else |
|||
{ |
|||
if (zipfilename == NULL) |
|||
zipfilename = argv[i]; |
|||
else if ((filename_to_extract==NULL) && (!opt_extractdir)) |
|||
filename_to_extract = argv[i] ; |
|||
} |
|||
} |
|||
} |
|||
|
|||
if (zipfilename!=NULL) |
|||
{ |
|||
|
|||
# ifdef USEWIN32IOAPI |
|||
zlib_filefunc_def ffunc; |
|||
# endif |
|||
|
|||
strncpy(filename_try, zipfilename,MAXFILENAME-1); |
|||
/* strncpy doesnt append the trailing NULL, of the string is too long. */ |
|||
filename_try[ MAXFILENAME ] = '\0'; |
|||
|
|||
# ifdef USEWIN32IOAPI |
|||
fill_win32_filefunc(&ffunc); |
|||
uf = unzOpen2(zipfilename,&ffunc); |
|||
# else |
|||
uf = unzOpen(zipfilename); |
|||
# endif |
|||
if (uf==NULL) |
|||
{ |
|||
strcat(filename_try,".zip"); |
|||
# ifdef USEWIN32IOAPI |
|||
uf = unzOpen2(filename_try,&ffunc); |
|||
# else |
|||
uf = unzOpen(filename_try); |
|||
# endif |
|||
} |
|||
} |
|||
|
|||
if (uf==NULL) |
|||
{ |
|||
printf("Cannot open %s or %s.zip\n",zipfilename,zipfilename); |
|||
return 1; |
|||
} |
|||
printf("%s opened\n",filename_try); |
|||
|
|||
if (opt_do_list==1) |
|||
return do_list(uf); |
|||
else if (opt_do_extract==1) |
|||
{ |
|||
if (opt_extractdir && chdir(dirname)) |
|||
{ |
|||
printf("Error changing into %s, aborting\n", dirname); |
|||
exit(-1); |
|||
} |
|||
|
|||
if (filename_to_extract == NULL) |
|||
return do_extract(uf,opt_do_extract_withoutpath,opt_overwrite,password); |
|||
else |
|||
return do_extract_onefile(uf,filename_to_extract, |
|||
opt_do_extract_withoutpath,opt_overwrite,password); |
|||
} |
|||
unzCloseCurrentFile(uf); |
|||
|
|||
return 0; |
|||
} |
|||
@ -0,0 +1,420 @@ |
|||
/*
|
|||
minizip.c |
|||
Version 1.01e, February 12th, 2005 |
|||
|
|||
Copyright (C) 1998-2005 Gilles Vollant |
|||
*/ |
|||
|
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include <time.h> |
|||
#include <errno.h> |
|||
#include <fcntl.h> |
|||
|
|||
#ifdef unix |
|||
# include <unistd.h> |
|||
# include <utime.h> |
|||
# include <sys/types.h> |
|||
# include <sys/stat.h> |
|||
#else |
|||
# include <direct.h> |
|||
# include <io.h> |
|||
#endif |
|||
|
|||
#include "zip.h" |
|||
|
|||
#ifdef WIN32 |
|||
#define USEWIN32IOAPI |
|||
#include "iowin32.h" |
|||
#endif |
|||
|
|||
|
|||
|
|||
#define WRITEBUFFERSIZE (16384) |
|||
#define MAXFILENAME (256) |
|||
|
|||
#ifdef WIN32 |
|||
uLong filetime(f, tmzip, dt) |
|||
char *f; /* name of file to get info on */ |
|||
tm_zip *tmzip; /* return value: access, modific. and creation times */ |
|||
uLong *dt; /* dostime */ |
|||
{ |
|||
int ret = 0; |
|||
{ |
|||
FILETIME ftLocal; |
|||
HANDLE hFind; |
|||
WIN32_FIND_DATA ff32; |
|||
|
|||
hFind = FindFirstFile(f,&ff32); |
|||
if (hFind != INVALID_HANDLE_VALUE) |
|||
{ |
|||
FileTimeToLocalFileTime(&(ff32.ftLastWriteTime),&ftLocal); |
|||
FileTimeToDosDateTime(&ftLocal,((LPWORD)dt)+1,((LPWORD)dt)+0); |
|||
FindClose(hFind); |
|||
ret = 1; |
|||
} |
|||
} |
|||
return ret; |
|||
} |
|||
#else |
|||
#ifdef unix |
|||
uLong filetime(f, tmzip, dt) |
|||
char *f; /* name of file to get info on */ |
|||
tm_zip *tmzip; /* return value: access, modific. and creation times */ |
|||
uLong *dt; /* dostime */ |
|||
{ |
|||
int ret=0; |
|||
struct stat s; /* results of stat() */ |
|||
struct tm* filedate; |
|||
time_t tm_t=0; |
|||
|
|||
if (strcmp(f,"-")!=0) |
|||
{ |
|||
char name[MAXFILENAME+1]; |
|||
int len = strlen(f); |
|||
if (len > MAXFILENAME) |
|||
len = MAXFILENAME; |
|||
|
|||
strncpy(name, f,MAXFILENAME-1); |
|||
/* strncpy doesnt append the trailing NULL, of the string is too long. */ |
|||
name[ MAXFILENAME ] = '\0'; |
|||
|
|||
if (name[len - 1] == '/') |
|||
name[len - 1] = '\0'; |
|||
/* not all systems allow stat'ing a file with / appended */ |
|||
if (stat(name,&s)==0) |
|||
{ |
|||
tm_t = s.st_mtime; |
|||
ret = 1; |
|||
} |
|||
} |
|||
filedate = localtime(&tm_t); |
|||
|
|||
tmzip->tm_sec = filedate->tm_sec; |
|||
tmzip->tm_min = filedate->tm_min; |
|||
tmzip->tm_hour = filedate->tm_hour; |
|||
tmzip->tm_mday = filedate->tm_mday; |
|||
tmzip->tm_mon = filedate->tm_mon ; |
|||
tmzip->tm_year = filedate->tm_year; |
|||
|
|||
return ret; |
|||
} |
|||
#else |
|||
uLong filetime(f, tmzip, dt) |
|||
char *f; /* name of file to get info on */ |
|||
tm_zip *tmzip; /* return value: access, modific. and creation times */ |
|||
uLong *dt; /* dostime */ |
|||
{ |
|||
return 0; |
|||
} |
|||
#endif |
|||
#endif |
|||
|
|||
|
|||
|
|||
|
|||
int check_exist_file(filename) |
|||
const char* filename; |
|||
{ |
|||
FILE* ftestexist; |
|||
int ret = 1; |
|||
ftestexist = fopen(filename,"rb"); |
|||
if (ftestexist==NULL) |
|||
ret = 0; |
|||
else |
|||
fclose(ftestexist); |
|||
return ret; |
|||
} |
|||
|
|||
void do_banner() |
|||
{ |
|||
printf("MiniZip 1.01b, demo of zLib + Zip package written by Gilles Vollant\n"); |
|||
printf("more info at http://www.winimage.com/zLibDll/unzip.html\n\n"); |
|||
} |
|||
|
|||
void do_help() |
|||
{ |
|||
printf("Usage : minizip [-o] [-a] [-0 to -9] [-p password] file.zip [files_to_add]\n\n" \ |
|||
" -o Overwrite existing file.zip\n" \ |
|||
" -a Append to existing file.zip\n" \ |
|||
" -0 Store only\n" \ |
|||
" -1 Compress faster\n" \ |
|||
" -9 Compress better\n\n"); |
|||
} |
|||
|
|||
/* calculate the CRC32 of a file,
|
|||
because to encrypt a file, we need known the CRC32 of the file before */ |
|||
int getFileCrc(const char* filenameinzip,void*buf,unsigned long size_buf,unsigned long* result_crc) |
|||
{ |
|||
unsigned long calculate_crc=0; |
|||
int err=ZIP_OK; |
|||
FILE * fin = fopen(filenameinzip,"rb"); |
|||
unsigned long size_read = 0; |
|||
unsigned long total_read = 0; |
|||
if (fin==NULL) |
|||
{ |
|||
err = ZIP_ERRNO; |
|||
} |
|||
|
|||
if (err == ZIP_OK) |
|||
do |
|||
{ |
|||
err = ZIP_OK; |
|||
size_read = (int)fread(buf,1,size_buf,fin); |
|||
if (size_read < size_buf) |
|||
if (feof(fin)==0) |
|||
{ |
|||
printf("error in reading %s\n",filenameinzip); |
|||
err = ZIP_ERRNO; |
|||
} |
|||
|
|||
if (size_read>0) |
|||
calculate_crc = crc32(calculate_crc,buf,size_read); |
|||
total_read += size_read; |
|||
|
|||
} while ((err == ZIP_OK) && (size_read>0)); |
|||
|
|||
if (fin) |
|||
fclose(fin); |
|||
|
|||
*result_crc=calculate_crc; |
|||
printf("file %s crc %x\n",filenameinzip,calculate_crc); |
|||
return err; |
|||
} |
|||
|
|||
int main(argc,argv) |
|||
int argc; |
|||
char *argv[]; |
|||
{ |
|||
int i; |
|||
int opt_overwrite=0; |
|||
int opt_compress_level=Z_DEFAULT_COMPRESSION; |
|||
int zipfilenamearg = 0; |
|||
char filename_try[MAXFILENAME+16]; |
|||
int zipok; |
|||
int err=0; |
|||
int size_buf=0; |
|||
void* buf=NULL; |
|||
const char* password=NULL; |
|||
|
|||
|
|||
do_banner(); |
|||
if (argc==1) |
|||
{ |
|||
do_help(); |
|||
return 0; |
|||
} |
|||
else |
|||
{ |
|||
for (i=1;i<argc;i++) |
|||
{ |
|||
if ((*argv[i])=='-') |
|||
{ |
|||
const char *p=argv[i]+1; |
|||
|
|||
while ((*p)!='\0') |
|||
{ |
|||
char c=*(p++);; |
|||
if ((c=='o') || (c=='O')) |
|||
opt_overwrite = 1; |
|||
if ((c=='a') || (c=='A')) |
|||
opt_overwrite = 2; |
|||
if ((c>='0') && (c<='9')) |
|||
opt_compress_level = c-'0'; |
|||
|
|||
if (((c=='p') || (c=='P')) && (i+1<argc)) |
|||
{ |
|||
password=argv[i+1]; |
|||
i++; |
|||
} |
|||
} |
|||
} |
|||
else |
|||
if (zipfilenamearg == 0) |
|||
zipfilenamearg = i ; |
|||
} |
|||
} |
|||
|
|||
size_buf = WRITEBUFFERSIZE; |
|||
buf = (void*)malloc(size_buf); |
|||
if (buf==NULL) |
|||
{ |
|||
printf("Error allocating memory\n"); |
|||
return ZIP_INTERNALERROR; |
|||
} |
|||
|
|||
if (zipfilenamearg==0) |
|||
zipok=0; |
|||
else |
|||
{ |
|||
int i,len; |
|||
int dot_found=0; |
|||
|
|||
zipok = 1 ; |
|||
strncpy(filename_try, argv[zipfilenamearg],MAXFILENAME-1); |
|||
/* strncpy doesnt append the trailing NULL, of the string is too long. */ |
|||
filename_try[ MAXFILENAME ] = '\0'; |
|||
|
|||
len=(int)strlen(filename_try); |
|||
for (i=0;i<len;i++) |
|||
if (filename_try[i]=='.') |
|||
dot_found=1; |
|||
|
|||
if (dot_found==0) |
|||
strcat(filename_try,".zip"); |
|||
|
|||
if (opt_overwrite==2) |
|||
{ |
|||
/* if the file don't exist, we not append file */ |
|||
if (check_exist_file(filename_try)==0) |
|||
opt_overwrite=1; |
|||
} |
|||
else |
|||
if (opt_overwrite==0) |
|||
if (check_exist_file(filename_try)!=0) |
|||
{ |
|||
char rep=0; |
|||
do |
|||
{ |
|||
char answer[128]; |
|||
int ret; |
|||
printf("The file %s exists. Overwrite ? [y]es, [n]o, [a]ppend : ",filename_try); |
|||
ret = scanf("%1s",answer); |
|||
if (ret != 1) |
|||
{ |
|||
exit(EXIT_FAILURE); |
|||
} |
|||
rep = answer[0] ; |
|||
if ((rep>='a') && (rep<='z')) |
|||
rep -= 0x20; |
|||
} |
|||
while ((rep!='Y') && (rep!='N') && (rep!='A')); |
|||
if (rep=='N') |
|||
zipok = 0; |
|||
if (rep=='A') |
|||
opt_overwrite = 2; |
|||
} |
|||
} |
|||
|
|||
if (zipok==1) |
|||
{ |
|||
zipFile zf; |
|||
int errclose; |
|||
# ifdef USEWIN32IOAPI |
|||
zlib_filefunc_def ffunc; |
|||
fill_win32_filefunc(&ffunc); |
|||
zf = zipOpen2(filename_try,(opt_overwrite==2) ? 2 : 0,NULL,&ffunc); |
|||
# else |
|||
zf = zipOpen(filename_try,(opt_overwrite==2) ? 2 : 0); |
|||
# endif |
|||
|
|||
if (zf == NULL) |
|||
{ |
|||
printf("error opening %s\n",filename_try); |
|||
err= ZIP_ERRNO; |
|||
} |
|||
else |
|||
printf("creating %s\n",filename_try); |
|||
|
|||
for (i=zipfilenamearg+1;(i<argc) && (err==ZIP_OK);i++) |
|||
{ |
|||
if (!((((*(argv[i]))=='-') || ((*(argv[i]))=='/')) && |
|||
((argv[i][1]=='o') || (argv[i][1]=='O') || |
|||
(argv[i][1]=='a') || (argv[i][1]=='A') || |
|||
(argv[i][1]=='p') || (argv[i][1]=='P') || |
|||
((argv[i][1]>='0') || (argv[i][1]<='9'))) && |
|||
(strlen(argv[i]) == 2))) |
|||
{ |
|||
FILE * fin; |
|||
int size_read; |
|||
const char* filenameinzip = argv[i]; |
|||
zip_fileinfo zi; |
|||
unsigned long crcFile=0; |
|||
|
|||
zi.tmz_date.tm_sec = zi.tmz_date.tm_min = zi.tmz_date.tm_hour = |
|||
zi.tmz_date.tm_mday = zi.tmz_date.tm_mon = zi.tmz_date.tm_year = 0; |
|||
zi.dosDate = 0; |
|||
zi.internal_fa = 0; |
|||
zi.external_fa = 0; |
|||
filetime(filenameinzip,&zi.tmz_date,&zi.dosDate); |
|||
|
|||
/*
|
|||
err = zipOpenNewFileInZip(zf,filenameinzip,&zi, |
|||
NULL,0,NULL,0,NULL / * comment * /, |
|||
(opt_compress_level != 0) ? Z_DEFLATED : 0, |
|||
opt_compress_level); |
|||
*/ |
|||
if ((password != NULL) && (err==ZIP_OK)) |
|||
err = getFileCrc(filenameinzip,buf,size_buf,&crcFile); |
|||
|
|||
err = zipOpenNewFileInZip3(zf,filenameinzip,&zi, |
|||
NULL,0,NULL,0,NULL /* comment*/, |
|||
(opt_compress_level != 0) ? Z_DEFLATED : 0, |
|||
opt_compress_level,0, |
|||
/* -MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY, */ |
|||
-MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY, |
|||
password,crcFile); |
|||
|
|||
if (err != ZIP_OK) |
|||
printf("error in opening %s in zipfile\n",filenameinzip); |
|||
else |
|||
{ |
|||
fin = fopen(filenameinzip,"rb"); |
|||
if (fin==NULL) |
|||
{ |
|||
err=ZIP_ERRNO; |
|||
printf("error in opening %s for reading\n",filenameinzip); |
|||
} |
|||
} |
|||
|
|||
if (err == ZIP_OK) |
|||
do |
|||
{ |
|||
err = ZIP_OK; |
|||
size_read = (int)fread(buf,1,size_buf,fin); |
|||
if (size_read < size_buf) |
|||
if (feof(fin)==0) |
|||
{ |
|||
printf("error in reading %s\n",filenameinzip); |
|||
err = ZIP_ERRNO; |
|||
} |
|||
|
|||
if (size_read>0) |
|||
{ |
|||
err = zipWriteInFileInZip (zf,buf,size_read); |
|||
if (err<0) |
|||
{ |
|||
printf("error in writing %s in the zipfile\n", |
|||
filenameinzip); |
|||
} |
|||
|
|||
} |
|||
} while ((err == ZIP_OK) && (size_read>0)); |
|||
|
|||
if (fin) |
|||
fclose(fin); |
|||
|
|||
if (err<0) |
|||
err=ZIP_ERRNO; |
|||
else |
|||
{ |
|||
err = zipCloseFileInZip(zf); |
|||
if (err!=ZIP_OK) |
|||
printf("error in closing %s in the zipfile\n", |
|||
filenameinzip); |
|||
} |
|||
} |
|||
} |
|||
errclose = zipClose(zf,NULL); |
|||
if (errclose != ZIP_OK) |
|||
printf("error in closing %s\n",filename_try); |
|||
} |
|||
else |
|||
{ |
|||
do_help(); |
|||
} |
|||
|
|||
free(buf); |
|||
return 0; |
|||
} |
|||
@ -0,0 +1,286 @@ |
|||
/*
|
|||
Additional tools for Minizip |
|||
Code: Xavier Roche '2004 |
|||
License: Same as ZLIB (www.gzip.org) |
|||
*/ |
|||
|
|||
/* Code */ |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
|
|||
#if defined(USE_SYSTEM_ZLIB) |
|||
#include <zlib.h> |
|||
#else |
|||
#include "zlib.h" |
|||
#endif |
|||
#include "unzip.h" |
|||
|
|||
#define READ_8(adr) ((unsigned char)*(adr)) |
|||
#define READ_16(adr) ( READ_8(adr) | (READ_8(adr+1) << 8) ) |
|||
#define READ_32(adr) ( READ_16(adr) | (READ_16((adr)+2) << 16) ) |
|||
|
|||
#define WRITE_8(buff, n) do { \ |
|||
*((unsigned char*)(buff)) = (unsigned char) ((n) & 0xff); \ |
|||
} while(0) |
|||
#define WRITE_16(buff, n) do { \ |
|||
WRITE_8((unsigned char*)(buff), n); \ |
|||
WRITE_8(((unsigned char*)(buff)) + 1, (n) >> 8); \ |
|||
} while(0) |
|||
#define WRITE_32(buff, n) do { \ |
|||
WRITE_16((unsigned char*)(buff), (n) & 0xffff); \ |
|||
WRITE_16((unsigned char*)(buff) + 2, (n) >> 16); \ |
|||
} while(0) |
|||
|
|||
extern int ZEXPORT unzRepair(file, fileOut, fileOutTmp, nRecovered, bytesRecovered) |
|||
const char* file; |
|||
const char* fileOut; |
|||
const char* fileOutTmp; |
|||
uLong* nRecovered; |
|||
uLong* bytesRecovered; |
|||
{ |
|||
int err = Z_OK; |
|||
FILE* fpZip = fopen(file, "rb"); |
|||
FILE* fpOut = fopen(fileOut, "wb"); |
|||
FILE* fpOutCD = fopen(fileOutTmp, "wb"); |
|||
if (fpZip != NULL && fpOut != NULL) { |
|||
int entries = 0; |
|||
uLong totalBytes = 0; |
|||
char header[30]; |
|||
char filename[256]; |
|||
char extra[1024]; |
|||
int offset = 0; |
|||
int offsetCD = 0; |
|||
while ( fread(header, 1, 30, fpZip) == 30 ) { |
|||
int currentOffset = offset; |
|||
|
|||
/* File entry */ |
|||
if (READ_32(header) == 0x04034b50) { |
|||
unsigned int version = READ_16(header + 4); |
|||
unsigned int gpflag = READ_16(header + 6); |
|||
unsigned int method = READ_16(header + 8); |
|||
unsigned int filetime = READ_16(header + 10); |
|||
unsigned int filedate = READ_16(header + 12); |
|||
unsigned int crc = READ_32(header + 14); /* crc */ |
|||
unsigned int cpsize = READ_32(header + 18); /* compressed size */ |
|||
unsigned int uncpsize = READ_32(header + 22); /* uncompressed sz */ |
|||
unsigned int fnsize = READ_16(header + 26); /* file name length */ |
|||
unsigned int extsize = READ_16(header + 28); /* extra field length */ |
|||
filename[0] = extra[0] = '\0'; |
|||
|
|||
/* Header */ |
|||
if (fwrite(header, 1, 30, fpOut) == 30) { |
|||
offset += 30; |
|||
} else { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
|
|||
/* Filename */ |
|||
if (fnsize > 0) { |
|||
if (fread(filename, 1, fnsize, fpZip) == fnsize) { |
|||
if (fwrite(filename, 1, fnsize, fpOut) == fnsize) { |
|||
offset += fnsize; |
|||
} else { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
} else { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
} else { |
|||
err = Z_STREAM_ERROR; |
|||
break; |
|||
} |
|||
|
|||
/* Extra field */ |
|||
if (extsize > 0) { |
|||
if (fread(extra, 1, extsize, fpZip) == extsize) { |
|||
if (fwrite(extra, 1, extsize, fpOut) == extsize) { |
|||
offset += extsize; |
|||
} else { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
} else { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
} |
|||
|
|||
/* Data */ |
|||
{ |
|||
int dataSize = cpsize; |
|||
if (dataSize == 0) { |
|||
dataSize = uncpsize; |
|||
} |
|||
if (dataSize > 0) { |
|||
char* data = malloc(dataSize); |
|||
if (data != NULL) { |
|||
if ((int)fread(data, 1, dataSize, fpZip) == dataSize) { |
|||
if ((int)fwrite(data, 1, dataSize, fpOut) == dataSize) { |
|||
offset += dataSize; |
|||
totalBytes += dataSize; |
|||
} else { |
|||
err = Z_ERRNO; |
|||
} |
|||
} else { |
|||
err = Z_ERRNO; |
|||
} |
|||
free(data); |
|||
if (err != Z_OK) { |
|||
break; |
|||
} |
|||
} else { |
|||
err = Z_MEM_ERROR; |
|||
break; |
|||
} |
|||
} |
|||
} |
|||
|
|||
/* Central directory entry */ |
|||
{ |
|||
char header[46]; |
|||
char* comment = ""; |
|||
int comsize = (int) strlen(comment); |
|||
WRITE_32(header, 0x02014b50); |
|||
WRITE_16(header + 4, version); |
|||
WRITE_16(header + 6, version); |
|||
WRITE_16(header + 8, gpflag); |
|||
WRITE_16(header + 10, method); |
|||
WRITE_16(header + 12, filetime); |
|||
WRITE_16(header + 14, filedate); |
|||
WRITE_32(header + 16, crc); |
|||
WRITE_32(header + 20, cpsize); |
|||
WRITE_32(header + 24, uncpsize); |
|||
WRITE_16(header + 28, fnsize); |
|||
WRITE_16(header + 30, extsize); |
|||
WRITE_16(header + 32, comsize); |
|||
WRITE_16(header + 34, 0); /* disk # */ |
|||
WRITE_16(header + 36, 0); /* int attrb */ |
|||
WRITE_32(header + 38, 0); /* ext attrb */ |
|||
WRITE_32(header + 42, currentOffset); |
|||
/* Header */ |
|||
if (fwrite(header, 1, 46, fpOutCD) == 46) { |
|||
offsetCD += 46; |
|||
|
|||
/* Filename */ |
|||
if (fnsize > 0) { |
|||
if (fwrite(filename, 1, fnsize, fpOutCD) == fnsize) { |
|||
offsetCD += fnsize; |
|||
} else { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
} else { |
|||
err = Z_STREAM_ERROR; |
|||
break; |
|||
} |
|||
|
|||
/* Extra field */ |
|||
if (extsize > 0) { |
|||
if (fwrite(extra, 1, extsize, fpOutCD) == extsize) { |
|||
offsetCD += extsize; |
|||
} else { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
} |
|||
|
|||
/* Comment field */ |
|||
if (comsize > 0) { |
|||
if ((int)fwrite(comment, 1, comsize, fpOutCD) == comsize) { |
|||
offsetCD += comsize; |
|||
} else { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
} |
|||
|
|||
|
|||
} else { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
} |
|||
|
|||
/* Success */ |
|||
entries++; |
|||
|
|||
} else { |
|||
break; |
|||
} |
|||
} |
|||
|
|||
/* Final central directory */ |
|||
{ |
|||
int entriesZip = entries; |
|||
char header[22]; |
|||
char* comment = ""; // "ZIP File recovered by zlib/minizip/mztools";
|
|||
int comsize = (int) strlen(comment); |
|||
if (entriesZip > 0xffff) { |
|||
entriesZip = 0xffff; |
|||
} |
|||
WRITE_32(header, 0x06054b50); |
|||
WRITE_16(header + 4, 0); /* disk # */ |
|||
WRITE_16(header + 6, 0); /* disk # */ |
|||
WRITE_16(header + 8, entriesZip); /* hack */ |
|||
WRITE_16(header + 10, entriesZip); /* hack */ |
|||
WRITE_32(header + 12, offsetCD); /* size of CD */ |
|||
WRITE_32(header + 16, offset); /* offset to CD */ |
|||
WRITE_16(header + 20, comsize); /* comment */ |
|||
|
|||
/* Header */ |
|||
if (fwrite(header, 1, 22, fpOutCD) == 22) { |
|||
|
|||
/* Comment field */ |
|||
if (comsize > 0) { |
|||
if ((int)fwrite(comment, 1, comsize, fpOutCD) != comsize) { |
|||
err = Z_ERRNO; |
|||
} |
|||
} |
|||
|
|||
} else { |
|||
err = Z_ERRNO; |
|||
} |
|||
} |
|||
|
|||
/* Final merge (file + central directory) */ |
|||
fclose(fpOutCD); |
|||
if (err == Z_OK) { |
|||
fpOutCD = fopen(fileOutTmp, "rb"); |
|||
if (fpOutCD != NULL) { |
|||
int nRead; |
|||
char buffer[8192]; |
|||
while ( (nRead = (int)fread(buffer, 1, sizeof(buffer), fpOutCD)) > 0) { |
|||
if ((int)fwrite(buffer, 1, nRead, fpOut) != nRead) { |
|||
err = Z_ERRNO; |
|||
break; |
|||
} |
|||
} |
|||
fclose(fpOutCD); |
|||
} |
|||
} |
|||
|
|||
/* Close */ |
|||
fclose(fpZip); |
|||
fclose(fpOut); |
|||
|
|||
/* Wipe temporary file */ |
|||
(void)remove(fileOutTmp); |
|||
|
|||
/* Number of recovered entries */ |
|||
if (err == Z_OK) { |
|||
if (nRecovered != NULL) { |
|||
*nRecovered = entries; |
|||
} |
|||
if (bytesRecovered != NULL) { |
|||
*bytesRecovered = totalBytes; |
|||
} |
|||
} |
|||
} else { |
|||
err = Z_STREAM_ERROR; |
|||
} |
|||
return err; |
|||
} |
|||
@ -0,0 +1,33 @@ |
|||
/*
|
|||
Additional tools for Minizip |
|||
Code: Xavier Roche '2004 |
|||
License: Same as ZLIB (www.gzip.org) |
|||
*/ |
|||
|
|||
#ifndef _zip_tools_H |
|||
#define _zip_tools_H |
|||
|
|||
#ifdef __cplusplus |
|||
extern "C" { |
|||
#endif |
|||
|
|||
#if defined(USE_SYSTEM_ZLIB) |
|||
#include <zlib.h> |
|||
#else |
|||
#include "zlib.h" |
|||
#endif |
|||
|
|||
#include "unzip.h" |
|||
|
|||
/* Repair a ZIP file (missing central directory)
|
|||
file: file to recover |
|||
fileOut: output file after recovery |
|||
fileOutTmp: temporary file name used for recovery |
|||
*/ |
|||
extern int ZEXPORT unzRepair(const char* file, |
|||
const char* fileOut, |
|||
const char* fileOutTmp, |
|||
uLong* nRecovered, |
|||
uLong* bytesRecovered); |
|||
|
|||
#endif |
|||
File diff suppressed because it is too large
@ -0,0 +1,356 @@ |
|||
/* unzip.h -- IO for uncompress .zip files using zlib
|
|||
Version 1.01e, February 12th, 2005 |
|||
|
|||
Copyright (C) 1998-2005 Gilles Vollant |
|||
|
|||
This unzip package allow extract file from .ZIP file, compatible with PKZip 2.04g |
|||
WinZip, InfoZip tools and compatible. |
|||
|
|||
Multi volume ZipFile (span) are not supported. |
|||
Encryption compatible with pkzip 2.04g only supported |
|||
Old compressions used by old PKZip 1.x are not supported |
|||
|
|||
|
|||
I WAIT FEEDBACK at mail info@winimage.com |
|||
Visit also http://www.winimage.com/zLibDll/unzip.htm for evolution
|
|||
|
|||
Condition of use and distribution are the same than zlib : |
|||
|
|||
This software is provided 'as-is', without any express or implied |
|||
warranty. In no event will the authors be held liable for any damages |
|||
arising from the use of this software. |
|||
|
|||
Permission is granted to anyone to use this software for any purpose, |
|||
including commercial applications, and to alter it and redistribute it |
|||
freely, subject to the following restrictions: |
|||
|
|||
1. The origin of this software must not be misrepresented; you must not |
|||
claim that you wrote the original software. If you use this software |
|||
in a product, an acknowledgment in the product documentation would be |
|||
appreciated but is not required. |
|||
2. Altered source versions must be plainly marked as such, and must not be |
|||
misrepresented as being the original software. |
|||
3. This notice may not be removed or altered from any source distribution. |
|||
|
|||
|
|||
*/ |
|||
|
|||
/* for more info about .ZIP format, see
|
|||
http://www.info-zip.org/pub/infozip/doc/appnote-981119-iz.zip
|
|||
http://www.info-zip.org/pub/infozip/doc/
|
|||
PkWare has also a specification at : |
|||
ftp://ftp.pkware.com/probdesc.zip
|
|||
*/ |
|||
|
|||
#ifndef _unz_H |
|||
#define _unz_H |
|||
|
|||
#ifdef __cplusplus |
|||
extern "C" { |
|||
#endif |
|||
|
|||
#if defined(USE_SYSTEM_ZLIB) |
|||
#include <zlib.h> |
|||
#else |
|||
#include "zlib.h" |
|||
#endif |
|||
|
|||
#ifndef _ZLIBIOAPI_H |
|||
#include "ioapi.h" |
|||
#endif |
|||
|
|||
#if defined(STRICTUNZIP) || defined(STRICTZIPUNZIP) |
|||
/* like the STRICT of WIN32, we define a pointer that cannot be converted
|
|||
from (void*) without cast */ |
|||
typedef struct TagunzFile__ { int unused; } unzFile__; |
|||
typedef unzFile__ *unzFile; |
|||
#else |
|||
typedef voidp unzFile; |
|||
#endif |
|||
|
|||
|
|||
#define UNZ_OK (0) |
|||
#define UNZ_END_OF_LIST_OF_FILE (-100) |
|||
#define UNZ_ERRNO (Z_ERRNO) |
|||
#define UNZ_EOF (0) |
|||
#define UNZ_PARAMERROR (-102) |
|||
#define UNZ_BADZIPFILE (-103) |
|||
#define UNZ_INTERNALERROR (-104) |
|||
#define UNZ_CRCERROR (-105) |
|||
|
|||
/* tm_unz contain date/time info */ |
|||
typedef struct tm_unz_s |
|||
{ |
|||
uInt tm_sec; /* seconds after the minute - [0,59] */ |
|||
uInt tm_min; /* minutes after the hour - [0,59] */ |
|||
uInt tm_hour; /* hours since midnight - [0,23] */ |
|||
uInt tm_mday; /* day of the month - [1,31] */ |
|||
uInt tm_mon; /* months since January - [0,11] */ |
|||
uInt tm_year; /* years - [1980..2044] */ |
|||
} tm_unz; |
|||
|
|||
/* unz_global_info structure contain global data about the ZIPfile
|
|||
These data comes from the end of central dir */ |
|||
typedef struct unz_global_info_s |
|||
{ |
|||
uLong number_entry; /* total number of entries in
|
|||
the central dir on this disk */ |
|||
uLong size_comment; /* size of the global comment of the zipfile */ |
|||
} unz_global_info; |
|||
|
|||
|
|||
/* unz_file_info contain information about a file in the zipfile */ |
|||
typedef struct unz_file_info_s |
|||
{ |
|||
uLong version; /* version made by 2 bytes */ |
|||
uLong version_needed; /* version needed to extract 2 bytes */ |
|||
uLong flag; /* general purpose bit flag 2 bytes */ |
|||
uLong compression_method; /* compression method 2 bytes */ |
|||
uLong dosDate; /* last mod file date in Dos fmt 4 bytes */ |
|||
uLong crc; /* crc-32 4 bytes */ |
|||
uLong compressed_size; /* compressed size 4 bytes */ |
|||
uLong uncompressed_size; /* uncompressed size 4 bytes */ |
|||
uLong size_filename; /* filename length 2 bytes */ |
|||
uLong size_file_extra; /* extra field length 2 bytes */ |
|||
uLong size_file_comment; /* file comment length 2 bytes */ |
|||
|
|||
uLong disk_num_start; /* disk number start 2 bytes */ |
|||
uLong internal_fa; /* internal file attributes 2 bytes */ |
|||
uLong external_fa; /* external file attributes 4 bytes */ |
|||
|
|||
tm_unz tmu_date; |
|||
} unz_file_info; |
|||
|
|||
extern int ZEXPORT unzStringFileNameCompare OF ((const char* fileName1, |
|||
const char* fileName2, |
|||
int iCaseSensitivity)); |
|||
/*
|
|||
Compare two filename (fileName1,fileName2). |
|||
If iCaseSenisivity = 1, comparision is case sensitivity (like strcmp) |
|||
If iCaseSenisivity = 2, comparision is not case sensitivity (like strcmpi |
|||
or strcasecmp) |
|||
If iCaseSenisivity = 0, case sensitivity is defaut of your operating system |
|||
(like 1 on Unix, 2 on Windows) |
|||
*/ |
|||
|
|||
|
|||
extern unzFile ZEXPORT unzOpen OF((const char *path)); |
|||
/*
|
|||
Open a Zip file. path contain the full pathname (by example, |
|||
on a Windows XP computer "c:\\zlib\\zlib113.zip" or on an Unix computer |
|||
"zlib/zlib113.zip". |
|||
If the zipfile cannot be opened (file don't exist or in not valid), the |
|||
return value is NULL. |
|||
Else, the return value is a unzFile Handle, usable with other function |
|||
of this unzip package. |
|||
*/ |
|||
|
|||
extern unzFile ZEXPORT unzOpen2 OF((const char *path, |
|||
zlib_filefunc_def* pzlib_filefunc_def)); |
|||
/*
|
|||
Open a Zip file, like unzOpen, but provide a set of file low level API |
|||
for read/write the zip file (see ioapi.h) |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzClose OF((unzFile file)); |
|||
/*
|
|||
Close a ZipFile opened with unzipOpen. |
|||
If there is files inside the .Zip opened with unzOpenCurrentFile (see later), |
|||
these files MUST be closed with unzipCloseCurrentFile before call unzipClose. |
|||
return UNZ_OK if there is no problem. */ |
|||
|
|||
extern int ZEXPORT unzGetGlobalInfo OF((unzFile file, |
|||
unz_global_info *pglobal_info)); |
|||
/*
|
|||
Write info about the ZipFile in the *pglobal_info structure. |
|||
No preparation of the structure is needed |
|||
return UNZ_OK if there is no problem. */ |
|||
|
|||
|
|||
extern int ZEXPORT unzGetGlobalComment OF((unzFile file, |
|||
char *szComment, |
|||
uLong uSizeBuf)); |
|||
/*
|
|||
Get the global comment string of the ZipFile, in the szComment buffer. |
|||
uSizeBuf is the size of the szComment buffer. |
|||
return the number of byte copied or an error code <0 |
|||
*/ |
|||
|
|||
|
|||
/***************************************************************************/ |
|||
/* Unzip package allow you browse the directory of the zipfile */ |
|||
|
|||
extern int ZEXPORT unzGoToFirstFile OF((unzFile file)); |
|||
/*
|
|||
Set the current file of the zipfile to the first file. |
|||
return UNZ_OK if there is no problem |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzGoToNextFile OF((unzFile file)); |
|||
/*
|
|||
Set the current file of the zipfile to the next file. |
|||
return UNZ_OK if there is no problem |
|||
return UNZ_END_OF_LIST_OF_FILE if the actual file was the latest. |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzLocateFile OF((unzFile file, |
|||
const char *szFileName, |
|||
int iCaseSensitivity)); |
|||
/*
|
|||
Try locate the file szFileName in the zipfile. |
|||
For the iCaseSensitivity signification, see unzStringFileNameCompare |
|||
|
|||
return value : |
|||
UNZ_OK if the file is found. It becomes the current file. |
|||
UNZ_END_OF_LIST_OF_FILE if the file is not found |
|||
*/ |
|||
|
|||
|
|||
/* ****************************************** */ |
|||
/* Ryan supplied functions */ |
|||
/* unz_file_info contain information about a file in the zipfile */ |
|||
typedef struct unz_file_pos_s |
|||
{ |
|||
uLong pos_in_zip_directory; /* offset in zip file directory */ |
|||
uLong num_of_file; /* # of file */ |
|||
} unz_file_pos; |
|||
|
|||
extern int ZEXPORT unzGetFilePos( |
|||
unzFile file, |
|||
unz_file_pos* file_pos); |
|||
|
|||
extern int ZEXPORT unzGoToFilePos( |
|||
unzFile file, |
|||
unz_file_pos* file_pos); |
|||
|
|||
/* ****************************************** */ |
|||
|
|||
extern int ZEXPORT unzGetCurrentFileInfo OF((unzFile file, |
|||
unz_file_info *pfile_info, |
|||
char *szFileName, |
|||
uLong fileNameBufferSize, |
|||
void *extraField, |
|||
uLong extraFieldBufferSize, |
|||
char *szComment, |
|||
uLong commentBufferSize)); |
|||
/*
|
|||
Get Info about the current file |
|||
if pfile_info!=NULL, the *pfile_info structure will contain somes info about |
|||
the current file |
|||
if szFileName!=NULL, the filemane string will be copied in szFileName |
|||
(fileNameBufferSize is the size of the buffer) |
|||
if extraField!=NULL, the extra field information will be copied in extraField |
|||
(extraFieldBufferSize is the size of the buffer). |
|||
This is the Central-header version of the extra field |
|||
if szComment!=NULL, the comment string of the file will be copied in szComment |
|||
(commentBufferSize is the size of the buffer) |
|||
*/ |
|||
|
|||
/***************************************************************************/ |
|||
/* for reading the content of the current zipfile, you can open it, read data
|
|||
from it, and close it (you can close it before reading all the file) |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzOpenCurrentFile OF((unzFile file)); |
|||
/*
|
|||
Open for reading data the current file in the zipfile. |
|||
If there is no error, the return value is UNZ_OK. |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzOpenCurrentFilePassword OF((unzFile file, |
|||
const char* password)); |
|||
/*
|
|||
Open for reading data the current file in the zipfile. |
|||
password is a crypting password |
|||
If there is no error, the return value is UNZ_OK. |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzOpenCurrentFile2 OF((unzFile file, |
|||
int* method, |
|||
int* level, |
|||
int raw)); |
|||
/*
|
|||
Same than unzOpenCurrentFile, but open for read raw the file (not uncompress) |
|||
if raw==1 |
|||
*method will receive method of compression, *level will receive level of |
|||
compression |
|||
note : you can set level parameter as NULL (if you did not want known level, |
|||
but you CANNOT set method parameter as NULL |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzOpenCurrentFile3 OF((unzFile file, |
|||
int* method, |
|||
int* level, |
|||
int raw, |
|||
const char* password)); |
|||
/*
|
|||
Same than unzOpenCurrentFile, but open for read raw the file (not uncompress) |
|||
if raw==1 |
|||
*method will receive method of compression, *level will receive level of |
|||
compression |
|||
note : you can set level parameter as NULL (if you did not want known level, |
|||
but you CANNOT set method parameter as NULL |
|||
*/ |
|||
|
|||
|
|||
extern int ZEXPORT unzCloseCurrentFile OF((unzFile file)); |
|||
/*
|
|||
Close the file in zip opened with unzOpenCurrentFile |
|||
Return UNZ_CRCERROR if all the file was read but the CRC is not good |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzReadCurrentFile OF((unzFile file, |
|||
voidp buf, |
|||
unsigned len)); |
|||
/*
|
|||
Read bytes from the current file (opened by unzOpenCurrentFile) |
|||
buf contain buffer where data must be copied |
|||
len the size of buf. |
|||
|
|||
return the number of byte copied if somes bytes are copied |
|||
return 0 if the end of file was reached |
|||
return <0 with error code if there is an error |
|||
(UNZ_ERRNO for IO error, or zLib error for uncompress error) |
|||
*/ |
|||
|
|||
extern z_off_t ZEXPORT unztell OF((unzFile file)); |
|||
/*
|
|||
Give the current position in uncompressed data |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzeof OF((unzFile file)); |
|||
/*
|
|||
return 1 if the end of file was reached, 0 elsewhere |
|||
*/ |
|||
|
|||
extern int ZEXPORT unzGetLocalExtrafield OF((unzFile file, |
|||
voidp buf, |
|||
unsigned len)); |
|||
/*
|
|||
Read extra field from the current file (opened by unzOpenCurrentFile) |
|||
This is the local-header version of the extra field (sometimes, there is |
|||
more info in the local-header version than in the central-header) |
|||
|
|||
if buf==NULL, it return the size of the local extra field |
|||
|
|||
if buf!=NULL, len is the size of the buffer, the extra header is copied in |
|||
buf. |
|||
the return value is the number of bytes copied in buf, or (if <0) |
|||
the error code |
|||
*/ |
|||
|
|||
/***************************************************************************/ |
|||
|
|||
/* Get the current file offset */ |
|||
extern uLong ZEXPORT unzGetOffset (unzFile file); |
|||
|
|||
/* Set the current file offset */ |
|||
extern int ZEXPORT unzSetOffset (unzFile file, uLong pos); |
|||
|
|||
|
|||
|
|||
#ifdef __cplusplus |
|||
} |
|||
#endif |
|||
|
|||
#endif /* _unz_H */ |
|||
File diff suppressed because it is too large
@ -0,0 +1,237 @@ |
|||
/* zip.h -- IO for compress .zip files using zlib
|
|||
Version 1.01e, February 12th, 2005 |
|||
|
|||
Copyright (C) 1998-2005 Gilles Vollant |
|||
|
|||
This unzip package allow creates .ZIP file, compatible with PKZip 2.04g |
|||
WinZip, InfoZip tools and compatible. |
|||
Multi volume ZipFile (span) are not supported. |
|||
Encryption compatible with pkzip 2.04g only supported |
|||
Old compressions used by old PKZip 1.x are not supported |
|||
|
|||
For uncompress .zip file, look at unzip.h |
|||
|
|||
|
|||
I WAIT FEEDBACK at mail info@winimage.com |
|||
Visit also http://www.winimage.com/zLibDll/unzip.html for evolution
|
|||
|
|||
Condition of use and distribution are the same than zlib : |
|||
|
|||
This software is provided 'as-is', without any express or implied |
|||
warranty. In no event will the authors be held liable for any damages |
|||
arising from the use of this software. |
|||
|
|||
Permission is granted to anyone to use this software for any purpose, |
|||
including commercial applications, and to alter it and redistribute it |
|||
freely, subject to the following restrictions: |
|||
|
|||
1. The origin of this software must not be misrepresented; you must not |
|||
claim that you wrote the original software. If you use this software |
|||
in a product, an acknowledgment in the product documentation would be |
|||
appreciated but is not required. |
|||
2. Altered source versions must be plainly marked as such, and must not be |
|||
misrepresented as being the original software. |
|||
3. This notice may not be removed or altered from any source distribution. |
|||
|
|||
|
|||
*/ |
|||
|
|||
/* for more info about .ZIP format, see
|
|||
http://www.info-zip.org/pub/infozip/doc/appnote-981119-iz.zip
|
|||
http://www.info-zip.org/pub/infozip/doc/
|
|||
PkWare has also a specification at : |
|||
ftp://ftp.pkware.com/probdesc.zip
|
|||
*/ |
|||
|
|||
#ifndef _zip_H |
|||
#define _zip_H |
|||
|
|||
#ifdef __cplusplus |
|||
extern "C" { |
|||
#endif |
|||
|
|||
#if defined(USE_SYSTEM_ZLIB) |
|||
#include <zlib.h> |
|||
#else |
|||
#include "zlib.h" |
|||
#endif |
|||
|
|||
#ifndef _ZLIBIOAPI_H |
|||
#include "ioapi.h" |
|||
#endif |
|||
|
|||
#if defined(STRICTZIP) || defined(STRICTZIPUNZIP) |
|||
/* like the STRICT of WIN32, we define a pointer that cannot be converted
|
|||
from (void*) without cast */ |
|||
typedef struct TagzipFile__ { int unused; } zipFile__; |
|||
typedef zipFile__ *zipFile; |
|||
#else |
|||
typedef voidp zipFile; |
|||
#endif |
|||
|
|||
#define ZIP_OK (0) |
|||
#define ZIP_EOF (0) |
|||
#define ZIP_ERRNO (Z_ERRNO) |
|||
#define ZIP_PARAMERROR (-102) |
|||
#define ZIP_BADZIPFILE (-103) |
|||
#define ZIP_INTERNALERROR (-104) |
|||
|
|||
#ifndef DEF_MEM_LEVEL |
|||
# if MAX_MEM_LEVEL >= 8 |
|||
# define DEF_MEM_LEVEL 8 |
|||
# else |
|||
# define DEF_MEM_LEVEL MAX_MEM_LEVEL |
|||
# endif |
|||
#endif |
|||
/* default memLevel */ |
|||
|
|||
/* tm_zip contain date/time info */ |
|||
typedef struct tm_zip_s |
|||
{ |
|||
uInt tm_sec; /* seconds after the minute - [0,59] */ |
|||
uInt tm_min; /* minutes after the hour - [0,59] */ |
|||
uInt tm_hour; /* hours since midnight - [0,23] */ |
|||
uInt tm_mday; /* day of the month - [1,31] */ |
|||
uInt tm_mon; /* months since January - [0,11] */ |
|||
uInt tm_year; /* years - [1980..2044] */ |
|||
} tm_zip; |
|||
|
|||
typedef struct |
|||
{ |
|||
tm_zip tmz_date; /* date in understandable format */ |
|||
uLong dosDate; /* if dos_date == 0, tmu_date is used */ |
|||
/* uLong flag; */ /* general purpose bit flag 2 bytes */ |
|||
|
|||
uLong internal_fa; /* internal file attributes 2 bytes */ |
|||
uLong external_fa; /* external file attributes 4 bytes */ |
|||
} zip_fileinfo; |
|||
|
|||
typedef const char* zipcharpc; |
|||
|
|||
|
|||
#define APPEND_STATUS_CREATE (0) |
|||
#define APPEND_STATUS_CREATEAFTER (1) |
|||
#define APPEND_STATUS_ADDINZIP (2) |
|||
|
|||
extern zipFile ZEXPORT zipOpen OF((const char *pathname, int append)); |
|||
/*
|
|||
Create a zipfile. |
|||
pathname contain on Windows XP a filename like "c:\\zlib\\zlib113.zip" or on |
|||
an Unix computer "zlib/zlib113.zip". |
|||
if the file pathname exist and append==APPEND_STATUS_CREATEAFTER, the zip |
|||
will be created at the end of the file. |
|||
(useful if the file contain a self extractor code) |
|||
if the file pathname exist and append==APPEND_STATUS_ADDINZIP, we will |
|||
add files in existing zip (be sure you don't add file that doesn't exist) |
|||
If the zipfile cannot be opened, the return value is NULL. |
|||
Else, the return value is a zipFile Handle, usable with other function |
|||
of this zip package. |
|||
*/ |
|||
|
|||
/* Note : there is no delete function into a zipfile.
|
|||
If you want delete file into a zipfile, you must open a zipfile, and create another |
|||
Of couse, you can use RAW reading and writing to copy the file you did not want delte |
|||
*/ |
|||
|
|||
extern zipFile ZEXPORT zipOpen2 OF((const char *pathname, |
|||
int append, |
|||
zipcharpc* globalcomment, |
|||
zlib_filefunc_def* pzlib_filefunc_def)); |
|||
|
|||
extern int ZEXPORT zipOpenNewFileInZip OF((zipFile file, |
|||
const char* filename, |
|||
const zip_fileinfo* zipfi, |
|||
const void* extrafield_local, |
|||
uInt size_extrafield_local, |
|||
const void* extrafield_global, |
|||
uInt size_extrafield_global, |
|||
const char* comment, |
|||
int method, |
|||
int level)); |
|||
/*
|
|||
Open a file in the ZIP for writing. |
|||
filename : the filename in zip (if NULL, '-' without quote will be used |
|||
*zipfi contain supplemental information |
|||
if extrafield_local!=NULL and size_extrafield_local>0, extrafield_local |
|||
contains the extrafield data the the local header |
|||
if extrafield_global!=NULL and size_extrafield_global>0, extrafield_global |
|||
contains the extrafield data the the local header |
|||
if comment != NULL, comment contain the comment string |
|||
method contain the compression method (0 for store, Z_DEFLATED for deflate) |
|||
level contain the level of compression (can be Z_DEFAULT_COMPRESSION) |
|||
*/ |
|||
|
|||
|
|||
extern int ZEXPORT zipOpenNewFileInZip2 OF((zipFile file, |
|||
const char* filename, |
|||
const zip_fileinfo* zipfi, |
|||
const void* extrafield_local, |
|||
uInt size_extrafield_local, |
|||
const void* extrafield_global, |
|||
uInt size_extrafield_global, |
|||
const char* comment, |
|||
int method, |
|||
int level, |
|||
int raw)); |
|||
|
|||
/*
|
|||
Same than zipOpenNewFileInZip, except if raw=1, we write raw file |
|||
*/ |
|||
|
|||
extern int ZEXPORT zipOpenNewFileInZip3 OF((zipFile file, |
|||
const char* filename, |
|||
const zip_fileinfo* zipfi, |
|||
const void* extrafield_local, |
|||
uInt size_extrafield_local, |
|||
const void* extrafield_global, |
|||
uInt size_extrafield_global, |
|||
const char* comment, |
|||
int method, |
|||
int level, |
|||
int raw, |
|||
int windowBits, |
|||
int memLevel, |
|||
int strategy, |
|||
const char* password, |
|||
uLong crcForCtypting)); |
|||
|
|||
/*
|
|||
Same than zipOpenNewFileInZip2, except |
|||
windowBits,memLevel,,strategy : see parameter strategy in deflateInit2 |
|||
password : crypting password (NULL for no crypting) |
|||
crcForCtypting : crc of file to compress (needed for crypting) |
|||
*/ |
|||
|
|||
|
|||
extern int ZEXPORT zipWriteInFileInZip OF((zipFile file, |
|||
const void* buf, |
|||
unsigned len)); |
|||
/*
|
|||
Write data in the zipfile |
|||
*/ |
|||
|
|||
extern int ZEXPORT zipCloseFileInZip OF((zipFile file)); |
|||
/*
|
|||
Close the current file in the zipfile |
|||
*/ |
|||
|
|||
extern int ZEXPORT zipCloseFileInZipRaw OF((zipFile file, |
|||
uLong uncompressed_size, |
|||
uLong crc32)); |
|||
/*
|
|||
Close the current file in the zipfile, for fiel opened with |
|||
parameter raw=1 in zipOpenNewFileInZip2 |
|||
uncompressed_size and crc32 are value for the uncompressed size |
|||
*/ |
|||
|
|||
extern int ZEXPORT zipClose OF((zipFile file, |
|||
const char* global_comment)); |
|||
/*
|
|||
Close the zipfile |
|||
*/ |
|||
|
|||
#ifdef __cplusplus |
|||
} |
|||
#endif |
|||
|
|||
#endif /* _zip_H */ |
|||
@ -0,0 +1,423 @@ |
|||
/* crc32.c -- compute the CRC-32 of a data stream
|
|||
* Copyright (C) 1995-2005 Mark Adler |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
* |
|||
* Thanks to Rodney Brown <rbrown64@csc.com.au> for his contribution of faster |
|||
* CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing |
|||
* tables for updating the shift register in one step with three exclusive-ors |
|||
* instead of four steps with four exclusive-ors. This results in about a |
|||
* factor of two increase in speed on a Power PC G4 (PPC7455) using gcc -O3. |
|||
*/ |
|||
|
|||
/* @(#) $Id: crc32.c,v 3.6 2005/08/04 19:14:14 tor%cs.brown.edu Exp $ */ |
|||
|
|||
/*
|
|||
Note on the use of DYNAMIC_CRC_TABLE: there is no mutex or semaphore |
|||
protection on the static variables used to control the first-use generation |
|||
of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should |
|||
first call get_crc_table() to initialize the tables before allowing more than |
|||
one thread to use crc32(). |
|||
*/ |
|||
|
|||
#ifdef MAKECRCH |
|||
# include <stdio.h> |
|||
# ifndef DYNAMIC_CRC_TABLE |
|||
# define DYNAMIC_CRC_TABLE |
|||
# endif /* !DYNAMIC_CRC_TABLE */ |
|||
#endif /* MAKECRCH */ |
|||
|
|||
#include "zutil.h" /* for STDC and FAR definitions */ |
|||
|
|||
#define local static |
|||
|
|||
/* Find a four-byte integer type for crc32_little() and crc32_big(). */ |
|||
#ifndef NOBYFOUR |
|||
# ifdef STDC /* need ANSI C limits.h to determine sizes */ |
|||
# include <limits.h> |
|||
# define BYFOUR |
|||
# if (UINT_MAX == 0xffffffffUL) |
|||
typedef unsigned int u4; |
|||
# else |
|||
# if (ULONG_MAX == 0xffffffffUL) |
|||
typedef unsigned long u4; |
|||
# else |
|||
# if (USHRT_MAX == 0xffffffffUL) |
|||
typedef unsigned short u4; |
|||
# else |
|||
# undef BYFOUR /* can't find a four-byte integer type! */ |
|||
# endif |
|||
# endif |
|||
# endif |
|||
# endif /* STDC */ |
|||
#endif /* !NOBYFOUR */ |
|||
|
|||
/* Definitions for doing the crc four data bytes at a time. */ |
|||
#ifdef BYFOUR |
|||
# define REV(w) (((w)>>24)+(((w)>>8)&0xff00)+ \ |
|||
(((w)&0xff00)<<8)+(((w)&0xff)<<24)) |
|||
local unsigned long crc32_little OF((unsigned long, |
|||
const unsigned char FAR *, unsigned)); |
|||
local unsigned long crc32_big OF((unsigned long, |
|||
const unsigned char FAR *, unsigned)); |
|||
# define TBLS 8 |
|||
#else |
|||
# define TBLS 1 |
|||
#endif /* BYFOUR */ |
|||
|
|||
/* Local functions for crc concatenation */ |
|||
local unsigned long gf2_matrix_times OF((unsigned long *mat, |
|||
unsigned long vec)); |
|||
local void gf2_matrix_square OF((unsigned long *square, unsigned long *mat)); |
|||
|
|||
#ifdef DYNAMIC_CRC_TABLE |
|||
|
|||
local volatile int crc_table_empty = 1; |
|||
local unsigned long FAR crc_table[TBLS][256]; |
|||
local void make_crc_table OF((void)); |
|||
#ifdef MAKECRCH |
|||
local void write_table OF((FILE *, const unsigned long FAR *)); |
|||
#endif /* MAKECRCH */ |
|||
/*
|
|||
Generate tables for a byte-wise 32-bit CRC calculation on the polynomial: |
|||
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. |
|||
|
|||
Polynomials over GF(2) are represented in binary, one bit per coefficient, |
|||
with the lowest powers in the most significant bit. Then adding polynomials |
|||
is just exclusive-or, and multiplying a polynomial by x is a right shift by |
|||
one. If we call the above polynomial p, and represent a byte as the |
|||
polynomial q, also with the lowest power in the most significant bit (so the |
|||
byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p, |
|||
where a mod b means the remainder after dividing a by b. |
|||
|
|||
This calculation is done using the shift-register method of multiplying and |
|||
taking the remainder. The register is initialized to zero, and for each |
|||
incoming bit, x^32 is added mod p to the register if the bit is a one (where |
|||
x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by |
|||
x (which is shifting right by one and adding x^32 mod p if the bit shifted |
|||
out is a one). We start with the highest power (least significant bit) of |
|||
q and repeat for all eight bits of q. |
|||
|
|||
The first table is simply the CRC of all possible eight bit values. This is |
|||
all the information needed to generate CRCs on data a byte at a time for all |
|||
combinations of CRC register values and incoming bytes. The remaining tables |
|||
allow for word-at-a-time CRC calculation for both big-endian and little- |
|||
endian machines, where a word is four bytes. |
|||
*/ |
|||
local void make_crc_table() |
|||
{ |
|||
unsigned long c; |
|||
int n, k; |
|||
unsigned long poly; /* polynomial exclusive-or pattern */ |
|||
/* terms of polynomial defining this crc (except x^32): */ |
|||
static volatile int first = 1; /* flag to limit concurrent making */ |
|||
static const unsigned char p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26}; |
|||
|
|||
/* See if another task is already doing this (not thread-safe, but better
|
|||
than nothing -- significantly reduces duration of vulnerability in |
|||
case the advice about DYNAMIC_CRC_TABLE is ignored) */ |
|||
if (first) { |
|||
first = 0; |
|||
|
|||
/* make exclusive-or pattern from polynomial (0xedb88320UL) */ |
|||
poly = 0UL; |
|||
for (n = 0; n < sizeof(p)/sizeof(unsigned char); n++) |
|||
poly |= 1UL << (31 - p[n]); |
|||
|
|||
/* generate a crc for every 8-bit value */ |
|||
for (n = 0; n < 256; n++) { |
|||
c = (unsigned long)n; |
|||
for (k = 0; k < 8; k++) |
|||
c = c & 1 ? poly ^ (c >> 1) : c >> 1; |
|||
crc_table[0][n] = c; |
|||
} |
|||
|
|||
#ifdef BYFOUR |
|||
/* generate crc for each value followed by one, two, and three zeros,
|
|||
and then the byte reversal of those as well as the first table */ |
|||
for (n = 0; n < 256; n++) { |
|||
c = crc_table[0][n]; |
|||
crc_table[4][n] = REV(c); |
|||
for (k = 1; k < 4; k++) { |
|||
c = crc_table[0][c & 0xff] ^ (c >> 8); |
|||
crc_table[k][n] = c; |
|||
crc_table[k + 4][n] = REV(c); |
|||
} |
|||
} |
|||
#endif /* BYFOUR */ |
|||
|
|||
crc_table_empty = 0; |
|||
} |
|||
else { /* not first */ |
|||
/* wait for the other guy to finish (not efficient, but rare) */ |
|||
while (crc_table_empty) |
|||
; |
|||
} |
|||
|
|||
#ifdef MAKECRCH |
|||
/* write out CRC tables to crc32.h */ |
|||
{ |
|||
FILE *out; |
|||
|
|||
out = fopen("crc32.h", "w"); |
|||
if (out == NULL) return; |
|||
fprintf(out, "/* crc32.h -- tables for rapid CRC calculation\n"); |
|||
fprintf(out, " * Generated automatically by crc32.c\n */\n\n"); |
|||
fprintf(out, "local const unsigned long FAR "); |
|||
fprintf(out, "crc_table[TBLS][256] =\n{\n {\n"); |
|||
write_table(out, crc_table[0]); |
|||
# ifdef BYFOUR |
|||
fprintf(out, "#ifdef BYFOUR\n"); |
|||
for (k = 1; k < 8; k++) { |
|||
fprintf(out, " },\n {\n"); |
|||
write_table(out, crc_table[k]); |
|||
} |
|||
fprintf(out, "#endif\n"); |
|||
# endif /* BYFOUR */ |
|||
fprintf(out, " }\n};\n"); |
|||
fclose(out); |
|||
} |
|||
#endif /* MAKECRCH */ |
|||
} |
|||
|
|||
#ifdef MAKECRCH |
|||
local void write_table(out, table) |
|||
FILE *out; |
|||
const unsigned long FAR *table; |
|||
{ |
|||
int n; |
|||
|
|||
for (n = 0; n < 256; n++) |
|||
fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : " ", table[n], |
|||
n == 255 ? "\n" : (n % 5 == 4 ? ",\n" : ", ")); |
|||
} |
|||
#endif /* MAKECRCH */ |
|||
|
|||
#else /* !DYNAMIC_CRC_TABLE */ |
|||
/* ========================================================================
|
|||
* Tables of CRC-32s of all single-byte values, made by make_crc_table(). |
|||
*/ |
|||
#include "crc32.h" |
|||
#endif /* DYNAMIC_CRC_TABLE */ |
|||
|
|||
/* =========================================================================
|
|||
* This function can be used by asm versions of crc32() |
|||
*/ |
|||
const unsigned long FAR * ZEXPORT get_crc_table() |
|||
{ |
|||
#ifdef DYNAMIC_CRC_TABLE |
|||
if (crc_table_empty) |
|||
make_crc_table(); |
|||
#endif /* DYNAMIC_CRC_TABLE */ |
|||
return (const unsigned long FAR *)crc_table; |
|||
} |
|||
|
|||
/* ========================================================================= */ |
|||
#define DO1 crc = crc_table[0][((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8) |
|||
#define DO8 DO1; DO1; DO1; DO1; DO1; DO1; DO1; DO1 |
|||
|
|||
/* ========================================================================= */ |
|||
unsigned long ZEXPORT crc32(crc, buf, len) |
|||
unsigned long crc; |
|||
const unsigned char FAR *buf; |
|||
unsigned len; |
|||
{ |
|||
if (buf == Z_NULL) return 0UL; |
|||
|
|||
#ifdef DYNAMIC_CRC_TABLE |
|||
if (crc_table_empty) |
|||
make_crc_table(); |
|||
#endif /* DYNAMIC_CRC_TABLE */ |
|||
|
|||
#ifdef BYFOUR |
|||
if (sizeof(void *) == sizeof(ptrdiff_t)) { |
|||
u4 endian; |
|||
|
|||
endian = 1; |
|||
if (*((unsigned char *)(&endian))) |
|||
return crc32_little(crc, buf, len); |
|||
else |
|||
return crc32_big(crc, buf, len); |
|||
} |
|||
#endif /* BYFOUR */ |
|||
crc = crc ^ 0xffffffffUL; |
|||
while (len >= 8) { |
|||
DO8; |
|||
len -= 8; |
|||
} |
|||
if (len) do { |
|||
DO1; |
|||
} while (--len); |
|||
return crc ^ 0xffffffffUL; |
|||
} |
|||
|
|||
#ifdef BYFOUR |
|||
|
|||
/* ========================================================================= */ |
|||
#define DOLIT4 c ^= *buf4++; \ |
|||
c = crc_table[3][c & 0xff] ^ crc_table[2][(c >> 8) & 0xff] ^ \ |
|||
crc_table[1][(c >> 16) & 0xff] ^ crc_table[0][c >> 24] |
|||
#define DOLIT32 DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4 |
|||
|
|||
/* ========================================================================= */ |
|||
local unsigned long crc32_little(crc, buf, len) |
|||
unsigned long crc; |
|||
const unsigned char FAR *buf; |
|||
unsigned len; |
|||
{ |
|||
register u4 c; |
|||
register const u4 FAR *buf4; |
|||
|
|||
c = (u4)crc; |
|||
c = ~c; |
|||
while (len && ((ptrdiff_t)buf & 3)) { |
|||
c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8); |
|||
len--; |
|||
} |
|||
|
|||
buf4 = (const u4 FAR *)(const void FAR *)buf; |
|||
while (len >= 32) { |
|||
DOLIT32; |
|||
len -= 32; |
|||
} |
|||
while (len >= 4) { |
|||
DOLIT4; |
|||
len -= 4; |
|||
} |
|||
buf = (const unsigned char FAR *)buf4; |
|||
|
|||
if (len) do { |
|||
c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8); |
|||
} while (--len); |
|||
c = ~c; |
|||
return (unsigned long)c; |
|||
} |
|||
|
|||
/* ========================================================================= */ |
|||
#define DOBIG4 c ^= *++buf4; \ |
|||
c = crc_table[4][c & 0xff] ^ crc_table[5][(c >> 8) & 0xff] ^ \ |
|||
crc_table[6][(c >> 16) & 0xff] ^ crc_table[7][c >> 24] |
|||
#define DOBIG32 DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4 |
|||
|
|||
/* ========================================================================= */ |
|||
local unsigned long crc32_big(crc, buf, len) |
|||
unsigned long crc; |
|||
const unsigned char FAR *buf; |
|||
unsigned len; |
|||
{ |
|||
register u4 c; |
|||
register const u4 FAR *buf4; |
|||
|
|||
c = REV((u4)crc); |
|||
c = ~c; |
|||
while (len && ((ptrdiff_t)buf & 3)) { |
|||
c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8); |
|||
len--; |
|||
} |
|||
|
|||
buf4 = (const u4 FAR *)(const void FAR *)buf; |
|||
buf4--; |
|||
while (len >= 32) { |
|||
DOBIG32; |
|||
len -= 32; |
|||
} |
|||
while (len >= 4) { |
|||
DOBIG4; |
|||
len -= 4; |
|||
} |
|||
buf4++; |
|||
buf = (const unsigned char FAR *)buf4; |
|||
|
|||
if (len) do { |
|||
c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8); |
|||
} while (--len); |
|||
c = ~c; |
|||
return (unsigned long)(REV(c)); |
|||
} |
|||
|
|||
#endif /* BYFOUR */ |
|||
|
|||
#define GF2_DIM 32 /* dimension of GF(2) vectors (length of CRC) */ |
|||
|
|||
/* ========================================================================= */ |
|||
local unsigned long gf2_matrix_times(mat, vec) |
|||
unsigned long *mat; |
|||
unsigned long vec; |
|||
{ |
|||
unsigned long sum; |
|||
|
|||
sum = 0; |
|||
while (vec) { |
|||
if (vec & 1) |
|||
sum ^= *mat; |
|||
vec >>= 1; |
|||
mat++; |
|||
} |
|||
return sum; |
|||
} |
|||
|
|||
/* ========================================================================= */ |
|||
local void gf2_matrix_square(square, mat) |
|||
unsigned long *square; |
|||
unsigned long *mat; |
|||
{ |
|||
int n; |
|||
|
|||
for (n = 0; n < GF2_DIM; n++) |
|||
square[n] = gf2_matrix_times(mat, mat[n]); |
|||
} |
|||
|
|||
/* ========================================================================= */ |
|||
uLong ZEXPORT crc32_combine(crc1, crc2, len2) |
|||
uLong crc1; |
|||
uLong crc2; |
|||
z_off_t len2; |
|||
{ |
|||
int n; |
|||
unsigned long row; |
|||
unsigned long even[GF2_DIM]; /* even-power-of-two zeros operator */ |
|||
unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ |
|||
|
|||
/* degenerate case */ |
|||
if (len2 == 0) |
|||
return crc1; |
|||
|
|||
/* put operator for one zero bit in odd */ |
|||
odd[0] = 0xedb88320L; /* CRC-32 polynomial */ |
|||
row = 1; |
|||
for (n = 1; n < GF2_DIM; n++) { |
|||
odd[n] = row; |
|||
row <<= 1; |
|||
} |
|||
|
|||
/* put operator for two zero bits in even */ |
|||
gf2_matrix_square(even, odd); |
|||
|
|||
/* put operator for four zero bits in odd */ |
|||
gf2_matrix_square(odd, even); |
|||
|
|||
/* apply len2 zeros to crc1 (first square will put the operator for one
|
|||
zero byte, eight zero bits, in even) */ |
|||
do { |
|||
/* apply zeros operator for this bit of len2 */ |
|||
gf2_matrix_square(even, odd); |
|||
if (len2 & 1) |
|||
crc1 = gf2_matrix_times(even, crc1); |
|||
len2 >>= 1; |
|||
|
|||
/* if no more bits set, then done */ |
|||
if (len2 == 0) |
|||
break; |
|||
|
|||
/* another iteration of the loop with odd and even swapped */ |
|||
gf2_matrix_square(odd, even); |
|||
if (len2 & 1) |
|||
crc1 = gf2_matrix_times(odd, crc1); |
|||
len2 >>= 1; |
|||
|
|||
/* if no more bits set, then done */ |
|||
} while (len2 != 0); |
|||
|
|||
/* return combined crc */ |
|||
crc1 ^= crc2; |
|||
return crc1; |
|||
} |
|||
@ -0,0 +1,441 @@ |
|||
/* crc32.h -- tables for rapid CRC calculation
|
|||
* Generated automatically by crc32.c |
|||
*/ |
|||
|
|||
local const unsigned long FAR crc_table[TBLS][256] = |
|||
{ |
|||
{ |
|||
0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL, |
|||
0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL, |
|||
0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL, |
|||
0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL, |
|||
0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL, |
|||
0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL, |
|||
0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL, |
|||
0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL, |
|||
0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL, |
|||
0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL, |
|||
0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL, |
|||
0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL, |
|||
0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL, |
|||
0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL, |
|||
0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL, |
|||
0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL, |
|||
0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL, |
|||
0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL, |
|||
0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL, |
|||
0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL, |
|||
0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL, |
|||
0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL, |
|||
0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL, |
|||
0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL, |
|||
0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL, |
|||
0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL, |
|||
0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL, |
|||
0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL, |
|||
0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL, |
|||
0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL, |
|||
0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL, |
|||
0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL, |
|||
0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL, |
|||
0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL, |
|||
0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL, |
|||
0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL, |
|||
0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL, |
|||
0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL, |
|||
0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL, |
|||
0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL, |
|||
0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL, |
|||
0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL, |
|||
0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL, |
|||
0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL, |
|||
0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL, |
|||
0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL, |
|||
0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL, |
|||
0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL, |
|||
0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL, |
|||
0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
|||
0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
|||
0x2d02ef8dUL |
|||
#ifdef BYFOUR |
|||
}, |
|||
{ |
|||
0x00000000UL, 0x191b3141UL, 0x32366282UL, 0x2b2d53c3UL, 0x646cc504UL, |
|||
0x7d77f445UL, 0x565aa786UL, 0x4f4196c7UL, 0xc8d98a08UL, 0xd1c2bb49UL, |
|||
0xfaefe88aUL, 0xe3f4d9cbUL, 0xacb54f0cUL, 0xb5ae7e4dUL, 0x9e832d8eUL, |
|||
0x87981ccfUL, 0x4ac21251UL, 0x53d92310UL, 0x78f470d3UL, 0x61ef4192UL, |
|||
0x2eaed755UL, 0x37b5e614UL, 0x1c98b5d7UL, 0x05838496UL, 0x821b9859UL, |
|||
0x9b00a918UL, 0xb02dfadbUL, 0xa936cb9aUL, 0xe6775d5dUL, 0xff6c6c1cUL, |
|||
0xd4413fdfUL, 0xcd5a0e9eUL, 0x958424a2UL, 0x8c9f15e3UL, 0xa7b24620UL, |
|||
0xbea97761UL, 0xf1e8e1a6UL, 0xe8f3d0e7UL, 0xc3de8324UL, 0xdac5b265UL, |
|||
0x5d5daeaaUL, 0x44469febUL, 0x6f6bcc28UL, 0x7670fd69UL, 0x39316baeUL, |
|||
0x202a5aefUL, 0x0b07092cUL, 0x121c386dUL, 0xdf4636f3UL, 0xc65d07b2UL, |
|||
0xed705471UL, 0xf46b6530UL, 0xbb2af3f7UL, 0xa231c2b6UL, 0x891c9175UL, |
|||
0x9007a034UL, 0x179fbcfbUL, 0x0e848dbaUL, 0x25a9de79UL, 0x3cb2ef38UL, |
|||
0x73f379ffUL, 0x6ae848beUL, 0x41c51b7dUL, 0x58de2a3cUL, 0xf0794f05UL, |
|||
0xe9627e44UL, 0xc24f2d87UL, 0xdb541cc6UL, 0x94158a01UL, 0x8d0ebb40UL, |
|||
0xa623e883UL, 0xbf38d9c2UL, 0x38a0c50dUL, 0x21bbf44cUL, 0x0a96a78fUL, |
|||
0x138d96ceUL, 0x5ccc0009UL, 0x45d73148UL, 0x6efa628bUL, 0x77e153caUL, |
|||
0xbabb5d54UL, 0xa3a06c15UL, 0x888d3fd6UL, 0x91960e97UL, 0xded79850UL, |
|||
0xc7cca911UL, 0xece1fad2UL, 0xf5facb93UL, 0x7262d75cUL, 0x6b79e61dUL, |
|||
0x4054b5deUL, 0x594f849fUL, 0x160e1258UL, 0x0f152319UL, 0x243870daUL, |
|||
0x3d23419bUL, 0x65fd6ba7UL, 0x7ce65ae6UL, 0x57cb0925UL, 0x4ed03864UL, |
|||
0x0191aea3UL, 0x188a9fe2UL, 0x33a7cc21UL, 0x2abcfd60UL, 0xad24e1afUL, |
|||
0xb43fd0eeUL, 0x9f12832dUL, 0x8609b26cUL, 0xc94824abUL, 0xd05315eaUL, |
|||
0xfb7e4629UL, 0xe2657768UL, 0x2f3f79f6UL, 0x362448b7UL, 0x1d091b74UL, |
|||
0x04122a35UL, 0x4b53bcf2UL, 0x52488db3UL, 0x7965de70UL, 0x607eef31UL, |
|||
0xe7e6f3feUL, 0xfefdc2bfUL, 0xd5d0917cUL, 0xcccba03dUL, 0x838a36faUL, |
|||
0x9a9107bbUL, 0xb1bc5478UL, 0xa8a76539UL, 0x3b83984bUL, 0x2298a90aUL, |
|||
0x09b5fac9UL, 0x10aecb88UL, 0x5fef5d4fUL, 0x46f46c0eUL, 0x6dd93fcdUL, |
|||
0x74c20e8cUL, 0xf35a1243UL, 0xea412302UL, 0xc16c70c1UL, 0xd8774180UL, |
|||
0x9736d747UL, 0x8e2de606UL, 0xa500b5c5UL, 0xbc1b8484UL, 0x71418a1aUL, |
|||
0x685abb5bUL, 0x4377e898UL, 0x5a6cd9d9UL, 0x152d4f1eUL, 0x0c367e5fUL, |
|||
0x271b2d9cUL, 0x3e001cddUL, 0xb9980012UL, 0xa0833153UL, 0x8bae6290UL, |
|||
0x92b553d1UL, 0xddf4c516UL, 0xc4eff457UL, 0xefc2a794UL, 0xf6d996d5UL, |
|||
0xae07bce9UL, 0xb71c8da8UL, 0x9c31de6bUL, 0x852aef2aUL, 0xca6b79edUL, |
|||
0xd37048acUL, 0xf85d1b6fUL, 0xe1462a2eUL, 0x66de36e1UL, 0x7fc507a0UL, |
|||
0x54e85463UL, 0x4df36522UL, 0x02b2f3e5UL, 0x1ba9c2a4UL, 0x30849167UL, |
|||
0x299fa026UL, 0xe4c5aeb8UL, 0xfdde9ff9UL, 0xd6f3cc3aUL, 0xcfe8fd7bUL, |
|||
0x80a96bbcUL, 0x99b25afdUL, 0xb29f093eUL, 0xab84387fUL, 0x2c1c24b0UL, |
|||
0x350715f1UL, 0x1e2a4632UL, 0x07317773UL, 0x4870e1b4UL, 0x516bd0f5UL, |
|||
0x7a468336UL, 0x635db277UL, 0xcbfad74eUL, 0xd2e1e60fUL, 0xf9ccb5ccUL, |
|||
0xe0d7848dUL, 0xaf96124aUL, 0xb68d230bUL, 0x9da070c8UL, 0x84bb4189UL, |
|||
0x03235d46UL, 0x1a386c07UL, 0x31153fc4UL, 0x280e0e85UL, 0x674f9842UL, |
|||
0x7e54a903UL, 0x5579fac0UL, 0x4c62cb81UL, 0x8138c51fUL, 0x9823f45eUL, |
|||
0xb30ea79dUL, 0xaa1596dcUL, 0xe554001bUL, 0xfc4f315aUL, 0xd7626299UL, |
|||
0xce7953d8UL, 0x49e14f17UL, 0x50fa7e56UL, 0x7bd72d95UL, 0x62cc1cd4UL, |
|||
0x2d8d8a13UL, 0x3496bb52UL, 0x1fbbe891UL, 0x06a0d9d0UL, 0x5e7ef3ecUL, |
|||
0x4765c2adUL, 0x6c48916eUL, 0x7553a02fUL, 0x3a1236e8UL, 0x230907a9UL, |
|||
0x0824546aUL, 0x113f652bUL, 0x96a779e4UL, 0x8fbc48a5UL, 0xa4911b66UL, |
|||
0xbd8a2a27UL, 0xf2cbbce0UL, 0xebd08da1UL, 0xc0fdde62UL, 0xd9e6ef23UL, |
|||
0x14bce1bdUL, 0x0da7d0fcUL, 0x268a833fUL, 0x3f91b27eUL, 0x70d024b9UL, |
|||
0x69cb15f8UL, 0x42e6463bUL, 0x5bfd777aUL, 0xdc656bb5UL, 0xc57e5af4UL, |
|||
0xee530937UL, 0xf7483876UL, 0xb809aeb1UL, 0xa1129ff0UL, 0x8a3fcc33UL, |
|||
0x9324fd72UL |
|||
}, |
|||
{ |
|||
0x00000000UL, 0x01c26a37UL, 0x0384d46eUL, 0x0246be59UL, 0x0709a8dcUL, |
|||
0x06cbc2ebUL, 0x048d7cb2UL, 0x054f1685UL, 0x0e1351b8UL, 0x0fd13b8fUL, |
|||
0x0d9785d6UL, 0x0c55efe1UL, 0x091af964UL, 0x08d89353UL, 0x0a9e2d0aUL, |
|||
0x0b5c473dUL, 0x1c26a370UL, 0x1de4c947UL, 0x1fa2771eUL, 0x1e601d29UL, |
|||
0x1b2f0bacUL, 0x1aed619bUL, 0x18abdfc2UL, 0x1969b5f5UL, 0x1235f2c8UL, |
|||
0x13f798ffUL, 0x11b126a6UL, 0x10734c91UL, 0x153c5a14UL, 0x14fe3023UL, |
|||
0x16b88e7aUL, 0x177ae44dUL, 0x384d46e0UL, 0x398f2cd7UL, 0x3bc9928eUL, |
|||
0x3a0bf8b9UL, 0x3f44ee3cUL, 0x3e86840bUL, 0x3cc03a52UL, 0x3d025065UL, |
|||
0x365e1758UL, 0x379c7d6fUL, 0x35dac336UL, 0x3418a901UL, 0x3157bf84UL, |
|||
0x3095d5b3UL, 0x32d36beaUL, 0x331101ddUL, 0x246be590UL, 0x25a98fa7UL, |
|||
0x27ef31feUL, 0x262d5bc9UL, 0x23624d4cUL, 0x22a0277bUL, 0x20e69922UL, |
|||
0x2124f315UL, 0x2a78b428UL, 0x2bbade1fUL, 0x29fc6046UL, 0x283e0a71UL, |
|||
0x2d711cf4UL, 0x2cb376c3UL, 0x2ef5c89aUL, 0x2f37a2adUL, 0x709a8dc0UL, |
|||
0x7158e7f7UL, 0x731e59aeUL, 0x72dc3399UL, 0x7793251cUL, 0x76514f2bUL, |
|||
0x7417f172UL, 0x75d59b45UL, 0x7e89dc78UL, 0x7f4bb64fUL, 0x7d0d0816UL, |
|||
0x7ccf6221UL, 0x798074a4UL, 0x78421e93UL, 0x7a04a0caUL, 0x7bc6cafdUL, |
|||
0x6cbc2eb0UL, 0x6d7e4487UL, 0x6f38fadeUL, 0x6efa90e9UL, 0x6bb5866cUL, |
|||
0x6a77ec5bUL, 0x68315202UL, 0x69f33835UL, 0x62af7f08UL, 0x636d153fUL, |
|||
0x612bab66UL, 0x60e9c151UL, 0x65a6d7d4UL, 0x6464bde3UL, 0x662203baUL, |
|||
0x67e0698dUL, 0x48d7cb20UL, 0x4915a117UL, 0x4b531f4eUL, 0x4a917579UL, |
|||
0x4fde63fcUL, 0x4e1c09cbUL, 0x4c5ab792UL, 0x4d98dda5UL, 0x46c49a98UL, |
|||
0x4706f0afUL, 0x45404ef6UL, 0x448224c1UL, 0x41cd3244UL, 0x400f5873UL, |
|||
0x4249e62aUL, 0x438b8c1dUL, 0x54f16850UL, 0x55330267UL, 0x5775bc3eUL, |
|||
0x56b7d609UL, 0x53f8c08cUL, 0x523aaabbUL, 0x507c14e2UL, 0x51be7ed5UL, |
|||
0x5ae239e8UL, 0x5b2053dfUL, 0x5966ed86UL, 0x58a487b1UL, 0x5deb9134UL, |
|||
0x5c29fb03UL, 0x5e6f455aUL, 0x5fad2f6dUL, 0xe1351b80UL, 0xe0f771b7UL, |
|||
0xe2b1cfeeUL, 0xe373a5d9UL, 0xe63cb35cUL, 0xe7fed96bUL, 0xe5b86732UL, |
|||
0xe47a0d05UL, 0xef264a38UL, 0xeee4200fUL, 0xeca29e56UL, 0xed60f461UL, |
|||
0xe82fe2e4UL, 0xe9ed88d3UL, 0xebab368aUL, 0xea695cbdUL, 0xfd13b8f0UL, |
|||
0xfcd1d2c7UL, 0xfe976c9eUL, 0xff5506a9UL, 0xfa1a102cUL, 0xfbd87a1bUL, |
|||
0xf99ec442UL, 0xf85cae75UL, 0xf300e948UL, 0xf2c2837fUL, 0xf0843d26UL, |
|||
0xf1465711UL, 0xf4094194UL, 0xf5cb2ba3UL, 0xf78d95faUL, 0xf64fffcdUL, |
|||
0xd9785d60UL, 0xd8ba3757UL, 0xdafc890eUL, 0xdb3ee339UL, 0xde71f5bcUL, |
|||
0xdfb39f8bUL, 0xddf521d2UL, 0xdc374be5UL, 0xd76b0cd8UL, 0xd6a966efUL, |
|||
0xd4efd8b6UL, 0xd52db281UL, 0xd062a404UL, 0xd1a0ce33UL, 0xd3e6706aUL, |
|||
0xd2241a5dUL, 0xc55efe10UL, 0xc49c9427UL, 0xc6da2a7eUL, 0xc7184049UL, |
|||
0xc25756ccUL, 0xc3953cfbUL, 0xc1d382a2UL, 0xc011e895UL, 0xcb4dafa8UL, |
|||
0xca8fc59fUL, 0xc8c97bc6UL, 0xc90b11f1UL, 0xcc440774UL, 0xcd866d43UL, |
|||
0xcfc0d31aUL, 0xce02b92dUL, 0x91af9640UL, 0x906dfc77UL, 0x922b422eUL, |
|||
0x93e92819UL, 0x96a63e9cUL, 0x976454abUL, 0x9522eaf2UL, 0x94e080c5UL, |
|||
0x9fbcc7f8UL, 0x9e7eadcfUL, 0x9c381396UL, 0x9dfa79a1UL, 0x98b56f24UL, |
|||
0x99770513UL, 0x9b31bb4aUL, 0x9af3d17dUL, 0x8d893530UL, 0x8c4b5f07UL, |
|||
0x8e0de15eUL, 0x8fcf8b69UL, 0x8a809decUL, 0x8b42f7dbUL, 0x89044982UL, |
|||
0x88c623b5UL, 0x839a6488UL, 0x82580ebfUL, 0x801eb0e6UL, 0x81dcdad1UL, |
|||
0x8493cc54UL, 0x8551a663UL, 0x8717183aUL, 0x86d5720dUL, 0xa9e2d0a0UL, |
|||
0xa820ba97UL, 0xaa6604ceUL, 0xaba46ef9UL, 0xaeeb787cUL, 0xaf29124bUL, |
|||
0xad6fac12UL, 0xacadc625UL, 0xa7f18118UL, 0xa633eb2fUL, 0xa4755576UL, |
|||
0xa5b73f41UL, 0xa0f829c4UL, 0xa13a43f3UL, 0xa37cfdaaUL, 0xa2be979dUL, |
|||
0xb5c473d0UL, 0xb40619e7UL, 0xb640a7beUL, 0xb782cd89UL, 0xb2cddb0cUL, |
|||
0xb30fb13bUL, 0xb1490f62UL, 0xb08b6555UL, 0xbbd72268UL, 0xba15485fUL, |
|||
0xb853f606UL, 0xb9919c31UL, 0xbcde8ab4UL, 0xbd1ce083UL, 0xbf5a5edaUL, |
|||
0xbe9834edUL |
|||
}, |
|||
{ |
|||
0x00000000UL, 0xb8bc6765UL, 0xaa09c88bUL, 0x12b5afeeUL, 0x8f629757UL, |
|||
0x37def032UL, 0x256b5fdcUL, 0x9dd738b9UL, 0xc5b428efUL, 0x7d084f8aUL, |
|||
0x6fbde064UL, 0xd7018701UL, 0x4ad6bfb8UL, 0xf26ad8ddUL, 0xe0df7733UL, |
|||
0x58631056UL, 0x5019579fUL, 0xe8a530faUL, 0xfa109f14UL, 0x42acf871UL, |
|||
0xdf7bc0c8UL, 0x67c7a7adUL, 0x75720843UL, 0xcdce6f26UL, 0x95ad7f70UL, |
|||
0x2d111815UL, 0x3fa4b7fbUL, 0x8718d09eUL, 0x1acfe827UL, 0xa2738f42UL, |
|||
0xb0c620acUL, 0x087a47c9UL, 0xa032af3eUL, 0x188ec85bUL, 0x0a3b67b5UL, |
|||
0xb28700d0UL, 0x2f503869UL, 0x97ec5f0cUL, 0x8559f0e2UL, 0x3de59787UL, |
|||
0x658687d1UL, 0xdd3ae0b4UL, 0xcf8f4f5aUL, 0x7733283fUL, 0xeae41086UL, |
|||
0x525877e3UL, 0x40edd80dUL, 0xf851bf68UL, 0xf02bf8a1UL, 0x48979fc4UL, |
|||
0x5a22302aUL, 0xe29e574fUL, 0x7f496ff6UL, 0xc7f50893UL, 0xd540a77dUL, |
|||
0x6dfcc018UL, 0x359fd04eUL, 0x8d23b72bUL, 0x9f9618c5UL, 0x272a7fa0UL, |
|||
0xbafd4719UL, 0x0241207cUL, 0x10f48f92UL, 0xa848e8f7UL, 0x9b14583dUL, |
|||
0x23a83f58UL, 0x311d90b6UL, 0x89a1f7d3UL, 0x1476cf6aUL, 0xaccaa80fUL, |
|||
0xbe7f07e1UL, 0x06c36084UL, 0x5ea070d2UL, 0xe61c17b7UL, 0xf4a9b859UL, |
|||
0x4c15df3cUL, 0xd1c2e785UL, 0x697e80e0UL, 0x7bcb2f0eUL, 0xc377486bUL, |
|||
0xcb0d0fa2UL, 0x73b168c7UL, 0x6104c729UL, 0xd9b8a04cUL, 0x446f98f5UL, |
|||
0xfcd3ff90UL, 0xee66507eUL, 0x56da371bUL, 0x0eb9274dUL, 0xb6054028UL, |
|||
0xa4b0efc6UL, 0x1c0c88a3UL, 0x81dbb01aUL, 0x3967d77fUL, 0x2bd27891UL, |
|||
0x936e1ff4UL, 0x3b26f703UL, 0x839a9066UL, 0x912f3f88UL, 0x299358edUL, |
|||
0xb4446054UL, 0x0cf80731UL, 0x1e4da8dfUL, 0xa6f1cfbaUL, 0xfe92dfecUL, |
|||
0x462eb889UL, 0x549b1767UL, 0xec277002UL, 0x71f048bbUL, 0xc94c2fdeUL, |
|||
0xdbf98030UL, 0x6345e755UL, 0x6b3fa09cUL, 0xd383c7f9UL, 0xc1366817UL, |
|||
0x798a0f72UL, 0xe45d37cbUL, 0x5ce150aeUL, 0x4e54ff40UL, 0xf6e89825UL, |
|||
0xae8b8873UL, 0x1637ef16UL, 0x048240f8UL, 0xbc3e279dUL, 0x21e91f24UL, |
|||
0x99557841UL, 0x8be0d7afUL, 0x335cb0caUL, 0xed59b63bUL, 0x55e5d15eUL, |
|||
0x47507eb0UL, 0xffec19d5UL, 0x623b216cUL, 0xda874609UL, 0xc832e9e7UL, |
|||
0x708e8e82UL, 0x28ed9ed4UL, 0x9051f9b1UL, 0x82e4565fUL, 0x3a58313aUL, |
|||
0xa78f0983UL, 0x1f336ee6UL, 0x0d86c108UL, 0xb53aa66dUL, 0xbd40e1a4UL, |
|||
0x05fc86c1UL, 0x1749292fUL, 0xaff54e4aUL, 0x322276f3UL, 0x8a9e1196UL, |
|||
0x982bbe78UL, 0x2097d91dUL, 0x78f4c94bUL, 0xc048ae2eUL, 0xd2fd01c0UL, |
|||
0x6a4166a5UL, 0xf7965e1cUL, 0x4f2a3979UL, 0x5d9f9697UL, 0xe523f1f2UL, |
|||
0x4d6b1905UL, 0xf5d77e60UL, 0xe762d18eUL, 0x5fdeb6ebUL, 0xc2098e52UL, |
|||
0x7ab5e937UL, 0x680046d9UL, 0xd0bc21bcUL, 0x88df31eaUL, 0x3063568fUL, |
|||
0x22d6f961UL, 0x9a6a9e04UL, 0x07bda6bdUL, 0xbf01c1d8UL, 0xadb46e36UL, |
|||
0x15080953UL, 0x1d724e9aUL, 0xa5ce29ffUL, 0xb77b8611UL, 0x0fc7e174UL, |
|||
0x9210d9cdUL, 0x2aacbea8UL, 0x38191146UL, 0x80a57623UL, 0xd8c66675UL, |
|||
0x607a0110UL, 0x72cfaefeUL, 0xca73c99bUL, 0x57a4f122UL, 0xef189647UL, |
|||
0xfdad39a9UL, 0x45115eccUL, 0x764dee06UL, 0xcef18963UL, 0xdc44268dUL, |
|||
0x64f841e8UL, 0xf92f7951UL, 0x41931e34UL, 0x5326b1daUL, 0xeb9ad6bfUL, |
|||
0xb3f9c6e9UL, 0x0b45a18cUL, 0x19f00e62UL, 0xa14c6907UL, 0x3c9b51beUL, |
|||
0x842736dbUL, 0x96929935UL, 0x2e2efe50UL, 0x2654b999UL, 0x9ee8defcUL, |
|||
0x8c5d7112UL, 0x34e11677UL, 0xa9362eceUL, 0x118a49abUL, 0x033fe645UL, |
|||
0xbb838120UL, 0xe3e09176UL, 0x5b5cf613UL, 0x49e959fdUL, 0xf1553e98UL, |
|||
0x6c820621UL, 0xd43e6144UL, 0xc68bceaaUL, 0x7e37a9cfUL, 0xd67f4138UL, |
|||
0x6ec3265dUL, 0x7c7689b3UL, 0xc4caeed6UL, 0x591dd66fUL, 0xe1a1b10aUL, |
|||
0xf3141ee4UL, 0x4ba87981UL, 0x13cb69d7UL, 0xab770eb2UL, 0xb9c2a15cUL, |
|||
0x017ec639UL, 0x9ca9fe80UL, 0x241599e5UL, 0x36a0360bUL, 0x8e1c516eUL, |
|||
0x866616a7UL, 0x3eda71c2UL, 0x2c6fde2cUL, 0x94d3b949UL, 0x090481f0UL, |
|||
0xb1b8e695UL, 0xa30d497bUL, 0x1bb12e1eUL, 0x43d23e48UL, 0xfb6e592dUL, |
|||
0xe9dbf6c3UL, 0x516791a6UL, 0xccb0a91fUL, 0x740cce7aUL, 0x66b96194UL, |
|||
0xde0506f1UL |
|||
}, |
|||
{ |
|||
0x00000000UL, 0x96300777UL, 0x2c610eeeUL, 0xba510999UL, 0x19c46d07UL, |
|||
0x8ff46a70UL, 0x35a563e9UL, 0xa395649eUL, 0x3288db0eUL, 0xa4b8dc79UL, |
|||
0x1ee9d5e0UL, 0x88d9d297UL, 0x2b4cb609UL, 0xbd7cb17eUL, 0x072db8e7UL, |
|||
0x911dbf90UL, 0x6410b71dUL, 0xf220b06aUL, 0x4871b9f3UL, 0xde41be84UL, |
|||
0x7dd4da1aUL, 0xebe4dd6dUL, 0x51b5d4f4UL, 0xc785d383UL, 0x56986c13UL, |
|||
0xc0a86b64UL, 0x7af962fdUL, 0xecc9658aUL, 0x4f5c0114UL, 0xd96c0663UL, |
|||
0x633d0ffaUL, 0xf50d088dUL, 0xc8206e3bUL, 0x5e10694cUL, 0xe44160d5UL, |
|||
0x727167a2UL, 0xd1e4033cUL, 0x47d4044bUL, 0xfd850dd2UL, 0x6bb50aa5UL, |
|||
0xfaa8b535UL, 0x6c98b242UL, 0xd6c9bbdbUL, 0x40f9bcacUL, 0xe36cd832UL, |
|||
0x755cdf45UL, 0xcf0dd6dcUL, 0x593dd1abUL, 0xac30d926UL, 0x3a00de51UL, |
|||
0x8051d7c8UL, 0x1661d0bfUL, 0xb5f4b421UL, 0x23c4b356UL, 0x9995bacfUL, |
|||
0x0fa5bdb8UL, 0x9eb80228UL, 0x0888055fUL, 0xb2d90cc6UL, 0x24e90bb1UL, |
|||
0x877c6f2fUL, 0x114c6858UL, 0xab1d61c1UL, 0x3d2d66b6UL, 0x9041dc76UL, |
|||
0x0671db01UL, 0xbc20d298UL, 0x2a10d5efUL, 0x8985b171UL, 0x1fb5b606UL, |
|||
0xa5e4bf9fUL, 0x33d4b8e8UL, 0xa2c90778UL, 0x34f9000fUL, 0x8ea80996UL, |
|||
0x18980ee1UL, 0xbb0d6a7fUL, 0x2d3d6d08UL, 0x976c6491UL, 0x015c63e6UL, |
|||
0xf4516b6bUL, 0x62616c1cUL, 0xd8306585UL, 0x4e0062f2UL, 0xed95066cUL, |
|||
0x7ba5011bUL, 0xc1f40882UL, 0x57c40ff5UL, 0xc6d9b065UL, 0x50e9b712UL, |
|||
0xeab8be8bUL, 0x7c88b9fcUL, 0xdf1ddd62UL, 0x492dda15UL, 0xf37cd38cUL, |
|||
0x654cd4fbUL, 0x5861b24dUL, 0xce51b53aUL, 0x7400bca3UL, 0xe230bbd4UL, |
|||
0x41a5df4aUL, 0xd795d83dUL, 0x6dc4d1a4UL, 0xfbf4d6d3UL, 0x6ae96943UL, |
|||
0xfcd96e34UL, 0x468867adUL, 0xd0b860daUL, 0x732d0444UL, 0xe51d0333UL, |
|||
0x5f4c0aaaUL, 0xc97c0dddUL, 0x3c710550UL, 0xaa410227UL, 0x10100bbeUL, |
|||
0x86200cc9UL, 0x25b56857UL, 0xb3856f20UL, 0x09d466b9UL, 0x9fe461ceUL, |
|||
0x0ef9de5eUL, 0x98c9d929UL, 0x2298d0b0UL, 0xb4a8d7c7UL, 0x173db359UL, |
|||
0x810db42eUL, 0x3b5cbdb7UL, 0xad6cbac0UL, 0x2083b8edUL, 0xb6b3bf9aUL, |
|||
0x0ce2b603UL, 0x9ad2b174UL, 0x3947d5eaUL, 0xaf77d29dUL, 0x1526db04UL, |
|||
0x8316dc73UL, 0x120b63e3UL, 0x843b6494UL, 0x3e6a6d0dUL, 0xa85a6a7aUL, |
|||
0x0bcf0ee4UL, 0x9dff0993UL, 0x27ae000aUL, 0xb19e077dUL, 0x44930ff0UL, |
|||
0xd2a30887UL, 0x68f2011eUL, 0xfec20669UL, 0x5d5762f7UL, 0xcb676580UL, |
|||
0x71366c19UL, 0xe7066b6eUL, 0x761bd4feUL, 0xe02bd389UL, 0x5a7ada10UL, |
|||
0xcc4add67UL, 0x6fdfb9f9UL, 0xf9efbe8eUL, 0x43beb717UL, 0xd58eb060UL, |
|||
0xe8a3d6d6UL, 0x7e93d1a1UL, 0xc4c2d838UL, 0x52f2df4fUL, 0xf167bbd1UL, |
|||
0x6757bca6UL, 0xdd06b53fUL, 0x4b36b248UL, 0xda2b0dd8UL, 0x4c1b0aafUL, |
|||
0xf64a0336UL, 0x607a0441UL, 0xc3ef60dfUL, 0x55df67a8UL, 0xef8e6e31UL, |
|||
0x79be6946UL, 0x8cb361cbUL, 0x1a8366bcUL, 0xa0d26f25UL, 0x36e26852UL, |
|||
0x95770cccUL, 0x03470bbbUL, 0xb9160222UL, 0x2f260555UL, 0xbe3bbac5UL, |
|||
0x280bbdb2UL, 0x925ab42bUL, 0x046ab35cUL, 0xa7ffd7c2UL, 0x31cfd0b5UL, |
|||
0x8b9ed92cUL, 0x1daede5bUL, 0xb0c2649bUL, 0x26f263ecUL, 0x9ca36a75UL, |
|||
0x0a936d02UL, 0xa906099cUL, 0x3f360eebUL, 0x85670772UL, 0x13570005UL, |
|||
0x824abf95UL, 0x147ab8e2UL, 0xae2bb17bUL, 0x381bb60cUL, 0x9b8ed292UL, |
|||
0x0dbed5e5UL, 0xb7efdc7cUL, 0x21dfdb0bUL, 0xd4d2d386UL, 0x42e2d4f1UL, |
|||
0xf8b3dd68UL, 0x6e83da1fUL, 0xcd16be81UL, 0x5b26b9f6UL, 0xe177b06fUL, |
|||
0x7747b718UL, 0xe65a0888UL, 0x706a0fffUL, 0xca3b0666UL, 0x5c0b0111UL, |
|||
0xff9e658fUL, 0x69ae62f8UL, 0xd3ff6b61UL, 0x45cf6c16UL, 0x78e20aa0UL, |
|||
0xeed20dd7UL, 0x5483044eUL, 0xc2b30339UL, 0x612667a7UL, 0xf71660d0UL, |
|||
0x4d476949UL, 0xdb776e3eUL, 0x4a6ad1aeUL, 0xdc5ad6d9UL, 0x660bdf40UL, |
|||
0xf03bd837UL, 0x53aebca9UL, 0xc59ebbdeUL, 0x7fcfb247UL, 0xe9ffb530UL, |
|||
0x1cf2bdbdUL, 0x8ac2bacaUL, 0x3093b353UL, 0xa6a3b424UL, 0x0536d0baUL, |
|||
0x9306d7cdUL, 0x2957de54UL, 0xbf67d923UL, 0x2e7a66b3UL, 0xb84a61c4UL, |
|||
0x021b685dUL, 0x942b6f2aUL, 0x37be0bb4UL, 0xa18e0cc3UL, 0x1bdf055aUL, |
|||
0x8def022dUL |
|||
}, |
|||
{ |
|||
0x00000000UL, 0x41311b19UL, 0x82623632UL, 0xc3532d2bUL, 0x04c56c64UL, |
|||
0x45f4777dUL, 0x86a75a56UL, 0xc796414fUL, 0x088ad9c8UL, 0x49bbc2d1UL, |
|||
0x8ae8effaUL, 0xcbd9f4e3UL, 0x0c4fb5acUL, 0x4d7eaeb5UL, 0x8e2d839eUL, |
|||
0xcf1c9887UL, 0x5112c24aUL, 0x1023d953UL, 0xd370f478UL, 0x9241ef61UL, |
|||
0x55d7ae2eUL, 0x14e6b537UL, 0xd7b5981cUL, 0x96848305UL, 0x59981b82UL, |
|||
0x18a9009bUL, 0xdbfa2db0UL, 0x9acb36a9UL, 0x5d5d77e6UL, 0x1c6c6cffUL, |
|||
0xdf3f41d4UL, 0x9e0e5acdUL, 0xa2248495UL, 0xe3159f8cUL, 0x2046b2a7UL, |
|||
0x6177a9beUL, 0xa6e1e8f1UL, 0xe7d0f3e8UL, 0x2483dec3UL, 0x65b2c5daUL, |
|||
0xaaae5d5dUL, 0xeb9f4644UL, 0x28cc6b6fUL, 0x69fd7076UL, 0xae6b3139UL, |
|||
0xef5a2a20UL, 0x2c09070bUL, 0x6d381c12UL, 0xf33646dfUL, 0xb2075dc6UL, |
|||
0x715470edUL, 0x30656bf4UL, 0xf7f32abbUL, 0xb6c231a2UL, 0x75911c89UL, |
|||
0x34a00790UL, 0xfbbc9f17UL, 0xba8d840eUL, 0x79dea925UL, 0x38efb23cUL, |
|||
0xff79f373UL, 0xbe48e86aUL, 0x7d1bc541UL, 0x3c2ade58UL, 0x054f79f0UL, |
|||
0x447e62e9UL, 0x872d4fc2UL, 0xc61c54dbUL, 0x018a1594UL, 0x40bb0e8dUL, |
|||
0x83e823a6UL, 0xc2d938bfUL, 0x0dc5a038UL, 0x4cf4bb21UL, 0x8fa7960aUL, |
|||
0xce968d13UL, 0x0900cc5cUL, 0x4831d745UL, 0x8b62fa6eUL, 0xca53e177UL, |
|||
0x545dbbbaUL, 0x156ca0a3UL, 0xd63f8d88UL, 0x970e9691UL, 0x5098d7deUL, |
|||
0x11a9ccc7UL, 0xd2fae1ecUL, 0x93cbfaf5UL, 0x5cd76272UL, 0x1de6796bUL, |
|||
0xdeb55440UL, 0x9f844f59UL, 0x58120e16UL, 0x1923150fUL, 0xda703824UL, |
|||
0x9b41233dUL, 0xa76bfd65UL, 0xe65ae67cUL, 0x2509cb57UL, 0x6438d04eUL, |
|||
0xa3ae9101UL, 0xe29f8a18UL, 0x21cca733UL, 0x60fdbc2aUL, 0xafe124adUL, |
|||
0xeed03fb4UL, 0x2d83129fUL, 0x6cb20986UL, 0xab2448c9UL, 0xea1553d0UL, |
|||
0x29467efbUL, 0x687765e2UL, 0xf6793f2fUL, 0xb7482436UL, 0x741b091dUL, |
|||
0x352a1204UL, 0xf2bc534bUL, 0xb38d4852UL, 0x70de6579UL, 0x31ef7e60UL, |
|||
0xfef3e6e7UL, 0xbfc2fdfeUL, 0x7c91d0d5UL, 0x3da0cbccUL, 0xfa368a83UL, |
|||
0xbb07919aUL, 0x7854bcb1UL, 0x3965a7a8UL, 0x4b98833bUL, 0x0aa99822UL, |
|||
0xc9fab509UL, 0x88cbae10UL, 0x4f5def5fUL, 0x0e6cf446UL, 0xcd3fd96dUL, |
|||
0x8c0ec274UL, 0x43125af3UL, 0x022341eaUL, 0xc1706cc1UL, 0x804177d8UL, |
|||
0x47d73697UL, 0x06e62d8eUL, 0xc5b500a5UL, 0x84841bbcUL, 0x1a8a4171UL, |
|||
0x5bbb5a68UL, 0x98e87743UL, 0xd9d96c5aUL, 0x1e4f2d15UL, 0x5f7e360cUL, |
|||
0x9c2d1b27UL, 0xdd1c003eUL, 0x120098b9UL, 0x533183a0UL, 0x9062ae8bUL, |
|||
0xd153b592UL, 0x16c5f4ddUL, 0x57f4efc4UL, 0x94a7c2efUL, 0xd596d9f6UL, |
|||
0xe9bc07aeUL, 0xa88d1cb7UL, 0x6bde319cUL, 0x2aef2a85UL, 0xed796bcaUL, |
|||
0xac4870d3UL, 0x6f1b5df8UL, 0x2e2a46e1UL, 0xe136de66UL, 0xa007c57fUL, |
|||
0x6354e854UL, 0x2265f34dUL, 0xe5f3b202UL, 0xa4c2a91bUL, 0x67918430UL, |
|||
0x26a09f29UL, 0xb8aec5e4UL, 0xf99fdefdUL, 0x3accf3d6UL, 0x7bfde8cfUL, |
|||
0xbc6ba980UL, 0xfd5ab299UL, 0x3e099fb2UL, 0x7f3884abUL, 0xb0241c2cUL, |
|||
0xf1150735UL, 0x32462a1eUL, 0x73773107UL, 0xb4e17048UL, 0xf5d06b51UL, |
|||
0x3683467aUL, 0x77b25d63UL, 0x4ed7facbUL, 0x0fe6e1d2UL, 0xccb5ccf9UL, |
|||
0x8d84d7e0UL, 0x4a1296afUL, 0x0b238db6UL, 0xc870a09dUL, 0x8941bb84UL, |
|||
0x465d2303UL, 0x076c381aUL, 0xc43f1531UL, 0x850e0e28UL, 0x42984f67UL, |
|||
0x03a9547eUL, 0xc0fa7955UL, 0x81cb624cUL, 0x1fc53881UL, 0x5ef42398UL, |
|||
0x9da70eb3UL, 0xdc9615aaUL, 0x1b0054e5UL, 0x5a314ffcUL, 0x996262d7UL, |
|||
0xd85379ceUL, 0x174fe149UL, 0x567efa50UL, 0x952dd77bUL, 0xd41ccc62UL, |
|||
0x138a8d2dUL, 0x52bb9634UL, 0x91e8bb1fUL, 0xd0d9a006UL, 0xecf37e5eUL, |
|||
0xadc26547UL, 0x6e91486cUL, 0x2fa05375UL, 0xe836123aUL, 0xa9070923UL, |
|||
0x6a542408UL, 0x2b653f11UL, 0xe479a796UL, 0xa548bc8fUL, 0x661b91a4UL, |
|||
0x272a8abdUL, 0xe0bccbf2UL, 0xa18dd0ebUL, 0x62defdc0UL, 0x23efe6d9UL, |
|||
0xbde1bc14UL, 0xfcd0a70dUL, 0x3f838a26UL, 0x7eb2913fUL, 0xb924d070UL, |
|||
0xf815cb69UL, 0x3b46e642UL, 0x7a77fd5bUL, 0xb56b65dcUL, 0xf45a7ec5UL, |
|||
0x370953eeUL, 0x763848f7UL, 0xb1ae09b8UL, 0xf09f12a1UL, 0x33cc3f8aUL, |
|||
0x72fd2493UL |
|||
}, |
|||
{ |
|||
0x00000000UL, 0x376ac201UL, 0x6ed48403UL, 0x59be4602UL, 0xdca80907UL, |
|||
0xebc2cb06UL, 0xb27c8d04UL, 0x85164f05UL, 0xb851130eUL, 0x8f3bd10fUL, |
|||
0xd685970dUL, 0xe1ef550cUL, 0x64f91a09UL, 0x5393d808UL, 0x0a2d9e0aUL, |
|||
0x3d475c0bUL, 0x70a3261cUL, 0x47c9e41dUL, 0x1e77a21fUL, 0x291d601eUL, |
|||
0xac0b2f1bUL, 0x9b61ed1aUL, 0xc2dfab18UL, 0xf5b56919UL, 0xc8f23512UL, |
|||
0xff98f713UL, 0xa626b111UL, 0x914c7310UL, 0x145a3c15UL, 0x2330fe14UL, |
|||
0x7a8eb816UL, 0x4de47a17UL, 0xe0464d38UL, 0xd72c8f39UL, 0x8e92c93bUL, |
|||
0xb9f80b3aUL, 0x3cee443fUL, 0x0b84863eUL, 0x523ac03cUL, 0x6550023dUL, |
|||
0x58175e36UL, 0x6f7d9c37UL, 0x36c3da35UL, 0x01a91834UL, 0x84bf5731UL, |
|||
0xb3d59530UL, 0xea6bd332UL, 0xdd011133UL, 0x90e56b24UL, 0xa78fa925UL, |
|||
0xfe31ef27UL, 0xc95b2d26UL, 0x4c4d6223UL, 0x7b27a022UL, 0x2299e620UL, |
|||
0x15f32421UL, 0x28b4782aUL, 0x1fdeba2bUL, 0x4660fc29UL, 0x710a3e28UL, |
|||
0xf41c712dUL, 0xc376b32cUL, 0x9ac8f52eUL, 0xada2372fUL, 0xc08d9a70UL, |
|||
0xf7e75871UL, 0xae591e73UL, 0x9933dc72UL, 0x1c259377UL, 0x2b4f5176UL, |
|||
0x72f11774UL, 0x459bd575UL, 0x78dc897eUL, 0x4fb64b7fUL, 0x16080d7dUL, |
|||
0x2162cf7cUL, 0xa4748079UL, 0x931e4278UL, 0xcaa0047aUL, 0xfdcac67bUL, |
|||
0xb02ebc6cUL, 0x87447e6dUL, 0xdefa386fUL, 0xe990fa6eUL, 0x6c86b56bUL, |
|||
0x5bec776aUL, 0x02523168UL, 0x3538f369UL, 0x087faf62UL, 0x3f156d63UL, |
|||
0x66ab2b61UL, 0x51c1e960UL, 0xd4d7a665UL, 0xe3bd6464UL, 0xba032266UL, |
|||
0x8d69e067UL, 0x20cbd748UL, 0x17a11549UL, 0x4e1f534bUL, 0x7975914aUL, |
|||
0xfc63de4fUL, 0xcb091c4eUL, 0x92b75a4cUL, 0xa5dd984dUL, 0x989ac446UL, |
|||
0xaff00647UL, 0xf64e4045UL, 0xc1248244UL, 0x4432cd41UL, 0x73580f40UL, |
|||
0x2ae64942UL, 0x1d8c8b43UL, 0x5068f154UL, 0x67023355UL, 0x3ebc7557UL, |
|||
0x09d6b756UL, 0x8cc0f853UL, 0xbbaa3a52UL, 0xe2147c50UL, 0xd57ebe51UL, |
|||
0xe839e25aUL, 0xdf53205bUL, 0x86ed6659UL, 0xb187a458UL, 0x3491eb5dUL, |
|||
0x03fb295cUL, 0x5a456f5eUL, 0x6d2fad5fUL, 0x801b35e1UL, 0xb771f7e0UL, |
|||
0xeecfb1e2UL, 0xd9a573e3UL, 0x5cb33ce6UL, 0x6bd9fee7UL, 0x3267b8e5UL, |
|||
0x050d7ae4UL, 0x384a26efUL, 0x0f20e4eeUL, 0x569ea2ecUL, 0x61f460edUL, |
|||
0xe4e22fe8UL, 0xd388ede9UL, 0x8a36abebUL, 0xbd5c69eaUL, 0xf0b813fdUL, |
|||
0xc7d2d1fcUL, 0x9e6c97feUL, 0xa90655ffUL, 0x2c101afaUL, 0x1b7ad8fbUL, |
|||
0x42c49ef9UL, 0x75ae5cf8UL, 0x48e900f3UL, 0x7f83c2f2UL, 0x263d84f0UL, |
|||
0x115746f1UL, 0x944109f4UL, 0xa32bcbf5UL, 0xfa958df7UL, 0xcdff4ff6UL, |
|||
0x605d78d9UL, 0x5737bad8UL, 0x0e89fcdaUL, 0x39e33edbUL, 0xbcf571deUL, |
|||
0x8b9fb3dfUL, 0xd221f5ddUL, 0xe54b37dcUL, 0xd80c6bd7UL, 0xef66a9d6UL, |
|||
0xb6d8efd4UL, 0x81b22dd5UL, 0x04a462d0UL, 0x33cea0d1UL, 0x6a70e6d3UL, |
|||
0x5d1a24d2UL, 0x10fe5ec5UL, 0x27949cc4UL, 0x7e2adac6UL, 0x494018c7UL, |
|||
0xcc5657c2UL, 0xfb3c95c3UL, 0xa282d3c1UL, 0x95e811c0UL, 0xa8af4dcbUL, |
|||
0x9fc58fcaUL, 0xc67bc9c8UL, 0xf1110bc9UL, 0x740744ccUL, 0x436d86cdUL, |
|||
0x1ad3c0cfUL, 0x2db902ceUL, 0x4096af91UL, 0x77fc6d90UL, 0x2e422b92UL, |
|||
0x1928e993UL, 0x9c3ea696UL, 0xab546497UL, 0xf2ea2295UL, 0xc580e094UL, |
|||
0xf8c7bc9fUL, 0xcfad7e9eUL, 0x9613389cUL, 0xa179fa9dUL, 0x246fb598UL, |
|||
0x13057799UL, 0x4abb319bUL, 0x7dd1f39aUL, 0x3035898dUL, 0x075f4b8cUL, |
|||
0x5ee10d8eUL, 0x698bcf8fUL, 0xec9d808aUL, 0xdbf7428bUL, 0x82490489UL, |
|||
0xb523c688UL, 0x88649a83UL, 0xbf0e5882UL, 0xe6b01e80UL, 0xd1dadc81UL, |
|||
0x54cc9384UL, 0x63a65185UL, 0x3a181787UL, 0x0d72d586UL, 0xa0d0e2a9UL, |
|||
0x97ba20a8UL, 0xce0466aaUL, 0xf96ea4abUL, 0x7c78ebaeUL, 0x4b1229afUL, |
|||
0x12ac6fadUL, 0x25c6adacUL, 0x1881f1a7UL, 0x2feb33a6UL, 0x765575a4UL, |
|||
0x413fb7a5UL, 0xc429f8a0UL, 0xf3433aa1UL, 0xaafd7ca3UL, 0x9d97bea2UL, |
|||
0xd073c4b5UL, 0xe71906b4UL, 0xbea740b6UL, 0x89cd82b7UL, 0x0cdbcdb2UL, |
|||
0x3bb10fb3UL, 0x620f49b1UL, 0x55658bb0UL, 0x6822d7bbUL, 0x5f4815baUL, |
|||
0x06f653b8UL, 0x319c91b9UL, 0xb48adebcUL, 0x83e01cbdUL, 0xda5e5abfUL, |
|||
0xed3498beUL |
|||
}, |
|||
{ |
|||
0x00000000UL, 0x6567bcb8UL, 0x8bc809aaUL, 0xeeafb512UL, 0x5797628fUL, |
|||
0x32f0de37UL, 0xdc5f6b25UL, 0xb938d79dUL, 0xef28b4c5UL, 0x8a4f087dUL, |
|||
0x64e0bd6fUL, 0x018701d7UL, 0xb8bfd64aUL, 0xddd86af2UL, 0x3377dfe0UL, |
|||
0x56106358UL, 0x9f571950UL, 0xfa30a5e8UL, 0x149f10faUL, 0x71f8ac42UL, |
|||
0xc8c07bdfUL, 0xada7c767UL, 0x43087275UL, 0x266fcecdUL, 0x707fad95UL, |
|||
0x1518112dUL, 0xfbb7a43fUL, 0x9ed01887UL, 0x27e8cf1aUL, 0x428f73a2UL, |
|||
0xac20c6b0UL, 0xc9477a08UL, 0x3eaf32a0UL, 0x5bc88e18UL, 0xb5673b0aUL, |
|||
0xd00087b2UL, 0x6938502fUL, 0x0c5fec97UL, 0xe2f05985UL, 0x8797e53dUL, |
|||
0xd1878665UL, 0xb4e03addUL, 0x5a4f8fcfUL, 0x3f283377UL, 0x8610e4eaUL, |
|||
0xe3775852UL, 0x0dd8ed40UL, 0x68bf51f8UL, 0xa1f82bf0UL, 0xc49f9748UL, |
|||
0x2a30225aUL, 0x4f579ee2UL, 0xf66f497fUL, 0x9308f5c7UL, 0x7da740d5UL, |
|||
0x18c0fc6dUL, 0x4ed09f35UL, 0x2bb7238dUL, 0xc518969fUL, 0xa07f2a27UL, |
|||
0x1947fdbaUL, 0x7c204102UL, 0x928ff410UL, 0xf7e848a8UL, 0x3d58149bUL, |
|||
0x583fa823UL, 0xb6901d31UL, 0xd3f7a189UL, 0x6acf7614UL, 0x0fa8caacUL, |
|||
0xe1077fbeUL, 0x8460c306UL, 0xd270a05eUL, 0xb7171ce6UL, 0x59b8a9f4UL, |
|||
0x3cdf154cUL, 0x85e7c2d1UL, 0xe0807e69UL, 0x0e2fcb7bUL, 0x6b4877c3UL, |
|||
0xa20f0dcbUL, 0xc768b173UL, 0x29c70461UL, 0x4ca0b8d9UL, 0xf5986f44UL, |
|||
0x90ffd3fcUL, 0x7e5066eeUL, 0x1b37da56UL, 0x4d27b90eUL, 0x284005b6UL, |
|||
0xc6efb0a4UL, 0xa3880c1cUL, 0x1ab0db81UL, 0x7fd76739UL, 0x9178d22bUL, |
|||
0xf41f6e93UL, 0x03f7263bUL, 0x66909a83UL, 0x883f2f91UL, 0xed589329UL, |
|||
0x546044b4UL, 0x3107f80cUL, 0xdfa84d1eUL, 0xbacff1a6UL, 0xecdf92feUL, |
|||
0x89b82e46UL, 0x67179b54UL, 0x027027ecUL, 0xbb48f071UL, 0xde2f4cc9UL, |
|||
0x3080f9dbUL, 0x55e74563UL, 0x9ca03f6bUL, 0xf9c783d3UL, 0x176836c1UL, |
|||
0x720f8a79UL, 0xcb375de4UL, 0xae50e15cUL, 0x40ff544eUL, 0x2598e8f6UL, |
|||
0x73888baeUL, 0x16ef3716UL, 0xf8408204UL, 0x9d273ebcUL, 0x241fe921UL, |
|||
0x41785599UL, 0xafd7e08bUL, 0xcab05c33UL, 0x3bb659edUL, 0x5ed1e555UL, |
|||
0xb07e5047UL, 0xd519ecffUL, 0x6c213b62UL, 0x094687daUL, 0xe7e932c8UL, |
|||
0x828e8e70UL, 0xd49eed28UL, 0xb1f95190UL, 0x5f56e482UL, 0x3a31583aUL, |
|||
0x83098fa7UL, 0xe66e331fUL, 0x08c1860dUL, 0x6da63ab5UL, 0xa4e140bdUL, |
|||
0xc186fc05UL, 0x2f294917UL, 0x4a4ef5afUL, 0xf3762232UL, 0x96119e8aUL, |
|||
0x78be2b98UL, 0x1dd99720UL, 0x4bc9f478UL, 0x2eae48c0UL, 0xc001fdd2UL, |
|||
0xa566416aUL, 0x1c5e96f7UL, 0x79392a4fUL, 0x97969f5dUL, 0xf2f123e5UL, |
|||
0x05196b4dUL, 0x607ed7f5UL, 0x8ed162e7UL, 0xebb6de5fUL, 0x528e09c2UL, |
|||
0x37e9b57aUL, 0xd9460068UL, 0xbc21bcd0UL, 0xea31df88UL, 0x8f566330UL, |
|||
0x61f9d622UL, 0x049e6a9aUL, 0xbda6bd07UL, 0xd8c101bfUL, 0x366eb4adUL, |
|||
0x53090815UL, 0x9a4e721dUL, 0xff29cea5UL, 0x11867bb7UL, 0x74e1c70fUL, |
|||
0xcdd91092UL, 0xa8beac2aUL, 0x46111938UL, 0x2376a580UL, 0x7566c6d8UL, |
|||
0x10017a60UL, 0xfeaecf72UL, 0x9bc973caUL, 0x22f1a457UL, 0x479618efUL, |
|||
0xa939adfdUL, 0xcc5e1145UL, 0x06ee4d76UL, 0x6389f1ceUL, 0x8d2644dcUL, |
|||
0xe841f864UL, 0x51792ff9UL, 0x341e9341UL, 0xdab12653UL, 0xbfd69aebUL, |
|||
0xe9c6f9b3UL, 0x8ca1450bUL, 0x620ef019UL, 0x07694ca1UL, 0xbe519b3cUL, |
|||
0xdb362784UL, 0x35999296UL, 0x50fe2e2eUL, 0x99b95426UL, 0xfcdee89eUL, |
|||
0x12715d8cUL, 0x7716e134UL, 0xce2e36a9UL, 0xab498a11UL, 0x45e63f03UL, |
|||
0x208183bbUL, 0x7691e0e3UL, 0x13f65c5bUL, 0xfd59e949UL, 0x983e55f1UL, |
|||
0x2106826cUL, 0x44613ed4UL, 0xaace8bc6UL, 0xcfa9377eUL, 0x38417fd6UL, |
|||
0x5d26c36eUL, 0xb389767cUL, 0xd6eecac4UL, 0x6fd61d59UL, 0x0ab1a1e1UL, |
|||
0xe41e14f3UL, 0x8179a84bUL, 0xd769cb13UL, 0xb20e77abUL, 0x5ca1c2b9UL, |
|||
0x39c67e01UL, 0x80fea99cUL, 0xe5991524UL, 0x0b36a036UL, 0x6e511c8eUL, |
|||
0xa7166686UL, 0xc271da3eUL, 0x2cde6f2cUL, 0x49b9d394UL, 0xf0810409UL, |
|||
0x95e6b8b1UL, 0x7b490da3UL, 0x1e2eb11bUL, 0x483ed243UL, 0x2d596efbUL, |
|||
0xc3f6dbe9UL, 0xa6916751UL, 0x1fa9b0ccUL, 0x7ace0c74UL, 0x9461b966UL, |
|||
0xf10605deUL |
|||
#endif |
|||
} |
|||
}; |
|||
File diff suppressed because it is too large
@ -0,0 +1,331 @@ |
|||
/* deflate.h -- internal compression state
|
|||
* Copyright (C) 1995-2004 Jean-loup Gailly |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* WARNING: this file should *not* be used by applications. It is
|
|||
part of the implementation of the compression library and is |
|||
subject to change. Applications should only use zlib.h. |
|||
*/ |
|||
|
|||
/* @(#) $Id: deflate.h,v 3.6 2005/08/04 19:14:14 tor%cs.brown.edu Exp $ */ |
|||
|
|||
#ifndef DEFLATE_H |
|||
#define DEFLATE_H |
|||
|
|||
#include "zutil.h" |
|||
|
|||
/* define NO_GZIP when compiling if you want to disable gzip header and
|
|||
trailer creation by deflate(). NO_GZIP would be used to avoid linking in |
|||
the crc code when it is not needed. For shared libraries, gzip encoding |
|||
should be left enabled. */ |
|||
#ifndef NO_GZIP |
|||
# define GZIP |
|||
#endif |
|||
|
|||
/* ===========================================================================
|
|||
* Internal compression state. |
|||
*/ |
|||
|
|||
#define LENGTH_CODES 29 |
|||
/* number of length codes, not counting the special END_BLOCK code */ |
|||
|
|||
#define LITERALS 256 |
|||
/* number of literal bytes 0..255 */ |
|||
|
|||
#define L_CODES (LITERALS+1+LENGTH_CODES) |
|||
/* number of Literal or Length codes, including the END_BLOCK code */ |
|||
|
|||
#define D_CODES 30 |
|||
/* number of distance codes */ |
|||
|
|||
#define BL_CODES 19 |
|||
/* number of codes used to transfer the bit lengths */ |
|||
|
|||
#define HEAP_SIZE (2*L_CODES+1) |
|||
/* maximum heap size */ |
|||
|
|||
#define MAX_BITS 15 |
|||
/* All codes must not exceed MAX_BITS bits */ |
|||
|
|||
#define INIT_STATE 42 |
|||
#define EXTRA_STATE 69 |
|||
#define NAME_STATE 73 |
|||
#define COMMENT_STATE 91 |
|||
#define HCRC_STATE 103 |
|||
#define BUSY_STATE 113 |
|||
#define FINISH_STATE 666 |
|||
/* Stream status */ |
|||
|
|||
|
|||
/* Data structure describing a single value and its code string. */ |
|||
typedef struct ct_data_s { |
|||
union { |
|||
ush freq; /* frequency count */ |
|||
ush code; /* bit string */ |
|||
} fc; |
|||
union { |
|||
ush dad; /* father node in Huffman tree */ |
|||
ush len; /* length of bit string */ |
|||
} dl; |
|||
} FAR ct_data; |
|||
|
|||
#define Freq fc.freq |
|||
#define Code fc.code |
|||
#define Dad dl.dad |
|||
#define Len dl.len |
|||
|
|||
typedef struct static_tree_desc_s static_tree_desc; |
|||
|
|||
typedef struct tree_desc_s { |
|||
ct_data *dyn_tree; /* the dynamic tree */ |
|||
int max_code; /* largest code with non zero frequency */ |
|||
static_tree_desc *stat_desc; /* the corresponding static tree */ |
|||
} FAR tree_desc; |
|||
|
|||
typedef ush Pos; |
|||
typedef Pos FAR Posf; |
|||
typedef unsigned IPos; |
|||
|
|||
/* A Pos is an index in the character window. We use short instead of int to
|
|||
* save space in the various tables. IPos is used only for parameter passing. |
|||
*/ |
|||
|
|||
typedef struct internal_state { |
|||
z_streamp strm; /* pointer back to this zlib stream */ |
|||
int status; /* as the name implies */ |
|||
Bytef *pending_buf; /* output still pending */ |
|||
ulg pending_buf_size; /* size of pending_buf */ |
|||
Bytef *pending_out; /* next pending byte to output to the stream */ |
|||
uInt pending; /* nb of bytes in the pending buffer */ |
|||
int wrap; /* bit 0 true for zlib, bit 1 true for gzip */ |
|||
gz_headerp gzhead; /* gzip header information to write */ |
|||
uInt gzindex; /* where in extra, name, or comment */ |
|||
Byte method; /* STORED (for zip only) or DEFLATED */ |
|||
int last_flush; /* value of flush param for previous deflate call */ |
|||
|
|||
/* used by deflate.c: */ |
|||
|
|||
uInt w_size; /* LZ77 window size (32K by default) */ |
|||
uInt w_bits; /* log2(w_size) (8..16) */ |
|||
uInt w_mask; /* w_size - 1 */ |
|||
|
|||
Bytef *window; |
|||
/* Sliding window. Input bytes are read into the second half of the window,
|
|||
* and move to the first half later to keep a dictionary of at least wSize |
|||
* bytes. With this organization, matches are limited to a distance of |
|||
* wSize-MAX_MATCH bytes, but this ensures that IO is always |
|||
* performed with a length multiple of the block size. Also, it limits |
|||
* the window size to 64K, which is quite useful on MSDOS. |
|||
* To do: use the user input buffer as sliding window. |
|||
*/ |
|||
|
|||
ulg window_size; |
|||
/* Actual size of window: 2*wSize, except when the user input buffer
|
|||
* is directly used as sliding window. |
|||
*/ |
|||
|
|||
Posf *prev; |
|||
/* Link to older string with same hash index. To limit the size of this
|
|||
* array to 64K, this link is maintained only for the last 32K strings. |
|||
* An index in this array is thus a window index modulo 32K. |
|||
*/ |
|||
|
|||
Posf *head; /* Heads of the hash chains or NIL. */ |
|||
|
|||
uInt ins_h; /* hash index of string to be inserted */ |
|||
uInt hash_size; /* number of elements in hash table */ |
|||
uInt hash_bits; /* log2(hash_size) */ |
|||
uInt hash_mask; /* hash_size-1 */ |
|||
|
|||
uInt hash_shift; |
|||
/* Number of bits by which ins_h must be shifted at each input
|
|||
* step. It must be such that after MIN_MATCH steps, the oldest |
|||
* byte no longer takes part in the hash key, that is: |
|||
* hash_shift * MIN_MATCH >= hash_bits |
|||
*/ |
|||
|
|||
long block_start; |
|||
/* Window position at the beginning of the current output block. Gets
|
|||
* negative when the window is moved backwards. |
|||
*/ |
|||
|
|||
uInt match_length; /* length of best match */ |
|||
IPos prev_match; /* previous match */ |
|||
int match_available; /* set if previous match exists */ |
|||
uInt strstart; /* start of string to insert */ |
|||
uInt match_start; /* start of matching string */ |
|||
uInt lookahead; /* number of valid bytes ahead in window */ |
|||
|
|||
uInt prev_length; |
|||
/* Length of the best match at previous step. Matches not greater than this
|
|||
* are discarded. This is used in the lazy match evaluation. |
|||
*/ |
|||
|
|||
uInt max_chain_length; |
|||
/* To speed up deflation, hash chains are never searched beyond this
|
|||
* length. A higher limit improves compression ratio but degrades the |
|||
* speed. |
|||
*/ |
|||
|
|||
uInt max_lazy_match; |
|||
/* Attempt to find a better match only when the current match is strictly
|
|||
* smaller than this value. This mechanism is used only for compression |
|||
* levels >= 4. |
|||
*/ |
|||
# define max_insert_length max_lazy_match |
|||
/* Insert new strings in the hash table only if the match length is not
|
|||
* greater than this length. This saves time but degrades compression. |
|||
* max_insert_length is used only for compression levels <= 3. |
|||
*/ |
|||
|
|||
int level; /* compression level (1..9) */ |
|||
int strategy; /* favor or force Huffman coding*/ |
|||
|
|||
uInt good_match; |
|||
/* Use a faster search when the previous match is longer than this */ |
|||
|
|||
int nice_match; /* Stop searching when current match exceeds this */ |
|||
|
|||
/* used by trees.c: */ |
|||
/* Didn't use ct_data typedef below to supress compiler warning */ |
|||
struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ |
|||
struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ |
|||
struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ |
|||
|
|||
struct tree_desc_s l_desc; /* desc. for literal tree */ |
|||
struct tree_desc_s d_desc; /* desc. for distance tree */ |
|||
struct tree_desc_s bl_desc; /* desc. for bit length tree */ |
|||
|
|||
ush bl_count[MAX_BITS+1]; |
|||
/* number of codes at each bit length for an optimal tree */ |
|||
|
|||
int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ |
|||
int heap_len; /* number of elements in the heap */ |
|||
int heap_max; /* element of largest frequency */ |
|||
/* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
|
|||
* The same heap array is used to build all trees. |
|||
*/ |
|||
|
|||
uch depth[2*L_CODES+1]; |
|||
/* Depth of each subtree used as tie breaker for trees of equal frequency
|
|||
*/ |
|||
|
|||
uchf *l_buf; /* buffer for literals or lengths */ |
|||
|
|||
uInt lit_bufsize; |
|||
/* Size of match buffer for literals/lengths. There are 4 reasons for
|
|||
* limiting lit_bufsize to 64K: |
|||
* - frequencies can be kept in 16 bit counters |
|||
* - if compression is not successful for the first block, all input |
|||
* data is still in the window so we can still emit a stored block even |
|||
* when input comes from standard input. (This can also be done for |
|||
* all blocks if lit_bufsize is not greater than 32K.) |
|||
* - if compression is not successful for a file smaller than 64K, we can |
|||
* even emit a stored file instead of a stored block (saving 5 bytes). |
|||
* This is applicable only for zip (not gzip or zlib). |
|||
* - creating new Huffman trees less frequently may not provide fast |
|||
* adaptation to changes in the input data statistics. (Take for |
|||
* example a binary file with poorly compressible code followed by |
|||
* a highly compressible string table.) Smaller buffer sizes give |
|||
* fast adaptation but have of course the overhead of transmitting |
|||
* trees more frequently. |
|||
* - I can't count above 4 |
|||
*/ |
|||
|
|||
uInt last_lit; /* running index in l_buf */ |
|||
|
|||
ushf *d_buf; |
|||
/* Buffer for distances. To simplify the code, d_buf and l_buf have
|
|||
* the same number of elements. To use different lengths, an extra flag |
|||
* array would be necessary. |
|||
*/ |
|||
|
|||
ulg opt_len; /* bit length of current block with optimal trees */ |
|||
ulg static_len; /* bit length of current block with static trees */ |
|||
uInt matches; /* number of string matches in current block */ |
|||
int last_eob_len; /* bit length of EOB code for last block */ |
|||
|
|||
#ifdef DEBUG |
|||
ulg compressed_len; /* total bit length of compressed file mod 2^32 */ |
|||
ulg bits_sent; /* bit length of compressed data sent mod 2^32 */ |
|||
#endif |
|||
|
|||
ush bi_buf; |
|||
/* Output buffer. bits are inserted starting at the bottom (least
|
|||
* significant bits). |
|||
*/ |
|||
int bi_valid; |
|||
/* Number of valid bits in bi_buf. All bits above the last valid bit
|
|||
* are always zero. |
|||
*/ |
|||
|
|||
} FAR deflate_state; |
|||
|
|||
/* Output a byte on the stream.
|
|||
* IN assertion: there is enough room in pending_buf. |
|||
*/ |
|||
#define put_byte(s, c) {s->pending_buf[s->pending++] = (c);} |
|||
|
|||
|
|||
#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) |
|||
/* Minimum amount of lookahead, except at the end of the input file.
|
|||
* See deflate.c for comments about the MIN_MATCH+1. |
|||
*/ |
|||
|
|||
#define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD) |
|||
/* In order to simplify the code, particularly on 16 bit machines, match
|
|||
* distances are limited to MAX_DIST instead of WSIZE. |
|||
*/ |
|||
|
|||
/* in trees.c */ |
|||
void _tr_init OF((deflate_state *s)); |
|||
int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc)); |
|||
void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len, |
|||
int eof)); |
|||
void _tr_align OF((deflate_state *s)); |
|||
void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len, |
|||
int eof)); |
|||
|
|||
#define d_code(dist) \ |
|||
((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)]) |
|||
/* Mapping from a distance to a distance code. dist is the distance - 1 and
|
|||
* must not have side effects. _dist_code[256] and _dist_code[257] are never |
|||
* used. |
|||
*/ |
|||
|
|||
#ifndef DEBUG |
|||
/* Inline versions of _tr_tally for speed: */ |
|||
|
|||
#if defined(GEN_TREES_H) || !defined(STDC) |
|||
extern uch _length_code[]; |
|||
extern uch _dist_code[]; |
|||
#else |
|||
extern const uch _length_code[]; |
|||
extern const uch _dist_code[]; |
|||
#endif |
|||
|
|||
# define _tr_tally_lit(s, c, flush) \ |
|||
{ uch cc = (c); \ |
|||
s->d_buf[s->last_lit] = 0; \ |
|||
s->l_buf[s->last_lit++] = cc; \ |
|||
s->dyn_ltree[cc].Freq++; \ |
|||
flush = (s->last_lit == s->lit_bufsize-1); \ |
|||
} |
|||
# define _tr_tally_dist(s, distance, length, flush) \ |
|||
{ uch len = (length); \ |
|||
ush dist = (distance); \ |
|||
s->d_buf[s->last_lit] = dist; \ |
|||
s->l_buf[s->last_lit++] = len; \ |
|||
dist--; \ |
|||
s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \ |
|||
s->dyn_dtree[d_code(dist)].Freq++; \ |
|||
flush = (s->last_lit == s->lit_bufsize-1); \ |
|||
} |
|||
#else |
|||
# define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c) |
|||
# define _tr_tally_dist(s, distance, length, flush) \ |
|||
flush = _tr_tally(s, distance, length) |
|||
#endif |
|||
|
|||
#endif /* DEFLATE_H */ |
|||
File diff suppressed because it is too large
@ -0,0 +1,623 @@ |
|||
/* infback.c -- inflate using a call-back interface
|
|||
* Copyright (C) 1995-2005 Mark Adler |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/*
|
|||
This code is largely copied from inflate.c. Normally either infback.o or |
|||
inflate.o would be linked into an application--not both. The interface |
|||
with inffast.c is retained so that optimized assembler-coded versions of |
|||
inflate_fast() can be used with either inflate.c or infback.c. |
|||
*/ |
|||
|
|||
#include "zutil.h" |
|||
#include "inftrees.h" |
|||
#include "inflate.h" |
|||
#include "inffast.h" |
|||
|
|||
/* function prototypes */ |
|||
local void fixedtables OF((struct inflate_state FAR *state)); |
|||
|
|||
/*
|
|||
strm provides memory allocation functions in zalloc and zfree, or |
|||
Z_NULL to use the library memory allocation functions. |
|||
|
|||
windowBits is in the range 8..15, and window is a user-supplied |
|||
window and output buffer that is 2**windowBits bytes. |
|||
*/ |
|||
int ZEXPORT inflateBackInit_(strm, windowBits, window, version, stream_size) |
|||
z_streamp strm; |
|||
int windowBits; |
|||
unsigned char FAR *window; |
|||
const char *version; |
|||
int stream_size; |
|||
{ |
|||
struct inflate_state FAR *state; |
|||
|
|||
if (version == Z_NULL || version[0] != ZLIB_VERSION[0] || |
|||
stream_size != (int)(sizeof(z_stream))) |
|||
return Z_VERSION_ERROR; |
|||
if (strm == Z_NULL || window == Z_NULL || |
|||
windowBits < 8 || windowBits > 15) |
|||
return Z_STREAM_ERROR; |
|||
strm->msg = Z_NULL; /* in case we return an error */ |
|||
if (strm->zalloc == (alloc_func)0) { |
|||
strm->zalloc = zcalloc; |
|||
strm->opaque = (voidpf)0; |
|||
} |
|||
if (strm->zfree == (free_func)0) strm->zfree = zcfree; |
|||
state = (struct inflate_state FAR *)ZALLOC(strm, 1, |
|||
sizeof(struct inflate_state)); |
|||
if (state == Z_NULL) return Z_MEM_ERROR; |
|||
Tracev((stderr, "inflate: allocated\n")); |
|||
strm->state = (struct internal_state FAR *)state; |
|||
state->dmax = 32768U; |
|||
state->wbits = windowBits; |
|||
state->wsize = 1U << windowBits; |
|||
state->window = window; |
|||
state->write = 0; |
|||
state->whave = 0; |
|||
return Z_OK; |
|||
} |
|||
|
|||
/*
|
|||
Return state with length and distance decoding tables and index sizes set to |
|||
fixed code decoding. Normally this returns fixed tables from inffixed.h. |
|||
If BUILDFIXED is defined, then instead this routine builds the tables the |
|||
first time it's called, and returns those tables the first time and |
|||
thereafter. This reduces the size of the code by about 2K bytes, in |
|||
exchange for a little execution time. However, BUILDFIXED should not be |
|||
used for threaded applications, since the rewriting of the tables and virgin |
|||
may not be thread-safe. |
|||
*/ |
|||
local void fixedtables(state) |
|||
struct inflate_state FAR *state; |
|||
{ |
|||
#ifdef BUILDFIXED |
|||
static int virgin = 1; |
|||
static code *lenfix, *distfix; |
|||
static code fixed[544]; |
|||
|
|||
/* build fixed huffman tables if first call (may not be thread safe) */ |
|||
if (virgin) { |
|||
unsigned sym, bits; |
|||
static code *next; |
|||
|
|||
/* literal/length table */ |
|||
sym = 0; |
|||
while (sym < 144) state->lens[sym++] = 8; |
|||
while (sym < 256) state->lens[sym++] = 9; |
|||
while (sym < 280) state->lens[sym++] = 7; |
|||
while (sym < 288) state->lens[sym++] = 8; |
|||
next = fixed; |
|||
lenfix = next; |
|||
bits = 9; |
|||
inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); |
|||
|
|||
/* distance table */ |
|||
sym = 0; |
|||
while (sym < 32) state->lens[sym++] = 5; |
|||
distfix = next; |
|||
bits = 5; |
|||
inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); |
|||
|
|||
/* do this just once */ |
|||
virgin = 0; |
|||
} |
|||
#else /* !BUILDFIXED */ |
|||
# include "inffixed.h" |
|||
#endif /* BUILDFIXED */ |
|||
state->lencode = lenfix; |
|||
state->lenbits = 9; |
|||
state->distcode = distfix; |
|||
state->distbits = 5; |
|||
} |
|||
|
|||
/* Macros for inflateBack(): */ |
|||
|
|||
/* Load returned state from inflate_fast() */ |
|||
#define LOAD() \ |
|||
do { \ |
|||
put = strm->next_out; \ |
|||
left = strm->avail_out; \ |
|||
next = strm->next_in; \ |
|||
have = strm->avail_in; \ |
|||
hold = state->hold; \ |
|||
bits = state->bits; \ |
|||
} while (0) |
|||
|
|||
/* Set state from registers for inflate_fast() */ |
|||
#define RESTORE() \ |
|||
do { \ |
|||
strm->next_out = put; \ |
|||
strm->avail_out = left; \ |
|||
strm->next_in = next; \ |
|||
strm->avail_in = have; \ |
|||
state->hold = hold; \ |
|||
state->bits = bits; \ |
|||
} while (0) |
|||
|
|||
/* Clear the input bit accumulator */ |
|||
#define INITBITS() \ |
|||
do { \ |
|||
hold = 0; \ |
|||
bits = 0; \ |
|||
} while (0) |
|||
|
|||
/* Assure that some input is available. If input is requested, but denied,
|
|||
then return a Z_BUF_ERROR from inflateBack(). */ |
|||
#define PULL() \ |
|||
do { \ |
|||
if (have == 0) { \ |
|||
have = in(in_desc, &next); \ |
|||
if (have == 0) { \ |
|||
next = Z_NULL; \ |
|||
ret = Z_BUF_ERROR; \ |
|||
goto inf_leave; \ |
|||
} \ |
|||
} \ |
|||
} while (0) |
|||
|
|||
/* Get a byte of input into the bit accumulator, or return from inflateBack()
|
|||
with an error if there is no input available. */ |
|||
#define PULLBYTE() \ |
|||
do { \ |
|||
PULL(); \ |
|||
have--; \ |
|||
hold += (unsigned long)(*next++) << bits; \ |
|||
bits += 8; \ |
|||
} while (0) |
|||
|
|||
/* Assure that there are at least n bits in the bit accumulator. If there is
|
|||
not enough available input to do that, then return from inflateBack() with |
|||
an error. */ |
|||
#define NEEDBITS(n) \ |
|||
do { \ |
|||
while (bits < (unsigned)(n)) \ |
|||
PULLBYTE(); \ |
|||
} while (0) |
|||
|
|||
/* Return the low n bits of the bit accumulator (n < 16) */ |
|||
#define BITS(n) \ |
|||
((unsigned)hold & ((1U << (n)) - 1)) |
|||
|
|||
/* Remove n bits from the bit accumulator */ |
|||
#define DROPBITS(n) \ |
|||
do { \ |
|||
hold >>= (n); \ |
|||
bits -= (unsigned)(n); \ |
|||
} while (0) |
|||
|
|||
/* Remove zero to seven bits as needed to go to a byte boundary */ |
|||
#define BYTEBITS() \ |
|||
do { \ |
|||
hold >>= bits & 7; \ |
|||
bits -= bits & 7; \ |
|||
} while (0) |
|||
|
|||
/* Assure that some output space is available, by writing out the window
|
|||
if it's full. If the write fails, return from inflateBack() with a |
|||
Z_BUF_ERROR. */ |
|||
#define ROOM() \ |
|||
do { \ |
|||
if (left == 0) { \ |
|||
put = state->window; \ |
|||
left = state->wsize; \ |
|||
state->whave = left; \ |
|||
if (out(out_desc, put, left)) { \ |
|||
ret = Z_BUF_ERROR; \ |
|||
goto inf_leave; \ |
|||
} \ |
|||
} \ |
|||
} while (0) |
|||
|
|||
/*
|
|||
strm provides the memory allocation functions and window buffer on input, |
|||
and provides information on the unused input on return. For Z_DATA_ERROR |
|||
returns, strm will also provide an error message. |
|||
|
|||
in() and out() are the call-back input and output functions. When |
|||
inflateBack() needs more input, it calls in(). When inflateBack() has |
|||
filled the window with output, or when it completes with data in the |
|||
window, it calls out() to write out the data. The application must not |
|||
change the provided input until in() is called again or inflateBack() |
|||
returns. The application must not change the window/output buffer until |
|||
inflateBack() returns. |
|||
|
|||
in() and out() are called with a descriptor parameter provided in the |
|||
inflateBack() call. This parameter can be a structure that provides the |
|||
information required to do the read or write, as well as accumulated |
|||
information on the input and output such as totals and check values. |
|||
|
|||
in() should return zero on failure. out() should return non-zero on |
|||
failure. If either in() or out() fails, than inflateBack() returns a |
|||
Z_BUF_ERROR. strm->next_in can be checked for Z_NULL to see whether it |
|||
was in() or out() that caused in the error. Otherwise, inflateBack() |
|||
returns Z_STREAM_END on success, Z_DATA_ERROR for an deflate format |
|||
error, or Z_MEM_ERROR if it could not allocate memory for the state. |
|||
inflateBack() can also return Z_STREAM_ERROR if the input parameters |
|||
are not correct, i.e. strm is Z_NULL or the state was not initialized. |
|||
*/ |
|||
int ZEXPORT inflateBack(strm, in, in_desc, out, out_desc) |
|||
z_streamp strm; |
|||
in_func in; |
|||
void FAR *in_desc; |
|||
out_func out; |
|||
void FAR *out_desc; |
|||
{ |
|||
struct inflate_state FAR *state; |
|||
unsigned char FAR *next; /* next input */ |
|||
unsigned char FAR *put; /* next output */ |
|||
unsigned have, left; /* available input and output */ |
|||
unsigned long hold; /* bit buffer */ |
|||
unsigned bits; /* bits in bit buffer */ |
|||
unsigned copy; /* number of stored or match bytes to copy */ |
|||
unsigned char FAR *from; /* where to copy match bytes from */ |
|||
code this; /* current decoding table entry */ |
|||
code last; /* parent table entry */ |
|||
unsigned len; /* length to copy for repeats, bits to drop */ |
|||
int ret; /* return code */ |
|||
static const unsigned short order[19] = /* permutation of code lengths */ |
|||
{16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; |
|||
|
|||
/* Check that the strm exists and that the state was initialized */ |
|||
if (strm == Z_NULL || strm->state == Z_NULL) |
|||
return Z_STREAM_ERROR; |
|||
state = (struct inflate_state FAR *)strm->state; |
|||
|
|||
/* Reset the state */ |
|||
strm->msg = Z_NULL; |
|||
state->mode = TYPE; |
|||
state->last = 0; |
|||
state->whave = 0; |
|||
next = strm->next_in; |
|||
have = next != Z_NULL ? strm->avail_in : 0; |
|||
hold = 0; |
|||
bits = 0; |
|||
put = state->window; |
|||
left = state->wsize; |
|||
|
|||
/* Inflate until end of block marked as last */ |
|||
for (;;) |
|||
switch (state->mode) { |
|||
case TYPE: |
|||
/* determine and dispatch block type */ |
|||
if (state->last) { |
|||
BYTEBITS(); |
|||
state->mode = DONE; |
|||
break; |
|||
} |
|||
NEEDBITS(3); |
|||
state->last = BITS(1); |
|||
DROPBITS(1); |
|||
switch (BITS(2)) { |
|||
case 0: /* stored block */ |
|||
Tracev((stderr, "inflate: stored block%s\n", |
|||
state->last ? " (last)" : "")); |
|||
state->mode = STORED; |
|||
break; |
|||
case 1: /* fixed block */ |
|||
fixedtables(state); |
|||
Tracev((stderr, "inflate: fixed codes block%s\n", |
|||
state->last ? " (last)" : "")); |
|||
state->mode = LEN; /* decode codes */ |
|||
break; |
|||
case 2: /* dynamic block */ |
|||
Tracev((stderr, "inflate: dynamic codes block%s\n", |
|||
state->last ? " (last)" : "")); |
|||
state->mode = TABLE; |
|||
break; |
|||
case 3: |
|||
strm->msg = (char *)"invalid block type"; |
|||
state->mode = BAD; |
|||
} |
|||
DROPBITS(2); |
|||
break; |
|||
|
|||
case STORED: |
|||
/* get and verify stored block length */ |
|||
BYTEBITS(); /* go to byte boundary */ |
|||
NEEDBITS(32); |
|||
if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) { |
|||
strm->msg = (char *)"invalid stored block lengths"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
state->length = (unsigned)hold & 0xffff; |
|||
Tracev((stderr, "inflate: stored length %u\n", |
|||
state->length)); |
|||
INITBITS(); |
|||
|
|||
/* copy stored block from input to output */ |
|||
while (state->length != 0) { |
|||
copy = state->length; |
|||
PULL(); |
|||
ROOM(); |
|||
if (copy > have) copy = have; |
|||
if (copy > left) copy = left; |
|||
zmemcpy(put, next, copy); |
|||
have -= copy; |
|||
next += copy; |
|||
left -= copy; |
|||
put += copy; |
|||
state->length -= copy; |
|||
} |
|||
Tracev((stderr, "inflate: stored end\n")); |
|||
state->mode = TYPE; |
|||
break; |
|||
|
|||
case TABLE: |
|||
/* get dynamic table entries descriptor */ |
|||
NEEDBITS(14); |
|||
state->nlen = BITS(5) + 257; |
|||
DROPBITS(5); |
|||
state->ndist = BITS(5) + 1; |
|||
DROPBITS(5); |
|||
state->ncode = BITS(4) + 4; |
|||
DROPBITS(4); |
|||
#ifndef PKZIP_BUG_WORKAROUND |
|||
if (state->nlen > 286 || state->ndist > 30) { |
|||
strm->msg = (char *)"too many length or distance symbols"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
#endif |
|||
Tracev((stderr, "inflate: table sizes ok\n")); |
|||
|
|||
/* get code length code lengths (not a typo) */ |
|||
state->have = 0; |
|||
while (state->have < state->ncode) { |
|||
NEEDBITS(3); |
|||
state->lens[order[state->have++]] = (unsigned short)BITS(3); |
|||
DROPBITS(3); |
|||
} |
|||
while (state->have < 19) |
|||
state->lens[order[state->have++]] = 0; |
|||
state->next = state->codes; |
|||
state->lencode = (code const FAR *)(state->next); |
|||
state->lenbits = 7; |
|||
ret = inflate_table(CODES, state->lens, 19, &(state->next), |
|||
&(state->lenbits), state->work); |
|||
if (ret) { |
|||
strm->msg = (char *)"invalid code lengths set"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
Tracev((stderr, "inflate: code lengths ok\n")); |
|||
|
|||
/* get length and distance code code lengths */ |
|||
state->have = 0; |
|||
while (state->have < state->nlen + state->ndist) { |
|||
for (;;) { |
|||
this = state->lencode[BITS(state->lenbits)]; |
|||
if ((unsigned)(this.bits) <= bits) break; |
|||
PULLBYTE(); |
|||
} |
|||
if (this.val < 16) { |
|||
NEEDBITS(this.bits); |
|||
DROPBITS(this.bits); |
|||
state->lens[state->have++] = this.val; |
|||
} |
|||
else { |
|||
if (this.val == 16) { |
|||
NEEDBITS(this.bits + 2); |
|||
DROPBITS(this.bits); |
|||
if (state->have == 0) { |
|||
strm->msg = (char *)"invalid bit length repeat"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
len = (unsigned)(state->lens[state->have - 1]); |
|||
copy = 3 + BITS(2); |
|||
DROPBITS(2); |
|||
} |
|||
else if (this.val == 17) { |
|||
NEEDBITS(this.bits + 3); |
|||
DROPBITS(this.bits); |
|||
len = 0; |
|||
copy = 3 + BITS(3); |
|||
DROPBITS(3); |
|||
} |
|||
else { |
|||
NEEDBITS(this.bits + 7); |
|||
DROPBITS(this.bits); |
|||
len = 0; |
|||
copy = 11 + BITS(7); |
|||
DROPBITS(7); |
|||
} |
|||
if (state->have + copy > state->nlen + state->ndist) { |
|||
strm->msg = (char *)"invalid bit length repeat"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
while (copy--) |
|||
state->lens[state->have++] = (unsigned short)len; |
|||
} |
|||
} |
|||
|
|||
/* handle error breaks in while */ |
|||
if (state->mode == BAD) break; |
|||
|
|||
/* build code tables */ |
|||
state->next = state->codes; |
|||
state->lencode = (code const FAR *)(state->next); |
|||
state->lenbits = 9; |
|||
ret = inflate_table(LENS, state->lens, state->nlen, &(state->next), |
|||
&(state->lenbits), state->work); |
|||
if (ret) { |
|||
strm->msg = (char *)"invalid literal/lengths set"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
state->distcode = (code const FAR *)(state->next); |
|||
state->distbits = 6; |
|||
ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist, |
|||
&(state->next), &(state->distbits), state->work); |
|||
if (ret) { |
|||
strm->msg = (char *)"invalid distances set"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
Tracev((stderr, "inflate: codes ok\n")); |
|||
state->mode = LEN; |
|||
|
|||
case LEN: |
|||
/* use inflate_fast() if we have enough input and output */ |
|||
if (have >= 6 && left >= 258) { |
|||
RESTORE(); |
|||
if (state->whave < state->wsize) |
|||
state->whave = state->wsize - left; |
|||
inflate_fast(strm, state->wsize); |
|||
LOAD(); |
|||
break; |
|||
} |
|||
|
|||
/* get a literal, length, or end-of-block code */ |
|||
for (;;) { |
|||
this = state->lencode[BITS(state->lenbits)]; |
|||
if ((unsigned)(this.bits) <= bits) break; |
|||
PULLBYTE(); |
|||
} |
|||
if (this.op && (this.op & 0xf0) == 0) { |
|||
last = this; |
|||
for (;;) { |
|||
this = state->lencode[last.val + |
|||
(BITS(last.bits + last.op) >> last.bits)]; |
|||
if ((unsigned)(last.bits + this.bits) <= bits) break; |
|||
PULLBYTE(); |
|||
} |
|||
DROPBITS(last.bits); |
|||
} |
|||
DROPBITS(this.bits); |
|||
state->length = (unsigned)this.val; |
|||
|
|||
/* process literal */ |
|||
if (this.op == 0) { |
|||
Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ? |
|||
"inflate: literal '%c'\n" : |
|||
"inflate: literal 0x%02x\n", this.val)); |
|||
ROOM(); |
|||
*put++ = (unsigned char)(state->length); |
|||
left--; |
|||
state->mode = LEN; |
|||
break; |
|||
} |
|||
|
|||
/* process end of block */ |
|||
if (this.op & 32) { |
|||
Tracevv((stderr, "inflate: end of block\n")); |
|||
state->mode = TYPE; |
|||
break; |
|||
} |
|||
|
|||
/* invalid code */ |
|||
if (this.op & 64) { |
|||
strm->msg = (char *)"invalid literal/length code"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
|
|||
/* length code -- get extra bits, if any */ |
|||
state->extra = (unsigned)(this.op) & 15; |
|||
if (state->extra != 0) { |
|||
NEEDBITS(state->extra); |
|||
state->length += BITS(state->extra); |
|||
DROPBITS(state->extra); |
|||
} |
|||
Tracevv((stderr, "inflate: length %u\n", state->length)); |
|||
|
|||
/* get distance code */ |
|||
for (;;) { |
|||
this = state->distcode[BITS(state->distbits)]; |
|||
if ((unsigned)(this.bits) <= bits) break; |
|||
PULLBYTE(); |
|||
} |
|||
if ((this.op & 0xf0) == 0) { |
|||
last = this; |
|||
for (;;) { |
|||
this = state->distcode[last.val + |
|||
(BITS(last.bits + last.op) >> last.bits)]; |
|||
if ((unsigned)(last.bits + this.bits) <= bits) break; |
|||
PULLBYTE(); |
|||
} |
|||
DROPBITS(last.bits); |
|||
} |
|||
DROPBITS(this.bits); |
|||
if (this.op & 64) { |
|||
strm->msg = (char *)"invalid distance code"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
state->offset = (unsigned)this.val; |
|||
|
|||
/* get distance extra bits, if any */ |
|||
state->extra = (unsigned)(this.op) & 15; |
|||
if (state->extra != 0) { |
|||
NEEDBITS(state->extra); |
|||
state->offset += BITS(state->extra); |
|||
DROPBITS(state->extra); |
|||
} |
|||
if (state->offset > state->wsize - (state->whave < state->wsize ? |
|||
left : 0)) { |
|||
strm->msg = (char *)"invalid distance too far back"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
Tracevv((stderr, "inflate: distance %u\n", state->offset)); |
|||
|
|||
/* copy match from window to output */ |
|||
do { |
|||
ROOM(); |
|||
copy = state->wsize - state->offset; |
|||
if (copy < left) { |
|||
from = put + copy; |
|||
copy = left - copy; |
|||
} |
|||
else { |
|||
from = put - state->offset; |
|||
copy = left; |
|||
} |
|||
if (copy > state->length) copy = state->length; |
|||
state->length -= copy; |
|||
left -= copy; |
|||
do { |
|||
*put++ = *from++; |
|||
} while (--copy); |
|||
} while (state->length != 0); |
|||
break; |
|||
|
|||
case DONE: |
|||
/* inflate stream terminated properly -- write leftover output */ |
|||
ret = Z_STREAM_END; |
|||
if (left < state->wsize) { |
|||
if (out(out_desc, state->window, state->wsize - left)) |
|||
ret = Z_BUF_ERROR; |
|||
} |
|||
goto inf_leave; |
|||
|
|||
case BAD: |
|||
ret = Z_DATA_ERROR; |
|||
goto inf_leave; |
|||
|
|||
default: /* can't happen, but makes compilers happy */ |
|||
ret = Z_STREAM_ERROR; |
|||
goto inf_leave; |
|||
} |
|||
|
|||
/* Return unused input */ |
|||
inf_leave: |
|||
strm->next_in = next; |
|||
strm->avail_in = have; |
|||
return ret; |
|||
} |
|||
|
|||
int ZEXPORT inflateBackEnd(strm) |
|||
z_streamp strm; |
|||
{ |
|||
if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0) |
|||
return Z_STREAM_ERROR; |
|||
ZFREE(strm, strm->state); |
|||
strm->state = Z_NULL; |
|||
Tracev((stderr, "inflate: end\n")); |
|||
return Z_OK; |
|||
} |
|||
@ -0,0 +1,318 @@ |
|||
/* inffast.c -- fast decoding
|
|||
* Copyright (C) 1995-2004 Mark Adler |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
#include "zutil.h" |
|||
#include "inftrees.h" |
|||
#include "inflate.h" |
|||
#include "inffast.h" |
|||
|
|||
#ifndef ASMINF |
|||
|
|||
/* Allow machine dependent optimization for post-increment or pre-increment.
|
|||
Based on testing to date, |
|||
Pre-increment preferred for: |
|||
- PowerPC G3 (Adler) |
|||
- MIPS R5000 (Randers-Pehrson) |
|||
Post-increment preferred for: |
|||
- none |
|||
No measurable difference: |
|||
- Pentium III (Anderson) |
|||
- M68060 (Nikl) |
|||
*/ |
|||
#ifdef POSTINC |
|||
# define OFF 0 |
|||
# define PUP(a) *(a)++ |
|||
#else |
|||
# define OFF 1 |
|||
# define PUP(a) *++(a) |
|||
#endif |
|||
|
|||
/*
|
|||
Decode literal, length, and distance codes and write out the resulting |
|||
literal and match bytes until either not enough input or output is |
|||
available, an end-of-block is encountered, or a data error is encountered. |
|||
When large enough input and output buffers are supplied to inflate(), for |
|||
example, a 16K input buffer and a 64K output buffer, more than 95% of the |
|||
inflate execution time is spent in this routine. |
|||
|
|||
Entry assumptions: |
|||
|
|||
state->mode == LEN |
|||
strm->avail_in >= 6 |
|||
strm->avail_out >= 258 |
|||
start >= strm->avail_out |
|||
state->bits < 8 |
|||
|
|||
On return, state->mode is one of: |
|||
|
|||
LEN -- ran out of enough output space or enough available input |
|||
TYPE -- reached end of block code, inflate() to interpret next block |
|||
BAD -- error in block data |
|||
|
|||
Notes: |
|||
|
|||
- The maximum input bits used by a length/distance pair is 15 bits for the |
|||
length code, 5 bits for the length extra, 15 bits for the distance code, |
|||
and 13 bits for the distance extra. This totals 48 bits, or six bytes. |
|||
Therefore if strm->avail_in >= 6, then there is enough input to avoid |
|||
checking for available input while decoding. |
|||
|
|||
- The maximum bytes that a single length/distance pair can output is 258 |
|||
bytes, which is the maximum length that can be coded. inflate_fast() |
|||
requires strm->avail_out >= 258 for each loop to avoid checking for |
|||
output space. |
|||
*/ |
|||
void inflate_fast(strm, start) |
|||
z_streamp strm; |
|||
unsigned start; /* inflate()'s starting value for strm->avail_out */ |
|||
{ |
|||
struct inflate_state FAR *state; |
|||
unsigned char FAR *in; /* local strm->next_in */ |
|||
unsigned char FAR *last; /* while in < last, enough input available */ |
|||
unsigned char FAR *out; /* local strm->next_out */ |
|||
unsigned char FAR *beg; /* inflate()'s initial strm->next_out */ |
|||
unsigned char FAR *end; /* while out < end, enough space available */ |
|||
#ifdef INFLATE_STRICT |
|||
unsigned dmax; /* maximum distance from zlib header */ |
|||
#endif |
|||
unsigned wsize; /* window size or zero if not using window */ |
|||
unsigned whave; /* valid bytes in the window */ |
|||
unsigned write; /* window write index */ |
|||
unsigned char FAR *window; /* allocated sliding window, if wsize != 0 */ |
|||
unsigned long hold; /* local strm->hold */ |
|||
unsigned bits; /* local strm->bits */ |
|||
code const FAR *lcode; /* local strm->lencode */ |
|||
code const FAR *dcode; /* local strm->distcode */ |
|||
unsigned lmask; /* mask for first level of length codes */ |
|||
unsigned dmask; /* mask for first level of distance codes */ |
|||
code this; /* retrieved table entry */ |
|||
unsigned op; /* code bits, operation, extra bits, or */ |
|||
/* window position, window bytes to copy */ |
|||
unsigned len; /* match length, unused bytes */ |
|||
unsigned dist; /* match distance */ |
|||
unsigned char FAR *from; /* where to copy match from */ |
|||
|
|||
/* copy state to local variables */ |
|||
state = (struct inflate_state FAR *)strm->state; |
|||
in = strm->next_in - OFF; |
|||
last = in + (strm->avail_in - 5); |
|||
out = strm->next_out - OFF; |
|||
beg = out - (start - strm->avail_out); |
|||
end = out + (strm->avail_out - 257); |
|||
#ifdef INFLATE_STRICT |
|||
dmax = state->dmax; |
|||
#endif |
|||
wsize = state->wsize; |
|||
whave = state->whave; |
|||
write = state->write; |
|||
window = state->window; |
|||
hold = state->hold; |
|||
bits = state->bits; |
|||
lcode = state->lencode; |
|||
dcode = state->distcode; |
|||
lmask = (1U << state->lenbits) - 1; |
|||
dmask = (1U << state->distbits) - 1; |
|||
|
|||
/* decode literals and length/distances until end-of-block or not enough
|
|||
input data or output space */ |
|||
do { |
|||
if (bits < 15) { |
|||
hold += (unsigned long)(PUP(in)) << bits; |
|||
bits += 8; |
|||
hold += (unsigned long)(PUP(in)) << bits; |
|||
bits += 8; |
|||
} |
|||
this = lcode[hold & lmask]; |
|||
dolen: |
|||
op = (unsigned)(this.bits); |
|||
hold >>= op; |
|||
bits -= op; |
|||
op = (unsigned)(this.op); |
|||
if (op == 0) { /* literal */ |
|||
Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ? |
|||
"inflate: literal '%c'\n" : |
|||
"inflate: literal 0x%02x\n", this.val)); |
|||
PUP(out) = (unsigned char)(this.val); |
|||
} |
|||
else if (op & 16) { /* length base */ |
|||
len = (unsigned)(this.val); |
|||
op &= 15; /* number of extra bits */ |
|||
if (op) { |
|||
if (bits < op) { |
|||
hold += (unsigned long)(PUP(in)) << bits; |
|||
bits += 8; |
|||
} |
|||
len += (unsigned)hold & ((1U << op) - 1); |
|||
hold >>= op; |
|||
bits -= op; |
|||
} |
|||
Tracevv((stderr, "inflate: length %u\n", len)); |
|||
if (bits < 15) { |
|||
hold += (unsigned long)(PUP(in)) << bits; |
|||
bits += 8; |
|||
hold += (unsigned long)(PUP(in)) << bits; |
|||
bits += 8; |
|||
} |
|||
this = dcode[hold & dmask]; |
|||
dodist: |
|||
op = (unsigned)(this.bits); |
|||
hold >>= op; |
|||
bits -= op; |
|||
op = (unsigned)(this.op); |
|||
if (op & 16) { /* distance base */ |
|||
dist = (unsigned)(this.val); |
|||
op &= 15; /* number of extra bits */ |
|||
if (bits < op) { |
|||
hold += (unsigned long)(PUP(in)) << bits; |
|||
bits += 8; |
|||
if (bits < op) { |
|||
hold += (unsigned long)(PUP(in)) << bits; |
|||
bits += 8; |
|||
} |
|||
} |
|||
dist += (unsigned)hold & ((1U << op) - 1); |
|||
#ifdef INFLATE_STRICT |
|||
if (dist > dmax) { |
|||
strm->msg = (char *)"invalid distance too far back"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
#endif |
|||
hold >>= op; |
|||
bits -= op; |
|||
Tracevv((stderr, "inflate: distance %u\n", dist)); |
|||
op = (unsigned)(out - beg); /* max distance in output */ |
|||
if (dist > op) { /* see if copy from window */ |
|||
op = dist - op; /* distance back in window */ |
|||
if (op > whave) { |
|||
strm->msg = (char *)"invalid distance too far back"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
from = window - OFF; |
|||
if (write == 0) { /* very common case */ |
|||
from += wsize - op; |
|||
if (op < len) { /* some from window */ |
|||
len -= op; |
|||
do { |
|||
PUP(out) = PUP(from); |
|||
} while (--op); |
|||
from = out - dist; /* rest from output */ |
|||
} |
|||
} |
|||
else if (write < op) { /* wrap around window */ |
|||
from += wsize + write - op; |
|||
op -= write; |
|||
if (op < len) { /* some from end of window */ |
|||
len -= op; |
|||
do { |
|||
PUP(out) = PUP(from); |
|||
} while (--op); |
|||
from = window - OFF; |
|||
if (write < len) { /* some from start of window */ |
|||
op = write; |
|||
len -= op; |
|||
do { |
|||
PUP(out) = PUP(from); |
|||
} while (--op); |
|||
from = out - dist; /* rest from output */ |
|||
} |
|||
} |
|||
} |
|||
else { /* contiguous in window */ |
|||
from += write - op; |
|||
if (op < len) { /* some from window */ |
|||
len -= op; |
|||
do { |
|||
PUP(out) = PUP(from); |
|||
} while (--op); |
|||
from = out - dist; /* rest from output */ |
|||
} |
|||
} |
|||
while (len > 2) { |
|||
PUP(out) = PUP(from); |
|||
PUP(out) = PUP(from); |
|||
PUP(out) = PUP(from); |
|||
len -= 3; |
|||
} |
|||
if (len) { |
|||
PUP(out) = PUP(from); |
|||
if (len > 1) |
|||
PUP(out) = PUP(from); |
|||
} |
|||
} |
|||
else { |
|||
from = out - dist; /* copy direct from output */ |
|||
do { /* minimum length is three */ |
|||
PUP(out) = PUP(from); |
|||
PUP(out) = PUP(from); |
|||
PUP(out) = PUP(from); |
|||
len -= 3; |
|||
} while (len > 2); |
|||
if (len) { |
|||
PUP(out) = PUP(from); |
|||
if (len > 1) |
|||
PUP(out) = PUP(from); |
|||
} |
|||
} |
|||
} |
|||
else if ((op & 64) == 0) { /* 2nd level distance code */ |
|||
this = dcode[this.val + (hold & ((1U << op) - 1))]; |
|||
goto dodist; |
|||
} |
|||
else { |
|||
strm->msg = (char *)"invalid distance code"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
} |
|||
else if ((op & 64) == 0) { /* 2nd level length code */ |
|||
this = lcode[this.val + (hold & ((1U << op) - 1))]; |
|||
goto dolen; |
|||
} |
|||
else if (op & 32) { /* end-of-block */ |
|||
Tracevv((stderr, "inflate: end of block\n")); |
|||
state->mode = TYPE; |
|||
break; |
|||
} |
|||
else { |
|||
strm->msg = (char *)"invalid literal/length code"; |
|||
state->mode = BAD; |
|||
break; |
|||
} |
|||
} while (in < last && out < end); |
|||
|
|||
/* return unused bytes (on entry, bits < 8, so in won't go too far back) */ |
|||
len = bits >> 3; |
|||
in -= len; |
|||
bits -= len << 3; |
|||
hold &= (1U << bits) - 1; |
|||
|
|||
/* update state and return */ |
|||
strm->next_in = in + OFF; |
|||
strm->next_out = out + OFF; |
|||
strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last)); |
|||
strm->avail_out = (unsigned)(out < end ? |
|||
257 + (end - out) : 257 - (out - end)); |
|||
state->hold = hold; |
|||
state->bits = bits; |
|||
return; |
|||
} |
|||
|
|||
/*
|
|||
inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe): |
|||
- Using bit fields for code structure |
|||
- Different op definition to avoid & for extra bits (do & for table bits) |
|||
- Three separate decoding do-loops for direct, window, and write == 0 |
|||
- Special case for distance > 1 copies to do overlapped load and store copy |
|||
- Explicit branch predictions (based on measured branch probabilities) |
|||
- Deferring match copy and interspersed it with decoding subsequent codes |
|||
- Swapping literal/length else |
|||
- Swapping window/direct else |
|||
- Larger unrolled copy loops (three is about right) |
|||
- Moving len -= 3 statement into middle of loop |
|||
*/ |
|||
|
|||
#endif /* !ASMINF */ |
|||
@ -0,0 +1,11 @@ |
|||
/* inffast.h -- header to use inffast.c
|
|||
* Copyright (C) 1995-2003 Mark Adler |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* WARNING: this file should *not* be used by applications. It is
|
|||
part of the implementation of the compression library and is |
|||
subject to change. Applications should only use zlib.h. |
|||
*/ |
|||
|
|||
void inflate_fast OF((z_streamp strm, unsigned start)); |
|||
@ -0,0 +1,94 @@ |
|||
/* inffixed.h -- table for decoding fixed codes
|
|||
* Generated automatically by makefixed(). |
|||
*/ |
|||
|
|||
/* WARNING: this file should *not* be used by applications. It
|
|||
is part of the implementation of the compression library and |
|||
is subject to change. Applications should only use zlib.h. |
|||
*/ |
|||
|
|||
static const code lenfix[512] = { |
|||
{96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48}, |
|||
{0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128}, |
|||
{0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59}, |
|||
{0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176}, |
|||
{0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20}, |
|||
{21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100}, |
|||
{0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8}, |
|||
{0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216}, |
|||
{18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76}, |
|||
{0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114}, |
|||
{0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2}, |
|||
{0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148}, |
|||
{20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42}, |
|||
{0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86}, |
|||
{0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15}, |
|||
{0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236}, |
|||
{16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62}, |
|||
{0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142}, |
|||
{0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31}, |
|||
{0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162}, |
|||
{0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25}, |
|||
{0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105}, |
|||
{0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4}, |
|||
{0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202}, |
|||
{17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69}, |
|||
{0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125}, |
|||
{0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13}, |
|||
{0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195}, |
|||
{19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35}, |
|||
{0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91}, |
|||
{0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19}, |
|||
{0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246}, |
|||
{16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55}, |
|||
{0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135}, |
|||
{0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99}, |
|||
{0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190}, |
|||
{0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16}, |
|||
{20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96}, |
|||
{0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6}, |
|||
{0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209}, |
|||
{17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72}, |
|||
{0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116}, |
|||
{0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4}, |
|||
{0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153}, |
|||
{20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44}, |
|||
{0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82}, |
|||
{0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11}, |
|||
{0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229}, |
|||
{16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58}, |
|||
{0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138}, |
|||
{0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51}, |
|||
{0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173}, |
|||
{0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30}, |
|||
{0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110}, |
|||
{0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0}, |
|||
{0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195}, |
|||
{16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65}, |
|||
{0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121}, |
|||
{0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9}, |
|||
{0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258}, |
|||
{19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37}, |
|||
{0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93}, |
|||
{0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23}, |
|||
{0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251}, |
|||
{16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51}, |
|||
{0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131}, |
|||
{0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67}, |
|||
{0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183}, |
|||
{0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23}, |
|||
{64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103}, |
|||
{0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9}, |
|||
{0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223}, |
|||
{18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79}, |
|||
{0,9,255} |
|||
}; |
|||
|
|||
static const code distfix[32] = { |
|||
{16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025}, |
|||
{21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193}, |
|||
{18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385}, |
|||
{19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577}, |
|||
{16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073}, |
|||
{22,5,193},{64,5,0} |
|||
}; |
|||
File diff suppressed because it is too large
@ -0,0 +1,115 @@ |
|||
/* inflate.h -- internal inflate state definition
|
|||
* Copyright (C) 1995-2004 Mark Adler |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* WARNING: this file should *not* be used by applications. It is
|
|||
part of the implementation of the compression library and is |
|||
subject to change. Applications should only use zlib.h. |
|||
*/ |
|||
|
|||
/* define NO_GZIP when compiling if you want to disable gzip header and
|
|||
trailer decoding by inflate(). NO_GZIP would be used to avoid linking in |
|||
the crc code when it is not needed. For shared libraries, gzip decoding |
|||
should be left enabled. */ |
|||
#ifndef NO_GZIP |
|||
# define GUNZIP |
|||
#endif |
|||
|
|||
/* Possible inflate modes between inflate() calls */ |
|||
typedef enum { |
|||
HEAD, /* i: waiting for magic header */ |
|||
FLAGS, /* i: waiting for method and flags (gzip) */ |
|||
TIME, /* i: waiting for modification time (gzip) */ |
|||
OS, /* i: waiting for extra flags and operating system (gzip) */ |
|||
EXLEN, /* i: waiting for extra length (gzip) */ |
|||
EXTRA, /* i: waiting for extra bytes (gzip) */ |
|||
NAME, /* i: waiting for end of file name (gzip) */ |
|||
COMMENT, /* i: waiting for end of comment (gzip) */ |
|||
HCRC, /* i: waiting for header crc (gzip) */ |
|||
DICTID, /* i: waiting for dictionary check value */ |
|||
DICT, /* waiting for inflateSetDictionary() call */ |
|||
TYPE, /* i: waiting for type bits, including last-flag bit */ |
|||
TYPEDO, /* i: same, but skip check to exit inflate on new block */ |
|||
STORED, /* i: waiting for stored size (length and complement) */ |
|||
COPY, /* i/o: waiting for input or output to copy stored block */ |
|||
TABLE, /* i: waiting for dynamic block table lengths */ |
|||
LENLENS, /* i: waiting for code length code lengths */ |
|||
CODELENS, /* i: waiting for length/lit and distance code lengths */ |
|||
LEN, /* i: waiting for length/lit code */ |
|||
LENEXT, /* i: waiting for length extra bits */ |
|||
DIST, /* i: waiting for distance code */ |
|||
DISTEXT, /* i: waiting for distance extra bits */ |
|||
MATCH, /* o: waiting for output space to copy string */ |
|||
LIT, /* o: waiting for output space to write literal */ |
|||
CHECK, /* i: waiting for 32-bit check value */ |
|||
LENGTH, /* i: waiting for 32-bit length (gzip) */ |
|||
DONE, /* finished check, done -- remain here until reset */ |
|||
BAD, /* got a data error -- remain here until reset */ |
|||
MEM, /* got an inflate() memory error -- remain here until reset */ |
|||
SYNC /* looking for synchronization bytes to restart inflate() */ |
|||
} inflate_mode; |
|||
|
|||
/*
|
|||
State transitions between above modes - |
|||
|
|||
(most modes can go to the BAD or MEM mode -- not shown for clarity) |
|||
|
|||
Process header: |
|||
HEAD -> (gzip) or (zlib) |
|||
(gzip) -> FLAGS -> TIME -> OS -> EXLEN -> EXTRA -> NAME |
|||
NAME -> COMMENT -> HCRC -> TYPE |
|||
(zlib) -> DICTID or TYPE |
|||
DICTID -> DICT -> TYPE |
|||
Read deflate blocks: |
|||
TYPE -> STORED or TABLE or LEN or CHECK |
|||
STORED -> COPY -> TYPE |
|||
TABLE -> LENLENS -> CODELENS -> LEN |
|||
Read deflate codes: |
|||
LEN -> LENEXT or LIT or TYPE |
|||
LENEXT -> DIST -> DISTEXT -> MATCH -> LEN |
|||
LIT -> LEN |
|||
Process trailer: |
|||
CHECK -> LENGTH -> DONE |
|||
*/ |
|||
|
|||
/* state maintained between inflate() calls. Approximately 7K bytes. */ |
|||
struct inflate_state { |
|||
inflate_mode mode; /* current inflate mode */ |
|||
int last; /* true if processing last block */ |
|||
int wrap; /* bit 0 true for zlib, bit 1 true for gzip */ |
|||
int havedict; /* true if dictionary provided */ |
|||
int flags; /* gzip header method and flags (0 if zlib) */ |
|||
unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */ |
|||
unsigned long check; /* protected copy of check value */ |
|||
unsigned long total; /* protected copy of output count */ |
|||
gz_headerp head; /* where to save gzip header information */ |
|||
/* sliding window */ |
|||
unsigned wbits; /* log base 2 of requested window size */ |
|||
unsigned wsize; /* window size or zero if not using window */ |
|||
unsigned whave; /* valid bytes in the window */ |
|||
unsigned write; /* window write index */ |
|||
unsigned char FAR *window; /* allocated sliding window, if needed */ |
|||
/* bit accumulator */ |
|||
unsigned long hold; /* input bit accumulator */ |
|||
unsigned bits; /* number of bits in "in" */ |
|||
/* for string and stored block copying */ |
|||
unsigned length; /* literal or length of data to copy */ |
|||
unsigned offset; /* distance back to copy string from */ |
|||
/* for table and code decoding */ |
|||
unsigned extra; /* extra bits needed */ |
|||
/* fixed and dynamic code tables */ |
|||
code const FAR *lencode; /* starting table for length/literal codes */ |
|||
code const FAR *distcode; /* starting table for distance codes */ |
|||
unsigned lenbits; /* index bits for lencode */ |
|||
unsigned distbits; /* index bits for distcode */ |
|||
/* dynamic table building */ |
|||
unsigned ncode; /* number of code length code lengths */ |
|||
unsigned nlen; /* number of length code lengths */ |
|||
unsigned ndist; /* number of distance code lengths */ |
|||
unsigned have; /* number of code lengths in lens[] */ |
|||
code FAR *next; /* next available space in codes[] */ |
|||
unsigned short lens[320]; /* temporary storage for code lengths */ |
|||
unsigned short work[288]; /* work area for code table building */ |
|||
code codes[ENOUGH]; /* space for code tables */ |
|||
}; |
|||
@ -0,0 +1,329 @@ |
|||
/* inftrees.c -- generate Huffman trees for efficient decoding
|
|||
* Copyright (C) 1995-2005 Mark Adler |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
#include "zutil.h" |
|||
#include "inftrees.h" |
|||
|
|||
#define MAXBITS 15 |
|||
|
|||
const char inflate_copyright[] = |
|||
" inflate 1.2.3 Copyright 1995-2005 Mark Adler "; |
|||
/*
|
|||
If you use the zlib library in a product, an acknowledgment is welcome |
|||
in the documentation of your product. If for some reason you cannot |
|||
include such an acknowledgment, I would appreciate that you keep this |
|||
copyright string in the executable of your product. |
|||
*/ |
|||
|
|||
/*
|
|||
Build a set of tables to decode the provided canonical Huffman code. |
|||
The code lengths are lens[0..codes-1]. The result starts at *table, |
|||
whose indices are 0..2^bits-1. work is a writable array of at least |
|||
lens shorts, which is used as a work area. type is the type of code |
|||
to be generated, CODES, LENS, or DISTS. On return, zero is success, |
|||
-1 is an invalid code, and +1 means that ENOUGH isn't enough. table |
|||
on return points to the next available entry's address. bits is the |
|||
requested root table index bits, and on return it is the actual root |
|||
table index bits. It will differ if the request is greater than the |
|||
longest code or if it is less than the shortest code. |
|||
*/ |
|||
int inflate_table(type, lens, codes, table, bits, work) |
|||
codetype type; |
|||
unsigned short FAR *lens; |
|||
unsigned codes; |
|||
code FAR * FAR *table; |
|||
unsigned FAR *bits; |
|||
unsigned short FAR *work; |
|||
{ |
|||
unsigned len; /* a code's length in bits */ |
|||
unsigned sym; /* index of code symbols */ |
|||
unsigned min, max; /* minimum and maximum code lengths */ |
|||
unsigned root; /* number of index bits for root table */ |
|||
unsigned curr; /* number of index bits for current table */ |
|||
unsigned drop; /* code bits to drop for sub-table */ |
|||
int left; /* number of prefix codes available */ |
|||
unsigned used; /* code entries in table used */ |
|||
unsigned huff; /* Huffman code */ |
|||
unsigned incr; /* for incrementing code, index */ |
|||
unsigned fill; /* index for replicating entries */ |
|||
unsigned low; /* low bits for current root entry */ |
|||
unsigned mask; /* mask for low root bits */ |
|||
code this; /* table entry for duplication */ |
|||
code FAR *next; /* next available space in table */ |
|||
const unsigned short FAR *base; /* base value table to use */ |
|||
const unsigned short FAR *extra; /* extra bits table to use */ |
|||
int end; /* use base and extra for symbol > end */ |
|||
unsigned short count[MAXBITS+1]; /* number of codes of each length */ |
|||
unsigned short offs[MAXBITS+1]; /* offsets in table for each length */ |
|||
static const unsigned short lbase[31] = { /* Length codes 257..285 base */ |
|||
3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, |
|||
35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; |
|||
static const unsigned short lext[31] = { /* Length codes 257..285 extra */ |
|||
16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, |
|||
19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 201, 196}; |
|||
static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ |
|||
1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, |
|||
257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, |
|||
8193, 12289, 16385, 24577, 0, 0}; |
|||
static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ |
|||
16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, |
|||
23, 23, 24, 24, 25, 25, 26, 26, 27, 27, |
|||
28, 28, 29, 29, 64, 64}; |
|||
|
|||
/*
|
|||
Process a set of code lengths to create a canonical Huffman code. The |
|||
code lengths are lens[0..codes-1]. Each length corresponds to the |
|||
symbols 0..codes-1. The Huffman code is generated by first sorting the |
|||
symbols by length from short to long, and retaining the symbol order |
|||
for codes with equal lengths. Then the code starts with all zero bits |
|||
for the first code of the shortest length, and the codes are integer |
|||
increments for the same length, and zeros are appended as the length |
|||
increases. For the deflate format, these bits are stored backwards |
|||
from their more natural integer increment ordering, and so when the |
|||
decoding tables are built in the large loop below, the integer codes |
|||
are incremented backwards. |
|||
|
|||
This routine assumes, but does not check, that all of the entries in |
|||
lens[] are in the range 0..MAXBITS. The caller must assure this. |
|||
1..MAXBITS is interpreted as that code length. zero means that that |
|||
symbol does not occur in this code. |
|||
|
|||
The codes are sorted by computing a count of codes for each length, |
|||
creating from that a table of starting indices for each length in the |
|||
sorted table, and then entering the symbols in order in the sorted |
|||
table. The sorted table is work[], with that space being provided by |
|||
the caller. |
|||
|
|||
The length counts are used for other purposes as well, i.e. finding |
|||
the minimum and maximum length codes, determining if there are any |
|||
codes at all, checking for a valid set of lengths, and looking ahead |
|||
at length counts to determine sub-table sizes when building the |
|||
decoding tables. |
|||
*/ |
|||
|
|||
/* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ |
|||
for (len = 0; len <= MAXBITS; len++) |
|||
count[len] = 0; |
|||
for (sym = 0; sym < codes; sym++) |
|||
count[lens[sym]]++; |
|||
|
|||
/* bound code lengths, force root to be within code lengths */ |
|||
root = *bits; |
|||
for (max = MAXBITS; max >= 1; max--) |
|||
if (count[max] != 0) break; |
|||
if (root > max) root = max; |
|||
if (max == 0) { /* no symbols to code at all */ |
|||
this.op = (unsigned char)64; /* invalid code marker */ |
|||
this.bits = (unsigned char)1; |
|||
this.val = (unsigned short)0; |
|||
*(*table)++ = this; /* make a table to force an error */ |
|||
*(*table)++ = this; |
|||
*bits = 1; |
|||
return 0; /* no symbols, but wait for decoding to report error */ |
|||
} |
|||
for (min = 1; min <= MAXBITS; min++) |
|||
if (count[min] != 0) break; |
|||
if (root < min) root = min; |
|||
|
|||
/* check for an over-subscribed or incomplete set of lengths */ |
|||
left = 1; |
|||
for (len = 1; len <= MAXBITS; len++) { |
|||
left <<= 1; |
|||
left -= count[len]; |
|||
if (left < 0) return -1; /* over-subscribed */ |
|||
} |
|||
if (left > 0 && (type == CODES || max != 1)) |
|||
return -1; /* incomplete set */ |
|||
|
|||
/* generate offsets into symbol table for each length for sorting */ |
|||
offs[1] = 0; |
|||
for (len = 1; len < MAXBITS; len++) |
|||
offs[len + 1] = offs[len] + count[len]; |
|||
|
|||
/* sort symbols by length, by symbol order within each length */ |
|||
for (sym = 0; sym < codes; sym++) |
|||
if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym; |
|||
|
|||
/*
|
|||
Create and fill in decoding tables. In this loop, the table being |
|||
filled is at next and has curr index bits. The code being used is huff |
|||
with length len. That code is converted to an index by dropping drop |
|||
bits off of the bottom. For codes where len is less than drop + curr, |
|||
those top drop + curr - len bits are incremented through all values to |
|||
fill the table with replicated entries. |
|||
|
|||
root is the number of index bits for the root table. When len exceeds |
|||
root, sub-tables are created pointed to by the root entry with an index |
|||
of the low root bits of huff. This is saved in low to check for when a |
|||
new sub-table should be started. drop is zero when the root table is |
|||
being filled, and drop is root when sub-tables are being filled. |
|||
|
|||
When a new sub-table is needed, it is necessary to look ahead in the |
|||
code lengths to determine what size sub-table is needed. The length |
|||
counts are used for this, and so count[] is decremented as codes are |
|||
entered in the tables. |
|||
|
|||
used keeps track of how many table entries have been allocated from the |
|||
provided *table space. It is checked when a LENS table is being made |
|||
against the space in *table, ENOUGH, minus the maximum space needed by |
|||
the worst case distance code, MAXD. This should never happen, but the |
|||
sufficiency of ENOUGH has not been proven exhaustively, hence the check. |
|||
This assumes that when type == LENS, bits == 9. |
|||
|
|||
sym increments through all symbols, and the loop terminates when |
|||
all codes of length max, i.e. all codes, have been processed. This |
|||
routine permits incomplete codes, so another loop after this one fills |
|||
in the rest of the decoding tables with invalid code markers. |
|||
*/ |
|||
|
|||
/* set up for code type */ |
|||
switch (type) { |
|||
case CODES: |
|||
base = extra = work; /* dummy value--not used */ |
|||
end = 19; |
|||
break; |
|||
case LENS: |
|||
base = lbase; |
|||
base -= 257; |
|||
extra = lext; |
|||
extra -= 257; |
|||
end = 256; |
|||
break; |
|||
default: /* DISTS */ |
|||
base = dbase; |
|||
extra = dext; |
|||
end = -1; |
|||
} |
|||
|
|||
/* initialize state for loop */ |
|||
huff = 0; /* starting code */ |
|||
sym = 0; /* starting code symbol */ |
|||
len = min; /* starting code length */ |
|||
next = *table; /* current table to fill in */ |
|||
curr = root; /* current table index bits */ |
|||
drop = 0; /* current bits to drop from code for index */ |
|||
low = (unsigned)(-1); /* trigger new sub-table when len > root */ |
|||
used = 1U << root; /* use root table entries */ |
|||
mask = used - 1; /* mask for comparing low */ |
|||
|
|||
/* check available table space */ |
|||
if (type == LENS && used >= ENOUGH - MAXD) |
|||
return 1; |
|||
|
|||
/* process all codes and make table entries */ |
|||
for (;;) { |
|||
/* create table entry */ |
|||
this.bits = (unsigned char)(len - drop); |
|||
if ((int)(work[sym]) < end) { |
|||
this.op = (unsigned char)0; |
|||
this.val = work[sym]; |
|||
} |
|||
else if ((int)(work[sym]) > end) { |
|||
this.op = (unsigned char)(extra[work[sym]]); |
|||
this.val = base[work[sym]]; |
|||
} |
|||
else { |
|||
this.op = (unsigned char)(32 + 64); /* end of block */ |
|||
this.val = 0; |
|||
} |
|||
|
|||
/* replicate for those indices with low len bits equal to huff */ |
|||
incr = 1U << (len - drop); |
|||
fill = 1U << curr; |
|||
min = fill; /* save offset to next table */ |
|||
do { |
|||
fill -= incr; |
|||
next[(huff >> drop) + fill] = this; |
|||
} while (fill != 0); |
|||
|
|||
/* backwards increment the len-bit code huff */ |
|||
incr = 1U << (len - 1); |
|||
while (huff & incr) |
|||
incr >>= 1; |
|||
if (incr != 0) { |
|||
huff &= incr - 1; |
|||
huff += incr; |
|||
} |
|||
else |
|||
huff = 0; |
|||
|
|||
/* go to next symbol, update count, len */ |
|||
sym++; |
|||
if (--(count[len]) == 0) { |
|||
if (len == max) break; |
|||
len = lens[work[sym]]; |
|||
} |
|||
|
|||
/* create new sub-table if needed */ |
|||
if (len > root && (huff & mask) != low) { |
|||
/* if first time, transition to sub-tables */ |
|||
if (drop == 0) |
|||
drop = root; |
|||
|
|||
/* increment past last table */ |
|||
next += min; /* here min is 1 << curr */ |
|||
|
|||
/* determine length of next table */ |
|||
curr = len - drop; |
|||
left = (int)(1 << curr); |
|||
while (curr + drop < max) { |
|||
left -= count[curr + drop]; |
|||
if (left <= 0) break; |
|||
curr++; |
|||
left <<= 1; |
|||
} |
|||
|
|||
/* check for enough space */ |
|||
used += 1U << curr; |
|||
if (type == LENS && used >= ENOUGH - MAXD) |
|||
return 1; |
|||
|
|||
/* point entry in root table to sub-table */ |
|||
low = huff & mask; |
|||
(*table)[low].op = (unsigned char)curr; |
|||
(*table)[low].bits = (unsigned char)root; |
|||
(*table)[low].val = (unsigned short)(next - *table); |
|||
} |
|||
} |
|||
|
|||
/*
|
|||
Fill in rest of table for incomplete codes. This loop is similar to the |
|||
loop above in incrementing huff for table indices. It is assumed that |
|||
len is equal to curr + drop, so there is no loop needed to increment |
|||
through high index bits. When the current sub-table is filled, the loop |
|||
drops back to the root table to fill in any remaining entries there. |
|||
*/ |
|||
this.op = (unsigned char)64; /* invalid code marker */ |
|||
this.bits = (unsigned char)(len - drop); |
|||
this.val = (unsigned short)0; |
|||
while (huff != 0) { |
|||
/* when done with sub-table, drop back to root table */ |
|||
if (drop != 0 && (huff & mask) != low) { |
|||
drop = 0; |
|||
len = root; |
|||
next = *table; |
|||
this.bits = (unsigned char)len; |
|||
} |
|||
|
|||
/* put invalid code marker in table */ |
|||
next[huff >> drop] = this; |
|||
|
|||
/* backwards increment the len-bit code huff */ |
|||
incr = 1U << (len - 1); |
|||
while (huff & incr) |
|||
incr >>= 1; |
|||
if (incr != 0) { |
|||
huff &= incr - 1; |
|||
huff += incr; |
|||
} |
|||
else |
|||
huff = 0; |
|||
} |
|||
|
|||
/* set return parameters */ |
|||
*table += used; |
|||
*bits = root; |
|||
return 0; |
|||
} |
|||
@ -0,0 +1,55 @@ |
|||
/* inftrees.h -- header to use inftrees.c
|
|||
* Copyright (C) 1995-2005 Mark Adler |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* WARNING: this file should *not* be used by applications. It is
|
|||
part of the implementation of the compression library and is |
|||
subject to change. Applications should only use zlib.h. |
|||
*/ |
|||
|
|||
/* Structure for decoding tables. Each entry provides either the
|
|||
information needed to do the operation requested by the code that |
|||
indexed that table entry, or it provides a pointer to another |
|||
table that indexes more bits of the code. op indicates whether |
|||
the entry is a pointer to another table, a literal, a length or |
|||
distance, an end-of-block, or an invalid code. For a table |
|||
pointer, the low four bits of op is the number of index bits of |
|||
that table. For a length or distance, the low four bits of op |
|||
is the number of extra bits to get after the code. bits is |
|||
the number of bits in this code or part of the code to drop off |
|||
of the bit buffer. val is the actual byte to output in the case |
|||
of a literal, the base length or distance, or the offset from |
|||
the current table to the next table. Each entry is four bytes. */ |
|||
typedef struct { |
|||
unsigned char op; /* operation, extra bits, table bits */ |
|||
unsigned char bits; /* bits in this part of the code */ |
|||
unsigned short val; /* offset in table or code value */ |
|||
} code; |
|||
|
|||
/* op values as set by inflate_table():
|
|||
00000000 - literal |
|||
0000tttt - table link, tttt != 0 is the number of table index bits |
|||
0001eeee - length or distance, eeee is the number of extra bits |
|||
01100000 - end of block |
|||
01000000 - invalid code |
|||
*/ |
|||
|
|||
/* Maximum size of dynamic tree. The maximum found in a long but non-
|
|||
exhaustive search was 1444 code structures (852 for length/literals |
|||
and 592 for distances, the latter actually the result of an |
|||
exhaustive search). The true maximum is not known, but the value |
|||
below is more than safe. */ |
|||
#define ENOUGH 2048 |
|||
#define MAXD 592 |
|||
|
|||
/* Type of code to build for inftable() */ |
|||
typedef enum { |
|||
CODES, |
|||
LENS, |
|||
DISTS |
|||
} codetype; |
|||
|
|||
extern int inflate_table OF((codetype type, unsigned short FAR *lens, |
|||
unsigned codes, code FAR * FAR *table, |
|||
unsigned FAR *bits, unsigned short FAR *work)); |
|||
@ -0,0 +1,130 @@ |
|||
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
|||
/* ***** BEGIN LICENSE BLOCK *****
|
|||
* Version: MPL 1.1/GPL 2.0/LGPL 2.1 |
|||
* |
|||
* The contents of this file are subject to the Mozilla Public License Version |
|||
* 1.1 (the "License"); you may not use this file except in compliance with |
|||
* the License. You may obtain a copy of the License at |
|||
* http://www.mozilla.org/MPL/
|
|||
* |
|||
* Software distributed under the License is distributed on an "AS IS" basis, |
|||
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License |
|||
* for the specific language governing rights and limitations under the |
|||
* License. |
|||
* |
|||
* The Original Code is the mozilla zlib configuration. |
|||
* |
|||
* The Initial Developer of the Original Code is IBM Corporation. |
|||
* Portions created by the Initial Developer are Copyright (C) 2004 |
|||
* the Initial Developer. All Rights Reserved. |
|||
* |
|||
* Contributor(s): |
|||
* |
|||
* Alternatively, the contents of this file may be used under the terms of |
|||
* either of the GNU General Public License Version 2 or later (the "GPL"), |
|||
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), |
|||
* in which case the provisions of the GPL or the LGPL are applicable instead |
|||
* of those above. If you wish to allow use of your version of this file only |
|||
* under the terms of either the GPL or the LGPL, and not to allow others to |
|||
* use your version of this file under the terms of the MPL, indicate your |
|||
* decision by deleting the provisions above and replace them with the notice |
|||
* and other provisions required by the GPL or the LGPL. If you do not delete |
|||
* the provisions above, a recipient may use your version of this file under |
|||
* the terms of any one of the MPL, the GPL or the LGPL. |
|||
* |
|||
* ***** END LICENSE BLOCK ***** */ |
|||
|
|||
#ifndef MOZZCONF_H |
|||
#define MOZZCONF_H |
|||
|
|||
#if defined(XP_WIN) && defined(ZLIB_DLL) && !defined(MOZ_ENABLE_LIBXUL) |
|||
#undef ZLIB_DLL |
|||
#endif |
|||
|
|||
#ifdef HAVE_VISIBILITY_ATTRIBUTE |
|||
#define ZEXTERN __attribute__((visibility ("default"))) extern |
|||
#endif |
|||
|
|||
/* Exported Symbols */ |
|||
#define zlibVersion MOZ_Z_zlibVersion |
|||
#define deflate MOZ_Z_deflate |
|||
#define deflateEnd MOZ_Z_deflateEnd |
|||
#define inflate MOZ_Z_inflate |
|||
#define inflateEnd MOZ_Z_inflateEnd |
|||
#define deflateSetDictionary MOZ_Z_deflateSetDictionary |
|||
#define deflateCopy MOZ_Z_deflateCopy |
|||
#define deflateReset MOZ_Z_deflateReset |
|||
#define deflateParams MOZ_Z_deflateParams |
|||
#define deflateBound MOZ_Z_deflateBound |
|||
#define deflatePrime MOZ_Z_deflatePrime |
|||
#define inflateSetDictionary MOZ_Z_inflateSetDictionary |
|||
#define inflateSync MOZ_Z_inflateSync |
|||
#define inflateCopy MOZ_Z_inflateCopy |
|||
#define inflateReset MOZ_Z_inflateReset |
|||
#define inflateBack MOZ_Z_inflateBack |
|||
#define inflateBackEnd MOZ_Z_inflateBackEnd |
|||
#define zlibCompileFlags MOZ_Z_zlibCompileFlags |
|||
#define compress MOZ_Z_compress |
|||
#define compress2 MOZ_Z_compress2 |
|||
#define compressBound MOZ_Z_compressBound |
|||
#define uncompress MOZ_Z_uncompress |
|||
#define gzopen MOZ_Z_gzopen |
|||
#define gzdopen MOZ_Z_gzdopen |
|||
#define gzsetparams MOZ_Z_gzsetparams |
|||
#define gzread MOZ_Z_gzread |
|||
#define gzwrite MOZ_Z_gzwrite |
|||
#define gzprintf MOZ_Z_gzprintf |
|||
#define gzputs MOZ_Z_gzputs |
|||
#define gzgets MOZ_Z_gzgets |
|||
#define gzputc MOZ_Z_gzputc |
|||
#define gzgetc MOZ_Z_gzgetc |
|||
#define gzungetc MOZ_Z_gzungetc |
|||
#define gzflush MOZ_Z_gzflush |
|||
#define gzseek MOZ_Z_gzseek |
|||
#define gzrewind MOZ_Z_gzrewind |
|||
#define gztell MOZ_Z_gztell |
|||
#define gzeof MOZ_Z_gzeof |
|||
#define gzclose MOZ_Z_gzclose |
|||
#define gzerror MOZ_Z_gzerror |
|||
#define gzclearerr MOZ_Z_gzclearerr |
|||
#define adler32 MOZ_Z_adler32 |
|||
#define crc32 MOZ_Z_crc32 |
|||
#define deflateInit_ MOZ_Z_deflateInit_ |
|||
#define deflateInit2_ MOZ_Z_deflateInit2_ |
|||
#define inflateInit_ MOZ_Z_inflateInit_ |
|||
#define inflateInit2_ MOZ_Z_inflateInit2_ |
|||
#define inflateBackInit_ MOZ_Z_inflateBackInit_ |
|||
#define inflateSyncPoint MOZ_Z_inflateSyncPoint |
|||
#define get_crc_table MOZ_Z_get_crc_table |
|||
#define zError MOZ_Z_zError |
|||
|
|||
/* Extra global symbols */ |
|||
#define _dist_code MOZ_Z__dist_code |
|||
#define _length_code MOZ_Z__length_code |
|||
#define _tr_align MOZ_Z__tr_align |
|||
#define _tr_flush_block MOZ_Z__tr_flush_block |
|||
#define _tr_init MOZ_Z__tr_init |
|||
#define _tr_stored_block MOZ_Z__tr_stored_block |
|||
#define _tr_tally MOZ_Z__tr_tally |
|||
#define deflate_copyright MOZ_Z_deflate_copyright |
|||
#define inflate_copyright MOZ_Z_inflate_copyright |
|||
#define inflate_fast MOZ_Z_inflate_fast |
|||
#define inflate_table MOZ_Z_inflate_table |
|||
#define z_errmsg MOZ_Z_z_errmsg |
|||
#define zcalloc MOZ_Z_zcalloc |
|||
#define zcfree MOZ_Z_zcfree |
|||
#define alloc_func MOZ_Z_alloc_func |
|||
#define free_func MOZ_Z_free_func |
|||
#define in_func MOZ_Z_in_func |
|||
#define out_func MOZ_Z_out_func |
|||
|
|||
/* New as of libpng-1.2.3 */ |
|||
#define adler32_combine MOZ_Z_adler32_combine |
|||
#define crc32_combine MOZ_Z_crc32_combine |
|||
#define deflateSetHeader MOZ_Z_deflateSetHeader |
|||
#define deflateTune MOZ_Z_deflateTune |
|||
#define gzdirect MOZ_Z_gzdirect |
|||
#define inflatePrime MOZ_Z_inflatePrime |
|||
#define inflateGetHeader MOZ_Z_inflateGetHeader |
|||
|
|||
#endif |
|||
File diff suppressed because it is too large
@ -0,0 +1,128 @@ |
|||
/* header created automatically with -DGEN_TREES_H */ |
|||
|
|||
local const ct_data static_ltree[L_CODES+2] = { |
|||
{{ 12},{ 8}}, {{140},{ 8}}, {{ 76},{ 8}}, {{204},{ 8}}, {{ 44},{ 8}}, |
|||
{{172},{ 8}}, {{108},{ 8}}, {{236},{ 8}}, {{ 28},{ 8}}, {{156},{ 8}}, |
|||
{{ 92},{ 8}}, {{220},{ 8}}, {{ 60},{ 8}}, {{188},{ 8}}, {{124},{ 8}}, |
|||
{{252},{ 8}}, {{ 2},{ 8}}, {{130},{ 8}}, {{ 66},{ 8}}, {{194},{ 8}}, |
|||
{{ 34},{ 8}}, {{162},{ 8}}, {{ 98},{ 8}}, {{226},{ 8}}, {{ 18},{ 8}}, |
|||
{{146},{ 8}}, {{ 82},{ 8}}, {{210},{ 8}}, {{ 50},{ 8}}, {{178},{ 8}}, |
|||
{{114},{ 8}}, {{242},{ 8}}, {{ 10},{ 8}}, {{138},{ 8}}, {{ 74},{ 8}}, |
|||
{{202},{ 8}}, {{ 42},{ 8}}, {{170},{ 8}}, {{106},{ 8}}, {{234},{ 8}}, |
|||
{{ 26},{ 8}}, {{154},{ 8}}, {{ 90},{ 8}}, {{218},{ 8}}, {{ 58},{ 8}}, |
|||
{{186},{ 8}}, {{122},{ 8}}, {{250},{ 8}}, {{ 6},{ 8}}, {{134},{ 8}}, |
|||
{{ 70},{ 8}}, {{198},{ 8}}, {{ 38},{ 8}}, {{166},{ 8}}, {{102},{ 8}}, |
|||
{{230},{ 8}}, {{ 22},{ 8}}, {{150},{ 8}}, {{ 86},{ 8}}, {{214},{ 8}}, |
|||
{{ 54},{ 8}}, {{182},{ 8}}, {{118},{ 8}}, {{246},{ 8}}, {{ 14},{ 8}}, |
|||
{{142},{ 8}}, {{ 78},{ 8}}, {{206},{ 8}}, {{ 46},{ 8}}, {{174},{ 8}}, |
|||
{{110},{ 8}}, {{238},{ 8}}, {{ 30},{ 8}}, {{158},{ 8}}, {{ 94},{ 8}}, |
|||
{{222},{ 8}}, {{ 62},{ 8}}, {{190},{ 8}}, {{126},{ 8}}, {{254},{ 8}}, |
|||
{{ 1},{ 8}}, {{129},{ 8}}, {{ 65},{ 8}}, {{193},{ 8}}, {{ 33},{ 8}}, |
|||
{{161},{ 8}}, {{ 97},{ 8}}, {{225},{ 8}}, {{ 17},{ 8}}, {{145},{ 8}}, |
|||
{{ 81},{ 8}}, {{209},{ 8}}, {{ 49},{ 8}}, {{177},{ 8}}, {{113},{ 8}}, |
|||
{{241},{ 8}}, {{ 9},{ 8}}, {{137},{ 8}}, {{ 73},{ 8}}, {{201},{ 8}}, |
|||
{{ 41},{ 8}}, {{169},{ 8}}, {{105},{ 8}}, {{233},{ 8}}, {{ 25},{ 8}}, |
|||
{{153},{ 8}}, {{ 89},{ 8}}, {{217},{ 8}}, {{ 57},{ 8}}, {{185},{ 8}}, |
|||
{{121},{ 8}}, {{249},{ 8}}, {{ 5},{ 8}}, {{133},{ 8}}, {{ 69},{ 8}}, |
|||
{{197},{ 8}}, {{ 37},{ 8}}, {{165},{ 8}}, {{101},{ 8}}, {{229},{ 8}}, |
|||
{{ 21},{ 8}}, {{149},{ 8}}, {{ 85},{ 8}}, {{213},{ 8}}, {{ 53},{ 8}}, |
|||
{{181},{ 8}}, {{117},{ 8}}, {{245},{ 8}}, {{ 13},{ 8}}, {{141},{ 8}}, |
|||
{{ 77},{ 8}}, {{205},{ 8}}, {{ 45},{ 8}}, {{173},{ 8}}, {{109},{ 8}}, |
|||
{{237},{ 8}}, {{ 29},{ 8}}, {{157},{ 8}}, {{ 93},{ 8}}, {{221},{ 8}}, |
|||
{{ 61},{ 8}}, {{189},{ 8}}, {{125},{ 8}}, {{253},{ 8}}, {{ 19},{ 9}}, |
|||
{{275},{ 9}}, {{147},{ 9}}, {{403},{ 9}}, {{ 83},{ 9}}, {{339},{ 9}}, |
|||
{{211},{ 9}}, {{467},{ 9}}, {{ 51},{ 9}}, {{307},{ 9}}, {{179},{ 9}}, |
|||
{{435},{ 9}}, {{115},{ 9}}, {{371},{ 9}}, {{243},{ 9}}, {{499},{ 9}}, |
|||
{{ 11},{ 9}}, {{267},{ 9}}, {{139},{ 9}}, {{395},{ 9}}, {{ 75},{ 9}}, |
|||
{{331},{ 9}}, {{203},{ 9}}, {{459},{ 9}}, {{ 43},{ 9}}, {{299},{ 9}}, |
|||
{{171},{ 9}}, {{427},{ 9}}, {{107},{ 9}}, {{363},{ 9}}, {{235},{ 9}}, |
|||
{{491},{ 9}}, {{ 27},{ 9}}, {{283},{ 9}}, {{155},{ 9}}, {{411},{ 9}}, |
|||
{{ 91},{ 9}}, {{347},{ 9}}, {{219},{ 9}}, {{475},{ 9}}, {{ 59},{ 9}}, |
|||
{{315},{ 9}}, {{187},{ 9}}, {{443},{ 9}}, {{123},{ 9}}, {{379},{ 9}}, |
|||
{{251},{ 9}}, {{507},{ 9}}, {{ 7},{ 9}}, {{263},{ 9}}, {{135},{ 9}}, |
|||
{{391},{ 9}}, {{ 71},{ 9}}, {{327},{ 9}}, {{199},{ 9}}, {{455},{ 9}}, |
|||
{{ 39},{ 9}}, {{295},{ 9}}, {{167},{ 9}}, {{423},{ 9}}, {{103},{ 9}}, |
|||
{{359},{ 9}}, {{231},{ 9}}, {{487},{ 9}}, {{ 23},{ 9}}, {{279},{ 9}}, |
|||
{{151},{ 9}}, {{407},{ 9}}, {{ 87},{ 9}}, {{343},{ 9}}, {{215},{ 9}}, |
|||
{{471},{ 9}}, {{ 55},{ 9}}, {{311},{ 9}}, {{183},{ 9}}, {{439},{ 9}}, |
|||
{{119},{ 9}}, {{375},{ 9}}, {{247},{ 9}}, {{503},{ 9}}, {{ 15},{ 9}}, |
|||
{{271},{ 9}}, {{143},{ 9}}, {{399},{ 9}}, {{ 79},{ 9}}, {{335},{ 9}}, |
|||
{{207},{ 9}}, {{463},{ 9}}, {{ 47},{ 9}}, {{303},{ 9}}, {{175},{ 9}}, |
|||
{{431},{ 9}}, {{111},{ 9}}, {{367},{ 9}}, {{239},{ 9}}, {{495},{ 9}}, |
|||
{{ 31},{ 9}}, {{287},{ 9}}, {{159},{ 9}}, {{415},{ 9}}, {{ 95},{ 9}}, |
|||
{{351},{ 9}}, {{223},{ 9}}, {{479},{ 9}}, {{ 63},{ 9}}, {{319},{ 9}}, |
|||
{{191},{ 9}}, {{447},{ 9}}, {{127},{ 9}}, {{383},{ 9}}, {{255},{ 9}}, |
|||
{{511},{ 9}}, {{ 0},{ 7}}, {{ 64},{ 7}}, {{ 32},{ 7}}, {{ 96},{ 7}}, |
|||
{{ 16},{ 7}}, {{ 80},{ 7}}, {{ 48},{ 7}}, {{112},{ 7}}, {{ 8},{ 7}}, |
|||
{{ 72},{ 7}}, {{ 40},{ 7}}, {{104},{ 7}}, {{ 24},{ 7}}, {{ 88},{ 7}}, |
|||
{{ 56},{ 7}}, {{120},{ 7}}, {{ 4},{ 7}}, {{ 68},{ 7}}, {{ 36},{ 7}}, |
|||
{{100},{ 7}}, {{ 20},{ 7}}, {{ 84},{ 7}}, {{ 52},{ 7}}, {{116},{ 7}}, |
|||
{{ 3},{ 8}}, {{131},{ 8}}, {{ 67},{ 8}}, {{195},{ 8}}, {{ 35},{ 8}}, |
|||
{{163},{ 8}}, {{ 99},{ 8}}, {{227},{ 8}} |
|||
}; |
|||
|
|||
local const ct_data static_dtree[D_CODES] = { |
|||
{{ 0},{ 5}}, {{16},{ 5}}, {{ 8},{ 5}}, {{24},{ 5}}, {{ 4},{ 5}}, |
|||
{{20},{ 5}}, {{12},{ 5}}, {{28},{ 5}}, {{ 2},{ 5}}, {{18},{ 5}}, |
|||
{{10},{ 5}}, {{26},{ 5}}, {{ 6},{ 5}}, {{22},{ 5}}, {{14},{ 5}}, |
|||
{{30},{ 5}}, {{ 1},{ 5}}, {{17},{ 5}}, {{ 9},{ 5}}, {{25},{ 5}}, |
|||
{{ 5},{ 5}}, {{21},{ 5}}, {{13},{ 5}}, {{29},{ 5}}, {{ 3},{ 5}}, |
|||
{{19},{ 5}}, {{11},{ 5}}, {{27},{ 5}}, {{ 7},{ 5}}, {{23},{ 5}} |
|||
}; |
|||
|
|||
const uch _dist_code[DIST_CODE_LEN] = { |
|||
0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, |
|||
8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, |
|||
10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, |
|||
11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, |
|||
12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, |
|||
13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, |
|||
13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, |
|||
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, |
|||
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, |
|||
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, |
|||
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, |
|||
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, |
|||
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 0, 0, 16, 17, |
|||
18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, |
|||
23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, |
|||
24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, |
|||
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, |
|||
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, |
|||
27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, |
|||
27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, |
|||
28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, |
|||
28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, |
|||
28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, |
|||
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, |
|||
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, |
|||
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29 |
|||
}; |
|||
|
|||
const uch _length_code[MAX_MATCH-MIN_MATCH+1]= { |
|||
0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 12, 12, |
|||
13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, |
|||
17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, |
|||
19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, |
|||
21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, |
|||
22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, |
|||
23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, |
|||
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, |
|||
25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, |
|||
25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, |
|||
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, |
|||
26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, |
|||
27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28 |
|||
}; |
|||
|
|||
local const int base_length[LENGTH_CODES] = { |
|||
0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56, |
|||
64, 80, 96, 112, 128, 160, 192, 224, 0 |
|||
}; |
|||
|
|||
local const int base_dist[D_CODES] = { |
|||
0, 1, 2, 3, 4, 6, 8, 12, 16, 24, |
|||
32, 48, 64, 96, 128, 192, 256, 384, 512, 768, |
|||
1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576 |
|||
}; |
|||
|
|||
@ -0,0 +1,61 @@ |
|||
/* uncompr.c -- decompress a memory buffer
|
|||
* Copyright (C) 1995-2003 Jean-loup Gailly. |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* @(#) $Id: uncompr.c,v 3.6 2005/08/04 19:14:14 tor%cs.brown.edu Exp $ */ |
|||
|
|||
#define ZLIB_INTERNAL |
|||
#include "zlib.h" |
|||
|
|||
/* ===========================================================================
|
|||
Decompresses the source buffer into the destination buffer. sourceLen is |
|||
the byte length of the source buffer. Upon entry, destLen is the total |
|||
size of the destination buffer, which must be large enough to hold the |
|||
entire uncompressed data. (The size of the uncompressed data must have |
|||
been saved previously by the compressor and transmitted to the decompressor |
|||
by some mechanism outside the scope of this compression library.) |
|||
Upon exit, destLen is the actual size of the compressed buffer. |
|||
This function can be used to decompress a whole file at once if the |
|||
input file is mmap'ed. |
|||
|
|||
uncompress returns Z_OK if success, Z_MEM_ERROR if there was not |
|||
enough memory, Z_BUF_ERROR if there was not enough room in the output |
|||
buffer, or Z_DATA_ERROR if the input data was corrupted. |
|||
*/ |
|||
int ZEXPORT uncompress (dest, destLen, source, sourceLen) |
|||
Bytef *dest; |
|||
uLongf *destLen; |
|||
const Bytef *source; |
|||
uLong sourceLen; |
|||
{ |
|||
z_stream stream; |
|||
int err; |
|||
|
|||
stream.next_in = (Bytef*)source; |
|||
stream.avail_in = (uInt)sourceLen; |
|||
/* Check for source > 64K on 16-bit machine: */ |
|||
if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR; |
|||
|
|||
stream.next_out = dest; |
|||
stream.avail_out = (uInt)*destLen; |
|||
if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR; |
|||
|
|||
stream.zalloc = (alloc_func)0; |
|||
stream.zfree = (free_func)0; |
|||
|
|||
err = inflateInit(&stream); |
|||
if (err != Z_OK) return err; |
|||
|
|||
err = inflate(&stream, Z_FINISH); |
|||
if (err != Z_STREAM_END) { |
|||
inflateEnd(&stream); |
|||
if (err == Z_NEED_DICT || (err == Z_BUF_ERROR && stream.avail_in == 0)) |
|||
return Z_DATA_ERROR; |
|||
return err; |
|||
} |
|||
*destLen = stream.total_out; |
|||
|
|||
err = inflateEnd(&stream); |
|||
return err; |
|||
} |
|||
@ -0,0 +1,335 @@ |
|||
/* zconf.h -- configuration of the zlib compression library
|
|||
* Copyright (C) 1995-2005 Jean-loup Gailly. |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* @(#) $Id: zconf.h,v 3.9 2005/08/04 19:14:14 tor%cs.brown.edu Exp $ */ |
|||
|
|||
#ifndef ZCONF_H |
|||
#define ZCONF_H |
|||
|
|||
/* This include does prefixing as below, but with an updated set of names */ |
|||
#include "mozzconf.h" |
|||
|
|||
/*
|
|||
* If you *really* need a unique prefix for all types and library functions, |
|||
* compile with -DZ_PREFIX. The "standard" zlib should be compiled without it. |
|||
*/ |
|||
#ifdef Z_PREFIX |
|||
# define deflateInit_ z_deflateInit_ |
|||
# define deflate z_deflate |
|||
# define deflateEnd z_deflateEnd |
|||
# define inflateInit_ z_inflateInit_ |
|||
# define inflate z_inflate |
|||
# define inflateEnd z_inflateEnd |
|||
# define deflateInit2_ z_deflateInit2_ |
|||
# define deflateSetDictionary z_deflateSetDictionary |
|||
# define deflateCopy z_deflateCopy |
|||
# define deflateReset z_deflateReset |
|||
# define deflateParams z_deflateParams |
|||
# define deflateBound z_deflateBound |
|||
# define deflatePrime z_deflatePrime |
|||
# define inflateInit2_ z_inflateInit2_ |
|||
# define inflateSetDictionary z_inflateSetDictionary |
|||
# define inflateSync z_inflateSync |
|||
# define inflateSyncPoint z_inflateSyncPoint |
|||
# define inflateCopy z_inflateCopy |
|||
# define inflateReset z_inflateReset |
|||
# define inflateBack z_inflateBack |
|||
# define inflateBackEnd z_inflateBackEnd |
|||
# define compress z_compress |
|||
# define compress2 z_compress2 |
|||
# define compressBound z_compressBound |
|||
# define uncompress z_uncompress |
|||
# define adler32 z_adler32 |
|||
# define crc32 z_crc32 |
|||
# define get_crc_table z_get_crc_table |
|||
# define zError z_zError |
|||
|
|||
# define alloc_func z_alloc_func |
|||
# define free_func z_free_func |
|||
# define in_func z_in_func |
|||
# define out_func z_out_func |
|||
# define Byte z_Byte |
|||
# define uInt z_uInt |
|||
# define uLong z_uLong |
|||
# define Bytef z_Bytef |
|||
# define charf z_charf |
|||
# define intf z_intf |
|||
# define uIntf z_uIntf |
|||
# define uLongf z_uLongf |
|||
# define voidpf z_voidpf |
|||
# define voidp z_voidp |
|||
#endif |
|||
|
|||
#if defined(__MSDOS__) && !defined(MSDOS) |
|||
# define MSDOS |
|||
#endif |
|||
#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2) |
|||
# define OS2 |
|||
#endif |
|||
#if defined(_WINDOWS) && !defined(WINDOWS) |
|||
# define WINDOWS |
|||
#endif |
|||
#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__) |
|||
# ifndef WIN32 |
|||
# define WIN32 |
|||
# endif |
|||
#endif |
|||
#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32) |
|||
# if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__) |
|||
# ifndef SYS16BIT |
|||
# define SYS16BIT |
|||
# endif |
|||
# endif |
|||
#endif |
|||
|
|||
/*
|
|||
* Compile with -DMAXSEG_64K if the alloc function cannot allocate more |
|||
* than 64k bytes at a time (needed on systems with 16-bit int). |
|||
*/ |
|||
#ifdef SYS16BIT |
|||
# define MAXSEG_64K |
|||
#endif |
|||
#ifdef MSDOS |
|||
# define UNALIGNED_OK |
|||
#endif |
|||
|
|||
#ifdef __STDC_VERSION__ |
|||
# ifndef STDC |
|||
# define STDC |
|||
# endif |
|||
# if __STDC_VERSION__ >= 199901L |
|||
# ifndef STDC99 |
|||
# define STDC99 |
|||
# endif |
|||
# endif |
|||
#endif |
|||
#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus)) |
|||
# define STDC |
|||
#endif |
|||
#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__)) |
|||
# define STDC |
|||
#endif |
|||
#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32)) |
|||
# define STDC |
|||
#endif |
|||
#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__)) |
|||
# define STDC |
|||
#endif |
|||
|
|||
#if defined(__OS400__) && !defined(STDC) /* iSeries (formerly AS/400). */ |
|||
# define STDC |
|||
#endif |
|||
|
|||
#ifndef STDC |
|||
# ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */ |
|||
# define const /* note: need a more gentle solution here */ |
|||
# endif |
|||
#endif |
|||
|
|||
/* Some Mac compilers merge all .h files incorrectly: */ |
|||
#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__) |
|||
# define NO_DUMMY_DECL |
|||
#endif |
|||
|
|||
/* Maximum value for memLevel in deflateInit2 */ |
|||
#ifndef MAX_MEM_LEVEL |
|||
# ifdef MAXSEG_64K |
|||
# define MAX_MEM_LEVEL 8 |
|||
# else |
|||
# define MAX_MEM_LEVEL 9 |
|||
# endif |
|||
#endif |
|||
|
|||
/* Maximum value for windowBits in deflateInit2 and inflateInit2.
|
|||
* WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files |
|||
* created by gzip. (Files created by minigzip can still be extracted by |
|||
* gzip.) |
|||
*/ |
|||
#ifndef MAX_WBITS |
|||
# define MAX_WBITS 15 /* 32K LZ77 window */ |
|||
#endif |
|||
|
|||
/* The memory requirements for deflate are (in bytes):
|
|||
(1 << (windowBits+2)) + (1 << (memLevel+9)) |
|||
that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values) |
|||
plus a few kilobytes for small objects. For example, if you want to reduce |
|||
the default memory requirements from 256K to 128K, compile with |
|||
make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7" |
|||
Of course this will generally degrade compression (there's no free lunch). |
|||
|
|||
The memory requirements for inflate are (in bytes) 1 << windowBits |
|||
that is, 32K for windowBits=15 (default value) plus a few kilobytes |
|||
for small objects. |
|||
*/ |
|||
|
|||
/* Type declarations */ |
|||
|
|||
#ifndef OF /* function prototypes */ |
|||
# ifdef STDC |
|||
# define OF(args) args |
|||
# else |
|||
# define OF(args) () |
|||
# endif |
|||
#endif |
|||
|
|||
/* The following definitions for FAR are needed only for MSDOS mixed
|
|||
* model programming (small or medium model with some far allocations). |
|||
* This was tested only with MSC; for other MSDOS compilers you may have |
|||
* to define NO_MEMCPY in zutil.h. If you don't need the mixed model, |
|||
* just define FAR to be empty. |
|||
*/ |
|||
#ifdef SYS16BIT |
|||
# if defined(M_I86SM) || defined(M_I86MM) |
|||
/* MSC small or medium model */ |
|||
# define SMALL_MEDIUM |
|||
# ifdef _MSC_VER |
|||
# define FAR _far |
|||
# else |
|||
# define FAR far |
|||
# endif |
|||
# endif |
|||
# if (defined(__SMALL__) || defined(__MEDIUM__)) |
|||
/* Turbo C small or medium model */ |
|||
# define SMALL_MEDIUM |
|||
# ifdef __BORLANDC__ |
|||
# define FAR _far |
|||
# else |
|||
# define FAR far |
|||
# endif |
|||
# endif |
|||
#endif |
|||
|
|||
#if defined(WINDOWS) || defined(WIN32) |
|||
/* If building or using zlib as a DLL, define ZLIB_DLL.
|
|||
* This is not mandatory, but it offers a little performance increase. |
|||
*/ |
|||
# ifdef ZLIB_DLL |
|||
# if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500)) |
|||
# ifdef ZLIB_INTERNAL |
|||
# define ZEXTERN extern __declspec(dllexport) |
|||
# else |
|||
# define ZEXTERN extern __declspec(dllimport) |
|||
# endif |
|||
# endif |
|||
# endif /* ZLIB_DLL */ |
|||
/* If building or using zlib with the WINAPI/WINAPIV calling convention,
|
|||
* define ZLIB_WINAPI. |
|||
* Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI. |
|||
*/ |
|||
# ifdef ZLIB_WINAPI |
|||
# ifdef FAR |
|||
# undef FAR |
|||
# endif |
|||
# include <windows.h> |
|||
/* No need for _export, use ZLIB.DEF instead. */ |
|||
/* For complete Windows compatibility, use WINAPI, not __stdcall. */ |
|||
# define ZEXPORT WINAPI |
|||
# ifdef WIN32 |
|||
# define ZEXPORTVA WINAPIV |
|||
# else |
|||
# define ZEXPORTVA FAR CDECL |
|||
# endif |
|||
# endif |
|||
#endif |
|||
|
|||
#if defined (__BEOS__) |
|||
# ifdef ZLIB_DLL |
|||
# ifdef ZLIB_INTERNAL |
|||
# define ZEXPORT __declspec(dllexport) |
|||
# define ZEXPORTVA __declspec(dllexport) |
|||
# else |
|||
# define ZEXPORT __declspec(dllimport) |
|||
# define ZEXPORTVA __declspec(dllimport) |
|||
# endif |
|||
# endif |
|||
#endif |
|||
|
|||
#ifndef ZEXTERN |
|||
# define ZEXTERN extern |
|||
#endif |
|||
#ifndef ZEXPORT |
|||
# define ZEXPORT |
|||
#endif |
|||
#ifndef ZEXPORTVA |
|||
# define ZEXPORTVA |
|||
#endif |
|||
|
|||
#ifndef FAR |
|||
# define FAR |
|||
#endif |
|||
|
|||
#if !defined(__MACTYPES__) |
|||
typedef unsigned char Byte; /* 8 bits */ |
|||
#endif |
|||
typedef unsigned int uInt; /* 16 bits or more */ |
|||
typedef unsigned long uLong; /* 32 bits or more */ |
|||
|
|||
#ifdef SMALL_MEDIUM |
|||
/* Borland C/C++ and some old MSC versions ignore FAR inside typedef */ |
|||
# define Bytef Byte FAR |
|||
#else |
|||
typedef Byte FAR Bytef; |
|||
#endif |
|||
typedef char FAR charf; |
|||
typedef int FAR intf; |
|||
typedef uInt FAR uIntf; |
|||
typedef uLong FAR uLongf; |
|||
|
|||
#ifdef STDC |
|||
typedef void const *voidpc; |
|||
typedef void FAR *voidpf; |
|||
typedef void *voidp; |
|||
#else |
|||
typedef Byte const *voidpc; |
|||
typedef Byte FAR *voidpf; |
|||
typedef Byte *voidp; |
|||
#endif |
|||
|
|||
#if 0 /* HAVE_UNISTD_H -- this line is updated by ./configure */
|
|||
# include <sys/types.h> /* for off_t */ |
|||
# include <unistd.h> /* for SEEK_* and off_t */ |
|||
# ifdef VMS |
|||
# include <unixio.h> /* for off_t */ |
|||
# endif |
|||
# define z_off_t off_t |
|||
#endif |
|||
#ifndef SEEK_SET |
|||
# define SEEK_SET 0 /* Seek from beginning of file. */ |
|||
# define SEEK_CUR 1 /* Seek from current position. */ |
|||
# define SEEK_END 2 /* Set file pointer to EOF plus "offset" */ |
|||
#endif |
|||
#ifndef z_off_t |
|||
# define z_off_t long |
|||
#endif |
|||
|
|||
#if defined(__OS400__) |
|||
# define NO_vsnprintf |
|||
#endif |
|||
|
|||
#if defined(__MVS__) |
|||
# define NO_vsnprintf |
|||
# ifdef FAR |
|||
# undef FAR |
|||
# endif |
|||
#endif |
|||
|
|||
/* MVS linker does not support external names larger than 8 bytes */ |
|||
#if defined(__MVS__) |
|||
# pragma map(deflateInit_,"DEIN") |
|||
# pragma map(deflateInit2_,"DEIN2") |
|||
# pragma map(deflateEnd,"DEEND") |
|||
# pragma map(deflateBound,"DEBND") |
|||
# pragma map(inflateInit_,"ININ") |
|||
# pragma map(inflateInit2_,"ININ2") |
|||
# pragma map(inflateEnd,"INEND") |
|||
# pragma map(inflateSync,"INSY") |
|||
# pragma map(inflateSetDictionary,"INSEDI") |
|||
# pragma map(compressBound,"CMBND") |
|||
# pragma map(inflate_table,"INTABL") |
|||
# pragma map(inflate_fast,"INFA") |
|||
# pragma map(inflate_copyright,"INCOPY") |
|||
#endif |
|||
|
|||
#endif /* ZCONF_H */ |
|||
@ -0,0 +1,98 @@ |
|||
# Copyright (c) 2009 The Chromium Authors. All rights reserved. |
|||
# Use of this source code is governed by a BSD-style license that can be |
|||
# found in the LICENSE file. |
|||
|
|||
{ |
|||
'variables': { |
|||
'use_system_zlib%': 0 |
|||
}, |
|||
'conditions': [ |
|||
['use_system_zlib==0', { |
|||
'targets': [ |
|||
{ |
|||
'target_name': 'zlib', |
|||
'type': 'static_library', |
|||
'sources': [ |
|||
'contrib/minizip/ioapi.c', |
|||
'contrib/minizip/ioapi.h', |
|||
'contrib/minizip/iowin32.c', |
|||
'contrib/minizip/iowin32.h', |
|||
'contrib/minizip/unzip.c', |
|||
'contrib/minizip/unzip.h', |
|||
'contrib/minizip/zip.c', |
|||
'contrib/minizip/zip.h', |
|||
'adler32.c', |
|||
'compress.c', |
|||
'crc32.c', |
|||
'crc32.h', |
|||
'deflate.c', |
|||
'deflate.h', |
|||
'gzio.c', |
|||
'infback.c', |
|||
'inffast.c', |
|||
'inffast.h', |
|||
'inffixed.h', |
|||
'inflate.c', |
|||
'inflate.h', |
|||
'inftrees.c', |
|||
'inftrees.h', |
|||
'mozzconf.h', |
|||
'trees.c', |
|||
'trees.h', |
|||
'uncompr.c', |
|||
'zconf.h', |
|||
'zlib.h', |
|||
'zutil.c', |
|||
'zutil.h', |
|||
], |
|||
'include_dirs': [ |
|||
'.', |
|||
# For contrib/minizip |
|||
'./contrib/minizip', |
|||
], |
|||
'direct_dependent_settings': { |
|||
'include_dirs': [ |
|||
'.', |
|||
], |
|||
}, |
|||
'conditions': [ |
|||
['OS!="win"', { |
|||
'product_name': 'chrome_zlib', |
|||
'sources!': [ |
|||
'contrib/minizip/iowin32.c' |
|||
], |
|||
}], |
|||
], |
|||
}, |
|||
], |
|||
}, { |
|||
'targets': [ |
|||
{ |
|||
'target_name': 'zlib', |
|||
'type': 'static_library', |
|||
'direct_dependent_settings': { |
|||
'defines': [ |
|||
'USE_SYSTEM_ZLIB', |
|||
], |
|||
}, |
|||
'defines': [ |
|||
'USE_SYSTEM_ZLIB', |
|||
], |
|||
'sources': [ |
|||
'contrib/minizip/ioapi.c', |
|||
'contrib/minizip/ioapi.h', |
|||
'contrib/minizip/unzip.c', |
|||
'contrib/minizip/unzip.h', |
|||
'contrib/minizip/zip.c', |
|||
'contrib/minizip/zip.h', |
|||
], |
|||
'link_settings': { |
|||
'libraries': [ |
|||
'-lz', |
|||
], |
|||
}, |
|||
}, |
|||
], |
|||
}], |
|||
], |
|||
} |
|||
File diff suppressed because it is too large
@ -0,0 +1,320 @@ |
|||
/* zutil.c -- target dependent utility functions for the compression library
|
|||
* Copyright (C) 1995-2005 Jean-loup Gailly. |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* @(#) $Id: zutil.c,v 3.11 2005/08/04 19:14:14 tor%cs.brown.edu Exp $ */ |
|||
|
|||
#include "zutil.h" |
|||
|
|||
#ifndef NO_DUMMY_DECL |
|||
struct internal_state {int dummy;}; /* for buggy compilers */ |
|||
#endif |
|||
|
|||
const char * const z_errmsg[10] = { |
|||
"need dictionary", /* Z_NEED_DICT 2 */ |
|||
"stream end", /* Z_STREAM_END 1 */ |
|||
"", /* Z_OK 0 */ |
|||
"file error", /* Z_ERRNO (-1) */ |
|||
"stream error", /* Z_STREAM_ERROR (-2) */ |
|||
"data error", /* Z_DATA_ERROR (-3) */ |
|||
"insufficient memory", /* Z_MEM_ERROR (-4) */ |
|||
"buffer error", /* Z_BUF_ERROR (-5) */ |
|||
"incompatible version",/* Z_VERSION_ERROR (-6) */ |
|||
""}; |
|||
|
|||
|
|||
const char * ZEXPORT zlibVersion() |
|||
{ |
|||
return ZLIB_VERSION; |
|||
} |
|||
|
|||
uLong ZEXPORT zlibCompileFlags() |
|||
{ |
|||
uLong flags; |
|||
|
|||
flags = 0; |
|||
switch (sizeof(uInt)) { |
|||
case 2: break; |
|||
case 4: flags += 1; break; |
|||
case 8: flags += 2; break; |
|||
default: flags += 3; |
|||
} |
|||
switch (sizeof(uLong)) { |
|||
case 2: break; |
|||
case 4: flags += 1 << 2; break; |
|||
case 8: flags += 2 << 2; break; |
|||
default: flags += 3 << 2; |
|||
} |
|||
switch (sizeof(voidpf)) { |
|||
case 2: break; |
|||
case 4: flags += 1 << 4; break; |
|||
case 8: flags += 2 << 4; break; |
|||
default: flags += 3 << 4; |
|||
} |
|||
switch (sizeof(z_off_t)) { |
|||
case 2: break; |
|||
case 4: flags += 1 << 6; break; |
|||
case 8: flags += 2 << 6; break; |
|||
default: flags += 3 << 6; |
|||
} |
|||
#ifdef DEBUG |
|||
flags += 1 << 8; |
|||
#endif |
|||
#if defined(ASMV) || defined(ASMINF) |
|||
flags += 1 << 9; |
|||
#endif |
|||
#ifdef ZLIB_WINAPI |
|||
flags += 1 << 10; |
|||
#endif |
|||
#ifdef BUILDFIXED |
|||
flags += 1 << 12; |
|||
#endif |
|||
#ifdef DYNAMIC_CRC_TABLE |
|||
flags += 1 << 13; |
|||
#endif |
|||
#ifdef NO_GZCOMPRESS |
|||
flags += 1L << 16; |
|||
#endif |
|||
#ifdef NO_GZIP |
|||
flags += 1L << 17; |
|||
#endif |
|||
#ifdef PKZIP_BUG_WORKAROUND |
|||
flags += 1L << 20; |
|||
#endif |
|||
#ifdef FASTEST |
|||
flags += 1L << 21; |
|||
#endif |
|||
#ifdef STDC |
|||
# ifdef NO_vsnprintf |
|||
flags += 1L << 25; |
|||
# ifdef HAS_vsprintf_void |
|||
flags += 1L << 26; |
|||
# endif |
|||
# else |
|||
# ifdef HAS_vsnprintf_void |
|||
flags += 1L << 26; |
|||
# endif |
|||
# endif |
|||
#else |
|||
flags += 1L << 24; |
|||
# ifdef NO_snprintf |
|||
flags += 1L << 25; |
|||
# ifdef HAS_sprintf_void |
|||
flags += 1L << 26; |
|||
# endif |
|||
# else |
|||
# ifdef HAS_snprintf_void |
|||
flags += 1L << 26; |
|||
# endif |
|||
# endif |
|||
#endif |
|||
return flags; |
|||
} |
|||
|
|||
#ifdef DEBUG |
|||
|
|||
# ifndef verbose |
|||
# define verbose 0 |
|||
# endif |
|||
int z_verbose = verbose; |
|||
|
|||
void z_error (m) |
|||
char *m; |
|||
{ |
|||
fprintf(stderr, "%s\n", m); |
|||
exit(1); |
|||
} |
|||
#endif |
|||
|
|||
/* exported to allow conversion of error code to string for compress() and
|
|||
* uncompress() |
|||
*/ |
|||
const char * ZEXPORT zError(err) |
|||
int err; |
|||
{ |
|||
return ERR_MSG(err); |
|||
} |
|||
|
|||
#if defined(_WIN32_WCE) |
|||
/* The Microsoft C Run-Time Library for Windows CE doesn't have
|
|||
* errno. We define it as a global variable to simplify porting. |
|||
* Its value is always 0 and should not be used. |
|||
*/ |
|||
// Google Gears modification: zutil.h defines errno as z_errno for WinCE.
|
|||
//int errno = 0;
|
|||
int z_errno = 0; |
|||
#endif |
|||
|
|||
#ifndef HAVE_MEMCPY |
|||
|
|||
void zmemcpy(dest, source, len) |
|||
Bytef* dest; |
|||
const Bytef* source; |
|||
uInt len; |
|||
{ |
|||
if (len == 0) return; |
|||
do { |
|||
*dest++ = *source++; /* ??? to be unrolled */ |
|||
} while (--len != 0); |
|||
} |
|||
|
|||
int zmemcmp(s1, s2, len) |
|||
const Bytef* s1; |
|||
const Bytef* s2; |
|||
uInt len; |
|||
{ |
|||
uInt j; |
|||
|
|||
for (j = 0; j < len; j++) { |
|||
if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1; |
|||
} |
|||
return 0; |
|||
} |
|||
|
|||
void zmemzero(dest, len) |
|||
Bytef* dest; |
|||
uInt len; |
|||
{ |
|||
if (len == 0) return; |
|||
do { |
|||
*dest++ = 0; /* ??? to be unrolled */ |
|||
} while (--len != 0); |
|||
} |
|||
#endif |
|||
|
|||
|
|||
#ifdef SYS16BIT |
|||
|
|||
#ifdef __TURBOC__ |
|||
/* Turbo C in 16-bit mode */ |
|||
|
|||
# define MY_ZCALLOC |
|||
|
|||
/* Turbo C malloc() does not allow dynamic allocation of 64K bytes
|
|||
* and farmalloc(64K) returns a pointer with an offset of 8, so we |
|||
* must fix the pointer. Warning: the pointer must be put back to its |
|||
* original form in order to free it, use zcfree(). |
|||
*/ |
|||
|
|||
#define MAX_PTR 10 |
|||
/* 10*64K = 640K */ |
|||
|
|||
local int next_ptr = 0; |
|||
|
|||
typedef struct ptr_table_s { |
|||
voidpf org_ptr; |
|||
voidpf new_ptr; |
|||
} ptr_table; |
|||
|
|||
local ptr_table table[MAX_PTR]; |
|||
/* This table is used to remember the original form of pointers
|
|||
* to large buffers (64K). Such pointers are normalized with a zero offset. |
|||
* Since MSDOS is not a preemptive multitasking OS, this table is not |
|||
* protected from concurrent access. This hack doesn't work anyway on |
|||
* a protected system like OS/2. Use Microsoft C instead. |
|||
*/ |
|||
|
|||
voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) |
|||
{ |
|||
voidpf buf = opaque; /* just to make some compilers happy */ |
|||
ulg bsize = (ulg)items*size; |
|||
|
|||
/* If we allocate less than 65520 bytes, we assume that farmalloc
|
|||
* will return a usable pointer which doesn't have to be normalized. |
|||
*/ |
|||
if (bsize < 65520L) { |
|||
buf = farmalloc(bsize); |
|||
if (*(ush*)&buf != 0) return buf; |
|||
} else { |
|||
buf = farmalloc(bsize + 16L); |
|||
} |
|||
if (buf == NULL || next_ptr >= MAX_PTR) return NULL; |
|||
table[next_ptr].org_ptr = buf; |
|||
|
|||
/* Normalize the pointer to seg:0 */ |
|||
*((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; |
|||
*(ush*)&buf = 0; |
|||
table[next_ptr++].new_ptr = buf; |
|||
return buf; |
|||
} |
|||
|
|||
void zcfree (voidpf opaque, voidpf ptr) |
|||
{ |
|||
int n; |
|||
if (*(ush*)&ptr != 0) { /* object < 64K */ |
|||
farfree(ptr); |
|||
return; |
|||
} |
|||
/* Find the original pointer */ |
|||
for (n = 0; n < next_ptr; n++) { |
|||
if (ptr != table[n].new_ptr) continue; |
|||
|
|||
farfree(table[n].org_ptr); |
|||
while (++n < next_ptr) { |
|||
table[n-1] = table[n]; |
|||
} |
|||
next_ptr--; |
|||
return; |
|||
} |
|||
ptr = opaque; /* just to make some compilers happy */ |
|||
Assert(0, "zcfree: ptr not found"); |
|||
} |
|||
|
|||
#endif /* __TURBOC__ */ |
|||
|
|||
|
|||
#ifdef M_I86 |
|||
/* Microsoft C in 16-bit mode */ |
|||
|
|||
# define MY_ZCALLOC |
|||
|
|||
#if (!defined(_MSC_VER) || (_MSC_VER <= 600)) |
|||
# define _halloc halloc |
|||
# define _hfree hfree |
|||
#endif |
|||
|
|||
voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) |
|||
{ |
|||
if (opaque) opaque = 0; /* to make compiler happy */ |
|||
return _halloc((long)items, size); |
|||
} |
|||
|
|||
void zcfree (voidpf opaque, voidpf ptr) |
|||
{ |
|||
if (opaque) opaque = 0; /* to make compiler happy */ |
|||
_hfree(ptr); |
|||
} |
|||
|
|||
#endif /* M_I86 */ |
|||
|
|||
#endif /* SYS16BIT */ |
|||
|
|||
|
|||
#ifndef MY_ZCALLOC /* Any system without a special alloc function */ |
|||
|
|||
#ifndef STDC |
|||
extern voidp malloc OF((uInt size)); |
|||
extern voidp calloc OF((uInt items, uInt size)); |
|||
extern void free OF((voidpf ptr)); |
|||
#endif |
|||
|
|||
voidpf zcalloc (opaque, items, size) |
|||
voidpf opaque; |
|||
unsigned items; |
|||
unsigned size; |
|||
{ |
|||
if (opaque) items += size - size; /* make compiler happy */ |
|||
return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) : |
|||
(voidpf)calloc(items, size); |
|||
} |
|||
|
|||
void zcfree (opaque, ptr) |
|||
voidpf opaque; |
|||
voidpf ptr; |
|||
{ |
|||
free(ptr); |
|||
if (opaque) return; /* make compiler happy */ |
|||
} |
|||
|
|||
#endif /* MY_ZCALLOC */ |
|||
@ -0,0 +1,269 @@ |
|||
/* zutil.h -- internal interface and configuration of the compression library
|
|||
* Copyright (C) 1995-2005 Jean-loup Gailly. |
|||
* For conditions of distribution and use, see copyright notice in zlib.h |
|||
*/ |
|||
|
|||
/* WARNING: this file should *not* be used by applications. It is
|
|||
part of the implementation of the compression library and is |
|||
subject to change. Applications should only use zlib.h. |
|||
*/ |
|||
|
|||
/* @(#) $Id: zutil.h,v 3.10 2005/08/04 19:14:14 tor%cs.brown.edu Exp $ */ |
|||
|
|||
#ifndef ZUTIL_H |
|||
#define ZUTIL_H |
|||
|
|||
#define ZLIB_INTERNAL |
|||
#include "zlib.h" |
|||
|
|||
#ifdef STDC |
|||
# ifndef _WIN32_WCE |
|||
# include <stddef.h> |
|||
# endif |
|||
# include <string.h> |
|||
# include <stdlib.h> |
|||
#endif |
|||
#ifdef NO_ERRNO_H |
|||
# ifdef _WIN32_WCE |
|||
/* The Microsoft C Run-Time Library for Windows CE doesn't have
|
|||
* errno. We define it as a global variable to simplify porting. |
|||
* Its value is always 0 and should not be used. We rename it to |
|||
* avoid conflict with other libraries that use the same workaround. |
|||
*/ |
|||
# define errno z_errno |
|||
# endif |
|||
extern int errno; |
|||
#else |
|||
# ifndef _WIN32_WCE |
|||
# include <errno.h> |
|||
# endif |
|||
#endif |
|||
|
|||
#ifndef local |
|||
# define local static |
|||
#endif |
|||
/* compile with -Dlocal if your debugger can't find static symbols */ |
|||
|
|||
typedef unsigned char uch; |
|||
typedef uch FAR uchf; |
|||
typedef unsigned short ush; |
|||
typedef ush FAR ushf; |
|||
typedef unsigned long ulg; |
|||
|
|||
extern const char * const z_errmsg[10]; /* indexed by 2-zlib_error */ |
|||
/* (size given to avoid silly warnings with Visual C++) */ |
|||
|
|||
#define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)] |
|||
|
|||
#define ERR_RETURN(strm,err) \ |
|||
return (strm->msg = (char*)ERR_MSG(err), (err)) |
|||
/* To be used only when the state is known to be valid */ |
|||
|
|||
/* common constants */ |
|||
|
|||
#ifndef DEF_WBITS |
|||
# define DEF_WBITS MAX_WBITS |
|||
#endif |
|||
/* default windowBits for decompression. MAX_WBITS is for compression only */ |
|||
|
|||
#if MAX_MEM_LEVEL >= 8 |
|||
# define DEF_MEM_LEVEL 8 |
|||
#else |
|||
# define DEF_MEM_LEVEL MAX_MEM_LEVEL |
|||
#endif |
|||
/* default memLevel */ |
|||
|
|||
#define STORED_BLOCK 0 |
|||
#define STATIC_TREES 1 |
|||
#define DYN_TREES 2 |
|||
/* The three kinds of block type */ |
|||
|
|||
#define MIN_MATCH 3 |
|||
#define MAX_MATCH 258 |
|||
/* The minimum and maximum match lengths */ |
|||
|
|||
#define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */ |
|||
|
|||
/* target dependencies */ |
|||
|
|||
#if defined(MSDOS) || (defined(WINDOWS) && !defined(WIN32)) |
|||
# define OS_CODE 0x00 |
|||
# if defined(__TURBOC__) || defined(__BORLANDC__) |
|||
# if(__STDC__ == 1) && (defined(__LARGE__) || defined(__COMPACT__)) |
|||
/* Allow compilation with ANSI keywords only enabled */ |
|||
void _Cdecl farfree( void *block ); |
|||
void *_Cdecl farmalloc( unsigned long nbytes ); |
|||
# else |
|||
# include <alloc.h> |
|||
# endif |
|||
# else /* MSC or DJGPP */ |
|||
# include <malloc.h> |
|||
# endif |
|||
#endif |
|||
|
|||
#ifdef AMIGA |
|||
# define OS_CODE 0x01 |
|||
#endif |
|||
|
|||
#if defined(VAXC) || defined(VMS) |
|||
# define OS_CODE 0x02 |
|||
# define F_OPEN(name, mode) \ |
|||
fopen((name), (mode), "mbc=60", "ctx=stm", "rfm=fix", "mrs=512") |
|||
#endif |
|||
|
|||
#if defined(ATARI) || defined(atarist) |
|||
# define OS_CODE 0x05 |
|||
#endif |
|||
|
|||
#ifdef OS2 |
|||
# define OS_CODE 0x06 |
|||
# ifdef M_I86 |
|||
#include <malloc.h> |
|||
# endif |
|||
#endif |
|||
|
|||
#if defined(MACOS) || defined(TARGET_OS_MAC) |
|||
# define OS_CODE 0x07 |
|||
# if defined(__MWERKS__) && __dest_os != __be_os && __dest_os != __win32_os |
|||
# include <unix.h> /* for fdopen */ |
|||
# else |
|||
# ifndef fdopen |
|||
# define fdopen(fd,mode) NULL /* No fdopen() */ |
|||
# endif |
|||
# endif |
|||
#endif |
|||
|
|||
#ifdef TOPS20 |
|||
# define OS_CODE 0x0a |
|||
#endif |
|||
|
|||
#ifdef WIN32 |
|||
# ifndef __CYGWIN__ /* Cygwin is Unix, not Win32 */ |
|||
# define OS_CODE 0x0b |
|||
# endif |
|||
#endif |
|||
|
|||
#ifdef __50SERIES /* Prime/PRIMOS */ |
|||
# define OS_CODE 0x0f |
|||
#endif |
|||
|
|||
#if defined(_BEOS_) || defined(RISCOS) |
|||
# define fdopen(fd,mode) NULL /* No fdopen() */ |
|||
#endif |
|||
|
|||
#if (defined(_MSC_VER) && (_MSC_VER > 600)) |
|||
# if defined(_WIN32_WCE) |
|||
# define fdopen(fd,mode) NULL /* No fdopen() */ |
|||
# ifndef _PTRDIFF_T_DEFINED |
|||
typedef int ptrdiff_t; |
|||
# define _PTRDIFF_T_DEFINED |
|||
# endif |
|||
# else |
|||
# define fdopen(fd,type) _fdopen(fd,type) |
|||
# endif |
|||
#endif |
|||
|
|||
/* common defaults */ |
|||
|
|||
#ifndef OS_CODE |
|||
# define OS_CODE 0x03 /* assume Unix */ |
|||
#endif |
|||
|
|||
#ifndef F_OPEN |
|||
# define F_OPEN(name, mode) fopen((name), (mode)) |
|||
#endif |
|||
|
|||
/* functions */ |
|||
|
|||
#if defined(STDC99) || (defined(__TURBOC__) && __TURBOC__ >= 0x550) |
|||
# ifndef HAVE_VSNPRINTF |
|||
# define HAVE_VSNPRINTF |
|||
# endif |
|||
#endif |
|||
#if defined(__CYGWIN__) |
|||
# ifndef HAVE_VSNPRINTF |
|||
# define HAVE_VSNPRINTF |
|||
# endif |
|||
#endif |
|||
#ifndef HAVE_VSNPRINTF |
|||
# ifdef MSDOS |
|||
/* vsnprintf may exist on some MS-DOS compilers (DJGPP?),
|
|||
but for now we just assume it doesn't. */ |
|||
# define NO_vsnprintf |
|||
# endif |
|||
# ifdef __TURBOC__ |
|||
# define NO_vsnprintf |
|||
# endif |
|||
# ifdef WIN32 |
|||
/* In Win32, vsnprintf is available as the "non-ANSI" _vsnprintf. */ |
|||
# if !defined(vsnprintf) && !defined(NO_vsnprintf) |
|||
# define vsnprintf _vsnprintf |
|||
# endif |
|||
# endif |
|||
# ifdef __SASC |
|||
# define NO_vsnprintf |
|||
# endif |
|||
#endif |
|||
#ifdef VMS |
|||
# define NO_vsnprintf |
|||
#endif |
|||
|
|||
#if defined(pyr) |
|||
# define NO_MEMCPY |
|||
#endif |
|||
#if defined(SMALL_MEDIUM) && !defined(_MSC_VER) && !defined(__SC__) |
|||
/* Use our own functions for small and medium model with MSC <= 5.0.
|
|||
* You may have to use the same strategy for Borland C (untested). |
|||
* The __SC__ check is for Symantec. |
|||
*/ |
|||
# define NO_MEMCPY |
|||
#endif |
|||
#if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY) |
|||
# define HAVE_MEMCPY |
|||
#endif |
|||
#ifdef HAVE_MEMCPY |
|||
# ifdef SMALL_MEDIUM /* MSDOS small or medium model */ |
|||
# define zmemcpy _fmemcpy |
|||
# define zmemcmp _fmemcmp |
|||
# define zmemzero(dest, len) _fmemset(dest, 0, len) |
|||
# else |
|||
# define zmemcpy memcpy |
|||
# define zmemcmp memcmp |
|||
# define zmemzero(dest, len) memset(dest, 0, len) |
|||
# endif |
|||
#else |
|||
extern void zmemcpy OF((Bytef* dest, const Bytef* source, uInt len)); |
|||
extern int zmemcmp OF((const Bytef* s1, const Bytef* s2, uInt len)); |
|||
extern void zmemzero OF((Bytef* dest, uInt len)); |
|||
#endif |
|||
|
|||
/* Diagnostic functions */ |
|||
#ifdef DEBUG |
|||
# include <stdio.h> |
|||
extern int z_verbose; |
|||
extern void z_error OF((char *m)); |
|||
# define Assert(cond,msg) {if(!(cond)) z_error(msg);} |
|||
# define Trace(x) {if (z_verbose>=0) fprintf x ;} |
|||
# define Tracev(x) {if (z_verbose>0) fprintf x ;} |
|||
# define Tracevv(x) {if (z_verbose>1) fprintf x ;} |
|||
# define Tracec(c,x) {if (z_verbose>0 && (c)) fprintf x ;} |
|||
# define Tracecv(c,x) {if (z_verbose>1 && (c)) fprintf x ;} |
|||
#else |
|||
# define Assert(cond,msg) |
|||
# define Trace(x) |
|||
# define Tracev(x) |
|||
# define Tracevv(x) |
|||
# define Tracec(c,x) |
|||
# define Tracecv(c,x) |
|||
#endif |
|||
|
|||
|
|||
voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size)); |
|||
void zcfree OF((voidpf opaque, voidpf ptr)); |
|||
|
|||
#define ZALLOC(strm, items, size) \ |
|||
(*((strm)->zalloc))((strm)->opaque, (items), (size)) |
|||
#define ZFREE(strm, addr) (*((strm)->zfree))((strm)->opaque, (voidpf)(addr)) |
|||
#define TRY_FREE(s, p) {if (p) ZFREE(s, p);} |
|||
|
|||
#endif /* ZUTIL_H */ |
|||
@ -0,0 +1,95 @@ |
|||
## Zlib |
|||
|
|||
You can access this module with: |
|||
|
|||
var zlib = require('zlib'); |
|||
var gzip = zlib.createGzip(); |
|||
var fs = require('fs'); |
|||
var inp = fs.createReadStream('input.txt'); |
|||
var out = fs.createWriteStream('input.txt.gz'); |
|||
|
|||
inp.pipe(gzip).pipe(out); |
|||
|
|||
This provides bindings to Gzip/Gunzip, Deflate/Inflate, and |
|||
DeflateRaw/InflateRaw classes. Each class takes the same options, and |
|||
is a readable/writable Stream. |
|||
|
|||
### Constants |
|||
|
|||
All of the constants defined in zlib.h are also defined on |
|||
`require('zlib')`. They are described in more detail in the zlib |
|||
documentation. See <http://zlib.net/manual.html#Constants> |
|||
for more details. |
|||
|
|||
### zlib.Gzip |
|||
|
|||
Compress data using gzip. |
|||
|
|||
### zlib.Gunzip |
|||
|
|||
Decompress a gzip stream. |
|||
|
|||
### zlib.Deflate |
|||
|
|||
Compress data using deflate. |
|||
|
|||
### zlib.Inflate |
|||
|
|||
Decompress a deflate stream. |
|||
|
|||
### zlib.DeflateRaw |
|||
|
|||
Compress data using deflate, and do not append a zlib header. |
|||
|
|||
### zlib.InflateRaw |
|||
|
|||
Decompress a raw deflate stream. |
|||
|
|||
### zlib.Unzip |
|||
|
|||
Decompress either a Gzip- or Deflate-compressed stream by auto-detecting |
|||
the header. |
|||
|
|||
### Options |
|||
|
|||
Each class takes an options object. All options are optional. |
|||
|
|||
Note that some options are only |
|||
relevant when compressing, and are ignored by the decompression classes. |
|||
|
|||
* chunkSize (default: 16*1024) |
|||
* windowBits |
|||
* level (compression only) |
|||
* memLevel (compression only) |
|||
* strategy (compression only) |
|||
|
|||
See the description of `deflateInit2` and `inflateInit2` at |
|||
<http://zlib.net/manual.html#Advanced> for more information on these. |
|||
|
|||
### Memory Usage Tuning |
|||
|
|||
From `zlib/zconf.h`, modified to node's usage: |
|||
|
|||
The memory requirements for deflate are (in bytes): |
|||
|
|||
(1 << (windowBits+2)) + (1 << (memLevel+9)) |
|||
|
|||
that is: 128K for windowBits=15 + 128K for memLevel = 8 |
|||
(default values) plus a few kilobytes for small objects. |
|||
|
|||
For example, if you want to reduce |
|||
the default memory requirements from 256K to 128K, set the options to: |
|||
|
|||
{ windowBits: 14, memLevel: 7 } |
|||
|
|||
Of course this will generally degrade compression (there's no free lunch). |
|||
|
|||
The memory requirements for inflate are (in bytes) |
|||
|
|||
1 << windowBits |
|||
|
|||
that is, 32K for windowBits=15 (default value) plus a few kilobytes |
|||
for small objects. |
|||
|
|||
This is in addition to a single internal output slab buffer of size |
|||
`chunkSize`, which defaults to 16K. |
|||
@ -0,0 +1,325 @@ |
|||
// Copyright Joyent, Inc. and other Node contributors.
|
|||
//
|
|||
// Permission is hereby granted, free of charge, to any person obtaining a
|
|||
// copy of this software and associated documentation files (the
|
|||
// "Software"), to deal in the Software without restriction, including
|
|||
// without limitation the rights to use, copy, modify, merge, publish,
|
|||
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|||
// persons to whom the Software is furnished to do so, subject to the
|
|||
// following conditions:
|
|||
//
|
|||
// The above copyright notice and this permission notice shall be included
|
|||
// in all copies or substantial portions of the Software.
|
|||
//
|
|||
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|||
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|||
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|||
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|||
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|||
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|||
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|||
|
|||
var binding = process.binding('zlib'); |
|||
var util = require('util'); |
|||
var stream = require('stream'); |
|||
|
|||
// zlib doesn't provide these, so kludge them in following the same
|
|||
// const naming scheme zlib uses.
|
|||
binding.Z_MIN_WINDOWBITS = 8; |
|||
binding.Z_MAX_WINDOWBITS = 15; |
|||
binding.Z_DEFAULT_WINDOWBITS = 15; |
|||
|
|||
// fewer than 64 bytes per chunk is stupid.
|
|||
// technically it could work with as few as 8, but even 64 bytes
|
|||
// is absurdly low. Usually a MB or more is best.
|
|||
binding.Z_MIN_CHUNK = 64; |
|||
binding.Z_MAX_CHUNK = Infinity; |
|||
binding.Z_DEFAULT_CHUNK = (16 * 1024); |
|||
|
|||
binding.Z_MIN_MEMLEVEL = 1; |
|||
binding.Z_MAX_MEMLEVEL = 9; |
|||
binding.Z_DEFAULT_MEMLEVEL = 8; |
|||
|
|||
binding.Z_MIN_LEVEL = -1; |
|||
binding.Z_MAX_LEVEL = 9; |
|||
binding.Z_DEFAULT_LEVEL = binding.Z_DEFAULT_COMPRESSION; |
|||
|
|||
// expose all the zlib constants
|
|||
Object.keys(binding).forEach(function(k) { |
|||
if (k.match(/^Z/)) exports[k] = binding[k]; |
|||
}); |
|||
|
|||
|
|||
exports.Deflate = Deflate; |
|||
exports.Inflate = Inflate; |
|||
exports.Gzip = Gzip; |
|||
exports.Gunzip = Gunzip; |
|||
exports.DeflateRaw = DeflateRaw; |
|||
exports.InflateRaw = InflateRaw; |
|||
exports.Unzip = Unzip; |
|||
|
|||
exports.createDeflate = function (o) { return new Deflate(o); }; |
|||
exports.createInflate = function (o) { return new Inflate(o); }; |
|||
exports.createDeflateRaw = function (o) { return new DeflateRaw(o); }; |
|||
exports.createInflateRaw = function (o) { return new InflateRaw(o); }; |
|||
exports.createGzip = function (o) { return new Gzip(o); }; |
|||
exports.createGunzip = function (o) { return new Gunzip(o); }; |
|||
exports.createUnzip = function (o) { return new Unzip(o); }; |
|||
|
|||
|
|||
|
|||
// generic zlib
|
|||
// minimal 2-byte header
|
|||
function Deflate(opts) { |
|||
if (!(this instanceof Deflate)) return new Deflate(opt); |
|||
Zlib.call(this, opts, binding.Deflate); |
|||
} |
|||
|
|||
function Inflate(opts) { |
|||
if (!(this instanceof Inflate)) return new Inflate(opts); |
|||
Zlib.call(this, opts, binding.Inflate); |
|||
} |
|||
|
|||
|
|||
|
|||
// gzip - bigger header, same deflate compression
|
|||
function Gzip(opts) { |
|||
if (!(this instanceof Gzip)) return new Gzip(opts); |
|||
Zlib.call(this, opts, binding.Gzip); |
|||
} |
|||
|
|||
function Gunzip(opts) { |
|||
if (!(this instanceof Gunzip)) return new Gunzip(opts); |
|||
Zlib.call(this, opts, binding.Gunzip); |
|||
} |
|||
|
|||
|
|||
|
|||
// raw - no header
|
|||
function DeflateRaw(opts) { |
|||
if (!(this instanceof DeflateRaw)) return new DeflateRaw(opts); |
|||
Zlib.call(this, opts, binding.DeflateRaw); |
|||
} |
|||
|
|||
function InflateRaw(opts) { |
|||
if (!(this instanceof InflateRaw)) return new InflateRaw(opts); |
|||
Zlib.call(this, opts, binding.InflateRaw); |
|||
} |
|||
|
|||
|
|||
// auto-detect header.
|
|||
function Unzip(opts) { |
|||
if (!(this instanceof Unzip)) return new Unzip(opts); |
|||
Zlib.call(this, opts, binding.Unzip); |
|||
} |
|||
|
|||
|
|||
// the Zlib class they all inherit from
|
|||
// This thing manages the queue of requests, and returns
|
|||
// true or false if there is anything in the queue when
|
|||
// you call the .write() method.
|
|||
|
|||
function Zlib(opts, Binding) { |
|||
this._opts = opts = opts || {}; |
|||
this._queue = []; |
|||
this._processing = false; |
|||
this._ended = false; |
|||
this.readable = true; |
|||
this.writable = true; |
|||
this._flush = binding.Z_NO_FLUSH; |
|||
|
|||
if (opts.chunkSize) { |
|||
if (opts.chunkSize < exports.Z_MIN_CHUNK || |
|||
opts.chunkSize > exports.Z_MAX_CHUNK) { |
|||
throw new Error("Invalid chunk size: "+opts.chunkSize); |
|||
} |
|||
} |
|||
|
|||
if (opts.windowBits) { |
|||
if (opts.windowBits < exports.Z_MIN_WINDOWBITS || |
|||
opts.windowBits > exports.Z_MAX_WINDOWBITS) { |
|||
throw new Error("Invalid windowBits: "+opts.windowBits); |
|||
} |
|||
} |
|||
|
|||
if (opts.level) { |
|||
if (opts.level < exports.Z_MIN_LEVEL || |
|||
opts.level > exports.Z_MAX_LEVEL) { |
|||
throw new Error("Invalid compression level: "+opts.level); |
|||
} |
|||
} |
|||
|
|||
if (opts.memLevel) { |
|||
if (opts.memLevel < exports.Z_MIN_MEMLEVEL || |
|||
opts.memLevel > exports.Z_MAX_MEMLEVEL) { |
|||
throw new Error("Invalid memLevel: "+opts.memLevel); |
|||
} |
|||
} |
|||
|
|||
if (opts.strategy) { |
|||
if (opts.strategy != exports.Z_FILTERED && |
|||
opts.strategy != exports.Z_HUFFMAN_ONLY && |
|||
opts.strategy != exports.Z_RLE && |
|||
opts.strategy != exports.Z_FIXED && |
|||
opts.strategy != exports.Z_DEFAULT_STRATEGY) { |
|||
throw new Error("Invalid strategy: "+opts.strategy); |
|||
} |
|||
} |
|||
|
|||
this._binding = new Binding(); |
|||
this._binding.init(opts.windowBits || exports.Z_DEFAULT_WINDOWBITS, |
|||
opts.level || exports.Z_DEFAULT_COMPRESSION, |
|||
opts.memLevel || exports.Z_DEFAULT_MEMLEVEL, |
|||
opts.strategy || exports.Z_DEFAULT_STRATEGY); |
|||
|
|||
this._chunkSize = opts.chunkSize || exports.Z_DEFAULT_CHUNK; |
|||
this._buffer = new Buffer(this._chunkSize); |
|||
this._offset = 0; |
|||
var self = this; |
|||
|
|||
this._binding.onData = function(c) { |
|||
self.emit('data', c); |
|||
}; |
|||
|
|||
this._binding.onEnd = function() { |
|||
self.emit('end'); |
|||
}; |
|||
} |
|||
|
|||
util.inherits(Zlib, stream.Stream); |
|||
|
|||
Zlib.prototype.write = function write(chunk, cb) { |
|||
if (this._ended) { |
|||
return this.emit('error', new Error('Cannot write after end')); |
|||
} |
|||
|
|||
if (arguments.length === 1 && typeof chunk === 'function') { |
|||
cb = chunk; |
|||
chunk = null; |
|||
} |
|||
|
|||
if (!chunk) { |
|||
chunk = null; |
|||
} else if (typeof chunk === 'string') { |
|||
chunk = new Buffer(chunk); |
|||
} else if (!Buffer.isBuffer(chunk)) { |
|||
return this.emit('error', new Error('Invalid argument')); |
|||
} |
|||
|
|||
|
|||
var empty = this._queue.length === 0; |
|||
|
|||
this._queue.push([chunk, cb]); |
|||
this._process(); |
|||
if (!empty) { |
|||
this._needDrain = true; |
|||
} |
|||
return empty; |
|||
}; |
|||
|
|||
Zlib.prototype.flush = function flush(cb) { |
|||
this._flush = binding.Z_SYNC_FLUSH; |
|||
return this.write(cb); |
|||
}; |
|||
|
|||
Zlib.prototype.end = function end(chunk, cb) { |
|||
var self = this; |
|||
this._ending = true; |
|||
var ret = this.write(chunk, function() { |
|||
self.emit('end'); |
|||
if (cb) cb(); |
|||
}); |
|||
this._ended = true; |
|||
return ret; |
|||
}; |
|||
|
|||
Zlib.prototype._process = function() { |
|||
if (this._processing || this._paused) return; |
|||
|
|||
if (this._queue.length === 0) { |
|||
if (this._needDrain) { |
|||
this._needDrain = false; |
|||
this.emit('drain'); |
|||
} |
|||
return; |
|||
} |
|||
|
|||
var req = this._queue.shift(); |
|||
var cb = req.pop(); |
|||
var chunk = req.pop(); |
|||
|
|||
if (this._ending && this._queue.length === 0) { |
|||
this._flush = binding.Z_FINISH; |
|||
} |
|||
|
|||
var self = this; |
|||
var availInBefore = chunk && chunk.length; |
|||
var availOutBefore = this._chunkSize - this._offset; |
|||
|
|||
var inOff = 0; |
|||
var req = this._binding.write(this._flush, |
|||
chunk, // in
|
|||
inOff, // in_off
|
|||
availInBefore, // in_len
|
|||
this._buffer, // out
|
|||
this._offset, //out_off
|
|||
availOutBefore); // out_len
|
|||
|
|||
req.buffer = chunk; |
|||
req.callback = callback; |
|||
this._processing = req; |
|||
|
|||
function callback(availInAfter, availOutAfter) { |
|||
var have = self.chunkSize - availOutAfter; |
|||
if (have > 0) { |
|||
var out = self._buffer.slice(self._offset, self._offset + have); |
|||
self._offset += have; |
|||
} |
|||
|
|||
// XXX Maybe have a 'min buffer' size so we don't dip into the
|
|||
// thread pool with only 1 byte available or something?
|
|||
if (availOutAfter === 0 || self._offset >= self._chunkSize) { |
|||
self._offset = 0; |
|||
self._buffer = new Buffer(self._chunkSize); |
|||
} |
|||
|
|||
if (availOutAfter === 0) { |
|||
// Not actually done. Need to reprocess.
|
|||
inOff += (availInBefore - availInAfter); |
|||
var newReq = self._binding.write(self._flush, |
|||
chunk, |
|||
inOff, |
|||
availInAfter, |
|||
self._buffer, |
|||
self._offset, |
|||
self._chunkSize); |
|||
newReq.callback = callback; // this same function
|
|||
newReq.buffer = chunk; |
|||
self._processing = newReq; |
|||
return; |
|||
} |
|||
|
|||
// finished with the chunk.
|
|||
self._processing = false; |
|||
if (cb) cb(); |
|||
self._process(); |
|||
} |
|||
}; |
|||
|
|||
Zlib.prototype.pause = function() { |
|||
this._paused = true; |
|||
this.emit('pause'); |
|||
}; |
|||
|
|||
Zlib.prototype.resume = function() { |
|||
this._paused = false; |
|||
this.emit('resume'); |
|||
}; |
|||
|
|||
util.inherits(Deflate, Zlib); |
|||
util.inherits(Inflate, Zlib); |
|||
util.inherits(Gzip, Zlib); |
|||
util.inherits(Gunzip, Zlib); |
|||
util.inherits(DeflateRaw, Zlib); |
|||
util.inherits(InflateRaw, Zlib); |
|||
util.inherits(Unzip, Zlib); |
|||
@ -0,0 +1,359 @@ |
|||
// Copyright Joyent, Inc. and other Node contributors.
|
|||
//
|
|||
// Permission is hereby granted, free of charge, to any person obtaining a
|
|||
// copy of this software and associated documentation files (the
|
|||
// "Software"), to deal in the Software without restriction, including
|
|||
// without limitation the rights to use, copy, modify, merge, publish,
|
|||
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|||
// persons to whom the Software is furnished to do so, subject to the
|
|||
// following conditions:
|
|||
//
|
|||
// The above copyright notice and this permission notice shall be included
|
|||
// in all copies or substantial portions of the Software.
|
|||
//
|
|||
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|||
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|||
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|||
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|||
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|||
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|||
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|||
|
|||
|
|||
#include <v8.h> |
|||
#include <errno.h> |
|||
#include <string.h> |
|||
#include <stdlib.h> |
|||
#include <sys/types.h> |
|||
#include <zlib.h> |
|||
|
|||
#include <node.h> |
|||
#include <node_buffer.h> |
|||
#include <req_wrap.h> |
|||
|
|||
|
|||
|
|||
namespace node { |
|||
using namespace v8; |
|||
|
|||
// write() returns one of these, and then calls the cb() when it's done.
|
|||
typedef ReqWrap<uv_work_t> WorkReqWrap; |
|||
|
|||
static Persistent<String> ondata_sym; |
|||
static Persistent<String> callback_sym; |
|||
|
|||
enum node_zlib_mode { |
|||
DEFLATE = 1, |
|||
INFLATE, |
|||
GZIP, |
|||
GUNZIP, |
|||
DEFLATERAW, |
|||
INFLATERAW, |
|||
UNZIP |
|||
}; |
|||
|
|||
template <node_zlib_mode mode> class ZCtx; |
|||
|
|||
|
|||
void InitZlib(v8::Handle<v8::Object> target); |
|||
|
|||
|
|||
/**
|
|||
* Deflate/Inflate |
|||
*/ |
|||
template <node_zlib_mode mode> class ZCtx : public ObjectWrap { |
|||
public: |
|||
|
|||
ZCtx() : ObjectWrap() { |
|||
} |
|||
|
|||
~ZCtx() { |
|||
if (mode == DEFLATE || mode == GZIP || mode == DEFLATERAW) { |
|||
(void)deflateEnd(&strm_); |
|||
} else if (mode == INFLATE || mode == GUNZIP || mode == INFLATERAW) { |
|||
(void)inflateEnd(&strm_); |
|||
} |
|||
} |
|||
|
|||
// write(flush, in, in_off, in_len, out, out_off, out_len)
|
|||
static Handle<Value> |
|||
Write(const Arguments& args) { |
|||
assert(args.Length() == 7); |
|||
|
|||
ZCtx<mode> *ctx = ObjectWrap::Unwrap< ZCtx<mode> >(args.This()); |
|||
assert(ctx->init_done_ && "write before init"); |
|||
|
|||
unsigned int flush = args[0]->Uint32Value(); |
|||
Bytef *in; |
|||
Bytef *out; |
|||
size_t in_off, in_len, out_off, out_len; |
|||
|
|||
if (args[1]->IsNull()) { |
|||
// just a flush
|
|||
Bytef nada[1] = { 0 }; |
|||
in = nada; |
|||
in_len = 0; |
|||
in_off = 0; |
|||
} else { |
|||
assert(Buffer::HasInstance(args[1])); |
|||
Local<Object> in_buf; |
|||
in_buf = args[1]->ToObject(); |
|||
in_off = (size_t)args[2]->Uint32Value(); |
|||
in_len = (size_t)args[3]->Uint32Value(); |
|||
|
|||
assert(in_off + in_len <= Buffer::Length(in_buf)); |
|||
in = reinterpret_cast<Bytef *>(Buffer::Data(in_buf) + in_off); |
|||
} |
|||
|
|||
assert(Buffer::HasInstance(args[4])); |
|||
Local<Object> out_buf = args[4]->ToObject(); |
|||
out_off = (size_t)args[5]->Uint32Value(); |
|||
out_len = (size_t)args[6]->Uint32Value(); |
|||
assert(out_off + out_len <= Buffer::Length(out_buf)); |
|||
out = reinterpret_cast<Bytef *>(Buffer::Data(out_buf) + out_off); |
|||
|
|||
WorkReqWrap *req_wrap = new WorkReqWrap(); |
|||
|
|||
req_wrap->data_ = ctx; |
|||
ctx->strm_.avail_in = in_len; |
|||
ctx->strm_.next_in = &(*in); |
|||
ctx->strm_.avail_out = out_len; |
|||
ctx->strm_.next_out = out; |
|||
ctx->flush_ = flush; |
|||
|
|||
// set this so that later on, I can easily tell how much was written.
|
|||
ctx->chunk_size_ = out_len; |
|||
|
|||
// build up the work request
|
|||
uv_work_t* work_req = new uv_work_t(); |
|||
work_req->data = req_wrap; |
|||
|
|||
uv_queue_work(uv_default_loop(), |
|||
work_req, |
|||
ZCtx<mode>::Process, |
|||
ZCtx<mode>::After); |
|||
|
|||
req_wrap->Dispatched(); |
|||
|
|||
return req_wrap->object_; |
|||
} |
|||
|
|||
|
|||
// thread pool!
|
|||
// This function may be called multiple times on the uv_work pool
|
|||
// for a single write() call, until all of the input bytes have
|
|||
// been consumed.
|
|||
static void |
|||
Process(uv_work_t* work_req) { |
|||
WorkReqWrap *req_wrap = reinterpret_cast<WorkReqWrap *>(work_req->data); |
|||
ZCtx<mode> *ctx = (ZCtx<mode> *)req_wrap->data_; |
|||
|
|||
// If the avail_out is left at 0, then it means that it ran out
|
|||
// of room. If there was avail_out left over, then it means
|
|||
// that all of the input was consumed.
|
|||
int err; |
|||
switch (mode) { |
|||
case DEFLATE: |
|||
case GZIP: |
|||
case DEFLATERAW: |
|||
err = deflate(&(ctx->strm_), ctx->flush_); |
|||
break; |
|||
case UNZIP: |
|||
case INFLATE: |
|||
case GUNZIP: |
|||
case INFLATERAW: |
|||
err = inflate(&(ctx->strm_), ctx->flush_); |
|||
break; |
|||
default: |
|||
assert(0 && "wtf?"); |
|||
} |
|||
assert(err != Z_STREAM_ERROR); |
|||
|
|||
// now After will emit the output, and
|
|||
// either schedule another call to Process,
|
|||
// or shift the queue and call Process.
|
|||
} |
|||
|
|||
// v8 land!
|
|||
static void |
|||
After(uv_work_t* work_req) { |
|||
WorkReqWrap *req_wrap = reinterpret_cast<WorkReqWrap *>(work_req->data); |
|||
ZCtx<mode> *ctx = (ZCtx<mode> *)req_wrap->data_; |
|||
Local<Integer> avail_out = Integer::New(ctx->strm_.avail_out); |
|||
Local<Integer> avail_in = Integer::New(ctx->strm_.avail_in); |
|||
|
|||
// call the write() cb
|
|||
assert(req_wrap->object_->Get(callback_sym)->IsFunction() && |
|||
"Invalid callback"); |
|||
Local<Value> args[2] = { avail_in, avail_out }; |
|||
MakeCallback(req_wrap->object_, "callback", 2, args); |
|||
|
|||
// delete the ReqWrap
|
|||
delete req_wrap; |
|||
} |
|||
|
|||
static Handle<Value> |
|||
New(const Arguments& args) { |
|||
HandleScope scope; |
|||
ZCtx<mode> *ctx = new ZCtx<mode>(); |
|||
ctx->Wrap(args.This()); |
|||
return args.This(); |
|||
} |
|||
|
|||
// just pull the ints out of the args and call the other Init
|
|||
static Handle<Value> |
|||
Init(const Arguments& args) { |
|||
HandleScope scope; |
|||
|
|||
assert(args.Length() == 4 && |
|||
"init(level, windowBits, memLevel, strategy)"); |
|||
|
|||
ZCtx<mode> *ctx = ObjectWrap::Unwrap< ZCtx<mode> >(args.This()); |
|||
|
|||
int windowBits = args[0]->Uint32Value(); |
|||
assert((windowBits >= 8 && windowBits <= 15) && "invalid windowBits"); |
|||
|
|||
int level = args[1]->Uint32Value(); |
|||
assert((level >= -1 && level <= 9) && "invalid compression level"); |
|||
|
|||
int memLevel = args[2]->Uint32Value(); |
|||
assert((memLevel >= 1 && memLevel <= 9) && "invalid memlevel"); |
|||
|
|||
int strategy = args[3]->Uint32Value(); |
|||
assert((strategy == Z_FILTERED || |
|||
strategy == Z_HUFFMAN_ONLY || |
|||
strategy == Z_RLE || |
|||
strategy == Z_FIXED || |
|||
strategy == Z_DEFAULT_STRATEGY) && "invalid strategy"); |
|||
|
|||
Init(ctx, level, windowBits, memLevel, strategy); |
|||
return Undefined(); |
|||
} |
|||
|
|||
static void |
|||
Init(ZCtx *ctx, |
|||
int level, |
|||
int windowBits, |
|||
int memLevel, |
|||
int strategy) { |
|||
ctx->level_ = level; |
|||
ctx->windowBits_ = windowBits; |
|||
ctx->memLevel_ = memLevel; |
|||
ctx->strategy_ = strategy; |
|||
|
|||
ctx->strm_.zalloc = Z_NULL; |
|||
ctx->strm_.zfree = Z_NULL; |
|||
ctx->strm_.opaque = Z_NULL; |
|||
|
|||
ctx->flush_ = Z_NO_FLUSH; |
|||
|
|||
if (mode == GZIP || mode == GUNZIP) { |
|||
ctx->windowBits_ += 16; |
|||
} |
|||
|
|||
if (mode == UNZIP) { |
|||
ctx->windowBits_ += 32; |
|||
} |
|||
|
|||
if (mode == DEFLATERAW || mode == INFLATERAW) { |
|||
ctx->windowBits_ *= -1; |
|||
} |
|||
|
|||
int err; |
|||
switch (mode) { |
|||
case DEFLATE: |
|||
case GZIP: |
|||
case DEFLATERAW: |
|||
err = deflateInit2(&(ctx->strm_), |
|||
ctx->level_, |
|||
Z_DEFLATED, |
|||
ctx->windowBits_, |
|||
ctx->memLevel_, |
|||
ctx->strategy_); |
|||
break; |
|||
case INFLATE: |
|||
case GUNZIP: |
|||
case INFLATERAW: |
|||
case UNZIP: |
|||
err = inflateInit2(&(ctx->strm_), ctx->windowBits_); |
|||
break; |
|||
default: |
|||
assert(0 && "wtf?"); |
|||
} |
|||
|
|||
ctx->init_done_ = true; |
|||
assert(err == Z_OK); |
|||
} |
|||
|
|||
private: |
|||
|
|||
bool init_done_; |
|||
|
|||
z_stream strm_; |
|||
int level_; |
|||
int windowBits_; |
|||
int memLevel_; |
|||
int strategy_; |
|||
|
|||
int flush_; |
|||
|
|||
int chunk_size_; |
|||
}; |
|||
|
|||
|
|||
#define NODE_ZLIB_CLASS(mode, name) \ |
|||
{ \ |
|||
Local<FunctionTemplate> z = FunctionTemplate::New(ZCtx<mode>::New); \ |
|||
z->InstanceTemplate()->SetInternalFieldCount(1); \ |
|||
NODE_SET_PROTOTYPE_METHOD(z, "write", ZCtx<mode>::Write); \ |
|||
NODE_SET_PROTOTYPE_METHOD(z, "init", ZCtx<mode>::Init); \ |
|||
z->SetClassName(String::NewSymbol(name)); \ |
|||
target->Set(String::NewSymbol(name), z->GetFunction()); \ |
|||
} |
|||
|
|||
void InitZlib(Handle<Object> target) { |
|||
HandleScope scope; |
|||
|
|||
NODE_ZLIB_CLASS(INFLATE, "Inflate") |
|||
NODE_ZLIB_CLASS(DEFLATE, "Deflate") |
|||
NODE_ZLIB_CLASS(INFLATERAW, "InflateRaw") |
|||
NODE_ZLIB_CLASS(DEFLATERAW, "DeflateRaw") |
|||
NODE_ZLIB_CLASS(GZIP, "Gzip") |
|||
NODE_ZLIB_CLASS(GUNZIP, "Gunzip") |
|||
NODE_ZLIB_CLASS(UNZIP, "Unzip") |
|||
|
|||
ondata_sym = NODE_PSYMBOL("onData"); |
|||
callback_sym = NODE_PSYMBOL("callback"); |
|||
|
|||
NODE_DEFINE_CONSTANT(target, Z_NO_FLUSH); |
|||
NODE_DEFINE_CONSTANT(target, Z_PARTIAL_FLUSH); |
|||
NODE_DEFINE_CONSTANT(target, Z_SYNC_FLUSH); |
|||
NODE_DEFINE_CONSTANT(target, Z_FULL_FLUSH); |
|||
NODE_DEFINE_CONSTANT(target, Z_FINISH); |
|||
NODE_DEFINE_CONSTANT(target, Z_BLOCK); |
|||
NODE_DEFINE_CONSTANT(target, Z_OK); |
|||
NODE_DEFINE_CONSTANT(target, Z_STREAM_END); |
|||
NODE_DEFINE_CONSTANT(target, Z_NEED_DICT); |
|||
NODE_DEFINE_CONSTANT(target, Z_ERRNO); |
|||
NODE_DEFINE_CONSTANT(target, Z_STREAM_ERROR); |
|||
NODE_DEFINE_CONSTANT(target, Z_DATA_ERROR); |
|||
NODE_DEFINE_CONSTANT(target, Z_MEM_ERROR); |
|||
NODE_DEFINE_CONSTANT(target, Z_BUF_ERROR); |
|||
NODE_DEFINE_CONSTANT(target, Z_VERSION_ERROR); |
|||
NODE_DEFINE_CONSTANT(target, Z_NO_COMPRESSION); |
|||
NODE_DEFINE_CONSTANT(target, Z_BEST_SPEED); |
|||
NODE_DEFINE_CONSTANT(target, Z_BEST_COMPRESSION); |
|||
NODE_DEFINE_CONSTANT(target, Z_DEFAULT_COMPRESSION); |
|||
NODE_DEFINE_CONSTANT(target, Z_FILTERED); |
|||
NODE_DEFINE_CONSTANT(target, Z_HUFFMAN_ONLY); |
|||
NODE_DEFINE_CONSTANT(target, Z_RLE); |
|||
NODE_DEFINE_CONSTANT(target, Z_FIXED); |
|||
NODE_DEFINE_CONSTANT(target, Z_DEFAULT_STRATEGY); |
|||
NODE_DEFINE_CONSTANT(target, ZLIB_VERNUM); |
|||
|
|||
target->Set(String::NewSymbol("ZLIB_VERSION"), String::New(ZLIB_VERSION)); |
|||
} |
|||
|
|||
} // namespace node
|
|||
|
|||
NODE_MODULE(node_zlib, node::InitZlib); |
|||
@ -0,0 +1,221 @@ |
|||
// Copyright Joyent, Inc. and other Node contributors.
|
|||
//
|
|||
// Permission is hereby granted, free of charge, to any person obtaining a
|
|||
// copy of this software and associated documentation files (the
|
|||
// "Software"), to deal in the Software without restriction, including
|
|||
// without limitation the rights to use, copy, modify, merge, publish,
|
|||
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|||
// persons to whom the Software is furnished to do so, subject to the
|
|||
// following conditions:
|
|||
//
|
|||
// The above copyright notice and this permission notice shall be included
|
|||
// in all copies or substantial portions of the Software.
|
|||
//
|
|||
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|||
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|||
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|||
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|||
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|||
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|||
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|||
|
|||
var common = require('../common.js'); |
|||
var assert = require('assert'); |
|||
var zlib = require('zlib'); |
|||
var path = require('path'); |
|||
|
|||
var zlibPairs = |
|||
[ [zlib.Deflate, zlib.Inflate], |
|||
[zlib.Gzip, zlib.Gunzip], |
|||
[zlib.Deflate, zlib.Unzip], |
|||
[zlib.Gzip, zlib.Unzip], |
|||
[zlib.DeflateRaw, zlib.InflateRaw ] ]; |
|||
|
|||
// how fast to trickle through the slowstream
|
|||
var trickle = [128, 1024, 1024 * 1024]; |
|||
|
|||
// tunable options for zlib classes.
|
|||
|
|||
// several different chunk sizes
|
|||
var chunkSize = [128, 1024, 1024 * 16, 1024 * 1024]; |
|||
|
|||
// this is every possible value.
|
|||
var level = [-1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9]; |
|||
var windowBits = [8, 9, 10, 11, 12, 13, 14, 15]; |
|||
var memLevel = [1, 2, 3, 4, 5, 6, 7, 8, 9]; |
|||
var strategy = [0, 1, 2, 3, 4]; |
|||
|
|||
// it's nice in theory to test every combination, but it
|
|||
// takes WAY too long. Maybe a pummel test could do this?
|
|||
if (!process.env.PUMMEL) { |
|||
trickle = [1024]; |
|||
chunkSize = [1024 * 16]; |
|||
level = [6]; |
|||
memLevel = [8]; |
|||
windowBits = [15]; |
|||
strategy = [0]; |
|||
} |
|||
|
|||
var fs = require('fs'); |
|||
|
|||
var testFiles = [ 'person.jpg', 'elipses.txt', 'empty.txt' ]; |
|||
var tests = {} |
|||
testFiles.forEach(function(file) { |
|||
tests[file] = fs.readFileSync(path.resolve(common.fixturesDir, file)); |
|||
}); |
|||
|
|||
var util = require('util'); |
|||
var stream = require('stream'); |
|||
|
|||
|
|||
// stream that saves everything
|
|||
function BufferStream() { |
|||
this.chunks = []; |
|||
this.length = 0; |
|||
this.writable = true; |
|||
this.readable = true; |
|||
} |
|||
|
|||
util.inherits(BufferStream, stream.Stream); |
|||
|
|||
BufferStream.prototype.write = function(c) { |
|||
this.chunks.push(c); |
|||
this.length += c.length; |
|||
}; |
|||
|
|||
BufferStream.prototype.end = function(c) { |
|||
if (c) this.write(c); |
|||
// flatten
|
|||
var buf = new Buffer(this.length); |
|||
var i = 0; |
|||
this.chunks.forEach(function(c) { |
|||
c.copy(buf, i); |
|||
i += c.length; |
|||
}); |
|||
this.emit('data', buf); |
|||
this.emit('end'); |
|||
}; |
|||
|
|||
|
|||
function SlowStream(trickle) { |
|||
this.trickle = trickle; |
|||
this.offset = 0; |
|||
this.readable = this.writable = true; |
|||
} |
|||
|
|||
util.inherits(SlowStream, stream.Stream); |
|||
|
|||
SlowStream.prototype.write = function() { |
|||
throw new Error('not implemented, just call ss.end(chunk)'); |
|||
}; |
|||
|
|||
SlowStream.prototype.pause = function() { |
|||
this.paused = true; |
|||
this.emit('pause'); |
|||
}; |
|||
|
|||
SlowStream.prototype.resume = function() { |
|||
var self = this; |
|||
if (self.ended) return; |
|||
self.emit('resume'); |
|||
if (!self.chunk) return; |
|||
self.paused = false; |
|||
emit(); |
|||
function emit() { |
|||
if (self.paused) return; |
|||
if (self.offset >= self.length) { |
|||
self.ended = true; |
|||
return self.emit('end'); |
|||
} |
|||
var end = Math.min(self.offset + self.trickle, self.length); |
|||
var c = self.chunk.slice(self.offset, end); |
|||
self.offset += c.length; |
|||
self.emit('data', c); |
|||
process.nextTick(emit); |
|||
} |
|||
} |
|||
|
|||
SlowStream.prototype.end = function(chunk) { |
|||
// walk over the chunk in blocks.
|
|||
var self = this; |
|||
self.chunk = chunk; |
|||
self.length = chunk.length; |
|||
self.resume(); |
|||
return self.ended; |
|||
}; |
|||
|
|||
|
|||
|
|||
// for each of the files, make sure that compressing and
|
|||
// decompressing results in the same data, for every combination
|
|||
// of the options set above.
|
|||
var failures = 0; |
|||
var total = 0; |
|||
var done = 0; |
|||
|
|||
Object.keys(tests).forEach(function(file) { |
|||
var test = tests[file]; |
|||
chunkSize.forEach(function(chunkSize) { |
|||
trickle.forEach(function(trickle) { |
|||
windowBits.forEach(function(windowBits) { |
|||
level.forEach(function(level) { |
|||
memLevel.forEach(function(memLevel) { |
|||
strategy.forEach(function(strategy) { |
|||
zlibPairs.forEach(function(pair) { |
|||
var Def = pair[0]; |
|||
var Inf = pair[1]; |
|||
var opts = { level: level, |
|||
windowBits: windowBits, |
|||
memLevel: memLevel, |
|||
strategy: strategy }; |
|||
|
|||
total ++; |
|||
|
|||
var def = new Def(opts); |
|||
var inf = new Inf(opts); |
|||
var ss = new SlowStream(trickle); |
|||
var buf = new BufferStream(); |
|||
|
|||
// verify that the same exact buffer comes out the other end.
|
|||
buf.on('data', function(c) { |
|||
var msg = file + ' ' + |
|||
chunkSize + ' ' + |
|||
JSON.stringify(opts) + ' ' + |
|||
Def.name + ' -> ' + Inf.name; |
|||
var ok = true; |
|||
var testNum = ++done; |
|||
for (var i = 0; i < c.length; i++) { |
|||
if (c[i] !== test[i]) { |
|||
ok = false; |
|||
failures ++; |
|||
break; |
|||
} |
|||
} |
|||
if (ok) { |
|||
console.log('ok ' + (testNum) + ' ' + msg); |
|||
} else { |
|||
console.log('not ok ' + (testNum) + ' ' + msg); |
|||
console.log(' ...'); |
|||
console.log(' testfile: ' + file); |
|||
console.log(' type: ' + Def.name + ' -> ' + Inf.name); |
|||
console.log(' position: ' + i); |
|||
console.log(' options: ' + JSON.stringify(opts)); |
|||
console.log(' expect: ' + test[i]); |
|||
console.log(' actual: ' + c[i]); |
|||
console.log(' chunkSize: ' + chunkSize); |
|||
console.log(' ---'); |
|||
} |
|||
}); |
|||
|
|||
// the magic happens here.
|
|||
ss.pipe(def).pipe(inf).pipe(buf); |
|||
ss.end(test); |
|||
}); |
|||
}); }); }); }); }); }); // sad stallman is sad.
|
|||
}); |
|||
|
|||
process.on('exit', function(code) { |
|||
console.log('1..' + done); |
|||
assert.equal(done, total, (total - done) + ' tests left unfinished'); |
|||
assert.ok(!failures, 'some test failures'); |
|||
}); |
|||
Loading…
Reference in new issue