Compare commits
5 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
6b834a58bd | ||
|
|
bdde4e09d2 | ||
|
|
1c71d8b13b | ||
|
|
64b2e89203 | ||
|
|
4ca984fb44 |
48
ChangeLog
48
ChangeLog
@@ -1,9 +1,53 @@
|
|||||||
ChangeLog file for zlib
|
ChangeLog file for zlib
|
||||||
|
|
||||||
Changes in 0.79 (28 April 95)
|
Changes in 0.93 (25 June 95)
|
||||||
- add fast inflate (inffast.c)
|
- temporarily disable inline functions
|
||||||
|
- make deflate deterministic
|
||||||
|
- give enough lookahead for PARTIAL_FLUSH
|
||||||
|
- Set binary mode for stdin/stdout in minigzip.c for OS/2
|
||||||
|
- don't even use signed char in inflate (not portable enough)
|
||||||
|
- fix inflate memory leak for segmented architectures
|
||||||
|
|
||||||
|
Changes in 0.92 (3 May 95)
|
||||||
|
- don't assume that char is signed (problem on SGI)
|
||||||
|
- Clear bit buffer when starting a stored block
|
||||||
|
- no memcpy on Pyramid
|
||||||
|
- suppressed inftest.c
|
||||||
|
- optimized fill_window, put longest_match inline for gcc
|
||||||
|
- optimized inflate on stored blocks.
|
||||||
|
- untabify all sources to simplify patches
|
||||||
|
|
||||||
|
Changes in 0.91 (2 May 95)
|
||||||
|
- Default MEM_LEVEL is 8 (not 9 for Unix) as documented in zlib.h
|
||||||
|
- Document the memory requirements in zconf.h
|
||||||
|
- added "make install"
|
||||||
|
- fix sync search logic in inflateSync
|
||||||
|
- deflate(Z_FULL_FLUSH) now works even if output buffer too short
|
||||||
|
- after inflateSync, don't scare people with just "lo world"
|
||||||
|
- added support for DJGPP
|
||||||
|
|
||||||
|
Changes in 0.9 (1 May 95)
|
||||||
|
- don't assume that zalloc clears the allocated memory (the TurboC bug
|
||||||
|
was Mark's bug after all :)
|
||||||
|
- let again gzread copy uncompressed data unchanged (was working in 0.71)
|
||||||
|
- deflate(Z_FULL_FLUSH), inflateReset and inflateSync are now fully implemented
|
||||||
|
- added a test of inflateSync in example.c
|
||||||
|
- moved MAX_WBITS to zconf.h because users might want to change that.
|
||||||
|
- document explicitly that zalloc(64K) on MSDOS must return a normalized
|
||||||
|
pointer (zero offset)
|
||||||
|
- added Makefiles for Microsoft C, Turbo C, Borland C++
|
||||||
|
- faster crc32()
|
||||||
|
|
||||||
|
Changes in 0.8 (29 April 95)
|
||||||
|
- added fast inflate (inffast.c)
|
||||||
|
- deflate(Z_FINISH) now returns Z_STREAM_END when done. Warning: this
|
||||||
|
is incompatible with previous versions of zlib which returned Z_OK.
|
||||||
|
- work around a TurboC compiler bug (bad code for b << 0, see infutil.h)
|
||||||
|
(actually that was not a compiler bug, see 0.81 above)
|
||||||
|
- gzread no longer reads one extra byte in certain cases
|
||||||
- In gzio destroy(), don't reference a freed structure
|
- In gzio destroy(), don't reference a freed structure
|
||||||
- avoid many warnings for MSDOS
|
- avoid many warnings for MSDOS
|
||||||
|
- avoid the ERROR symbol which is used by MS Windows
|
||||||
|
|
||||||
Changes in 0.71 (14 April 95)
|
Changes in 0.71 (14 April 95)
|
||||||
- Fixed more MSDOS compilation problems :( There is still a bug with
|
- Fixed more MSDOS compilation problems :( There is still a bug with
|
||||||
|
|||||||
30
Makefile
30
Makefile
@@ -1,21 +1,37 @@
|
|||||||
|
# Makefile for zlib
|
||||||
|
# Copyright (C) 1995 Jean-loup Gailly.
|
||||||
|
# For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
|
|
||||||
CC=cc
|
CC=cc
|
||||||
CFLAGS=-O
|
CFLAGS=-O
|
||||||
|
#use -O3 for gcc to take advantage of inlining
|
||||||
|
#CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
|
||||||
#CFLAGS=-g -DDEBUG
|
#CFLAGS=-g -DDEBUG
|
||||||
LDFLAGS=-L. -lgz
|
LDFLAGS=-L. -lgz
|
||||||
|
|
||||||
RANLIB=ranlib
|
RANLIB=ranlib
|
||||||
|
|
||||||
|
prefix=/usr/local
|
||||||
|
|
||||||
OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
|
OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
|
||||||
zutil.o inflate.o infblock.o inftrees.o infcodes.o infutil.o inffast.o
|
zutil.o inflate.o infblock.o inftrees.o infcodes.o infutil.o inffast.o
|
||||||
|
|
||||||
TEST_OBJS = example.o minigzip.o inftest.o
|
TEST_OBJS = example.o minigzip.o
|
||||||
|
|
||||||
all: example minigzip inftest
|
all: example minigzip
|
||||||
|
|
||||||
test: all
|
test: all
|
||||||
./example
|
./example
|
||||||
echo hello world | ./minigzip | ./minigzip -d
|
echo hello world | ./minigzip | ./minigzip -d
|
||||||
|
|
||||||
|
install: libgz.a
|
||||||
|
-@mkdir $(prefix)/include
|
||||||
|
-@mkdir $(prefix)/lib
|
||||||
|
cp zlib.h zconf.h $(prefix)/include
|
||||||
|
chmod 644 $(prefix)/include/zlib.h $(prefix)/include/zconf.h
|
||||||
|
cp libgz.a $(prefix)/lib
|
||||||
|
chmod 644 $(prefix)/lib/libgz.a
|
||||||
|
|
||||||
libgz.a: $(OBJS)
|
libgz.a: $(OBJS)
|
||||||
ar rc $@ $(OBJS)
|
ar rc $@ $(OBJS)
|
||||||
$(RANLIB) $@
|
$(RANLIB) $@
|
||||||
@@ -26,18 +42,15 @@ example: example.o libgz.a
|
|||||||
minigzip: minigzip.o libgz.a
|
minigzip: minigzip.o libgz.a
|
||||||
$(CC) $(CFLAGS) -o $@ minigzip.o $(LDFLAGS)
|
$(CC) $(CFLAGS) -o $@ minigzip.o $(LDFLAGS)
|
||||||
|
|
||||||
inftest: inftest.o libgz.a
|
|
||||||
$(CC) $(CFLAGS) -o $@ inftest.o $(LDFLAGS)
|
|
||||||
|
|
||||||
clean:
|
clean:
|
||||||
rm -f *.o example minigzip inftest libgz.a foo.gz
|
rm -f *.o example minigzip libgz.a foo.gz
|
||||||
|
|
||||||
zip:
|
zip:
|
||||||
zip -ul9 zlib README ChangeLog Makefile *.[ch]
|
zip -ul9 zlib README ChangeLog Makefile Makefile.??? Makefile.?? *.[ch]
|
||||||
|
|
||||||
tgz:
|
tgz:
|
||||||
cd ..; tar cfz zlib/zlib.tgz zlib/README zlib/ChangeLog zlib/Makefile \
|
cd ..; tar cfz zlib/zlib.tgz zlib/README zlib/ChangeLog zlib/Makefile \
|
||||||
zlib/*.[ch]
|
zlib/Makefile.??? zlib/Makefile.?? zlib/*.[ch]
|
||||||
|
|
||||||
# DO NOT DELETE THIS LINE -- make depend depends on it.
|
# DO NOT DELETE THIS LINE -- make depend depends on it.
|
||||||
|
|
||||||
@@ -51,7 +64,6 @@ infblock.o: zutil.h zlib.h zconf.h infblock.h inftrees.h infcodes.h infutil.h
|
|||||||
infcodes.o: zutil.h zlib.h zconf.h inftrees.h infutil.h infcodes.h inffast.h
|
infcodes.o: zutil.h zlib.h zconf.h inftrees.h infutil.h infcodes.h inffast.h
|
||||||
inffast.o: zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
|
inffast.o: zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
|
||||||
inflate.o: zutil.h zlib.h zconf.h infblock.h
|
inflate.o: zutil.h zlib.h zconf.h infblock.h
|
||||||
inftest.o: zutil.h zlib.h zconf.h
|
|
||||||
inftrees.o: zutil.h zlib.h zconf.h inftrees.h
|
inftrees.o: zutil.h zlib.h zconf.h inftrees.h
|
||||||
infutil.o: zutil.h zlib.h zconf.h inftrees.h infutil.h
|
infutil.o: zutil.h zlib.h zconf.h inftrees.h infutil.h
|
||||||
minigzip.o: zlib.h zconf.h
|
minigzip.o: zlib.h zconf.h
|
||||||
|
|||||||
101
Makefile.bor
Normal file
101
Makefile.bor
Normal file
@@ -0,0 +1,101 @@
|
|||||||
|
# Makefile for zlib
|
||||||
|
# Borland C++ ************ UNTESTED ***********
|
||||||
|
|
||||||
|
# To use, do "make -fmakefile.bor"
|
||||||
|
|
||||||
|
# WARNING: the small model is supported but only for small values of
|
||||||
|
# MAX_WBITS and MAX_MEM_LEVEL. If you wish to reduce the memory
|
||||||
|
# requirements (default 256K for big objects plus a few K), you can add
|
||||||
|
# to CFLAGS below: -DMAX_MEM_LEVEL=7 -DMAX_WBITS=14
|
||||||
|
# See zconf.h for details about the memory requirements.
|
||||||
|
|
||||||
|
# ------------- Turbo C++, Borland C++ -------------
|
||||||
|
MODEL=-ml
|
||||||
|
CFLAGS=-O2 -Z $(MODEL)
|
||||||
|
CC=bcc
|
||||||
|
LD=bcc
|
||||||
|
LIB=tlib
|
||||||
|
# replace bcc with tcc for Turbo C++ 1.0
|
||||||
|
LDFLAGS=$(MODEL)
|
||||||
|
O=.obj
|
||||||
|
|
||||||
|
# variables
|
||||||
|
OBJ1 = adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) \
|
||||||
|
trees$(O)
|
||||||
|
OBJP1 = adler32$(O)+compress$(O)+crc32$(O)+gzio$(O)+uncompr$(O)+deflate$(O)+\
|
||||||
|
trees$(O)
|
||||||
|
OBJ2 = zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) \
|
||||||
|
infutil$(O) inffast$(O)
|
||||||
|
OBJP2 = zutil$(O)+inflate$(O)+infblock$(O)+inftrees$(O)+infcodes$(O)+\
|
||||||
|
infutil$(O)+inffast$(O)
|
||||||
|
|
||||||
|
all: test
|
||||||
|
|
||||||
|
adler32.obj: adler32.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
compress.obj: compress.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
crc32.obj: crc32.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
gzio.obj: gzio.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
infblock.obj: infblock.c zutil.h zlib.h zconf.h infblock.h inftrees.h\
|
||||||
|
infcodes.h infutil.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
infcodes.obj: infcodes.c zutil.h zlib.h zconf.h inftrees.h infutil.h\
|
||||||
|
infcodes.h inffast.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
inflate.obj: inflate.c zutil.h zlib.h zconf.h infblock.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
infutil.obj: infutil.c zutil.h zlib.h zconf.h inftrees.h infutil.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
trees.obj: trees.c deflate.h zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
uncompr.obj: uncompr.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
zutil.obj: zutil.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
example.obj: example.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
minigzip.obj: minigzip.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
# we must cut the command line to fit in the MS/DOS 128 byte limit:
|
||||||
|
zlib.lib: $(OBJ1) $(OBJ2)
|
||||||
|
$(LIB) zlib +$(OBJP1)
|
||||||
|
$(LIB) zlib +$(OBJP2)
|
||||||
|
|
||||||
|
example.exe: example.obj zlib.lib
|
||||||
|
$(LD) $(LDFLAGS) example.obj zlib.lib
|
||||||
|
|
||||||
|
minigzip.exe: minigzip.obj zlib.lib
|
||||||
|
$(LD) $(LDFLAGS) minigzip.obj zlib.lib
|
||||||
|
|
||||||
|
test: example.exe minigzip.exe
|
||||||
|
example
|
||||||
|
echo hello world | minigzip | minigzip -d
|
||||||
|
|
||||||
|
#clean:
|
||||||
|
# del *.obj
|
||||||
|
# del *.exe
|
||||||
98
Makefile.msc
Normal file
98
Makefile.msc
Normal file
@@ -0,0 +1,98 @@
|
|||||||
|
# Makefile for zlib
|
||||||
|
# Microsoft C 5.1 or later
|
||||||
|
|
||||||
|
# To use, do "make makefile.msc"
|
||||||
|
|
||||||
|
# WARNING: the small model is supported but only for small values of
|
||||||
|
# MAX_WBITS and MAX_MEM_LEVEL. If you wish to reduce the memory
|
||||||
|
# requirements (default 256K for big objects plus a few K), you can add
|
||||||
|
# to CFLAGS below: -DMAX_MEM_LEVEL=7 -DMAX_WBITS=14
|
||||||
|
# See zconf.h for details about the memory requirements.
|
||||||
|
|
||||||
|
# ------------- Microsoft C 5.1 and later -------------
|
||||||
|
MODEL=-AL
|
||||||
|
CFLAGS=-Oait -Gs -nologo -W3 $(MODEL)
|
||||||
|
#-Ox generates bad code with MSC 5.1
|
||||||
|
CC=cl
|
||||||
|
LD=link
|
||||||
|
LDFLAGS=/e/st:0x1000/noe
|
||||||
|
O=.obj
|
||||||
|
|
||||||
|
# variables
|
||||||
|
OBJ1 = adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) \
|
||||||
|
trees$(O)
|
||||||
|
OBJP1 = adler32$(O)+compress$(O)+crc32$(O)+gzio$(O)+uncompr$(O)+deflate$(O)+\
|
||||||
|
trees$(O)
|
||||||
|
OBJ2 = zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) \
|
||||||
|
infutil$(O) inffast$(O)
|
||||||
|
OBJP2 = zutil$(O)+inflate$(O)+infblock$(O)+inftrees$(O)+infcodes$(O)+\
|
||||||
|
infutil$(O)+inffast$(O)
|
||||||
|
|
||||||
|
adler32.obj: adler32.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
compress.obj: compress.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
crc32.obj: crc32.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
gzio.obj: gzio.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
infblock.obj: infblock.c zutil.h zlib.h zconf.h infblock.h inftrees.h\
|
||||||
|
infcodes.h infutil.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
infcodes.obj: infcodes.c zutil.h zlib.h zconf.h inftrees.h infutil.h\
|
||||||
|
infcodes.h inffast.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
inflate.obj: inflate.c zutil.h zlib.h zconf.h infblock.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
infutil.obj: infutil.c zutil.h zlib.h zconf.h inftrees.h infutil.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
trees.obj: trees.c deflate.h zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
uncompr.obj: uncompr.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
zutil.obj: zutil.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
example.obj: example.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
minigzip.obj: minigzip.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
# we must cut the command line to fit in the MS/DOS 128 byte limit:
|
||||||
|
zlib.lib: $(OBJ1) $(OBJ2)
|
||||||
|
lib zlib $(OBJ1);
|
||||||
|
lib zlib $(OBJ2);
|
||||||
|
|
||||||
|
example.exe: example.obj zlib.lib
|
||||||
|
$(LD) $(LDFLAGS) example.obj,,,zlib.lib;
|
||||||
|
|
||||||
|
minigzip.exe: minigzip.obj zlib.lib
|
||||||
|
$(LD) $(LDFLAGS) minigzip.obj,,,zlib.lib;
|
||||||
|
|
||||||
|
test: example.exe minigzip.exe
|
||||||
|
example
|
||||||
|
echo hello world | minigzip | minigzip -d
|
||||||
|
|
||||||
|
#clean:
|
||||||
|
# del *.obj
|
||||||
|
# del *.exe
|
||||||
100
Makefile.tc
Normal file
100
Makefile.tc
Normal file
@@ -0,0 +1,100 @@
|
|||||||
|
# Makefile for zlib
|
||||||
|
# TurboC 2.0
|
||||||
|
|
||||||
|
# To use, do "make -fmakefile.tc"
|
||||||
|
|
||||||
|
# WARNING: the small model is supported but only for small values of
|
||||||
|
# MAX_WBITS and MAX_MEM_LEVEL. If you wish to reduce the memory
|
||||||
|
# requirements (default 256K for big objects plus a few K), you can add
|
||||||
|
# to CFLAGS below: -DMAX_MEM_LEVEL=7 -DMAX_WBITS=14
|
||||||
|
# See zconf.h for details about the memory requirements.
|
||||||
|
|
||||||
|
# ------------- Turbo C 2.0 -------------
|
||||||
|
MODEL=-ml
|
||||||
|
CFLAGS=-O2 -Z $(MODEL)
|
||||||
|
CC=tcc
|
||||||
|
LD=tcc
|
||||||
|
LIB=tlib
|
||||||
|
LDFLAGS=$(MODEL)
|
||||||
|
O=.obj
|
||||||
|
|
||||||
|
# variables
|
||||||
|
OBJ1 = adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) \
|
||||||
|
trees$(O)
|
||||||
|
OBJP1 = adler32$(O)+compress$(O)+crc32$(O)+gzio$(O)+uncompr$(O)+deflate$(O)+\
|
||||||
|
trees$(O)
|
||||||
|
OBJ2 = zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) \
|
||||||
|
infutil$(O) inffast$(O)
|
||||||
|
OBJP2 = zutil$(O)+inflate$(O)+infblock$(O)+inftrees$(O)+infcodes$(O)+\
|
||||||
|
infutil$(O)+inffast$(O)
|
||||||
|
|
||||||
|
all: test
|
||||||
|
|
||||||
|
adler32.obj: adler32.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
compress.obj: compress.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
crc32.obj: crc32.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
gzio.obj: gzio.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
infblock.obj: infblock.c zutil.h zlib.h zconf.h infblock.h inftrees.h\
|
||||||
|
infcodes.h infutil.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
infcodes.obj: infcodes.c zutil.h zlib.h zconf.h inftrees.h infutil.h\
|
||||||
|
infcodes.h inffast.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
inflate.obj: inflate.c zutil.h zlib.h zconf.h infblock.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
infutil.obj: infutil.c zutil.h zlib.h zconf.h inftrees.h infutil.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
trees.obj: trees.c deflate.h zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
uncompr.obj: uncompr.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
zutil.obj: zutil.c zutil.h zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
example.obj: example.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
minigzip.obj: minigzip.c zlib.h zconf.h
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
# we must cut the command line to fit in the MS/DOS 128 byte limit:
|
||||||
|
zlib.lib: $(OBJ1) $(OBJ2)
|
||||||
|
$(LIB) zlib +$(OBJP1)
|
||||||
|
$(LIB) zlib +$(OBJP2)
|
||||||
|
|
||||||
|
example.exe: example.obj zlib.lib
|
||||||
|
$(LD) $(LDFLAGS) -eexample.exe example.obj zlib.lib
|
||||||
|
|
||||||
|
minigzip.exe: minigzip.obj zlib.lib
|
||||||
|
$(LD) $(LDFLAGS) -eminigzip.exe minigzip.obj zlib.lib
|
||||||
|
|
||||||
|
test: example.exe minigzip.exe
|
||||||
|
example
|
||||||
|
echo hello world | minigzip | minigzip -d
|
||||||
|
|
||||||
|
#clean:
|
||||||
|
# del *.obj
|
||||||
|
# del *.exe
|
||||||
36
README
36
README
@@ -1,23 +1,37 @@
|
|||||||
zlib 0.79 is a beta version of a general purpose compression library.
|
zlib 0.93 is a beta version of a general purpose compression library.
|
||||||
|
|
||||||
The data format used by the zlib library is described in the
|
The data format used by the zlib library is described in the
|
||||||
file zlib-3.1.doc, deflate-1.1.doc and gzip-4.1.doc, available
|
files zlib-3.1.doc, deflate-1.1.doc and gzip-4.1.doc, available
|
||||||
in ftp.uu.net:/pub/archiving/zip/doc.
|
in ftp.uu.net:/pub/archiving/zip/doc.
|
||||||
|
|
||||||
All functions of the compression library are documented in the file
|
All functions of the compression library are documented in the file
|
||||||
zlib.h. A usage example of the library is given in the file example.c
|
zlib.h. A usage example of the library is given in the file example.c
|
||||||
which also tests that the library is working correctly.
|
which also tests that the library is working correctly.
|
||||||
|
|
||||||
To compile all files and run the test program, just type: make test
|
To compile all files and run the test program, just type: make test
|
||||||
|
(For MSDOS, use one of the special makefiles such as Makefile.msc.)
|
||||||
|
To install the zlib library (libgz.a) in /usr/local/lib, type: make install
|
||||||
|
To install in a different directory, use for example: make install prefix=$HOME
|
||||||
|
This will install in $HOME/lib instead of /usr/local/lib.
|
||||||
|
|
||||||
The changes made in version 0.79 are documented in the file ChangeLog.
|
The changes made in version 0.93 are documented in the file ChangeLog.
|
||||||
The main changes since 0.71 are:
|
The main changes since 0.9 are:
|
||||||
- add fast inflate (inffast.c)
|
- temporarily disable inline functions
|
||||||
- In gzio destroy(), don't reference a freed structure
|
- make deflate deterministic
|
||||||
|
- don't use signed char in inflate (not portable enough)
|
||||||
|
- fix inflate memory leak for segmented architectures
|
||||||
|
- Default MEM_LEVEL is 8 (not 9 for Unix) as documented in zlib.h
|
||||||
|
- Document the memory requirements in zconf.h
|
||||||
|
- added "make install"
|
||||||
|
- added support for DJGPP and Pyramid
|
||||||
|
- fix an inflate bug for stored blocks.
|
||||||
|
- various speedups
|
||||||
|
|
||||||
On MSDOS, this version works in large and small model with MSC; in
|
On MSDOS, this version works in both large and small model. However
|
||||||
small model only with TurboC (bug being investigated). For both
|
small model compression works only for small values of MAX_MEM_LEVEL
|
||||||
compilers, small model compression works only for small values of
|
and MAX_WBITS (see zconf.h). Small model decompression should work up
|
||||||
MEM_LEVEL and WBITS (see zutil.h), and requires -DUSE_CALLOC.
|
to MAX_WBITS=15. This version of zlib does not support small or
|
||||||
|
medium model with far allocation of big objects.
|
||||||
|
|
||||||
|
|
||||||
Copyright (C) 1995 Jean-loup Gailly and Mark Adler
|
Copyright (C) 1995 Jean-loup Gailly and Mark Adler
|
||||||
@@ -39,7 +53,7 @@ MEM_LEVEL and WBITS (see zutil.h), and requires -DUSE_CALLOC.
|
|||||||
3. This notice may not be removed or altered from any source distribution.
|
3. This notice may not be removed or altered from any source distribution.
|
||||||
|
|
||||||
Jean-loup Gailly Mark Adler
|
Jean-loup Gailly Mark Adler
|
||||||
gzip@prep.ai.mit.edu madler@cco.caltech.edu
|
gzip@prep.ai.mit.edu madler@alumni.caltech.edu
|
||||||
|
|
||||||
If you use the zlib library in a product, we would appreciate *not*
|
If you use the zlib library in a product, we would appreciate *not*
|
||||||
receiving lengthy legal documents to sign. The sources are provided
|
receiving lengthy legal documents to sign. The sources are provided
|
||||||
|
|||||||
@@ -3,7 +3,7 @@
|
|||||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: adler32.c,v 1.5 1995/04/14 14:49:51 jloup Exp $ */
|
/* $Id: adler32.c,v 1.6 1995/05/03 17:27:08 jloup Exp $ */
|
||||||
|
|
||||||
#include "zutil.h"
|
#include "zutil.h"
|
||||||
|
|
||||||
|
|||||||
@@ -3,7 +3,7 @@
|
|||||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: compress.c,v 1.4 1995/04/10 15:52:04 jloup Exp $ */
|
/* $Id: compress.c,v 1.6 1995/05/03 17:27:08 jloup Exp $ */
|
||||||
|
|
||||||
#include "zlib.h"
|
#include "zlib.h"
|
||||||
|
|
||||||
@@ -44,9 +44,9 @@ int compress (dest, destLen, source, sourceLen)
|
|||||||
if (err != Z_OK) return err;
|
if (err != Z_OK) return err;
|
||||||
|
|
||||||
err = deflate(&stream, Z_FINISH);
|
err = deflate(&stream, Z_FINISH);
|
||||||
if (err != Z_OK) {
|
if (err != Z_STREAM_END) {
|
||||||
deflateEnd(&stream);
|
deflateEnd(&stream);
|
||||||
return err;
|
return err == Z_OK ? Z_BUF_ERROR : err;
|
||||||
}
|
}
|
||||||
*destLen = stream.total_out;
|
*destLen = stream.total_out;
|
||||||
|
|
||||||
|
|||||||
63
crc32.c
63
crc32.c
@@ -3,51 +3,39 @@
|
|||||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: crc32.c,v 1.4 1995/04/14 14:55:12 jloup Exp $ */
|
/* $Id: crc32.c,v 1.5 1995/05/01 13:55:46 jloup Exp $ */
|
||||||
|
|
||||||
#include "zlib.h"
|
#include "zlib.h"
|
||||||
|
|
||||||
extern uLong crc_table[]; /* crc table, defined below */
|
#define local static
|
||||||
|
|
||||||
/* ========================================================================= */
|
|
||||||
uLong crc32(crc, buf, len)
|
|
||||||
uLong crc;
|
|
||||||
Byte *buf;
|
|
||||||
uInt len;
|
|
||||||
{
|
|
||||||
if (buf == Z_NULL) return 0L;
|
|
||||||
crc = crc ^ 0xffffffffL;
|
|
||||||
if (len) do {
|
|
||||||
crc = crc_table[((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8);
|
|
||||||
} while (--len);
|
|
||||||
return crc ^ 0xffffffffL;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
#ifdef DYNAMIC_CRC_TABLE
|
||||||
/* =========================================================================
|
/* =========================================================================
|
||||||
* Make the crc table. This function is needed only if you want to compute
|
* Make the crc table. This function is needed only if you want to compute
|
||||||
* the table dynamically.
|
* the table dynamically.
|
||||||
*/
|
*/
|
||||||
#ifdef DYNAMIC_CRC_TABLE
|
local int crc_table_empty = 1;
|
||||||
|
local uLong crc_table[256];
|
||||||
|
|
||||||
void make_crc_table()
|
local void make_crc_table()
|
||||||
{
|
{
|
||||||
uLong c;
|
uLong c;
|
||||||
int n, k;
|
int n, k;
|
||||||
|
|
||||||
for (n = 0; n < 256; n++)
|
for (n = 0; n < 256; n++)
|
||||||
{
|
{
|
||||||
c = (uLong)n;
|
c = (uLong)n;
|
||||||
for (k = 0; k < 8; k++)
|
for (k = 0; k < 8; k++)
|
||||||
c = c & 1 ? 0xedb88320L ^ (c >> 1) : c >> 1;
|
c = c & 1 ? 0xedb88320L ^ (c >> 1) : c >> 1;
|
||||||
crc_table[n] = c;
|
crc_table[n] = c;
|
||||||
}
|
}
|
||||||
|
crc_table_empty = 0;
|
||||||
}
|
}
|
||||||
#endif
|
#else
|
||||||
|
|
||||||
/* ========================================================================
|
/* ========================================================================
|
||||||
* Table of CRC-32's of all single-byte values (made by make_crc_table)
|
* Table of CRC-32's of all single-byte values (made by make_crc_table)
|
||||||
*/
|
*/
|
||||||
uLong crc_table[] = {
|
local uLong crc_table[] = {
|
||||||
0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
|
0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
|
||||||
0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
|
0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
|
||||||
0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
|
0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
|
||||||
@@ -101,3 +89,32 @@ uLong crc_table[] = {
|
|||||||
0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
|
0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
|
||||||
0x2d02ef8dL
|
0x2d02ef8dL
|
||||||
};
|
};
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define DO1(buf) crc = crc_table[((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8);
|
||||||
|
#define DO2(buf) DO1(buf); DO1(buf);
|
||||||
|
#define DO4(buf) DO2(buf); DO2(buf);
|
||||||
|
#define DO8(buf) DO4(buf); DO4(buf);
|
||||||
|
|
||||||
|
/* ========================================================================= */
|
||||||
|
uLong crc32(crc, buf, len)
|
||||||
|
uLong crc;
|
||||||
|
Byte *buf;
|
||||||
|
uInt len;
|
||||||
|
{
|
||||||
|
if (buf == Z_NULL) return 0L;
|
||||||
|
#ifdef DYNAMIC_CRC_TABLE
|
||||||
|
if (crc_table_empty)
|
||||||
|
make_crc_table();
|
||||||
|
#endif
|
||||||
|
crc = crc ^ 0xffffffffL;
|
||||||
|
while (len >= 8)
|
||||||
|
{
|
||||||
|
DO8(buf);
|
||||||
|
len -= 8;
|
||||||
|
}
|
||||||
|
if (len) do {
|
||||||
|
DO1(buf);
|
||||||
|
} while (--len);
|
||||||
|
return crc ^ 0xffffffffL;
|
||||||
|
}
|
||||||
|
|||||||
130
deflate.c
130
deflate.c
@@ -47,7 +47,7 @@
|
|||||||
*
|
*
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: deflate.c,v 1.4 1995/04/14 19:49:46 jloup Exp $ */
|
/* $Id: deflate.c,v 1.8 1995/05/03 17:27:08 jloup Exp $ */
|
||||||
|
|
||||||
#include "deflate.h"
|
#include "deflate.h"
|
||||||
|
|
||||||
@@ -117,8 +117,10 @@ local void fill_window __P((deflate_state *s));
|
|||||||
local int deflate_fast __P((deflate_state *s, int flush));
|
local int deflate_fast __P((deflate_state *s, int flush));
|
||||||
local int deflate_slow __P((deflate_state *s, int flush));
|
local int deflate_slow __P((deflate_state *s, int flush));
|
||||||
local void lm_init __P((deflate_state *s));
|
local void lm_init __P((deflate_state *s));
|
||||||
|
local inline int longest_match __P((deflate_state *s, IPos cur_match));
|
||||||
local int longest_match __P((deflate_state *s, IPos cur_match));
|
local void putShortMSB __P((deflate_state *s, uInt b));
|
||||||
|
local void flush_pending __P((z_stream *strm));
|
||||||
|
local int read_buf __P((z_stream *strm, char *buf, unsigned size));
|
||||||
#ifdef ASMV
|
#ifdef ASMV
|
||||||
void match_init __P((void)); /* asm code initialization */
|
void match_init __P((void)); /* asm code initialization */
|
||||||
#endif
|
#endif
|
||||||
@@ -150,12 +152,20 @@ local void check_match __P((deflate_state *s, IPos start, IPos match,
|
|||||||
s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
|
s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
|
||||||
s->head[s->ins_h] = (str))
|
s->head[s->ins_h] = (str))
|
||||||
|
|
||||||
|
/* ===========================================================================
|
||||||
|
* Initialize the hash table (avoiding 64K overflow for 16 bit systems).
|
||||||
|
* prev[] will be initialized on the fly.
|
||||||
|
*/
|
||||||
|
#define CLEAR_HASH(s) \
|
||||||
|
s->head[s->hash_size-1] = NIL; \
|
||||||
|
zmemzero((char*)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));
|
||||||
|
|
||||||
/* ========================================================================= */
|
/* ========================================================================= */
|
||||||
int deflateInit (strm, level)
|
int deflateInit (strm, level)
|
||||||
z_stream *strm;
|
z_stream *strm;
|
||||||
int level;
|
int level;
|
||||||
{
|
{
|
||||||
return deflateInit2 (strm, level, DEFLATED, WBITS, MEM_LEVEL, 0);
|
return deflateInit2 (strm, level, DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, 0);
|
||||||
/* To do: ignore strm->next_in if we use it as window */
|
/* To do: ignore strm->next_in if we use it as window */
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -225,7 +235,7 @@ int deflateInit2 (strm, level, method, windowBits, memLevel, strategy)
|
|||||||
|
|
||||||
s->level = level;
|
s->level = level;
|
||||||
s->strategy = strategy;
|
s->strategy = strategy;
|
||||||
s->method = method;
|
s->method = (Byte)method;
|
||||||
|
|
||||||
return deflateReset(strm);
|
return deflateReset(strm);
|
||||||
}
|
}
|
||||||
@@ -265,8 +275,8 @@ local void putShortMSB (s, b)
|
|||||||
deflate_state *s;
|
deflate_state *s;
|
||||||
uInt b;
|
uInt b;
|
||||||
{
|
{
|
||||||
put_byte(s, b >> 8);
|
put_byte(s, (Byte)(b >> 8));
|
||||||
put_byte(s, b & 0xff);
|
put_byte(s, (Byte)(b & 0xff));
|
||||||
}
|
}
|
||||||
|
|
||||||
/* =========================================================================
|
/* =========================================================================
|
||||||
@@ -334,29 +344,42 @@ int deflate (strm, flush)
|
|||||||
*/
|
*/
|
||||||
if (strm->avail_in != 0 ||
|
if (strm->avail_in != 0 ||
|
||||||
(flush == Z_FINISH && strm->state->status != FINISH_STATE)) {
|
(flush == Z_FINISH && strm->state->status != FINISH_STATE)) {
|
||||||
|
int quit;
|
||||||
|
|
||||||
if (flush == Z_FINISH) {
|
if (flush == Z_FINISH) {
|
||||||
strm->state->status = FINISH_STATE;
|
strm->state->status = FINISH_STATE;
|
||||||
}
|
}
|
||||||
if (strm->state->level <= 3) {
|
if (strm->state->level <= 3) {
|
||||||
if (deflate_fast(strm->state, flush)) return Z_OK;
|
quit = deflate_fast(strm->state, flush);
|
||||||
} else {
|
} else {
|
||||||
if (deflate_slow(strm->state, flush)) return Z_OK;
|
quit = deflate_slow(strm->state, flush);
|
||||||
}
|
}
|
||||||
|
if (flush == Z_FULL_FLUSH || flush == Z_SYNC_FLUSH) {
|
||||||
|
ct_stored_block(strm->state, (char*)0, 0L, 0); /* special marker */
|
||||||
|
flush_pending(strm);
|
||||||
|
if (flush == Z_FULL_FLUSH) {
|
||||||
|
CLEAR_HASH(strm->state); /* forget history */
|
||||||
|
}
|
||||||
|
} else if (flush == Z_PARTIAL_FLUSH) {
|
||||||
|
ct_align(strm->state);
|
||||||
|
flush_pending(strm);
|
||||||
|
}
|
||||||
|
if (quit || strm->avail_out == 0) return Z_OK;
|
||||||
}
|
}
|
||||||
Assert(strm->avail_out > 0, "bug2");
|
Assert(strm->avail_out > 0, "bug2");
|
||||||
|
|
||||||
if (flush != Z_FINISH || strm->state->noheader) return Z_OK;
|
if (flush != Z_FINISH) return Z_OK;
|
||||||
|
if (strm->state->noheader) return Z_STREAM_END;
|
||||||
|
|
||||||
/* Write the zlib trailer (adler32) */
|
/* Write the zlib trailer (adler32) */
|
||||||
putShortMSB(strm->state, strm->state->adler >> 16);
|
putShortMSB(strm->state, (uInt)(strm->state->adler >> 16));
|
||||||
putShortMSB(strm->state, strm->state->adler & 0xffff);
|
putShortMSB(strm->state, (uInt)(strm->state->adler & 0xffff));
|
||||||
flush_pending(strm);
|
flush_pending(strm);
|
||||||
/* If avail_out is zero, the application will call deflate again
|
/* If avail_out is zero, the application will call deflate again
|
||||||
* to flush the rest.
|
* to flush the rest.
|
||||||
*/
|
*/
|
||||||
strm->state->noheader = 1; /* write the trailer only once! */
|
strm->state->noheader = 1; /* write the trailer only once! */
|
||||||
return Z_OK;
|
return strm->state->pending != 0 ? Z_OK : Z_STREAM_END;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ========================================================================= */
|
/* ========================================================================= */
|
||||||
@@ -428,16 +451,9 @@ local int read_buf(strm, buf, size)
|
|||||||
local void lm_init (s)
|
local void lm_init (s)
|
||||||
deflate_state *s;
|
deflate_state *s;
|
||||||
{
|
{
|
||||||
register unsigned j;
|
|
||||||
|
|
||||||
s->window_size = (ulg)2L*s->w_size;
|
s->window_size = (ulg)2L*s->w_size;
|
||||||
|
|
||||||
|
CLEAR_HASH(s);
|
||||||
/* Initialize the hash table (avoiding 64K overflow for 16 bit systems).
|
|
||||||
* prev[] will be initialized on the fly.
|
|
||||||
*/
|
|
||||||
s->head[s->hash_size-1] = NIL;
|
|
||||||
zmemzero((char*)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));
|
|
||||||
|
|
||||||
/* Set the default configuration parameters:
|
/* Set the default configuration parameters:
|
||||||
*/
|
*/
|
||||||
@@ -451,15 +467,10 @@ local void lm_init (s)
|
|||||||
s->lookahead = 0;
|
s->lookahead = 0;
|
||||||
s->match_length = MIN_MATCH-1;
|
s->match_length = MIN_MATCH-1;
|
||||||
s->match_available = 0;
|
s->match_available = 0;
|
||||||
|
s->ins_h = 0;
|
||||||
#ifdef ASMV
|
#ifdef ASMV
|
||||||
match_init(); /* initialize the asm code */
|
match_init(); /* initialize the asm code */
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
s->ins_h = 0;
|
|
||||||
for (j=0; j<MIN_MATCH-1; j++) UPDATE_HASH(s, s->ins_h, s->window[j]);
|
|
||||||
/* If lookahead < MIN_MATCH, ins_h is garbage, but this is
|
|
||||||
* not important since only literal bytes will be emitted.
|
|
||||||
*/
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ===========================================================================
|
/* ===========================================================================
|
||||||
@@ -474,7 +485,7 @@ local void lm_init (s)
|
|||||||
/* For 80x86 and 680x0, an optimized version will be provided in match.asm or
|
/* For 80x86 and 680x0, an optimized version will be provided in match.asm or
|
||||||
* match.S. The code will be functionally equivalent.
|
* match.S. The code will be functionally equivalent.
|
||||||
*/
|
*/
|
||||||
local int longest_match(s, cur_match)
|
local inline int longest_match(s, cur_match)
|
||||||
deflate_state *s;
|
deflate_state *s;
|
||||||
IPos cur_match; /* current match */
|
IPos cur_match; /* current match */
|
||||||
{
|
{
|
||||||
@@ -488,6 +499,8 @@ local int longest_match(s, cur_match)
|
|||||||
/* Stop when cur_match becomes <= limit. To simplify the code,
|
/* Stop when cur_match becomes <= limit. To simplify the code,
|
||||||
* we prevent matches with the string of window index 0.
|
* we prevent matches with the string of window index 0.
|
||||||
*/
|
*/
|
||||||
|
Pos *prev = s->prev;
|
||||||
|
uInt wmask = s->w_mask;
|
||||||
|
|
||||||
#ifdef UNALIGNED_OK
|
#ifdef UNALIGNED_OK
|
||||||
/* Compare two bytes at a time. Note: this is not always beneficial.
|
/* Compare two bytes at a time. Note: this is not always beneficial.
|
||||||
@@ -595,7 +608,7 @@ local int longest_match(s, cur_match)
|
|||||||
scan_end = scan[best_len];
|
scan_end = scan[best_len];
|
||||||
#endif
|
#endif
|
||||||
}
|
}
|
||||||
} while ((cur_match = s->prev[cur_match & s->w_mask]) > limit
|
} while ((cur_match = prev[cur_match & wmask]) > limit
|
||||||
&& --chain_length != 0);
|
&& --chain_length != 0);
|
||||||
|
|
||||||
return best_len;
|
return best_len;
|
||||||
@@ -642,14 +655,16 @@ local void fill_window(s)
|
|||||||
deflate_state *s;
|
deflate_state *s;
|
||||||
{
|
{
|
||||||
register unsigned n, m;
|
register unsigned n, m;
|
||||||
|
register Pos *p;
|
||||||
unsigned more; /* Amount of free space at the end of the window. */
|
unsigned more; /* Amount of free space at the end of the window. */
|
||||||
|
uInt wsize = s->w_size;
|
||||||
|
|
||||||
do {
|
do {
|
||||||
more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
|
more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
|
||||||
|
|
||||||
/* Deal with !@#$% 64K limit: */
|
/* Deal with !@#$% 64K limit: */
|
||||||
if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
|
if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
|
||||||
more = s->w_size;
|
more = wsize;
|
||||||
} else if (more == (unsigned)(-1)) {
|
} else if (more == (unsigned)(-1)) {
|
||||||
/* Very unlikely, but possible on 16 bit machine if strstart == 0
|
/* Very unlikely, but possible on 16 bit machine if strstart == 0
|
||||||
* and lookahead == 1 (input done one byte at time)
|
* and lookahead == 1 (input done one byte at time)
|
||||||
@@ -659,30 +674,39 @@ local void fill_window(s)
|
|||||||
/* If the window is almost full and there is insufficient lookahead,
|
/* If the window is almost full and there is insufficient lookahead,
|
||||||
* move the upper half to the lower one to make room in the upper half.
|
* move the upper half to the lower one to make room in the upper half.
|
||||||
*/
|
*/
|
||||||
} else if (s->strstart >= s->w_size+MAX_DIST(s)) {
|
} else if (s->strstart >= wsize+MAX_DIST(s)) {
|
||||||
|
|
||||||
/* By the IN assertion, the window is not empty so we can't confuse
|
/* By the IN assertion, the window is not empty so we can't confuse
|
||||||
* more == 0 with more == 64K on a 16 bit machine.
|
* more == 0 with more == 64K on a 16 bit machine.
|
||||||
*/
|
*/
|
||||||
memcpy((char*)s->window, (char*)s->window+s->w_size,
|
zmemcpy((char*)s->window, (char*)s->window+wsize,
|
||||||
(unsigned)s->w_size);
|
(unsigned)wsize);
|
||||||
s->match_start -= s->w_size;
|
s->match_start -= wsize;
|
||||||
s->strstart -= s->w_size; /* we now have strstart >= MAX_DIST */
|
s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
|
||||||
|
|
||||||
s->block_start -= (long) s->w_size;
|
s->block_start -= (long) wsize;
|
||||||
|
|
||||||
for (n = 0; n < s->hash_size; n++) {
|
/* Slide the hash table (could be avoided with 32 bit values
|
||||||
m = s->head[n];
|
at the expense of memory usage):
|
||||||
s->head[n] = (Pos)(m >= s->w_size ? m-s->w_size : NIL);
|
*/
|
||||||
}
|
n = s->hash_size;
|
||||||
for (n = 0; n < s->w_size; n++) {
|
p = &s->head[n-1];
|
||||||
m = s->prev[n];
|
do {
|
||||||
s->prev[n] = (Pos)(m >= s->w_size ? m-s->w_size : NIL);
|
m = *p;
|
||||||
|
*p-- = (Pos)(m >= wsize ? m-wsize : NIL);
|
||||||
|
} while (--n);
|
||||||
|
|
||||||
|
n = wsize;
|
||||||
|
p = &s->prev[n-1];
|
||||||
|
do {
|
||||||
|
m = *p;
|
||||||
|
*p-- = (Pos)(m >= wsize ? m-wsize : NIL);
|
||||||
/* If n is not on any hash chain, prev[n] is garbage but
|
/* If n is not on any hash chain, prev[n] is garbage but
|
||||||
* its value will never be used.
|
* its value will never be used.
|
||||||
*/
|
*/
|
||||||
}
|
} while (--n);
|
||||||
more += s->w_size;
|
|
||||||
|
more += wsize;
|
||||||
}
|
}
|
||||||
if (s->strm->avail_in == 0) return;
|
if (s->strm->avail_in == 0) return;
|
||||||
|
|
||||||
@@ -703,6 +727,16 @@ local void fill_window(s)
|
|||||||
more);
|
more);
|
||||||
s->lookahead += n;
|
s->lookahead += n;
|
||||||
|
|
||||||
|
/* Initialize the hash value now that we have some input: */
|
||||||
|
if (s->strstart == 0 && s->lookahead >= MIN_MATCH-1) {
|
||||||
|
for (n=0; n<MIN_MATCH-1; n++) {
|
||||||
|
UPDATE_HASH(s, s->ins_h, s->window[n]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
/* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
|
||||||
|
* but this is not important since only literal bytes will be emitted.
|
||||||
|
*/
|
||||||
|
|
||||||
} while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
|
} while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -927,8 +961,10 @@ local int deflate_slow(s, flush)
|
|||||||
s->lookahead--;
|
s->lookahead--;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if (s->match_available) ct_tally (s, 0, s->window[s->strstart-1]);
|
if (s->match_available) {
|
||||||
|
ct_tally (s, 0, s->window[s->strstart-1]);
|
||||||
|
s->match_available = 0;
|
||||||
|
}
|
||||||
FLUSH_BLOCK(s, flush == Z_FINISH);
|
FLUSH_BLOCK(s, flush == Z_FINISH);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -8,7 +8,7 @@
|
|||||||
subject to change. Applications should only use zlib.h.
|
subject to change. Applications should only use zlib.h.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: deflate.h,v 1.3 1995/04/14 12:39:45 jloup Exp $ */
|
/* $Id: deflate.h,v 1.5 1995/05/03 17:27:09 jloup Exp $ */
|
||||||
|
|
||||||
#include "zutil.h"
|
#include "zutil.h"
|
||||||
|
|
||||||
@@ -268,3 +268,6 @@ typedef struct internal_state {
|
|||||||
void ct_init __P((deflate_state *s));
|
void ct_init __P((deflate_state *s));
|
||||||
int ct_tally __P((deflate_state *s, int dist, int lc));
|
int ct_tally __P((deflate_state *s, int dist, int lc));
|
||||||
ulg ct_flush_block __P((deflate_state *s, char *buf, ulg stored_len, int eof));
|
ulg ct_flush_block __P((deflate_state *s, char *buf, ulg stored_len, int eof));
|
||||||
|
void ct_align __P((deflate_state *s));
|
||||||
|
void ct_stored_block __P((deflate_state *s, char *buf, ulg stored_len,
|
||||||
|
int eof));
|
||||||
|
|||||||
123
example.c
123
example.c
@@ -3,11 +3,19 @@
|
|||||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: example.c,v 1.5 1995/04/14 20:35:56 jloup Exp $ */
|
/* $Id: example.c,v 1.9 1995/05/03 17:27:09 jloup Exp $ */
|
||||||
|
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#include "zlib.h"
|
#include "zlib.h"
|
||||||
|
|
||||||
|
#ifdef STDC
|
||||||
|
# include <string.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef __GO32__
|
||||||
|
extern void exit __P((int));
|
||||||
|
#endif
|
||||||
|
|
||||||
#define BUFLEN 4096
|
#define BUFLEN 4096
|
||||||
|
|
||||||
#define local static
|
#define local static
|
||||||
@@ -25,6 +33,12 @@
|
|||||||
|
|
||||||
char *hello = "hello world";
|
char *hello = "hello world";
|
||||||
|
|
||||||
|
void test_compress __P((void));
|
||||||
|
void test_gzio __P((char *out, char *in));
|
||||||
|
void test_deflate __P((Byte compr[]));
|
||||||
|
void test_inflate __P((Byte compr[]));
|
||||||
|
void main __P((int argc, char *argv[]));
|
||||||
|
|
||||||
/* ===========================================================================
|
/* ===========================================================================
|
||||||
* Test compress() and uncompress()
|
* Test compress() and uncompress()
|
||||||
*/
|
*/
|
||||||
@@ -37,15 +51,15 @@ void test_compress()
|
|||||||
int err;
|
int err;
|
||||||
uLong len = strlen(hello)+1;
|
uLong len = strlen(hello)+1;
|
||||||
|
|
||||||
err = compress(compr, &comprLen, hello, len);
|
err = compress(compr, &comprLen, (Byte*)hello, len);
|
||||||
CHECK_ERR(err, "compress");
|
CHECK_ERR(err, "compress");
|
||||||
|
|
||||||
strcpy(uncompr, "garbage");
|
strcpy((char*)uncompr, "garbage");
|
||||||
|
|
||||||
err = uncompress(uncompr, &uncomprLen, compr, comprLen);
|
err = uncompress(uncompr, &uncomprLen, compr, comprLen);
|
||||||
CHECK_ERR(err, "uncompress");
|
CHECK_ERR(err, "uncompress");
|
||||||
|
|
||||||
if (strcmp(uncompr, hello)) {
|
if (strcmp((char*)uncompr, hello)) {
|
||||||
fprintf(stderr, "bad uncompress\n");
|
fprintf(stderr, "bad uncompress\n");
|
||||||
} else {
|
} else {
|
||||||
printf("uncompress(): %s\n", uncompr);
|
printf("uncompress(): %s\n", uncompr);
|
||||||
@@ -80,7 +94,7 @@ void test_gzio(out, in)
|
|||||||
if (file == NULL) {
|
if (file == NULL) {
|
||||||
fprintf(stderr, "gzopen error\n");
|
fprintf(stderr, "gzopen error\n");
|
||||||
}
|
}
|
||||||
strcpy(uncompr, "garbage");
|
strcpy((char*)uncompr, "garbage");
|
||||||
|
|
||||||
uncomprLen = gzread(file, uncompr, uncomprLen);
|
uncomprLen = gzread(file, uncompr, uncomprLen);
|
||||||
if (uncomprLen != len) {
|
if (uncomprLen != len) {
|
||||||
@@ -88,7 +102,7 @@ void test_gzio(out, in)
|
|||||||
}
|
}
|
||||||
gzclose(file);
|
gzclose(file);
|
||||||
|
|
||||||
if (strcmp(uncompr, hello)) {
|
if (strcmp((char*)uncompr, hello)) {
|
||||||
fprintf(stderr, "bad gzread\n");
|
fprintf(stderr, "bad gzread\n");
|
||||||
} else {
|
} else {
|
||||||
printf("gzread(): %s\n", uncompr);
|
printf("gzread(): %s\n", uncompr);
|
||||||
@@ -96,9 +110,9 @@ void test_gzio(out, in)
|
|||||||
}
|
}
|
||||||
|
|
||||||
/* ===========================================================================
|
/* ===========================================================================
|
||||||
* Test deflate() with small buffers, return the compressed length.
|
* Test deflate() with small buffers
|
||||||
*/
|
*/
|
||||||
uLong test_deflate(compr)
|
void test_deflate(compr)
|
||||||
Byte compr[];
|
Byte compr[];
|
||||||
{
|
{
|
||||||
z_stream c_stream; /* compression stream */
|
z_stream c_stream; /* compression stream */
|
||||||
@@ -120,16 +134,15 @@ uLong test_deflate(compr)
|
|||||||
CHECK_ERR(err, "deflate");
|
CHECK_ERR(err, "deflate");
|
||||||
}
|
}
|
||||||
/* Finish the stream, still forcing small buffers: */
|
/* Finish the stream, still forcing small buffers: */
|
||||||
do {
|
for (;;) {
|
||||||
c_stream.avail_out = 1;
|
c_stream.avail_out = 1;
|
||||||
err = deflate(&c_stream, Z_FINISH);
|
err = deflate(&c_stream, Z_FINISH);
|
||||||
|
if (err == Z_STREAM_END) break;
|
||||||
CHECK_ERR(err, "deflate");
|
CHECK_ERR(err, "deflate");
|
||||||
} while (c_stream.avail_out == 0);
|
}
|
||||||
|
|
||||||
err = deflateEnd(&c_stream);
|
err = deflateEnd(&c_stream);
|
||||||
CHECK_ERR(err, "deflateEnd");
|
CHECK_ERR(err, "deflateEnd");
|
||||||
|
|
||||||
return c_stream.total_out;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ===========================================================================
|
/* ===========================================================================
|
||||||
@@ -142,7 +155,7 @@ void test_inflate(compr)
|
|||||||
int err;
|
int err;
|
||||||
z_stream d_stream; /* decompression stream */
|
z_stream d_stream; /* decompression stream */
|
||||||
|
|
||||||
strcpy(uncompr, "garbage");
|
strcpy((char*)uncompr, "garbage");
|
||||||
|
|
||||||
d_stream.zalloc = (alloc_func)0;
|
d_stream.zalloc = (alloc_func)0;
|
||||||
d_stream.zfree = (free_func)0;
|
d_stream.zfree = (free_func)0;
|
||||||
@@ -163,13 +176,88 @@ void test_inflate(compr)
|
|||||||
err = inflateEnd(&d_stream);
|
err = inflateEnd(&d_stream);
|
||||||
CHECK_ERR(err, "inflateEnd");
|
CHECK_ERR(err, "inflateEnd");
|
||||||
|
|
||||||
if (strcmp(uncompr, hello)) {
|
if (strcmp((char*)uncompr, hello)) {
|
||||||
fprintf(stderr, "bad inflate\n");
|
fprintf(stderr, "bad inflate\n");
|
||||||
} else {
|
} else {
|
||||||
printf("inflate(): %s\n", uncompr);
|
printf("inflate(): %s\n", uncompr);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/* ===========================================================================
|
||||||
|
* Test deflate() with full flush
|
||||||
|
*/
|
||||||
|
void test_flush(compr)
|
||||||
|
Byte compr[];
|
||||||
|
{
|
||||||
|
z_stream c_stream; /* compression stream */
|
||||||
|
int err;
|
||||||
|
int len = strlen(hello)+1;
|
||||||
|
|
||||||
|
c_stream.zalloc = (alloc_func)0;
|
||||||
|
c_stream.zfree = (free_func)0;
|
||||||
|
|
||||||
|
err = deflateInit(&c_stream, Z_DEFAULT_COMPRESSION);
|
||||||
|
CHECK_ERR(err, "deflateInit");
|
||||||
|
|
||||||
|
c_stream.next_in = (Byte*)hello;
|
||||||
|
c_stream.next_out = compr;
|
||||||
|
c_stream.avail_in = 3;
|
||||||
|
c_stream.avail_out = BUFLEN;
|
||||||
|
err = deflate(&c_stream, Z_FULL_FLUSH);
|
||||||
|
CHECK_ERR(err, "deflate");
|
||||||
|
|
||||||
|
compr[3]++; /* force an error in first compressed block */
|
||||||
|
c_stream.avail_in = len - 3;
|
||||||
|
|
||||||
|
err = deflate(&c_stream, Z_FINISH);
|
||||||
|
if (err != Z_STREAM_END) {
|
||||||
|
CHECK_ERR(err, "deflate");
|
||||||
|
}
|
||||||
|
err = deflateEnd(&c_stream);
|
||||||
|
CHECK_ERR(err, "deflateEnd");
|
||||||
|
}
|
||||||
|
|
||||||
|
/* ===========================================================================
|
||||||
|
* Test inflateSync()
|
||||||
|
*/
|
||||||
|
void test_sync(compr)
|
||||||
|
Byte compr[];
|
||||||
|
{
|
||||||
|
local Byte uncompr[BUFLEN];
|
||||||
|
int err;
|
||||||
|
z_stream d_stream; /* decompression stream */
|
||||||
|
|
||||||
|
strcpy((char*)uncompr, "garbage");
|
||||||
|
|
||||||
|
d_stream.zalloc = (alloc_func)0;
|
||||||
|
d_stream.zfree = (free_func)0;
|
||||||
|
|
||||||
|
err = inflateInit(&d_stream);
|
||||||
|
CHECK_ERR(err, "inflateInit");
|
||||||
|
|
||||||
|
d_stream.next_in = compr;
|
||||||
|
d_stream.next_out = uncompr;
|
||||||
|
d_stream.avail_in = 2; /* just read the zlib header */
|
||||||
|
d_stream.avail_out = sizeof(uncompr);
|
||||||
|
|
||||||
|
inflate(&d_stream, Z_NO_FLUSH);
|
||||||
|
CHECK_ERR(err, "inflate");
|
||||||
|
|
||||||
|
d_stream.avail_in = BUFLEN-2; /* let inflate read all compressed data */
|
||||||
|
err = inflateSync(&d_stream); /* skip the damaged part */
|
||||||
|
CHECK_ERR(err, "inflateSync");
|
||||||
|
|
||||||
|
err = inflate(&d_stream, Z_FINISH);
|
||||||
|
if (err != Z_DATA_ERROR) {
|
||||||
|
fprintf(stderr, "inflate should report DATA_ERROR\n");
|
||||||
|
/* Because of incorrect adler32 */
|
||||||
|
}
|
||||||
|
err = inflateEnd(&d_stream);
|
||||||
|
CHECK_ERR(err, "inflateEnd");
|
||||||
|
|
||||||
|
printf("after inflateSync(): hel%s\n", uncompr);
|
||||||
|
}
|
||||||
|
|
||||||
/* ===========================================================================
|
/* ===========================================================================
|
||||||
* Usage: example [output.gz [input.gz]]
|
* Usage: example [output.gz [input.gz]]
|
||||||
*/
|
*/
|
||||||
@@ -179,7 +267,6 @@ void main(argc, argv)
|
|||||||
char *argv[];
|
char *argv[];
|
||||||
{
|
{
|
||||||
local Byte compr[BUFLEN];
|
local Byte compr[BUFLEN];
|
||||||
uLong comprLen;
|
|
||||||
|
|
||||||
if (zlib_version[0] != ZLIB_VERSION[0]) {
|
if (zlib_version[0] != ZLIB_VERSION[0]) {
|
||||||
fprintf(stderr, "incompatible zlib version\n");
|
fprintf(stderr, "incompatible zlib version\n");
|
||||||
@@ -193,9 +280,11 @@ void main(argc, argv)
|
|||||||
test_gzio((argc > 1 ? argv[1] : "foo.gz"),
|
test_gzio((argc > 1 ? argv[1] : "foo.gz"),
|
||||||
(argc > 2 ? argv[2] : "foo.gz"));
|
(argc > 2 ? argv[2] : "foo.gz"));
|
||||||
|
|
||||||
comprLen = test_deflate(compr);
|
test_deflate(compr);
|
||||||
|
|
||||||
test_inflate(compr);
|
test_inflate(compr);
|
||||||
|
|
||||||
|
test_flush(compr);
|
||||||
|
test_sync(compr);
|
||||||
|
|
||||||
exit(0);
|
exit(0);
|
||||||
}
|
}
|
||||||
|
|||||||
32
gzio.c
32
gzio.c
@@ -3,7 +3,7 @@
|
|||||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: gzio.c,v 1.4 1995/04/14 14:50:52 jloup Exp $ */
|
/* $Id: gzio.c,v 1.8 1995/05/03 17:27:09 jloup Exp $ */
|
||||||
|
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
|
|
||||||
@@ -46,7 +46,12 @@ typedef struct gz_stream {
|
|||||||
} gz_stream;
|
} gz_stream;
|
||||||
|
|
||||||
|
|
||||||
/* ===========================================================================
|
local int destroy __P((gz_stream *s));
|
||||||
|
local gzFile gz_open __P((char *path, char *mode, int fd));
|
||||||
|
local void putLong __P((FILE *file, uLong x));
|
||||||
|
local uLong getLong __P((Byte *buf));
|
||||||
|
|
||||||
|
/* ===========================================================================
|
||||||
* Cleanup then free the given gz_stream. Return a zlib error code.
|
* Cleanup then free the given gz_stream. Return a zlib error code.
|
||||||
*/
|
*/
|
||||||
local int destroy (s)
|
local int destroy (s)
|
||||||
@@ -123,7 +128,7 @@ local gzFile gz_open (path, mode, fd)
|
|||||||
|
|
||||||
if (s->mode == 'w') {
|
if (s->mode == 'w') {
|
||||||
err = deflateInit2(&(s->stream), Z_DEFAULT_COMPRESSION,
|
err = deflateInit2(&(s->stream), Z_DEFAULT_COMPRESSION,
|
||||||
DEFLATED, -WBITS, MEM_LEVEL, 0);
|
DEFLATED, -MAX_WBITS, DEF_MEM_LEVEL, 0);
|
||||||
/* windowBits is passed < 0 to suppress zlib header */
|
/* windowBits is passed < 0 to suppress zlib header */
|
||||||
|
|
||||||
s->stream.next_out = s->outbuf = ALLOC(Z_BUFSIZE);
|
s->stream.next_out = s->outbuf = ALLOC(Z_BUFSIZE);
|
||||||
@@ -132,7 +137,7 @@ local gzFile gz_open (path, mode, fd)
|
|||||||
return destroy(s), (gzFile)Z_NULL;
|
return destroy(s), (gzFile)Z_NULL;
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
err = inflateInit2(&(s->stream), -WBITS);
|
err = inflateInit2(&(s->stream), -MAX_WBITS);
|
||||||
s->stream.next_in = s->inbuf = ALLOC(Z_BUFSIZE);
|
s->stream.next_in = s->inbuf = ALLOC(Z_BUFSIZE);
|
||||||
|
|
||||||
if (err != Z_OK || s->inbuf == Z_NULL) {
|
if (err != Z_OK || s->inbuf == Z_NULL) {
|
||||||
@@ -216,7 +221,7 @@ gzFile gzdopen (fd, mode)
|
|||||||
char *mode;
|
char *mode;
|
||||||
{
|
{
|
||||||
char name[20];
|
char name[20];
|
||||||
sprintf(name, "_fd:%d_", fd); /* for debugging */
|
sprintf(name, "<fd:%d>", fd); /* for debugging */
|
||||||
|
|
||||||
return gz_open (name, mode, fd);
|
return gz_open (name, mode, fd);
|
||||||
}
|
}
|
||||||
@@ -244,7 +249,7 @@ int gzread (file, buf, len)
|
|||||||
len--; n++;
|
len--; n++;
|
||||||
}
|
}
|
||||||
if (len == 0) return n;
|
if (len == 0) return n;
|
||||||
return n + fread(buf, 1, len, s->file);
|
return n + fread(b, 1, len, s->file);
|
||||||
}
|
}
|
||||||
if (s->z_err == Z_DATA_ERROR) return -1; /* bad .gz file */
|
if (s->z_err == Z_DATA_ERROR) return -1; /* bad .gz file */
|
||||||
if (s->z_err == Z_STREAM_END) return 0; /* don't read crc as data */
|
if (s->z_err == Z_STREAM_END) return 0; /* don't read crc as data */
|
||||||
@@ -339,7 +344,7 @@ int gzflush (file, flush)
|
|||||||
if (len != 0) {
|
if (len != 0) {
|
||||||
if (fwrite(s->outbuf, 1, len, s->file) != len) {
|
if (fwrite(s->outbuf, 1, len, s->file) != len) {
|
||||||
s->z_err = Z_ERRNO;
|
s->z_err = Z_ERRNO;
|
||||||
break;
|
return Z_ERRNO;
|
||||||
}
|
}
|
||||||
s->stream.next_out = s->outbuf;
|
s->stream.next_out = s->outbuf;
|
||||||
s->stream.avail_out = Z_BUFSIZE;
|
s->stream.avail_out = Z_BUFSIZE;
|
||||||
@@ -347,14 +352,14 @@ int gzflush (file, flush)
|
|||||||
if (done) break;
|
if (done) break;
|
||||||
s->z_err = deflate(&(s->stream), flush);
|
s->z_err = deflate(&(s->stream), flush);
|
||||||
|
|
||||||
if (s->z_err != Z_OK) break;
|
|
||||||
|
|
||||||
/* deflate has finished flushing only when it hasn't used up
|
/* deflate has finished flushing only when it hasn't used up
|
||||||
* all the available space in the output buffer:
|
* all the available space in the output buffer:
|
||||||
*/
|
*/
|
||||||
done = (s->stream.avail_out != 0);
|
done = (s->stream.avail_out != 0 || s->z_err == Z_STREAM_END);
|
||||||
|
|
||||||
|
if (s->z_err != Z_OK && s->z_err != Z_STREAM_END) break;
|
||||||
}
|
}
|
||||||
return s->z_err;
|
return s->z_err == Z_STREAM_END ? Z_OK : s->z_err;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ===========================================================================
|
/* ===========================================================================
|
||||||
@@ -395,12 +400,15 @@ int gzclose (file)
|
|||||||
gzFile file;
|
gzFile file;
|
||||||
{
|
{
|
||||||
uInt n;
|
uInt n;
|
||||||
|
int err;
|
||||||
gz_stream *s = (gz_stream*)file;
|
gz_stream *s = (gz_stream*)file;
|
||||||
|
|
||||||
if (s == NULL) return Z_STREAM_ERROR;
|
if (s == NULL) return Z_STREAM_ERROR;
|
||||||
|
|
||||||
if (s->mode == 'w') {
|
if (s->mode == 'w') {
|
||||||
gzflush (file, Z_FINISH);
|
err = gzflush (file, Z_FINISH);
|
||||||
|
if (err != Z_OK) return destroy(file);
|
||||||
|
|
||||||
putLong (s->file, s->crc);
|
putLong (s->file, s->crc);
|
||||||
putLong (s->file, s->stream.total_in);
|
putLong (s->file, s->stream.total_in);
|
||||||
|
|
||||||
|
|||||||
119
infblock.c
119
infblock.c
@@ -60,6 +60,32 @@ local uInt border[] = { /* Order of the bit length code lengths */
|
|||||||
the two sets of lengths.
|
the two sets of lengths.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
void inflate_blocks_reset(s, z, c)
|
||||||
|
struct inflate_blocks_state *s;
|
||||||
|
z_stream *z;
|
||||||
|
uLong *c;
|
||||||
|
{
|
||||||
|
if (s->checkfn != 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);
|
||||||
|
inflate_trees_free(s->sub.decode.td, z);
|
||||||
|
inflate_trees_free(s->sub.decode.tl, z);
|
||||||
|
}
|
||||||
|
s->mode = TYPE;
|
||||||
|
s->bitk = 0;
|
||||||
|
s->bitb = 0;
|
||||||
|
s->read = s->write = s->window;
|
||||||
|
if (s->checkfn != Z_NULL)
|
||||||
|
s->check = (*s->checkfn)(0L, Z_NULL, 0);
|
||||||
|
Trace((stderr, "inflate: blocks reset\n"));
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
struct inflate_blocks_state *inflate_blocks_new(z, c, w)
|
struct inflate_blocks_state *inflate_blocks_new(z, c, w)
|
||||||
z_stream *z;
|
z_stream *z;
|
||||||
check_func c;
|
check_func c;
|
||||||
@@ -75,13 +101,11 @@ uInt w;
|
|||||||
ZFREE(z, s);
|
ZFREE(z, s);
|
||||||
return Z_NULL;
|
return Z_NULL;
|
||||||
}
|
}
|
||||||
s->mode = TYPE;
|
|
||||||
s->bitk = 0;
|
|
||||||
s->read = s->write = s->window;
|
|
||||||
s->end = s->window + w;
|
s->end = s->window + w;
|
||||||
s->checkfn = c;
|
s->checkfn = c;
|
||||||
if (s->checkfn != Z_NULL)
|
s->mode = TYPE;
|
||||||
s->check = (*s->checkfn)(0L, Z_NULL, 0);
|
Trace((stderr, "inflate: blocks allocated\n"));
|
||||||
|
inflate_blocks_reset(s, z, &s->check);
|
||||||
return s;
|
return s;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -112,34 +136,42 @@ int r;
|
|||||||
switch (t >> 1)
|
switch (t >> 1)
|
||||||
{
|
{
|
||||||
case 0: /* stored */
|
case 0: /* stored */
|
||||||
|
Trace((stderr, "inflate: stored block%s\n",
|
||||||
|
s->last ? " (last)" : ""));
|
||||||
DUMPBITS(3)
|
DUMPBITS(3)
|
||||||
t = k & 7; /* go to byte boundary */
|
t = k & 7; /* go to byte boundary */
|
||||||
DUMPBITS(t)
|
DUMPBITS(t)
|
||||||
s->mode = LENS; /* get length of stored block */
|
s->mode = LENS; /* get length of stored block */
|
||||||
break;
|
break;
|
||||||
case 1: /* fixed */
|
case 1: /* fixed */
|
||||||
|
Trace((stderr, "inflate: fixed codes block%s\n",
|
||||||
|
s->last ? " (last)" : ""));
|
||||||
{
|
{
|
||||||
uInt bl, bd;
|
uInt bl, bd;
|
||||||
inflate_huft *tl, *td;
|
inflate_huft *tl, *td;
|
||||||
|
|
||||||
inflate_trees_fixed(&bl, &bd, &tl, &td);
|
inflate_trees_fixed(&bl, &bd, &tl, &td);
|
||||||
s->sub.codes = inflate_codes_new(bl, bd, tl, td, z);
|
s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z);
|
||||||
if (s->sub.codes == Z_NULL)
|
if (s->sub.decode.codes == Z_NULL)
|
||||||
{
|
{
|
||||||
r = Z_MEM_ERROR;
|
r = Z_MEM_ERROR;
|
||||||
LEAVE
|
LEAVE
|
||||||
}
|
}
|
||||||
|
s->sub.decode.tl = Z_NULL; /* don't try to free these */
|
||||||
|
s->sub.decode.td = Z_NULL;
|
||||||
}
|
}
|
||||||
DUMPBITS(3)
|
DUMPBITS(3)
|
||||||
s->mode = CODES;
|
s->mode = CODES;
|
||||||
break;
|
break;
|
||||||
case 2: /* dynamic */
|
case 2: /* dynamic */
|
||||||
|
Trace((stderr, "inflate: dynamic codes block%s\n",
|
||||||
|
s->last ? " (last)" : ""));
|
||||||
DUMPBITS(3)
|
DUMPBITS(3)
|
||||||
s->mode = TABLE;
|
s->mode = TABLE;
|
||||||
break;
|
break;
|
||||||
case 3: /* illegal */
|
case 3: /* illegal */
|
||||||
DUMPBITS(3)
|
DUMPBITS(3)
|
||||||
s->mode = ERROR;
|
s->mode = BAD;
|
||||||
z->msg = "invalid block type";
|
z->msg = "invalid block type";
|
||||||
r = Z_DATA_ERROR;
|
r = Z_DATA_ERROR;
|
||||||
LEAVE
|
LEAVE
|
||||||
@@ -149,21 +181,31 @@ int r;
|
|||||||
NEEDBITS(32)
|
NEEDBITS(32)
|
||||||
if ((~b) >> 16 != (b & 0xffff))
|
if ((~b) >> 16 != (b & 0xffff))
|
||||||
{
|
{
|
||||||
s->mode = ERROR;
|
s->mode = BAD;
|
||||||
z->msg = "invalid stored block lengths";
|
z->msg = "invalid stored block lengths";
|
||||||
r = Z_DATA_ERROR;
|
r = Z_DATA_ERROR;
|
||||||
LEAVE
|
LEAVE
|
||||||
}
|
}
|
||||||
k = 0; /* dump bits */
|
|
||||||
s->sub.left = (uInt)b & 0xffff;
|
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 : TYPE;
|
s->mode = s->sub.left ? STORED : TYPE;
|
||||||
break;
|
break;
|
||||||
case STORED:
|
case STORED:
|
||||||
do {
|
if (n == 0)
|
||||||
NEEDBYTE
|
LEAVE
|
||||||
NEEDOUT
|
NEEDOUT
|
||||||
OUTBYTE(NEXTBYTE)
|
t = s->sub.left;
|
||||||
} while (--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;
|
s->mode = s->last ? DRY : TYPE;
|
||||||
break;
|
break;
|
||||||
case TABLE:
|
case TABLE:
|
||||||
@@ -172,7 +214,7 @@ int r;
|
|||||||
#ifndef PKZIP_BUG_WORKAROUND
|
#ifndef PKZIP_BUG_WORKAROUND
|
||||||
if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
|
if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
|
||||||
{
|
{
|
||||||
s->mode = ERROR;
|
s->mode = BAD;
|
||||||
z->msg = "too many length or distance symbols";
|
z->msg = "too many length or distance symbols";
|
||||||
r = Z_DATA_ERROR;
|
r = Z_DATA_ERROR;
|
||||||
LEAVE
|
LEAVE
|
||||||
@@ -188,6 +230,7 @@ int r;
|
|||||||
}
|
}
|
||||||
DUMPBITS(14)
|
DUMPBITS(14)
|
||||||
s->sub.trees.index = 0;
|
s->sub.trees.index = 0;
|
||||||
|
Tracev((stderr, "inflate: table sizes ok\n"));
|
||||||
s->mode = BTREE;
|
s->mode = BTREE;
|
||||||
case BTREE:
|
case BTREE:
|
||||||
while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
|
while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
|
||||||
@@ -205,10 +248,11 @@ int r;
|
|||||||
{
|
{
|
||||||
r = t;
|
r = t;
|
||||||
if (r == Z_DATA_ERROR)
|
if (r == Z_DATA_ERROR)
|
||||||
s->mode = ERROR;
|
s->mode = BAD;
|
||||||
LEAVE
|
LEAVE
|
||||||
}
|
}
|
||||||
s->sub.trees.index = 0;
|
s->sub.trees.index = 0;
|
||||||
|
Tracev((stderr, "inflate: bits tree ok\n"));
|
||||||
s->mode = DTREE;
|
s->mode = DTREE;
|
||||||
case DTREE:
|
case DTREE:
|
||||||
while (t = s->sub.trees.table,
|
while (t = s->sub.trees.table,
|
||||||
@@ -240,7 +284,7 @@ int r;
|
|||||||
if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) ||
|
if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) ||
|
||||||
(c == 16 && i < 1))
|
(c == 16 && i < 1))
|
||||||
{
|
{
|
||||||
s->mode = ERROR;
|
s->mode = BAD;
|
||||||
z->msg = "invalid bit length repeat";
|
z->msg = "invalid bit length repeat";
|
||||||
r = Z_DATA_ERROR;
|
r = Z_DATA_ERROR;
|
||||||
LEAVE
|
LEAVE
|
||||||
@@ -267,10 +311,11 @@ int r;
|
|||||||
if (t != Z_OK)
|
if (t != Z_OK)
|
||||||
{
|
{
|
||||||
if (t == (uInt)Z_DATA_ERROR)
|
if (t == (uInt)Z_DATA_ERROR)
|
||||||
s->mode = ERROR;
|
s->mode = BAD;
|
||||||
r = t;
|
r = t;
|
||||||
LEAVE
|
LEAVE
|
||||||
}
|
}
|
||||||
|
Tracev((stderr, "inflate: trees ok\n"));
|
||||||
if ((c = inflate_codes_new(bl, bd, tl, td, z)) == Z_NULL)
|
if ((c = inflate_codes_new(bl, bd, tl, td, z)) == Z_NULL)
|
||||||
{
|
{
|
||||||
inflate_trees_free(td, z);
|
inflate_trees_free(td, z);
|
||||||
@@ -279,7 +324,9 @@ int r;
|
|||||||
LEAVE
|
LEAVE
|
||||||
}
|
}
|
||||||
ZFREE(z, s->sub.trees.blens);
|
ZFREE(z, s->sub.trees.blens);
|
||||||
s->sub.codes = c;
|
s->sub.decode.codes = c;
|
||||||
|
s->sub.decode.tl = tl;
|
||||||
|
s->sub.decode.td = td;
|
||||||
}
|
}
|
||||||
s->mode = CODES;
|
s->mode = CODES;
|
||||||
case CODES:
|
case CODES:
|
||||||
@@ -287,10 +334,26 @@ int r;
|
|||||||
if ((r = inflate_codes(s, z, r)) != Z_STREAM_END)
|
if ((r = inflate_codes(s, z, r)) != Z_STREAM_END)
|
||||||
return inflate_flush(s, z, r);
|
return inflate_flush(s, z, r);
|
||||||
r = Z_OK;
|
r = Z_OK;
|
||||||
inflate_codes_free(s->sub.codes, z);
|
inflate_codes_free(s->sub.decode.codes, z);
|
||||||
|
inflate_trees_free(s->sub.decode.td, z);
|
||||||
|
inflate_trees_free(s->sub.decode.tl, z);
|
||||||
LOAD
|
LOAD
|
||||||
s->mode = s->last ? DRY : TYPE;
|
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;
|
break;
|
||||||
|
}
|
||||||
|
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 */
|
||||||
|
}
|
||||||
|
s->mode = DRY;
|
||||||
case DRY:
|
case DRY:
|
||||||
FLUSH
|
FLUSH
|
||||||
if (s->read != s->write)
|
if (s->read != s->write)
|
||||||
@@ -299,7 +362,7 @@ int r;
|
|||||||
case DONE:
|
case DONE:
|
||||||
r = Z_STREAM_END;
|
r = Z_STREAM_END;
|
||||||
LEAVE
|
LEAVE
|
||||||
case ERROR:
|
case BAD:
|
||||||
r = Z_DATA_ERROR;
|
r = Z_DATA_ERROR;
|
||||||
LEAVE
|
LEAVE
|
||||||
default:
|
default:
|
||||||
@@ -309,20 +372,14 @@ int r;
|
|||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
int inflate_blocks_free(s, z, c, e)
|
int inflate_blocks_free(s, z, c)
|
||||||
struct inflate_blocks_state *s;
|
struct inflate_blocks_state *s;
|
||||||
z_stream *z;
|
z_stream *z;
|
||||||
uLong *c;
|
uLong *c;
|
||||||
int *e;
|
|
||||||
{
|
{
|
||||||
*e = (int)(s->bitk > 7 ? (s->bitb >> (s->bitk & 7)) & 0xff : -1);
|
inflate_blocks_reset(s, z, c);
|
||||||
if (s->checkfn != 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.codes, z);
|
|
||||||
ZFREE(z, s->window);
|
ZFREE(z, s->window);
|
||||||
ZFREE(z, s);
|
ZFREE(z, s);
|
||||||
|
Trace((stderr, "inflate: blocks freed\n"));
|
||||||
return Z_OK;
|
return Z_OK;
|
||||||
}
|
}
|
||||||
|
|||||||
10
infblock.h
10
infblock.h
@@ -12,7 +12,7 @@ struct inflate_blocks_state;
|
|||||||
|
|
||||||
extern struct inflate_blocks_state * inflate_blocks_new __P((
|
extern struct inflate_blocks_state * inflate_blocks_new __P((
|
||||||
z_stream *,
|
z_stream *,
|
||||||
check_func checkfn, /* check function */
|
check_func, /* check function */
|
||||||
uInt)); /* window size */
|
uInt)); /* window size */
|
||||||
|
|
||||||
extern int inflate_blocks __P((
|
extern int inflate_blocks __P((
|
||||||
@@ -20,8 +20,12 @@ extern int inflate_blocks __P((
|
|||||||
z_stream *,
|
z_stream *,
|
||||||
int)); /* initial return code */
|
int)); /* initial return code */
|
||||||
|
|
||||||
|
extern void inflate_blocks_reset __P((
|
||||||
|
struct inflate_blocks_state *,
|
||||||
|
z_stream *,
|
||||||
|
uLong *)); /* check value on output */
|
||||||
|
|
||||||
extern int inflate_blocks_free __P((
|
extern int inflate_blocks_free __P((
|
||||||
struct inflate_blocks_state *,
|
struct inflate_blocks_state *,
|
||||||
z_stream *,
|
z_stream *,
|
||||||
uLong *, /* check value on output */
|
uLong *)); /* check value on output */
|
||||||
int *)); /* possible leftover byte to return */
|
|
||||||
|
|||||||
81
infcodes.c
81
infcodes.c
@@ -29,7 +29,7 @@ struct inflate_codes_state {
|
|||||||
LIT, /* o: got literal, waiting for output space */
|
LIT, /* o: got literal, waiting for output space */
|
||||||
WASH, /* o: got eob, possibly still output waiting */
|
WASH, /* o: got eob, possibly still output waiting */
|
||||||
END, /* x: got eob and all data flushed */
|
END, /* x: got eob and all data flushed */
|
||||||
BAD} /* x: got error */
|
BADCODE} /* x: got error */
|
||||||
mode; /* current inflate_codes mode */
|
mode; /* current inflate_codes mode */
|
||||||
|
|
||||||
/* mode dependent information */
|
/* mode dependent information */
|
||||||
@@ -70,6 +70,7 @@ z_stream *z;
|
|||||||
c->dbits = (Byte)bd;
|
c->dbits = (Byte)bd;
|
||||||
c->ltree = tl;
|
c->ltree = tl;
|
||||||
c->dtree = td;
|
c->dtree = td;
|
||||||
|
Tracev((stderr, "inflate: codes new\n"));
|
||||||
}
|
}
|
||||||
return c;
|
return c;
|
||||||
}
|
}
|
||||||
@@ -82,7 +83,7 @@ int r;
|
|||||||
{
|
{
|
||||||
uInt j; /* temporary storage */
|
uInt j; /* temporary storage */
|
||||||
inflate_huft *t; /* temporary pointer */
|
inflate_huft *t; /* temporary pointer */
|
||||||
int e; /* extra bits or operation */
|
uInt e; /* extra bits or operation */
|
||||||
uLong b; /* bit buffer */
|
uLong b; /* bit buffer */
|
||||||
uInt k; /* bits in bit buffer */
|
uInt k; /* bits in bit buffer */
|
||||||
Byte *p; /* input data pointer */
|
Byte *p; /* input data pointer */
|
||||||
@@ -90,7 +91,7 @@ int r;
|
|||||||
Byte *q; /* output window write pointer */
|
Byte *q; /* output window write pointer */
|
||||||
uInt m; /* bytes to end of window or read pointer */
|
uInt m; /* bytes to end of window or read pointer */
|
||||||
Byte *f; /* pointer to copy strings from */
|
Byte *f; /* pointer to copy strings from */
|
||||||
struct inflate_codes_state *c = s->sub.codes; /* codes state */
|
struct inflate_codes_state *c = s->sub.decode.codes; /* codes state */
|
||||||
|
|
||||||
/* copy input/output information to locals (UPDATE macro restores) */
|
/* copy input/output information to locals (UPDATE macro restores) */
|
||||||
LOAD
|
LOAD
|
||||||
@@ -107,7 +108,7 @@ int r;
|
|||||||
LOAD
|
LOAD
|
||||||
if (r != Z_OK)
|
if (r != Z_OK)
|
||||||
{
|
{
|
||||||
c->mode = r == Z_STREAM_END ? WASH : BAD;
|
c->mode = r == Z_STREAM_END ? WASH : BADCODE;
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -120,34 +121,39 @@ int r;
|
|||||||
NEEDBITS(j)
|
NEEDBITS(j)
|
||||||
t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
|
t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
|
||||||
DUMPBITS(t->bits)
|
DUMPBITS(t->bits)
|
||||||
if ((e = (int)(t->exop)) < 0)
|
e = (uInt)(t->exop);
|
||||||
|
if (e == 0) /* literal */
|
||||||
{
|
{
|
||||||
if (e == -128) /* invalid code */
|
c->sub.lit = t->base;
|
||||||
{
|
Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ?
|
||||||
c->mode = BAD;
|
"inflate: literal '%c'\n" :
|
||||||
z->msg = "invalid literal/length code";
|
"inflate: literal 0x%02x\n", t->base));
|
||||||
r = Z_DATA_ERROR;
|
c->mode = LIT;
|
||||||
LEAVE
|
|
||||||
}
|
|
||||||
e = -e;
|
|
||||||
if (e & 64) /* end of block */
|
|
||||||
{
|
|
||||||
c->mode = WASH;
|
|
||||||
break;
|
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.need = e;
|
||||||
c->sub.code.tree = t->next;
|
c->sub.code.tree = t->next;
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
if (e & 16) /* literal */
|
if (e & 32) /* end of block */
|
||||||
{
|
{
|
||||||
c->sub.lit = t->base;
|
Tracevv((stderr, "inflate: end of block\n"));
|
||||||
c->mode = LIT;
|
c->mode = WASH;
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
c->sub.copy.get = e;
|
c->mode = BADCODE; /* invalid code */
|
||||||
c->len = t->base;
|
z->msg = "invalid literal/length code";
|
||||||
c->mode = LENEXT;
|
r = Z_DATA_ERROR;
|
||||||
|
LEAVE
|
||||||
case LENEXT: /* i: getting length extra (have base) */
|
case LENEXT: /* i: getting length extra (have base) */
|
||||||
j = c->sub.copy.get;
|
j = c->sub.copy.get;
|
||||||
NEEDBITS(j)
|
NEEDBITS(j)
|
||||||
@@ -155,33 +161,37 @@ int r;
|
|||||||
DUMPBITS(j)
|
DUMPBITS(j)
|
||||||
c->sub.code.need = c->dbits;
|
c->sub.code.need = c->dbits;
|
||||||
c->sub.code.tree = c->dtree;
|
c->sub.code.tree = c->dtree;
|
||||||
|
Tracevv((stderr, "inflate: length %u\n", c->len));
|
||||||
c->mode = DIST;
|
c->mode = DIST;
|
||||||
case DIST: /* i: get distance next */
|
case DIST: /* i: get distance next */
|
||||||
j = c->sub.code.need;
|
j = c->sub.code.need;
|
||||||
NEEDBITS(j)
|
NEEDBITS(j)
|
||||||
t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
|
t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
|
||||||
DUMPBITS(t->bits)
|
DUMPBITS(t->bits)
|
||||||
if ((e = (int)(t->exop)) < 0)
|
e = (uInt)(t->exop);
|
||||||
|
if (e & 16) /* distance */
|
||||||
{
|
{
|
||||||
if (e == -128)
|
c->sub.copy.get = e & 15;
|
||||||
{
|
c->sub.copy.dist = t->base;
|
||||||
c->mode = BAD;
|
c->mode = DISTEXT;
|
||||||
z->msg = "invalid distance code";
|
break;
|
||||||
r = Z_DATA_ERROR;
|
|
||||||
LEAVE
|
|
||||||
}
|
}
|
||||||
c->sub.code.need = -e;
|
if ((e & 64) == 0) /* next table */
|
||||||
|
{
|
||||||
|
c->sub.code.need = e;
|
||||||
c->sub.code.tree = t->next;
|
c->sub.code.tree = t->next;
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
c->sub.copy.dist = t->base;
|
c->mode = BADCODE; /* invalid code */
|
||||||
c->sub.copy.get = e;
|
z->msg = "invalid distance code";
|
||||||
c->mode = DISTEXT;
|
r = Z_DATA_ERROR;
|
||||||
|
LEAVE
|
||||||
case DISTEXT: /* i: getting distance extra */
|
case DISTEXT: /* i: getting distance extra */
|
||||||
j = c->sub.copy.get;
|
j = c->sub.copy.get;
|
||||||
NEEDBITS(j)
|
NEEDBITS(j)
|
||||||
c->sub.copy.dist += (uInt)b & inflate_mask[j];
|
c->sub.copy.dist += (uInt)b & inflate_mask[j];
|
||||||
DUMPBITS(j)
|
DUMPBITS(j)
|
||||||
|
Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist));
|
||||||
c->mode = COPY;
|
c->mode = COPY;
|
||||||
case COPY: /* o: copying bytes in window, waiting for space */
|
case COPY: /* o: copying bytes in window, waiting for space */
|
||||||
f = (uInt)(q - s->window) < c->sub.copy.dist ?
|
f = (uInt)(q - s->window) < c->sub.copy.dist ?
|
||||||
@@ -210,7 +220,7 @@ int r;
|
|||||||
case END:
|
case END:
|
||||||
r = Z_STREAM_END;
|
r = Z_STREAM_END;
|
||||||
LEAVE
|
LEAVE
|
||||||
case BAD: /* x: got error */
|
case BADCODE: /* x: got error */
|
||||||
r = Z_DATA_ERROR;
|
r = Z_DATA_ERROR;
|
||||||
LEAVE
|
LEAVE
|
||||||
default:
|
default:
|
||||||
@@ -224,7 +234,6 @@ void inflate_codes_free(c, z)
|
|||||||
struct inflate_codes_state *c;
|
struct inflate_codes_state *c;
|
||||||
z_stream *z;
|
z_stream *z;
|
||||||
{
|
{
|
||||||
inflate_trees_free(c->dtree, z);
|
|
||||||
inflate_trees_free(c->ltree, z);
|
|
||||||
ZFREE(z, c);
|
ZFREE(z, c);
|
||||||
|
Tracev((stderr, "inflate: codes free\n"));
|
||||||
}
|
}
|
||||||
|
|||||||
109
inffast.c
109
inffast.c
@@ -8,6 +8,8 @@
|
|||||||
#include "infutil.h"
|
#include "infutil.h"
|
||||||
#include "inffast.h"
|
#include "inffast.h"
|
||||||
|
|
||||||
|
struct inflate_codes_state {int dummy;}; /* for buggy compilers */
|
||||||
|
|
||||||
/* simplify the use of the inflate_huft type with some defines */
|
/* simplify the use of the inflate_huft type with some defines */
|
||||||
#define base more.Base
|
#define base more.Base
|
||||||
#define next more.Next
|
#define next more.Next
|
||||||
@@ -15,10 +17,6 @@
|
|||||||
#define bits word.what.Bits
|
#define bits word.what.Bits
|
||||||
|
|
||||||
/* macros for bit input with no checking and for returning unused bytes */
|
/* macros for bit input with no checking and for returning unused bytes */
|
||||||
#ifdef DEBUG
|
|
||||||
# undef NEXTBYTE
|
|
||||||
# define NEXTBYTE (n--?0:fprintf(stderr,"inffast underrun\n"),*p++)
|
|
||||||
#endif
|
|
||||||
#define GRABBITS(j) {while(k<(j)){b|=((uLong)NEXTBYTE)<<k;k+=8;}}
|
#define GRABBITS(j) {while(k<(j)){b|=((uLong)NEXTBYTE)<<k;k+=8;}}
|
||||||
#define UNGRAB {n+=(c=k>>3);p-=c;k&=7;}
|
#define UNGRAB {n+=(c=k>>3);p-=c;k&=7;}
|
||||||
|
|
||||||
@@ -34,7 +32,7 @@ struct inflate_blocks_state *s;
|
|||||||
z_stream *z;
|
z_stream *z;
|
||||||
{
|
{
|
||||||
inflate_huft *t; /* temporary pointer */
|
inflate_huft *t; /* temporary pointer */
|
||||||
int e; /* extra bits or operation */
|
uInt e; /* extra bits or operation */
|
||||||
uLong b; /* bit buffer */
|
uLong b; /* bit buffer */
|
||||||
uInt k; /* bits in bit buffer */
|
uInt k; /* bits in bit buffer */
|
||||||
Byte *p; /* input data pointer */
|
Byte *p; /* input data pointer */
|
||||||
@@ -50,7 +48,7 @@ z_stream *z;
|
|||||||
/* load input, output, bit values */
|
/* load input, output, bit values */
|
||||||
LOAD
|
LOAD
|
||||||
|
|
||||||
/* initialize masks in registers */
|
/* initialize masks */
|
||||||
ml = inflate_mask[bl];
|
ml = inflate_mask[bl];
|
||||||
md = inflate_mask[bd];
|
md = inflate_mask[bd];
|
||||||
|
|
||||||
@@ -58,69 +56,47 @@ z_stream *z;
|
|||||||
do { /* assume called with m >= 258 && n >= 10 */
|
do { /* assume called with m >= 258 && n >= 10 */
|
||||||
/* get literal/length code */
|
/* get literal/length code */
|
||||||
GRABBITS(20) /* max bits for literal/length code */
|
GRABBITS(20) /* max bits for literal/length code */
|
||||||
if ((e = (t = tl + ((uInt)b & ml))->exop) < 0)
|
if ((e = (t = tl + ((uInt)b & ml))->exop) == 0)
|
||||||
do {
|
|
||||||
if (e == -128)
|
|
||||||
{
|
{
|
||||||
z->msg = "invalid literal/length code";
|
|
||||||
UNGRAB
|
|
||||||
UPDATE
|
|
||||||
return Z_DATA_ERROR;
|
|
||||||
}
|
|
||||||
DUMPBITS(t->bits)
|
DUMPBITS(t->bits)
|
||||||
e = -e;
|
Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ?
|
||||||
if (e & 64) /* end of block */
|
"inflate: * literal '%c'\n" :
|
||||||
{
|
"inflate: * literal 0x%02x\n", t->base));
|
||||||
UNGRAB
|
|
||||||
UPDATE
|
|
||||||
return Z_STREAM_END;
|
|
||||||
}
|
|
||||||
} while ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) < 0);
|
|
||||||
DUMPBITS(t->bits)
|
|
||||||
|
|
||||||
/* process literal or length (end of block already trapped) */
|
|
||||||
if (e & 16) /* then it's a literal */
|
|
||||||
{
|
|
||||||
*q++ = (Byte)t->base;
|
*q++ = (Byte)t->base;
|
||||||
m--;
|
m--;
|
||||||
|
continue;
|
||||||
}
|
}
|
||||||
else /* it's a length */
|
do {
|
||||||
|
DUMPBITS(t->bits)
|
||||||
|
if (e & 16)
|
||||||
{
|
{
|
||||||
/* get length of block to copy (already have extra bits) */
|
/* get extra bits for length */
|
||||||
|
e &= 15;
|
||||||
c = t->base + ((uInt)b & inflate_mask[e]);
|
c = t->base + ((uInt)b & inflate_mask[e]);
|
||||||
DUMPBITS(e);
|
DUMPBITS(e)
|
||||||
|
Tracevv((stderr, "inflate: * length %u\n", c));
|
||||||
|
|
||||||
/* decode distance base of block to copy */
|
/* decode distance base of block to copy */
|
||||||
GRABBITS(15); /* max bits for distance code */
|
GRABBITS(15); /* max bits for distance code */
|
||||||
if ((e = (t = td + ((uInt)b & md))->exop) < 0)
|
e = (t = td + ((uInt)b & md))->exop;
|
||||||
do {
|
do {
|
||||||
if (e == -128)
|
DUMPBITS(t->bits)
|
||||||
|
if (e & 16)
|
||||||
{
|
{
|
||||||
z->msg = "invalid distance code";
|
|
||||||
UNGRAB
|
|
||||||
UPDATE
|
|
||||||
return Z_DATA_ERROR;
|
|
||||||
}
|
|
||||||
DUMPBITS(t->bits)
|
|
||||||
e = -e;
|
|
||||||
} while ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) < 0);
|
|
||||||
DUMPBITS(t->bits)
|
|
||||||
|
|
||||||
/* get extra bits to add to distance base */
|
/* get extra bits to add to distance base */
|
||||||
|
e &= 15;
|
||||||
GRABBITS(e) /* get extra bits (up to 13) */
|
GRABBITS(e) /* get extra bits (up to 13) */
|
||||||
d = t->base + ((uInt)b & inflate_mask[e]);
|
d = t->base + ((uInt)b & inflate_mask[e]);
|
||||||
DUMPBITS(e)
|
DUMPBITS(e)
|
||||||
|
Tracevv((stderr, "inflate: * distance %u\n", d));
|
||||||
|
|
||||||
/* do the copy */
|
/* do the copy */
|
||||||
m -= c;
|
m -= c;
|
||||||
if (q - s->window >= d) /* if offset before destination, */
|
if ((uInt)(q - s->window) >= d) /* offset before dest */
|
||||||
{ /* just copy */
|
{ /* just copy */
|
||||||
r = q - d;
|
r = q - d;
|
||||||
*q++ = *r++; c--; /* minimum count is three, */
|
*q++ = *r++; c--; /* minimum count is three, */
|
||||||
*q++ = *r++; c--; /* so unroll loop a little */
|
*q++ = *r++; c--; /* so unroll loop a little */
|
||||||
do {
|
|
||||||
*q++ = *r++;
|
|
||||||
} while (--c);
|
|
||||||
}
|
}
|
||||||
else /* else offset after destination */
|
else /* else offset after destination */
|
||||||
{
|
{
|
||||||
@@ -134,11 +110,52 @@ z_stream *z;
|
|||||||
} while (--e);
|
} while (--e);
|
||||||
r = s->window; /* copy rest from start of window */
|
r = s->window; /* copy rest from start of window */
|
||||||
}
|
}
|
||||||
|
}
|
||||||
do { /* copy all or what's left */
|
do { /* copy all or what's left */
|
||||||
*q++ = *r++;
|
*q++ = *r++;
|
||||||
} while (--c);
|
} while (--c);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
else if ((e & 64) == 0)
|
||||||
|
e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop;
|
||||||
|
else
|
||||||
|
{
|
||||||
|
z->msg = "invalid distance code";
|
||||||
|
UNGRAB
|
||||||
|
UPDATE
|
||||||
|
return Z_DATA_ERROR;
|
||||||
|
}
|
||||||
|
} while (1);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if ((e & 64) == 0)
|
||||||
|
{
|
||||||
|
if ((e = (t = t->next + ((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 = "invalid literal/length code";
|
||||||
|
UNGRAB
|
||||||
|
UPDATE
|
||||||
|
return Z_DATA_ERROR;
|
||||||
|
}
|
||||||
|
} while (1);
|
||||||
} while (m >= 258 && n >= 10);
|
} while (m >= 258 && n >= 10);
|
||||||
|
|
||||||
/* not enough input or output--restore pointers and return */
|
/* not enough input or output--restore pointers and return */
|
||||||
|
|||||||
230
inflate-0.72.c
230
inflate-0.72.c
@@ -1,230 +0,0 @@
|
|||||||
/* inflate.c -- zlib interface to inflate modules
|
|
||||||
* Copyright (C) 1995 Mark Adler
|
|
||||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "zutil.h"
|
|
||||||
#include "infblock.h"
|
|
||||||
|
|
||||||
struct inflate_blocks_state {int dummy;}; /* for buggy compilers */
|
|
||||||
|
|
||||||
/* inflate private state */
|
|
||||||
struct internal_state {
|
|
||||||
|
|
||||||
/* mode */
|
|
||||||
enum {
|
|
||||||
METHOD, /* waiting for method byte */
|
|
||||||
FLAG, /* waiting for flag byte */
|
|
||||||
START, /* make new blocks state */
|
|
||||||
BLOCKS, /* decompressing blocks */
|
|
||||||
CHECK4, /* four check bytes to go */
|
|
||||||
CHECK3, /* three check bytes to go */
|
|
||||||
CHECK2, /* two check bytes to go */
|
|
||||||
CHECK1, /* one check byte to go */
|
|
||||||
DONE, /* finished check, done */
|
|
||||||
ERROR} /* got an error--stay here */
|
|
||||||
mode; /* current inflate mode */
|
|
||||||
|
|
||||||
/* mode dependent information */
|
|
||||||
union {
|
|
||||||
uInt method; /* if FLAGS, method byte */
|
|
||||||
struct inflate_blocks_state
|
|
||||||
*blocks; /* if BLOCKS, current state */
|
|
||||||
struct {
|
|
||||||
uLong was; /* computed check value */
|
|
||||||
uLong need; /* stream check value */
|
|
||||||
} check; /* if CHECK, check values to compare */
|
|
||||||
} sub; /* submode */
|
|
||||||
|
|
||||||
/* mode independent information */
|
|
||||||
int nowrap; /* flag for no wrapper */
|
|
||||||
uInt wbits; /* log2(window size) (8..15, defaults to 15) */
|
|
||||||
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
int inflateInit(z)
|
|
||||||
z_stream *z;
|
|
||||||
{
|
|
||||||
return inflateInit2(z, WBITS);
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
int inflateInit2(z, w)
|
|
||||||
z_stream *z;
|
|
||||||
int w;
|
|
||||||
{
|
|
||||||
/* initialize state */
|
|
||||||
if (z == Z_NULL)
|
|
||||||
return Z_STREAM_ERROR;
|
|
||||||
if (z->zalloc == Z_NULL) z->zalloc = zcalloc;
|
|
||||||
if (z->zfree == Z_NULL) z->zfree = zcfree;
|
|
||||||
z->total_in = z->total_out = 0;
|
|
||||||
z->msg = Z_NULL;
|
|
||||||
if ((z->state = (struct internal_state *)
|
|
||||||
ZALLOC(z,1,sizeof(struct internal_state))) == Z_NULL)
|
|
||||||
return Z_MEM_ERROR;
|
|
||||||
z->state->mode = METHOD;
|
|
||||||
|
|
||||||
/* handle undocumented nowrap option (no zlib header or check) */
|
|
||||||
z->state->nowrap = 0;
|
|
||||||
if (w < 0)
|
|
||||||
{
|
|
||||||
w = - w;
|
|
||||||
z->state->nowrap = 1;
|
|
||||||
z->state->mode = START;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* set window size */
|
|
||||||
if (w < 8 || w > 15)
|
|
||||||
{
|
|
||||||
inflateEnd(z);
|
|
||||||
return Z_STREAM_ERROR;
|
|
||||||
}
|
|
||||||
z->state->wbits = w;
|
|
||||||
return Z_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
#define NEXTBYTE (z->avail_in--,z->total_in++,*z->next_in++)
|
|
||||||
|
|
||||||
int inflate(z, f)
|
|
||||||
z_stream *z;
|
|
||||||
int f;
|
|
||||||
{
|
|
||||||
int r;
|
|
||||||
uInt b;
|
|
||||||
uLong c;
|
|
||||||
|
|
||||||
if (z == Z_NULL || z->next_in == Z_NULL)
|
|
||||||
return Z_STREAM_ERROR;
|
|
||||||
r = Z_BUF_ERROR;
|
|
||||||
while (1) switch (z->state->mode)
|
|
||||||
{
|
|
||||||
case METHOD:
|
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
|
||||||
if (((z->state->sub.method = NEXTBYTE) & 0xf != DEFLATED))
|
|
||||||
{
|
|
||||||
z->state->mode = ERROR;
|
|
||||||
z->msg = "unknown compression method";
|
|
||||||
return Z_DATA_ERROR;
|
|
||||||
}
|
|
||||||
if ((z->state->sub.method >> 4) > z->state->wbits)
|
|
||||||
{
|
|
||||||
z->state->mode = ERROR;
|
|
||||||
z->msg = "invalid window size";
|
|
||||||
return Z_DATA_ERROR;
|
|
||||||
}
|
|
||||||
z->state->mode = FLAG;
|
|
||||||
case FLAG:
|
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
|
||||||
if ((b = NEXTBYTE) & 0x20)
|
|
||||||
{
|
|
||||||
z->state->mode = ERROR;
|
|
||||||
z->msg = "invalid reserved bit";
|
|
||||||
return Z_DATA_ERROR;
|
|
||||||
}
|
|
||||||
if (((z->state->sub.method << 8) + b) % 31)
|
|
||||||
{
|
|
||||||
z->state->mode = ERROR;
|
|
||||||
z->msg = "incorrect header check";
|
|
||||||
return Z_DATA_ERROR;
|
|
||||||
}
|
|
||||||
z->state->mode = START;
|
|
||||||
case START:
|
|
||||||
if ((z->state->sub.blocks =
|
|
||||||
inflate_blocks_new(z,1<< z->state->wbits)) == Z_NULL)
|
|
||||||
return Z_MEM_ERROR;
|
|
||||||
z->state->mode = BLOCKS;
|
|
||||||
case BLOCKS:
|
|
||||||
if ((r = inflate_blocks(z->state->sub.blocks, z, r)) != Z_STREAM_END)
|
|
||||||
return r;
|
|
||||||
inflate_blocks_free(z->state->sub.blocks, z, &c, &r);
|
|
||||||
if (z->state->nowrap)
|
|
||||||
{
|
|
||||||
if (r != -1)
|
|
||||||
z->msg = "inflate bug--took one too many bytes";
|
|
||||||
z->state->mode = r == -1 ? DONE : ERROR;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
z->state->sub.check.was = c;
|
|
||||||
if (r != -1)
|
|
||||||
{
|
|
||||||
z->state->sub.check.need = (uLong)r << 24;
|
|
||||||
z->state->mode = CHECK3;
|
|
||||||
r = Z_OK;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
r = Z_OK;
|
|
||||||
z->state->mode = CHECK4;
|
|
||||||
case CHECK4:
|
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
|
||||||
z->state->sub.check.need = (uLong)NEXTBYTE << 24;
|
|
||||||
z->state->mode = CHECK3;
|
|
||||||
case CHECK3:
|
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
|
||||||
z->state->sub.check.need += (uLong)NEXTBYTE << 16;
|
|
||||||
z->state->mode = CHECK2;
|
|
||||||
case CHECK2:
|
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
|
||||||
z->state->sub.check.need += (uLong)NEXTBYTE << 8;
|
|
||||||
z->state->mode = CHECK1;
|
|
||||||
case CHECK1:
|
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
|
||||||
z->state->sub.check.need += (uLong)NEXTBYTE;
|
|
||||||
if (z->state->sub.check.was != z->state->sub.check.need)
|
|
||||||
{
|
|
||||||
z->state->mode = ERROR;
|
|
||||||
z->msg = "incorrect data check";
|
|
||||||
return Z_DATA_ERROR;
|
|
||||||
}
|
|
||||||
z->state->mode = DONE;
|
|
||||||
case DONE:
|
|
||||||
return Z_STREAM_END;
|
|
||||||
case ERROR:
|
|
||||||
return Z_DATA_ERROR;
|
|
||||||
default:
|
|
||||||
return Z_STREAM_ERROR;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
int inflateEnd(z)
|
|
||||||
z_stream *z;
|
|
||||||
{
|
|
||||||
uLong c;
|
|
||||||
int e;
|
|
||||||
|
|
||||||
if (z == Z_NULL || z->state == Z_NULL || z->zfree == Z_NULL)
|
|
||||||
return Z_STREAM_ERROR;
|
|
||||||
if (z->state->mode == BLOCKS)
|
|
||||||
inflate_blocks_free(z->state->sub.blocks, z, &c, &e);
|
|
||||||
ZFREE(z, z->state);
|
|
||||||
z->state = Z_NULL;
|
|
||||||
return Z_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* inflateSync not implemented yet--this just consumes input */
|
|
||||||
int inflateSync(z)
|
|
||||||
z_stream *z;
|
|
||||||
{
|
|
||||||
if (z == Z_NULL) return Z_STREAM_ERROR;
|
|
||||||
if (z->avail_in == 0) return Z_BUF_ERROR;
|
|
||||||
do {
|
|
||||||
z->total_in++;
|
|
||||||
} while (--z->avail_in);
|
|
||||||
return Z_DATA_ERROR;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* inflateReset not fully implemented yet--this frees and reallocates */
|
|
||||||
int inflateReset(z)
|
|
||||||
z_stream *z;
|
|
||||||
{
|
|
||||||
int r;
|
|
||||||
|
|
||||||
if ((r = inflateEnd(z)) != Z_OK)
|
|
||||||
return r;
|
|
||||||
return inflateInit(z);
|
|
||||||
}
|
|
||||||
220
inflate.c
220
inflate.c
@@ -15,38 +15,63 @@ struct internal_state {
|
|||||||
enum {
|
enum {
|
||||||
METHOD, /* waiting for method byte */
|
METHOD, /* waiting for method byte */
|
||||||
FLAG, /* waiting for flag byte */
|
FLAG, /* waiting for flag byte */
|
||||||
START, /* make new blocks state */
|
|
||||||
BLOCKS, /* decompressing blocks */
|
BLOCKS, /* decompressing blocks */
|
||||||
CHECK4, /* four check bytes to go */
|
CHECK4, /* four check bytes to go */
|
||||||
CHECK3, /* three check bytes to go */
|
CHECK3, /* three check bytes to go */
|
||||||
CHECK2, /* two check bytes to go */
|
CHECK2, /* two check bytes to go */
|
||||||
CHECK1, /* one check byte to go */
|
CHECK1, /* one check byte to go */
|
||||||
DONE, /* finished check, done */
|
DONE, /* finished check, done */
|
||||||
ERROR} /* got an error--stay here */
|
BAD} /* got an error--stay here */
|
||||||
mode; /* current inflate mode */
|
mode; /* current inflate mode */
|
||||||
|
|
||||||
/* mode dependent information */
|
/* mode dependent information */
|
||||||
union {
|
union {
|
||||||
uInt method; /* if FLAGS, method byte */
|
uInt method; /* if FLAGS, method byte */
|
||||||
struct inflate_blocks_state
|
|
||||||
*blocks; /* if BLOCKS, current state */
|
|
||||||
struct {
|
struct {
|
||||||
uLong was; /* computed check value */
|
uLong was; /* computed check value */
|
||||||
uLong need; /* stream check value */
|
uLong need; /* stream check value */
|
||||||
} check; /* if CHECK, check values to compare */
|
} check; /* if CHECK, check values to compare */
|
||||||
|
uInt marker; /* if BAD, inflateSync's marker bytes count */
|
||||||
} sub; /* submode */
|
} sub; /* submode */
|
||||||
|
|
||||||
/* mode independent information */
|
/* mode independent information */
|
||||||
int nowrap; /* flag for no wrapper */
|
int nowrap; /* flag for no wrapper */
|
||||||
uInt wbits; /* log2(window size) (8..15, defaults to 15) */
|
uInt wbits; /* log2(window size) (8..15, defaults to 15) */
|
||||||
|
struct inflate_blocks_state
|
||||||
|
*blocks; /* current inflate_blocks state */
|
||||||
|
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
||||||
int inflateInit(z)
|
int inflateReset(z)
|
||||||
z_stream *z;
|
z_stream *z;
|
||||||
{
|
{
|
||||||
return inflateInit2(z, WBITS);
|
uLong c;
|
||||||
|
|
||||||
|
if (z == Z_NULL || z->state == Z_NULL)
|
||||||
|
return Z_STREAM_ERROR;
|
||||||
|
z->total_in = z->total_out = 0;
|
||||||
|
z->msg = Z_NULL;
|
||||||
|
z->state->mode = z->state->nowrap ? BLOCKS : METHOD;
|
||||||
|
inflate_blocks_reset(z->state->blocks, z, &c);
|
||||||
|
Trace((stderr, "inflate: reset\n"));
|
||||||
|
return Z_OK;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int inflateEnd(z)
|
||||||
|
z_stream *z;
|
||||||
|
{
|
||||||
|
uLong c;
|
||||||
|
|
||||||
|
if (z == Z_NULL || z->state == Z_NULL || z->zfree == Z_NULL)
|
||||||
|
return Z_STREAM_ERROR;
|
||||||
|
if (z->state->blocks != Z_NULL)
|
||||||
|
inflate_blocks_free(z->state->blocks, z, &c);
|
||||||
|
ZFREE(z, z->state);
|
||||||
|
z->state = Z_NULL;
|
||||||
|
Trace((stderr, "inflate: end\n"));
|
||||||
|
return Z_OK;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
@@ -59,12 +84,10 @@ int w;
|
|||||||
return Z_STREAM_ERROR;
|
return Z_STREAM_ERROR;
|
||||||
if (z->zalloc == Z_NULL) z->zalloc = zcalloc;
|
if (z->zalloc == Z_NULL) z->zalloc = zcalloc;
|
||||||
if (z->zfree == Z_NULL) z->zfree = zcfree;
|
if (z->zfree == Z_NULL) z->zfree = zcfree;
|
||||||
z->total_in = z->total_out = 0;
|
|
||||||
z->msg = Z_NULL;
|
|
||||||
if ((z->state = (struct internal_state *)
|
if ((z->state = (struct internal_state *)
|
||||||
ZALLOC(z,1,sizeof(struct internal_state))) == Z_NULL)
|
ZALLOC(z,1,sizeof(struct internal_state))) == Z_NULL)
|
||||||
return Z_MEM_ERROR;
|
return Z_MEM_ERROR;
|
||||||
z->state->mode = METHOD;
|
z->state->blocks = Z_NULL;
|
||||||
|
|
||||||
/* handle undocumented nowrap option (no zlib header or check) */
|
/* handle undocumented nowrap option (no zlib header or check) */
|
||||||
z->state->nowrap = 0;
|
z->state->nowrap = 0;
|
||||||
@@ -72,7 +95,6 @@ int w;
|
|||||||
{
|
{
|
||||||
w = - w;
|
w = - w;
|
||||||
z->state->nowrap = 1;
|
z->state->nowrap = 1;
|
||||||
z->state->mode = START;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/* set window size */
|
/* set window size */
|
||||||
@@ -81,20 +103,40 @@ int w;
|
|||||||
inflateEnd(z);
|
inflateEnd(z);
|
||||||
return Z_STREAM_ERROR;
|
return Z_STREAM_ERROR;
|
||||||
}
|
}
|
||||||
z->state->wbits = w;
|
z->state->wbits = (uInt)w;
|
||||||
|
|
||||||
|
/* create inflate_blocks state */
|
||||||
|
if ((z->state->blocks =
|
||||||
|
inflate_blocks_new(z, z->state->nowrap ? Z_NULL : adler32, 1 << w))
|
||||||
|
== Z_NULL)
|
||||||
|
{
|
||||||
|
inflateEnd(z);
|
||||||
|
return Z_MEM_ERROR;
|
||||||
|
}
|
||||||
|
Trace((stderr, "inflate: allocated\n"));
|
||||||
|
|
||||||
|
/* reset state */
|
||||||
|
inflateReset(z);
|
||||||
return Z_OK;
|
return Z_OK;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int inflateInit(z)
|
||||||
|
z_stream *z;
|
||||||
|
{
|
||||||
|
return inflateInit2(z, DEF_WBITS);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
#define NEEDBYTE {if(z->avail_in==0)return r;r=Z_OK;}
|
||||||
#define NEXTBYTE (z->avail_in--,z->total_in++,*z->next_in++)
|
#define NEXTBYTE (z->avail_in--,z->total_in++,*z->next_in++)
|
||||||
|
|
||||||
int inflate(z, f)
|
int inflate(z, f)
|
||||||
z_stream *z;
|
z_stream *z;
|
||||||
int f;
|
int f;
|
||||||
{
|
{
|
||||||
int r;
|
int r = f; /* to avoid warning about unused f */
|
||||||
uInt b;
|
uInt b;
|
||||||
uLong c;
|
|
||||||
|
|
||||||
if (z == Z_NULL || z->next_in == Z_NULL)
|
if (z == Z_NULL || z->next_in == Z_NULL)
|
||||||
return Z_STREAM_ERROR;
|
return Z_STREAM_ERROR;
|
||||||
@@ -102,87 +144,86 @@ int f;
|
|||||||
while (1) switch (z->state->mode)
|
while (1) switch (z->state->mode)
|
||||||
{
|
{
|
||||||
case METHOD:
|
case METHOD:
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
NEEDBYTE
|
||||||
if (((z->state->sub.method = NEXTBYTE) & 0xf != DEFLATED))
|
if (((z->state->sub.method = NEXTBYTE) & 0xf) != DEFLATED)
|
||||||
{
|
{
|
||||||
z->state->mode = ERROR;
|
z->state->mode = BAD;
|
||||||
z->msg = "unknown compression method";
|
z->msg = "unknown compression method";
|
||||||
return Z_DATA_ERROR;
|
z->state->sub.marker = 5; /* can't try inflateSync */
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
if ((z->state->sub.method >> 4) + 8 > z->state->wbits)
|
if ((z->state->sub.method >> 4) + 8 > z->state->wbits)
|
||||||
{
|
{
|
||||||
z->state->mode = ERROR;
|
z->state->mode = BAD;
|
||||||
z->msg = "invalid window size";
|
z->msg = "invalid window size";
|
||||||
return Z_DATA_ERROR;
|
z->state->sub.marker = 5; /* can't try inflateSync */
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
z->state->mode = FLAG;
|
z->state->mode = FLAG;
|
||||||
case FLAG:
|
case FLAG:
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
NEEDBYTE
|
||||||
if ((b = NEXTBYTE) & 0x20)
|
if ((b = NEXTBYTE) & 0x20)
|
||||||
{
|
{
|
||||||
z->state->mode = ERROR;
|
z->state->mode = BAD;
|
||||||
z->msg = "invalid reserved bit";
|
z->msg = "invalid reserved bit";
|
||||||
return Z_DATA_ERROR;
|
z->state->sub.marker = 5; /* can't try inflateSync */
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
if (((z->state->sub.method << 8) + b) % 31)
|
if (((z->state->sub.method << 8) + b) % 31)
|
||||||
{
|
{
|
||||||
z->state->mode = ERROR;
|
z->state->mode = BAD;
|
||||||
z->msg = "incorrect header check";
|
z->msg = "incorrect header check";
|
||||||
return Z_DATA_ERROR;
|
z->state->sub.marker = 5; /* can't try inflateSync */
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
z->state->mode = START;
|
Trace((stderr, "inflate: zlib header ok\n"));
|
||||||
case START:
|
|
||||||
if ((z->state->sub.blocks = inflate_blocks_new(z,
|
|
||||||
z->state->nowrap ? Z_NULL : adler32,
|
|
||||||
1<< z->state->wbits)) == Z_NULL)
|
|
||||||
return Z_MEM_ERROR;
|
|
||||||
z->state->mode = BLOCKS;
|
z->state->mode = BLOCKS;
|
||||||
case BLOCKS:
|
case BLOCKS:
|
||||||
if ((r = inflate_blocks(z->state->sub.blocks, z, r)) != Z_STREAM_END)
|
r = inflate_blocks(z->state->blocks, z, r);
|
||||||
|
if (r == Z_DATA_ERROR)
|
||||||
|
{
|
||||||
|
z->state->mode = BAD;
|
||||||
|
z->state->sub.marker = 0; /* can try inflateSync */
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if (r != Z_STREAM_END)
|
||||||
return r;
|
return r;
|
||||||
inflate_blocks_free(z->state->sub.blocks, z, &c, &r);
|
r = Z_OK;
|
||||||
|
inflate_blocks_reset(z->state->blocks, z, &z->state->sub.check.was);
|
||||||
if (z->state->nowrap)
|
if (z->state->nowrap)
|
||||||
{
|
{
|
||||||
if (r != -1)
|
z->state->mode = DONE;
|
||||||
z->msg = "inflate bug--took one too many bytes";
|
|
||||||
z->state->mode = r == -1 ? DONE : ERROR;
|
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
z->state->sub.check.was = c;
|
|
||||||
if (r != -1)
|
|
||||||
{
|
|
||||||
z->state->sub.check.need = (uLong)r << 24;
|
|
||||||
z->state->mode = CHECK3;
|
|
||||||
r = Z_OK;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
r = Z_OK;
|
|
||||||
z->state->mode = CHECK4;
|
z->state->mode = CHECK4;
|
||||||
case CHECK4:
|
case CHECK4:
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
NEEDBYTE
|
||||||
z->state->sub.check.need = (uLong)NEXTBYTE << 24;
|
z->state->sub.check.need = (uLong)NEXTBYTE << 24;
|
||||||
z->state->mode = CHECK3;
|
z->state->mode = CHECK3;
|
||||||
case CHECK3:
|
case CHECK3:
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
NEEDBYTE
|
||||||
z->state->sub.check.need += (uLong)NEXTBYTE << 16;
|
z->state->sub.check.need += (uLong)NEXTBYTE << 16;
|
||||||
z->state->mode = CHECK2;
|
z->state->mode = CHECK2;
|
||||||
case CHECK2:
|
case CHECK2:
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
NEEDBYTE
|
||||||
z->state->sub.check.need += (uLong)NEXTBYTE << 8;
|
z->state->sub.check.need += (uLong)NEXTBYTE << 8;
|
||||||
z->state->mode = CHECK1;
|
z->state->mode = CHECK1;
|
||||||
case CHECK1:
|
case CHECK1:
|
||||||
if (z->avail_in == 0) return r; r = Z_OK;
|
NEEDBYTE
|
||||||
z->state->sub.check.need += (uLong)NEXTBYTE;
|
z->state->sub.check.need += (uLong)NEXTBYTE;
|
||||||
|
|
||||||
if (z->state->sub.check.was != z->state->sub.check.need)
|
if (z->state->sub.check.was != z->state->sub.check.need)
|
||||||
{
|
{
|
||||||
z->state->mode = ERROR;
|
z->state->mode = BAD;
|
||||||
z->msg = "incorrect data check";
|
z->msg = "incorrect data check";
|
||||||
return Z_DATA_ERROR;
|
z->state->sub.marker = 5; /* can't try inflateSync */
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
|
Trace((stderr, "inflate: zlib check ok\n"));
|
||||||
z->state->mode = DONE;
|
z->state->mode = DONE;
|
||||||
case DONE:
|
case DONE:
|
||||||
return Z_STREAM_END;
|
return Z_STREAM_END;
|
||||||
case ERROR:
|
case BAD:
|
||||||
return Z_DATA_ERROR;
|
return Z_DATA_ERROR;
|
||||||
default:
|
default:
|
||||||
return Z_STREAM_ERROR;
|
return Z_STREAM_ERROR;
|
||||||
@@ -190,42 +231,51 @@ int f;
|
|||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
int inflateEnd(z)
|
|
||||||
z_stream *z;
|
|
||||||
{
|
|
||||||
uLong c;
|
|
||||||
int e;
|
|
||||||
|
|
||||||
if (z == Z_NULL || z->state == Z_NULL || z->zfree == Z_NULL)
|
|
||||||
return Z_STREAM_ERROR;
|
|
||||||
if (z->state->mode == BLOCKS)
|
|
||||||
inflate_blocks_free(z->state->sub.blocks, z, &c, &e);
|
|
||||||
ZFREE(z, z->state);
|
|
||||||
z->state = Z_NULL;
|
|
||||||
return Z_OK;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* inflateSync not implemented yet--this just consumes input */
|
|
||||||
int inflateSync(z)
|
int inflateSync(z)
|
||||||
z_stream *z;
|
z_stream *z;
|
||||||
{
|
{
|
||||||
if (z == Z_NULL) return Z_STREAM_ERROR;
|
uInt n; /* number of bytes to look at */
|
||||||
if (z->avail_in == 0) return Z_BUF_ERROR;
|
Byte *p; /* pointer to bytes */
|
||||||
do {
|
uInt m; /* number of marker bytes found in a row */
|
||||||
z->total_in++;
|
uLong r, w; /* temporaries to save total_in and total_out */
|
||||||
} while (--z->avail_in);
|
|
||||||
|
/* set up */
|
||||||
|
if (z == Z_NULL || z->state == Z_NULL)
|
||||||
|
return Z_STREAM_ERROR;
|
||||||
|
if (z->state->mode != BAD)
|
||||||
|
{
|
||||||
|
z->state->mode = BAD;
|
||||||
|
z->state->sub.marker = 0;
|
||||||
|
}
|
||||||
|
if ((n = z->avail_in) == 0)
|
||||||
|
return Z_BUF_ERROR;
|
||||||
|
p = z->next_in;
|
||||||
|
m = z->state->sub.marker;
|
||||||
|
|
||||||
|
/* search */
|
||||||
|
while (n && m < 4)
|
||||||
|
{
|
||||||
|
if (*p == (Byte)(m < 2 ? 0 : 0xff))
|
||||||
|
m++;
|
||||||
|
else if (*p)
|
||||||
|
m = 0;
|
||||||
|
else
|
||||||
|
m = 4 - m;
|
||||||
|
p++, n--;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* restore */
|
||||||
|
z->total_in += p - z->next_in;
|
||||||
|
z->next_in = p;
|
||||||
|
z->avail_in = n;
|
||||||
|
z->state->sub.marker = m;
|
||||||
|
|
||||||
|
/* return no joy or set up to restart on a new block */
|
||||||
|
if (m != 4)
|
||||||
return Z_DATA_ERROR;
|
return Z_DATA_ERROR;
|
||||||
}
|
r = z->total_in; w = z->total_out;
|
||||||
|
inflateReset(z);
|
||||||
|
z->total_in = r; z->total_out = w;
|
||||||
/* inflateReset not fully implemented yet--this frees and reallocates */
|
z->state->mode = BLOCKS;
|
||||||
int inflateReset(z)
|
return Z_OK;
|
||||||
z_stream *z;
|
|
||||||
{
|
|
||||||
int r;
|
|
||||||
|
|
||||||
if ((r = inflateEnd(z)) != Z_OK)
|
|
||||||
return r;
|
|
||||||
return inflateInit(z);
|
|
||||||
}
|
}
|
||||||
|
|||||||
67
inftest.c
67
inftest.c
@@ -1,67 +0,0 @@
|
|||||||
#include <stdio.h>
|
|
||||||
#include <stdlib.h>
|
|
||||||
#include "zutil.h"
|
|
||||||
|
|
||||||
/* This test is in honor of Ed Hamrick who suggested that the interface
|
|
||||||
to inflate be a byte at a time--this implements that, and is, of course,
|
|
||||||
monumentally slow. It has the virtue though of stressing the push-pull
|
|
||||||
interface for testing purposes. */
|
|
||||||
|
|
||||||
void main()
|
|
||||||
{
|
|
||||||
int a, r;
|
|
||||||
char c;
|
|
||||||
z_stream z;
|
|
||||||
|
|
||||||
z.zalloc = Z_NULL;
|
|
||||||
z.zfree = Z_NULL;
|
|
||||||
r = inflateInit(&z);
|
|
||||||
if (r != Z_OK)
|
|
||||||
fprintf(stderr, "init error: %s\n", z_errmsg[1 - r]);
|
|
||||||
while ((a = getchar()) != EOF)
|
|
||||||
{
|
|
||||||
/* feed one byte of input */
|
|
||||||
z.avail_out = 0;
|
|
||||||
c = (char)a;
|
|
||||||
z.next_in = (Byte*)&c;
|
|
||||||
z.avail_in = 1;
|
|
||||||
r = inflate(&z, 0);
|
|
||||||
if (r == Z_STREAM_END)
|
|
||||||
break;
|
|
||||||
if (r != Z_OK)
|
|
||||||
{
|
|
||||||
fprintf(stderr, "inflate error: %s\n", z_errmsg[1 - r]);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
if (z.avail_in != 0)
|
|
||||||
{
|
|
||||||
fprintf(stderr, "inflate didn't eat byte and didn't say buf err!\n");
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* empty output one byte at a time */
|
|
||||||
while (1)
|
|
||||||
{
|
|
||||||
z.next_out = (Byte*)&c;
|
|
||||||
z.avail_out = 1;
|
|
||||||
r = inflate(&z, 0);
|
|
||||||
if (r == Z_STREAM_END)
|
|
||||||
break;
|
|
||||||
if (r != Z_OK && r != Z_BUF_ERROR)
|
|
||||||
{
|
|
||||||
fprintf(stderr, "inflate error: %s\n", z_errmsg[1 - r]);
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
if (z.avail_out == 0)
|
|
||||||
putchar(c);
|
|
||||||
else
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
if (r != Z_OK && r != Z_BUF_ERROR)
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
inflateEnd(&z);
|
|
||||||
fprintf(stderr, "%d bytes in, %d bytes out\n", z.total_in, z.total_out);
|
|
||||||
if (z.msg != NULL)
|
|
||||||
fprintf(stderr, "msg is <%s>\n", z.msg);
|
|
||||||
}
|
|
||||||
20
inftrees.c
20
inftrees.c
@@ -41,7 +41,7 @@ local uInt cplens[] = { /* Copy lengths for literal codes 257..285 */
|
|||||||
/* actually lengths - 2; also see note #13 above about 258 */
|
/* actually lengths - 2; also see note #13 above about 258 */
|
||||||
local uInt cplext[] = { /* Extra bits for literal codes 257..285 */
|
local uInt cplext[] = { /* Extra bits for literal codes 257..285 */
|
||||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2,
|
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, 128, 128}; /* 128==invalid */
|
3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 192, 192}; /* 192==invalid */
|
||||||
local uInt cpdist[] = { /* Copy offsets for distance codes 0..29 */
|
local uInt cpdist[] = { /* Copy offsets for distance codes 0..29 */
|
||||||
1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
|
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,
|
257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
|
||||||
@@ -245,8 +245,8 @@ z_stream *zs; /* for zalloc function */
|
|||||||
if (h)
|
if (h)
|
||||||
{
|
{
|
||||||
x[h] = i; /* save pattern for backing up */
|
x[h] = i; /* save pattern for backing up */
|
||||||
r.bits = (char)l; /* bits to dump before this table */
|
r.bits = (Byte)l; /* bits to dump before this table */
|
||||||
r.exop = -(char)j; /* bits in this table */
|
r.exop = j; /* bits in this table */
|
||||||
r.next = q; /* pointer to this table */
|
r.next = q; /* pointer to this table */
|
||||||
j = i >> (w - l); /* (get around Turbo C bug) */
|
j = i >> (w - l); /* (get around Turbo C bug) */
|
||||||
u[h-1][j] = r; /* connect to last table */
|
u[h-1][j] = r; /* connect to last table */
|
||||||
@@ -254,17 +254,17 @@ z_stream *zs; /* for zalloc function */
|
|||||||
}
|
}
|
||||||
|
|
||||||
/* set up table entry in r */
|
/* set up table entry in r */
|
||||||
r.bits = (char)(k - w);
|
r.bits = (Byte)(k - w);
|
||||||
if (p >= v + n)
|
if (p >= v + n)
|
||||||
r.exop = -128; /* out of values--invalid code */
|
r.exop = 128 + 64; /* out of values--invalid code */
|
||||||
else if (*p < s)
|
else if (*p < s)
|
||||||
{
|
{
|
||||||
r.exop = (char)(*p < 256 ? 16 : -64); /* 256 is end-of-block code */
|
r.exop = (*p < 256 ? 0 : 32 + 64); /* 256 is end-of-block */
|
||||||
r.base = *p++; /* simple code is just the value */
|
r.base = *p++; /* simple code is just the value */
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
r.exop = (char)e[*p - s]; /* non-simple--look up in lists */
|
r.exop = e[*p - s] + 16 + 64; /* non-simple--look up in lists */
|
||||||
r.base = d[*p++ - s];
|
r.base = d[*p++ - s];
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -383,6 +383,7 @@ uInt s; /* size of item */
|
|||||||
{
|
{
|
||||||
Assert(s == sizeof(inflate_huft) && n <= fixed_left,
|
Assert(s == sizeof(inflate_huft) && n <= fixed_left,
|
||||||
"inflate_trees falloc overflow");
|
"inflate_trees falloc overflow");
|
||||||
|
if (q) s++; /* to make some compilers happy */
|
||||||
fixed_left -= n;
|
fixed_left -= n;
|
||||||
return (voidp)(fixed_mem + fixed_left);
|
return (voidp)(fixed_mem + fixed_left);
|
||||||
}
|
}
|
||||||
@@ -393,6 +394,7 @@ voidp q;
|
|||||||
voidp p;
|
voidp p;
|
||||||
{
|
{
|
||||||
Assert(0, "inflate_trees ffree called!");
|
Assert(0, "inflate_trees ffree called!");
|
||||||
|
if (q) q = p; /* to make some compilers happy */
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
@@ -455,10 +457,6 @@ z_stream *z; /* for zfree function */
|
|||||||
{
|
{
|
||||||
register inflate_huft *p, *q;
|
register inflate_huft *p, *q;
|
||||||
|
|
||||||
/* Don't free fixed trees */
|
|
||||||
if (t >= fixed_mem && t <= fixed_mem + FIXEDH)
|
|
||||||
return Z_OK;
|
|
||||||
|
|
||||||
/* Go through linked list, freeing from the malloced (t[-1]) address. */
|
/* Go through linked list, freeing from the malloced (t[-1]) address. */
|
||||||
p = t;
|
p = t;
|
||||||
while (p != Z_NULL)
|
while (p != Z_NULL)
|
||||||
|
|||||||
11
inftrees.h
11
inftrees.h
@@ -9,19 +9,14 @@
|
|||||||
*/
|
*/
|
||||||
|
|
||||||
/* Huffman code lookup table entry--this entry is four bytes for machines
|
/* Huffman code lookup table entry--this entry is four bytes for machines
|
||||||
that have 16-bit pointers (e.g. PC's in the small or medium model).
|
that have 16-bit pointers (e.g. PC's in the small or medium model). */
|
||||||
Valid extra bits (exop) are 0..13. exop == -64 is EOB (end of block),
|
|
||||||
exop == 16 means that v is a literal, exop < 0 means that v is a pointer
|
|
||||||
to the next table, which codes -exop bits, and lastly exop == -128
|
|
||||||
indicates an unused code. If a code with exop == -128 is looked up,
|
|
||||||
this implies an error in the data. */
|
|
||||||
|
|
||||||
typedef struct inflate_huft_s inflate_huft;
|
typedef struct inflate_huft_s inflate_huft;
|
||||||
struct inflate_huft_s {
|
struct inflate_huft_s {
|
||||||
union {
|
union {
|
||||||
struct {
|
struct {
|
||||||
char Exop; /* number of extra bits or operation */
|
Byte Exop; /* number of extra bits or operation */
|
||||||
char Bits; /* number of bits in this code or subcode */
|
Byte Bits; /* number of bits in this code or subcode */
|
||||||
} what;
|
} what;
|
||||||
Byte *pad; /* pad structure to a power of 2 (4 bytes for */
|
Byte *pad; /* pad structure to a power of 2 (4 bytes for */
|
||||||
} word; /* 16-bit, 8 bytes for 32-bit machines) */
|
} word; /* 16-bit, 8 bytes for 32-bit machines) */
|
||||||
|
|||||||
12
infutil.c
12
infutil.c
@@ -31,7 +31,7 @@ int r;
|
|||||||
q = s->read;
|
q = s->read;
|
||||||
|
|
||||||
/* compute number of bytes to copy as far as end of window */
|
/* compute number of bytes to copy as far as end of window */
|
||||||
n = (q <= s->write ? s->write : s->end) - q;
|
n = (uInt)((q <= s->write ? s->write : s->end) - q);
|
||||||
if (n > z->avail_out) n = z->avail_out;
|
if (n > z->avail_out) n = z->avail_out;
|
||||||
if (n && r == Z_BUF_ERROR) r = Z_OK;
|
if (n && r == Z_BUF_ERROR) r = Z_OK;
|
||||||
|
|
||||||
@@ -44,7 +44,9 @@ int r;
|
|||||||
s->check = (*s->checkfn)(s->check, q, n);
|
s->check = (*s->checkfn)(s->check, q, n);
|
||||||
|
|
||||||
/* copy as far as end of window */
|
/* copy as far as end of window */
|
||||||
while (n--) *p++ = *q++;
|
zmemcpy(p, q, n);
|
||||||
|
p += n;
|
||||||
|
q += n;
|
||||||
|
|
||||||
/* see if more to copy at beginning of window */
|
/* see if more to copy at beginning of window */
|
||||||
if (q == s->end)
|
if (q == s->end)
|
||||||
@@ -55,7 +57,7 @@ int r;
|
|||||||
s->write = s->window;
|
s->write = s->window;
|
||||||
|
|
||||||
/* compute bytes to copy */
|
/* compute bytes to copy */
|
||||||
n = s->write - q;
|
n = (uInt)(s->write - q);
|
||||||
if (n > z->avail_out) n = z->avail_out;
|
if (n > z->avail_out) n = z->avail_out;
|
||||||
if (n && r == Z_BUF_ERROR) r = Z_OK;
|
if (n && r == Z_BUF_ERROR) r = Z_OK;
|
||||||
|
|
||||||
@@ -68,7 +70,9 @@ int r;
|
|||||||
s->check = (*s->checkfn)(s->check, q, n);
|
s->check = (*s->checkfn)(s->check, q, n);
|
||||||
|
|
||||||
/* copy */
|
/* copy */
|
||||||
while (n--) *p++ = *q++;
|
zmemcpy(p, q, n);
|
||||||
|
p += n;
|
||||||
|
q += n;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* update pointers */
|
/* update pointers */
|
||||||
|
|||||||
@@ -22,7 +22,7 @@ struct inflate_blocks_state {
|
|||||||
CODES, /* processing fixed or dynamic block */
|
CODES, /* processing fixed or dynamic block */
|
||||||
DRY, /* output remaining window bytes */
|
DRY, /* output remaining window bytes */
|
||||||
DONE, /* finished last block, done */
|
DONE, /* finished last block, done */
|
||||||
ERROR} /* got a data error--stuck here */
|
BAD} /* got a data error--stuck here */
|
||||||
mode; /* current inflate_block mode */
|
mode; /* current inflate_block mode */
|
||||||
|
|
||||||
/* mode dependent information */
|
/* mode dependent information */
|
||||||
@@ -35,8 +35,11 @@ struct inflate_blocks_state {
|
|||||||
uInt bb; /* bit length tree depth */
|
uInt bb; /* bit length tree depth */
|
||||||
inflate_huft *tb; /* bit length decoding tree */
|
inflate_huft *tb; /* bit length decoding tree */
|
||||||
} trees; /* if DTREE, decoding info for trees */
|
} trees; /* if DTREE, decoding info for trees */
|
||||||
|
struct {
|
||||||
|
inflate_huft *tl, *td; /* trees to free */
|
||||||
struct inflate_codes_state
|
struct inflate_codes_state
|
||||||
*codes; /* if CODES, current state */
|
*codes;
|
||||||
|
} decode; /* if CODES, current state */
|
||||||
} sub; /* submode */
|
} sub; /* submode */
|
||||||
uInt last; /* true if this block is the last block */
|
uInt last; /* true if this block is the last block */
|
||||||
|
|
||||||
|
|||||||
21
minigzip.c
21
minigzip.c
@@ -13,15 +13,23 @@
|
|||||||
* or in pipe mode.
|
* or in pipe mode.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: minigzip.c,v 1.2 1995/04/14 20:03:12 jloup Exp $ */
|
/* $Id: minigzip.c,v 1.5 1995/05/03 17:27:11 jloup Exp $ */
|
||||||
|
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
#include "zlib.h"
|
#include "zlib.h"
|
||||||
|
|
||||||
|
#ifndef __GO32__
|
||||||
extern void exit __P((int));
|
extern void exit __P((int));
|
||||||
|
#endif
|
||||||
|
extern int unlink __P((const char *));
|
||||||
|
|
||||||
#ifdef MSDOS
|
#ifdef STDC
|
||||||
# include <fcntl.h> /* ??? find where setmode declared */
|
# include <string.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if defined(MSDOS) || defined(OS2) || defined(WIN32)
|
||||||
|
# include <fcntl.h>
|
||||||
|
# include <io.h>
|
||||||
# define SET_BINARY_MODE(file) setmode(fileno(file), O_BINARY)
|
# define SET_BINARY_MODE(file) setmode(fileno(file), O_BINARY)
|
||||||
#else
|
#else
|
||||||
# define SET_BINARY_MODE(file)
|
# define SET_BINARY_MODE(file)
|
||||||
@@ -38,6 +46,13 @@ extern void exit __P((int));
|
|||||||
|
|
||||||
char *prog;
|
char *prog;
|
||||||
|
|
||||||
|
void error __P((char *msg));
|
||||||
|
void gz_compress __P((FILE *in, gzFile out));
|
||||||
|
void gz_uncompress __P((gzFile in, FILE *out));
|
||||||
|
void file_compress __P((char *file));
|
||||||
|
void file_uncompress __P((char *file));
|
||||||
|
void main __P((int argc, char *argv[]));
|
||||||
|
|
||||||
/* ===========================================================================
|
/* ===========================================================================
|
||||||
* Display error message and exit
|
* Display error message and exit
|
||||||
*/
|
*/
|
||||||
|
|||||||
49
trees.c
49
trees.c
@@ -29,7 +29,7 @@
|
|||||||
* Addison-Wesley, 1983. ISBN 0-201-06672-6.
|
* Addison-Wesley, 1983. ISBN 0-201-06672-6.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: trees.c,v 1.2 1995/04/10 16:21:44 jloup Exp $ */
|
/* $Id: trees.c,v 1.5 1995/05/03 17:27:12 jloup Exp $ */
|
||||||
|
|
||||||
#include "deflate.h"
|
#include "deflate.h"
|
||||||
|
|
||||||
@@ -722,6 +722,33 @@ local void send_all_trees(s, lcodes, dcodes, blcodes)
|
|||||||
Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
|
Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/* ===========================================================================
|
||||||
|
* Send a stored block
|
||||||
|
*/
|
||||||
|
void ct_stored_block(s, buf, stored_len, eof)
|
||||||
|
deflate_state *s;
|
||||||
|
char *buf; /* input block */
|
||||||
|
ulg stored_len; /* length of input block */
|
||||||
|
int eof; /* true if this is the last block for a file */
|
||||||
|
{
|
||||||
|
send_bits(s, (STORED_BLOCK<<1)+eof, 3); /* send block type */
|
||||||
|
s->compressed_len = (s->compressed_len + 3 + 7) & ~7L;
|
||||||
|
s->compressed_len += (stored_len + 4) << 3;
|
||||||
|
|
||||||
|
copy_block(s, buf, (unsigned)stored_len, 1); /* with header */
|
||||||
|
}
|
||||||
|
|
||||||
|
/* ===========================================================================
|
||||||
|
* Send one empty static block to give enough lookahead for inflate
|
||||||
|
*/
|
||||||
|
void ct_align(s)
|
||||||
|
deflate_state *s;
|
||||||
|
{
|
||||||
|
send_bits(s, STATIC_TREES<<1, 3);
|
||||||
|
send_code(s, END_BLOCK, static_ltree);
|
||||||
|
s->compressed_len += 10L; /* 3 for block type, 7 for EOB */
|
||||||
|
}
|
||||||
|
|
||||||
/* ===========================================================================
|
/* ===========================================================================
|
||||||
* Determine the best encoding for the current block: dynamic trees, static
|
* Determine the best encoding for the current block: dynamic trees, static
|
||||||
* trees or store, and output the encoded block to the zip file. This function
|
* trees or store, and output the encoded block to the zip file. This function
|
||||||
@@ -771,8 +798,8 @@ ulg ct_flush_block(s, buf, stored_len, eof)
|
|||||||
* the whole file is transformed into a stored file:
|
* the whole file is transformed into a stored file:
|
||||||
*/
|
*/
|
||||||
#ifdef STORED_FILE_OK
|
#ifdef STORED_FILE_OK
|
||||||
# ifdef FORCE_METHOD
|
# ifdef FORCE_STORED_FILE
|
||||||
if (level == 1 && eof && compressed_len == 0L) { /* force stored file */
|
if (eof && compressed_len == 0L) { /* force stored file */
|
||||||
# else
|
# else
|
||||||
if (stored_len <= opt_lenb && eof && s->compressed_len==0L && seekable()) {
|
if (stored_len <= opt_lenb && eof && s->compressed_len==0L && seekable()) {
|
||||||
# endif
|
# endif
|
||||||
@@ -785,8 +812,8 @@ ulg ct_flush_block(s, buf, stored_len, eof)
|
|||||||
} else
|
} else
|
||||||
#endif /* STORED_FILE_OK */
|
#endif /* STORED_FILE_OK */
|
||||||
|
|
||||||
#ifdef FORCE_METHOD
|
#ifdef FORCE_STORED
|
||||||
if (level == 2 && buf != (char*)0) { /* force stored block */
|
if (buf != (char*)0) { /* force stored block */
|
||||||
#else
|
#else
|
||||||
if (stored_len+4 <= opt_lenb && buf != (char*)0) {
|
if (stored_len+4 <= opt_lenb && buf != (char*)0) {
|
||||||
/* 4: two words for the lengths */
|
/* 4: two words for the lengths */
|
||||||
@@ -797,14 +824,10 @@ ulg ct_flush_block(s, buf, stored_len, eof)
|
|||||||
* successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
|
* successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
|
||||||
* transform a block into a stored block.
|
* transform a block into a stored block.
|
||||||
*/
|
*/
|
||||||
send_bits(s, (STORED_BLOCK<<1)+eof, 3); /* send block type */
|
ct_stored_block(s, buf, stored_len, eof);
|
||||||
s->compressed_len = (s->compressed_len + 3 + 7) & ~7L;
|
|
||||||
s->compressed_len += (stored_len + 4) << 3;
|
|
||||||
|
|
||||||
copy_block(s, buf, (unsigned)stored_len, 1); /* with header */
|
#ifdef FORCE_STATIC
|
||||||
|
} else if (static_lenb >= 0) { /* force static trees */
|
||||||
#ifdef FORCE_METHOD
|
|
||||||
} else if (level == 3) { /* force static trees */
|
|
||||||
#else
|
#else
|
||||||
} else if (static_lenb == opt_lenb) {
|
} else if (static_lenb == opt_lenb) {
|
||||||
#endif
|
#endif
|
||||||
@@ -944,7 +967,7 @@ local void set_data_type(s)
|
|||||||
while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
|
while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
|
||||||
while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
|
while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
|
||||||
while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;
|
while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;
|
||||||
s->data_type = bin_freq > (ascii_freq >> 2) ? BINARY : ASCII;
|
s->data_type = (Byte)(bin_freq > (ascii_freq >> 2) ? BINARY : ASCII);
|
||||||
}
|
}
|
||||||
|
|
||||||
/* ===========================================================================
|
/* ===========================================================================
|
||||||
|
|||||||
@@ -3,7 +3,7 @@
|
|||||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: uncompr.c,v 1.4 1995/04/10 16:22:22 jloup Exp $ */
|
/* $Id: uncompr.c,v 1.5 1995/05/03 17:27:12 jloup Exp $ */
|
||||||
|
|
||||||
#include "zlib.h"
|
#include "zlib.h"
|
||||||
|
|
||||||
|
|||||||
48
zconf.h
48
zconf.h
@@ -3,7 +3,7 @@
|
|||||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: zconf.h,v 1.8 1995/04/14 20:59:22 jloup Exp $ */
|
/* $Id: zconf.h,v 1.12 1995/05/03 17:27:12 jloup Exp $ */
|
||||||
|
|
||||||
#ifndef _ZCONF_H
|
#ifndef _ZCONF_H
|
||||||
#define _ZCONF_H
|
#define _ZCONF_H
|
||||||
@@ -28,17 +28,47 @@
|
|||||||
#if defined(MSDOS) && !defined(__32BIT__)
|
#if defined(MSDOS) && !defined(__32BIT__)
|
||||||
# define MAXSEG_64K
|
# define MAXSEG_64K
|
||||||
#endif
|
#endif
|
||||||
|
#ifndef STDC
|
||||||
#ifdef MAXSEG_64K
|
# if defined(MSDOS) || defined(__STDC__) || defined(__cplusplus)
|
||||||
# define MAX_MEM_LEVEL 8
|
# define STDC
|
||||||
#else
|
# endif
|
||||||
# define MAX_MEM_LEVEL 9
|
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
#if !defined(STDC) && !defined(const)
|
||||||
|
# define const
|
||||||
|
#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 */
|
||||||
|
#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 */
|
/* Type declarations */
|
||||||
|
|
||||||
#ifndef __P /* function prototypes */
|
#ifndef __P /* function prototypes */
|
||||||
# if defined(__STDC__) || defined(MSDOS)
|
# ifdef STDC
|
||||||
# define __P(args) args
|
# define __P(args) args
|
||||||
# else
|
# else
|
||||||
# define __P(args) ()
|
# define __P(args) ()
|
||||||
@@ -49,13 +79,13 @@
|
|||||||
typedef unsigned char Byte; /* 8 bits */
|
typedef unsigned char Byte; /* 8 bits */
|
||||||
#endif
|
#endif
|
||||||
#ifndef uInt
|
#ifndef uInt
|
||||||
typedef unsigned int uInt; /* may be 16 or 32 bits */
|
typedef unsigned int uInt; /* 16 bits or more */
|
||||||
#endif
|
#endif
|
||||||
#ifndef uLong
|
#ifndef uLong
|
||||||
typedef unsigned long uLong; /* 32 bits or more */
|
typedef unsigned long uLong; /* 32 bits or more */
|
||||||
#endif
|
#endif
|
||||||
#ifndef voidp
|
#ifndef voidp
|
||||||
# if defined(__STDC__) || defined(MSDOS)
|
# ifdef STDC
|
||||||
typedef void *voidp;
|
typedef void *voidp;
|
||||||
# else
|
# else
|
||||||
typedef Byte *voidp;
|
typedef Byte *voidp;
|
||||||
|
|||||||
76
zlib.h
76
zlib.h
@@ -1,5 +1,5 @@
|
|||||||
/* zlib.h -- interface of the 'zlib' general purpose compression library
|
/* zlib.h -- interface of the 'zlib' general purpose compression library
|
||||||
version 0.79 April 28th, 1995.
|
version 0.93 June 25th, 1995.
|
||||||
|
|
||||||
Copyright (C) 1995 Jean-loup Gailly and Mark Adler
|
Copyright (C) 1995 Jean-loup Gailly and Mark Adler
|
||||||
|
|
||||||
@@ -20,7 +20,7 @@
|
|||||||
3. This notice may not be removed or altered from any source distribution.
|
3. This notice may not be removed or altered from any source distribution.
|
||||||
|
|
||||||
Jean-loup Gailly Mark Adler
|
Jean-loup Gailly Mark Adler
|
||||||
gzip@prep.ai.mit.edu madler@cco.caltech.edu
|
gzip@prep.ai.mit.edu madler@alumni.caltech.edu
|
||||||
*/
|
*/
|
||||||
|
|
||||||
#ifndef _ZLIB_H
|
#ifndef _ZLIB_H
|
||||||
@@ -28,7 +28,7 @@
|
|||||||
|
|
||||||
#include "zconf.h"
|
#include "zconf.h"
|
||||||
|
|
||||||
#define ZLIB_VERSION "0.79"
|
#define ZLIB_VERSION "0.93"
|
||||||
|
|
||||||
/*
|
/*
|
||||||
The 'zlib' compression library provides in-memory compression and
|
The 'zlib' compression library provides in-memory compression and
|
||||||
@@ -81,7 +81,7 @@ typedef struct z_stream_s {
|
|||||||
opaque before calling the init function. All other fields are set by the
|
opaque before calling the init function. All other fields are set by the
|
||||||
compression library and must not be updated by the application.
|
compression library and must not be updated by the application.
|
||||||
|
|
||||||
The opaque value provided by the application will be passed as first
|
The opaque value provided by the application will be passed as the first
|
||||||
parameter for calls of zalloc and zfree. This can be useful for custom
|
parameter for calls of zalloc and zfree. This can be useful for custom
|
||||||
memory management. The compression library attaches no meaning to the
|
memory management. The compression library attaches no meaning to the
|
||||||
opaque value.
|
opaque value.
|
||||||
@@ -89,7 +89,12 @@ typedef struct z_stream_s {
|
|||||||
zalloc must return Z_NULL if there is not enough memory for the object.
|
zalloc must return Z_NULL if there is not enough memory for the object.
|
||||||
On 16-bit systems, the functions zalloc and zfree must be able to allocate
|
On 16-bit systems, the functions zalloc and zfree must be able to allocate
|
||||||
exactly 65536 bytes, but will not be required to allocate more than this
|
exactly 65536 bytes, but will not be required to allocate more than this
|
||||||
if the symbol MAXSEG_64K is defined (see zconf.h).
|
if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS,
|
||||||
|
pointers returned by zalloc for objects of exactly 65536 bytes *must*
|
||||||
|
have their offset normalized to zero. The default allocation function
|
||||||
|
provided by this library ensures this (see zutil.c). To reduce memory
|
||||||
|
requirements and avoid any allocation of 64K objects, at the expense of
|
||||||
|
compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h).
|
||||||
|
|
||||||
The fields total_in and total_out can be used for statistics or
|
The fields total_in and total_out can be used for statistics or
|
||||||
progress reports. After compression, total_in holds the total size of
|
progress reports. After compression, total_in holds the total size of
|
||||||
@@ -103,6 +108,7 @@ typedef struct z_stream_s {
|
|||||||
#define Z_NO_FLUSH 0
|
#define Z_NO_FLUSH 0
|
||||||
#define Z_PARTIAL_FLUSH 1
|
#define Z_PARTIAL_FLUSH 1
|
||||||
#define Z_FULL_FLUSH 2
|
#define Z_FULL_FLUSH 2
|
||||||
|
#define Z_SYNC_FLUSH 3 /* experimental: partial_flush + byte align */
|
||||||
#define Z_FINISH 4
|
#define Z_FINISH 4
|
||||||
/* See deflate() below for the usage of these constants */
|
/* See deflate() below for the usage of these constants */
|
||||||
|
|
||||||
@@ -191,25 +197,30 @@ extern int deflate __P((z_stream *strm, int flush));
|
|||||||
so should be used only when necessary. Using Z_FULL_FLUSH too often can
|
so should be used only when necessary. Using Z_FULL_FLUSH too often can
|
||||||
seriously degrade the compression.
|
seriously degrade the compression.
|
||||||
|
|
||||||
If the parameter flush is set to Z_FINISH, all pending input is
|
If the parameter flush is set to Z_FINISH, all pending input is processed,
|
||||||
processed and all pending output is flushed. The next operation on this
|
all pending output is flushed and deflate returns with Z_STREAM_END if there
|
||||||
stream must be another call of deflate with Z_FINISH but no more input data
|
was enough output space; if deflate returns with Z_OK, this function must be
|
||||||
(unchanged avail_in) if this call returned with avail_out equal to zero,
|
called again with Z_FINISH and more output space (updated avail_out) but no
|
||||||
or a call of deflateEnd to deallocate the compression state. Z_FINISH can
|
more input data, until it returns with Z_STREAM_END or an error. After
|
||||||
be used immediately after deflateInit if all the compression is to be
|
deflate has returned Z_STREAM_END, the only possible operations on the
|
||||||
done in a single step. In this case, avail_out must be at least 0.1%
|
stream are deflateReset or deflateEnd.
|
||||||
larger than avail_in plus 12 bytes.
|
|
||||||
|
Z_FINISH can be used immediately after deflateInit if all the compression
|
||||||
|
is to be done in a single step. In this case, avail_out must be at least
|
||||||
|
0.1% larger than avail_in plus 12 bytes. If deflate does not return
|
||||||
|
Z_STREAM_END, then it must be called again as described above.
|
||||||
|
|
||||||
deflate() may update data_type if it can make a good guess about
|
deflate() may update data_type if it can make a good guess about
|
||||||
the input data type (Z_ASCII or Z_BINARY). In doubt, the data is considered
|
the input data type (Z_ASCII or Z_BINARY). In doubt, the data is considered
|
||||||
binary. This field is only for information purposes and does not affect
|
binary. This field is only for information purposes and does not affect
|
||||||
the compression algorithm in any manner.
|
the compression algorithm in any manner.
|
||||||
|
|
||||||
deflate() returns Z_OK if some progress has been made (more input processed
|
deflate() returns Z_OK if some progress has been made (more input
|
||||||
or more output produced), Z_STREAM_ERROR if the stream state was
|
processed or more output produced), Z_STREAM_END if all input has been
|
||||||
inconsistent (for example if next_in or next_out was NULL), Z_BUF_ERROR if
|
consumed and all output has been produced (only when flush is set to
|
||||||
no progress is possible or if there was not enough room in the output buffer
|
Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example
|
||||||
when Z_FINISH is used. ??? to be changed (use Z_STEAM_END) */
|
if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible.
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
extern int deflateEnd __P((z_stream *strm));
|
extern int deflateEnd __P((z_stream *strm));
|
||||||
@@ -260,7 +271,7 @@ extern int inflate __P((z_stream *strm, int flush));
|
|||||||
|
|
||||||
If the parameter flush is set to Z_PARTIAL_FLUSH, inflate flushes as much
|
If the parameter flush is set to Z_PARTIAL_FLUSH, inflate flushes as much
|
||||||
output as possible to the output buffer. The flushing behavior of inflate is
|
output as possible to the output buffer. The flushing behavior of inflate is
|
||||||
not specified for values of the flush paramater other than Z_PARTIAL_FLUSH
|
not specified for values of the flush parameter other than Z_PARTIAL_FLUSH
|
||||||
and Z_FINISH, but the current implementation actually flushes as much output
|
and Z_FINISH, but the current implementation actually flushes as much output
|
||||||
as possible anyway.
|
as possible anyway.
|
||||||
|
|
||||||
@@ -325,7 +336,8 @@ extern int deflateInit2 __P((z_stream *strm,
|
|||||||
The memLevel parameter specifies how much memory should be allocated
|
The memLevel parameter specifies how much memory should be allocated
|
||||||
for the internal compression state. memLevel=1 uses minimum memory but
|
for the internal compression state. memLevel=1 uses minimum memory but
|
||||||
is slow and reduces compression ratio; memLevel=9 uses maximum memory
|
is slow and reduces compression ratio; memLevel=9 uses maximum memory
|
||||||
for optimal speed. The default value is 8.
|
for optimal speed. The default value is 8. See zconf.h for total memory
|
||||||
|
usage as a function of windowBits and memLevel.
|
||||||
|
|
||||||
The strategy parameter is used to tune the compression algorithm. Use
|
The strategy parameter is used to tune the compression algorithm. Use
|
||||||
the value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data
|
the value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data
|
||||||
@@ -362,7 +374,7 @@ extern int deflateCopy __P((z_stream *dest,
|
|||||||
Sets the destination stream as a complete copy of the source stream. If
|
Sets the destination stream as a complete copy of the source stream. If
|
||||||
the source stream is using an application-supplied history buffer, a new
|
the source stream is using an application-supplied history buffer, a new
|
||||||
buffer is allocated for the destination stream. The compressed output
|
buffer is allocated for the destination stream. The compressed output
|
||||||
buffer is always application-supplied. It's the responsability of the
|
buffer is always application-supplied. It's the responsibility of the
|
||||||
application to provide the correct values of next_out and avail_out for the
|
application to provide the correct values of next_out and avail_out for the
|
||||||
next call of deflate.
|
next call of deflate.
|
||||||
|
|
||||||
@@ -425,12 +437,13 @@ extern int inflateInit2 __P((z_stream *strm,
|
|||||||
|
|
||||||
extern int inflateSync __P((z_stream *strm));
|
extern int inflateSync __P((z_stream *strm));
|
||||||
/*
|
/*
|
||||||
Skips invalid compressed data until the special marker and a valid block
|
Skips invalid compressed data until the special marker (see deflate()
|
||||||
can be found, or until all available input is skipped. No output is provided.
|
above) can be found, or until all available input is skipped. No output
|
||||||
|
is provided.
|
||||||
|
|
||||||
inflateSync returns Z_OK if a valid block has been found, Z_BUF_ERROR if
|
inflateSync returns Z_OK if the special marker has been found, Z_BUF_ERROR
|
||||||
no more input was provided, Z_DATA_ERROR if not valid block has been found,
|
if no more input was provided, Z_DATA_ERROR if no marker has been found,
|
||||||
Z_STREAM_ERROR if the stream structure was inconsistent. In the success
|
or Z_STREAM_ERROR if the stream structure was inconsistent. In the success
|
||||||
case, the application may save the current current value of total_in which
|
case, the application may save the current current value of total_in which
|
||||||
indicates where valid compressed data was found. In the error case, the
|
indicates where valid compressed data was found. In the error case, the
|
||||||
application may repeatedly call inflateSync, providing more input each time,
|
application may repeatedly call inflateSync, providing more input each time,
|
||||||
@@ -464,7 +477,7 @@ extern int compress __P((Byte *dest, uLong *destLen,
|
|||||||
Compresses the source buffer into the destination buffer. sourceLen is
|
Compresses the source buffer into the destination buffer. sourceLen is
|
||||||
the byte length of the source buffer. Upon entry, destLen is the total
|
the byte length of the source buffer. Upon entry, destLen is the total
|
||||||
size of the destination buffer, which must be at least 0.1% larger than
|
size of the destination buffer, which must be at least 0.1% larger than
|
||||||
sourceLen plus 8 bytes. Upon exit, destLen is the actual size of the
|
sourceLen plus 12 bytes. Upon exit, destLen is the actual size of the
|
||||||
compressed buffer.
|
compressed buffer.
|
||||||
This function can be used to compress a whole file at once if the
|
This function can be used to compress a whole file at once if the
|
||||||
input file is mmap'ed.
|
input file is mmap'ed.
|
||||||
@@ -500,7 +513,7 @@ extern gzFile gzopen __P((char *path, char *mode));
|
|||||||
is as in fopen ("rb" or "wb"). gzopen can also be used to read a file
|
is as in fopen ("rb" or "wb"). gzopen can also be used to read a file
|
||||||
which is not in gzip format; in this case gzread will directly read from
|
which is not in gzip format; in this case gzread will directly read from
|
||||||
the file without decompression.
|
the file without decompression.
|
||||||
gzopen return NULL if the file could not be opened or if there was
|
gzopen returns NULL if the file could not be opened or if there was
|
||||||
insufficient memory to allocate the (de)compression state; errno
|
insufficient memory to allocate the (de)compression state; errno
|
||||||
can be checked to distinguish the two cases (if errno is zero, the
|
can be checked to distinguish the two cases (if errno is zero, the
|
||||||
zlib error is Z_MEM_ERROR).
|
zlib error is Z_MEM_ERROR).
|
||||||
@@ -511,7 +524,7 @@ extern gzFile gzdopen __P((int fd, char *mode));
|
|||||||
gzdopen() associates a gzFile with the file descriptor fd. File
|
gzdopen() associates a gzFile with the file descriptor fd. File
|
||||||
descriptors are obtained from calls like open, dup, creat, or pipe.
|
descriptors are obtained from calls like open, dup, creat, or pipe.
|
||||||
The mode parameter is as in fopen ("rb" or "wb").
|
The mode parameter is as in fopen ("rb" or "wb").
|
||||||
gzdopen return NULL if there was insufficient memory to allocate
|
gzdopen returns NULL if there was insufficient memory to allocate
|
||||||
the (de)compression state.
|
the (de)compression state.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
@@ -534,7 +547,8 @@ extern int gzflush __P((gzFile file, int flush));
|
|||||||
/*
|
/*
|
||||||
Flushes all pending output into the compressed file. The parameter
|
Flushes all pending output into the compressed file. The parameter
|
||||||
flush is as in the deflate() function. The return value is the zlib
|
flush is as in the deflate() function. The return value is the zlib
|
||||||
error number (see function gzerror below).
|
error number (see function gzerror below). gzflush returns Z_OK if
|
||||||
|
the flush parameter is Z_FINISH and all output could be flushed.
|
||||||
gzflush should be called only when strictly necessary because it can
|
gzflush should be called only when strictly necessary because it can
|
||||||
degrade compression.
|
degrade compression.
|
||||||
*/
|
*/
|
||||||
@@ -568,7 +582,7 @@ extern uLong adler32 __P((uLong adler, Byte *buf, uInt len));
|
|||||||
Update a running Adler-32 checksum with the bytes buf[0..len-1] and
|
Update a running Adler-32 checksum with the bytes buf[0..len-1] and
|
||||||
return the updated checksum. If buf is NULL, this function returns
|
return the updated checksum. If buf is NULL, this function returns
|
||||||
the required initial value for the checksum.
|
the required initial value for the checksum.
|
||||||
An Adler-32 cheksum is almost as reliable as a CRC32 but can be computed
|
An Adler-32 checksum is almost as reliable as a CRC32 but can be computed
|
||||||
much faster. Usage example:
|
much faster. Usage example:
|
||||||
|
|
||||||
uLong adler = adler32(0L, Z_NULL, 0);
|
uLong adler = adler32(0L, Z_NULL, 0);
|
||||||
|
|||||||
28
zutil.c
28
zutil.c
@@ -3,13 +3,15 @@
|
|||||||
* For conditions of distribution and use, see copyright notice in zlib.h
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: zutil.c,v 1.5 1995/04/14 21:30:23 jloup Exp $ */
|
/* $Id: zutil.c,v 1.8 1995/05/03 17:27:12 jloup Exp $ */
|
||||||
|
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
|
|
||||||
#include "zutil.h"
|
#include "zutil.h"
|
||||||
|
|
||||||
|
#ifndef __GO32__
|
||||||
extern void exit __P((int));
|
extern void exit __P((int));
|
||||||
|
#endif
|
||||||
|
|
||||||
char *zlib_version = ZLIB_VERSION;
|
char *zlib_version = ZLIB_VERSION;
|
||||||
|
|
||||||
@@ -55,8 +57,9 @@ void zmemzero(dest, len)
|
|||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#if defined(MSDOS) && !defined(USE_CALLOC)
|
#if defined(__TURBOC__) && !defined(__SMALL__)
|
||||||
# ifdef __TURBOC__
|
|
||||||
|
# define MY_ZCALLOC
|
||||||
|
|
||||||
/* Turbo C malloc() does not allow dynamic allocation of 64K bytes
|
/* Turbo C malloc() does not allow dynamic allocation of 64K bytes
|
||||||
* and farmalloc(64K) returns a pointer with an offset of 8, so we
|
* and farmalloc(64K) returns a pointer with an offset of 8, so we
|
||||||
@@ -84,7 +87,7 @@ local ptr_table table[MAX_PTR];
|
|||||||
|
|
||||||
voidp zcalloc (voidp opaque, unsigned items, unsigned size)
|
voidp zcalloc (voidp opaque, unsigned items, unsigned size)
|
||||||
{
|
{
|
||||||
voidp buf;
|
voidp buf = opaque; /* just to make some compilers happy */
|
||||||
ulg bsize = (ulg)items*size;
|
ulg bsize = (ulg)items*size;
|
||||||
|
|
||||||
if (bsize < 65536L) {
|
if (bsize < 65536L) {
|
||||||
@@ -121,10 +124,14 @@ void zcfree (voidp opaque, voidp ptr)
|
|||||||
next_ptr--;
|
next_ptr--;
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
ptr = opaque; /* just to make some compilers happy */
|
||||||
z_error("zcfree: ptr not found");
|
z_error("zcfree: ptr not found");
|
||||||
}
|
}
|
||||||
|
#endif /* __TURBOC__ */
|
||||||
|
|
||||||
# else /* MSC */
|
#if defined(M_I86CM) || defined(M_I86LM) /* MSC compact or large model */
|
||||||
|
|
||||||
|
# define MY_ZCALLOC
|
||||||
|
|
||||||
#if (!defined(_MSC_VER) || (_MSC_VER < 600))
|
#if (!defined(_MSC_VER) || (_MSC_VER < 600))
|
||||||
# define _halloc halloc
|
# define _halloc halloc
|
||||||
@@ -133,20 +140,25 @@ void zcfree (voidp opaque, voidp ptr)
|
|||||||
|
|
||||||
voidp zcalloc (voidp opaque, unsigned items, unsigned size)
|
voidp zcalloc (voidp opaque, unsigned items, unsigned size)
|
||||||
{
|
{
|
||||||
|
if (opaque) opaque = 0; /* to make compiler happy */
|
||||||
return _halloc((long)items, size);
|
return _halloc((long)items, size);
|
||||||
}
|
}
|
||||||
|
|
||||||
void zcfree (voidp opaque, voidp ptr)
|
void zcfree (voidp opaque, voidp ptr)
|
||||||
{
|
{
|
||||||
|
if (opaque) opaque = 0; /* to make compiler happy */
|
||||||
_hfree(ptr);
|
_hfree(ptr);
|
||||||
}
|
}
|
||||||
|
|
||||||
# endif /* __TURBOC__ ? */
|
#endif /* defined(M_I86CM) || defined(M_I86LM) */
|
||||||
|
|
||||||
#else /* !MSDOS */
|
|
||||||
|
|
||||||
|
#ifndef MY_ZCALLOC /* Any system without a special alloc function */
|
||||||
|
|
||||||
|
#ifndef __GO32__
|
||||||
extern voidp calloc __P((uInt items, uInt size));
|
extern voidp calloc __P((uInt items, uInt size));
|
||||||
extern void free __P((voidp ptr));
|
extern void free __P((voidp ptr));
|
||||||
|
#endif
|
||||||
|
|
||||||
voidp zcalloc (opaque, items, size)
|
voidp zcalloc (opaque, items, size)
|
||||||
voidp opaque;
|
voidp opaque;
|
||||||
@@ -163,4 +175,4 @@ void zcfree (opaque, ptr)
|
|||||||
free(ptr);
|
free(ptr);
|
||||||
}
|
}
|
||||||
|
|
||||||
#endif /* MSDOS */
|
#endif /* MY_ZCALLOC */
|
||||||
|
|||||||
28
zutil.h
28
zutil.h
@@ -8,21 +8,25 @@
|
|||||||
subject to change. Applications should only use zlib.h.
|
subject to change. Applications should only use zlib.h.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* $Id: zutil.h,v 1.5 1995/04/14 21:22:38 jloup Exp $ */
|
/* $Id: zutil.h,v 1.9 1995/05/03 17:27:12 jloup Exp $ */
|
||||||
|
|
||||||
#ifndef _Z_UTIL_H
|
#ifndef _Z_UTIL_H
|
||||||
#define _Z_UTIL_H
|
#define _Z_UTIL_H
|
||||||
|
|
||||||
#include "zlib.h"
|
#include "zlib.h"
|
||||||
|
|
||||||
|
/* #ifndef __GNUC__ disable inline for now */
|
||||||
|
# define inline
|
||||||
|
/* #endif */
|
||||||
|
|
||||||
#ifdef MSDOS
|
#ifdef MSDOS
|
||||||
# include <stddef.h>
|
# include <stddef.h>
|
||||||
|
# include <errno.h>
|
||||||
#else
|
#else
|
||||||
extern int errno;
|
extern int errno;
|
||||||
#endif
|
#endif
|
||||||
#ifdef __STDC__
|
#ifdef STDC
|
||||||
# include <string.h>
|
# include <string.h>
|
||||||
# include <memory.h>
|
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#ifndef local
|
#ifndef local
|
||||||
@@ -43,13 +47,15 @@ extern char *z_errmsg[]; /* indexed by 1-zlib_error */
|
|||||||
|
|
||||||
#define DEFLATED 8
|
#define DEFLATED 8
|
||||||
|
|
||||||
#ifndef WBITS
|
#define DEF_WBITS 15
|
||||||
# define WBITS 15 /* 32K window */
|
/* default windowBits for decompression. MAX_WBITS is for compression only */
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef MEM_LEVEL
|
#if MAX_MEM_LEVEL >= 8
|
||||||
# define MEM_LEVEL 8
|
# define DEF_MEM_LEVEL 8
|
||||||
|
#else
|
||||||
|
# define DEF_MEM_LEVEL MAX_MEM_LEVEL
|
||||||
#endif
|
#endif
|
||||||
|
/* default memLevel */
|
||||||
|
|
||||||
#define STORED_BLOCK 0
|
#define STORED_BLOCK 0
|
||||||
#define STATIC_TREES 1
|
#define STATIC_TREES 1
|
||||||
@@ -66,7 +72,6 @@ extern char *z_errmsg[]; /* indexed by 1-zlib_error */
|
|||||||
# define OS_CODE 0x00
|
# define OS_CODE 0x00
|
||||||
# ifdef __TURBOC__
|
# ifdef __TURBOC__
|
||||||
# include <alloc.h>
|
# include <alloc.h>
|
||||||
# define exit(n) _exit(n)
|
|
||||||
# else /* MSC */
|
# else /* MSC */
|
||||||
# include <malloc.h>
|
# include <malloc.h>
|
||||||
# endif
|
# endif
|
||||||
@@ -125,7 +130,10 @@ extern char *z_errmsg[]; /* indexed by 1-zlib_error */
|
|||||||
# define zstrerror(errnum) ""
|
# define zstrerror(errnum) ""
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#if defined(__STDC__) && !defined(HAVE_MEMCPY)
|
#if defined(pyr) && !defined(NO_MEMCPY)
|
||||||
|
# define NO_MEMCPY
|
||||||
|
#endif
|
||||||
|
#if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY)
|
||||||
# define HAVE_MEMCPY
|
# define HAVE_MEMCPY
|
||||||
#endif
|
#endif
|
||||||
#ifdef HAVE_MEMCPY
|
#ifdef HAVE_MEMCPY
|
||||||
|
|||||||
Reference in New Issue
Block a user