mirror of https://github.com/madler/zlib.git
Mark Adler
13 years ago
parent
a383133c4e
commit
7c2a874e50
77 changed files with 7228 additions and 2470 deletions
@ -0,0 +1,9 @@ |
||||
To make a shared library: |
||||
|
||||
1. Compile a static library |
||||
2. Use mkexps on that to create libz.exp |
||||
3. Apply the configure.diff patch to configure |
||||
4. Run the new configure to make a new Makefile |
||||
5. Use the new Makefile to make the shared library |
||||
|
||||
Courtesy of dbakker@arrayasolutions.com |
||||
@ -0,0 +1,57 @@ |
||||
*** ../orig/zlib-1.1.4/configure Wed Jul 8 14:19:35 1998
|
||||
--- configure Sun Feb 9 11:11:19 2003
|
||||
***************
|
||||
*** 18,23 ****
|
||||
--- 18,24 ----
|
||||
# If you have problems, try without defining CC and CFLAGS before reporting
|
||||
# an error.
|
||||
|
||||
+ LDFLAGS="-L. -lz"
|
||||
LIBS=libz.a
|
||||
SHAREDLIB=libz.so
|
||||
VER=`sed -n -e '/VERSION "/s/.*"\(.*\)".*/\1/p' < zlib.h`
|
||||
***************
|
||||
*** 116,121 ****
|
||||
--- 117,128 ----
|
||||
SFLAGS=${CFLAGS-"-Kconform_pic -O"}
|
||||
CFLAGS=${CFLAGS-"-O"}
|
||||
LDSHARED=${LDSHARED-"cc -G"};;
|
||||
+ AIX*)
|
||||
+ SFLAGS=${CFLAGS-"-O -qmaxmem=8192"}
|
||||
+ CFLAGS=${CFLAGS-"-O -qmaxmem=8192"}
|
||||
+ LDTESTSHARED=${LDSHARED-"cc -G"}
|
||||
+ LDSHAREDFLAGS="-L. libz.so"
|
||||
+ LDSHARED=${LDSHARED-"cc -G"};;
|
||||
# send working options for other systems to support@gzip.org
|
||||
*) SFLAGS=${CFLAGS-"-O"}
|
||||
CFLAGS=${CFLAGS-"-O"}
|
||||
***************
|
||||
*** 127,135 ****
|
||||
echo Checking for shared library support...
|
||||
# we must test in two steps (cc then ld), required at least on SunOS 4.x
|
||||
if test "`($CC -c $SFLAGS $test.c) 2>&1`" = "" &&
|
||||
! test "`($LDSHARED -o $test$shared_ext $test.o) 2>&1`" = ""; then
|
||||
CFLAGS="$SFLAGS"
|
||||
LIBS="$SHAREDLIB.$VER"
|
||||
echo Building shared library $SHAREDLIB.$VER with $CC.
|
||||
elif test -z "$old_cc" -a -z "$old_cflags"; then
|
||||
echo No shared library suppport.
|
||||
--- 134,143 ----
|
||||
echo Checking for shared library support...
|
||||
# we must test in two steps (cc then ld), required at least on SunOS 4.x
|
||||
if test "`($CC -c $SFLAGS $test.c) 2>&1`" = "" &&
|
||||
! test "`($LDTESTSHARED -o $test$shared_ext $test.o) 2>&1`" = ""; then
|
||||
CFLAGS="$SFLAGS"
|
||||
LIBS="$SHAREDLIB.$VER"
|
||||
+ LDFLAGS="$LDSHAREDFLAGS"
|
||||
echo Building shared library $SHAREDLIB.$VER with $CC.
|
||||
elif test -z "$old_cc" -a -z "$old_cflags"; then
|
||||
echo No shared library suppport.
|
||||
***************
|
||||
*** 209,212 ****
|
||||
--- 217,221 ----
|
||||
/^exec_prefix *=/s%=.*%=$exec_prefix%
|
||||
/^libdir *=/s%=.*%=$libdir%
|
||||
/^includedir *=/s%=.*%=$includedir%
|
||||
+ /^LDFLAGS *=/s%=.*%=$LDFLAGS%
|
||||
" > Makefile
|
||||
@ -0,0 +1,37 @@ |
||||
#!/bin/ksh |
||||
# |
||||
# mkexps - make export list |
||||
# This program creates an export list by combining all the "." and normal names |
||||
# into one list. |
||||
# |
||||
if [[ "$#" -ne 1 ]] |
||||
then |
||||
print "Usage: mkexps ArchiveFile" |
||||
exit -2 |
||||
fi |
||||
if [[ ! -f $1 ]] |
||||
then |
||||
print "mkexps: Cannot open file \"$1\"" |
||||
exit -1 |
||||
fi |
||||
|
||||
dump -g $1 | awk ' |
||||
BEGIN { |
||||
top = 1 |
||||
} |
||||
/^[ ]*[0-9][0-9]*/ { |
||||
if ( (n = index( $2, "." )) > 0 ) { |
||||
export_array[ top++ ] = substr( $2, n+1, length( $2 )) |
||||
} |
||||
else { |
||||
export_array[ top++ ] = $2 |
||||
} |
||||
} |
||||
|
||||
END { |
||||
for ( i = 1; i < top; i++ ) |
||||
{ |
||||
print export_array[ i ] |
||||
} |
||||
|
||||
}' | sort | uniq |
||||
@ -0,0 +1,8 @@ |
||||
blast: blast.c blast.h |
||||
cc -DTEST -o blast blast.c
|
||||
|
||||
test: blast |
||||
blast < test.pk | cmp - test.txt
|
||||
|
||||
clean: |
||||
rm -f blast blast.o
|
||||
@ -0,0 +1,4 @@ |
||||
Read blast.h for purpose and usage. |
||||
|
||||
Mark Adler |
||||
madler@alumni.caltech.edu |
||||
@ -0,0 +1,444 @@ |
||||
/* blast.c
|
||||
* Copyright (C) 2003 Mark Adler |
||||
* For conditions of distribution and use, see copyright notice in blast.h |
||||
* version 1.1, 16 Feb 2003 |
||||
* |
||||
* blast.c decompresses data compressed by the PKWare Compression Library. |
||||
* This function provides functionality similar to the explode() function of |
||||
* the PKWare library, hence the name "blast". |
||||
* |
||||
* This decompressor is based on the excellent format description provided by |
||||
* Ben Rudiak-Gould in comp.compression on August 13, 2001. Interestingly, the |
||||
* example Ben provided in the post is incorrect. The distance 110001 should |
||||
* instead be 111000. When corrected, the example byte stream becomes: |
||||
* |
||||
* 00 04 82 24 25 8f 80 7f |
||||
* |
||||
* which decompresses to "AIAIAIAIAIAIA" (without the quotes). |
||||
*/ |
||||
|
||||
/*
|
||||
* Change history: |
||||
* |
||||
* 1.0 12 Feb 2003 - First version |
||||
* 1.1 16 Feb 2003 - Fixed distance check for > 4 GB uncompressed data |
||||
*/ |
||||
|
||||
#include <setjmp.h> /* for setjmp(), longjmp(), and jmp_buf */ |
||||
#include "blast.h" /* prototype for blast() */ |
||||
|
||||
#define local static /* for local function definitions */ |
||||
#define MAXBITS 13 /* maximum code length */ |
||||
#define MAXWIN 4096 /* maximum window size */ |
||||
|
||||
/* input and output state */ |
||||
struct state { |
||||
/* input state */ |
||||
blast_in infun; /* input function provided by user */ |
||||
void *inhow; /* opaque information passed to infun() */ |
||||
unsigned char *in; /* next input location */ |
||||
unsigned left; /* available input at in */ |
||||
int bitbuf; /* bit buffer */ |
||||
int bitcnt; /* number of bits in bit buffer */ |
||||
|
||||
/* input limit error return state for bits() and decode() */ |
||||
jmp_buf env; |
||||
|
||||
/* output state */ |
||||
blast_out outfun; /* output function provided by user */ |
||||
void *outhow; /* opaque information passed to outfun() */ |
||||
unsigned next; /* index of next write location in out[] */ |
||||
int first; /* true to check distances (for first 4K) */ |
||||
unsigned char out[MAXWIN]; /* output buffer and sliding window */ |
||||
}; |
||||
|
||||
/*
|
||||
* Return need bits from the input stream. This always leaves less than |
||||
* eight bits in the buffer. bits() works properly for need == 0. |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - Bits are stored in bytes from the least significant bit to the most |
||||
* significant bit. Therefore bits are dropped from the bottom of the bit |
||||
* buffer, using shift right, and new bytes are appended to the top of the |
||||
* bit buffer, using shift left. |
||||
*/ |
||||
local int bits(struct state *s, int need) |
||||
{ |
||||
int val; /* bit accumulator */ |
||||
|
||||
/* load at least need bits into val */ |
||||
val = s->bitbuf; |
||||
while (s->bitcnt < need) { |
||||
if (s->left == 0) { |
||||
s->left = s->infun(s->inhow, &(s->in)); |
||||
if (s->left == 0) longjmp(s->env, 1); /* out of input */ |
||||
} |
||||
val |= (int)(*(s->in)++) << s->bitcnt; /* load eight bits */ |
||||
s->left--; |
||||
s->bitcnt += 8; |
||||
} |
||||
|
||||
/* drop need bits and update buffer, always zero to seven bits left */ |
||||
s->bitbuf = val >> need; |
||||
s->bitcnt -= need; |
||||
|
||||
/* return need bits, zeroing the bits above that */ |
||||
return val & ((1 << need) - 1); |
||||
} |
||||
|
||||
/*
|
||||
* Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of |
||||
* each length, which for a canonical code are stepped through in order. |
||||
* symbol[] are the symbol values in canonical order, where the number of |
||||
* entries is the sum of the counts in count[]. The decoding process can be |
||||
* seen in the function decode() below. |
||||
*/ |
||||
struct huffman { |
||||
short *count; /* number of symbols of each length */ |
||||
short *symbol; /* canonically ordered symbols */ |
||||
}; |
||||
|
||||
/*
|
||||
* Decode a code from the stream s using huffman table h. Return the symbol or |
||||
* a negative value if there is an error. If all of the lengths are zero, i.e. |
||||
* an empty code, or if the code is incomplete and an invalid code is received, |
||||
* then -9 is returned after reading MAXBITS bits. |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - The codes as stored in the compressed data are bit-reversed relative to |
||||
* a simple integer ordering of codes of the same lengths. Hence below the |
||||
* bits are pulled from the compressed data one at a time and used to |
||||
* build the code value reversed from what is in the stream in order to |
||||
* permit simple integer comparisons for decoding. |
||||
* |
||||
* - The first code for the shortest length is all ones. Subsequent codes of |
||||
* the same length are simply integer decrements of the previous code. When |
||||
* moving up a length, a one bit is appended to the code. For a complete |
||||
* code, the last code of the longest length will be all zeros. To support |
||||
* this ordering, the bits pulled during decoding are inverted to apply the |
||||
* more "natural" ordering starting with all zeros and incrementing. |
||||
*/ |
||||
local int decode(struct state *s, struct huffman *h) |
||||
{ |
||||
int len; /* current number of bits in code */ |
||||
int code; /* len bits being decoded */ |
||||
int first; /* first code of length len */ |
||||
int count; /* number of codes of length len */ |
||||
int index; /* index of first code of length len in symbol table */ |
||||
int bitbuf; /* bits from stream */ |
||||
int left; /* bits left in next or left to process */ |
||||
short *next; /* next number of codes */ |
||||
|
||||
bitbuf = s->bitbuf; |
||||
left = s->bitcnt; |
||||
code = first = index = 0; |
||||
len = 1; |
||||
next = h->count + 1; |
||||
while (1) { |
||||
while (left--) { |
||||
code |= (bitbuf & 1) ^ 1; /* invert code */ |
||||
bitbuf >>= 1; |
||||
count = *next++; |
||||
if (code < first + count) { /* if length len, return symbol */ |
||||
s->bitbuf = bitbuf; |
||||
s->bitcnt = (s->bitcnt - len) & 7; |
||||
return h->symbol[index + (code - first)]; |
||||
} |
||||
index += count; /* else update for next length */ |
||||
first += count; |
||||
first <<= 1; |
||||
code <<= 1; |
||||
len++; |
||||
} |
||||
left = (MAXBITS+1) - len; |
||||
if (left == 0) break; |
||||
if (s->left == 0) { |
||||
s->left = s->infun(s->inhow, &(s->in)); |
||||
if (s->left == 0) longjmp(s->env, 1); /* out of input */ |
||||
} |
||||
bitbuf = *(s->in)++; |
||||
s->left--; |
||||
if (left > 8) left = 8; |
||||
} |
||||
return -9; /* ran out of codes */ |
||||
} |
||||
|
||||
/*
|
||||
* Given a list of repeated code lengths rep[0..n-1], where each byte is a |
||||
* count (high four bits + 1) and a code length (low four bits), generate the |
||||
* list of code lengths. This compaction reduces the size of the object code. |
||||
* Then given the list of code lengths length[0..n-1] representing a canonical |
||||
* Huffman code for n symbols, construct the tables required to decode those |
||||
* codes. Those tables are the number of codes of each length, and the symbols |
||||
* sorted by length, retaining their original order within each length. The |
||||
* return value is zero for a complete code set, negative for an over- |
||||
* subscribed code set, and positive for an incomplete code set. The tables |
||||
* can be used if the return value is zero or positive, but they cannot be used |
||||
* if the return value is negative. If the return value is zero, it is not |
||||
* possible for decode() using that table to return an error--any stream of |
||||
* enough bits will resolve to a symbol. If the return value is positive, then |
||||
* it is possible for decode() using that table to return an error for received |
||||
* codes past the end of the incomplete lengths. |
||||
*/ |
||||
local int construct(struct huffman *h, const unsigned char *rep, int n) |
||||
{ |
||||
int symbol; /* current symbol when stepping through length[] */ |
||||
int len; /* current length when stepping through h->count[] */ |
||||
int left; /* number of possible codes left of current length */ |
||||
short offs[MAXBITS+1]; /* offsets in symbol table for each length */ |
||||
short length[256]; /* code lengths */ |
||||
|
||||
/* convert compact repeat counts into symbol bit length list */ |
||||
symbol = 0; |
||||
do { |
||||
len = *rep++; |
||||
left = (len >> 4) + 1; |
||||
len &= 15; |
||||
do { |
||||
length[symbol++] = len; |
||||
} while (--left); |
||||
} while (--n); |
||||
n = symbol; |
||||
|
||||
/* count number of codes of each length */ |
||||
for (len = 0; len <= MAXBITS; len++) |
||||
h->count[len] = 0; |
||||
for (symbol = 0; symbol < n; symbol++) |
||||
(h->count[length[symbol]])++; /* assumes lengths are within bounds */ |
||||
if (h->count[0] == n) /* no codes! */ |
||||
return 0; /* complete, but decode() will fail */ |
||||
|
||||
/* check for an over-subscribed or incomplete set of lengths */ |
||||
left = 1; /* one possible code of zero length */ |
||||
for (len = 1; len <= MAXBITS; len++) { |
||||
left <<= 1; /* one more bit, double codes left */ |
||||
left -= h->count[len]; /* deduct count from possible codes */ |
||||
if (left < 0) return left; /* over-subscribed--return negative */ |
||||
} /* left > 0 means incomplete */ |
||||
|
||||
/* generate offsets into symbol table for each length for sorting */ |
||||
offs[1] = 0; |
||||
for (len = 1; len < MAXBITS; len++) |
||||
offs[len + 1] = offs[len] + h->count[len]; |
||||
|
||||
/*
|
||||
* put symbols in table sorted by length, by symbol order within each |
||||
* length |
||||
*/ |
||||
for (symbol = 0; symbol < n; symbol++) |
||||
if (length[symbol] != 0) |
||||
h->symbol[offs[length[symbol]]++] = symbol; |
||||
|
||||
/* return zero for complete set, positive for incomplete set */ |
||||
return left; |
||||
} |
||||
|
||||
/*
|
||||
* Decode PKWare Compression Library stream. |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - First byte is 0 if literals are uncoded or 1 if they are coded. Second |
||||
* byte is 4, 5, or 6 for the number of extra bits in the distance code. |
||||
* This is the base-2 logarithm of the dictionary size minus six. |
||||
* |
||||
* - Compressed data is a combination of literals and length/distance pairs |
||||
* terminated by an end code. Literals are either Huffman coded or |
||||
* uncoded bytes. A length/distance pair is a coded length followed by a |
||||
* coded distance to represent a string that occurs earlier in the |
||||
* uncompressed data that occurs again at the current location. |
||||
* |
||||
* - A bit preceding a literal or length/distance pair indicates which comes |
||||
* next, 0 for literals, 1 for length/distance. |
||||
* |
||||
* - If literals are uncoded, then the next eight bits are the literal, in the |
||||
* normal bit order in th stream, i.e. no bit-reversal is needed. Similarly, |
||||
* no bit reversal is needed for either the length extra bits or the distance |
||||
* extra bits. |
||||
* |
||||
* - Literal bytes are simply written to the output. A length/distance pair is |
||||
* an instruction to copy previously uncompressed bytes to the output. The |
||||
* copy is from distance bytes back in the output stream, copying for length |
||||
* bytes. |
||||
* |
||||
* - Distances pointing before the beginning of the output data are not |
||||
* permitted. |
||||
* |
||||
* - Overlapped copies, where the length is greater than the distance, are |
||||
* allowed and common. For example, a distance of one and a length of 518 |
||||
* simply copies the last byte 518 times. A distance of four and a length of |
||||
* twelve copies the last four bytes three times. A simple forward copy |
||||
* ignoring whether the length is greater than the distance or not implements |
||||
* this correctly. |
||||
*/ |
||||
local int decomp(struct state *s) |
||||
{ |
||||
int lit; /* true if literals are coded */ |
||||
int dict; /* log2(dictionary size) - 6 */ |
||||
int symbol; /* decoded symbol, extra bits for distance */ |
||||
int len; /* length for copy */ |
||||
int dist; /* distance for copy */ |
||||
int copy; /* copy counter */ |
||||
unsigned char *from, *to; /* copy pointers */ |
||||
static int virgin = 1; /* build tables once */ |
||||
static short litcnt[MAXBITS+1], litsym[256]; /* litcode memory */ |
||||
static short lencnt[MAXBITS+1], lensym[16]; /* lencode memory */ |
||||
static short distcnt[MAXBITS+1], distsym[64]; /* distcode memory */ |
||||
static struct huffman litcode = {litcnt, litsym}; /* length code */ |
||||
static struct huffman lencode = {lencnt, lensym}; /* length code */ |
||||
static struct huffman distcode = {distcnt, distsym};/* distance code */ |
||||
/* bit lengths of literal codes */ |
||||
static const unsigned char litlen[] = { |
||||
11, 124, 8, 7, 28, 7, 188, 13, 76, 4, 10, 8, 12, 10, 12, 10, 8, 23, 8, |
||||
9, 7, 6, 7, 8, 7, 6, 55, 8, 23, 24, 12, 11, 7, 9, 11, 12, 6, 7, 22, 5, |
||||
7, 24, 6, 11, 9, 6, 7, 22, 7, 11, 38, 7, 9, 8, 25, 11, 8, 11, 9, 12, |
||||
8, 12, 5, 38, 5, 38, 5, 11, 7, 5, 6, 21, 6, 10, 53, 8, 7, 24, 10, 27, |
||||
44, 253, 253, 253, 252, 252, 252, 13, 12, 45, 12, 45, 12, 61, 12, 45, |
||||
44, 173}; |
||||
/* bit lengths of length codes 0..15 */ |
||||
static const unsigned char lenlen[] = {2, 35, 36, 53, 38, 23}; |
||||
/* bit lengths of distance codes 0..63 */ |
||||
static const unsigned char distlen[] = {2, 20, 53, 230, 247, 151, 248}; |
||||
static const short base[16] = { /* base for length codes */ |
||||
3, 2, 4, 5, 6, 7, 8, 9, 10, 12, 16, 24, 40, 72, 136, 264}; |
||||
static const char extra[16] = { /* extra bits for length codes */ |
||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8}; |
||||
|
||||
/* set up decoding tables (once--might not be thread-safe) */ |
||||
if (virgin) { |
||||
construct(&litcode, litlen, sizeof(litlen)); |
||||
construct(&lencode, lenlen, sizeof(lenlen)); |
||||
construct(&distcode, distlen, sizeof(distlen)); |
||||
virgin = 0; |
||||
} |
||||
|
||||
/* read header */ |
||||
lit = bits(s, 8); |
||||
if (lit > 1) return -1; |
||||
dict = bits(s, 8); |
||||
if (dict < 4 || dict > 6) return -2; |
||||
|
||||
/* decode literals and length/distance pairs */ |
||||
do { |
||||
if (bits(s, 1)) { |
||||
/* get length */ |
||||
symbol = decode(s, &lencode); |
||||
len = base[symbol] + bits(s, extra[symbol]); |
||||
if (len == 519) break; /* end code */ |
||||
|
||||
/* get distance */ |
||||
symbol = len == 2 ? 2 : dict; |
||||
dist = decode(s, &distcode) << symbol; |
||||
dist += bits(s, symbol); |
||||
dist++; |
||||
if (s->first && dist > s->next) |
||||
return -3; /* distance too far back */ |
||||
|
||||
/* copy length bytes from distance bytes back */ |
||||
do { |
||||
to = s->out + s->next; |
||||
from = to - dist; |
||||
copy = MAXWIN; |
||||
if (s->next < dist) { |
||||
from += copy; |
||||
copy = dist; |
||||
} |
||||
copy -= s->next; |
||||
if (copy > len) copy = len; |
||||
len -= copy; |
||||
s->next += copy; |
||||
do { |
||||
*to++ = *from++; |
||||
} while (--copy); |
||||
if (s->next == MAXWIN) { |
||||
if (s->outfun(s->outhow, s->out, s->next)) return 1; |
||||
s->next = 0; |
||||
s->first = 0; |
||||
} |
||||
} while (len != 0); |
||||
} |
||||
else { |
||||
/* get literal and write it */ |
||||
symbol = lit ? decode(s, &litcode) : bits(s, 8); |
||||
s->out[s->next++] = symbol; |
||||
if (s->next == MAXWIN) { |
||||
if (s->outfun(s->outhow, s->out, s->next)) return 1; |
||||
s->next = 0; |
||||
s->first = 0; |
||||
} |
||||
} |
||||
} while (1); |
||||
return 0; |
||||
} |
||||
|
||||
/* See comments in blast.h */ |
||||
int blast(blast_in infun, void *inhow, blast_out outfun, void *outhow) |
||||
{ |
||||
struct state s; /* input/output state */ |
||||
int err; /* return value */ |
||||
|
||||
/* initialize input state */ |
||||
s.infun = infun; |
||||
s.inhow = inhow; |
||||
s.left = 0; |
||||
s.bitbuf = 0; |
||||
s.bitcnt = 0; |
||||
|
||||
/* initialize output state */ |
||||
s.outfun = outfun; |
||||
s.outhow = outhow; |
||||
s.next = 0; |
||||
s.first = 1; |
||||
|
||||
/* return if bits() or decode() tries to read past available input */ |
||||
if (setjmp(s.env) != 0) /* if came back here via longjmp(), */ |
||||
err = 2; /* then skip decomp(), return error */ |
||||
else |
||||
err = decomp(&s); /* decompress */ |
||||
|
||||
/* write any leftover output and update the error code if needed */ |
||||
if (err != 1 && s.next && s.outfun(s.outhow, s.out, s.next) && err == 0) |
||||
err = 1; |
||||
return err; |
||||
} |
||||
|
||||
#ifdef TEST |
||||
/* Example of how to use blast() */ |
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
|
||||
#define CHUNK 16384 |
||||
|
||||
local unsigned inf(void *how, unsigned char **buf) |
||||
{ |
||||
static unsigned char hold[CHUNK]; |
||||
|
||||
*buf = hold; |
||||
return fread(hold, 1, CHUNK, (FILE *)how); |
||||
} |
||||
|
||||
local int outf(void *how, unsigned char *buf, unsigned len) |
||||
{ |
||||
return fwrite(buf, 1, len, (FILE *)how) != len; |
||||
} |
||||
|
||||
/* Decompress a PKWare Compression Library stream from stdin to stdout */ |
||||
int main(void) |
||||
{ |
||||
int ret, n; |
||||
|
||||
/* decompress to stdout */ |
||||
ret = blast(inf, stdin, outf, stdout); |
||||
if (ret != 0) fprintf(stderr, "blast error: %d\n", ret); |
||||
|
||||
/* see if there are any leftover bytes */ |
||||
n = 0; |
||||
while (getchar() != EOF) n++; |
||||
if (n) fprintf(stderr, "blast warning: %d unused bytes of input\n", n); |
||||
|
||||
/* return blast() error code */ |
||||
return ret; |
||||
} |
||||
#endif |
||||
@ -0,0 +1,71 @@ |
||||
/* blast.h -- interface for blast.c
|
||||
Copyright (C) 2003 Mark Adler |
||||
version 1.1, 16 Feb 2003 |
||||
|
||||
This software is provided 'as-is', without any express or implied |
||||
warranty. In no event will the author 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. |
||||
|
||||
Mark Adler madler@alumni.caltech.edu |
||||
*/ |
||||
|
||||
|
||||
/*
|
||||
* blast() decompresses the PKWare Data Compression Library (DCL) compressed |
||||
* format. It provides the same functionality as the explode() function in |
||||
* that library. (Note: PKWare overused the "implode" verb, and the format |
||||
* used by their library implode() function is completely different and |
||||
* incompatible with the implode compression method supported by PKZIP.) |
||||
*/ |
||||
|
||||
|
||||
typedef unsigned (*blast_in)(void *how, unsigned char **buf); |
||||
typedef int (*blast_out)(void *how, unsigned char *buf, unsigned len); |
||||
/* Definitions for input/output functions passed to blast(). See below for
|
||||
* what the provided functions need to do. |
||||
*/ |
||||
|
||||
|
||||
int blast(blast_in infun, void *inhow, blast_out outfun, void *outhow); |
||||
/* Decompress input to output using the provided infun() and outfun() calls.
|
||||
* On success, the return value of blast() is zero. If there is an error in |
||||
* the source data, i.e. it is not in the proper format, then a negative value |
||||
* is returned. If there is not enough input available or there is not enough |
||||
* output space, then a positive error is returned. |
||||
* |
||||
* The input function is invoked: len = infun(how, &buf), where buf is set by |
||||
* infun() to point to the input buffer, and infun() returns the number of |
||||
* available bytes there. If infun() returns zero, then blast() returns with |
||||
* an input error. (blast() only asks for input if it needs it.) inhow is for |
||||
* use by the application to pass an input descriptor to infun(), if desired. |
||||
* |
||||
* The output function is invoked: err = outfun(how, buf, len), where the bytes |
||||
* to be written are buf[0..len-1]. If err is not zero, then blast() returns |
||||
* with an output error. outfun() is always called with len <= 4096. outhow |
||||
* is for use by the application to pass an output descriptor to outfun(), if |
||||
* desired. |
||||
* |
||||
* The return codes are: |
||||
* |
||||
* 2: ran out of input before completing decompression |
||||
* 1: output error before completing decompression |
||||
* 0: successful decompression |
||||
* -1: literal flag not zero or one |
||||
* -2: dictionary size not in 4..6 |
||||
* -3: distance is too far back |
||||
* |
||||
* At the bottom of blast.c is an example program that uses blast() that can be |
||||
* compiled to produce a command-line decompression filter by defining TEST. |
||||
*/ |
||||
Binary file not shown.
@ -0,0 +1 @@ |
||||
AIAIAIAIAIAIA |
||||
File diff suppressed because it is too large
Load Diff
@ -0,0 +1,8 @@ |
||||
puff: puff.c puff.h |
||||
cc -DTEST -o puff puff.c
|
||||
|
||||
test: puff |
||||
puff zeros.raw
|
||||
|
||||
clean: |
||||
rm -f puff puff.o
|
||||
@ -0,0 +1,63 @@ |
||||
Puff -- A Simple Inflate |
||||
3 Mar 2003 |
||||
Mark Adler |
||||
madler@alumni.caltech.edu |
||||
|
||||
What this is -- |
||||
|
||||
puff.c provides the routine puff() to decompress the deflate data format. It |
||||
does so more slowly than zlib, but the code is about one-fifth the size of the |
||||
inflate code in zlib, and written to be very easy to read. |
||||
|
||||
Why I wrote this -- |
||||
|
||||
puff.c was written to document the deflate format unambiguously, by virtue of |
||||
being working C code. It is meant to supplement RFC 1951, which formally |
||||
describes the deflate format. I have received many questions on details of the |
||||
deflate format, and I hope that reading this code will answer those questions. |
||||
puff.c is heavily commented with details of the deflate format, especially |
||||
those little nooks and cranies of the format that might not be obvious from a |
||||
specification. |
||||
|
||||
puff.c may also be useful in applications where code size or memory usage is a |
||||
very limited resource, and speed is not as important. |
||||
|
||||
How to use it -- |
||||
|
||||
Well, most likely you should just be reading puff.c and using zlib for actual |
||||
applications, but if you must ... |
||||
|
||||
Include puff.h in your code, which provides this prototype: |
||||
|
||||
int puff(unsigned char *dest, /* pointer to destination pointer */ |
||||
unsigned long *destlen, /* amount of output space */ |
||||
unsigned char *source, /* pointer to source data pointer */ |
||||
unsigned long *sourcelen); /* amount of input available */ |
||||
|
||||
Then you can call puff() to decompress a deflate stream that is in memory in |
||||
its entirety at source, to a sufficiently sized block of memory for the |
||||
decompressed data at dest. puff() is the only external symbol in puff.c The |
||||
only C library functions that puff.c needs are setjmp() and longjmp(), which |
||||
are used to simplify error checking in the code to improve readabilty. puff.c |
||||
does no memory allocation, and uses less than 2K bytes off of the stack. |
||||
|
||||
If destlen is not enough space for the uncompressed data, then inflate will |
||||
return an error without writing more than destlen bytes. Note that this means |
||||
that in order to decompress the deflate data successfully, you need to know |
||||
the size of the uncompressed data ahead of time. |
||||
|
||||
If needed, puff() can determine the size of the uncompressed data with no |
||||
output space. This is done by passing dest equal to (unsigned char *)0. Then |
||||
the initial value of *destlen is ignored and *destlen is set to the length of |
||||
the uncompressed data. So if the size of the uncompressed data is not known, |
||||
then two passes of puff() can be used--first to determine the size, and second |
||||
to do the actual inflation after allocating the appropriate memory. Not |
||||
pretty, but it works. (This is one of the reasons you should be using zlib.) |
||||
|
||||
The deflate format is self-terminating. If the deflate stream does not end |
||||
in *sourcelen bytes, puff() will return an error without reading at or past |
||||
endsource. |
||||
|
||||
On return, *sourcelen is updated to the amount of input data consumed, and |
||||
*destlen is updated to the size of the uncompressed data. See the comments |
||||
in puff.c for the possible return codes for puff(). |
||||
@ -0,0 +1,833 @@ |
||||
/*
|
||||
* puff.c |
||||
* Copyright (C) 2002, 2003 Mark Adler |
||||
* For conditions of distribution and use, see copyright notice in puff.h |
||||
* version 1.7, 3 Mar 2003 |
||||
* |
||||
* puff.c is a simple inflate written to be an unambiguous way to specify the |
||||
* deflate format. It is not written for speed but rather simplicity. As a |
||||
* side benefit, this code might actually be useful when small code is more |
||||
* important than speed, such as bootstrap applications. For typical deflate |
||||
* data, zlib's inflate() is about four times as fast as puff(). zlib's |
||||
* inflate compiles to around 20K on my machine, whereas puff.c compiles to |
||||
* around 4K on my machine (a PowerPC using GNU cc). If the faster decode() |
||||
* function here is used, then puff() is only twice as slow as zlib's |
||||
* inflate(). |
||||
* |
||||
* All dynamically allocated memory comes from the stack. The stack required |
||||
* is less than 2K bytes. This code is compatible with 16-bit int's and |
||||
* assumes that long's are at least 32 bits. puff.c uses the short data type, |
||||
* assumed to be 16 bits, for arrays in order to to conserve memory. The code |
||||
* works whether integers are stored big endian or little endian. |
||||
* |
||||
* In the comments below are "Format notes" that describe the inflate process |
||||
* and document some of the less obvious aspects of the format. This source |
||||
* code is meant to supplement RFC 1951, which formally describes the deflate |
||||
* format: |
||||
* |
||||
* http://www.zlib.org/rfc-deflate.html
|
||||
*/ |
||||
|
||||
/*
|
||||
* Change history: |
||||
* |
||||
* 1.0 10 Feb 2002 - First version |
||||
* 1.1 17 Feb 2002 - Clarifications of some comments and notes |
||||
* - Update puff() dest and source pointers on negative |
||||
* errors to facilitate debugging deflators |
||||
* - Remove longest from struct huffman -- not needed |
||||
* - Simplify offs[] index in construct() |
||||
* - Add input size and checking, using longjmp() to |
||||
* maintain easy readability |
||||
* - Use short data type for large arrays |
||||
* - Use pointers instead of long to specify source and |
||||
* destination sizes to avoid arbitrary 4 GB limits |
||||
* 1.2 17 Mar 2002 - Add faster version of decode(), doubles speed (!), |
||||
* but leave simple version for readabilty |
||||
* - Make sure invalid distances detected if pointers |
||||
* are 16 bits |
||||
* - Fix fixed codes table error |
||||
* - Provide a scanning mode for determining size of |
||||
* uncompressed data |
||||
* 1.3 20 Mar 2002 - Go back to lengths for puff() parameters [Jean-loup] |
||||
* - Add a puff.h file for the interface |
||||
* - Add braces in puff() for else do [Jean-loup] |
||||
* - Use indexes instead of pointers for readability |
||||
* 1.4 31 Mar 2002 - Simplify construct() code set check |
||||
* - Fix some comments |
||||
* - Add FIXLCODES #define |
||||
* 1.5 6 Apr 2002 - Minor comment fixes |
||||
* 1.6 7 Aug 2002 - Minor format changes |
||||
* 1.7 3 Mar 2002 - Added test code for distribution |
||||
* - Added zlib-like license |
||||
*/ |
||||
|
||||
#include <setjmp.h> /* for setjmp(), longjmp(), and jmp_buf */ |
||||
#include "puff.h" /* prototype for puff() */ |
||||
|
||||
#define local static /* for local function definitions */ |
||||
#define NIL ((unsigned char *)0) /* for no output option */ |
||||
|
||||
/*
|
||||
* Maximums for allocations and loops. It is not useful to change these -- |
||||
* they are fixed by the deflate format. |
||||
*/ |
||||
#define MAXBITS 15 /* maximum bits in a code */ |
||||
#define MAXLCODES 286 /* maximum number of literal/length codes */ |
||||
#define MAXDCODES 30 /* maximum number of distance codes */ |
||||
#define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */ |
||||
#define FIXLCODES 288 /* number of fixed literal/length codes */ |
||||
|
||||
/* input and output state */ |
||||
struct state { |
||||
/* output state */ |
||||
unsigned char *out; /* output buffer */ |
||||
unsigned long outlen; /* available space at out */ |
||||
unsigned long outcnt; /* bytes written to out so far */ |
||||
|
||||
/* input state */ |
||||
unsigned char *in; /* input buffer */ |
||||
unsigned long inlen; /* available input at in */ |
||||
unsigned long incnt; /* bytes read so far */ |
||||
int bitbuf; /* bit buffer */ |
||||
int bitcnt; /* number of bits in bit buffer */ |
||||
|
||||
/* input limit error return state for bits() and decode() */ |
||||
jmp_buf env; |
||||
}; |
||||
|
||||
/*
|
||||
* Return need bits from the input stream. This always leaves less than |
||||
* eight bits in the buffer. bits() works properly for need == 0. |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - Bits are stored in bytes from the least significant bit to the most |
||||
* significant bit. Therefore bits are dropped from the bottom of the bit |
||||
* buffer, using shift right, and new bytes are appended to the top of the |
||||
* bit buffer, using shift left. |
||||
*/ |
||||
local int bits(struct state *s, int need) |
||||
{ |
||||
long val; /* bit accumulator (can use up to 20 bits) */ |
||||
|
||||
/* load at least need bits into val */ |
||||
val = s->bitbuf; |
||||
while (s->bitcnt < need) { |
||||
if (s->incnt == s->inlen) longjmp(s->env, 1); /* out of input */ |
||||
val |= (long)(s->in[s->incnt++]) << s->bitcnt; /* load eight bits */ |
||||
s->bitcnt += 8; |
||||
} |
||||
|
||||
/* drop need bits and update buffer, always zero to seven bits left */ |
||||
s->bitbuf = (int)(val >> need); |
||||
s->bitcnt -= need; |
||||
|
||||
/* return need bits, zeroing the bits above that */ |
||||
return (int)(val & ((1L << need) - 1)); |
||||
} |
||||
|
||||
/*
|
||||
* Process a stored block. |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - After the two-bit stored block type (00), the stored block length and |
||||
* stored bytes are byte-aligned for fast copying. Therefore any leftover |
||||
* bits in the byte that has the last bit of the type, as many as seven, are |
||||
* discarded. The value of the discarded bits are not defined and should not |
||||
* be checked against any expectation. |
||||
* |
||||
* - The second inverted copy of the stored block length does not have to be |
||||
* checked, but it's probably a good idea to do so anyway. |
||||
* |
||||
* - A stored block can have zero length. This is sometimes used to byte-align |
||||
* subsets of the compressed data for random access or partial recovery. |
||||
*/ |
||||
local int stored(struct state *s) |
||||
{ |
||||
unsigned len; /* length of stored block */ |
||||
|
||||
/* discard leftover bits from current byte (assumes s->bitcnt < 8) */ |
||||
s->bitbuf = 0; |
||||
s->bitcnt = 0; |
||||
|
||||
/* get length and check against its one's complement */ |
||||
if (s->incnt + 4 > s->inlen) return 2; /* not enough input */ |
||||
len = s->in[s->incnt++]; |
||||
len |= s->in[s->incnt++] << 8; |
||||
if (s->in[s->incnt++] != (~len & 0xff) || |
||||
s->in[s->incnt++] != ((~len >> 8) & 0xff)) |
||||
return -2; /* didn't match complement! */ |
||||
|
||||
/* copy len bytes from in to out */ |
||||
if (s->incnt + len > s->inlen) return 2; /* not enough input */ |
||||
if (s->out != NIL) { |
||||
if (s->outcnt + len > s->outlen) |
||||
return 1; /* not enough output space */ |
||||
while (len--) |
||||
s->out[s->outcnt++] = s->in[s->incnt++]; |
||||
} |
||||
else { /* just scanning */ |
||||
s->outcnt += len; |
||||
s->incnt += len; |
||||
} |
||||
|
||||
/* done with a valid stored block */ |
||||
return 0; |
||||
} |
||||
|
||||
/*
|
||||
* Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of |
||||
* each length, which for a canonical code are stepped through in order. |
||||
* symbol[] are the symbol values in canonical order, where the number of |
||||
* entries is the sum of the counts in count[]. The decoding process can be |
||||
* seen in the function decode() below. |
||||
*/ |
||||
struct huffman { |
||||
short *count; /* number of symbols of each length */ |
||||
short *symbol; /* canonically ordered symbols */ |
||||
}; |
||||
|
||||
/*
|
||||
* Decode a code from the stream s using huffman table h. Return the symbol or |
||||
* a negative value if there is an error. If all of the lengths are zero, i.e. |
||||
* an empty code, or if the code is incomplete and an invalid code is received, |
||||
* then -9 is returned after reading MAXBITS bits. |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - The codes as stored in the compressed data are bit-reversed relative to |
||||
* a simple integer ordering of codes of the same lengths. Hence below the |
||||
* bits are pulled from the compressed data one at a time and used to |
||||
* build the code value reversed from what is in the stream in order to |
||||
* permit simple integer comparisons for decoding. A table-based decoding |
||||
* scheme (as used in zlib) does not need to do this reversal. |
||||
* |
||||
* - The first code for the shortest length is all zeros. Subsequent codes of |
||||
* the same length are simply integer increments of the previous code. When |
||||
* moving up a length, a zero bit is appended to the code. For a complete |
||||
* code, the last code of the longest length will be all ones. |
||||
* |
||||
* - Incomplete codes are handled by this decoder, since they are permitted |
||||
* in the deflate format. See the format notes for fixed() and dynamic(). |
||||
*/ |
||||
#ifdef SLOW |
||||
local int decode(struct state *s, struct huffman *h) |
||||
{ |
||||
int len; /* current number of bits in code */ |
||||
int code; /* len bits being decoded */ |
||||
int first; /* first code of length len */ |
||||
int count; /* number of codes of length len */ |
||||
int index; /* index of first code of length len in symbol table */ |
||||
|
||||
code = first = index = 0; |
||||
for (len = 1; len <= MAXBITS; len++) { |
||||
code |= bits(s, 1); /* get next bit */ |
||||
count = h->count[len]; |
||||
if (code < first + count) /* if length len, return symbol */ |
||||
return h->symbol[index + (code - first)]; |
||||
index += count; /* else update for next length */ |
||||
first += count; |
||||
first <<= 1; |
||||
code <<= 1; |
||||
} |
||||
return -9; /* ran out of codes */ |
||||
} |
||||
|
||||
/*
|
||||
* A faster version of decode() for real applications of this code. It's not |
||||
* as readable, but it makes puff() twice as fast. And it only makes the code |
||||
* a few percent larger. |
||||
*/ |
||||
#else /* !SLOW */ |
||||
local int decode(struct state *s, struct huffman *h) |
||||
{ |
||||
int len; /* current number of bits in code */ |
||||
int code; /* len bits being decoded */ |
||||
int first; /* first code of length len */ |
||||
int count; /* number of codes of length len */ |
||||
int index; /* index of first code of length len in symbol table */ |
||||
int bitbuf; /* bits from stream */ |
||||
int left; /* bits left in next or left to process */ |
||||
short *next; /* next number of codes */ |
||||
|
||||
bitbuf = s->bitbuf; |
||||
left = s->bitcnt; |
||||
code = first = index = 0; |
||||
len = 1; |
||||
next = h->count + 1; |
||||
while (1) { |
||||
while (left--) { |
||||
code |= bitbuf & 1; |
||||
bitbuf >>= 1; |
||||
count = *next++; |
||||
if (code < first + count) { /* if length len, return symbol */ |
||||
s->bitbuf = bitbuf; |
||||
s->bitcnt = (s->bitcnt - len) & 7; |
||||
return h->symbol[index + (code - first)]; |
||||
} |
||||
index += count; /* else update for next length */ |
||||
first += count; |
||||
first <<= 1; |
||||
code <<= 1; |
||||
len++; |
||||
} |
||||
left = (MAXBITS+1) - len; |
||||
if (left == 0) break; |
||||
if (s->incnt == s->inlen) longjmp(s->env, 1); /* out of input */ |
||||
bitbuf = s->in[s->incnt++]; |
||||
if (left > 8) left = 8; |
||||
} |
||||
return -9; /* ran out of codes */ |
||||
} |
||||
#endif /* SLOW */ |
||||
|
||||
/*
|
||||
* Given the list of code lengths length[0..n-1] representing a canonical |
||||
* Huffman code for n symbols, construct the tables required to decode those |
||||
* codes. Those tables are the number of codes of each length, and the symbols |
||||
* sorted by length, retaining their original order within each length. The |
||||
* return value is zero for a complete code set, negative for an over- |
||||
* subscribed code set, and positive for an incomplete code set. The tables |
||||
* can be used if the return value is zero or positive, but they cannot be used |
||||
* if the return value is negative. If the return value is zero, it is not |
||||
* possible for decode() using that table to return an error--any stream of |
||||
* enough bits will resolve to a symbol. If the return value is positive, then |
||||
* it is possible for decode() using that table to return an error for received |
||||
* codes past the end of the incomplete lengths. |
||||
* |
||||
* Not used by decode(), but used for error checking, h->count[0] is the number |
||||
* of the n symbols not in the code. So n - h->count[0] is the number of |
||||
* codes. This is useful for checking for incomplete codes that have more than |
||||
* one symbol, which is an error in a dynamic block. |
||||
* |
||||
* Assumption: for all i in 0..n-1, 0 <= length[i] <= MAXBITS |
||||
* This is assured by the construction of the length arrays in dynamic() and |
||||
* fixed() and is not verified by construct(). |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - Permitted and expected examples of incomplete codes are one of the fixed |
||||
* codes and any code with a single symbol which in deflate is coded as one |
||||
* bit instead of zero bits. See the format notes for fixed() and dynamic(). |
||||
* |
||||
* - Within a given code length, the symbols are kept in ascending order for |
||||
* the code bits definition. |
||||
*/ |
||||
local int construct(struct huffman *h, short *length, int n) |
||||
{ |
||||
int symbol; /* current symbol when stepping through length[] */ |
||||
int len; /* current length when stepping through h->count[] */ |
||||
int left; /* number of possible codes left of current length */ |
||||
short offs[MAXBITS+1]; /* offsets in symbol table for each length */ |
||||
|
||||
/* count number of codes of each length */ |
||||
for (len = 0; len <= MAXBITS; len++) |
||||
h->count[len] = 0; |
||||
for (symbol = 0; symbol < n; symbol++) |
||||
(h->count[length[symbol]])++; /* assumes lengths are within bounds */ |
||||
if (h->count[0] == n) /* no codes! */ |
||||
return 0; /* complete, but decode() will fail */ |
||||
|
||||
/* check for an over-subscribed or incomplete set of lengths */ |
||||
left = 1; /* one possible code of zero length */ |
||||
for (len = 1; len <= MAXBITS; len++) { |
||||
left <<= 1; /* one more bit, double codes left */ |
||||
left -= h->count[len]; /* deduct count from possible codes */ |
||||
if (left < 0) return left; /* over-subscribed--return negative */ |
||||
} /* left > 0 means incomplete */ |
||||
|
||||
/* generate offsets into symbol table for each length for sorting */ |
||||
offs[1] = 0; |
||||
for (len = 1; len < MAXBITS; len++) |
||||
offs[len + 1] = offs[len] + h->count[len]; |
||||
|
||||
/*
|
||||
* put symbols in table sorted by length, by symbol order within each |
||||
* length |
||||
*/ |
||||
for (symbol = 0; symbol < n; symbol++) |
||||
if (length[symbol] != 0) |
||||
h->symbol[offs[length[symbol]]++] = symbol; |
||||
|
||||
/* return zero for complete set, positive for incomplete set */ |
||||
return left; |
||||
} |
||||
|
||||
/*
|
||||
* Decode literal/length and distance codes until an end-of-block code. |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - Compressed data that is after the block type if fixed or after the code |
||||
* description if dynamic is a combination of literals and length/distance |
||||
* pairs terminated by and end-of-block code. Literals are simply Huffman |
||||
* coded bytes. A length/distance pair is a coded length followed by a |
||||
* coded distance to represent a string that occurs earlier in the |
||||
* uncompressed data that occurs again at the current location. |
||||
* |
||||
* - Literals, lengths, and the end-of-block code are combined into a single |
||||
* code of up to 286 symbols. They are 256 literals (0..255), 29 length |
||||
* symbols (257..285), and the end-of-block symbol (256). |
||||
* |
||||
* - There are 256 possible lengths (3..258), and so 29 symbols are not enough |
||||
* to represent all of those. Lengths 3..10 and 258 are in fact represented |
||||
* by just a length symbol. Lengths 11..257 are represented as a symbol and |
||||
* some number of extra bits that are added as an integer to the base length |
||||
* of the length symbol. The number of extra bits is determined by the base |
||||
* length symbol. These are in the static arrays below, lens[] for the base |
||||
* lengths and lext[] for the corresponding number of extra bits. |
||||
* |
||||
* - The reason that 258 gets its own symbol is that the longest length is used |
||||
* often in highly redundant files. Note that 258 can also be coded as the |
||||
* base value 227 plus the maximum extra value of 31. While a good deflate |
||||
* should never do this, it is not an error, and should be decoded properly. |
||||
* |
||||
* - If a length is decoded, including its extra bits if any, then it is |
||||
* followed a distance code. There are up to 30 distance symbols. Again |
||||
* there are many more possible distances (1..32768), so extra bits are added |
||||
* to a base value represented by the symbol. The distances 1..4 get their |
||||
* own symbol, but the rest require extra bits. The base distances and |
||||
* corresponding number of extra bits are below in the static arrays dist[] |
||||
* and dext[]. |
||||
* |
||||
* - Literal bytes are simply written to the output. A length/distance pair is |
||||
* an instruction to copy previously uncompressed bytes to the output. The |
||||
* copy is from distance bytes back in the output stream, copying for length |
||||
* bytes. |
||||
* |
||||
* - Distances pointing before the beginning of the output data are not |
||||
* permitted. |
||||
* |
||||
* - Overlapped copies, where the length is greater than the distance, are |
||||
* allowed and common. For example, a distance of one and a length of 258 |
||||
* simply copies the last byte 258 times. A distance of four and a length of |
||||
* twelve copies the last four bytes three times. A simple forward copy |
||||
* ignoring whether the length is greater than the distance or not implements |
||||
* this correctly. You should not use memcpy() since its behavior is not |
||||
* defined for overlapped arrays. You should not use memmove() or bcopy() |
||||
* since though their behavior -is- defined for overlapping arrays, it is |
||||
* defined to do the wrong thing in this case. |
||||
*/ |
||||
local int codes(struct state *s, |
||||
struct huffman *lencode, |
||||
struct huffman *distcode) |
||||
{ |
||||
int symbol; /* decoded symbol */ |
||||
int len; /* length for copy */ |
||||
unsigned dist; /* distance for copy */ |
||||
static const short lens[29] = { /* Size base for length codes 257..285 */ |
||||
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}; |
||||
static const short lext[29] = { /* Extra bits for length codes 257..285 */ |
||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, |
||||
3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0}; |
||||
static const short dists[30] = { /* Offset base for distance codes 0..29 */ |
||||
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}; |
||||
static const short dext[30] = { /* Extra bits for distance codes 0..29 */ |
||||
0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, |
||||
7, 7, 8, 8, 9, 9, 10, 10, 11, 11, |
||||
12, 12, 13, 13}; |
||||
|
||||
/* decode literals and length/distance pairs */ |
||||
do { |
||||
symbol = decode(s, lencode); |
||||
if (symbol < 0) return symbol; /* invalid symbol */ |
||||
if (symbol < 256) { /* literal: symbol is the byte */ |
||||
/* write out the literal */ |
||||
if (s->out != NIL) { |
||||
if (s->outcnt == s->outlen) return 1; |
||||
s->out[s->outcnt] = symbol; |
||||
} |
||||
s->outcnt++; |
||||
} |
||||
else if (symbol > 256) { /* length */ |
||||
/* get and compute length */ |
||||
symbol -= 257; |
||||
if (symbol >= 29) return -9; /* invalid fixed code */ |
||||
len = lens[symbol] + bits(s, lext[symbol]); |
||||
|
||||
/* get and check distance */ |
||||
symbol = decode(s, distcode); |
||||
if (symbol < 0) return symbol; /* invalid symbol */ |
||||
dist = dists[symbol] + bits(s, dext[symbol]); |
||||
if (dist > s->outcnt) |
||||
return -10; /* distance too far back */ |
||||
|
||||
/* copy length bytes from distance bytes back */ |
||||
if (s->out != NIL) { |
||||
if (s->outcnt + len > s->outlen) return 1; |
||||
while (len--) { |
||||
s->out[s->outcnt] = s->out[s->outcnt - dist]; |
||||
s->outcnt++; |
||||
} |
||||
} |
||||
else |
||||
s->outcnt += len; |
||||
} |
||||
} while (symbol != 256); /* end of block symbol */ |
||||
|
||||
/* done with a valid fixed or dynamic block */ |
||||
return 0; |
||||
} |
||||
|
||||
/*
|
||||
* Process a fixed codes block. |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - This block type can be useful for compressing small amounts of data for |
||||
* which the size of the code descriptions in a dynamic block exceeds the |
||||
* benefit of custom codes for that block. For fixed codes, no bits are |
||||
* spent on code descriptions. Instead the code lengths for literal/length |
||||
* codes and distance codes are fixed. The specific lengths for each symbol |
||||
* can be seen in the "for" loops below. |
||||
* |
||||
* - The literal/length code is complete, but has two symbols that are invalid |
||||
* and should result in an error if received. This cannot be implemented |
||||
* simply as an incomplete code since those two symbols are in the "middle" |
||||
* of the code. They are eight bits long and the longest literal/length\
|
||||
* code is nine bits. Therefore the code must be constructed with those |
||||
* symbols, and the invalid symbols must be detected after decoding. |
||||
* |
||||
* - The fixed distance codes also have two invalid symbols that should result |
||||
* in an error if received. Since all of the distance codes are the same |
||||
* length, this can be implemented as an incomplete code. Then the invalid |
||||
* codes are detected while decoding. |
||||
*/ |
||||
local int fixed(struct state *s) |
||||
{ |
||||
static int virgin = 1; |
||||
static short lencnt[MAXBITS+1], lensym[FIXLCODES]; |
||||
static short distcnt[MAXBITS+1], distsym[MAXDCODES]; |
||||
static struct huffman lencode = {lencnt, lensym}; |
||||
static struct huffman distcode = {distcnt, distsym}; |
||||
|
||||
/* build fixed huffman tables if first call (may not be thread safe) */ |
||||
if (virgin) { |
||||
int symbol; |
||||
short lengths[FIXLCODES]; |
||||
|
||||
/* literal/length table */ |
||||
for (symbol = 0; symbol < 144; symbol++) |
||||
lengths[symbol] = 8; |
||||
for (; symbol < 256; symbol++) |
||||
lengths[symbol] = 9; |
||||
for (; symbol < 280; symbol++) |
||||
lengths[symbol] = 7; |
||||
for (; symbol < FIXLCODES; symbol++) |
||||
lengths[symbol] = 8; |
||||
construct(&lencode, lengths, FIXLCODES); |
||||
|
||||
/* distance table */ |
||||
for (symbol = 0; symbol < MAXDCODES; symbol++) |
||||
lengths[symbol] = 5; |
||||
construct(&distcode, lengths, MAXDCODES); |
||||
|
||||
/* do this just once */ |
||||
virgin = 0; |
||||
} |
||||
|
||||
/* decode data until end-of-block code */ |
||||
return codes(s, &lencode, &distcode); |
||||
} |
||||
|
||||
/*
|
||||
* Process a dynamic codes block. |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - A dynamic block starts with a description of the literal/length and |
||||
* distance codes for that block. New dynamic blocks allow the compressor to |
||||
* rapidly adapt to changing data with new codes optimized for that data. |
||||
* |
||||
* - The codes used by the deflate format are "canonical", which means that |
||||
* the actual bits of the codes are generated in an unambiguous way simply |
||||
* from the number of bits in each code. Therefore the code descriptions |
||||
* are simply a list of code lengths for each symbol. |
||||
* |
||||
* - The code lengths are stored in order for the symbols, so lengths are |
||||
* provided for each of the literal/length symbols, and for each of the |
||||
* distance symbols. |
||||
* |
||||
* - If a symbol is not used in the block, this is represented by a zero as |
||||
* as the code length. This does not mean a zero-length code, but rather |
||||
* that no code should be created for this symbol. There is no way in the |
||||
* deflate format to represent a zero-length code. |
||||
* |
||||
* - The maximum number of bits in a code is 15, so the possible lengths for |
||||
* any code are 1..15. |
||||
* |
||||
* - The fact that a length of zero is not permitted for a code has an |
||||
* interesting consequence. Normally if only one symbol is used for a given |
||||
* code, then in fact that code could be represented with zero bits. However |
||||
* in deflate, that code has to be at least one bit. So for example, if |
||||
* only a single distance base symbol appears in a block, then it will be |
||||
* represented by a single code of length one, in particular one 0 bit. This |
||||
* is an incomplete code, since if a 1 bit is received, it has no meaning, |
||||
* and should result in an error. So incomplete distance codes of one symbol |
||||
* should be permitted, and the receipt of invalid codes should be handled. |
||||
* |
||||
* - It is also possible to have a single literal/length code, but that code |
||||
* must be the end-of-block code, since every dynamic block has one. This |
||||
* is not the most efficient way to create an empty block (an empty fixed |
||||
* block is fewer bits), but it is allowed by the format. So incomplete |
||||
* literal/length codes of one symbol should also be permitted. |
||||
* |
||||
* - The list of up to 286 length/literal lengths and up to 30 distance lengths |
||||
* are themselves compressed using Huffman codes and run-length encoding. In |
||||
* the list of code lengths, a 0 symbol means no code, a 1..15 symbol means |
||||
* that length, and the symbols 16, 17, and 18 are run-length instructions. |
||||
* Each of 16, 17, and 18 are follwed by extra bits to define the length of |
||||
* the run. 16 copies the last length 3 to 6 times. 17 represents 3 to 10 |
||||
* zero lengths, and 18 represents 11 to 138 zero lengths. Unused symbols |
||||
* are common, hence the special coding for zero lengths. |
||||
* |
||||
* - The symbols for 0..18 are Huffman coded, and so that code must be |
||||
* described first. This is simply a sequence of up to 19 three-bit values |
||||
* representing no code (0) or the code length for that symbol (1..7). |
||||
* |
||||
* - A dynamic block starts with three fixed-size counts from which is computed |
||||
* the number of literal/length code lengths, the number of distance code |
||||
* lengths, and the number of code length code lengths (ok, you come up with |
||||
* a better name!) in the code descriptions. For the literal/length and |
||||
* distance codes, lengths after those provided are considered zero, i.e. no |
||||
* code. The code length code lengths are received in a permuted order (see |
||||
* the order[] array below) to make a short code length code length list more |
||||
* likely. As it turns out, very short and very long codes are less likely |
||||
* to be seen in a dynamic code description, hence what may appear initially |
||||
* to be a peculiar ordering. |
||||
* |
||||
* - Given the number of literal/length code lengths (nlen) and distance code |
||||
* lengths (ndist), then they are treated as one long list of nlen + ndist |
||||
* code lengths. Therefore run-length coding can and often does cross the |
||||
* boundary between the two sets of lengths. |
||||
* |
||||
* - So to summarize, the code description at the start of a dynamic block is |
||||
* three counts for the number of code lengths for the literal/length codes, |
||||
* the distance codes, and the code length codes. This is followed by the |
||||
* code length code lengths, three bits each. This is used to construct the |
||||
* code length code which is used to read the remainder of the lengths. Then |
||||
* the literal/length code lengths and distance lengths are read as a single |
||||
* set of lengths using the code length codes. Codes are constructed from |
||||
* the resulting two sets of lengths, and then finally you can start |
||||
* decoding actual compressed data in the block. |
||||
* |
||||
* - For reference, a "typical" size for the code description in a dynamic |
||||
* block is around 80 bytes. |
||||
*/ |
||||
local int dynamic(struct state *s) |
||||
{ |
||||
int nlen, ndist, ncode; /* number of lengths in descriptor */ |
||||
int index; /* index of lengths[] */ |
||||
int err; /* construct() return value */ |
||||
short lengths[MAXCODES]; /* descriptor code lengths */ |
||||
short lencnt[MAXBITS+1], lensym[MAXLCODES]; /* lencode memory */ |
||||
short distcnt[MAXBITS+1], distsym[MAXDCODES]; /* distcode memory */ |
||||
struct huffman lencode = {lencnt, lensym}; /* length code */ |
||||
struct huffman distcode = {distcnt, distsym}; /* distance code */ |
||||
static const short order[19] = /* permutation of code length codes */ |
||||
{16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; |
||||
|
||||
/* get number of lengths in each table, check lengths */ |
||||
nlen = bits(s, 5) + 257; |
||||
ndist = bits(s, 5) + 1; |
||||
ncode = bits(s, 4) + 4; |
||||
if (nlen > MAXLCODES || ndist > MAXDCODES) |
||||
return -3; /* bad counts */ |
||||
|
||||
/* read code length code lengths (really), missing lengths are zero */ |
||||
for (index = 0; index < ncode; index++) |
||||
lengths[order[index]] = bits(s, 3); |
||||
for (; index < 19; index++) |
||||
lengths[order[index]] = 0; |
||||
|
||||
/* build huffman table for code lengths codes (use lencode temporarily) */ |
||||
err = construct(&lencode, lengths, 19); |
||||
if (err != 0) return -4; /* require complete code set here */ |
||||
|
||||
/* read length/literal and distance code length tables */ |
||||
index = 0; |
||||
while (index < nlen + ndist) { |
||||
int symbol; /* decoded value */ |
||||
int len; /* last length to repeat */ |
||||
|
||||
symbol = decode(s, &lencode); |
||||
if (symbol < 16) /* length in 0..15 */ |
||||
lengths[index++] = symbol; |
||||
else { /* repeat instruction */ |
||||
len = 0; /* assume repeating zeros */ |
||||
if (symbol == 16) { /* repeat last length 3..6 times */ |
||||
if (index == 0) return -5; /* no last length! */ |
||||
len = lengths[index - 1]; /* last length */ |
||||
symbol = 3 + bits(s, 2); |
||||
} |
||||
else if (symbol == 17) /* repeat zero 3..10 times */ |
||||
symbol = 3 + bits(s, 3); |
||||
else /* == 18, repeat zero 11..138 times */ |
||||
symbol = 11 + bits(s, 7); |
||||
if (index + symbol > nlen + ndist) |
||||
return -6; /* too many lengths! */ |
||||
while (symbol--) /* repeat last or zero symbol times */ |
||||
lengths[index++] = len; |
||||
} |
||||
} |
||||
|
||||
/* build huffman table for literal/length codes */ |
||||
err = construct(&lencode, lengths, nlen); |
||||
if (err < 0 || (err > 0 && nlen - lencode.count[0] != 1)) |
||||
return -7; /* only allow incomplete codes if just one code */ |
||||
|
||||
/* build huffman table for distance codes */ |
||||
err = construct(&distcode, lengths + nlen, ndist); |
||||
if (err < 0 || (err > 0 && ndist - distcode.count[0] != 1)) |
||||
return -8; /* only allow incomplete codes if just one code */ |
||||
|
||||
/* decode data until end-of-block code */ |
||||
return codes(s, &lencode, &distcode); |
||||
} |
||||
|
||||
/*
|
||||
* Inflate source to dest. On return, destlen and sourcelen are updated to the |
||||
* size of the uncompressed data and the size of the deflate data respectively. |
||||
* On success, the return value of puff() is zero. If there is an error in the |
||||
* source data, i.e. it is not in the deflate format, then a negative value is |
||||
* returned. If there is not enough input available or there is not enough |
||||
* output space, then a positive error is returned. In that case, destlen and |
||||
* sourcelen are not updated to facilitate retrying from the beginning with the |
||||
* provision of more input data or more output space. In the case of invalid |
||||
* inflate data (a negative error), the dest and source pointers are updated to |
||||
* facilitate the debugging of deflators. |
||||
* |
||||
* puff() also has a mode to determine the size of the uncompressed output with |
||||
* no output written. For this dest must be (unsigned char *)0. In this case, |
||||
* the input value of *destlen is ignored, and on return *destlen is set to the |
||||
* size of the uncompressed output. |
||||
* |
||||
* The return codes are: |
||||
* |
||||
* 2: available inflate data did not terminate |
||||
* 1: output space exhausted before completing inflate |
||||
* 0: successful inflate |
||||
* -1: invalid block type (type == 3) |
||||
* -2: stored block length did not match one's complement |
||||
* -3: dynamic block code description: too many length or distance codes |
||||
* -4: dynamic block code description: code lengths codes incomplete |
||||
* -5: dynamic block code description: repeat lengths with no first length |
||||
* -6: dynamic block code description: repeat more than specified lengths |
||||
* -7: dynamic block code description: invalid literal/length code lengths |
||||
* -8: dynamic block code description: invalid distance code lengths |
||||
* -9: invalid literal/length or distance code in fixed or dynamic block |
||||
* -10: distance is too far back in fixed or dynamic block |
||||
* |
||||
* Format notes: |
||||
* |
||||
* - Three bits are read for each block to determine the kind of block and |
||||
* whether or not it is the last block. Then the block is decoded and the |
||||
* process repeated if it was not the last block. |
||||
* |
||||
* - The leftover bits in the last byte of the deflate data after the last |
||||
* block (if it was a fixed or dynamic block) are undefined and have no |
||||
* expected values to check. |
||||
*/ |
||||
int puff(unsigned char *dest, /* pointer to destination pointer */ |
||||
unsigned long *destlen, /* amount of output space */ |
||||
unsigned char *source, /* pointer to source data pointer */ |
||||
unsigned long *sourcelen) /* amount of input available */ |
||||
{ |
||||
struct state s; /* input/output state */ |
||||
int last, type; /* block information */ |
||||
int err; /* return value */ |
||||
|
||||
/* initialize output state */ |
||||
s.out = dest; |
||||
s.outlen = *destlen; /* ignored if dest is NIL */ |
||||
s.outcnt = 0; |
||||
|
||||
/* initialize input state */ |
||||
s.in = source; |
||||
s.inlen = *sourcelen; |
||||
s.incnt = 0; |
||||
s.bitbuf = 0; |
||||
s.bitcnt = 0; |
||||
|
||||
/* return if bits() or decode() tries to read past available input */ |
||||
if (setjmp(s.env) != 0) /* if came back here via longjmp() */ |
||||
err = 2; /* then skip do-loop, return error */ |
||||
else { |
||||
/* process blocks until last block or error */ |
||||
do { |
||||
last = bits(&s, 1); /* one if last block */ |
||||
type = bits(&s, 2); /* block type 0..3 */ |
||||
err = type == 0 ? stored(&s) : |
||||
(type == 1 ? fixed(&s) : |
||||
(type == 2 ? dynamic(&s) : |
||||
-1)); /* type == 3, invalid */ |
||||
if (err != 0) break; /* return with error */ |
||||
} while (!last); |
||||
} |
||||
|
||||
/* update the lengths and return */ |
||||
if (err <= 0) { |
||||
*destlen = s.outcnt; |
||||
*sourcelen = s.incnt; |
||||
} |
||||
return err; |
||||
} |
||||
|
||||
#ifdef TEST |
||||
/* Example of how to use puff() */ |
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
#include <sys/types.h> |
||||
#include <sys/stat.h> |
||||
|
||||
local unsigned char *yank(char *name, unsigned long *len) |
||||
{ |
||||
unsigned long size; |
||||
unsigned char *buf; |
||||
FILE *in; |
||||
struct stat s; |
||||
|
||||
*len = 0; |
||||
if (stat(name, &s)) return NULL; |
||||
if ((s.st_mode & S_IFMT) != S_IFREG) return NULL; |
||||
size = (unsigned long)(s.st_size); |
||||
if (size == 0 || (off_t)size != s.st_size) return NULL; |
||||
in = fopen(name, "r"); |
||||
if (in == NULL) return NULL; |
||||
buf = malloc(size); |
||||
if (buf != NULL && fread(buf, 1, size, in) != size) { |
||||
free(buf); |
||||
buf = NULL; |
||||
} |
||||
fclose(in); |
||||
*len = size;
|
||||
return buf; |
||||
} |
||||
|
||||
int main(int argc, char **argv) |
||||
{ |
||||
int ret; |
||||
unsigned char *source; |
||||
unsigned long len, sourcelen, destlen; |
||||
|
||||
if (argc < 2) return 2; |
||||
source = yank(argv[1], &len); |
||||
if (source == NULL) return 2; |
||||
sourcelen = len; |
||||
ret = puff(NIL, &destlen, source, &sourcelen); |
||||
if (ret) |
||||
printf("puff() failed with return code %d\n", ret); |
||||
else { |
||||
printf("puff() succeeded uncompressing %lu bytes\n", destlen); |
||||
if (sourcelen < len) printf("%lu compressed bytes unused\n", |
||||
len - sourcelen); |
||||
} |
||||
free(source); |
||||
return ret; |
||||
} |
||||
#endif |
||||
@ -0,0 +1,31 @@ |
||||
/* puff.h
|
||||
Copyright (C) 2002, 2003 Mark Adler, all rights reserved |
||||
version 1.7, 3 Mar 2002 |
||||
|
||||
This software is provided 'as-is', without any express or implied |
||||
warranty. In no event will the author 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. |
||||
|
||||
Mark Adler madler@alumni.caltech.edu |
||||
*/ |
||||
|
||||
|
||||
/*
|
||||
* See puff.c for purpose and usage. |
||||
*/ |
||||
int puff(unsigned char *dest, /* pointer to destination pointer */ |
||||
unsigned long *destlen, /* amount of output space */ |
||||
unsigned char *source, /* pointer to source data pointer */ |
||||
unsigned long *sourcelen); /* amount of input available */ |
||||
Binary file not shown.
@ -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 |
||||
} |
||||
}; |
||||
@ -0,0 +1,615 @@ |
||||
/* infback.c -- inflate using a call-back interface
|
||||
* Copyright (C) 1995-2003 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_stream FAR *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 == Z_NULL) { |
||||
strm->zalloc = zcalloc; |
||||
strm->opaque = (voidpf)0; |
||||
} |
||||
if (strm->zfree == Z_NULL) 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 = (voidpf)state; |
||||
state->wbits = windowBits; |
||||
state->wsize = 1U << windowBits; |
||||
state->window = window; |
||||
state->write = 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 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; \
|
||||
if (out(out_desc, put, left)) { \
|
||||
ret = Z_BUF_ERROR; \
|
||||
goto 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 called 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_stream FAR *strm; |
||||
in_func in; |
||||
void FAR *in_desc; |
||||
out_func out; |
||||
void FAR *out_desc; |
||||
{ |
||||
struct inflate_state FAR *state; |
||||
unsigned char *next, *put; /* next input and 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 *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; |
||||
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; |
||||
} |
||||
} |
||||
|
||||
/* 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(); |
||||
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) { |
||||
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 leave; |
||||
|
||||
case BAD: |
||||
ret = Z_DATA_ERROR; |
||||
goto leave; |
||||
|
||||
default: /* can't happen, but makes compilers happy */ |
||||
ret = Z_STREAM_ERROR; |
||||
goto leave; |
||||
} |
||||
|
||||
/* Return unused input */ |
||||
leave: |
||||
strm->next_in = next; |
||||
strm->avail_in = have; |
||||
return ret; |
||||
} |
||||
|
||||
int ZEXPORT inflateBackEnd(strm) |
||||
z_stream FAR *strm; |
||||
{ |
||||
struct inflate_state FAR *state; |
||||
|
||||
if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == Z_NULL) |
||||
return Z_STREAM_ERROR; |
||||
state = (struct inflate_state FAR *)strm->state; |
||||
ZFREE(strm, strm->state); |
||||
strm->state = Z_NULL; |
||||
Tracev((stderr, "inflate: end\n")); |
||||
return Z_OK; |
||||
} |
||||
@ -1,403 +0,0 @@ |
||||
/* infblock.c -- interpret and process block types to last block
|
||||
* Copyright (C) 1995-2002 Mark Adler |
||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||
*/ |
||||
|
||||
#include "zutil.h" |
||||
#include "infblock.h" |
||||
#include "inftrees.h" |
||||
#include "infcodes.h" |
||||
#include "infutil.h" |
||||
|
||||
struct inflate_codes_state {int dummy;}; /* for buggy compilers */ |
||||
|
||||
/* simplify the use of the inflate_huft type with some defines */ |
||||
#define exop word.what.Exop |
||||
#define bits word.what.Bits |
||||
|
||||
/* Table for deflate from PKZIP's appnote.txt. */ |
||||
local const uInt border[] = { /* Order of the bit length code lengths */ |
||||
16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; |
||||
|
||||
/*
|
||||
Notes beyond the 1.93a appnote.txt: |
||||
|
||||
1. Distance pointers never point before the beginning of the output |
||||
stream. |
||||
2. Distance pointers can point back across blocks, up to 32k away. |
||||
3. There is an implied maximum of 7 bits for the bit length table and |
||||
15 bits for the actual data. |
||||
4. If only one code exists, then it is encoded using one bit. (Zero |
||||
would be more efficient, but perhaps a little confusing.) If two |
||||
codes exist, they are coded using one bit each (0 and 1). |
||||
5. There is no way of sending zero distance codes--a dummy must be |
||||
sent if there are none. (History: a pre 2.0 version of PKZIP would |
||||
store blocks with no distance codes, but this was discovered to be |
||||
too harsh a criterion.) Valid only for 1.93a. 2.04c does allow |
||||
zero distance codes, which is sent as one code of zero bits in |
||||
length. |
||||
6. There are up to 286 literal/length codes. Code 256 represents the |
||||
end-of-block. Note however that the static length tree defines |
||||
288 codes just to fill out the Huffman codes. Codes 286 and 287 |
||||
cannot be used though, since there is no length base or extra bits |
||||
defined for them. Similarily, there are up to 30 distance codes. |
||||
However, static trees define 32 codes (all 5 bits) to fill out the |
||||
Huffman codes, but the last two had better not show up in the data. |
||||
7. Unzip can check dynamic Huffman blocks for complete code sets. |
||||
The exception is that a single code would not be complete (see #4). |
||||
8. The five bits following the block type is really the number of |
||||
literal codes sent minus 257. |
||||
9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits |
||||
(1+6+6). Therefore, to output three times the length, you output |
||||
three codes (1+1+1), whereas to output four times the same length, |
||||
you only need two codes (1+3). Hmm. |
||||
10. In the tree reconstruction algorithm, Code = Code + Increment |
||||
only if BitLength(i) is not zero. (Pretty obvious.) |
||||
11. Correction: 4 Bits: # of Bit Length codes - 4 (4 - 19) |
||||
12. Note: length code 284 can represent 227-258, but length code 285 |
||||
really is 258. The last length deserves its own, short code |
||||
since it gets used a lot in very redundant files. The length |
||||
258 is special since 258 - 3 (the min match length) is 255. |
||||
13. The literal/length and distance code bit lengths are read as a |
||||
single stream of lengths. It is possible (and advantageous) for |
||||
a repeat code (16, 17, or 18) to go across the boundary between |
||||
the two sets of lengths. |
||||
*/ |
||||
|
||||
|
||||
void inflate_blocks_reset(s, z, c) |
||||
inflate_blocks_statef *s; |
||||
z_streamp z; |
||||
uLongf *c; |
||||
{ |
||||
if (c != Z_NULL) |
||||
*c = s->check; |
||||
if (s->mode == BTREE || s->mode == DTREE) |
||||
ZFREE(z, s->sub.trees.blens); |
||||
if (s->mode == CODES) |
||||
inflate_codes_free(s->sub.decode.codes, z); |
||||
s->mode = TYPE; |
||||
s->bitk = 0; |
||||
s->bitb = 0; |
||||
s->read = s->write = s->window; |
||||
if (s->checkfn != Z_NULL) |
||||
z->adler = s->check = (*s->checkfn)(0L, (const Bytef *)Z_NULL, 0); |
||||
Tracev((stderr, "inflate: blocks reset\n")); |
||||
} |
||||
|
||||
|
||||
inflate_blocks_statef *inflate_blocks_new(z, c, w) |
||||
z_streamp z; |
||||
check_func c; |
||||
uInt w; |
||||
{ |
||||
inflate_blocks_statef *s; |
||||
|
||||
if ((s = (inflate_blocks_statef *)ZALLOC |
||||
(z,1,sizeof(struct inflate_blocks_state))) == Z_NULL) |
||||
return s; |
||||
if ((s->hufts = |
||||
(inflate_huft *)ZALLOC(z, sizeof(inflate_huft), MANY)) == Z_NULL) |
||||
{ |
||||
ZFREE(z, s); |
||||
return Z_NULL; |
||||
} |
||||
if ((s->window = (Bytef *)ZALLOC(z, 1, w)) == Z_NULL) |
||||
{ |
||||
ZFREE(z, s->hufts); |
||||
ZFREE(z, s); |
||||
return Z_NULL; |
||||
} |
||||
s->end = s->window + w; |
||||
s->checkfn = c; |
||||
s->mode = TYPE; |
||||
Tracev((stderr, "inflate: blocks allocated\n")); |
||||
inflate_blocks_reset(s, z, Z_NULL); |
||||
return s; |
||||
} |
||||
|
||||
|
||||
int inflate_blocks(s, z, r) |
||||
inflate_blocks_statef *s; |
||||
z_streamp z; |
||||
int r; |
||||
{ |
||||
uInt t; /* temporary storage */ |
||||
uLong b; /* bit buffer */ |
||||
uInt k; /* bits in bit buffer */ |
||||
Bytef *p; /* input data pointer */ |
||||
uInt n; /* bytes available there */ |
||||
Bytef *q; /* output window write pointer */ |
||||
uInt m; /* bytes to end of window or read pointer */ |
||||
|
||||
/* copy input/output information to locals (UPDATE macro restores) */ |
||||
LOAD |
||||
|
||||
/* process input based on current state */ |
||||
while (1) switch (s->mode) |
||||
{ |
||||
case TYPE: |
||||
NEEDBITS(3) |
||||
t = (uInt)b & 7; |
||||
s->last = t & 1; |
||||
switch (t >> 1) |
||||
{ |
||||
case 0: /* stored */ |
||||
Tracev((stderr, "inflate: stored block%s\n", |
||||
s->last ? " (last)" : "")); |
||||
DUMPBITS(3) |
||||
t = k & 7; /* go to byte boundary */ |
||||
DUMPBITS(t) |
||||
s->mode = LENS; /* get length of stored block */ |
||||
break; |
||||
case 1: /* fixed */ |
||||
Tracev((stderr, "inflate: fixed codes block%s\n", |
||||
s->last ? " (last)" : "")); |
||||
{ |
||||
uInt bl, bd; |
||||
inflate_huft *tl, *td; |
||||
|
||||
inflate_trees_fixed(&bl, &bd, &tl, &td, z); |
||||
s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z); |
||||
if (s->sub.decode.codes == Z_NULL) |
||||
{ |
||||
r = Z_MEM_ERROR; |
||||
LEAVE |
||||
} |
||||
} |
||||
DUMPBITS(3) |
||||
s->mode = CODES; |
||||
break; |
||||
case 2: /* dynamic */ |
||||
Tracev((stderr, "inflate: dynamic codes block%s\n", |
||||
s->last ? " (last)" : "")); |
||||
DUMPBITS(3) |
||||
s->mode = TABLE; |
||||
break; |
||||
case 3: /* illegal */ |
||||
DUMPBITS(3) |
||||
s->mode = BAD; |
||||
z->msg = (char*)"invalid block type"; |
||||
r = Z_DATA_ERROR; |
||||
LEAVE |
||||
} |
||||
break; |
||||
case LENS: |
||||
NEEDBITS(32) |
||||
if ((((~b) >> 16) & 0xffff) != (b & 0xffff)) |
||||
{ |
||||
s->mode = BAD; |
||||
z->msg = (char*)"invalid stored block lengths"; |
||||
r = Z_DATA_ERROR; |
||||
LEAVE |
||||
} |
||||
s->sub.left = (uInt)b & 0xffff; |
||||
b = k = 0; /* dump bits */ |
||||
Tracev((stderr, "inflate: stored length %u\n", s->sub.left)); |
||||
s->mode = s->sub.left ? STORED : (s->last ? DRY : TYPE); |
||||
break; |
||||
case STORED: |
||||
if (n == 0) |
||||
LEAVE |
||||
NEEDOUT |
||||
t = s->sub.left; |
||||
if (t > n) t = n; |
||||
if (t > m) t = m; |
||||
zmemcpy(q, p, t); |
||||
p += t; n -= t; |
||||
q += t; m -= t; |
||||
if ((s->sub.left -= t) != 0) |
||||
break; |
||||
Tracev((stderr, "inflate: stored end, %lu total out\n", |
||||
z->total_out + (q >= s->read ? q - s->read : |
||||
(s->end - s->read) + (q - s->window)))); |
||||
s->mode = s->last ? DRY : TYPE; |
||||
break; |
||||
case TABLE: |
||||
NEEDBITS(14) |
||||
s->sub.trees.table = t = (uInt)b & 0x3fff; |
||||
#ifndef PKZIP_BUG_WORKAROUND |
||||
if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29) |
||||
{ |
||||
s->mode = BAD; |
||||
z->msg = (char*)"too many length or distance symbols"; |
||||
r = Z_DATA_ERROR; |
||||
LEAVE |
||||
} |
||||
#endif |
||||
t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f); |
||||
if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL) |
||||
{ |
||||
r = Z_MEM_ERROR; |
||||
LEAVE |
||||
} |
||||
DUMPBITS(14) |
||||
s->sub.trees.index = 0; |
||||
Tracev((stderr, "inflate: table sizes ok\n")); |
||||
s->mode = BTREE; |
||||
case BTREE: |
||||
while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10)) |
||||
{ |
||||
NEEDBITS(3) |
||||
s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7; |
||||
DUMPBITS(3) |
||||
} |
||||
while (s->sub.trees.index < 19) |
||||
s->sub.trees.blens[border[s->sub.trees.index++]] = 0; |
||||
s->sub.trees.bb = 7; |
||||
t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb, |
||||
&s->sub.trees.tb, s->hufts, z); |
||||
if (t != Z_OK) |
||||
{ |
||||
r = t; |
||||
if (r == Z_DATA_ERROR) |
||||
{ |
||||
ZFREE(z, s->sub.trees.blens); |
||||
s->mode = BAD; |
||||
} |
||||
LEAVE |
||||
} |
||||
s->sub.trees.index = 0; |
||||
Tracev((stderr, "inflate: bits tree ok\n")); |
||||
s->mode = DTREE; |
||||
case DTREE: |
||||
while (t = s->sub.trees.table, |
||||
s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f)) |
||||
{ |
||||
inflate_huft *h; |
||||
uInt i, j, c; |
||||
|
||||
t = s->sub.trees.bb; |
||||
NEEDBITS(t) |
||||
h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]); |
||||
t = h->bits; |
||||
c = h->base; |
||||
if (c < 16) |
||||
{ |
||||
DUMPBITS(t) |
||||
s->sub.trees.blens[s->sub.trees.index++] = c; |
||||
} |
||||
else /* c == 16..18 */ |
||||
{ |
||||
i = c == 18 ? 7 : c - 14; |
||||
j = c == 18 ? 11 : 3; |
||||
NEEDBITS(t + i) |
||||
DUMPBITS(t) |
||||
j += (uInt)b & inflate_mask[i]; |
||||
DUMPBITS(i) |
||||
i = s->sub.trees.index; |
||||
t = s->sub.trees.table; |
||||
if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) || |
||||
(c == 16 && i < 1)) |
||||
{ |
||||
ZFREE(z, s->sub.trees.blens); |
||||
s->mode = BAD; |
||||
z->msg = (char*)"invalid bit length repeat"; |
||||
r = Z_DATA_ERROR; |
||||
LEAVE |
||||
} |
||||
c = c == 16 ? s->sub.trees.blens[i - 1] : 0; |
||||
do { |
||||
s->sub.trees.blens[i++] = c; |
||||
} while (--j); |
||||
s->sub.trees.index = i; |
||||
} |
||||
} |
||||
s->sub.trees.tb = Z_NULL; |
||||
{ |
||||
uInt bl, bd; |
||||
inflate_huft *tl, *td; |
||||
inflate_codes_statef *c; |
||||
|
||||
bl = 9; /* must be <= 9 for lookahead assumptions */ |
||||
bd = 6; /* must be <= 9 for lookahead assumptions */ |
||||
t = s->sub.trees.table; |
||||
t = inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), |
||||
s->sub.trees.blens, &bl, &bd, &tl, &td, |
||||
s->hufts, z); |
||||
if (t != Z_OK) |
||||
{ |
||||
if (t == (uInt)Z_DATA_ERROR) |
||||
{ |
||||
ZFREE(z, s->sub.trees.blens); |
||||
s->mode = BAD; |
||||
} |
||||
r = t; |
||||
LEAVE |
||||
} |
||||
Tracev((stderr, "inflate: trees ok\n")); |
||||
if ((c = inflate_codes_new(bl, bd, tl, td, z)) == Z_NULL) |
||||
{ |
||||
r = Z_MEM_ERROR; |
||||
LEAVE |
||||
} |
||||
s->sub.decode.codes = c; |
||||
} |
||||
ZFREE(z, s->sub.trees.blens); |
||||
s->mode = CODES; |
||||
case CODES: |
||||
UPDATE |
||||
if ((r = inflate_codes(s, z, r)) != Z_STREAM_END) |
||||
return inflate_flush(s, z, r); |
||||
r = Z_OK; |
||||
inflate_codes_free(s->sub.decode.codes, z); |
||||
LOAD |
||||
Tracev((stderr, "inflate: codes end, %lu total out\n", |
||||
z->total_out + (q >= s->read ? q - s->read : |
||||
(s->end - s->read) + (q - s->window)))); |
||||
if (!s->last) |
||||
{ |
||||
s->mode = TYPE; |
||||
break; |
||||
} |
||||
s->mode = DRY; |
||||
case DRY: |
||||
FLUSH |
||||
if (s->read != s->write) |
||||
LEAVE |
||||
s->mode = DONE; |
||||
case DONE: |
||||
r = Z_STREAM_END; |
||||
LEAVE |
||||
case BAD: |
||||
r = Z_DATA_ERROR; |
||||
LEAVE |
||||
default: |
||||
r = Z_STREAM_ERROR; |
||||
LEAVE |
||||
} |
||||
} |
||||
|
||||
|
||||
int inflate_blocks_free(s, z) |
||||
inflate_blocks_statef *s; |
||||
z_streamp z; |
||||
{ |
||||
inflate_blocks_reset(s, z, Z_NULL); |
||||
ZFREE(z, s->window); |
||||
ZFREE(z, s->hufts); |
||||
ZFREE(z, s); |
||||
Tracev((stderr, "inflate: blocks freed\n")); |
||||
return Z_OK; |
||||
} |
||||
|
||||
|
||||
void inflate_set_dictionary(s, d, n) |
||||
inflate_blocks_statef *s; |
||||
const Bytef *d; |
||||
uInt n; |
||||
{ |
||||
zmemcpy(s->window, d, n); |
||||
s->read = s->write = s->window + n; |
||||
} |
||||
|
||||
|
||||
/* Returns true if inflate is currently at the end of a block generated
|
||||
* by Z_SYNC_FLUSH or Z_FULL_FLUSH.
|
||||
* IN assertion: s != Z_NULL |
||||
*/ |
||||
int inflate_blocks_sync_point(s) |
||||
inflate_blocks_statef *s; |
||||
{ |
||||
return s->mode == LENS; |
||||
} |
||||
@ -1,39 +0,0 @@ |
||||
/* infblock.h -- header to use infblock.c
|
||||
* Copyright (C) 1995-2002 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. |
||||
*/ |
||||
|
||||
struct inflate_blocks_state; |
||||
typedef struct inflate_blocks_state FAR inflate_blocks_statef; |
||||
|
||||
extern inflate_blocks_statef * inflate_blocks_new OF(( |
||||
z_streamp z, |
||||
check_func c, /* check function */ |
||||
uInt w)); /* window size */ |
||||
|
||||
extern int inflate_blocks OF(( |
||||
inflate_blocks_statef *, |
||||
z_streamp , |
||||
int)); /* initial return code */ |
||||
|
||||
extern void inflate_blocks_reset OF(( |
||||
inflate_blocks_statef *, |
||||
z_streamp , |
||||
uLongf *)); /* check value on output */ |
||||
|
||||
extern int inflate_blocks_free OF(( |
||||
inflate_blocks_statef *, |
||||
z_streamp)); |
||||
|
||||
extern void inflate_set_dictionary OF(( |
||||
inflate_blocks_statef *s, |
||||
const Bytef *d, /* dictionary */ |
||||
uInt n)); /* dictionary length */ |
||||
|
||||
extern int inflate_blocks_sync_point OF(( |
||||
inflate_blocks_statef *s)); |
||||
@ -1,251 +0,0 @@ |
||||
/* infcodes.c -- process literals and length/distance pairs
|
||||
* Copyright (C) 1995-2002 Mark Adler |
||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||
*/ |
||||
|
||||
#include "zutil.h" |
||||
#include "inftrees.h" |
||||
#include "infblock.h" |
||||
#include "infcodes.h" |
||||
#include "infutil.h" |
||||
#include "inffast.h" |
||||
|
||||
/* simplify the use of the inflate_huft type with some defines */ |
||||
#define exop word.what.Exop |
||||
#define bits word.what.Bits |
||||
|
||||
typedef enum { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */ |
||||
START, /* x: set up for LEN */ |
||||
LEN, /* i: get length/literal/eob next */ |
||||
LENEXT, /* i: getting length extra (have base) */ |
||||
DIST, /* i: get distance next */ |
||||
DISTEXT, /* i: getting distance extra */ |
||||
COPY, /* o: copying bytes in window, waiting for space */ |
||||
LIT, /* o: got literal, waiting for output space */ |
||||
WASH, /* o: got eob, possibly still output waiting */ |
||||
END, /* x: got eob and all data flushed */ |
||||
BADCODE} /* x: got error */ |
||||
inflate_codes_mode; |
||||
|
||||
/* inflate codes private state */ |
||||
struct inflate_codes_state { |
||||
|
||||
/* mode */ |
||||
inflate_codes_mode mode; /* current inflate_codes mode */ |
||||
|
||||
/* mode dependent information */ |
||||
uInt len; |
||||
union { |
||||
struct { |
||||
inflate_huft *tree; /* pointer into tree */ |
||||
uInt need; /* bits needed */ |
||||
} code; /* if LEN or DIST, where in tree */ |
||||
uInt lit; /* if LIT, literal */ |
||||
struct { |
||||
uInt get; /* bits to get for extra */ |
||||
uInt dist; /* distance back to copy from */ |
||||
} copy; /* if EXT or COPY, where and how much */ |
||||
} sub; /* submode */ |
||||
|
||||
/* mode independent information */ |
||||
Byte lbits; /* ltree bits decoded per branch */ |
||||
Byte dbits; /* dtree bits decoder per branch */ |
||||
inflate_huft *ltree; /* literal/length/eob tree */ |
||||
inflate_huft *dtree; /* distance tree */ |
||||
|
||||
}; |
||||
|
||||
|
||||
inflate_codes_statef *inflate_codes_new(bl, bd, tl, td, z) |
||||
uInt bl, bd; |
||||
inflate_huft *tl; |
||||
inflate_huft *td; /* need separate declaration for Borland C++ */ |
||||
z_streamp z; |
||||
{ |
||||
inflate_codes_statef *c; |
||||
|
||||
if ((c = (inflate_codes_statef *) |
||||
ZALLOC(z,1,sizeof(struct inflate_codes_state))) != Z_NULL) |
||||
{ |
||||
c->mode = START; |
||||
c->lbits = (Byte)bl; |
||||
c->dbits = (Byte)bd; |
||||
c->ltree = tl; |
||||
c->dtree = td; |
||||
Tracev((stderr, "inflate: codes new\n")); |
||||
} |
||||
return c; |
||||
} |
||||
|
||||
|
||||
int inflate_codes(s, z, r) |
||||
inflate_blocks_statef *s; |
||||
z_streamp z; |
||||
int r; |
||||
{ |
||||
uInt j; /* temporary storage */ |
||||
inflate_huft *t; /* temporary pointer */ |
||||
uInt e; /* extra bits or operation */ |
||||
uLong b; /* bit buffer */ |
||||
uInt k; /* bits in bit buffer */ |
||||
Bytef *p; /* input data pointer */ |
||||
uInt n; /* bytes available there */ |
||||
Bytef *q; /* output window write pointer */ |
||||
uInt m; /* bytes to end of window or read pointer */ |
||||
Bytef *f; /* pointer to copy strings from */ |
||||
inflate_codes_statef *c = s->sub.decode.codes; /* codes state */ |
||||
|
||||
/* copy input/output information to locals (UPDATE macro restores) */ |
||||
LOAD |
||||
|
||||
/* process input and output based on current state */ |
||||
while (1) switch (c->mode) |
||||
{ /* waiting for "i:"=input, "o:"=output, "x:"=nothing */ |
||||
case START: /* x: set up for LEN */ |
||||
#ifndef SLOW |
||||
if (m >= 258 && n >= 10) |
||||
{ |
||||
UPDATE |
||||
r = inflate_fast(c->lbits, c->dbits, c->ltree, c->dtree, s, z); |
||||
LOAD |
||||
if (r != Z_OK) |
||||
{ |
||||
c->mode = r == Z_STREAM_END ? WASH : BADCODE; |
||||
break; |
||||
} |
||||
} |
||||
#endif /* !SLOW */ |
||||
c->sub.code.need = c->lbits; |
||||
c->sub.code.tree = c->ltree; |
||||
c->mode = LEN; |
||||
case LEN: /* i: get length/literal/eob next */ |
||||
j = c->sub.code.need; |
||||
NEEDBITS(j) |
||||
t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); |
||||
DUMPBITS(t->bits) |
||||
e = (uInt)(t->exop); |
||||
if (e == 0) /* literal */ |
||||
{ |
||||
c->sub.lit = t->base; |
||||
Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? |
||||
"inflate: literal '%c'\n" : |
||||
"inflate: literal 0x%02x\n", t->base)); |
||||
c->mode = LIT; |
||||
break; |
||||
} |
||||
if (e & 16) /* length */ |
||||
{ |
||||
c->sub.copy.get = e & 15; |
||||
c->len = t->base; |
||||
c->mode = LENEXT; |
||||
break; |
||||
} |
||||
if ((e & 64) == 0) /* next table */ |
||||
{ |
||||
c->sub.code.need = e; |
||||
c->sub.code.tree = t + t->base; |
||||
break; |
||||
} |
||||
if (e & 32) /* end of block */ |
||||
{ |
||||
Tracevv((stderr, "inflate: end of block\n")); |
||||
c->mode = WASH; |
||||
break; |
||||
} |
||||
c->mode = BADCODE; /* invalid code */ |
||||
z->msg = (char*)"invalid literal/length code"; |
||||
r = Z_DATA_ERROR; |
||||
LEAVE |
||||
case LENEXT: /* i: getting length extra (have base) */ |
||||
j = c->sub.copy.get; |
||||
NEEDBITS(j) |
||||
c->len += (uInt)b & inflate_mask[j]; |
||||
DUMPBITS(j) |
||||
c->sub.code.need = c->dbits; |
||||
c->sub.code.tree = c->dtree; |
||||
Tracevv((stderr, "inflate: length %u\n", c->len)); |
||||
c->mode = DIST; |
||||
case DIST: /* i: get distance next */ |
||||
j = c->sub.code.need; |
||||
NEEDBITS(j) |
||||
t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); |
||||
DUMPBITS(t->bits) |
||||
e = (uInt)(t->exop); |
||||
if (e & 16) /* distance */ |
||||
{ |
||||
c->sub.copy.get = e & 15; |
||||
c->sub.copy.dist = t->base; |
||||
c->mode = DISTEXT; |
||||
break; |
||||
} |
||||
if ((e & 64) == 0) /* next table */ |
||||
{ |
||||
c->sub.code.need = e; |
||||
c->sub.code.tree = t + t->base; |
||||
break; |
||||
} |
||||
c->mode = BADCODE; /* invalid code */ |
||||
z->msg = (char*)"invalid distance code"; |
||||
r = Z_DATA_ERROR; |
||||
LEAVE |
||||
case DISTEXT: /* i: getting distance extra */ |
||||
j = c->sub.copy.get; |
||||
NEEDBITS(j) |
||||
c->sub.copy.dist += (uInt)b & inflate_mask[j]; |
||||
DUMPBITS(j) |
||||
Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist)); |
||||
c->mode = COPY; |
||||
case COPY: /* o: copying bytes in window, waiting for space */ |
||||
f = q - c->sub.copy.dist; |
||||
while (f < s->window) /* modulo window size-"while" instead */ |
||||
f += s->end - s->window; /* of "if" handles invalid distances */ |
||||
while (c->len) |
||||
{ |
||||
NEEDOUT |
||||
OUTBYTE(*f++) |
||||
if (f == s->end) |
||||
f = s->window; |
||||
c->len--; |
||||
} |
||||
c->mode = START; |
||||
break; |
||||
case LIT: /* o: got literal, waiting for output space */ |
||||
NEEDOUT |
||||
OUTBYTE(c->sub.lit) |
||||
c->mode = START; |
||||
break; |
||||
case WASH: /* o: got eob, possibly more output */ |
||||
if (k > 7) /* return unused byte, if any */ |
||||
{ |
||||
Assert(k < 16, "inflate_codes grabbed too many bytes") |
||||
k -= 8; |
||||
n++; |
||||
p--; /* can always return one */ |
||||
} |
||||
FLUSH |
||||
if (s->read != s->write) |
||||
LEAVE |
||||
c->mode = END; |
||||
case END: |
||||
r = Z_STREAM_END; |
||||
LEAVE |
||||
case BADCODE: /* x: got error */ |
||||
r = Z_DATA_ERROR; |
||||
LEAVE |
||||
default: |
||||
r = Z_STREAM_ERROR; |
||||
LEAVE |
||||
} |
||||
#ifdef NEED_DUMMY_RETURN |
||||
return Z_STREAM_ERROR; /* Some dumb compilers complain without this */ |
||||
#endif |
||||
} |
||||
|
||||
|
||||
void inflate_codes_free(c, z) |
||||
inflate_codes_statef *c; |
||||
z_streamp z; |
||||
{ |
||||
ZFREE(z, c); |
||||
Tracev((stderr, "inflate: codes free\n")); |
||||
} |
||||
@ -1,27 +0,0 @@ |
||||
/* infcodes.h -- header to use infcodes.c
|
||||
* Copyright (C) 1995-2002 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. |
||||
*/ |
||||
|
||||
struct inflate_codes_state; |
||||
typedef struct inflate_codes_state FAR inflate_codes_statef; |
||||
|
||||
extern inflate_codes_statef *inflate_codes_new OF(( |
||||
uInt, uInt, |
||||
inflate_huft *, inflate_huft *, |
||||
z_streamp )); |
||||
|
||||
extern int inflate_codes OF(( |
||||
inflate_blocks_statef *, |
||||
z_streamp , |
||||
int)); |
||||
|
||||
extern void inflate_codes_free OF(( |
||||
inflate_codes_statef *, |
||||
z_streamp )); |
||||
|
||||
@ -1,183 +1,298 @@ |
||||
/* inffast.c -- process literals and length/distance pairs fast
|
||||
* Copyright (C) 1995-2002 Mark Adler |
||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||
/* inffast.c -- fast decoding
|
||||
* Copyright (C) 1995-2003 Mark Adler |
||||
* For conditions of distribution and use, see copyright notice in zlib.h |
||||
*/ |
||||
|
||||
#include "zutil.h" |
||||
#include "inftrees.h" |
||||
#include "infblock.h" |
||||
#include "infcodes.h" |
||||
#include "infutil.h" |
||||
#include "inflate.h" |
||||
#include "inffast.h" |
||||
|
||||
struct inflate_codes_state {int dummy;}; /* for buggy compilers */ |
||||
/* 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) |
||||
*/ |
||||
#ifdef POSTINC |
||||
# define OFF 0 |
||||
# define PUP(a) *(a)++ |
||||
#else |
||||
# define OFF 1 |
||||
# define PUP(a) *++(a) |
||||
#endif |
||||
|
||||
/* simplify the use of the inflate_huft type with some defines */ |
||||
#define exop word.what.Exop |
||||
#define bits word.what.Bits |
||||
/*
|
||||
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. |
||||
|
||||
/* macros for bit input with no checking and for returning unused bytes */ |
||||
#define GRABBITS(j) {while(k<(j)){b|=((uLong)NEXTBYTE)<<k;k+=8;}} |
||||
#define UNGRAB {c=z->avail_in-n;c=(k>>3)<c?k>>3:c;n+=c;p-=c;k-=c<<3;} |
||||
Entry assumptions: |
||||
|
||||
/* Called with number of bytes left to write in window at least 258
|
||||
(the maximum string length) and number of input bytes available |
||||
at least ten. The ten bytes are six bytes for the longest length/ |
||||
distance pair plus four bytes for overloading the bit buffer. */ |
||||
state->mode == LEN |
||||
strm->avail_in >= 6 |
||||
strm->avail_out >= 258 |
||||
start >= strm->avail_out |
||||
state->bits < 8 |
||||
|
||||
int inflate_fast(bl, bd, tl, td, s, z) |
||||
uInt bl, bd; |
||||
inflate_huft *tl; |
||||
inflate_huft *td; /* need separate declaration for Borland C++ */ |
||||
inflate_blocks_statef *s; |
||||
z_streamp z; |
||||
{ |
||||
inflate_huft *t; /* temporary pointer */ |
||||
uInt e; /* extra bits or operation */ |
||||
uLong b; /* bit buffer */ |
||||
uInt k; /* bits in bit buffer */ |
||||
Bytef *p; /* input data pointer */ |
||||
uInt n; /* bytes available there */ |
||||
Bytef *q; /* output window write pointer */ |
||||
uInt m; /* bytes to end of window or read pointer */ |
||||
uInt ml; /* mask for literal/length tree */ |
||||
uInt md; /* mask for distance tree */ |
||||
uInt c; /* bytes to copy */ |
||||
uInt d; /* distance back to copy from */ |
||||
Bytef *r; /* copy source pointer */ |
||||
On return, state->mode is one of: |
||||
|
||||
/* load input, output, bit values */ |
||||
LOAD |
||||
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 |
||||
|
||||
/* initialize masks */ |
||||
ml = inflate_mask[bl]; |
||||
md = inflate_mask[bd]; |
||||
Notes: |
||||
|
||||
/* do until not enough input or output space for fast loop */ |
||||
do { /* assume called with m >= 258 && n >= 10 */ |
||||
/* get literal/length code */ |
||||
GRABBITS(20) /* max bits for literal/length code */ |
||||
if ((e = (t = tl + ((uInt)b & ml))->exop) == 0) |
||||
{ |
||||
DUMPBITS(t->bits) |
||||
Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? |
||||
"inflate: * literal '%c'\n" : |
||||
"inflate: * literal 0x%02x\n", t->base)); |
||||
*q++ = (Byte)t->base; |
||||
m--; |
||||
continue; |
||||
} |
||||
do { |
||||
DUMPBITS(t->bits) |
||||
if (e & 16) |
||||
{ |
||||
/* get extra bits for length */ |
||||
e &= 15; |
||||
c = t->base + ((uInt)b & inflate_mask[e]); |
||||
DUMPBITS(e) |
||||
Tracevv((stderr, "inflate: * length %u\n", c)); |
||||
- 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 */ |
||||
unsigned wsize; /* window size or zero if not using 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 */ |
||||
|
||||
/* decode distance base of block to copy */ |
||||
GRABBITS(15); /* max bits for distance code */ |
||||
e = (t = td + ((uInt)b & md))->exop; |
||||
do { |
||||
DUMPBITS(t->bits) |
||||
if (e & 16) |
||||
{ |
||||
/* get extra bits to add to distance base */ |
||||
e &= 15; |
||||
GRABBITS(e) /* get extra bits (up to 13) */ |
||||
d = t->base + ((uInt)b & inflate_mask[e]); |
||||
DUMPBITS(e) |
||||
Tracevv((stderr, "inflate: * distance %u\n", d)); |
||||
/* 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); |
||||
wsize = state->wsize; |
||||
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; |
||||
|
||||
/* do the copy */ |
||||
m -= c; |
||||
r = q - d; |
||||
if (r < s->window) /* wrap if needed */ |
||||
{ |
||||
do { |
||||
r += s->end - s->window; /* force pointer in window */ |
||||
} while (r < s->window); /* covers invalid distances */ |
||||
e = s->end - r; |
||||
if (c > e) |
||||
{ |
||||
c -= e; /* wrapped copy */ |
||||
do { |
||||
*q++ = *r++; |
||||
} while (--e); |
||||
r = s->window; |
||||
do { |
||||
*q++ = *r++; |
||||
} while (--c); |
||||
} |
||||
else /* normal copy */ |
||||
{ |
||||
*q++ = *r++; c--; |
||||
*q++ = *r++; c--; |
||||
do { |
||||
*q++ = *r++; |
||||
} while (--c); |
||||
} |
||||
/* 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 += 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; |
||||
} |
||||
else /* normal copy */ |
||||
{ |
||||
*q++ = *r++; c--; |
||||
*q++ = *r++; c--; |
||||
do { |
||||
*q++ = *r++; |
||||
} while (--c); |
||||
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 += hold & ((1U << op) - 1); |
||||
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 */ |
||||
if (dist > wsize) { |
||||
strm->msg = (char *)"invalid distance too far back"; |
||||
state->mode = BAD; |
||||
break; |
||||
} |
||||
from = window - OFF; |
||||
op = dist - op; /* distance back in window */ |
||||
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 if ((e & 64) == 0) |
||||
{ |
||||
t += t->base; |
||||
e = (t += ((uInt)b & inflate_mask[e]))->exop; |
||||
} |
||||
else |
||||
{ |
||||
z->msg = (char*)"invalid distance code"; |
||||
UNGRAB |
||||
UPDATE |
||||
return Z_DATA_ERROR; |
||||
} |
||||
} while (1); |
||||
break; |
||||
} |
||||
if ((e & 64) == 0) |
||||
{ |
||||
t += t->base; |
||||
if ((e = (t += ((uInt)b & inflate_mask[e]))->exop) == 0) |
||||
{ |
||||
DUMPBITS(t->bits) |
||||
Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? |
||||
"inflate: * literal '%c'\n" : |
||||
"inflate: * literal 0x%02x\n", t->base)); |
||||
*q++ = (Byte)t->base; |
||||
m--; |
||||
break; |
||||
} |
||||
} |
||||
else if (e & 32) |
||||
{ |
||||
Tracevv((stderr, "inflate: * end of block\n")); |
||||
UNGRAB |
||||
UPDATE |
||||
return Z_STREAM_END; |
||||
} |
||||
else |
||||
{ |
||||
z->msg = (char*)"invalid literal/length code"; |
||||
UNGRAB |
||||
UPDATE |
||||
return Z_DATA_ERROR; |
||||
} |
||||
} while (1); |
||||
} while (m >= 258 && n >= 10); |
||||
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; |
||||
|
||||
/* not enough input or output--restore pointers and return */ |
||||
UNGRAB |
||||
UPDATE |
||||
return Z_OK; |
||||
/* 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 |
||||
*/ |
||||
|
||||
@ -1,151 +1,94 @@ |
||||
/* inffixed.h -- table for decoding fixed codes
|
||||
* Generated automatically by the maketree.c program |
||||
*/ |
||||
/* 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. |
||||
*/ |
||||
/* 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. |
||||
*/ |
||||
|
||||
local uInt fixed_bl = 9; |
||||
local uInt fixed_bd = 5; |
||||
local inflate_huft fixed_tl[] = { |
||||
{{{96,7}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115}, |
||||
{{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},192}, |
||||
{{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},160}, |
||||
{{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},224}, |
||||
{{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},144}, |
||||
{{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},208}, |
||||
{{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},176}, |
||||
{{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},240}, |
||||
{{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227}, |
||||
{{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},200}, |
||||
{{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},168}, |
||||
{{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},232}, |
||||
{{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},152}, |
||||
{{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},216}, |
||||
{{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},184}, |
||||
{{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},248}, |
||||
{{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163}, |
||||
{{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},196}, |
||||
{{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},164}, |
||||
{{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},228}, |
||||
{{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},148}, |
||||
{{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},212}, |
||||
{{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},180}, |
||||
{{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},244}, |
||||
{{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0}, |
||||
{{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},204}, |
||||
{{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},172}, |
||||
{{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},236}, |
||||
{{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},156}, |
||||
{{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},220}, |
||||
{{{82,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}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131}, |
||||
{{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},194}, |
||||
{{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},162}, |
||||
{{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},226}, |
||||
{{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},146}, |
||||
{{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},210}, |
||||
{{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},178}, |
||||
{{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},242}, |
||||
{{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258}, |
||||
{{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},202}, |
||||
{{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},170}, |
||||
{{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},234}, |
||||
{{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},154}, |
||||
{{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},218}, |
||||
{{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},186}, |
||||
{{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},250}, |
||||
{{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195}, |
||||
{{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},198}, |
||||
{{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},166}, |
||||
{{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},230}, |
||||
{{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},150}, |
||||
{{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},214}, |
||||
{{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},182}, |
||||
{{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},246}, |
||||
{{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0}, |
||||
{{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},206}, |
||||
{{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},174}, |
||||
{{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},238}, |
||||
{{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},158}, |
||||
{{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},222}, |
||||
{{{82,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}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115}, |
||||
{{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},193}, |
||||
{{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},161}, |
||||
{{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},225}, |
||||
{{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},145}, |
||||
{{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},209}, |
||||
{{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},177}, |
||||
{{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},241}, |
||||
{{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227}, |
||||
{{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},201}, |
||||
{{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},169}, |
||||
{{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},233}, |
||||
{{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},153}, |
||||
{{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},217}, |
||||
{{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},185}, |
||||
{{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},249}, |
||||
{{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163}, |
||||
{{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},197}, |
||||
{{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},165}, |
||||
{{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},229}, |
||||
{{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},149}, |
||||
{{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},213}, |
||||
{{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},181}, |
||||
{{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},245}, |
||||
{{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0}, |
||||
{{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},205}, |
||||
{{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},173}, |
||||
{{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},237}, |
||||
{{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},157}, |
||||
{{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},221}, |
||||
{{{82,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}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131}, |
||||
{{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},195}, |
||||
{{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},163}, |
||||
{{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},227}, |
||||
{{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},147}, |
||||
{{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},211}, |
||||
{{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},179}, |
||||
{{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},243}, |
||||
{{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258}, |
||||
{{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},203}, |
||||
{{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},171}, |
||||
{{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},235}, |
||||
{{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},155}, |
||||
{{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},219}, |
||||
{{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},187}, |
||||
{{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},251}, |
||||
{{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195}, |
||||
{{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},199}, |
||||
{{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},167}, |
||||
{{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},231}, |
||||
{{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},151}, |
||||
{{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},215}, |
||||
{{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},183}, |
||||
{{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},247}, |
||||
{{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0}, |
||||
{{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},207}, |
||||
{{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},175}, |
||||
{{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},239}, |
||||
{{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},159}, |
||||
{{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},223}, |
||||
{{{82,7}},27}, {{{0,8}},111}, {{{0,8}},47}, {{{0,9}},191}, |
||||
{{{0,8}},15}, {{{0,8}},143}, {{{0,8}},79}, {{{0,9}},255} |
||||
}; |
||||
local inflate_huft fixed_td[] = { |
||||
{{{80,5}},1}, {{{87,5}},257}, {{{83,5}},17}, {{{91,5}},4097}, |
||||
{{{81,5}},5}, {{{89,5}},1025}, {{{85,5}},65}, {{{93,5}},16385}, |
||||
{{{80,5}},3}, {{{88,5}},513}, {{{84,5}},33}, {{{92,5}},8193}, |
||||
{{{82,5}},9}, {{{90,5}},2049}, {{{86,5}},129}, {{{192,5}},24577}, |
||||
{{{80,5}},2}, {{{87,5}},385}, {{{83,5}},25}, {{{91,5}},6145}, |
||||
{{{81,5}},7}, {{{89,5}},1537}, {{{85,5}},97}, {{{93,5}},24577}, |
||||
{{{80,5}},4}, {{{88,5}},769}, {{{84,5}},49}, {{{92,5}},12289}, |
||||
{{{82,5}},13}, {{{90,5}},3073}, {{{86,5}},193}, {{{192,5}},24577} |
||||
}; |
||||
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} |
||||
}; |
||||
|
||||
@ -0,0 +1,115 @@ |
||||
/* inflate.h -- internal inflate state definition
|
||||
* 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. |
||||
*/ |
||||
|
||||
/* define NO_GUNZIP when compiling if you want to disable gzip header and
|
||||
trailer decoding by inflate(). NO_GUNZIP 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_GUNZIP |
||||
# define GUNZIP |
||||
#endif |
||||
|
||||
/* Possible inflate modes between inflate() calls */ |
||||
typedef enum { |
||||
HEAD, /* i: waiting for magic header */ |
||||
#ifdef GUNZIP |
||||
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) */ |
||||
#endif |
||||
DICTID, /* i: waiting for dictionary check value */ |
||||
DICT, /* waiting for inflateSetDictionary() call */ |
||||
TYPE, /* i: waiting for type bits, including last-flag bit */ |
||||
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 */ |
||||
#ifdef GUNZIP |
||||
LENGTH, /* i: waiting for 32-bit length (gzip) */ |
||||
#endif |
||||
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; /* true to process header and trailer */ |
||||
int havedict; /* true if dictionary provided */ |
||||
int flags; /* gzip header method and flags (0 if zlib) */ |
||||
unsigned long check; /* protected copy of check value */ |
||||
unsigned long total; /* protected copy of output count */ |
||||
/* sliding window */ |
||||
unsigned wbits; /* log base 2 of requested window size */ |
||||
unsigned wsize; /* window size or zero if not using 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 */ |
||||
}; |
||||
@ -1,454 +1,321 @@ |
||||
/* inftrees.c -- generate Huffman trees for efficient decoding
|
||||
* Copyright (C) 1995-2002 Mark Adler |
||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||
* Copyright (C) 1995-2003 Mark Adler |
||||
* For conditions of distribution and use, see copyright notice in zlib.h |
||||
*/ |
||||
|
||||
#include "zutil.h" |
||||
#include "inftrees.h" |
||||
|
||||
#if !defined(BUILDFIXED) && !defined(STDC) |
||||
# define BUILDFIXED /* non ANSI compilers may not accept inffixed.h */ |
||||
#endif |
||||
#define MAXBITS 15 |
||||
|
||||
const char inflate_copyright[] = |
||||
" inflate 1.1.4 Copyright 1995-2002 Mark Adler "; |
||||
" inflate 1.2.0 Copyright 1995-2003 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. |
||||
*/ |
||||
struct internal_state {int dummy;}; /* for buggy compilers */ |
||||
|
||||
/* simplify the use of the inflate_huft type with some defines */ |
||||
#define exop word.what.Exop |
||||
#define bits word.what.Bits |
||||
|
||||
|
||||
local int huft_build OF(( |
||||
uIntf *, /* code lengths in bits */ |
||||
uInt, /* number of codes */ |
||||
uInt, /* number of "simple" codes */ |
||||
const uIntf *, /* list of base values for non-simple codes */ |
||||
const uIntf *, /* list of extra bits for non-simple codes */ |
||||
inflate_huft * FAR*,/* result: starting table */ |
||||
uIntf *, /* maximum lookup bits (returns actual) */ |
||||
inflate_huft *, /* space for trees */ |
||||
uInt *, /* hufts used in space */ |
||||
uIntf * )); /* space for values */ |
||||
|
||||
/* Tables for deflate from PKZIP's appnote.txt. */ |
||||
local const uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */ |
||||
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}; |
||||
/* see note #13 above about 258 */ |
||||
local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */ |
||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, |
||||
3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112}; /* 112==invalid */ |
||||
local const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */ |
||||
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}; |
||||
local const uInt cpdext[30] = { /* Extra bits for distance codes */ |
||||
0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, |
||||
7, 7, 8, 8, 9, 9, 10, 10, 11, 11, |
||||
12, 12, 13, 13}; |
||||
|
||||
/*
|
||||
Huffman code decoding is performed using a multi-level table lookup. |
||||
The fastest way to decode is to simply build a lookup table whose |
||||
size is determined by the longest code. However, the time it takes |
||||
to build this table can also be a factor if the data being decoded |
||||
is not very long. The most common codes are necessarily the |
||||
shortest codes, so those codes dominate the decoding time, and hence |
||||
the speed. The idea is you can have a shorter table that decodes the |
||||
shorter, more probable codes, and then point to subsidiary tables for |
||||
the longer codes. The time it costs to decode the longer codes is |
||||
then traded against the time it takes to make longer tables. |
||||
|
||||
This results of this trade are in the variables lbits and dbits |
||||
below. lbits is the number of bits the first level table for literal/ |
||||
length codes can decode in one step, and dbits is the same thing for |
||||
the distance codes. Subsequent tables are also less than or equal to |
||||
those sizes. These values may be adjusted either when all of the |
||||
codes are shorter than that, in which case the longest code length in |
||||
bits is used, or when the shortest code is *longer* than the requested |
||||
table size, in which case the length of the shortest code in bits is |
||||
used. |
||||
|
||||
There are two different values for the two tables, since they code a |
||||
different number of possibilities each. The literal/length table |
||||
codes 286 possible values, or in a flat code, a little over eight |
||||
bits. The distance table codes 30 possible values, or a little less |
||||
than five bits, flat. The optimum values for speed end up being |
||||
about one bit more than those, so lbits is 8+1 and dbits is 5+1. |
||||
The optimum values may differ though from machine to machine, and |
||||
possibly even between compilers. Your mileage may vary. |
||||
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. |
||||
*/ |
||||
|
||||
|
||||
/* If BMAX needs to be larger than 16, then h and x[] should be uLong. */ |
||||
#define BMAX 15 /* maximum bit length of any code */ |
||||
|
||||
local int huft_build(b, n, s, d, e, t, m, hp, hn, v) |
||||
uIntf *b; /* code lengths in bits (all assumed <= BMAX) */ |
||||
uInt n; /* number of codes (assumed <= 288) */ |
||||
uInt s; /* number of simple-valued codes (0..s-1) */ |
||||
const uIntf *d; /* list of base values for non-simple codes */ |
||||
const uIntf *e; /* list of extra bits for non-simple codes */ |
||||
inflate_huft * FAR *t; /* result: starting table */ |
||||
uIntf *m; /* maximum lookup bits, returns actual */ |
||||
inflate_huft *hp; /* space for trees */ |
||||
uInt *hn; /* hufts used in space */ |
||||
uIntf *v; /* working area: values in order of bit length */ |
||||
/* Given a list of code lengths and a maximum table size, make a set of
|
||||
tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR |
||||
if the given code set is incomplete (the tables are still built in this |
||||
case), or Z_DATA_ERROR if the input is invalid. */ |
||||
int inflate_table(type, lens, codes, table, bits, work) |
||||
codetype type; |
||||
unsigned short FAR *lens; |
||||
unsigned codes; |
||||
code * FAR *table; |
||||
unsigned *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 *base; /* base value table to use */ |
||||
const unsigned short *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, 73, 194}; |
||||
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) return -1; /* no codes! */ |
||||
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 || (codes - count[0] != 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; |
||||
} |
||||
|
||||
uInt a; /* counter for codes of length k */ |
||||
uInt c[BMAX+1]; /* bit length count table */ |
||||
uInt f; /* i repeats in table every f entries */ |
||||
int g; /* maximum code length */ |
||||
int h; /* table level */ |
||||
register uInt i; /* counter, current code */ |
||||
register uInt j; /* counter */ |
||||
register int k; /* number of bits in current code */ |
||||
int l; /* bits per table (returned in m) */ |
||||
uInt mask; /* (1 << w) - 1, to avoid cc -O bug on HP */ |
||||
register uIntf *p; /* pointer into c[], b[], or v[] */ |
||||
inflate_huft *q; /* points to current table */ |
||||
struct inflate_huft_s r; /* table entry for structure assignment */ |
||||
inflate_huft *u[BMAX]; /* table stack */ |
||||
register int w; /* bits before this table == (l * h) */ |
||||
uInt x[BMAX+1]; /* bit offsets, then code stack */ |
||||
uIntf *xp; /* pointer into x */ |
||||
int y; /* number of dummy codes added */ |
||||
uInt z; /* number of entries in current table */ |
||||
|
||||
|
||||
/* Generate counts for each bit length */ |
||||
p = c; |
||||
#define C0 *p++ = 0; |
||||
#define C2 C0 C0 C0 C0 |
||||
#define C4 C2 C2 C2 C2 |
||||
C4 /* clear c[]--assume BMAX+1 is 16 */ |
||||
p = b; i = n; |
||||
do { |
||||
c[*p++]++; /* assume all entries <= BMAX */ |
||||
} while (--i); |
||||
if (c[0] == n) /* null input--all zero length codes */ |
||||
{ |
||||
*t = (inflate_huft *)Z_NULL; |
||||
*m = 0; |
||||
return Z_OK; |
||||
} |
||||
|
||||
|
||||
/* Find minimum and maximum length, bound *m by those */ |
||||
l = *m; |
||||
for (j = 1; j <= BMAX; j++) |
||||
if (c[j]) |
||||
break; |
||||
k = j; /* minimum code length */ |
||||
if ((uInt)l < j) |
||||
l = j; |
||||
for (i = BMAX; i; i--) |
||||
if (c[i]) |
||||
break; |
||||
g = i; /* maximum code length */ |
||||
if ((uInt)l > i) |
||||
l = i; |
||||
*m = l; |
||||
|
||||
|
||||
/* Adjust last length count to fill out codes, if needed */ |
||||
for (y = 1 << j; j < i; j++, y <<= 1) |
||||
if ((y -= c[j]) < 0) |
||||
return Z_DATA_ERROR; |
||||
if ((y -= c[i]) < 0) |
||||
return Z_DATA_ERROR; |
||||
c[i] += y; |
||||
|
||||
|
||||
/* Generate starting offsets into the value table for each length */ |
||||
x[1] = j = 0; |
||||
p = c + 1; xp = x + 2; |
||||
while (--i) { /* note that i == g from above */ |
||||
*xp++ = (j += *p++); |
||||
} |
||||
|
||||
|
||||
/* Make a table of values in order of bit lengths */ |
||||
p = b; i = 0; |
||||
do { |
||||
if ((j = *p++) != 0) |
||||
v[x[j]++] = i; |
||||
} while (++i < n); |
||||
n = x[g]; /* set n to length of v */ |
||||
|
||||
|
||||
/* Generate the Huffman codes and for each, make the table entries */ |
||||
x[0] = i = 0; /* first Huffman code is zero */ |
||||
p = v; /* grab values in bit order */ |
||||
h = -1; /* no tables yet--level -1 */ |
||||
w = -l; /* bits decoded == (l * h) */ |
||||
u[0] = (inflate_huft *)Z_NULL; /* just to keep compilers happy */ |
||||
q = (inflate_huft *)Z_NULL; /* ditto */ |
||||
z = 0; /* ditto */ |
||||
|
||||
/* go through the bit lengths (k already is bits in shortest code) */ |
||||
for (; k <= g; k++) |
||||
{ |
||||
a = c[k]; |
||||
while (a--) |
||||
{ |
||||
/* here i is the Huffman code of length k bits for value *p */ |
||||
/* make tables up to required level */ |
||||
while (k > w + l) |
||||
{ |
||||
h++; |
||||
w += l; /* previous table always l bits */ |
||||
|
||||
/* compute minimum size table less than or equal to l bits */ |
||||
z = g - w; |
||||
z = z > (uInt)l ? l : z; /* table size upper limit */ |
||||
if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */ |
||||
{ /* too few codes for k-w bit table */ |
||||
f -= a + 1; /* deduct codes from patterns left */ |
||||
xp = c + k; |
||||
if (j < z) |
||||
while (++j < z) /* try smaller tables up to z bits */ |
||||
{ |
||||
if ((f <<= 1) <= *++xp) |
||||
break; /* enough codes to use up j bits */ |
||||
f -= *xp; /* else deduct codes from patterns */ |
||||
} |
||||
/* 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]; |
||||
} |
||||
z = 1 << j; /* table entries for j-bit table */ |
||||
|
||||
/* allocate new table */ |
||||
if (*hn + z > MANY) /* (note: doesn't matter for fixed) */ |
||||
return Z_DATA_ERROR; /* overflow of MANY */ |
||||
u[h] = q = hp + *hn; |
||||
*hn += z; |
||||
|
||||
/* connect to last table, if there is one */ |
||||
if (h) |
||||
{ |
||||
x[h] = i; /* save pattern for backing up */ |
||||
r.bits = (Byte)l; /* bits to dump before this table */ |
||||
r.exop = (Byte)j; /* bits in this table */ |
||||
j = i >> (w - l); |
||||
r.base = (uInt)(q - u[h-1] - j); /* offset to this table */ |
||||
u[h-1][j] = r; /* connect to last table */ |
||||
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; |
||||
} |
||||
else |
||||
*t = q; /* first table is returned result */ |
||||
} |
||||
|
||||
/* set up table entry in r */ |
||||
r.bits = (Byte)(k - w); |
||||
if (p >= v + n) |
||||
r.exop = 128 + 64; /* out of values--invalid code */ |
||||
else if (*p < s) |
||||
{ |
||||
r.exop = (Byte)(*p < 256 ? 0 : 32 + 64); /* 256 is end-of-block */ |
||||
r.base = *p++; /* simple code is just the value */ |
||||
} |
||||
else |
||||
{ |
||||
r.exop = (Byte)(e[*p - s] + 16 + 64);/* non-simple--look up in lists */ |
||||
r.base = d[*p++ - s]; |
||||
} |
||||
|
||||
/* fill code-like entries with r */ |
||||
f = 1 << (k - w); |
||||
for (j = i >> w; j < z; j += f) |
||||
q[j] = r; |
||||
|
||||
/* backwards increment the k-bit code i */ |
||||
for (j = 1 << (k - 1); i & j; j >>= 1) |
||||
i ^= j; |
||||
i ^= j; |
||||
|
||||
/* backup over finished tables */ |
||||
mask = (1 << w) - 1; /* needed on HP, cc -O bug */ |
||||
while ((i & mask) != x[h]) |
||||
{ |
||||
h--; /* don't need to update q */ |
||||
w -= l; |
||||
mask = (1 << w) - 1; |
||||
} |
||||
} |
||||
} |
||||
|
||||
|
||||
/* Return Z_BUF_ERROR if we were given an incomplete table */ |
||||
return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK; |
||||
} |
||||
/* replicate for those indices with low len bits equal to huff */ |
||||
incr = 1U << (len - drop); |
||||
fill = 1U << curr; |
||||
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]]; |
||||
} |
||||
|
||||
int inflate_trees_bits(c, bb, tb, hp, z) |
||||
uIntf *c; /* 19 code lengths */ |
||||
uIntf *bb; /* bits tree desired/actual depth */ |
||||
inflate_huft * FAR *tb; /* bits tree result */ |
||||
inflate_huft *hp; /* space for trees */ |
||||
z_streamp z; /* for messages */ |
||||
{ |
||||
int r; |
||||
uInt hn = 0; /* hufts used in space */ |
||||
uIntf *v; /* work area for huft_build */ |
||||
|
||||
if ((v = (uIntf*)ZALLOC(z, 19, sizeof(uInt))) == Z_NULL) |
||||
return Z_MEM_ERROR; |
||||
r = huft_build(c, 19, 19, (uIntf*)Z_NULL, (uIntf*)Z_NULL, |
||||
tb, bb, hp, &hn, v); |
||||
if (r == Z_DATA_ERROR) |
||||
z->msg = (char*)"oversubscribed dynamic bit lengths tree"; |
||||
else if (r == Z_BUF_ERROR || *bb == 0) |
||||
{ |
||||
z->msg = (char*)"incomplete dynamic bit lengths tree"; |
||||
r = Z_DATA_ERROR; |
||||
} |
||||
ZFREE(z, v); |
||||
return r; |
||||
} |
||||
/* 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 += 1U << 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; |
||||
|
||||
int inflate_trees_dynamic(nl, nd, c, bl, bd, tl, td, hp, z) |
||||
uInt nl; /* number of literal/length codes */ |
||||
uInt nd; /* number of distance codes */ |
||||
uIntf *c; /* that many (total) code lengths */ |
||||
uIntf *bl; /* literal desired/actual bit depth */ |
||||
uIntf *bd; /* distance desired/actual bit depth */ |
||||
inflate_huft * FAR *tl; /* literal/length tree result */ |
||||
inflate_huft * FAR *td; /* distance tree result */ |
||||
inflate_huft *hp; /* space for trees */ |
||||
z_streamp z; /* for messages */ |
||||
{ |
||||
int r; |
||||
uInt hn = 0; /* hufts used in space */ |
||||
uIntf *v; /* work area for huft_build */ |
||||
|
||||
/* allocate work area */ |
||||
if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL) |
||||
return Z_MEM_ERROR; |
||||
|
||||
/* build literal/length tree */ |
||||
r = huft_build(c, nl, 257, cplens, cplext, tl, bl, hp, &hn, v); |
||||
if (r != Z_OK || *bl == 0) |
||||
{ |
||||
if (r == Z_DATA_ERROR) |
||||
z->msg = (char*)"oversubscribed literal/length tree"; |
||||
else if (r != Z_MEM_ERROR) |
||||
{ |
||||
z->msg = (char*)"incomplete literal/length tree"; |
||||
r = Z_DATA_ERROR; |
||||
} |
||||
ZFREE(z, v); |
||||
return r; |
||||
} |
||||
|
||||
/* build distance tree */ |
||||
r = huft_build(c + nl, nd, 0, cpdist, cpdext, td, bd, hp, &hn, v); |
||||
if (r != Z_OK || (*bd == 0 && nl > 257)) |
||||
{ |
||||
if (r == Z_DATA_ERROR) |
||||
z->msg = (char*)"oversubscribed distance tree"; |
||||
else if (r == Z_BUF_ERROR) { |
||||
#ifdef PKZIP_BUG_WORKAROUND |
||||
r = Z_OK; |
||||
} |
||||
#else |
||||
z->msg = (char*)"incomplete distance tree"; |
||||
r = Z_DATA_ERROR; |
||||
} |
||||
else if (r != Z_MEM_ERROR) |
||||
{ |
||||
z->msg = (char*)"empty distance tree with lengths"; |
||||
r = Z_DATA_ERROR; |
||||
/* 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); |
||||
} |
||||
} |
||||
ZFREE(z, v); |
||||
return r; |
||||
#endif |
||||
} |
||||
|
||||
/* done */ |
||||
ZFREE(z, v); |
||||
return Z_OK; |
||||
} |
||||
|
||||
/*
|
||||
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; |
||||
curr = root; |
||||
this.bits = (unsigned char)len; |
||||
} |
||||
|
||||
/* put invalid code marker in table */ |
||||
next[huff >> drop] = this; |
||||
|
||||
/* build fixed tables only once--keep them here */ |
||||
#ifdef BUILDFIXED |
||||
local int fixed_built = 0; |
||||
#define FIXEDH 544 /* number of hufts used by fixed tables */ |
||||
local inflate_huft fixed_mem[FIXEDH]; |
||||
local uInt fixed_bl; |
||||
local uInt fixed_bd; |
||||
local inflate_huft *fixed_tl; |
||||
local inflate_huft *fixed_td; |
||||
#else |
||||
#include "inffixed.h" |
||||
#endif |
||||
|
||||
|
||||
int inflate_trees_fixed(bl, bd, tl, td, z) |
||||
uIntf *bl; /* literal desired/actual bit depth */ |
||||
uIntf *bd; /* distance desired/actual bit depth */ |
||||
inflate_huft * FAR *tl; /* literal/length tree result */ |
||||
inflate_huft * FAR *td; /* distance tree result */ |
||||
z_streamp z; /* for memory allocation */ |
||||
{ |
||||
#ifdef BUILDFIXED |
||||
/* build fixed tables if not already */ |
||||
if (!fixed_built) |
||||
{ |
||||
int k; /* temporary variable */ |
||||
uInt f = 0; /* number of hufts used in fixed_mem */ |
||||
uIntf *c; /* length list for huft_build */ |
||||
uIntf *v; /* work area for huft_build */ |
||||
|
||||
/* allocate memory */ |
||||
if ((c = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL) |
||||
return Z_MEM_ERROR; |
||||
if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL) |
||||
{ |
||||
ZFREE(z, c); |
||||
return Z_MEM_ERROR; |
||||
/* 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; |
||||
} |
||||
|
||||
/* literal table */ |
||||
for (k = 0; k < 144; k++) |
||||
c[k] = 8; |
||||
for (; k < 256; k++) |
||||
c[k] = 9; |
||||
for (; k < 280; k++) |
||||
c[k] = 7; |
||||
for (; k < 288; k++) |
||||
c[k] = 8; |
||||
fixed_bl = 9; |
||||
huft_build(c, 288, 257, cplens, cplext, &fixed_tl, &fixed_bl, |
||||
fixed_mem, &f, v); |
||||
|
||||
/* distance table */ |
||||
for (k = 0; k < 30; k++) |
||||
c[k] = 5; |
||||
fixed_bd = 5; |
||||
huft_build(c, 30, 0, cpdist, cpdext, &fixed_td, &fixed_bd, |
||||
fixed_mem, &f, v); |
||||
|
||||
/* done */ |
||||
ZFREE(z, v); |
||||
ZFREE(z, c); |
||||
fixed_built = 1; |
||||
} |
||||
#endif |
||||
*bl = fixed_bl; |
||||
*bd = fixed_bd; |
||||
*tl = fixed_tl; |
||||
*td = fixed_td; |
||||
return Z_OK; |
||||
/* set return parameters */ |
||||
*table += used; |
||||
*bits = root; |
||||
return 0; |
||||
} |
||||
|
||||
@ -1,87 +0,0 @@ |
||||
/* inflate_util.c -- data and routines common to blocks and codes
|
||||
* Copyright (C) 1995-2002 Mark Adler |
||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||
*/ |
||||
|
||||
#include "zutil.h" |
||||
#include "infblock.h" |
||||
#include "inftrees.h" |
||||
#include "infcodes.h" |
||||
#include "infutil.h" |
||||
|
||||
struct inflate_codes_state {int dummy;}; /* for buggy compilers */ |
||||
|
||||
/* And'ing with mask[n] masks the lower n bits */ |
||||
uInt inflate_mask[17] = { |
||||
0x0000, |
||||
0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, |
||||
0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff |
||||
}; |
||||
|
||||
|
||||
/* copy as much as possible from the sliding window to the output area */ |
||||
int inflate_flush(s, z, r) |
||||
inflate_blocks_statef *s; |
||||
z_streamp z; |
||||
int r; |
||||
{ |
||||
uInt n; |
||||
Bytef *p; |
||||
Bytef *q; |
||||
|
||||
/* local copies of source and destination pointers */ |
||||
p = z->next_out; |
||||
q = s->read; |
||||
|
||||
/* compute number of bytes to copy as far as end of window */ |
||||
n = (uInt)((q <= s->write ? s->write : s->end) - q); |
||||
if (n > z->avail_out) n = z->avail_out; |
||||
if (n && r == Z_BUF_ERROR) r = Z_OK; |
||||
|
||||
/* update counters */ |
||||
z->avail_out -= n; |
||||
z->total_out += n; |
||||
|
||||
/* update check information */ |
||||
if (s->checkfn != Z_NULL) |
||||
z->adler = s->check = (*s->checkfn)(s->check, q, n); |
||||
|
||||
/* copy as far as end of window */ |
||||
zmemcpy(p, q, n); |
||||
p += n; |
||||
q += n; |
||||
|
||||
/* see if more to copy at beginning of window */ |
||||
if (q == s->end) |
||||
{ |
||||
/* wrap pointers */ |
||||
q = s->window; |
||||
if (s->write == s->end) |
||||
s->write = s->window; |
||||
|
||||
/* compute bytes to copy */ |
||||
n = (uInt)(s->write - q); |
||||
if (n > z->avail_out) n = z->avail_out; |
||||
if (n && r == Z_BUF_ERROR) r = Z_OK; |
||||
|
||||
/* update counters */ |
||||
z->avail_out -= n; |
||||
z->total_out += n; |
||||
|
||||
/* update check information */ |
||||
if (s->checkfn != Z_NULL) |
||||
z->adler = s->check = (*s->checkfn)(s->check, q, n); |
||||
|
||||
/* copy */ |
||||
zmemcpy(p, q, n); |
||||
p += n; |
||||
q += n; |
||||
} |
||||
|
||||
/* update pointers */ |
||||
z->next_out = p; |
||||
s->read = q; |
||||
|
||||
/* done */ |
||||
return r; |
||||
} |
||||
@ -1,98 +0,0 @@ |
||||
/* infutil.h -- types and macros common to blocks and codes
|
||||
* Copyright (C) 1995-2002 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. |
||||
*/ |
||||
|
||||
#ifndef _INFUTIL_H |
||||
#define _INFUTIL_H |
||||
|
||||
typedef enum { |
||||
TYPE, /* get type bits (3, including end bit) */ |
||||
LENS, /* get lengths for stored */ |
||||
STORED, /* processing stored block */ |
||||
TABLE, /* get table lengths */ |
||||
BTREE, /* get bit lengths tree for a dynamic block */ |
||||
DTREE, /* get length, distance trees for a dynamic block */ |
||||
CODES, /* processing fixed or dynamic block */ |
||||
DRY, /* output remaining window bytes */ |
||||
DONE, /* finished last block, done */ |
||||
BAD} /* got a data error--stuck here */ |
||||
inflate_block_mode; |
||||
|
||||
/* inflate blocks semi-private state */ |
||||
struct inflate_blocks_state { |
||||
|
||||
/* mode */ |
||||
inflate_block_mode mode; /* current inflate_block mode */ |
||||
|
||||
/* mode dependent information */ |
||||
union { |
||||
uInt left; /* if STORED, bytes left to copy */ |
||||
struct { |
||||
uInt table; /* table lengths (14 bits) */ |
||||
uInt index; /* index into blens (or border) */ |
||||
uIntf *blens; /* bit lengths of codes */ |
||||
uInt bb; /* bit length tree depth */ |
||||
inflate_huft *tb; /* bit length decoding tree */ |
||||
} trees; /* if DTREE, decoding info for trees */ |
||||
struct { |
||||
inflate_codes_statef
|
||||
*codes; |
||||
} decode; /* if CODES, current state */ |
||||
} sub; /* submode */ |
||||
uInt last; /* true if this block is the last block */ |
||||
|
||||
/* mode independent information */ |
||||
uInt bitk; /* bits in bit buffer */ |
||||
uLong bitb; /* bit buffer */ |
||||
inflate_huft *hufts; /* single malloc for tree space */ |
||||
Bytef *window; /* sliding window */ |
||||
Bytef *end; /* one byte after sliding window */ |
||||
Bytef *read; /* window read pointer */ |
||||
Bytef *write; /* window write pointer */ |
||||
check_func checkfn; /* check function */ |
||||
uLong check; /* check on output */ |
||||
|
||||
}; |
||||
|
||||
|
||||
/* defines for inflate input/output */ |
||||
/* update pointers and return */ |
||||
#define UPDBITS {s->bitb=b;s->bitk=k;} |
||||
#define UPDIN {z->avail_in=n;z->total_in+=p-z->next_in;z->next_in=p;} |
||||
#define UPDOUT {s->write=q;} |
||||
#define UPDATE {UPDBITS UPDIN UPDOUT} |
||||
#define LEAVE {UPDATE return inflate_flush(s,z,r);} |
||||
/* get bytes and bits */ |
||||
#define LOADIN {p=z->next_in;n=z->avail_in;b=s->bitb;k=s->bitk;} |
||||
#define NEEDBYTE {if(n)r=Z_OK;else LEAVE} |
||||
#define NEXTBYTE (n--,*p++) |
||||
#define NEEDBITS(j) {while(k<(j)){NEEDBYTE;b|=((uLong)NEXTBYTE)<<k;k+=8;}} |
||||
#define DUMPBITS(j) {b>>=(j);k-=(j);} |
||||
/* output bytes */ |
||||
#define WAVAIL (uInt)(q<s->read?s->read-q-1:s->end-q) |
||||
#define LOADOUT {q=s->write;m=(uInt)WAVAIL;} |
||||
#define WRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}} |
||||
#define FLUSH {UPDOUT r=inflate_flush(s,z,r); LOADOUT} |
||||
#define NEEDOUT {if(m==0){WRAP if(m==0){FLUSH WRAP if(m==0) LEAVE}}r=Z_OK;} |
||||
#define OUTBYTE(a) {*q++=(Byte)(a);m--;} |
||||
/* load local pointers */ |
||||
#define LOAD {LOADIN LOADOUT} |
||||
|
||||
/* masks for lower bits (size given to avoid silly warnings with Visual C++) */ |
||||
extern uInt inflate_mask[17]; |
||||
|
||||
/* copy as much as possible from the sliding window to the output area */ |
||||
extern int inflate_flush OF(( |
||||
inflate_blocks_statef *, |
||||
z_streamp , |
||||
int)); |
||||
|
||||
struct internal_state {int dummy;}; /* for buggy compilers */ |
||||
|
||||
#endif |
||||
@ -1,85 +0,0 @@ |
||||
/* maketree.c -- make inffixed.h table for decoding fixed codes
|
||||
* Copyright (C) 1995-2002 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. |
||||
*/ |
||||
|
||||
/* This program is included in the distribution for completeness.
|
||||
You do not need to compile or run this program since inffixed.h |
||||
is already included in the distribution. To use this program |
||||
you need to compile zlib with BUILDFIXED defined and then compile |
||||
and link this program with the zlib library. Then the output of |
||||
this program can be piped to inffixed.h. */ |
||||
|
||||
#include <stdio.h> |
||||
#include <stdlib.h> |
||||
#include "zutil.h" |
||||
#include "inftrees.h" |
||||
|
||||
/* simplify the use of the inflate_huft type with some defines */ |
||||
#define exop word.what.Exop |
||||
#define bits word.what.Bits |
||||
|
||||
/* generate initialization table for an inflate_huft structure array */ |
||||
void maketree(uInt b, inflate_huft *t) |
||||
{ |
||||
int i, e; |
||||
|
||||
i = 0; |
||||
while (1) |
||||
{ |
||||
e = t[i].exop; |
||||
if (e && (e & (16+64)) == 0) /* table pointer */ |
||||
{ |
||||
fprintf(stderr, "maketree: cannot initialize sub-tables!\n"); |
||||
exit(1); |
||||
} |
||||
if (i % 4 == 0) |
||||
printf("\n "); |
||||
printf(" {{{%u,%u}},%u}", t[i].exop, t[i].bits, t[i].base); |
||||
if (++i == (1<<b)) |
||||
break; |
||||
putchar(','); |
||||
} |
||||
puts(""); |
||||
} |
||||
|
||||
/* create the fixed tables in C initialization syntax */ |
||||
void main(void) |
||||
{ |
||||
int r; |
||||
uInt bl, bd; |
||||
inflate_huft *tl, *td; |
||||
z_stream z; |
||||
|
||||
z.zalloc = zcalloc; |
||||
z.opaque = (voidpf)0; |
||||
z.zfree = zcfree; |
||||
r = inflate_trees_fixed(&bl, &bd, &tl, &td, &z); |
||||
if (r) |
||||
{ |
||||
fprintf(stderr, "inflate_trees_fixed error %d\n", r); |
||||
return; |
||||
} |
||||
puts("/* inffixed.h -- table for decoding fixed codes"); |
||||
puts(" * Generated automatically by the maketree.c program"); |
||||
puts(" */"); |
||||
puts(""); |
||||
puts("/* WARNING: this file should *not* be used by applications. It is"); |
||||
puts(" part of the implementation of the compression library and is"); |
||||
puts(" subject to change. Applications should only use zlib.h."); |
||||
puts(" */"); |
||||
puts(""); |
||||
printf("local uInt fixed_bl = %d;\n", bl); |
||||
printf("local uInt fixed_bd = %d;\n", bd); |
||||
printf("local inflate_huft fixed_tl[] = {"); |
||||
maketree(bl, tl); |
||||
puts(" };"); |
||||
printf("local inflate_huft fixed_td[] = {"); |
||||
maketree(bd, td); |
||||
puts(" };"); |
||||
} |
||||
@ -0,0 +1,3 @@ |
||||
This directory contains files that have not been updated for zlib 1.2.0. |
||||
|
||||
(Volunteers are encouraged to help clean this up. Thanks.) |
||||
@ -0,0 +1,280 @@ |
||||
/* zconf.h -- configuration of the zlib compression library
|
||||
* Copyright (C) 1995-2003 Jean-loup Gailly. |
||||
* For conditions of distribution and use, see copyright notice in zlib.h |
||||
*/ |
||||
|
||||
/* @(#) $Id$ */ |
||||
|
||||
#ifndef _ZCONF_H |
||||
#define _ZCONF_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 inflateInit2_ z_inflateInit2_ |
||||
# define inflateSetDictionary z_inflateSetDictionary |
||||
# define inflateSync z_inflateSync |
||||
# define inflateSyncPoint z_inflateSyncPoint |
||||
# define inflateCopy z_inflateCopy |
||||
# define inflateReset z_inflateReset |
||||
# 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 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(_WIN32) || defined(__WIN32__)) && !defined(WIN32) |
||||
# define WIN32 |
||||
#endif |
||||
#if defined(__GNUC__) || defined(WIN32) || defined(__386__) || defined(i386) |
||||
# ifndef __32BIT__ |
||||
# define __32BIT__ |
||||
# endif |
||||
#endif |
||||
#if defined(__MSDOS__) && !defined(MSDOS) |
||||
# define MSDOS |
||||
#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). |
||||
*/ |
||||
#if defined(MSDOS) && !defined(__32BIT__) |
||||
# define MAXSEG_64K |
||||
#endif |
||||
#ifdef MSDOS |
||||
# define UNALIGNED_OK |
||||
#endif |
||||
|
||||
#if (defined(MSDOS) || defined(_WINDOWS) || defined(WIN32)) && !defined(STDC) |
||||
# define STDC |
||||
#endif |
||||
#if defined(__STDC__) || defined(__cplusplus) || defined(__OS2__) |
||||
# ifndef STDC |
||||
# define STDC |
||||
# endif |
||||
#endif |
||||
|
||||
#if defined __HOS_AIX__ |
||||
# ifndef STDC |
||||
# define STDC |
||||
# endif |
||||
#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 |
||||
|
||||
/* Old Borland C incorrectly complains about missing returns: */ |
||||
#if defined(__BORLANDC__) && (__BORLANDC__ < 0x500) |
||||
# define NEED_DUMMY_RETURN |
||||
#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. |
||||
*/ |
||||
#if (defined(M_I86SM) || defined(M_I86MM)) && !defined(__32BIT__) |
||||
/* MSC small or medium model */ |
||||
# define SMALL_MEDIUM |
||||
# ifdef _MSC_VER |
||||
# define FAR _far |
||||
# else |
||||
# define FAR far |
||||
# endif |
||||
#endif |
||||
#if defined(__BORLANDC__) && (defined(__SMALL__) || defined(__MEDIUM__)) |
||||
# ifndef __32BIT__ |
||||
# define SMALL_MEDIUM |
||||
# define FAR _far |
||||
# endif |
||||
#endif |
||||
|
||||
/* Compile with -DZLIB_DLL for Windows DLL support */ |
||||
#if defined(ZLIB_DLL) |
||||
# if defined(_WINDOWS) || defined(WINDOWS) |
||||
# ifdef FAR |
||||
# undef FAR |
||||
# endif |
||||
# include <windows.h> |
||||
# define ZEXPORT WINAPI |
||||
# ifdef WIN32 |
||||
# define ZEXPORTVA WINAPIV |
||||
# else |
||||
# define ZEXPORTVA FAR _cdecl _export |
||||
# endif |
||||
# endif |
||||
# if defined (__BORLANDC__) |
||||
# if (__BORLANDC__ >= 0x0500) && defined (WIN32) |
||||
# include <windows.h> |
||||
# define ZEXPORT __declspec(dllexport) WINAPI |
||||
# define ZEXPORTRVA __declspec(dllexport) WINAPIV |
||||
# else |
||||
# if defined (_Windows) && defined (__DLL__) |
||||
# define ZEXPORT _export |
||||
# define ZEXPORTVA _export |
||||
# endif |
||||
# endif |
||||
# endif |
||||
#endif |
||||
|
||||
#if defined (__BEOS__) |
||||
# if defined (ZLIB_DLL) |
||||
# define ZEXTERN extern __declspec(dllexport) |
||||
# else |
||||
# define ZEXTERN extern __declspec(dllimport) |
||||
# endif |
||||
#endif |
||||
|
||||
#ifndef ZEXPORT |
||||
# define ZEXPORT |
||||
#endif |
||||
#ifndef ZEXPORTVA |
||||
# define ZEXPORTVA |
||||
#endif |
||||
#ifndef ZEXTERN |
||||
# define ZEXTERN extern |
||||
#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 */ |
||||
# 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 |
||||
|
||||
/* 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 */ |
||||
Loading…
Reference in new issue