From 16ded320cdd6aefa305e0311f5dfc2ce5950dbc3 Mon Sep 17 00:00:00 2001 From: dannygb Date: Sun, 22 May 2016 15:58:20 +0100 Subject: [PATCH] Adds GZip decompression compatibility --- KeePit.pro | 3 +- KeePit.pro.user | 20 +- KeePit/KeePit.pro | 12 +- KeePit/Main.qml | 2 +- KeePit/database.cpp | 33 +- KeePit/database.h | 1 + KeePit/main.cpp | 2 +- KeePit/stdafx.cpp | 8 + KeePit/stdafx.h | 12 + .../Makefile | 524 +++++++ .../adler32.o | Bin 0 -> 1104 bytes .../compress.o | Bin 0 -> 1460 bytes .../crc32.o | Bin 0 -> 2364 bytes .../deflate.o | Bin 0 -> 7544 bytes .../gzio.o | Bin 0 -> 6432 bytes .../infblock.o | Bin 0 -> 4556 bytes .../infcodes.o | Bin 0 -> 2900 bytes .../inffast.o | Bin 0 -> 2052 bytes .../inflate.o | Bin 0 -> 3632 bytes .../inftrees.o | Bin 0 -> 8544 bytes .../infutil.o | Bin 0 -> 1244 bytes .../libziplib.a | Bin 0 -> 59240 bytes .../maketree.o | Bin 0 -> 1612 bytes .../trees.o | Bin 0 -> 10600 bytes .../uncompr.o | Bin 0 -> 1384 bytes .../zutil.o | Bin 0 -> 1708 bytes po/template.pot | 4 +- ziplib/GZipHelper.h | 472 ++++++ ziplib/GZipHelper.h~ | 472 ++++++ ziplib/adler32.c | 48 + ziplib/compress.c | 68 + ziplib/crc32.c | 162 ++ ziplib/deflate.c | 1350 +++++++++++++++++ ziplib/deflate.h | 318 ++++ ziplib/gzio.c | 875 +++++++++++ ziplib/infblock.c | 403 +++++ ziplib/infblock.h | 39 + ziplib/infcodes.c | 251 +++ ziplib/infcodes.h | 27 + ziplib/inffast.c | 183 +++ ziplib/inffast.h | 17 + ziplib/inffixed.h | 151 ++ ziplib/inflate.c | 366 +++++ ziplib/inftrees.c | 454 ++++++ ziplib/inftrees.h | 58 + ziplib/infutil.c | 87 ++ ziplib/infutil.h | 98 ++ ziplib/maketree.c | 51 + ziplib/trees.c | 1214 +++++++++++++++ ziplib/trees.h | 128 ++ ziplib/uncompr.c | 58 + ziplib/zconf.h | 279 ++++ ziplib/ziplib.pro | 48 + ziplib/ziplib.pro.user | 487 ++++++ ziplib/zlib.h | 893 +++++++++++ ziplib/zutil.c | 225 +++ ziplib/zutil.h | 220 +++ 57 files changed, 10099 insertions(+), 24 deletions(-) create mode 100644 KeePit/stdafx.cpp create mode 100644 KeePit/stdafx.h create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/Makefile create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/adler32.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/compress.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/crc32.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/deflate.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/gzio.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/infblock.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/infcodes.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/inffast.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/inflate.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/inftrees.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/infutil.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/libziplib.a create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/maketree.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/trees.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/uncompr.o create mode 100644 build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/zutil.o create mode 100644 ziplib/GZipHelper.h create mode 100644 ziplib/GZipHelper.h~ create mode 100644 ziplib/adler32.c create mode 100644 ziplib/compress.c create mode 100644 ziplib/crc32.c create mode 100644 ziplib/deflate.c create mode 100644 ziplib/deflate.h create mode 100644 ziplib/gzio.c create mode 100644 ziplib/infblock.c create mode 100644 ziplib/infblock.h create mode 100644 ziplib/infcodes.c create mode 100644 ziplib/infcodes.h create mode 100644 ziplib/inffast.c create mode 100644 ziplib/inffast.h create mode 100644 ziplib/inffixed.h create mode 100644 ziplib/inflate.c create mode 100644 ziplib/inftrees.c create mode 100644 ziplib/inftrees.h create mode 100644 ziplib/infutil.c create mode 100644 ziplib/infutil.h create mode 100644 ziplib/maketree.c create mode 100644 ziplib/trees.c create mode 100644 ziplib/trees.h create mode 100644 ziplib/uncompr.c create mode 100644 ziplib/zconf.h create mode 100644 ziplib/ziplib.pro create mode 100644 ziplib/ziplib.pro.user create mode 100644 ziplib/zlib.h create mode 100644 ziplib/zutil.c create mode 100644 ziplib/zutil.h diff --git a/KeePit.pro b/KeePit.pro index a446603..ccb3f9a 100644 --- a/KeePit.pro +++ b/KeePit.pro @@ -6,7 +6,8 @@ TEMPLATE = subdirs #load Ubuntu specific features load(ubuntu-click) -SUBDIRS += KeePit +SUBDIRS += KeePit \ + ziplib # specify the manifest file, this file is required for click # packaging and for the IDE to create runconfigurations diff --git a/KeePit.pro.user b/KeePit.pro.user index b7d9944..7017ab0 100644 --- a/KeePit.pro.user +++ b/KeePit.pro.user @@ -1,6 +1,6 @@ - + EnvironmentId @@ -8,7 +8,7 @@ ProjectExplorer.Project.ActiveTarget - 0 + 1 ProjectExplorer.Project.EditorSettings @@ -61,7 +61,7 @@ Desktop Desktop {be3ccc75-fa7f-49f4-aff7-5b2317ccab85} - 0 + 1 0 0 @@ -288,7 +288,7 @@ 13 14 - -1 + 2 KeePit2 @@ -451,12 +451,12 @@ UbuntuProjectManager.UploadStep + /home/dan/build-KeePass3-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/keepass3.username_0.1_armhf.click + /home/dan/build-KeePit-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/keepit.dannygb_1.0_armhf.click /home/dan/build-KeePit-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/keepit.dannygb_1.2_armhf.click /home/dan/build-KeePass3-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/keepass3.dannygb_0.1_armhf.click - /home/dan/build-KeePit-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/keepit.dannygb_2.0_armhf.click /usr/share/qtcreator/ubuntu/scripts/qtc_device_applaunch.py - /home/dan/build-KeePass3-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/keepass3.username_0.1_armhf.click - /home/dan/build-KeePit-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/keepit.dannygb_1.0_armhf.click + /home/dan/build-KeePit-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/keepit.dannygb_2.0_armhf.click 127.0.0.1 @@ -483,12 +483,12 @@ /var/lib/schroot/chroots/click-ubuntu-sdk-15.04-armhf + 2015-12-06T19:13:53 + 2016-02-21T16:26:47 2016-03-14T20:53:57 2016-01-31T15:24:37 - 2016-03-24T22:21:10 2016-03-24T22:21:11 - 2015-12-06T19:13:53 - 2016-02-21T16:26:47 + 2016-03-24T22:21:10 2 diff --git a/KeePit/KeePit.pro b/KeePit/KeePit.pro index 441f543..dddbac5 100644 --- a/KeePit/KeePit.pro +++ b/KeePit/KeePit.pro @@ -146,7 +146,7 @@ SOURCES += main.cpp \ arrayextensions.cpp \ aes.cpp \ filehandler.cpp \ - bytestream.cpp + bytestream.cpp \ RESOURCES += KeePit.qrc @@ -333,7 +333,8 @@ HEADERS += \ arrayextensions.h \ aes.h \ filehandler.h \ - bytestream.h + bytestream.h \ + stdafx.h DISTFILES += \ OpenDatabase.qml \ @@ -354,3 +355,10 @@ DISTFILES += \ KeePit.png \ KeePit.contenthub \ KeePit.apparmor + +unix:!macx: LIBS += -L$$OUT_PWD/../ziplib/ -lziplib + +INCLUDEPATH += $$PWD/../ziplib +DEPENDPATH += $$PWD/../ziplib + +unix:!macx: PRE_TARGETDEPS += $$OUT_PWD/../ziplib/libziplib.a diff --git a/KeePit/Main.qml b/KeePit/Main.qml index 2bfc26f..be39fde 100644 --- a/KeePit/Main.qml +++ b/KeePit/Main.qml @@ -163,7 +163,7 @@ MainView { id: about Dialog { id: aboutDialog - title: i18n.tr("About (KeePit v2)") + title: i18n.tr("About (KeePit v2.0)") text: i18n.tr("Copyright © 2016 Dan Beavon
This software is distributed under the terms of the GNU General Public License v2 or Later") Button { text: i18n.tr("Ok") diff --git a/KeePit/database.cpp b/KeePit/database.cpp index f73c0b8..28b3788 100644 --- a/KeePit/database.cpp +++ b/KeePit/database.cpp @@ -37,6 +37,7 @@ #include "readkeyfile.h" #include "filehandler.h" #include "bytestream.h" +#include "../ziplib/GZipHelper.h" using namespace std; @@ -465,6 +466,7 @@ void Database::openFile(QString url, QString password, QString passKey) { vector payload; uint recoveredOffset = 32; + for(uint i=recoveredOffset;i read; assert(read.size() == 0); - try { + try { + // Now lets read the payload readPayload(&read, payload); + + char *inter = new char[read.size()]; + for(uint i = 0;i dataTree; vector current; + uint uCompression; }; #endif // DATABASE_H diff --git a/KeePit/main.cpp b/KeePit/main.cpp index d5b7bcb..24c3cc0 100644 --- a/KeePit/main.cpp +++ b/KeePit/main.cpp @@ -33,7 +33,7 @@ /// \return /// int main(int argc, char *argv[]) -{ +{ QGuiApplication app(argc, argv); Database fs; diff --git a/KeePit/stdafx.cpp b/KeePit/stdafx.cpp new file mode 100644 index 0000000..a181ab2 --- /dev/null +++ b/KeePit/stdafx.cpp @@ -0,0 +1,8 @@ +// stdafx.cpp : source file that includes just the standard includes +// gzipdemo.pch will be the pre-compiled header +// stdafx.obj will contain the pre-compiled type information + +#include "stdafx.h" + +// TODO: reference any additional headers you need in STDAFX.H +// and not in this file diff --git a/KeePit/stdafx.h b/KeePit/stdafx.h new file mode 100644 index 0000000..f00cf44 --- /dev/null +++ b/KeePit/stdafx.h @@ -0,0 +1,12 @@ +// stdafx.h : include file for standard system include files, +// or project specific include files that are used frequently, but +// are changed infrequently +// + +#pragma once + +//#define WIN32_LEAN_AND_MEAN // Exclude rarely-used stuff from Windows headers +#include +//#include + +// TODO: reference additional headers your program requires here diff --git a/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/Makefile b/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/Makefile new file mode 100644 index 0000000..3dfc583 --- /dev/null +++ b/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/Makefile @@ -0,0 +1,524 @@ +############################################################################# +# Makefile for building: libziplib.a +# Generated by qmake (3.0) (Qt 5.4.1) +# Project: ../ziplib/ziplib.pro +# Template: lib +# Command: /usr/bin/qt5-qmake-arm-linux-gnueabihf -spec ubuntu-arm-gnueabihf-g++ -o Makefile ../ziplib/ziplib.pro +############################################################################# + +MAKEFILE = Makefile + +####### Compiler, tools and options + +CC = arm-linux-gnueabihf-gcc +CXX = arm-linux-gnueabihf-g++ +DEFINES = -DQT_NO_DEBUG +CFLAGS = -pipe -O2 -fPIC -Wall -W -D_REENTRANT $(DEFINES) +CXXFLAGS = -pipe -O2 -fPIC -Wall -W -D_REENTRANT $(DEFINES) +INCPATH = -I../ziplib -I. -I/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/ubuntu-arm-gnueabihf-g++ +QMAKE = /usr/bin/qt5-qmake-arm-linux-gnueabihf +DEL_FILE = rm -f +CHK_DIR_EXISTS= test -d +MKDIR = mkdir -p +COPY = cp -f +COPY_FILE = cp -f +COPY_DIR = cp -f -R +INSTALL_FILE = install -m 644 -p +INSTALL_PROGRAM = install -m 755 -p +INSTALL_DIR = $(COPY_DIR) +DEL_FILE = rm -f +SYMLINK = ln -f -s +DEL_DIR = rmdir +MOVE = mv -f +TAR = tar -cf +COMPRESS = gzip -9f +DISTNAME = ziplib1.0.0 +DISTDIR = /home/dan/KeePit/ziplib/.tmp/ziplib1.0.0 +AR = arm-linux-gnueabihf-ar cqs +RANLIB = +SED = sed +STRIP = arm-linux-gnueabihf-strip + +####### Output directory + +OBJECTS_DIR = ./ + +####### Files + +SOURCES = ../ziplib/adler32.c \ + ../ziplib/compress.c \ + ../ziplib/crc32.c \ + ../ziplib/deflate.c \ + ../ziplib/gzio.c \ + ../ziplib/infblock.c \ + ../ziplib/infcodes.c \ + ../ziplib/inffast.c \ + ../ziplib/inflate.c \ + ../ziplib/inftrees.c \ + ../ziplib/infutil.c \ + ../ziplib/maketree.c \ + ../ziplib/trees.c \ + ../ziplib/uncompr.c \ + ../ziplib/zutil.c +OBJECTS = adler32.o \ + compress.o \ + crc32.o \ + deflate.o \ + gzio.o \ + infblock.o \ + infcodes.o \ + inffast.o \ + inflate.o \ + inftrees.o \ + infutil.o \ + maketree.o \ + trees.o \ + uncompr.o \ + zutil.o +DIST = /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/spec_pre.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/shell-unix.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/unix.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/linux.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/gcc-base.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/gcc-base-unix.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/g++-base.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/g++-unix.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/qconfig.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3d.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3d_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3dquick.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3dquick_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_bootstrap_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_concurrent.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_concurrent_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_contacts.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_core.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_core_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_dbus.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_dbus_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_designer.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_gui.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_gui_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_help.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_location.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_multimedia.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_multimediawidgets.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_network.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_network_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_opengl.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_opengl_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_openglextensions.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_openglextensions_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_organizer.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_platformsupport_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_positioning.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_printsupport.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_printsupport_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_qml.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_qmltest.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_quick.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_quickwidgets.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_script.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_scripttools.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_sensors.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_sql.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_sql_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_svg.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_testlib.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_testlib_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_uitools.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_versit.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_versitorganizer.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_websockets.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_widgets.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_widgets_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_xml.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_xml_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_xmlpatterns.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/qt_functions.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/qt_config.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/ubuntu-arm-gnueabihf-g++/qmake.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/spec_post.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/exclusive_builds.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/default_pre.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/ubuntu-click.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/resolve_config.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/default_post.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/ubuntu-click-tools.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/warn_on.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/qt.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/unix/thread.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/testcase_targets.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/exceptions.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/yacc.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/lex.prf \ + ../ziplib/ziplib.pro deflate.h \ + infblock.h \ + infcodes.h \ + inffast.h \ + inffixed.h \ + inftrees.h \ + infutil.h \ + trees.h \ + zconf.h \ + zlib.h \ + zutil.h \ + GZipHelper.h ../ziplib/adler32.c \ + ../ziplib/compress.c \ + ../ziplib/crc32.c \ + ../ziplib/deflate.c \ + ../ziplib/gzio.c \ + ../ziplib/infblock.c \ + ../ziplib/infcodes.c \ + ../ziplib/inffast.c \ + ../ziplib/inflate.c \ + ../ziplib/inftrees.c \ + ../ziplib/infutil.c \ + ../ziplib/maketree.c \ + ../ziplib/trees.c \ + ../ziplib/uncompr.c \ + ../ziplib/zutil.c +QMAKE_TARGET = ziplib +DESTDIR = #avoid trailing-slash linebreak +TARGET = libziplib.a + + +first: all +####### Implicit rules + +.SUFFIXES: .o .c .cpp .cc .cxx .C + +.cpp.o: + $(CXX) -c $(CXXFLAGS) $(INCPATH) -o "$@" "$<" + +.cc.o: + $(CXX) -c $(CXXFLAGS) $(INCPATH) -o "$@" "$<" + +.cxx.o: + $(CXX) -c $(CXXFLAGS) $(INCPATH) -o "$@" "$<" + +.C.o: + $(CXX) -c $(CXXFLAGS) $(INCPATH) -o "$@" "$<" + +.c.o: + $(CC) -c $(CFLAGS) $(INCPATH) -o "$@" "$<" + +####### Build rules + +staticlib: $(TARGET) + +$(TARGET): $(OBJECTS) $(OBJCOMP) + -$(DEL_FILE) $(TARGET) + $(AR) $(TARGET) $(OBJECTS) + + +Makefile: ../ziplib/ziplib.pro /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/ubuntu-arm-gnueabihf-g++/qmake.conf /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/spec_pre.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/shell-unix.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/unix.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/linux.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/gcc-base.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/gcc-base-unix.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/g++-base.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/g++-unix.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/qconfig.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3d.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3d_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3dquick.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3dquick_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_bootstrap_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_concurrent.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_concurrent_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_contacts.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_core.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_core_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_dbus.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_dbus_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_designer.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_gui.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_gui_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_help.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_location.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_multimedia.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_multimediawidgets.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_network.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_network_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_opengl.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_opengl_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_openglextensions.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_openglextensions_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_organizer.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_platformsupport_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_positioning.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_printsupport.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_printsupport_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_qml.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_qmltest.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_quick.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_quickwidgets.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_script.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_scripttools.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_sensors.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_sql.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_sql_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_svg.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_testlib.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_testlib_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_uitools.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_versit.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_versitorganizer.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_websockets.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_widgets.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_widgets_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_xml.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_xml_private.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_xmlpatterns.pri \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/qt_functions.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/qt_config.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/ubuntu-arm-gnueabihf-g++/qmake.conf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/spec_post.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/exclusive_builds.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/default_pre.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/ubuntu-click.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/resolve_config.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/default_post.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/ubuntu-click-tools.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/warn_on.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/qt.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/unix/thread.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/testcase_targets.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/exceptions.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/yacc.prf \ + /usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/lex.prf \ + ../ziplib/ziplib.pro + $(QMAKE) -spec ubuntu-arm-gnueabihf-g++ -o Makefile ../ziplib/ziplib.pro +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/spec_pre.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/shell-unix.conf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/unix.conf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/linux.conf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/gcc-base.conf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/gcc-base-unix.conf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/g++-base.conf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/common/g++-unix.conf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/qconfig.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3d.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3d_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3dquick.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_3dquick_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_bootstrap_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_concurrent.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_concurrent_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_contacts.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_core.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_core_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_dbus.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_dbus_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_designer.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_gui.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_gui_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_help.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_location.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_multimedia.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_multimediawidgets.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_network.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_network_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_opengl.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_opengl_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_openglextensions.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_openglextensions_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_organizer.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_platformsupport_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_positioning.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_printsupport.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_printsupport_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_qml.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_qmltest.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_quick.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_quickwidgets.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_script.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_scripttools.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_sensors.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_sql.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_sql_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_svg.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_testlib.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_testlib_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_uitools.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_versit.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_versitorganizer.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_websockets.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_widgets.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_widgets_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_xml.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_xml_private.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/modules/qt_lib_xmlpatterns.pri: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/qt_functions.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/qt_config.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/ubuntu-arm-gnueabihf-g++/qmake.conf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/spec_post.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/exclusive_builds.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/default_pre.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/ubuntu-click.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/resolve_config.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/default_post.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/ubuntu-click-tools.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/warn_on.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/qt.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/unix/thread.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/testcase_targets.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/exceptions.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/yacc.prf: +/usr/lib/arm-linux-gnueabihf/qt5/mkspecs/features/lex.prf: +../ziplib/ziplib.pro: +qmake: FORCE + @$(QMAKE) -spec ubuntu-arm-gnueabihf-g++ -o Makefile ../ziplib/ziplib.pro + +qmake_all: FORCE + + +all: Makefile $(TARGET) + +dist: distdir FORCE + (cd `dirname $(DISTDIR)` && $(TAR) $(DISTNAME).tar $(DISTNAME) && $(COMPRESS) $(DISTNAME).tar) && $(MOVE) `dirname $(DISTDIR)`/$(DISTNAME).tar.gz . && $(DEL_FILE) -r $(DISTDIR) + +distdir: FORCE + @test -d $(DISTDIR) || mkdir -p $(DISTDIR) + $(COPY_FILE) --parents $(DIST) $(DISTDIR)/ + + +clean:compiler_clean + -$(DEL_FILE) $(OBJECTS) + -$(DEL_FILE) *~ core *.core + + +distclean: clean + -$(DEL_FILE) $(TARGET) + -$(DEL_FILE) Makefile + + +####### Sub-libraries + +check: first + +compiler_yacc_decl_make_all: +compiler_yacc_decl_clean: +compiler_yacc_impl_make_all: +compiler_yacc_impl_clean: +compiler_lex_make_all: +compiler_lex_clean: +compiler_clean: + +####### Compile + +adler32.o: ../ziplib/adler32.c ../ziplib/zlib.h \ + ../ziplib/zconf.h + $(CC) -c $(CFLAGS) $(INCPATH) -o adler32.o ../ziplib/adler32.c + +compress.o: ../ziplib/compress.c ../ziplib/zlib.h \ + ../ziplib/zconf.h + $(CC) -c $(CFLAGS) $(INCPATH) -o compress.o ../ziplib/compress.c + +crc32.o: ../ziplib/crc32.c ../ziplib/zlib.h \ + ../ziplib/zconf.h + $(CC) -c $(CFLAGS) $(INCPATH) -o crc32.o ../ziplib/crc32.c + +deflate.o: ../ziplib/deflate.c ../ziplib/deflate.h \ + ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h + $(CC) -c $(CFLAGS) $(INCPATH) -o deflate.o ../ziplib/deflate.c + +gzio.o: ../ziplib/gzio.c ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h + $(CC) -c $(CFLAGS) $(INCPATH) -o gzio.o ../ziplib/gzio.c + +infblock.o: ../ziplib/infblock.c ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h \ + ../ziplib/infblock.h \ + ../ziplib/inftrees.h \ + ../ziplib/infcodes.h \ + ../ziplib/infutil.h + $(CC) -c $(CFLAGS) $(INCPATH) -o infblock.o ../ziplib/infblock.c + +infcodes.o: ../ziplib/infcodes.c ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h \ + ../ziplib/inftrees.h \ + ../ziplib/infblock.h \ + ../ziplib/infcodes.h \ + ../ziplib/infutil.h \ + ../ziplib/inffast.h + $(CC) -c $(CFLAGS) $(INCPATH) -o infcodes.o ../ziplib/infcodes.c + +inffast.o: ../ziplib/inffast.c ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h \ + ../ziplib/inftrees.h \ + ../ziplib/infblock.h \ + ../ziplib/infcodes.h \ + ../ziplib/infutil.h \ + ../ziplib/inffast.h + $(CC) -c $(CFLAGS) $(INCPATH) -o inffast.o ../ziplib/inffast.c + +inflate.o: ../ziplib/inflate.c ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h \ + ../ziplib/infblock.h + $(CC) -c $(CFLAGS) $(INCPATH) -o inflate.o ../ziplib/inflate.c + +inftrees.o: ../ziplib/inftrees.c ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h \ + ../ziplib/inftrees.h \ + ../ziplib/inffixed.h + $(CC) -c $(CFLAGS) $(INCPATH) -o inftrees.o ../ziplib/inftrees.c + +infutil.o: ../ziplib/infutil.c ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h \ + ../ziplib/infblock.h \ + ../ziplib/inftrees.h \ + ../ziplib/infcodes.h \ + ../ziplib/infutil.h + $(CC) -c $(CFLAGS) $(INCPATH) -o infutil.o ../ziplib/infutil.c + +maketree.o: ../ziplib/maketree.c ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h \ + ../ziplib/inftrees.h + $(CC) -c $(CFLAGS) $(INCPATH) -o maketree.o ../ziplib/maketree.c + +trees.o: ../ziplib/trees.c ../ziplib/deflate.h \ + ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h \ + ../ziplib/trees.h + $(CC) -c $(CFLAGS) $(INCPATH) -o trees.o ../ziplib/trees.c + +uncompr.o: ../ziplib/uncompr.c ../ziplib/zlib.h \ + ../ziplib/zconf.h + $(CC) -c $(CFLAGS) $(INCPATH) -o uncompr.o ../ziplib/uncompr.c + +zutil.o: ../ziplib/zutil.c ../ziplib/zutil.h \ + ../ziplib/zlib.h \ + ../ziplib/zconf.h + $(CC) -c $(CFLAGS) $(INCPATH) -o zutil.o ../ziplib/zutil.c + +####### Install + +install_target: first FORCE + @test -d $(INSTALL_ROOT)/lib/arm-linux-gnueabihf/bin || mkdir -p $(INSTALL_ROOT)/lib/arm-linux-gnueabihf/bin + -$(INSTALL_FILE) "$(TARGET)" "$(INSTALL_ROOT)/lib/arm-linux-gnueabihf/bin/$(TARGET)" + +uninstall_target: FORCE + -$(DEL_FILE) "$(INSTALL_ROOT)/lib/arm-linux-gnueabihf/bin/$(TARGET)" + -$(DEL_DIR) $(INSTALL_ROOT)/lib/arm-linux-gnueabihf/bin/ + + +install: install_target FORCE + +uninstall: uninstall_target FORCE + +FORCE: + diff --git a/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/adler32.o b/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/adler32.o new file mode 100644 index 0000000000000000000000000000000000000000..c3fe04ccc6461e72c866bcd447234b6001cec969 GIT binary patch literal 1104 zcmah{&ubGw6n?Y2$tIi7Zeq7h(io!^Op965Ux=Oz-Axr*BSOJLFPnD7piMQ|fFAq- zJ$VxG9}oo5oAg$U)T4Sb#~wY1wYhYAkVp^uW;25u4>~aKd*AoI_jZ__hvq_w5CVJ= z$iW{5@LupLff)~Spnwed@B8JA&0rM9VSnQhOf)`UJh&ql58f<)IFRM?5BEXEd|JwF ze<^LbgM%MCg7B$i@4R-^FmcsDc`un#Tp>g{p@h~|qw1{IJ+>ekS~nBbx<^}SW6Y3{ zrK4lUGU8~f$5V_a8BZ`i(#m3o)*Z$f*ATUqXk-zG7(c>zobecP$w(wkQ|d&-gb_5} zwiTDaR!2#Z4#d>3$S&&{3B=9VhWn$tY9P_0?@_3Vs(PM^w87Mh+qSs3prP^7nN*;b_r zWCGK`*?bX#id+nlu%JkBX^3cKL`;w*NeQE3nq-6%1oXzeHOHzTI`tmj;F)9JbwFRW z91HYHqXGKL`r4XZL#?*%*!ukCrF_G&R&Ih`yt=4cj#IBznvUJ@er{jzzX1u{U;d)l z_d)jpY|P#pWrz2iOhG!=b;j(r!WuU{-5tO>nR}8Md#&vsTb)yx@Q@BB8L0?Lrmb* zM2_FQ?f21MzPK-j0zVtAZDL`Gn-IB=qW|xOkUU2%%r?CjmF507NmbBXhiHZ1g z;D8BHFcB{vJ(ySz9tl^EnsD%7qMpE8J=v4>z3pyYdePUs`QG>Do0&KBw)dkknK1^I zG4R1(2CyXNY2qqZbv>Vs7j>;*-q#NH9*OX?YM&E!br3+npWOry zv5$6R(1vueo?_5mk122(`sI4gemd>%G}hOrk=spxW;;cFQv-KFCuV3@I-?zl~!8o1QJCmMLFfiEC`f=>6O^8i~hm)8mfo`3-z29m&IBY}E$2$I@#M%A^;*|e@$ z#KLGc35sI0PD!L@lxa1c0c9*U9+6_oxGdj@PAZd9Bov$-W(b{(_M>%{(YZ8#(L~ad zeL?pdQEea%In_*PncGezB+V2nB!o?W? literal 0 HcmV?d00001 diff --git a/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/crc32.o b/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/crc32.o new file mode 100644 index 0000000000000000000000000000000000000000..8dbefb46fbe70e3e2671df8605c2bcead778ef77 GIT binary patch literal 2364 zcma)73s{p?7(V~*SC~#wM0BYjmp11OFGMl{F`5?)qlkikV+_VFT!tu7QiOsUYD7^P znM6?;0b?+3!-y`F35;Hc0+&%_!|KbNwzV>Z8qlt7=Q|p{l^0ngFzDx%XuDaCwr+Z0B}dg4@H@-Oi&m* zg~$X2f5UNlI zrOC4`EDqaBjm)&r=_x@`GiUFGS-s28!fd96MvIy`GZSX@x_rilsnn>M-03i@=Y?Dg z%QM$Pp+wE(Si`IyAk*T^Ic)*t*~&2M#>CT5eaZqzcOi0*J_S*>1rTpTBz5P(Po}UGEcRH>GG~OIPPuYj{-VIw{XFC%B zUg49|?nfPdsSBmP=G>wnpP!N?ZZ8p!78k@6ZOQ3(ctc)mtKPzDYGX#l zvt+LBr;Dyl7h+g7u9KW{+5V*3Uxx(x7oIWpt-3Wbs0h^>r@qMU%zCs?&c0Tf5R*PF z`s3$T$(ciu$TE|hBo_NQ&fH;AUi^}y^nHpIFB}m>cO@rDuXK#y9|$%Q9{wYnX-Lr0 zN@hy6+vSCod%Iif`~9aIu6{4?-I5w<4r*g|4?OPI@!?gz$$d8%3e61d`O*n(Z_-Xx z-M79)^XO{@b#0C%jk+Qo&V!OejH)y-KHo4(uQ;8d+O$L%_t=N7=qG;M*y;;{fn%hk zex!k8DD+}=jpb%nB(2p}lS)RK-r8!^-MrFDKE7=lIOdg7Us+k`@LfGqc9QF-pu8%N zxrjuHf1Cjd@@COKD@>8&gZ6b$>GtOr52t3Y(`G) z?`GFQ(L>z6<-cZho|6cT_Z~wl58MdV?pA|_;$eQhQBYzI=_%;-Q?zuvb8o7yfb%pKaRi!;&tnkx3{v5N4=Ns8r^O3yn8YfG4yIRxqI%BvR z|GJ?ge<3ll%;g>_b>Ryy!@a{!7PoCrPJFSM&6vI=5H(mw2C6~ zGlBVz9|Q`&7aMr_$R|fzkMy0WG4B@oqr-FD37@q|NPdwGdCi=k99p{P^vQ5 zPEU{N^8)lWE4uQ^qi+^>cR!oo@pemd@6IEW=0g+G`VMJ$!@Gkd?Vg8yD);w!Gkb+D zw2$wG;C-Ug34%|@qRmIm($cX!<>nLm_VVjC_SRBk@QaYqW$7}xQ^^!i#S z+`3Kf#G`uOy3ai5jg>D&RCyC*n#lKNdzv@5wQJ87neKNj8+xL=Ipz)bN%7B@ie;&^ zdGIj zUna74&L*HiZE~mM!?er47??d_S%ibl8vHKQUHaZ{PSNcLg5w|RPg6b^BI_s{i0C%O z(#`(kzP&phDQkHDv!eQ;lWmp3qqAE6>dD5&GtG5h@$)s0yjxtgf#}m-mrv^X#xr~< ztVwEG&r6Th=t9sIoJ-u3FMF%JcIfFxPvPIBpO*jL8v$yVJTr5vK(1~ zUx_#)t8gy()yNv$It1`iPAJr<2zqt$oR70d$r3qFEjg|RyckrC0-h)(1@Mwpb3m+8 zC?rbADOG9-FZke5Zi*TeCjg${$N?UzRwu`cQq_`_`JdP#xA^~0028x|D1iUR?EoOg zFQy?Pz#C$*A@I%sfU=N6Y&@2mvpJryu<1fzqw#=fd)}^whXx$&fB;}ML_3<-&s|vd zBp#6L;XF?P&M?Au!D?6vqm9rr;lPp@2I6G#)-60S*q{a*VlWg1&s{D7Qi(e1Z)8(p zk72#xVbfR-n5WEpjQc;f7K-2_3zcGD2?I;a8*I~NE^x-q*58Hz2!yS!gfR^cOpfWW zTHNNb{mu9x5K_-eRwp>4+2 zz=mMn+mdin{PPtq)E5dl*hAuC-F7>G9$O2uC2-h##qbrl9*PC?X4hff-UCJv;HSZY bNji+NZwl*!1qXJpy&%M?ww*DG zzG7`15IaTahfixA`vE_FPdn2I@0HG*r|oJ`W|l2u8+B@0GHX`CfW4(3-aa>pGOqR3 zdxw>?_daKzbN2t7t2-;#F&JYMZ5XN1O$wpa8N!VC9s#IPB8o@(Uk9t(nMr<$;+c_2 zzEQgma81kLZ2Qko=}>b_K!j1(B;O(1;}Ola|MEWriHV}wT`ttyePu~okOAa^hxpINxpQnOLseu-M zqn?928bRCJEB`9scti{M=YUhisGHJIefhplp6WleeX#P;@lKxZp8%{HFj0T%j={<* zz{LHvfUN>d(tilB`^G1BNQ*o9nEt`af^iuyt?uKc{q4H50g>p`+@6{0soK;Y4_bnj z6?r>(+~3XA!k*{6s1IwXUU#~v7tQW!*{eeb6Fw97cA0VSZrv-FL@$Y%EQZoA*|G?< zKj6QIImqTy_X8_secbv2*kLgv zKEuB+V$!U+%&2Aln;++|T74GQ`k1vU?U6LORcYOjq1O8w9?p=nW;UCBj77QE#(OR4 zEdRdX=MlyxVn(?(guCza)l5lgsb@JO_8M&^`k~qOww}rd&rg6|C&5bZg-{abt*e~i zHJyIWasIm2G1gSfQx72JE4rb8gzoViK7mV<-818Z_96!NrR#-R zMRd031TK@oEYWSbKB`^kI4wjKQcm)jigUb3cF;O_JSHGT8<^F=g=9nyfDqMEO&#Os zHt09%&jEc7=%@S}AmWh>vIP;oa{ztdFJfmjdusDDBO+!qBP&7O7n!pU#fRkaf8eB{ zOzBg4aTmH9cmEsMZZ!B`ZUd*Zs~pMtY^Tq0U^_i04t;6=SFqk?8?EiPCu>!W%lVWR z1)toK&8H}aoRngK>o=*IE}Nb>KG3{h7k{3$c{2uP+qZV;#1|)cw}#5o2ETKwngLG# z#y#LXtV7eUyM0c21<2cQ5oDI7qn9U7xKB**4j&55mrI7b*S@W}VTSS3&`Xt}EgbHD52q5nL^+OjniDpl2c-BJ)yt0ffojfWE zbGg%S(Gc%WTW>XRS2(OzfIk0y(~{z*3p1HGw&cpxYk|cU|eZ1;|G;6=f7qGT?`yjZL1s%h^b?s&sJuQkSS4p zrhfR7zl1JJ9?;yyUlITR9!%^b>ocW&?OQ8>AJs&4Tq4^r-v z=P@VJ7uxjb55%S!XDleJ18F&O1Zgh4hoN?)shAkG?}G zRm}sY*REyK(c23NcN65&V_x1dx_@Mx*~omsdw0i$f{RN6^NmB?KQhy>$9b32klbGrF;35nk-&cvy@Mfp?nmabQ^7JGf3_0 zg)EtHhw}#oKXK;>mTdW+xXFrs5FBg8-jd3$d~uhf?t-o>DyPp#m3DE^O((nKL=K z7;+|Og5Nai8tdM@D~i+Sv!rV8x(CD@bdGwO|IRJdxUblB`fDgy`kS1=fm2=NN>@=x)4@cVH7)p~s# z@t$W!DdgX=@1yybHXIB2r-%Gwg#1e$W;v90PlgJ#f;sA0leQsa z;qGq>yZ`pgcErDr)aeY7fmA4@yj6~#h#Vh`BL(mlhN}Z$aBuPz5(cSPd&jIv3|c1l zpd6joXvxi6HID3y1#PH&jdA&>Mw`M;GWKQNZqHP@M}7yB%ajT83cJbtdWcRinUIp+ zzSKFvm- za0V4>gD<*~O3uLheSdg=sIET@gYH`LvF14#6SOyeU5NWLBxO#S>3u;%fnuj z`#bMh|JCL}8(v}NHp>>#bl%`>5MI)>N;lP>l6br#sG!TI_eu=b(d#?@G)_ zc(Ly0tidWdFl2cYIPZ&lwblr$>H+_AEs25#KgwM-!wr|OZ4QcPIYVxQ^VSnA(Jw6j zPMF>A$AufbNTp!XnKU87>B2g%2C$iLiMBguo*E{WL8>gn!+zpBV}sFO0sdSyBOlI% zy)jL8US!?PKHxW4HB5d5a8{`%PKcrsiErsthl(*dbIEg#u)_l1q7v4NL3uQg8OYop9Du^kRn>~Km0^e=N zD{O9CPt{fHr}nhtMq9stA6|f`Ex`M2X^as#w&s(1dX-Ip?2QsOUN*g@o7DJUq!I$0G*3Oc5 z!^>_vR59{?cq&r@uW+eHayR+-S!b^w%c>6I_<`>z)mN+}6q7i{tNY{U z5`$y>YF|U6LK2D>wQ%rwD5Arpjocp{3 zc9e6E_cHWw%j6b%RY8p5RSd7=PBR^-p#4oLdWZ;jvR=*T`9#^!da26zgqXxfHN*z_ zZbbt1tK^4%#?zWz2HHSuxO3)ThHn!_?1oJcE#e4Q>_cjX@by{WWJzo_2Wj*<%+qMn z|5h~qNjyQ5y}M^bx`ggVD(YYsgS(Sd=nz>W8j-=>N^V6I+~+2@y z?u+18EN3kJ!oOg^?wZpUV*UHA#1BUR?`&F>PW(`;FVUAre2~S8LeEiG*Nd*ZRAam> zPc$nxKrF2o<1_Q3cXUe?sXt-+M#sXC7Vd9Fqsi=GT_#0QK~cdyii+lz9j(?Ti%U^d zR<=C9SfeRctTnM*zN2|ti=v9PIvhI`f>RcBA|ygm_>m?;Vk849j7yLL{=&Ej#$^I7 z1sEMCxEuaRlfo!qnBWAXFl;B_6b3xJxT>P!eucWuu#IzVD_m#g*w$vnJq2Y2#rZ{= zZNg}gCMP_C%E^t-nplGs;aot)_vM!(NnA|16vt9=qD7)qycqw4mg6*>PG!)U_)aPd zqk^^_P8Vwc=xPl^OB8E0ISO2+?JiW%$hufmU}$SY1+C3tf=m*ufFP~S1&(GT>p%s@ zW~bA{!4j_7Wh$t8q%ObB#TxCXpnSu_1+2@}YBg+gnc9e=w=}^Jkueb@`@(66;e{lk z;csE1!F2Hp2Y^2jXtL@R=qSK40UrQ-H9$fW6MYS|IWm7Q(CcB_b?_te6+m}Npc5Jv z_J3&sP3r&4K$DUj<#)$M*kL`9=eY&+MxdVudJbTe|Kbgy!~B0)K$G*ICQ1k`Jm0Z^ zCiC|sMW!R?tz1Bpd3W+Z&v!1Mqca535XXf7W)t5;0i%)RmU#&>L^!qs#4x|G(ddTa z!Z01lkth$1;?U2d1V9q(zqp0odkg)-E%ckW(5G*qKLC1P973-FTm%wc1eg!@9f{Ci z0*p3t{@D1xV&s1B^DZU(GG_qd<3o|41AY{zjnR23iY{&@B=ElS71a-T*%SP zHJRF6^-k7hv>>x%Tbrf6#l$sQxh7UMm1}H%BD$!)%>l%c#v8PmZFAiq+FZ@8 zrbc9J=FHZnZLO@!+RW8M@o<=s)8sU^>_BXz!_-<*jOtyj_2I(|P$2B6zG_{yu6$j6 zHN$MItgWvt*R89pNA(U9*W|L)8=D(VsJ_t(atdffgN-Ja-fAR=u&q0yLToU#nOwsD zR?g}o=Mp-yLKqKASsytV1YsT4CJsGWZ)$CIwlzh0YuHxS*%qZLxf?pKfqjeX(UVZu zKz4xUR`{-roIob)qXfA}qBuw%xm3Up?}1O^6bO-bE`j9Vwg}V{sDzk-3&dw!VYm(nasr)R1acBs4E2#fSpOQpI1SWB0zt0F7KNcX0$U^S z=?L@^2>WV)|IWL~T?#c7&P*jR0U_8zfFQa6O9=#<=p(Qu0=GnRhyuy-0&_xS<1~iyJjB5 nFlrOR_ZILqzyT2UNC7{huMB=f*QiYZMG10*c1Je>I*R@ePDp0y literal 0 HcmV?d00001 diff --git a/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/gzio.o b/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/gzio.o new file mode 100644 index 0000000000000000000000000000000000000000..3cec2fcbf9b7c242ba99683381af931c90d1721b GIT binary patch literal 6432 zcma)A4RBM}l|E0Be=s(ff5#XiTi6j6R%IKqh5&0@;+h{5GY(`(NY;{{BulkyYi$vT z+3t!!GU;ZLFpzW^vTa-_jMI>;spD>))T2xTout!bB}%%XgpOMh z@5#8@?d)F9d*A);IrpA(&pr3vC;!u?Mj=TOrHVvmy2FTSmnf2q)e4v?mu3-}*GFrH z41zkc&rMBCPJQa%aPEcVBes2(vS_!ZAVQ`0M2&%bMbmSK#h#MGKU#8pX#_|NIu#dudjqF_VK&^zr5-rD3dh`qzy%M@t3 z8LpR#Gn~!<^9FPJFLB#5+}o%tyMy_R*I)uZNlp=bDnWucb2)l&NBBI`MMJ2 zGS3;$sN0O$O-|9cG<&yF3k#=*NBC9vVX;!=jjzsTdEWTp+-5N-ekrgbl}(9#Ifs*v zIOiv&`?@W<$a6`u%^8>Gpw0G3^whYG_92!oOLhb;eJ!`ce;yv6HTQT#65B6(EnA{K zOJg+Ehb;COXDC@H@l1H1r6G!Jsb!m6w$_-s5_6FowZ}R0hYh~-y zlc5NQ!uL?E!K3bzjgy(mo>(`j?u~mV^#-HRf1Xh~HDQ}vSw$HZG}h3bWUSwW;FuY!dTf?tUh+|)VC}J} zB~T)y;(jH{hwGQbUJYDG=7&FbT8C4k^vl1G_qR*t>T^}dcB2>>3v%v7 z!pfOt3P{DHPL4H82X2L%jG~Brt3D+oO31&IzIyUeq~fz=lez;>huKQEr8dzQKGeQg zm=ZdjzKZv$gndC}BDzNW!TGevbj?MMNV66Vp6VdW)|l)&F#KtI$NzeAI-S8mIbd>9 zu{vwXtQUQ9R@5|nt$o38sh=u7j$I4nkN(lOR*VKNE@jW-zEL-8e=&J2aJ+s4pO3ne z@*jN#h?uHj@_$u0>b7C-$>+}}*B?>$37OxE@+w>loRs4@wO*~Sy<9GeeWSj9B}YsA z#Xi~BymY1Gd@?t@XK9J+@K_E#@zzfZW&cTEwL^AQIZissdNC%MY~mW$HTgXI@%kjc zmwa=&ohtfcmy+27MsX>*u#bH$N0iT_#f-Pwa;kmQ{XE|*nW}%~V$X1`;B{gB694?d z5|@%W_x>QhOuQb?+a{Id4;^siHa;JQoM|WOrI>CY zU%A&PV%744R^m)8PYxl!MB&v;WJcDg(%YOHTZGdt$C4eD*01Ch)7iv$tVXN~CP&CL zQok@#BgklBW=xI*hxTh(W{DZZA~8o4I~Ryn=e$vq-#*+IFa^}S;+$F>GrCeM+9#Wb zWgl`2_a#}zV&$R|E6ER!yd72b6@Nwv9aRw=oyo|?MlA7NMOudWrf zSRb7Dx55wPRu}r9iCAUEz#ld6Nom&)1RGf6VJ&8J5OW)1p11wbfbQ(04;hjf%Zi0% zI_{{Y#a%yO)8byGjZrg%J5A&&mWzcBr_RV&O)acMC{l0^I|(Pb4!O(U7x_bEvOD>E z;78xo46E7Nr=2SKBluGy-)&hQvj>7hxP`@&@&&mZH^fSe>rv)h);a3F{~Tu`XI*ip zF_7BH>UcIa&bD9!&c<@&ggFQgEzv{m*vEQ(by<{mcdp>?DyiHMvHL$MpjAt+9Ks%6 z9kcuYwcZ^0q;TVJ&YpV}w^dV=R^?xP18eV#&$h|@qtD6kUmtTu21k7U z;Kn{^&};WfW(f zK{dwapa1SZ;)i^{F1#4;_aS?<+qF{h!RKZ#-ixPN``xd^r4r)Z6)|(%ae`s?Mv4X- z-fj;zI0utBF}Z!8#emxlyBe!>{!KC&itVs}8+_TPQIzGE=5YVCWm?*WUfK9XFCrJO4YXLlm5JOmi^VkMOzNFH}8IDT&HhN zns(r%)xJ~PI@B!A)b1;rLvQ1m;a2cuDqhUpwo)8$EPMK;{W@V2i^9i(EH`!}M`mr_ z@4$QecO37>4cpj@Z0B!w7x=N0BZsy8ycbx4$B3uWT508P?o#=G{-K%Hd)@0w-5a?| z>x_6c*zN0#=3T9OJ41WF)#&eZb$1z8Ti05vDk^PzmDWnzO0|XRcx0Ey)#@jy9Mz1! zsi>pOoUFQRX_hX>FyF9HS|lye7f5$Wg}SBsB5Aprh(&d=gKy#*2WL@qDH6 zmB1J}*zhgH`jy~+nl>Ym`r8PNO39$Lz&kcG)Ve_vqd%{j1kUTt;|bte@aHtn;}>M$ zr4)%C1R7O>w>sX68FJRI$x108vrw&_!C4-dc1V?nW^k4d%-~%8*$mF|9UL^JNVEsY z-#BW?ASWtjjj?|-iyoZ&-zn+xX-5?mJ!RfeMNN;{cxJTZqyFtQ{`YD8i8TIf8b6-K ze~`vcr}49C{3mIAIE}xZ#y?2oAExmuY5cP^K9R=1N#k>7YypnXiZp(28sC`4H-W#0 z{Nu>aM?N-!$G~@Ld}o?|D|jiEk?&^K?@W{b1NcG6!$6iFN|Qg6#*c$bNP}8!yqCf2 zz&C6B4ET4!0~&uF{1$jv^c}CjV2K{EIaHXYgInPiXqs)YFCi$pYV$qn-)u&m8dW;0rbVh2SpmR*e^drwaEk z0lxrwAL`t{JWXDi#%t0zwe|YDtTL?#k=ujgxa)Ch^MqPj9}js*_Ic#?7N5uE_H;w9 zr7P&^q!n(mHrj3cs$|v1uFf`cceQu}dwYD=psPD%RfJWnfup_AUQOO^kB7W+psUA2 zEiInz?#`~3K$q+a`MWw{)*EnzJexY*=6b&|W~>MDYh0r=73 z>5zkur@CzE^oOci$m>>o^oBfvKx$x3)Y9S&cKbU+-WJ){PF_W?rA4`BxTVGG@&~A; zp|PpHuCb*_hzB<9Y}r{?-?*s-F5gjW+w1Cfr-ml)zHUDP)z+&F*Ve0=hyDyxZM{97 z5aQzM=t=e4p|ZAKWs=&gQ&Va7Kp#UQwz3L6fRrJ1V7TQZ^NLDfa*2?aUe2tO8%dU+W;dfGS_bMfR9 ztLJ=93BErx&U=j88#UxRlsTUbIVN?_=ByxkjCm>15v{$Cv5e>!jQ0>tVh`n*F+OrP z2N&*Y#&V*KjA-A!=y!~m{|&|sM00TX^1N*t3P!}m%ZPcu$%qe!Uu*IkjAcZN zaSrBSF{&70pT7gx{(2zW->J#ZGQ$4P88MIFGO|6KgE@A5i!dVIg0YUs$B6OxyMf0G z0(rdWH2IG;Ie#~>{0&Y1Hn(G(n~V*(i*PO~b{OHmgK;a-Sw{H%2_x)HGHyW}a)6tO z${5X<7bB8uy~d9)?jSm&;Y~*5+t-ZcLURwLyA!-{C(&-8 z9v8zSj7y1}8al8p%kM+}X!rr)nK0{@4dY88h4un;+g9E3TgKkLC2D%ChdN;y7bEN)<1Tr7B4|Nqj%)=>Ij$(6$6 zaa*deT^{pqHB8Cgg&wxubYUHSHfxv?-1;m2?S=w;3(nL-dQO+rJg|kP=fJ{p>`C9W p)}8sXK8}Rx@&fdBU=7)PF&>^rJ|2#7DkiAXCooVqqhreMe**~k@f-jE literal 0 HcmV?d00001 diff --git a/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/infblock.o b/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/infblock.o new file mode 100644 index 0000000000000000000000000000000000000000..37f2a34baa6f205cfe727e2db1f7405404ebec23 GIT binary patch literal 4556 zcma(TYiv{J^}F{vzBkUxNqE&j=A?b>N&UGcRyJVf`~ex1$f)H}bh>l|Comhx);R9C`jbPk_yUN*qD#_t-tS`;@1W?+4l@ufYF$U!AxmeegRa ze@nX5`VxQ7!iBF%Efaes#z^;nB9UNzB+|K2*eS4{OYZW>rt2Tg(+ssu6}csiZfzD0 zSqj6qq*u1GCk|N(!ufS%!4kUlRk^sCx8AcVkJ;#ns zOT^gCPfMKE$X}f2m{!M=(o}nToXV??@TT4zTx2jLzUQ%rme{{IyRLKV*b1XGO zL@_jMOA6Ccm2q0CCZkE;@;@Z%8u&4>>@Qfir& zv_^$)v`e%>VTpS}Y>em>mBrg9ZLxwz8yhL-4=3pQ!kcLG`ViVobkq(m%tq02O$Qrh zM=vb4Geo3lx{l%}?L?d!VZi1)BNTkEjxgJ=a0-#7DgD-abn;CNd%W2;HJh7l>=;I( z+_GeEbzr`EMVij!MJ5h^n?(yg9Z|(dok>)VEP8$hxg`dvm6ird{kvKcX zy;dW&+czN6 z$II%9AtQ+PbIF)^M$)UP<^^HOW|k_+lu%ap%`|($@97oUVo^{g*U*^P%A}gQEU6Qj zj6Xk;r=PGL;UP1|=)|WIcYz)A3yfGnAlBssqO7qvI-mdciMJZvN6kgoi_UFHY@S-l zypv|kyl-w2Jr|jN%5%Hx z_@@u&xL47CWXty}n*_14IU`1MrIx;&NkyF3CqY7*Ie`!W7Tm-%4 z6S!E+azo>{Z96yV=Abs$#92LoelR#gbj<=6cF&a6Y>b~w7Bg&w)iZiUoQ)Ldiy~}{ znJ2}8&f@E9&%HQD8V+Au@n4`5{kL=j{iljuF;!{U(ckcFtV#p%G%|PD;v$&!TbTJm z5;9*9uLMsf)%1HwQo_a6HIw&33%z%Dml5&ZAgQ%|Qp!W`yL+^dBo+i}n^`JU7bX>j z(kDmw30wIb2e#JFOu0#2%JOe#*eIiCwl~{8GqGXS%%mq`est;BTQ9|9n!nB$FxZbG z{4e9GNQ75K4$pGORdT++I9qn6^!Mu1m`^3A&^NhVa~S%-lh@d&Qr3K(W5b`{!KmeH z*)e8&rfc>-ZnQ0PaKAvcY|wV|tqvp9j&`;%8EgmJAKnc)^ji8(;i5ZdX}+6JRp{+I z?T@o#hoJ8eW3QNB2pSXJ@_lnzA{YF!J|mAE0Pi2npVc{W;STi4G3b-vk4v&`-TZ&c zDCT<^b@Gl*{{LU*VtfMfvC4?|1Ktg25%vPGs#xdqL5Z zKioy)YS38vn+XvizTE~Fb z*{=;89CoeD`2${`E3-7<8hSP$_+bkPc)i*|`_MscYEJ9*Y5Uy%fPKj6()te$I=ln^ z6}|32M$G3LcG&}{psS@K^*O{iKJ=CwAo6Qzo6=cs&Ir6^OZq1ICCnGMtfl!o5OY@!~dbrdmx9Ra%oXuy}E zLT2Q14HyEh0|8>_vj^F9iYy~JeR_n6cD0#g$ zhsRhR#YB*S%H~FjSCaKGNWGzPMoBiocMT3@P?AcZd(s@PX@ zJo1C|um>n5XJ2Lw<&~@CF-uo~kux}#PZv^pih;~-fH58y^_RiOoL)nM_3#wnPQYP6 zTo-_z2V4SG$Ug_;450iA83riwu~qyZSMl$z;{U#i|Hmr+>s9={RlGVIyVU<7XS0Cz zJOun%@P9Ro(f$tLr-5IW=Jx`h1RiS{*P-C{$u(?nlBxiy>LZ4p4kLb=@Y9H&X5#Sr z`dmJg9k2&nR(XTp>T~&Bf$XHy+voCI_xW6|>{MEA$o1T+sVuv1V836;ask-vxAq+z zvJbkQ+1ZrhTqW{Mc0IMr;STu8pli@Md~nsuKKB7vAF*2H60|yne(OHFdw^KGdV0<6 zJ=R{Hf1>kA>yz!~o=)q1V$bfk`}(rV2JQa-ER#OjeWwLySo_@0fZGd=X~l@NsQ=)Q z(>m;RLsxhNe6NDS8bu0$c?QCu(hw3%)3?)9M7j}rFEn2j6y9S2C%HeufnxbBWC6L2DmI0JO+?A%8`AWRN za{y%!Y=CfvVH_i%+z(Sj`J0i$w?XEtxbQT{Wj6tzkwcm}E6RNUazU7Y5X*fA&!GlH Sx8~}5tO(AVQ37k3;eP<~$pF6q literal 0 HcmV?d00001 diff --git a/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/infcodes.o b/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/infcodes.o new file mode 100644 index 0000000000000000000000000000000000000000..5f324872186029cd8da8612af7c3dc0f6e4c7651 GIT binary patch literal 2900 zcma)8eN0=|6+ibq8y?_NlaD3^L?0q7Mh z7=wLmVjrCUWDtRr0 z+96xGx97jf|EjXlup3Np+{FBh?r@&<qn8W4MR#?ftUY0Oj2xiII`wi9QLd0b*NR== zzZLO(Y!-FCarKXj`SwwdZE8jBEZp2O>RJ78Mz@KuKCf%_vRww&!N3-n09{@P1P1UQa!V(@J7w*lgR+^wulw>z?gk6ytW@oF^N$nf9hIu;UG9;L24m(0OA`5#8q^q!r3;^p}ZTf*_B_+U6N14oqLbB(607Gjss)%nf*-nnJl-86)p50 zt}65r(aUvY&W1bY<{|b|yZQ1zi7X#Sp3LMQs^?W_E5w2WN0h!`uh}OhYjbnG=-S^sG@uRbYzq!3;X$!h`ku6_s-}9#Sgonv zZmvKR{i-N_r8@|02Ttv~tC}DyH@it-Ib5!7gKZPr%(n1b*~6@mE8>e;3Ac@b6gk$f zDc#7mu*n0~EbQ--H2+Zzq+Uf+KXH- zJt2^qI=?R|nidXr4{81ghO?eBe-~}Aw3eyozw)aIz~d*Ac(CDbXC^Ut5XEq6i5dD+ z88Yc_B?oQgfQvjs1Vlu+LQUs3*KMr3{TF9O!5+nd6QYIhc^REqFne8z-{C_{(t(II3DT`xW5GV ze^+`04JqGNCFr&+AeKe8?#dsB>xR{44ghA(^{-qpSIl(Dh#3YTd7 z0&UD8=mE&-M7S)qyT`1;)WKP-2F&Q3;FE~#Km_&Xbbu1#g`a}f-={D~@3ajwlzQhG zxZ-(j=kd@R@`S$XWnZ3;UeH{wmGURr1y(qDQFC!v1L3N&MqUw{z`9T1U0}w-1f|SAMY)fSit@6C_56_5)BD|GbeOM#p^$BQwN5;wd04V-912C|h~=*WKgaQyse~B| zmJ{5_9+}KpcwzXWX18-E)-J%EN!@qeGQ3+J)mVN^bCMS$Yp)2oLiZ&N*c$o0$Ug-x z7jd5rZJ2KNa9L;Z-o~Xm`R2_KtCRfQNg;Pm=7!K3$aS+CII8hx+9O0KRd*-3+=x7T z-4W$ZRqKr7vM!8%T4Wro=CC+X=Z2mg0G-s~3eVXPmF`YnlP4a)GtaP^#qlt@JyJrS zlfSrb)Q!o~x(Pxny(!vNzSB;C?cJ6J&>^cvD7<{f(R8+Mu8S7W$89dIzRQZkKpm?v+&pz-417Pu2 zNi1;Ss5Btng?iT_jKIQ$)k0Qi>Yypl;~c*3uRVwsf>b zqt8e7bnFR+S|S~bkRBy-sFZh26+i;_c4P1qau$z#m~vai#{VPMp`YepW=A`U=3^39 z7HF<^98y{5aDf+P9tT}dadg|YW!(&M#uU&_iDD_O!$I+;`@e90#LzVxa8RPS(*IgX zr~6WWbD2{-rE7?5EQ!WUF?4J%bHj*}-Au4-pcqQ~abSqUhJq8tJ!vY)O&skxGY9J4 rins(7%4FgwXG|mVGl&z=NPC+0F+B!eqfz6^cwb>#?m)XqX1sp^G8^5< literal 0 HcmV?d00001 diff --git a/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/inflate.o b/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/inflate.o new file mode 100644 index 0000000000000000000000000000000000000000..026cb60ac8fb2e807f1be1bc658e2550b79516b3 GIT binary patch literal 3632 zcma)8eN0=|6+hR{HsFFoNV*b2$g_cBAhD`}H<&{pz&Hm`e+4;$Gg zA<5K2L$xi+wn+ULWLnhFX@5kS8jq!lS|KMQ)3m9p%+^U+wJFJv;&iB*iK5MIr?GRM z{lG>0I@Z1C{O&pToO8d<^GhAw5@QSuV&H-`1mG&xHI`jEb3qB%U@E@n(!BP=_(v+# zFv%y+cqjR!?36Yq3TkVmUTqs+`TIXtL}|}lIL%V)cYX;CiC&4NVclDp?6A2fKAWn+693ll93n-k0l&V37J30!SS zVZbiEEC*-D2Lb~Pv*k|anCi4hH)U|`PD1rr@8!f{Z@YXs!K&x^PnHXXf=2QByb2Dh z{9K$lMd@d46kU}IXGJ{^5HoXSkAK>mPL*}N+Zzb{KDDu{Tza?nt$;JINqRpOPFo-| zm$jueW%Nv`7xKnQhQ!Z}4bAaQl1pwvEIm3zIEav_Olt^jZFEgpZO}(&wZcz%u;b8oHkpa_R8P9R+ONmuA~9( zN)tEkl%-#W_rS)!!WQAHteKsKjW7ns;G6IwM8PE$IxBckg+`uqsO*s$)g=WvTV{6F zdMyJtXLwJ#$Zi|ErIlH)B0kBX@$uw`C}nMLY4&ASj5EmkN>AEWJj2hDor>01OiOkz z&1n5EGwxeI!+DbbE-tFiRxN6t%E>!cm{FgsJjY?|jM}G~d}sJcFQiw-Eza%SC0)yu zk3Y*xoZrH8FoAG!?oRsqLG?l^sLo^iD8DR{>HHTEOEvsGB@ZLAtWc3k+}%6{`Pu&YbOz^2*K0ajFWb;+~wRL5{~ zb$xGACJ*TTzL)c7c`(2`D_Kh&r+t}Lt2kQ%$25nAu4JvgMk`tjpoJ4HOkzFmoeg)+ z8LZ-K`?3GtH{O0ww{}SZekA8lsB0P9&Wo(%ZU4Pz{*8sX?qQ6%9b;NO(|k5n+f^ch zqnsb}(fyy1`&MK8DP@rY>MZsysTog*0}O zm>TW}&_ajhA+29LqJ{dyN5rUhOu?~WI1*8UF;P|IekCFXRV6qG5K@$Wv0n?u(19E| znrGK9$7I6_6X|Sk-zU1B4vdCkqYrg!XdD)Ix%awTn_8Mj_0g8*`s@gJ=qn^EazF#t zfTHEgO&+k?3Ot3Z$Ye8@nK!fh*#km3+rlbLTZKwiWpXlbM~@E2-6)8cVmJ!!FX!JJbA9#mq!{JN#5;m3^qUnpn#@WG>@Ro^5Z2y0j&a;Y21Mp5A((KP^0 z+)f)lrf%X@0KX1yaFfhAYP5{lXwllA5Caq2k;qj z^h@trzz07`ycpoy#7h895yyven)n8Q^T=)J@3+M3aUPyO#iw^FYy#Ma{;ReFe1N!W z2j=yE5>BBd;H%6My{+r$!ypW&6D_p}TbqvX`;9qYMwx0A%_lp0xwScrS6!!K!*LFi zEm0#jvj1Op&1ge&aJzIOe@0F;V90w=Cc9P|L@GtQk*uiqWJmhW94Eg-<7n5E74@EM zs2#|0eGt2!{)csN)ZrRdLy_HXV-j-mMMO2*SS#T_uglM{BW|pf><(f1OX2`t4WKii Vb(CVGv&i>XgTlcp literal 0 HcmV?d00001 diff --git a/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/inftrees.o b/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release/inftrees.o new file mode 100644 index 0000000000000000000000000000000000000000..4716d964e7158bb536a0059e0da67773f84f00fb GIT binary patch literal 8544 zcma)=3tUv!oyX6e8DN0nDMnOcM)83UMnKf4B!ywP*ocD9m}mk6jDjK%7+;Brpe8Yz zDl%YnFwtrsiCPy^w=vyT$fMhIqghDY-I&&m-DHD->~=63Z*3F%`=9w=ys_EOdOn={ zz5nw&=lsv>f9~k!yaH8G6rm?Yq=;LV5KHfoN=T+eiii>sBK7k?;cwf&np^ZzO!Jej z`TnZ~gZ9SzCaMb$isZ272@i#+mKSX5;)7Am@f8bRx~LWHvAvMjJjOTHH_n&h8}FOo zo9LV5OZ7Q?lYMEvbYF&ViZ9c*ShLJhk1AQFzOCkk+O|oie#MjvUg^H5wOrbjCj!qj zM)kMYGAfiYE7dY}p=K!*ld=Qr8Aq-7sDE%vMv3T;Z7dAj%=D?}w3dcx&2i1skBa06HA{_> zHO1w`h_r6oK{2WbZ*xwn$1QSfu7VXwxtgmgUmI;#GWIzC^kJM|edXPLVGi*fbruGM zQ2Mr*?`m48xw57XjHhAFd@ie+NIGvov7CCuoa zWn!n(d_l=rHmue8)rS`}kp{p0<~>7QC$F8V5m&Y}s4xFc6S1Q2*$~S<(f5`)PwUJQ zlSQDhL476VhV8FP-!3Ijb3K1Xov(E!DSc-{iias$mi=sBkLhVmX}317DhctQQXh3C zxM;*b`Tf~Glag@2=3lRx_r3S(VT`nMbkzIt6)^`6JFU$Pf&C4yUTfHF^JjL5(IulT z8MbElxe{?hxwgd_{l4ji!rtFRTMwH1-c-z5M)m~P7U#U$!ji{a*FP{FjP)n>nqm?= zV*Mdq+j~vc1=jdpYs{a!Ul;1nqFfO-Y*(pN$y%(rCRuwemKJAJSF}IQ^=_ZdHea*M zMU5-U_mr8|UX$st^ULlCzp45Do|=G3M78DlhgbNW)!q5+zrGyUJxX2K6Xrjo4l3E* zb52WaKa#h-BeW$~4fSvDID(ar!`T{g;e=3+X1EsM44>{ZnLj#j>2H{~!WG?r^L|_3 zu4wb6C7NY&+pzb}ugfd!%{5=|J}lG|ce$2m+p1m~K6vk&=hYKRR)!1bDRkOir?xF? z^VRkfuYIN@E3L<}cYGGsW>=F+GE3Tftp1n-Z}*v^ZGKv>LH-4rBRk$-lnL5Debw6h zNKZJQx&cupNNduRJ5*FH7j#b$NnQZd#t%DQ**s<1tSMuxS$yeg?8yybL$m|FYuL8C&N z;#BMLbDFJTifUzMnCp0GK@%h(CC=;bl);0tR6I1HJ_8m4}%W&Uw@d%^4x z>Nl?NJxK?|m`8Dbn^aq?WmMveVS5U%Ha!;Bc4(Egb$G=^t^CkMt*R-?H>@qfmyA(_ zs3N7l>tju8w;c;<%D$q+|HT#Qv-l$WH$~GNmSHxwrWvYfZ#LeQ01 zt$ojm@coh3POr20tZn2+>^1o!+7x)#%r~#+!PEBFt!;@FuU%{0oYEmuY#nr);B-X1 z-JLMd?-}%KjtT9G?GK3w!_yKI=swjGCCAp@V;iV{`~zhX@b)ErK4wd?_=L2)zkd z2z?fpZ(!a_gx&?rhmNVp_7%(&BJ_5)(Y4gKGiMW_2LSSqIFkAzW&*evjXnX%|3ohL zGUay_?cae-{-e0OoH?2Z{bjcG{De%;j~=3?kaU4bc1}xxAD) ziU|EjY@3){m`)<}PXY3eKRN%0nRGXh-U874bGiI+=1d~=^8n3%5SOoFP9Q=*#kPJv zcd-2c>sLYYAHwBJn0JAla#MoypTgzqnA3>p|13cBkKyta%&|o1$Jy4;_cLs(tbYNL ze^iz8f0Rl0BNZM1X#Qnf{uJ|mBJ@81H2>jTUd?n6q5q2QXyz{FJR=2C&pO2u z?f+KL82^v4o=!yjHvt;IzP@hON3wpHZFyCpzecumSpP4O+Ux7{5bHx(Zw8I=zmfGB ztiKN$X#X#OG5$TQ zk74~N+xq!>n(aK+dqMIqj~X72uzok|e$W{IPqKa=>mPx}_+P_%D(k;wTfd)v!1i3$ zZ-C_A%;ow$L-9oW{}yPB|9Y+`;{o&kXV}L0*UxD()r0;MuCMpMmF-;CKLg1>{^TMo zW6JZ4_IqI)nGUO=l3kz`Kes59u5^Q7qZ)W{_MCkts7~{W& z^~tQCVOzhScC%f``Zu64{)rnXR&?(G{%1w>yuc2 zooyTQd1e9Ye+J3F9-j+Xj|cDM`~Mr%Gsb@@w;x5s{C~{0iMfU8Btrjhfc)c6F2cji zVMOSyfHD3bXMHB?{{|Z4e--N!SpP@1_4B!d?FU%D29ke0{+F(huB-#Ne-|0`G@%lgmQ*3b7dY^$vQ4@myem7M>h%n?Ksz6coO|0&k*XZ<2*jQ?uZ z9jyPF?P%sM<~-KF295DQpY=HKPQL$dp&pH2Utc%3A4$ackFc#U8<{yo=$`=8USFSw zSRcx|4>ZRAM%HJr{sCx=|4P=!v;K3o;YzOWbIk7(QTQc5{`L4=%=%y|$A15R-~V?} z&lvw6Za;>I{*SS(pRcFc&SSj~B>#H+Kf?Omtha&2_iuugCvF)(3%i^8NoU>KWs|jN2y@G5?>kt@po`?OfJ-K=O}2xd_Xc!-;7B z0$_~)Cs?1w`hS4N_+QQXMAlzpJCeDRIfwP@Aosg;p#Q6RdFvkB% z*2l5_4{Yo6dzS5d*8c>Oe{?11fBX0UAc~FgfBX0UW9Y{Cui<_s6VYi0+cC`D%t9jc zn?MmJPx1L65ibitivML~FZak^NKrOaJ&GK>lg{q<>r#R%pLy&lPk+XG6jM&>kyTXF59y_D``R zV;_`kH9@{h9SsIbD?antX@&&_Im8; zj&w(+J-4QIV_oIS3a>qV#*C?{8EI)5_POr5)%Kk7Do>qVh?;ety85-H^<{OHrJizo z`NnGZn#wYJX{Fa*<*8ojt*Ezq>pUJ&SzT7Mrnbt1p8wA}xAj$3>GjmPt0o8g33g-b z=R5V=`Y5lg_qwagJlt9s+y9;BSySuXX#ZBReSM|3LZ1niM~M8~+?n>2#ieVjy=x~I zR93s|YV4Vg8IFw9^t83IG(By6utel!qJi7vF0B;G1iXe!Pt6gb5n(x2CEOHYiMJ#u zgOwrXL}jQl%rxAbq>M0)QiP*^;~KBK6!g{wS)sqxd8!;<&jzn>l)Jrd;V7-I7mm7` zpb;ds!p;c?)_aYo8da-nydFpXyv3{M z29jBx!T}R;L8tImG9yapOx;R~yc4L;%cyEXd-~maX`q=R>ys8tL46w?YMB&4-}w}_ z==K>k@J=tGvVDu8KK0*4!61_&#(@QFQT<7Hr`QgrP#L#pbrU-MZf!EybYHa_Y?@!d z&_DT$l|Rm?l5zFu-UyNNB_)_bL^i+Czf%*ynS;Nw2AY`VEiz!Dw{TH?%am?5-)6VoX8#oS z=NQIuFdifNCD@AnT8{CN-37ZJ>q&b|_NU-wXp_M>x|wk&(IryvC=;W-qGIg|Z*l3` z%BpfPx?DI4a?|ONMvn}7Orgg#dLRl4a;J(i+&k6v5(u5LT8eN21=5Pj4W9C1ZAHrx>B~?I4vu51Mhg zHxY5UpT*KqJ&FaYcOImAAA)B5c>e=28vPUT;r^6}b90%958D?+{3Dmnwi&(?m>Aj} zCHn4T8*$=-iEhJ0-M~ABDHHuhpl?&Qw1nuyKkWA5oxV@hp6byzYz*5NicAI67kz*^ z>HX2~45~j+kA8?467@+b4Vm8QdrGMQ^%8Xhw%*^pc&B<9$dtPH{}6 zekmU<2jkRb*u{yocYeiBTaN60|y}j*&o~GHFesO)Ueg7M$Ko%PrHZKX3R(J_e&dz2iD_arah>p zk}tPHffJ>8o2BAAQs0;sZ$k<)cM-2|LuBN&tmf5C>q&W2&*`#y1-%y~=jShHYiY8y zUX(f?vFen1Mt`@t{jh4iT3RoTn4yI0JFQ9k)7oLwKGY%9OQ@@;4k;2GBsfTLkl-M} zL4tz>hY02A>5Hk%T%}d#t+TUcU28T{6G~ng%Z}z+-RNlUv>Sl}ovdbP6%*Jnn$r1f z0S-jNg$U~jL_-6iL3WrO3C7t`b}WzxCfV_T%s{bMYFw)z@}`T6!fF~-g&X%cDDxWE zK&jX^D0-t-GwK+tH@Kmcugzs`uIUyig&S8Djq|2iX>r5G{`i%>Ia`tr(Nu%_7-z-|0Dii3af&@1_0pjl`(u?5{M%_$`0841K5 z)G5y%}hiqZeXi=dwLd~vEVOwwLLM7cEI1s12ZoX@xKxA6fV;OS{ekaE7-)X;!yEw9Lwj zpoL(HT3s`5qG(qu8%pc;zJpq6W>TgY+y@Za$-4RbtTX4}$hDil@Ar@2{o}XcoVC~9 zYrogtXYI8g6Ft#Z;&9%oyU}>HNgOjSd3@5iaY@NWqgnLwe;bX7iOJ)9A*?#aSO#ON zy^IB>`kqiTWAub?|Lteo0>=KgPv(BcuJzcO7?YoZ8I0Xu`JbPPpBeLiUZ`P=o*fO0 z?N0gi=Zh~HYjO8}Y+3o)CCN$5QB+V|l3iMQ#l{w8mo0RZI2M-K?D^RYHjrgy=j7YU zvS(+PSzL}XS5cv@W0gFpqg=INpxnJ}K zAn%;~`%9gGCD}_{$k?J~rP{rdr2>+Ug*M{lI-jrH^i_o>q=$zimdd(LdU}5BILg(fTJiYyL6#{Dxym- z|Eto-v6c3O_cfE03^j;kl^VnkTPSX@#4toe-pK(=Y%TUzPg?1MzT%up- zbIN+K&{p8;2`RbexRz%3<*>dcld%F@X&x)ELLfASn*8iSEGxhL91u1O2oKiHe;abd5;@6hQ=y0-ej!0 zM>D4L9LHhE@)?fBu`3v3O$yOHV2lXjn2u@KsP8&5EB2`MYy|75aI^SQ@06~^nn_&^ z3*PI}XfiK${@$LkmXGs%%^&Ct4Sl~|q4x|v|PJ3yuV=3 z8^-n*hD=vl`U`{g{e?kqL|IH06|gA1$+7@2@(mvzA>jihJY2$Wc*BSg{e=ODV;*4t zH*z#lZ*;dX-?##m`r>Ea+ zjGJq}zp(878>hQ4XcZa9j2=HaX;h;5e$h42Ji_O~CQ+^0vTb%3EGo+$J^9YLqe{zcjyyJc(yTj1+sevHT=x6RvP;Frz3S!911i>e z+22!n6^AgUWIiU5X_RmYk`WR5$42x4SNSTLsu!+iA#kBk5qR|_o6O`6HndDet_t;^ zkw_^%wM0fWALW-VIS0`aol>Hk;YUMGGCCY~EuP<^8!3gs$6quQ-zdpWfa0TPtONl> z^N5^~gv%%d3re$Ca%MzFVPzxJ^?`$&H}cy9kGV1tpiD>5zxA|0>fshBJyb6S$?hND zcF+xgyKLn6&2o=(-gCxWG~a*Xz~?tP5Iy`G;RFn|FuSCOd1>1~wZS z(0j{O(J4H+b8#wO>-E`pruFj}`JxULJKw6VOX1%Wn3-t4ZlyQ#5oBfQmZYqO5Ir!;FLXHb7UtMo`E23j>6vMhrZ3Fo`PmtB7S5TJHa%nERb-3q zx0Ph|B*7Sjd!|E0&LD_FV^YF&7*xt6NO{&F!*0NVVT`Q+jOfSMDnKQw_!&SQ4dT~n zhJcRhTy72OGxd06L*oz`8pmmDO2tFwDX`NNK$>(>c%q|mIab1DZaW6t-w-XC1Uy9l zTXbg7P?#h{N8XBwh78eN&v<_; z=$yVF;#-cMAcpQ9vmFjrJoLS$=Av?-xy3q`>jWs%0;wR2WaRk7shT|4L!$hx@jfY; zBv3NHEqgBTb=9lJdv3~7OYvmp5z8>*0k0;$s0}p?iFDzKt({tZ%5<(%tITZsQva|; z->C@U+CK>i6SNDo$zek18yTr#LdecAA$a58_k;=hr^1Awhvx{fGr|O2{>nCkF-!B*nw2nh{O!qwfT(=EKT`qCUBzJ9fc2L>*@^u&*Igb|fbv>8S`(Wccd zytGP~Bg8Rx+d$*vZA^1{&m3WR@#CO=tc|HJ0vl$14A{yx7Vvjqu`?*W-Oc(=POs?D zD7f~IIQwqhbe-j43na@4>8WeePJ+&4t^nPI=B9L#FSR_C{WG*djMNU#m^DjA+Cu*E z+RVTW0}mHy{?MIUJoW|0ciYxyZAw~oGUWOFUp_eayH8tIojCGr!t_@I4?ev6_nJ}r zTh|WqRAw3eJgCdqkUM4Zf$zVX^yZ33j(ri){_UxPnfs1)|7GRTio0s^!&r&{qc>RXY!9H-M`>;#$SU!`|_S!nqS^&J~8ZO_SH=H z%+KE&VDozRb?=Qf9d5j9!}{0$8v4S){hRhH;*f_ zn(cwlgx7?8{d#cjqoZyq&_0`=wU%4pIM+QhFVAkvk2-G7UU?_8cl~|6I{%>;xX8D< zwaf259D3p16AjrjzWa0Ew*7BD`S7X(Kc60S%06|}7yZ9~_~=vF(~tc$&$j1|PiF4B zxs1KB?Hlv!$0ogSdfMmfkKa;oxcT{?x<5Ob`<*NO=M#lv_*IMk3j`tr9J~eT1z>FP}6vGXMpf?{g>fevu=e)adWsx!PSk8gX-`YM2`SGjY)x3XV zL`;phVej_O|8m1EjrWuX?;Sm1!NEWODgU)5W5xczzuM@j)qnGfx_2-R@1AM=aH$9Y?ll zA9r?fgMWEj?Yi%7`wt&3%62avmp`yoomcok8AAkJk zn`_eF{PPW;u4%BI-}c#OzprlIa`^4zDYLpxXLc@ny?N2yZ@hR)z3;Z$$L*Q&MMCiL z>5;l!7pE!5S(m9M9r~yB^xV^nw*PZYVd8^ty7;FWZ68Kdm*_uI zP7ZqgzyL+ejl%-wzB%EwcjAH$?y0(WZ-Oefals!ifBtsjU%mUD+;n2(pjW<{-|%); z-LNjl-!^W`yGN0hB-&#Uqaa!G3N1PL$(Hy~a=`tK61ow8b1m6&AP6WGikD=);ef$-$k8YJk?wP} zEcji~iC#-XieOYWB??VtAgGlfMR`5uT5^}3GAJ362gvl6yDTVbINX0r?n?EGi{g>d z-g4Kk(aCa`EVGDoa;6ZUY$bV>;+EyER5Z=C=Gl|{@&GFiqbV!cgPm4JU=H)F)s!7jL~#@xb0RR-|bM|E)bK ztTL?ds4i6e{_XaV5Y>h9GFDsT$?RYu+}iO26>A5CD>eim+zR7Kq0GGHLiu90u`*4C zaQVhKPo0+Aa8gKVTAMaN;C7xAM!JVCi1YN}xwTVyW!1+*zlLSucis15TBtXU=i0Q~ zM4^viO$K*_o6yy)tgA_j^Mvynn#ccP#z2F>ZEVhHYi2c70&8GPD>A+n?Oa1D>|epI zNMh9rv!ZTPOQoQwU$=B?#@)@8g0lV?Y?-jB>ia#oHDfYt0rhiWyA3vV{W{ogYCiU$ zHmOq3)Njog-E0uFnRSA;z9Q{|c9m-Hr4`+oZFBn7c-T-jGSOQpaP`&v9K`vdm(_7* zMXftRRm(1v7q3iXRr)UiYS-p)wae2solQ+{#F@KA< z+Wa-%0p_ppR+&%Ytu!CUTVehb@1w2EBkVimQn>DOtw%ld=K~H12UYw)S3KY3BwfTA zSBul;y4N*%;GF}*UD2*tk#Uw*>m8Bdwj5im?Oq#;Ki6FAjIap@#ddDsb5(p(VJYLP zZ)%y*rd4V^WBCBDBRAQy?LtLqO~$Q9j-g&pqLyCkWTA!Lxf#aO#)}AXycU1HigoZHT{Um zIp4_=rg$BB$Am0*WJF`THlWFy7p3(Sb#MXi`la4<)R>pVmk*?pS@XZi+g3;+6z!=B zTR~mqyX{)-wwxy-55vutog^r3VbPn?wzaF3HJ%N7xRgHb?&hs|i9A;qVG(_evTw~E zZoC1$RJO4expbAyN|CEr^hqJg_@SUORJpe9*0gKcEPe{8n1S*E2(H$e=kl$Evn;bM z9|Hdn_(QF;!12t0-ol9PL%t-8FUm#ceN)&NJorvBVa%$6RZzRq53X~I&Un_KF215jU?&Kc#o?}9O3sk`46)B$ztm&0bWk|FzpmK54 z<~yFDavI!wxDA)%^n%(v^_~wGsM;%(jY8#6MJK1&2FTSubNkVGstbE(t@bF}y@tpI zl>$rjQMm_liQ5GCz?m+4;h92iymIY~D5@a9y=Ww@1!>{#RHp*fz zWTyKwwzdZ-cAz|q`Ke-0k;~KeuTNXY^HhTV{|bn!&z^k3RAevw>0C_V7rTe$P3o$& z+6pIi)nrfV+PKJmPoibmyg7oV5Poed%7Wkl*xVLo+`cx?t~e zU1zv1urn%9#j{u|dYEA0ssq>3Sk%;U+HEV00T0a$Hx_&Y9;!$^mzS5?k{gz~HBXDa zG)@Sc5hEC83=_f(`22R9bUSjVMbg+;i(Ycf?dw0RpWcaBnMA zrhI`O^kD?I;RIT-X;0mrP-o@T7-4|9B=7#aah)8u z74Y$C;FXzNXFqP9pfIlXDB6#P9bHg;rO%AulF(;H924d>wG;+9KWb+T=@l#DwiYQn zFDJL;tnzTte{5H3@D++)m+|LIkN@B(Tm}21fwW?`)%`-=hNzf4edpzIifZNhx#1DK zso?8eF6o$%+7M8ECSSEy^Q^jhKL4>`Y*KFiI`3ma?>;5;YdR%_0~%Uh%vM#}bCj3# z-}e_dkD@JvakoC%ro>3D#Ymnggf$Eo3=Pp3hq$B{v)SnL&6>^k@uv`rs^%2pRMa^v zjvRL5ZQUumatfHqUWooTdTYB{v_7P#s0VBXSx3k+!cua zXF>nt#s1f4m#vVEdbB%sSABsZ?zW5Lb{VN3>Zw(zANEU5T~HFmZ3uOueGC}Onuw>V zW%kd#!qt&Zs#R`6OX1}RMCDuDsj#&&W03gGu%kCpkJ#Zcv$C-KYa;b_B}^h*|fCI|JQ-0lesr*YuQSoh^mzPe8LQatwD$OuSyCDm!ek9CH0K?{z`Y`gmgioXv=pb7kT&(wjlBK>3klNkH! z2bMD7Ad8FODGxM4vFP6UsFCtp0)^2_#i%>A20eF^RjbZ=v3;ljvuXDI;`NB zkkVqxYD|UHcw=ks*}U2KqD*)DxEXGn8&kP9jpB(O4#$_a5+h+HzO)7|(U$SI6AY`r zLIva$Mv%qL@Cy45yV%I7US%$EWjfyJ-mNZX+Tv8i)~2P~Dy$W@ckB+^8=h^pcvG}Z zaZ>MzH!U`?ScjD}DIG>W)-KjvzCCvY-;$^7Wa-=l#jsh-?zk6~5;lW;zb*=$7RP7j z1aZqO+uF;O+1btEXLFJSWlQF&)vG>S6`K>Aby!%@^2bGog;hq!qG5|(%oYw(K7H@v z$t2@r{Jj0NP_taHK-ljvl~c}H$B=T>2-X!-d{nDZ+2v!9(oM)UH}nxQ9bY z`gxcspo3E~NE2VUmH1Awj)3y`_+x^x#b}MT&-OZ8YVauho70_79$1|5kza^vx5N2O zq5S~6F}34aH#3Fvkl&y5#gCB|y91)HWw0<*%Bt`j!;V$Ji+rF0RzeMjdP3Cgy3Kn=}0tYj$~;h_VeFgEGWarn_|iX&P1_mEk;n5stX_ z*rwwn2V$OZ}UTzC%^^G@_w-=?nsdhEA+VffL znY9|ZU_;u3q2I5lQ8_aWwsoua*>%di< zNfE!wlP+@Ocu4UNw`8`h)ZWMqy7RqujUN2d=l7N^?Q1wa)(NzUcM1BY#q*xZ;Jg*i z*AImA_h*E9`%ML<=Io*eEguj3>-@r1FRf}{h5l3gBK04G18=ucA+8m3(OebvKuU$H zg+y;s$9kyD>>uKr^z^ytTRa{XH_@Ad`58+X>%EWoE_(5(a8EpB9xjH(Je{WZuoy)L zr(p51%^RGUx9v{Pb?4ShKI1x(H*mKjw_dbw@Usu}v)AVi8BLg{Ox&J(SeV{)#-4y$Nyt^i*m8}I?Xo?;Ua|*WQg^CiEP~F^BD%~G zbmr(h1z&HiVJ%iR;wJBwJT_vC_iMcIm5IO6YwF-QNX3wjD|3|X>B`ncVHR+NyN@M~ zw+JDIZ8Nnd$C3czk4*3e&0Cp>{h`n8_XtXJxm{_eI()SIce{c`mpuDCa7%zh6?l6b zPjq#zmuiN|v0v5^pZL0d+(zv&>6AM1x-$}K9vy0l{Mc6AB^^Kr*NU|hb zCP{4&V^eiLr8qNFb+OEJSTH20E`-~`OA`(YQ3>)lx_B~;Kfd~v-F#3fe!q><`nplv zykVp*qT;SlW8(PnV@D;K%}K^-*|x$_`9=2^8z*CZJ^w+Y*eHH46*PKUNjs^6p4b44 zj0!8c3gNZ)$JaN?RbRqiId6o@?v_ARha0VF&g@H^l+lK(j1 zGcos^j)(lyfmcG8>oc6F&)w*U)A;`!a2k?jdUwwvg^&IzKYTXmp9X#jP^LfLlW8CQ zmwq^<|8UPf3!ncgKb-u>^lXUn`A_u2$=^+z#YE%tuk^!ZAA+% z@LSM6D6Jqroq zic@}3;i7EpWiGIlIh@S5Ng4a#vs{IXSPsUyg|vCSXo(zXVQD@P>`#&gOl&s7-ftQ4 zZGXm|qQV^4qWep1w1r>V;9rnk;K06n`9J_|mcD97^tHDu{mPzeDZQ&Vj7yHb4d@iV zxGNj!Vhg;S!~e8NyJxet6wz;;E$Fo;TMBj64y|7~YQWfQXcL{0F_Lo$l5UHjgMXY|{V_m#&JRbYTLN;>#Cc=T@mgAcTx}`D^piD<${mUVsjj1lF9AHtAj>?gV zhvK93$#@Z8@3l_ypNB^-6Vd(aSISH6gS-_J4H=@lo;BMfFob_O!2Q;m?YJ??Sj{E#+k53wY169T znl0^(_RTvX(HCfUle~M@b<6H`!UFS>gkjzi=muHraIZ1nAo^`TV9no_H@3|b5C=V? zkG?+N2dz?g-`qWpPdP}jDV>852j=`^zm{h80sQAZwjruL;8O~>{W85@xO@gPmT;O!i=oM_?lNcQ;?AES`+Cv- z{c&Hp*NE6D(Px$9^O;x=joLTLSadOFA zw8P5Xyd^uv>eHW4uGgK{Gx*%>u*O*1pa*&EcHhj7=JGf2E2ceU+19Wcb2_bu8&)?D z?Kv!{I?@?k%{pFkXBnyPXf{VPcC|f;=k1C7V|Fv2lQqoxV%9n9Fk6mwSk{Y;yDE@+-;bMw}0is1wIz5ED1xO0q_{DV7J=x6bb{JT6_Br&sNiEf3k zz=}1k2_*>%&l>EI59#DW;AURn-PUPlOHh}#1g!@y^$Rb#e>~6`7+T}u_&ZMIBuw=> z6Q+CRFwl}V6Ni$X;Ys(BgvnlTODd%~by|w4s3Qb=PHUFYO09r=#?5U8=OoM`s&tb$ zXJ)3&X_I)RHRq&n|GttpWwC@TFJd(=iBCt(*CXs#zZgaCb2ytKj5$GdseE*8Bu)a{ z(`*v;_N0qAm$ANif9tu7%nn6RWpiUIv@6>0TH|il#-tdZKCi+Gt+G;4O=kl_l$4ut zUe0U7CHMFBSuNK2fd??#4VN@hJCQcUaruYjU*2hDF`6oMRX86|r8KFkw8NEEPsS>$ zxadC9>UnMT5YyA=>)A33#j7)!a{konYZ)c~EI6wMCFt|ZHj&4If7vXaM4)pUWav!G zGk`P(`})bPzo^ANaq};}zA^3>rOL=F+XG@R|6u-QtR+1P+-X(ya69(ax=6zYT>;OA zp-fYbTyR?kH1n^I=Y6?I9~AD{?il7xaB;&-2kJXH^{ba2yZAsL7k9()2%f0VdlT}Z zm5AOh*7Az98=7Cve@8I5+pVJy$gym9eAT)=kBifKNPFH<9`Aa^5yrFlQ(kV^JE-l; z=Isu0XEeqnxz90ApWFL_=R5YP2R}FOiG~EHrn=ur#mU(O$W~8g&l}>u~A<(pUF40eB&I?x8xrYS7KV7Em=g}^~;(3nzUPJ zd{k_8eB%s9jrk}{u8R>ZS!R@7_`_kWtNZ#1i+kTot#BrPtD_a8*2`(BC*t{NXNz;Y z$fGf?Xs5$DD{=(%VS4xc$Qav-^E$Tt^;aWEpPg)R*pe(;t!(s>X3k{h&!Am}KTtki z`Gwv${0r;$qqak1t8Fmy$Ao_MRLk+GWoVEZ;_&vlY|CrO`U8De)V}=1^Yag+^3*Ow zALHs95n~fMXWXXNLHsMN!MAfUhJ6oN^wXC&1a~UAsC!IKu9|4MTG-y-f_pAjK~wc(M~b}d8#NV!kE2&A zPmSkO(LNaQFSuvxlOt%o6m_L;27aH4M#^+$L-AyyxYt)>ECh9KMx6)WQPH5-dEY%M zAz)B6pU_k9u=T2UWrJC&_arHflzsT7@p>`kXkLL)=ivF2RHWizp77o1Nf^l$;9crv zhJDPGZY6o(`G2Jx@NsLsG^!X5;!mvkl7zv{>G{R`@D=7)I^J=_;|nnY@n(x<9#+_r zb?0v4MB=*WLSw$%lYQ}-ef4anKCOtycQ&pVIZW_Yh@OfMU0IJFmT{Zf7$ztDvtDZD zVi@% zR}DLxe}0c|?UlPVv#o#Z52EV}&fcza99v)WwJ!6-OcVAk!@6V&YCFjKP$QRY_O5gV z?@m~nd?0FSMc%A=hdLF?S%PT>Mp{WuT~y%XVzugjbAD7sRrJ&M$^8PcxFjB>9|hd zxhUZy0GkoO3|WZi6M_G&XJW>&F~F~w05%@Tl{5oKb-t$ z1mPtbj?D)o8OLV=m=%^d38Vb^8`AAk_$#Kje@{k5l56d4&%P2^oEPWz!WZ|#m-oV- z?uFO%!Z-E8U+9JJ?1k^?g&*jJH}%3l>4ksV3qRQl|E?GQLofWdbiqT3xg|q-gmJxa zI>RR$^3MSNKKM@!JLz(#18)XCN5bdyqPGK&MKjX3ndl39`9BQ29R6-V@~`OS|70(` z1~>;cNR{H-415ysDH8r7@F#%hOZY3mF93H-_@9BxhRX9U@cY5P7T78MkAWWm4t0@; z9|Qg=aI=Je*(>}R-~mu`+$s70t(SjSFZ@T~b3xxB(W6uM7|M?Zcm{NyNK#Bc1o$1m zq4p8+e!y+O?GhdZTs9Ow2KYPhuZNw=6W_}}u@|1w3&+hbP!NfVc-*>DR#Nn!crT9q zL0l~3aAxB`uM;=VWS4+$p?EEgd@>lvgA<8#I@I?ptH`HIAC3EJ%0`>%>~IpjaKw9h zdNLEQ49W4`G_#Oy6e%oPNUL(BotG8kemAv{6+v*}O^)wYngZY5BfcwokVz=znWWB_ zu1X=LH*VX>@m-yhBi?Z1rw@nM!i71$YjWs>GRqOm@;^SaEJe+7ubZuOChAm1P3TR!-Wt9}+PeBkOdu66TIj_)>^o(q6-#QT4)z70rPow(+u zKsi#RzD6i5E2i}mR6iPy^{iEZ@AP;`cOOSE2J(l5Qy(Mu=@O)GDB(0V=uEyos~gJ1 z^)_8BbkCA|J;7m&y-jd9W51ve(ON(pc$akjV+h7Gb}K=+&mjoK^LrBhCBc!t^-oHN z6s5XR(8m+RL@Spdbo6Be5&mt0X2w1thz}ArCNLc)2J{^tn2dM;Bk&>b22|o(hY6er zeA@y9EQ6xFb?X_7)bF&%=)zlGp5=)4Ic-`^5MdcP2yih9riPGM{q!8nwQAed{SgjW)r!Ptuu z>?R0)` zj|4wKc?Kh&w<4c|kab zm2h~8rp7NWav)kV33!n8o^^y@qeIsa!=TAULv-XO8_FNW+4~-X_dthk*JFr=o+%QP zJudu8{^o%IWhnNiyPma`c=So990*V@FF_0qJ!T!~W}poz`Di>;4g(%EV^5vH%DzP( zo#Yo#jt>L3cu$(VzVcgZD`Uov9fyS#nBQJoIgB+!n4a@+!DwaD6^8J--B{hQnw$|s zxcL4j)CnQpZMiJwg}fN6!(noKV~erJ?(V}I`0bNh9A;?r6M3t+o2k9EH1}&K?V2(< z&$Rlqt;*b0&_23zQ)9Sj+K1J#J0Ul-d#_!K9dk94HN4e+94<+uRTc4i`_kRmbqI}H zirWZX**QD*@r$#5nnib%)03BL%O&dVxzT(cV2bEN>j&$x7x2A5s&P`{@J&zfmn_;U zuP~xgTPGtgia&R?TM8A5G;?2wJ0= zKh&;O-em8#g<0MgR5Q4k_mS%RI5G7u@o*0+D_ zGhoSibs4N<+j5FoK`|Sy#2h5XJe8MYrdW@*4&+O7yPTOgm-De;sN@pg75cTXF3zB= z4(?11>HG4>0&7uJ_jwt6>R#478#p}lS@m$kvlN!arFM*~2;Cm~9%w3kF07+td9k$< znz5ng6S)7OX0qCpY^B_2YA82U%5Iz4?w=Pka-=nDYvq!1h_`C}p?JRDj|?v`z-+A%{$PHt0bzCXcCnrF4un%bl3ReK`!)oB#E)Jp3us^tn38=7p@ ztQ*i8EX9*5#&e5bJi%ATvw`avqIm23VCA5A#L|_%{LuH7K7+7t{MO})3*{wLBYi9< z1fy9MQ!}~4N^42;mTT%*j4C>0;vQ>VP@+{+9mZF*C`Rg!Q=V^FPI+cA+%4KFO)cd- zB3)CZscHItl9EBssz~7YJvP?SSgu5#zb)tRe!pBf@h@5x-J)R{eo4{!e1v9gvbFJ? zKeuT%Q%i(dx@|YviQh=`E%Sxk4)2_!9DG);tE1iQ>hkY%=YzL8+}hfyJkeaubvIEP za9z1wxpXFtT13HBXXw_lj(jPGvu@31;zfO+!7G zI2*+ns?)wcik4p6Hz5QZ!HlN_bIb1p6HeB3IUB8MLNsf1_D#5OLi22CZf1ujq{FH1 z?57~UR(Be>cX7%`=J|2p*(CJ1xQ2Vt*2BwJQ#&fC&*6MvvaXtV;kNEyUMY1>;&q$n@h?M{ zo4~)0_XPe@gsv)r|9eD@MJuiulcTw30h**2>$ z>v$bEHCmhd@EH5rp3<|HE+;o3P0$WXvPwK|dCA3N9gs4#&h~k_ax+f{4DU$2I-rkt-a%%f}aXqE~WMLx09x6HZQ}t!_1i-fqKN)GFANE zyo>XzrDA+$tlKIS^!*|J>D?2XzQs7X8RI1C^c+4zvMVJ` z@*1W*q8toyPL$_JmVQ(NQJcp5;nbE-5hIAE_q}~;@m@VlO(mli_o!mp)PqOEM)M4xQH$}@ zywzuV5)#pC-SdZOwrHl~{qJ|Ps6}3rNC1dSub6+|dn|P%iG=nl)BK5YLGhD*FHQ0z zK>cAZo;&aq;~{^V_Z-C2ji?A;0=sO8ex-~65?8ro%MSrOmZt$y8 zN77J{U-xlTi*sEVH6FOEm_(UJ^(tH|`$@4SILY7vn16BM54ko3Rp#U0}p7raGU zf(dwt9@Q(FU!ya_m*PjWh=%BBypfHZzZ5tSova6PgHHUeNrXg4{*xt0@sjBV9gSnM zAsTvSNKkf{7q63M2{Cf33N#p5$^y||Dl~E@A^gzD*hlTWVUb}G>e*-i# zQ89!0Sjbe{C#OI+^AK(Vq(4I-=G0%8pFZEG17bV3jI*=#__hRM`rC)i zWIyE+WgFyoNU~79;AJvwoReXx4#__B_tVLOXDtaLRLhxI<@oZaz#fdq;Rb<*Qts|4H(`R^u}zY zqMfl*Ol63eN|awJFZfb9j#M^eMV=P4Lo+)9^sDDl&SnX*M#R!Y>BU_N5axy>z8PE# z{AL`;eWyJn;OR8gkxRL=BKljNPW$;Nv@=E)KhCS*i|L$u$2s>;xfM9Qe#yPmLG?+s z_+Z}6d27>d^30C-To~Cx56zw8Ja4s!C>LYq`G%WxFssVrmrjY|#zNCpd?^?48g`^X zQ>7pcgVu8}7jqQ@8}U)|W6&wG8068|hwnT`X?7#cQpD5Zo{1e()Rw+m9?|b`o1>Q8_6lq1}&BF1uCw_z7**vO)}30j_ZS%=^zA>#OdoNZS3J2q3T{d7Hg#4~P^CzG@V_Hz|hD{k?5I3PrN+pePBRxNf-1sx} zndHXeNYg_512xfsV*V@6_S8Fj>fiX%H|9{ii=$c7vu8K)kDfD3TV|n9H1kKEXZZM; z`ZH068xt%v9{y~jk%+kafwL-vIE#7o!;o#rV7W__X@huJ)Kt)$X^4~hg{4dz+Mc?-;#&_p?NsohXZuyuWPIJqTr1qh&J?R}F zZb~LVoLkBm?QNp?zx1QO;zx3X-#wn9M-QQhUC%w9ls3s6qw&z(hhQR}orsEX;vw0P z{4z~O013al7hcc{Uk3aX;(|ETGq>^yHhyy}aYkkCnE;9Y|KZ1auAU%?XEm>VF}yqr zxoVo?i(Q2%7_u6{jS?J8dB&uk+G=2b%qsvRAg3P#BzgWgK@{pR!VgBc z>owPs+s`8|*~oHnZ@GOW(wqV!sz+)sqPv#d9(A=kK%@ofzsc>tMrQ^s#V^a_L?_NI zC=wV-m;7&&AkmYV0lI6+9?&`E$N}ZF2>Q$8QJBZM z;Yjly()Uq0h<`~G_Ls+L-u5)yWFyB1Rw71|#qr-f^Oj^Dd);T=hWhHHXI)nMJ&?@D z8x+-sI>U3P1dIEqFs3Oo?^7YFeq%=S9Vs5%)e~sg80Rt6Jz~LKd@U)SK-_FNG&jz3 zGWWQkDvlE=-n;!D^X|fG3RiuX5N%dgzt$NRn%ecMo2yf`DOq2^Y*4f};e5cY&6AuI zK7A?O;g78fyq) zyrFi8rJwy!dx&CY#E$ku%3zCO!-uw2=U1@zK=T%I|6YSvldMotXr&gj%23u`~b zxTS1FlQ(_o$LgV%l--nO`={wnt|OEidWpNBs(!0orwmCznEJ5e-{V#w$V@@2QniU8 zBQkIU{SPM&b%t=aHz;aGq_Xz6f($|;s}nfG$Eoup-clPr zUDSfwV7L*}5SPkXfZj=wTIh7RHy^PQCqa7zx_SbJAPNC1tm7TjS~Cr1l)vgICmS#ILb@9 z?{%G8T~zwbt*g~klc}8>-6tbap8+qYAw46-l?fFGt<4yo8)6wrHLBVw)~L?Xj{2;m z`ZT`N6Fch&Wi@Hq6N3dVlDlm~sy4YMEu)PKxOiOGrqZFLsVK1_V4Z5?91GVLpfhYZ z+#VRHS{HkXbvI+RC}6`(OH;d2_g1@}yC);|h@tK{*14H-pykPopO35RG9q41OFA(> zQdNz6_L6aT;_KyUO5B$BW3!=dr$to**TlM9toj6np=IW0Z~_cW!x%S-n#&B^@SODK*V{y1=*t98azvqFpblZO1)^^DHB7X5klVCi4$jPGBw)wlc z7$d(YmFC_~o3_z+u8qzi_Pzbbc^$Zs@3nb$`=_mariJsb&D&;=v4`;=;rw6#?u7Kw zQki`BL(*I6=T3I!*(*1a1jBe8A1a;_!#Xi`_&i;H2s;RH|5&-g$>LeZ%5vIqrW$ct zFjmklil>FBZ57ym7S$+NP7C4Hmn;#^pDaIGR6N~XrwU-Pbju?B=34OZ;CR->L+{zQ zV>x>r*UU}i&ahi?6n_&&!KG{&dzk&6m9jWq8xvu5;6_8MHyR4kto)NHGBX4DodTUzV9$EmQ?T316uc-b8gGsH?K zT*KY>T7zRAM>{B(@4j(|b0<#P9>ViQD`)h%*-@YW^ctPGDZpvBGAdspm2ZocTMF5a zY2)s(vW})Ju~t&73tAO?Gu;P z>0{#f2=B z83o>+^3_vLZV=;JBgGdm%x;|=#U&26QoU?&4z_abEP8{L#ZU9bie*%TA{P`fpime` zpzd_2xfsV_>y`Srt$Wd~VIp-LZ?`Uy;!_S!Tsp)WsHWI%>%Qw66sqClkmeAish+gK z+SnR9Ef{*WaO*M)@&8uaJw0ihY7OA+&PKfBcr%@}m0Dha-smhr#0=wN>e_f~Q-+<3aXG8VT`u$bE2{RD1)*Mc2s zChwt6l@cS`s5Y;U0(xwvkBY^&H-FNu3R&S)B?MR}S<5UdtPfcY%>jI&$fNDZ?M^E* z7TO}L!a*)sPU(HIcL)dX=V|xmX<#a8oGPB|8?%__8Pr$Y?nAD~-Sb@H?Ijpd#MAif z^5y#r^9qZW6dL89*TabyV?lPAvncC|4C}k#%2?`JMtVI*QAtU*qs-_#cViR};oyFy z?CdP;HtG3I>ML|~)tyX*jQqFi|Ne{in2=m>#rS01E9c^TXFzE$lh644YyEHv|EeEO zGKQOk4AJ;xWs-4xMlH(9Bx}hy$+lPYh-zk(d}RMvSf=#2sYN+vonQQvUK3;&pYi4Q zupch_5WJQw9xoA4l-Js`Lh)ZQK81&jD@9F~j8Xi(W%)o+hNS8lhlgbMNms~4IqWXr zI2O~R$F%kGzaO{@&qsJDd_^yR>Tj|kxo)S7021ymD-iyAFaJZp$0CCyUsL>Ez)8U8 zVC*COcrW@^;OkLY)TZSBb1(leg#A1GDIEC^0sao!qo0JEfy;*SBhN^BesM`YDJPzp zOQbC;;?yM>zx`d3H+t;YHu=xLwJv4W?-!lC^sed?!5=$z?J#le^megb^(NaX7}&9&x`q|cTO zk`oOTH4sm#h~fKoVNu@Vke7mfbv?k&=iM*<$A|1CN*XefSEmuM(H zIZxyu+f!gCI(e>1dwGh9Kr%!}{*xt0@se?a?pkxr8So=|+5G8O%3%co%FvS((Ou76 z^P67zlhYz7mzC0{Gjv`!fHlPZJ5&w>9%>7@?qFp@G1yF#BLOa3(I3S9U-D%0x6Tly z{9pX0);wY!zr79sF!TmB~h?b}T99#u{)d zS!TC8nOi@0XUMv0en(nJZDvQPD#i0MZk?JXsBWR%0`cYe@vUZc^?vAB)wTWCC1ECF zD95cOW2*6+A?w`Zs`^yjw1b)M7F0#t#AHhvawIhCH?x=-u-(3!-$}pzGh47s&xuMG zEcug#p++ugZQ4JN_o?My`mmEJ1FFS+4~%PHt{hMa%86quo4Tfz>ucSR{Vv~>*}>_k zeEq8R?JJe^+ay8Ned^{%239NipbcEDp670!Bd8*EmlRzF{EAS}I>m-*gLPGG1nU@7 z4*&Kb^_#r1a$O{TohWVI7m8ZlCDr$s18Qp1+_?KZu=a&;b*=BWw06SfWw$+QeOjLr zx(z`!^CPeU$2p&ENDDZsZ9$2K%x6!gDNk@o^CQ-$T|7>EwUKV8a_vCN?hAX1Sl4nl zzn#|TS^MJwsv2nTl^H_QM7ou`+|9ofcS-*Q%z5MSi{VbH@7f*hK(T8$q%9>C1Y{gna)6n1}eVw5jx29>U z+?d_%x!`_OUpofBL}neTO43&$oh}{L29{$-jN;kMws%6bo0aWvb4np8HQus3?aty% z>tf3fM-`h5wc%|F+*@X-4e+kQUYuFlzHM4)rw=gxPr(-5C4D!!aueqYmXX>vm1Pq46Qac0gzCn+h)<3^kdfJzuKb~SE8|}oV7W_Jk-sUj|1)nN<6q$>CRs3N zP>*{iO;|DU(e8#<{(O!zaqC}BU42f2-!6)>j?-Palj-r~jwuI;k{zq(YlI_=RP-g~8gU7uRIEs%o-hh`+q_@s2t811Pf zL;bvhkDdMmA3NpAhKDURe81iHV?(Mnb#q)heoC^sQ zYdEyo_q#EHxWh)FddTv!?QgA`+XQBuTpP8K#r_WbTgmI!t75{R)2z+xu3W6CtIyT0k93|Avg%I>`IW)d5p}w16Lekl z%K@d{(}K{Te>tEMYhitVvIJGDs)ITo#+f@+{d|;0UpbyvJd+9=!%3rM|60yh?lyEP zLvLtKL@u}46h+N`pRhO#n0Ck58N!&MHA8LHO4bL^#m^y2%2VN)Y}n02CgdT+yB6Z1N8$ z2>(ie+3=r0INX;?kYoz-_X5m>Kdlv$zf*#71mWKx;qVguS4nURLHKt7Q2O-krtotl zNb>t!;Aa3SeUgdDzf6K-2qOG@0F*w&LeW1<6L9Ac8_zg&W81mXWJ0Hu$A z(f?ivMi7MmIshtvy5zo0f;SU{|1kh6zqqvn>E}xR@sj^u377eEwS-TT{JQ}ueNn7N zc$%M5IR*eU0g|EeCzA#E0}>oZ5b1veK;_3YK=jX%;4p&l-zniTe?KPSyyX8kKuRB^ zV))-lkj6)H+z3GBcS!EPm*A}g;r}H7m7nGSl)pj=jwT5IHzZt~*Ta8}gx@Lo{|xBg z|7S}6)SsyRD**lb|6<8Mks#uK8-VgJ*RM_TkCyzmO1L;wA--}6pCtKz14!ZJ`ngB) zA1L`(0s8m<2PJ>fAyE290Q~#EOY$Ef`R|c%kc##5gaoG&gku)~rLU6Q=Sr|Yxg);{ zWZb|1lYWBgS)4~8{0Bh&`+v6NPjfAbe}{z2{IycTGbH~uKuRA`im&@5h@%o>_*ww} z{{M*Ne~aY*1>pZ_@5|$(s_yphoh6x>EQC#g1Q-$sfnb~@fGjS_WHNvt1PB-wOC}*O z10f&@h@f=>qG74Bxj?G2xV2gh0e5SnSZnLj#I1b=ZB$BZ(#1&{xW<+kb<{p0<@ljnZ#_uR8@Gjq(T)>;2PDgnk_v_I41%H;emvKg0IK z@;?SPw*OM$PHhi({tf8H_OI8|1iFL$QQ=G#B z8-#r#8TOAr#`eEl*wy|T_Gg8z_fOk|K9vmnX%NHL%ST-&hjg<)tyK%<{PuqnpTqqt z$awx;kg@$Q<$c(PlVN{K=z99@6#67#{~MU$!>Rh*BEjl-i<=KZH@5%Vg#8*a?4N>+ z?SG}PUoPyg2wm@=?iTtCVLuBtw*MSqj{$dQ{C^eh7=OL}=Zoi^WW?`)&`Hdfpx_KL z?4N=7yx#uvcpvWikzwBnGPeJ9ybt?0GVJvrWBd2>KI}*rRXUn}fwV1}=^ z|GC0`3Ak1*l=IvFT45hcM*Q9Z8QcF7VNVqHUkF{V-**VzE9`#-GkkcZrvFER2a$2} z0g$o%|5(_s7WPlT#`a$#>?y+jOQA;#zDw|QVgDD{*#2hl4op zAtU~Wgf0s%7o16k{Rg43S#(r`JVQ&UAe7*hOAnXH$ zy%KC}|F;VJRl&)gS#{S{~GR$?Y~ew zpFl?X9}~Ln|0bbl340@$;p4xW2@3?rlJWd~AY=RAAnX%`{r6yF`(G~X$-@4e&?5wI z6FgPe&wv@eUOv|g`=#Iuwf~!h{R%ST_dAfW{Vx^v;llp3(Dn4)DfCIg{&z6LhgWL) zyN>@4;kL2;cOC!#2)nWUuN3}VPKKv7Lhm8?ZoxCiuy=rX4i?+z^<-Sk2DAMyppJ>a zOfddS^Qfbt%mK6g-atJ=d!FT+M;#q~E_ev^h18vhADHQzPaPF~F1Q?eE%kiuc|4|u zUoOID`&YxqM1bKl|J3l&Q80WTbT#~Z?RmCeHGD*b;ip1Z!*^-nv;M2$V<2SsuR_tz$RP{TYRbcu{zxceKex{x2W_p=cmctN$`I!m$fO6nf zfOUoC#WI)S3G0T8@?jav$Y<6a8RaKC0hEKB0pv^H5_r)W7d<|Dob-6X zB)Y9=#j3KK&mCF9+s>N;Wqv&+$e#aOKcdz`H7C?R7g{ULI(1I8ePpb^U!ubD%x=zG z8(4W&(e{QI0&h%kvrVuSX{JmBaru3X}eF@`pPOMUfQ2058>q{nqd9CZ5 zcPhX-fOgKeR>50cKi@yIv=DYxV(8v16;Z)86jfJk;t$u7pZ|Pk#8nsFS-(!ezJ_Ip9Fsi+vQ;OeTbbu0;`MH{cDz# zEh<x^TN@$SSxv2@{uA4X?O*Z5X1M%S{W*jH90P9;&#D>?s`=p4H^RAbP2 zuTX!nEzY595?%eN3cWeuE z$NheE$Mq3rOy0Q{lWQ~@$QZa!l2M@C!^d-X|3b!xT-I&u1eW>;M%20`9QRR-sBxN% z2KCbwTqD}5aE`#SDMQsHsTLpX?#DI9Cq7Si9K(hQ9Z^wb8vWt`EJXK@^9;K0bjOK^ zLFgyN1@M~VDPcl%L-qRX4Qd14zRvUQ_69jCQI1rC$_gfu2_C&%#~jL(p}1WJB_#BxL-4++cr} z05Baf0L#MY-<#-wPvf30x__wMYsvz}`qGSx?juZ18$H^o%Eixj9jZm3b00tiN)*3? zPTJwkT5k1*FUL8rfrs4n_$_ftprYp3vJ{UENu{ z{OM(f-06Yjx|6YdXH1+oJ`O&|(`Wb_FX7!Y^z}n!-2T|u)q!+hyl1tK?_jsqY2nm~ zaK8~GTGq(=h19G*8sNx9RwV7z(EHbbihFe9CW}z2OMhSA`FZ6;CZ9&k^VqTV?4{Z{%=pl$f>a*&m} zsaqY#9q9C4hacqb3aWt`H$4^XXBkgj*sdvE``JE-rrzF}HoCh|KN|xh)1`~KEZ|p8gP6_m6Ds7h|B* z;T}IH5ln9k(6wJ|fV*_u*G2blg>QKgKRoCiHg|T$CoOjoxKkC`YNYKkGezQf2yAc*L2DIpEgG0O-$-85A}Sah^a~O5tHR1 ze0rTHR()P`E!A+Yx*jMKnZr6s84Bq6Gr?KtD?!KL4B+h)0US5E9_K`^DY&f6S5RD3 zs-1S_z<9yuoEtW57`A5Aur;^d%0ImIL+tN<(C0+%(Q*xcwX-@#b?Vw#9eNq@+mJZe zJO=xa&TC$D?H|AY*&XaZ*?y`3_OG1#>%z8orLKUfXLr%B?V``@qR;K37kAN(LlFJ% ztfa<8=;{ZJbDuF>osRIK!SF_tMN?)hQeO>%Kc)IRP>R+C%KptqiPEygE7z3a%^^60 zaW#VG=TELXnoP$0J74G(vD4 zPy77Eb3V$Tf8TRHSWdcVUDCJ57Yhu2IAR~lvZXsj^IP-ylelLTx}|g-U;dpt7u@n0 zeSS`NlL1{AF722qsZ942u5G{2IK*f5IMCfZqhhe-;o3M3(Oq}Op}XLY`J#*NJ=r)8 zDY&r%;8cKhlIb9K9fv9q3HG(R=>BmGD%A%e^rM~QP&%$%JY%o(@7S@JnWwtOii7tq zK0hBfTn(*r9EwIPxlS>&WpcKuZA|H;d9x&`d6VTu_XmolcFGBl7WmIMNj``@fIGcGZ%mp!WV6TM6g#wHuO(GZ%Z}qIYnJ99VwN{iPJhX5 zQslox)Q!ct@={V$y_`Nd_>x-=S!AvuZ>>ihvT!Cv@QXZ4+cQ7nipl7ZC7QDV=sA{s zKJTywd89ccoBvQFr@?R6n|Q}K*Lr_kbC0yg`=r;>92s#;$$g9YmZ(^RX8$%NX1_eq zoS%9)%JV6nSW&Sc_FXVnQOn7{|3uz9qp8ql*>!Ec8|mQwWK+lUA=!4OJ{Y^g^5uC!Io^*qaUh%x@)dlyt(JyoPsk6T+%gODET?B(jga56oKAB+ z;kPtzv{`q^69)TV@-Fh5?|aA}8z{(;?~{g)^auQJDmiaC71M32@cwDZ_I16fd3z*F z|4GFZbmmpH^|&qA@=Q=_`EV4{o`d|KZ*f`R#u2h0H=dane($H=Ft2IPLagqe(R6!+ z31^7-D@;gfMuqI!d2S6OWr7ur_CeKc|ddAdh*Be;;_n{fC;O*feEm z#z!^ghooWGE5mSpp0p~-WBEo}g&dV$!RJnUT`SL8lU`CxtFD5@YQ>3gIY+aP)rUW5 z`swp(j54;8&p)D!j*NUu<1u%ZI}q&3A@lFG3W~T)DE`{q=F=LfD#$2i*3$G@Jx?Lo92A z?Hj9vQkP1DuV9yRV|{`*?y!6%V)j?;zJ4&*Yu#&U8?)H{xRj8pm@e<_IpD6W=4$iG zYLwD7|G>#DQu3hVs4EuJ*s#&56+b)N3p*f8&6y_TVPtk(yfSnl-(Mk*&uTK6XEfzV ze7dcEfh|!nU1=HnsQYAn7*>+=E##5)z15Y@bG&OCQM&Wciq*Dj+2uaP`Ed+8X9)U- zOtj3%X%#b0ca);XiE9CS?20YWgxow60 zA@>J(@3a-~QhxM>((FO#^=?P`mn}>8Jf@UQ*mzjFY`+&Z&m3X!D{QzWwU5`A{c%0t zEknCGdh77s-qyyl!~3%b*T9dkXYsV0{wV%dDMxX&AAf(}=t%ysrb>Ap_g=<5IsJp0 z{m}M9`wjLyv!B~sbyzX&;QP}1)>wv{hleL_O_WBiJubC9Ge=I_im*Da9_8&bCT2AE zgh=r?lSv5+&WwAr*=|14zNvMA-L(5IrYXVv6@L4|E|t%MFSvh%bZrTjcP2M5ZAZ~N z*Wqn1bvRKp3_C;IO%W#S`H0w69UrV!`cy?K(N1>&t{Tey$kzzoo6$5VMOI7=BmKQS zui?E4F%vJzObjOH%a!O~cK4}!PFXu)r2kkbCal_R#@>P7o$@V}!hjm(c9*S(89 zJC~OuCFT_W5oPUwS3@!3uedW>W6O^yW$O{&+N=Q5)DYetcG}w%8HOG>^4aP{rl~es zG3O^%WCdn4U6OK#pBCN?Q_Ky?YOMQvuE>lT|59~Aa72EU^6auV;P>5bl->GZ%Y8xS zR(QJ{Vva>*A+O|0xXkn+r(8o+UwfvMcls*pzRH6W z?@oVu*7Uet)%3^f+mP!G45`@UzbS5#&+gbeM~#ylJ<*XFk324Fba+=bI!4StQKh`N zEZL8^$=i_bUj$K?2AC$Wq$V-twQ{?;HLD44)j->&&q!lKq!R8LuEz1wlsh})7_P=~ zkOw6e9&`2h%&3%YYAiEacLlp2!zdBMK8@8GhvRyqq(|gOH%5DyR}oo^K}!C{#wz8N z&RCaxg1SH8zmGBFJIFI0xvIt2j$Cz^uKEvh)h^=v;wjXc38|jp6-P2As&O5WFC(WD zDn|JKbqYDVevoHKMHKuunZnh4mC?&FMc14udAd3yB+`5DDO?ZK(!K-Fy{taRC-fY6 zQnc;Nmir60R2|DR?>dQ-HZ8j{TaFgAzHmogW=mBeTK&*t^U<;_N8Pn8^U4n^k_Yys zY4}@J^x8~Idss{FtgP8|m)Y`U;cGc|wQsy5Pii|lt9}~#hwJxvBSSHfw|K(#ygQA4 zzT(~Oy~Pukc5Hsk72$iLLw%yHyCOpUBBWvR&d*HS*XWE6a(K%Y_n=$7GY1FYg%ihPX-I^!w?WI_2u|ujC zdNSMd7|-7f#n=yL2U|LVsY<*PZEgqpA2km4kQ}DPLRRdqtiaV3YHPEje(xCTcsG|b zCiXq|d))0|t&bx$gWESLk6{Lg7&*f#XDg#zl}Ez%(#^eYju0o5vf8(st=3@6>7W-W zHMOW|ZnBxeLbClA)q~qNs?RfoNc6DYzyyQ|n+)H`|Ry<2On%^&nlzTqB4N_{|@-hXWcax8KWQu!!SnczYyYZ3Aev)T{a zY<&06;PwjDFSpN*eNXPdbLiRBo>)!qjHb9z=!t7Z_>q@*vf3kCW3FcYF#p5%jr6>y ze3>I%cFjM=KmDGP|LU*Q(tW$xV!7#Krjm8Z8yJxFaCIqqpb5b&lx>*v+hxm=WckKi zo#HV)5SMw6`;Z8u1E=`Pds!E?8e4Pvv8PaD%TVh|JOR|(V)VgnOX8BVHv7Fk&JChn z$#b#;F7WOCk~ps~)=@YoM~QR|U=L&-oEb9#ZdPUBgx;T=lJ}zgci5W4O!oG$uctJb z?StF5bms1*ji{l{>WoBBZ?sx1&99#_@4dvs{M?<9)nr3E)$XrrJerZ>iObUCU3Kc7 zi~*kPCY#k*UWsU*+wpmh=edmnbU``_kL9_J+LC*nkdnhcLFx*!0_F2J`WMD|eD%4| zeQd*0Le?zT%bRjmO=7Ea2VS3F?w=Ev?c1JvY`!~Cj<%8u_uFz$AsqVoTHaSjV@CF@ z3m+LpKYi{%_WaxZbCD~L!d_HQ;cv*ZbjemapPw0_Lmows)`rNq%fdl@WxP0XK z^us^zUkEJ^T3?(nc#r$d+|%{SFA-Xaxn25aexR~?H0C>+Khv;Nb653H=#Jd{z`6Uq z9FE-2=b^64Q4=CEKc5K~uBRGV_6p9V*_0QRd?QOT-!yE(w+IK^l;9Q`AIza(26^tq`fNM!9RgALIKUXKeAlx^i=s z#k<2RjTq?7Xnm*Le47bpXwBMaX-oAvy=Tw-qr(!~9&TytS7saC!F3M;(7u9_};Cd$UJwY3_;BD6itD za?B+saHhPoT%KSW*;>ELYfr$Zskx}fJ|Dh0u}EotN2)0l9sQu^H@4`ILw#G-aoaZh zHW}f)-;MKsoU)U1RGj_eeEf(TZ{SK+Lq6MKL7Q}X6V!I2w(tfri zSA}Rv2t8kKMF}~w^I>JXB|X0|=MZ{!ynnG=ns7BM%E3@}iP5TDRf4%5TN@ z5u+7b%t3#2yYzK_U`mrL4{pEfEKaVnZ>fGAW7<$yd!og_6;9;B31N2L#j9#_Kg+|s zS~?Jlik#jqo%JZ@T0RN)4anb#FNY#}n06y?F_$-09%>8Tn9=GkFAT`oy?xL>ttmR1 zwSn_%J_SE(hhlb$_!XNlo0LSE7S7bK1U{Jw7wbqdB|+fhrjT( z*xqhFi*crPI`WDqe8CUKJFo@)L8Qp5NG-2yumzb{xr$w?MO%&>7m?|~btT=pc203% z6h{qO_;c2@w!hqX%Iok%hWbQCBZWIL^V*4-iJV#xn3DYnzW=DO@l)3G%G#~?<>;%d zCJE!$Q<%{pl&UAt3%r7H_>doQvKIMfH1&!fkb6R#@0bpSqRf-qO$uBG-^RU5>tK=K z-W8Q3h0NC9o^Y&_Q>SF(I~G&5vUa4Y9q*>Z=WhBA_c@LArhVg4Q|F*hsZ~C~Y(w7X z^kzbPL2=_ZdiFI3+kbk>>DAtlvF0RV8okRK-8|jA;?(ScmbBe&^!RhJyFNiq5G^2q zr~Kdg6!Na%Kwi{{S?t-DJ`vZjKn|Isw`F+nDbk$v#q23loNDfzUM;uvzp>*?NxT0P z%EQ)gAl#R*Ty5w{Q4=K2quJxmYD7Iizf_gaGJ=Z|YdXK{V@5sG)kekFf-meAq}Zkwo8^Y%&9#% z&9<%Org$&DYgHc4x1_!3cB%KIwMUfg@s{)>?w-&OH}B}N2d5ZH2?;lC`IA)hAimoe zhcBiF;fv+3Fjn4=5%s4_GFx^m&YG8_gf)cCTNF2FT8h#;<`&PSnJu}2Bj_uZ#7^Bj zPafYf!iu`GdFB^+l?(a3?h$3jP?VeL5V-f$FY>n5n49Z+E?9_Kn5x->BjhxW>zOTk z3OQ;Y%M0eo6Ke-(@45Txm-sFi^=G?FPCtmh&6vlm)+b5bV174l1ix=Lf>SOd__dA^ z{N>9CsH)IU`om}Go^HYbuI1ow9{df2>uj*xO8pMM54az|-`Si%65s;H0U1CJkPoZ^ zg1~;D7H9x2Bzl_kwCHKjB#`{fgn%|@ZsQp;XzE#UXm@`9_Fw{SR&0)_>#B>JhLJ^E5f!SOe^x;iZiA7 zo&o-TX+?Qh@mr!5>ERkoE7Hw#d3pA(6=y405fv-eYFLqOE7ovZ)qj2QHwqXCa2-f* zAOeU5!huVHNQAf@mGX;8|cTa2kjP?gFL*?*b{nQ$PvuH((I(An+sLQ{Zag z72wCfSwIHLflT04Uk1jYk)OoGms7Z3K#}F0u%v%0{Q~?0CRv3fib`{z#5Jb}E!(Bt;N9Ta;Mw5!!S939!Rg>5;3MEt za4EPI+zO5WM}W71w}GdEr-I)CzXeVPCxf2=KLK72UJh;sH-lrrvEWK@C3pdN0r)uh zICvs>BKRfnOW+OQ4d8FU-+;rx;b5HVA>9d{1fB%`HTc)y;o#xm$H0$)mx7mq8^Mj> zOTm|d?*rclz8-u%`1j!7gRcNz0e%kr9QY>iP2e-&GvFTJ9^kvdcY|kuXMleP{vG&o z@a5pA!B2x%f>(n74*olMFnBQdA@D=sMc_r?KZ5@Vz6N{^xCUGUz72dExC7h)X0M(B zIDvd12FL+iz$(B7Oa_twKhO`z1I7XC01My&h60O$K0q!o8Yly}2742b1snqsfI~nb z@CAU)BxZ{>EZk_Qw}B%+HjzrIVDm)|AK=kFsdqwgaaWqbDO)w?%~kwvE$ zmtIU=i>GUGTqOGke0TQ8#>Rb58TdVg(}?dQoFj35#QD!+DiD0mQs=jvRs03lU#fR; z56pX%lWh8s-Twj|Ms)~$W7jtS(U{#UT^+Q(ZZ$PK}%fatJ=Y9$5Tu1sdJakm( z^pEeR)I{@dp+TPv!wt}}VnuzPd>DG3(E0pPPTW<|o`2q;)BXpn$I?WzpET&Sufw`5 z-L7AeIme{^oLDg)Yr=I}oTDxU^IF%rR*m&@9Y8yle@pquP+i{w{SVMtPifx;W}VjU z4?$uxVG?W=r2Hj zUFb8Q--dNj_H!jBU)i{fKm85P-Qg{Dw zUs5U7wrWagQ3-Y!aT6rB9pv0$*v- zBJG`al6HUbx%=uKrh?){+KZd9sJ<*vxM;B&icpGGMSHM7^HH}fT3l3Gi1mirL+5Gm zQZ*X4H~mMuphS!p@zrD!-j`fjCN9fXFXB3130Z+1Rx4Ly+m(7?t$G8Cf0vf1S86^O zEM>mp;+yduJ?g3hm5TjB{}Ct%l+A#VTDzt`4eiy8HkKne7d!w92=mCJwDxOuVvQu$ zRXS3%_Dc6BP_E<#!EC4W?-nqh50ddb#e{1FuQKa8^?risgnD=7LTmPKH$2a9C|%d= z??^q%8~mb9w-h8vZE+WK=Yl&vgC?X3{d4h)0U>()xGtCO zbpO6|p1)RCcQ+1h>_7%Ui5af-5ljc0F5NL5(*XL%@F_!wTzHM<9N6eimzi*96x~*Y zn~2*g-9~p~bOo%tL$&Bk1I>59-5Op9(cO{tJfZ2IaOXq-sAg)P$8@0UP}8dC2~;T# z1yrhg0$smcqwYsu-MLEhqH8qM$8~!T71xDAI@f55y#kp#s^X?qc;l{9uv>Wf9a*guKyT-*^c8v2{clX$1zt^Ge5^x>vu`d~Gp!(Ox@OS=l%Mk57wsMli zYpc_)kGlKRIK4b;^UKDt%5h%2JIuv(QJ;x3EtjZKk?8=A5E)dZHT8SsH}V1}a$!=>A61k*jG7PyQTLgHTllcczqL#^_t&#B>#oAWH(pMNVu< zS&0Uq+cXXS@vSPt7APrQvt&u2Fo2z&czMf;m8);YWO&IE91tR0=;v-=!ilY2PM#Tp z7rm%~`~b&*3w(C|!Hf%>L!A@tv$S3x*aGzLDl|9YY8~esOB2n#Q&-`h{;{rTqPHMT z<2Z8eS>F5hIC8%I{LZjDpY{5{SB6S|ILCNUxfO-qI9XGzxD&) zv*61XsOl?4^!G9|ZX73^;QmN3+u(q{SlnI;DJOB9z5U=F#HAl1L8rW-tc6_M4V~6W!Z~PGc(UKGw)PL@2^PXr)-*q z7V=XuCVGb9`N7XW2a#y=PV3}=I9m_`ZE1?M6hfl!op0}Uef`d>nlB$_vD%7%{CZ*{ z9}%|Rf7?r7Y`bo9b0Rfe-OOg}b2zvDG8I9Oy(IvE{ofn1K5T6OhyVhvLlF9HtNnQ0?FzID-*7^A@TP z(V(rO0r3?Fk2?4b2cL5Adk&s)aC;AEy~-n%QqaqxcMhcZSdh#RnG0kBl_HSkC0)z% zc{!C{0Qq`CUNU(K&=@fPP}jH$YF^_YkH-_E;kcZL#qLI@<>~NfJSv01=W-?|r|LQ` zeG%2$2rxk&8}*>f*T^>ktdnmp^;5vBeSuu?0K7!sb_!qz zYDvzcQvJW`0$4+1hEPdpzKJ3#8CsX}SIeI2Nd_?JFTtXv8d4fd-jZ26!JtL&BgVZg z+3SWaVynYeR?a}_b(|ngpe)vWpr%kZH(s+?8F8rbQp|A4nIbg6OP5^-O~cEU z*HXzsO|5JTQOmT1vfAz|-B+n7TPdd9Wgzr*YUTT%mltLsJ5xI-ijALi9H4;JV=bgbuWM0^$8!yN=|HVs^ zV!V%ATSd}h7j>rSO?Hv^%{^ypd5mAs)n|H4$P_jTenFq53My6l_P>gRY!moQCM(bI zmPj0Yzz@q@xlHzPD=RYJYfeoTlL$%cY-O^q_aC=1L7riQ4BOKR8*J~1djDA$-+ScN zf-a)g1$kXT7o&vk;CFb0G40GaF3517H8WWl+w^8L8N(yOr<=EuEy6PbAJA$}iq3av z+)_lDpYyI0^$koe=gvGBW&Z*_?yQ@a@IDw;nwa!YKWDZVbe1alO*go$@WUwdU10l; z1{vjrRt4ftEm8*usp0Fqv##BCO;D@Be9T9pYaWx!B({pqfKi~9WD2i|u0Y>~vzN}m zf7IuChBpLR9n-se7LCBy!=&}dY!Myv^jYtSq`gJV&qXBK<*-tG{Q1IZ znE4(4e3t2emk+E^$~G`LqrAt3VlVf|l6Yyl;w*cZ?#td{G|ati0ID z2G(oo>OUj0exs|gchGWw_Ypto{&+lmcOd?Ac@vK|>L8D39GRnd_zOWUuv_Mfd_h6y z{Teo)k$LM_cxtX=Oe?J~H7gOtVZtt}*Pn8R-6;#06)%Vr=P{G^)4x0ST0d(pPskFJ z&7U-LkCQPsi(?${XHlA+|B)<0M9GOD8KgSZV?T}O<08B0TGYs7ZzH1)=bda-JjOnH z6fH_laoyW*<$`@Ve88qC=$xtJ13K*sVwQ%anY$kJe}88hX{ zAgeqgPOhi@_lgrWsvt}Dijy_4PeX!zCVvxb)U>tjIi$l1!rOTmQ?^=g2-q3pcMDHp zzc3F|`w~uRyFX4<2Odz|Eb>v>VBa;h){AEl1^ME-omSPUEYaw{C4pvy@<$oLs*`H} zi6EovXiX9f2bpVN+22ohFpoI}*>=8nQkm*Wl9Va3SH;?QS?ik$I&EBi6ISWEA6of( zl0Nbba)oCn%O_^mJ#{eVX_CYSEG%NE%`+s5$@57U!!lECoh(<-=^(UsZ|gi|ipXBW zPu^$!rd3`ay(7W9!>VnKZKUT!k+7r#t2+m~SlYY%ChNJr3zz!zeE&&_^TC3hsm-q| zINw)|6HiOVBR@=on+v+=zT|X@)U~N(Tp9)p)L5aX zqvl{k-l%4bA%7mdne2V|+bAB!Qv?2f+M!PWxVce0in5nb#$h8MABgPZwOE>)4THie8^a)$ICDPpqLVy?bvREm65KD?b-ObeF zeAyg#>IHF0&N%PMpkCf&?^{KysfP=Y2Du!xYV^NRw39yT2Wz2m24cE@xWyp6_Sl3?N~8|e%e$^RK_~VN^{R9|9@^_RM^6} zjwbU#Lo8N$tXtQiv(s2$N&E=ruL4sPeoMw?NuSFYWCXy zBC4ve&Bx9mYjQH}sdb0Uxst78-3%g~R5#Z9uXBj(JtOU->!L6|%POR}GC1X^N7r4b ze6GnH4Ey`=IXsW(_k9EUy(IOcJt7f!CcL*T-P=mnG@f*Eo4&c>9y`Cu(tWt3=f%}7 zOLt=_c75{6x!76!VQWkGoZ5pTv7>%L7XCJtzdDN#$-851w%N3urTdxER~;&8kF0i) z-ou5h`8XeL-Xds&dhLC7`Ih(d>6j;k&BA?lL)OW;`l}UNbip{CY?CH9Ohd*n8^0Dz z?Gu`q9c*9~>#TbXJG#lr?C^Kbs?EY1j^>ipCqtfQ+io({H{~KnwK!1)Uv6EM!RlGz zO;B$x!ac=}T;x*hBd{I^&`Cr+hasoi?*AI!AYh(iud`OLA~l=p1-@#pD899vFA46{E=)>1sQq26^y7d z*?iOLq}`@Mes7qpe&0!NO!Vy8X19jqJx{`$QK6OMe%t_Ikx^bhTO4nyKP2By+dOQg zZ-_Rrrsds$Oy=)C?-$@H+b#Lrsbu9rM)jwrQK1!5e>#H}C#>Mh!JMd5qQoDgUQ4|< zV!h=0oJp2=`>4>W%kwR|k-3K7-Z%a|7q@+Fvn=q@;PhLziX?L44DP+n zkZxP$6+HBApfjZx<@rqD`@NM0!IPjaEpmujQ#?I^xKS2;4%#d-i(2C!&oSGv{u`75 zIjaiEFV5)XRHH&`E=PB02Qt*yWKOZiV%PTj{MtEg`w%;g=Vr65Q;B`rU%ss4usOqS zutn@{Jh#;xZ_n#g$_B1i3ijuEj*!W~cpxJ1qx7W9bXb`l(?-%2pToNno3D263h#V_ z-P7uX?xA~_B-sj0FRgSenof6})%V)mT5pjd&$Hfna<0`^i@oAR`*qH9n1_z}s;ld; zeq8h^#keRsrpM~bn|r_aCPZbg(?0iASF&1}V=sKw(e;uvVu{7KdM-&`%{YGIdMmvpiLE$?5SJ&)E!|HdHrq;UvzRdr;(BM2+vZs5 zzhu!EVM8^+dfOT*!GQDmTiq$1$c*l|EC-tWw`T{Ej>9Y4F}+DEE*tZ@_{*=rtW4C8)EV zrLMh&s@zfs{q5IwiALmWyg3egN?n?)58{>MQre=@r?#<)u%mp3nag(1Q>B+Wteu1{ znVtV%&u~DRL6P{igU0G`i6VQC;}v+^Sk4+f^R{99Jq~jxgRvi@rSLrQvgfh3d$3mh zo|j0T-z@oX2tL4bHY!(@o)=JJTJAjux3~>92C!C3EOad1Eb;!;b4|-6W`z z@N4QOP-dOq7- z>ez#m-P|>~w*QX2-AcM{s6`A*+g(v<=ALzUZuH9VJz}D$)bIA{Lgb>`H=~nbMui@{ zMDT7~)ASnNY00RK#*RTNvfIm`oR$)`!}*m9_iC~$7^R&VBA4tU*Ft-ueLLct`%+Ld zh~13X;x5nD@9Fj5W$v-omim~G_NU$6{7#*YW&^!n(_R>}B^j}TeHAQjoNJm&F(YZ; zP4A)7jP!Q}t#RUAfZWh&axEcU&<<@))96A?I*N9mtP)Pn{MuT)BkjkQ@JrNMy*hVxJ!7?^vp!85GNhRpmzJ#;5^WVW2Nnn zl@fJ+8Y`!$A}!d<+9?`~9nbZ&t!d*7HQwULp!rYJOzZvru5*Igt_{X%b?|T_ZeAO4 zGhs4Id^7U);`>LPlK#p%DlS>843REdC&BycS=?waOXC5Y0w?eu-s6Q$vT{#BXG~(e zv#tNW!|n-2ao2}f5v~32qHO3X)DW~cMWvA-Cwse1y^P76k%w3C;@>n8zc-nr@D4~K>C1ok{j-Q&$u3va*g|@;FF0UmpT`6_-8!=!zalx? z+1WE@7^Uc(uVQ+K-_>`aGUPpn^-vBQf%cVjU6nXVkqLy}qv?rT*nvF2xzy;UYlIe+ zvTXXTk7mk{4rE}E)>%4rw9cyy$~e2Ilxk0(LydRr2xNOZ;-amE6E^SJSxr(IS#n5RpU7t)vPMHc7}zjq zOEZ&1l9HCL`5S3|4Bs}Uu!M}n2jDKeE4Sf|`si(z?hR$OISx_YE}v6u7@40T#_I30 zPoLH8^c})kaa+QTtL89M`^L(UE30Omb=A+O-*pd(8>hCJjb~kJo4G)1^t}1V z!p#19|5zrAzSk|?TT1C$`=rb7VscyJ8$)yYV-GdrVd2lJp-i z{f0ddaElBCy>bl%{j4((GUx*VRT4TT9f$U%?P(i1pa7JB8qfkdKo7(L!vF(d1kwN# zFa}?*ik2XMhUed%yrZ3d{%EfNOx4fct=-02WvQSb+=fF_^{=myllTHprYZD1VmG;ll63B&_CfVseFAO|=G+yjIFIj|ZKfH!~?U>|TB za1Iy(JPh0fd;&}co(Gly=K&q?ATSenAIJcn1uB7m03(6NfLnntfN8)9;19qhfB|X& z3-Ags8rTJRfUkgPU?VUKXazEXgTP%t5KsYYfEmDBz*yiZzz2K>3_(!k;tN=d%egHfjJRSUJ@Snk{;8gH_@P6gekU%-C>Uj@Dj{2cf>@IvrH@IS%- z1djrb0zVFZ99#@827d|u5_}!_I&d?%8N3|49NY))1JhI83>X17pa&d)30MRuf$M=Z zzzYlmT)-4y8NdT}AQ>nF;s7Tw5vTz;jIa{00VjbZU=L6VoCOHOa=c8gP%2d_wOXUm zLZTo#$RLP5EYV?!2}^8P;;xXvSICenWat$#>{n#?uSoo_NWw3RLGquM$>b0PL>U%U zSkzaD<_e+l`X!;U{3W4r{w+e+=(h;ove7Xyv9WX+>C#1(E3!;iF3*+A@hjnv|K;!} zBp809jQEX$4fvZRa`mA1pE9aI=s$I!_gi|a_#XVNREjb%Eu-=c-TIJNfc7QRZMGa^ zT2aa3%9_Pj<@+i+Ksw%I@s3~7oLo&)d zH6D^tQe90lsuuPuw30q$(1(hJrJf3sQM&NXJIgE4zH(trdB*gaMH8xPJf(M#3`^nf zGCVakRlbtNHRaXRv40nY*)nn zlK%1L574hi`7O}#FIJ@fln+98g>~BhFuk}-(%=8+0G-x2pMqkKUhW-cv)BF55s?!Y$AE`bGx(e&nh@u!Yng;zv z=&yzK0_eZTCU<~o{T%Rn7_Qj$}1PtM9Ry4E-&*{*N~Em;)PXZ(>%;^NYUW#y!pni+nqsVeqW`f3P*g0UA?m6wIXKnpw-z6F(1l@x~o zH8q}!io5ZR9=WPUQqgl^_*g6i)+Qe3DBago&j)kZV~#L8!SU(X!<5JO?_bVH$fMC1 zC!>GA()MjwSIX^Sru&qRcORJc_ftlHDlDEcy~H%vsXi>svrR8KDGahpnlL8MEuCdGaZl4PbGOY!SAb| zh1O9Ng*j3)3+)C9Z9}CTfNhH;1%GI}Nf8AcX@|79>;tV{jdqLaLs%m1C`V#KtA0W| fBPKwaNoOAQ14oDCYa}L6i2(~#9T^0Acxh#!1JfuN~kpDjVHZe)rbAQ>buhk z3l=Vj7#8>=#KeUggG(1Kbm!I;xG=$$uEcxGJeW>mJk9O7=ic+C@7*_joHcaD7)UUP z!=VCLQR@_9dhn`z(b(JQ+u>})r^ zO6wo-Y2^8~P2aFJ>ur)a#Z$b#r_qs-TRriaT+I=+t47JO+)B?7zsUy^sbsBQO(iew zS3si`mTl!qz%FANzLC(NDb}n-STqz<+thY;ik(r;vJTc6>QcJdxlkViUR|0ORt{OX z`&^WnYnQpO7X|QwB`n~%Y8AL!Awh21BF|Um=WPcqPDR*!^zKZeDy;k*aBXUWTSB;{ zTus}O3P=0}^dCpPcu-?-;vlCa+@KWH5a#v|-lkbF^a41NwSEYXLnK(8Yj;nuEh$aCsj31@sqy8zV_swDD?6 z&TQEd_PA3LrWBI1P614_el=#kIA_jUr81bK#$-k_%t>9pmz_4JwTzK98*C42mRrDm zBr#$*urcBmfN5epWZ7ev7za-C?`Q*9M(#Wb@B~?D93@u%jq})|naXL?8%^_-P`#uJ zIf^mt=`nmgD34*#dh$guE_hnLJ?~KaL0-ZD2KoQzqdCx;K@0*tkJd@h?^6G^$K)q` zz(`Qyfjks6PhyE5GVxgU?xV)NEyynAu|xxT!ySc zHX$0qSTQIDjJ1{8^f#l1jymly{ve5tRoL=Xo5{dd)KtET<4!F7SZbkOs6!iz+DUh7 zD{4flt^Jm2bx^AgkBV)ENYrk0THB$H>Zti%#R>K_o2)D?-ScNQ>fN^P-l#@sq~k9J zcY~Yr#f7f%78hnykCfPTsKRp11NR*O|L&}v6Z!1G8@PZ9~}q-m69rx7;c>lhE7*v z(C%mztUTM8PjuLLCqe1?(;(D3j_O^l5_7=AOa9$^@^e2Qbr0PP5f{HaT=C?1-hup+ zu~R#D4?YE%%BKmmvMGUju%IU6$jC39wE ze(Pk;itK01`n3NSmypPJz!?$z%I+8~UDywC5yCh6077^O@IA0UKF>V%d?mB(?QO!& zgSo_Yh?$MCME;e>e)vqj9{07d{Vl+e?{5x)HTc*cZ?5fc89M86?!-69SEHp1^B7;x zm~{ys&iPa|D|0BkQ)G*$c>_*s@_abMc0TWxHF9|)X\n" "Language-Team: LANGUAGE \n" @@ -86,7 +86,7 @@ msgid "Ok" msgstr "" #: /home/dan/KeePit/KeePit/Main.qml:166 -msgid "About (KeePit v2)" +msgid "About (KeePit v2.0)" msgstr "" #: /home/dan/KeePit/KeePit/Main.qml:167 diff --git a/ziplib/GZipHelper.h b/ziplib/GZipHelper.h new file mode 100644 index 0000000..3b4aee1 --- /dev/null +++ b/ziplib/GZipHelper.h @@ -0,0 +1,472 @@ +/* version: 1.0, Feb, 2003 + Author : Gao Dasheng + Copyright (C) 1995-2002 Gao Dasheng(dsgao@hotmail.com) + + This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. +////////////////////////////////////////////////////////////////////////////// + Introduce: + This file includes two classes CA2GZIP and CGZIP2A which do compressing and + uncompressing in memory. and It 's very easy to use for small data compressing. + Some compress and uncompress codes came from gzip unzip function of zlib 1.1.x. + + Usage: + these two classes work used with zlib 1.1.x (http://www.gzip.org/zlib/). + They were tested in Window OS. + Exmaple: + #include "GZipHelper.h" + void main() + { + char plainText[]="Plain text here"; + CA2GZIP gzip(plainText,strlen(plainText)); // do compressing here; + LPGZIP pgzip=gzip.pgzip; // pgzip is zipped data pointer, you can use it directly + int len=gzip.Length; // Length is length of zipped data; + + CGZIP2A plain(pgzip,len); // do decompressing here + + char *pplain=plain.psz; // psz is plain data pointer + int aLen=plain.Length; // Length is length of unzipped data. + } +////////////////////////////////////////////////////////////////////////////// +*/ + + +#ifndef __GZipHelper__ +#define __GZipHelper__ + +#include "zutil.h" + + +#define ALLOC(size) malloc(size) +#define TRYFREE(p) {if (p) free(p);} +#define Z_BUFSIZE 4096 +#define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */ +#define HEAD_CRC 0x02 /* bit 1 set: header CRC present */ +#define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */ +#define ORIG_NAME 0x08 /* bit 3 set: original file name present */ +#define COMMENT 0x10 /* bit 4 set: file comment present */ +#define RESERVED 0xE0 /* bits 5..7: reserved */ + +typedef unsigned char GZIP; +typedef GZIP* LPGZIP; + +static const int gz_magic[2] = {0x1f, 0x8b}; /* gzip magic header */ + +template< int t_nBufferLength = 1024 ,int t_nLevel=Z_DEFAULT_COMPRESSION,int t_nStrategy=Z_DEFAULT_STRATEGY> +class CA2GZIPT +{ + public: + LPGZIP pgzip; + int Length; + public: + CA2GZIPT(char* lpsz,int len=-1):pgzip(0),Length(0) + { + Init(lpsz,len); + } + ~CA2GZIPT() + { + if(pgzip!=m_buffer) TRYFREE(pgzip); + } + void Init(char *lpsz,int len=-1) + { + if(lpsz==0) + { + pgzip=0; + Length=0; + return ; + } + if(len==-1) + { + len=(int)strlen(lpsz); + } + m_CurrentBufferSize=t_nBufferLength; + pgzip=m_buffer; + + + m_zstream.zalloc = (alloc_func)0; + m_zstream.zfree = (free_func)0; + m_zstream.opaque = (voidpf)0; + m_zstream.next_in = Z_NULL; + m_zstream.next_out = Z_NULL; + m_zstream.avail_in = 0; + m_zstream.avail_out = 0; + m_z_err = Z_OK; + m_crc = crc32(0L, Z_NULL, 0); + int err = deflateInit2(&(m_zstream), t_nLevel,Z_DEFLATED, -MAX_WBITS, DEF_MEM_LEVEL, t_nStrategy); + m_outbuf = (Byte*)ALLOC(Z_BUFSIZE); + m_zstream.next_out = m_outbuf; + if (err != Z_OK || m_outbuf == Z_NULL) + { + destroy(); + return ; + } + m_zstream.avail_out = Z_BUFSIZE; + GZIP header[10]={0x1f,0x8b,Z_DEFLATED, 0 /*flags*/, 0,0,0,0 /*time*/, 0 /*xflags*/, OS_CODE}; + write(header,10); + + m_zstream.next_in = (Bytef*)lpsz; + m_zstream.avail_in = len; + while (m_zstream.avail_in != 0) + { + if (m_zstream.avail_out == 0) + { + m_zstream.next_out = m_outbuf; + this->write(m_outbuf,Z_BUFSIZE); + m_zstream.avail_out = Z_BUFSIZE; + } + m_z_err = deflate(&m_zstream,Z_NO_FLUSH); + if (m_z_err != Z_OK) break; + } + m_crc = crc32(m_crc, (const Bytef *)lpsz, len); + if (finish() != Z_OK) { destroy(); return ;} + putLong(m_crc); + putLong (m_zstream.total_in); + destroy(); + } + private: + GZIP m_buffer[t_nBufferLength]; + int m_CurrentBufferSize; + z_stream m_zstream; + int m_z_err; /* error code for last stream operation */ + Byte *m_outbuf; /* output buffer */ + uLong m_crc; /* crc32 of uncompressed data */ + + int write(LPGZIP buf,int count) + { + if(buf==0) return 0; + if(Length+count>m_CurrentBufferSize) + { + int nTimes=(Length+count)/t_nBufferLength +1; + LPGZIP pTemp=pgzip; + pgzip=static_cast( malloc(nTimes*t_nBufferLength)); + m_CurrentBufferSize=nTimes*t_nBufferLength; + memcpy(pgzip,pTemp,Length); + if(pTemp!=m_buffer) free(pTemp); + } + memcpy(pgzip+Length,buf,count); + Length+=count; + return count; + } + + int finish() + { + uInt len; + int done = 0; + m_zstream.avail_in = 0; + for (;;) + { + len = Z_BUFSIZE - m_zstream.avail_out; + if (len != 0) + { + write(m_outbuf,len); + m_zstream.next_out = m_outbuf; + m_zstream.avail_out = Z_BUFSIZE; + } + if (done) break; + m_z_err = deflate(&(m_zstream), Z_FINISH); + if (len == 0 && m_z_err == Z_BUF_ERROR) m_z_err = Z_OK; + + done = (m_zstream.avail_out != 0 || m_z_err == Z_STREAM_END); + if (m_z_err != Z_OK && m_z_err != Z_STREAM_END) break; + } + return m_z_err == Z_STREAM_END ? Z_OK : m_z_err; + } + int destroy() + { + int err = Z_OK; + if (m_zstream.state != NULL) { + err = deflateEnd(&(m_zstream)); + } + if (m_z_err < 0) err = m_z_err; + TRYFREE(m_outbuf); + return err; + } + + void putLong (uLong x) + { + for(int n = 0; n < 4; n++) { + unsigned char c=(unsigned char)(x & 0xff); + write(&c,1); + x >>= 8; + } + } +}; +typedef CA2GZIPT<10> CA2GZIP; + + +template< int t_nBufferLength = 1024> +class CGZIP2AT +{ + public: + char *psz; + int Length; + CGZIP2AT(LPGZIP pgzip,int len):m_gzip(pgzip),m_gziplen(len),psz(0),Length(0),m_pos(0) + { + Init(); + } + ~CGZIP2AT() + { + if(psz!=m_buffer) TRYFREE(psz); + } + void Init() + { + if(m_gzip==0) + { + psz=0; + Length=0; + return ; + } + m_CurrentBufferSize=t_nBufferLength; + psz=m_buffer; + memset(psz,0,m_CurrentBufferSize+1); + + m_zstream.zalloc = (alloc_func)0; + m_zstream.zfree = (free_func)0; + m_zstream.opaque = (voidpf)0; + m_zstream.next_in = m_inbuf = Z_NULL; + m_zstream.next_out = Z_NULL; + m_zstream.avail_in = m_zstream.avail_out = 0; + m_z_err = Z_OK; + m_z_eof = 0; + m_transparent = 0; + m_crc = crc32(0L, Z_NULL, 0); + + m_zstream.next_in =m_inbuf = (Byte*)ALLOC(Z_BUFSIZE); + int err = inflateInit2(&(m_zstream), -MAX_WBITS); + if (err != Z_OK || m_inbuf == Z_NULL) + { + destroy(); + return; + } + m_zstream.avail_out = Z_BUFSIZE; + check_header(); + char outbuf[Z_BUFSIZE]; + int nRead; + while(true) + { + nRead=gzread(outbuf,Z_BUFSIZE); + if(nRead<=0) break; + write(outbuf,nRead); + } + destroy(); + } + private: + char m_buffer[t_nBufferLength+1]; + int m_CurrentBufferSize; + z_stream m_zstream; + int m_z_err; /* error code for last stream operation */ + Byte *m_inbuf; /* output buffer */ + uLong m_crc; /* crc32 of uncompressed data */ + int m_z_eof; + int m_transparent; + + int m_pos; + LPGZIP m_gzip; + int m_gziplen; + + void check_header() + { + int method; /* method byte */ + int flags; /* flags byte */ + uInt len; + int c; + + /* Check the gzip magic header */ + for (len = 0; len < 2; len++) { + c = get_byte(); + if (c != gz_magic[len]) { + if (len != 0) m_zstream.avail_in++, m_zstream.next_in--; + if (c != EOF) { + m_zstream.avail_in++, m_zstream.next_in--; + m_transparent = 1; + } + m_z_err =m_zstream.avail_in != 0 ? Z_OK : Z_STREAM_END; + return; + } + } + method = get_byte(); + flags = get_byte(); + if (method != Z_DEFLATED || (flags & RESERVED) != 0) { + m_z_err = Z_DATA_ERROR; + return; + } + /* Discard time, xflags and OS code: */ + for (len = 0; len < 6; len++) (void)get_byte(); + + if ((flags & EXTRA_FIELD) != 0) { /* skip the extra field */ + len = (uInt)get_byte(); + len += ((uInt)get_byte())<<8; + /* len is garbage if EOF but the loop below will quit anyway */ + while (len-- != 0 && get_byte() != EOF) ; + } + if ((flags & ORIG_NAME) != 0) { /* skip the original file name */ + while ((c = get_byte()) != 0 && c != EOF) ; + } + if ((flags & COMMENT) != 0) { /* skip the .gz file comment */ + while ((c = get_byte()) != 0 && c != EOF) ; + } + if ((flags & HEAD_CRC) != 0) { /* skip the header crc */ + for (len = 0; len < 2; len++) (void)get_byte(); + } + m_z_err = m_z_eof ? Z_DATA_ERROR : Z_OK; + } + + int get_byte() + { + if (m_z_eof) return EOF; + if (m_zstream.avail_in == 0) + { + errno = 0; + m_zstream.avail_in =read(m_inbuf,Z_BUFSIZE); + if(m_zstream.avail_in == 0) + { + m_z_eof = 1; + return EOF; + } + m_zstream.next_in = m_inbuf; + } + m_zstream.avail_in--; + return *(m_zstream.next_in)++; + } + int read(LPGZIP buf,int size) + { + int nRead=size; + if(m_pos+size>=m_gziplen) + { + nRead=m_gziplen-m_pos; + } + if(nRead<=0) return 0; + memcpy(buf,m_gzip+m_pos,nRead); + m_pos+=nRead; + return nRead; + } + + int gzread(char* buf,int len) + { + Bytef *start = (Bytef*)buf; /* starting point for crc computation */ + Byte *next_out; /* == stream.next_out but not forced far (for MSDOS) */ + + + if (m_z_err == Z_DATA_ERROR || m_z_err == Z_ERRNO) return -1; + if (m_z_err == Z_STREAM_END) return 0; /* EOF */ + + next_out = (Byte*)buf; + m_zstream.next_out = (Bytef*)buf; + m_zstream.avail_out = len; + while (m_zstream.avail_out != 0) { + if (m_transparent) + { + /* Copy first the lookahead bytes: */ + uInt n = m_zstream.avail_in; + if (n > m_zstream.avail_out) n = m_zstream.avail_out; + if (n > 0) + { + zmemcpy(m_zstream.next_out,m_zstream.next_in, n); + next_out += n; + m_zstream.next_out = next_out; + m_zstream.next_in += n; + m_zstream.avail_out -= n; + m_zstream.avail_in -= n; + } + if (m_zstream.avail_out > 0) { + m_zstream.avail_out -=read(next_out,m_zstream.avail_out); + } + len -= m_zstream.avail_out; + m_zstream.total_in += (uLong)len; + m_zstream.total_out += (uLong)len; + if (len == 0) m_z_eof = 1; + return (int)len; + } + if (m_zstream.avail_in == 0 && !m_z_eof) + { + errno = 0; + m_zstream.avail_in = read(m_inbuf,Z_BUFSIZE); + if (m_zstream.avail_in == 0) + { + m_z_eof = 1; + } + m_zstream.next_in = m_inbuf; + } + m_z_err = inflate(&(m_zstream), Z_NO_FLUSH); + if (m_z_err == Z_STREAM_END) + { + /* Check CRC and original size */ + m_crc = crc32(m_crc, start, (uInt)(m_zstream.next_out - start)); + start = m_zstream.next_out; + if (getLong() != m_crc) { + m_z_err = Z_DATA_ERROR; + }else + { + (void)getLong(); + check_header(); + if (m_z_err == Z_OK) + { + uLong total_in = m_zstream.total_in; + uLong total_out = m_zstream.total_out; + inflateReset(&(m_zstream)); + m_zstream.total_in = total_in; + m_zstream.total_out = total_out; + m_crc = crc32(0L, Z_NULL, 0); + } + } + } + if (m_z_err != Z_OK || m_z_eof) break; + } + m_crc = crc32(m_crc, start, (uInt)(m_zstream.next_out - start)); + return (int)(len - m_zstream.avail_out); + } + uLong getLong() + { + uLong x = (uLong)get_byte(); + int c; + x += ((uLong)get_byte())<<8; + x += ((uLong)get_byte())<<16; + c = get_byte(); + if (c == EOF) m_z_err = Z_DATA_ERROR; + x += ((uLong)c)<<24; + return x; + } + int write(char* buf,int count) + { + if(buf==0) return 0; + if(Length+count>m_CurrentBufferSize) + { + int nTimes=(Length+count)/t_nBufferLength +1; + char *pTemp=psz; + psz=static_cast( malloc(nTimes*t_nBufferLength+1)); + m_CurrentBufferSize=nTimes*t_nBufferLength; + memset(psz,0,m_CurrentBufferSize+1); + memcpy(psz,pTemp,Length); + if(pTemp!=m_buffer) free(pTemp); + } + memcpy(psz+Length,buf,count); + Length+=count; + return count; + } + int destroy() + { + int err = Z_OK; + if (m_zstream.state != NULL) { + err = inflateEnd(&(m_zstream)); + } + if (m_z_err < 0) err = m_z_err; + TRYFREE(m_inbuf); + return err; +} + +}; +typedef CGZIP2AT<> CGZIP2A; +#endif diff --git a/ziplib/GZipHelper.h~ b/ziplib/GZipHelper.h~ new file mode 100644 index 0000000..87fc5fb --- /dev/null +++ b/ziplib/GZipHelper.h~ @@ -0,0 +1,472 @@ +/* version: 1.0, Feb, 2003 + Author : Gao Dasheng + Copyright (C) 1995-2002 Gao Dasheng(dsgao@hotmail.com) + + This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. +////////////////////////////////////////////////////////////////////////////// + Introduce: + This file includes two classes CA2GZIP and CGZIP2A which do compressing and + uncompressing in memory. and It 's very easy to use for small data compressing. + Some compress and uncompress codes came from gzip unzip function of zlib 1.1.x. + + Usage: + these two classes work used with zlib 1.1.x (http://www.gzip.org/zlib/). + They were tested in Window OS. + Exmaple: + #include "GZipHelper.h" + void main() + { + char plainText[]="Plain text here"; + CA2GZIP gzip(plainText,strlen(plainText)); // do compressing here; + LPGZIP pgzip=gzip.pgzip; // pgzip is zipped data pointer, you can use it directly + int len=gzip.Length; // Length is length of zipped data; + + CGZIP2A plain(pgzip,len); // do decompressing here + + char *pplain=plain.psz; // psz is plain data pointer + int aLen=plain.Length; // Length is length of unzipped data. + } +////////////////////////////////////////////////////////////////////////////// +*/ + + +#ifndef __GZipHelper__ +#define __GZipHelper__ + +#include "zip/zutil.h" + + +#define ALLOC(size) malloc(size) +#define TRYFREE(p) {if (p) free(p);} +#define Z_BUFSIZE 4096 +#define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */ +#define HEAD_CRC 0x02 /* bit 1 set: header CRC present */ +#define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */ +#define ORIG_NAME 0x08 /* bit 3 set: original file name present */ +#define COMMENT 0x10 /* bit 4 set: file comment present */ +#define RESERVED 0xE0 /* bits 5..7: reserved */ + +typedef unsigned char GZIP; +typedef GZIP* LPGZIP; + +static const int gz_magic[2] = {0x1f, 0x8b}; /* gzip magic header */ + +template< int t_nBufferLength = 1024 ,int t_nLevel=Z_DEFAULT_COMPRESSION,int t_nStrategy=Z_DEFAULT_STRATEGY> +class CA2GZIPT +{ + public: + LPGZIP pgzip; + int Length; + public: + CA2GZIPT(char* lpsz,int len=-1):pgzip(0),Length(0) + { + Init(lpsz,len); + } + ~CA2GZIPT() + { + if(pgzip!=m_buffer) TRYFREE(pgzip); + } + void Init(char *lpsz,int len=-1) + { + if(lpsz==0) + { + pgzip=0; + Length=0; + return ; + } + if(len==-1) + { + len=(int)strlen(lpsz); + } + m_CurrentBufferSize=t_nBufferLength; + pgzip=m_buffer; + + + m_zstream.zalloc = (alloc_func)0; + m_zstream.zfree = (free_func)0; + m_zstream.opaque = (voidpf)0; + m_zstream.next_in = Z_NULL; + m_zstream.next_out = Z_NULL; + m_zstream.avail_in = 0; + m_zstream.avail_out = 0; + m_z_err = Z_OK; + m_crc = crc32(0L, Z_NULL, 0); + int err = deflateInit2(&(m_zstream), t_nLevel,Z_DEFLATED, -MAX_WBITS, DEF_MEM_LEVEL, t_nStrategy); + m_outbuf = (Byte*)ALLOC(Z_BUFSIZE); + m_zstream.next_out = m_outbuf; + if (err != Z_OK || m_outbuf == Z_NULL) + { + destroy(); + return ; + } + m_zstream.avail_out = Z_BUFSIZE; + GZIP header[10]={0x1f,0x8b,Z_DEFLATED, 0 /*flags*/, 0,0,0,0 /*time*/, 0 /*xflags*/, OS_CODE}; + write(header,10); + + m_zstream.next_in = (Bytef*)lpsz; + m_zstream.avail_in = len; + while (m_zstream.avail_in != 0) + { + if (m_zstream.avail_out == 0) + { + m_zstream.next_out = m_outbuf; + this->write(m_outbuf,Z_BUFSIZE); + m_zstream.avail_out = Z_BUFSIZE; + } + m_z_err = deflate(&m_zstream,Z_NO_FLUSH); + if (m_z_err != Z_OK) break; + } + m_crc = crc32(m_crc, (const Bytef *)lpsz, len); + if (finish() != Z_OK) { destroy(); return ;} + putLong(m_crc); + putLong (m_zstream.total_in); + destroy(); + } + private: + GZIP m_buffer[t_nBufferLength]; + int m_CurrentBufferSize; + z_stream m_zstream; + int m_z_err; /* error code for last stream operation */ + Byte *m_outbuf; /* output buffer */ + uLong m_crc; /* crc32 of uncompressed data */ + + int write(LPGZIP buf,int count) + { + if(buf==0) return 0; + if(Length+count>m_CurrentBufferSize) + { + int nTimes=(Length+count)/t_nBufferLength +1; + LPGZIP pTemp=pgzip; + pgzip=static_cast( malloc(nTimes*t_nBufferLength)); + m_CurrentBufferSize=nTimes*t_nBufferLength; + memcpy(pgzip,pTemp,Length); + if(pTemp!=m_buffer) free(pTemp); + } + memcpy(pgzip+Length,buf,count); + Length+=count; + return count; + } + + int finish() + { + uInt len; + int done = 0; + m_zstream.avail_in = 0; + for (;;) + { + len = Z_BUFSIZE - m_zstream.avail_out; + if (len != 0) + { + write(m_outbuf,len); + m_zstream.next_out = m_outbuf; + m_zstream.avail_out = Z_BUFSIZE; + } + if (done) break; + m_z_err = deflate(&(m_zstream), Z_FINISH); + if (len == 0 && m_z_err == Z_BUF_ERROR) m_z_err = Z_OK; + + done = (m_zstream.avail_out != 0 || m_z_err == Z_STREAM_END); + if (m_z_err != Z_OK && m_z_err != Z_STREAM_END) break; + } + return m_z_err == Z_STREAM_END ? Z_OK : m_z_err; + } + int destroy() + { + int err = Z_OK; + if (m_zstream.state != NULL) { + err = deflateEnd(&(m_zstream)); + } + if (m_z_err < 0) err = m_z_err; + TRYFREE(m_outbuf); + return err; + } + + void putLong (uLong x) + { + for(int n = 0; n < 4; n++) { + unsigned char c=(unsigned char)(x & 0xff); + write(&c,1); + x >>= 8; + } + } +}; +typedef CA2GZIPT<10> CA2GZIP; + + +template< int t_nBufferLength = 1024> +class CGZIP2AT +{ + public: + char *psz; + int Length; + CGZIP2AT(LPGZIP pgzip,int len):m_gzip(pgzip),m_gziplen(len),psz(0),Length(0),m_pos(0) + { + Init(); + } + ~CGZIP2AT() + { + if(psz!=m_buffer) TRYFREE(psz); + } + void Init() + { + if(m_gzip==0) + { + psz=0; + Length=0; + return ; + } + m_CurrentBufferSize=t_nBufferLength; + psz=m_buffer; + memset(psz,0,m_CurrentBufferSize+1); + + m_zstream.zalloc = (alloc_func)0; + m_zstream.zfree = (free_func)0; + m_zstream.opaque = (voidpf)0; + m_zstream.next_in = m_inbuf = Z_NULL; + m_zstream.next_out = Z_NULL; + m_zstream.avail_in = m_zstream.avail_out = 0; + m_z_err = Z_OK; + m_z_eof = 0; + m_transparent = 0; + m_crc = crc32(0L, Z_NULL, 0); + + m_zstream.next_in =m_inbuf = (Byte*)ALLOC(Z_BUFSIZE); + int err = inflateInit2(&(m_zstream), -MAX_WBITS); + if (err != Z_OK || m_inbuf == Z_NULL) + { + destroy(); + return; + } + m_zstream.avail_out = Z_BUFSIZE; + check_header(); + char outbuf[Z_BUFSIZE]; + int nRead; + while(true) + { + nRead=gzread(outbuf,Z_BUFSIZE); + if(nRead<=0) break; + write(outbuf,nRead); + } + destroy(); + } + private: + char m_buffer[t_nBufferLength+1]; + int m_CurrentBufferSize; + z_stream m_zstream; + int m_z_err; /* error code for last stream operation */ + Byte *m_inbuf; /* output buffer */ + uLong m_crc; /* crc32 of uncompressed data */ + int m_z_eof; + int m_transparent; + + int m_pos; + LPGZIP m_gzip; + int m_gziplen; + + void check_header() + { + int method; /* method byte */ + int flags; /* flags byte */ + uInt len; + int c; + + /* Check the gzip magic header */ + for (len = 0; len < 2; len++) { + c = get_byte(); + if (c != gz_magic[len]) { + if (len != 0) m_zstream.avail_in++, m_zstream.next_in--; + if (c != EOF) { + m_zstream.avail_in++, m_zstream.next_in--; + m_transparent = 1; + } + m_z_err =m_zstream.avail_in != 0 ? Z_OK : Z_STREAM_END; + return; + } + } + method = get_byte(); + flags = get_byte(); + if (method != Z_DEFLATED || (flags & RESERVED) != 0) { + m_z_err = Z_DATA_ERROR; + return; + } + /* Discard time, xflags and OS code: */ + for (len = 0; len < 6; len++) (void)get_byte(); + + if ((flags & EXTRA_FIELD) != 0) { /* skip the extra field */ + len = (uInt)get_byte(); + len += ((uInt)get_byte())<<8; + /* len is garbage if EOF but the loop below will quit anyway */ + while (len-- != 0 && get_byte() != EOF) ; + } + if ((flags & ORIG_NAME) != 0) { /* skip the original file name */ + while ((c = get_byte()) != 0 && c != EOF) ; + } + if ((flags & COMMENT) != 0) { /* skip the .gz file comment */ + while ((c = get_byte()) != 0 && c != EOF) ; + } + if ((flags & HEAD_CRC) != 0) { /* skip the header crc */ + for (len = 0; len < 2; len++) (void)get_byte(); + } + m_z_err = m_z_eof ? Z_DATA_ERROR : Z_OK; + } + + int get_byte() + { + if (m_z_eof) return EOF; + if (m_zstream.avail_in == 0) + { + errno = 0; + m_zstream.avail_in =read(m_inbuf,Z_BUFSIZE); + if(m_zstream.avail_in == 0) + { + m_z_eof = 1; + return EOF; + } + m_zstream.next_in = m_inbuf; + } + m_zstream.avail_in--; + return *(m_zstream.next_in)++; + } + int read(LPGZIP buf,int size) + { + int nRead=size; + if(m_pos+size>=m_gziplen) + { + nRead=m_gziplen-m_pos; + } + if(nRead<=0) return 0; + memcpy(buf,m_gzip+m_pos,nRead); + m_pos+=nRead; + return nRead; + } + + int gzread(char* buf,int len) + { + Bytef *start = (Bytef*)buf; /* starting point for crc computation */ + Byte *next_out; /* == stream.next_out but not forced far (for MSDOS) */ + + + if (m_z_err == Z_DATA_ERROR || m_z_err == Z_ERRNO) return -1; + if (m_z_err == Z_STREAM_END) return 0; /* EOF */ + + next_out = (Byte*)buf; + m_zstream.next_out = (Bytef*)buf; + m_zstream.avail_out = len; + while (m_zstream.avail_out != 0) { + if (m_transparent) + { + /* Copy first the lookahead bytes: */ + uInt n = m_zstream.avail_in; + if (n > m_zstream.avail_out) n = m_zstream.avail_out; + if (n > 0) + { + zmemcpy(m_zstream.next_out,m_zstream.next_in, n); + next_out += n; + m_zstream.next_out = next_out; + m_zstream.next_in += n; + m_zstream.avail_out -= n; + m_zstream.avail_in -= n; + } + if (m_zstream.avail_out > 0) { + m_zstream.avail_out -=read(next_out,m_zstream.avail_out); + } + len -= m_zstream.avail_out; + m_zstream.total_in += (uLong)len; + m_zstream.total_out += (uLong)len; + if (len == 0) m_z_eof = 1; + return (int)len; + } + if (m_zstream.avail_in == 0 && !m_z_eof) + { + errno = 0; + m_zstream.avail_in = read(m_inbuf,Z_BUFSIZE); + if (m_zstream.avail_in == 0) + { + m_z_eof = 1; + } + m_zstream.next_in = m_inbuf; + } + m_z_err = inflate(&(m_zstream), Z_NO_FLUSH); + if (m_z_err == Z_STREAM_END) + { + /* Check CRC and original size */ + m_crc = crc32(m_crc, start, (uInt)(m_zstream.next_out - start)); + start = m_zstream.next_out; + if (getLong() != m_crc) { + m_z_err = Z_DATA_ERROR; + }else + { + (void)getLong(); + check_header(); + if (m_z_err == Z_OK) + { + uLong total_in = m_zstream.total_in; + uLong total_out = m_zstream.total_out; + inflateReset(&(m_zstream)); + m_zstream.total_in = total_in; + m_zstream.total_out = total_out; + m_crc = crc32(0L, Z_NULL, 0); + } + } + } + if (m_z_err != Z_OK || m_z_eof) break; + } + m_crc = crc32(m_crc, start, (uInt)(m_zstream.next_out - start)); + return (int)(len - m_zstream.avail_out); + } + uLong getLong() + { + uLong x = (uLong)get_byte(); + int c; + x += ((uLong)get_byte())<<8; + x += ((uLong)get_byte())<<16; + c = get_byte(); + if (c == EOF) m_z_err = Z_DATA_ERROR; + x += ((uLong)c)<<24; + return x; + } + int write(char* buf,int count) + { + if(buf==0) return 0; + if(Length+count>m_CurrentBufferSize) + { + int nTimes=(Length+count)/t_nBufferLength +1; + char *pTemp=psz; + psz=static_cast( malloc(nTimes*t_nBufferLength+1)); + m_CurrentBufferSize=nTimes*t_nBufferLength; + memset(psz,0,m_CurrentBufferSize+1); + memcpy(psz,pTemp,Length); + if(pTemp!=m_buffer) free(pTemp); + } + memcpy(psz+Length,buf,count); + Length+=count; + return count; + } + int destroy() + { + int err = Z_OK; + if (m_zstream.state != NULL) { + err = inflateEnd(&(m_zstream)); + } + if (m_z_err < 0) err = m_z_err; + TRYFREE(m_inbuf); + return err; +} + +}; +typedef CGZIP2AT<> CGZIP2A; +#endif \ No newline at end of file diff --git a/ziplib/adler32.c b/ziplib/adler32.c new file mode 100644 index 0000000..98323a8 --- /dev/null +++ b/ziplib/adler32.c @@ -0,0 +1,48 @@ +/* adler32.c -- compute the Adler-32 checksum of a data stream + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* @(#) $Id$ */ + +#include "zlib.h" + +#define BASE 65521L /* largest prime smaller than 65536 */ +#define NMAX 5552 +/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ + +#define DO1(buf,i) {s1 += buf[i]; s2 += s1;} +#define DO2(buf,i) DO1(buf,i); DO1(buf,i+1); +#define DO4(buf,i) DO2(buf,i); DO2(buf,i+2); +#define DO8(buf,i) DO4(buf,i); DO4(buf,i+4); +#define DO16(buf) DO8(buf,0); DO8(buf,8); + +/* ========================================================================= */ +uLong ZEXPORT adler32(adler, buf, len) + uLong adler; + const Bytef *buf; + uInt len; +{ + unsigned long s1 = adler & 0xffff; + unsigned long s2 = (adler >> 16) & 0xffff; + int k; + + if (buf == Z_NULL) return 1L; + + while (len > 0) { + k = len < NMAX ? len : NMAX; + len -= k; + while (k >= 16) { + DO16(buf); + buf += 16; + k -= 16; + } + if (k != 0) do { + s1 += *buf++; + s2 += s1; + } while (--k); + s1 %= BASE; + s2 %= BASE; + } + return (s2 << 16) | s1; +} diff --git a/ziplib/compress.c b/ziplib/compress.c new file mode 100644 index 0000000..d52e522 --- /dev/null +++ b/ziplib/compress.c @@ -0,0 +1,68 @@ +/* compress.c -- compress a memory buffer + * Copyright (C) 1995-2002 Jean-loup Gailly. + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* @(#) $Id$ */ + +#include "zlib.h" + +/* =========================================================================== + Compresses the source buffer into the destination buffer. The level + parameter has the same meaning as in deflateInit. sourceLen is the byte + length of the source buffer. Upon entry, destLen is the total size of the + destination buffer, which must be at least 0.1% larger than sourceLen plus + 12 bytes. Upon exit, destLen is the actual size of the compressed buffer. + + compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_BUF_ERROR if there was not enough room in the output buffer, + Z_STREAM_ERROR if the level parameter is invalid. +*/ +int ZEXPORT compress2 (dest, destLen, source, sourceLen, level) + Bytef *dest; + uLongf *destLen; + const Bytef *source; + uLong sourceLen; + int level; +{ + z_stream stream; + int err; + + stream.next_in = (Bytef*)source; + stream.avail_in = (uInt)sourceLen; +#ifdef MAXSEG_64K + /* Check for source > 64K on 16-bit machine: */ + if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR; +#endif + stream.next_out = dest; + stream.avail_out = (uInt)*destLen; + if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR; + + stream.zalloc = (alloc_func)0; + stream.zfree = (free_func)0; + stream.opaque = (voidpf)0; + + err = deflateInit(&stream, level); + if (err != Z_OK) return err; + + err = deflate(&stream, Z_FINISH); + if (err != Z_STREAM_END) { + deflateEnd(&stream); + return err == Z_OK ? Z_BUF_ERROR : err; + } + *destLen = stream.total_out; + + err = deflateEnd(&stream); + return err; +} + +/* =========================================================================== + */ +int ZEXPORT compress (dest, destLen, source, sourceLen) + Bytef *dest; + uLongf *destLen; + const Bytef *source; + uLong sourceLen; +{ + return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION); +} diff --git a/ziplib/crc32.c b/ziplib/crc32.c new file mode 100644 index 0000000..d2e0492 --- /dev/null +++ b/ziplib/crc32.c @@ -0,0 +1,162 @@ +/* crc32.c -- compute the CRC-32 of a data stream + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* @(#) $Id$ */ + +#include "zlib.h" + +#define local static + +#ifdef DYNAMIC_CRC_TABLE + +local int crc_table_empty = 1; +local uLongf crc_table[256]; +local void make_crc_table OF((void)); + +/* + Generate a table for a byte-wise 32-bit CRC calculation on the polynomial: + x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1. + + Polynomials over GF(2) are represented in binary, one bit per coefficient, + with the lowest powers in the most significant bit. Then adding polynomials + is just exclusive-or, and multiplying a polynomial by x is a right shift by + one. If we call the above polynomial p, and represent a byte as the + polynomial q, also with the lowest power in the most significant bit (so the + byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p, + where a mod b means the remainder after dividing a by b. + + This calculation is done using the shift-register method of multiplying and + taking the remainder. The register is initialized to zero, and for each + incoming bit, x^32 is added mod p to the register if the bit is a one (where + x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by + x (which is shifting right by one and adding x^32 mod p if the bit shifted + out is a one). We start with the highest power (least significant bit) of + q and repeat for all eight bits of q. + + The table is simply the CRC of all possible eight bit values. This is all + the information needed to generate CRC's on data a byte at a time for all + combinations of CRC register values and incoming bytes. +*/ +local void make_crc_table() +{ + uLong c; + int n, k; + uLong poly; /* polynomial exclusive-or pattern */ + /* terms of polynomial defining this crc (except x^32): */ + static const Byte p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26}; + + /* make exclusive-or pattern from polynomial (0xedb88320L) */ + poly = 0L; + for (n = 0; n < sizeof(p)/sizeof(Byte); n++) + poly |= 1L << (31 - p[n]); + + for (n = 0; n < 256; n++) + { + c = (uLong)n; + for (k = 0; k < 8; k++) + c = c & 1 ? poly ^ (c >> 1) : c >> 1; + crc_table[n] = c; + } + crc_table_empty = 0; +} +#else +/* ======================================================================== + * Table of CRC-32's of all single-byte values (made by make_crc_table) + */ +local const uLongf crc_table[256] = { + 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L, + 0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L, + 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L, + 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL, + 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L, + 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L, + 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L, + 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL, + 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L, + 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL, + 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L, + 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L, + 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L, + 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL, + 0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL, + 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L, + 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL, + 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L, + 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L, + 0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L, + 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL, + 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L, + 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L, + 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL, + 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L, + 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L, + 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L, + 0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L, + 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L, + 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL, + 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL, + 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L, + 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L, + 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL, + 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL, + 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L, + 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL, + 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L, + 0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL, + 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L, + 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL, + 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L, + 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L, + 0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL, + 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L, + 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L, + 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L, + 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L, + 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L, + 0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L, + 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL, + 0x2d02ef8dL +}; +#endif + +/* ========================================================================= + * This function can be used by asm versions of crc32() + */ +const uLongf * ZEXPORT get_crc_table() +{ +#ifdef DYNAMIC_CRC_TABLE + if (crc_table_empty) make_crc_table(); +#endif + return (const uLongf *)crc_table; +} + +/* ========================================================================= */ +#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 ZEXPORT crc32(crc, buf, len) + uLong crc; + const Bytef *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; +} diff --git a/ziplib/deflate.c b/ziplib/deflate.c new file mode 100644 index 0000000..51a50a0 --- /dev/null +++ b/ziplib/deflate.c @@ -0,0 +1,1350 @@ +/* deflate.c -- compress data using the deflation algorithm + * Copyright (C) 1995-2002 Jean-loup Gailly. + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* + * ALGORITHM + * + * The "deflation" process depends on being able to identify portions + * of the input text which are identical to earlier input (within a + * sliding window trailing behind the input currently being processed). + * + * The most straightforward technique turns out to be the fastest for + * most input files: try all possible matches and select the longest. + * The key feature of this algorithm is that insertions into the string + * dictionary are very simple and thus fast, and deletions are avoided + * completely. Insertions are performed at each input character, whereas + * string matches are performed only when the previous match ends. So it + * is preferable to spend more time in matches to allow very fast string + * insertions and avoid deletions. The matching algorithm for small + * strings is inspired from that of Rabin & Karp. A brute force approach + * is used to find longer strings when a small match has been found. + * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze + * (by Leonid Broukhis). + * A previous version of this file used a more sophisticated algorithm + * (by Fiala and Greene) which is guaranteed to run in linear amortized + * time, but has a larger average cost, uses more memory and is patented. + * However the F&G algorithm may be faster for some highly redundant + * files if the parameter max_chain_length (described below) is too large. + * + * ACKNOWLEDGEMENTS + * + * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and + * I found it in 'freeze' written by Leonid Broukhis. + * Thanks to many people for bug reports and testing. + * + * REFERENCES + * + * Deutsch, L.P.,"DEFLATE Compressed Data Format Specification". + * Available in ftp://ds.internic.net/rfc/rfc1951.txt + * + * A description of the Rabin and Karp algorithm is given in the book + * "Algorithms" by R. Sedgewick, Addison-Wesley, p252. + * + * Fiala,E.R., and Greene,D.H. + * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595 + * + */ + +/* @(#) $Id$ */ + +#include "deflate.h" + +const char deflate_copyright[] = + " deflate 1.1.4 Copyright 1995-2002 Jean-loup Gailly "; +/* + If you use the zlib library in a product, an acknowledgment is welcome + in the documentation of your product. If for some reason you cannot + include such an acknowledgment, I would appreciate that you keep this + copyright string in the executable of your product. + */ + +/* =========================================================================== + * Function prototypes. + */ +typedef enum { + need_more, /* block not completed, need more input or more output */ + block_done, /* block flush performed */ + finish_started, /* finish started, need only more output at next deflate */ + finish_done /* finish done, accept no more input or output */ +} block_state; + +typedef block_state (*compress_func) OF((deflate_state *s, int flush)); +/* Compression function. Returns the block state after the call. */ + +local void fill_window OF((deflate_state *s)); +local block_state deflate_stored OF((deflate_state *s, int flush)); +local block_state deflate_fast OF((deflate_state *s, int flush)); +local block_state deflate_slow OF((deflate_state *s, int flush)); +local void lm_init OF((deflate_state *s)); +local void putShortMSB OF((deflate_state *s, uInt b)); +local void flush_pending OF((z_streamp strm)); +local int read_buf OF((z_streamp strm, Bytef *buf, unsigned size)); +#ifdef ASMV + void match_init OF((void)); /* asm code initialization */ + uInt longest_match OF((deflate_state *s, IPos cur_match)); +#else +local uInt longest_match OF((deflate_state *s, IPos cur_match)); +#endif + +#ifdef DEBUG +local void check_match OF((deflate_state *s, IPos start, IPos match, + int length)); +#endif + +/* =========================================================================== + * Local data + */ + +#define NIL 0 +/* Tail of hash chains */ + +#ifndef TOO_FAR +# define TOO_FAR 4096 +#endif +/* Matches of length 3 are discarded if their distance exceeds TOO_FAR */ + +#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) +/* Minimum amount of lookahead, except at the end of the input file. + * See deflate.c for comments about the MIN_MATCH+1. + */ + +/* Values for max_lazy_match, good_match and max_chain_length, depending on + * the desired pack level (0..9). The values given below have been tuned to + * exclude worst case performance for pathological files. Better values may be + * found for specific files. + */ +typedef struct config_s { + ush good_length; /* reduce lazy search above this match length */ + ush max_lazy; /* do not perform lazy search above this match length */ + ush nice_length; /* quit search above this match length */ + ush max_chain; + compress_func func; +} config; + +local const config configuration_table[10] = { +/* good lazy nice chain */ +/* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */ +/* 1 */ {4, 4, 8, 4, deflate_fast}, /* maximum speed, no lazy matches */ +/* 2 */ {4, 5, 16, 8, deflate_fast}, +/* 3 */ {4, 6, 32, 32, deflate_fast}, + +/* 4 */ {4, 4, 16, 16, deflate_slow}, /* lazy matches */ +/* 5 */ {8, 16, 32, 32, deflate_slow}, +/* 6 */ {8, 16, 128, 128, deflate_slow}, +/* 7 */ {8, 32, 128, 256, deflate_slow}, +/* 8 */ {32, 128, 258, 1024, deflate_slow}, +/* 9 */ {32, 258, 258, 4096, deflate_slow}}; /* maximum compression */ + +/* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4 + * For deflate_fast() (levels <= 3) good is ignored and lazy has a different + * meaning. + */ + +#define EQUAL 0 +/* result of memcmp for equal strings */ + +struct static_tree_desc_s {int dummy;}; /* for buggy compilers */ + +/* =========================================================================== + * Update a hash value with the given input byte + * IN assertion: all calls to to UPDATE_HASH are made with consecutive + * input characters, so that a running hash key can be computed from the + * previous key instead of complete recalculation each time. + */ +#define UPDATE_HASH(s,h,c) (h = (((h)<hash_shift) ^ (c)) & s->hash_mask) + + +/* =========================================================================== + * Insert string str in the dictionary and set match_head to the previous head + * of the hash chain (the most recent string with same hash key). Return + * the previous length of the hash chain. + * If this file is compiled with -DFASTEST, the compression level is forced + * to 1, and no hash chains are maintained. + * IN assertion: all calls to to INSERT_STRING are made with consecutive + * input characters and the first MIN_MATCH bytes of str are valid + * (except for the last MIN_MATCH-1 bytes of the input file). + */ +#ifdef FASTEST +#define INSERT_STRING(s, str, match_head) \ + (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ + match_head = s->head[s->ins_h], \ + s->head[s->ins_h] = (Pos)(str)) +#else +#define INSERT_STRING(s, str, match_head) \ + (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \ + s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \ + s->head[s->ins_h] = (Pos)(str)) +#endif + +/* =========================================================================== + * 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((Bytef *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head)); + +/* ========================================================================= */ +int ZEXPORT deflateInit_(strm, level, version, stream_size) + z_streamp strm; + int level; + const char *version; + int stream_size; +{ + return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, + Z_DEFAULT_STRATEGY, version, stream_size); + /* To do: ignore strm->next_in if we use it as window */ +} + +/* ========================================================================= */ +int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy, + version, stream_size) + z_streamp strm; + int level; + int method; + int windowBits; + int memLevel; + int strategy; + const char *version; + int stream_size; +{ + deflate_state *s; + int noheader = 0; + static const char* my_version = ZLIB_VERSION; + + ushf *overlay; + /* We overlay pending_buf and d_buf+l_buf. This works since the average + * output size for (length,distance) codes is <= 24 bits. + */ + + if (version == Z_NULL || version[0] != my_version[0] || + stream_size != sizeof(z_stream)) { + return Z_VERSION_ERROR; + } + if (strm == Z_NULL) return Z_STREAM_ERROR; + + strm->msg = Z_NULL; + if (strm->zalloc == Z_NULL) { + strm->zalloc = zcalloc; + strm->opaque = (voidpf)0; + } + if (strm->zfree == Z_NULL) strm->zfree = zcfree; + + if (level == Z_DEFAULT_COMPRESSION) level = 6; +#ifdef FASTEST + level = 1; +#endif + + if (windowBits < 0) { /* undocumented feature: suppress zlib header */ + noheader = 1; + windowBits = -windowBits; + } + if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED || + windowBits < 9 || windowBits > 15 || level < 0 || level > 9 || + strategy < 0 || strategy > Z_HUFFMAN_ONLY) { + return Z_STREAM_ERROR; + } + s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state)); + if (s == Z_NULL) return Z_MEM_ERROR; + strm->state = (struct internal_state FAR *)s; + s->strm = strm; + + s->noheader = noheader; + s->w_bits = windowBits; + s->w_size = 1 << s->w_bits; + s->w_mask = s->w_size - 1; + + s->hash_bits = memLevel + 7; + s->hash_size = 1 << s->hash_bits; + s->hash_mask = s->hash_size - 1; + s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); + + s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte)); + s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos)); + s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos)); + + s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ + + overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2); + s->pending_buf = (uchf *) overlay; + s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); + + if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL || + s->pending_buf == Z_NULL) { + strm->msg = (char*)ERR_MSG(Z_MEM_ERROR); + deflateEnd (strm); + return Z_MEM_ERROR; + } + s->d_buf = overlay + s->lit_bufsize/sizeof(ush); + s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; + + s->level = level; + s->strategy = strategy; + s->method = (Byte)method; + + return deflateReset(strm); +} + +/* ========================================================================= */ +int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength) + z_streamp strm; + const Bytef *dictionary; + uInt dictLength; +{ + deflate_state *s; + uInt length = dictLength; + uInt n; + IPos hash_head = 0; + + if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL || + strm->state->status != INIT_STATE) return Z_STREAM_ERROR; + + s = strm->state; + strm->adler = adler32(strm->adler, dictionary, dictLength); + + if (length < MIN_MATCH) return Z_OK; + if (length > MAX_DIST(s)) { + length = MAX_DIST(s); +#ifndef USE_DICT_HEAD + dictionary += dictLength - length; /* use the tail of the dictionary */ +#endif + } + zmemcpy(s->window, dictionary, length); + s->strstart = length; + s->block_start = (long)length; + + /* Insert all strings in the hash table (except for the last two bytes). + * s->lookahead stays null, so s->ins_h will be recomputed at the next + * call of fill_window. + */ + s->ins_h = s->window[0]; + UPDATE_HASH(s, s->ins_h, s->window[1]); + for (n = 0; n <= length - MIN_MATCH; n++) { + INSERT_STRING(s, n, hash_head); + } + if (hash_head) hash_head = 0; /* to make compiler happy */ + return Z_OK; +} + +/* ========================================================================= */ +int ZEXPORT deflateReset (strm) + z_streamp strm; +{ + deflate_state *s; + + if (strm == Z_NULL || strm->state == Z_NULL || + strm->zalloc == Z_NULL || strm->zfree == Z_NULL) return Z_STREAM_ERROR; + + strm->total_in = strm->total_out = 0; + strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */ + strm->data_type = Z_UNKNOWN; + + s = (deflate_state *)strm->state; + s->pending = 0; + s->pending_out = s->pending_buf; + + if (s->noheader < 0) { + s->noheader = 0; /* was set to -1 by deflate(..., Z_FINISH); */ + } + s->status = s->noheader ? BUSY_STATE : INIT_STATE; + strm->adler = 1; + s->last_flush = Z_NO_FLUSH; + + _tr_init(s); + lm_init(s); + + return Z_OK; +} + +/* ========================================================================= */ +int ZEXPORT deflateParams(strm, level, strategy) + z_streamp strm; + int level; + int strategy; +{ + deflate_state *s; + compress_func func; + int err = Z_OK; + + if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR; + s = strm->state; + + if (level == Z_DEFAULT_COMPRESSION) { + level = 6; + } + if (level < 0 || level > 9 || strategy < 0 || strategy > Z_HUFFMAN_ONLY) { + return Z_STREAM_ERROR; + } + func = configuration_table[s->level].func; + + if (func != configuration_table[level].func && strm->total_in != 0) { + /* Flush the last buffer: */ + err = deflate(strm, Z_PARTIAL_FLUSH); + } + if (s->level != level) { + s->level = level; + s->max_lazy_match = configuration_table[level].max_lazy; + s->good_match = configuration_table[level].good_length; + s->nice_match = configuration_table[level].nice_length; + s->max_chain_length = configuration_table[level].max_chain; + } + s->strategy = strategy; + return err; +} + +/* ========================================================================= + * Put a short in the pending buffer. The 16-bit value is put in MSB order. + * IN assertion: the stream state is correct and there is enough room in + * pending_buf. + */ +local void putShortMSB (s, b) + deflate_state *s; + uInt b; +{ + put_byte(s, (Byte)(b >> 8)); + put_byte(s, (Byte)(b & 0xff)); +} + +/* ========================================================================= + * Flush as much pending output as possible. All deflate() output goes + * through this function so some applications may wish to modify it + * to avoid allocating a large strm->next_out buffer and copying into it. + * (See also read_buf()). + */ +local void flush_pending(strm) + z_streamp strm; +{ + unsigned len = strm->state->pending; + + if (len > strm->avail_out) len = strm->avail_out; + if (len == 0) return; + + zmemcpy(strm->next_out, strm->state->pending_out, len); + strm->next_out += len; + strm->state->pending_out += len; + strm->total_out += len; + strm->avail_out -= len; + strm->state->pending -= len; + if (strm->state->pending == 0) { + strm->state->pending_out = strm->state->pending_buf; + } +} + +/* ========================================================================= */ +int ZEXPORT deflate (strm, flush) + z_streamp strm; + int flush; +{ + int old_flush; /* value of flush param for previous deflate call */ + deflate_state *s; + + if (strm == Z_NULL || strm->state == Z_NULL || + flush > Z_FINISH || flush < 0) { + return Z_STREAM_ERROR; + } + s = strm->state; + + if (strm->next_out == Z_NULL || + (strm->next_in == Z_NULL && strm->avail_in != 0) || + (s->status == FINISH_STATE && flush != Z_FINISH)) { + ERR_RETURN(strm, Z_STREAM_ERROR); + } + if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR); + + s->strm = strm; /* just in case */ + old_flush = s->last_flush; + s->last_flush = flush; + + /* Write the zlib header */ + if (s->status == INIT_STATE) { + + uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8; + uInt level_flags = (s->level-1) >> 1; + + if (level_flags > 3) level_flags = 3; + header |= (level_flags << 6); + if (s->strstart != 0) header |= PRESET_DICT; + header += 31 - (header % 31); + + s->status = BUSY_STATE; + putShortMSB(s, header); + + /* Save the adler32 of the preset dictionary: */ + if (s->strstart != 0) { + putShortMSB(s, (uInt)(strm->adler >> 16)); + putShortMSB(s, (uInt)(strm->adler & 0xffff)); + } + strm->adler = 1L; + } + + /* Flush as much pending output as possible */ + if (s->pending != 0) { + flush_pending(strm); + if (strm->avail_out == 0) { + /* Since avail_out is 0, deflate will be called again with + * more output space, but possibly with both pending and + * avail_in equal to zero. There won't be anything to do, + * but this is not an error situation so make sure we + * return OK instead of BUF_ERROR at next call of deflate: + */ + s->last_flush = -1; + return Z_OK; + } + + /* Make sure there is something to do and avoid duplicate consecutive + * flushes. For repeated and useless calls with Z_FINISH, we keep + * returning Z_STREAM_END instead of Z_BUFF_ERROR. + */ + } else if (strm->avail_in == 0 && flush <= old_flush && + flush != Z_FINISH) { + ERR_RETURN(strm, Z_BUF_ERROR); + } + + /* User must not provide more input after the first FINISH: */ + if (s->status == FINISH_STATE && strm->avail_in != 0) { + ERR_RETURN(strm, Z_BUF_ERROR); + } + + /* Start a new block or continue the current one. + */ + if (strm->avail_in != 0 || s->lookahead != 0 || + (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) { + block_state bstate; + + bstate = (*(configuration_table[s->level].func))(s, flush); + + if (bstate == finish_started || bstate == finish_done) { + s->status = FINISH_STATE; + } + if (bstate == need_more || bstate == finish_started) { + if (strm->avail_out == 0) { + s->last_flush = -1; /* avoid BUF_ERROR next call, see above */ + } + return Z_OK; + /* If flush != Z_NO_FLUSH && avail_out == 0, the next call + * of deflate should use the same flush parameter to make sure + * that the flush is complete. So we don't have to output an + * empty block here, this will be done at next call. This also + * ensures that for a very small output buffer, we emit at most + * one empty block. + */ + } + if (bstate == block_done) { + if (flush == Z_PARTIAL_FLUSH) { + _tr_align(s); + } else { /* FULL_FLUSH or SYNC_FLUSH */ + _tr_stored_block(s, (char*)0, 0L, 0); + /* For a full flush, this empty block will be recognized + * as a special marker by inflate_sync(). + */ + if (flush == Z_FULL_FLUSH) { + CLEAR_HASH(s); /* forget history */ + } + } + flush_pending(strm); + if (strm->avail_out == 0) { + s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */ + return Z_OK; + } + } + } + Assert(strm->avail_out > 0, "bug2"); + + if (flush != Z_FINISH) return Z_OK; + if (s->noheader) return Z_STREAM_END; + + /* Write the zlib trailer (adler32) */ + putShortMSB(s, (uInt)(strm->adler >> 16)); + putShortMSB(s, (uInt)(strm->adler & 0xffff)); + flush_pending(strm); + /* If avail_out is zero, the application will call deflate again + * to flush the rest. + */ + s->noheader = -1; /* write the trailer only once! */ + return s->pending != 0 ? Z_OK : Z_STREAM_END; +} + +/* ========================================================================= */ +int ZEXPORT deflateEnd (strm) + z_streamp strm; +{ + int status; + + if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR; + + status = strm->state->status; + if (status != INIT_STATE && status != BUSY_STATE && + status != FINISH_STATE) { + return Z_STREAM_ERROR; + } + + /* Deallocate in reverse order of allocations: */ + TRY_FREE(strm, strm->state->pending_buf); + TRY_FREE(strm, strm->state->head); + TRY_FREE(strm, strm->state->prev); + TRY_FREE(strm, strm->state->window); + + ZFREE(strm, strm->state); + strm->state = Z_NULL; + + return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK; +} + +/* ========================================================================= + * Copy the source state to the destination state. + * To simplify the source, this is not supported for 16-bit MSDOS (which + * doesn't have enough memory anyway to duplicate compression states). + */ +int ZEXPORT deflateCopy (dest, source) + z_streamp dest; + z_streamp source; +{ +#ifdef MAXSEG_64K + return Z_STREAM_ERROR; +#else + deflate_state *ds; + deflate_state *ss; + ushf *overlay; + + + if (source == Z_NULL || dest == Z_NULL || source->state == Z_NULL) { + return Z_STREAM_ERROR; + } + + ss = source->state; + + *dest = *source; + + ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state)); + if (ds == Z_NULL) return Z_MEM_ERROR; + dest->state = (struct internal_state FAR *) ds; + *ds = *ss; + ds->strm = dest; + + ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte)); + ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos)); + ds->head = (Posf *) ZALLOC(dest, ds->hash_size, sizeof(Pos)); + overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2); + ds->pending_buf = (uchf *) overlay; + + if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL || + ds->pending_buf == Z_NULL) { + deflateEnd (dest); + return Z_MEM_ERROR; + } + /* following zmemcpy do not work for 16-bit MSDOS */ + zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte)); + zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos)); + zmemcpy(ds->head, ss->head, ds->hash_size * sizeof(Pos)); + zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size); + + ds->pending_out = ds->pending_buf + (ss->pending_out - ss->pending_buf); + ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush); + ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize; + + ds->l_desc.dyn_tree = ds->dyn_ltree; + ds->d_desc.dyn_tree = ds->dyn_dtree; + ds->bl_desc.dyn_tree = ds->bl_tree; + + return Z_OK; +#endif +} + +/* =========================================================================== + * Read a new buffer from the current input stream, update the adler32 + * and total number of bytes read. All deflate() input goes through + * this function so some applications may wish to modify it to avoid + * allocating a large strm->next_in buffer and copying from it. + * (See also flush_pending()). + */ +local int read_buf(strm, buf, size) + z_streamp strm; + Bytef *buf; + unsigned size; +{ + unsigned len = strm->avail_in; + + if (len > size) len = size; + if (len == 0) return 0; + + strm->avail_in -= len; + + if (!strm->state->noheader) { + strm->adler = adler32(strm->adler, strm->next_in, len); + } + zmemcpy(buf, strm->next_in, len); + strm->next_in += len; + strm->total_in += len; + + return (int)len; +} + +/* =========================================================================== + * Initialize the "longest match" routines for a new zlib stream + */ +local void lm_init (s) + deflate_state *s; +{ + s->window_size = (ulg)2L*s->w_size; + + CLEAR_HASH(s); + + /* Set the default configuration parameters: + */ + s->max_lazy_match = configuration_table[s->level].max_lazy; + s->good_match = configuration_table[s->level].good_length; + s->nice_match = configuration_table[s->level].nice_length; + s->max_chain_length = configuration_table[s->level].max_chain; + + s->strstart = 0; + s->block_start = 0L; + s->lookahead = 0; + s->match_length = s->prev_length = MIN_MATCH-1; + s->match_available = 0; + s->ins_h = 0; +#ifdef ASMV + match_init(); /* initialize the asm code */ +#endif +} + +/* =========================================================================== + * Set match_start to the longest match starting at the given string and + * return its length. Matches shorter or equal to prev_length are discarded, + * in which case the result is equal to prev_length and match_start is + * garbage. + * IN assertions: cur_match is the head of the hash chain for the current + * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 + * OUT assertion: the match length is not greater than s->lookahead. + */ +#ifndef ASMV +/* For 80x86 and 680x0, an optimized version will be provided in match.asm or + * match.S. The code will be functionally equivalent. + */ +#ifndef FASTEST +local uInt longest_match(s, cur_match) + deflate_state *s; + IPos cur_match; /* current match */ +{ + unsigned chain_length = s->max_chain_length;/* max hash chain length */ + register Bytef *scan = s->window + s->strstart; /* current string */ + register Bytef *match; /* matched string */ + register int len; /* length of current match */ + int best_len = s->prev_length; /* best match length so far */ + int nice_match = s->nice_match; /* stop if match long enough */ + IPos limit = s->strstart > (IPos)MAX_DIST(s) ? + s->strstart - (IPos)MAX_DIST(s) : NIL; + /* Stop when cur_match becomes <= limit. To simplify the code, + * we prevent matches with the string of window index 0. + */ + Posf *prev = s->prev; + uInt wmask = s->w_mask; + +#ifdef UNALIGNED_OK + /* Compare two bytes at a time. Note: this is not always beneficial. + * Try with and without -DUNALIGNED_OK to check. + */ + register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; + register ush scan_start = *(ushf*)scan; + register ush scan_end = *(ushf*)(scan+best_len-1); +#else + register Bytef *strend = s->window + s->strstart + MAX_MATCH; + register Byte scan_end1 = scan[best_len-1]; + register Byte scan_end = scan[best_len]; +#endif + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + /* Do not waste too much time if we already have a good match: */ + if (s->prev_length >= s->good_match) { + chain_length >>= 2; + } + /* Do not look for matches beyond the end of the input. This is necessary + * to make deflate deterministic. + */ + if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead; + + Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + do { + Assert(cur_match < s->strstart, "no future"); + match = s->window + cur_match; + + /* Skip to next match if the match length cannot increase + * or if the match length is less than 2: + */ +#if (defined(UNALIGNED_OK) && MAX_MATCH == 258) + /* This code assumes sizeof(unsigned short) == 2. Do not use + * UNALIGNED_OK if your compiler uses a different size. + */ + if (*(ushf*)(match+best_len-1) != scan_end || + *(ushf*)match != scan_start) continue; + + /* It is not necessary to compare scan[2] and match[2] since they are + * always equal when the other bytes match, given that the hash keys + * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at + * strstart+3, +5, ... up to strstart+257. We check for insufficient + * lookahead only every 4th comparison; the 128th check will be made + * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is + * necessary to put more guard bytes at the end of the window, or + * to check more often for insufficient lookahead. + */ + Assert(scan[2] == match[2], "scan[2]?"); + scan++, match++; + do { + } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) && + *(ushf*)(scan+=2) == *(ushf*)(match+=2) && + *(ushf*)(scan+=2) == *(ushf*)(match+=2) && + *(ushf*)(scan+=2) == *(ushf*)(match+=2) && + scan < strend); + /* The funny "do {}" generates better code on most compilers */ + + /* Here, scan <= window+strstart+257 */ + Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + if (*scan == *match) scan++; + + len = (MAX_MATCH - 1) - (int)(strend-scan); + scan = strend - (MAX_MATCH-1); + +#else /* UNALIGNED_OK */ + + if (match[best_len] != scan_end || + match[best_len-1] != scan_end1 || + *match != *scan || + *++match != scan[1]) continue; + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2, match++; + Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + } while (*++scan == *++match && *++scan == *++match && + *++scan == *++match && *++scan == *++match && + *++scan == *++match && *++scan == *++match && + *++scan == *++match && *++scan == *++match && + scan < strend); + + Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (int)(strend - scan); + scan = strend - MAX_MATCH; + +#endif /* UNALIGNED_OK */ + + if (len > best_len) { + s->match_start = cur_match; + best_len = len; + if (len >= nice_match) break; +#ifdef UNALIGNED_OK + scan_end = *(ushf*)(scan+best_len-1); +#else + scan_end1 = scan[best_len-1]; + scan_end = scan[best_len]; +#endif + } + } while ((cur_match = prev[cur_match & wmask]) > limit + && --chain_length != 0); + + if ((uInt)best_len <= s->lookahead) return (uInt)best_len; + return s->lookahead; +} + +#else /* FASTEST */ +/* --------------------------------------------------------------------------- + * Optimized version for level == 1 only + */ +local uInt longest_match(s, cur_match) + deflate_state *s; + IPos cur_match; /* current match */ +{ + register Bytef *scan = s->window + s->strstart; /* current string */ + register Bytef *match; /* matched string */ + register int len; /* length of current match */ + register Bytef *strend = s->window + s->strstart + MAX_MATCH; + + /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. + * It is easy to get rid of this optimization if necessary. + */ + Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); + + Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); + + Assert(cur_match < s->strstart, "no future"); + + match = s->window + cur_match; + + /* Return failure if the match length is less than 2: + */ + if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1; + + /* The check at best_len-1 can be removed because it will be made + * again later. (This heuristic is not always a win.) + * It is not necessary to compare scan[2] and match[2] since they + * are always equal when the other bytes match, given that + * the hash keys are equal and that HASH_BITS >= 8. + */ + scan += 2, match += 2; + Assert(*scan == *match, "match[2]?"); + + /* We check for insufficient lookahead only every 8th comparison; + * the 256th check will be made at strstart+258. + */ + do { + } while (*++scan == *++match && *++scan == *++match && + *++scan == *++match && *++scan == *++match && + *++scan == *++match && *++scan == *++match && + *++scan == *++match && *++scan == *++match && + scan < strend); + + Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); + + len = MAX_MATCH - (int)(strend - scan); + + if (len < MIN_MATCH) return MIN_MATCH - 1; + + s->match_start = cur_match; + return len <= s->lookahead ? len : s->lookahead; +} +#endif /* FASTEST */ +#endif /* ASMV */ + +#ifdef DEBUG +/* =========================================================================== + * Check that the match at match_start is indeed a match. + */ +local void check_match(s, start, match, length) + deflate_state *s; + IPos start, match; + int length; +{ + /* check that the match is indeed a match */ + if (zmemcmp(s->window + match, + s->window + start, length) != EQUAL) { + fprintf(stderr, " start %u, match %u, length %d\n", + start, match, length); + do { + fprintf(stderr, "%c%c", s->window[match++], s->window[start++]); + } while (--length != 0); + z_error("invalid match"); + } + if (z_verbose > 1) { + fprintf(stderr,"\\[%d,%d]", start-match, length); + do { putc(s->window[start++], stderr); } while (--length != 0); + } +} +#else +# define check_match(s, start, match, length) +#endif + +/* =========================================================================== + * Fill the window when the lookahead becomes insufficient. + * Updates strstart and lookahead. + * + * IN assertion: lookahead < MIN_LOOKAHEAD + * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD + * At least one byte has been read, or avail_in == 0; reads are + * performed for at least two bytes (required for the zip translate_eol + * option -- not supported here). + */ +local void fill_window(s) + deflate_state *s; +{ + register unsigned n, m; + register Posf *p; + unsigned more; /* Amount of free space at the end of the window. */ + uInt wsize = s->w_size; + + do { + more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart); + + /* Deal with !@#$% 64K limit: */ + if (more == 0 && s->strstart == 0 && s->lookahead == 0) { + more = wsize; + + } else if (more == (unsigned)(-1)) { + /* Very unlikely, but possible on 16 bit machine if strstart == 0 + * and lookahead == 1 (input done one byte at time) + */ + more--; + + /* 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. + */ + } else if (s->strstart >= wsize+MAX_DIST(s)) { + + zmemcpy(s->window, s->window+wsize, (unsigned)wsize); + s->match_start -= wsize; + s->strstart -= wsize; /* we now have strstart >= MAX_DIST */ + s->block_start -= (long) wsize; + + /* Slide the hash table (could be avoided with 32 bit values + at the expense of memory usage). We slide even when level == 0 + to keep the hash table consistent if we switch back to level > 0 + later. (Using level 0 permanently is not an optimal usage of + zlib, so we don't care about this pathological case.) + */ + n = s->hash_size; + p = &s->head[n]; + do { + m = *--p; + *p = (Pos)(m >= wsize ? m-wsize : NIL); + } while (--n); + + n = wsize; +#ifndef FASTEST + p = &s->prev[n]; + do { + m = *--p; + *p = (Pos)(m >= wsize ? m-wsize : NIL); + /* If n is not on any hash chain, prev[n] is garbage but + * its value will never be used. + */ + } while (--n); +#endif + more += wsize; + } + if (s->strm->avail_in == 0) return; + + /* If there was no sliding: + * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && + * more == window_size - lookahead - strstart + * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) + * => more >= window_size - 2*WSIZE + 2 + * In the BIG_MEM or MMAP case (not yet supported), + * window_size == input_size + MIN_LOOKAHEAD && + * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. + * Otherwise, window_size == 2*WSIZE so more >= 2. + * If there was sliding, more >= WSIZE. So in all cases, more >= 2. + */ + Assert(more >= 2, "more < 2"); + + n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more); + s->lookahead += n; + + /* Initialize the hash value now that we have some input: */ + if (s->lookahead >= MIN_MATCH) { + s->ins_h = s->window[s->strstart]; + UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]); +#if MIN_MATCH != 3 + Call UPDATE_HASH() MIN_MATCH-3 more times +#endif + } + /* 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); +} + +/* =========================================================================== + * Flush the current block, with given end-of-file flag. + * IN assertion: strstart is set to the end of the current match. + */ +#define FLUSH_BLOCK_ONLY(s, eof) { \ + _tr_flush_block(s, (s->block_start >= 0L ? \ + (charf *)&s->window[(unsigned)s->block_start] : \ + (charf *)Z_NULL), \ + (ulg)((long)s->strstart - s->block_start), \ + (eof)); \ + s->block_start = s->strstart; \ + flush_pending(s->strm); \ + Tracev((stderr,"[FLUSH]")); \ +} + +/* Same but force premature exit if necessary. */ +#define FLUSH_BLOCK(s, eof) { \ + FLUSH_BLOCK_ONLY(s, eof); \ + if (s->strm->avail_out == 0) return (eof) ? finish_started : need_more; \ +} + +/* =========================================================================== + * Copy without compression as much as possible from the input stream, return + * the current block state. + * This function does not insert new strings in the dictionary since + * uncompressible data is probably not useful. This function is used + * only for the level=0 compression option. + * NOTE: this function should be optimized to avoid extra copying from + * window to pending_buf. + */ +local block_state deflate_stored(s, flush) + deflate_state *s; + int flush; +{ + /* Stored blocks are limited to 0xffff bytes, pending_buf is limited + * to pending_buf_size, and each stored block has a 5 byte header: + */ + ulg max_block_size = 0xffff; + ulg max_start; + + if (max_block_size > s->pending_buf_size - 5) { + max_block_size = s->pending_buf_size - 5; + } + + /* Copy as much as possible from input to output: */ + for (;;) { + /* Fill the window as much as possible: */ + if (s->lookahead <= 1) { + + Assert(s->strstart < s->w_size+MAX_DIST(s) || + s->block_start >= (long)s->w_size, "slide too late"); + + fill_window(s); + if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more; + + if (s->lookahead == 0) break; /* flush the current block */ + } + Assert(s->block_start >= 0L, "block gone"); + + s->strstart += s->lookahead; + s->lookahead = 0; + + /* Emit a stored block if pending_buf will be full: */ + max_start = s->block_start + max_block_size; + if (s->strstart == 0 || (ulg)s->strstart >= max_start) { + /* strstart == 0 is possible when wraparound on 16-bit machine */ + s->lookahead = (uInt)(s->strstart - max_start); + s->strstart = (uInt)max_start; + FLUSH_BLOCK(s, 0); + } + /* Flush if we may have to slide, otherwise block_start may become + * negative and the data will be gone: + */ + if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) { + FLUSH_BLOCK(s, 0); + } + } + FLUSH_BLOCK(s, flush == Z_FINISH); + return flush == Z_FINISH ? finish_done : block_done; +} + +/* =========================================================================== + * Compress as much as possible from the input stream, return the current + * block state. + * This function does not perform lazy evaluation of matches and inserts + * new strings in the dictionary only for unmatched strings or for short + * matches. It is used only for the fast compression options. + */ +local block_state deflate_fast(s, flush) + deflate_state *s; + int flush; +{ + IPos hash_head = NIL; /* head of the hash chain */ + int bflush; /* set if current block must be flushed */ + + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s->lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { + return need_more; + } + if (s->lookahead == 0) break; /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + if (s->lookahead >= MIN_MATCH) { + INSERT_STRING(s, s->strstart, hash_head); + } + + /* Find the longest match, discarding those <= prev_length. + * At this point we have always match_length < MIN_MATCH + */ + if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + if (s->strategy != Z_HUFFMAN_ONLY) { + s->match_length = longest_match (s, hash_head); + } + /* longest_match() sets match_start */ + } + if (s->match_length >= MIN_MATCH) { + check_match(s, s->strstart, s->match_start, s->match_length); + + _tr_tally_dist(s, s->strstart - s->match_start, + s->match_length - MIN_MATCH, bflush); + + s->lookahead -= s->match_length; + + /* Insert new strings in the hash table only if the match length + * is not too large. This saves time but degrades compression. + */ +#ifndef FASTEST + if (s->match_length <= s->max_insert_length && + s->lookahead >= MIN_MATCH) { + s->match_length--; /* string at strstart already in hash table */ + do { + s->strstart++; + INSERT_STRING(s, s->strstart, hash_head); + /* strstart never exceeds WSIZE-MAX_MATCH, so there are + * always MIN_MATCH bytes ahead. + */ + } while (--s->match_length != 0); + s->strstart++; + } else +#endif + { + s->strstart += s->match_length; + s->match_length = 0; + s->ins_h = s->window[s->strstart]; + UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]); +#if MIN_MATCH != 3 + Call UPDATE_HASH() MIN_MATCH-3 more times +#endif + /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not + * matter since it will be recomputed at next deflate call. + */ + } + } else { + /* No match, output a literal byte */ + Tracevv((stderr,"%c", s->window[s->strstart])); + _tr_tally_lit (s, s->window[s->strstart], bflush); + s->lookahead--; + s->strstart++; + } + if (bflush) FLUSH_BLOCK(s, 0); + } + FLUSH_BLOCK(s, flush == Z_FINISH); + return flush == Z_FINISH ? finish_done : block_done; +} + +/* =========================================================================== + * Same as above, but achieves better compression. We use a lazy + * evaluation for matches: a match is finally adopted only if there is + * no better match at the next window position. + */ +local block_state deflate_slow(s, flush) + deflate_state *s; + int flush; +{ + IPos hash_head = NIL; /* head of hash chain */ + int bflush; /* set if current block must be flushed */ + + /* Process the input block. */ + for (;;) { + /* Make sure that we always have enough lookahead, except + * at the end of the input file. We need MAX_MATCH bytes + * for the next match, plus MIN_MATCH bytes to insert the + * string following the next match. + */ + if (s->lookahead < MIN_LOOKAHEAD) { + fill_window(s); + if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) { + return need_more; + } + if (s->lookahead == 0) break; /* flush the current block */ + } + + /* Insert the string window[strstart .. strstart+2] in the + * dictionary, and set hash_head to the head of the hash chain: + */ + if (s->lookahead >= MIN_MATCH) { + INSERT_STRING(s, s->strstart, hash_head); + } + + /* Find the longest match, discarding those <= prev_length. + */ + s->prev_length = s->match_length, s->prev_match = s->match_start; + s->match_length = MIN_MATCH-1; + + if (hash_head != NIL && s->prev_length < s->max_lazy_match && + s->strstart - hash_head <= MAX_DIST(s)) { + /* To simplify the code, we prevent matches with the string + * of window index 0 (in particular we have to avoid a match + * of the string with itself at the start of the input file). + */ + if (s->strategy != Z_HUFFMAN_ONLY) { + s->match_length = longest_match (s, hash_head); + } + /* longest_match() sets match_start */ + + if (s->match_length <= 5 && (s->strategy == Z_FILTERED || + (s->match_length == MIN_MATCH && + s->strstart - s->match_start > TOO_FAR))) { + + /* If prev_match is also MIN_MATCH, match_start is garbage + * but we will ignore the current match anyway. + */ + s->match_length = MIN_MATCH-1; + } + } + /* If there was a match at the previous step and the current + * match is not better, output the previous match: + */ + if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) { + uInt max_insert = s->strstart + s->lookahead - MIN_MATCH; + /* Do not insert strings in hash table beyond this. */ + + check_match(s, s->strstart-1, s->prev_match, s->prev_length); + + _tr_tally_dist(s, s->strstart -1 - s->prev_match, + s->prev_length - MIN_MATCH, bflush); + + /* Insert in hash table all strings up to the end of the match. + * strstart-1 and strstart are already inserted. If there is not + * enough lookahead, the last two strings are not inserted in + * the hash table. + */ + s->lookahead -= s->prev_length-1; + s->prev_length -= 2; + do { + if (++s->strstart <= max_insert) { + INSERT_STRING(s, s->strstart, hash_head); + } + } while (--s->prev_length != 0); + s->match_available = 0; + s->match_length = MIN_MATCH-1; + s->strstart++; + + if (bflush) FLUSH_BLOCK(s, 0); + + } else if (s->match_available) { + /* If there was no match at the previous position, output a + * single literal. If there was a match but the current match + * is longer, truncate the previous match to a single literal. + */ + Tracevv((stderr,"%c", s->window[s->strstart-1])); + _tr_tally_lit(s, s->window[s->strstart-1], bflush); + if (bflush) { + FLUSH_BLOCK_ONLY(s, 0); + } + s->strstart++; + s->lookahead--; + if (s->strm->avail_out == 0) return need_more; + } else { + /* There is no previous match to compare with, wait for + * the next step to decide. + */ + s->match_available = 1; + s->strstart++; + s->lookahead--; + } + } + Assert (flush != Z_NO_FLUSH, "no flush?"); + if (s->match_available) { + Tracevv((stderr,"%c", s->window[s->strstart-1])); + _tr_tally_lit(s, s->window[s->strstart-1], bflush); + s->match_available = 0; + } + FLUSH_BLOCK(s, flush == Z_FINISH); + return flush == Z_FINISH ? finish_done : block_done; +} diff --git a/ziplib/deflate.h b/ziplib/deflate.h new file mode 100644 index 0000000..c5958df --- /dev/null +++ b/ziplib/deflate.h @@ -0,0 +1,318 @@ +/* deflate.h -- internal compression state + * Copyright (C) 1995-2002 Jean-loup Gailly + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* WARNING: this file should *not* be used by applications. It is + part of the implementation of the compression library and is + subject to change. Applications should only use zlib.h. + */ + +/* @(#) $Id$ */ + +#ifndef _DEFLATE_H +#define _DEFLATE_H + +#include "zutil.h" + +/* =========================================================================== + * Internal compression state. + */ + +#define LENGTH_CODES 29 +/* number of length codes, not counting the special END_BLOCK code */ + +#define LITERALS 256 +/* number of literal bytes 0..255 */ + +#define L_CODES (LITERALS+1+LENGTH_CODES) +/* number of Literal or Length codes, including the END_BLOCK code */ + +#define D_CODES 30 +/* number of distance codes */ + +#define BL_CODES 19 +/* number of codes used to transfer the bit lengths */ + +#define HEAP_SIZE (2*L_CODES+1) +/* maximum heap size */ + +#define MAX_BITS 15 +/* All codes must not exceed MAX_BITS bits */ + +#define INIT_STATE 42 +#define BUSY_STATE 113 +#define FINISH_STATE 666 +/* Stream status */ + + +/* Data structure describing a single value and its code string. */ +typedef struct ct_data_s { + union { + ush freq; /* frequency count */ + ush code; /* bit string */ + } fc; + union { + ush dad; /* father node in Huffman tree */ + ush len; /* length of bit string */ + } dl; +} FAR ct_data; + +#define Freq fc.freq +#define Code fc.code +#define Dad dl.dad +#define Len dl.len + +typedef struct static_tree_desc_s static_tree_desc; + +typedef struct tree_desc_s { + ct_data *dyn_tree; /* the dynamic tree */ + int max_code; /* largest code with non zero frequency */ + static_tree_desc *stat_desc; /* the corresponding static tree */ +} FAR tree_desc; + +typedef ush Pos; +typedef Pos FAR Posf; +typedef unsigned IPos; + +/* A Pos is an index in the character window. We use short instead of int to + * save space in the various tables. IPos is used only for parameter passing. + */ + +typedef struct internal_state { + z_streamp strm; /* pointer back to this zlib stream */ + int status; /* as the name implies */ + Bytef *pending_buf; /* output still pending */ + ulg pending_buf_size; /* size of pending_buf */ + Bytef *pending_out; /* next pending byte to output to the stream */ + int pending; /* nb of bytes in the pending buffer */ + int noheader; /* suppress zlib header and adler32 */ + Byte data_type; /* UNKNOWN, BINARY or ASCII */ + Byte method; /* STORED (for zip only) or DEFLATED */ + int last_flush; /* value of flush param for previous deflate call */ + + /* used by deflate.c: */ + + uInt w_size; /* LZ77 window size (32K by default) */ + uInt w_bits; /* log2(w_size) (8..16) */ + uInt w_mask; /* w_size - 1 */ + + Bytef *window; + /* Sliding window. Input bytes are read into the second half of the window, + * and move to the first half later to keep a dictionary of at least wSize + * bytes. With this organization, matches are limited to a distance of + * wSize-MAX_MATCH bytes, but this ensures that IO is always + * performed with a length multiple of the block size. Also, it limits + * the window size to 64K, which is quite useful on MSDOS. + * To do: use the user input buffer as sliding window. + */ + + ulg window_size; + /* Actual size of window: 2*wSize, except when the user input buffer + * is directly used as sliding window. + */ + + Posf *prev; + /* Link to older string with same hash index. To limit the size of this + * array to 64K, this link is maintained only for the last 32K strings. + * An index in this array is thus a window index modulo 32K. + */ + + Posf *head; /* Heads of the hash chains or NIL. */ + + uInt ins_h; /* hash index of string to be inserted */ + uInt hash_size; /* number of elements in hash table */ + uInt hash_bits; /* log2(hash_size) */ + uInt hash_mask; /* hash_size-1 */ + + uInt hash_shift; + /* Number of bits by which ins_h must be shifted at each input + * step. It must be such that after MIN_MATCH steps, the oldest + * byte no longer takes part in the hash key, that is: + * hash_shift * MIN_MATCH >= hash_bits + */ + + long block_start; + /* Window position at the beginning of the current output block. Gets + * negative when the window is moved backwards. + */ + + uInt match_length; /* length of best match */ + IPos prev_match; /* previous match */ + int match_available; /* set if previous match exists */ + uInt strstart; /* start of string to insert */ + uInt match_start; /* start of matching string */ + uInt lookahead; /* number of valid bytes ahead in window */ + + uInt prev_length; + /* Length of the best match at previous step. Matches not greater than this + * are discarded. This is used in the lazy match evaluation. + */ + + uInt max_chain_length; + /* To speed up deflation, hash chains are never searched beyond this + * length. A higher limit improves compression ratio but degrades the + * speed. + */ + + uInt max_lazy_match; + /* Attempt to find a better match only when the current match is strictly + * smaller than this value. This mechanism is used only for compression + * levels >= 4. + */ +# define max_insert_length max_lazy_match + /* Insert new strings in the hash table only if the match length is not + * greater than this length. This saves time but degrades compression. + * max_insert_length is used only for compression levels <= 3. + */ + + int level; /* compression level (1..9) */ + int strategy; /* favor or force Huffman coding*/ + + uInt good_match; + /* Use a faster search when the previous match is longer than this */ + + int nice_match; /* Stop searching when current match exceeds this */ + + /* used by trees.c: */ + /* Didn't use ct_data typedef below to supress compiler warning */ + struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ + struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ + struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ + + struct tree_desc_s l_desc; /* desc. for literal tree */ + struct tree_desc_s d_desc; /* desc. for distance tree */ + struct tree_desc_s bl_desc; /* desc. for bit length tree */ + + ush bl_count[MAX_BITS+1]; + /* number of codes at each bit length for an optimal tree */ + + int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ + int heap_len; /* number of elements in the heap */ + int heap_max; /* element of largest frequency */ + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. + * The same heap array is used to build all trees. + */ + + uch depth[2*L_CODES+1]; + /* Depth of each subtree used as tie breaker for trees of equal frequency + */ + + uchf *l_buf; /* buffer for literals or lengths */ + + uInt lit_bufsize; + /* Size of match buffer for literals/lengths. There are 4 reasons for + * limiting lit_bufsize to 64K: + * - frequencies can be kept in 16 bit counters + * - if compression is not successful for the first block, all input + * data is still in the window so we can still emit a stored block even + * when input comes from standard input. (This can also be done for + * all blocks if lit_bufsize is not greater than 32K.) + * - if compression is not successful for a file smaller than 64K, we can + * even emit a stored file instead of a stored block (saving 5 bytes). + * This is applicable only for zip (not gzip or zlib). + * - creating new Huffman trees less frequently may not provide fast + * adaptation to changes in the input data statistics. (Take for + * example a binary file with poorly compressible code followed by + * a highly compressible string table.) Smaller buffer sizes give + * fast adaptation but have of course the overhead of transmitting + * trees more frequently. + * - I can't count above 4 + */ + + uInt last_lit; /* running index in l_buf */ + + ushf *d_buf; + /* Buffer for distances. To simplify the code, d_buf and l_buf have + * the same number of elements. To use different lengths, an extra flag + * array would be necessary. + */ + + ulg opt_len; /* bit length of current block with optimal trees */ + ulg static_len; /* bit length of current block with static trees */ + uInt matches; /* number of string matches in current block */ + int last_eob_len; /* bit length of EOB code for last block */ + +#ifdef DEBUG + ulg compressed_len; /* total bit length of compressed file mod 2^32 */ + ulg bits_sent; /* bit length of compressed data sent mod 2^32 */ +#endif + + ush bi_buf; + /* Output buffer. bits are inserted starting at the bottom (least + * significant bits). + */ + int bi_valid; + /* Number of valid bits in bi_buf. All bits above the last valid bit + * are always zero. + */ + +} FAR deflate_state; + +/* Output a byte on the stream. + * IN assertion: there is enough room in pending_buf. + */ +#define put_byte(s, c) {s->pending_buf[s->pending++] = (c);} + + +#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) +/* Minimum amount of lookahead, except at the end of the input file. + * See deflate.c for comments about the MIN_MATCH+1. + */ + +#define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD) +/* In order to simplify the code, particularly on 16 bit machines, match + * distances are limited to MAX_DIST instead of WSIZE. + */ + + /* in trees.c */ +void _tr_init OF((deflate_state *s)); +int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc)); +void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len, + int eof)); +void _tr_align OF((deflate_state *s)); +void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len, + int eof)); + +#define d_code(dist) \ + ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)]) +/* Mapping from a distance to a distance code. dist is the distance - 1 and + * must not have side effects. _dist_code[256] and _dist_code[257] are never + * used. + */ + +#ifndef DEBUG +/* Inline versions of _tr_tally for speed: */ + +#if defined(GEN_TREES_H) || !defined(STDC) + extern uch _length_code[]; + extern uch _dist_code[]; +#else + extern const uch _length_code[]; + extern const uch _dist_code[]; +#endif + +# define _tr_tally_lit(s, c, flush) \ + { uch cc = (c); \ + s->d_buf[s->last_lit] = 0; \ + s->l_buf[s->last_lit++] = cc; \ + s->dyn_ltree[cc].Freq++; \ + flush = (s->last_lit == s->lit_bufsize-1); \ + } +# define _tr_tally_dist(s, distance, length, flush) \ + { uch len = (length); \ + ush dist = (distance); \ + s->d_buf[s->last_lit] = dist; \ + s->l_buf[s->last_lit++] = len; \ + dist--; \ + s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \ + s->dyn_dtree[d_code(dist)].Freq++; \ + flush = (s->last_lit == s->lit_bufsize-1); \ + } +#else +# define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c) +# define _tr_tally_dist(s, distance, length, flush) \ + flush = _tr_tally(s, distance, length) +#endif + +#endif diff --git a/ziplib/gzio.c b/ziplib/gzio.c new file mode 100644 index 0000000..da73c0f --- /dev/null +++ b/ziplib/gzio.c @@ -0,0 +1,875 @@ +/* gzio.c -- IO on .gz files + * Copyright (C) 1995-2002 Jean-loup Gailly. + * For conditions of distribution and use, see copyright notice in zlib.h + * + * Compile this file with -DNO_DEFLATE to avoid the compression code. + */ + +/* @(#) $Id$ */ + +#include + +#include "zutil.h" + +struct internal_state {int dummy;}; /* for buggy compilers */ + +#ifndef Z_BUFSIZE +# ifdef MAXSEG_64K +# define Z_BUFSIZE 4096 /* minimize memory usage for 16-bit DOS */ +# else +# define Z_BUFSIZE 16384 +# endif +#endif +#ifndef Z_PRINTF_BUFSIZE +# define Z_PRINTF_BUFSIZE 4096 +#endif + +#define ALLOC(size) malloc(size) +#define TRYFREE(p) {if (p) free(p);} + +static int gz_magic[2] = {0x1f, 0x8b}; /* gzip magic header */ + +/* gzip flag byte */ +#define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */ +#define HEAD_CRC 0x02 /* bit 1 set: header CRC present */ +#define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */ +#define ORIG_NAME 0x08 /* bit 3 set: original file name present */ +#define COMMENT 0x10 /* bit 4 set: file comment present */ +#define RESERVED 0xE0 /* bits 5..7: reserved */ + +typedef struct gz_stream { + z_stream stream; + int z_err; /* error code for last stream operation */ + int z_eof; /* set if end of input file */ + FILE *file; /* .gz file */ + Byte *inbuf; /* input buffer */ + Byte *outbuf; /* output buffer */ + uLong crc; /* crc32 of uncompressed data */ + char *msg; /* error message */ + char *path; /* path name for debugging only */ + int transparent; /* 1 if input file is not a .gz file */ + char mode; /* 'w' or 'r' */ + long startpos; /* start of compressed data in file (header skipped) */ +} gz_stream; + + +local gzFile gz_open OF((const char *path, const char *mode, int fd)); +local int do_flush OF((gzFile file, int flush)); +local int get_byte OF((gz_stream *s)); +local void check_header OF((gz_stream *s)); +local int destroy OF((gz_stream *s)); +local void putLong OF((FILE *file, uLong x)); +local uLong getLong OF((gz_stream *s)); + +/* =========================================================================== + Opens a gzip (.gz) file for reading or writing. The mode parameter + is as in fopen ("rb" or "wb"). The file is given either by file descriptor + or path name (if fd == -1). + gz_open return NULL if the file could not be opened or if there was + insufficient memory to allocate the (de)compression state; errno + can be checked to distinguish the two cases (if errno is zero, the + zlib error is Z_MEM_ERROR). +*/ +local gzFile gz_open (path, mode, fd) + const char *path; + const char *mode; + int fd; +{ + int err; + int level = Z_DEFAULT_COMPRESSION; /* compression level */ + int strategy = Z_DEFAULT_STRATEGY; /* compression strategy */ + char *p = (char*)mode; + gz_stream *s; + char fmode[80]; /* copy of mode, without the compression level */ + char *m = fmode; + + if (!path || !mode) return Z_NULL; + + s = (gz_stream *)ALLOC(sizeof(gz_stream)); + if (!s) return Z_NULL; + + s->stream.zalloc = (alloc_func)0; + s->stream.zfree = (free_func)0; + s->stream.opaque = (voidpf)0; + s->stream.next_in = s->inbuf = Z_NULL; + s->stream.next_out = s->outbuf = Z_NULL; + s->stream.avail_in = s->stream.avail_out = 0; + s->file = NULL; + s->z_err = Z_OK; + s->z_eof = 0; + s->crc = crc32(0L, Z_NULL, 0); + s->msg = NULL; + s->transparent = 0; + + s->path = (char*)ALLOC(strlen(path)+1); + if (s->path == NULL) { + return destroy(s), (gzFile)Z_NULL; + } + strcpy(s->path, path); /* do this early for debugging */ + + s->mode = '\0'; + do { + if (*p == 'r') s->mode = 'r'; + if (*p == 'w' || *p == 'a') s->mode = 'w'; + if (*p >= '0' && *p <= '9') { + level = *p - '0'; + } else if (*p == 'f') { + strategy = Z_FILTERED; + } else if (*p == 'h') { + strategy = Z_HUFFMAN_ONLY; + } else { + *m++ = *p; /* copy the mode */ + } + } while (*p++ && m != fmode + sizeof(fmode)); + if (s->mode == '\0') return destroy(s), (gzFile)Z_NULL; + + if (s->mode == 'w') { +#ifdef NO_DEFLATE + err = Z_STREAM_ERROR; +#else + err = deflateInit2(&(s->stream), level, + Z_DEFLATED, -MAX_WBITS, DEF_MEM_LEVEL, strategy); + /* windowBits is passed < 0 to suppress zlib header */ + + s->stream.next_out = s->outbuf = (Byte*)ALLOC(Z_BUFSIZE); +#endif + if (err != Z_OK || s->outbuf == Z_NULL) { + return destroy(s), (gzFile)Z_NULL; + } + } else { + s->stream.next_in = s->inbuf = (Byte*)ALLOC(Z_BUFSIZE); + + err = inflateInit2(&(s->stream), -MAX_WBITS); + /* windowBits is passed < 0 to tell that there is no zlib header. + * Note that in this case inflate *requires* an extra "dummy" byte + * after the compressed stream in order to complete decompression and + * return Z_STREAM_END. Here the gzip CRC32 ensures that 4 bytes are + * present after the compressed stream. + */ + if (err != Z_OK || s->inbuf == Z_NULL) { + return destroy(s), (gzFile)Z_NULL; + } + } + s->stream.avail_out = Z_BUFSIZE; + + errno = 0; + s->file = fd < 0 ? F_OPEN(path, fmode) : (FILE*)fdopen(fd, fmode); + + if (s->file == NULL) { + return destroy(s), (gzFile)Z_NULL; + } + if (s->mode == 'w') { + /* Write a very simple .gz header: + */ + fprintf(s->file, "%c%c%c%c%c%c%c%c%c%c", gz_magic[0], gz_magic[1], + Z_DEFLATED, 0 /*flags*/, 0,0,0,0 /*time*/, 0 /*xflags*/, OS_CODE); + s->startpos = 10L; + /* We use 10L instead of ftell(s->file) to because ftell causes an + * fflush on some systems. This version of the library doesn't use + * startpos anyway in write mode, so this initialization is not + * necessary. + */ + } else { + check_header(s); /* skip the .gz header */ + s->startpos = (ftell(s->file) - s->stream.avail_in); + } + + return (gzFile)s; +} + +/* =========================================================================== + Opens a gzip (.gz) file for reading or writing. +*/ +gzFile ZEXPORT gzopen (path, mode) + const char *path; + const char *mode; +{ + return gz_open (path, mode, -1); +} + +/* =========================================================================== + Associate a gzFile with the file descriptor fd. fd is not dup'ed here + to mimic the behavio(u)r of fdopen. +*/ +gzFile ZEXPORT gzdopen (fd, mode) + int fd; + const char *mode; +{ + char name[20]; + + if (fd < 0) return (gzFile)Z_NULL; + sprintf(name, "", fd); /* for debugging */ + + return gz_open (name, mode, fd); +} + +/* =========================================================================== + * Update the compression level and strategy + */ +int ZEXPORT gzsetparams (file, level, strategy) + gzFile file; + int level; + int strategy; +{ + gz_stream *s = (gz_stream*)file; + + if (s == NULL || s->mode != 'w') return Z_STREAM_ERROR; + + /* Make room to allow flushing */ + if (s->stream.avail_out == 0) { + + s->stream.next_out = s->outbuf; + if (fwrite(s->outbuf, 1, Z_BUFSIZE, s->file) != Z_BUFSIZE) { + s->z_err = Z_ERRNO; + } + s->stream.avail_out = Z_BUFSIZE; + } + + return deflateParams (&(s->stream), level, strategy); +} + +/* =========================================================================== + Read a byte from a gz_stream; update next_in and avail_in. Return EOF + for end of file. + IN assertion: the stream s has been sucessfully opened for reading. +*/ +local int get_byte(s) + gz_stream *s; +{ + if (s->z_eof) return EOF; + if (s->stream.avail_in == 0) { + errno = 0; + s->stream.avail_in = fread(s->inbuf, 1, Z_BUFSIZE, s->file); + if (s->stream.avail_in == 0) { + s->z_eof = 1; + if (ferror(s->file)) s->z_err = Z_ERRNO; + return EOF; + } + s->stream.next_in = s->inbuf; + } + s->stream.avail_in--; + return *(s->stream.next_in)++; +} + +/* =========================================================================== + Check the gzip header of a gz_stream opened for reading. Set the stream + mode to transparent if the gzip magic header is not present; set s->err + to Z_DATA_ERROR if the magic header is present but the rest of the header + is incorrect. + IN assertion: the stream s has already been created sucessfully; + s->stream.avail_in is zero for the first time, but may be non-zero + for concatenated .gz files. +*/ +local void check_header(s) + gz_stream *s; +{ + int method; /* method byte */ + int flags; /* flags byte */ + uInt len; + int c; + + /* Check the gzip magic header */ + for (len = 0; len < 2; len++) { + c = get_byte(s); + if (c != gz_magic[len]) { + if (len != 0) s->stream.avail_in++, s->stream.next_in--; + if (c != EOF) { + s->stream.avail_in++, s->stream.next_in--; + s->transparent = 1; + } + s->z_err = s->stream.avail_in != 0 ? Z_OK : Z_STREAM_END; + return; + } + } + method = get_byte(s); + flags = get_byte(s); + if (method != Z_DEFLATED || (flags & RESERVED) != 0) { + s->z_err = Z_DATA_ERROR; + return; + } + + /* Discard time, xflags and OS code: */ + for (len = 0; len < 6; len++) (void)get_byte(s); + + if ((flags & EXTRA_FIELD) != 0) { /* skip the extra field */ + len = (uInt)get_byte(s); + len += ((uInt)get_byte(s))<<8; + /* len is garbage if EOF but the loop below will quit anyway */ + while (len-- != 0 && get_byte(s) != EOF) ; + } + if ((flags & ORIG_NAME) != 0) { /* skip the original file name */ + while ((c = get_byte(s)) != 0 && c != EOF) ; + } + if ((flags & COMMENT) != 0) { /* skip the .gz file comment */ + while ((c = get_byte(s)) != 0 && c != EOF) ; + } + if ((flags & HEAD_CRC) != 0) { /* skip the header crc */ + for (len = 0; len < 2; len++) (void)get_byte(s); + } + s->z_err = s->z_eof ? Z_DATA_ERROR : Z_OK; +} + + /* =========================================================================== + * Cleanup then free the given gz_stream. Return a zlib error code. + Try freeing in the reverse order of allocations. + */ +local int destroy (s) + gz_stream *s; +{ + int err = Z_OK; + + if (!s) return Z_STREAM_ERROR; + + TRYFREE(s->msg); + + if (s->stream.state != NULL) { + if (s->mode == 'w') { +#ifdef NO_DEFLATE + err = Z_STREAM_ERROR; +#else + err = deflateEnd(&(s->stream)); +#endif + } else if (s->mode == 'r') { + err = inflateEnd(&(s->stream)); + } + } + if (s->file != NULL && fclose(s->file)) { +#ifdef ESPIPE + if (errno != ESPIPE) /* fclose is broken for pipes in HP/UX */ +#endif + err = Z_ERRNO; + } + if (s->z_err < 0) err = s->z_err; + + TRYFREE(s->inbuf); + TRYFREE(s->outbuf); + TRYFREE(s->path); + TRYFREE(s); + return err; +} + +/* =========================================================================== + Reads the given number of uncompressed bytes from the compressed file. + gzread returns the number of bytes actually read (0 for end of file). +*/ +int ZEXPORT gzread (file, buf, len) + gzFile file; + voidp buf; + unsigned len; +{ + gz_stream *s = (gz_stream*)file; + Bytef *start = (Bytef*)buf; /* starting point for crc computation */ + Byte *next_out; /* == stream.next_out but not forced far (for MSDOS) */ + + if (s == NULL || s->mode != 'r') return Z_STREAM_ERROR; + + if (s->z_err == Z_DATA_ERROR || s->z_err == Z_ERRNO) return -1; + if (s->z_err == Z_STREAM_END) return 0; /* EOF */ + + next_out = (Byte*)buf; + s->stream.next_out = (Bytef*)buf; + s->stream.avail_out = len; + + while (s->stream.avail_out != 0) { + + if (s->transparent) { + /* Copy first the lookahead bytes: */ + uInt n = s->stream.avail_in; + if (n > s->stream.avail_out) n = s->stream.avail_out; + if (n > 0) { + zmemcpy(s->stream.next_out, s->stream.next_in, n); + next_out += n; + s->stream.next_out = next_out; + s->stream.next_in += n; + s->stream.avail_out -= n; + s->stream.avail_in -= n; + } + if (s->stream.avail_out > 0) { + s->stream.avail_out -= fread(next_out, 1, s->stream.avail_out, + s->file); + } + len -= s->stream.avail_out; + s->stream.total_in += (uLong)len; + s->stream.total_out += (uLong)len; + if (len == 0) s->z_eof = 1; + return (int)len; + } + if (s->stream.avail_in == 0 && !s->z_eof) { + + errno = 0; + s->stream.avail_in = fread(s->inbuf, 1, Z_BUFSIZE, s->file); + if (s->stream.avail_in == 0) { + s->z_eof = 1; + if (ferror(s->file)) { + s->z_err = Z_ERRNO; + break; + } + } + s->stream.next_in = s->inbuf; + } + s->z_err = inflate(&(s->stream), Z_NO_FLUSH); + + if (s->z_err == Z_STREAM_END) { + /* Check CRC and original size */ + s->crc = crc32(s->crc, start, (uInt)(s->stream.next_out - start)); + start = s->stream.next_out; + + if (getLong(s) != s->crc) { + s->z_err = Z_DATA_ERROR; + } else { + (void)getLong(s); + /* The uncompressed length returned by above getlong() may + * be different from s->stream.total_out) in case of + * concatenated .gz files. Check for such files: + */ + check_header(s); + if (s->z_err == Z_OK) { + uLong total_in = s->stream.total_in; + uLong total_out = s->stream.total_out; + + inflateReset(&(s->stream)); + s->stream.total_in = total_in; + s->stream.total_out = total_out; + s->crc = crc32(0L, Z_NULL, 0); + } + } + } + if (s->z_err != Z_OK || s->z_eof) break; + } + s->crc = crc32(s->crc, start, (uInt)(s->stream.next_out - start)); + + return (int)(len - s->stream.avail_out); +} + + +/* =========================================================================== + Reads one byte from the compressed file. gzgetc returns this byte + or -1 in case of end of file or error. +*/ +int ZEXPORT gzgetc(file) + gzFile file; +{ + unsigned char c; + + return gzread(file, &c, 1) == 1 ? c : -1; +} + + +/* =========================================================================== + Reads bytes from the compressed file until len-1 characters are + read, or a newline character is read and transferred to buf, or an + end-of-file condition is encountered. The string is then terminated + with a null character. + gzgets returns buf, or Z_NULL in case of error. + + The current implementation is not optimized at all. +*/ +char * ZEXPORT gzgets(file, buf, len) + gzFile file; + char *buf; + int len; +{ + char *b = buf; + if (buf == Z_NULL || len <= 0) return Z_NULL; + + while (--len > 0 && gzread(file, buf, 1) == 1 && *buf++ != '\n') ; + *buf = '\0'; + return b == buf && len > 0 ? Z_NULL : b; +} + + +#ifndef NO_DEFLATE +/* =========================================================================== + Writes the given number of uncompressed bytes into the compressed file. + gzwrite returns the number of bytes actually written (0 in case of error). +*/ +int ZEXPORT gzwrite (file, buf, len) + gzFile file; + const voidp buf; + unsigned len; +{ + gz_stream *s = (gz_stream*)file; + + if (s == NULL || s->mode != 'w') return Z_STREAM_ERROR; + + s->stream.next_in = (Bytef*)buf; + s->stream.avail_in = len; + + while (s->stream.avail_in != 0) { + + if (s->stream.avail_out == 0) { + + s->stream.next_out = s->outbuf; + if (fwrite(s->outbuf, 1, Z_BUFSIZE, s->file) != Z_BUFSIZE) { + s->z_err = Z_ERRNO; + break; + } + s->stream.avail_out = Z_BUFSIZE; + } + s->z_err = deflate(&(s->stream), Z_NO_FLUSH); + if (s->z_err != Z_OK) break; + } + s->crc = crc32(s->crc, (const Bytef *)buf, len); + + return (int)(len - s->stream.avail_in); +} + +/* =========================================================================== + Converts, formats, and writes the args to the compressed file under + control of the format string, as in fprintf. gzprintf returns the number of + uncompressed bytes actually written (0 in case of error). +*/ +#ifdef STDC +#include + +int ZEXPORTVA gzprintf (gzFile file, const char *format, /* args */ ...) +{ + char buf[Z_PRINTF_BUFSIZE]; + va_list va; + int len; + + va_start(va, format); +#ifdef HAS_vsnprintf + (void)vsnprintf(buf, sizeof(buf), format, va); +#else + (void)vsprintf(buf, format, va); +#endif + va_end(va); + len = strlen(buf); /* some *sprintf don't return the nb of bytes written */ + if (len <= 0) return 0; + + return gzwrite(file, buf, (unsigned)len); +} +#else /* not ANSI C */ + +int ZEXPORTVA gzprintf (file, format, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, + a11, a12, a13, a14, a15, a16, a17, a18, a19, a20) + gzFile file; + const char *format; + int a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, + a11, a12, a13, a14, a15, a16, a17, a18, a19, a20; +{ + char buf[Z_PRINTF_BUFSIZE]; + int len; + +#ifdef HAS_snprintf + snprintf(buf, sizeof(buf), format, a1, a2, a3, a4, a5, a6, a7, a8, + a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20); +#else + sprintf(buf, format, a1, a2, a3, a4, a5, a6, a7, a8, + a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20); +#endif + len = strlen(buf); /* old sprintf doesn't return the nb of bytes written */ + if (len <= 0) return 0; + + return gzwrite(file, buf, len); +} +#endif + +/* =========================================================================== + Writes c, converted to an unsigned char, into the compressed file. + gzputc returns the value that was written, or -1 in case of error. +*/ +int ZEXPORT gzputc(file, c) + gzFile file; + int c; +{ + unsigned char cc = (unsigned char) c; /* required for big endian systems */ + + return gzwrite(file, &cc, 1) == 1 ? (int)cc : -1; +} + + +/* =========================================================================== + Writes the given null-terminated string to the compressed file, excluding + the terminating null character. + gzputs returns the number of characters written, or -1 in case of error. +*/ +int ZEXPORT gzputs(file, s) + gzFile file; + const char *s; +{ + return gzwrite(file, (char*)s, (unsigned)strlen(s)); +} + + +/* =========================================================================== + Flushes all pending output into the compressed file. The parameter + flush is as in the deflate() function. +*/ +local int do_flush (file, flush) + gzFile file; + int flush; +{ + uInt len; + int done = 0; + gz_stream *s = (gz_stream*)file; + + if (s == NULL || s->mode != 'w') return Z_STREAM_ERROR; + + s->stream.avail_in = 0; /* should be zero already anyway */ + + for (;;) { + len = Z_BUFSIZE - s->stream.avail_out; + + if (len != 0) { + if ((uInt)fwrite(s->outbuf, 1, len, s->file) != len) { + s->z_err = Z_ERRNO; + return Z_ERRNO; + } + s->stream.next_out = s->outbuf; + s->stream.avail_out = Z_BUFSIZE; + } + if (done) break; + s->z_err = deflate(&(s->stream), flush); + + /* Ignore the second of two consecutive flushes: */ + if (len == 0 && s->z_err == Z_BUF_ERROR) s->z_err = Z_OK; + + /* deflate has finished flushing only when it hasn't used up + * all the available space in the output buffer: + */ + 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 == Z_STREAM_END ? Z_OK : s->z_err; +} + +int ZEXPORT gzflush (file, flush) + gzFile file; + int flush; +{ + gz_stream *s = (gz_stream*)file; + int err = do_flush (file, flush); + + if (err) return err; + fflush(s->file); + return s->z_err == Z_STREAM_END ? Z_OK : s->z_err; +} +#endif /* NO_DEFLATE */ + +/* =========================================================================== + Sets the starting position for the next gzread or gzwrite on the given + compressed file. The offset represents a number of bytes in the + gzseek returns the resulting offset location as measured in bytes from + the beginning of the uncompressed stream, or -1 in case of error. + SEEK_END is not implemented, returns error. + In this version of the library, gzseek can be extremely slow. +*/ +z_off_t ZEXPORT gzseek (file, offset, whence) + gzFile file; + z_off_t offset; + int whence; +{ + gz_stream *s = (gz_stream*)file; + + if (s == NULL || whence == SEEK_END || + s->z_err == Z_ERRNO || s->z_err == Z_DATA_ERROR) { + return -1L; + } + + if (s->mode == 'w') { +#ifdef NO_DEFLATE + return -1L; +#else + if (whence == SEEK_SET) { + offset -= s->stream.total_in; + } + if (offset < 0) return -1L; + + /* At this point, offset is the number of zero bytes to write. */ + if (s->inbuf == Z_NULL) { + s->inbuf = (Byte*)ALLOC(Z_BUFSIZE); /* for seeking */ + zmemzero(s->inbuf, Z_BUFSIZE); + } + while (offset > 0) { + uInt size = Z_BUFSIZE; + if (offset < Z_BUFSIZE) size = (uInt)offset; + + size = gzwrite(file, s->inbuf, size); + if (size == 0) return -1L; + + offset -= size; + } + return (z_off_t)s->stream.total_in; +#endif + } + /* Rest of function is for reading only */ + + /* compute absolute position */ + if (whence == SEEK_CUR) { + offset += s->stream.total_out; + } + if (offset < 0) return -1L; + + if (s->transparent) { + /* map to fseek */ + s->stream.avail_in = 0; + s->stream.next_in = s->inbuf; + if (fseek(s->file, offset, SEEK_SET) < 0) return -1L; + + s->stream.total_in = s->stream.total_out = (uLong)offset; + return offset; + } + + /* For a negative seek, rewind and use positive seek */ + if ((uLong)offset >= s->stream.total_out) { + offset -= s->stream.total_out; + } else if (gzrewind(file) < 0) { + return -1L; + } + /* offset is now the number of bytes to skip. */ + + if (offset != 0 && s->outbuf == Z_NULL) { + s->outbuf = (Byte*)ALLOC(Z_BUFSIZE); + } + while (offset > 0) { + int size = Z_BUFSIZE; + if (offset < Z_BUFSIZE) size = (int)offset; + + size = gzread(file, s->outbuf, (uInt)size); + if (size <= 0) return -1L; + offset -= size; + } + return (z_off_t)s->stream.total_out; +} + +/* =========================================================================== + Rewinds input file. +*/ +int ZEXPORT gzrewind (file) + gzFile file; +{ + gz_stream *s = (gz_stream*)file; + + if (s == NULL || s->mode != 'r') return -1; + + s->z_err = Z_OK; + s->z_eof = 0; + s->stream.avail_in = 0; + s->stream.next_in = s->inbuf; + s->crc = crc32(0L, Z_NULL, 0); + + if (s->startpos == 0) { /* not a compressed file */ + rewind(s->file); + return 0; + } + + (void) inflateReset(&s->stream); + return fseek(s->file, s->startpos, SEEK_SET); +} + +/* =========================================================================== + Returns the starting position for the next gzread or gzwrite on the + given compressed file. This position represents a number of bytes in the + uncompressed data stream. +*/ +z_off_t ZEXPORT gztell (file) + gzFile file; +{ + return gzseek(file, 0L, SEEK_CUR); +} + +/* =========================================================================== + Returns 1 when EOF has previously been detected reading the given + input stream, otherwise zero. +*/ +int ZEXPORT gzeof (file) + gzFile file; +{ + gz_stream *s = (gz_stream*)file; + + return (s == NULL || s->mode != 'r') ? 0 : s->z_eof; +} + +/* =========================================================================== + Outputs a long in LSB order to the given file +*/ +local void putLong (file, x) + FILE *file; + uLong x; +{ + int n; + for (n = 0; n < 4; n++) { + fputc((int)(x & 0xff), file); + x >>= 8; + } +} + +/* =========================================================================== + Reads a long in LSB order from the given gz_stream. Sets z_err in case + of error. +*/ +local uLong getLong (s) + gz_stream *s; +{ + uLong x = (uLong)get_byte(s); + int c; + + x += ((uLong)get_byte(s))<<8; + x += ((uLong)get_byte(s))<<16; + c = get_byte(s); + if (c == EOF) s->z_err = Z_DATA_ERROR; + x += ((uLong)c)<<24; + return x; +} + +/* =========================================================================== + Flushes all pending output if necessary, closes the compressed file + and deallocates all the (de)compression state. +*/ +int ZEXPORT gzclose (file) + gzFile file; +{ + int err; + gz_stream *s = (gz_stream*)file; + + if (s == NULL) return Z_STREAM_ERROR; + + if (s->mode == 'w') { +#ifdef NO_DEFLATE + return Z_STREAM_ERROR; +#else + err = do_flush (file, Z_FINISH); + if (err != Z_OK) return destroy((gz_stream*)file); + + putLong (s->file, s->crc); + putLong (s->file, s->stream.total_in); +#endif + } + return destroy((gz_stream*)file); +} + +/* =========================================================================== + Returns the error message for the last error which occured on the + given compressed file. errnum is set to zlib error number. If an + error occured in the file system and not in the compression library, + errnum is set to Z_ERRNO and the application may consult errno + to get the exact error code. +*/ +const char* ZEXPORT gzerror (file, errnum) + gzFile file; + int *errnum; +{ + char *m; + gz_stream *s = (gz_stream*)file; + + if (s == NULL) { + *errnum = Z_STREAM_ERROR; + return (const char*)ERR_MSG(Z_STREAM_ERROR); + } + *errnum = s->z_err; + if (*errnum == Z_OK) return (const char*)""; + + m = (char*)(*errnum == Z_ERRNO ? zstrerror(errno) : s->stream.msg); + + if (m == NULL || *m == '\0') m = (char*)ERR_MSG(s->z_err); + + TRYFREE(s->msg); + s->msg = (char*)ALLOC(strlen(s->path) + strlen(m) + 3); + strcpy(s->msg, s->path); + strcat(s->msg, ": "); + strcat(s->msg, m); + return (const char*)s->msg; +} diff --git a/ziplib/infblock.c b/ziplib/infblock.c new file mode 100644 index 0000000..943e849 --- /dev/null +++ b/ziplib/infblock.c @@ -0,0 +1,403 @@ +/* infblock.c -- interpret and process block types to last block + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +#include "zutil.h" +#include "infblock.h" +#include "inftrees.h" +#include "infcodes.h" +#include "infutil.h" + +struct inflate_codes_state {int dummy;}; /* for buggy compilers */ + +/* simplify the use of the inflate_huft type with some defines */ +#define exop word.what.Exop +#define bits word.what.Bits + +/* Table for deflate from PKZIP's appnote.txt. */ +local const uInt border[] = { /* Order of the bit length code lengths */ + 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; + +/* + Notes beyond the 1.93a appnote.txt: + + 1. Distance pointers never point before the beginning of the output + stream. + 2. Distance pointers can point back across blocks, up to 32k away. + 3. There is an implied maximum of 7 bits for the bit length table and + 15 bits for the actual data. + 4. If only one code exists, then it is encoded using one bit. (Zero + would be more efficient, but perhaps a little confusing.) If two + codes exist, they are coded using one bit each (0 and 1). + 5. There is no way of sending zero distance codes--a dummy must be + sent if there are none. (History: a pre 2.0 version of PKZIP would + store blocks with no distance codes, but this was discovered to be + too harsh a criterion.) Valid only for 1.93a. 2.04c does allow + zero distance codes, which is sent as one code of zero bits in + length. + 6. There are up to 286 literal/length codes. Code 256 represents the + end-of-block. Note however that the static length tree defines + 288 codes just to fill out the Huffman codes. Codes 286 and 287 + cannot be used though, since there is no length base or extra bits + defined for them. Similarily, there are up to 30 distance codes. + However, static trees define 32 codes (all 5 bits) to fill out the + Huffman codes, but the last two had better not show up in the data. + 7. Unzip can check dynamic Huffman blocks for complete code sets. + The exception is that a single code would not be complete (see #4). + 8. The five bits following the block type is really the number of + literal codes sent minus 257. + 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits + (1+6+6). Therefore, to output three times the length, you output + three codes (1+1+1), whereas to output four times the same length, + you only need two codes (1+3). Hmm. + 10. In the tree reconstruction algorithm, Code = Code + Increment + only if BitLength(i) is not zero. (Pretty obvious.) + 11. Correction: 4 Bits: # of Bit Length codes - 4 (4 - 19) + 12. Note: length code 284 can represent 227-258, but length code 285 + really is 258. The last length deserves its own, short code + since it gets used a lot in very redundant files. The length + 258 is special since 258 - 3 (the min match length) is 255. + 13. The literal/length and distance code bit lengths are read as a + single stream of lengths. It is possible (and advantageous) for + a repeat code (16, 17, or 18) to go across the boundary between + the two sets of lengths. + */ + + +void inflate_blocks_reset(s, z, c) +inflate_blocks_statef *s; +z_streamp z; +uLongf *c; +{ + if (c != Z_NULL) + *c = s->check; + if (s->mode == BTREE || s->mode == DTREE) + ZFREE(z, s->sub.trees.blens); + if (s->mode == CODES) + inflate_codes_free(s->sub.decode.codes, z); + s->mode = TYPE; + s->bitk = 0; + s->bitb = 0; + s->read = s->write = s->window; + if (s->checkfn != Z_NULL) + z->adler = s->check = (*s->checkfn)(0L, (const Bytef *)Z_NULL, 0); + Tracev((stderr, "inflate: blocks reset\n")); +} + + +inflate_blocks_statef *inflate_blocks_new(z, c, w) +z_streamp z; +check_func c; +uInt w; +{ + inflate_blocks_statef *s; + + if ((s = (inflate_blocks_statef *)ZALLOC + (z,1,sizeof(struct inflate_blocks_state))) == Z_NULL) + return s; + if ((s->hufts = + (inflate_huft *)ZALLOC(z, sizeof(inflate_huft), MANY)) == Z_NULL) + { + ZFREE(z, s); + return Z_NULL; + } + if ((s->window = (Bytef *)ZALLOC(z, 1, w)) == Z_NULL) + { + ZFREE(z, s->hufts); + ZFREE(z, s); + return Z_NULL; + } + s->end = s->window + w; + s->checkfn = c; + s->mode = TYPE; + Tracev((stderr, "inflate: blocks allocated\n")); + inflate_blocks_reset(s, z, Z_NULL); + return s; +} + + +int inflate_blocks(s, z, r) +inflate_blocks_statef *s; +z_streamp z; +int r; +{ + uInt t; /* temporary storage */ + uLong b; /* bit buffer */ + uInt k; /* bits in bit buffer */ + Bytef *p; /* input data pointer */ + uInt n; /* bytes available there */ + Bytef *q; /* output window write pointer */ + uInt m; /* bytes to end of window or read pointer */ + + /* copy input/output information to locals (UPDATE macro restores) */ + LOAD + + /* process input based on current state */ + while (1) switch (s->mode) + { + case TYPE: + NEEDBITS(3) + t = (uInt)b & 7; + s->last = t & 1; + switch (t >> 1) + { + case 0: /* stored */ + Tracev((stderr, "inflate: stored block%s\n", + s->last ? " (last)" : "")); + DUMPBITS(3) + t = k & 7; /* go to byte boundary */ + DUMPBITS(t) + s->mode = LENS; /* get length of stored block */ + break; + case 1: /* fixed */ + Tracev((stderr, "inflate: fixed codes block%s\n", + s->last ? " (last)" : "")); + { + uInt bl, bd; + inflate_huft *tl, *td; + + inflate_trees_fixed(&bl, &bd, &tl, &td, z); + s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z); + if (s->sub.decode.codes == Z_NULL) + { + r = Z_MEM_ERROR; + LEAVE + } + } + DUMPBITS(3) + s->mode = CODES; + break; + case 2: /* dynamic */ + Tracev((stderr, "inflate: dynamic codes block%s\n", + s->last ? " (last)" : "")); + DUMPBITS(3) + s->mode = TABLE; + break; + case 3: /* illegal */ + DUMPBITS(3) + s->mode = BAD; + z->msg = (char*)"invalid block type"; + r = Z_DATA_ERROR; + LEAVE + } + break; + case LENS: + NEEDBITS(32) + if ((((~b) >> 16) & 0xffff) != (b & 0xffff)) + { + s->mode = BAD; + z->msg = (char*)"invalid stored block lengths"; + r = Z_DATA_ERROR; + LEAVE + } + s->sub.left = (uInt)b & 0xffff; + b = k = 0; /* dump bits */ + Tracev((stderr, "inflate: stored length %u\n", s->sub.left)); + s->mode = s->sub.left ? STORED : (s->last ? DRY : TYPE); + break; + case STORED: + if (n == 0) + LEAVE + NEEDOUT + t = s->sub.left; + if (t > n) t = n; + if (t > m) t = m; + zmemcpy(q, p, t); + p += t; n -= t; + q += t; m -= t; + if ((s->sub.left -= t) != 0) + break; + Tracev((stderr, "inflate: stored end, %lu total out\n", + z->total_out + (q >= s->read ? q - s->read : + (s->end - s->read) + (q - s->window)))); + s->mode = s->last ? DRY : TYPE; + break; + case TABLE: + NEEDBITS(14) + s->sub.trees.table = t = (uInt)b & 0x3fff; +#ifndef PKZIP_BUG_WORKAROUND + if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29) + { + s->mode = BAD; + z->msg = (char*)"too many length or distance symbols"; + r = Z_DATA_ERROR; + LEAVE + } +#endif + t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f); + if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL) + { + r = Z_MEM_ERROR; + LEAVE + } + DUMPBITS(14) + s->sub.trees.index = 0; + Tracev((stderr, "inflate: table sizes ok\n")); + s->mode = BTREE; + case BTREE: + while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10)) + { + NEEDBITS(3) + s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7; + DUMPBITS(3) + } + while (s->sub.trees.index < 19) + s->sub.trees.blens[border[s->sub.trees.index++]] = 0; + s->sub.trees.bb = 7; + t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb, + &s->sub.trees.tb, s->hufts, z); + if (t != Z_OK) + { + r = t; + if (r == Z_DATA_ERROR) + { + ZFREE(z, s->sub.trees.blens); + s->mode = BAD; + } + LEAVE + } + s->sub.trees.index = 0; + Tracev((stderr, "inflate: bits tree ok\n")); + s->mode = DTREE; + case DTREE: + while (t = s->sub.trees.table, + s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f)) + { + inflate_huft *h; + uInt i, j, c; + + t = s->sub.trees.bb; + NEEDBITS(t) + h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]); + t = h->bits; + c = h->base; + if (c < 16) + { + DUMPBITS(t) + s->sub.trees.blens[s->sub.trees.index++] = c; + } + else /* c == 16..18 */ + { + i = c == 18 ? 7 : c - 14; + j = c == 18 ? 11 : 3; + NEEDBITS(t + i) + DUMPBITS(t) + j += (uInt)b & inflate_mask[i]; + DUMPBITS(i) + i = s->sub.trees.index; + t = s->sub.trees.table; + if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) || + (c == 16 && i < 1)) + { + ZFREE(z, s->sub.trees.blens); + s->mode = BAD; + z->msg = (char*)"invalid bit length repeat"; + r = Z_DATA_ERROR; + LEAVE + } + c = c == 16 ? s->sub.trees.blens[i - 1] : 0; + do { + s->sub.trees.blens[i++] = c; + } while (--j); + s->sub.trees.index = i; + } + } + s->sub.trees.tb = Z_NULL; + { + uInt bl, bd; + inflate_huft *tl, *td; + inflate_codes_statef *c; + + bl = 9; /* must be <= 9 for lookahead assumptions */ + bd = 6; /* must be <= 9 for lookahead assumptions */ + t = s->sub.trees.table; + t = inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), + s->sub.trees.blens, &bl, &bd, &tl, &td, + s->hufts, z); + if (t != Z_OK) + { + if (t == (uInt)Z_DATA_ERROR) + { + ZFREE(z, s->sub.trees.blens); + s->mode = BAD; + } + r = t; + LEAVE + } + Tracev((stderr, "inflate: trees ok\n")); + if ((c = inflate_codes_new(bl, bd, tl, td, z)) == Z_NULL) + { + r = Z_MEM_ERROR; + LEAVE + } + s->sub.decode.codes = c; + } + ZFREE(z, s->sub.trees.blens); + s->mode = CODES; + case CODES: + UPDATE + if ((r = inflate_codes(s, z, r)) != Z_STREAM_END) + return inflate_flush(s, z, r); + r = Z_OK; + inflate_codes_free(s->sub.decode.codes, z); + LOAD + Tracev((stderr, "inflate: codes end, %lu total out\n", + z->total_out + (q >= s->read ? q - s->read : + (s->end - s->read) + (q - s->window)))); + if (!s->last) + { + s->mode = TYPE; + break; + } + s->mode = DRY; + case DRY: + FLUSH + if (s->read != s->write) + LEAVE + s->mode = DONE; + case DONE: + r = Z_STREAM_END; + LEAVE + case BAD: + r = Z_DATA_ERROR; + LEAVE + default: + r = Z_STREAM_ERROR; + LEAVE + } +} + + +int inflate_blocks_free(s, z) +inflate_blocks_statef *s; +z_streamp z; +{ + inflate_blocks_reset(s, z, Z_NULL); + ZFREE(z, s->window); + ZFREE(z, s->hufts); + ZFREE(z, s); + Tracev((stderr, "inflate: blocks freed\n")); + return Z_OK; +} + + +void inflate_set_dictionary(s, d, n) +inflate_blocks_statef *s; +const Bytef *d; +uInt n; +{ + zmemcpy(s->window, d, n); + s->read = s->write = s->window + n; +} + + +/* Returns true if inflate is currently at the end of a block generated + * by Z_SYNC_FLUSH or Z_FULL_FLUSH. + * IN assertion: s != Z_NULL + */ +int inflate_blocks_sync_point(s) +inflate_blocks_statef *s; +{ + return s->mode == LENS; +} diff --git a/ziplib/infblock.h b/ziplib/infblock.h new file mode 100644 index 0000000..4cf0fa9 --- /dev/null +++ b/ziplib/infblock.h @@ -0,0 +1,39 @@ +/* infblock.h -- header to use infblock.c + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* WARNING: this file should *not* be used by applications. It is + part of the implementation of the compression library and is + subject to change. Applications should only use zlib.h. + */ + +struct inflate_blocks_state; +typedef struct inflate_blocks_state FAR inflate_blocks_statef; + +extern inflate_blocks_statef * inflate_blocks_new OF(( + z_streamp z, + check_func c, /* check function */ + uInt w)); /* window size */ + +extern int inflate_blocks OF(( + inflate_blocks_statef *, + z_streamp , + int)); /* initial return code */ + +extern void inflate_blocks_reset OF(( + inflate_blocks_statef *, + z_streamp , + uLongf *)); /* check value on output */ + +extern int inflate_blocks_free OF(( + inflate_blocks_statef *, + z_streamp)); + +extern void inflate_set_dictionary OF(( + inflate_blocks_statef *s, + const Bytef *d, /* dictionary */ + uInt n)); /* dictionary length */ + +extern int inflate_blocks_sync_point OF(( + inflate_blocks_statef *s)); diff --git a/ziplib/infcodes.c b/ziplib/infcodes.c new file mode 100644 index 0000000..aa7b3a0 --- /dev/null +++ b/ziplib/infcodes.c @@ -0,0 +1,251 @@ +/* infcodes.c -- process literals and length/distance pairs + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +#include "zutil.h" +#include "inftrees.h" +#include "infblock.h" +#include "infcodes.h" +#include "infutil.h" +#include "inffast.h" + +/* simplify the use of the inflate_huft type with some defines */ +#define exop word.what.Exop +#define bits word.what.Bits + +typedef enum { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */ + START, /* x: set up for LEN */ + LEN, /* i: get length/literal/eob next */ + LENEXT, /* i: getting length extra (have base) */ + DIST, /* i: get distance next */ + DISTEXT, /* i: getting distance extra */ + COPY, /* o: copying bytes in window, waiting for space */ + LIT, /* o: got literal, waiting for output space */ + WASH, /* o: got eob, possibly still output waiting */ + END, /* x: got eob and all data flushed */ + BADCODE} /* x: got error */ +inflate_codes_mode; + +/* inflate codes private state */ +struct inflate_codes_state { + + /* mode */ + inflate_codes_mode mode; /* current inflate_codes mode */ + + /* mode dependent information */ + uInt len; + union { + struct { + inflate_huft *tree; /* pointer into tree */ + uInt need; /* bits needed */ + } code; /* if LEN or DIST, where in tree */ + uInt lit; /* if LIT, literal */ + struct { + uInt get; /* bits to get for extra */ + uInt dist; /* distance back to copy from */ + } copy; /* if EXT or COPY, where and how much */ + } sub; /* submode */ + + /* mode independent information */ + Byte lbits; /* ltree bits decoded per branch */ + Byte dbits; /* dtree bits decoder per branch */ + inflate_huft *ltree; /* literal/length/eob tree */ + inflate_huft *dtree; /* distance tree */ + +}; + + +inflate_codes_statef *inflate_codes_new(bl, bd, tl, td, z) +uInt bl, bd; +inflate_huft *tl; +inflate_huft *td; /* need separate declaration for Borland C++ */ +z_streamp z; +{ + inflate_codes_statef *c; + + if ((c = (inflate_codes_statef *) + ZALLOC(z,1,sizeof(struct inflate_codes_state))) != Z_NULL) + { + c->mode = START; + c->lbits = (Byte)bl; + c->dbits = (Byte)bd; + c->ltree = tl; + c->dtree = td; + Tracev((stderr, "inflate: codes new\n")); + } + return c; +} + + +int inflate_codes(s, z, r) +inflate_blocks_statef *s; +z_streamp z; +int r; +{ + uInt j; /* temporary storage */ + inflate_huft *t; /* temporary pointer */ + uInt e; /* extra bits or operation */ + uLong b; /* bit buffer */ + uInt k; /* bits in bit buffer */ + Bytef *p; /* input data pointer */ + uInt n; /* bytes available there */ + Bytef *q; /* output window write pointer */ + uInt m; /* bytes to end of window or read pointer */ + Bytef *f; /* pointer to copy strings from */ + inflate_codes_statef *c = s->sub.decode.codes; /* codes state */ + + /* copy input/output information to locals (UPDATE macro restores) */ + LOAD + + /* process input and output based on current state */ + while (1) switch (c->mode) + { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */ + case START: /* x: set up for LEN */ +#ifndef SLOW + if (m >= 258 && n >= 10) + { + UPDATE + r = inflate_fast(c->lbits, c->dbits, c->ltree, c->dtree, s, z); + LOAD + if (r != Z_OK) + { + c->mode = r == Z_STREAM_END ? WASH : BADCODE; + break; + } + } +#endif /* !SLOW */ + c->sub.code.need = c->lbits; + c->sub.code.tree = c->ltree; + c->mode = LEN; + case LEN: /* i: get length/literal/eob next */ + j = c->sub.code.need; + NEEDBITS(j) + t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); + DUMPBITS(t->bits) + e = (uInt)(t->exop); + if (e == 0) /* literal */ + { + c->sub.lit = t->base; + Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? + "inflate: literal '%c'\n" : + "inflate: literal 0x%02x\n", t->base)); + c->mode = LIT; + break; + } + if (e & 16) /* length */ + { + c->sub.copy.get = e & 15; + c->len = t->base; + c->mode = LENEXT; + break; + } + if ((e & 64) == 0) /* next table */ + { + c->sub.code.need = e; + c->sub.code.tree = t + t->base; + break; + } + if (e & 32) /* end of block */ + { + Tracevv((stderr, "inflate: end of block\n")); + c->mode = WASH; + break; + } + c->mode = BADCODE; /* invalid code */ + z->msg = (char*)"invalid literal/length code"; + r = Z_DATA_ERROR; + LEAVE + case LENEXT: /* i: getting length extra (have base) */ + j = c->sub.copy.get; + NEEDBITS(j) + c->len += (uInt)b & inflate_mask[j]; + DUMPBITS(j) + c->sub.code.need = c->dbits; + c->sub.code.tree = c->dtree; + Tracevv((stderr, "inflate: length %u\n", c->len)); + c->mode = DIST; + case DIST: /* i: get distance next */ + j = c->sub.code.need; + NEEDBITS(j) + t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); + DUMPBITS(t->bits) + e = (uInt)(t->exop); + if (e & 16) /* distance */ + { + c->sub.copy.get = e & 15; + c->sub.copy.dist = t->base; + c->mode = DISTEXT; + break; + } + if ((e & 64) == 0) /* next table */ + { + c->sub.code.need = e; + c->sub.code.tree = t + t->base; + break; + } + c->mode = BADCODE; /* invalid code */ + z->msg = (char*)"invalid distance code"; + r = Z_DATA_ERROR; + LEAVE + case DISTEXT: /* i: getting distance extra */ + j = c->sub.copy.get; + NEEDBITS(j) + c->sub.copy.dist += (uInt)b & inflate_mask[j]; + DUMPBITS(j) + Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist)); + c->mode = COPY; + case COPY: /* o: copying bytes in window, waiting for space */ + f = q - c->sub.copy.dist; + while (f < s->window) /* modulo window size-"while" instead */ + f += s->end - s->window; /* of "if" handles invalid distances */ + while (c->len) + { + NEEDOUT + OUTBYTE(*f++) + if (f == s->end) + f = s->window; + c->len--; + } + c->mode = START; + break; + case LIT: /* o: got literal, waiting for output space */ + NEEDOUT + OUTBYTE(c->sub.lit) + c->mode = START; + break; + case WASH: /* o: got eob, possibly more output */ + if (k > 7) /* return unused byte, if any */ + { + Assert(k < 16, "inflate_codes grabbed too many bytes") + k -= 8; + n++; + p--; /* can always return one */ + } + FLUSH + if (s->read != s->write) + LEAVE + c->mode = END; + case END: + r = Z_STREAM_END; + LEAVE + case BADCODE: /* x: got error */ + r = Z_DATA_ERROR; + LEAVE + default: + r = Z_STREAM_ERROR; + LEAVE + } +#ifdef NEED_DUMMY_RETURN + return Z_STREAM_ERROR; /* Some dumb compilers complain without this */ +#endif +} + + +void inflate_codes_free(c, z) +inflate_codes_statef *c; +z_streamp z; +{ + ZFREE(z, c); + Tracev((stderr, "inflate: codes free\n")); +} diff --git a/ziplib/infcodes.h b/ziplib/infcodes.h new file mode 100644 index 0000000..531d419 --- /dev/null +++ b/ziplib/infcodes.h @@ -0,0 +1,27 @@ +/* infcodes.h -- header to use infcodes.c + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* WARNING: this file should *not* be used by applications. It is + part of the implementation of the compression library and is + subject to change. Applications should only use zlib.h. + */ + +struct inflate_codes_state; +typedef struct inflate_codes_state FAR inflate_codes_statef; + +extern inflate_codes_statef *inflate_codes_new OF(( + uInt, uInt, + inflate_huft *, inflate_huft *, + z_streamp )); + +extern int inflate_codes OF(( + inflate_blocks_statef *, + z_streamp , + int)); + +extern void inflate_codes_free OF(( + inflate_codes_statef *, + z_streamp )); + diff --git a/ziplib/inffast.c b/ziplib/inffast.c new file mode 100644 index 0000000..655eaf0 --- /dev/null +++ b/ziplib/inffast.c @@ -0,0 +1,183 @@ +/* inffast.c -- process literals and length/distance pairs fast + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +#include "zutil.h" +#include "inftrees.h" +#include "infblock.h" +#include "infcodes.h" +#include "infutil.h" +#include "inffast.h" + +struct inflate_codes_state {int dummy;}; /* for buggy compilers */ + +/* simplify the use of the inflate_huft type with some defines */ +#define exop word.what.Exop +#define bits word.what.Bits + +/* macros for bit input with no checking and for returning unused bytes */ +#define GRABBITS(j) {while(k<(j)){b|=((uLong)NEXTBYTE)<avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;} + +/* Called with number of bytes left to write in window at least 258 + (the maximum string length) and number of input bytes available + at least ten. The ten bytes are six bytes for the longest length/ + distance pair plus four bytes for overloading the bit buffer. */ + +int inflate_fast(bl, bd, tl, td, s, z) +uInt bl, bd; +inflate_huft *tl; +inflate_huft *td; /* need separate declaration for Borland C++ */ +inflate_blocks_statef *s; +z_streamp z; +{ + inflate_huft *t; /* temporary pointer */ + uInt e; /* extra bits or operation */ + uLong b; /* bit buffer */ + uInt k; /* bits in bit buffer */ + Bytef *p; /* input data pointer */ + uInt n; /* bytes available there */ + Bytef *q; /* output window write pointer */ + uInt m; /* bytes to end of window or read pointer */ + uInt ml; /* mask for literal/length tree */ + uInt md; /* mask for distance tree */ + uInt c; /* bytes to copy */ + uInt d; /* distance back to copy from */ + Bytef *r; /* copy source pointer */ + + /* load input, output, bit values */ + LOAD + + /* initialize masks */ + ml = inflate_mask[bl]; + md = inflate_mask[bd]; + + /* do until not enough input or output space for fast loop */ + do { /* assume called with m >= 258 && n >= 10 */ + /* get literal/length code */ + GRABBITS(20) /* max bits for literal/length code */ + if ((e = (t = tl + ((uInt)b & ml))->exop) == 0) + { + DUMPBITS(t->bits) + Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? + "inflate: * literal '%c'\n" : + "inflate: * literal 0x%02x\n", t->base)); + *q++ = (Byte)t->base; + m--; + continue; + } + do { + DUMPBITS(t->bits) + if (e & 16) + { + /* get extra bits for length */ + e &= 15; + c = t->base + ((uInt)b & inflate_mask[e]); + DUMPBITS(e) + Tracevv((stderr, "inflate: * length %u\n", c)); + + /* decode distance base of block to copy */ + GRABBITS(15); /* max bits for distance code */ + e = (t = td + ((uInt)b & md))->exop; + do { + DUMPBITS(t->bits) + if (e & 16) + { + /* get extra bits to add to distance base */ + e &= 15; + GRABBITS(e) /* get extra bits (up to 13) */ + d = t->base + ((uInt)b & inflate_mask[e]); + DUMPBITS(e) + Tracevv((stderr, "inflate: * distance %u\n", d)); + + /* do the copy */ + m -= c; + r = q - d; + if (r < s->window) /* wrap if needed */ + { + do { + r += s->end - s->window; /* force pointer in window */ + } while (r < s->window); /* covers invalid distances */ + e = s->end - r; + if (c > e) + { + c -= e; /* wrapped copy */ + do { + *q++ = *r++; + } while (--e); + r = s->window; + do { + *q++ = *r++; + } while (--c); + } + else /* normal copy */ + { + *q++ = *r++; c--; + *q++ = *r++; c--; + do { + *q++ = *r++; + } while (--c); + } + } + else /* normal copy */ + { + *q++ = *r++; c--; + *q++ = *r++; c--; + do { + *q++ = *r++; + } while (--c); + } + break; + } + else if ((e & 64) == 0) + { + t += t->base; + e = (t += ((uInt)b & inflate_mask[e]))->exop; + } + else + { + z->msg = (char*)"invalid distance code"; + UNGRAB + UPDATE + return Z_DATA_ERROR; + } + } while (1); + break; + } + if ((e & 64) == 0) + { + t += t->base; + if ((e = (t += ((uInt)b & inflate_mask[e]))->exop) == 0) + { + DUMPBITS(t->bits) + Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ? + "inflate: * literal '%c'\n" : + "inflate: * literal 0x%02x\n", t->base)); + *q++ = (Byte)t->base; + m--; + break; + } + } + else if (e & 32) + { + Tracevv((stderr, "inflate: * end of block\n")); + UNGRAB + UPDATE + return Z_STREAM_END; + } + else + { + z->msg = (char*)"invalid literal/length code"; + UNGRAB + UPDATE + return Z_DATA_ERROR; + } + } while (1); + } while (m >= 258 && n >= 10); + + /* not enough input or output--restore pointers and return */ + UNGRAB + UPDATE + return Z_OK; +} diff --git a/ziplib/inffast.h b/ziplib/inffast.h new file mode 100644 index 0000000..ac643b3 --- /dev/null +++ b/ziplib/inffast.h @@ -0,0 +1,17 @@ +/* inffast.h -- header to use inffast.c + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* WARNING: this file should *not* be used by applications. It is + part of the implementation of the compression library and is + subject to change. Applications should only use zlib.h. + */ + +extern int inflate_fast OF(( + uInt, + uInt, + inflate_huft *, + inflate_huft *, + inflate_blocks_statef *, + z_streamp )); diff --git a/ziplib/inffixed.h b/ziplib/inffixed.h new file mode 100644 index 0000000..e997507 --- /dev/null +++ b/ziplib/inffixed.h @@ -0,0 +1,151 @@ +/* inffixed.h -- table for decoding fixed codes + * Generated automatically by the maketree.c program + */ + +/* WARNING: this file should *not* be used by applications. It is + part of the implementation of the compression library and is + subject to change. Applications should only use zlib.h. + */ + +local uInt fixed_bl = 9; +local uInt fixed_bd = 5; +local inflate_huft fixed_tl[] = { + {{{96,7}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115}, + {{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},192}, + {{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},160}, + {{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},224}, + {{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},144}, + {{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},208}, + {{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},176}, + {{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},240}, + {{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227}, + {{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},200}, + {{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},168}, + {{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},232}, + {{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},152}, + {{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},216}, + {{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},184}, + {{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},248}, + {{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163}, + {{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},196}, + {{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},164}, + {{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},228}, + {{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},148}, + {{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},212}, + {{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},180}, + {{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},244}, + {{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0}, + {{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},204}, + {{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},172}, + {{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},236}, + {{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},156}, + {{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},220}, + {{{82,7}},27}, {{{0,8}},110}, {{{0,8}},46}, {{{0,9}},188}, + {{{0,8}},14}, {{{0,8}},142}, {{{0,8}},78}, {{{0,9}},252}, + {{{96,7}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131}, + {{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},194}, + {{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},162}, + {{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},226}, + {{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},146}, + {{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},210}, + {{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},178}, + {{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},242}, + {{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258}, + {{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},202}, + {{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},170}, + {{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},234}, + {{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},154}, + {{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},218}, + {{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},186}, + {{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},250}, + {{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195}, + {{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},198}, + {{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},166}, + {{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},230}, + {{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},150}, + {{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},214}, + {{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},182}, + {{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},246}, + {{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0}, + {{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},206}, + {{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},174}, + {{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},238}, + {{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},158}, + {{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},222}, + {{{82,7}},27}, {{{0,8}},111}, {{{0,8}},47}, {{{0,9}},190}, + {{{0,8}},15}, {{{0,8}},143}, {{{0,8}},79}, {{{0,9}},254}, + {{{96,7}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115}, + {{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},193}, + {{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},161}, + {{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},225}, + {{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},145}, + {{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},209}, + {{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},177}, + {{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},241}, + {{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227}, + {{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},201}, + {{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},169}, + {{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},233}, + {{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},153}, + {{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},217}, + {{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},185}, + {{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},249}, + {{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163}, + {{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},197}, + {{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},165}, + {{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},229}, + {{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},149}, + {{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},213}, + {{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},181}, + {{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},245}, + {{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0}, + {{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},205}, + {{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},173}, + {{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},237}, + {{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},157}, + {{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},221}, + {{{82,7}},27}, {{{0,8}},110}, {{{0,8}},46}, {{{0,9}},189}, + {{{0,8}},14}, {{{0,8}},142}, {{{0,8}},78}, {{{0,9}},253}, + {{{96,7}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131}, + {{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},195}, + {{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},163}, + {{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},227}, + {{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},147}, + {{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},211}, + {{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},179}, + {{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},243}, + {{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258}, + {{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},203}, + {{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},171}, + {{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},235}, + {{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},155}, + {{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},219}, + {{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},187}, + {{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},251}, + {{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195}, + {{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},199}, + {{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},167}, + {{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},231}, + {{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},151}, + {{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},215}, + {{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},183}, + {{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},247}, + {{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0}, + {{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},207}, + {{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},175}, + {{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},239}, + {{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},159}, + {{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},223}, + {{{82,7}},27}, {{{0,8}},111}, {{{0,8}},47}, {{{0,9}},191}, + {{{0,8}},15}, {{{0,8}},143}, {{{0,8}},79}, {{{0,9}},255} + }; +local inflate_huft fixed_td[] = { + {{{80,5}},1}, {{{87,5}},257}, {{{83,5}},17}, {{{91,5}},4097}, + {{{81,5}},5}, {{{89,5}},1025}, {{{85,5}},65}, {{{93,5}},16385}, + {{{80,5}},3}, {{{88,5}},513}, {{{84,5}},33}, {{{92,5}},8193}, + {{{82,5}},9}, {{{90,5}},2049}, {{{86,5}},129}, {{{192,5}},24577}, + {{{80,5}},2}, {{{87,5}},385}, {{{83,5}},25}, {{{91,5}},6145}, + {{{81,5}},7}, {{{89,5}},1537}, {{{85,5}},97}, {{{93,5}},24577}, + {{{80,5}},4}, {{{88,5}},769}, {{{84,5}},49}, {{{92,5}},12289}, + {{{82,5}},13}, {{{90,5}},3073}, {{{86,5}},193}, {{{192,5}},24577} + }; diff --git a/ziplib/inflate.c b/ziplib/inflate.c new file mode 100644 index 0000000..5577e02 --- /dev/null +++ b/ziplib/inflate.c @@ -0,0 +1,366 @@ +/* inflate.c -- zlib interface to inflate modules + * Copyright (C) 1995-2002 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 */ + +typedef enum { + METHOD, /* waiting for method byte */ + FLAG, /* waiting for flag byte */ + DICT4, /* four dictionary check bytes to go */ + DICT3, /* three dictionary check bytes to go */ + DICT2, /* two dictionary check bytes to go */ + DICT1, /* one dictionary check byte to go */ + DICT0, /* waiting for inflateSetDictionary */ + 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 */ + BAD} /* got an error--stay here */ +inflate_mode; + +/* inflate private state */ +struct internal_state { + + /* mode */ + inflate_mode mode; /* current inflate mode */ + + /* mode dependent information */ + union { + uInt method; /* if FLAGS, method byte */ + struct { + uLong was; /* computed check value */ + uLong need; /* stream check value */ + } check; /* if CHECK, check values to compare */ + uInt marker; /* if BAD, inflateSync's marker bytes count */ + } sub; /* submode */ + + /* mode independent information */ + int nowrap; /* flag for no wrapper */ + uInt wbits; /* log2(window size) (8..15, defaults to 15) */ + inflate_blocks_statef + *blocks; /* current inflate_blocks state */ + +}; + + +int ZEXPORT inflateReset(z) +z_streamp z; +{ + 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, Z_NULL); + Tracev((stderr, "inflate: reset\n")); + return Z_OK; +} + + +int ZEXPORT inflateEnd(z) +z_streamp z; +{ + 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); + ZFREE(z, z->state); + z->state = Z_NULL; + Tracev((stderr, "inflate: end\n")); + return Z_OK; +} + + +int ZEXPORT inflateInit2_(z, w, version, stream_size) +z_streamp z; +int w; +const char *version; +int stream_size; +{ + if (version == Z_NULL || version[0] != ZLIB_VERSION[0] || + stream_size != sizeof(z_stream)) + return Z_VERSION_ERROR; + + /* initialize state */ + if (z == Z_NULL) + return Z_STREAM_ERROR; + z->msg = Z_NULL; + if (z->zalloc == Z_NULL) + { + z->zalloc = zcalloc; + z->opaque = (voidpf)0; + } + if (z->zfree == Z_NULL) z->zfree = zcfree; + if ((z->state = (struct internal_state FAR *) + ZALLOC(z,1,sizeof(struct internal_state))) == Z_NULL) + return Z_MEM_ERROR; + z->state->blocks = Z_NULL; + + /* handle undocumented nowrap option (no zlib header or check) */ + z->state->nowrap = 0; + if (w < 0) + { + w = - w; + z->state->nowrap = 1; + } + + /* set window size */ + if (w < 8 || w > 15) + { + inflateEnd(z); + return Z_STREAM_ERROR; + } + z->state->wbits = (uInt)w; + + /* create inflate_blocks state */ + if ((z->state->blocks = + inflate_blocks_new(z, z->state->nowrap ? Z_NULL : adler32, (uInt)1 << w)) + == Z_NULL) + { + inflateEnd(z); + return Z_MEM_ERROR; + } + Tracev((stderr, "inflate: allocated\n")); + + /* reset state */ + inflateReset(z); + return Z_OK; +} + + +int ZEXPORT inflateInit_(z, version, stream_size) +z_streamp z; +const char *version; +int stream_size; +{ + return inflateInit2_(z, DEF_WBITS, version, stream_size); +} + + +#define NEEDBYTE {if(z->avail_in==0)return r;r=f;} +#define NEXTBYTE (z->avail_in--,z->total_in++,*z->next_in++) + +int ZEXPORT inflate(z, f) +z_streamp z; +int f; +{ + int r; + uInt b; + + if (z == Z_NULL || z->state == Z_NULL || z->next_in == Z_NULL) + return Z_STREAM_ERROR; + f = f == Z_FINISH ? Z_BUF_ERROR : Z_OK; + r = Z_BUF_ERROR; + while (1) switch (z->state->mode) + { + case METHOD: + NEEDBYTE + if (((z->state->sub.method = NEXTBYTE) & 0xf) != Z_DEFLATED) + { + z->state->mode = BAD; + z->msg = (char*)"unknown compression method"; + z->state->sub.marker = 5; /* can't try inflateSync */ + break; + } + if ((z->state->sub.method >> 4) + 8 > z->state->wbits) + { + z->state->mode = BAD; + z->msg = (char*)"invalid window size"; + z->state->sub.marker = 5; /* can't try inflateSync */ + break; + } + z->state->mode = FLAG; + case FLAG: + NEEDBYTE + b = NEXTBYTE; + if (((z->state->sub.method << 8) + b) % 31) + { + z->state->mode = BAD; + z->msg = (char*)"incorrect header check"; + z->state->sub.marker = 5; /* can't try inflateSync */ + break; + } + Tracev((stderr, "inflate: zlib header ok\n")); + if (!(b & PRESET_DICT)) + { + z->state->mode = BLOCKS; + break; + } + z->state->mode = DICT4; + case DICT4: + NEEDBYTE + z->state->sub.check.need = (uLong)NEXTBYTE << 24; + z->state->mode = DICT3; + case DICT3: + NEEDBYTE + z->state->sub.check.need += (uLong)NEXTBYTE << 16; + z->state->mode = DICT2; + case DICT2: + NEEDBYTE + z->state->sub.check.need += (uLong)NEXTBYTE << 8; + z->state->mode = DICT1; + case DICT1: + NEEDBYTE + z->state->sub.check.need += (uLong)NEXTBYTE; + z->adler = z->state->sub.check.need; + z->state->mode = DICT0; + return Z_NEED_DICT; + case DICT0: + z->state->mode = BAD; + z->msg = (char*)"need dictionary"; + z->state->sub.marker = 0; /* can try inflateSync */ + return Z_STREAM_ERROR; + case BLOCKS: + 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_OK) + r = f; + if (r != Z_STREAM_END) + return r; + r = f; + inflate_blocks_reset(z->state->blocks, z, &z->state->sub.check.was); + if (z->state->nowrap) + { + z->state->mode = DONE; + break; + } + z->state->mode = CHECK4; + case CHECK4: + NEEDBYTE + z->state->sub.check.need = (uLong)NEXTBYTE << 24; + z->state->mode = CHECK3; + case CHECK3: + NEEDBYTE + z->state->sub.check.need += (uLong)NEXTBYTE << 16; + z->state->mode = CHECK2; + case CHECK2: + NEEDBYTE + z->state->sub.check.need += (uLong)NEXTBYTE << 8; + z->state->mode = CHECK1; + case CHECK1: + NEEDBYTE + z->state->sub.check.need += (uLong)NEXTBYTE; + + if (z->state->sub.check.was != z->state->sub.check.need) + { + z->state->mode = BAD; + z->msg = (char*)"incorrect data check"; + z->state->sub.marker = 5; /* can't try inflateSync */ + break; + } + Tracev((stderr, "inflate: zlib check ok\n")); + z->state->mode = DONE; + case DONE: + return Z_STREAM_END; + case BAD: + return Z_DATA_ERROR; + default: + return Z_STREAM_ERROR; + } +#ifdef NEED_DUMMY_RETURN + return Z_STREAM_ERROR; /* Some dumb compilers complain without this */ +#endif +} + + +int ZEXPORT inflateSetDictionary(z, dictionary, dictLength) +z_streamp z; +const Bytef *dictionary; +uInt dictLength; +{ + uInt length = dictLength; + + if (z == Z_NULL || z->state == Z_NULL || z->state->mode != DICT0) + return Z_STREAM_ERROR; + + if (adler32(1L, dictionary, dictLength) != z->adler) return Z_DATA_ERROR; + z->adler = 1L; + + if (length >= ((uInt)1<state->wbits)) + { + length = (1<state->wbits)-1; + dictionary += dictLength - length; + } + inflate_set_dictionary(z->state->blocks, dictionary, length); + z->state->mode = BLOCKS; + return Z_OK; +} + + +int ZEXPORT inflateSync(z) +z_streamp z; +{ + uInt n; /* number of bytes to look at */ + Bytef *p; /* pointer to bytes */ + uInt m; /* number of marker bytes found in a row */ + uLong r, w; /* temporaries to save total_in and total_out */ + + /* 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) + { + static const Byte mark[4] = {0, 0, 0xff, 0xff}; + if (*p == mark[m]) + 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; + r = z->total_in; w = z->total_out; + inflateReset(z); + z->total_in = r; z->total_out = w; + z->state->mode = BLOCKS; + return Z_OK; +} + + +/* Returns true if inflate is currently at the end of a block generated + * by Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP + * implementation to provide an additional safety check. PPP uses Z_SYNC_FLUSH + * but removes the length bytes of the resulting empty stored block. When + * decompressing, PPP checks that at the end of input packet, inflate is + * waiting for these length bytes. + */ +int ZEXPORT inflateSyncPoint(z) +z_streamp z; +{ + if (z == Z_NULL || z->state == Z_NULL || z->state->blocks == Z_NULL) + return Z_STREAM_ERROR; + return inflate_blocks_sync_point(z->state->blocks); +} diff --git a/ziplib/inftrees.c b/ziplib/inftrees.c new file mode 100644 index 0000000..f89e801 --- /dev/null +++ b/ziplib/inftrees.c @@ -0,0 +1,454 @@ +/* inftrees.c -- generate Huffman trees for efficient decoding + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +#include "zutil.h" +#include "inftrees.h" + +#if !defined(BUILDFIXED) && !defined(STDC) +# define BUILDFIXED /* non ANSI compilers may not accept inffixed.h */ +#endif + +const char inflate_copyright[] = + " inflate 1.1.4 Copyright 1995-2002 Mark Adler "; +/* + If you use the zlib library in a product, an acknowledgment is welcome + in the documentation of your product. If for some reason you cannot + include such an acknowledgment, I would appreciate that you keep this + copyright string in the executable of your product. + */ +struct internal_state {int dummy;}; /* for buggy compilers */ + +/* simplify the use of the inflate_huft type with some defines */ +#define exop word.what.Exop +#define bits word.what.Bits + + +local int huft_build OF(( + uIntf *, /* code lengths in bits */ + uInt, /* number of codes */ + uInt, /* number of "simple" codes */ + const uIntf *, /* list of base values for non-simple codes */ + const uIntf *, /* list of extra bits for non-simple codes */ + inflate_huft * FAR*,/* result: starting table */ + uIntf *, /* maximum lookup bits (returns actual) */ + inflate_huft *, /* space for trees */ + uInt *, /* hufts used in space */ + uIntf * )); /* space for values */ + +/* Tables for deflate from PKZIP's appnote.txt. */ +local const uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */ + 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, + 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0}; + /* see note #13 above about 258 */ +local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */ + 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, + 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112}; /* 112==invalid */ +local const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */ + 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, + 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, + 8193, 12289, 16385, 24577}; +local const uInt cpdext[30] = { /* Extra bits for distance codes */ + 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, + 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, + 12, 12, 13, 13}; + +/* + Huffman code decoding is performed using a multi-level table lookup. + The fastest way to decode is to simply build a lookup table whose + size is determined by the longest code. However, the time it takes + to build this table can also be a factor if the data being decoded + is not very long. The most common codes are necessarily the + shortest codes, so those codes dominate the decoding time, and hence + the speed. The idea is you can have a shorter table that decodes the + shorter, more probable codes, and then point to subsidiary tables for + the longer codes. The time it costs to decode the longer codes is + then traded against the time it takes to make longer tables. + + This results of this trade are in the variables lbits and dbits + below. lbits is the number of bits the first level table for literal/ + length codes can decode in one step, and dbits is the same thing for + the distance codes. Subsequent tables are also less than or equal to + those sizes. These values may be adjusted either when all of the + codes are shorter than that, in which case the longest code length in + bits is used, or when the shortest code is *longer* than the requested + table size, in which case the length of the shortest code in bits is + used. + + There are two different values for the two tables, since they code a + different number of possibilities each. The literal/length table + codes 286 possible values, or in a flat code, a little over eight + bits. The distance table codes 30 possible values, or a little less + than five bits, flat. The optimum values for speed end up being + about one bit more than those, so lbits is 8+1 and dbits is 5+1. + The optimum values may differ though from machine to machine, and + possibly even between compilers. Your mileage may vary. + */ + + +/* If BMAX needs to be larger than 16, then h and x[] should be uLong. */ +#define BMAX 15 /* maximum bit length of any code */ + +local int huft_build(b, n, s, d, e, t, m, hp, hn, v) +uIntf *b; /* code lengths in bits (all assumed <= BMAX) */ +uInt n; /* number of codes (assumed <= 288) */ +uInt s; /* number of simple-valued codes (0..s-1) */ +const uIntf *d; /* list of base values for non-simple codes */ +const uIntf *e; /* list of extra bits for non-simple codes */ +inflate_huft * FAR *t; /* result: starting table */ +uIntf *m; /* maximum lookup bits, returns actual */ +inflate_huft *hp; /* space for trees */ +uInt *hn; /* hufts used in space */ +uIntf *v; /* working area: values in order of bit length */ +/* Given a list of code lengths and a maximum table size, make a set of + tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR + if the given code set is incomplete (the tables are still built in this + case), or Z_DATA_ERROR if the input is invalid. */ +{ + + uInt a; /* counter for codes of length k */ + uInt c[BMAX+1]; /* bit length count table */ + uInt f; /* i repeats in table every f entries */ + int g; /* maximum code length */ + int h; /* table level */ + register uInt i; /* counter, current code */ + register uInt j; /* counter */ + register int k; /* number of bits in current code */ + int l; /* bits per table (returned in m) */ + uInt mask; /* (1 << w) - 1, to avoid cc -O bug on HP */ + register uIntf *p; /* pointer into c[], b[], or v[] */ + inflate_huft *q; /* points to current table */ + struct inflate_huft_s r; /* table entry for structure assignment */ + inflate_huft *u[BMAX]; /* table stack */ + register int w; /* bits before this table == (l * h) */ + uInt x[BMAX+1]; /* bit offsets, then code stack */ + uIntf *xp; /* pointer into x */ + int y; /* number of dummy codes added */ + uInt z; /* number of entries in current table */ + + + /* Generate counts for each bit length */ + p = c; +#define C0 *p++ = 0; +#define C2 C0 C0 C0 C0 +#define C4 C2 C2 C2 C2 + C4 /* clear c[]--assume BMAX+1 is 16 */ + p = b; i = n; + do { + c[*p++]++; /* assume all entries <= BMAX */ + } while (--i); + if (c[0] == n) /* null input--all zero length codes */ + { + *t = (inflate_huft *)Z_NULL; + *m = 0; + return Z_OK; + } + + + /* Find minimum and maximum length, bound *m by those */ + l = *m; + for (j = 1; j <= BMAX; j++) + if (c[j]) + break; + k = j; /* minimum code length */ + if ((uInt)l < j) + l = j; + for (i = BMAX; i; i--) + if (c[i]) + break; + g = i; /* maximum code length */ + if ((uInt)l > i) + l = i; + *m = l; + + + /* Adjust last length count to fill out codes, if needed */ + for (y = 1 << j; j < i; j++, y <<= 1) + if ((y -= c[j]) < 0) + return Z_DATA_ERROR; + if ((y -= c[i]) < 0) + return Z_DATA_ERROR; + c[i] += y; + + + /* Generate starting offsets into the value table for each length */ + x[1] = j = 0; + p = c + 1; xp = x + 2; + while (--i) { /* note that i == g from above */ + *xp++ = (j += *p++); + } + + + /* Make a table of values in order of bit lengths */ + p = b; i = 0; + do { + if ((j = *p++) != 0) + v[x[j]++] = i; + } while (++i < n); + n = x[g]; /* set n to length of v */ + + + /* Generate the Huffman codes and for each, make the table entries */ + x[0] = i = 0; /* first Huffman code is zero */ + p = v; /* grab values in bit order */ + h = -1; /* no tables yet--level -1 */ + w = -l; /* bits decoded == (l * h) */ + u[0] = (inflate_huft *)Z_NULL; /* just to keep compilers happy */ + q = (inflate_huft *)Z_NULL; /* ditto */ + z = 0; /* ditto */ + + /* go through the bit lengths (k already is bits in shortest code) */ + for (; k <= g; k++) + { + a = c[k]; + while (a--) + { + /* here i is the Huffman code of length k bits for value *p */ + /* make tables up to required level */ + while (k > w + l) + { + h++; + w += l; /* previous table always l bits */ + + /* compute minimum size table less than or equal to l bits */ + z = g - w; + z = z > (uInt)l ? l : z; /* table size upper limit */ + if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */ + { /* too few codes for k-w bit table */ + f -= a + 1; /* deduct codes from patterns left */ + xp = c + k; + if (j < z) + while (++j < z) /* try smaller tables up to z bits */ + { + if ((f <<= 1) <= *++xp) + break; /* enough codes to use up j bits */ + f -= *xp; /* else deduct codes from patterns */ + } + } + z = 1 << j; /* table entries for j-bit table */ + + /* allocate new table */ + if (*hn + z > MANY) /* (note: doesn't matter for fixed) */ + return Z_DATA_ERROR; /* overflow of MANY */ + u[h] = q = hp + *hn; + *hn += z; + + /* connect to last table, if there is one */ + if (h) + { + x[h] = i; /* save pattern for backing up */ + r.bits = (Byte)l; /* bits to dump before this table */ + r.exop = (Byte)j; /* bits in this table */ + j = i >> (w - l); + r.base = (uInt)(q - u[h-1] - j); /* offset to this table */ + u[h-1][j] = r; /* connect to last table */ + } + else + *t = q; /* first table is returned result */ + } + + /* set up table entry in r */ + r.bits = (Byte)(k - w); + if (p >= v + n) + r.exop = 128 + 64; /* out of values--invalid code */ + else if (*p < s) + { + r.exop = (Byte)(*p < 256 ? 0 : 32 + 64); /* 256 is end-of-block */ + r.base = *p++; /* simple code is just the value */ + } + else + { + r.exop = (Byte)(e[*p - s] + 16 + 64);/* non-simple--look up in lists */ + r.base = d[*p++ - s]; + } + + /* fill code-like entries with r */ + f = 1 << (k - w); + for (j = i >> w; j < z; j += f) + q[j] = r; + + /* backwards increment the k-bit code i */ + for (j = 1 << (k - 1); i & j; j >>= 1) + i ^= j; + i ^= j; + + /* backup over finished tables */ + mask = (1 << w) - 1; /* needed on HP, cc -O bug */ + while ((i & mask) != x[h]) + { + h--; /* don't need to update q */ + w -= l; + mask = (1 << w) - 1; + } + } + } + + + /* Return Z_BUF_ERROR if we were given an incomplete table */ + return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK; +} + + +int inflate_trees_bits(c, bb, tb, hp, z) +uIntf *c; /* 19 code lengths */ +uIntf *bb; /* bits tree desired/actual depth */ +inflate_huft * FAR *tb; /* bits tree result */ +inflate_huft *hp; /* space for trees */ +z_streamp z; /* for messages */ +{ + int r; + uInt hn = 0; /* hufts used in space */ + uIntf *v; /* work area for huft_build */ + + if ((v = (uIntf*)ZALLOC(z, 19, sizeof(uInt))) == Z_NULL) + return Z_MEM_ERROR; + r = huft_build(c, 19, 19, (uIntf*)Z_NULL, (uIntf*)Z_NULL, + tb, bb, hp, &hn, v); + if (r == Z_DATA_ERROR) + z->msg = (char*)"oversubscribed dynamic bit lengths tree"; + else if (r == Z_BUF_ERROR || *bb == 0) + { + z->msg = (char*)"incomplete dynamic bit lengths tree"; + r = Z_DATA_ERROR; + } + ZFREE(z, v); + return r; +} + + +int inflate_trees_dynamic(nl, nd, c, bl, bd, tl, td, hp, z) +uInt nl; /* number of literal/length codes */ +uInt nd; /* number of distance codes */ +uIntf *c; /* that many (total) code lengths */ +uIntf *bl; /* literal desired/actual bit depth */ +uIntf *bd; /* distance desired/actual bit depth */ +inflate_huft * FAR *tl; /* literal/length tree result */ +inflate_huft * FAR *td; /* distance tree result */ +inflate_huft *hp; /* space for trees */ +z_streamp z; /* for messages */ +{ + int r; + uInt hn = 0; /* hufts used in space */ + uIntf *v; /* work area for huft_build */ + + /* allocate work area */ + if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL) + return Z_MEM_ERROR; + + /* build literal/length tree */ + r = huft_build(c, nl, 257, cplens, cplext, tl, bl, hp, &hn, v); + if (r != Z_OK || *bl == 0) + { + if (r == Z_DATA_ERROR) + z->msg = (char*)"oversubscribed literal/length tree"; + else if (r != Z_MEM_ERROR) + { + z->msg = (char*)"incomplete literal/length tree"; + r = Z_DATA_ERROR; + } + ZFREE(z, v); + return r; + } + + /* build distance tree */ + r = huft_build(c + nl, nd, 0, cpdist, cpdext, td, bd, hp, &hn, v); + if (r != Z_OK || (*bd == 0 && nl > 257)) + { + if (r == Z_DATA_ERROR) + z->msg = (char*)"oversubscribed distance tree"; + else if (r == Z_BUF_ERROR) { +#ifdef PKZIP_BUG_WORKAROUND + r = Z_OK; + } +#else + z->msg = (char*)"incomplete distance tree"; + r = Z_DATA_ERROR; + } + else if (r != Z_MEM_ERROR) + { + z->msg = (char*)"empty distance tree with lengths"; + r = Z_DATA_ERROR; + } + ZFREE(z, v); + return r; +#endif + } + + /* done */ + ZFREE(z, v); + return Z_OK; +} + + +/* build fixed tables only once--keep them here */ +#ifdef BUILDFIXED +local int fixed_built = 0; +#define FIXEDH 544 /* number of hufts used by fixed tables */ +local inflate_huft fixed_mem[FIXEDH]; +local uInt fixed_bl; +local uInt fixed_bd; +local inflate_huft *fixed_tl; +local inflate_huft *fixed_td; +#else +#include "inffixed.h" +#endif + + +int inflate_trees_fixed(bl, bd, tl, td, z) +uIntf *bl; /* literal desired/actual bit depth */ +uIntf *bd; /* distance desired/actual bit depth */ +inflate_huft * FAR *tl; /* literal/length tree result */ +inflate_huft * FAR *td; /* distance tree result */ +z_streamp z; /* for memory allocation */ +{ +#ifdef BUILDFIXED + /* build fixed tables if not already */ + if (!fixed_built) + { + int k; /* temporary variable */ + uInt f = 0; /* number of hufts used in fixed_mem */ + uIntf *c; /* length list for huft_build */ + uIntf *v; /* work area for huft_build */ + + /* allocate memory */ + if ((c = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL) + return Z_MEM_ERROR; + if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL) + { + ZFREE(z, c); + return Z_MEM_ERROR; + } + + /* literal table */ + for (k = 0; k < 144; k++) + c[k] = 8; + for (; k < 256; k++) + c[k] = 9; + for (; k < 280; k++) + c[k] = 7; + for (; k < 288; k++) + c[k] = 8; + fixed_bl = 9; + huft_build(c, 288, 257, cplens, cplext, &fixed_tl, &fixed_bl, + fixed_mem, &f, v); + + /* distance table */ + for (k = 0; k < 30; k++) + c[k] = 5; + fixed_bd = 5; + huft_build(c, 30, 0, cpdist, cpdext, &fixed_td, &fixed_bd, + fixed_mem, &f, v); + + /* done */ + ZFREE(z, v); + ZFREE(z, c); + fixed_built = 1; + } +#endif + *bl = fixed_bl; + *bd = fixed_bd; + *tl = fixed_tl; + *td = fixed_td; + return Z_OK; +} diff --git a/ziplib/inftrees.h b/ziplib/inftrees.h new file mode 100644 index 0000000..affbb3b --- /dev/null +++ b/ziplib/inftrees.h @@ -0,0 +1,58 @@ +/* inftrees.h -- header to use inftrees.c + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* WARNING: this file should *not* be used by applications. It is + part of the implementation of the compression library and is + subject to change. Applications should only use zlib.h. + */ + +/* 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). */ + +typedef struct inflate_huft_s FAR inflate_huft; + +struct inflate_huft_s { + union { + struct { + Byte Exop; /* number of extra bits or operation */ + Byte Bits; /* number of bits in this code or subcode */ + } what; + uInt pad; /* pad structure to a power of 2 (4 bytes for */ + } word; /* 16-bit, 8 bytes for 32-bit int's) */ + uInt base; /* literal, length base, distance base, + or table offset */ +}; + +/* Maximum size of dynamic tree. The maximum found in a long but non- + exhaustive search was 1004 huft structures (850 for length/literals + and 154 for distances, the latter actually the result of an + exhaustive search). The actual maximum is not known, but the + value below is more than safe. */ +#define MANY 1440 + +extern int inflate_trees_bits OF(( + uIntf *, /* 19 code lengths */ + uIntf *, /* bits tree desired/actual depth */ + inflate_huft * FAR *, /* bits tree result */ + inflate_huft *, /* space for trees */ + z_streamp)); /* for messages */ + +extern int inflate_trees_dynamic OF(( + uInt, /* number of literal/length codes */ + uInt, /* number of distance codes */ + uIntf *, /* that many (total) code lengths */ + uIntf *, /* literal desired/actual bit depth */ + uIntf *, /* distance desired/actual bit depth */ + inflate_huft * FAR *, /* literal/length tree result */ + inflate_huft * FAR *, /* distance tree result */ + inflate_huft *, /* space for trees */ + z_streamp)); /* for messages */ + +extern int inflate_trees_fixed OF(( + uIntf *, /* literal desired/actual bit depth */ + uIntf *, /* distance desired/actual bit depth */ + inflate_huft * FAR *, /* literal/length tree result */ + inflate_huft * FAR *, /* distance tree result */ + z_streamp)); /* for memory allocation */ diff --git a/ziplib/infutil.c b/ziplib/infutil.c new file mode 100644 index 0000000..976d5e5 --- /dev/null +++ b/ziplib/infutil.c @@ -0,0 +1,87 @@ +/* inflate_util.c -- data and routines common to blocks and codes + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +#include "zutil.h" +#include "infblock.h" +#include "inftrees.h" +#include "infcodes.h" +#include "infutil.h" + +struct inflate_codes_state {int dummy;}; /* for buggy compilers */ + +/* And'ing with mask[n] masks the lower n bits */ +uInt inflate_mask[17] = { + 0x0000, + 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff, + 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff +}; + + +/* copy as much as possible from the sliding window to the output area */ +int inflate_flush(s, z, r) +inflate_blocks_statef *s; +z_streamp z; +int r; +{ + uInt n; + Bytef *p; + Bytef *q; + + /* local copies of source and destination pointers */ + p = z->next_out; + q = s->read; + + /* compute number of bytes to copy as far as end of window */ + n = (uInt)((q <= s->write ? s->write : s->end) - q); + if (n > z->avail_out) n = z->avail_out; + if (n && r == Z_BUF_ERROR) r = Z_OK; + + /* update counters */ + z->avail_out -= n; + z->total_out += n; + + /* update check information */ + if (s->checkfn != Z_NULL) + z->adler = s->check = (*s->checkfn)(s->check, q, n); + + /* copy as far as end of window */ + zmemcpy(p, q, n); + p += n; + q += n; + + /* see if more to copy at beginning of window */ + if (q == s->end) + { + /* wrap pointers */ + q = s->window; + if (s->write == s->end) + s->write = s->window; + + /* compute bytes to copy */ + n = (uInt)(s->write - q); + if (n > z->avail_out) n = z->avail_out; + if (n && r == Z_BUF_ERROR) r = Z_OK; + + /* update counters */ + z->avail_out -= n; + z->total_out += n; + + /* update check information */ + if (s->checkfn != Z_NULL) + z->adler = s->check = (*s->checkfn)(s->check, q, n); + + /* copy */ + zmemcpy(p, q, n); + p += n; + q += n; + } + + /* update pointers */ + z->next_out = p; + s->read = q; + + /* done */ + return r; +} diff --git a/ziplib/infutil.h b/ziplib/infutil.h new file mode 100644 index 0000000..0c0ace3 --- /dev/null +++ b/ziplib/infutil.h @@ -0,0 +1,98 @@ +/* infutil.h -- types and macros common to blocks and codes + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* WARNING: this file should *not* be used by applications. It is + part of the implementation of the compression library and is + subject to change. Applications should only use zlib.h. + */ + +#ifndef _INFUTIL_H +#define _INFUTIL_H + +typedef enum { + TYPE, /* get type bits (3, including end bit) */ + LENS, /* get lengths for stored */ + STORED, /* processing stored block */ + TABLE, /* get table lengths */ + BTREE, /* get bit lengths tree for a dynamic block */ + DTREE, /* get length, distance trees for a dynamic block */ + CODES, /* processing fixed or dynamic block */ + DRY, /* output remaining window bytes */ + DONE, /* finished last block, done */ + BAD} /* got a data error--stuck here */ +inflate_block_mode; + +/* inflate blocks semi-private state */ +struct inflate_blocks_state { + + /* mode */ + inflate_block_mode mode; /* current inflate_block mode */ + + /* mode dependent information */ + union { + uInt left; /* if STORED, bytes left to copy */ + struct { + uInt table; /* table lengths (14 bits) */ + uInt index; /* index into blens (or border) */ + uIntf *blens; /* bit lengths of codes */ + uInt bb; /* bit length tree depth */ + inflate_huft *tb; /* bit length decoding tree */ + } trees; /* if DTREE, decoding info for trees */ + struct { + inflate_codes_statef + *codes; + } decode; /* if CODES, current state */ + } sub; /* submode */ + uInt last; /* true if this block is the last block */ + + /* mode independent information */ + uInt bitk; /* bits in bit buffer */ + uLong bitb; /* bit buffer */ + inflate_huft *hufts; /* single malloc for tree space */ + Bytef *window; /* sliding window */ + Bytef *end; /* one byte after sliding window */ + Bytef *read; /* window read pointer */ + Bytef *write; /* window write pointer */ + check_func checkfn; /* check function */ + uLong check; /* check on output */ + +}; + + +/* defines for inflate input/output */ +/* update pointers and return */ +#define UPDBITS {s->bitb=b;s->bitk=k;} +#define UPDIN {z->avail_in=n;z->total_in+=p-z->next_in;z->next_in=p;} +#define UPDOUT {s->write=q;} +#define UPDATE {UPDBITS UPDIN UPDOUT} +#define LEAVE {UPDATE return inflate_flush(s,z,r);} +/* get bytes and bits */ +#define LOADIN {p=z->next_in;n=z->avail_in;b=s->bitb;k=s->bitk;} +#define NEEDBYTE {if(n)r=Z_OK;else LEAVE} +#define NEXTBYTE (n--,*p++) +#define NEEDBITS(j) {while(k<(j)){NEEDBYTE;b|=((uLong)NEXTBYTE)<>=(j);k-=(j);} +/* output bytes */ +#define WAVAIL (uInt)(qread?s->read-q-1:s->end-q) +#define LOADOUT {q=s->write;m=(uInt)WAVAIL;} +#define WRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}} +#define FLUSH {UPDOUT r=inflate_flush(s,z,r); LOADOUT} +#define NEEDOUT {if(m==0){WRAP if(m==0){FLUSH WRAP if(m==0) LEAVE}}r=Z_OK;} +#define OUTBYTE(a) {*q++=(Byte)(a);m--;} +/* load local pointers */ +#define LOAD {LOADIN LOADOUT} + +/* masks for lower bits (size given to avoid silly warnings with Visual C++) */ +extern uInt inflate_mask[17]; + +/* copy as much as possible from the sliding window to the output area */ +extern int inflate_flush OF(( + inflate_blocks_statef *, + z_streamp , + int)); + +struct internal_state {int dummy;}; /* for buggy compilers */ + +#endif diff --git a/ziplib/maketree.c b/ziplib/maketree.c new file mode 100644 index 0000000..5cfeb5d --- /dev/null +++ b/ziplib/maketree.c @@ -0,0 +1,51 @@ +/* maketree.c -- make inffixed.h table for decoding fixed codes + * Copyright (C) 1995-2002 Mark Adler + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* WARNING: this file should *not* be used by applications. It is + part of the implementation of the compression library and is + subject to change. Applications should only use zlib.h. + */ + +/* This program is included in the distribution for completeness. + You do not need to compile or run this program since inffixed.h + is already included in the distribution. To use this program + you need to compile zlib with BUILDFIXED defined and then compile + and link this program with the zlib library. Then the output of + this program can be piped to inffixed.h. */ + +#include +#include +#include "zutil.h" +#include "inftrees.h" + +/* simplify the use of the inflate_huft type with some defines */ +#define exop word.what.Exop +#define bits word.what.Bits + +/* generate initialization table for an inflate_huft structure array */ +void maketree(uInt b, inflate_huft *t) +{ + int i, e; + + i = 0; + while (1) + { + e = t[i].exop; + if (e && (e & (16+64)) == 0) /* table pointer */ + { + fprintf(stderr, "maketree: cannot initialize sub-tables!\n"); + exit(1); + } + if (i % 4 == 0) + printf("\n "); + printf(" {{{%u,%u}},%u}", t[i].exop, t[i].bits, t[i].base); + if (++i == (1< +#endif + +/* =========================================================================== + * Constants + */ + +#define MAX_BL_BITS 7 +/* Bit length codes must not exceed MAX_BL_BITS bits */ + +#define END_BLOCK 256 +/* end of block literal code */ + +#define REP_3_6 16 +/* repeat previous bit length 3-6 times (2 bits of repeat count) */ + +#define REPZ_3_10 17 +/* repeat a zero length 3-10 times (3 bits of repeat count) */ + +#define REPZ_11_138 18 +/* repeat a zero length 11-138 times (7 bits of repeat count) */ + +local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */ + = {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}; + +local const int extra_dbits[D_CODES] /* extra bits for each distance code */ + = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13}; + +local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ + = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7}; + +local const uch bl_order[BL_CODES] + = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15}; +/* The lengths of the bit length codes are sent in order of decreasing + * probability, to avoid transmitting the lengths for unused bit length codes. + */ + +#define Buf_size (8 * 2*sizeof(char)) +/* Number of bits used within bi_buf. (bi_buf might be implemented on + * more than 16 bits on some systems.) + */ + +/* =========================================================================== + * Local data. These are initialized only once. + */ + +#define DIST_CODE_LEN 512 /* see definition of array dist_code below */ + +#if defined(GEN_TREES_H) || !defined(STDC) +/* non ANSI compilers may not accept trees.h */ + +local ct_data static_ltree[L_CODES+2]; +/* The static literal tree. Since the bit lengths are imposed, there is no + * need for the L_CODES extra codes used during heap construction. However + * The codes 286 and 287 are needed to build a canonical tree (see _tr_init + * below). + */ + +local ct_data static_dtree[D_CODES]; +/* The static distance tree. (Actually a trivial tree since all codes use + * 5 bits.) + */ + +uch _dist_code[DIST_CODE_LEN]; +/* Distance codes. The first 256 values correspond to the distances + * 3 .. 258, the last 256 values correspond to the top 8 bits of + * the 15 bit distances. + */ + +uch _length_code[MAX_MATCH-MIN_MATCH+1]; +/* length code for each normalized match length (0 == MIN_MATCH) */ + +local int base_length[LENGTH_CODES]; +/* First normalized length for each code (0 = MIN_MATCH) */ + +local int base_dist[D_CODES]; +/* First normalized distance for each code (0 = distance of 1) */ + +#else +# include "trees.h" +#endif /* GEN_TREES_H */ + +struct static_tree_desc_s { + const ct_data *static_tree; /* static tree or NULL */ + const intf *extra_bits; /* extra bits for each code or NULL */ + int extra_base; /* base index for extra_bits */ + int elems; /* max number of elements in the tree */ + int max_length; /* max bit length for the codes */ +}; + +local static_tree_desc static_l_desc = +{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS}; + +local static_tree_desc static_d_desc = +{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS}; + +local static_tree_desc static_bl_desc = +{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; + +/* =========================================================================== + * Local (static) routines in this file. + */ + +local void tr_static_init OF((void)); +local void init_block OF((deflate_state *s)); +local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); +local void gen_bitlen OF((deflate_state *s, tree_desc *desc)); +local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); +local void build_tree OF((deflate_state *s, tree_desc *desc)); +local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code)); +local void send_tree OF((deflate_state *s, ct_data *tree, int max_code)); +local int build_bl_tree OF((deflate_state *s)); +local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes, + int blcodes)); +local void compress_block OF((deflate_state *s, ct_data *ltree, + ct_data *dtree)); +local void set_data_type OF((deflate_state *s)); +local unsigned bi_reverse OF((unsigned value, int length)); +local void bi_windup OF((deflate_state *s)); +local void bi_flush OF((deflate_state *s)); +local void copy_block OF((deflate_state *s, charf *buf, unsigned len, + int header)); + +#ifdef GEN_TREES_H +local void gen_trees_header OF((void)); +#endif + +#ifndef DEBUG +# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) + /* Send a code of the given tree. c and tree must not have side effects */ + +#else /* DEBUG */ +# define send_code(s, c, tree) \ + { if (z_verbose>2) fprintf(stderr,"\ncd %3d ",(c)); \ + send_bits(s, tree[c].Code, tree[c].Len); } +#endif + +/* =========================================================================== + * Output a short LSB first on the stream. + * IN assertion: there is enough room in pendingBuf. + */ +#define put_short(s, w) { \ + put_byte(s, (uch)((w) & 0xff)); \ + put_byte(s, (uch)((ush)(w) >> 8)); \ +} + +/* =========================================================================== + * Send a value on a given number of bits. + * IN assertion: length <= 16 and value fits in length bits. + */ +#ifdef DEBUG +local void send_bits OF((deflate_state *s, int value, int length)); + +local void send_bits(s, value, length) + deflate_state *s; + int value; /* value to send */ + int length; /* number of bits */ +{ + Tracevv((stderr," l %2d v %4x ", length, value)); + Assert(length > 0 && length <= 15, "invalid length"); + s->bits_sent += (ulg)length; + + /* If not enough room in bi_buf, use (valid) bits from bi_buf and + * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid)) + * unused bits in value. + */ + if (s->bi_valid > (int)Buf_size - length) { + s->bi_buf |= (value << s->bi_valid); + put_short(s, s->bi_buf); + s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); + s->bi_valid += length - Buf_size; + } else { + s->bi_buf |= value << s->bi_valid; + s->bi_valid += length; + } +} +#else /* !DEBUG */ + +#define send_bits(s, value, length) \ +{ int len = length;\ + if (s->bi_valid > (int)Buf_size - len) {\ + int val = value;\ + s->bi_buf |= (val << s->bi_valid);\ + put_short(s, s->bi_buf);\ + s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\ + s->bi_valid += len - Buf_size;\ + } else {\ + s->bi_buf |= (value) << s->bi_valid;\ + s->bi_valid += len;\ + }\ +} +#endif /* DEBUG */ + + +#define MAX(a,b) (a >= b ? a : b) +/* the arguments must not have side effects */ + +/* =========================================================================== + * Initialize the various 'constant' tables. + */ +local void tr_static_init() +{ +#if defined(GEN_TREES_H) || !defined(STDC) + static int static_init_done = 0; + int n; /* iterates over tree elements */ + int bits; /* bit counter */ + int length; /* length value */ + int code; /* code value */ + int dist; /* distance index */ + ush bl_count[MAX_BITS+1]; + /* number of codes at each bit length for an optimal tree */ + + if (static_init_done) return; + + /* For some embedded targets, global variables are not initialized: */ + static_l_desc.static_tree = static_ltree; + static_l_desc.extra_bits = extra_lbits; + static_d_desc.static_tree = static_dtree; + static_d_desc.extra_bits = extra_dbits; + static_bl_desc.extra_bits = extra_blbits; + + /* Initialize the mapping length (0..255) -> length code (0..28) */ + length = 0; + for (code = 0; code < LENGTH_CODES-1; code++) { + base_length[code] = length; + for (n = 0; n < (1< dist code (0..29) */ + dist = 0; + for (code = 0 ; code < 16; code++) { + base_dist[code] = dist; + for (n = 0; n < (1<>= 7; /* from now on, all distances are divided by 128 */ + for ( ; code < D_CODES; code++) { + base_dist[code] = dist << 7; + for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) { + _dist_code[256 + dist++] = (uch)code; + } + } + Assert (dist == 256, "tr_static_init: 256+dist != 512"); + + /* Construct the codes of the static literal tree */ + for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; + n = 0; + while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; + while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; + while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; + while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; + /* Codes 286 and 287 do not exist, but we must include them in the + * tree construction to get a canonical Huffman tree (longest code + * all ones) + */ + gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); + + /* The static distance tree is trivial: */ + for (n = 0; n < D_CODES; n++) { + static_dtree[n].Len = 5; + static_dtree[n].Code = bi_reverse((unsigned)n, 5); + } + static_init_done = 1; + +# ifdef GEN_TREES_H + gen_trees_header(); +# endif +#endif /* defined(GEN_TREES_H) || !defined(STDC) */ +} + +/* =========================================================================== + * Genererate the file trees.h describing the static trees. + */ +#ifdef GEN_TREES_H +# ifndef DEBUG +# include +# endif + +# define SEPARATOR(i, last, width) \ + ((i) == (last)? "\n};\n\n" : \ + ((i) % (width) == (width)-1 ? ",\n" : ", ")) + +void gen_trees_header() +{ + FILE *header = fopen("trees.h", "w"); + int i; + + Assert (header != NULL, "Can't open trees.h"); + fprintf(header, + "/* header created automatically with -DGEN_TREES_H */\n\n"); + + fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); + for (i = 0; i < L_CODES+2; i++) { + fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code, + static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); + } + + fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); + for (i = 0; i < D_CODES; i++) { + fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code, + static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); + } + + fprintf(header, "const uch _dist_code[DIST_CODE_LEN] = {\n"); + for (i = 0; i < DIST_CODE_LEN; i++) { + fprintf(header, "%2u%s", _dist_code[i], + SEPARATOR(i, DIST_CODE_LEN-1, 20)); + } + + fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); + for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { + fprintf(header, "%2u%s", _length_code[i], + SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); + } + + fprintf(header, "local const int base_length[LENGTH_CODES] = {\n"); + for (i = 0; i < LENGTH_CODES; i++) { + fprintf(header, "%1u%s", base_length[i], + SEPARATOR(i, LENGTH_CODES-1, 20)); + } + + fprintf(header, "local const int base_dist[D_CODES] = {\n"); + for (i = 0; i < D_CODES; i++) { + fprintf(header, "%5u%s", base_dist[i], + SEPARATOR(i, D_CODES-1, 10)); + } + + fclose(header); +} +#endif /* GEN_TREES_H */ + +/* =========================================================================== + * Initialize the tree data structures for a new zlib stream. + */ +void _tr_init(s) + deflate_state *s; +{ + tr_static_init(); + + s->l_desc.dyn_tree = s->dyn_ltree; + s->l_desc.stat_desc = &static_l_desc; + + s->d_desc.dyn_tree = s->dyn_dtree; + s->d_desc.stat_desc = &static_d_desc; + + s->bl_desc.dyn_tree = s->bl_tree; + s->bl_desc.stat_desc = &static_bl_desc; + + s->bi_buf = 0; + s->bi_valid = 0; + s->last_eob_len = 8; /* enough lookahead for inflate */ +#ifdef DEBUG + s->compressed_len = 0L; + s->bits_sent = 0L; +#endif + + /* Initialize the first block of the first file: */ + init_block(s); +} + +/* =========================================================================== + * Initialize a new block. + */ +local void init_block(s) + deflate_state *s; +{ + int n; /* iterates over tree elements */ + + /* Initialize the trees. */ + for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; + for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; + for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; + + s->dyn_ltree[END_BLOCK].Freq = 1; + s->opt_len = s->static_len = 0L; + s->last_lit = s->matches = 0; +} + +#define SMALLEST 1 +/* Index within the heap array of least frequent node in the Huffman tree */ + + +/* =========================================================================== + * Remove the smallest element from the heap and recreate the heap with + * one less element. Updates heap and heap_len. + */ +#define pqremove(s, tree, top) \ +{\ + top = s->heap[SMALLEST]; \ + s->heap[SMALLEST] = s->heap[s->heap_len--]; \ + pqdownheap(s, tree, SMALLEST); \ +} + +/* =========================================================================== + * Compares to subtrees, using the tree depth as tie breaker when + * the subtrees have equal frequency. This minimizes the worst case length. + */ +#define smaller(tree, n, m, depth) \ + (tree[n].Freq < tree[m].Freq || \ + (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m])) + +/* =========================================================================== + * Restore the heap property by moving down the tree starting at node k, + * exchanging a node with the smallest of its two sons if necessary, stopping + * when the heap property is re-established (each father smaller than its + * two sons). + */ +local void pqdownheap(s, tree, k) + deflate_state *s; + ct_data *tree; /* the tree to restore */ + int k; /* node to move down */ +{ + int v = s->heap[k]; + int j = k << 1; /* left son of k */ + while (j <= s->heap_len) { + /* Set j to the smallest of the two sons: */ + if (j < s->heap_len && + smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { + j++; + } + /* Exit if v is smaller than both sons */ + if (smaller(tree, v, s->heap[j], s->depth)) break; + + /* Exchange v with the smallest son */ + s->heap[k] = s->heap[j]; k = j; + + /* And continue down the tree, setting j to the left son of k */ + j <<= 1; + } + s->heap[k] = v; +} + +/* =========================================================================== + * Compute the optimal bit lengths for a tree and update the total bit length + * for the current block. + * IN assertion: the fields freq and dad are set, heap[heap_max] and + * above are the tree nodes sorted by increasing frequency. + * OUT assertions: the field len is set to the optimal bit length, the + * array bl_count contains the frequencies for each bit length. + * The length opt_len is updated; static_len is also updated if stree is + * not null. + */ +local void gen_bitlen(s, desc) + deflate_state *s; + tree_desc *desc; /* the tree descriptor */ +{ + ct_data *tree = desc->dyn_tree; + int max_code = desc->max_code; + const ct_data *stree = desc->stat_desc->static_tree; + const intf *extra = desc->stat_desc->extra_bits; + int base = desc->stat_desc->extra_base; + int max_length = desc->stat_desc->max_length; + int h; /* heap index */ + int n, m; /* iterate over the tree elements */ + int bits; /* bit length */ + int xbits; /* extra bits */ + ush f; /* frequency */ + int overflow = 0; /* number of elements with bit length too large */ + + for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; + + /* In a first pass, compute the optimal bit lengths (which may + * overflow in the case of the bit length tree). + */ + tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ + + for (h = s->heap_max+1; h < HEAP_SIZE; h++) { + n = s->heap[h]; + bits = tree[tree[n].Dad].Len + 1; + if (bits > max_length) bits = max_length, overflow++; + tree[n].Len = (ush)bits; + /* We overwrite tree[n].Dad which is no longer needed */ + + if (n > max_code) continue; /* not a leaf node */ + + s->bl_count[bits]++; + xbits = 0; + if (n >= base) xbits = extra[n-base]; + f = tree[n].Freq; + s->opt_len += (ulg)f * (bits + xbits); + if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits); + } + if (overflow == 0) return; + + Trace((stderr,"\nbit length overflow\n")); + /* This happens for example on obj2 and pic of the Calgary corpus */ + + /* Find the first bit length which could increase: */ + do { + bits = max_length-1; + while (s->bl_count[bits] == 0) bits--; + s->bl_count[bits]--; /* move one leaf down the tree */ + s->bl_count[bits+1] += 2; /* move one overflow item as its brother */ + s->bl_count[max_length]--; + /* The brother of the overflow item also moves one step up, + * but this does not affect bl_count[max_length] + */ + overflow -= 2; + } while (overflow > 0); + + /* Now recompute all bit lengths, scanning in increasing frequency. + * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all + * lengths instead of fixing only the wrong ones. This idea is taken + * from 'ar' written by Haruhiko Okumura.) + */ + for (bits = max_length; bits != 0; bits--) { + n = s->bl_count[bits]; + while (n != 0) { + m = s->heap[--h]; + if (m > max_code) continue; + if (tree[m].Len != (unsigned) bits) { + Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); + s->opt_len += ((long)bits - (long)tree[m].Len) + *(long)tree[m].Freq; + tree[m].Len = (ush)bits; + } + n--; + } + } +} + +/* =========================================================================== + * Generate the codes for a given tree and bit counts (which need not be + * optimal). + * IN assertion: the array bl_count contains the bit length statistics for + * the given tree and the field len is set for all tree elements. + * OUT assertion: the field code is set for all tree elements of non + * zero code length. + */ +local void gen_codes (tree, max_code, bl_count) + ct_data *tree; /* the tree to decorate */ + int max_code; /* largest code with non zero frequency */ + ushf *bl_count; /* number of codes at each bit length */ +{ + ush next_code[MAX_BITS+1]; /* next code value for each bit length */ + ush code = 0; /* running code value */ + int bits; /* bit index */ + int n; /* code index */ + + /* The distribution counts are first used to generate the code values + * without bit reversal. + */ + for (bits = 1; bits <= MAX_BITS; bits++) { + next_code[bits] = code = (code + bl_count[bits-1]) << 1; + } + /* Check that the bit counts in bl_count are consistent. The last code + * must be all ones. + */ + Assert (code + bl_count[MAX_BITS]-1 == (1<dyn_tree; + const ct_data *stree = desc->stat_desc->static_tree; + int elems = desc->stat_desc->elems; + int n, m; /* iterate over heap elements */ + int max_code = -1; /* largest code with non zero frequency */ + int node; /* new node being created */ + + /* Construct the initial heap, with least frequent element in + * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. + * heap[0] is not used. + */ + s->heap_len = 0, s->heap_max = HEAP_SIZE; + + for (n = 0; n < elems; n++) { + if (tree[n].Freq != 0) { + s->heap[++(s->heap_len)] = max_code = n; + s->depth[n] = 0; + } else { + tree[n].Len = 0; + } + } + + /* The pkzip format requires that at least one distance code exists, + * and that at least one bit should be sent even if there is only one + * possible code. So to avoid special checks later on we force at least + * two codes of non zero frequency. + */ + while (s->heap_len < 2) { + node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); + tree[node].Freq = 1; + s->depth[node] = 0; + s->opt_len--; if (stree) s->static_len -= stree[node].Len; + /* node is 0 or 1 so it does not have extra bits */ + } + desc->max_code = max_code; + + /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, + * establish sub-heaps of increasing lengths: + */ + for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n); + + /* Construct the Huffman tree by repeatedly combining the least two + * frequent nodes. + */ + node = elems; /* next internal node of the tree */ + do { + pqremove(s, tree, n); /* n = node of least frequency */ + m = s->heap[SMALLEST]; /* m = node of next least frequency */ + + s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ + s->heap[--(s->heap_max)] = m; + + /* Create a new node father of n and m */ + tree[node].Freq = tree[n].Freq + tree[m].Freq; + s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1); + tree[n].Dad = tree[m].Dad = (ush)node; +#ifdef DUMP_BL_TREE + if (tree == s->bl_tree) { + fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)", + node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); + } +#endif + /* and insert the new node in the heap */ + s->heap[SMALLEST] = node++; + pqdownheap(s, tree, SMALLEST); + + } while (s->heap_len >= 2); + + s->heap[--(s->heap_max)] = s->heap[SMALLEST]; + + /* At this point, the fields freq and dad are set. We can now + * generate the bit lengths. + */ + gen_bitlen(s, (tree_desc *)desc); + + /* The field len is now set, we can generate the bit codes */ + gen_codes ((ct_data *)tree, max_code, s->bl_count); +} + +/* =========================================================================== + * Scan a literal or distance tree to determine the frequencies of the codes + * in the bit length tree. + */ +local void scan_tree (s, tree, max_code) + deflate_state *s; + ct_data *tree; /* the tree to be scanned */ + int max_code; /* and its largest code of non zero frequency */ +{ + int n; /* iterates over all tree elements */ + int prevlen = -1; /* last emitted length */ + int curlen; /* length of current code */ + int nextlen = tree[0].Len; /* length of next code */ + int count = 0; /* repeat count of the current code */ + int max_count = 7; /* max repeat count */ + int min_count = 4; /* min repeat count */ + + if (nextlen == 0) max_count = 138, min_count = 3; + tree[max_code+1].Len = (ush)0xffff; /* guard */ + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; nextlen = tree[n+1].Len; + if (++count < max_count && curlen == nextlen) { + continue; + } else if (count < min_count) { + s->bl_tree[curlen].Freq += count; + } else if (curlen != 0) { + if (curlen != prevlen) s->bl_tree[curlen].Freq++; + s->bl_tree[REP_3_6].Freq++; + } else if (count <= 10) { + s->bl_tree[REPZ_3_10].Freq++; + } else { + s->bl_tree[REPZ_11_138].Freq++; + } + count = 0; prevlen = curlen; + if (nextlen == 0) { + max_count = 138, min_count = 3; + } else if (curlen == nextlen) { + max_count = 6, min_count = 3; + } else { + max_count = 7, min_count = 4; + } + } +} + +/* =========================================================================== + * Send a literal or distance tree in compressed form, using the codes in + * bl_tree. + */ +local void send_tree (s, tree, max_code) + deflate_state *s; + ct_data *tree; /* the tree to be scanned */ + int max_code; /* and its largest code of non zero frequency */ +{ + int n; /* iterates over all tree elements */ + int prevlen = -1; /* last emitted length */ + int curlen; /* length of current code */ + int nextlen = tree[0].Len; /* length of next code */ + int count = 0; /* repeat count of the current code */ + int max_count = 7; /* max repeat count */ + int min_count = 4; /* min repeat count */ + + /* tree[max_code+1].Len = -1; */ /* guard already set */ + if (nextlen == 0) max_count = 138, min_count = 3; + + for (n = 0; n <= max_code; n++) { + curlen = nextlen; nextlen = tree[n+1].Len; + if (++count < max_count && curlen == nextlen) { + continue; + } else if (count < min_count) { + do { send_code(s, curlen, s->bl_tree); } while (--count != 0); + + } else if (curlen != 0) { + if (curlen != prevlen) { + send_code(s, curlen, s->bl_tree); count--; + } + Assert(count >= 3 && count <= 6, " 3_6?"); + send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2); + + } else if (count <= 10) { + send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3); + + } else { + send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7); + } + count = 0; prevlen = curlen; + if (nextlen == 0) { + max_count = 138, min_count = 3; + } else if (curlen == nextlen) { + max_count = 6, min_count = 3; + } else { + max_count = 7, min_count = 4; + } + } +} + +/* =========================================================================== + * Construct the Huffman tree for the bit lengths and return the index in + * bl_order of the last bit length code to send. + */ +local int build_bl_tree(s) + deflate_state *s; +{ + int max_blindex; /* index of last bit length code of non zero freq */ + + /* Determine the bit length frequencies for literal and distance trees */ + scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); + scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); + + /* Build the bit length tree: */ + build_tree(s, (tree_desc *)(&(s->bl_desc))); + /* opt_len now includes the length of the tree representations, except + * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. + */ + + /* Determine the number of bit length codes to send. The pkzip format + * requires that at least 4 bit length codes be sent. (appnote.txt says + * 3 but the actual value used is 4.) + */ + for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { + if (s->bl_tree[bl_order[max_blindex]].Len != 0) break; + } + /* Update opt_len to include the bit length tree and counts */ + s->opt_len += 3*(max_blindex+1) + 5+5+4; + Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", + s->opt_len, s->static_len)); + + return max_blindex; +} + +/* =========================================================================== + * Send the header for a block using dynamic Huffman trees: the counts, the + * lengths of the bit length codes, the literal tree and the distance tree. + * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. + */ +local void send_all_trees(s, lcodes, dcodes, blcodes) + deflate_state *s; + int lcodes, dcodes, blcodes; /* number of codes for each tree */ +{ + int rank; /* index in bl_order */ + + Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); + Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, + "too many codes"); + Tracev((stderr, "\nbl counts: ")); + send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */ + send_bits(s, dcodes-1, 5); + send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */ + for (rank = 0; rank < blcodes; rank++) { + Tracev((stderr, "\nbl code %2d ", bl_order[rank])); + send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); + } + Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); + + send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ + Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); + + send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ + Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); +} + +/* =========================================================================== + * Send a stored block + */ +void _tr_stored_block(s, buf, stored_len, eof) + deflate_state *s; + charf *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 */ +#ifdef DEBUG + s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L; + s->compressed_len += (stored_len + 4) << 3; +#endif + copy_block(s, buf, (unsigned)stored_len, 1); /* with header */ +} + +/* =========================================================================== + * Send one empty static block to give enough lookahead for inflate. + * This takes 10 bits, of which 7 may remain in the bit buffer. + * The current inflate code requires 9 bits of lookahead. If the + * last two codes for the previous block (real code plus EOB) were coded + * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode + * the last real code. In this case we send two empty static blocks instead + * of one. (There are no problems if the previous block is stored or fixed.) + * To simplify the code, we assume the worst case of last real code encoded + * on one bit only. + */ +void _tr_align(s) + deflate_state *s; +{ + send_bits(s, STATIC_TREES<<1, 3); + send_code(s, END_BLOCK, static_ltree); +#ifdef DEBUG + s->compressed_len += 10L; /* 3 for block type, 7 for EOB */ +#endif + bi_flush(s); + /* Of the 10 bits for the empty block, we have already sent + * (10 - bi_valid) bits. The lookahead for the last real code (before + * the EOB of the previous block) was thus at least one plus the length + * of the EOB plus what we have just sent of the empty static block. + */ + if (1 + s->last_eob_len + 10 - s->bi_valid < 9) { + send_bits(s, STATIC_TREES<<1, 3); + send_code(s, END_BLOCK, static_ltree); +#ifdef DEBUG + s->compressed_len += 10L; +#endif + bi_flush(s); + } + s->last_eob_len = 7; +} + +/* =========================================================================== + * Determine the best encoding for the current block: dynamic trees, static + * trees or store, and output the encoded block to the zip file. + */ +void _tr_flush_block(s, buf, stored_len, eof) + deflate_state *s; + charf *buf; /* input block, or NULL if too old */ + ulg stored_len; /* length of input block */ + int eof; /* true if this is the last block for a file */ +{ + ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */ + int max_blindex = 0; /* index of last bit length code of non zero freq */ + + /* Build the Huffman trees unless a stored block is forced */ + if (s->level > 0) { + + /* Check if the file is ascii or binary */ + if (s->data_type == Z_UNKNOWN) set_data_type(s); + + /* Construct the literal and distance trees */ + build_tree(s, (tree_desc *)(&(s->l_desc))); + Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, + s->static_len)); + + build_tree(s, (tree_desc *)(&(s->d_desc))); + Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, + s->static_len)); + /* At this point, opt_len and static_len are the total bit lengths of + * the compressed block data, excluding the tree representations. + */ + + /* Build the bit length tree for the above two trees, and get the index + * in bl_order of the last bit length code to send. + */ + max_blindex = build_bl_tree(s); + + /* Determine the best encoding. Compute first the block length in bytes*/ + opt_lenb = (s->opt_len+3+7)>>3; + static_lenb = (s->static_len+3+7)>>3; + + Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", + opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, + s->last_lit)); + + if (static_lenb <= opt_lenb) opt_lenb = static_lenb; + + } else { + Assert(buf != (char*)0, "lost buf"); + opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ + } + +#ifdef FORCE_STORED + if (buf != (char*)0) { /* force stored block */ +#else + if (stored_len+4 <= opt_lenb && buf != (char*)0) { + /* 4: two words for the lengths */ +#endif + /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. + * Otherwise we can't have processed more than WSIZE input bytes since + * the last block flush, because compression would have been + * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to + * transform a block into a stored block. + */ + _tr_stored_block(s, buf, stored_len, eof); + +#ifdef FORCE_STATIC + } else if (static_lenb >= 0) { /* force static trees */ +#else + } else if (static_lenb == opt_lenb) { +#endif + send_bits(s, (STATIC_TREES<<1)+eof, 3); + compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree); +#ifdef DEBUG + s->compressed_len += 3 + s->static_len; +#endif + } else { + send_bits(s, (DYN_TREES<<1)+eof, 3); + send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1, + max_blindex+1); + compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); +#ifdef DEBUG + s->compressed_len += 3 + s->opt_len; +#endif + } + Assert (s->compressed_len == s->bits_sent, "bad compressed size"); + /* The above check is made mod 2^32, for files larger than 512 MB + * and uLong implemented on 32 bits. + */ + init_block(s); + + if (eof) { + bi_windup(s); +#ifdef DEBUG + s->compressed_len += 7; /* align on byte boundary */ +#endif + } + Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, + s->compressed_len-7*eof)); +} + +/* =========================================================================== + * Save the match info and tally the frequency counts. Return true if + * the current block must be flushed. + */ +int _tr_tally (s, dist, lc) + deflate_state *s; + unsigned dist; /* distance of matched string */ + unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ +{ + s->d_buf[s->last_lit] = (ush)dist; + s->l_buf[s->last_lit++] = (uch)lc; + if (dist == 0) { + /* lc is the unmatched char */ + s->dyn_ltree[lc].Freq++; + } else { + s->matches++; + /* Here, lc is the match length - MIN_MATCH */ + dist--; /* dist = match distance - 1 */ + Assert((ush)dist < (ush)MAX_DIST(s) && + (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && + (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); + + s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++; + s->dyn_dtree[d_code(dist)].Freq++; + } + +#ifdef TRUNCATE_BLOCK + /* Try to guess if it is profitable to stop the current block here */ + if ((s->last_lit & 0x1fff) == 0 && s->level > 2) { + /* Compute an upper bound for the compressed length */ + ulg out_length = (ulg)s->last_lit*8L; + ulg in_length = (ulg)((long)s->strstart - s->block_start); + int dcode; + for (dcode = 0; dcode < D_CODES; dcode++) { + out_length += (ulg)s->dyn_dtree[dcode].Freq * + (5L+extra_dbits[dcode]); + } + out_length >>= 3; + Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ", + s->last_lit, in_length, out_length, + 100L - out_length*100L/in_length)); + if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1; + } +#endif + return (s->last_lit == s->lit_bufsize-1); + /* We avoid equality with lit_bufsize because of wraparound at 64K + * on 16 bit machines and because stored blocks are restricted to + * 64K-1 bytes. + */ +} + +/* =========================================================================== + * Send the block data compressed using the given Huffman trees + */ +local void compress_block(s, ltree, dtree) + deflate_state *s; + ct_data *ltree; /* literal tree */ + ct_data *dtree; /* distance tree */ +{ + unsigned dist; /* distance of matched string */ + int lc; /* match length or unmatched char (if dist == 0) */ + unsigned lx = 0; /* running index in l_buf */ + unsigned code; /* the code to send */ + int extra; /* number of extra bits to send */ + + if (s->last_lit != 0) do { + dist = s->d_buf[lx]; + lc = s->l_buf[lx++]; + if (dist == 0) { + send_code(s, lc, ltree); /* send a literal byte */ + Tracecv(isgraph(lc), (stderr," '%c' ", lc)); + } else { + /* Here, lc is the match length - MIN_MATCH */ + code = _length_code[lc]; + send_code(s, code+LITERALS+1, ltree); /* send the length code */ + extra = extra_lbits[code]; + if (extra != 0) { + lc -= base_length[code]; + send_bits(s, lc, extra); /* send the extra length bits */ + } + dist--; /* dist is now the match distance - 1 */ + code = d_code(dist); + Assert (code < D_CODES, "bad d_code"); + + send_code(s, code, dtree); /* send the distance code */ + extra = extra_dbits[code]; + if (extra != 0) { + dist -= base_dist[code]; + send_bits(s, dist, extra); /* send the extra distance bits */ + } + } /* literal or match pair ? */ + + /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ + Assert(s->pending < s->lit_bufsize + 2*lx, "pendingBuf overflow"); + + } while (lx < s->last_lit); + + send_code(s, END_BLOCK, ltree); + s->last_eob_len = ltree[END_BLOCK].Len; +} + +/* =========================================================================== + * Set the data type to ASCII or BINARY, using a crude approximation: + * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise. + * IN assertion: the fields freq of dyn_ltree are set and the total of all + * frequencies does not exceed 64K (to fit in an int on 16 bit machines). + */ +local void set_data_type(s) + deflate_state *s; +{ + int n = 0; + unsigned ascii_freq = 0; + unsigned bin_freq = 0; + while (n < 7) bin_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; + s->data_type = (Byte)(bin_freq > (ascii_freq >> 2) ? Z_BINARY : Z_ASCII); +} + +/* =========================================================================== + * Reverse the first len bits of a code, using straightforward code (a faster + * method would use a table) + * IN assertion: 1 <= len <= 15 + */ +local unsigned bi_reverse(code, len) + unsigned code; /* the value to invert */ + int len; /* its bit length */ +{ + register unsigned res = 0; + do { + res |= code & 1; + code >>= 1, res <<= 1; + } while (--len > 0); + return res >> 1; +} + +/* =========================================================================== + * Flush the bit buffer, keeping at most 7 bits in it. + */ +local void bi_flush(s) + deflate_state *s; +{ + if (s->bi_valid == 16) { + put_short(s, s->bi_buf); + s->bi_buf = 0; + s->bi_valid = 0; + } else if (s->bi_valid >= 8) { + put_byte(s, (Byte)s->bi_buf); + s->bi_buf >>= 8; + s->bi_valid -= 8; + } +} + +/* =========================================================================== + * Flush the bit buffer and align the output on a byte boundary + */ +local void bi_windup(s) + deflate_state *s; +{ + if (s->bi_valid > 8) { + put_short(s, s->bi_buf); + } else if (s->bi_valid > 0) { + put_byte(s, (Byte)s->bi_buf); + } + s->bi_buf = 0; + s->bi_valid = 0; +#ifdef DEBUG + s->bits_sent = (s->bits_sent+7) & ~7; +#endif +} + +/* =========================================================================== + * Copy a stored block, storing first the length and its + * one's complement if requested. + */ +local void copy_block(s, buf, len, header) + deflate_state *s; + charf *buf; /* the input data */ + unsigned len; /* its length */ + int header; /* true if block header must be written */ +{ + bi_windup(s); /* align on byte boundary */ + s->last_eob_len = 8; /* enough lookahead for inflate */ + + if (header) { + put_short(s, (ush)len); + put_short(s, (ush)~len); +#ifdef DEBUG + s->bits_sent += 2*16; +#endif + } +#ifdef DEBUG + s->bits_sent += (ulg)len<<3; +#endif + while (len--) { + put_byte(s, *buf++); + } +} diff --git a/ziplib/trees.h b/ziplib/trees.h new file mode 100644 index 0000000..1ca868b --- /dev/null +++ b/ziplib/trees.h @@ -0,0 +1,128 @@ +/* header created automatically with -DGEN_TREES_H */ + +local const ct_data static_ltree[L_CODES+2] = { +{{ 12},{ 8}}, {{140},{ 8}}, {{ 76},{ 8}}, {{204},{ 8}}, {{ 44},{ 8}}, +{{172},{ 8}}, {{108},{ 8}}, {{236},{ 8}}, {{ 28},{ 8}}, {{156},{ 8}}, +{{ 92},{ 8}}, {{220},{ 8}}, {{ 60},{ 8}}, {{188},{ 8}}, {{124},{ 8}}, +{{252},{ 8}}, {{ 2},{ 8}}, {{130},{ 8}}, {{ 66},{ 8}}, {{194},{ 8}}, +{{ 34},{ 8}}, {{162},{ 8}}, {{ 98},{ 8}}, {{226},{ 8}}, {{ 18},{ 8}}, +{{146},{ 8}}, {{ 82},{ 8}}, {{210},{ 8}}, {{ 50},{ 8}}, {{178},{ 8}}, +{{114},{ 8}}, {{242},{ 8}}, {{ 10},{ 8}}, {{138},{ 8}}, {{ 74},{ 8}}, +{{202},{ 8}}, {{ 42},{ 8}}, {{170},{ 8}}, {{106},{ 8}}, {{234},{ 8}}, +{{ 26},{ 8}}, {{154},{ 8}}, {{ 90},{ 8}}, {{218},{ 8}}, {{ 58},{ 8}}, +{{186},{ 8}}, {{122},{ 8}}, {{250},{ 8}}, {{ 6},{ 8}}, {{134},{ 8}}, +{{ 70},{ 8}}, {{198},{ 8}}, {{ 38},{ 8}}, {{166},{ 8}}, {{102},{ 8}}, +{{230},{ 8}}, {{ 22},{ 8}}, {{150},{ 8}}, {{ 86},{ 8}}, {{214},{ 8}}, +{{ 54},{ 8}}, {{182},{ 8}}, {{118},{ 8}}, {{246},{ 8}}, {{ 14},{ 8}}, +{{142},{ 8}}, {{ 78},{ 8}}, {{206},{ 8}}, {{ 46},{ 8}}, {{174},{ 8}}, +{{110},{ 8}}, {{238},{ 8}}, {{ 30},{ 8}}, {{158},{ 8}}, {{ 94},{ 8}}, +{{222},{ 8}}, {{ 62},{ 8}}, {{190},{ 8}}, {{126},{ 8}}, {{254},{ 8}}, +{{ 1},{ 8}}, {{129},{ 8}}, {{ 65},{ 8}}, {{193},{ 8}}, {{ 33},{ 8}}, +{{161},{ 8}}, {{ 97},{ 8}}, {{225},{ 8}}, {{ 17},{ 8}}, {{145},{ 8}}, +{{ 81},{ 8}}, {{209},{ 8}}, {{ 49},{ 8}}, {{177},{ 8}}, {{113},{ 8}}, +{{241},{ 8}}, {{ 9},{ 8}}, {{137},{ 8}}, {{ 73},{ 8}}, {{201},{ 8}}, +{{ 41},{ 8}}, {{169},{ 8}}, {{105},{ 8}}, {{233},{ 8}}, {{ 25},{ 8}}, +{{153},{ 8}}, {{ 89},{ 8}}, {{217},{ 8}}, {{ 57},{ 8}}, {{185},{ 8}}, +{{121},{ 8}}, {{249},{ 8}}, {{ 5},{ 8}}, {{133},{ 8}}, {{ 69},{ 8}}, +{{197},{ 8}}, {{ 37},{ 8}}, {{165},{ 8}}, {{101},{ 8}}, {{229},{ 8}}, +{{ 21},{ 8}}, {{149},{ 8}}, {{ 85},{ 8}}, {{213},{ 8}}, {{ 53},{ 8}}, +{{181},{ 8}}, {{117},{ 8}}, {{245},{ 8}}, {{ 13},{ 8}}, {{141},{ 8}}, +{{ 77},{ 8}}, {{205},{ 8}}, {{ 45},{ 8}}, {{173},{ 8}}, {{109},{ 8}}, +{{237},{ 8}}, {{ 29},{ 8}}, {{157},{ 8}}, {{ 93},{ 8}}, {{221},{ 8}}, +{{ 61},{ 8}}, {{189},{ 8}}, {{125},{ 8}}, {{253},{ 8}}, {{ 19},{ 9}}, +{{275},{ 9}}, {{147},{ 9}}, {{403},{ 9}}, {{ 83},{ 9}}, {{339},{ 9}}, +{{211},{ 9}}, {{467},{ 9}}, {{ 51},{ 9}}, {{307},{ 9}}, {{179},{ 9}}, +{{435},{ 9}}, {{115},{ 9}}, {{371},{ 9}}, {{243},{ 9}}, {{499},{ 9}}, +{{ 11},{ 9}}, {{267},{ 9}}, {{139},{ 9}}, {{395},{ 9}}, {{ 75},{ 9}}, +{{331},{ 9}}, {{203},{ 9}}, {{459},{ 9}}, {{ 43},{ 9}}, {{299},{ 9}}, +{{171},{ 9}}, {{427},{ 9}}, {{107},{ 9}}, {{363},{ 9}}, {{235},{ 9}}, +{{491},{ 9}}, {{ 27},{ 9}}, {{283},{ 9}}, {{155},{ 9}}, {{411},{ 9}}, +{{ 91},{ 9}}, {{347},{ 9}}, {{219},{ 9}}, {{475},{ 9}}, {{ 59},{ 9}}, +{{315},{ 9}}, {{187},{ 9}}, {{443},{ 9}}, {{123},{ 9}}, {{379},{ 9}}, +{{251},{ 9}}, {{507},{ 9}}, {{ 7},{ 9}}, {{263},{ 9}}, {{135},{ 9}}, +{{391},{ 9}}, {{ 71},{ 9}}, {{327},{ 9}}, {{199},{ 9}}, {{455},{ 9}}, +{{ 39},{ 9}}, {{295},{ 9}}, {{167},{ 9}}, {{423},{ 9}}, {{103},{ 9}}, +{{359},{ 9}}, {{231},{ 9}}, {{487},{ 9}}, {{ 23},{ 9}}, {{279},{ 9}}, +{{151},{ 9}}, {{407},{ 9}}, {{ 87},{ 9}}, {{343},{ 9}}, {{215},{ 9}}, +{{471},{ 9}}, {{ 55},{ 9}}, {{311},{ 9}}, {{183},{ 9}}, {{439},{ 9}}, +{{119},{ 9}}, {{375},{ 9}}, {{247},{ 9}}, {{503},{ 9}}, {{ 15},{ 9}}, +{{271},{ 9}}, {{143},{ 9}}, {{399},{ 9}}, {{ 79},{ 9}}, {{335},{ 9}}, +{{207},{ 9}}, {{463},{ 9}}, {{ 47},{ 9}}, {{303},{ 9}}, {{175},{ 9}}, +{{431},{ 9}}, {{111},{ 9}}, {{367},{ 9}}, {{239},{ 9}}, {{495},{ 9}}, +{{ 31},{ 9}}, {{287},{ 9}}, {{159},{ 9}}, {{415},{ 9}}, {{ 95},{ 9}}, +{{351},{ 9}}, {{223},{ 9}}, {{479},{ 9}}, {{ 63},{ 9}}, {{319},{ 9}}, +{{191},{ 9}}, {{447},{ 9}}, {{127},{ 9}}, {{383},{ 9}}, {{255},{ 9}}, +{{511},{ 9}}, {{ 0},{ 7}}, {{ 64},{ 7}}, {{ 32},{ 7}}, {{ 96},{ 7}}, +{{ 16},{ 7}}, {{ 80},{ 7}}, {{ 48},{ 7}}, {{112},{ 7}}, {{ 8},{ 7}}, +{{ 72},{ 7}}, {{ 40},{ 7}}, {{104},{ 7}}, {{ 24},{ 7}}, {{ 88},{ 7}}, +{{ 56},{ 7}}, {{120},{ 7}}, {{ 4},{ 7}}, {{ 68},{ 7}}, {{ 36},{ 7}}, +{{100},{ 7}}, {{ 20},{ 7}}, {{ 84},{ 7}}, {{ 52},{ 7}}, {{116},{ 7}}, +{{ 3},{ 8}}, {{131},{ 8}}, {{ 67},{ 8}}, {{195},{ 8}}, {{ 35},{ 8}}, +{{163},{ 8}}, {{ 99},{ 8}}, {{227},{ 8}} +}; + +local const ct_data static_dtree[D_CODES] = { +{{ 0},{ 5}}, {{16},{ 5}}, {{ 8},{ 5}}, {{24},{ 5}}, {{ 4},{ 5}}, +{{20},{ 5}}, {{12},{ 5}}, {{28},{ 5}}, {{ 2},{ 5}}, {{18},{ 5}}, +{{10},{ 5}}, {{26},{ 5}}, {{ 6},{ 5}}, {{22},{ 5}}, {{14},{ 5}}, +{{30},{ 5}}, {{ 1},{ 5}}, {{17},{ 5}}, {{ 9},{ 5}}, {{25},{ 5}}, +{{ 5},{ 5}}, {{21},{ 5}}, {{13},{ 5}}, {{29},{ 5}}, {{ 3},{ 5}}, +{{19},{ 5}}, {{11},{ 5}}, {{27},{ 5}}, {{ 7},{ 5}}, {{23},{ 5}} +}; + +const uch _dist_code[DIST_CODE_LEN] = { + 0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, + 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, +10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, +11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, +12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, +13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, +13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, +14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, +14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, +14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, +15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, +15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, +15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 0, 0, 16, 17, +18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, +23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, +24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, +26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, +26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, +27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, +27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, +28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, +28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, +28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, +29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, +29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, +29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29 +}; + +const uch _length_code[MAX_MATCH-MIN_MATCH+1]= { + 0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 12, 12, +13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, +17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, +19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, +21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, +22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, +23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, +24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, +25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, +25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, +26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, +26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, +27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28 +}; + +local const int base_length[LENGTH_CODES] = { +0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56, +64, 80, 96, 112, 128, 160, 192, 224, 0 +}; + +local const int base_dist[D_CODES] = { + 0, 1, 2, 3, 4, 6, 8, 12, 16, 24, + 32, 48, 64, 96, 128, 192, 256, 384, 512, 768, + 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576 +}; + diff --git a/ziplib/uncompr.c b/ziplib/uncompr.c new file mode 100644 index 0000000..57dd24a --- /dev/null +++ b/ziplib/uncompr.c @@ -0,0 +1,58 @@ +/* uncompr.c -- decompress a memory buffer + * Copyright (C) 1995-2002 Jean-loup Gailly. + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* @(#) $Id$ */ + +#include "zlib.h" + +/* =========================================================================== + Decompresses the source buffer into the destination buffer. sourceLen is + the byte length of the source buffer. Upon entry, destLen is the total + size of the destination buffer, which must be large enough to hold the + entire uncompressed data. (The size of the uncompressed data must have + been saved previously by the compressor and transmitted to the decompressor + by some mechanism outside the scope of this compression library.) + Upon exit, destLen is the actual size of the compressed buffer. + This function can be used to decompress a whole file at once if the + input file is mmap'ed. + + uncompress returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_BUF_ERROR if there was not enough room in the output + buffer, or Z_DATA_ERROR if the input data was corrupted. +*/ +int ZEXPORT uncompress (dest, destLen, source, sourceLen) + Bytef *dest; + uLongf *destLen; + const Bytef *source; + uLong sourceLen; +{ + z_stream stream; + int err; + + stream.next_in = (Bytef*)source; + stream.avail_in = (uInt)sourceLen; + /* Check for source > 64K on 16-bit machine: */ + if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR; + + stream.next_out = dest; + stream.avail_out = (uInt)*destLen; + if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR; + + stream.zalloc = (alloc_func)0; + stream.zfree = (free_func)0; + + err = inflateInit(&stream); + if (err != Z_OK) return err; + + err = inflate(&stream, Z_FINISH); + if (err != Z_STREAM_END) { + inflateEnd(&stream); + return err == Z_OK ? Z_BUF_ERROR : err; + } + *destLen = stream.total_out; + + err = inflateEnd(&stream); + return err; +} diff --git a/ziplib/zconf.h b/ziplib/zconf.h new file mode 100644 index 0000000..f404cef --- /dev/null +++ b/ziplib/zconf.h @@ -0,0 +1,279 @@ +/* zconf.h -- configuration of the zlib compression library + * Copyright (C) 1995-2002 Jean-loup Gailly. + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* @(#) $Id$ */ + +#ifndef _ZCONF_H +#define _ZCONF_H + +/* + * If you *really* need a unique prefix for all types and library functions, + * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it. + */ +#ifdef Z_PREFIX +# define deflateInit_ z_deflateInit_ +# define deflate z_deflate +# define deflateEnd z_deflateEnd +# define inflateInit_ z_inflateInit_ +# define inflate z_inflate +# define inflateEnd z_inflateEnd +# define deflateInit2_ z_deflateInit2_ +# define deflateSetDictionary z_deflateSetDictionary +# define deflateCopy z_deflateCopy +# define deflateReset z_deflateReset +# define deflateParams z_deflateParams +# define inflateInit2_ z_inflateInit2_ +# define inflateSetDictionary z_inflateSetDictionary +# define inflateSync z_inflateSync +# define inflateSyncPoint z_inflateSyncPoint +# define inflateReset z_inflateReset +# define compress z_compress +# define compress2 z_compress2 +# define uncompress z_uncompress +# define adler32 z_adler32 +# define crc32 z_crc32 +# define get_crc_table z_get_crc_table + +# define Byte z_Byte +# define uInt z_uInt +# define uLong z_uLong +# define Bytef z_Bytef +# define charf z_charf +# define intf z_intf +# define uIntf z_uIntf +# define uLongf z_uLongf +# define voidpf z_voidpf +# define voidp z_voidp +#endif + +#if (defined(_WIN32) || defined(__WIN32__)) && !defined(WIN32) +# define WIN32 +#endif +#if defined(__GNUC__) || defined(WIN32) || defined(__386__) || defined(i386) +# ifndef __32BIT__ +# define __32BIT__ +# endif +#endif +#if defined(__MSDOS__) && !defined(MSDOS) +# define MSDOS +#endif + +/* + * Compile with -DMAXSEG_64K if the alloc function cannot allocate more + * than 64k bytes at a time (needed on systems with 16-bit int). + */ +#if defined(MSDOS) && !defined(__32BIT__) +# define MAXSEG_64K +#endif +#ifdef MSDOS +# define UNALIGNED_OK +#endif + +#if (defined(MSDOS) || defined(_WINDOWS) || defined(WIN32)) && !defined(STDC) +# define STDC +#endif +#if defined(__STDC__) || defined(__cplusplus) || defined(__OS2__) +# ifndef STDC +# define STDC +# endif +#endif + +#ifndef STDC +# ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */ +# define const +# endif +#endif + +/* Some Mac compilers merge all .h files incorrectly: */ +#if defined(__MWERKS__) || defined(applec) ||defined(THINK_C) ||defined(__SC__) +# define NO_DUMMY_DECL +#endif + +/* Old Borland C incorrectly complains about missing returns: */ +#if defined(__BORLANDC__) && (__BORLANDC__ < 0x500) +# define NEED_DUMMY_RETURN +#endif + + +/* Maximum value for memLevel in deflateInit2 */ +#ifndef MAX_MEM_LEVEL +# ifdef MAXSEG_64K +# define MAX_MEM_LEVEL 8 +# else +# define MAX_MEM_LEVEL 9 +# endif +#endif + +/* Maximum value for windowBits in deflateInit2 and inflateInit2. + * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files + * created by gzip. (Files created by minigzip can still be extracted by + * gzip.) + */ +#ifndef MAX_WBITS +# define MAX_WBITS 15 /* 32K LZ77 window */ +#endif + +/* The memory requirements for deflate are (in bytes): + (1 << (windowBits+2)) + (1 << (memLevel+9)) + that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values) + plus a few kilobytes for small objects. For example, if you want to reduce + the default memory requirements from 256K to 128K, compile with + make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7" + Of course this will generally degrade compression (there's no free lunch). + + The memory requirements for inflate are (in bytes) 1 << windowBits + that is, 32K for windowBits=15 (default value) plus a few kilobytes + for small objects. +*/ + + /* Type declarations */ + +#ifndef OF /* function prototypes */ +# ifdef STDC +# define OF(args) args +# else +# define OF(args) () +# endif +#endif + +/* The following definitions for FAR are needed only for MSDOS mixed + * model programming (small or medium model with some far allocations). + * This was tested only with MSC; for other MSDOS compilers you may have + * to define NO_MEMCPY in zutil.h. If you don't need the mixed model, + * just define FAR to be empty. + */ +#if (defined(M_I86SM) || defined(M_I86MM)) && !defined(__32BIT__) + /* MSC small or medium model */ +# define SMALL_MEDIUM +# ifdef _MSC_VER +# define FAR _far +# else +# define FAR far +# endif +#endif +#if defined(__BORLANDC__) && (defined(__SMALL__) || defined(__MEDIUM__)) +# ifndef __32BIT__ +# define SMALL_MEDIUM +# define FAR _far +# endif +#endif + +/* Compile with -DZLIB_DLL for Windows DLL support */ +#if defined(ZLIB_DLL) +# if defined(_WINDOWS) || defined(WINDOWS) +# ifdef FAR +# undef FAR +# endif +# include +# define ZEXPORT WINAPI +# ifdef WIN32 +# define ZEXPORTVA WINAPIV +# else +# define ZEXPORTVA FAR _cdecl _export +# endif +# endif +# if defined (__BORLANDC__) +# if (__BORLANDC__ >= 0x0500) && defined (WIN32) +# include +# define ZEXPORT __declspec(dllexport) WINAPI +# define ZEXPORTRVA __declspec(dllexport) WINAPIV +# else +# if defined (_Windows) && defined (__DLL__) +# define ZEXPORT _export +# define ZEXPORTVA _export +# endif +# endif +# endif +#endif + +#if defined (__BEOS__) +# if defined (ZLIB_DLL) +# define ZEXTERN extern __declspec(dllexport) +# else +# define ZEXTERN extern __declspec(dllimport) +# endif +#endif + +#ifndef ZEXPORT +# define ZEXPORT +#endif +#ifndef ZEXPORTVA +# define ZEXPORTVA +#endif +#ifndef ZEXTERN +# define ZEXTERN extern +#endif + +#ifndef FAR +# define FAR +#endif + +#if !defined(MACOS) && !defined(TARGET_OS_MAC) +typedef unsigned char Byte; /* 8 bits */ +#endif +typedef unsigned int uInt; /* 16 bits or more */ +typedef unsigned long uLong; /* 32 bits or more */ + +#ifdef SMALL_MEDIUM + /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */ +# define Bytef Byte FAR +#else + typedef Byte FAR Bytef; +#endif +typedef char FAR charf; +typedef int FAR intf; +typedef uInt FAR uIntf; +typedef uLong FAR uLongf; + +#ifdef STDC + typedef void FAR *voidpf; + typedef void *voidp; +#else + typedef Byte FAR *voidpf; + typedef Byte *voidp; +#endif + +#ifdef HAVE_UNISTD_H +# include /* for off_t */ +# include /* for SEEK_* and off_t */ +# define z_off_t off_t +#endif +#ifndef SEEK_SET +# define SEEK_SET 0 /* Seek from beginning of file. */ +# define SEEK_CUR 1 /* Seek from current position. */ +# define SEEK_END 2 /* Set file pointer to EOF plus "offset" */ +#endif +#ifndef z_off_t +# define z_off_t long +#endif + +/* MVS linker does not support external names larger than 8 bytes */ +#if defined(__MVS__) +# pragma map(deflateInit_,"DEIN") +# pragma map(deflateInit2_,"DEIN2") +# pragma map(deflateEnd,"DEEND") +# pragma map(inflateInit_,"ININ") +# pragma map(inflateInit2_,"ININ2") +# pragma map(inflateEnd,"INEND") +# pragma map(inflateSync,"INSY") +# pragma map(inflateSetDictionary,"INSEDI") +# pragma map(inflate_blocks,"INBL") +# pragma map(inflate_blocks_new,"INBLNE") +# pragma map(inflate_blocks_free,"INBLFR") +# pragma map(inflate_blocks_reset,"INBLRE") +# pragma map(inflate_codes_free,"INCOFR") +# pragma map(inflate_codes,"INCO") +# pragma map(inflate_fast,"INFA") +# pragma map(inflate_flush,"INFLU") +# pragma map(inflate_mask,"INMA") +# pragma map(inflate_set_dictionary,"INSEDI2") +# pragma map(inflate_copyright,"INCOPY") +# pragma map(inflate_trees_bits,"INTRBI") +# pragma map(inflate_trees_dynamic,"INTRDY") +# pragma map(inflate_trees_fixed,"INTRFI") +# pragma map(inflate_trees_free,"INTRFR") +#endif + +#endif /* _ZCONF_H */ diff --git a/ziplib/ziplib.pro b/ziplib/ziplib.pro new file mode 100644 index 0000000..879fe5c --- /dev/null +++ b/ziplib/ziplib.pro @@ -0,0 +1,48 @@ +#------------------------------------------------- +# +# Project created by QtCreator 2016-05-22T13:32:00 +# +#------------------------------------------------- + +load(ubuntu-click) + +QT -= core gui + +TARGET = ziplib +TEMPLATE = lib +CONFIG += staticlib + +SOURCES += \ + adler32.c \ + compress.c \ + crc32.c \ + deflate.c \ + gzio.c \ + infblock.c \ + infcodes.c \ + inffast.c \ + inflate.c \ + inftrees.c \ + infutil.c \ + maketree.c \ + trees.c \ + uncompr.c \ + zutil.c + +HEADERS += \ + deflate.h \ + infblock.h \ + infcodes.h \ + inffast.h \ + inffixed.h \ + inftrees.h \ + infutil.h \ + trees.h \ + zconf.h \ + zlib.h \ + zutil.h \ + GZipHelper.h +unix { + target.path = $${UBUNTU_CLICK_BINARY_PATH} + INSTALLS += target +} diff --git a/ziplib/ziplib.pro.user b/ziplib/ziplib.pro.user new file mode 100644 index 0000000..c531623 --- /dev/null +++ b/ziplib/ziplib.pro.user @@ -0,0 +1,487 @@ + + + + + + EnvironmentId + {2cc89096-7ac7-402a-b71d-c1e097c9bbff} + + + ProjectExplorer.Project.ActiveTarget + 0 + + + ProjectExplorer.Project.EditorSettings + + true + false + true + + Cpp + + CppGlobal + + + + QmlJS + + QmlJSGlobal + + + 2 + UTF-8 + false + 4 + false + 80 + true + true + 1 + true + false + 0 + true + 0 + 8 + true + 1 + true + true + true + false + + + + ProjectExplorer.Project.PluginSettings + + + + ProjectExplorer.Project.Target.0 + + Desktop + Desktop + {be3ccc75-fa7f-49f4-aff7-5b2317ccab85} + 0 + 0 + 0 + + /home/dan/KeePit/build-ziplib-Desktop-Debug + + + true + qmake + + QtProjectManager.QMakeBuildStep + false + true + + false + false + false + + + true + Make + + Qt4ProjectManager.MakeStep + + -w + -r + + false + + + + 2 + Build + + ProjectExplorer.BuildSteps.Build + + + + true + Make + + Qt4ProjectManager.MakeStep + + -w + -r + + true + clean + + + 1 + Clean + + ProjectExplorer.BuildSteps.Clean + + 2 + false + + Debug + + Qt4ProjectManager.Qt4BuildConfiguration + 2 + true + + + /home/dan/KeePit/build-ziplib-Desktop-Release + + + true + qmake + + QtProjectManager.QMakeBuildStep + false + true + + false + false + false + + + true + Make + + Qt4ProjectManager.MakeStep + + -w + -r + + false + + + + 2 + Build + + ProjectExplorer.BuildSteps.Build + + + + true + Make + + Qt4ProjectManager.MakeStep + + -w + -r + + true + clean + + + 1 + Clean + + ProjectExplorer.BuildSteps.Clean + + 2 + false + + Release + + Qt4ProjectManager.Qt4BuildConfiguration + 0 + true + + 2 + + + 0 + Deploy + + ProjectExplorer.BuildSteps.Deploy + + 1 + Deploy locally + + ProjectExplorer.DefaultDeployConfiguration + + 1 + + + + false + false + false + false + true + 0.01 + 10 + true + 1 + 25 + + 1 + true + false + true + valgrind + + 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 + 11 + 12 + 13 + 14 + + 2 + + + + %{buildDir} + Custom Executable + + ProjectExplorer.CustomExecutableRunConfiguration + 3768 + false + true + false + false + true + + 1 + + + + ProjectExplorer.Project.Target.1 + + UbuntuSDK for armhf (GCC ubuntu-sdk-15.04-vivid) + UbuntuSDK for armhf (GCC ubuntu-sdk-15.04-vivid) + {76b79808-1c0a-40f4-9e78-7159f6fb858c} + 1 + 0 + 0 + + /home/dan/KeePit/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Debug + + + true + qmake + + QtProjectManager.QMakeBuildStep + false + true + + false + false + false + + + true + Make + + Qt4ProjectManager.MakeStep + + -w + -r + + false + + + + 2 + Build + + ProjectExplorer.BuildSteps.Build + + + + true + Make + + Qt4ProjectManager.MakeStep + + -w + -r + + true + clean + + + 1 + Clean + + ProjectExplorer.BuildSteps.Clean + + 2 + false + + Debug + + Qt4ProjectManager.Qt4BuildConfiguration + 2 + true + + + /home/dan/KeePit/build-ziplib-UbuntuSDK_for_armhf_GCC_ubuntu_sdk_15_04_vivid-Release + + + true + qmake + + QtProjectManager.QMakeBuildStep + false + true + + false + false + false + + + true + Make + + Qt4ProjectManager.MakeStep + + -w + -r + + false + + + + 2 + Build + + ProjectExplorer.BuildSteps.Build + + + + true + Make + + Qt4ProjectManager.MakeStep + + -w + -r + + true + clean + + + 1 + Clean + + ProjectExplorer.BuildSteps.Clean + + 2 + false + + Release + + Qt4ProjectManager.Qt4BuildConfiguration + 0 + true + + 2 + + + + true + UbuntuSDK Click build + + UbuntuProjectManager.ClickPackageStep + 1 + false + + + true + Upload files to Ubuntu Device + + UbuntuProjectManager.UploadStep + + + + + + + 2 + Deploy + + ProjectExplorer.BuildSteps.Deploy + + 1 + Deploy to Ubuntu Device + + UbuntuProjectManager.DeployConfiguration + + 1 + + + + false + false + false + false + true + 0.01 + 10 + true + 1 + 25 + + 1 + true + false + true + valgrind + + 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 + 11 + 12 + 13 + 14 + + 2 + + + + %{buildDir} + Custom Executable + + ProjectExplorer.CustomExecutableRunConfiguration + 3768 + false + true + false + false + true + + 1 + + + + ProjectExplorer.Project.TargetCount + 2 + + + ProjectExplorer.Project.Updater.FileVersion + 18 + + + Version + 18 + + diff --git a/ziplib/zlib.h b/ziplib/zlib.h new file mode 100644 index 0000000..5979f04 --- /dev/null +++ b/ziplib/zlib.h @@ -0,0 +1,893 @@ +/* zlib.h -- interface of the 'zlib' general purpose compression library + version 1.1.4, March 11th, 2002 + + Copyright (C) 1995-2002 Jean-loup Gailly and Mark Adler + + This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. + + Jean-loup Gailly Mark Adler + jloup@gzip.org madler@alumni.caltech.edu + + + The data format used by the zlib library is described by RFCs (Request for + Comments) 1950 to 1952 in the files ftp://ds.internic.net/rfc/rfc1950.txt + (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format). +*/ + +#ifndef _ZLIB_H +#define _ZLIB_H + +#include "zconf.h" + +#ifdef __cplusplus +extern "C" { +#endif + +#define ZLIB_VERSION "1.1.4" + +/* + The 'zlib' compression library provides in-memory compression and + decompression functions, including integrity checks of the uncompressed + data. This version of the library supports only one compression method + (deflation) but other algorithms will be added later and will have the same + stream interface. + + Compression can be done in a single step if the buffers are large + enough (for example if an input file is mmap'ed), or can be done by + repeated calls of the compression function. In the latter case, the + application must provide more input and/or consume the output + (providing more output space) before each call. + + The library also supports reading and writing files in gzip (.gz) format + with an interface similar to that of stdio. + + The library does not install any signal handler. The decoder checks + the consistency of the compressed data, so the library should never + crash even in case of corrupted input. +*/ + +typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size)); +typedef void (*free_func) OF((voidpf opaque, voidpf address)); + +struct internal_state; + +typedef struct z_stream_s { + Bytef *next_in; /* next input byte */ + uInt avail_in; /* number of bytes available at next_in */ + uLong total_in; /* total nb of input bytes read so far */ + + Bytef *next_out; /* next output byte should be put there */ + uInt avail_out; /* remaining free space at next_out */ + uLong total_out; /* total nb of bytes output so far */ + + char *msg; /* last error message, NULL if no error */ + struct internal_state FAR *state; /* not visible by applications */ + + alloc_func zalloc; /* used to allocate the internal state */ + free_func zfree; /* used to free the internal state */ + voidpf opaque; /* private data object passed to zalloc and zfree */ + + int data_type; /* best guess about the data type: ascii or binary */ + uLong adler; /* adler32 value of the uncompressed data */ + uLong reserved; /* reserved for future use */ +} z_stream; + +typedef z_stream FAR *z_streamp; + +/* + The application must update next_in and avail_in when avail_in has + dropped to zero. It must update next_out and avail_out when avail_out + has dropped to zero. The application must initialize zalloc, zfree and + opaque before calling the init function. All other fields are set by the + compression library and must not be updated by the application. + + 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 + memory management. The compression library attaches no meaning to the + opaque value. + + zalloc must return Z_NULL if there is not enough memory for the object. + If zlib is used in a multi-threaded application, zalloc and zfree must be + thread safe. + + 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 + 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 + progress reports. After compression, total_in holds the total size of + the uncompressed data and may be saved for use in the decompressor + (particularly if the decompressor wants to decompress everything in + a single step). +*/ + + /* constants */ + +#define Z_NO_FLUSH 0 +#define Z_PARTIAL_FLUSH 1 /* will be removed, use Z_SYNC_FLUSH instead */ +#define Z_SYNC_FLUSH 2 +#define Z_FULL_FLUSH 3 +#define Z_FINISH 4 +/* Allowed flush values; see deflate() below for details */ + +#define Z_OK 0 +#define Z_STREAM_END 1 +#define Z_NEED_DICT 2 +#define Z_ERRNO (-1) +#define Z_STREAM_ERROR (-2) +#define Z_DATA_ERROR (-3) +#define Z_MEM_ERROR (-4) +#define Z_BUF_ERROR (-5) +#define Z_VERSION_ERROR (-6) +/* Return codes for the compression/decompression functions. Negative + * values are errors, positive values are used for special but normal events. + */ + +#define Z_NO_COMPRESSION 0 +#define Z_BEST_SPEED 1 +#define Z_BEST_COMPRESSION 9 +#define Z_DEFAULT_COMPRESSION (-1) +/* compression levels */ + +#define Z_FILTERED 1 +#define Z_HUFFMAN_ONLY 2 +#define Z_DEFAULT_STRATEGY 0 +/* compression strategy; see deflateInit2() below for details */ + +#define Z_BINARY 0 +#define Z_ASCII 1 +#define Z_UNKNOWN 2 +/* Possible values of the data_type field */ + +#define Z_DEFLATED 8 +/* The deflate compression method (the only one supported in this version) */ + +#define Z_NULL 0 /* for initializing zalloc, zfree, opaque */ + +#define zlib_version zlibVersion() +/* for compatibility with versions < 1.0.2 */ + + /* basic functions */ + +ZEXTERN const char * ZEXPORT zlibVersion OF((void)); +/* The application can compare zlibVersion and ZLIB_VERSION for consistency. + If the first character differs, the library code actually used is + not compatible with the zlib.h header file used by the application. + This check is automatically made by deflateInit and inflateInit. + */ + +/* +ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level)); + + Initializes the internal stream state for compression. The fields + zalloc, zfree and opaque must be initialized before by the caller. + If zalloc and zfree are set to Z_NULL, deflateInit updates them to + use default allocation functions. + + The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9: + 1 gives best speed, 9 gives best compression, 0 gives no compression at + all (the input data is simply copied a block at a time). + Z_DEFAULT_COMPRESSION requests a default compromise between speed and + compression (currently equivalent to level 6). + + deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_STREAM_ERROR if level is not a valid compression level, + Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible + with the version assumed by the caller (ZLIB_VERSION). + msg is set to null if there is no error message. deflateInit does not + perform any compression: this will be done by deflate(). +*/ + + +ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush)); +/* + deflate compresses as much data as possible, and stops when the input + buffer becomes empty or the output buffer becomes full. It may introduce some + output latency (reading input without producing any output) except when + forced to flush. + + The detailed semantics are as follows. deflate performs one or both of the + following actions: + + - Compress more input starting at next_in and update next_in and avail_in + accordingly. If not all input can be processed (because there is not + enough room in the output buffer), next_in and avail_in are updated and + processing will resume at this point for the next call of deflate(). + + - Provide more output starting at next_out and update next_out and avail_out + accordingly. This action is forced if the parameter flush is non zero. + Forcing flush frequently degrades the compression ratio, so this parameter + should be set only when necessary (in interactive applications). + Some output may be provided even if flush is not set. + + Before the call of deflate(), the application should ensure that at least + one of the actions is possible, by providing more input and/or consuming + more output, and updating avail_in or avail_out accordingly; avail_out + should never be zero before the call. The application can consume the + compressed output when it wants, for example when the output buffer is full + (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK + and with zero avail_out, it must be called again after making room in the + output buffer because there might be more output pending. + + If the parameter flush is set to Z_SYNC_FLUSH, all pending output is + flushed to the output buffer and the output is aligned on a byte boundary, so + that the decompressor can get all input data available so far. (In particular + avail_in is zero after the call if enough output space has been provided + before the call.) Flushing may degrade compression for some compression + algorithms and so it should be used only when necessary. + + If flush is set to Z_FULL_FLUSH, all output is flushed as with + Z_SYNC_FLUSH, and the compression state is reset so that decompression can + restart from this point if previous compressed data has been damaged or if + random access is desired. Using Z_FULL_FLUSH too often can seriously degrade + the compression. + + If deflate returns with avail_out == 0, this function must be called again + with the same value of the flush parameter and more output space (updated + avail_out), until the flush is complete (deflate returns with non-zero + avail_out). + + If the parameter flush is set to Z_FINISH, pending input is processed, + pending output is flushed and deflate returns with Z_STREAM_END if there + was enough output space; if deflate returns with Z_OK, this function must be + called again with Z_FINISH and more output space (updated avail_out) but no + more input data, until it returns with Z_STREAM_END or an error. After + deflate has returned Z_STREAM_END, the only possible operations on the + stream are deflateReset or deflateEnd. + + 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() sets strm->adler to the adler32 checksum of all input read + so far (that is, total_in bytes). + + 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 + binary. This field is only for information purposes and does not affect + the compression algorithm in any manner. + + deflate() returns Z_OK if some progress has been made (more input + processed or more output produced), Z_STREAM_END if all input has been + consumed and all output has been produced (only when flush is set to + Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example + if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible + (for example avail_in or avail_out was zero). +*/ + + +ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm)); +/* + All dynamically allocated data structures for this stream are freed. + This function discards any unprocessed input and does not flush any + pending output. + + deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the + stream state was inconsistent, Z_DATA_ERROR if the stream was freed + prematurely (some input or output was discarded). In the error case, + msg may be set but then points to a static string (which must not be + deallocated). +*/ + + +/* +ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm)); + + Initializes the internal stream state for decompression. The fields + next_in, avail_in, zalloc, zfree and opaque must be initialized before by + the caller. If next_in is not Z_NULL and avail_in is large enough (the exact + value depends on the compression method), inflateInit determines the + compression method from the zlib header and allocates all data structures + accordingly; otherwise the allocation will be deferred to the first call of + inflate. If zalloc and zfree are set to Z_NULL, inflateInit updates them to + use default allocation functions. + + inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_VERSION_ERROR if the zlib library version is incompatible with the + version assumed by the caller. msg is set to null if there is no error + message. inflateInit does not perform any decompression apart from reading + the zlib header if present: this will be done by inflate(). (So next_in and + avail_in may be modified, but next_out and avail_out are unchanged.) +*/ + + +ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush)); +/* + inflate decompresses as much data as possible, and stops when the input + buffer becomes empty or the output buffer becomes full. It may some + introduce some output latency (reading input without producing any output) + except when forced to flush. + + The detailed semantics are as follows. inflate performs one or both of the + following actions: + + - Decompress more input starting at next_in and update next_in and avail_in + accordingly. If not all input can be processed (because there is not + enough room in the output buffer), next_in is updated and processing + will resume at this point for the next call of inflate(). + + - Provide more output starting at next_out and update next_out and avail_out + accordingly. inflate() provides as much output as possible, until there + is no more input data or no more space in the output buffer (see below + about the flush parameter). + + Before the call of inflate(), the application should ensure that at least + one of the actions is possible, by providing more input and/or consuming + more output, and updating the next_* and avail_* values accordingly. + The application can consume the uncompressed output when it wants, for + example when the output buffer is full (avail_out == 0), or after each + call of inflate(). If inflate returns Z_OK and with zero avail_out, it + must be called again after making room in the output buffer because there + might be more output pending. + + If the parameter flush is set to Z_SYNC_FLUSH, inflate flushes as much + output as possible to the output buffer. The flushing behavior of inflate is + not specified for values of the flush parameter other than Z_SYNC_FLUSH + and Z_FINISH, but the current implementation actually flushes as much output + as possible anyway. + + inflate() should normally be called until it returns Z_STREAM_END or an + error. However if all decompression is to be performed in a single step + (a single call of inflate), the parameter flush should be set to + Z_FINISH. In this case all pending input is processed and all pending + output is flushed; avail_out must be large enough to hold all the + uncompressed data. (The size of the uncompressed data may have been saved + by the compressor for this purpose.) The next operation on this stream must + be inflateEnd to deallocate the decompression state. The use of Z_FINISH + is never required, but can be used to inform inflate that a faster routine + may be used for the single inflate() call. + + If a preset dictionary is needed at this point (see inflateSetDictionary + below), inflate sets strm-adler to the adler32 checksum of the + dictionary chosen by the compressor and returns Z_NEED_DICT; otherwise + it sets strm->adler to the adler32 checksum of all output produced + so far (that is, total_out bytes) and returns Z_OK, Z_STREAM_END or + an error code as described below. At the end of the stream, inflate() + checks that its computed adler32 checksum is equal to that saved by the + compressor and returns Z_STREAM_END only if the checksum is correct. + + inflate() returns Z_OK if some progress has been made (more input processed + or more output produced), Z_STREAM_END if the end of the compressed data has + been reached and all uncompressed output has been produced, Z_NEED_DICT if a + preset dictionary is needed at this point, Z_DATA_ERROR if the input data was + corrupted (input stream not conforming to the zlib format or incorrect + adler32 checksum), Z_STREAM_ERROR if the stream structure was inconsistent + (for example if next_in or next_out was NULL), Z_MEM_ERROR if there was not + enough memory, Z_BUF_ERROR if no progress is possible or if there was not + enough room in the output buffer when Z_FINISH is used. In the Z_DATA_ERROR + case, the application may then call inflateSync to look for a good + compression block. +*/ + + +ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm)); +/* + All dynamically allocated data structures for this stream are freed. + This function discards any unprocessed input and does not flush any + pending output. + + inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state + was inconsistent. In the error case, msg may be set but then points to a + static string (which must not be deallocated). +*/ + + /* Advanced functions */ + +/* + The following functions are needed only in some special applications. +*/ + +/* +ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm, + int level, + int method, + int windowBits, + int memLevel, + int strategy)); + + This is another version of deflateInit with more compression options. The + fields next_in, zalloc, zfree and opaque must be initialized before by + the caller. + + The method parameter is the compression method. It must be Z_DEFLATED in + this version of the library. + + The windowBits parameter is the base two logarithm of the window size + (the size of the history buffer). It should be in the range 8..15 for this + version of the library. Larger values of this parameter result in better + compression at the expense of memory usage. The default value is 15 if + deflateInit is used instead. + + The memLevel parameter specifies how much memory should be allocated + for the internal compression state. memLevel=1 uses minimum memory but + is slow and reduces compression ratio; memLevel=9 uses maximum memory + 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 + value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a + filter (or predictor), or Z_HUFFMAN_ONLY to force Huffman encoding only (no + string match). Filtered data consists mostly of small values with a + somewhat random distribution. In this case, the compression algorithm is + tuned to compress them better. The effect of Z_FILTERED is to force more + Huffman coding and less string matching; it is somewhat intermediate + between Z_DEFAULT and Z_HUFFMAN_ONLY. The strategy parameter only affects + the compression ratio but not the correctness of the compressed output even + if it is not set appropriately. + + deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid + method). msg is set to null if there is no error message. deflateInit2 does + not perform any compression: this will be done by deflate(). +*/ + +ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm, + const Bytef *dictionary, + uInt dictLength)); +/* + Initializes the compression dictionary from the given byte sequence + without producing any compressed output. This function must be called + immediately after deflateInit, deflateInit2 or deflateReset, before any + call of deflate. The compressor and decompressor must use exactly the same + dictionary (see inflateSetDictionary). + + The dictionary should consist of strings (byte sequences) that are likely + to be encountered later in the data to be compressed, with the most commonly + used strings preferably put towards the end of the dictionary. Using a + dictionary is most useful when the data to be compressed is short and can be + predicted with good accuracy; the data can then be compressed better than + with the default empty dictionary. + + Depending on the size of the compression data structures selected by + deflateInit or deflateInit2, a part of the dictionary may in effect be + discarded, for example if the dictionary is larger than the window size in + deflate or deflate2. Thus the strings most likely to be useful should be + put at the end of the dictionary, not at the front. + + Upon return of this function, strm->adler is set to the Adler32 value + of the dictionary; the decompressor may later use this value to determine + which dictionary has been used by the compressor. (The Adler32 value + applies to the whole dictionary even if only a subset of the dictionary is + actually used by the compressor.) + + deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a + parameter is invalid (such as NULL dictionary) or the stream state is + inconsistent (for example if deflate has already been called for this stream + or if the compression method is bsort). deflateSetDictionary does not + perform any compression: this will be done by deflate(). +*/ + +ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest, + z_streamp source)); +/* + Sets the destination stream as a complete copy of the source stream. + + This function can be useful when several compression strategies will be + tried, for example when there are several ways of pre-processing the input + data with a filter. The streams that will be discarded should then be freed + by calling deflateEnd. Note that deflateCopy duplicates the internal + compression state which can be quite large, so this strategy is slow and + can consume lots of memory. + + deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_STREAM_ERROR if the source stream state was inconsistent + (such as zalloc being NULL). msg is left unchanged in both source and + destination. +*/ + +ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm)); +/* + This function is equivalent to deflateEnd followed by deflateInit, + but does not free and reallocate all the internal compression state. + The stream will keep the same compression level and any other attributes + that may have been set by deflateInit2. + + deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent (such as zalloc or state being NULL). +*/ + +ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm, + int level, + int strategy)); +/* + Dynamically update the compression level and compression strategy. The + interpretation of level and strategy is as in deflateInit2. This can be + used to switch between compression and straight copy of the input data, or + to switch to a different kind of input data requiring a different + strategy. If the compression level is changed, the input available so far + is compressed with the old level (and may be flushed); the new level will + take effect only at the next call of deflate(). + + Before the call of deflateParams, the stream state must be set as for + a call of deflate(), since the currently available input may have to + be compressed and flushed. In particular, strm->avail_out must be non-zero. + + deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source + stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR + if strm->avail_out was zero. +*/ + +/* +ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm, + int windowBits)); + + This is another version of inflateInit with an extra parameter. The + fields next_in, avail_in, zalloc, zfree and opaque must be initialized + before by the caller. + + The windowBits parameter is the base two logarithm of the maximum window + size (the size of the history buffer). It should be in the range 8..15 for + this version of the library. The default value is 15 if inflateInit is used + instead. If a compressed stream with a larger window size is given as + input, inflate() will return with the error code Z_DATA_ERROR instead of + trying to allocate a larger window. + + inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_STREAM_ERROR if a parameter is invalid (such as a negative + memLevel). msg is set to null if there is no error message. inflateInit2 + does not perform any decompression apart from reading the zlib header if + present: this will be done by inflate(). (So next_in and avail_in may be + modified, but next_out and avail_out are unchanged.) +*/ + +ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm, + const Bytef *dictionary, + uInt dictLength)); +/* + Initializes the decompression dictionary from the given uncompressed byte + sequence. This function must be called immediately after a call of inflate + if this call returned Z_NEED_DICT. The dictionary chosen by the compressor + can be determined from the Adler32 value returned by this call of + inflate. The compressor and decompressor must use exactly the same + dictionary (see deflateSetDictionary). + + inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a + parameter is invalid (such as NULL dictionary) or the stream state is + inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the + expected one (incorrect Adler32 value). inflateSetDictionary does not + perform any decompression: this will be done by subsequent calls of + inflate(). +*/ + +ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm)); +/* + Skips invalid compressed data until a full flush point (see above the + description of deflate with Z_FULL_FLUSH) can be found, or until all + available input is skipped. No output is provided. + + inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR + if no more input was provided, Z_DATA_ERROR if no flush point has been found, + 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 + indicates where valid compressed data was found. In the error case, the + application may repeatedly call inflateSync, providing more input each time, + until success or end of the input data. +*/ + +ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm)); +/* + This function is equivalent to inflateEnd followed by inflateInit, + but does not free and reallocate all the internal decompression state. + The stream will keep attributes that may have been set by inflateInit2. + + inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent (such as zalloc or state being NULL). +*/ + + + /* utility functions */ + +/* + The following utility functions are implemented on top of the + basic stream-oriented functions. To simplify the interface, some + default options are assumed (compression level and memory usage, + standard memory allocation functions). The source code of these + utility functions can easily be modified if you need special options. +*/ + +ZEXTERN int ZEXPORT compress OF((Bytef *dest, uLongf *destLen, + const Bytef *source, uLong sourceLen)); +/* + Compresses the source buffer into the destination buffer. sourceLen is + the byte length of the source buffer. Upon entry, destLen is the total + size of the destination buffer, which must be at least 0.1% larger than + sourceLen plus 12 bytes. Upon exit, destLen is the actual size of the + compressed buffer. + This function can be used to compress a whole file at once if the + input file is mmap'ed. + compress returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_BUF_ERROR if there was not enough room in the output + buffer. +*/ + +ZEXTERN int ZEXPORT compress2 OF((Bytef *dest, uLongf *destLen, + const Bytef *source, uLong sourceLen, + int level)); +/* + Compresses the source buffer into the destination buffer. The level + parameter has the same meaning as in deflateInit. sourceLen is the byte + length of the source buffer. Upon entry, destLen is the total size of the + destination buffer, which must be at least 0.1% larger than sourceLen plus + 12 bytes. Upon exit, destLen is the actual size of the compressed buffer. + + compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_BUF_ERROR if there was not enough room in the output buffer, + Z_STREAM_ERROR if the level parameter is invalid. +*/ + +ZEXTERN int ZEXPORT uncompress OF((Bytef *dest, uLongf *destLen, + const Bytef *source, uLong sourceLen)); +/* + Decompresses the source buffer into the destination buffer. sourceLen is + the byte length of the source buffer. Upon entry, destLen is the total + size of the destination buffer, which must be large enough to hold the + entire uncompressed data. (The size of the uncompressed data must have + been saved previously by the compressor and transmitted to the decompressor + by some mechanism outside the scope of this compression library.) + Upon exit, destLen is the actual size of the compressed buffer. + This function can be used to decompress a whole file at once if the + input file is mmap'ed. + + uncompress returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_BUF_ERROR if there was not enough room in the output + buffer, or Z_DATA_ERROR if the input data was corrupted. +*/ + + +typedef voidp gzFile; + +ZEXTERN gzFile ZEXPORT gzopen OF((const char *path, const char *mode)); +/* + Opens a gzip (.gz) file for reading or writing. The mode parameter + is as in fopen ("rb" or "wb") but can also include a compression level + ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for + Huffman only compression as in "wb1h". (See the description + of deflateInit2 for more information about the strategy parameter.) + + gzopen can be used to read a file which is not in gzip format; in this + case gzread will directly read from the file without decompression. + + gzopen returns NULL if the file could not be opened or if there was + insufficient memory to allocate the (de)compression state; errno + can be checked to distinguish the two cases (if errno is zero, the + zlib error is Z_MEM_ERROR). */ + +ZEXTERN gzFile ZEXPORT gzdopen OF((int fd, const char *mode)); +/* + gzdopen() associates a gzFile with the file descriptor fd. File + descriptors are obtained from calls like open, dup, creat, pipe or + fileno (in the file has been previously opened with fopen). + The mode parameter is as in gzopen. + The next call of gzclose on the returned gzFile will also close the + file descriptor fd, just like fclose(fdopen(fd), mode) closes the file + descriptor fd. If you want to keep fd open, use gzdopen(dup(fd), mode). + gzdopen returns NULL if there was insufficient memory to allocate + the (de)compression state. +*/ + +ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy)); +/* + Dynamically update the compression level or strategy. See the description + of deflateInit2 for the meaning of these parameters. + gzsetparams returns Z_OK if success, or Z_STREAM_ERROR if the file was not + opened for writing. +*/ + +ZEXTERN int ZEXPORT gzread OF((gzFile file, voidp buf, unsigned len)); +/* + Reads the given number of uncompressed bytes from the compressed file. + If the input file was not in gzip format, gzread copies the given number + of bytes into the buffer. + gzread returns the number of uncompressed bytes actually read (0 for + end of file, -1 for error). */ + +ZEXTERN int ZEXPORT gzwrite OF((gzFile file, + const voidp buf, unsigned len)); +/* + Writes the given number of uncompressed bytes into the compressed file. + gzwrite returns the number of uncompressed bytes actually written + (0 in case of error). +*/ + +ZEXTERN int ZEXPORTVA gzprintf OF((gzFile file, const char *format, ...)); +/* + Converts, formats, and writes the args to the compressed file under + control of the format string, as in fprintf. gzprintf returns the number of + uncompressed bytes actually written (0 in case of error). +*/ + +ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s)); +/* + Writes the given null-terminated string to the compressed file, excluding + the terminating null character. + gzputs returns the number of characters written, or -1 in case of error. +*/ + +ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len)); +/* + Reads bytes from the compressed file until len-1 characters are read, or + a newline character is read and transferred to buf, or an end-of-file + condition is encountered. The string is then terminated with a null + character. + gzgets returns buf, or Z_NULL in case of error. +*/ + +ZEXTERN int ZEXPORT gzputc OF((gzFile file, int c)); +/* + Writes c, converted to an unsigned char, into the compressed file. + gzputc returns the value that was written, or -1 in case of error. +*/ + +ZEXTERN int ZEXPORT gzgetc OF((gzFile file)); +/* + Reads one byte from the compressed file. gzgetc returns this byte + or -1 in case of end of file or error. +*/ + +ZEXTERN int ZEXPORT gzflush OF((gzFile file, int flush)); +/* + Flushes all pending output into the compressed file. The parameter + flush is as in the deflate() function. The return value is the zlib + 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 + degrade compression. +*/ + +ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile file, + z_off_t offset, int whence)); +/* + Sets the starting position for the next gzread or gzwrite on the + given compressed file. The offset represents a number of bytes in the + uncompressed data stream. The whence parameter is defined as in lseek(2); + the value SEEK_END is not supported. + If the file is opened for reading, this function is emulated but can be + extremely slow. If the file is opened for writing, only forward seeks are + supported; gzseek then compresses a sequence of zeroes up to the new + starting position. + + gzseek returns the resulting offset location as measured in bytes from + the beginning of the uncompressed stream, or -1 in case of error, in + particular if the file is opened for writing and the new starting position + would be before the current position. +*/ + +ZEXTERN int ZEXPORT gzrewind OF((gzFile file)); +/* + Rewinds the given file. This function is supported only for reading. + + gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET) +*/ + +ZEXTERN z_off_t ZEXPORT gztell OF((gzFile file)); +/* + Returns the starting position for the next gzread or gzwrite on the + given compressed file. This position represents a number of bytes in the + uncompressed data stream. + + gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR) +*/ + +ZEXTERN int ZEXPORT gzeof OF((gzFile file)); +/* + Returns 1 when EOF has previously been detected reading the given + input stream, otherwise zero. +*/ + +ZEXTERN int ZEXPORT gzclose OF((gzFile file)); +/* + Flushes all pending output if necessary, closes the compressed file + and deallocates all the (de)compression state. The return value is the zlib + error number (see function gzerror below). +*/ + +ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum)); +/* + Returns the error message for the last error which occurred on the + given compressed file. errnum is set to zlib error number. If an + error occurred in the file system and not in the compression library, + errnum is set to Z_ERRNO and the application may consult errno + to get the exact error code. +*/ + + /* checksum functions */ + +/* + These functions are not related to compression but are exported + anyway because they might be useful in applications using the + compression library. +*/ + +ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len)); + +/* + 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 + the required initial value for the checksum. + An Adler-32 checksum is almost as reliable as a CRC32 but can be computed + much faster. Usage example: + + uLong adler = adler32(0L, Z_NULL, 0); + + while (read_buffer(buffer, length) != EOF) { + adler = adler32(adler, buffer, length); + } + if (adler != original_adler) error(); +*/ + +ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len)); +/* + Update a running crc with the bytes buf[0..len-1] and return the updated + crc. If buf is NULL, this function returns the required initial value + for the crc. Pre- and post-conditioning (one's complement) is performed + within this function so it shouldn't be done by the application. + Usage example: + + uLong crc = crc32(0L, Z_NULL, 0); + + while (read_buffer(buffer, length) != EOF) { + crc = crc32(crc, buffer, length); + } + if (crc != original_crc) error(); +*/ + + + /* various hacks, don't look :) */ + +/* deflateInit and inflateInit are macros to allow checking the zlib version + * and the compiler's view of z_stream: + */ +ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level, + const char *version, int stream_size)); +ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm, + const char *version, int stream_size)); +ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int level, int method, + int windowBits, int memLevel, + int strategy, const char *version, + int stream_size)); +ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int windowBits, + const char *version, int stream_size)); +#define deflateInit(strm, level) \ + deflateInit_((strm), (level), ZLIB_VERSION, sizeof(z_stream)) +#define inflateInit(strm) \ + inflateInit_((strm), ZLIB_VERSION, sizeof(z_stream)) +#define deflateInit2(strm, level, method, windowBits, memLevel, strategy) \ + deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\ + (strategy), ZLIB_VERSION, sizeof(z_stream)) +#define inflateInit2(strm, windowBits) \ + inflateInit2_((strm), (windowBits), ZLIB_VERSION, sizeof(z_stream)) + + +#if !defined(_Z_UTIL_H) && !defined(NO_DUMMY_DECL) + struct internal_state {int dummy;}; /* hack for buggy compilers */ +#endif + +ZEXTERN const char * ZEXPORT zError OF((int err)); +ZEXTERN int ZEXPORT inflateSyncPoint OF((z_streamp z)); +ZEXTERN const uLongf * ZEXPORT get_crc_table OF((void)); + +#ifdef __cplusplus +} +#endif + +#endif /* _ZLIB_H */ diff --git a/ziplib/zutil.c b/ziplib/zutil.c new file mode 100644 index 0000000..20b60fd --- /dev/null +++ b/ziplib/zutil.c @@ -0,0 +1,225 @@ +/* zutil.c -- target dependent utility functions for the compression library + * Copyright (C) 1995-2002 Jean-loup Gailly. + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* @(#) $Id$ */ + +#include "zutil.h" + +struct internal_state {int dummy;}; /* for buggy compilers */ + +#ifndef STDC +extern void exit OF((int)); +#endif + +const char *z_errmsg[10] = { +"need dictionary", /* Z_NEED_DICT 2 */ +"stream end", /* Z_STREAM_END 1 */ +"", /* Z_OK 0 */ +"file error", /* Z_ERRNO (-1) */ +"stream error", /* Z_STREAM_ERROR (-2) */ +"data error", /* Z_DATA_ERROR (-3) */ +"insufficient memory", /* Z_MEM_ERROR (-4) */ +"buffer error", /* Z_BUF_ERROR (-5) */ +"incompatible version",/* Z_VERSION_ERROR (-6) */ +""}; + + +const char * ZEXPORT zlibVersion() +{ + return ZLIB_VERSION; +} + +#ifdef DEBUG + +# ifndef verbose +# define verbose 0 +# endif +int z_verbose = verbose; + +void z_error (m) + char *m; +{ + fprintf(stderr, "%s\n", m); + exit(1); +} +#endif + +/* exported to allow conversion of error code to string for compress() and + * uncompress() + */ +const char * ZEXPORT zError(err) + int err; +{ + return ERR_MSG(err); +} + + +#ifndef HAVE_MEMCPY + +void zmemcpy(dest, source, len) + Bytef* dest; + const Bytef* source; + uInt len; +{ + if (len == 0) return; + do { + *dest++ = *source++; /* ??? to be unrolled */ + } while (--len != 0); +} + +int zmemcmp(s1, s2, len) + const Bytef* s1; + const Bytef* s2; + uInt len; +{ + uInt j; + + for (j = 0; j < len; j++) { + if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1; + } + return 0; +} + +void zmemzero(dest, len) + Bytef* dest; + uInt len; +{ + if (len == 0) return; + do { + *dest++ = 0; /* ??? to be unrolled */ + } while (--len != 0); +} +#endif + +#ifdef __TURBOC__ +#if (defined( __BORLANDC__) || !defined(SMALL_MEDIUM)) && !defined(__32BIT__) +/* Small and medium model in Turbo C are for now limited to near allocation + * with reduced MAX_WBITS and MAX_MEM_LEVEL + */ +# define MY_ZCALLOC + +/* Turbo C malloc() does not allow dynamic allocation of 64K bytes + * and farmalloc(64K) returns a pointer with an offset of 8, so we + * must fix the pointer. Warning: the pointer must be put back to its + * original form in order to free it, use zcfree(). + */ + +#define MAX_PTR 10 +/* 10*64K = 640K */ + +local int next_ptr = 0; + +typedef struct ptr_table_s { + voidpf org_ptr; + voidpf new_ptr; +} ptr_table; + +local ptr_table table[MAX_PTR]; +/* This table is used to remember the original form of pointers + * to large buffers (64K). Such pointers are normalized with a zero offset. + * Since MSDOS is not a preemptive multitasking OS, this table is not + * protected from concurrent access. This hack doesn't work anyway on + * a protected system like OS/2. Use Microsoft C instead. + */ + +voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) +{ + voidpf buf = opaque; /* just to make some compilers happy */ + ulg bsize = (ulg)items*size; + + /* If we allocate less than 65520 bytes, we assume that farmalloc + * will return a usable pointer which doesn't have to be normalized. + */ + if (bsize < 65520L) { + buf = farmalloc(bsize); + if (*(ush*)&buf != 0) return buf; + } else { + buf = farmalloc(bsize + 16L); + } + if (buf == NULL || next_ptr >= MAX_PTR) return NULL; + table[next_ptr].org_ptr = buf; + + /* Normalize the pointer to seg:0 */ + *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; + *(ush*)&buf = 0; + table[next_ptr++].new_ptr = buf; + return buf; +} + +void zcfree (voidpf opaque, voidpf ptr) +{ + int n; + if (*(ush*)&ptr != 0) { /* object < 64K */ + farfree(ptr); + return; + } + /* Find the original pointer */ + for (n = 0; n < next_ptr; n++) { + if (ptr != table[n].new_ptr) continue; + + farfree(table[n].org_ptr); + while (++n < next_ptr) { + table[n-1] = table[n]; + } + next_ptr--; + return; + } + ptr = opaque; /* just to make some compilers happy */ + Assert(0, "zcfree: ptr not found"); +} +#endif +#endif /* __TURBOC__ */ + + +#if defined(M_I86) && !defined(__32BIT__) +/* Microsoft C in 16-bit mode */ + +# define MY_ZCALLOC + +#if (!defined(_MSC_VER) || (_MSC_VER <= 600)) +# define _halloc halloc +# define _hfree hfree +#endif + +voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) +{ + if (opaque) opaque = 0; /* to make compiler happy */ + return _halloc((long)items, size); +} + +void zcfree (voidpf opaque, voidpf ptr) +{ + if (opaque) opaque = 0; /* to make compiler happy */ + _hfree(ptr); +} + +#endif /* MSC */ + + +#ifndef MY_ZCALLOC /* Any system without a special alloc function */ + +#ifndef STDC +extern voidp calloc OF((uInt items, uInt size)); +extern void free OF((voidpf ptr)); +#endif + +voidpf zcalloc (opaque, items, size) + voidpf opaque; + unsigned items; + unsigned size; +{ + if (opaque) items += size - size; /* make compiler happy */ + return (voidpf)calloc(items, size); +} + +void zcfree (opaque, ptr) + voidpf opaque; + voidpf ptr; +{ + free(ptr); + if (opaque) return; /* make compiler happy */ +} + +#endif /* MY_ZCALLOC */ diff --git a/ziplib/zutil.h b/ziplib/zutil.h new file mode 100644 index 0000000..2e06fcf --- /dev/null +++ b/ziplib/zutil.h @@ -0,0 +1,220 @@ +/* zutil.h -- internal interface and configuration of the compression library + * Copyright (C) 1995-2002 Jean-loup Gailly. + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* WARNING: this file should *not* be used by applications. It is + part of the implementation of the compression library and is + subject to change. Applications should only use zlib.h. + */ + +/* @(#) $Id$ */ + +#ifndef _Z_UTIL_H +#define _Z_UTIL_H + +#include "zlib.h" + +#ifdef STDC +# include +# include +# include +#endif +#ifdef NO_ERRNO_H + extern int errno; +#else +# include +#endif + +#ifndef local +# define local static +#endif +/* compile with -Dlocal if your debugger can't find static symbols */ + +typedef unsigned char uch; +typedef uch FAR uchf; +typedef unsigned short ush; +typedef ush FAR ushf; +typedef unsigned long ulg; + +extern const char *z_errmsg[10]; /* indexed by 2-zlib_error */ +/* (size given to avoid silly warnings with Visual C++) */ + +#define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)] + +#define ERR_RETURN(strm,err) \ + return (strm->msg = (char*)ERR_MSG(err), (err)) +/* To be used only when the state is known to be valid */ + + /* common constants */ + +#ifndef DEF_WBITS +# define DEF_WBITS MAX_WBITS +#endif +/* default windowBits for decompression. MAX_WBITS is for compression only */ + +#if MAX_MEM_LEVEL >= 8 +# define DEF_MEM_LEVEL 8 +#else +# define DEF_MEM_LEVEL MAX_MEM_LEVEL +#endif +/* default memLevel */ + +#define STORED_BLOCK 0 +#define STATIC_TREES 1 +#define DYN_TREES 2 +/* The three kinds of block type */ + +#define MIN_MATCH 3 +#define MAX_MATCH 258 +/* The minimum and maximum match lengths */ + +#define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */ + + /* target dependencies */ + +#ifdef MSDOS +# define OS_CODE 0x00 +# if defined(__TURBOC__) || defined(__BORLANDC__) +# if(__STDC__ == 1) && (defined(__LARGE__) || defined(__COMPACT__)) + /* Allow compilation with ANSI keywords only enabled */ + void _Cdecl farfree( void *block ); + void *_Cdecl farmalloc( unsigned long nbytes ); +# else +# include +# endif +# else /* MSC or DJGPP */ +# include +# endif +#endif + +#ifdef OS2 +# define OS_CODE 0x06 +#endif + +#ifdef WIN32 /* Window 95 & Windows NT */ +# define OS_CODE 0x0b +#endif + +#if defined(VAXC) || defined(VMS) +# define OS_CODE 0x02 +# define F_OPEN(name, mode) \ + fopen((name), (mode), "mbc=60", "ctx=stm", "rfm=fix", "mrs=512") +#endif + +#ifdef AMIGA +# define OS_CODE 0x01 +#endif + +#if defined(ATARI) || defined(atarist) +# define OS_CODE 0x05 +#endif + +#if defined(MACOS) || defined(TARGET_OS_MAC) +# define OS_CODE 0x07 +# if defined(__MWERKS__) && __dest_os != __be_os && __dest_os != __win32_os +# include /* for fdopen */ +# else +# ifndef fdopen +# define fdopen(fd,mode) NULL /* No fdopen() */ +# endif +# endif +#endif + +#ifdef __50SERIES /* Prime/PRIMOS */ +# define OS_CODE 0x0F +#endif + +#ifdef TOPS20 +# define OS_CODE 0x0a +#endif + +#if defined(_BEOS_) || defined(RISCOS) +# define fdopen(fd,mode) NULL /* No fdopen() */ +#endif + +#if (defined(_MSC_VER) && (_MSC_VER > 600)) +# define fdopen(fd,type) _fdopen(fd,type) +#endif + + + /* Common defaults */ + +#ifndef OS_CODE +# define OS_CODE 0x03 /* assume Unix */ +#endif + +#ifndef F_OPEN +# define F_OPEN(name, mode) fopen((name), (mode)) +#endif + + /* functions */ + +#ifdef HAVE_STRERROR + extern char *strerror OF((int)); +# define zstrerror(errnum) strerror(errnum) +#else +# define zstrerror(errnum) "" +#endif + +#if defined(pyr) +# define NO_MEMCPY +#endif +#if defined(SMALL_MEDIUM) && !defined(_MSC_VER) && !defined(__SC__) + /* Use our own functions for small and medium model with MSC <= 5.0. + * You may have to use the same strategy for Borland C (untested). + * The __SC__ check is for Symantec. + */ +# define NO_MEMCPY +#endif +#if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY) +# define HAVE_MEMCPY +#endif +#ifdef HAVE_MEMCPY +# ifdef SMALL_MEDIUM /* MSDOS small or medium model */ +# define zmemcpy _fmemcpy +# define zmemcmp _fmemcmp +# define zmemzero(dest, len) _fmemset(dest, 0, len) +# else +# define zmemcpy memcpy +# define zmemcmp memcmp +# define zmemzero(dest, len) memset(dest, 0, len) +# endif +#else + extern void zmemcpy OF((Bytef* dest, const Bytef* source, uInt len)); + extern int zmemcmp OF((const Bytef* s1, const Bytef* s2, uInt len)); + extern void zmemzero OF((Bytef* dest, uInt len)); +#endif + +/* Diagnostic functions */ +#ifdef DEBUG +# include + extern int z_verbose; + extern void z_error OF((char *m)); +# define Assert(cond,msg) {if(!(cond)) z_error(msg);} +# define Trace(x) {if (z_verbose>=0) fprintf x ;} +# define Tracev(x) {if (z_verbose>0) fprintf x ;} +# define Tracevv(x) {if (z_verbose>1) fprintf x ;} +# define Tracec(c,x) {if (z_verbose>0 && (c)) fprintf x ;} +# define Tracecv(c,x) {if (z_verbose>1 && (c)) fprintf x ;} +#else +# define Assert(cond,msg) +# define Trace(x) +# define Tracev(x) +# define Tracevv(x) +# define Tracec(c,x) +# define Tracecv(c,x) +#endif + + +typedef uLong (ZEXPORT *check_func) OF((uLong check, const Bytef *buf, + uInt len)); +voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size)); +void zcfree OF((voidpf opaque, voidpf ptr)); + +#define ZALLOC(strm, items, size) \ + (*((strm)->zalloc))((strm)->opaque, (items), (size)) +#define ZFREE(strm, addr) (*((strm)->zfree))((strm)->opaque, (voidpf)(addr)) +#define TRY_FREE(s, p) {if (p) ZFREE(s, p);} + +#endif /* _Z_UTIL_H */