<?xml version="1.0" encoding="UTF-8"?><?fileVersion 4.0.0?><cproject>\r
<storageModule moduleId="org.eclipse.cdt.core.settings">\r
-<cconfiguration id="converted.config.2133715230">\r
-<storageModule moduleId="scannerConfiguration">\r
-<autodiscovery enabled="true" problemReportingEnabled="true" selectedProfileId="org.eclipse.cdt.make.core.GCCStandardMakePerProjectProfile"/>\r
-<profile id="org.eclipse.cdt.make.core.GCCStandardMakePerProjectProfile">\r
-<buildOutputProvider>\r
-<openAction enabled="true" filePath=""/>\r
-<parser enabled="true"/>\r
-</buildOutputProvider>\r
-<scannerInfoProvider id="specsFile">\r
-<runAction arguments="-E -P -v -dD ${plugin_state_location}/${specs_file}" command="gcc" useDefault="true"/>\r
-<parser enabled="true"/>\r
-</scannerInfoProvider>\r
-</profile>\r
-<profile id="org.eclipse.cdt.make.core.GCCStandardMakePerFileProfile">\r
-<buildOutputProvider>\r
-<openAction enabled="false" filePath=""/>\r
-<parser enabled="false"/>\r
-</buildOutputProvider>\r
-<scannerInfoProvider id="makefileGenerator">\r
-<runAction arguments="-f ${project_name}_scd.mk" command="make" useDefault="true"/>\r
-<parser enabled="false"/>\r
-</scannerInfoProvider>\r
-</profile>\r
-<profile id="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfile">\r
-<buildOutputProvider>\r
-<openAction enabled="false" filePath=""/>\r
-<parser enabled="false"/>\r
-</buildOutputProvider>\r
-<scannerInfoProvider id="specsFile">\r
-<runAction arguments="-E -P -v -dD ${plugin_state_location}/${specs_file}" command="gcc" useDefault="true"/>\r
-<parser enabled="false"/>\r
-</scannerInfoProvider>\r
-</profile>\r
-<profile id="org.eclipse.cdt.managedbuilder.core.GCCWinManagedMakePerProjectProfile">\r
-<buildOutputProvider>\r
-<openAction enabled="false" filePath=""/>\r
-<parser enabled="false"/>\r
-</buildOutputProvider>\r
-<scannerInfoProvider id="specsFile">\r
-<runAction arguments="-E -P -v -dD ${plugin_state_location}/${specs_file}" command="gcc" useDefault="true"/>\r
-<parser enabled="false"/>\r
-</scannerInfoProvider>\r
-</profile>\r
-</storageModule>\r
-\r
-<storageModule buildSystemId="org.eclipse.cdt.core.defaultConfigDataProvider" id="converted.config.2133715230" moduleId="org.eclipse.cdt.core.settings" name="convertedConfig">\r
+<cconfiguration id="org.eclipse.linuxtools.cdt.autotools.configuration.build.1405330975">\r
+<storageModule buildSystemId="org.eclipse.cdt.managedbuilder.core.configurationDataProvider" id="org.eclipse.linuxtools.cdt.autotools.configuration.build.1405330975" moduleId="org.eclipse.cdt.core.settings" name="Build (GNU)">\r
<externalSettings/>\r
<extensions>\r
-<extension id="org.eclipse.cdt.core.nullindexer" point="org.eclipse.cdt.core.CIndexer"/>\r
+<extension id="org.eclipse.linuxtools.cdt.autotools.AutotoolsScannerInfoProvider" point="org.eclipse.cdt.core.ScannerInfoProvider"/>\r
<extension id="org.eclipse.cdt.core.ELF" point="org.eclipse.cdt.core.BinaryParser"/>\r
+<extension id="org.eclipse.cdt.core.GNU_ELF" point="org.eclipse.cdt.core.BinaryParser"/>\r
+<extension id="org.eclipse.cdt.core.MakeErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>\r
+<extension id="org.eclipse.cdt.core.GCCErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>\r
+<extension id="org.eclipse.cdt.core.GASErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>\r
+<extension id="org.eclipse.cdt.core.GLDErrorParser" point="org.eclipse.cdt.core.ErrorParser"/>\r
</extensions>\r
</storageModule>\r
-<storageModule moduleId="org.eclipse.cdt.core.language.mapping"/>\r
-\r
-<storageModule moduleId="org.eclipse.cdt.core.externalSettings"/>\r
-\r
-<storageModule moduleId="org.eclipse.cdt.internal.ui.text.commentOwnerProjectMappings"/>\r
-\r
-\r
-\r
-\r
<storageModule moduleId="org.eclipse.cdt.core.pathentry">\r
<pathentry kind="mac" name="_MSC_VER" path="" value=""/>\r
<pathentry kind="mac" name="WIN32" path="" value=""/>\r
<pathentry kind="src" path="samltest/encryption"/>\r
<pathentry kind="src" path="samlsign"/>\r
</storageModule>\r
+<storageModule moduleId="cdtBuildSystem" version="4.0.0">\r
+<configuration artifactName="cpp-opensaml2" buildArtefactType="org.eclipse.linuxtools.cdt.autotools.buildArtefactType.autotools" buildProperties="org.eclipse.cdt.build.core.buildArtefactType=org.eclipse.linuxtools.cdt.autotools.buildArtefactType.autotools" cleanCommand="rm -rf" description="" errorParsers="org.eclipse.cdt.core.MakeErrorParser;org.eclipse.cdt.core.GCCErrorParser;org.eclipse.cdt.core.GLDErrorParser;org.eclipse.cdt.core.GASErrorParser" id="org.eclipse.linuxtools.cdt.autotools.configuration.build.1405330975" name="Build (GNU)" parent="org.eclipse.linuxtools.cdt.autotools.configuration.build">\r
+<folderInfo id="org.eclipse.linuxtools.cdt.autotools.configuration.build.1405330975." name="/" resourcePath="">\r
+<toolChain id="org.eclipse.linuxtools.cdt.autotools.toolChain.895786207" name="GNU Autotools Toolchain" superClass="org.eclipse.linuxtools.cdt.autotools.toolChain">\r
+<targetPlatform id="org.eclipse.linuxtools.cdt.autotools.toolchain.targetPlatform.66175432" isAbstract="false" name="GNU Autotools Target Platform" superClass="org.eclipse.linuxtools.cdt.autotools.toolchain.targetPlatform"/>\r
+<builder buildPath="${workspace_loc:/cpp-opensaml2/build}" id="org.eclipse.linuxtools.cdt.autotools.toolchain.builder.858504417" keepEnvironmentInBuildfile="false" name="Autotools Makefile Generator" superClass="org.eclipse.linuxtools.cdt.autotools.toolchain.builder"/>\r
+<tool id="org.eclipse.linuxtools.cdt.autotools.gnu.toolchain.tool.configure.641724614" name="configure" superClass="org.eclipse.linuxtools.cdt.autotools.gnu.toolchain.tool.configure">\r
+<option id="org.eclipse.linuxtools.cdt.autotools.option.configure.symbols.1201952487" superClass="org.eclipse.linuxtools.cdt.autotools.option.configure.symbols" valueType="definedSymbols">\r
+<listOptionValue builtIn="false" value="SAML_API"/>\r
+<listOptionValue builtIn="false" value="SAML_DLLLOCAL"/>\r
+</option>\r
+<inputType id="org.eclipse.linuxtools.cdt.autotools.inputType.configure.333195913" superClass="org.eclipse.linuxtools.cdt.autotools.inputType.configure"/>\r
+<inputType id="org.eclipse.linuxtools.cdt.autotools.inputType.configure1.1782120512" superClass="org.eclipse.linuxtools.cdt.autotools.inputType.configure1"/>\r
+</tool>\r
+<tool id="org.eclipse.linuxtools.cdt.autotools.toolchain.tool.autogen.1343927823" name="autogen.sh" superClass="org.eclipse.linuxtools.cdt.autotools.toolchain.tool.autogen"/>\r
+</toolChain>\r
+</folderInfo>\r
+<sourceEntries>\r
+<entry excluding="samlsign|saml|samltest" flags="VALUE_WORKSPACE_PATH|RESOLVED" kind="sourcePath" name=""/>\r
+<entry excluding="Debug/|Release/|x64/" flags="VALUE_WORKSPACE_PATH" kind="sourcePath" name="saml"/>\r
+<entry excluding="Debug/|Release/|x64/" flags="VALUE_WORKSPACE_PATH" kind="sourcePath" name="samltest"/>\r
+<entry flags="VALUE_WORKSPACE_PATH" kind="sourcePath" name="samlsign"/>\r
+</sourceEntries>\r
+</configuration>\r
+</storageModule>\r
+<storageModule moduleId="scannerConfiguration">\r
+<autodiscovery enabled="true" problemReportingEnabled="true" selectedProfileId="org.eclipse.cdt.make.core.GCCStandardMakePerProjectProfile"/>\r
+<profile id="org.eclipse.cdt.make.core.GCCStandardMakePerProjectProfile">\r
+<buildOutputProvider>\r
+<openAction enabled="true" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/${specs_file}" command="gcc" useDefault="true"/>\r
+<parser enabled="true"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.make.core.GCCStandardMakePerFileProfile">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="false"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="makefileGenerator">\r
+<runAction arguments="-f ${project_name}_scd.mk" command="make" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfile">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="false"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/${specs_file}" command="gcc" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCWinManagedMakePerProjectProfile">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="false"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/${specs_file}" command="gcc" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfileCPP">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/specs.cpp" command="g++" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfileC">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/specs.c" command="gcc" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCWinManagedMakePerProjectProfileCPP">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-c 'g++ -E -P -v -dD "${plugin_state_location}/specs.cpp"'" command="sh" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCWinManagedMakePerProjectProfileC">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-c 'gcc -E -P -v -dD "${plugin_state_location}/specs.c"'" command="sh" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<scannerConfigBuildInfo instanceId="org.eclipse.linuxtools.cdt.autotools.configuration.build.1405330975;org.eclipse.linuxtools.cdt.autotools.configuration.build.1405330975.">\r
+<autodiscovery enabled="true" problemReportingEnabled="true" selectedProfileId="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfile"/>\r
+<profile id="org.eclipse.cdt.make.core.GCCStandardMakePerProjectProfile">\r
+<buildOutputProvider>\r
+<openAction enabled="true" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/${specs_file}" command="gcc" useDefault="true"/>\r
+<parser enabled="true"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.make.core.GCCStandardMakePerFileProfile">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="false"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="makefileGenerator">\r
+<runAction arguments="-f ${project_name}_scd.mk" command="make" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfile">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="false"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/${specs_file}" command="gcc" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCWinManagedMakePerProjectProfile">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="false"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/${specs_file}" command="gcc" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfileCPP">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/specs.cpp" command="g++" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCManagedMakePerProjectProfileC">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-E -P -v -dD ${plugin_state_location}/specs.c" command="gcc" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCWinManagedMakePerProjectProfileCPP">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-c 'g++ -E -P -v -dD "${plugin_state_location}/specs.cpp"'" command="sh" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+<profile id="org.eclipse.cdt.managedbuilder.core.GCCWinManagedMakePerProjectProfileC">\r
+<buildOutputProvider>\r
+<openAction enabled="false" filePath=""/>\r
+<parser enabled="true"/>\r
+</buildOutputProvider>\r
+<scannerInfoProvider id="specsFile">\r
+<runAction arguments="-c 'gcc -E -P -v -dD "${plugin_state_location}/specs.c"'" command="sh" useDefault="true"/>\r
+<parser enabled="false"/>\r
+</scannerInfoProvider>\r
+</profile>\r
+</scannerConfigBuildInfo>\r
+</storageModule>\r
+<storageModule moduleId="org.eclipse.cdt.core.externalSettings"/>\r
+<storageModule moduleId="org.eclipse.cdt.core.language.mapping"/>\r
+<storageModule moduleId="org.eclipse.cdt.internal.ui.text.commentOwnerProjectMappings"/>\r
</cconfiguration>\r
</storageModule>\r
+<storageModule moduleId="cdtBuildSystem" version="4.0.0">\r
+<project id="cpp-opensaml2.org.eclipse.linuxtools.cdt.autotools.projectType.886229003" name="GNU Autotools" projectType="org.eclipse.linuxtools.cdt.autotools.projectType"/>\r
+</storageModule>\r
</cproject>\r
<name>cpp-opensaml2</name>\r
<comment></comment>\r
<projects>\r
- <project>XMLTooling-C</project>\r
</projects>\r
<buildSpec>\r
<buildCommand>\r
- <name>org.eclipse.cdt.make.core.makeBuilder</name>\r
- <triggers>clean,full,incremental,</triggers>\r
+ <name>org.eclipse.linuxtools.cdt.autotools.genmakebuilder</name>\r
<arguments>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.build.arguments</key>\r
- <value></value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.core.errorOutputParser</key>\r
- <value>org.eclipse.cdt.core.MakeErrorParser;org.eclipse.cdt.core.GCCErrorParser;org.eclipse.cdt.core.GASErrorParser;org.eclipse.cdt.core.GLDErrorParser;org.eclipse.cdt.core.VCErrorParser;</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.environment</key>\r
- <value></value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.enableAutoBuild</key>\r
- <value>false</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.build.target.inc</key>\r
- <value>all</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.enableFullBuild</key>\r
- <value>true</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.enabledIncrementalBuild</key>\r
- <value>true</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.build.command</key>\r
- <value>make</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.build.target.clean</key>\r
- <value>clean</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.enableCleanBuild</key>\r
- <value>true</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.append_environment</key>\r
- <value>true</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.build.target.full</key>\r
- <value>clean all</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.useDefaultBuildCmd</key>\r
- <value>true</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.build.target.auto</key>\r
- <value>all</value>\r
- </dictionary>\r
- <dictionary>\r
- <key>org.eclipse.cdt.make.core.stopOnError</key>\r
- <value>false</value>\r
- </dictionary>\r
</arguments>\r
</buildCommand>\r
<buildCommand>\r
- <name>org.eclipse.cdt.make.core.ScannerConfigBuilder</name>\r
+ <name>org.eclipse.cdt.managedbuilder.core.ScannerConfigBuilder</name>\r
<arguments>\r
</arguments>\r
</buildCommand>\r
</buildSpec>\r
<natures>\r
<nature>org.eclipse.cdt.core.cnature</nature>\r
- <nature>org.eclipse.cdt.make.core.makeNature</nature>\r
- <nature>org.eclipse.cdt.make.core.ScannerConfigNature</nature>\r
<nature>org.eclipse.cdt.core.ccnature</nature>\r
+ <nature>org.eclipse.cdt.managedbuilder.core.managedBuildNature</nature>\r
+ <nature>org.eclipse.linuxtools.cdt.autotools.autotoolsNature</nature>\r
+ <nature>org.eclipse.cdt.managedbuilder.core.ScannerConfigNature</nature>\r
</natures>\r
</projectDescription>\r
-dnl @synopsis AC_CXX_NAMESPACES\r
-dnl\r
-dnl If the compiler can prevent names clashes using namespaces, define\r
-dnl HAVE_NAMESPACES.\r
-dnl\r
-dnl @author Luc Maisonobe\r
-dnl\r
-AC_DEFUN([AC_CXX_NAMESPACES],\r
-[AC_CACHE_CHECK(whether the compiler implements namespaces,\r
-ac_cv_cxx_namespaces,\r
-[AC_LANG_SAVE\r
- AC_LANG_CPLUSPLUS\r
- AC_TRY_COMPILE([namespace Outer { namespace Inner { int i = 0; }}],\r
- [using namespace Outer::Inner; return i;],\r
- ac_cv_cxx_namespaces=yes, ac_cv_cxx_namespaces=no)\r
- AC_LANG_RESTORE\r
-])\r
-if test "$ac_cv_cxx_namespaces" = yes; then\r
- AC_DEFINE(HAVE_NAMESPACES,1,[define if the compiler implements namespaces])\r
-fi\r
-])\r
-\r
-\r
-dnl\r
-dnl @author Luc Maisonobe\r
-dnl\r
-AC_DEFUN([AC_CXX_REQUIRE_STL],\r
-[AC_CACHE_CHECK(whether the compiler supports Standard Template Library,\r
-ac_cv_cxx_have_stl,\r
-[AC_REQUIRE([AC_CXX_NAMESPACES])\r
- AC_LANG_SAVE\r
- AC_LANG_CPLUSPLUS\r
- AC_TRY_COMPILE([#include <list>\r
-#include <deque>\r
-#ifdef HAVE_NAMESPACES\r
-using namespace std;\r
-#endif],[list<int> x; x.push_back(5);\r
-list<int>::iterator iter = x.begin(); if (iter != x.end()) ++iter; return 0;],\r
- ac_cv_cxx_have_stl=yes, ac_cv_cxx_have_stl=no)\r
- AC_LANG_RESTORE\r
-])\r
-if test "x_$ac_cv_cxx_have_stl" != x_yes; then\r
- AC_MSG_ERROR([C++ Standard Template Libary unsupported])\r
-fi\r
-])\r
-\r
-dnl Determine whether we have gcc of a particular version or later,\r
-dnl based on major, minor, patchlevel versions and date.\r
-dnl AC_HAVE_GCC_VERSION(MAJOR_VERSION, MINOR_VERSION, PATCH_LEVEL, \r
-dnl SNAPSHOT_DATE [, ACTION-IF-FOUND [, ACTION-IF-NOT-FOUND]])\r
-AC_DEFUN(AC_HAVE_GCC_VERSION,\r
-[AC_CACHE_CHECK([gcc is at least version $1.$2.$3.$4],\r
- ac_cv_gcc_version_$1_$2_$3_$4,\r
-[\r
- if test x$GCC = x ; then ac_cv_gcc_version_$1_$2_$3_$4=no\r
- else \r
- ac_gcc_date=`$CC -v 2>&1 | grep '^gcc version ' | sed 's/ (.*//; s/.* //'`\r
- if test 0$ac_gcc_date -eq 0 ; then ac_gcc_date=0 ; fi\r
- AC_EGREP_CPP(yes, [#define HAVE_GCC_VERSION(MAJOR, MINOR, MICRO, DATE) \\r
- (__GNUC__ > (MAJOR) \\r
- || (__GNUC__ == (MAJOR) && __GNUC_MINOR__ > (MINOR)) \\r
- || (__GNUC__ == (MAJOR) && __GNUC_MINOR__ == (MINOR) \\r
- && __GNUC_PATCHLEVEL__ > (MICRO)) \\r
- || (__GNUC__ == (MAJOR) && __GNUC_MINOR__ == (MINOR) \\r
- && __GNUC_PATCHLEVEL__ == (MICRO) && ${ac_gcc_date}L >= (DATE)))\r
-#if HAVE_GCC_VERSION($1,$2,$3,$4)\r
-yes\r
-#endif],\r
- AC_DEFINE_UNQUOTED(HAVE_GCC_VERSION_$1_$2_$3_$4, 1,\r
- [Define to 1 if we have gcc $1.$2.$3 ($4)])\r
- ac_cv_gcc_version_$1_$2_$3_$4=yes ; $5,\r
- ac_cv_gcc_version_$1_$2_$3_$4=no ; $6)\r
-fi\r
-])])dnl\r
+dnl @synopsis AC_CXX_NAMESPACES
+dnl
+dnl If the compiler can prevent names clashes using namespaces, define
+dnl HAVE_NAMESPACES.
+dnl
+dnl @author Luc Maisonobe
+dnl
+AC_DEFUN([AC_CXX_NAMESPACES],
+[AC_CACHE_CHECK(whether the compiler implements namespaces,
+ac_cv_cxx_namespaces,
+[AC_LANG_SAVE
+ AC_LANG_CPLUSPLUS
+ AC_TRY_COMPILE([namespace Outer { namespace Inner { int i = 0; }}],
+ [using namespace Outer::Inner; return i;],
+ ac_cv_cxx_namespaces=yes, ac_cv_cxx_namespaces=no)
+ AC_LANG_RESTORE
+])
+if test "$ac_cv_cxx_namespaces" = yes; then
+ AC_DEFINE(HAVE_NAMESPACES,1,[define if the compiler implements namespaces])
+fi
+])
+
+
+dnl
+dnl @author Luc Maisonobe
+dnl
+AC_DEFUN([AC_CXX_REQUIRE_STL],
+[AC_CACHE_CHECK(whether the compiler supports Standard Template Library,
+ac_cv_cxx_have_stl,
+[AC_REQUIRE([AC_CXX_NAMESPACES])
+ AC_LANG_SAVE
+ AC_LANG_CPLUSPLUS
+ AC_TRY_COMPILE([#include <list>
+#include <deque>
+#ifdef HAVE_NAMESPACES
+using namespace std;
+#endif],[list<int> x; x.push_back(5);
+list<int>::iterator iter = x.begin(); if (iter != x.end()) ++iter; return 0;],
+ ac_cv_cxx_have_stl=yes, ac_cv_cxx_have_stl=no)
+ AC_LANG_RESTORE
+])
+if test "x_$ac_cv_cxx_have_stl" != x_yes; then
+ AC_MSG_ERROR([C++ Standard Template Libary unsupported])
+fi
+])
+
+dnl Determine whether we have gcc of a particular version or later,
+dnl based on major, minor, patchlevel versions and date.
+dnl AC_HAVE_GCC_VERSION(MAJOR_VERSION, MINOR_VERSION, PATCH_LEVEL,
+dnl SNAPSHOT_DATE [, ACTION-IF-FOUND [, ACTION-IF-NOT-FOUND]])
+AC_DEFUN(AC_HAVE_GCC_VERSION,
+[AC_CACHE_CHECK([gcc is at least version $1.$2.$3.$4],
+ ac_cv_gcc_version_$1_$2_$3_$4,
+[
+ if test x$GCC = x ; then ac_cv_gcc_version_$1_$2_$3_$4=no
+ else
+ ac_gcc_date=`$CC -v 2>&1 | grep '^gcc version ' | sed 's/ (.*//; s/.* //'`
+ if test 0$ac_gcc_date -eq 0 ; then ac_gcc_date=0 ; fi
+ AC_EGREP_CPP(yes, [#define HAVE_GCC_VERSION(MAJOR, MINOR, MICRO, DATE) \
+ (__GNUC__ > (MAJOR) \
+ || (__GNUC__ == (MAJOR) && __GNUC_MINOR__ > (MINOR)) \
+ || (__GNUC__ == (MAJOR) && __GNUC_MINOR__ == (MINOR) \
+ && __GNUC_PATCHLEVEL__ > (MICRO)) \
+ || (__GNUC__ == (MAJOR) && __GNUC_MINOR__ == (MINOR) \
+ && __GNUC_PATCHLEVEL__ == (MICRO) && ${ac_gcc_date}L >= (DATE)))
+#if HAVE_GCC_VERSION($1,$2,$3,$4)
+yes
+#endif],
+ AC_DEFINE_UNQUOTED(HAVE_GCC_VERSION_$1_$2_$3_$4, 1,
+ [Define to 1 if we have gcc $1.$2.$3 ($4)])
+ ac_cv_gcc_version_$1_$2_$3_$4=yes ; $5,
+ ac_cv_gcc_version_$1_$2_$3_$4=no ; $6)
+fi
+])])dnl
-VERSION 2.2.1
+VERSION 2.3
Issues addressed by this release:
---------------------------------
-https://bugs.internet2.edu/jira/secure/IssueNavigator.jspa?reset=true&&pid=10010&fixfor=10231&status=5&status=6&sorter/field=issuekey&sorter/order=ASC
+https://bugs.internet2.edu/jira/browse/CPPOST/fixforversion/10260
Documentation:
--------------
-# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*-\r
-## Copyright 1996, 1997, 1998, 1999, 2000, 2001\r
-## Free Software Foundation, Inc.\r
-## Originally by Gordon Matzigkeit <gord@gnu.ai.mit.edu>, 1996\r
-##\r
-## This program is free software; you can redistribute it and/or modify\r
-## it under the terms of the GNU General Public License as published by\r
-## the Free Software Foundation; either version 2 of the License, or\r
-## (at your option) any later version.\r
-##\r
-## This program is distributed in the hope that it will be useful, but\r
-## WITHOUT ANY WARRANTY; without even the implied warranty of\r
-## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
-## General Public License for more details.\r
-##\r
-## You should have received a copy of the GNU General Public License\r
-## along with this program; if not, write to the Free Software\r
-## Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\r
-##\r
-## As a special exception to the GNU General Public License, if you\r
-## distribute this file as part of a program that contains a\r
-## configuration script generated by Autoconf, you may include it under\r
-## the same distribution terms that you use for the rest of that program.\r
-\r
-# serial 47 AC_PROG_LIBTOOL\r
-\r
-\r
-# AC_PROVIDE_IFELSE(MACRO-NAME, IF-PROVIDED, IF-NOT-PROVIDED)\r
-# -----------------------------------------------------------\r
-# If this macro is not defined by Autoconf, define it here.\r
-m4_ifdef([AC_PROVIDE_IFELSE],\r
- [],\r
- [m4_define([AC_PROVIDE_IFELSE],\r
- [m4_ifdef([AC_PROVIDE_$1],\r
- [$2], [$3])])])\r
-\r
-\r
-# AC_PROG_LIBTOOL\r
-# ---------------\r
-AC_DEFUN([AC_PROG_LIBTOOL],\r
-[AC_REQUIRE([_AC_PROG_LIBTOOL])dnl\r
-dnl If AC_PROG_CXX has already been expanded, run AC_LIBTOOL_CXX\r
-dnl immediately, otherwise, hook it in at the end of AC_PROG_CXX.\r
- AC_PROVIDE_IFELSE([AC_PROG_CXX],\r
- [AC_LIBTOOL_CXX],\r
- [define([AC_PROG_CXX], defn([AC_PROG_CXX])[AC_LIBTOOL_CXX\r
- ])])\r
-dnl And a similar setup for Fortran 77 support\r
- AC_PROVIDE_IFELSE([AC_PROG_F77],\r
- [AC_LIBTOOL_F77],\r
- [define([AC_PROG_F77], defn([AC_PROG_F77])[AC_LIBTOOL_F77\r
-])])\r
-\r
-dnl Quote A][M_PROG_GCJ so that aclocal doesn't bring it in needlessly.\r
-dnl If either AC_PROG_GCJ or A][M_PROG_GCJ have already been expanded, run\r
-dnl AC_LIBTOOL_GCJ immediately, otherwise, hook it in at the end of both.\r
- AC_PROVIDE_IFELSE([AC_PROG_GCJ],\r
- [AC_LIBTOOL_GCJ],\r
- [AC_PROVIDE_IFELSE([A][M_PROG_GCJ],\r
- [AC_LIBTOOL_GCJ],\r
- [AC_PROVIDE_IFELSE([LT_AC_PROG_GCJ],\r
- [AC_LIBTOOL_GCJ],\r
- [ifdef([AC_PROG_GCJ],\r
- [define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[AC_LIBTOOL_GCJ])])\r
- ifdef([A][M_PROG_GCJ],\r
- [define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[AC_LIBTOOL_GCJ])])\r
- ifdef([LT_AC_PROG_GCJ],\r
- [define([LT_AC_PROG_GCJ],\r
- defn([LT_AC_PROG_GCJ])[AC_LIBTOOL_GCJ])])])])\r
-])])# AC_PROG_LIBTOOL\r
-\r
-\r
-# _AC_PROG_LIBTOOL\r
-# ----------------\r
-AC_DEFUN([_AC_PROG_LIBTOOL],\r
-[AC_REQUIRE([AC_LIBTOOL_SETUP])dnl\r
-AC_BEFORE([$0],[AC_LIBTOOL_CXX])dnl\r
-AC_BEFORE([$0],[AC_LIBTOOL_F77])dnl\r
-AC_BEFORE([$0],[AC_LIBTOOL_GCJ])dnl\r
-\r
-# This can be used to rebuild libtool when needed\r
-LIBTOOL_DEPS="$ac_aux_dir/ltmain.sh"\r
-\r
-# Always use our own libtool.\r
-LIBTOOL='$(SHELL) $(top_builddir)/libtool'\r
-AC_SUBST(LIBTOOL)dnl\r
-\r
-# Prevent multiple expansion\r
-define([AC_PROG_LIBTOOL], [])\r
-])# _AC_PROG_LIBTOOL\r
-\r
-\r
-# AC_LIBTOOL_SETUP\r
-# ----------------\r
-AC_DEFUN([AC_LIBTOOL_SETUP],\r
-[AC_PREREQ(2.50)dnl\r
-AC_REQUIRE([AC_ENABLE_SHARED])dnl\r
-AC_REQUIRE([AC_ENABLE_STATIC])dnl\r
-AC_REQUIRE([AC_ENABLE_FAST_INSTALL])dnl\r
-AC_REQUIRE([AC_CANONICAL_HOST])dnl\r
-AC_REQUIRE([AC_CANONICAL_BUILD])dnl\r
-AC_REQUIRE([AC_PROG_CC])dnl\r
-AC_REQUIRE([AC_PROG_LD])dnl\r
-AC_REQUIRE([AC_PROG_LD_RELOAD_FLAG])dnl\r
-AC_REQUIRE([AC_PROG_NM])dnl\r
-\r
-AC_REQUIRE([AC_PROG_LN_S])dnl\r
-AC_REQUIRE([AC_DEPLIBS_CHECK_METHOD])dnl\r
-# Autoconf 2.13's AC_OBJEXT and AC_EXEEXT macros only works for C compilers!\r
-AC_REQUIRE([AC_OBJEXT])dnl\r
-AC_REQUIRE([AC_EXEEXT])dnl\r
-dnl\r
-\r
-AC_LIBTOOL_SYS_MAX_CMD_LEN\r
-AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE\r
-AC_LIBTOOL_OBJDIR\r
-\r
-AC_REQUIRE([_LT_AC_SYS_COMPILER])dnl\r
-_LT_AC_PROG_ECHO_BACKSLASH\r
-\r
-case $host_os in\r
-aix3*)\r
- # AIX sometimes has problems with the GCC collect2 program. For some\r
- # reason, if we set the COLLECT_NAMES environment variable, the problems\r
- # vanish in a puff of smoke.\r
- if test "X${COLLECT_NAMES+set}" != Xset; then\r
- COLLECT_NAMES=\r
- export COLLECT_NAMES\r
- fi\r
- ;;\r
-esac\r
-\r
-# Sed substitution that helps us do robust quoting. It backslashifies\r
-# metacharacters that are still active within double-quoted strings.\r
-Xsed='sed -e s/^X//'\r
-[sed_quote_subst='s/\([\\"\\`$\\\\]\)/\\\1/g']\r
-\r
-# Same as above, but do not quote variable references.\r
-[double_quote_subst='s/\([\\"\\`\\\\]\)/\\\1/g']\r
-\r
-# Sed substitution to delay expansion of an escaped shell variable in a\r
-# double_quote_subst'ed string.\r
-delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g'\r
-\r
-# Sed substitution to avoid accidental globbing in evaled expressions\r
-no_glob_subst='s/\*/\\\*/g'\r
-\r
-# Constants:\r
-rm="rm -f"\r
-\r
-# Global variables:\r
-default_ofile=libtool\r
-can_build_shared=yes\r
-\r
-# All known linkers require a `.a' archive for static linking (except M$VC,\r
-# which needs '.lib').\r
-libext=a\r
-ltmain="$ac_aux_dir/ltmain.sh"\r
-ofile="$default_ofile"\r
-with_gnu_ld="$lt_cv_prog_gnu_ld"\r
-\r
-AC_CHECK_TOOL(AR, ar, false)\r
-AC_CHECK_TOOL(RANLIB, ranlib, :)\r
-AC_CHECK_TOOL(STRIP, strip, :)\r
-\r
-old_CC="$CC"\r
-old_CFLAGS="$CFLAGS"\r
-\r
-# Set sane defaults for various variables\r
-test -z "$AR" && AR=ar\r
-test -z "$AR_FLAGS" && AR_FLAGS=cru\r
-test -z "$AS" && AS=as\r
-test -z "$CC" && CC=cc\r
-test -z "$LTCC" && LTCC=$CC\r
-test -z "$DLLTOOL" && DLLTOOL=dlltool\r
-test -z "$LD" && LD=ld\r
-test -z "$LN_S" && LN_S="ln -s"\r
-test -z "$MAGIC_CMD" && MAGIC_CMD=file\r
-test -z "$NM" && NM=nm\r
-test -z "$SED" && SED=sed\r
-test -z "$OBJDUMP" && OBJDUMP=objdump\r
-test -z "$RANLIB" && RANLIB=:\r
-test -z "$STRIP" && STRIP=:\r
-test -z "$ac_objext" && ac_objext=o\r
-\r
-# Determine commands to create old-style static archives.\r
-old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs$old_deplibs'\r
-old_postinstall_cmds='chmod 644 $oldlib'\r
-old_postuninstall_cmds=\r
-\r
-if test -n "$RANLIB"; then\r
- case $host_os in\r
- openbsd*)\r
- old_postinstall_cmds="\$RANLIB -t \$oldlib~$old_postinstall_cmds"\r
- ;;\r
- *)\r
- old_postinstall_cmds="\$RANLIB \$oldlib~$old_postinstall_cmds"\r
- ;;\r
- esac\r
- old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib"\r
-fi\r
-\r
-# Only perform the check for file, if the check method requires it\r
-case $deplibs_check_method in\r
-file_magic*)\r
- if test "$file_magic_cmd" = '$MAGIC_CMD'; then\r
- AC_PATH_MAGIC\r
- fi\r
- ;;\r
-esac\r
-\r
-AC_PROVIDE_IFELSE([AC_LIBTOOL_DLOPEN], enable_dlopen=yes, enable_dlopen=no)\r
-AC_PROVIDE_IFELSE([AC_LIBTOOL_WIN32_DLL],\r
-enable_win32_dll=yes, enable_win32_dll=no)\r
-\r
-AC_ARG_ENABLE([libtool-lock],\r
- [AC_HELP_STRING([--disable-libtool-lock],\r
- [avoid locking (might break parallel builds)])])\r
-test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes\r
-\r
-AC_ARG_WITH([pic],\r
- [AC_HELP_STRING([--with-pic],\r
- [try to use only PIC/non-PIC objects @<:@default=use both@:>@])],\r
- [pic_mode="$withval"],\r
- [pic_mode=default])\r
-test -z "$pic_mode" && pic_mode=default\r
-\r
-# Use C for the default configuration in the libtool script\r
-tagname=\r
-AC_LIBTOOL_LANG_C_CONFIG\r
-_LT_AC_TAGCONFIG\r
-])# AC_LIBTOOL_SETUP\r
-\r
-\r
-# _LT_AC_SYS_COMPILER\r
-# -------------------\r
-AC_DEFUN([_LT_AC_SYS_COMPILER],\r
-[AC_REQUIRE([AC_PROG_CC])dnl\r
-\r
-# If no C compiler was specified, use CC.\r
-LTCC=${LTCC-"$CC"}\r
-\r
-# Allow CC to be a program name with arguments.\r
-compiler=$CC\r
-])# _LT_AC_SYS_COMPILER\r
-\r
-\r
-# _LT_AC_SYS_LIBPATH_AIX\r
-# ----------------------\r
-# Links a minimal program and checks the executable\r
-# for the system default hardcoded library path. In most cases,\r
-# this is /usr/lib:/lib, but when the MPI compilers are used\r
-# the location of the communication and MPI libs are included too.\r
-# If we don't find anything, use the default library path according\r
-# to the aix ld manual.\r
-AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX],\r
-[AC_LINK_IFELSE(AC_LANG_PROGRAM,[\r
-aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; }\r
-}'`\r
-# Check for a 64-bit object if we didn't find anything.\r
-if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; }\r
-}'`; fi],[])\r
-if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi\r
-])# _LT_AC_SYS_LIBPATH_AIX\r
-\r
-\r
-# _LT_AC_SHELL_INIT(ARG)\r
-# ----------------------\r
-AC_DEFUN([_LT_AC_SHELL_INIT],\r
-[ifdef([AC_DIVERSION_NOTICE],\r
- [AC_DIVERT_PUSH(AC_DIVERSION_NOTICE)],\r
- [AC_DIVERT_PUSH(NOTICE)])\r
-$1\r
-AC_DIVERT_POP\r
-])# _LT_AC_SHELL_INIT\r
-\r
-\r
-# _LT_AC_PROG_ECHO_BACKSLASH\r
-# --------------------------\r
-# Add some code to the start of the generated configure script which\r
-# will find an echo command which doesn't interpret backslashes.\r
-AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH],\r
-[_LT_AC_SHELL_INIT([\r
-# Check that we are running under the correct shell.\r
-SHELL=${CONFIG_SHELL-/bin/sh}\r
-\r
-case X$ECHO in\r
-X*--fallback-echo)\r
- # Remove one level of quotation (which was required for Make).\r
- ECHO=`echo "$ECHO" | sed 's,\\\\\[$]\\[$]0,'[$]0','`\r
- ;;\r
-esac\r
-\r
-echo=${ECHO-echo}\r
-if test "X[$]1" = X--no-reexec; then\r
- # Discard the --no-reexec flag, and continue.\r
- shift\r
-elif test "X[$]1" = X--fallback-echo; then\r
- # Avoid inline document here, it may be left over\r
- :\r
-elif test "X`($echo '\t') 2>/dev/null`" = 'X\t' ; then\r
- # Yippee, $echo works!\r
- :\r
-else\r
- # Restart under the correct shell.\r
- exec $SHELL "[$]0" --no-reexec ${1+"[$]@"}\r
-fi\r
-\r
-if test "X[$]1" = X--fallback-echo; then\r
- # used as fallback echo\r
- shift\r
- cat <<EOF\r
-[$]*\r
-EOF\r
- exit 0\r
-fi\r
-\r
-# The HP-UX ksh and POSIX shell print the target directory to stdout\r
-# if CDPATH is set.\r
-if test "X${CDPATH+set}" = Xset; then CDPATH=:; export CDPATH; fi\r
-\r
-if test -z "$ECHO"; then\r
-if test "X${echo_test_string+set}" != Xset; then\r
-# find a string as large as possible, as long as the shell can cope with it\r
- for cmd in 'sed 50q "[$]0"' 'sed 20q "[$]0"' 'sed 10q "[$]0"' 'sed 2q "[$]0"' 'echo test'; do\r
- # expected sizes: less than 2Kb, 1Kb, 512 bytes, 16 bytes, ...\r
- if (echo_test_string="`eval $cmd`") 2>/dev/null &&\r
- echo_test_string="`eval $cmd`" &&\r
- (test "X$echo_test_string" = "X$echo_test_string") 2>/dev/null\r
- then\r
- break\r
- fi\r
- done\r
-fi\r
-\r
-if test "X`($echo '\t') 2>/dev/null`" = 'X\t' &&\r
- echo_testing_string=`($echo "$echo_test_string") 2>/dev/null` &&\r
- test "X$echo_testing_string" = "X$echo_test_string"; then\r
- :\r
-else\r
- # The Solaris, AIX, and Digital Unix default echo programs unquote\r
- # backslashes. This makes it impossible to quote backslashes using\r
- # echo "$something" | sed 's/\\/\\\\/g'\r
- #\r
- # So, first we look for a working echo in the user's PATH.\r
-\r
- lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR\r
- for dir in $PATH /usr/ucb; do\r
- IFS="$lt_save_ifs"\r
- if (test -f $dir/echo || test -f $dir/echo$ac_exeext) &&\r
- test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' &&\r
- echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` &&\r
- test "X$echo_testing_string" = "X$echo_test_string"; then\r
- echo="$dir/echo"\r
- break\r
- fi\r
- done\r
- IFS="$lt_save_ifs"\r
-\r
- if test "X$echo" = Xecho; then\r
- # We didn't find a better echo, so look for alternatives.\r
- if test "X`(print -r '\t') 2>/dev/null`" = 'X\t' &&\r
- echo_testing_string=`(print -r "$echo_test_string") 2>/dev/null` &&\r
- test "X$echo_testing_string" = "X$echo_test_string"; then\r
- # This shell has a builtin print -r that does the trick.\r
- echo='print -r'\r
- elif (test -f /bin/ksh || test -f /bin/ksh$ac_exeext) &&\r
- test "X$CONFIG_SHELL" != X/bin/ksh; then\r
- # If we have ksh, try running configure again with it.\r
- ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh}\r
- export ORIGINAL_CONFIG_SHELL\r
- CONFIG_SHELL=/bin/ksh\r
- export CONFIG_SHELL\r
- exec $CONFIG_SHELL "[$]0" --no-reexec ${1+"[$]@"}\r
- else\r
- # Try using printf.\r
- echo='printf %s\n'\r
- if test "X`($echo '\t') 2>/dev/null`" = 'X\t' &&\r
- echo_testing_string=`($echo "$echo_test_string") 2>/dev/null` &&\r
- test "X$echo_testing_string" = "X$echo_test_string"; then\r
- # Cool, printf works\r
- :\r
- elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` &&\r
- test "X$echo_testing_string" = 'X\t' &&\r
- echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` &&\r
- test "X$echo_testing_string" = "X$echo_test_string"; then\r
- CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL\r
- export CONFIG_SHELL\r
- SHELL="$CONFIG_SHELL"\r
- export SHELL\r
- echo="$CONFIG_SHELL [$]0 --fallback-echo"\r
- elif echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` &&\r
- test "X$echo_testing_string" = 'X\t' &&\r
- echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` &&\r
- test "X$echo_testing_string" = "X$echo_test_string"; then\r
- echo="$CONFIG_SHELL [$]0 --fallback-echo"\r
- else\r
- # maybe with a smaller string...\r
- prev=:\r
-\r
- for cmd in 'echo test' 'sed 2q "[$]0"' 'sed 10q "[$]0"' 'sed 20q "[$]0"' 'sed 50q "[$]0"'; do\r
- if (test "X$echo_test_string" = "X`eval $cmd`") 2>/dev/null\r
- then\r
- break\r
- fi\r
- prev="$cmd"\r
- done\r
-\r
- if test "$prev" != 'sed 50q "[$]0"'; then\r
- echo_test_string=`eval $prev`\r
- export echo_test_string\r
- exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "[$]0" ${1+"[$]@"}\r
- else\r
- # Oops. We lost completely, so just stick with echo.\r
- echo=echo\r
- fi\r
- fi\r
- fi\r
- fi\r
-fi\r
-fi\r
-\r
-# Copy echo and quote the copy suitably for passing to libtool from\r
-# the Makefile, instead of quoting the original, which is used later.\r
-ECHO=$echo\r
-if test "X$ECHO" = "X$CONFIG_SHELL [$]0 --fallback-echo"; then\r
- ECHO="$CONFIG_SHELL \\\$\[$]0 --fallback-echo"\r
-fi\r
-\r
-AC_SUBST(ECHO)\r
-])])# _LT_AC_PROG_ECHO_BACKSLASH\r
-\r
-\r
-# _LT_AC_LOCK\r
-# -----------\r
-AC_DEFUN([_LT_AC_LOCK],\r
-[AC_ARG_ENABLE([libtool-lock],\r
- [AC_HELP_STRING([--disable-libtool-lock],\r
- [avoid locking (might break parallel builds)])])\r
-test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes\r
-\r
-# Some flags need to be propagated to the compiler or linker for good\r
-# libtool support.\r
-case $host in\r
-ia64-*-hpux*)\r
- # Find out which ABI we are using.\r
- echo 'int i;' > conftest.$ac_ext\r
- if AC_TRY_EVAL(ac_compile); then\r
- case `/usr/bin/file conftest.$ac_objext` in\r
- *ELF-32*)\r
- HPUX_IA64_MODE="32"\r
- ;;\r
- *ELF-64*)\r
- HPUX_IA64_MODE="64"\r
- ;;\r
- esac\r
- fi\r
- rm -rf conftest*\r
- ;;\r
-*-*-irix6*)\r
- # Find out which ABI we are using.\r
- echo '[#]line __oline__ "configure"' > conftest.$ac_ext\r
- if AC_TRY_EVAL(ac_compile); then\r
- if test "$lt_cv_prog_gnu_ld" = yes; then\r
- case `/usr/bin/file conftest.$ac_objext` in\r
- *32-bit*)\r
- LD="${LD-ld} -melf32bsmip"\r
- ;;\r
- *N32*)\r
- LD="${LD-ld} -melf32bmipn32"\r
- ;;\r
- *64-bit*)\r
- LD="${LD-ld} -melf64bmip"\r
- ;;\r
- esac\r
- else\r
- case `/usr/bin/file conftest.$ac_objext` in\r
- *32-bit*)\r
- LD="${LD-ld} -32"\r
- ;;\r
- *N32*)\r
- LD="${LD-ld} -n32"\r
- ;;\r
- *64-bit*)\r
- LD="${LD-ld} -64"\r
- ;;\r
- esac\r
- fi\r
- fi\r
- rm -rf conftest*\r
- ;;\r
-\r
-x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*|s390*-*linux*|sparc*-*linux*)\r
- # Find out which ABI we are using.\r
- echo 'int i;' > conftest.$ac_ext\r
- if AC_TRY_EVAL(ac_compile); then\r
- case "`/usr/bin/file conftest.o`" in\r
- *32-bit*)\r
- case $host in\r
- x86_64-*linux*)\r
- LD="${LD-ld} -m elf_i386"\r
- ;;\r
- ppc64-*linux*|powerpc64-*linux*)\r
- LD="${LD-ld} -m elf32ppclinux"\r
- ;;\r
- s390x-*linux*)\r
- LD="${LD-ld} -m elf_s390"\r
- ;;\r
- sparc64-*linux*)\r
- LD="${LD-ld} -m elf32_sparc"\r
- ;;\r
- esac\r
- ;;\r
- *64-bit*)\r
- case $host in\r
- x86_64-*linux*)\r
- LD="${LD-ld} -m elf_x86_64"\r
- ;;\r
- ppc*-*linux*|powerpc*-*linux*)\r
- LD="${LD-ld} -m elf64ppc"\r
- ;;\r
- s390*-*linux*)\r
- LD="${LD-ld} -m elf64_s390"\r
- ;;\r
- sparc*-*linux*)\r
- LD="${LD-ld} -m elf64_sparc"\r
- ;;\r
- esac\r
- ;;\r
- esac\r
- fi\r
- rm -rf conftest*\r
- ;;\r
-\r
-*-*-sco3.2v5*)\r
- # On SCO OpenServer 5, we need -belf to get full-featured binaries.\r
- SAVE_CFLAGS="$CFLAGS"\r
- CFLAGS="$CFLAGS -belf"\r
- AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf,\r
- [AC_LANG_PUSH(C)\r
- AC_TRY_LINK([],[],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no])\r
- AC_LANG_POP])\r
- if test x"$lt_cv_cc_needs_belf" != x"yes"; then\r
- # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf\r
- CFLAGS="$SAVE_CFLAGS"\r
- fi\r
- ;;\r
-AC_PROVIDE_IFELSE([AC_LIBTOOL_WIN32_DLL],\r
-[*-*-cygwin* | *-*-mingw* | *-*-pw32*)\r
- AC_CHECK_TOOL(DLLTOOL, dlltool, false)\r
- AC_CHECK_TOOL(AS, as, false)\r
- AC_CHECK_TOOL(OBJDUMP, objdump, false)\r
- ;;\r
- ])\r
-esac\r
-\r
-need_locks="$enable_libtool_lock"\r
-\r
-])# _LT_AC_LOCK\r
-\r
-\r
-# AC_LIBTOOL_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,\r
-# [OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE])\r
-# ----------------------------------------------------------------\r
-# Check whether the given compiler option works\r
-AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION],\r
-[AC_REQUIRE([LT_AC_PROG_SED])\r
-AC_CACHE_CHECK([$1], [$2],\r
- [$2=no\r
- ifelse([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4])\r
- printf "$lt_simple_compile_test_code" > conftest.$ac_ext\r
- lt_compiler_flag="$3"\r
- # Insert the option either (1) after the last *FLAGS variable, or\r
- # (2) before a word containing "conftest.", or (3) at the end.\r
- # Note that $ac_compile itself does not contain backslashes and begins\r
- # with a dollar sign (not a hyphen), so the echo should work correctly.\r
- # The option is referenced via a variable to avoid confusing sed.\r
- lt_compile=`echo "$ac_compile" | $SED \\r
- -e 's:.*FLAGS}? :&$lt_compiler_flag :; t' \\r
- -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \\r
- -e 's:$: $lt_compiler_flag:'`\r
- (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD)\r
- (eval "$lt_compile" 2>conftest.err)\r
- ac_status=$?\r
- cat conftest.err >&AS_MESSAGE_LOG_FD\r
- echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD\r
- if (exit $ac_status) && test -s "$ac_outfile"; then\r
- # The compiler can only warn and ignore the option if not recognized\r
- # So say no if there are warnings\r
- if test ! -s conftest.err; then\r
- $2=yes\r
- fi\r
- fi\r
- $rm conftest*\r
-])\r
-\r
-if test x"[$]$2" = xyes; then\r
- ifelse([$5], , :, [$5])\r
-else\r
- ifelse([$6], , :, [$6])\r
-fi\r
-])# AC_LIBTOOL_COMPILER_OPTION\r
-\r
-\r
-# AC_LIBTOOL_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,\r
-# [ACTION-SUCCESS], [ACTION-FAILURE])\r
-# ------------------------------------------------------------\r
-# Check whether the given compiler option works\r
-AC_DEFUN([AC_LIBTOOL_LINKER_OPTION],\r
-[AC_CACHE_CHECK([$1], [$2],\r
- [$2=no\r
- save_LDFLAGS="$LDFLAGS"\r
- LDFLAGS="$LDFLAGS $3"\r
- printf "$lt_simple_link_test_code" > conftest.$ac_ext\r
- if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then\r
- # The compiler can only warn and ignore the option if not recognized\r
- # So say no if there are warnings\r
- if test -s conftest.err; then\r
- # Append any errors to the config.log.\r
- cat conftest.err 1>&AS_MESSAGE_LOG_FD\r
- else\r
- $2=yes\r
- fi\r
- fi\r
- $rm conftest*\r
- LDFLAGS="$save_LDFLAGS"\r
-])\r
-\r
-if test x"[$]$2" = xyes; then\r
- ifelse([$4], , :, [$4])\r
-else\r
- ifelse([$5], , :, [$5])\r
-fi\r
-])# AC_LIBTOOL_LINKER_OPTION\r
-\r
-\r
-# AC_LIBTOOL_SYS_MAX_CMD_LEN\r
-# --------------------------\r
-AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN],\r
-[# find the maximum length of command line arguments\r
-AC_MSG_CHECKING([the maximum length of command line arguments])\r
-AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl\r
- i=0\r
- teststring="ABCD"\r
-\r
- case $build_os in\r
- msdosdjgpp*)\r
- # On DJGPP, this test can blow up pretty badly due to problems in libc\r
- # (any single argument exceeding 2000 bytes causes a buffer overrun\r
- # during glob expansion). Even if it were fixed, the result of this\r
- # check would be larger than it should be.\r
- lt_cv_sys_max_cmd_len=12288; # 12K is about right\r
- ;;\r
-\r
- gnu*)\r
- # Under GNU Hurd, this test is not required because there is\r
- # no limit to the length of command line arguments.\r
- # Libtool will interpret -1 as no limit whatsoever\r
- lt_cv_sys_max_cmd_len=-1;\r
- ;;\r
-\r
- cygwin* | mingw*)\r
- # On Win9x/ME, this test blows up -- it succeeds, but takes\r
- # about 5 minutes as the teststring grows exponentially.\r
- # Worse, since 9x/ME are not pre-emptively multitasking,\r
- # you end up with a "frozen" computer, even though with patience\r
- # the test eventually succeeds (with a max line length of 256k).\r
- # Instead, let's just punt: use the minimum linelength reported by\r
- # all of the supported platforms: 8192 (on NT/2K/XP).\r
- lt_cv_sys_max_cmd_len=8192;\r
- ;;\r
-\r
- amigaos*)\r
- # On AmigaOS with pdksh, this test takes hours, literally.\r
- # So we just punt and use a minimum line length of 8192.\r
- lt_cv_sys_max_cmd_len=8192;\r
- ;;\r
-\r
- *)\r
- # If test is not a shell built-in, we'll probably end up computing a\r
- # maximum length that is only half of the actual maximum length, but\r
- # we can't tell.\r
- while (test "X"`$CONFIG_SHELL [$]0 --fallback-echo "X$teststring" 2>/dev/null` \\r
- = "XX$teststring") >/dev/null 2>&1 &&\r
- new_result=`expr "X$teststring" : ".*" 2>&1` &&\r
- lt_cv_sys_max_cmd_len=$new_result &&\r
- test $i != 17 # 1/2 MB should be enough\r
- do\r
- i=`expr $i + 1`\r
- teststring=$teststring$teststring\r
- done\r
- teststring=\r
- # Add a significant safety factor because C++ compilers can tack on massive\r
- # amounts of additional arguments before passing them to the linker.\r
- # It appears as though 1/2 is a usable value.\r
- lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2`\r
- ;;\r
- esac\r
-])\r
-if test -n $lt_cv_sys_max_cmd_len ; then\r
- AC_MSG_RESULT($lt_cv_sys_max_cmd_len)\r
-else\r
- AC_MSG_RESULT(none)\r
-fi\r
-])# AC_LIBTOOL_SYS_MAX_CMD_LEN\r
-\r
-\r
-# _LT_AC_CHECK_DLFCN\r
-# --------------------\r
-AC_DEFUN([_LT_AC_CHECK_DLFCN],\r
-[AC_CHECK_HEADERS(dlfcn.h)dnl\r
-])# _LT_AC_CHECK_DLFCN\r
-\r
-\r
-# _LT_AC_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE,\r
-# ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING)\r
-# ------------------------------------------------------------------\r
-AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF],\r
-[AC_REQUIRE([_LT_AC_CHECK_DLFCN])dnl\r
-if test "$cross_compiling" = yes; then :\r
- [$4]\r
-else\r
- lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2\r
- lt_status=$lt_dlunknown\r
- cat > conftest.$ac_ext <<EOF\r
-[#line __oline__ "configure"\r
-#include "confdefs.h"\r
-\r
-#if HAVE_DLFCN_H\r
-#include <dlfcn.h>\r
-#endif\r
-\r
-#include <stdio.h>\r
-\r
-#ifdef RTLD_GLOBAL\r
-# define LT_DLGLOBAL RTLD_GLOBAL\r
-#else\r
-# ifdef DL_GLOBAL\r
-# define LT_DLGLOBAL DL_GLOBAL\r
-# else\r
-# define LT_DLGLOBAL 0\r
-# endif\r
-#endif\r
-\r
-/* We may have to define LT_DLLAZY_OR_NOW in the command line if we\r
- find out it does not work in some platform. */\r
-#ifndef LT_DLLAZY_OR_NOW\r
-# ifdef RTLD_LAZY\r
-# define LT_DLLAZY_OR_NOW RTLD_LAZY\r
-# else\r
-# ifdef DL_LAZY\r
-# define LT_DLLAZY_OR_NOW DL_LAZY\r
-# else\r
-# ifdef RTLD_NOW\r
-# define LT_DLLAZY_OR_NOW RTLD_NOW\r
-# else\r
-# ifdef DL_NOW\r
-# define LT_DLLAZY_OR_NOW DL_NOW\r
-# else\r
-# define LT_DLLAZY_OR_NOW 0\r
-# endif\r
-# endif\r
-# endif\r
-# endif\r
-#endif\r
-\r
-#ifdef __cplusplus\r
-extern "C" void exit (int);\r
-#endif\r
-\r
-void fnord() { int i=42;}\r
-int main ()\r
-{\r
- void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);\r
- int status = $lt_dlunknown;\r
-\r
- if (self)\r
- {\r
- if (dlsym (self,"fnord")) status = $lt_dlno_uscore;\r
- else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore;\r
- /* dlclose (self); */\r
- }\r
-\r
- exit (status);\r
-}]\r
-EOF\r
- if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then\r
- (./conftest; exit; ) 2>/dev/null\r
- lt_status=$?\r
- case x$lt_status in\r
- x$lt_dlno_uscore) $1 ;;\r
- x$lt_dlneed_uscore) $2 ;;\r
- x$lt_unknown|x*) $3 ;;\r
- esac\r
- else :\r
- # compilation failed\r
- $3\r
- fi\r
-fi\r
-rm -fr conftest*\r
-])# _LT_AC_TRY_DLOPEN_SELF\r
-\r
-\r
-# AC_LIBTOOL_DLOPEN_SELF\r
-# -------------------\r
-AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF],\r
-[AC_REQUIRE([_LT_AC_CHECK_DLFCN])dnl\r
-if test "x$enable_dlopen" != xyes; then\r
- enable_dlopen=unknown\r
- enable_dlopen_self=unknown\r
- enable_dlopen_self_static=unknown\r
-else\r
- lt_cv_dlopen=no\r
- lt_cv_dlopen_libs=\r
-\r
- case $host_os in\r
- beos*)\r
- lt_cv_dlopen="load_add_on"\r
- lt_cv_dlopen_libs=\r
- lt_cv_dlopen_self=yes\r
- ;;\r
-\r
- mingw* | pw32*)\r
- lt_cv_dlopen="LoadLibrary"\r
- lt_cv_dlopen_libs=\r
- ;;\r
-\r
- cygwin*)\r
- lt_cv_dlopen="dlopen"\r
- lt_cv_dlopen_libs=\r
- ;;\r
-\r
- darwin*)\r
- # if libdl is installed we need to link against it\r
- AC_CHECK_LIB([dl], [dlopen],\r
- [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],[\r
- lt_cv_dlopen="dyld"\r
- lt_cv_dlopen_libs=\r
- lt_cv_dlopen_self=yes\r
- ])\r
- ;;\r
-\r
- *)\r
- AC_CHECK_FUNC([shl_load],\r
- [lt_cv_dlopen="shl_load"],\r
- [AC_CHECK_LIB([dld], [shl_load],\r
- [lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-dld"],\r
- [AC_CHECK_FUNC([dlopen],\r
- [lt_cv_dlopen="dlopen"],\r
- [AC_CHECK_LIB([dl], [dlopen],\r
- [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],\r
- [AC_CHECK_LIB([svld], [dlopen],\r
- [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld"],\r
- [AC_CHECK_LIB([dld], [dld_link],\r
- [lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-dld"])\r
- ])\r
- ])\r
- ])\r
- ])\r
- ])\r
- ;;\r
- esac\r
-\r
- if test "x$lt_cv_dlopen" != xno; then\r
- enable_dlopen=yes\r
- else\r
- enable_dlopen=no\r
- fi\r
-\r
- case $lt_cv_dlopen in\r
- dlopen)\r
- save_CPPFLAGS="$CPPFLAGS"\r
- test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H"\r
-\r
- save_LDFLAGS="$LDFLAGS"\r
- eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\"\r
-\r
- save_LIBS="$LIBS"\r
- LIBS="$lt_cv_dlopen_libs $LIBS"\r
-\r
- AC_CACHE_CHECK([whether a program can dlopen itself],\r
- lt_cv_dlopen_self, [dnl\r
- _LT_AC_TRY_DLOPEN_SELF(\r
- lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes,\r
- lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross)\r
- ])\r
-\r
- if test "x$lt_cv_dlopen_self" = xyes; then\r
- LDFLAGS="$LDFLAGS $link_static_flag"\r
- AC_CACHE_CHECK([whether a statically linked program can dlopen itself],\r
- lt_cv_dlopen_self_static, [dnl\r
- _LT_AC_TRY_DLOPEN_SELF(\r
- lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes,\r
- lt_cv_dlopen_self_static=no, lt_cv_dlopen_self_static=cross)\r
- ])\r
- fi\r
-\r
- CPPFLAGS="$save_CPPFLAGS"\r
- LDFLAGS="$save_LDFLAGS"\r
- LIBS="$save_LIBS"\r
- ;;\r
- esac\r
-\r
- case $lt_cv_dlopen_self in\r
- yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;;\r
- *) enable_dlopen_self=unknown ;;\r
- esac\r
-\r
- case $lt_cv_dlopen_self_static in\r
- yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;;\r
- *) enable_dlopen_self_static=unknown ;;\r
- esac\r
-fi\r
-])# AC_LIBTOOL_DLOPEN_SELF\r
-\r
-\r
-# AC_LIBTOOL_PROG_CC_C_O([TAGNAME])\r
-# ---------------------------------\r
-# Check to see if options -c and -o are simultaneously supported by compiler\r
-AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O],\r
-[AC_REQUIRE([_LT_AC_SYS_COMPILER])dnl\r
-AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext],\r
- [_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)],\r
- [_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no\r
- $rm -r conftest 2>/dev/null\r
- mkdir conftest\r
- cd conftest\r
- mkdir out\r
- printf "$lt_simple_compile_test_code" > conftest.$ac_ext\r
-\r
- lt_compiler_flag="-o out/conftest2.$ac_objext"\r
- # Insert the option either (1) after the last *FLAGS variable, or\r
- # (2) before a word containing "conftest.", or (3) at the end.\r
- # Note that $ac_compile itself does not contain backslashes and begins\r
- # with a dollar sign (not a hyphen), so the echo should work correctly.\r
- lt_compile=`echo "$ac_compile" | $SED \\r
- -e 's:.*FLAGS}? :&$lt_compiler_flag :; t' \\r
- -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \\r
- -e 's:$: $lt_compiler_flag:'`\r
- (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD)\r
- (eval "$lt_compile" 2>out/conftest.err)\r
- ac_status=$?\r
- cat out/conftest.err >&AS_MESSAGE_LOG_FD\r
- echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD\r
- if (exit $ac_status) && test -s out/conftest2.$ac_objext\r
- then\r
- # The compiler can only warn and ignore the option if not recognized\r
- # So say no if there are warnings\r
- if test ! -s out/conftest.err; then\r
- _LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes\r
- fi\r
- fi\r
- chmod u+w .\r
- $rm conftest*\r
- # SGI C++ compiler will create directory out/ii_files/ for\r
- # template instantiation\r
- test -d out/ii_files && $rm out/ii_files/* && rmdir out/ii_files\r
- $rm out/* && rmdir out\r
- cd ..\r
- rmdir conftest\r
- $rm conftest*\r
-])\r
-])# AC_LIBTOOL_PROG_CC_C_O\r
-\r
-\r
-# AC_LIBTOOL_SYS_HARD_LINK_LOCKS([TAGNAME])\r
-# -----------------------------------------\r
-# Check to see if we can do hard links to lock some files if needed\r
-AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS],\r
-[AC_REQUIRE([_LT_AC_LOCK])dnl\r
-\r
-hard_links="nottested"\r
-if test "$_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; then\r
- # do not overwrite the value of need_locks provided by the user\r
- AC_MSG_CHECKING([if we can lock with hard links])\r
- hard_links=yes\r
- $rm conftest*\r
- ln conftest.a conftest.b 2>/dev/null && hard_links=no\r
- touch conftest.a\r
- ln conftest.a conftest.b 2>&5 || hard_links=no\r
- ln conftest.a conftest.b 2>/dev/null && hard_links=no\r
- AC_MSG_RESULT([$hard_links])\r
- if test "$hard_links" = no; then\r
- AC_MSG_WARN([`$CC' does not support `-c -o', so `make -j' may be unsafe])\r
- need_locks=warn\r
- fi\r
-else\r
- need_locks=no\r
-fi\r
-])# AC_LIBTOOL_SYS_HARD_LINK_LOCKS\r
-\r
-\r
-# AC_LIBTOOL_OBJDIR\r
-# -----------------\r
-AC_DEFUN([AC_LIBTOOL_OBJDIR],\r
-[AC_CACHE_CHECK([for objdir], [lt_cv_objdir],\r
-[rm -f .libs 2>/dev/null\r
-mkdir .libs 2>/dev/null\r
-if test -d .libs; then\r
- lt_cv_objdir=.libs\r
-else\r
- # MS-DOS does not allow filenames that begin with a dot.\r
- lt_cv_objdir=_libs\r
-fi\r
-rmdir .libs 2>/dev/null])\r
-objdir=$lt_cv_objdir\r
-])# AC_LIBTOOL_OBJDIR\r
-\r
-\r
-# AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH([TAGNAME])\r
-# ----------------------------------------------\r
-# Check hardcoding attributes.\r
-AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH],\r
-[AC_MSG_CHECKING([how to hardcode library paths into programs])\r
-_LT_AC_TAGVAR(hardcode_action, $1)=\r
-if test -n "$_LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)" || \\r
- test -n "$_LT_AC_TAGVAR(runpath_var $1)" || \\r
- test "X$_LT_AC_TAGVAR(hardcode_automatic, $1)"="Xyes" ; then\r
-\r
- # We can hardcode non-existant directories.\r
- if test "$_LT_AC_TAGVAR(hardcode_direct, $1)" != no &&\r
- # If the only mechanism to avoid hardcoding is shlibpath_var, we\r
- # have to relink, otherwise we might link with an installed library\r
- # when we should be linking with a yet-to-be-installed one\r
- ## test "$_LT_AC_TAGVAR(hardcode_shlibpath_var, $1)" != no &&\r
- test "$_LT_AC_TAGVAR(hardcode_minus_L, $1)" != no; then\r
- # Linking always hardcodes the temporary library directory.\r
- _LT_AC_TAGVAR(hardcode_action, $1)=relink\r
- else\r
- # We can link without hardcoding, and we can hardcode nonexisting dirs.\r
- _LT_AC_TAGVAR(hardcode_action, $1)=immediate\r
- fi\r
-else\r
- # We cannot hardcode anything, or else we can only hardcode existing\r
- # directories.\r
- _LT_AC_TAGVAR(hardcode_action, $1)=unsupported\r
-fi\r
-AC_MSG_RESULT([$_LT_AC_TAGVAR(hardcode_action, $1)])\r
-\r
-if test "$_LT_AC_TAGVAR(hardcode_action, $1)" = relink; then\r
- # Fast installation is not supported\r
- enable_fast_install=no\r
-elif test "$shlibpath_overrides_runpath" = yes ||\r
- test "$enable_shared" = no; then\r
- # Fast installation is not necessary\r
- enable_fast_install=needless\r
-fi\r
-])# AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH\r
-\r
-\r
-# AC_LIBTOOL_SYS_LIB_STRIP\r
-# ------------------------\r
-AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP],\r
-[striplib=\r
-old_striplib=\r
-AC_MSG_CHECKING([whether stripping libraries is possible])\r
-if test -n "$STRIP" && $STRIP -V 2>&1 | grep "GNU strip" >/dev/null; then\r
- test -z "$old_striplib" && old_striplib="$STRIP --strip-debug"\r
- test -z "$striplib" && striplib="$STRIP --strip-unneeded"\r
- AC_MSG_RESULT([yes])\r
-else\r
-# FIXME - insert some real tests, host_os isn't really good enough\r
- case $host_os in\r
- darwin*)\r
- if test -n "$STRIP" ; then\r
- striplib="$STRIP -x"\r
- AC_MSG_RESULT([yes])\r
- else\r
- AC_MSG_RESULT([no])\r
-fi\r
- ;;\r
- *)\r
- AC_MSG_RESULT([no])\r
- ;;\r
- esac\r
-fi\r
-])# AC_LIBTOOL_SYS_LIB_STRIP\r
-\r
-\r
-# AC_LIBTOOL_SYS_DYNAMIC_LINKER\r
-# -----------------------------\r
-# PORTME Fill in your ld.so characteristics\r
-AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER],\r
-[AC_MSG_CHECKING([dynamic linker characteristics])\r
-library_names_spec=\r
-libname_spec='lib$name'\r
-soname_spec=\r
-shrext_cmds=".so"\r
-postinstall_cmds=\r
-postuninstall_cmds=\r
-finish_cmds=\r
-finish_eval=\r
-shlibpath_var=\r
-shlibpath_overrides_runpath=unknown\r
-version_type=none\r
-dynamic_linker="$host_os ld.so"\r
-sys_lib_dlsearch_path_spec="/lib /usr/lib"\r
-if test "$GCC" = yes; then\r
- sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"`\r
- if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then\r
- # if the path contains ";" then we assume it to be the separator\r
- # otherwise default to the standard path separator (i.e. ":") - it is\r
- # assumed that no part of a normal pathname contains ";" but that should\r
- # okay in the real world where ";" in dirpaths is itself problematic.\r
- sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'`\r
- else\r
- sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`\r
- fi\r
-else\r
- sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib"\r
-fi\r
-need_lib_prefix=unknown\r
-hardcode_into_libs=no\r
-\r
-# when you set need_version to no, make sure it does not cause -set_version\r
-# flags to be left without arguments\r
-need_version=unknown\r
-\r
-case $host_os in\r
-aix3*)\r
- version_type=linux\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a'\r
- shlibpath_var=LIBPATH\r
-\r
- # AIX 3 has no versioning support, so we append a major version to the name.\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- ;;\r
-\r
-aix4* | aix5*)\r
- version_type=linux\r
- need_lib_prefix=no\r
- need_version=no\r
- hardcode_into_libs=yes\r
- if test "$host_cpu" = ia64; then\r
- # AIX 5 supports IA64\r
- library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- else\r
- # With GCC up to 2.95.x, collect2 would create an import file\r
- # for dependence libraries. The import file would start with\r
- # the line `#! .'. This would cause the generated library to\r
- # depend on `.', always an invalid library. This was fixed in\r
- # development snapshots of GCC prior to 3.0.\r
- case $host_os in\r
- aix4 | aix4.[[01]] | aix4.[[01]].*)\r
- if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'\r
- echo ' yes '\r
- echo '#endif'; } | ${CC} -E - | grep yes > /dev/null; then\r
- :\r
- else\r
- can_build_shared=no\r
- fi\r
- ;;\r
- esac\r
- # AIX (on Power*) has no versioning support, so currently we can not hardcode correct\r
- # soname into executable. Probably we can add versioning support to\r
- # collect2, so additional links can be useful in future.\r
- if test "$aix_use_runtimelinking" = yes; then\r
- # If using run time linking (on AIX 4.2 or later) use lib<name>.so\r
- # instead of lib<name>.a to let people know that these are not\r
- # typical AIX shared libraries.\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- else\r
- # We preserve .a as extension for shared libraries through AIX4.2\r
- # and later when we are not doing run time linking.\r
- library_names_spec='${libname}${release}.a $libname.a'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- fi\r
- shlibpath_var=LIBPATH\r
- fi\r
- ;;\r
-\r
-amigaos*)\r
- library_names_spec='$libname.ixlibrary $libname.a'\r
- # Create ${libname}_ixlibrary.a entries in /sys/libs.\r
- finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$echo "X$lib" | $Xsed -e '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; test $rm /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'\r
- ;;\r
-\r
-beos*)\r
- library_names_spec='${libname}${shared_ext}'\r
- dynamic_linker="$host_os ld.so"\r
- shlibpath_var=LIBRARY_PATH\r
- ;;\r
-\r
-bsdi4*)\r
- version_type=linux\r
- need_version=no\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib"\r
- sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib"\r
- # the default ld.so.conf also contains /usr/contrib/lib and\r
- # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow\r
- # libtool to hard-code these into programs\r
- ;;\r
-\r
-cygwin* | mingw* | pw32*)\r
- version_type=windows\r
- shrext_cmds=".dll"\r
- need_version=no\r
- need_lib_prefix=no\r
-\r
- case $GCC,$host_os in\r
- yes,cygwin* | yes,mingw* | yes,pw32*)\r
- library_names_spec='$libname.dll.a'\r
- # DLL is installed to $(libdir)/../bin by postinstall_cmds\r
- postinstall_cmds='base_file=`basename \${file}`~\r
- dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i;echo \$dlname'\''`~\r
- dldir=$destdir/`dirname \$dlpath`~\r
- test -d \$dldir || mkdir -p \$dldir~\r
- $install_prog $dir/$dlname \$dldir/$dlname'\r
- postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~\r
- dlpath=$dir/\$dldll~\r
- $rm \$dlpath'\r
- shlibpath_overrides_runpath=yes\r
-\r
- case $host_os in\r
- cygwin*)\r
- # Cygwin DLLs use 'cyg' prefix rather than 'lib'\r
- soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'\r
- sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib"\r
- ;;\r
- mingw*)\r
- # MinGW DLLs use traditional 'lib' prefix\r
- soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'\r
- sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"`\r
- if echo "$sys_lib_search_path_spec" | [grep ';[c-zC-Z]:/' >/dev/null]; then\r
- # It is most probably a Windows format PATH printed by\r
- # mingw gcc, but we are running on Cygwin. Gcc prints its search\r
- # path with ; separators, and with drive letters. We can handle the\r
- # drive letters (cygwin fileutils understands them), so leave them,\r
- # especially as we might pass files found there to a mingw objdump,\r
- # which wouldn't understand a cygwinified path. Ahh.\r
- sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'`\r
- else\r
- sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`\r
- fi\r
- ;;\r
- pw32*)\r
- # pw32 DLLs use 'pw' prefix rather than 'lib'\r
- library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'\r
- ;;\r
- esac\r
- ;;\r
-\r
- *)\r
- library_names_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext} $libname.lib'\r
- ;;\r
- esac\r
- dynamic_linker='Win32 ld.exe'\r
- # FIXME: first we should search . and the directory the executable is in\r
- shlibpath_var=PATH\r
- ;;\r
-\r
-darwin* | rhapsody*)\r
- dynamic_linker="$host_os dyld"\r
- version_type=darwin\r
- need_lib_prefix=no\r
- need_version=no\r
- library_names_spec='${libname}${release}${versuffix}$shared_ext ${libname}${release}${major}$shared_ext ${libname}$shared_ext'\r
- soname_spec='${libname}${release}${major}$shared_ext'\r
- shlibpath_overrides_runpath=yes\r
- shlibpath_var=DYLD_LIBRARY_PATH\r
- shrext_cmds='$(test .$module = .yes && echo .so || echo .dylib)'\r
- # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same.\r
- if test "$GCC" = yes; then\r
- sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"`\r
- else\r
- sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib'\r
- fi\r
- sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'\r
- ;;\r
-\r
-dgux*)\r
- version_type=linux\r
- need_lib_prefix=no\r
- need_version=no\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- ;;\r
-\r
-freebsd1*)\r
- dynamic_linker=no\r
- ;;\r
-\r
-kfreebsd*-gnu)\r
- version_type=linux\r
- need_lib_prefix=no\r
- need_version=no\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- shlibpath_overrides_runpath=no\r
- hardcode_into_libs=yes\r
- dynamic_linker='GNU ld.so'\r
- ;;\r
-\r
-freebsd*)\r
- objformat=`test -x /usr/bin/objformat && /usr/bin/objformat || echo aout`\r
- version_type=freebsd-$objformat\r
- case $version_type in\r
- freebsd-elf*)\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'\r
- need_version=no\r
- need_lib_prefix=no\r
- ;;\r
- freebsd-*)\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix'\r
- need_version=yes\r
- ;;\r
- esac\r
- shlibpath_var=LD_LIBRARY_PATH\r
- case $host_os in\r
- freebsd2*)\r
- shlibpath_overrides_runpath=yes\r
- ;;\r
- freebsd3.[01]* | freebsdelf3.[01]*)\r
- shlibpath_overrides_runpath=yes\r
- hardcode_into_libs=yes\r
- ;;\r
- *) # from 3.2 on\r
- shlibpath_overrides_runpath=no\r
- hardcode_into_libs=yes\r
- ;;\r
- esac\r
- ;;\r
-\r
-gnu*)\r
- version_type=linux\r
- need_lib_prefix=no\r
- need_version=no\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- hardcode_into_libs=yes\r
- ;;\r
-\r
-hpux9* | hpux10* | hpux11*)\r
- # Give a soname corresponding to the major version so that dld.sl refuses to\r
- # link against other versions.\r
- version_type=sunos\r
- need_lib_prefix=no\r
- need_version=no\r
- case "$host_cpu" in\r
- ia64*)\r
- shrext_cmds='.so'\r
- hardcode_into_libs=yes\r
- dynamic_linker="$host_os dld.so"\r
- shlibpath_var=LD_LIBRARY_PATH\r
- shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- if test "X$HPUX_IA64_MODE" = X32; then\r
- sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib"\r
- else\r
- sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64"\r
- fi\r
- sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\r
- ;;\r
- hppa*64*)\r
- shrext_cmds='.sl'\r
- hardcode_into_libs=yes\r
- dynamic_linker="$host_os dld.sl"\r
- shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH\r
- shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64"\r
- sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec\r
- ;;\r
- *)\r
- shrext_cmds='.sl'\r
- dynamic_linker="$host_os dld.sl"\r
- shlibpath_var=SHLIB_PATH\r
- shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- ;;\r
- esac\r
- # HP-UX runs *really* slowly unless shared libraries are mode 555.\r
- postinstall_cmds='chmod 555 $lib'\r
- ;;\r
-\r
-irix5* | irix6* | nonstopux*)\r
- case $host_os in\r
- nonstopux*) version_type=nonstopux ;;\r
- *)\r
- if test "$lt_cv_prog_gnu_ld" = yes; then\r
- version_type=linux\r
- else\r
- version_type=irix\r
- fi ;;\r
- esac\r
- need_lib_prefix=no\r
- need_version=no\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}'\r
- case $host_os in\r
- irix5* | nonstopux*)\r
- libsuff= shlibsuff=\r
- ;;\r
- *)\r
- case $LD in # libtool.m4 will add one of these switches to LD\r
- *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ")\r
- libsuff= shlibsuff= libmagic=32-bit;;\r
- *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ")\r
- libsuff=32 shlibsuff=N32 libmagic=N32;;\r
- *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ")\r
- libsuff=64 shlibsuff=64 libmagic=64-bit;;\r
- *) libsuff= shlibsuff= libmagic=never-match;;\r
- esac\r
- ;;\r
- esac\r
- shlibpath_var=LD_LIBRARY${shlibsuff}_PATH\r
- shlibpath_overrides_runpath=no\r
- sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}"\r
- sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}"\r
- hardcode_into_libs=yes\r
- ;;\r
-\r
-# No shared lib support for Linux oldld, aout, or coff.\r
-linux*oldld* | linux*aout* | linux*coff*)\r
- dynamic_linker=no\r
- ;;\r
-\r
-# This must be Linux ELF.\r
-linux*)\r
- version_type=linux\r
- need_lib_prefix=no\r
- need_version=no\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- shlibpath_overrides_runpath=no\r
- # This implies no fast_install, which is unacceptable.\r
- # Some rework will be needed to allow for fast_install\r
- # before this can be enabled.\r
- hardcode_into_libs=yes\r
-\r
- # find out which ABI we are using\r
- libsuff=\r
- case "$host_cpu" in\r
- x86_64*|s390x*|powerpc64*)\r
- echo '[#]line __oline__ "configure"' > conftest.$ac_ext\r
- if AC_TRY_EVAL(ac_compile); then\r
- case `/usr/bin/file conftest.$ac_objext` in\r
- *64-bit*)\r
- libsuff=64\r
- sys_lib_search_path_spec="/lib${libsuff} /usr/lib${libsuff} /usr/local/lib${libsuff}"\r
- ;;\r
- esac\r
- fi\r
- rm -rf conftest*\r
- ;;\r
- esac\r
-\r
- # Append ld.so.conf contents to the search path\r
- if test -f /etc/ld.so.conf; then\r
- lt_ld_extra=`$SED -e 's/[:,\t]/ /g;s/=[^=]*$//;s/=[^= ]* / /g' /etc/ld.so.conf | tr '\n' ' '`\r
- sys_lib_dlsearch_path_spec="/lib${libsuff} /usr/lib${libsuff} $lt_ld_extra"\r
- fi\r
-\r
- # We used to test for /lib/ld.so.1 and disable shared libraries on\r
- # powerpc, because MkLinux only supported shared libraries with the\r
- # GNU dynamic linker. Since this was broken with cross compilers,\r
- # most powerpc-linux boxes support dynamic linking these days and\r
- # people can always --disable-shared, the test was removed, and we\r
- # assume the GNU/Linux dynamic linker is in use.\r
- dynamic_linker='GNU/Linux ld.so'\r
- ;;\r
-\r
-knetbsd*-gnu)\r
- version_type=linux\r
- need_lib_prefix=no\r
- need_version=no\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- shlibpath_overrides_runpath=no\r
- hardcode_into_libs=yes\r
- dynamic_linker='GNU ld.so'\r
- ;;\r
-\r
-netbsd*)\r
- version_type=sunos\r
- need_lib_prefix=no\r
- need_version=no\r
- if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\r
- finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'\r
- dynamic_linker='NetBSD (a.out) ld.so'\r
- else\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- dynamic_linker='NetBSD ld.elf_so'\r
- fi\r
- shlibpath_var=LD_LIBRARY_PATH\r
- shlibpath_overrides_runpath=yes\r
- hardcode_into_libs=yes\r
- ;;\r
-\r
-newsos6)\r
- version_type=linux\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- shlibpath_overrides_runpath=yes\r
- ;;\r
-\r
-nto-qnx*)\r
- version_type=linux\r
- need_lib_prefix=no\r
- need_version=no\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- shlibpath_overrides_runpath=yes\r
- ;;\r
-\r
-openbsd*)\r
- version_type=sunos\r
- need_lib_prefix=no\r
- need_version=yes\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\r
- finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then\r
- case $host_os in\r
- openbsd2.[[89]] | openbsd2.[[89]].*)\r
- shlibpath_overrides_runpath=no\r
- ;;\r
- *)\r
- shlibpath_overrides_runpath=yes\r
- ;;\r
- esac\r
- else\r
- shlibpath_overrides_runpath=yes\r
- fi\r
- ;;\r
-\r
-os2*)\r
- libname_spec='$name'\r
- shrext_cmds=".dll"\r
- need_lib_prefix=no\r
- library_names_spec='$libname${shared_ext} $libname.a'\r
- dynamic_linker='OS/2 ld.exe'\r
- shlibpath_var=LIBPATH\r
- ;;\r
-\r
-osf3* | osf4* | osf5*)\r
- version_type=osf\r
- need_lib_prefix=no\r
- need_version=no\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib"\r
- sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec"\r
- ;;\r
-\r
-sco3.2v5*)\r
- version_type=osf\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- ;;\r
-\r
-solaris*)\r
- version_type=linux\r
- need_lib_prefix=no\r
- need_version=no\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- shlibpath_overrides_runpath=yes\r
- hardcode_into_libs=yes\r
- # ldd complains unless libraries are executable\r
- postinstall_cmds='chmod +x $lib'\r
- ;;\r
-\r
-sunos4*)\r
- version_type=sunos\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'\r
- finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- shlibpath_overrides_runpath=yes\r
- if test "$with_gnu_ld" = yes; then\r
- need_lib_prefix=no\r
- fi\r
- need_version=yes\r
- ;;\r
-\r
-sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)\r
- version_type=linux\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- case $host_vendor in\r
- sni)\r
- shlibpath_overrides_runpath=no\r
- need_lib_prefix=no\r
- export_dynamic_flag_spec='${wl}-Blargedynsym'\r
- runpath_var=LD_RUN_PATH\r
- ;;\r
- siemens)\r
- need_lib_prefix=no\r
- ;;\r
- motorola)\r
- need_lib_prefix=no\r
- need_version=no\r
- shlibpath_overrides_runpath=no\r
- sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'\r
- ;;\r
- esac\r
- ;;\r
-\r
-sysv4*MP*)\r
- if test -d /usr/nec ;then\r
- version_type=linux\r
- library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}'\r
- soname_spec='$libname${shared_ext}.$major'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- fi\r
- ;;\r
-\r
-uts4*)\r
- version_type=linux\r
- library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'\r
- soname_spec='${libname}${release}${shared_ext}$major'\r
- shlibpath_var=LD_LIBRARY_PATH\r
- ;;\r
-\r
-*)\r
- dynamic_linker=no\r
- ;;\r
-esac\r
-AC_MSG_RESULT([$dynamic_linker])\r
-test "$dynamic_linker" = no && can_build_shared=no\r
-])# AC_LIBTOOL_SYS_DYNAMIC_LINKER\r
-\r
-\r
-# _LT_AC_TAGCONFIG\r
-# ----------------\r
-AC_DEFUN([_LT_AC_TAGCONFIG],\r
-[AC_ARG_WITH([tags],\r
- [AC_HELP_STRING([--with-tags@<:@=TAGS@:>@],\r
- [include additional configurations @<:@automatic@:>@])],\r
- [tagnames="$withval"])\r
-\r
-if test -f "$ltmain" && test -n "$tagnames"; then\r
- if test ! -f "${ofile}"; then\r
- AC_MSG_WARN([output file `$ofile' does not exist])\r
- fi\r
-\r
- if test -z "$LTCC"; then\r
- eval "`$SHELL ${ofile} --config | grep '^LTCC='`"\r
- if test -z "$LTCC"; then\r
- AC_MSG_WARN([output file `$ofile' does not look like a libtool script])\r
- else\r
- AC_MSG_WARN([using `LTCC=$LTCC', extracted from `$ofile'])\r
- fi\r
- fi\r
-\r
- # Extract list of available tagged configurations in $ofile.\r
- # Note that this assumes the entire list is on one line.\r
- available_tags=`grep "^available_tags=" "${ofile}" | $SED -e 's/available_tags=\(.*$\)/\1/' -e 's/\"//g'`\r
-\r
- lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"\r
- for tagname in $tagnames; do\r
- IFS="$lt_save_ifs"\r
- # Check whether tagname contains only valid characters\r
- case `$echo "X$tagname" | $Xsed -e 's:[[-_ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890,/]]::g'` in\r
- "") ;;\r
- *) AC_MSG_ERROR([invalid tag name: $tagname])\r
- ;;\r
- esac\r
-\r
- if grep "^# ### BEGIN LIBTOOL TAG CONFIG: $tagname$" < "${ofile}" > /dev/null\r
- then\r
- AC_MSG_ERROR([tag name \"$tagname\" already exists])\r
- fi\r
-\r
- # Update the list of available tags.\r
- if test -n "$tagname"; then\r
- echo appending configuration tag \"$tagname\" to $ofile\r
-\r
- case $tagname in\r
- CXX)\r
- if test -n "$CXX" && test "X$CXX" != "Xno"; then\r
- AC_LIBTOOL_LANG_CXX_CONFIG\r
- else\r
- tagname=""\r
- fi\r
- ;;\r
-\r
- F77)\r
- if test -n "$F77" && test "X$F77" != "Xno"; then\r
- AC_LIBTOOL_LANG_F77_CONFIG\r
- else\r
- tagname=""\r
- fi\r
- ;;\r
-\r
- GCJ)\r
- if test -n "$GCJ" && test "X$GCJ" != "Xno"; then\r
- AC_LIBTOOL_LANG_GCJ_CONFIG\r
- else\r
- tagname=""\r
- fi\r
- ;;\r
-\r
- RC)\r
- AC_LIBTOOL_LANG_RC_CONFIG\r
- ;;\r
-\r
- *)\r
- AC_MSG_ERROR([Unsupported tag name: $tagname])\r
- ;;\r
- esac\r
-\r
- # Append the new tag name to the list of available tags.\r
- if test -n "$tagname" ; then\r
- available_tags="$available_tags $tagname"\r
- fi\r
- fi\r
- done\r
- IFS="$lt_save_ifs"\r
-\r
- # Now substitute the updated list of available tags.\r
- if eval "sed -e 's/^available_tags=.*\$/available_tags=\"$available_tags\"/' \"$ofile\" > \"${ofile}T\""; then\r
- mv "${ofile}T" "$ofile"\r
- chmod +x "$ofile"\r
- else\r
- rm -f "${ofile}T"\r
- AC_MSG_ERROR([unable to update list of available tagged configurations.])\r
- fi\r
-fi\r
-])# _LT_AC_TAGCONFIG\r
-\r
-\r
-# AC_LIBTOOL_DLOPEN\r
-# -----------------\r
-# enable checks for dlopen support\r
-AC_DEFUN([AC_LIBTOOL_DLOPEN],\r
- [AC_BEFORE([$0],[AC_LIBTOOL_SETUP])\r
-])# AC_LIBTOOL_DLOPEN\r
-\r
-\r
-# AC_LIBTOOL_WIN32_DLL\r
-# --------------------\r
-# declare package support for building win32 dll's\r
-AC_DEFUN([AC_LIBTOOL_WIN32_DLL],\r
-[AC_BEFORE([$0], [AC_LIBTOOL_SETUP])\r
-])# AC_LIBTOOL_WIN32_DLL\r
-\r
-\r
-# AC_ENABLE_SHARED([DEFAULT])\r
-# ---------------------------\r
-# implement the --enable-shared flag\r
-# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'.\r
-AC_DEFUN([AC_ENABLE_SHARED],\r
-[define([AC_ENABLE_SHARED_DEFAULT], ifelse($1, no, no, yes))dnl\r
-AC_ARG_ENABLE([shared],\r
- [AC_HELP_STRING([--enable-shared@<:@=PKGS@:>@],\r
- [build shared libraries @<:@default=]AC_ENABLE_SHARED_DEFAULT[@:>@])],\r
- [p=${PACKAGE-default}\r
- case $enableval in\r
- yes) enable_shared=yes ;;\r
- no) enable_shared=no ;;\r
- *)\r
- enable_shared=no\r
- # Look at the argument we got. We use all the common list separators.\r
- lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"\r
- for pkg in $enableval; do\r
- IFS="$lt_save_ifs"\r
- if test "X$pkg" = "X$p"; then\r
- enable_shared=yes\r
- fi\r
- done\r
- IFS="$lt_save_ifs"\r
- ;;\r
- esac],\r
- [enable_shared=]AC_ENABLE_SHARED_DEFAULT)\r
-])# AC_ENABLE_SHARED\r
-\r
-\r
-# AC_DISABLE_SHARED\r
-# -----------------\r
-#- set the default shared flag to --disable-shared\r
-AC_DEFUN([AC_DISABLE_SHARED],\r
-[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl\r
-AC_ENABLE_SHARED(no)\r
-])# AC_DISABLE_SHARED\r
-\r
-\r
-# AC_ENABLE_STATIC([DEFAULT])\r
-# ---------------------------\r
-# implement the --enable-static flag\r
-# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'.\r
-AC_DEFUN([AC_ENABLE_STATIC],\r
-[define([AC_ENABLE_STATIC_DEFAULT], ifelse($1, no, no, yes))dnl\r
-AC_ARG_ENABLE([static],\r
- [AC_HELP_STRING([--enable-static@<:@=PKGS@:>@],\r
- [build static libraries @<:@default=]AC_ENABLE_STATIC_DEFAULT[@:>@])],\r
- [p=${PACKAGE-default}\r
- case $enableval in\r
- yes) enable_static=yes ;;\r
- no) enable_static=no ;;\r
- *)\r
- enable_static=no\r
- # Look at the argument we got. We use all the common list separators.\r
- lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"\r
- for pkg in $enableval; do\r
- IFS="$lt_save_ifs"\r
- if test "X$pkg" = "X$p"; then\r
- enable_static=yes\r
- fi\r
- done\r
- IFS="$lt_save_ifs"\r
- ;;\r
- esac],\r
- [enable_static=]AC_ENABLE_STATIC_DEFAULT)\r
-])# AC_ENABLE_STATIC\r
-\r
-\r
-# AC_DISABLE_STATIC\r
-# -----------------\r
-# set the default static flag to --disable-static\r
-AC_DEFUN([AC_DISABLE_STATIC],\r
-[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl\r
-AC_ENABLE_STATIC(no)\r
-])# AC_DISABLE_STATIC\r
-\r
-\r
-# AC_ENABLE_FAST_INSTALL([DEFAULT])\r
-# ---------------------------------\r
-# implement the --enable-fast-install flag\r
-# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'.\r
-AC_DEFUN([AC_ENABLE_FAST_INSTALL],\r
-[define([AC_ENABLE_FAST_INSTALL_DEFAULT], ifelse($1, no, no, yes))dnl\r
-AC_ARG_ENABLE([fast-install],\r
- [AC_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@],\r
- [optimize for fast installation @<:@default=]AC_ENABLE_FAST_INSTALL_DEFAULT[@:>@])],\r
- [p=${PACKAGE-default}\r
- case $enableval in\r
- yes) enable_fast_install=yes ;;\r
- no) enable_fast_install=no ;;\r
- *)\r
- enable_fast_install=no\r
- # Look at the argument we got. We use all the common list separators.\r
- lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"\r
- for pkg in $enableval; do\r
- IFS="$lt_save_ifs"\r
- if test "X$pkg" = "X$p"; then\r
- enable_fast_install=yes\r
- fi\r
- done\r
- IFS="$lt_save_ifs"\r
- ;;\r
- esac],\r
- [enable_fast_install=]AC_ENABLE_FAST_INSTALL_DEFAULT)\r
-])# AC_ENABLE_FAST_INSTALL\r
-\r
-\r
-# AC_DISABLE_FAST_INSTALL\r
-# -----------------------\r
-# set the default to --disable-fast-install\r
-AC_DEFUN([AC_DISABLE_FAST_INSTALL],\r
-[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl\r
-AC_ENABLE_FAST_INSTALL(no)\r
-])# AC_DISABLE_FAST_INSTALL\r
-\r
-\r
-# AC_LIBTOOL_PICMODE([MODE])\r
-# --------------------------\r
-# implement the --with-pic flag\r
-# MODE is either `yes' or `no'. If omitted, it defaults to `both'.\r
-AC_DEFUN([AC_LIBTOOL_PICMODE],\r
-[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl\r
-pic_mode=ifelse($#,1,$1,default)\r
-])# AC_LIBTOOL_PICMODE\r
-\r
-\r
-# AC_PROG_EGREP\r
-# -------------\r
-# This is predefined starting with Autoconf 2.54, so this conditional\r
-# definition can be removed once we require Autoconf 2.54 or later.\r
-m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP],\r
-[AC_CACHE_CHECK([for egrep], [ac_cv_prog_egrep],\r
- [if echo a | (grep -E '(a|b)') >/dev/null 2>&1\r
- then ac_cv_prog_egrep='grep -E'\r
- else ac_cv_prog_egrep='egrep'\r
- fi])\r
- EGREP=$ac_cv_prog_egrep\r
- AC_SUBST([EGREP])\r
-])])\r
-\r
-\r
-# AC_PATH_TOOL_PREFIX\r
-# -------------------\r
-# find a file program which can recognise shared library\r
-AC_DEFUN([AC_PATH_TOOL_PREFIX],\r
-[AC_REQUIRE([AC_PROG_EGREP])dnl\r
-AC_MSG_CHECKING([for $1])\r
-AC_CACHE_VAL(lt_cv_path_MAGIC_CMD,\r
-[case $MAGIC_CMD in\r
-[[\\/*] | ?:[\\/]*])\r
- lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path.\r
- ;;\r
-*)\r
- lt_save_MAGIC_CMD="$MAGIC_CMD"\r
- lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR\r
-dnl $ac_dummy forces splitting on constant user-supplied paths.\r
-dnl POSIX.2 word splitting is done only on the output of word expansions,\r
-dnl not every word. This closes a longstanding sh security hole.\r
- ac_dummy="ifelse([$2], , $PATH, [$2])"\r
- for ac_dir in $ac_dummy; do\r
- IFS="$lt_save_ifs"\r
- test -z "$ac_dir" && ac_dir=.\r
- if test -f $ac_dir/$1; then\r
- lt_cv_path_MAGIC_CMD="$ac_dir/$1"\r
- if test -n "$file_magic_test_file"; then\r
- case $deplibs_check_method in\r
- "file_magic "*)\r
- file_magic_regex="`expr \"$deplibs_check_method\" : \"file_magic \(.*\)\"`"\r
- MAGIC_CMD="$lt_cv_path_MAGIC_CMD"\r
- if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null |\r
- $EGREP "$file_magic_regex" > /dev/null; then\r
- :\r
- else\r
- cat <<EOF 1>&2\r
-\r
-*** Warning: the command libtool uses to detect shared libraries,\r
-*** $file_magic_cmd, produces output that libtool cannot recognize.\r
-*** The result is that libtool may fail to recognize shared libraries\r
-*** as such. This will affect the creation of libtool libraries that\r
-*** depend on shared libraries, but programs linked with such libtool\r
-*** libraries will work regardless of this problem. Nevertheless, you\r
-*** may want to report the problem to your system manager and/or to\r
-*** bug-libtool@gnu.org\r
-\r
-EOF\r
- fi ;;\r
- esac\r
- fi\r
- break\r
- fi\r
- done\r
- IFS="$lt_save_ifs"\r
- MAGIC_CMD="$lt_save_MAGIC_CMD"\r
- ;;\r
-esac])\r
-MAGIC_CMD="$lt_cv_path_MAGIC_CMD"\r
-if test -n "$MAGIC_CMD"; then\r
- AC_MSG_RESULT($MAGIC_CMD)\r
-else\r
- AC_MSG_RESULT(no)\r
-fi\r
-])# AC_PATH_TOOL_PREFIX\r
-\r
-\r
-# AC_PATH_MAGIC\r
-# -------------\r
-# find a file program which can recognise a shared library\r
-AC_DEFUN([AC_PATH_MAGIC],\r
-[AC_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH)\r
-if test -z "$lt_cv_path_MAGIC_CMD"; then\r
- if test -n "$ac_tool_prefix"; then\r
- AC_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH)\r
- else\r
- MAGIC_CMD=:\r
- fi\r
-fi\r
-])# AC_PATH_MAGIC\r
-\r
-\r
-# AC_PROG_LD\r
-# ----------\r
-# find the pathname to the GNU or non-GNU linker\r
-AC_DEFUN([AC_PROG_LD],\r
-[AC_ARG_WITH([gnu-ld],\r
- [AC_HELP_STRING([--with-gnu-ld],\r
- [assume the C compiler uses GNU ld @<:@default=no@:>@])],\r
- [test "$withval" = no || with_gnu_ld=yes],\r
- [with_gnu_ld=no])\r
-AC_REQUIRE([LT_AC_PROG_SED])dnl\r
-AC_REQUIRE([AC_PROG_CC])dnl\r
-AC_REQUIRE([AC_CANONICAL_HOST])dnl\r
-AC_REQUIRE([AC_CANONICAL_BUILD])dnl\r
-ac_prog=ld\r
-if test "$GCC" = yes; then\r
- # Check if gcc -print-prog-name=ld gives a path.\r
- AC_MSG_CHECKING([for ld used by $CC])\r
- case $host in\r
- *-*-mingw*)\r
- # gcc leaves a trailing carriage return which upsets mingw\r
- ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;;\r
- *)\r
- ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;\r
- esac\r
- case $ac_prog in\r
- # Accept absolute paths.\r
- [[\\/]]* | ?:[[\\/]]*)\r
- re_direlt='/[[^/]][[^/]]*/\.\./'\r
- # Canonicalize the pathname of ld\r
- ac_prog=`echo $ac_prog| $SED 's%\\\\%/%g'`\r
- while echo $ac_prog | grep "$re_direlt" > /dev/null 2>&1; do\r
- ac_prog=`echo $ac_prog| $SED "s%$re_direlt%/%"`\r
- done\r
- test -z "$LD" && LD="$ac_prog"\r
- ;;\r
- "")\r
- # If it fails, then pretend we aren't using GCC.\r
- ac_prog=ld\r
- ;;\r
- *)\r
- # If it is relative, then search for the first ld in PATH.\r
- with_gnu_ld=unknown\r
- ;;\r
- esac\r
-elif test "$with_gnu_ld" = yes; then\r
- AC_MSG_CHECKING([for GNU ld])\r
-else\r
- AC_MSG_CHECKING([for non-GNU ld])\r
-fi\r
-AC_CACHE_VAL(lt_cv_path_LD,\r
-[if test -z "$LD"; then\r
- lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR\r
- for ac_dir in $PATH; do\r
- IFS="$lt_save_ifs"\r
- test -z "$ac_dir" && ac_dir=.\r
- if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then\r
- lt_cv_path_LD="$ac_dir/$ac_prog"\r
- # Check to see if the program is GNU ld. I'd rather use --version,\r
- # but apparently some GNU ld's only accept -v.\r
- # Break only if it was the GNU/non-GNU ld that we prefer.\r
- case `"$lt_cv_path_LD" -v 2>&1 </dev/null` in\r
- *GNU* | *'with BFD'*)\r
- test "$with_gnu_ld" != no && break\r
- ;;\r
- *)\r
- test "$with_gnu_ld" != yes && break\r
- ;;\r
- esac\r
- fi\r
- done\r
- IFS="$lt_save_ifs"\r
-else\r
- lt_cv_path_LD="$LD" # Let the user override the test with a path.\r
-fi])\r
-LD="$lt_cv_path_LD"\r
-if test -n "$LD"; then\r
- AC_MSG_RESULT($LD)\r
-else\r
- AC_MSG_RESULT(no)\r
-fi\r
-test -z "$LD" && AC_MSG_ERROR([no acceptable ld found in \$PATH])\r
-AC_PROG_LD_GNU\r
-])# AC_PROG_LD\r
-\r
-\r
-# AC_PROG_LD_GNU\r
-# --------------\r
-AC_DEFUN([AC_PROG_LD_GNU],\r
-[AC_REQUIRE([AC_PROG_EGREP])dnl\r
-AC_CACHE_CHECK([if the linker ($LD) is GNU ld], lt_cv_prog_gnu_ld,\r
-[# I'd rather use --version here, but apparently some GNU ld's only accept -v.\r
-case `$LD -v 2>&1 </dev/null` in\r
-*GNU* | *'with BFD'*)\r
- lt_cv_prog_gnu_ld=yes\r
- ;;\r
-*)\r
- lt_cv_prog_gnu_ld=no\r
- ;;\r
-esac])\r
-with_gnu_ld=$lt_cv_prog_gnu_ld\r
-])# AC_PROG_LD_GNU\r
-\r
-\r
-# AC_PROG_LD_RELOAD_FLAG\r
-# ----------------------\r
-# find reload flag for linker\r
-# -- PORTME Some linkers may need a different reload flag.\r
-AC_DEFUN([AC_PROG_LD_RELOAD_FLAG],\r
-[AC_CACHE_CHECK([for $LD option to reload object files],\r
- lt_cv_ld_reload_flag,\r
- [lt_cv_ld_reload_flag='-r'])\r
-reload_flag=$lt_cv_ld_reload_flag\r
-case $reload_flag in\r
-"" | " "*) ;;\r
-*) reload_flag=" $reload_flag" ;;\r
-esac\r
-reload_cmds='$LD$reload_flag -o $output$reload_objs'\r
-])# AC_PROG_LD_RELOAD_FLAG\r
-\r
-\r
-# AC_DEPLIBS_CHECK_METHOD\r
-# -----------------------\r
-# how to check for library dependencies\r
-# -- PORTME fill in with the dynamic library characteristics\r
-AC_DEFUN([AC_DEPLIBS_CHECK_METHOD],\r
-[AC_CACHE_CHECK([how to recognise dependent libraries],\r
-lt_cv_deplibs_check_method,\r
-[lt_cv_file_magic_cmd='$MAGIC_CMD'\r
-lt_cv_file_magic_test_file=\r
-lt_cv_deplibs_check_method='unknown'\r
-# Need to set the preceding variable on all platforms that support\r
-# interlibrary dependencies.\r
-# 'none' -- dependencies not supported.\r
-# `unknown' -- same as none, but documents that we really don't know.\r
-# 'pass_all' -- all dependencies passed with no checks.\r
-# 'test_compile' -- check by making test program.\r
-# 'file_magic [[regex]]' -- check by looking for files in library path\r
-# which responds to the $file_magic_cmd with a given extended regex.\r
-# If you have `file' or equivalent on your system and you're not sure\r
-# whether `pass_all' will *always* work, you probably want this one.\r
-\r
-case $host_os in\r
-aix4* | aix5*)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-\r
-beos*)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-\r
-bsdi4*)\r
- lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib)'\r
- lt_cv_file_magic_cmd='/usr/bin/file -L'\r
- lt_cv_file_magic_test_file=/shlib/libc.so\r
- ;;\r
-\r
-cygwin*)\r
- # func_win32_libid is a shell function defined in ltmain.sh\r
- lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'\r
- lt_cv_file_magic_cmd='func_win32_libid'\r
- ;;\r
-\r
-mingw* | pw32*)\r
- # Base MSYS/MinGW do not provide the 'file' command needed by\r
- # func_win32_libid shell function, so use a weaker test based on 'objdump'.\r
- lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?'\r
- lt_cv_file_magic_cmd='$OBJDUMP -f'\r
- ;;\r
-\r
-darwin* | rhapsody*)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-\r
-freebsd* | kfreebsd*-gnu)\r
- if echo __ELF__ | $CC -E - | grep __ELF__ > /dev/null; then\r
- case $host_cpu in\r
- i*86 )\r
- # Not sure whether the presence of OpenBSD here was a mistake.\r
- # Let's accept both of them until this is cleared up.\r
- lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD)/i[[3-9]]86 (compact )?demand paged shared library'\r
- lt_cv_file_magic_cmd=/usr/bin/file\r
- lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`\r
- ;;\r
- esac\r
- else\r
- lt_cv_deplibs_check_method=pass_all\r
- fi\r
- ;;\r
-\r
-gnu*)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-\r
-hpux10.20* | hpux11*)\r
- lt_cv_file_magic_cmd=/usr/bin/file\r
- case "$host_cpu" in\r
- ia64*)\r
- lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64'\r
- lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so\r
- ;;\r
- hppa*64*)\r
- [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - PA-RISC [0-9].[0-9]']\r
- lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl\r
- ;;\r
- *)\r
- lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]].[[0-9]]) shared library'\r
- lt_cv_file_magic_test_file=/usr/lib/libc.sl\r
- ;;\r
- esac\r
- ;;\r
-\r
-irix5* | irix6* | nonstopux*)\r
- case $LD in\r
- *-32|*"-32 ") libmagic=32-bit;;\r
- *-n32|*"-n32 ") libmagic=N32;;\r
- *-64|*"-64 ") libmagic=64-bit;;\r
- *) libmagic=never-match;;\r
- esac\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-\r
-# This must be Linux ELF.\r
-linux*)\r
- case $host_cpu in\r
- alpha*|hppa*|i*86|ia64*|m68*|mips*|powerpc*|sparc*|s390*|sh*|x86_64*)\r
- lt_cv_deplibs_check_method=pass_all ;;\r
- *)\r
- # glibc up to 2.1.1 does not perform some relocations on ARM\r
- # this will be overridden with pass_all, but let us keep it just in case\r
- lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )' ;;\r
- esac\r
- lt_cv_file_magic_test_file=`echo /lib/libc.so* /lib/libc-*.so`\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-\r
-netbsd*)\r
- if echo __ELF__ | $CC -E - | grep __ELF__ > /dev/null; then\r
- lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$'\r
- else\r
- lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$'\r
- fi\r
- ;;\r
-\r
-newos6*)\r
- lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)'\r
- lt_cv_file_magic_cmd=/usr/bin/file\r
- lt_cv_file_magic_test_file=/usr/lib/libnls.so\r
- ;;\r
-\r
-nto-qnx*)\r
- lt_cv_deplibs_check_method=unknown\r
- ;;\r
-\r
-openbsd*)\r
- lt_cv_file_magic_cmd=/usr/bin/file\r
- lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`\r
- if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then\r
- lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB shared object'\r
- else\r
- lt_cv_deplibs_check_method='file_magic OpenBSD.* shared library'\r
- fi\r
- ;;\r
-\r
-osf3* | osf4* | osf5*)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-\r
-sco3.2v5*)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-\r
-solaris*)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-\r
-sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)\r
- case $host_vendor in\r
- motorola)\r
- lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]'\r
- lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*`\r
- ;;\r
- ncr)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
- sequent)\r
- lt_cv_file_magic_cmd='/bin/file'\r
- lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )'\r
- ;;\r
- sni)\r
- lt_cv_file_magic_cmd='/bin/file'\r
- lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib"\r
- lt_cv_file_magic_test_file=/lib/libc.so\r
- ;;\r
- siemens)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
- esac\r
- ;;\r
-\r
-sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[[78]]* | unixware7* | sysv4*uw2*)\r
- lt_cv_deplibs_check_method=pass_all\r
- ;;\r
-esac\r
-])\r
-file_magic_cmd=$lt_cv_file_magic_cmd\r
-deplibs_check_method=$lt_cv_deplibs_check_method\r
-test -z "$deplibs_check_method" && deplibs_check_method=unknown\r
-])# AC_DEPLIBS_CHECK_METHOD\r
-\r
-\r
-# AC_PROG_NM\r
-# ----------\r
-# find the pathname to a BSD-compatible name lister\r
-AC_DEFUN([AC_PROG_NM],\r
-[AC_CACHE_CHECK([for BSD-compatible nm], lt_cv_path_NM,\r
-[if test -n "$NM"; then\r
- # Let the user override the test.\r
- lt_cv_path_NM="$NM"\r
-else\r
- lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR\r
- for ac_dir in $PATH /usr/ccs/bin /usr/ucb /bin; do\r
- IFS="$lt_save_ifs"\r
- test -z "$ac_dir" && ac_dir=.\r
- tmp_nm="$ac_dir/${ac_tool_prefix}nm"\r
- if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then\r
- # Check to see if the nm accepts a BSD-compat flag.\r
- # Adding the `sed 1q' prevents false positives on HP-UX, which says:\r
- # nm: unknown option "B" ignored\r
- # Tru64's nm complains that /dev/null is an invalid object file\r
- case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in\r
- */dev/null* | *'Invalid file or object type'*)\r
- lt_cv_path_NM="$tmp_nm -B"\r
- break\r
- ;;\r
- *)\r
- case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in\r
- */dev/null*)\r
- lt_cv_path_NM="$tmp_nm -p"\r
- break\r
- ;;\r
- *)\r
- lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but\r
- continue # so that we can try to find one that supports BSD flags\r
- ;;\r
- esac\r
- esac\r
- fi\r
- done\r
- IFS="$lt_save_ifs"\r
- test -z "$lt_cv_path_NM" && lt_cv_path_NM=nm\r
-fi])\r
-NM="$lt_cv_path_NM"\r
-])# AC_PROG_NM\r
-\r
-\r
-# AC_CHECK_LIBM\r
-# -------------\r
-# check for math library\r
-AC_DEFUN([AC_CHECK_LIBM],\r
-[AC_REQUIRE([AC_CANONICAL_HOST])dnl\r
-LIBM=\r
-case $host in\r
-*-*-beos* | *-*-cygwin* | *-*-pw32* | *-*-darwin*)\r
- # These system don't have libm, or don't need it\r
- ;;\r
-*-ncr-sysv4.3*)\r
- AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM="-lmw")\r
- AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm")\r
- ;;\r
-*)\r
- AC_CHECK_LIB(m, cos, LIBM="-lm")\r
- ;;\r
-esac\r
-])# AC_CHECK_LIBM\r
-\r
-\r
-# AC_LIBLTDL_CONVENIENCE([DIRECTORY])\r
-# -----------------------------------\r
-# sets LIBLTDL to the link flags for the libltdl convenience library and\r
-# LTDLINCL to the include flags for the libltdl header and adds\r
-# --enable-ltdl-convenience to the configure arguments. Note that LIBLTDL\r
-# and LTDLINCL are not AC_SUBSTed, nor is AC_CONFIG_SUBDIRS called. If\r
-# DIRECTORY is not provided, it is assumed to be `libltdl'. LIBLTDL will\r
-# be prefixed with '${top_builddir}/' and LTDLINCL will be prefixed with\r
-# '${top_srcdir}/' (note the single quotes!). If your package is not\r
-# flat and you're not using automake, define top_builddir and\r
-# top_srcdir appropriately in the Makefiles.\r
-AC_DEFUN([AC_LIBLTDL_CONVENIENCE],\r
-[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl\r
- case $enable_ltdl_convenience in\r
- no) AC_MSG_ERROR([this package needs a convenience libltdl]) ;;\r
- "") enable_ltdl_convenience=yes\r
- ac_configure_args="$ac_configure_args --enable-ltdl-convenience" ;;\r
- esac\r
- LIBLTDL='${top_builddir}/'ifelse($#,1,[$1],['libltdl'])/libltdlc.la\r
- LTDLINCL='-I${top_srcdir}/'ifelse($#,1,[$1],['libltdl'])\r
- # For backwards non-gettext consistent compatibility...\r
- INCLTDL="$LTDLINCL"\r
-])# AC_LIBLTDL_CONVENIENCE\r
-\r
-\r
-# AC_LIBLTDL_INSTALLABLE([DIRECTORY])\r
-# -----------------------------------\r
-# sets LIBLTDL to the link flags for the libltdl installable library and\r
-# LTDLINCL to the include flags for the libltdl header and adds\r
-# --enable-ltdl-install to the configure arguments. Note that LIBLTDL\r
-# and LTDLINCL are not AC_SUBSTed, nor is AC_CONFIG_SUBDIRS called. If\r
-# DIRECTORY is not provided and an installed libltdl is not found, it is\r
-# assumed to be `libltdl'. LIBLTDL will be prefixed with '${top_builddir}/'\r
-# and LTDLINCL will be prefixed with '${top_srcdir}/' (note the single\r
-# quotes!). If your package is not flat and you're not using automake,\r
-# define top_builddir and top_srcdir appropriately in the Makefiles.\r
-# In the future, this macro may have to be called after AC_PROG_LIBTOOL.\r
-AC_DEFUN([AC_LIBLTDL_INSTALLABLE],\r
-[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl\r
- AC_CHECK_LIB(ltdl, lt_dlinit,\r
- [test x"$enable_ltdl_install" != xyes && enable_ltdl_install=no],\r
- [if test x"$enable_ltdl_install" = xno; then\r
- AC_MSG_WARN([libltdl not installed, but installation disabled])\r
- else\r
- enable_ltdl_install=yes\r
- fi\r
- ])\r
- if test x"$enable_ltdl_install" = x"yes"; then\r
- ac_configure_args="$ac_configure_args --enable-ltdl-install"\r
- LIBLTDL='${top_builddir}/'ifelse($#,1,[$1],['libltdl'])/libltdl.la\r
- LTDLINCL='-I${top_srcdir}/'ifelse($#,1,[$1],['libltdl'])\r
- else\r
- ac_configure_args="$ac_configure_args --enable-ltdl-install=no"\r
- LIBLTDL="-lltdl"\r
- LTDLINCL=\r
- fi\r
- # For backwards non-gettext consistent compatibility...\r
- INCLTDL="$LTDLINCL"\r
-])# AC_LIBLTDL_INSTALLABLE\r
-\r
-\r
-# AC_LIBTOOL_CXX\r
-# --------------\r
-# enable support for C++ libraries\r
-AC_DEFUN([AC_LIBTOOL_CXX],\r
-[AC_REQUIRE([_LT_AC_LANG_CXX])\r
-])# AC_LIBTOOL_CXX\r
-\r
-\r
-# _LT_AC_LANG_CXX\r
-# ---------------\r
-AC_DEFUN([_LT_AC_LANG_CXX],\r
-[AC_REQUIRE([AC_PROG_CXX])\r
-AC_REQUIRE([AC_PROG_CXXCPP])\r
-_LT_AC_SHELL_INIT([tagnames=${tagnames+${tagnames},}CXX])\r
-])# _LT_AC_LANG_CXX\r
-\r
-\r
-# AC_LIBTOOL_F77\r
-# --------------\r
-# enable support for Fortran 77 libraries\r
-AC_DEFUN([AC_LIBTOOL_F77],\r
-[AC_REQUIRE([_LT_AC_LANG_F77])\r
-])# AC_LIBTOOL_F77\r
-\r
-\r
-# _LT_AC_LANG_F77\r
-# ---------------\r
-AC_DEFUN([_LT_AC_LANG_F77],\r
-[AC_REQUIRE([AC_PROG_F77])\r
-_LT_AC_SHELL_INIT([tagnames=${tagnames+${tagnames},}F77])\r
-])# _LT_AC_LANG_F77\r
-\r
-\r
-# AC_LIBTOOL_GCJ\r
-# --------------\r
-# enable support for GCJ libraries\r
-AC_DEFUN([AC_LIBTOOL_GCJ],\r
-[AC_REQUIRE([_LT_AC_LANG_GCJ])\r
-])# AC_LIBTOOL_GCJ\r
-\r
-\r
-# _LT_AC_LANG_GCJ\r
-# ---------------\r
-AC_DEFUN([_LT_AC_LANG_GCJ],\r
-[AC_PROVIDE_IFELSE([AC_PROG_GCJ],[],\r
- [AC_PROVIDE_IFELSE([A][M_PROG_GCJ],[],\r
- [AC_PROVIDE_IFELSE([LT_AC_PROG_GCJ],[],\r
- [ifdef([AC_PROG_GCJ],[AC_REQUIRE([AC_PROG_GCJ])],\r
- [ifdef([A][M_PROG_GCJ],[AC_REQUIRE([A][M_PROG_GCJ])],\r
- [AC_REQUIRE([A][C_PROG_GCJ_OR_A][M_PROG_GCJ])])])])])])\r
-_LT_AC_SHELL_INIT([tagnames=${tagnames+${tagnames},}GCJ])\r
-])# _LT_AC_LANG_GCJ\r
-\r
-\r
-# AC_LIBTOOL_RC\r
-# --------------\r
-# enable support for Windows resource files\r
-AC_DEFUN([AC_LIBTOOL_RC],\r
-[AC_REQUIRE([LT_AC_PROG_RC])\r
-_LT_AC_SHELL_INIT([tagnames=${tagnames+${tagnames},}RC])\r
-])# AC_LIBTOOL_RC\r
-\r
-\r
-# AC_LIBTOOL_LANG_C_CONFIG\r
-# ------------------------\r
-# Ensure that the configuration vars for the C compiler are\r
-# suitably defined. Those variables are subsequently used by\r
-# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.\r
-AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG], [_LT_AC_LANG_C_CONFIG])\r
-AC_DEFUN([_LT_AC_LANG_C_CONFIG],\r
-[lt_save_CC="$CC"\r
-AC_LANG_PUSH(C)\r
-\r
-# Source file extension for C test sources.\r
-ac_ext=c\r
-\r
-# Object file extension for compiled C test sources.\r
-objext=o\r
-_LT_AC_TAGVAR(objext, $1)=$objext\r
-\r
-# Code to be used in simple compile tests\r
-lt_simple_compile_test_code="int some_variable = 0;\n"\r
-\r
-# Code to be used in simple link tests\r
-lt_simple_link_test_code='int main(){return(0);}\n'\r
-\r
-_LT_AC_SYS_COMPILER\r
-\r
-#\r
-# Check for any special shared library compilation flags.\r
-#\r
-_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)=\r
-if test "$GCC" = no; then\r
- case $host_os in\r
- sco3.2v5*)\r
- _LT_AC_TAGVAR(lt_prog_cc_shlib, $1)='-belf'\r
- ;;\r
- esac\r
-fi\r
-if test -n "$_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)"; then\r
- AC_MSG_WARN([`$CC' requires `$_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)' to build shared libraries])\r
- if echo "$old_CC $old_CFLAGS " | grep "[[ ]]$_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)[[ ]]" >/dev/null; then :\r
- else\r
- AC_MSG_WARN([add `$_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)' to the CC or CFLAGS env variable and reconfigure])\r
- _LT_AC_TAGVAR(lt_cv_prog_cc_can_build_shared, $1)=no\r
- fi\r
-fi\r
-\r
-\r
-#\r
-# Check to make sure the static flag actually works.\r
-#\r
-AC_LIBTOOL_LINKER_OPTION([if $compiler static flag $_LT_AC_TAGVAR(lt_prog_compiler_static, $1) works],\r
- _LT_AC_TAGVAR(lt_prog_compiler_static_works, $1),\r
- $_LT_AC_TAGVAR(lt_prog_compiler_static, $1),\r
- [],\r
- [_LT_AC_TAGVAR(lt_prog_compiler_static, $1)=])\r
-\r
-\r
-## CAVEAT EMPTOR:\r
-## There is no encapsulation within the following macros, do not change\r
-## the running order or otherwise move them around unless you know exactly\r
-## what you are doing...\r
-AC_LIBTOOL_PROG_COMPILER_NO_RTTI($1)\r
-AC_LIBTOOL_PROG_COMPILER_PIC($1)\r
-AC_LIBTOOL_PROG_CC_C_O($1)\r
-AC_LIBTOOL_SYS_HARD_LINK_LOCKS($1)\r
-AC_LIBTOOL_PROG_LD_SHLIBS($1)\r
-AC_LIBTOOL_SYS_DYNAMIC_LINKER($1)\r
-AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH($1)\r
-AC_LIBTOOL_SYS_LIB_STRIP\r
-AC_LIBTOOL_DLOPEN_SELF($1)\r
-\r
-# Report which librarie types wil actually be built\r
-AC_MSG_CHECKING([if libtool supports shared libraries])\r
-AC_MSG_RESULT([$can_build_shared])\r
-\r
-AC_MSG_CHECKING([whether to build shared libraries])\r
-test "$can_build_shared" = "no" && enable_shared=no\r
-\r
-# On AIX, shared libraries and static libraries use the same namespace, and\r
-# are all built from PIC.\r
-case "$host_os" in\r
-aix3*)\r
- test "$enable_shared" = yes && enable_static=no\r
- if test -n "$RANLIB"; then\r
- archive_cmds="$archive_cmds~\$RANLIB \$lib"\r
- postinstall_cmds='$RANLIB $lib'\r
- fi\r
- ;;\r
-\r
-aix4* | aix5*)\r
- if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then\r
- test "$enable_shared" = yes && enable_static=no\r
- fi\r
- ;;\r
- darwin* | rhapsody*)\r
- if test "$GCC" = yes; then\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
- case "$host_os" in\r
- rhapsody* | darwin1.[[012]])\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined suppress'\r
- ;;\r
- *) # Darwin 1.3 on\r
- if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'\r
- else\r
- case ${MACOSX_DEPLOYMENT_TARGET} in\r
- 10.[[012]])\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'\r
- ;;\r
- 10.*)\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined dynamic_lookup'\r
- ;;\r
- esac\r
- fi\r
- ;;\r
- esac\r
- output_verbose_link_cmd='echo'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs$compiler_flags -install_name $rpath/$soname $verstring'\r
- _LT_AC_TAGVAR(module_cmds, $1)='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags'\r
- # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs$compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'\r
- _LT_AC_TAGVAR(module_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no\r
- _LT_AC_TAGVAR(hardcode_automatic, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='-all_load $convenience'\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=yes\r
- else\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
-esac\r
-AC_MSG_RESULT([$enable_shared])\r
-\r
-AC_MSG_CHECKING([whether to build static libraries])\r
-# Make sure either enable_shared or enable_static is yes.\r
-test "$enable_shared" = yes || enable_static=yes\r
-AC_MSG_RESULT([$enable_static])\r
-\r
-AC_LIBTOOL_CONFIG($1)\r
-\r
-AC_LANG_POP\r
-CC="$lt_save_CC"\r
-])# AC_LIBTOOL_LANG_C_CONFIG\r
-\r
-\r
-# AC_LIBTOOL_LANG_CXX_CONFIG\r
-# --------------------------\r
-# Ensure that the configuration vars for the C compiler are\r
-# suitably defined. Those variables are subsequently used by\r
-# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.\r
-AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG], [_LT_AC_LANG_CXX_CONFIG(CXX)])\r
-AC_DEFUN([_LT_AC_LANG_CXX_CONFIG],\r
-[AC_LANG_PUSH(C++)\r
-AC_REQUIRE([AC_PROG_CXX])\r
-AC_REQUIRE([AC_PROG_CXXCPP])\r
-\r
-_LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
-_LT_AC_TAGVAR(allow_undefined_flag, $1)=\r
-_LT_AC_TAGVAR(always_export_symbols, $1)=no\r
-_LT_AC_TAGVAR(archive_expsym_cmds, $1)=\r
-_LT_AC_TAGVAR(export_dynamic_flag_spec, $1)=\r
-_LT_AC_TAGVAR(hardcode_direct, $1)=no\r
-_LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=\r
-_LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)=\r
-_LT_AC_TAGVAR(hardcode_libdir_separator, $1)=\r
-_LT_AC_TAGVAR(hardcode_minus_L, $1)=no\r
-_LT_AC_TAGVAR(hardcode_automatic, $1)=no\r
-_LT_AC_TAGVAR(module_cmds, $1)=\r
-_LT_AC_TAGVAR(module_expsym_cmds, $1)=\r
-_LT_AC_TAGVAR(link_all_deplibs, $1)=unknown\r
-_LT_AC_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\r
-_LT_AC_TAGVAR(no_undefined_flag, $1)=\r
-_LT_AC_TAGVAR(whole_archive_flag_spec, $1)=\r
-_LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=no\r
-\r
-# Dependencies to place before and after the object being linked:\r
-_LT_AC_TAGVAR(predep_objects, $1)=\r
-_LT_AC_TAGVAR(postdep_objects, $1)=\r
-_LT_AC_TAGVAR(predeps, $1)=\r
-_LT_AC_TAGVAR(postdeps, $1)=\r
-_LT_AC_TAGVAR(compiler_lib_search_path, $1)=\r
-\r
-# Source file extension for C++ test sources.\r
-ac_ext=cc\r
-\r
-# Object file extension for compiled C++ test sources.\r
-objext=o\r
-_LT_AC_TAGVAR(objext, $1)=$objext\r
-\r
-# Code to be used in simple compile tests\r
-lt_simple_compile_test_code="int some_variable = 0;\n"\r
-\r
-# Code to be used in simple link tests\r
-lt_simple_link_test_code='int main(int, char *[]) { return(0); }\n'\r
-\r
-# ltmain only uses $CC for tagged configurations so make sure $CC is set.\r
-_LT_AC_SYS_COMPILER\r
-\r
-# Allow CC to be a program name with arguments.\r
-lt_save_CC=$CC\r
-lt_save_LD=$LD\r
-lt_save_GCC=$GCC\r
-GCC=$GXX\r
-lt_save_with_gnu_ld=$with_gnu_ld\r
-lt_save_path_LD=$lt_cv_path_LD\r
-if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then\r
- lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx\r
-else\r
- unset lt_cv_prog_gnu_ld\r
-fi\r
-if test -n "${lt_cv_path_LDCXX+set}"; then\r
- lt_cv_path_LD=$lt_cv_path_LDCXX\r
-else\r
- unset lt_cv_path_LD\r
-fi\r
-test -z "${LDCXX+set}" || LD=$LDCXX\r
-CC=${CXX-"c++"}\r
-compiler=$CC\r
-_LT_AC_TAGVAR(compiler, $1)=$CC\r
-cc_basename=`$echo X"$compiler" | $Xsed -e 's%^.*/%%'`\r
-\r
-# We don't want -fno-exception wen compiling C++ code, so set the\r
-# no_builtin_flag separately\r
-if test "$GXX" = yes; then\r
- _LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin'\r
-else\r
- _LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=\r
-fi\r
-\r
-if test "$GXX" = yes; then\r
- # Set up default GNU C++ configuration\r
-\r
- AC_PROG_LD\r
-\r
- # Check if GNU C++ uses GNU ld as the underlying linker, since the\r
- # archiving commands below assume that GNU ld is being used.\r
- if test "$with_gnu_ld" = yes; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir'\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\r
-\r
- # If archive_cmds runs LD, not CC, wlarc should be empty\r
- # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to\r
- # investigate it a little bit more. (MM)\r
- wlarc='${wl}'\r
-\r
- # ancient GNU ld didn't support --whole-archive et. al.\r
- if eval "`$CC -print-prog-name=ld` --help 2>&1" | \\r
- grep 'no-whole-archive' > /dev/null; then\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'\r
- else\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=\r
- fi\r
- else\r
- with_gnu_ld=no\r
- wlarc=\r
-\r
- # A generic and very simple default shared library creation\r
- # command for GNU C++ for the case where it uses the native\r
- # linker, instead of GNU ld. If possible, this setting should\r
- # overridden to take advantage of the native linker features on\r
- # the platform it is being used on.\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'\r
- fi\r
-\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "\-L"'\r
-\r
-else\r
- GXX=no\r
- with_gnu_ld=no\r
- wlarc=\r
-fi\r
-\r
-# PORTME: fill in a description of your system's C++ link characteristics\r
-AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])\r
-_LT_AC_TAGVAR(ld_shlibs, $1)=yes\r
-case $host_os in\r
- aix3*)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- aix4* | aix5*)\r
- if test "$host_cpu" = ia64; then\r
- # On IA64, the linker does run time linking by default, so we don't\r
- # have to do anything special.\r
- aix_use_runtimelinking=no\r
- exp_sym_flag='-Bexport'\r
- no_entry_flag=""\r
- else\r
- aix_use_runtimelinking=no\r
-\r
- # Test if we are trying to use run time linking or normal\r
- # AIX style linking. If -brtl is somewhere in LDFLAGS, we\r
- # need to do runtime linking.\r
- case $host_os in aix4.[[23]]|aix4.[[23]].*|aix5*)\r
- for ld_flag in $LDFLAGS; do\r
- case $ld_flag in\r
- *-brtl*)\r
- aix_use_runtimelinking=yes\r
- break\r
- ;;\r
- esac\r
- done\r
- esac\r
-\r
- exp_sym_flag='-bexport'\r
- no_entry_flag='-bnoentry'\r
- fi\r
-\r
- # When large executables or shared objects are built, AIX ld can\r
- # have problems creating the table of contents. If linking a library\r
- # or program results in "error TOC overflow" add -mminimal-toc to\r
- # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not\r
- # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\r
-\r
- _LT_AC_TAGVAR(archive_cmds, $1)=''\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=':'\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=yes\r
-\r
- if test "$GXX" = yes; then\r
- case $host_os in aix4.[012]|aix4.[012].*)\r
- # We only want to do this on AIX 4.2 and lower, the check\r
- # below for broken collect2 doesn't work under 4.3+\r
- collect2name=`${CC} -print-prog-name=collect2`\r
- if test -f "$collect2name" && \\r
- strings "$collect2name" | grep resolve_lib_name >/dev/null\r
- then\r
- # We have reworked collect2\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- else\r
- # We have old collect2\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=unsupported\r
- # It fails to find uninstalled libraries when the uninstalled\r
- # path is not listed in the libpath. Setting hardcode_minus_L\r
- # to unsupported forces relinking\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=\r
- fi\r
- esac\r
- shared_flag='-shared'\r
- else\r
- # not using gcc\r
- if test "$host_cpu" = ia64; then\r
- # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\r
- # chokes on -Wl,-G. The following line is correct:\r
- shared_flag='-G'\r
- else\r
- if test "$aix_use_runtimelinking" = yes; then\r
- shared_flag='${wl}-G'\r
- else\r
- shared_flag='${wl}-bM:SRE'\r
- fi\r
- fi\r
- fi\r
-\r
- # It seems that -bexpall does not export symbols beginning with\r
- # underscore (_), so it is better to generate a list of symbols to export.\r
- _LT_AC_TAGVAR(always_export_symbols, $1)=yes\r
- if test "$aix_use_runtimelinking" = yes; then\r
- # Warning - without using the other runtime loading flags (-brtl),\r
- # -berok will link without error, but may produce a broken library.\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-berok'\r
- # Determine the default libpath from the value encoded in an empty executable.\r
- _LT_AC_SYS_LIBPATH_AIX\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"\r
-\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols $shared_flag"\r
- else\r
- if test "$host_cpu" = ia64; then\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib'\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)="-z nodefs"\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols"\r
- else\r
- # Determine the default libpath from the value encoded in an empty executable.\r
- _LT_AC_SYS_LIBPATH_AIX\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"\r
- # Warning - without using the other run time loading flags,\r
- # -berok will link without error, but may produce a broken library.\r
- _LT_AC_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok'\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok'\r
- # -bexpall does not export symbols beginning with underscore (_)\r
- _LT_AC_TAGVAR(always_export_symbols, $1)=yes\r
- # Exported symbols can be pulled into shared objects from archives\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=' '\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=yes\r
- # This is similar to how AIX traditionally builds it's shared libraries.\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}-bE:$export_symbols ${wl}-bnoentry${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'\r
- fi\r
- fi\r
- ;;\r
- chorus*)\r
- case $cc_basename in\r
- *)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- esac\r
- ;;\r
-\r
- cygwin* | mingw* | pw32*)\r
- # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,\r
- # as there is no search path for DLLs.\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported\r
- _LT_AC_TAGVAR(always_export_symbols, $1)=no\r
- _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\r
-\r
- if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib'\r
- # If the export-symbols file already is a .def file (1st line\r
- # is EXPORTS), use it as is; otherwise, prepend...\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then\r
- cp $export_symbols $output_objdir/$soname.def;\r
- else\r
- echo EXPORTS > $output_objdir/$soname.def;\r
- cat $export_symbols >> $output_objdir/$soname.def;\r
- fi~\r
- $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib'\r
- else\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
-\r
- darwin* | rhapsody*)\r
- if test "$GXX" = yes; then\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
- case "$host_os" in\r
- rhapsody* | darwin1.[[012]])\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined suppress'\r
- ;;\r
- *) # Darwin 1.3 on\r
- if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'\r
- else\r
- case ${MACOSX_DEPLOYMENT_TARGET} in\r
- 10.[[012]])\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'\r
- ;;\r
- 10.*)\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined dynamic_lookup'\r
- ;;\r
- esac\r
- fi\r
- ;;\r
- esac\r
- lt_int_apple_cc_single_mod=no\r
- output_verbose_link_cmd='echo'\r
- if $CC -dumpspecs 2>&1 | grep 'single_module' >/dev/null ; then\r
- lt_int_apple_cc_single_mod=yes\r
- fi\r
- if test "X$lt_int_apple_cc_single_mod" = Xyes ; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring'\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -r ${wl}-bind_at_load -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring'\r
- fi\r
- _LT_AC_TAGVAR(module_cmds, $1)='$CC ${wl}-bind_at_load $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags'\r
-\r
- # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's\r
- if test "X$lt_int_apple_cc_single_mod" = Xyes ; then\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'\r
- else\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -r ${wl}-bind_at_load -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'\r
- fi\r
- _LT_AC_TAGVAR(module_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no\r
- _LT_AC_TAGVAR(hardcode_automatic, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='-all_load $convenience'\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=yes\r
- else\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
-\r
- dgux*)\r
- case $cc_basename in\r
- ec++)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- ghcx)\r
- # Green Hills C++ Compiler\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- *)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- esac\r
- ;;\r
- freebsd[12]*)\r
- # C++ shared libraries reported to be fairly broken before switch to ELF\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- freebsd-elf*)\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
- ;;\r
- freebsd* | kfreebsd*-gnu)\r
- # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF\r
- # conventions\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=yes\r
- ;;\r
- gnu*)\r
- ;;\r
- hpux9*)\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,\r
- # but as the default\r
- # location of the library.\r
-\r
- case $cc_basename in\r
- CC)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- aCC)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- #\r
- # There doesn't appear to be a way to prevent this compiler from\r
- # explicitly linking system object files so we need to strip them\r
- # from the output so that they don't get included in the library\r
- # dependencies.\r
- output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | grep "[-]L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'\r
- ;;\r
- *)\r
- if test "$GXX" = yes; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/$soname~$CC -shared -nostdlib -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\r
- else\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
- esac\r
- ;;\r
- hpux10*|hpux11*)\r
- if test $with_gnu_ld = no; then\r
- case "$host_cpu" in\r
- hppa*64*)\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='+b $libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- ;;\r
- ia64*)\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\r
- ;;\r
- esac\r
- fi\r
- case "$host_cpu" in\r
- hppa*64*)\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
- ia64*)\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,\r
- # but as the default\r
- # location of the library.\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,\r
- # but as the default\r
- # location of the library.\r
- ;;\r
- esac\r
-\r
- case $cc_basename in\r
- CC)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- aCC)\r
- case "$host_cpu" in\r
- hppa*64*|ia64*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -b +h $soname -o $lib $linker_flags $libobjs $deplibs'\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\r
- ;;\r
- esac\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- #\r
- # There doesn't appear to be a way to prevent this compiler from\r
- # explicitly linking system object files so we need to strip them\r
- # from the output so that they don't get included in the library\r
- # dependencies.\r
- output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | grep "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'\r
- ;;\r
- *)\r
- if test "$GXX" = yes; then\r
- if test $with_gnu_ld = no; then\r
- case "$host_cpu" in\r
- ia64*|hppa*64*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -b +h $soname -o $lib $linker_flags $libobjs $deplibs'\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\r
- ;;\r
- esac\r
- fi\r
- else\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
- esac\r
- ;;\r
- irix5* | irix6*)\r
- case $cc_basename in\r
- CC)\r
- # SGI C++\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${objdir}/so_locations -o $lib'\r
-\r
- # Archives containing C++ object files must be created using\r
- # "CC -ar", where "CC" is the IRIX C++ compiler. This is\r
- # necessary to make sure instantiated templates are included\r
- # in the archive.\r
- _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs'\r
- ;;\r
- *)\r
- if test "$GXX" = yes; then\r
- if test "$with_gnu_ld" = no; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${objdir}/so_locations -o $lib'\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` -o $lib'\r
- fi\r
- fi\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=yes\r
- ;;\r
- esac\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- ;;\r
- linux*)\r
- case $cc_basename in\r
- KCC)\r
- # Kuck and Associates, Inc. (KAI) C++ Compiler\r
-\r
- # KCC will only create a shared library if the output file\r
- # ends with ".so" (or ".sl" for HP-UX), so rename the library\r
- # to its proper name (with version) after linking.\r
- _LT_AC_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib'\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- #\r
- # There doesn't appear to be a way to prevent this compiler from\r
- # explicitly linking system object files so we need to strip them\r
- # from the output so that they don't get included in the library\r
- # dependencies.\r
- output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | grep "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath,$libdir'\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\r
-\r
- # Archives containing C++ object files must be created using\r
- # "CC -Bstatic", where "CC" is the KAI C++ compiler.\r
- _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs'\r
- ;;\r
- icpc)\r
- # Intel C++\r
- with_gnu_ld=yes\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive'\r
- ;;\r
- cxx)\r
- # Compaq C++\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols'\r
-\r
- runpath_var=LD_RUN_PATH\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
-\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- #\r
- # There doesn't appear to be a way to prevent this compiler from\r
- # explicitly linking system object files so we need to strip them\r
- # from the output so that they don't get included in the library\r
- # dependencies.\r
- output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "ld"`; templist=`echo $templist | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'\r
- ;;\r
- esac\r
- ;;\r
- lynxos*)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- m88k*)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- mvs*)\r
- case $cc_basename in\r
- cxx)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- *)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- esac\r
- ;;\r
- netbsd*)\r
- if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags'\r
- wlarc=\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- fi\r
- # Workaround some broken pre-1.5 toolchains\r
- output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"'\r
- ;;\r
- osf3*)\r
- case $cc_basename in\r
- KCC)\r
- # Kuck and Associates, Inc. (KAI) C++ Compiler\r
-\r
- # KCC will only create a shared library if the output file\r
- # ends with ".so" (or ".sl" for HP-UX), so rename the library\r
- # to its proper name (with version) after linking.\r
- _LT_AC_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
-\r
- # Archives containing C++ object files must be created using\r
- # "CC -Bstatic", where "CC" is the KAI C++ compiler.\r
- _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs'\r
-\r
- ;;\r
- RCC)\r
- # Rational C++ 2.4.1\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- cxx)\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && echo ${wl}-set_version $verstring` -update_registry ${objdir}/so_locations -o $lib'\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
-\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- #\r
- # There doesn't appear to be a way to prevent this compiler from\r
- # explicitly linking system object files so we need to strip them\r
- # from the output so that they don't get included in the library\r
- # dependencies.\r
- output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "ld" | grep -v "ld:"`; templist=`echo $templist | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'\r
- ;;\r
- *)\r
- if test "$GXX" = yes && test "$with_gnu_ld" = no; then\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${objdir}/so_locations -o $lib'\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
-\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "\-L"'\r
-\r
- else\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
- esac\r
- ;;\r
- osf4* | osf5*)\r
- case $cc_basename in\r
- KCC)\r
- # Kuck and Associates, Inc. (KAI) C++ Compiler\r
-\r
- # KCC will only create a shared library if the output file\r
- # ends with ".so" (or ".sl" for HP-UX), so rename the library\r
- # to its proper name (with version) after linking.\r
- _LT_AC_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
-\r
- # Archives containing C++ object files must be created using\r
- # the KAI C++ compiler.\r
- _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs'\r
- ;;\r
- RCC)\r
- # Rational C++ 2.4.1\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- cxx)\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${objdir}/so_locations -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~\r
- echo "-hidden">> $lib.exp~\r
- $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname -Wl,-input -Wl,$lib.exp `test -n "$verstring" && echo -set_version $verstring` -update_registry $objdir/so_locations -o $lib~\r
- $rm $lib.exp'\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
-\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- #\r
- # There doesn't appear to be a way to prevent this compiler from\r
- # explicitly linking system object files so we need to strip them\r
- # from the output so that they don't get included in the library\r
- # dependencies.\r
- output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "ld" | grep -v "ld:"`; templist=`echo $templist | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'\r
- ;;\r
- *)\r
- if test "$GXX" = yes && test "$with_gnu_ld" = no; then\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${objdir}/so_locations -o $lib'\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
-\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "\-L"'\r
-\r
- else\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
- esac\r
- ;;\r
- psos*)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- sco*)\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
- case $cc_basename in\r
- CC)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- *)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- esac\r
- ;;\r
- sunos4*)\r
- case $cc_basename in\r
- CC)\r
- # Sun C++ 4.x\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- lcc)\r
- # Lucid\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- *)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- esac\r
- ;;\r
- solaris*)\r
- case $cc_basename in\r
- CC)\r
- # Sun C++ 4.2, 5.x and Centerline C++\r
- _LT_AC_TAGVAR(no_undefined_flag, $1)=' -zdefs'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -nolib -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~\r
- $CC -G${allow_undefined_flag} -nolib ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$rm $lib.exp'\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- case $host_os in\r
- solaris2.[0-5] | solaris2.[0-5].*) ;;\r
- *)\r
- # The C++ compiler is used as linker so we must use $wl\r
- # flag to pass the commands to the underlying system\r
- # linker.\r
- # Supported since Solaris 2.6 (maybe 2.5.1?)\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'\r
- ;;\r
- esac\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=yes\r
-\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- #\r
- # There doesn't appear to be a way to prevent this compiler from\r
- # explicitly linking system object files so we need to strip them\r
- # from the output so that they don't get included in the library\r
- # dependencies.\r
- output_verbose_link_cmd='templist=`$CC -G $CFLAGS -v conftest.$objext 2>&1 | grep "\-[[LR]]"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'\r
-\r
- # Archives containing C++ object files must be created using\r
- # "CC -xar", where "CC" is the Sun C++ compiler. This is\r
- # necessary to make sure instantiated templates are included\r
- # in the archive.\r
- _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs'\r
- ;;\r
- gcx)\r
- # Green Hills C++ Compiler\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'\r
-\r
- # The C++ compiler must be used to create the archive.\r
- _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs'\r
- ;;\r
- *)\r
- # GNU C++ compiler with Solaris linker\r
- if test "$GXX" = yes && test "$with_gnu_ld" = no; then\r
- _LT_AC_TAGVAR(no_undefined_flag, $1)=' ${wl}-z ${wl}defs'\r
- if $CC --version | grep -v '^2\.7' > /dev/null; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~\r
- $CC -shared -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$rm $lib.exp'\r
-\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- output_verbose_link_cmd="$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep \"\-L\""\r
- else\r
- # g++ 2.7 appears to require `-G' NOT `-shared' on this\r
- # platform.\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~\r
- $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$rm $lib.exp'\r
-\r
- # Commands to make compiler produce verbose output that lists\r
- # what "hidden" libraries, object files and flags are used when\r
- # linking a shared library.\r
- output_verbose_link_cmd="$CC -G $CFLAGS -v conftest.$objext 2>&1 | grep \"\-L\""\r
- fi\r
-\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $wl$libdir'\r
- fi\r
- ;;\r
- esac\r
- ;;\r
- sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[[78]]* | unixware7*)\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
- ;;\r
- tandem*)\r
- case $cc_basename in\r
- NCC)\r
- # NonStop-UX NCC 3.20\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- *)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- esac\r
- ;;\r
- vxworks*)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- *)\r
- # FIXME: insert proper C++ library support\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
-esac\r
-AC_MSG_RESULT([$_LT_AC_TAGVAR(ld_shlibs, $1)])\r
-test "$_LT_AC_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no\r
-\r
-_LT_AC_TAGVAR(GCC, $1)="$GXX"\r
-_LT_AC_TAGVAR(LD, $1)="$LD"\r
-\r
-## CAVEAT EMPTOR:\r
-## There is no encapsulation within the following macros, do not change\r
-## the running order or otherwise move them around unless you know exactly\r
-## what you are doing...\r
-AC_LIBTOOL_POSTDEP_PREDEP($1)\r
-AC_LIBTOOL_PROG_COMPILER_PIC($1)\r
-AC_LIBTOOL_PROG_CC_C_O($1)\r
-AC_LIBTOOL_SYS_HARD_LINK_LOCKS($1)\r
-AC_LIBTOOL_PROG_LD_SHLIBS($1)\r
-AC_LIBTOOL_SYS_DYNAMIC_LINKER($1)\r
-AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH($1)\r
-AC_LIBTOOL_SYS_LIB_STRIP\r
-AC_LIBTOOL_DLOPEN_SELF($1)\r
-\r
-AC_LIBTOOL_CONFIG($1)\r
-\r
-AC_LANG_POP\r
-CC=$lt_save_CC\r
-LDCXX=$LD\r
-LD=$lt_save_LD\r
-GCC=$lt_save_GCC\r
-with_gnu_ldcxx=$with_gnu_ld\r
-with_gnu_ld=$lt_save_with_gnu_ld\r
-lt_cv_path_LDCXX=$lt_cv_path_LD\r
-lt_cv_path_LD=$lt_save_path_LD\r
-lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld\r
-lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld\r
-])# AC_LIBTOOL_LANG_CXX_CONFIG\r
-\r
-# AC_LIBTOOL_POSTDEP_PREDEP([TAGNAME])\r
-# ------------------------\r
-# Figure out "hidden" library dependencies from verbose\r
-# compiler output when linking a shared library.\r
-# Parse the compiler output and extract the necessary\r
-# objects, libraries and library flags.\r
-AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP],[\r
-dnl we can't use the lt_simple_compile_test_code here,\r
-dnl because it contains code intended for an executable,\r
-dnl not a library. It's possible we should let each\r
-dnl tag define a new lt_????_link_test_code variable,\r
-dnl but it's only used here...\r
-ifelse([$1],[],[cat > conftest.$ac_ext <<EOF\r
-int a;\r
-void foo (void) { a = 0; }\r
-EOF\r
-],[$1],[CXX],[cat > conftest.$ac_ext <<EOF\r
-class Foo\r
-{\r
-public:\r
- Foo (void) { a = 0; }\r
-private:\r
- int a;\r
-};\r
-EOF\r
-],[$1],[F77],[cat > conftest.$ac_ext <<EOF\r
- subroutine foo\r
- implicit none\r
- integer*4 a\r
- a=0\r
- return\r
- end\r
-EOF\r
-],[$1],[GCJ],[cat > conftest.$ac_ext <<EOF\r
-public class foo {\r
- private int a;\r
- public void bar (void) {\r
- a = 0;\r
- }\r
-};\r
-EOF\r
-])\r
-dnl Parse the compiler output and extract the necessary\r
-dnl objects, libraries and library flags.\r
-if AC_TRY_EVAL(ac_compile); then\r
- # Parse the compiler output and extract the necessary\r
- # objects, libraries and library flags.\r
-\r
- # Sentinel used to keep track of whether or not we are before\r
- # the conftest object file.\r
- pre_test_object_deps_done=no\r
-\r
- # The `*' in the case matches for architectures that use `case' in\r
- # $output_verbose_cmd can trigger glob expansion during the loop\r
- # eval without this substitution.\r
- output_verbose_link_cmd="`$echo \"X$output_verbose_link_cmd\" | $Xsed -e \"$no_glob_subst\"`"\r
-\r
- for p in `eval $output_verbose_link_cmd`; do\r
- case $p in\r
-\r
- -L* | -R* | -l*)\r
- # Some compilers place space between "-{L,R}" and the path.\r
- # Remove the space.\r
- if test $p = "-L" \\r
- || test $p = "-R"; then\r
- prev=$p\r
- continue\r
- else\r
- prev=\r
- fi\r
-\r
- if test "$pre_test_object_deps_done" = no; then\r
- case $p in\r
- -L* | -R*)\r
- # Internal compiler library paths should come after those\r
- # provided the user. The postdeps already come after the\r
- # user supplied libs so there is no need to process them.\r
- if test -z "$_LT_AC_TAGVAR(compiler_lib_search_path, $1)"; then\r
- _LT_AC_TAGVAR(compiler_lib_search_path, $1)="${prev}${p}"\r
- else\r
- _LT_AC_TAGVAR(compiler_lib_search_path, $1)="${_LT_AC_TAGVAR(compiler_lib_search_path, $1)} ${prev}${p}"\r
- fi\r
- ;;\r
- # The "-l" case would never come before the object being\r
- # linked, so don't bother handling this case.\r
- esac\r
- else\r
- if test -z "$_LT_AC_TAGVAR(postdeps, $1)"; then\r
- _LT_AC_TAGVAR(postdeps, $1)="${prev}${p}"\r
- else\r
- _LT_AC_TAGVAR(postdeps, $1)="${_LT_AC_TAGVAR(postdeps, $1)} ${prev}${p}"\r
- fi\r
- fi\r
- ;;\r
-\r
- *.$objext)\r
- # This assumes that the test object file only shows up\r
- # once in the compiler output.\r
- if test "$p" = "conftest.$objext"; then\r
- pre_test_object_deps_done=yes\r
- continue\r
- fi\r
-\r
- if test "$pre_test_object_deps_done" = no; then\r
- if test -z "$_LT_AC_TAGVAR(predep_objects, $1)"; then\r
- _LT_AC_TAGVAR(predep_objects, $1)="$p"\r
- else\r
- _LT_AC_TAGVAR(predep_objects, $1)="$_LT_AC_TAGVAR(predep_objects, $1) $p"\r
- fi\r
- else\r
- if test -z "$_LT_AC_TAGVAR(postdep_objects, $1)"; then\r
- _LT_AC_TAGVAR(postdep_objects, $1)="$p"\r
- else\r
- _LT_AC_TAGVAR(postdep_objects, $1)="$_LT_AC_TAGVAR(postdep_objects, $1) $p"\r
- fi\r
- fi\r
- ;;\r
-\r
- *) ;; # Ignore the rest.\r
-\r
- esac\r
- done\r
-\r
- # Clean up.\r
- rm -f a.out a.exe\r
-else\r
- echo "libtool.m4: error: problem compiling $1 test program"\r
-fi\r
-\r
-$rm -f confest.$objext\r
-\r
-case " $_LT_AC_TAGVAR(postdeps, $1) " in\r
-*" -lc "*) _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no ;;\r
-esac\r
-])# AC_LIBTOOL_POSTDEP_PREDEP\r
-\r
-# AC_LIBTOOL_LANG_F77_CONFIG\r
-# ------------------------\r
-# Ensure that the configuration vars for the C compiler are\r
-# suitably defined. Those variables are subsequently used by\r
-# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.\r
-AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG], [_LT_AC_LANG_F77_CONFIG(F77)])\r
-AC_DEFUN([_LT_AC_LANG_F77_CONFIG],\r
-[AC_REQUIRE([AC_PROG_F77])\r
-AC_LANG_PUSH(Fortran 77)\r
-\r
-_LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
-_LT_AC_TAGVAR(allow_undefined_flag, $1)=\r
-_LT_AC_TAGVAR(always_export_symbols, $1)=no\r
-_LT_AC_TAGVAR(archive_expsym_cmds, $1)=\r
-_LT_AC_TAGVAR(export_dynamic_flag_spec, $1)=\r
-_LT_AC_TAGVAR(hardcode_direct, $1)=no\r
-_LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=\r
-_LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)=\r
-_LT_AC_TAGVAR(hardcode_libdir_separator, $1)=\r
-_LT_AC_TAGVAR(hardcode_minus_L, $1)=no\r
-_LT_AC_TAGVAR(hardcode_automatic, $1)=no\r
-_LT_AC_TAGVAR(module_cmds, $1)=\r
-_LT_AC_TAGVAR(module_expsym_cmds, $1)=\r
-_LT_AC_TAGVAR(link_all_deplibs, $1)=unknown\r
-_LT_AC_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds\r
-_LT_AC_TAGVAR(no_undefined_flag, $1)=\r
-_LT_AC_TAGVAR(whole_archive_flag_spec, $1)=\r
-_LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=no\r
-\r
-# Source file extension for f77 test sources.\r
-ac_ext=f\r
-\r
-# Object file extension for compiled f77 test sources.\r
-objext=o\r
-_LT_AC_TAGVAR(objext, $1)=$objext\r
-\r
-# Code to be used in simple compile tests\r
-lt_simple_compile_test_code=" subroutine t\n return\n end\n"\r
-\r
-# Code to be used in simple link tests\r
-lt_simple_link_test_code=" program t\n end\n"\r
-\r
-# ltmain only uses $CC for tagged configurations so make sure $CC is set.\r
-_LT_AC_SYS_COMPILER\r
-\r
-# Allow CC to be a program name with arguments.\r
-lt_save_CC="$CC"\r
-CC=${F77-"f77"}\r
-compiler=$CC\r
-_LT_AC_TAGVAR(compiler, $1)=$CC\r
-cc_basename=`$echo X"$compiler" | $Xsed -e 's%^.*/%%'`\r
-\r
-AC_MSG_CHECKING([if libtool supports shared libraries])\r
-AC_MSG_RESULT([$can_build_shared])\r
-\r
-AC_MSG_CHECKING([whether to build shared libraries])\r
-test "$can_build_shared" = "no" && enable_shared=no\r
-\r
-# On AIX, shared libraries and static libraries use the same namespace, and\r
-# are all built from PIC.\r
-case "$host_os" in\r
-aix3*)\r
- test "$enable_shared" = yes && enable_static=no\r
- if test -n "$RANLIB"; then\r
- archive_cmds="$archive_cmds~\$RANLIB \$lib"\r
- postinstall_cmds='$RANLIB $lib'\r
- fi\r
- ;;\r
-aix4* | aix5*)\r
- test "$enable_shared" = yes && enable_static=no\r
- ;;\r
-esac\r
-AC_MSG_RESULT([$enable_shared])\r
-\r
-AC_MSG_CHECKING([whether to build static libraries])\r
-# Make sure either enable_shared or enable_static is yes.\r
-test "$enable_shared" = yes || enable_static=yes\r
-AC_MSG_RESULT([$enable_static])\r
-\r
-test "$_LT_AC_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no\r
-\r
-_LT_AC_TAGVAR(GCC, $1)="$G77"\r
-_LT_AC_TAGVAR(LD, $1)="$LD"\r
-\r
-AC_LIBTOOL_PROG_COMPILER_PIC($1)\r
-AC_LIBTOOL_PROG_CC_C_O($1)\r
-AC_LIBTOOL_SYS_HARD_LINK_LOCKS($1)\r
-AC_LIBTOOL_PROG_LD_SHLIBS($1)\r
-AC_LIBTOOL_SYS_DYNAMIC_LINKER($1)\r
-AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH($1)\r
-AC_LIBTOOL_SYS_LIB_STRIP\r
-\r
-\r
-AC_LIBTOOL_CONFIG($1)\r
-\r
-AC_LANG_POP\r
-CC="$lt_save_CC"\r
-])# AC_LIBTOOL_LANG_F77_CONFIG\r
-\r
-\r
-# AC_LIBTOOL_LANG_GCJ_CONFIG\r
-# --------------------------\r
-# Ensure that the configuration vars for the C compiler are\r
-# suitably defined. Those variables are subsequently used by\r
-# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.\r
-AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG], [_LT_AC_LANG_GCJ_CONFIG(GCJ)])\r
-AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG],\r
-[AC_LANG_SAVE\r
-\r
-# Source file extension for Java test sources.\r
-ac_ext=java\r
-\r
-# Object file extension for compiled Java test sources.\r
-objext=o\r
-_LT_AC_TAGVAR(objext, $1)=$objext\r
-\r
-# Code to be used in simple compile tests\r
-lt_simple_compile_test_code="class foo {}\n"\r
-\r
-# Code to be used in simple link tests\r
-lt_simple_link_test_code='public class conftest { public static void main(String[] argv) {}; }\n'\r
-\r
-# ltmain only uses $CC for tagged configurations so make sure $CC is set.\r
-_LT_AC_SYS_COMPILER\r
-\r
-# Allow CC to be a program name with arguments.\r
-lt_save_CC="$CC"\r
-CC=${GCJ-"gcj"}\r
-compiler=$CC\r
-_LT_AC_TAGVAR(compiler, $1)=$CC\r
-\r
-# GCJ did not exist at the time GCC didn't implicitly link libc in.\r
-_LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
-\r
-## CAVEAT EMPTOR:\r
-## There is no encapsulation within the following macros, do not change\r
-## the running order or otherwise move them around unless you know exactly\r
-## what you are doing...\r
-AC_LIBTOOL_PROG_COMPILER_NO_RTTI($1)\r
-AC_LIBTOOL_PROG_COMPILER_PIC($1)\r
-AC_LIBTOOL_PROG_CC_C_O($1)\r
-AC_LIBTOOL_SYS_HARD_LINK_LOCKS($1)\r
-AC_LIBTOOL_PROG_LD_SHLIBS($1)\r
-AC_LIBTOOL_SYS_DYNAMIC_LINKER($1)\r
-AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH($1)\r
-AC_LIBTOOL_SYS_LIB_STRIP\r
-AC_LIBTOOL_DLOPEN_SELF($1)\r
-\r
-AC_LIBTOOL_CONFIG($1)\r
-\r
-AC_LANG_RESTORE\r
-CC="$lt_save_CC"\r
-])# AC_LIBTOOL_LANG_GCJ_CONFIG\r
-\r
-\r
-# AC_LIBTOOL_LANG_RC_CONFIG\r
-# --------------------------\r
-# Ensure that the configuration vars for the Windows resource compiler are\r
-# suitably defined. Those variables are subsequently used by\r
-# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.\r
-AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG], [_LT_AC_LANG_RC_CONFIG(RC)])\r
-AC_DEFUN([_LT_AC_LANG_RC_CONFIG],\r
-[AC_LANG_SAVE\r
-\r
-# Source file extension for RC test sources.\r
-ac_ext=rc\r
-\r
-# Object file extension for compiled RC test sources.\r
-objext=o\r
-_LT_AC_TAGVAR(objext, $1)=$objext\r
-\r
-# Code to be used in simple compile tests\r
-lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }\n'\r
-\r
-# Code to be used in simple link tests\r
-lt_simple_link_test_code="$lt_simple_compile_test_code"\r
-\r
-# ltmain only uses $CC for tagged configurations so make sure $CC is set.\r
-_LT_AC_SYS_COMPILER\r
-\r
-# Allow CC to be a program name with arguments.\r
-lt_save_CC="$CC"\r
-CC=${RC-"windres"}\r
-compiler=$CC\r
-_LT_AC_TAGVAR(compiler, $1)=$CC\r
-_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes\r
-\r
-AC_LIBTOOL_CONFIG($1)\r
-\r
-AC_LANG_RESTORE\r
-CC="$lt_save_CC"\r
-])# AC_LIBTOOL_LANG_RC_CONFIG\r
-\r
-\r
-# AC_LIBTOOL_CONFIG([TAGNAME])\r
-# ----------------------------\r
-# If TAGNAME is not passed, then create an initial libtool script\r
-# with a default configuration from the untagged config vars. Otherwise\r
-# add code to config.status for appending the configuration named by\r
-# TAGNAME from the matching tagged config vars.\r
-AC_DEFUN([AC_LIBTOOL_CONFIG],\r
-[# The else clause should only fire when bootstrapping the\r
-# libtool distribution, otherwise you forgot to ship ltmain.sh\r
-# with your package, and you will get complaints that there are\r
-# no rules to generate ltmain.sh.\r
-if test -f "$ltmain"; then\r
- # See if we are running on zsh, and set the options which allow our commands through\r
- # without removal of \ escapes.\r
- if test -n "${ZSH_VERSION+set}" ; then\r
- setopt NO_GLOB_SUBST\r
- fi\r
- # Now quote all the things that may contain metacharacters while being\r
- # careful not to overquote the AC_SUBSTed values. We take copies of the\r
- # variables and quote the copies for generation of the libtool script.\r
- for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC NM \\r
- SED SHELL STRIP \\r
- libname_spec library_names_spec soname_spec extract_expsyms_cmds \\r
- old_striplib striplib file_magic_cmd finish_cmds finish_eval \\r
- deplibs_check_method reload_flag reload_cmds need_locks \\r
- lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \\r
- lt_cv_sys_global_symbol_to_c_name_address \\r
- sys_lib_search_path_spec sys_lib_dlsearch_path_spec \\r
- old_postinstall_cmds old_postuninstall_cmds \\r
- _LT_AC_TAGVAR(compiler, $1) \\r
- _LT_AC_TAGVAR(CC, $1) \\r
- _LT_AC_TAGVAR(LD, $1) \\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1) \\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1) \\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1) \\r
- _LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) \\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1) \\r
- _LT_AC_TAGVAR(thread_safe_flag_spec, $1) \\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1) \\r
- _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1) \\r
- _LT_AC_TAGVAR(old_archive_cmds, $1) \\r
- _LT_AC_TAGVAR(old_archive_from_new_cmds, $1) \\r
- _LT_AC_TAGVAR(predep_objects, $1) \\r
- _LT_AC_TAGVAR(postdep_objects, $1) \\r
- _LT_AC_TAGVAR(predeps, $1) \\r
- _LT_AC_TAGVAR(postdeps, $1) \\r
- _LT_AC_TAGVAR(compiler_lib_search_path, $1) \\r
- _LT_AC_TAGVAR(archive_cmds, $1) \\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1) \\r
- _LT_AC_TAGVAR(postinstall_cmds, $1) \\r
- _LT_AC_TAGVAR(postuninstall_cmds, $1) \\r
- _LT_AC_TAGVAR(old_archive_from_expsyms_cmds, $1) \\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1) \\r
- _LT_AC_TAGVAR(no_undefined_flag, $1) \\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1) \\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1) \\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1) \\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1) \\r
- _LT_AC_TAGVAR(hardcode_automatic, $1) \\r
- _LT_AC_TAGVAR(module_cmds, $1) \\r
- _LT_AC_TAGVAR(module_expsym_cmds, $1) \\r
- _LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1) \\r
- _LT_AC_TAGVAR(exclude_expsyms, $1) \\r
- _LT_AC_TAGVAR(include_expsyms, $1); do\r
-\r
- case $var in\r
- _LT_AC_TAGVAR(old_archive_cmds, $1) | \\r
- _LT_AC_TAGVAR(old_archive_from_new_cmds, $1) | \\r
- _LT_AC_TAGVAR(archive_cmds, $1) | \\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1) | \\r
- _LT_AC_TAGVAR(module_cmds, $1) | \\r
- _LT_AC_TAGVAR(module_expsym_cmds, $1) | \\r
- _LT_AC_TAGVAR(old_archive_from_expsyms_cmds, $1) | \\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1) | \\r
- extract_expsyms_cmds | reload_cmds | finish_cmds | \\r
- postinstall_cmds | postuninstall_cmds | \\r
- old_postinstall_cmds | old_postuninstall_cmds | \\r
- sys_lib_search_path_spec | sys_lib_dlsearch_path_spec)\r
- # Double-quote double-evaled strings.\r
- eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\""\r
- ;;\r
- *)\r
- eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\""\r
- ;;\r
- esac\r
- done\r
-\r
- case $lt_echo in\r
- *'\[$]0 --fallback-echo"')\r
- lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\[$]0 --fallback-echo"[$]/[$]0 --fallback-echo"/'`\r
- ;;\r
- esac\r
-\r
-ifelse([$1], [],\r
- [cfgfile="${ofile}T"\r
- trap "$rm \"$cfgfile\"; exit 1" 1 2 15\r
- $rm -f "$cfgfile"\r
- AC_MSG_NOTICE([creating $ofile])],\r
- [cfgfile="$ofile"])\r
-\r
- cat <<__EOF__ >> "$cfgfile"\r
-ifelse([$1], [],\r
-[#! $SHELL\r
-\r
-# `$echo "$cfgfile" | sed 's%^.*/%%'` - Provide generalized library-building support services.\r
-# Generated automatically by $PROGRAM (GNU $PACKAGE $VERSION$TIMESTAMP)\r
-# NOTE: Changes made to this file will be lost: look at ltmain.sh.\r
-#\r
-# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001\r
-# Free Software Foundation, Inc.\r
-#\r
-# This file is part of GNU Libtool:\r
-# Originally by Gordon Matzigkeit <gord@gnu.ai.mit.edu>, 1996\r
-#\r
-# This program is free software; you can redistribute it and/or modify\r
-# it under the terms of the GNU General Public License as published by\r
-# the Free Software Foundation; either version 2 of the License, or\r
-# (at your option) any later version.\r
-#\r
-# This program is distributed in the hope that it will be useful, but\r
-# WITHOUT ANY WARRANTY; without even the implied warranty of\r
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
-# General Public License for more details.\r
-#\r
-# You should have received a copy of the GNU General Public License\r
-# along with this program; if not, write to the Free Software\r
-# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\r
-#\r
-# As a special exception to the GNU General Public License, if you\r
-# distribute this file as part of a program that contains a\r
-# configuration script generated by Autoconf, you may include it under\r
-# the same distribution terms that you use for the rest of that program.\r
-\r
-# A sed program that does not truncate output.\r
-SED=$lt_SED\r
-\r
-# Sed that helps us avoid accidentally triggering echo(1) options like -n.\r
-Xsed="$SED -e s/^X//"\r
-\r
-# The HP-UX ksh and POSIX shell print the target directory to stdout\r
-# if CDPATH is set.\r
-if test "X\${CDPATH+set}" = Xset; then CDPATH=:; export CDPATH; fi\r
-\r
-# The names of the tagged configurations supported by this script.\r
-available_tags=\r
-\r
-# ### BEGIN LIBTOOL CONFIG],\r
-[# ### BEGIN LIBTOOL TAG CONFIG: $tagname])\r
-\r
-# Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`:\r
-\r
-# Shell to use when invoking shell scripts.\r
-SHELL=$lt_SHELL\r
-\r
-# Whether or not to build shared libraries.\r
-build_libtool_libs=$enable_shared\r
-\r
-# Whether or not to build static libraries.\r
-build_old_libs=$enable_static\r
-\r
-# Whether or not to add -lc for building shared libraries.\r
-build_libtool_need_lc=$_LT_AC_TAGVAR(archive_cmds_need_lc, $1)\r
-\r
-# Whether or not to disallow shared libs when runtime libs are static\r
-allow_libtool_libs_with_static_runtimes=$_LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)\r
-\r
-# Whether or not to optimize for fast installation.\r
-fast_install=$enable_fast_install\r
-\r
-# The host system.\r
-host_alias=$host_alias\r
-host=$host\r
-\r
-# An echo program that does not interpret backslashes.\r
-echo=$lt_echo\r
-\r
-# The archiver.\r
-AR=$lt_AR\r
-AR_FLAGS=$lt_AR_FLAGS\r
-\r
-# A C compiler.\r
-LTCC=$lt_LTCC\r
-\r
-# A language-specific compiler.\r
-CC=$lt_[]_LT_AC_TAGVAR(compiler, $1)\r
-\r
-# Is the compiler the GNU C compiler?\r
-with_gcc=$_LT_AC_TAGVAR(GCC, $1)\r
-\r
-# An ERE matcher.\r
-EGREP=$lt_EGREP\r
-\r
-# The linker used to build libraries.\r
-LD=$lt_[]_LT_AC_TAGVAR(LD, $1)\r
-\r
-# Whether we need hard or soft links.\r
-LN_S=$lt_LN_S\r
-\r
-# A BSD-compatible nm program.\r
-NM=$lt_NM\r
-\r
-# A symbol stripping program\r
-STRIP=$lt_STRIP\r
-\r
-# Used to examine libraries when file_magic_cmd begins "file"\r
-MAGIC_CMD=$MAGIC_CMD\r
-\r
-# Used on cygwin: DLL creation program.\r
-DLLTOOL="$DLLTOOL"\r
-\r
-# Used on cygwin: object dumper.\r
-OBJDUMP="$OBJDUMP"\r
-\r
-# Used on cygwin: assembler.\r
-AS="$AS"\r
-\r
-# The name of the directory that contains temporary libtool files.\r
-objdir=$objdir\r
-\r
-# How to create reloadable object files.\r
-reload_flag=$lt_reload_flag\r
-reload_cmds=$lt_reload_cmds\r
-\r
-# How to pass a linker flag through the compiler.\r
-wl=$lt_[]_LT_AC_TAGVAR(lt_prog_compiler_wl, $1)\r
-\r
-# Object file suffix (normally "o").\r
-objext="$ac_objext"\r
-\r
-# Old archive suffix (normally "a").\r
-libext="$libext"\r
-\r
-# Shared library suffix (normally ".so").\r
-shrext_cmds='$shrext_cmds'\r
-\r
-# Executable file suffix (normally "").\r
-exeext="$exeext"\r
-\r
-# Additional compiler flags for building library objects.\r
-pic_flag=$lt_[]_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)\r
-pic_mode=$pic_mode\r
-\r
-# What is the maximum length of a command?\r
-max_cmd_len=$lt_cv_sys_max_cmd_len\r
-\r
-# Does compiler simultaneously support -c and -o options?\r
-compiler_c_o=$lt_[]_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)\r
-\r
-# Must we lock files when doing compilation ?\r
-need_locks=$lt_need_locks\r
-\r
-# Do we need the lib prefix for modules?\r
-need_lib_prefix=$need_lib_prefix\r
-\r
-# Do we need a version for libraries?\r
-need_version=$need_version\r
-\r
-# Whether dlopen is supported.\r
-dlopen_support=$enable_dlopen\r
-\r
-# Whether dlopen of programs is supported.\r
-dlopen_self=$enable_dlopen_self\r
-\r
-# Whether dlopen of statically linked programs is supported.\r
-dlopen_self_static=$enable_dlopen_self_static\r
-\r
-# Compiler flag to prevent dynamic linking.\r
-link_static_flag=$lt_[]_LT_AC_TAGVAR(lt_prog_compiler_static, $1)\r
-\r
-# Compiler flag to turn off builtin functions.\r
-no_builtin_flag=$lt_[]_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)\r
-\r
-# Compiler flag to allow reflexive dlopens.\r
-export_dynamic_flag_spec=$lt_[]_LT_AC_TAGVAR(export_dynamic_flag_spec, $1)\r
-\r
-# Compiler flag to generate shared objects directly from archives.\r
-whole_archive_flag_spec=$lt_[]_LT_AC_TAGVAR(whole_archive_flag_spec, $1)\r
-\r
-# Compiler flag to generate thread-safe objects.\r
-thread_safe_flag_spec=$lt_[]_LT_AC_TAGVAR(thread_safe_flag_spec, $1)\r
-\r
-# Library versioning type.\r
-version_type=$version_type\r
-\r
-# Format of library name prefix.\r
-libname_spec=$lt_libname_spec\r
-\r
-# List of archive names. First name is the real one, the rest are links.\r
-# The last name is the one that the linker finds with -lNAME.\r
-library_names_spec=$lt_library_names_spec\r
-\r
-# The coded name of the library, if different from the real name.\r
-soname_spec=$lt_soname_spec\r
-\r
-# Commands used to build and install an old-style archive.\r
-RANLIB=$lt_RANLIB\r
-old_archive_cmds=$lt_[]_LT_AC_TAGVAR(old_archive_cmds, $1)\r
-old_postinstall_cmds=$lt_old_postinstall_cmds\r
-old_postuninstall_cmds=$lt_old_postuninstall_cmds\r
-\r
-# Create an old-style archive from a shared archive.\r
-old_archive_from_new_cmds=$lt_[]_LT_AC_TAGVAR(old_archive_from_new_cmds, $1)\r
-\r
-# Create a temporary old-style archive to link instead of a shared archive.\r
-old_archive_from_expsyms_cmds=$lt_[]_LT_AC_TAGVAR(old_archive_from_expsyms_cmds, $1)\r
-\r
-# Commands used to build and install a shared archive.\r
-archive_cmds=$lt_[]_LT_AC_TAGVAR(archive_cmds, $1)\r
-archive_expsym_cmds=$lt_[]_LT_AC_TAGVAR(archive_expsym_cmds, $1)\r
-postinstall_cmds=$lt_postinstall_cmds\r
-postuninstall_cmds=$lt_postuninstall_cmds\r
-\r
-# Commands used to build a loadable module (assumed same as above if empty)\r
-module_cmds=$lt_[]_LT_AC_TAGVAR(module_cmds, $1)\r
-module_expsym_cmds=$lt_[]_LT_AC_TAGVAR(module_expsym_cmds, $1)\r
-\r
-# Commands to strip libraries.\r
-old_striplib=$lt_old_striplib\r
-striplib=$lt_striplib\r
-\r
-# Dependencies to place before the objects being linked to create a\r
-# shared library.\r
-predep_objects=$lt_[]_LT_AC_TAGVAR(predep_objects, $1)\r
-\r
-# Dependencies to place after the objects being linked to create a\r
-# shared library.\r
-postdep_objects=$lt_[]_LT_AC_TAGVAR(postdep_objects, $1)\r
-\r
-# Dependencies to place before the objects being linked to create a\r
-# shared library.\r
-predeps=$lt_[]_LT_AC_TAGVAR(predeps, $1)\r
-\r
-# Dependencies to place after the objects being linked to create a\r
-# shared library.\r
-postdeps=$lt_[]_LT_AC_TAGVAR(postdeps, $1)\r
-\r
-# The library search path used internally by the compiler when linking\r
-# a shared library.\r
-compiler_lib_search_path=$lt_[]_LT_AC_TAGVAR(compiler_lib_search_path, $1)\r
-\r
-# Method to check whether dependent libraries are shared objects.\r
-deplibs_check_method=$lt_deplibs_check_method\r
-\r
-# Command to use when deplibs_check_method == file_magic.\r
-file_magic_cmd=$lt_file_magic_cmd\r
-\r
-# Flag that allows shared libraries with undefined symbols to be built.\r
-allow_undefined_flag=$lt_[]_LT_AC_TAGVAR(allow_undefined_flag, $1)\r
-\r
-# Flag that forces no undefined symbols.\r
-no_undefined_flag=$lt_[]_LT_AC_TAGVAR(no_undefined_flag, $1)\r
-\r
-# Commands used to finish a libtool library installation in a directory.\r
-finish_cmds=$lt_finish_cmds\r
-\r
-# Same as above, but a single script fragment to be evaled but not shown.\r
-finish_eval=$lt_finish_eval\r
-\r
-# Take the output of nm and produce a listing of raw symbols and C names.\r
-global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe\r
-\r
-# Transform the output of nm in a proper C declaration\r
-global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl\r
-\r
-# Transform the output of nm in a C name address pair\r
-global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address\r
-\r
-# This is the shared library runtime path variable.\r
-runpath_var=$runpath_var\r
-\r
-# This is the shared library path variable.\r
-shlibpath_var=$shlibpath_var\r
-\r
-# Is shlibpath searched before the hard-coded library search path?\r
-shlibpath_overrides_runpath=$shlibpath_overrides_runpath\r
-\r
-# How to hardcode a shared library path into an executable.\r
-hardcode_action=$_LT_AC_TAGVAR(hardcode_action, $1)\r
-\r
-# Whether we should hardcode library paths into libraries.\r
-hardcode_into_libs=$hardcode_into_libs\r
-\r
-# Flag to hardcode \$libdir into a binary during linking.\r
-# This must work even if \$libdir does not exist.\r
-hardcode_libdir_flag_spec=$lt_[]_LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)\r
-\r
-# If ld is used when linking, flag to hardcode \$libdir into\r
-# a binary during linking. This must work even if \$libdir does\r
-# not exist.\r
-hardcode_libdir_flag_spec_ld=$lt_[]_LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)\r
-\r
-# Whether we need a single -rpath flag with a separated argument.\r
-hardcode_libdir_separator=$lt_[]_LT_AC_TAGVAR(hardcode_libdir_separator, $1)\r
-\r
-# Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the\r
-# resulting binary.\r
-hardcode_direct=$_LT_AC_TAGVAR(hardcode_direct, $1)\r
-\r
-# Set to yes if using the -LDIR flag during linking hardcodes DIR into the\r
-# resulting binary.\r
-hardcode_minus_L=$_LT_AC_TAGVAR(hardcode_minus_L, $1)\r
-\r
-# Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into\r
-# the resulting binary.\r
-hardcode_shlibpath_var=$_LT_AC_TAGVAR(hardcode_shlibpath_var, $1)\r
-\r
-# Set to yes if building a shared library automatically hardcodes DIR into the library\r
-# and all subsequent libraries and executables linked against it.\r
-hardcode_automatic=$_LT_AC_TAGVAR(hardcode_automatic, $1)\r
-\r
-# Variables whose values should be saved in libtool wrapper scripts and\r
-# restored at relink time.\r
-variables_saved_for_relink="$variables_saved_for_relink"\r
-\r
-# Whether libtool must link a program against all its dependency libraries.\r
-link_all_deplibs=$_LT_AC_TAGVAR(link_all_deplibs, $1)\r
-\r
-# Compile-time system search path for libraries\r
-sys_lib_search_path_spec=$lt_sys_lib_search_path_spec\r
-\r
-# Run-time system search path for libraries\r
-sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec\r
-\r
-# Fix the shell variable \$srcfile for the compiler.\r
-fix_srcfile_path="$_LT_AC_TAGVAR(fix_srcfile_path, $1)"\r
-\r
-# Set to yes if exported symbols are required.\r
-always_export_symbols=$_LT_AC_TAGVAR(always_export_symbols, $1)\r
-\r
-# The commands to list exported symbols.\r
-export_symbols_cmds=$lt_[]_LT_AC_TAGVAR(export_symbols_cmds, $1)\r
-\r
-# The commands to extract the exported symbol list from a shared archive.\r
-extract_expsyms_cmds=$lt_extract_expsyms_cmds\r
-\r
-# Symbols that should not be listed in the preloaded symbols.\r
-exclude_expsyms=$lt_[]_LT_AC_TAGVAR(exclude_expsyms, $1)\r
-\r
-# Symbols that must always be exported.\r
-include_expsyms=$lt_[]_LT_AC_TAGVAR(include_expsyms, $1)\r
-\r
-ifelse([$1],[],\r
-[# ### END LIBTOOL CONFIG],\r
-[# ### END LIBTOOL TAG CONFIG: $tagname])\r
-\r
-__EOF__\r
-\r
-ifelse([$1],[], [\r
- case $host_os in\r
- aix3*)\r
- cat <<\EOF >> "$cfgfile"\r
-\r
-# AIX sometimes has problems with the GCC collect2 program. For some\r
-# reason, if we set the COLLECT_NAMES environment variable, the problems\r
-# vanish in a puff of smoke.\r
-if test "X${COLLECT_NAMES+set}" != Xset; then\r
- COLLECT_NAMES=\r
- export COLLECT_NAMES\r
-fi\r
-EOF\r
- ;;\r
- esac\r
-\r
- # We use sed instead of cat because bash on DJGPP gets confused if\r
- # if finds mixed CR/LF and LF-only lines. Since sed operates in\r
- # text mode, it properly converts lines to CR/LF. This bash problem\r
- # is reportedly fixed, but why not run on old versions too?\r
- sed '$q' "$ltmain" >> "$cfgfile" || (rm -f "$cfgfile"; exit 1)\r
-\r
- mv -f "$cfgfile" "$ofile" || \\r
- (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile")\r
- chmod +x "$ofile"\r
-])\r
-else\r
- # If there is no Makefile yet, we rely on a make rule to execute\r
- # `config.status --recheck' to rerun these tests and create the\r
- # libtool script then.\r
- ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'`\r
- if test -f "$ltmain_in"; then\r
- test -f Makefile && make "$ltmain"\r
- fi\r
-fi\r
-])# AC_LIBTOOL_CONFIG\r
-\r
-\r
-# AC_LIBTOOL_PROG_COMPILER_NO_RTTI([TAGNAME])\r
-# -------------------------------------------\r
-AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI],\r
-[AC_REQUIRE([_LT_AC_SYS_COMPILER])dnl\r
-\r
-_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=\r
-\r
-if test "$GCC" = yes; then\r
- _LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin'\r
-\r
- AC_LIBTOOL_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions],\r
- lt_cv_prog_compiler_rtti_exceptions,\r
- [-fno-rtti -fno-exceptions], [],\r
- [_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"])\r
-fi\r
-])# AC_LIBTOOL_PROG_COMPILER_NO_RTTI\r
-\r
-\r
-# AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE\r
-# ---------------------------------\r
-AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE],\r
-[AC_REQUIRE([AC_CANONICAL_HOST])\r
-AC_REQUIRE([AC_PROG_NM])\r
-AC_REQUIRE([AC_OBJEXT])\r
-# Check for command to grab the raw symbol name followed by C symbol from nm.\r
-AC_MSG_CHECKING([command to parse $NM output from $compiler object])\r
-AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe],\r
-[\r
-# These are sane defaults that work on at least a few old systems.\r
-# [They come from Ultrix. What could be older than Ultrix?!! ;)]\r
-\r
-# Character class describing NM global symbol codes.\r
-symcode='[[BCDEGRST]]'\r
-\r
-# Regexp to match symbols that can be accessed directly from C.\r
-sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)'\r
-\r
-# Transform the above into a raw symbol and a C symbol.\r
-symxfrm='\1 \2\3 \3'\r
-\r
-# Transform an extracted symbol line into a proper C declaration\r
-lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^. .* \(.*\)$/extern int \1;/p'"\r
-\r
-# Transform an extracted symbol line into symbol name and symbol address\r
-lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (lt_ptr) 0},/p' -e 's/^$symcode \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (lt_ptr) \&\2},/p'"\r
-\r
-# Define system-specific variables.\r
-case $host_os in\r
-aix*)\r
- symcode='[[BCDT]]'\r
- ;;\r
-cygwin* | mingw* | pw32*)\r
- symcode='[[ABCDGISTW]]'\r
- ;;\r
-hpux*) # Its linker distinguishes data from code symbols\r
- if test "$host_cpu" = ia64; then\r
- symcode='[[ABCDEGRST]]'\r
- fi\r
- lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'"\r
- lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (lt_ptr) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (lt_ptr) \&\2},/p'"\r
- ;;\r
-irix* | nonstopux*)\r
- symcode='[[BCDEGRST]]'\r
- ;;\r
-osf*)\r
- symcode='[[BCDEGQRST]]'\r
- ;;\r
-solaris* | sysv5*)\r
- symcode='[[BDRT]]'\r
- ;;\r
-sysv4)\r
- symcode='[[DFNSTU]]'\r
- ;;\r
-esac\r
-\r
-# Handle CRLF in mingw tool chain\r
-opt_cr=\r
-case $build_os in\r
-mingw*)\r
- opt_cr=`echo 'x\{0,1\}' | tr x '\015'` # option cr in regexp\r
- ;;\r
-esac\r
-\r
-# If we're using GNU nm, then use its standard symbol codes.\r
-case `$NM -V 2>&1` in\r
-*GNU* | *'with BFD'*)\r
- symcode='[[ABCDGIRSTW]]' ;;\r
-esac\r
-\r
-# Try without a prefix undercore, then with it.\r
-for ac_symprfx in "" "_"; do\r
-\r
- # Write the raw and C identifiers.\r
- lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[ ]]\($symcode$symcode*\)[[ ]][[ ]]*\($ac_symprfx\)$sympat$opt_cr$/$symxfrm/p'"\r
-\r
- # Check to see that the pipe works correctly.\r
- pipe_works=no\r
-\r
- rm -f conftest*\r
- cat > conftest.$ac_ext <<EOF\r
-#ifdef __cplusplus\r
-extern "C" {\r
-#endif\r
-char nm_test_var;\r
-void nm_test_func(){}\r
-#ifdef __cplusplus\r
-}\r
-#endif\r
-int main(){nm_test_var='a';nm_test_func();return(0);}\r
-EOF\r
-\r
- if AC_TRY_EVAL(ac_compile); then\r
- # Now try to grab the symbols.\r
- nlist=conftest.nm\r
- if AC_TRY_EVAL(NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist) && test -s "$nlist"; then\r
- # Try sorting and uniquifying the output.\r
- if sort "$nlist" | uniq > "$nlist"T; then\r
- mv -f "$nlist"T "$nlist"\r
- else\r
- rm -f "$nlist"T\r
- fi\r
-\r
- # Make sure that we snagged all the symbols we need.\r
- if grep ' nm_test_var$' "$nlist" >/dev/null; then\r
- if grep ' nm_test_func$' "$nlist" >/dev/null; then\r
- cat <<EOF > conftest.$ac_ext\r
-#ifdef __cplusplus\r
-extern "C" {\r
-#endif\r
-\r
-EOF\r
- # Now generate the symbol file.\r
- eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | grep -v main >> conftest.$ac_ext'\r
-\r
- cat <<EOF >> conftest.$ac_ext\r
-#if defined (__STDC__) && __STDC__\r
-# define lt_ptr_t void *\r
-#else\r
-# define lt_ptr_t char *\r
-# define const\r
-#endif\r
-\r
-/* The mapping between symbol names and symbols. */\r
-const struct {\r
- const char *name;\r
- lt_ptr_t address;\r
-}\r
-lt_preloaded_symbols[[]] =\r
-{\r
-EOF\r
- $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (lt_ptr_t) \&\2},/" < "$nlist" | grep -v main >> conftest.$ac_ext\r
- cat <<\EOF >> conftest.$ac_ext\r
- {0, (lt_ptr_t) 0}\r
-};\r
-\r
-#ifdef __cplusplus\r
-}\r
-#endif\r
-EOF\r
- # Now try linking the two files.\r
- mv conftest.$ac_objext conftstm.$ac_objext\r
- lt_save_LIBS="$LIBS"\r
- lt_save_CFLAGS="$CFLAGS"\r
- LIBS="conftstm.$ac_objext"\r
- CFLAGS="$CFLAGS$_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)"\r
- if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext}; then\r
- pipe_works=yes\r
- fi\r
- LIBS="$lt_save_LIBS"\r
- CFLAGS="$lt_save_CFLAGS"\r
- else\r
- echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD\r
- fi\r
- else\r
- echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD\r
- fi\r
- else\r
- echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD\r
- fi\r
- else\r
- echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD\r
- cat conftest.$ac_ext >&5\r
- fi\r
- rm -f conftest* conftst*\r
-\r
- # Do not use the global_symbol_pipe unless it works.\r
- if test "$pipe_works" = yes; then\r
- break\r
- else\r
- lt_cv_sys_global_symbol_pipe=\r
- fi\r
-done\r
-])\r
-if test -z "$lt_cv_sys_global_symbol_pipe"; then\r
- lt_cv_sys_global_symbol_to_cdecl=\r
-fi\r
-if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then\r
- AC_MSG_RESULT(failed)\r
-else\r
- AC_MSG_RESULT(ok)\r
-fi\r
-]) # AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE\r
-\r
-\r
-# AC_LIBTOOL_PROG_COMPILER_PIC([TAGNAME])\r
-# ---------------------------------------\r
-AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC],\r
-[_LT_AC_TAGVAR(lt_prog_compiler_wl, $1)=\r
-_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=\r
-_LT_AC_TAGVAR(lt_prog_compiler_static, $1)=\r
-\r
-AC_MSG_CHECKING([for $compiler option to produce PIC])\r
- ifelse([$1],[CXX],[\r
- # C++ specific cases for pic, static, wl, etc.\r
- if test "$GXX" = yes; then\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-static'\r
-\r
- case $host_os in\r
- aix*)\r
- # All AIX code is PIC.\r
- if test "$host_cpu" = ia64; then\r
- # AIX 5 now supports IA64 processor\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- fi\r
- ;;\r
- amigaos*)\r
- # FIXME: we need at least 68020 code to build shared libraries, but\r
- # adding the `-m68020' flag to GCC prevents building anything better,\r
- # like `-m68040'.\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'\r
- ;;\r
- beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\r
- # PIC is the default for these OSes.\r
- ;;\r
- mingw* | os2* | pw32*)\r
- # This hack is so that the source file can tell whether it is being\r
- # built for inclusion in a dll (and should export symbols for example).\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'\r
- ;;\r
- darwin* | rhapsody*)\r
- # PIC is the default on this platform\r
- # Common symbols not allowed in MH_DYLIB files\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'\r
- ;;\r
- *djgpp*)\r
- # DJGPP does not support shared libraries at all\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=\r
- ;;\r
- sysv4*MP*)\r
- if test -d /usr/nec; then\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic\r
- fi\r
- ;;\r
- hpux*)\r
- # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but\r
- # not for PA HP-UX.\r
- case "$host_cpu" in\r
- hppa*64*|ia64*)\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\r
- ;;\r
- esac\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\r
- ;;\r
- esac\r
- else\r
- case $host_os in\r
- aix4* | aix5*)\r
- # All AIX code is PIC.\r
- if test "$host_cpu" = ia64; then\r
- # AIX 5 now supports IA64 processor\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- else\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'\r
- fi\r
- ;;\r
- chorus*)\r
- case $cc_basename in\r
- cxch68)\r
- # Green Hills C++ Compiler\r
- # _LT_AC_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a"\r
- ;;\r
- esac\r
- ;;\r
- dgux*)\r
- case $cc_basename in\r
- ec++)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\r
- ;;\r
- ghcx)\r
- # Green Hills C++ Compiler\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- freebsd* | kfreebsd*-gnu)\r
- # FreeBSD uses GNU C++\r
- ;;\r
- hpux9* | hpux10* | hpux11*)\r
- case $cc_basename in\r
- CC)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)="${ac_cv_prog_cc_wl}-a ${ac_cv_prog_cc_wl}archive"\r
- if test "$host_cpu" != ia64; then\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='+Z'\r
- fi\r
- ;;\r
- aCC)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)="${ac_cv_prog_cc_wl}-a ${ac_cv_prog_cc_wl}archive"\r
- case "$host_cpu" in\r
- hppa*64*|ia64*)\r
- # +Z the default\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='+Z'\r
- ;;\r
- esac\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- irix5* | irix6* | nonstopux*)\r
- case $cc_basename in\r
- CC)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\r
- # CC pic flag -KPIC is the default.\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- linux*)\r
- case $cc_basename in\r
- KCC)\r
- # KAI C++ Compiler\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\r
- ;;\r
- icpc)\r
- # Intel C++\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-static'\r
- ;;\r
- cxx)\r
- # Compaq C++\r
- # Make sure the PIC flag is empty. It appears that all Alpha\r
- # Linux and Compaq Tru64 Unix objects are PIC.\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- lynxos*)\r
- ;;\r
- m88k*)\r
- ;;\r
- mvs*)\r
- case $cc_basename in\r
- cxx)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall'\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- netbsd*)\r
- ;;\r
- osf3* | osf4* | osf5*)\r
- case $cc_basename in\r
- KCC)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'\r
- ;;\r
- RCC)\r
- # Rational C++ 2.4.1\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\r
- ;;\r
- cxx)\r
- # Digital/Compaq C++\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- # Make sure the PIC flag is empty. It appears that all Alpha\r
- # Linux and Compaq Tru64 Unix objects are PIC.\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- psos*)\r
- ;;\r
- sco*)\r
- case $cc_basename in\r
- CC)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- solaris*)\r
- case $cc_basename in\r
- CC)\r
- # Sun C++ 4.2, 5.x and Centerline C++\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\r
- ;;\r
- gcx)\r
- # Green Hills C++ Compiler\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- sunos4*)\r
- case $cc_basename in\r
- CC)\r
- # Sun C++ 4.x\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- ;;\r
- lcc)\r
- # Lucid\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- tandem*)\r
- case $cc_basename in\r
- NCC)\r
- # NonStop-UX NCC 3.20\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\r
- ;;\r
- *)\r
- ;;\r
- esac\r
- ;;\r
- unixware*)\r
- ;;\r
- vxworks*)\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\r
- ;;\r
- esac\r
- fi\r
-],\r
-[\r
- if test "$GCC" = yes; then\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-static'\r
-\r
- case $host_os in\r
- aix*)\r
- # All AIX code is PIC.\r
- if test "$host_cpu" = ia64; then\r
- # AIX 5 now supports IA64 processor\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- fi\r
- ;;\r
-\r
- amigaos*)\r
- # FIXME: we need at least 68020 code to build shared libraries, but\r
- # adding the `-m68020' flag to GCC prevents building anything better,\r
- # like `-m68040'.\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'\r
- ;;\r
-\r
- beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)\r
- # PIC is the default for these OSes.\r
- ;;\r
-\r
- mingw* | pw32* | os2*)\r
- # This hack is so that the source file can tell whether it is being\r
- # built for inclusion in a dll (and should export symbols for example).\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'\r
- ;;\r
-\r
- darwin* | rhapsody*)\r
- # PIC is the default on this platform\r
- # Common symbols not allowed in MH_DYLIB files\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'\r
- ;;\r
-\r
- msdosdjgpp*)\r
- # Just because we use GCC doesn't mean we suddenly get shared libraries\r
- # on systems that don't support them.\r
- _LT_AC_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\r
- enable_shared=no\r
- ;;\r
-\r
- sysv4*MP*)\r
- if test -d /usr/nec; then\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic\r
- fi\r
- ;;\r
-\r
- hpux*)\r
- # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but\r
- # not for PA HP-UX.\r
- case "$host_cpu" in\r
- hppa*64*|ia64*)\r
- # +Z the default\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\r
- ;;\r
- esac\r
- ;;\r
-\r
- *)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'\r
- ;;\r
- esac\r
- else\r
- # PORTME Check for flag to pass linker flags through the system compiler.\r
- case $host_os in\r
- aix*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- if test "$host_cpu" = ia64; then\r
- # AIX 5 now supports IA64 processor\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- else\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'\r
- fi\r
- ;;\r
-\r
- mingw* | pw32* | os2*)\r
- # This hack is so that the source file can tell whether it is being\r
- # built for inclusion in a dll (and should export symbols for example).\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'\r
- ;;\r
-\r
- hpux9* | hpux10* | hpux11*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but\r
- # not for PA HP-UX.\r
- case "$host_cpu" in\r
- hppa*64*|ia64*)\r
- # +Z the default\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='+Z'\r
- ;;\r
- esac\r
- # Is there a better lt_prog_compiler_static that works with the bundled CC?\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive'\r
- ;;\r
-\r
- irix5* | irix6* | nonstopux*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- # PIC (with -KPIC) is the default.\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\r
- ;;\r
-\r
- newsos6)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- ;;\r
-\r
- linux*)\r
- case $CC in\r
- icc* | ecc*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-static'\r
- ;;\r
- ccc*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- # All Alpha code is PIC.\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\r
- ;;\r
- esac\r
- ;;\r
-\r
- osf3* | osf4* | osf5*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- # All OSF/1 code is PIC.\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'\r
- ;;\r
-\r
- sco3.2v5*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-Kpic'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-dn'\r
- ;;\r
-\r
- solaris*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- ;;\r
-\r
- sunos4*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- ;;\r
-\r
- sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- ;;\r
-\r
- sysv4*MP*)\r
- if test -d /usr/nec ;then\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- fi\r
- ;;\r
-\r
- uts4*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'\r
- _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'\r
- ;;\r
-\r
- *)\r
- _LT_AC_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no\r
- ;;\r
- esac\r
- fi\r
-])\r
-AC_MSG_RESULT([$_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)])\r
-\r
-#\r
-# Check to make sure the PIC flag actually works.\r
-#\r
-if test -n "$_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)"; then\r
- AC_LIBTOOL_COMPILER_OPTION([if $compiler PIC flag $_LT_AC_TAGVAR(lt_prog_compiler_pic, $1) works],\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic_works, $1),\r
- [$_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)ifelse([$1],[],[ -DPIC],[ifelse([$1],[CXX],[ -DPIC],[])])], [],\r
- [case $_LT_AC_TAGVAR(lt_prog_compiler_pic, $1) in\r
- "" | " "*) ;;\r
- *) _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)" ;;\r
- esac],\r
- [_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=\r
- _LT_AC_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no])\r
-fi\r
-case "$host_os" in\r
- # For platforms which do not support PIC, -DPIC is meaningless:\r
- *djgpp*)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)ifelse([$1],[],[ -DPIC],[ifelse([$1],[CXX],[ -DPIC],[])])"\r
- ;;\r
-esac\r
-])\r
-\r
-\r
-# AC_LIBTOOL_PROG_LD_SHLIBS([TAGNAME])\r
-# ------------------------------------\r
-# See if the linker supports building shared libraries.\r
-AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS],\r
-[AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])\r
-ifelse([$1],[CXX],[\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'\r
- case $host_os in\r
- aix4* | aix5*)\r
- # If we're using GNU nm, then we don't want the "-C" option.\r
- # -C means demangle to AIX nm, but means don't demangle with GNU nm\r
- if $NM -V 2>&1 | grep 'GNU' > /dev/null; then\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\[$]2 == "T") || (\[$]2 == "D") || (\[$]2 == "B")) && ([substr](\[$]3,1,1) != ".")) { print \[$]3 } }'\'' | sort -u > $export_symbols'\r
- else\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\[$]2 == "T") || (\[$]2 == "D") || (\[$]2 == "B")) && ([substr](\[$]3,1,1) != ".")) { print \[$]3 } }'\'' | sort -u > $export_symbols'\r
- fi\r
- ;;\r
- pw32*)\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)="$ltdll_cmds"\r
- ;;\r
- cygwin* | mingw*)\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGS]] /s/.* \([[^ ]]*\)/\1 DATA/'\'' | $SED -e '\''/^[[AITW]] /s/.* //'\'' | sort | uniq > $export_symbols'\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'\r
- ;;\r
- esac\r
-],[\r
- runpath_var=\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=\r
- _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=no\r
- _LT_AC_TAGVAR(archive_cmds, $1)=\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)=\r
- _LT_AC_TAGVAR(old_archive_From_new_cmds, $1)=\r
- _LT_AC_TAGVAR(old_archive_from_expsyms_cmds, $1)=\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)=\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=\r
- _LT_AC_TAGVAR(thread_safe_flag_spec, $1)=\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)=\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=no\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=unknown\r
- _LT_AC_TAGVAR(hardcode_automatic, $1)=no\r
- _LT_AC_TAGVAR(module_cmds, $1)=\r
- _LT_AC_TAGVAR(module_expsym_cmds, $1)=\r
- _LT_AC_TAGVAR(always_export_symbols, $1)=no\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'\r
- # include_expsyms should be a list of space-separated symbols to be *always*\r
- # included in the symbol list\r
- _LT_AC_TAGVAR(include_expsyms, $1)=\r
- # exclude_expsyms can be an extended regexp of symbols to exclude\r
- # it will be wrapped by ` (' and `)$', so one must not match beginning or\r
- # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc',\r
- # as well as any symbol that contains `d'.\r
- _LT_AC_TAGVAR(exclude_expsyms, $1)="_GLOBAL_OFFSET_TABLE_"\r
- # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out\r
- # platforms (ab)use it in PIC code, but their linkers get confused if\r
- # the symbol is explicitly referenced. Since portable code cannot\r
- # rely on this symbol name, it's probably fine to never include it in\r
- # preloaded symbol tables.\r
- extract_expsyms_cmds=\r
-\r
- case $host_os in\r
- cygwin* | mingw* | pw32*)\r
- # FIXME: the MSVC++ port hasn't been tested in a loooong time\r
- # When not using gcc, we currently assume that we are using\r
- # Microsoft Visual C++.\r
- if test "$GCC" != yes; then\r
- with_gnu_ld=no\r
- fi\r
- ;;\r
- openbsd*)\r
- with_gnu_ld=no\r
- ;;\r
- esac\r
-\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=yes\r
- if test "$with_gnu_ld" = yes; then\r
- # If archive_cmds runs LD, not CC, wlarc should be empty\r
- wlarc='${wl}'\r
-\r
- # See if GNU ld supports shared libraries.\r
- case $host_os in\r
- aix3* | aix4* | aix5*)\r
- # On AIX/PPC, the GNU linker is very broken\r
- if test "$host_cpu" != ia64; then\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- cat <<EOF 1>&2\r
-\r
-*** Warning: the GNU linker, at least up to release 2.9.1, is reported\r
-*** to be unable to reliably create shared libraries on AIX.\r
-*** Therefore, libtool is disabling shared libraries support. If you\r
-*** really care for shared libraries, you may want to modify your PATH\r
-*** so that a non-GNU linker is found, and then restart.\r
-\r
-EOF\r
- fi\r
- ;;\r
-\r
- amigaos*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
-\r
- # Samuel A. Falvo II <kc5tja@dolphin.openprojects.net> reports\r
- # that the semantics of dynamic libraries on AmigaOS, at least up\r
- # to version 4, is to share data among multiple programs linked\r
- # with the same dynamic library. Since this doesn't match the\r
- # behavior of shared libraries on other platforms, we can't use\r
- # them.\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
-\r
- beos*)\r
- if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported\r
- # Joseph Beckenbach <jrb3@best.com> says some releases of gcc\r
- # support --undefined. This deserves some investigation. FIXME\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\r
- else\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
-\r
- cygwin* | mingw* | pw32*)\r
- # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,\r
- # as there is no search path for DLLs.\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported\r
- _LT_AC_TAGVAR(always_export_symbols, $1)=no\r
- _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGS]] /s/.* \([[^ ]]*\)/\1 DATA/'\'' | $SED -e '\''/^[[AITW]] /s/.* //'\'' | sort | uniq > $export_symbols'\r
-\r
- if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib'\r
- # If the export-symbols file already is a .def file (1st line\r
- # is EXPORTS), use it as is; otherwise, prepend...\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then\r
- cp $export_symbols $output_objdir/$soname.def;\r
- else\r
- echo EXPORTS > $output_objdir/$soname.def;\r
- cat $export_symbols >> $output_objdir/$soname.def;\r
- fi~\r
- $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib'\r
- else\r
- ld_shlibs=no\r
- fi\r
- ;;\r
-\r
- netbsd*)\r
- if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib'\r
- wlarc=\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\r
- fi\r
- ;;\r
-\r
- solaris* | sysv5*)\r
- if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- cat <<EOF 1>&2\r
-\r
-*** Warning: The releases 2.8.* of the GNU linker cannot reliably\r
-*** create shared libraries on Solaris systems. Therefore, libtool\r
-*** is disabling shared libraries support. We urge you to upgrade GNU\r
-*** binutils to release 2.9.1 or newer. Another option is to modify\r
-*** your PATH or compiler configuration so that the native linker is\r
-*** used, and then restart.\r
-\r
-EOF\r
- elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\r
- else\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
-\r
- sunos4*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags'\r
- wlarc=\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- linux*)\r
- if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then\r
- tmp_archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\r
- _LT_AC_TAGVAR(archive_cmds, $1)="$tmp_archive_cmds"\r
- supports_anon_versioning=no\r
- case `$LD -v 2>/dev/null` in\r
- *\ [01].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11\r
- *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ...\r
- *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ...\r
- *\ 2.11.*) ;; # other 2.11 versions\r
- *) supports_anon_versioning=yes ;;\r
- esac\r
- if test $supports_anon_versioning = yes; then\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $output_objdir/$libname.ver~\r
-cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~\r
-$echo "local: *; };" >> $output_objdir/$libname.ver~\r
- $CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'\r
- else\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)="$tmp_archive_cmds"\r
- fi\r
- else\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
-\r
- *)\r
- if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'\r
- else\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
- esac\r
-\r
- if test "$_LT_AC_TAGVAR(ld_shlibs, $1)" = yes; then\r
- runpath_var=LD_RUN_PATH\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir'\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'\r
- # ancient GNU ld didn't support --whole-archive et. al.\r
- if $LD --help 2>&1 | grep 'no-whole-archive' > /dev/null; then\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'\r
- else\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=\r
- fi\r
- fi\r
- else\r
- # PORTME fill in a description of your system's linker (not GNU ld)\r
- case $host_os in\r
- aix3*)\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported\r
- _LT_AC_TAGVAR(always_export_symbols, $1)=yes\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname'\r
- # Note: this linker hardcodes the directories in LIBPATH if there\r
- # are no directories specified by -L.\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- if test "$GCC" = yes && test -z "$link_static_flag"; then\r
- # Neither direct hardcoding nor static linking is supported with a\r
- # broken collect2.\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=unsupported\r
- fi\r
- ;;\r
-\r
- aix4* | aix5*)\r
- if test "$host_cpu" = ia64; then\r
- # On IA64, the linker does run time linking by default, so we don't\r
- # have to do anything special.\r
- aix_use_runtimelinking=no\r
- exp_sym_flag='-Bexport'\r
- no_entry_flag=""\r
- else\r
- # If we're using GNU nm, then we don't want the "-C" option.\r
- # -C means demangle to AIX nm, but means don't demangle with GNU nm\r
- if $NM -V 2>&1 | grep 'GNU' > /dev/null; then\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\[$]2 == "T") || (\[$]2 == "D") || (\[$]2 == "B")) && ([substr](\[$]3,1,1) != ".")) { print \[$]3 } }'\'' | sort -u > $export_symbols'\r
- else\r
- _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\[$]2 == "T") || (\[$]2 == "D") || (\[$]2 == "B")) && ([substr](\[$]3,1,1) != ".")) { print \[$]3 } }'\'' | sort -u > $export_symbols'\r
- fi\r
- aix_use_runtimelinking=no\r
-\r
- # Test if we are trying to use run time linking or normal\r
- # AIX style linking. If -brtl is somewhere in LDFLAGS, we\r
- # need to do runtime linking.\r
- case $host_os in aix4.[[23]]|aix4.[[23]].*|aix5*)\r
- for ld_flag in $LDFLAGS; do\r
- if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then\r
- aix_use_runtimelinking=yes\r
- break\r
- fi\r
- done\r
- esac\r
-\r
- exp_sym_flag='-bexport'\r
- no_entry_flag='-bnoentry'\r
- fi\r
-\r
- # When large executables or shared objects are built, AIX ld can\r
- # have problems creating the table of contents. If linking a library\r
- # or program results in "error TOC overflow" add -mminimal-toc to\r
- # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not\r
- # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.\r
-\r
- _LT_AC_TAGVAR(archive_cmds, $1)=''\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=':'\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=yes\r
-\r
- if test "$GCC" = yes; then\r
- case $host_os in aix4.[012]|aix4.[012].*)\r
- # We only want to do this on AIX 4.2 and lower, the check\r
- # below for broken collect2 doesn't work under 4.3+\r
- collect2name=`${CC} -print-prog-name=collect2`\r
- if test -f "$collect2name" && \\r
- strings "$collect2name" | grep resolve_lib_name >/dev/null\r
- then\r
- # We have reworked collect2\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- else\r
- # We have old collect2\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=unsupported\r
- # It fails to find uninstalled libraries when the uninstalled\r
- # path is not listed in the libpath. Setting hardcode_minus_L\r
- # to unsupported forces relinking\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=\r
- fi\r
- esac\r
- shared_flag='-shared'\r
- else\r
- # not using gcc\r
- if test "$host_cpu" = ia64; then\r
- # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release\r
- # chokes on -Wl,-G. The following line is correct:\r
- shared_flag='-G'\r
- else\r
- if test "$aix_use_runtimelinking" = yes; then\r
- shared_flag='${wl}-G'\r
- else\r
- shared_flag='${wl}-bM:SRE'\r
- fi\r
- fi\r
- fi\r
-\r
- # It seems that -bexpall does not export symbols beginning with\r
- # underscore (_), so it is better to generate a list of symbols to export.\r
- _LT_AC_TAGVAR(always_export_symbols, $1)=yes\r
- if test "$aix_use_runtimelinking" = yes; then\r
- # Warning - without using the other runtime loading flags (-brtl),\r
- # -berok will link without error, but may produce a broken library.\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-berok'\r
- # Determine the default libpath from the value encoded in an empty executable.\r
- _LT_AC_SYS_LIBPATH_AIX\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols $shared_flag"\r
- else\r
- if test "$host_cpu" = ia64; then\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib'\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)="-z nodefs"\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols"\r
- else\r
- # Determine the default libpath from the value encoded in an empty executable.\r
- _LT_AC_SYS_LIBPATH_AIX\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"\r
- # Warning - without using the other run time loading flags,\r
- # -berok will link without error, but may produce a broken library.\r
- _LT_AC_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok'\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok'\r
- # -bexpall does not export symbols beginning with underscore (_)\r
- _LT_AC_TAGVAR(always_export_symbols, $1)=yes\r
- # Exported symbols can be pulled into shared objects from archives\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=' '\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=yes\r
- # This is similar to how AIX traditionally builds it's shared libraries.\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}-bE:$export_symbols ${wl}-bnoentry${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'\r
- fi\r
- fi\r
- ;;\r
-\r
- amigaos*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- # see comment about different semantics on the GNU ld section\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
-\r
- bsdi4*)\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic\r
- ;;\r
-\r
- cygwin* | mingw* | pw32*)\r
- # When not using gcc, we currently assume that we are using\r
- # Microsoft Visual C++.\r
- # hardcode_libdir_flag_spec is actually meaningless, as there is\r
- # no search path for DLLs.\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=' '\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported\r
- # Tell ltmain to make .lib files, not .a files.\r
- libext=lib\r
- # Tell ltmain to make .dll files, not .so files.\r
- shrext_cmds=".dll"\r
- # FIXME: Setting linknames here is a bad hack.\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `echo "$deplibs" | $SED -e '\''s/ -lc$//'\''` -link -dll~linknames='\r
- # The linker will automatically build a .lib file if we build a DLL.\r
- _LT_AC_TAGVAR(old_archive_From_new_cmds, $1)='true'\r
- # FIXME: Should let the user specify the lib program.\r
- _LT_AC_TAGVAR(old_archive_cmds, $1)='lib /OUT:$oldlib$oldobjs$old_deplibs'\r
- fix_srcfile_path='`cygpath -w "$srcfile"`'\r
- _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=yes\r
- ;;\r
-\r
- darwin* | rhapsody*)\r
- if test "$GXX" = yes ; then\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
- case "$host_os" in\r
- rhapsody* | darwin1.[[012]])\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined suppress'\r
- ;;\r
- *) # Darwin 1.3 on\r
- if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'\r
- else\r
- case ${MACOSX_DEPLOYMENT_TARGET} in\r
- 10.[[012]])\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'\r
- ;;\r
- 10.*)\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined dynamic_lookup'\r
- ;;\r
- esac\r
- fi\r
- ;;\r
- esac\r
- lt_int_apple_cc_single_mod=no\r
- output_verbose_link_cmd='echo'\r
- if $CC -dumpspecs 2>&1 | grep 'single_module' >/dev/null ; then\r
- lt_int_apple_cc_single_mod=yes\r
- fi\r
- if test "X$lt_int_apple_cc_single_mod" = Xyes ; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring'\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -r ${wl}-bind_at_load -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring'\r
- fi\r
- _LT_AC_TAGVAR(module_cmds, $1)='$CC ${wl}-bind_at_load $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags'\r
- # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's\r
- if test "X$lt_int_apple_cc_single_mod" = Xyes ; then\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'\r
- else\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -r ${wl}-bind_at_load -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'\r
- fi\r
- _LT_AC_TAGVAR(module_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no\r
- _LT_AC_TAGVAR(hardcode_automatic, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=unsupported\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='-all_load $convenience'\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=yes\r
- else\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- fi\r
- ;;\r
-\r
- dgux*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- freebsd1*)\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
-\r
- # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor\r
- # support. Future versions do this automatically, but an explicit c++rt0.o\r
- # does not break anything, and helps significantly (at the cost of a little\r
- # extra space).\r
- freebsd2.2*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- # Unfortunately, older versions of FreeBSD 2 do not have this feature.\r
- freebsd2*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- # FreeBSD 3 and greater uses gcc -shared to do shared libraries.\r
- freebsd* | kfreebsd*-gnu)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -o $lib $libobjs $deplibs $compiler_flags'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- hpux9*)\r
- if test "$GCC" = yes; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'\r
- fi\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
-\r
- # hardcode_minus_L: Not really in the search PATH,\r
- # but as the default location of the library.\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\r
- ;;\r
-\r
- hpux10* | hpux11*)\r
- if test "$GCC" = yes -a "$with_gnu_ld" = no; then\r
- case "$host_cpu" in\r
- hppa*64*|ia64*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'\r
- ;;\r
- esac\r
- else\r
- case "$host_cpu" in\r
- hppa*64*|ia64*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -b +h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'\r
- ;;\r
- esac\r
- fi\r
- if test "$with_gnu_ld" = no; then\r
- case "$host_cpu" in\r
- hppa*64*)\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='+b $libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
- ia64*)\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
-\r
- # hardcode_minus_L: Not really in the search PATH,\r
- # but as the default location of the library.\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\r
-\r
- # hardcode_minus_L: Not really in the search PATH,\r
- # but as the default location of the library.\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- ;;\r
- esac\r
- fi\r
- ;;\r
-\r
- irix5* | irix6* | nonstopux*)\r
- if test "$GCC" = yes; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='-rpath $libdir'\r
- fi\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=yes\r
- ;;\r
-\r
- netbsd*)\r
- if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF\r
- fi\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- newsos6)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- openbsd*)\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'\r
- else\r
- case $host_os in\r
- openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\r
- ;;\r
- *)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'\r
- ;;\r
- esac\r
- fi\r
- ;;\r
-\r
- os2*)\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$echo "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$echo "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$echo DATA >> $output_objdir/$libname.def~$echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~$echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def'\r
- _LT_AC_TAGVAR(old_archive_From_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def'\r
- ;;\r
-\r
- osf3*)\r
- if test "$GCC" = yes; then\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\r
- else\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib'\r
- fi\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- ;;\r
-\r
- osf4* | osf5*) # as osf3* with the addition of -msym flag\r
- if test "$GCC" = yes; then\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'\r
- else\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*'\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; echo "-hidden">> $lib.exp~\r
- $LD -shared${allow_undefined_flag} -input $lib.exp $linker_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${objdir}/so_locations -o $lib~$rm $lib.exp'\r
-\r
- # Both c and cxx compiler support -rpath directly\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'\r
- fi\r
- _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:\r
- ;;\r
-\r
- sco3.2v5*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport'\r
- runpath_var=LD_RUN_PATH\r
- hardcode_runpath_var=yes\r
- ;;\r
-\r
- solaris*)\r
- _LT_AC_TAGVAR(no_undefined_flag, $1)=' -z text'\r
- if test "$GCC" = yes; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~\r
- $CC -shared ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$rm $lib.exp'\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~\r
- $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$rm $lib.exp'\r
- fi\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- case $host_os in\r
- solaris2.[[0-5]] | solaris2.[[0-5]].*) ;;\r
- *) # Supported since Solaris 2.6 (maybe 2.5.1?)\r
- _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' ;;\r
- esac\r
- _LT_AC_TAGVAR(link_all_deplibs, $1)=yes\r
- ;;\r
-\r
- sunos4*)\r
- if test "x$host_vendor" = xsequent; then\r
- # Use $CC to link under sequent, because it throws in some extra .o\r
- # files that make .init and .fini sections work.\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags'\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags'\r
- fi\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- sysv4)\r
- case $host_vendor in\r
- sni)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes # is this really true???\r
- ;;\r
- siemens)\r
- ## LD is ld it makes a PLAMLIB\r
- ## CC just makes a GrossModule.\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no\r
- ;;\r
- motorola)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie\r
- ;;\r
- esac\r
- runpath_var='LD_RUN_PATH'\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- sysv4.3*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport'\r
- ;;\r
-\r
- sysv4*MP*)\r
- if test -d /usr/nec; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- runpath_var=LD_RUN_PATH\r
- hardcode_runpath_var=yes\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=yes\r
- fi\r
- ;;\r
-\r
- sysv4.2uw2*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_direct, $1)=yes\r
- _LT_AC_TAGVAR(hardcode_minus_L, $1)=no\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- hardcode_runpath_var=yes\r
- runpath_var=LD_RUN_PATH\r
- ;;\r
-\r
- sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[[78]]* | unixware7*)\r
- _LT_AC_TAGVAR(no_undefined_flag, $1)='${wl}-z ${wl}text'\r
- if test "$GCC" = yes; then\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\r
- else\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'\r
- fi\r
- runpath_var='LD_RUN_PATH'\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- sysv5*)\r
- _LT_AC_TAGVAR(no_undefined_flag, $1)=' -z text'\r
- # $CC -shared without GNU ld will not create a library from C++\r
- # object files and a static libstdc++, better avoid it by now\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~\r
- $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$rm $lib.exp'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- runpath_var='LD_RUN_PATH'\r
- ;;\r
-\r
- uts4*)\r
- _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'\r
- _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'\r
- _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no\r
- ;;\r
-\r
- *)\r
- _LT_AC_TAGVAR(ld_shlibs, $1)=no\r
- ;;\r
- esac\r
- fi\r
-])\r
-AC_MSG_RESULT([$_LT_AC_TAGVAR(ld_shlibs, $1)])\r
-test "$_LT_AC_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no\r
-\r
-variables_saved_for_relink="PATH $shlibpath_var $runpath_var"\r
-if test "$GCC" = yes; then\r
- variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH"\r
-fi\r
-\r
-#\r
-# Do we need to explicitly link libc?\r
-#\r
-case "x$_LT_AC_TAGVAR(archive_cmds_need_lc, $1)" in\r
-x|xyes)\r
- # Assume -lc should be added\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=yes\r
-\r
- if test "$enable_shared" = yes && test "$GCC" = yes; then\r
- case $_LT_AC_TAGVAR(archive_cmds, $1) in\r
- *'~'*)\r
- # FIXME: we may have to deal with multi-command sequences.\r
- ;;\r
- '$CC '*)\r
- # Test whether the compiler implicitly links with -lc since on some\r
- # systems, -lgcc has to come before -lc. If gcc already passes -lc\r
- # to ld, don't add -lc before -lgcc.\r
- AC_MSG_CHECKING([whether -lc should be explicitly linked in])\r
- $rm conftest*\r
- printf "$lt_simple_compile_test_code" > conftest.$ac_ext\r
-\r
- if AC_TRY_EVAL(ac_compile) 2>conftest.err; then\r
- soname=conftest\r
- lib=conftest\r
- libobjs=conftest.$ac_objext\r
- deplibs=\r
- wl=$_LT_AC_TAGVAR(lt_prog_compiler_wl, $1)\r
- compiler_flags=-v\r
- linker_flags=-v\r
- verstring=\r
- output_objdir=.\r
- libname=conftest\r
- lt_save_allow_undefined_flag=$_LT_AC_TAGVAR(allow_undefined_flag, $1)\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=\r
- if AC_TRY_EVAL(_LT_AC_TAGVAR(archive_cmds, $1) 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1)\r
- then\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no\r
- else\r
- _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=yes\r
- fi\r
- _LT_AC_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag\r
- else\r
- cat conftest.err 1>&5\r
- fi\r
- $rm conftest*\r
- AC_MSG_RESULT([$_LT_AC_TAGVAR(archive_cmds_need_lc, $1)])\r
- ;;\r
- esac\r
- fi\r
- ;;\r
-esac\r
-])# AC_LIBTOOL_PROG_LD_SHLIBS\r
-\r
-\r
-# _LT_AC_FILE_LTDLL_C\r
-# -------------------\r
-# Be careful that the start marker always follows a newline.\r
-AC_DEFUN([_LT_AC_FILE_LTDLL_C], [\r
-# /* ltdll.c starts here */\r
-# #define WIN32_LEAN_AND_MEAN\r
-# #include <windows.h>\r
-# #undef WIN32_LEAN_AND_MEAN\r
-# #include <stdio.h>\r
-#\r
-# #ifndef __CYGWIN__\r
-# # ifdef __CYGWIN32__\r
-# # define __CYGWIN__ __CYGWIN32__\r
-# # endif\r
-# #endif\r
-#\r
-# #ifdef __cplusplus\r
-# extern "C" {\r
-# #endif\r
-# BOOL APIENTRY DllMain (HINSTANCE hInst, DWORD reason, LPVOID reserved);\r
-# #ifdef __cplusplus\r
-# }\r
-# #endif\r
-#\r
-# #ifdef __CYGWIN__\r
-# #include <cygwin/cygwin_dll.h>\r
-# DECLARE_CYGWIN_DLL( DllMain );\r
-# #endif\r
-# HINSTANCE __hDllInstance_base;\r
-#\r
-# BOOL APIENTRY\r
-# DllMain (HINSTANCE hInst, DWORD reason, LPVOID reserved)\r
-# {\r
-# __hDllInstance_base = hInst;\r
-# return TRUE;\r
-# }\r
-# /* ltdll.c ends here */\r
-])# _LT_AC_FILE_LTDLL_C\r
-\r
-\r
-# _LT_AC_TAGVAR(VARNAME, [TAGNAME])\r
-# ---------------------------------\r
-AC_DEFUN([_LT_AC_TAGVAR], [ifelse([$2], [], [$1], [$1_$2])])\r
-\r
-\r
-# old names\r
-AC_DEFUN([AM_PROG_LIBTOOL], [AC_PROG_LIBTOOL])\r
-AC_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)])\r
-AC_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)])\r
-AC_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)])\r
-AC_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)])\r
-AC_DEFUN([AM_PROG_LD], [AC_PROG_LD])\r
-AC_DEFUN([AM_PROG_NM], [AC_PROG_NM])\r
-\r
-# This is just to silence aclocal about the macro not being used\r
-ifelse([AC_DISABLE_FAST_INSTALL])\r
-\r
-AC_DEFUN([LT_AC_PROG_GCJ],\r
-[AC_CHECK_TOOL(GCJ, gcj, no)\r
- test "x${GCJFLAGS+set}" = xset || GCJFLAGS="-g -O2"\r
- AC_SUBST(GCJFLAGS)\r
-])\r
-\r
-AC_DEFUN([LT_AC_PROG_RC],\r
-[AC_CHECK_TOOL(RC, windres, no)\r
-])\r
-\r
-############################################################\r
-# NOTE: This macro has been submitted for inclusion into #\r
-# GNU Autoconf as AC_PROG_SED. When it is available in #\r
-# a released version of Autoconf we should remove this #\r
-# macro and use it instead. #\r
-############################################################\r
-# LT_AC_PROG_SED\r
-# --------------\r
-# Check for a fully-functional sed program, that truncates\r
-# as few characters as possible. Prefer GNU sed if found.\r
-AC_DEFUN([LT_AC_PROG_SED],\r
-[AC_MSG_CHECKING([for a sed that does not truncate output])\r
-AC_CACHE_VAL(lt_cv_path_SED,\r
-[# Loop through the user's path and test for sed and gsed.\r
-# Then use that list of sed's as ones to test for truncation.\r
-as_save_IFS=$IFS; IFS=$PATH_SEPARATOR\r
-for as_dir in $PATH\r
-do\r
- IFS=$as_save_IFS\r
- test -z "$as_dir" && as_dir=.\r
- for lt_ac_prog in sed gsed; do\r
- for ac_exec_ext in '' $ac_executable_extensions; do\r
- if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then\r
- lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext"\r
- fi\r
- done\r
- done\r
-done\r
-lt_ac_max=0\r
-lt_ac_count=0\r
-# Add /usr/xpg4/bin/sed as it is typically found on Solaris\r
-# along with /bin/sed that truncates output.\r
-for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do\r
- test ! -f $lt_ac_sed && break\r
- cat /dev/null > conftest.in\r
- lt_ac_count=0\r
- echo $ECHO_N "0123456789$ECHO_C" >conftest.in\r
- # Check for GNU sed and select it if it is found.\r
- if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then\r
- lt_cv_path_SED=$lt_ac_sed\r
- break\r
- fi\r
- while true; do\r
- cat conftest.in conftest.in >conftest.tmp\r
- mv conftest.tmp conftest.in\r
- cp conftest.in conftest.nl\r
- echo >>conftest.nl\r
- $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break\r
- cmp -s conftest.out conftest.nl || break\r
- # 10000 chars as input seems more than enough\r
- test $lt_ac_count -gt 10 && break\r
- lt_ac_count=`expr $lt_ac_count + 1`\r
- if test $lt_ac_count -gt $lt_ac_max; then\r
- lt_ac_max=$lt_ac_count\r
- lt_cv_path_SED=$lt_ac_sed\r
- fi\r
- done\r
-done\r
-SED=$lt_cv_path_SED\r
-])\r
-AC_MSG_RESULT([$SED])\r
-])\r
+# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*-
+## Copyright 1996, 1997, 1998, 1999, 2000, 2001
+## Free Software Foundation, Inc.
+## Originally by Gordon Matzigkeit <gord@gnu.ai.mit.edu>, 1996
+##
+## This program is free software; you can redistribute it and/or modify
+## it under the terms of the GNU General Public License as published by
+## the Free Software Foundation; either version 2 of the License, or
+## (at your option) any later version.
+##
+## This program is distributed in the hope that it will be useful, but
+## WITHOUT ANY WARRANTY; without even the implied warranty of
+## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+## General Public License for more details.
+##
+## You should have received a copy of the GNU General Public License
+## along with this program; if not, write to the Free Software
+## Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+##
+## As a special exception to the GNU General Public License, if you
+## distribute this file as part of a program that contains a
+## configuration script generated by Autoconf, you may include it under
+## the same distribution terms that you use for the rest of that program.
+
+# serial 47 AC_PROG_LIBTOOL
+
+
+# AC_PROVIDE_IFELSE(MACRO-NAME, IF-PROVIDED, IF-NOT-PROVIDED)
+# -----------------------------------------------------------
+# If this macro is not defined by Autoconf, define it here.
+m4_ifdef([AC_PROVIDE_IFELSE],
+ [],
+ [m4_define([AC_PROVIDE_IFELSE],
+ [m4_ifdef([AC_PROVIDE_$1],
+ [$2], [$3])])])
+
+
+# AC_PROG_LIBTOOL
+# ---------------
+AC_DEFUN([AC_PROG_LIBTOOL],
+[AC_REQUIRE([_AC_PROG_LIBTOOL])dnl
+dnl If AC_PROG_CXX has already been expanded, run AC_LIBTOOL_CXX
+dnl immediately, otherwise, hook it in at the end of AC_PROG_CXX.
+ AC_PROVIDE_IFELSE([AC_PROG_CXX],
+ [AC_LIBTOOL_CXX],
+ [define([AC_PROG_CXX], defn([AC_PROG_CXX])[AC_LIBTOOL_CXX
+ ])])
+dnl And a similar setup for Fortran 77 support
+ AC_PROVIDE_IFELSE([AC_PROG_F77],
+ [AC_LIBTOOL_F77],
+ [define([AC_PROG_F77], defn([AC_PROG_F77])[AC_LIBTOOL_F77
+])])
+
+dnl Quote A][M_PROG_GCJ so that aclocal doesn't bring it in needlessly.
+dnl If either AC_PROG_GCJ or A][M_PROG_GCJ have already been expanded, run
+dnl AC_LIBTOOL_GCJ immediately, otherwise, hook it in at the end of both.
+ AC_PROVIDE_IFELSE([AC_PROG_GCJ],
+ [AC_LIBTOOL_GCJ],
+ [AC_PROVIDE_IFELSE([A][M_PROG_GCJ],
+ [AC_LIBTOOL_GCJ],
+ [AC_PROVIDE_IFELSE([LT_AC_PROG_GCJ],
+ [AC_LIBTOOL_GCJ],
+ [ifdef([AC_PROG_GCJ],
+ [define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[AC_LIBTOOL_GCJ])])
+ ifdef([A][M_PROG_GCJ],
+ [define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[AC_LIBTOOL_GCJ])])
+ ifdef([LT_AC_PROG_GCJ],
+ [define([LT_AC_PROG_GCJ],
+ defn([LT_AC_PROG_GCJ])[AC_LIBTOOL_GCJ])])])])
+])])# AC_PROG_LIBTOOL
+
+
+# _AC_PROG_LIBTOOL
+# ----------------
+AC_DEFUN([_AC_PROG_LIBTOOL],
+[AC_REQUIRE([AC_LIBTOOL_SETUP])dnl
+AC_BEFORE([$0],[AC_LIBTOOL_CXX])dnl
+AC_BEFORE([$0],[AC_LIBTOOL_F77])dnl
+AC_BEFORE([$0],[AC_LIBTOOL_GCJ])dnl
+
+# This can be used to rebuild libtool when needed
+LIBTOOL_DEPS="$ac_aux_dir/ltmain.sh"
+
+# Always use our own libtool.
+LIBTOOL='$(SHELL) $(top_builddir)/libtool'
+AC_SUBST(LIBTOOL)dnl
+
+# Prevent multiple expansion
+define([AC_PROG_LIBTOOL], [])
+])# _AC_PROG_LIBTOOL
+
+
+# AC_LIBTOOL_SETUP
+# ----------------
+AC_DEFUN([AC_LIBTOOL_SETUP],
+[AC_PREREQ(2.50)dnl
+AC_REQUIRE([AC_ENABLE_SHARED])dnl
+AC_REQUIRE([AC_ENABLE_STATIC])dnl
+AC_REQUIRE([AC_ENABLE_FAST_INSTALL])dnl
+AC_REQUIRE([AC_CANONICAL_HOST])dnl
+AC_REQUIRE([AC_CANONICAL_BUILD])dnl
+AC_REQUIRE([AC_PROG_CC])dnl
+AC_REQUIRE([AC_PROG_LD])dnl
+AC_REQUIRE([AC_PROG_LD_RELOAD_FLAG])dnl
+AC_REQUIRE([AC_PROG_NM])dnl
+
+AC_REQUIRE([AC_PROG_LN_S])dnl
+AC_REQUIRE([AC_DEPLIBS_CHECK_METHOD])dnl
+# Autoconf 2.13's AC_OBJEXT and AC_EXEEXT macros only works for C compilers!
+AC_REQUIRE([AC_OBJEXT])dnl
+AC_REQUIRE([AC_EXEEXT])dnl
+dnl
+
+AC_LIBTOOL_SYS_MAX_CMD_LEN
+AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE
+AC_LIBTOOL_OBJDIR
+
+AC_REQUIRE([_LT_AC_SYS_COMPILER])dnl
+_LT_AC_PROG_ECHO_BACKSLASH
+
+case $host_os in
+aix3*)
+ # AIX sometimes has problems with the GCC collect2 program. For some
+ # reason, if we set the COLLECT_NAMES environment variable, the problems
+ # vanish in a puff of smoke.
+ if test "X${COLLECT_NAMES+set}" != Xset; then
+ COLLECT_NAMES=
+ export COLLECT_NAMES
+ fi
+ ;;
+esac
+
+# Sed substitution that helps us do robust quoting. It backslashifies
+# metacharacters that are still active within double-quoted strings.
+Xsed='sed -e s/^X//'
+[sed_quote_subst='s/\([\\"\\`$\\\\]\)/\\\1/g']
+
+# Same as above, but do not quote variable references.
+[double_quote_subst='s/\([\\"\\`\\\\]\)/\\\1/g']
+
+# Sed substitution to delay expansion of an escaped shell variable in a
+# double_quote_subst'ed string.
+delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g'
+
+# Sed substitution to avoid accidental globbing in evaled expressions
+no_glob_subst='s/\*/\\\*/g'
+
+# Constants:
+rm="rm -f"
+
+# Global variables:
+default_ofile=libtool
+can_build_shared=yes
+
+# All known linkers require a `.a' archive for static linking (except M$VC,
+# which needs '.lib').
+libext=a
+ltmain="$ac_aux_dir/ltmain.sh"
+ofile="$default_ofile"
+with_gnu_ld="$lt_cv_prog_gnu_ld"
+
+AC_CHECK_TOOL(AR, ar, false)
+AC_CHECK_TOOL(RANLIB, ranlib, :)
+AC_CHECK_TOOL(STRIP, strip, :)
+
+old_CC="$CC"
+old_CFLAGS="$CFLAGS"
+
+# Set sane defaults for various variables
+test -z "$AR" && AR=ar
+test -z "$AR_FLAGS" && AR_FLAGS=cru
+test -z "$AS" && AS=as
+test -z "$CC" && CC=cc
+test -z "$LTCC" && LTCC=$CC
+test -z "$DLLTOOL" && DLLTOOL=dlltool
+test -z "$LD" && LD=ld
+test -z "$LN_S" && LN_S="ln -s"
+test -z "$MAGIC_CMD" && MAGIC_CMD=file
+test -z "$NM" && NM=nm
+test -z "$SED" && SED=sed
+test -z "$OBJDUMP" && OBJDUMP=objdump
+test -z "$RANLIB" && RANLIB=:
+test -z "$STRIP" && STRIP=:
+test -z "$ac_objext" && ac_objext=o
+
+# Determine commands to create old-style static archives.
+old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs$old_deplibs'
+old_postinstall_cmds='chmod 644 $oldlib'
+old_postuninstall_cmds=
+
+if test -n "$RANLIB"; then
+ case $host_os in
+ openbsd*)
+ old_postinstall_cmds="\$RANLIB -t \$oldlib~$old_postinstall_cmds"
+ ;;
+ *)
+ old_postinstall_cmds="\$RANLIB \$oldlib~$old_postinstall_cmds"
+ ;;
+ esac
+ old_archive_cmds="$old_archive_cmds~\$RANLIB \$oldlib"
+fi
+
+# Only perform the check for file, if the check method requires it
+case $deplibs_check_method in
+file_magic*)
+ if test "$file_magic_cmd" = '$MAGIC_CMD'; then
+ AC_PATH_MAGIC
+ fi
+ ;;
+esac
+
+AC_PROVIDE_IFELSE([AC_LIBTOOL_DLOPEN], enable_dlopen=yes, enable_dlopen=no)
+AC_PROVIDE_IFELSE([AC_LIBTOOL_WIN32_DLL],
+enable_win32_dll=yes, enable_win32_dll=no)
+
+AC_ARG_ENABLE([libtool-lock],
+ [AC_HELP_STRING([--disable-libtool-lock],
+ [avoid locking (might break parallel builds)])])
+test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes
+
+AC_ARG_WITH([pic],
+ [AC_HELP_STRING([--with-pic],
+ [try to use only PIC/non-PIC objects @<:@default=use both@:>@])],
+ [pic_mode="$withval"],
+ [pic_mode=default])
+test -z "$pic_mode" && pic_mode=default
+
+# Use C for the default configuration in the libtool script
+tagname=
+AC_LIBTOOL_LANG_C_CONFIG
+_LT_AC_TAGCONFIG
+])# AC_LIBTOOL_SETUP
+
+
+# _LT_AC_SYS_COMPILER
+# -------------------
+AC_DEFUN([_LT_AC_SYS_COMPILER],
+[AC_REQUIRE([AC_PROG_CC])dnl
+
+# If no C compiler was specified, use CC.
+LTCC=${LTCC-"$CC"}
+
+# Allow CC to be a program name with arguments.
+compiler=$CC
+])# _LT_AC_SYS_COMPILER
+
+
+# _LT_AC_SYS_LIBPATH_AIX
+# ----------------------
+# Links a minimal program and checks the executable
+# for the system default hardcoded library path. In most cases,
+# this is /usr/lib:/lib, but when the MPI compilers are used
+# the location of the communication and MPI libs are included too.
+# If we don't find anything, use the default library path according
+# to the aix ld manual.
+AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX],
+[AC_LINK_IFELSE(AC_LANG_PROGRAM,[
+aix_libpath=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; }
+}'`
+# Check for a 64-bit object if we didn't find anything.
+if test -z "$aix_libpath"; then aix_libpath=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; }
+}'`; fi],[])
+if test -z "$aix_libpath"; then aix_libpath="/usr/lib:/lib"; fi
+])# _LT_AC_SYS_LIBPATH_AIX
+
+
+# _LT_AC_SHELL_INIT(ARG)
+# ----------------------
+AC_DEFUN([_LT_AC_SHELL_INIT],
+[ifdef([AC_DIVERSION_NOTICE],
+ [AC_DIVERT_PUSH(AC_DIVERSION_NOTICE)],
+ [AC_DIVERT_PUSH(NOTICE)])
+$1
+AC_DIVERT_POP
+])# _LT_AC_SHELL_INIT
+
+
+# _LT_AC_PROG_ECHO_BACKSLASH
+# --------------------------
+# Add some code to the start of the generated configure script which
+# will find an echo command which doesn't interpret backslashes.
+AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH],
+[_LT_AC_SHELL_INIT([
+# Check that we are running under the correct shell.
+SHELL=${CONFIG_SHELL-/bin/sh}
+
+case X$ECHO in
+X*--fallback-echo)
+ # Remove one level of quotation (which was required for Make).
+ ECHO=`echo "$ECHO" | sed 's,\\\\\[$]\\[$]0,'[$]0','`
+ ;;
+esac
+
+echo=${ECHO-echo}
+if test "X[$]1" = X--no-reexec; then
+ # Discard the --no-reexec flag, and continue.
+ shift
+elif test "X[$]1" = X--fallback-echo; then
+ # Avoid inline document here, it may be left over
+ :
+elif test "X`($echo '\t') 2>/dev/null`" = 'X\t' ; then
+ # Yippee, $echo works!
+ :
+else
+ # Restart under the correct shell.
+ exec $SHELL "[$]0" --no-reexec ${1+"[$]@"}
+fi
+
+if test "X[$]1" = X--fallback-echo; then
+ # used as fallback echo
+ shift
+ cat <<EOF
+[$]*
+EOF
+ exit 0
+fi
+
+# The HP-UX ksh and POSIX shell print the target directory to stdout
+# if CDPATH is set.
+if test "X${CDPATH+set}" = Xset; then CDPATH=:; export CDPATH; fi
+
+if test -z "$ECHO"; then
+if test "X${echo_test_string+set}" != Xset; then
+# find a string as large as possible, as long as the shell can cope with it
+ for cmd in 'sed 50q "[$]0"' 'sed 20q "[$]0"' 'sed 10q "[$]0"' 'sed 2q "[$]0"' 'echo test'; do
+ # expected sizes: less than 2Kb, 1Kb, 512 bytes, 16 bytes, ...
+ if (echo_test_string="`eval $cmd`") 2>/dev/null &&
+ echo_test_string="`eval $cmd`" &&
+ (test "X$echo_test_string" = "X$echo_test_string") 2>/dev/null
+ then
+ break
+ fi
+ done
+fi
+
+if test "X`($echo '\t') 2>/dev/null`" = 'X\t' &&
+ echo_testing_string=`($echo "$echo_test_string") 2>/dev/null` &&
+ test "X$echo_testing_string" = "X$echo_test_string"; then
+ :
+else
+ # The Solaris, AIX, and Digital Unix default echo programs unquote
+ # backslashes. This makes it impossible to quote backslashes using
+ # echo "$something" | sed 's/\\/\\\\/g'
+ #
+ # So, first we look for a working echo in the user's PATH.
+
+ lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+ for dir in $PATH /usr/ucb; do
+ IFS="$lt_save_ifs"
+ if (test -f $dir/echo || test -f $dir/echo$ac_exeext) &&
+ test "X`($dir/echo '\t') 2>/dev/null`" = 'X\t' &&
+ echo_testing_string=`($dir/echo "$echo_test_string") 2>/dev/null` &&
+ test "X$echo_testing_string" = "X$echo_test_string"; then
+ echo="$dir/echo"
+ break
+ fi
+ done
+ IFS="$lt_save_ifs"
+
+ if test "X$echo" = Xecho; then
+ # We didn't find a better echo, so look for alternatives.
+ if test "X`(print -r '\t') 2>/dev/null`" = 'X\t' &&
+ echo_testing_string=`(print -r "$echo_test_string") 2>/dev/null` &&
+ test "X$echo_testing_string" = "X$echo_test_string"; then
+ # This shell has a builtin print -r that does the trick.
+ echo='print -r'
+ elif (test -f /bin/ksh || test -f /bin/ksh$ac_exeext) &&
+ test "X$CONFIG_SHELL" != X/bin/ksh; then
+ # If we have ksh, try running configure again with it.
+ ORIGINAL_CONFIG_SHELL=${CONFIG_SHELL-/bin/sh}
+ export ORIGINAL_CONFIG_SHELL
+ CONFIG_SHELL=/bin/ksh
+ export CONFIG_SHELL
+ exec $CONFIG_SHELL "[$]0" --no-reexec ${1+"[$]@"}
+ else
+ # Try using printf.
+ echo='printf %s\n'
+ if test "X`($echo '\t') 2>/dev/null`" = 'X\t' &&
+ echo_testing_string=`($echo "$echo_test_string") 2>/dev/null` &&
+ test "X$echo_testing_string" = "X$echo_test_string"; then
+ # Cool, printf works
+ :
+ elif echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` &&
+ test "X$echo_testing_string" = 'X\t' &&
+ echo_testing_string=`($ORIGINAL_CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` &&
+ test "X$echo_testing_string" = "X$echo_test_string"; then
+ CONFIG_SHELL=$ORIGINAL_CONFIG_SHELL
+ export CONFIG_SHELL
+ SHELL="$CONFIG_SHELL"
+ export SHELL
+ echo="$CONFIG_SHELL [$]0 --fallback-echo"
+ elif echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo '\t') 2>/dev/null` &&
+ test "X$echo_testing_string" = 'X\t' &&
+ echo_testing_string=`($CONFIG_SHELL "[$]0" --fallback-echo "$echo_test_string") 2>/dev/null` &&
+ test "X$echo_testing_string" = "X$echo_test_string"; then
+ echo="$CONFIG_SHELL [$]0 --fallback-echo"
+ else
+ # maybe with a smaller string...
+ prev=:
+
+ for cmd in 'echo test' 'sed 2q "[$]0"' 'sed 10q "[$]0"' 'sed 20q "[$]0"' 'sed 50q "[$]0"'; do
+ if (test "X$echo_test_string" = "X`eval $cmd`") 2>/dev/null
+ then
+ break
+ fi
+ prev="$cmd"
+ done
+
+ if test "$prev" != 'sed 50q "[$]0"'; then
+ echo_test_string=`eval $prev`
+ export echo_test_string
+ exec ${ORIGINAL_CONFIG_SHELL-${CONFIG_SHELL-/bin/sh}} "[$]0" ${1+"[$]@"}
+ else
+ # Oops. We lost completely, so just stick with echo.
+ echo=echo
+ fi
+ fi
+ fi
+ fi
+fi
+fi
+
+# Copy echo and quote the copy suitably for passing to libtool from
+# the Makefile, instead of quoting the original, which is used later.
+ECHO=$echo
+if test "X$ECHO" = "X$CONFIG_SHELL [$]0 --fallback-echo"; then
+ ECHO="$CONFIG_SHELL \\\$\[$]0 --fallback-echo"
+fi
+
+AC_SUBST(ECHO)
+])])# _LT_AC_PROG_ECHO_BACKSLASH
+
+
+# _LT_AC_LOCK
+# -----------
+AC_DEFUN([_LT_AC_LOCK],
+[AC_ARG_ENABLE([libtool-lock],
+ [AC_HELP_STRING([--disable-libtool-lock],
+ [avoid locking (might break parallel builds)])])
+test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes
+
+# Some flags need to be propagated to the compiler or linker for good
+# libtool support.
+case $host in
+ia64-*-hpux*)
+ # Find out which ABI we are using.
+ echo 'int i;' > conftest.$ac_ext
+ if AC_TRY_EVAL(ac_compile); then
+ case `/usr/bin/file conftest.$ac_objext` in
+ *ELF-32*)
+ HPUX_IA64_MODE="32"
+ ;;
+ *ELF-64*)
+ HPUX_IA64_MODE="64"
+ ;;
+ esac
+ fi
+ rm -rf conftest*
+ ;;
+*-*-irix6*)
+ # Find out which ABI we are using.
+ echo '[#]line __oline__ "configure"' > conftest.$ac_ext
+ if AC_TRY_EVAL(ac_compile); then
+ if test "$lt_cv_prog_gnu_ld" = yes; then
+ case `/usr/bin/file conftest.$ac_objext` in
+ *32-bit*)
+ LD="${LD-ld} -melf32bsmip"
+ ;;
+ *N32*)
+ LD="${LD-ld} -melf32bmipn32"
+ ;;
+ *64-bit*)
+ LD="${LD-ld} -melf64bmip"
+ ;;
+ esac
+ else
+ case `/usr/bin/file conftest.$ac_objext` in
+ *32-bit*)
+ LD="${LD-ld} -32"
+ ;;
+ *N32*)
+ LD="${LD-ld} -n32"
+ ;;
+ *64-bit*)
+ LD="${LD-ld} -64"
+ ;;
+ esac
+ fi
+ fi
+ rm -rf conftest*
+ ;;
+
+x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*|s390*-*linux*|sparc*-*linux*)
+ # Find out which ABI we are using.
+ echo 'int i;' > conftest.$ac_ext
+ if AC_TRY_EVAL(ac_compile); then
+ case "`/usr/bin/file conftest.o`" in
+ *32-bit*)
+ case $host in
+ x86_64-*linux*)
+ LD="${LD-ld} -m elf_i386"
+ ;;
+ ppc64-*linux*|powerpc64-*linux*)
+ LD="${LD-ld} -m elf32ppclinux"
+ ;;
+ s390x-*linux*)
+ LD="${LD-ld} -m elf_s390"
+ ;;
+ sparc64-*linux*)
+ LD="${LD-ld} -m elf32_sparc"
+ ;;
+ esac
+ ;;
+ *64-bit*)
+ case $host in
+ x86_64-*linux*)
+ LD="${LD-ld} -m elf_x86_64"
+ ;;
+ ppc*-*linux*|powerpc*-*linux*)
+ LD="${LD-ld} -m elf64ppc"
+ ;;
+ s390*-*linux*)
+ LD="${LD-ld} -m elf64_s390"
+ ;;
+ sparc*-*linux*)
+ LD="${LD-ld} -m elf64_sparc"
+ ;;
+ esac
+ ;;
+ esac
+ fi
+ rm -rf conftest*
+ ;;
+
+*-*-sco3.2v5*)
+ # On SCO OpenServer 5, we need -belf to get full-featured binaries.
+ SAVE_CFLAGS="$CFLAGS"
+ CFLAGS="$CFLAGS -belf"
+ AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf,
+ [AC_LANG_PUSH(C)
+ AC_TRY_LINK([],[],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no])
+ AC_LANG_POP])
+ if test x"$lt_cv_cc_needs_belf" != x"yes"; then
+ # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf
+ CFLAGS="$SAVE_CFLAGS"
+ fi
+ ;;
+AC_PROVIDE_IFELSE([AC_LIBTOOL_WIN32_DLL],
+[*-*-cygwin* | *-*-mingw* | *-*-pw32*)
+ AC_CHECK_TOOL(DLLTOOL, dlltool, false)
+ AC_CHECK_TOOL(AS, as, false)
+ AC_CHECK_TOOL(OBJDUMP, objdump, false)
+ ;;
+ ])
+esac
+
+need_locks="$enable_libtool_lock"
+
+])# _LT_AC_LOCK
+
+
+# AC_LIBTOOL_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,
+# [OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE])
+# ----------------------------------------------------------------
+# Check whether the given compiler option works
+AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION],
+[AC_REQUIRE([LT_AC_PROG_SED])
+AC_CACHE_CHECK([$1], [$2],
+ [$2=no
+ ifelse([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4])
+ printf "$lt_simple_compile_test_code" > conftest.$ac_ext
+ lt_compiler_flag="$3"
+ # Insert the option either (1) after the last *FLAGS variable, or
+ # (2) before a word containing "conftest.", or (3) at the end.
+ # Note that $ac_compile itself does not contain backslashes and begins
+ # with a dollar sign (not a hyphen), so the echo should work correctly.
+ # The option is referenced via a variable to avoid confusing sed.
+ lt_compile=`echo "$ac_compile" | $SED \
+ -e 's:.*FLAGS}? :&$lt_compiler_flag :; t' \
+ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \
+ -e 's:$: $lt_compiler_flag:'`
+ (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD)
+ (eval "$lt_compile" 2>conftest.err)
+ ac_status=$?
+ cat conftest.err >&AS_MESSAGE_LOG_FD
+ echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD
+ if (exit $ac_status) && test -s "$ac_outfile"; then
+ # The compiler can only warn and ignore the option if not recognized
+ # So say no if there are warnings
+ if test ! -s conftest.err; then
+ $2=yes
+ fi
+ fi
+ $rm conftest*
+])
+
+if test x"[$]$2" = xyes; then
+ ifelse([$5], , :, [$5])
+else
+ ifelse([$6], , :, [$6])
+fi
+])# AC_LIBTOOL_COMPILER_OPTION
+
+
+# AC_LIBTOOL_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,
+# [ACTION-SUCCESS], [ACTION-FAILURE])
+# ------------------------------------------------------------
+# Check whether the given compiler option works
+AC_DEFUN([AC_LIBTOOL_LINKER_OPTION],
+[AC_CACHE_CHECK([$1], [$2],
+ [$2=no
+ save_LDFLAGS="$LDFLAGS"
+ LDFLAGS="$LDFLAGS $3"
+ printf "$lt_simple_link_test_code" > conftest.$ac_ext
+ if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then
+ # The compiler can only warn and ignore the option if not recognized
+ # So say no if there are warnings
+ if test -s conftest.err; then
+ # Append any errors to the config.log.
+ cat conftest.err 1>&AS_MESSAGE_LOG_FD
+ else
+ $2=yes
+ fi
+ fi
+ $rm conftest*
+ LDFLAGS="$save_LDFLAGS"
+])
+
+if test x"[$]$2" = xyes; then
+ ifelse([$4], , :, [$4])
+else
+ ifelse([$5], , :, [$5])
+fi
+])# AC_LIBTOOL_LINKER_OPTION
+
+
+# AC_LIBTOOL_SYS_MAX_CMD_LEN
+# --------------------------
+AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN],
+[# find the maximum length of command line arguments
+AC_MSG_CHECKING([the maximum length of command line arguments])
+AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl
+ i=0
+ teststring="ABCD"
+
+ case $build_os in
+ msdosdjgpp*)
+ # On DJGPP, this test can blow up pretty badly due to problems in libc
+ # (any single argument exceeding 2000 bytes causes a buffer overrun
+ # during glob expansion). Even if it were fixed, the result of this
+ # check would be larger than it should be.
+ lt_cv_sys_max_cmd_len=12288; # 12K is about right
+ ;;
+
+ gnu*)
+ # Under GNU Hurd, this test is not required because there is
+ # no limit to the length of command line arguments.
+ # Libtool will interpret -1 as no limit whatsoever
+ lt_cv_sys_max_cmd_len=-1;
+ ;;
+
+ cygwin* | mingw*)
+ # On Win9x/ME, this test blows up -- it succeeds, but takes
+ # about 5 minutes as the teststring grows exponentially.
+ # Worse, since 9x/ME are not pre-emptively multitasking,
+ # you end up with a "frozen" computer, even though with patience
+ # the test eventually succeeds (with a max line length of 256k).
+ # Instead, let's just punt: use the minimum linelength reported by
+ # all of the supported platforms: 8192 (on NT/2K/XP).
+ lt_cv_sys_max_cmd_len=8192;
+ ;;
+
+ amigaos*)
+ # On AmigaOS with pdksh, this test takes hours, literally.
+ # So we just punt and use a minimum line length of 8192.
+ lt_cv_sys_max_cmd_len=8192;
+ ;;
+
+ *)
+ # If test is not a shell built-in, we'll probably end up computing a
+ # maximum length that is only half of the actual maximum length, but
+ # we can't tell.
+ while (test "X"`$CONFIG_SHELL [$]0 --fallback-echo "X$teststring" 2>/dev/null` \
+ = "XX$teststring") >/dev/null 2>&1 &&
+ new_result=`expr "X$teststring" : ".*" 2>&1` &&
+ lt_cv_sys_max_cmd_len=$new_result &&
+ test $i != 17 # 1/2 MB should be enough
+ do
+ i=`expr $i + 1`
+ teststring=$teststring$teststring
+ done
+ teststring=
+ # Add a significant safety factor because C++ compilers can tack on massive
+ # amounts of additional arguments before passing them to the linker.
+ # It appears as though 1/2 is a usable value.
+ lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2`
+ ;;
+ esac
+])
+if test -n $lt_cv_sys_max_cmd_len ; then
+ AC_MSG_RESULT($lt_cv_sys_max_cmd_len)
+else
+ AC_MSG_RESULT(none)
+fi
+])# AC_LIBTOOL_SYS_MAX_CMD_LEN
+
+
+# _LT_AC_CHECK_DLFCN
+# --------------------
+AC_DEFUN([_LT_AC_CHECK_DLFCN],
+[AC_CHECK_HEADERS(dlfcn.h)dnl
+])# _LT_AC_CHECK_DLFCN
+
+
+# _LT_AC_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE,
+# ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING)
+# ------------------------------------------------------------------
+AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF],
+[AC_REQUIRE([_LT_AC_CHECK_DLFCN])dnl
+if test "$cross_compiling" = yes; then :
+ [$4]
+else
+ lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2
+ lt_status=$lt_dlunknown
+ cat > conftest.$ac_ext <<EOF
+[#line __oline__ "configure"
+#include "confdefs.h"
+
+#if HAVE_DLFCN_H
+#include <dlfcn.h>
+#endif
+
+#include <stdio.h>
+
+#ifdef RTLD_GLOBAL
+# define LT_DLGLOBAL RTLD_GLOBAL
+#else
+# ifdef DL_GLOBAL
+# define LT_DLGLOBAL DL_GLOBAL
+# else
+# define LT_DLGLOBAL 0
+# endif
+#endif
+
+/* We may have to define LT_DLLAZY_OR_NOW in the command line if we
+ find out it does not work in some platform. */
+#ifndef LT_DLLAZY_OR_NOW
+# ifdef RTLD_LAZY
+# define LT_DLLAZY_OR_NOW RTLD_LAZY
+# else
+# ifdef DL_LAZY
+# define LT_DLLAZY_OR_NOW DL_LAZY
+# else
+# ifdef RTLD_NOW
+# define LT_DLLAZY_OR_NOW RTLD_NOW
+# else
+# ifdef DL_NOW
+# define LT_DLLAZY_OR_NOW DL_NOW
+# else
+# define LT_DLLAZY_OR_NOW 0
+# endif
+# endif
+# endif
+# endif
+#endif
+
+#ifdef __cplusplus
+extern "C" void exit (int);
+#endif
+
+void fnord() { int i=42;}
+int main ()
+{
+ void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);
+ int status = $lt_dlunknown;
+
+ if (self)
+ {
+ if (dlsym (self,"fnord")) status = $lt_dlno_uscore;
+ else if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore;
+ /* dlclose (self); */
+ }
+
+ exit (status);
+}]
+EOF
+ if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then
+ (./conftest; exit; ) 2>/dev/null
+ lt_status=$?
+ case x$lt_status in
+ x$lt_dlno_uscore) $1 ;;
+ x$lt_dlneed_uscore) $2 ;;
+ x$lt_unknown|x*) $3 ;;
+ esac
+ else :
+ # compilation failed
+ $3
+ fi
+fi
+rm -fr conftest*
+])# _LT_AC_TRY_DLOPEN_SELF
+
+
+# AC_LIBTOOL_DLOPEN_SELF
+# -------------------
+AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF],
+[AC_REQUIRE([_LT_AC_CHECK_DLFCN])dnl
+if test "x$enable_dlopen" != xyes; then
+ enable_dlopen=unknown
+ enable_dlopen_self=unknown
+ enable_dlopen_self_static=unknown
+else
+ lt_cv_dlopen=no
+ lt_cv_dlopen_libs=
+
+ case $host_os in
+ beos*)
+ lt_cv_dlopen="load_add_on"
+ lt_cv_dlopen_libs=
+ lt_cv_dlopen_self=yes
+ ;;
+
+ mingw* | pw32*)
+ lt_cv_dlopen="LoadLibrary"
+ lt_cv_dlopen_libs=
+ ;;
+
+ cygwin*)
+ lt_cv_dlopen="dlopen"
+ lt_cv_dlopen_libs=
+ ;;
+
+ darwin*)
+ # if libdl is installed we need to link against it
+ AC_CHECK_LIB([dl], [dlopen],
+ [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],[
+ lt_cv_dlopen="dyld"
+ lt_cv_dlopen_libs=
+ lt_cv_dlopen_self=yes
+ ])
+ ;;
+
+ *)
+ AC_CHECK_FUNC([shl_load],
+ [lt_cv_dlopen="shl_load"],
+ [AC_CHECK_LIB([dld], [shl_load],
+ [lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-dld"],
+ [AC_CHECK_FUNC([dlopen],
+ [lt_cv_dlopen="dlopen"],
+ [AC_CHECK_LIB([dl], [dlopen],
+ [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],
+ [AC_CHECK_LIB([svld], [dlopen],
+ [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld"],
+ [AC_CHECK_LIB([dld], [dld_link],
+ [lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-dld"])
+ ])
+ ])
+ ])
+ ])
+ ])
+ ;;
+ esac
+
+ if test "x$lt_cv_dlopen" != xno; then
+ enable_dlopen=yes
+ else
+ enable_dlopen=no
+ fi
+
+ case $lt_cv_dlopen in
+ dlopen)
+ save_CPPFLAGS="$CPPFLAGS"
+ test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H"
+
+ save_LDFLAGS="$LDFLAGS"
+ eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\"
+
+ save_LIBS="$LIBS"
+ LIBS="$lt_cv_dlopen_libs $LIBS"
+
+ AC_CACHE_CHECK([whether a program can dlopen itself],
+ lt_cv_dlopen_self, [dnl
+ _LT_AC_TRY_DLOPEN_SELF(
+ lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes,
+ lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross)
+ ])
+
+ if test "x$lt_cv_dlopen_self" = xyes; then
+ LDFLAGS="$LDFLAGS $link_static_flag"
+ AC_CACHE_CHECK([whether a statically linked program can dlopen itself],
+ lt_cv_dlopen_self_static, [dnl
+ _LT_AC_TRY_DLOPEN_SELF(
+ lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes,
+ lt_cv_dlopen_self_static=no, lt_cv_dlopen_self_static=cross)
+ ])
+ fi
+
+ CPPFLAGS="$save_CPPFLAGS"
+ LDFLAGS="$save_LDFLAGS"
+ LIBS="$save_LIBS"
+ ;;
+ esac
+
+ case $lt_cv_dlopen_self in
+ yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;;
+ *) enable_dlopen_self=unknown ;;
+ esac
+
+ case $lt_cv_dlopen_self_static in
+ yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;;
+ *) enable_dlopen_self_static=unknown ;;
+ esac
+fi
+])# AC_LIBTOOL_DLOPEN_SELF
+
+
+# AC_LIBTOOL_PROG_CC_C_O([TAGNAME])
+# ---------------------------------
+# Check to see if options -c and -o are simultaneously supported by compiler
+AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O],
+[AC_REQUIRE([_LT_AC_SYS_COMPILER])dnl
+AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext],
+ [_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)],
+ [_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no
+ $rm -r conftest 2>/dev/null
+ mkdir conftest
+ cd conftest
+ mkdir out
+ printf "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+ lt_compiler_flag="-o out/conftest2.$ac_objext"
+ # Insert the option either (1) after the last *FLAGS variable, or
+ # (2) before a word containing "conftest.", or (3) at the end.
+ # Note that $ac_compile itself does not contain backslashes and begins
+ # with a dollar sign (not a hyphen), so the echo should work correctly.
+ lt_compile=`echo "$ac_compile" | $SED \
+ -e 's:.*FLAGS}? :&$lt_compiler_flag :; t' \
+ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \
+ -e 's:$: $lt_compiler_flag:'`
+ (eval echo "\"\$as_me:__oline__: $lt_compile\"" >&AS_MESSAGE_LOG_FD)
+ (eval "$lt_compile" 2>out/conftest.err)
+ ac_status=$?
+ cat out/conftest.err >&AS_MESSAGE_LOG_FD
+ echo "$as_me:__oline__: \$? = $ac_status" >&AS_MESSAGE_LOG_FD
+ if (exit $ac_status) && test -s out/conftest2.$ac_objext
+ then
+ # The compiler can only warn and ignore the option if not recognized
+ # So say no if there are warnings
+ if test ! -s out/conftest.err; then
+ _LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes
+ fi
+ fi
+ chmod u+w .
+ $rm conftest*
+ # SGI C++ compiler will create directory out/ii_files/ for
+ # template instantiation
+ test -d out/ii_files && $rm out/ii_files/* && rmdir out/ii_files
+ $rm out/* && rmdir out
+ cd ..
+ rmdir conftest
+ $rm conftest*
+])
+])# AC_LIBTOOL_PROG_CC_C_O
+
+
+# AC_LIBTOOL_SYS_HARD_LINK_LOCKS([TAGNAME])
+# -----------------------------------------
+# Check to see if we can do hard links to lock some files if needed
+AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS],
+[AC_REQUIRE([_LT_AC_LOCK])dnl
+
+hard_links="nottested"
+if test "$_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; then
+ # do not overwrite the value of need_locks provided by the user
+ AC_MSG_CHECKING([if we can lock with hard links])
+ hard_links=yes
+ $rm conftest*
+ ln conftest.a conftest.b 2>/dev/null && hard_links=no
+ touch conftest.a
+ ln conftest.a conftest.b 2>&5 || hard_links=no
+ ln conftest.a conftest.b 2>/dev/null && hard_links=no
+ AC_MSG_RESULT([$hard_links])
+ if test "$hard_links" = no; then
+ AC_MSG_WARN([`$CC' does not support `-c -o', so `make -j' may be unsafe])
+ need_locks=warn
+ fi
+else
+ need_locks=no
+fi
+])# AC_LIBTOOL_SYS_HARD_LINK_LOCKS
+
+
+# AC_LIBTOOL_OBJDIR
+# -----------------
+AC_DEFUN([AC_LIBTOOL_OBJDIR],
+[AC_CACHE_CHECK([for objdir], [lt_cv_objdir],
+[rm -f .libs 2>/dev/null
+mkdir .libs 2>/dev/null
+if test -d .libs; then
+ lt_cv_objdir=.libs
+else
+ # MS-DOS does not allow filenames that begin with a dot.
+ lt_cv_objdir=_libs
+fi
+rmdir .libs 2>/dev/null])
+objdir=$lt_cv_objdir
+])# AC_LIBTOOL_OBJDIR
+
+
+# AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH([TAGNAME])
+# ----------------------------------------------
+# Check hardcoding attributes.
+AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH],
+[AC_MSG_CHECKING([how to hardcode library paths into programs])
+_LT_AC_TAGVAR(hardcode_action, $1)=
+if test -n "$_LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)" || \
+ test -n "$_LT_AC_TAGVAR(runpath_var $1)" || \
+ test "X$_LT_AC_TAGVAR(hardcode_automatic, $1)"="Xyes" ; then
+
+ # We can hardcode non-existant directories.
+ if test "$_LT_AC_TAGVAR(hardcode_direct, $1)" != no &&
+ # If the only mechanism to avoid hardcoding is shlibpath_var, we
+ # have to relink, otherwise we might link with an installed library
+ # when we should be linking with a yet-to-be-installed one
+ ## test "$_LT_AC_TAGVAR(hardcode_shlibpath_var, $1)" != no &&
+ test "$_LT_AC_TAGVAR(hardcode_minus_L, $1)" != no; then
+ # Linking always hardcodes the temporary library directory.
+ _LT_AC_TAGVAR(hardcode_action, $1)=relink
+ else
+ # We can link without hardcoding, and we can hardcode nonexisting dirs.
+ _LT_AC_TAGVAR(hardcode_action, $1)=immediate
+ fi
+else
+ # We cannot hardcode anything, or else we can only hardcode existing
+ # directories.
+ _LT_AC_TAGVAR(hardcode_action, $1)=unsupported
+fi
+AC_MSG_RESULT([$_LT_AC_TAGVAR(hardcode_action, $1)])
+
+if test "$_LT_AC_TAGVAR(hardcode_action, $1)" = relink; then
+ # Fast installation is not supported
+ enable_fast_install=no
+elif test "$shlibpath_overrides_runpath" = yes ||
+ test "$enable_shared" = no; then
+ # Fast installation is not necessary
+ enable_fast_install=needless
+fi
+])# AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH
+
+
+# AC_LIBTOOL_SYS_LIB_STRIP
+# ------------------------
+AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP],
+[striplib=
+old_striplib=
+AC_MSG_CHECKING([whether stripping libraries is possible])
+if test -n "$STRIP" && $STRIP -V 2>&1 | grep "GNU strip" >/dev/null; then
+ test -z "$old_striplib" && old_striplib="$STRIP --strip-debug"
+ test -z "$striplib" && striplib="$STRIP --strip-unneeded"
+ AC_MSG_RESULT([yes])
+else
+# FIXME - insert some real tests, host_os isn't really good enough
+ case $host_os in
+ darwin*)
+ if test -n "$STRIP" ; then
+ striplib="$STRIP -x"
+ AC_MSG_RESULT([yes])
+ else
+ AC_MSG_RESULT([no])
+fi
+ ;;
+ *)
+ AC_MSG_RESULT([no])
+ ;;
+ esac
+fi
+])# AC_LIBTOOL_SYS_LIB_STRIP
+
+
+# AC_LIBTOOL_SYS_DYNAMIC_LINKER
+# -----------------------------
+# PORTME Fill in your ld.so characteristics
+AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER],
+[AC_MSG_CHECKING([dynamic linker characteristics])
+library_names_spec=
+libname_spec='lib$name'
+soname_spec=
+shrext_cmds=".so"
+postinstall_cmds=
+postuninstall_cmds=
+finish_cmds=
+finish_eval=
+shlibpath_var=
+shlibpath_overrides_runpath=unknown
+version_type=none
+dynamic_linker="$host_os ld.so"
+sys_lib_dlsearch_path_spec="/lib /usr/lib"
+if test "$GCC" = yes; then
+ sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"`
+ if echo "$sys_lib_search_path_spec" | grep ';' >/dev/null ; then
+ # if the path contains ";" then we assume it to be the separator
+ # otherwise default to the standard path separator (i.e. ":") - it is
+ # assumed that no part of a normal pathname contains ";" but that should
+ # okay in the real world where ";" in dirpaths is itself problematic.
+ sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'`
+ else
+ sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`
+ fi
+else
+ sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib"
+fi
+need_lib_prefix=unknown
+hardcode_into_libs=no
+
+# when you set need_version to no, make sure it does not cause -set_version
+# flags to be left without arguments
+need_version=unknown
+
+case $host_os in
+aix3*)
+ version_type=linux
+ library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a'
+ shlibpath_var=LIBPATH
+
+ # AIX 3 has no versioning support, so we append a major version to the name.
+ soname_spec='${libname}${release}${shared_ext}$major'
+ ;;
+
+aix4* | aix5*)
+ version_type=linux
+ need_lib_prefix=no
+ need_version=no
+ hardcode_into_libs=yes
+ if test "$host_cpu" = ia64; then
+ # AIX 5 supports IA64
+ library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}'
+ shlibpath_var=LD_LIBRARY_PATH
+ else
+ # With GCC up to 2.95.x, collect2 would create an import file
+ # for dependence libraries. The import file would start with
+ # the line `#! .'. This would cause the generated library to
+ # depend on `.', always an invalid library. This was fixed in
+ # development snapshots of GCC prior to 3.0.
+ case $host_os in
+ aix4 | aix4.[[01]] | aix4.[[01]].*)
+ if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'
+ echo ' yes '
+ echo '#endif'; } | ${CC} -E - | grep yes > /dev/null; then
+ :
+ else
+ can_build_shared=no
+ fi
+ ;;
+ esac
+ # AIX (on Power*) has no versioning support, so currently we can not hardcode correct
+ # soname into executable. Probably we can add versioning support to
+ # collect2, so additional links can be useful in future.
+ if test "$aix_use_runtimelinking" = yes; then
+ # If using run time linking (on AIX 4.2 or later) use lib<name>.so
+ # instead of lib<name>.a to let people know that these are not
+ # typical AIX shared libraries.
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ else
+ # We preserve .a as extension for shared libraries through AIX4.2
+ # and later when we are not doing run time linking.
+ library_names_spec='${libname}${release}.a $libname.a'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ fi
+ shlibpath_var=LIBPATH
+ fi
+ ;;
+
+amigaos*)
+ library_names_spec='$libname.ixlibrary $libname.a'
+ # Create ${libname}_ixlibrary.a entries in /sys/libs.
+ finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`$echo "X$lib" | $Xsed -e '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; test $rm /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'
+ ;;
+
+beos*)
+ library_names_spec='${libname}${shared_ext}'
+ dynamic_linker="$host_os ld.so"
+ shlibpath_var=LIBRARY_PATH
+ ;;
+
+bsdi4*)
+ version_type=linux
+ need_version=no
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir'
+ shlibpath_var=LD_LIBRARY_PATH
+ sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib"
+ sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib"
+ # the default ld.so.conf also contains /usr/contrib/lib and
+ # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow
+ # libtool to hard-code these into programs
+ ;;
+
+cygwin* | mingw* | pw32*)
+ version_type=windows
+ shrext_cmds=".dll"
+ need_version=no
+ need_lib_prefix=no
+
+ case $GCC,$host_os in
+ yes,cygwin* | yes,mingw* | yes,pw32*)
+ library_names_spec='$libname.dll.a'
+ # DLL is installed to $(libdir)/../bin by postinstall_cmds
+ postinstall_cmds='base_file=`basename \${file}`~
+ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i;echo \$dlname'\''`~
+ dldir=$destdir/`dirname \$dlpath`~
+ test -d \$dldir || mkdir -p \$dldir~
+ $install_prog $dir/$dlname \$dldir/$dlname'
+ postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~
+ dlpath=$dir/\$dldll~
+ $rm \$dlpath'
+ shlibpath_overrides_runpath=yes
+
+ case $host_os in
+ cygwin*)
+ # Cygwin DLLs use 'cyg' prefix rather than 'lib'
+ soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'
+ sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib"
+ ;;
+ mingw*)
+ # MinGW DLLs use traditional 'lib' prefix
+ soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'
+ sys_lib_search_path_spec=`$CC -print-search-dirs | grep "^libraries:" | $SED -e "s/^libraries://" -e "s,=/,/,g"`
+ if echo "$sys_lib_search_path_spec" | [grep ';[c-zC-Z]:/' >/dev/null]; then
+ # It is most probably a Windows format PATH printed by
+ # mingw gcc, but we are running on Cygwin. Gcc prints its search
+ # path with ; separators, and with drive letters. We can handle the
+ # drive letters (cygwin fileutils understands them), so leave them,
+ # especially as we might pass files found there to a mingw objdump,
+ # which wouldn't understand a cygwinified path. Ahh.
+ sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'`
+ else
+ sys_lib_search_path_spec=`echo "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`
+ fi
+ ;;
+ pw32*)
+ # pw32 DLLs use 'pw' prefix rather than 'lib'
+ library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
+ ;;
+ esac
+ ;;
+
+ *)
+ library_names_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext} $libname.lib'
+ ;;
+ esac
+ dynamic_linker='Win32 ld.exe'
+ # FIXME: first we should search . and the directory the executable is in
+ shlibpath_var=PATH
+ ;;
+
+darwin* | rhapsody*)
+ dynamic_linker="$host_os dyld"
+ version_type=darwin
+ need_lib_prefix=no
+ need_version=no
+ library_names_spec='${libname}${release}${versuffix}$shared_ext ${libname}${release}${major}$shared_ext ${libname}$shared_ext'
+ soname_spec='${libname}${release}${major}$shared_ext'
+ shlibpath_overrides_runpath=yes
+ shlibpath_var=DYLD_LIBRARY_PATH
+ shrext_cmds='$(test .$module = .yes && echo .so || echo .dylib)'
+ # Apple's gcc prints 'gcc -print-search-dirs' doesn't operate the same.
+ if test "$GCC" = yes; then
+ sys_lib_search_path_spec=`$CC -print-search-dirs | tr "\n" "$PATH_SEPARATOR" | sed -e 's/libraries:/@libraries:/' | tr "@" "\n" | grep "^libraries:" | sed -e "s/^libraries://" -e "s,=/,/,g" -e "s,$PATH_SEPARATOR, ,g" -e "s,.*,& /lib /usr/lib /usr/local/lib,g"`
+ else
+ sys_lib_search_path_spec='/lib /usr/lib /usr/local/lib'
+ fi
+ sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'
+ ;;
+
+dgux*)
+ version_type=linux
+ need_lib_prefix=no
+ need_version=no
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ shlibpath_var=LD_LIBRARY_PATH
+ ;;
+
+freebsd1*)
+ dynamic_linker=no
+ ;;
+
+kfreebsd*-gnu)
+ version_type=linux
+ need_lib_prefix=no
+ need_version=no
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ shlibpath_var=LD_LIBRARY_PATH
+ shlibpath_overrides_runpath=no
+ hardcode_into_libs=yes
+ dynamic_linker='GNU ld.so'
+ ;;
+
+freebsd*)
+ objformat=`test -x /usr/bin/objformat && /usr/bin/objformat || echo aout`
+ version_type=freebsd-$objformat
+ case $version_type in
+ freebsd-elf*)
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'
+ need_version=no
+ need_lib_prefix=no
+ ;;
+ freebsd-*)
+ library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix'
+ need_version=yes
+ ;;
+ esac
+ shlibpath_var=LD_LIBRARY_PATH
+ case $host_os in
+ freebsd2*)
+ shlibpath_overrides_runpath=yes
+ ;;
+ freebsd3.[01]* | freebsdelf3.[01]*)
+ shlibpath_overrides_runpath=yes
+ hardcode_into_libs=yes
+ ;;
+ *) # from 3.2 on
+ shlibpath_overrides_runpath=no
+ hardcode_into_libs=yes
+ ;;
+ esac
+ ;;
+
+gnu*)
+ version_type=linux
+ need_lib_prefix=no
+ need_version=no
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ shlibpath_var=LD_LIBRARY_PATH
+ hardcode_into_libs=yes
+ ;;
+
+hpux9* | hpux10* | hpux11*)
+ # Give a soname corresponding to the major version so that dld.sl refuses to
+ # link against other versions.
+ version_type=sunos
+ need_lib_prefix=no
+ need_version=no
+ case "$host_cpu" in
+ ia64*)
+ shrext_cmds='.so'
+ hardcode_into_libs=yes
+ dynamic_linker="$host_os dld.so"
+ shlibpath_var=LD_LIBRARY_PATH
+ shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ if test "X$HPUX_IA64_MODE" = X32; then
+ sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib"
+ else
+ sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64"
+ fi
+ sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec
+ ;;
+ hppa*64*)
+ shrext_cmds='.sl'
+ hardcode_into_libs=yes
+ dynamic_linker="$host_os dld.sl"
+ shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH
+ shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64"
+ sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec
+ ;;
+ *)
+ shrext_cmds='.sl'
+ dynamic_linker="$host_os dld.sl"
+ shlibpath_var=SHLIB_PATH
+ shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ ;;
+ esac
+ # HP-UX runs *really* slowly unless shared libraries are mode 555.
+ postinstall_cmds='chmod 555 $lib'
+ ;;
+
+irix5* | irix6* | nonstopux*)
+ case $host_os in
+ nonstopux*) version_type=nonstopux ;;
+ *)
+ if test "$lt_cv_prog_gnu_ld" = yes; then
+ version_type=linux
+ else
+ version_type=irix
+ fi ;;
+ esac
+ need_lib_prefix=no
+ need_version=no
+ soname_spec='${libname}${release}${shared_ext}$major'
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}'
+ case $host_os in
+ irix5* | nonstopux*)
+ libsuff= shlibsuff=
+ ;;
+ *)
+ case $LD in # libtool.m4 will add one of these switches to LD
+ *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ")
+ libsuff= shlibsuff= libmagic=32-bit;;
+ *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ")
+ libsuff=32 shlibsuff=N32 libmagic=N32;;
+ *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ")
+ libsuff=64 shlibsuff=64 libmagic=64-bit;;
+ *) libsuff= shlibsuff= libmagic=never-match;;
+ esac
+ ;;
+ esac
+ shlibpath_var=LD_LIBRARY${shlibsuff}_PATH
+ shlibpath_overrides_runpath=no
+ sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}"
+ sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}"
+ hardcode_into_libs=yes
+ ;;
+
+# No shared lib support for Linux oldld, aout, or coff.
+linux*oldld* | linux*aout* | linux*coff*)
+ dynamic_linker=no
+ ;;
+
+# This must be Linux ELF.
+linux*)
+ version_type=linux
+ need_lib_prefix=no
+ need_version=no
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir'
+ shlibpath_var=LD_LIBRARY_PATH
+ shlibpath_overrides_runpath=no
+ # This implies no fast_install, which is unacceptable.
+ # Some rework will be needed to allow for fast_install
+ # before this can be enabled.
+ hardcode_into_libs=yes
+
+ # find out which ABI we are using
+ libsuff=
+ case "$host_cpu" in
+ x86_64*|s390x*|powerpc64*)
+ echo '[#]line __oline__ "configure"' > conftest.$ac_ext
+ if AC_TRY_EVAL(ac_compile); then
+ case `/usr/bin/file conftest.$ac_objext` in
+ *64-bit*)
+ libsuff=64
+ sys_lib_search_path_spec="/lib${libsuff} /usr/lib${libsuff} /usr/local/lib${libsuff}"
+ ;;
+ esac
+ fi
+ rm -rf conftest*
+ ;;
+ esac
+
+ # Append ld.so.conf contents to the search path
+ if test -f /etc/ld.so.conf; then
+ lt_ld_extra=`$SED -e 's/[:,\t]/ /g;s/=[^=]*$//;s/=[^= ]* / /g' /etc/ld.so.conf | tr '\n' ' '`
+ sys_lib_dlsearch_path_spec="/lib${libsuff} /usr/lib${libsuff} $lt_ld_extra"
+ fi
+
+ # We used to test for /lib/ld.so.1 and disable shared libraries on
+ # powerpc, because MkLinux only supported shared libraries with the
+ # GNU dynamic linker. Since this was broken with cross compilers,
+ # most powerpc-linux boxes support dynamic linking these days and
+ # people can always --disable-shared, the test was removed, and we
+ # assume the GNU/Linux dynamic linker is in use.
+ dynamic_linker='GNU/Linux ld.so'
+ ;;
+
+knetbsd*-gnu)
+ version_type=linux
+ need_lib_prefix=no
+ need_version=no
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ shlibpath_var=LD_LIBRARY_PATH
+ shlibpath_overrides_runpath=no
+ hardcode_into_libs=yes
+ dynamic_linker='GNU ld.so'
+ ;;
+
+netbsd*)
+ version_type=sunos
+ need_lib_prefix=no
+ need_version=no
+ if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+ finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'
+ dynamic_linker='NetBSD (a.out) ld.so'
+ else
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ dynamic_linker='NetBSD ld.elf_so'
+ fi
+ shlibpath_var=LD_LIBRARY_PATH
+ shlibpath_overrides_runpath=yes
+ hardcode_into_libs=yes
+ ;;
+
+newsos6)
+ version_type=linux
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ shlibpath_var=LD_LIBRARY_PATH
+ shlibpath_overrides_runpath=yes
+ ;;
+
+nto-qnx*)
+ version_type=linux
+ need_lib_prefix=no
+ need_version=no
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ shlibpath_var=LD_LIBRARY_PATH
+ shlibpath_overrides_runpath=yes
+ ;;
+
+openbsd*)
+ version_type=sunos
+ need_lib_prefix=no
+ need_version=yes
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+ finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'
+ shlibpath_var=LD_LIBRARY_PATH
+ if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+ case $host_os in
+ openbsd2.[[89]] | openbsd2.[[89]].*)
+ shlibpath_overrides_runpath=no
+ ;;
+ *)
+ shlibpath_overrides_runpath=yes
+ ;;
+ esac
+ else
+ shlibpath_overrides_runpath=yes
+ fi
+ ;;
+
+os2*)
+ libname_spec='$name'
+ shrext_cmds=".dll"
+ need_lib_prefix=no
+ library_names_spec='$libname${shared_ext} $libname.a'
+ dynamic_linker='OS/2 ld.exe'
+ shlibpath_var=LIBPATH
+ ;;
+
+osf3* | osf4* | osf5*)
+ version_type=osf
+ need_lib_prefix=no
+ need_version=no
+ soname_spec='${libname}${release}${shared_ext}$major'
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ shlibpath_var=LD_LIBRARY_PATH
+ sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib"
+ sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec"
+ ;;
+
+sco3.2v5*)
+ version_type=osf
+ soname_spec='${libname}${release}${shared_ext}$major'
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ shlibpath_var=LD_LIBRARY_PATH
+ ;;
+
+solaris*)
+ version_type=linux
+ need_lib_prefix=no
+ need_version=no
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ shlibpath_var=LD_LIBRARY_PATH
+ shlibpath_overrides_runpath=yes
+ hardcode_into_libs=yes
+ # ldd complains unless libraries are executable
+ postinstall_cmds='chmod +x $lib'
+ ;;
+
+sunos4*)
+ version_type=sunos
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+ finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir'
+ shlibpath_var=LD_LIBRARY_PATH
+ shlibpath_overrides_runpath=yes
+ if test "$with_gnu_ld" = yes; then
+ need_lib_prefix=no
+ fi
+ need_version=yes
+ ;;
+
+sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)
+ version_type=linux
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ shlibpath_var=LD_LIBRARY_PATH
+ case $host_vendor in
+ sni)
+ shlibpath_overrides_runpath=no
+ need_lib_prefix=no
+ export_dynamic_flag_spec='${wl}-Blargedynsym'
+ runpath_var=LD_RUN_PATH
+ ;;
+ siemens)
+ need_lib_prefix=no
+ ;;
+ motorola)
+ need_lib_prefix=no
+ need_version=no
+ shlibpath_overrides_runpath=no
+ sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'
+ ;;
+ esac
+ ;;
+
+sysv4*MP*)
+ if test -d /usr/nec ;then
+ version_type=linux
+ library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}'
+ soname_spec='$libname${shared_ext}.$major'
+ shlibpath_var=LD_LIBRARY_PATH
+ fi
+ ;;
+
+uts4*)
+ version_type=linux
+ library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+ soname_spec='${libname}${release}${shared_ext}$major'
+ shlibpath_var=LD_LIBRARY_PATH
+ ;;
+
+*)
+ dynamic_linker=no
+ ;;
+esac
+AC_MSG_RESULT([$dynamic_linker])
+test "$dynamic_linker" = no && can_build_shared=no
+])# AC_LIBTOOL_SYS_DYNAMIC_LINKER
+
+
+# _LT_AC_TAGCONFIG
+# ----------------
+AC_DEFUN([_LT_AC_TAGCONFIG],
+[AC_ARG_WITH([tags],
+ [AC_HELP_STRING([--with-tags@<:@=TAGS@:>@],
+ [include additional configurations @<:@automatic@:>@])],
+ [tagnames="$withval"])
+
+if test -f "$ltmain" && test -n "$tagnames"; then
+ if test ! -f "${ofile}"; then
+ AC_MSG_WARN([output file `$ofile' does not exist])
+ fi
+
+ if test -z "$LTCC"; then
+ eval "`$SHELL ${ofile} --config | grep '^LTCC='`"
+ if test -z "$LTCC"; then
+ AC_MSG_WARN([output file `$ofile' does not look like a libtool script])
+ else
+ AC_MSG_WARN([using `LTCC=$LTCC', extracted from `$ofile'])
+ fi
+ fi
+
+ # Extract list of available tagged configurations in $ofile.
+ # Note that this assumes the entire list is on one line.
+ available_tags=`grep "^available_tags=" "${ofile}" | $SED -e 's/available_tags=\(.*$\)/\1/' -e 's/\"//g'`
+
+ lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+ for tagname in $tagnames; do
+ IFS="$lt_save_ifs"
+ # Check whether tagname contains only valid characters
+ case `$echo "X$tagname" | $Xsed -e 's:[[-_ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890,/]]::g'` in
+ "") ;;
+ *) AC_MSG_ERROR([invalid tag name: $tagname])
+ ;;
+ esac
+
+ if grep "^# ### BEGIN LIBTOOL TAG CONFIG: $tagname$" < "${ofile}" > /dev/null
+ then
+ AC_MSG_ERROR([tag name \"$tagname\" already exists])
+ fi
+
+ # Update the list of available tags.
+ if test -n "$tagname"; then
+ echo appending configuration tag \"$tagname\" to $ofile
+
+ case $tagname in
+ CXX)
+ if test -n "$CXX" && test "X$CXX" != "Xno"; then
+ AC_LIBTOOL_LANG_CXX_CONFIG
+ else
+ tagname=""
+ fi
+ ;;
+
+ F77)
+ if test -n "$F77" && test "X$F77" != "Xno"; then
+ AC_LIBTOOL_LANG_F77_CONFIG
+ else
+ tagname=""
+ fi
+ ;;
+
+ GCJ)
+ if test -n "$GCJ" && test "X$GCJ" != "Xno"; then
+ AC_LIBTOOL_LANG_GCJ_CONFIG
+ else
+ tagname=""
+ fi
+ ;;
+
+ RC)
+ AC_LIBTOOL_LANG_RC_CONFIG
+ ;;
+
+ *)
+ AC_MSG_ERROR([Unsupported tag name: $tagname])
+ ;;
+ esac
+
+ # Append the new tag name to the list of available tags.
+ if test -n "$tagname" ; then
+ available_tags="$available_tags $tagname"
+ fi
+ fi
+ done
+ IFS="$lt_save_ifs"
+
+ # Now substitute the updated list of available tags.
+ if eval "sed -e 's/^available_tags=.*\$/available_tags=\"$available_tags\"/' \"$ofile\" > \"${ofile}T\""; then
+ mv "${ofile}T" "$ofile"
+ chmod +x "$ofile"
+ else
+ rm -f "${ofile}T"
+ AC_MSG_ERROR([unable to update list of available tagged configurations.])
+ fi
+fi
+])# _LT_AC_TAGCONFIG
+
+
+# AC_LIBTOOL_DLOPEN
+# -----------------
+# enable checks for dlopen support
+AC_DEFUN([AC_LIBTOOL_DLOPEN],
+ [AC_BEFORE([$0],[AC_LIBTOOL_SETUP])
+])# AC_LIBTOOL_DLOPEN
+
+
+# AC_LIBTOOL_WIN32_DLL
+# --------------------
+# declare package support for building win32 dll's
+AC_DEFUN([AC_LIBTOOL_WIN32_DLL],
+[AC_BEFORE([$0], [AC_LIBTOOL_SETUP])
+])# AC_LIBTOOL_WIN32_DLL
+
+
+# AC_ENABLE_SHARED([DEFAULT])
+# ---------------------------
+# implement the --enable-shared flag
+# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'.
+AC_DEFUN([AC_ENABLE_SHARED],
+[define([AC_ENABLE_SHARED_DEFAULT], ifelse($1, no, no, yes))dnl
+AC_ARG_ENABLE([shared],
+ [AC_HELP_STRING([--enable-shared@<:@=PKGS@:>@],
+ [build shared libraries @<:@default=]AC_ENABLE_SHARED_DEFAULT[@:>@])],
+ [p=${PACKAGE-default}
+ case $enableval in
+ yes) enable_shared=yes ;;
+ no) enable_shared=no ;;
+ *)
+ enable_shared=no
+ # Look at the argument we got. We use all the common list separators.
+ lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+ for pkg in $enableval; do
+ IFS="$lt_save_ifs"
+ if test "X$pkg" = "X$p"; then
+ enable_shared=yes
+ fi
+ done
+ IFS="$lt_save_ifs"
+ ;;
+ esac],
+ [enable_shared=]AC_ENABLE_SHARED_DEFAULT)
+])# AC_ENABLE_SHARED
+
+
+# AC_DISABLE_SHARED
+# -----------------
+#- set the default shared flag to --disable-shared
+AC_DEFUN([AC_DISABLE_SHARED],
+[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl
+AC_ENABLE_SHARED(no)
+])# AC_DISABLE_SHARED
+
+
+# AC_ENABLE_STATIC([DEFAULT])
+# ---------------------------
+# implement the --enable-static flag
+# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'.
+AC_DEFUN([AC_ENABLE_STATIC],
+[define([AC_ENABLE_STATIC_DEFAULT], ifelse($1, no, no, yes))dnl
+AC_ARG_ENABLE([static],
+ [AC_HELP_STRING([--enable-static@<:@=PKGS@:>@],
+ [build static libraries @<:@default=]AC_ENABLE_STATIC_DEFAULT[@:>@])],
+ [p=${PACKAGE-default}
+ case $enableval in
+ yes) enable_static=yes ;;
+ no) enable_static=no ;;
+ *)
+ enable_static=no
+ # Look at the argument we got. We use all the common list separators.
+ lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+ for pkg in $enableval; do
+ IFS="$lt_save_ifs"
+ if test "X$pkg" = "X$p"; then
+ enable_static=yes
+ fi
+ done
+ IFS="$lt_save_ifs"
+ ;;
+ esac],
+ [enable_static=]AC_ENABLE_STATIC_DEFAULT)
+])# AC_ENABLE_STATIC
+
+
+# AC_DISABLE_STATIC
+# -----------------
+# set the default static flag to --disable-static
+AC_DEFUN([AC_DISABLE_STATIC],
+[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl
+AC_ENABLE_STATIC(no)
+])# AC_DISABLE_STATIC
+
+
+# AC_ENABLE_FAST_INSTALL([DEFAULT])
+# ---------------------------------
+# implement the --enable-fast-install flag
+# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'.
+AC_DEFUN([AC_ENABLE_FAST_INSTALL],
+[define([AC_ENABLE_FAST_INSTALL_DEFAULT], ifelse($1, no, no, yes))dnl
+AC_ARG_ENABLE([fast-install],
+ [AC_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@],
+ [optimize for fast installation @<:@default=]AC_ENABLE_FAST_INSTALL_DEFAULT[@:>@])],
+ [p=${PACKAGE-default}
+ case $enableval in
+ yes) enable_fast_install=yes ;;
+ no) enable_fast_install=no ;;
+ *)
+ enable_fast_install=no
+ # Look at the argument we got. We use all the common list separators.
+ lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+ for pkg in $enableval; do
+ IFS="$lt_save_ifs"
+ if test "X$pkg" = "X$p"; then
+ enable_fast_install=yes
+ fi
+ done
+ IFS="$lt_save_ifs"
+ ;;
+ esac],
+ [enable_fast_install=]AC_ENABLE_FAST_INSTALL_DEFAULT)
+])# AC_ENABLE_FAST_INSTALL
+
+
+# AC_DISABLE_FAST_INSTALL
+# -----------------------
+# set the default to --disable-fast-install
+AC_DEFUN([AC_DISABLE_FAST_INSTALL],
+[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl
+AC_ENABLE_FAST_INSTALL(no)
+])# AC_DISABLE_FAST_INSTALL
+
+
+# AC_LIBTOOL_PICMODE([MODE])
+# --------------------------
+# implement the --with-pic flag
+# MODE is either `yes' or `no'. If omitted, it defaults to `both'.
+AC_DEFUN([AC_LIBTOOL_PICMODE],
+[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl
+pic_mode=ifelse($#,1,$1,default)
+])# AC_LIBTOOL_PICMODE
+
+
+# AC_PROG_EGREP
+# -------------
+# This is predefined starting with Autoconf 2.54, so this conditional
+# definition can be removed once we require Autoconf 2.54 or later.
+m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP],
+[AC_CACHE_CHECK([for egrep], [ac_cv_prog_egrep],
+ [if echo a | (grep -E '(a|b)') >/dev/null 2>&1
+ then ac_cv_prog_egrep='grep -E'
+ else ac_cv_prog_egrep='egrep'
+ fi])
+ EGREP=$ac_cv_prog_egrep
+ AC_SUBST([EGREP])
+])])
+
+
+# AC_PATH_TOOL_PREFIX
+# -------------------
+# find a file program which can recognise shared library
+AC_DEFUN([AC_PATH_TOOL_PREFIX],
+[AC_REQUIRE([AC_PROG_EGREP])dnl
+AC_MSG_CHECKING([for $1])
+AC_CACHE_VAL(lt_cv_path_MAGIC_CMD,
+[case $MAGIC_CMD in
+[[\\/*] | ?:[\\/]*])
+ lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path.
+ ;;
+*)
+ lt_save_MAGIC_CMD="$MAGIC_CMD"
+ lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+dnl $ac_dummy forces splitting on constant user-supplied paths.
+dnl POSIX.2 word splitting is done only on the output of word expansions,
+dnl not every word. This closes a longstanding sh security hole.
+ ac_dummy="ifelse([$2], , $PATH, [$2])"
+ for ac_dir in $ac_dummy; do
+ IFS="$lt_save_ifs"
+ test -z "$ac_dir" && ac_dir=.
+ if test -f $ac_dir/$1; then
+ lt_cv_path_MAGIC_CMD="$ac_dir/$1"
+ if test -n "$file_magic_test_file"; then
+ case $deplibs_check_method in
+ "file_magic "*)
+ file_magic_regex="`expr \"$deplibs_check_method\" : \"file_magic \(.*\)\"`"
+ MAGIC_CMD="$lt_cv_path_MAGIC_CMD"
+ if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null |
+ $EGREP "$file_magic_regex" > /dev/null; then
+ :
+ else
+ cat <<EOF 1>&2
+
+*** Warning: the command libtool uses to detect shared libraries,
+*** $file_magic_cmd, produces output that libtool cannot recognize.
+*** The result is that libtool may fail to recognize shared libraries
+*** as such. This will affect the creation of libtool libraries that
+*** depend on shared libraries, but programs linked with such libtool
+*** libraries will work regardless of this problem. Nevertheless, you
+*** may want to report the problem to your system manager and/or to
+*** bug-libtool@gnu.org
+
+EOF
+ fi ;;
+ esac
+ fi
+ break
+ fi
+ done
+ IFS="$lt_save_ifs"
+ MAGIC_CMD="$lt_save_MAGIC_CMD"
+ ;;
+esac])
+MAGIC_CMD="$lt_cv_path_MAGIC_CMD"
+if test -n "$MAGIC_CMD"; then
+ AC_MSG_RESULT($MAGIC_CMD)
+else
+ AC_MSG_RESULT(no)
+fi
+])# AC_PATH_TOOL_PREFIX
+
+
+# AC_PATH_MAGIC
+# -------------
+# find a file program which can recognise a shared library
+AC_DEFUN([AC_PATH_MAGIC],
+[AC_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH)
+if test -z "$lt_cv_path_MAGIC_CMD"; then
+ if test -n "$ac_tool_prefix"; then
+ AC_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH)
+ else
+ MAGIC_CMD=:
+ fi
+fi
+])# AC_PATH_MAGIC
+
+
+# AC_PROG_LD
+# ----------
+# find the pathname to the GNU or non-GNU linker
+AC_DEFUN([AC_PROG_LD],
+[AC_ARG_WITH([gnu-ld],
+ [AC_HELP_STRING([--with-gnu-ld],
+ [assume the C compiler uses GNU ld @<:@default=no@:>@])],
+ [test "$withval" = no || with_gnu_ld=yes],
+ [with_gnu_ld=no])
+AC_REQUIRE([LT_AC_PROG_SED])dnl
+AC_REQUIRE([AC_PROG_CC])dnl
+AC_REQUIRE([AC_CANONICAL_HOST])dnl
+AC_REQUIRE([AC_CANONICAL_BUILD])dnl
+ac_prog=ld
+if test "$GCC" = yes; then
+ # Check if gcc -print-prog-name=ld gives a path.
+ AC_MSG_CHECKING([for ld used by $CC])
+ case $host in
+ *-*-mingw*)
+ # gcc leaves a trailing carriage return which upsets mingw
+ ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;;
+ *)
+ ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;
+ esac
+ case $ac_prog in
+ # Accept absolute paths.
+ [[\\/]]* | ?:[[\\/]]*)
+ re_direlt='/[[^/]][[^/]]*/\.\./'
+ # Canonicalize the pathname of ld
+ ac_prog=`echo $ac_prog| $SED 's%\\\\%/%g'`
+ while echo $ac_prog | grep "$re_direlt" > /dev/null 2>&1; do
+ ac_prog=`echo $ac_prog| $SED "s%$re_direlt%/%"`
+ done
+ test -z "$LD" && LD="$ac_prog"
+ ;;
+ "")
+ # If it fails, then pretend we aren't using GCC.
+ ac_prog=ld
+ ;;
+ *)
+ # If it is relative, then search for the first ld in PATH.
+ with_gnu_ld=unknown
+ ;;
+ esac
+elif test "$with_gnu_ld" = yes; then
+ AC_MSG_CHECKING([for GNU ld])
+else
+ AC_MSG_CHECKING([for non-GNU ld])
+fi
+AC_CACHE_VAL(lt_cv_path_LD,
+[if test -z "$LD"; then
+ lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+ for ac_dir in $PATH; do
+ IFS="$lt_save_ifs"
+ test -z "$ac_dir" && ac_dir=.
+ if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then
+ lt_cv_path_LD="$ac_dir/$ac_prog"
+ # Check to see if the program is GNU ld. I'd rather use --version,
+ # but apparently some GNU ld's only accept -v.
+ # Break only if it was the GNU/non-GNU ld that we prefer.
+ case `"$lt_cv_path_LD" -v 2>&1 </dev/null` in
+ *GNU* | *'with BFD'*)
+ test "$with_gnu_ld" != no && break
+ ;;
+ *)
+ test "$with_gnu_ld" != yes && break
+ ;;
+ esac
+ fi
+ done
+ IFS="$lt_save_ifs"
+else
+ lt_cv_path_LD="$LD" # Let the user override the test with a path.
+fi])
+LD="$lt_cv_path_LD"
+if test -n "$LD"; then
+ AC_MSG_RESULT($LD)
+else
+ AC_MSG_RESULT(no)
+fi
+test -z "$LD" && AC_MSG_ERROR([no acceptable ld found in \$PATH])
+AC_PROG_LD_GNU
+])# AC_PROG_LD
+
+
+# AC_PROG_LD_GNU
+# --------------
+AC_DEFUN([AC_PROG_LD_GNU],
+[AC_REQUIRE([AC_PROG_EGREP])dnl
+AC_CACHE_CHECK([if the linker ($LD) is GNU ld], lt_cv_prog_gnu_ld,
+[# I'd rather use --version here, but apparently some GNU ld's only accept -v.
+case `$LD -v 2>&1 </dev/null` in
+*GNU* | *'with BFD'*)
+ lt_cv_prog_gnu_ld=yes
+ ;;
+*)
+ lt_cv_prog_gnu_ld=no
+ ;;
+esac])
+with_gnu_ld=$lt_cv_prog_gnu_ld
+])# AC_PROG_LD_GNU
+
+
+# AC_PROG_LD_RELOAD_FLAG
+# ----------------------
+# find reload flag for linker
+# -- PORTME Some linkers may need a different reload flag.
+AC_DEFUN([AC_PROG_LD_RELOAD_FLAG],
+[AC_CACHE_CHECK([for $LD option to reload object files],
+ lt_cv_ld_reload_flag,
+ [lt_cv_ld_reload_flag='-r'])
+reload_flag=$lt_cv_ld_reload_flag
+case $reload_flag in
+"" | " "*) ;;
+*) reload_flag=" $reload_flag" ;;
+esac
+reload_cmds='$LD$reload_flag -o $output$reload_objs'
+])# AC_PROG_LD_RELOAD_FLAG
+
+
+# AC_DEPLIBS_CHECK_METHOD
+# -----------------------
+# how to check for library dependencies
+# -- PORTME fill in with the dynamic library characteristics
+AC_DEFUN([AC_DEPLIBS_CHECK_METHOD],
+[AC_CACHE_CHECK([how to recognise dependent libraries],
+lt_cv_deplibs_check_method,
+[lt_cv_file_magic_cmd='$MAGIC_CMD'
+lt_cv_file_magic_test_file=
+lt_cv_deplibs_check_method='unknown'
+# Need to set the preceding variable on all platforms that support
+# interlibrary dependencies.
+# 'none' -- dependencies not supported.
+# `unknown' -- same as none, but documents that we really don't know.
+# 'pass_all' -- all dependencies passed with no checks.
+# 'test_compile' -- check by making test program.
+# 'file_magic [[regex]]' -- check by looking for files in library path
+# which responds to the $file_magic_cmd with a given extended regex.
+# If you have `file' or equivalent on your system and you're not sure
+# whether `pass_all' will *always* work, you probably want this one.
+
+case $host_os in
+aix4* | aix5*)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+
+beos*)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+
+bsdi4*)
+ lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib)'
+ lt_cv_file_magic_cmd='/usr/bin/file -L'
+ lt_cv_file_magic_test_file=/shlib/libc.so
+ ;;
+
+cygwin*)
+ # func_win32_libid is a shell function defined in ltmain.sh
+ lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'
+ lt_cv_file_magic_cmd='func_win32_libid'
+ ;;
+
+mingw* | pw32*)
+ # Base MSYS/MinGW do not provide the 'file' command needed by
+ # func_win32_libid shell function, so use a weaker test based on 'objdump'.
+ lt_cv_deplibs_check_method='file_magic file format pei*-i386(.*architecture: i386)?'
+ lt_cv_file_magic_cmd='$OBJDUMP -f'
+ ;;
+
+darwin* | rhapsody*)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+
+freebsd* | kfreebsd*-gnu)
+ if echo __ELF__ | $CC -E - | grep __ELF__ > /dev/null; then
+ case $host_cpu in
+ i*86 )
+ # Not sure whether the presence of OpenBSD here was a mistake.
+ # Let's accept both of them until this is cleared up.
+ lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD)/i[[3-9]]86 (compact )?demand paged shared library'
+ lt_cv_file_magic_cmd=/usr/bin/file
+ lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`
+ ;;
+ esac
+ else
+ lt_cv_deplibs_check_method=pass_all
+ fi
+ ;;
+
+gnu*)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+
+hpux10.20* | hpux11*)
+ lt_cv_file_magic_cmd=/usr/bin/file
+ case "$host_cpu" in
+ ia64*)
+ lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64'
+ lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so
+ ;;
+ hppa*64*)
+ [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - PA-RISC [0-9].[0-9]']
+ lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl
+ ;;
+ *)
+ lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]].[[0-9]]) shared library'
+ lt_cv_file_magic_test_file=/usr/lib/libc.sl
+ ;;
+ esac
+ ;;
+
+irix5* | irix6* | nonstopux*)
+ case $LD in
+ *-32|*"-32 ") libmagic=32-bit;;
+ *-n32|*"-n32 ") libmagic=N32;;
+ *-64|*"-64 ") libmagic=64-bit;;
+ *) libmagic=never-match;;
+ esac
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+
+# This must be Linux ELF.
+linux*)
+ case $host_cpu in
+ alpha*|hppa*|i*86|ia64*|m68*|mips*|powerpc*|sparc*|s390*|sh*|x86_64*)
+ lt_cv_deplibs_check_method=pass_all ;;
+ *)
+ # glibc up to 2.1.1 does not perform some relocations on ARM
+ # this will be overridden with pass_all, but let us keep it just in case
+ lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )' ;;
+ esac
+ lt_cv_file_magic_test_file=`echo /lib/libc.so* /lib/libc-*.so`
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+
+netbsd*)
+ if echo __ELF__ | $CC -E - | grep __ELF__ > /dev/null; then
+ lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$'
+ else
+ lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$'
+ fi
+ ;;
+
+newos6*)
+ lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)'
+ lt_cv_file_magic_cmd=/usr/bin/file
+ lt_cv_file_magic_test_file=/usr/lib/libnls.so
+ ;;
+
+nto-qnx*)
+ lt_cv_deplibs_check_method=unknown
+ ;;
+
+openbsd*)
+ lt_cv_file_magic_cmd=/usr/bin/file
+ lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`
+ if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+ lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB shared object'
+ else
+ lt_cv_deplibs_check_method='file_magic OpenBSD.* shared library'
+ fi
+ ;;
+
+osf3* | osf4* | osf5*)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+
+sco3.2v5*)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+
+solaris*)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+
+sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)
+ case $host_vendor in
+ motorola)
+ lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]'
+ lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*`
+ ;;
+ ncr)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+ sequent)
+ lt_cv_file_magic_cmd='/bin/file'
+ lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )'
+ ;;
+ sni)
+ lt_cv_file_magic_cmd='/bin/file'
+ lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib"
+ lt_cv_file_magic_test_file=/lib/libc.so
+ ;;
+ siemens)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+ esac
+ ;;
+
+sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[[78]]* | unixware7* | sysv4*uw2*)
+ lt_cv_deplibs_check_method=pass_all
+ ;;
+esac
+])
+file_magic_cmd=$lt_cv_file_magic_cmd
+deplibs_check_method=$lt_cv_deplibs_check_method
+test -z "$deplibs_check_method" && deplibs_check_method=unknown
+])# AC_DEPLIBS_CHECK_METHOD
+
+
+# AC_PROG_NM
+# ----------
+# find the pathname to a BSD-compatible name lister
+AC_DEFUN([AC_PROG_NM],
+[AC_CACHE_CHECK([for BSD-compatible nm], lt_cv_path_NM,
+[if test -n "$NM"; then
+ # Let the user override the test.
+ lt_cv_path_NM="$NM"
+else
+ lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+ for ac_dir in $PATH /usr/ccs/bin /usr/ucb /bin; do
+ IFS="$lt_save_ifs"
+ test -z "$ac_dir" && ac_dir=.
+ tmp_nm="$ac_dir/${ac_tool_prefix}nm"
+ if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then
+ # Check to see if the nm accepts a BSD-compat flag.
+ # Adding the `sed 1q' prevents false positives on HP-UX, which says:
+ # nm: unknown option "B" ignored
+ # Tru64's nm complains that /dev/null is an invalid object file
+ case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in
+ */dev/null* | *'Invalid file or object type'*)
+ lt_cv_path_NM="$tmp_nm -B"
+ break
+ ;;
+ *)
+ case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in
+ */dev/null*)
+ lt_cv_path_NM="$tmp_nm -p"
+ break
+ ;;
+ *)
+ lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but
+ continue # so that we can try to find one that supports BSD flags
+ ;;
+ esac
+ esac
+ fi
+ done
+ IFS="$lt_save_ifs"
+ test -z "$lt_cv_path_NM" && lt_cv_path_NM=nm
+fi])
+NM="$lt_cv_path_NM"
+])# AC_PROG_NM
+
+
+# AC_CHECK_LIBM
+# -------------
+# check for math library
+AC_DEFUN([AC_CHECK_LIBM],
+[AC_REQUIRE([AC_CANONICAL_HOST])dnl
+LIBM=
+case $host in
+*-*-beos* | *-*-cygwin* | *-*-pw32* | *-*-darwin*)
+ # These system don't have libm, or don't need it
+ ;;
+*-ncr-sysv4.3*)
+ AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM="-lmw")
+ AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm")
+ ;;
+*)
+ AC_CHECK_LIB(m, cos, LIBM="-lm")
+ ;;
+esac
+])# AC_CHECK_LIBM
+
+
+# AC_LIBLTDL_CONVENIENCE([DIRECTORY])
+# -----------------------------------
+# sets LIBLTDL to the link flags for the libltdl convenience library and
+# LTDLINCL to the include flags for the libltdl header and adds
+# --enable-ltdl-convenience to the configure arguments. Note that LIBLTDL
+# and LTDLINCL are not AC_SUBSTed, nor is AC_CONFIG_SUBDIRS called. If
+# DIRECTORY is not provided, it is assumed to be `libltdl'. LIBLTDL will
+# be prefixed with '${top_builddir}/' and LTDLINCL will be prefixed with
+# '${top_srcdir}/' (note the single quotes!). If your package is not
+# flat and you're not using automake, define top_builddir and
+# top_srcdir appropriately in the Makefiles.
+AC_DEFUN([AC_LIBLTDL_CONVENIENCE],
+[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl
+ case $enable_ltdl_convenience in
+ no) AC_MSG_ERROR([this package needs a convenience libltdl]) ;;
+ "") enable_ltdl_convenience=yes
+ ac_configure_args="$ac_configure_args --enable-ltdl-convenience" ;;
+ esac
+ LIBLTDL='${top_builddir}/'ifelse($#,1,[$1],['libltdl'])/libltdlc.la
+ LTDLINCL='-I${top_srcdir}/'ifelse($#,1,[$1],['libltdl'])
+ # For backwards non-gettext consistent compatibility...
+ INCLTDL="$LTDLINCL"
+])# AC_LIBLTDL_CONVENIENCE
+
+
+# AC_LIBLTDL_INSTALLABLE([DIRECTORY])
+# -----------------------------------
+# sets LIBLTDL to the link flags for the libltdl installable library and
+# LTDLINCL to the include flags for the libltdl header and adds
+# --enable-ltdl-install to the configure arguments. Note that LIBLTDL
+# and LTDLINCL are not AC_SUBSTed, nor is AC_CONFIG_SUBDIRS called. If
+# DIRECTORY is not provided and an installed libltdl is not found, it is
+# assumed to be `libltdl'. LIBLTDL will be prefixed with '${top_builddir}/'
+# and LTDLINCL will be prefixed with '${top_srcdir}/' (note the single
+# quotes!). If your package is not flat and you're not using automake,
+# define top_builddir and top_srcdir appropriately in the Makefiles.
+# In the future, this macro may have to be called after AC_PROG_LIBTOOL.
+AC_DEFUN([AC_LIBLTDL_INSTALLABLE],
+[AC_BEFORE([$0],[AC_LIBTOOL_SETUP])dnl
+ AC_CHECK_LIB(ltdl, lt_dlinit,
+ [test x"$enable_ltdl_install" != xyes && enable_ltdl_install=no],
+ [if test x"$enable_ltdl_install" = xno; then
+ AC_MSG_WARN([libltdl not installed, but installation disabled])
+ else
+ enable_ltdl_install=yes
+ fi
+ ])
+ if test x"$enable_ltdl_install" = x"yes"; then
+ ac_configure_args="$ac_configure_args --enable-ltdl-install"
+ LIBLTDL='${top_builddir}/'ifelse($#,1,[$1],['libltdl'])/libltdl.la
+ LTDLINCL='-I${top_srcdir}/'ifelse($#,1,[$1],['libltdl'])
+ else
+ ac_configure_args="$ac_configure_args --enable-ltdl-install=no"
+ LIBLTDL="-lltdl"
+ LTDLINCL=
+ fi
+ # For backwards non-gettext consistent compatibility...
+ INCLTDL="$LTDLINCL"
+])# AC_LIBLTDL_INSTALLABLE
+
+
+# AC_LIBTOOL_CXX
+# --------------
+# enable support for C++ libraries
+AC_DEFUN([AC_LIBTOOL_CXX],
+[AC_REQUIRE([_LT_AC_LANG_CXX])
+])# AC_LIBTOOL_CXX
+
+
+# _LT_AC_LANG_CXX
+# ---------------
+AC_DEFUN([_LT_AC_LANG_CXX],
+[AC_REQUIRE([AC_PROG_CXX])
+AC_REQUIRE([AC_PROG_CXXCPP])
+_LT_AC_SHELL_INIT([tagnames=${tagnames+${tagnames},}CXX])
+])# _LT_AC_LANG_CXX
+
+
+# AC_LIBTOOL_F77
+# --------------
+# enable support for Fortran 77 libraries
+AC_DEFUN([AC_LIBTOOL_F77],
+[AC_REQUIRE([_LT_AC_LANG_F77])
+])# AC_LIBTOOL_F77
+
+
+# _LT_AC_LANG_F77
+# ---------------
+AC_DEFUN([_LT_AC_LANG_F77],
+[AC_REQUIRE([AC_PROG_F77])
+_LT_AC_SHELL_INIT([tagnames=${tagnames+${tagnames},}F77])
+])# _LT_AC_LANG_F77
+
+
+# AC_LIBTOOL_GCJ
+# --------------
+# enable support for GCJ libraries
+AC_DEFUN([AC_LIBTOOL_GCJ],
+[AC_REQUIRE([_LT_AC_LANG_GCJ])
+])# AC_LIBTOOL_GCJ
+
+
+# _LT_AC_LANG_GCJ
+# ---------------
+AC_DEFUN([_LT_AC_LANG_GCJ],
+[AC_PROVIDE_IFELSE([AC_PROG_GCJ],[],
+ [AC_PROVIDE_IFELSE([A][M_PROG_GCJ],[],
+ [AC_PROVIDE_IFELSE([LT_AC_PROG_GCJ],[],
+ [ifdef([AC_PROG_GCJ],[AC_REQUIRE([AC_PROG_GCJ])],
+ [ifdef([A][M_PROG_GCJ],[AC_REQUIRE([A][M_PROG_GCJ])],
+ [AC_REQUIRE([A][C_PROG_GCJ_OR_A][M_PROG_GCJ])])])])])])
+_LT_AC_SHELL_INIT([tagnames=${tagnames+${tagnames},}GCJ])
+])# _LT_AC_LANG_GCJ
+
+
+# AC_LIBTOOL_RC
+# --------------
+# enable support for Windows resource files
+AC_DEFUN([AC_LIBTOOL_RC],
+[AC_REQUIRE([LT_AC_PROG_RC])
+_LT_AC_SHELL_INIT([tagnames=${tagnames+${tagnames},}RC])
+])# AC_LIBTOOL_RC
+
+
+# AC_LIBTOOL_LANG_C_CONFIG
+# ------------------------
+# Ensure that the configuration vars for the C compiler are
+# suitably defined. Those variables are subsequently used by
+# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.
+AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG], [_LT_AC_LANG_C_CONFIG])
+AC_DEFUN([_LT_AC_LANG_C_CONFIG],
+[lt_save_CC="$CC"
+AC_LANG_PUSH(C)
+
+# Source file extension for C test sources.
+ac_ext=c
+
+# Object file extension for compiled C test sources.
+objext=o
+_LT_AC_TAGVAR(objext, $1)=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code="int some_variable = 0;\n"
+
+# Code to be used in simple link tests
+lt_simple_link_test_code='int main(){return(0);}\n'
+
+_LT_AC_SYS_COMPILER
+
+#
+# Check for any special shared library compilation flags.
+#
+_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)=
+if test "$GCC" = no; then
+ case $host_os in
+ sco3.2v5*)
+ _LT_AC_TAGVAR(lt_prog_cc_shlib, $1)='-belf'
+ ;;
+ esac
+fi
+if test -n "$_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)"; then
+ AC_MSG_WARN([`$CC' requires `$_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)' to build shared libraries])
+ if echo "$old_CC $old_CFLAGS " | grep "[[ ]]$_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)[[ ]]" >/dev/null; then :
+ else
+ AC_MSG_WARN([add `$_LT_AC_TAGVAR(lt_prog_cc_shlib, $1)' to the CC or CFLAGS env variable and reconfigure])
+ _LT_AC_TAGVAR(lt_cv_prog_cc_can_build_shared, $1)=no
+ fi
+fi
+
+
+#
+# Check to make sure the static flag actually works.
+#
+AC_LIBTOOL_LINKER_OPTION([if $compiler static flag $_LT_AC_TAGVAR(lt_prog_compiler_static, $1) works],
+ _LT_AC_TAGVAR(lt_prog_compiler_static_works, $1),
+ $_LT_AC_TAGVAR(lt_prog_compiler_static, $1),
+ [],
+ [_LT_AC_TAGVAR(lt_prog_compiler_static, $1)=])
+
+
+## CAVEAT EMPTOR:
+## There is no encapsulation within the following macros, do not change
+## the running order or otherwise move them around unless you know exactly
+## what you are doing...
+AC_LIBTOOL_PROG_COMPILER_NO_RTTI($1)
+AC_LIBTOOL_PROG_COMPILER_PIC($1)
+AC_LIBTOOL_PROG_CC_C_O($1)
+AC_LIBTOOL_SYS_HARD_LINK_LOCKS($1)
+AC_LIBTOOL_PROG_LD_SHLIBS($1)
+AC_LIBTOOL_SYS_DYNAMIC_LINKER($1)
+AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH($1)
+AC_LIBTOOL_SYS_LIB_STRIP
+AC_LIBTOOL_DLOPEN_SELF($1)
+
+# Report which librarie types wil actually be built
+AC_MSG_CHECKING([if libtool supports shared libraries])
+AC_MSG_RESULT([$can_build_shared])
+
+AC_MSG_CHECKING([whether to build shared libraries])
+test "$can_build_shared" = "no" && enable_shared=no
+
+# On AIX, shared libraries and static libraries use the same namespace, and
+# are all built from PIC.
+case "$host_os" in
+aix3*)
+ test "$enable_shared" = yes && enable_static=no
+ if test -n "$RANLIB"; then
+ archive_cmds="$archive_cmds~\$RANLIB \$lib"
+ postinstall_cmds='$RANLIB $lib'
+ fi
+ ;;
+
+aix4* | aix5*)
+ if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then
+ test "$enable_shared" = yes && enable_static=no
+ fi
+ ;;
+ darwin* | rhapsody*)
+ if test "$GCC" = yes; then
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+ case "$host_os" in
+ rhapsody* | darwin1.[[012]])
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined suppress'
+ ;;
+ *) # Darwin 1.3 on
+ if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'
+ else
+ case ${MACOSX_DEPLOYMENT_TARGET} in
+ 10.[[012]])
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'
+ ;;
+ 10.*)
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined dynamic_lookup'
+ ;;
+ esac
+ fi
+ ;;
+ esac
+ output_verbose_link_cmd='echo'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs$compiler_flags -install_name $rpath/$soname $verstring'
+ _LT_AC_TAGVAR(module_cmds, $1)='$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags'
+ # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib $allow_undefined_flag -o $lib $libobjs $deplibs$compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'
+ _LT_AC_TAGVAR(module_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no
+ _LT_AC_TAGVAR(hardcode_automatic, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=unsupported
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='-all_load $convenience'
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=yes
+ else
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+esac
+AC_MSG_RESULT([$enable_shared])
+
+AC_MSG_CHECKING([whether to build static libraries])
+# Make sure either enable_shared or enable_static is yes.
+test "$enable_shared" = yes || enable_static=yes
+AC_MSG_RESULT([$enable_static])
+
+AC_LIBTOOL_CONFIG($1)
+
+AC_LANG_POP
+CC="$lt_save_CC"
+])# AC_LIBTOOL_LANG_C_CONFIG
+
+
+# AC_LIBTOOL_LANG_CXX_CONFIG
+# --------------------------
+# Ensure that the configuration vars for the C compiler are
+# suitably defined. Those variables are subsequently used by
+# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.
+AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG], [_LT_AC_LANG_CXX_CONFIG(CXX)])
+AC_DEFUN([_LT_AC_LANG_CXX_CONFIG],
+[AC_LANG_PUSH(C++)
+AC_REQUIRE([AC_PROG_CXX])
+AC_REQUIRE([AC_PROG_CXXCPP])
+
+_LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+_LT_AC_TAGVAR(allow_undefined_flag, $1)=
+_LT_AC_TAGVAR(always_export_symbols, $1)=no
+_LT_AC_TAGVAR(archive_expsym_cmds, $1)=
+_LT_AC_TAGVAR(export_dynamic_flag_spec, $1)=
+_LT_AC_TAGVAR(hardcode_direct, $1)=no
+_LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=
+_LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)=
+_LT_AC_TAGVAR(hardcode_libdir_separator, $1)=
+_LT_AC_TAGVAR(hardcode_minus_L, $1)=no
+_LT_AC_TAGVAR(hardcode_automatic, $1)=no
+_LT_AC_TAGVAR(module_cmds, $1)=
+_LT_AC_TAGVAR(module_expsym_cmds, $1)=
+_LT_AC_TAGVAR(link_all_deplibs, $1)=unknown
+_LT_AC_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds
+_LT_AC_TAGVAR(no_undefined_flag, $1)=
+_LT_AC_TAGVAR(whole_archive_flag_spec, $1)=
+_LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=no
+
+# Dependencies to place before and after the object being linked:
+_LT_AC_TAGVAR(predep_objects, $1)=
+_LT_AC_TAGVAR(postdep_objects, $1)=
+_LT_AC_TAGVAR(predeps, $1)=
+_LT_AC_TAGVAR(postdeps, $1)=
+_LT_AC_TAGVAR(compiler_lib_search_path, $1)=
+
+# Source file extension for C++ test sources.
+ac_ext=cc
+
+# Object file extension for compiled C++ test sources.
+objext=o
+_LT_AC_TAGVAR(objext, $1)=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code="int some_variable = 0;\n"
+
+# Code to be used in simple link tests
+lt_simple_link_test_code='int main(int, char *[]) { return(0); }\n'
+
+# ltmain only uses $CC for tagged configurations so make sure $CC is set.
+_LT_AC_SYS_COMPILER
+
+# Allow CC to be a program name with arguments.
+lt_save_CC=$CC
+lt_save_LD=$LD
+lt_save_GCC=$GCC
+GCC=$GXX
+lt_save_with_gnu_ld=$with_gnu_ld
+lt_save_path_LD=$lt_cv_path_LD
+if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then
+ lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx
+else
+ unset lt_cv_prog_gnu_ld
+fi
+if test -n "${lt_cv_path_LDCXX+set}"; then
+ lt_cv_path_LD=$lt_cv_path_LDCXX
+else
+ unset lt_cv_path_LD
+fi
+test -z "${LDCXX+set}" || LD=$LDCXX
+CC=${CXX-"c++"}
+compiler=$CC
+_LT_AC_TAGVAR(compiler, $1)=$CC
+cc_basename=`$echo X"$compiler" | $Xsed -e 's%^.*/%%'`
+
+# We don't want -fno-exception wen compiling C++ code, so set the
+# no_builtin_flag separately
+if test "$GXX" = yes; then
+ _LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin'
+else
+ _LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=
+fi
+
+if test "$GXX" = yes; then
+ # Set up default GNU C++ configuration
+
+ AC_PROG_LD
+
+ # Check if GNU C++ uses GNU ld as the underlying linker, since the
+ # archiving commands below assume that GNU ld is being used.
+ if test "$with_gnu_ld" = yes; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir'
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+
+ # If archive_cmds runs LD, not CC, wlarc should be empty
+ # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to
+ # investigate it a little bit more. (MM)
+ wlarc='${wl}'
+
+ # ancient GNU ld didn't support --whole-archive et. al.
+ if eval "`$CC -print-prog-name=ld` --help 2>&1" | \
+ grep 'no-whole-archive' > /dev/null; then
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'
+ else
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=
+ fi
+ else
+ with_gnu_ld=no
+ wlarc=
+
+ # A generic and very simple default shared library creation
+ # command for GNU C++ for the case where it uses the native
+ # linker, instead of GNU ld. If possible, this setting should
+ # overridden to take advantage of the native linker features on
+ # the platform it is being used on.
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'
+ fi
+
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "\-L"'
+
+else
+ GXX=no
+ with_gnu_ld=no
+ wlarc=
+fi
+
+# PORTME: fill in a description of your system's C++ link characteristics
+AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])
+_LT_AC_TAGVAR(ld_shlibs, $1)=yes
+case $host_os in
+ aix3*)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ aix4* | aix5*)
+ if test "$host_cpu" = ia64; then
+ # On IA64, the linker does run time linking by default, so we don't
+ # have to do anything special.
+ aix_use_runtimelinking=no
+ exp_sym_flag='-Bexport'
+ no_entry_flag=""
+ else
+ aix_use_runtimelinking=no
+
+ # Test if we are trying to use run time linking or normal
+ # AIX style linking. If -brtl is somewhere in LDFLAGS, we
+ # need to do runtime linking.
+ case $host_os in aix4.[[23]]|aix4.[[23]].*|aix5*)
+ for ld_flag in $LDFLAGS; do
+ case $ld_flag in
+ *-brtl*)
+ aix_use_runtimelinking=yes
+ break
+ ;;
+ esac
+ done
+ esac
+
+ exp_sym_flag='-bexport'
+ no_entry_flag='-bnoentry'
+ fi
+
+ # When large executables or shared objects are built, AIX ld can
+ # have problems creating the table of contents. If linking a library
+ # or program results in "error TOC overflow" add -mminimal-toc to
+ # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not
+ # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.
+
+ _LT_AC_TAGVAR(archive_cmds, $1)=''
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=':'
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=yes
+
+ if test "$GXX" = yes; then
+ case $host_os in aix4.[012]|aix4.[012].*)
+ # We only want to do this on AIX 4.2 and lower, the check
+ # below for broken collect2 doesn't work under 4.3+
+ collect2name=`${CC} -print-prog-name=collect2`
+ if test -f "$collect2name" && \
+ strings "$collect2name" | grep resolve_lib_name >/dev/null
+ then
+ # We have reworked collect2
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ else
+ # We have old collect2
+ _LT_AC_TAGVAR(hardcode_direct, $1)=unsupported
+ # It fails to find uninstalled libraries when the uninstalled
+ # path is not listed in the libpath. Setting hardcode_minus_L
+ # to unsupported forces relinking
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=
+ fi
+ esac
+ shared_flag='-shared'
+ else
+ # not using gcc
+ if test "$host_cpu" = ia64; then
+ # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release
+ # chokes on -Wl,-G. The following line is correct:
+ shared_flag='-G'
+ else
+ if test "$aix_use_runtimelinking" = yes; then
+ shared_flag='${wl}-G'
+ else
+ shared_flag='${wl}-bM:SRE'
+ fi
+ fi
+ fi
+
+ # It seems that -bexpall does not export symbols beginning with
+ # underscore (_), so it is better to generate a list of symbols to export.
+ _LT_AC_TAGVAR(always_export_symbols, $1)=yes
+ if test "$aix_use_runtimelinking" = yes; then
+ # Warning - without using the other runtime loading flags (-brtl),
+ # -berok will link without error, but may produce a broken library.
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-berok'
+ # Determine the default libpath from the value encoded in an empty executable.
+ _LT_AC_SYS_LIBPATH_AIX
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"
+
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols $shared_flag"
+ else
+ if test "$host_cpu" = ia64; then
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib'
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)="-z nodefs"
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols"
+ else
+ # Determine the default libpath from the value encoded in an empty executable.
+ _LT_AC_SYS_LIBPATH_AIX
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"
+ # Warning - without using the other run time loading flags,
+ # -berok will link without error, but may produce a broken library.
+ _LT_AC_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok'
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok'
+ # -bexpall does not export symbols beginning with underscore (_)
+ _LT_AC_TAGVAR(always_export_symbols, $1)=yes
+ # Exported symbols can be pulled into shared objects from archives
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=' '
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=yes
+ # This is similar to how AIX traditionally builds it's shared libraries.
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}-bE:$export_symbols ${wl}-bnoentry${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'
+ fi
+ fi
+ ;;
+ chorus*)
+ case $cc_basename in
+ *)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ esac
+ ;;
+
+ cygwin* | mingw* | pw32*)
+ # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,
+ # as there is no search path for DLLs.
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported
+ _LT_AC_TAGVAR(always_export_symbols, $1)=no
+ _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=yes
+
+ if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib'
+ # If the export-symbols file already is a .def file (1st line
+ # is EXPORTS), use it as is; otherwise, prepend...
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+ cp $export_symbols $output_objdir/$soname.def;
+ else
+ echo EXPORTS > $output_objdir/$soname.def;
+ cat $export_symbols >> $output_objdir/$soname.def;
+ fi~
+ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib'
+ else
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+
+ darwin* | rhapsody*)
+ if test "$GXX" = yes; then
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+ case "$host_os" in
+ rhapsody* | darwin1.[[012]])
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined suppress'
+ ;;
+ *) # Darwin 1.3 on
+ if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'
+ else
+ case ${MACOSX_DEPLOYMENT_TARGET} in
+ 10.[[012]])
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'
+ ;;
+ 10.*)
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined dynamic_lookup'
+ ;;
+ esac
+ fi
+ ;;
+ esac
+ lt_int_apple_cc_single_mod=no
+ output_verbose_link_cmd='echo'
+ if $CC -dumpspecs 2>&1 | grep 'single_module' >/dev/null ; then
+ lt_int_apple_cc_single_mod=yes
+ fi
+ if test "X$lt_int_apple_cc_single_mod" = Xyes ; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring'
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -r ${wl}-bind_at_load -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring'
+ fi
+ _LT_AC_TAGVAR(module_cmds, $1)='$CC ${wl}-bind_at_load $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags'
+
+ # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's
+ if test "X$lt_int_apple_cc_single_mod" = Xyes ; then
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'
+ else
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -r ${wl}-bind_at_load -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'
+ fi
+ _LT_AC_TAGVAR(module_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no
+ _LT_AC_TAGVAR(hardcode_automatic, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=unsupported
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='-all_load $convenience'
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=yes
+ else
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+
+ dgux*)
+ case $cc_basename in
+ ec++)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ ghcx)
+ # Green Hills C++ Compiler
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ *)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ esac
+ ;;
+ freebsd[12]*)
+ # C++ shared libraries reported to be fairly broken before switch to ELF
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ freebsd-elf*)
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+ ;;
+ freebsd* | kfreebsd*-gnu)
+ # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF
+ # conventions
+ _LT_AC_TAGVAR(ld_shlibs, $1)=yes
+ ;;
+ gnu*)
+ ;;
+ hpux9*)
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,
+ # but as the default
+ # location of the library.
+
+ case $cc_basename in
+ CC)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ aCC)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ #
+ # There doesn't appear to be a way to prevent this compiler from
+ # explicitly linking system object files so we need to strip them
+ # from the output so that they don't get included in the library
+ # dependencies.
+ output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | grep "[-]L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'
+ ;;
+ *)
+ if test "$GXX" = yes; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/$soname~$CC -shared -nostdlib -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+ else
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+ esac
+ ;;
+ hpux10*|hpux11*)
+ if test $with_gnu_ld = no; then
+ case "$host_cpu" in
+ hppa*64*)
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='+b $libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ ;;
+ ia64*)
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ ;;
+ *)
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+ ;;
+ esac
+ fi
+ case "$host_cpu" in
+ hppa*64*)
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+ ia64*)
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,
+ # but as the default
+ # location of the library.
+ ;;
+ *)
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,
+ # but as the default
+ # location of the library.
+ ;;
+ esac
+
+ case $cc_basename in
+ CC)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ aCC)
+ case "$host_cpu" in
+ hppa*64*|ia64*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -b +h $soname -o $lib $linker_flags $libobjs $deplibs'
+ ;;
+ *)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+ ;;
+ esac
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ #
+ # There doesn't appear to be a way to prevent this compiler from
+ # explicitly linking system object files so we need to strip them
+ # from the output so that they don't get included in the library
+ # dependencies.
+ output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | grep "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'
+ ;;
+ *)
+ if test "$GXX" = yes; then
+ if test $with_gnu_ld = no; then
+ case "$host_cpu" in
+ ia64*|hppa*64*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -b +h $soname -o $lib $linker_flags $libobjs $deplibs'
+ ;;
+ *)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+ ;;
+ esac
+ fi
+ else
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+ esac
+ ;;
+ irix5* | irix6*)
+ case $cc_basename in
+ CC)
+ # SGI C++
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${objdir}/so_locations -o $lib'
+
+ # Archives containing C++ object files must be created using
+ # "CC -ar", where "CC" is the IRIX C++ compiler. This is
+ # necessary to make sure instantiated templates are included
+ # in the archive.
+ _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs'
+ ;;
+ *)
+ if test "$GXX" = yes; then
+ if test "$with_gnu_ld" = no; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${objdir}/so_locations -o $lib'
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` -o $lib'
+ fi
+ fi
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=yes
+ ;;
+ esac
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ ;;
+ linux*)
+ case $cc_basename in
+ KCC)
+ # Kuck and Associates, Inc. (KAI) C++ Compiler
+
+ # KCC will only create a shared library if the output file
+ # ends with ".so" (or ".sl" for HP-UX), so rename the library
+ # to its proper name (with version) after linking.
+ _LT_AC_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib'
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ #
+ # There doesn't appear to be a way to prevent this compiler from
+ # explicitly linking system object files so we need to strip them
+ # from the output so that they don't get included in the library
+ # dependencies.
+ output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | grep "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath,$libdir'
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+
+ # Archives containing C++ object files must be created using
+ # "CC -Bstatic", where "CC" is the KAI C++ compiler.
+ _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs'
+ ;;
+ icpc)
+ # Intel C++
+ with_gnu_ld=yes
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive'
+ ;;
+ cxx)
+ # Compaq C++
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols'
+
+ runpath_var=LD_RUN_PATH
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ #
+ # There doesn't appear to be a way to prevent this compiler from
+ # explicitly linking system object files so we need to strip them
+ # from the output so that they don't get included in the library
+ # dependencies.
+ output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "ld"`; templist=`echo $templist | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'
+ ;;
+ esac
+ ;;
+ lynxos*)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ m88k*)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ mvs*)
+ case $cc_basename in
+ cxx)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ *)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ esac
+ ;;
+ netbsd*)
+ if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags'
+ wlarc=
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ fi
+ # Workaround some broken pre-1.5 toolchains
+ output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"'
+ ;;
+ osf3*)
+ case $cc_basename in
+ KCC)
+ # Kuck and Associates, Inc. (KAI) C++ Compiler
+
+ # KCC will only create a shared library if the output file
+ # ends with ".so" (or ".sl" for HP-UX), so rename the library
+ # to its proper name (with version) after linking.
+ _LT_AC_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+
+ # Archives containing C++ object files must be created using
+ # "CC -Bstatic", where "CC" is the KAI C++ compiler.
+ _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs'
+
+ ;;
+ RCC)
+ # Rational C++ 2.4.1
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ cxx)
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && echo ${wl}-set_version $verstring` -update_registry ${objdir}/so_locations -o $lib'
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ #
+ # There doesn't appear to be a way to prevent this compiler from
+ # explicitly linking system object files so we need to strip them
+ # from the output so that they don't get included in the library
+ # dependencies.
+ output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "ld" | grep -v "ld:"`; templist=`echo $templist | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'
+ ;;
+ *)
+ if test "$GXX" = yes && test "$with_gnu_ld" = no; then
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${objdir}/so_locations -o $lib'
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "\-L"'
+
+ else
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+ esac
+ ;;
+ osf4* | osf5*)
+ case $cc_basename in
+ KCC)
+ # Kuck and Associates, Inc. (KAI) C++ Compiler
+
+ # KCC will only create a shared library if the output file
+ # ends with ".so" (or ".sl" for HP-UX), so rename the library
+ # to its proper name (with version) after linking.
+ _LT_AC_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+
+ # Archives containing C++ object files must be created using
+ # the KAI C++ compiler.
+ _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs'
+ ;;
+ RCC)
+ # Rational C++ 2.4.1
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ cxx)
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${objdir}/so_locations -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~
+ echo "-hidden">> $lib.exp~
+ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname -Wl,-input -Wl,$lib.exp `test -n "$verstring" && echo -set_version $verstring` -update_registry $objdir/so_locations -o $lib~
+ $rm $lib.exp'
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ #
+ # There doesn't appear to be a way to prevent this compiler from
+ # explicitly linking system object files so we need to strip them
+ # from the output so that they don't get included in the library
+ # dependencies.
+ output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "ld" | grep -v "ld:"`; templist=`echo $templist | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'
+ ;;
+ *)
+ if test "$GXX" = yes && test "$with_gnu_ld" = no; then
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${objdir}/so_locations -o $lib'
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep "\-L"'
+
+ else
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+ esac
+ ;;
+ psos*)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ sco*)
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+ case $cc_basename in
+ CC)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ *)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ esac
+ ;;
+ sunos4*)
+ case $cc_basename in
+ CC)
+ # Sun C++ 4.x
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ lcc)
+ # Lucid
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ *)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ esac
+ ;;
+ solaris*)
+ case $cc_basename in
+ CC)
+ # Sun C++ 4.2, 5.x and Centerline C++
+ _LT_AC_TAGVAR(no_undefined_flag, $1)=' -zdefs'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -nolib -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~
+ $CC -G${allow_undefined_flag} -nolib ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$rm $lib.exp'
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ case $host_os in
+ solaris2.[0-5] | solaris2.[0-5].*) ;;
+ *)
+ # The C++ compiler is used as linker so we must use $wl
+ # flag to pass the commands to the underlying system
+ # linker.
+ # Supported since Solaris 2.6 (maybe 2.5.1?)
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'
+ ;;
+ esac
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=yes
+
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ #
+ # There doesn't appear to be a way to prevent this compiler from
+ # explicitly linking system object files so we need to strip them
+ # from the output so that they don't get included in the library
+ # dependencies.
+ output_verbose_link_cmd='templist=`$CC -G $CFLAGS -v conftest.$objext 2>&1 | grep "\-[[LR]]"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; echo $list'
+
+ # Archives containing C++ object files must be created using
+ # "CC -xar", where "CC" is the Sun C++ compiler. This is
+ # necessary to make sure instantiated templates are included
+ # in the archive.
+ _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs'
+ ;;
+ gcx)
+ # Green Hills C++ Compiler
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'
+
+ # The C++ compiler must be used to create the archive.
+ _LT_AC_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs'
+ ;;
+ *)
+ # GNU C++ compiler with Solaris linker
+ if test "$GXX" = yes && test "$with_gnu_ld" = no; then
+ _LT_AC_TAGVAR(no_undefined_flag, $1)=' ${wl}-z ${wl}defs'
+ if $CC --version | grep -v '^2\.7' > /dev/null; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~
+ $CC -shared -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$rm $lib.exp'
+
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ output_verbose_link_cmd="$CC -shared $CFLAGS -v conftest.$objext 2>&1 | grep \"\-L\""
+ else
+ # g++ 2.7 appears to require `-G' NOT `-shared' on this
+ # platform.
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~
+ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$rm $lib.exp'
+
+ # Commands to make compiler produce verbose output that lists
+ # what "hidden" libraries, object files and flags are used when
+ # linking a shared library.
+ output_verbose_link_cmd="$CC -G $CFLAGS -v conftest.$objext 2>&1 | grep \"\-L\""
+ fi
+
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $wl$libdir'
+ fi
+ ;;
+ esac
+ ;;
+ sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[[78]]* | unixware7*)
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+ ;;
+ tandem*)
+ case $cc_basename in
+ NCC)
+ # NonStop-UX NCC 3.20
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ *)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ esac
+ ;;
+ vxworks*)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ *)
+ # FIXME: insert proper C++ library support
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+esac
+AC_MSG_RESULT([$_LT_AC_TAGVAR(ld_shlibs, $1)])
+test "$_LT_AC_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no
+
+_LT_AC_TAGVAR(GCC, $1)="$GXX"
+_LT_AC_TAGVAR(LD, $1)="$LD"
+
+## CAVEAT EMPTOR:
+## There is no encapsulation within the following macros, do not change
+## the running order or otherwise move them around unless you know exactly
+## what you are doing...
+AC_LIBTOOL_POSTDEP_PREDEP($1)
+AC_LIBTOOL_PROG_COMPILER_PIC($1)
+AC_LIBTOOL_PROG_CC_C_O($1)
+AC_LIBTOOL_SYS_HARD_LINK_LOCKS($1)
+AC_LIBTOOL_PROG_LD_SHLIBS($1)
+AC_LIBTOOL_SYS_DYNAMIC_LINKER($1)
+AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH($1)
+AC_LIBTOOL_SYS_LIB_STRIP
+AC_LIBTOOL_DLOPEN_SELF($1)
+
+AC_LIBTOOL_CONFIG($1)
+
+AC_LANG_POP
+CC=$lt_save_CC
+LDCXX=$LD
+LD=$lt_save_LD
+GCC=$lt_save_GCC
+with_gnu_ldcxx=$with_gnu_ld
+with_gnu_ld=$lt_save_with_gnu_ld
+lt_cv_path_LDCXX=$lt_cv_path_LD
+lt_cv_path_LD=$lt_save_path_LD
+lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld
+lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld
+])# AC_LIBTOOL_LANG_CXX_CONFIG
+
+# AC_LIBTOOL_POSTDEP_PREDEP([TAGNAME])
+# ------------------------
+# Figure out "hidden" library dependencies from verbose
+# compiler output when linking a shared library.
+# Parse the compiler output and extract the necessary
+# objects, libraries and library flags.
+AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP],[
+dnl we can't use the lt_simple_compile_test_code here,
+dnl because it contains code intended for an executable,
+dnl not a library. It's possible we should let each
+dnl tag define a new lt_????_link_test_code variable,
+dnl but it's only used here...
+ifelse([$1],[],[cat > conftest.$ac_ext <<EOF
+int a;
+void foo (void) { a = 0; }
+EOF
+],[$1],[CXX],[cat > conftest.$ac_ext <<EOF
+class Foo
+{
+public:
+ Foo (void) { a = 0; }
+private:
+ int a;
+};
+EOF
+],[$1],[F77],[cat > conftest.$ac_ext <<EOF
+ subroutine foo
+ implicit none
+ integer*4 a
+ a=0
+ return
+ end
+EOF
+],[$1],[GCJ],[cat > conftest.$ac_ext <<EOF
+public class foo {
+ private int a;
+ public void bar (void) {
+ a = 0;
+ }
+};
+EOF
+])
+dnl Parse the compiler output and extract the necessary
+dnl objects, libraries and library flags.
+if AC_TRY_EVAL(ac_compile); then
+ # Parse the compiler output and extract the necessary
+ # objects, libraries and library flags.
+
+ # Sentinel used to keep track of whether or not we are before
+ # the conftest object file.
+ pre_test_object_deps_done=no
+
+ # The `*' in the case matches for architectures that use `case' in
+ # $output_verbose_cmd can trigger glob expansion during the loop
+ # eval without this substitution.
+ output_verbose_link_cmd="`$echo \"X$output_verbose_link_cmd\" | $Xsed -e \"$no_glob_subst\"`"
+
+ for p in `eval $output_verbose_link_cmd`; do
+ case $p in
+
+ -L* | -R* | -l*)
+ # Some compilers place space between "-{L,R}" and the path.
+ # Remove the space.
+ if test $p = "-L" \
+ || test $p = "-R"; then
+ prev=$p
+ continue
+ else
+ prev=
+ fi
+
+ if test "$pre_test_object_deps_done" = no; then
+ case $p in
+ -L* | -R*)
+ # Internal compiler library paths should come after those
+ # provided the user. The postdeps already come after the
+ # user supplied libs so there is no need to process them.
+ if test -z "$_LT_AC_TAGVAR(compiler_lib_search_path, $1)"; then
+ _LT_AC_TAGVAR(compiler_lib_search_path, $1)="${prev}${p}"
+ else
+ _LT_AC_TAGVAR(compiler_lib_search_path, $1)="${_LT_AC_TAGVAR(compiler_lib_search_path, $1)} ${prev}${p}"
+ fi
+ ;;
+ # The "-l" case would never come before the object being
+ # linked, so don't bother handling this case.
+ esac
+ else
+ if test -z "$_LT_AC_TAGVAR(postdeps, $1)"; then
+ _LT_AC_TAGVAR(postdeps, $1)="${prev}${p}"
+ else
+ _LT_AC_TAGVAR(postdeps, $1)="${_LT_AC_TAGVAR(postdeps, $1)} ${prev}${p}"
+ fi
+ fi
+ ;;
+
+ *.$objext)
+ # This assumes that the test object file only shows up
+ # once in the compiler output.
+ if test "$p" = "conftest.$objext"; then
+ pre_test_object_deps_done=yes
+ continue
+ fi
+
+ if test "$pre_test_object_deps_done" = no; then
+ if test -z "$_LT_AC_TAGVAR(predep_objects, $1)"; then
+ _LT_AC_TAGVAR(predep_objects, $1)="$p"
+ else
+ _LT_AC_TAGVAR(predep_objects, $1)="$_LT_AC_TAGVAR(predep_objects, $1) $p"
+ fi
+ else
+ if test -z "$_LT_AC_TAGVAR(postdep_objects, $1)"; then
+ _LT_AC_TAGVAR(postdep_objects, $1)="$p"
+ else
+ _LT_AC_TAGVAR(postdep_objects, $1)="$_LT_AC_TAGVAR(postdep_objects, $1) $p"
+ fi
+ fi
+ ;;
+
+ *) ;; # Ignore the rest.
+
+ esac
+ done
+
+ # Clean up.
+ rm -f a.out a.exe
+else
+ echo "libtool.m4: error: problem compiling $1 test program"
+fi
+
+$rm -f confest.$objext
+
+case " $_LT_AC_TAGVAR(postdeps, $1) " in
+*" -lc "*) _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no ;;
+esac
+])# AC_LIBTOOL_POSTDEP_PREDEP
+
+# AC_LIBTOOL_LANG_F77_CONFIG
+# ------------------------
+# Ensure that the configuration vars for the C compiler are
+# suitably defined. Those variables are subsequently used by
+# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.
+AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG], [_LT_AC_LANG_F77_CONFIG(F77)])
+AC_DEFUN([_LT_AC_LANG_F77_CONFIG],
+[AC_REQUIRE([AC_PROG_F77])
+AC_LANG_PUSH(Fortran 77)
+
+_LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+_LT_AC_TAGVAR(allow_undefined_flag, $1)=
+_LT_AC_TAGVAR(always_export_symbols, $1)=no
+_LT_AC_TAGVAR(archive_expsym_cmds, $1)=
+_LT_AC_TAGVAR(export_dynamic_flag_spec, $1)=
+_LT_AC_TAGVAR(hardcode_direct, $1)=no
+_LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=
+_LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)=
+_LT_AC_TAGVAR(hardcode_libdir_separator, $1)=
+_LT_AC_TAGVAR(hardcode_minus_L, $1)=no
+_LT_AC_TAGVAR(hardcode_automatic, $1)=no
+_LT_AC_TAGVAR(module_cmds, $1)=
+_LT_AC_TAGVAR(module_expsym_cmds, $1)=
+_LT_AC_TAGVAR(link_all_deplibs, $1)=unknown
+_LT_AC_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds
+_LT_AC_TAGVAR(no_undefined_flag, $1)=
+_LT_AC_TAGVAR(whole_archive_flag_spec, $1)=
+_LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=no
+
+# Source file extension for f77 test sources.
+ac_ext=f
+
+# Object file extension for compiled f77 test sources.
+objext=o
+_LT_AC_TAGVAR(objext, $1)=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code=" subroutine t\n return\n end\n"
+
+# Code to be used in simple link tests
+lt_simple_link_test_code=" program t\n end\n"
+
+# ltmain only uses $CC for tagged configurations so make sure $CC is set.
+_LT_AC_SYS_COMPILER
+
+# Allow CC to be a program name with arguments.
+lt_save_CC="$CC"
+CC=${F77-"f77"}
+compiler=$CC
+_LT_AC_TAGVAR(compiler, $1)=$CC
+cc_basename=`$echo X"$compiler" | $Xsed -e 's%^.*/%%'`
+
+AC_MSG_CHECKING([if libtool supports shared libraries])
+AC_MSG_RESULT([$can_build_shared])
+
+AC_MSG_CHECKING([whether to build shared libraries])
+test "$can_build_shared" = "no" && enable_shared=no
+
+# On AIX, shared libraries and static libraries use the same namespace, and
+# are all built from PIC.
+case "$host_os" in
+aix3*)
+ test "$enable_shared" = yes && enable_static=no
+ if test -n "$RANLIB"; then
+ archive_cmds="$archive_cmds~\$RANLIB \$lib"
+ postinstall_cmds='$RANLIB $lib'
+ fi
+ ;;
+aix4* | aix5*)
+ test "$enable_shared" = yes && enable_static=no
+ ;;
+esac
+AC_MSG_RESULT([$enable_shared])
+
+AC_MSG_CHECKING([whether to build static libraries])
+# Make sure either enable_shared or enable_static is yes.
+test "$enable_shared" = yes || enable_static=yes
+AC_MSG_RESULT([$enable_static])
+
+test "$_LT_AC_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no
+
+_LT_AC_TAGVAR(GCC, $1)="$G77"
+_LT_AC_TAGVAR(LD, $1)="$LD"
+
+AC_LIBTOOL_PROG_COMPILER_PIC($1)
+AC_LIBTOOL_PROG_CC_C_O($1)
+AC_LIBTOOL_SYS_HARD_LINK_LOCKS($1)
+AC_LIBTOOL_PROG_LD_SHLIBS($1)
+AC_LIBTOOL_SYS_DYNAMIC_LINKER($1)
+AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH($1)
+AC_LIBTOOL_SYS_LIB_STRIP
+
+
+AC_LIBTOOL_CONFIG($1)
+
+AC_LANG_POP
+CC="$lt_save_CC"
+])# AC_LIBTOOL_LANG_F77_CONFIG
+
+
+# AC_LIBTOOL_LANG_GCJ_CONFIG
+# --------------------------
+# Ensure that the configuration vars for the C compiler are
+# suitably defined. Those variables are subsequently used by
+# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.
+AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG], [_LT_AC_LANG_GCJ_CONFIG(GCJ)])
+AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG],
+[AC_LANG_SAVE
+
+# Source file extension for Java test sources.
+ac_ext=java
+
+# Object file extension for compiled Java test sources.
+objext=o
+_LT_AC_TAGVAR(objext, $1)=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code="class foo {}\n"
+
+# Code to be used in simple link tests
+lt_simple_link_test_code='public class conftest { public static void main(String[] argv) {}; }\n'
+
+# ltmain only uses $CC for tagged configurations so make sure $CC is set.
+_LT_AC_SYS_COMPILER
+
+# Allow CC to be a program name with arguments.
+lt_save_CC="$CC"
+CC=${GCJ-"gcj"}
+compiler=$CC
+_LT_AC_TAGVAR(compiler, $1)=$CC
+
+# GCJ did not exist at the time GCC didn't implicitly link libc in.
+_LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+
+## CAVEAT EMPTOR:
+## There is no encapsulation within the following macros, do not change
+## the running order or otherwise move them around unless you know exactly
+## what you are doing...
+AC_LIBTOOL_PROG_COMPILER_NO_RTTI($1)
+AC_LIBTOOL_PROG_COMPILER_PIC($1)
+AC_LIBTOOL_PROG_CC_C_O($1)
+AC_LIBTOOL_SYS_HARD_LINK_LOCKS($1)
+AC_LIBTOOL_PROG_LD_SHLIBS($1)
+AC_LIBTOOL_SYS_DYNAMIC_LINKER($1)
+AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH($1)
+AC_LIBTOOL_SYS_LIB_STRIP
+AC_LIBTOOL_DLOPEN_SELF($1)
+
+AC_LIBTOOL_CONFIG($1)
+
+AC_LANG_RESTORE
+CC="$lt_save_CC"
+])# AC_LIBTOOL_LANG_GCJ_CONFIG
+
+
+# AC_LIBTOOL_LANG_RC_CONFIG
+# --------------------------
+# Ensure that the configuration vars for the Windows resource compiler are
+# suitably defined. Those variables are subsequently used by
+# AC_LIBTOOL_CONFIG to write the compiler configuration to `libtool'.
+AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG], [_LT_AC_LANG_RC_CONFIG(RC)])
+AC_DEFUN([_LT_AC_LANG_RC_CONFIG],
+[AC_LANG_SAVE
+
+# Source file extension for RC test sources.
+ac_ext=rc
+
+# Object file extension for compiled RC test sources.
+objext=o
+_LT_AC_TAGVAR(objext, $1)=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }\n'
+
+# Code to be used in simple link tests
+lt_simple_link_test_code="$lt_simple_compile_test_code"
+
+# ltmain only uses $CC for tagged configurations so make sure $CC is set.
+_LT_AC_SYS_COMPILER
+
+# Allow CC to be a program name with arguments.
+lt_save_CC="$CC"
+CC=${RC-"windres"}
+compiler=$CC
+_LT_AC_TAGVAR(compiler, $1)=$CC
+_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes
+
+AC_LIBTOOL_CONFIG($1)
+
+AC_LANG_RESTORE
+CC="$lt_save_CC"
+])# AC_LIBTOOL_LANG_RC_CONFIG
+
+
+# AC_LIBTOOL_CONFIG([TAGNAME])
+# ----------------------------
+# If TAGNAME is not passed, then create an initial libtool script
+# with a default configuration from the untagged config vars. Otherwise
+# add code to config.status for appending the configuration named by
+# TAGNAME from the matching tagged config vars.
+AC_DEFUN([AC_LIBTOOL_CONFIG],
+[# The else clause should only fire when bootstrapping the
+# libtool distribution, otherwise you forgot to ship ltmain.sh
+# with your package, and you will get complaints that there are
+# no rules to generate ltmain.sh.
+if test -f "$ltmain"; then
+ # See if we are running on zsh, and set the options which allow our commands through
+ # without removal of \ escapes.
+ if test -n "${ZSH_VERSION+set}" ; then
+ setopt NO_GLOB_SUBST
+ fi
+ # Now quote all the things that may contain metacharacters while being
+ # careful not to overquote the AC_SUBSTed values. We take copies of the
+ # variables and quote the copies for generation of the libtool script.
+ for var in echo old_CC old_CFLAGS AR AR_FLAGS EGREP RANLIB LN_S LTCC NM \
+ SED SHELL STRIP \
+ libname_spec library_names_spec soname_spec extract_expsyms_cmds \
+ old_striplib striplib file_magic_cmd finish_cmds finish_eval \
+ deplibs_check_method reload_flag reload_cmds need_locks \
+ lt_cv_sys_global_symbol_pipe lt_cv_sys_global_symbol_to_cdecl \
+ lt_cv_sys_global_symbol_to_c_name_address \
+ sys_lib_search_path_spec sys_lib_dlsearch_path_spec \
+ old_postinstall_cmds old_postuninstall_cmds \
+ _LT_AC_TAGVAR(compiler, $1) \
+ _LT_AC_TAGVAR(CC, $1) \
+ _LT_AC_TAGVAR(LD, $1) \
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1) \
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1) \
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1) \
+ _LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) \
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1) \
+ _LT_AC_TAGVAR(thread_safe_flag_spec, $1) \
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1) \
+ _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1) \
+ _LT_AC_TAGVAR(old_archive_cmds, $1) \
+ _LT_AC_TAGVAR(old_archive_from_new_cmds, $1) \
+ _LT_AC_TAGVAR(predep_objects, $1) \
+ _LT_AC_TAGVAR(postdep_objects, $1) \
+ _LT_AC_TAGVAR(predeps, $1) \
+ _LT_AC_TAGVAR(postdeps, $1) \
+ _LT_AC_TAGVAR(compiler_lib_search_path, $1) \
+ _LT_AC_TAGVAR(archive_cmds, $1) \
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1) \
+ _LT_AC_TAGVAR(postinstall_cmds, $1) \
+ _LT_AC_TAGVAR(postuninstall_cmds, $1) \
+ _LT_AC_TAGVAR(old_archive_from_expsyms_cmds, $1) \
+ _LT_AC_TAGVAR(allow_undefined_flag, $1) \
+ _LT_AC_TAGVAR(no_undefined_flag, $1) \
+ _LT_AC_TAGVAR(export_symbols_cmds, $1) \
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1) \
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1) \
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1) \
+ _LT_AC_TAGVAR(hardcode_automatic, $1) \
+ _LT_AC_TAGVAR(module_cmds, $1) \
+ _LT_AC_TAGVAR(module_expsym_cmds, $1) \
+ _LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1) \
+ _LT_AC_TAGVAR(exclude_expsyms, $1) \
+ _LT_AC_TAGVAR(include_expsyms, $1); do
+
+ case $var in
+ _LT_AC_TAGVAR(old_archive_cmds, $1) | \
+ _LT_AC_TAGVAR(old_archive_from_new_cmds, $1) | \
+ _LT_AC_TAGVAR(archive_cmds, $1) | \
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1) | \
+ _LT_AC_TAGVAR(module_cmds, $1) | \
+ _LT_AC_TAGVAR(module_expsym_cmds, $1) | \
+ _LT_AC_TAGVAR(old_archive_from_expsyms_cmds, $1) | \
+ _LT_AC_TAGVAR(export_symbols_cmds, $1) | \
+ extract_expsyms_cmds | reload_cmds | finish_cmds | \
+ postinstall_cmds | postuninstall_cmds | \
+ old_postinstall_cmds | old_postuninstall_cmds | \
+ sys_lib_search_path_spec | sys_lib_dlsearch_path_spec)
+ # Double-quote double-evaled strings.
+ eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$double_quote_subst\" -e \"\$sed_quote_subst\" -e \"\$delay_variable_subst\"\`\\\""
+ ;;
+ *)
+ eval "lt_$var=\\\"\`\$echo \"X\$$var\" | \$Xsed -e \"\$sed_quote_subst\"\`\\\""
+ ;;
+ esac
+ done
+
+ case $lt_echo in
+ *'\[$]0 --fallback-echo"')
+ lt_echo=`$echo "X$lt_echo" | $Xsed -e 's/\\\\\\\[$]0 --fallback-echo"[$]/[$]0 --fallback-echo"/'`
+ ;;
+ esac
+
+ifelse([$1], [],
+ [cfgfile="${ofile}T"
+ trap "$rm \"$cfgfile\"; exit 1" 1 2 15
+ $rm -f "$cfgfile"
+ AC_MSG_NOTICE([creating $ofile])],
+ [cfgfile="$ofile"])
+
+ cat <<__EOF__ >> "$cfgfile"
+ifelse([$1], [],
+[#! $SHELL
+
+# `$echo "$cfgfile" | sed 's%^.*/%%'` - Provide generalized library-building support services.
+# Generated automatically by $PROGRAM (GNU $PACKAGE $VERSION$TIMESTAMP)
+# NOTE: Changes made to this file will be lost: look at ltmain.sh.
+#
+# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001
+# Free Software Foundation, Inc.
+#
+# This file is part of GNU Libtool:
+# Originally by Gordon Matzigkeit <gord@gnu.ai.mit.edu>, 1996
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+# A sed program that does not truncate output.
+SED=$lt_SED
+
+# Sed that helps us avoid accidentally triggering echo(1) options like -n.
+Xsed="$SED -e s/^X//"
+
+# The HP-UX ksh and POSIX shell print the target directory to stdout
+# if CDPATH is set.
+if test "X\${CDPATH+set}" = Xset; then CDPATH=:; export CDPATH; fi
+
+# The names of the tagged configurations supported by this script.
+available_tags=
+
+# ### BEGIN LIBTOOL CONFIG],
+[# ### BEGIN LIBTOOL TAG CONFIG: $tagname])
+
+# Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`:
+
+# Shell to use when invoking shell scripts.
+SHELL=$lt_SHELL
+
+# Whether or not to build shared libraries.
+build_libtool_libs=$enable_shared
+
+# Whether or not to build static libraries.
+build_old_libs=$enable_static
+
+# Whether or not to add -lc for building shared libraries.
+build_libtool_need_lc=$_LT_AC_TAGVAR(archive_cmds_need_lc, $1)
+
+# Whether or not to disallow shared libs when runtime libs are static
+allow_libtool_libs_with_static_runtimes=$_LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)
+
+# Whether or not to optimize for fast installation.
+fast_install=$enable_fast_install
+
+# The host system.
+host_alias=$host_alias
+host=$host
+
+# An echo program that does not interpret backslashes.
+echo=$lt_echo
+
+# The archiver.
+AR=$lt_AR
+AR_FLAGS=$lt_AR_FLAGS
+
+# A C compiler.
+LTCC=$lt_LTCC
+
+# A language-specific compiler.
+CC=$lt_[]_LT_AC_TAGVAR(compiler, $1)
+
+# Is the compiler the GNU C compiler?
+with_gcc=$_LT_AC_TAGVAR(GCC, $1)
+
+# An ERE matcher.
+EGREP=$lt_EGREP
+
+# The linker used to build libraries.
+LD=$lt_[]_LT_AC_TAGVAR(LD, $1)
+
+# Whether we need hard or soft links.
+LN_S=$lt_LN_S
+
+# A BSD-compatible nm program.
+NM=$lt_NM
+
+# A symbol stripping program
+STRIP=$lt_STRIP
+
+# Used to examine libraries when file_magic_cmd begins "file"
+MAGIC_CMD=$MAGIC_CMD
+
+# Used on cygwin: DLL creation program.
+DLLTOOL="$DLLTOOL"
+
+# Used on cygwin: object dumper.
+OBJDUMP="$OBJDUMP"
+
+# Used on cygwin: assembler.
+AS="$AS"
+
+# The name of the directory that contains temporary libtool files.
+objdir=$objdir
+
+# How to create reloadable object files.
+reload_flag=$lt_reload_flag
+reload_cmds=$lt_reload_cmds
+
+# How to pass a linker flag through the compiler.
+wl=$lt_[]_LT_AC_TAGVAR(lt_prog_compiler_wl, $1)
+
+# Object file suffix (normally "o").
+objext="$ac_objext"
+
+# Old archive suffix (normally "a").
+libext="$libext"
+
+# Shared library suffix (normally ".so").
+shrext_cmds='$shrext_cmds'
+
+# Executable file suffix (normally "").
+exeext="$exeext"
+
+# Additional compiler flags for building library objects.
+pic_flag=$lt_[]_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)
+pic_mode=$pic_mode
+
+# What is the maximum length of a command?
+max_cmd_len=$lt_cv_sys_max_cmd_len
+
+# Does compiler simultaneously support -c and -o options?
+compiler_c_o=$lt_[]_LT_AC_TAGVAR(lt_cv_prog_compiler_c_o, $1)
+
+# Must we lock files when doing compilation ?
+need_locks=$lt_need_locks
+
+# Do we need the lib prefix for modules?
+need_lib_prefix=$need_lib_prefix
+
+# Do we need a version for libraries?
+need_version=$need_version
+
+# Whether dlopen is supported.
+dlopen_support=$enable_dlopen
+
+# Whether dlopen of programs is supported.
+dlopen_self=$enable_dlopen_self
+
+# Whether dlopen of statically linked programs is supported.
+dlopen_self_static=$enable_dlopen_self_static
+
+# Compiler flag to prevent dynamic linking.
+link_static_flag=$lt_[]_LT_AC_TAGVAR(lt_prog_compiler_static, $1)
+
+# Compiler flag to turn off builtin functions.
+no_builtin_flag=$lt_[]_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)
+
+# Compiler flag to allow reflexive dlopens.
+export_dynamic_flag_spec=$lt_[]_LT_AC_TAGVAR(export_dynamic_flag_spec, $1)
+
+# Compiler flag to generate shared objects directly from archives.
+whole_archive_flag_spec=$lt_[]_LT_AC_TAGVAR(whole_archive_flag_spec, $1)
+
+# Compiler flag to generate thread-safe objects.
+thread_safe_flag_spec=$lt_[]_LT_AC_TAGVAR(thread_safe_flag_spec, $1)
+
+# Library versioning type.
+version_type=$version_type
+
+# Format of library name prefix.
+libname_spec=$lt_libname_spec
+
+# List of archive names. First name is the real one, the rest are links.
+# The last name is the one that the linker finds with -lNAME.
+library_names_spec=$lt_library_names_spec
+
+# The coded name of the library, if different from the real name.
+soname_spec=$lt_soname_spec
+
+# Commands used to build and install an old-style archive.
+RANLIB=$lt_RANLIB
+old_archive_cmds=$lt_[]_LT_AC_TAGVAR(old_archive_cmds, $1)
+old_postinstall_cmds=$lt_old_postinstall_cmds
+old_postuninstall_cmds=$lt_old_postuninstall_cmds
+
+# Create an old-style archive from a shared archive.
+old_archive_from_new_cmds=$lt_[]_LT_AC_TAGVAR(old_archive_from_new_cmds, $1)
+
+# Create a temporary old-style archive to link instead of a shared archive.
+old_archive_from_expsyms_cmds=$lt_[]_LT_AC_TAGVAR(old_archive_from_expsyms_cmds, $1)
+
+# Commands used to build and install a shared archive.
+archive_cmds=$lt_[]_LT_AC_TAGVAR(archive_cmds, $1)
+archive_expsym_cmds=$lt_[]_LT_AC_TAGVAR(archive_expsym_cmds, $1)
+postinstall_cmds=$lt_postinstall_cmds
+postuninstall_cmds=$lt_postuninstall_cmds
+
+# Commands used to build a loadable module (assumed same as above if empty)
+module_cmds=$lt_[]_LT_AC_TAGVAR(module_cmds, $1)
+module_expsym_cmds=$lt_[]_LT_AC_TAGVAR(module_expsym_cmds, $1)
+
+# Commands to strip libraries.
+old_striplib=$lt_old_striplib
+striplib=$lt_striplib
+
+# Dependencies to place before the objects being linked to create a
+# shared library.
+predep_objects=$lt_[]_LT_AC_TAGVAR(predep_objects, $1)
+
+# Dependencies to place after the objects being linked to create a
+# shared library.
+postdep_objects=$lt_[]_LT_AC_TAGVAR(postdep_objects, $1)
+
+# Dependencies to place before the objects being linked to create a
+# shared library.
+predeps=$lt_[]_LT_AC_TAGVAR(predeps, $1)
+
+# Dependencies to place after the objects being linked to create a
+# shared library.
+postdeps=$lt_[]_LT_AC_TAGVAR(postdeps, $1)
+
+# The library search path used internally by the compiler when linking
+# a shared library.
+compiler_lib_search_path=$lt_[]_LT_AC_TAGVAR(compiler_lib_search_path, $1)
+
+# Method to check whether dependent libraries are shared objects.
+deplibs_check_method=$lt_deplibs_check_method
+
+# Command to use when deplibs_check_method == file_magic.
+file_magic_cmd=$lt_file_magic_cmd
+
+# Flag that allows shared libraries with undefined symbols to be built.
+allow_undefined_flag=$lt_[]_LT_AC_TAGVAR(allow_undefined_flag, $1)
+
+# Flag that forces no undefined symbols.
+no_undefined_flag=$lt_[]_LT_AC_TAGVAR(no_undefined_flag, $1)
+
+# Commands used to finish a libtool library installation in a directory.
+finish_cmds=$lt_finish_cmds
+
+# Same as above, but a single script fragment to be evaled but not shown.
+finish_eval=$lt_finish_eval
+
+# Take the output of nm and produce a listing of raw symbols and C names.
+global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe
+
+# Transform the output of nm in a proper C declaration
+global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl
+
+# Transform the output of nm in a C name address pair
+global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address
+
+# This is the shared library runtime path variable.
+runpath_var=$runpath_var
+
+# This is the shared library path variable.
+shlibpath_var=$shlibpath_var
+
+# Is shlibpath searched before the hard-coded library search path?
+shlibpath_overrides_runpath=$shlibpath_overrides_runpath
+
+# How to hardcode a shared library path into an executable.
+hardcode_action=$_LT_AC_TAGVAR(hardcode_action, $1)
+
+# Whether we should hardcode library paths into libraries.
+hardcode_into_libs=$hardcode_into_libs
+
+# Flag to hardcode \$libdir into a binary during linking.
+# This must work even if \$libdir does not exist.
+hardcode_libdir_flag_spec=$lt_[]_LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)
+
+# If ld is used when linking, flag to hardcode \$libdir into
+# a binary during linking. This must work even if \$libdir does
+# not exist.
+hardcode_libdir_flag_spec_ld=$lt_[]_LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)
+
+# Whether we need a single -rpath flag with a separated argument.
+hardcode_libdir_separator=$lt_[]_LT_AC_TAGVAR(hardcode_libdir_separator, $1)
+
+# Set to yes if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the
+# resulting binary.
+hardcode_direct=$_LT_AC_TAGVAR(hardcode_direct, $1)
+
+# Set to yes if using the -LDIR flag during linking hardcodes DIR into the
+# resulting binary.
+hardcode_minus_L=$_LT_AC_TAGVAR(hardcode_minus_L, $1)
+
+# Set to yes if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into
+# the resulting binary.
+hardcode_shlibpath_var=$_LT_AC_TAGVAR(hardcode_shlibpath_var, $1)
+
+# Set to yes if building a shared library automatically hardcodes DIR into the library
+# and all subsequent libraries and executables linked against it.
+hardcode_automatic=$_LT_AC_TAGVAR(hardcode_automatic, $1)
+
+# Variables whose values should be saved in libtool wrapper scripts and
+# restored at relink time.
+variables_saved_for_relink="$variables_saved_for_relink"
+
+# Whether libtool must link a program against all its dependency libraries.
+link_all_deplibs=$_LT_AC_TAGVAR(link_all_deplibs, $1)
+
+# Compile-time system search path for libraries
+sys_lib_search_path_spec=$lt_sys_lib_search_path_spec
+
+# Run-time system search path for libraries
+sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec
+
+# Fix the shell variable \$srcfile for the compiler.
+fix_srcfile_path="$_LT_AC_TAGVAR(fix_srcfile_path, $1)"
+
+# Set to yes if exported symbols are required.
+always_export_symbols=$_LT_AC_TAGVAR(always_export_symbols, $1)
+
+# The commands to list exported symbols.
+export_symbols_cmds=$lt_[]_LT_AC_TAGVAR(export_symbols_cmds, $1)
+
+# The commands to extract the exported symbol list from a shared archive.
+extract_expsyms_cmds=$lt_extract_expsyms_cmds
+
+# Symbols that should not be listed in the preloaded symbols.
+exclude_expsyms=$lt_[]_LT_AC_TAGVAR(exclude_expsyms, $1)
+
+# Symbols that must always be exported.
+include_expsyms=$lt_[]_LT_AC_TAGVAR(include_expsyms, $1)
+
+ifelse([$1],[],
+[# ### END LIBTOOL CONFIG],
+[# ### END LIBTOOL TAG CONFIG: $tagname])
+
+__EOF__
+
+ifelse([$1],[], [
+ case $host_os in
+ aix3*)
+ cat <<\EOF >> "$cfgfile"
+
+# AIX sometimes has problems with the GCC collect2 program. For some
+# reason, if we set the COLLECT_NAMES environment variable, the problems
+# vanish in a puff of smoke.
+if test "X${COLLECT_NAMES+set}" != Xset; then
+ COLLECT_NAMES=
+ export COLLECT_NAMES
+fi
+EOF
+ ;;
+ esac
+
+ # We use sed instead of cat because bash on DJGPP gets confused if
+ # if finds mixed CR/LF and LF-only lines. Since sed operates in
+ # text mode, it properly converts lines to CR/LF. This bash problem
+ # is reportedly fixed, but why not run on old versions too?
+ sed '$q' "$ltmain" >> "$cfgfile" || (rm -f "$cfgfile"; exit 1)
+
+ mv -f "$cfgfile" "$ofile" || \
+ (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile")
+ chmod +x "$ofile"
+])
+else
+ # If there is no Makefile yet, we rely on a make rule to execute
+ # `config.status --recheck' to rerun these tests and create the
+ # libtool script then.
+ ltmain_in=`echo $ltmain | sed -e 's/\.sh$/.in/'`
+ if test -f "$ltmain_in"; then
+ test -f Makefile && make "$ltmain"
+ fi
+fi
+])# AC_LIBTOOL_CONFIG
+
+
+# AC_LIBTOOL_PROG_COMPILER_NO_RTTI([TAGNAME])
+# -------------------------------------------
+AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI],
+[AC_REQUIRE([_LT_AC_SYS_COMPILER])dnl
+
+_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=
+
+if test "$GCC" = yes; then
+ _LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin'
+
+ AC_LIBTOOL_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions],
+ lt_cv_prog_compiler_rtti_exceptions,
+ [-fno-rtti -fno-exceptions], [],
+ [_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"])
+fi
+])# AC_LIBTOOL_PROG_COMPILER_NO_RTTI
+
+
+# AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE
+# ---------------------------------
+AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE],
+[AC_REQUIRE([AC_CANONICAL_HOST])
+AC_REQUIRE([AC_PROG_NM])
+AC_REQUIRE([AC_OBJEXT])
+# Check for command to grab the raw symbol name followed by C symbol from nm.
+AC_MSG_CHECKING([command to parse $NM output from $compiler object])
+AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe],
+[
+# These are sane defaults that work on at least a few old systems.
+# [They come from Ultrix. What could be older than Ultrix?!! ;)]
+
+# Character class describing NM global symbol codes.
+symcode='[[BCDEGRST]]'
+
+# Regexp to match symbols that can be accessed directly from C.
+sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)'
+
+# Transform the above into a raw symbol and a C symbol.
+symxfrm='\1 \2\3 \3'
+
+# Transform an extracted symbol line into a proper C declaration
+lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^. .* \(.*\)$/extern int \1;/p'"
+
+# Transform an extracted symbol line into symbol name and symbol address
+lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (lt_ptr) 0},/p' -e 's/^$symcode \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (lt_ptr) \&\2},/p'"
+
+# Define system-specific variables.
+case $host_os in
+aix*)
+ symcode='[[BCDT]]'
+ ;;
+cygwin* | mingw* | pw32*)
+ symcode='[[ABCDGISTW]]'
+ ;;
+hpux*) # Its linker distinguishes data from code symbols
+ if test "$host_cpu" = ia64; then
+ symcode='[[ABCDEGRST]]'
+ fi
+ lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'"
+ lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\) $/ {\\\"\1\\\", (lt_ptr) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (lt_ptr) \&\2},/p'"
+ ;;
+irix* | nonstopux*)
+ symcode='[[BCDEGRST]]'
+ ;;
+osf*)
+ symcode='[[BCDEGQRST]]'
+ ;;
+solaris* | sysv5*)
+ symcode='[[BDRT]]'
+ ;;
+sysv4)
+ symcode='[[DFNSTU]]'
+ ;;
+esac
+
+# Handle CRLF in mingw tool chain
+opt_cr=
+case $build_os in
+mingw*)
+ opt_cr=`echo 'x\{0,1\}' | tr x '\015'` # option cr in regexp
+ ;;
+esac
+
+# If we're using GNU nm, then use its standard symbol codes.
+case `$NM -V 2>&1` in
+*GNU* | *'with BFD'*)
+ symcode='[[ABCDGIRSTW]]' ;;
+esac
+
+# Try without a prefix undercore, then with it.
+for ac_symprfx in "" "_"; do
+
+ # Write the raw and C identifiers.
+ lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[ ]]\($symcode$symcode*\)[[ ]][[ ]]*\($ac_symprfx\)$sympat$opt_cr$/$symxfrm/p'"
+
+ # Check to see that the pipe works correctly.
+ pipe_works=no
+
+ rm -f conftest*
+ cat > conftest.$ac_ext <<EOF
+#ifdef __cplusplus
+extern "C" {
+#endif
+char nm_test_var;
+void nm_test_func(){}
+#ifdef __cplusplus
+}
+#endif
+int main(){nm_test_var='a';nm_test_func();return(0);}
+EOF
+
+ if AC_TRY_EVAL(ac_compile); then
+ # Now try to grab the symbols.
+ nlist=conftest.nm
+ if AC_TRY_EVAL(NM conftest.$ac_objext \| $lt_cv_sys_global_symbol_pipe \> $nlist) && test -s "$nlist"; then
+ # Try sorting and uniquifying the output.
+ if sort "$nlist" | uniq > "$nlist"T; then
+ mv -f "$nlist"T "$nlist"
+ else
+ rm -f "$nlist"T
+ fi
+
+ # Make sure that we snagged all the symbols we need.
+ if grep ' nm_test_var$' "$nlist" >/dev/null; then
+ if grep ' nm_test_func$' "$nlist" >/dev/null; then
+ cat <<EOF > conftest.$ac_ext
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+EOF
+ # Now generate the symbol file.
+ eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | grep -v main >> conftest.$ac_ext'
+
+ cat <<EOF >> conftest.$ac_ext
+#if defined (__STDC__) && __STDC__
+# define lt_ptr_t void *
+#else
+# define lt_ptr_t char *
+# define const
+#endif
+
+/* The mapping between symbol names and symbols. */
+const struct {
+ const char *name;
+ lt_ptr_t address;
+}
+lt_preloaded_symbols[[]] =
+{
+EOF
+ $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (lt_ptr_t) \&\2},/" < "$nlist" | grep -v main >> conftest.$ac_ext
+ cat <<\EOF >> conftest.$ac_ext
+ {0, (lt_ptr_t) 0}
+};
+
+#ifdef __cplusplus
+}
+#endif
+EOF
+ # Now try linking the two files.
+ mv conftest.$ac_objext conftstm.$ac_objext
+ lt_save_LIBS="$LIBS"
+ lt_save_CFLAGS="$CFLAGS"
+ LIBS="conftstm.$ac_objext"
+ CFLAGS="$CFLAGS$_LT_AC_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)"
+ if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext}; then
+ pipe_works=yes
+ fi
+ LIBS="$lt_save_LIBS"
+ CFLAGS="$lt_save_CFLAGS"
+ else
+ echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD
+ fi
+ else
+ echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD
+ fi
+ else
+ echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD
+ fi
+ else
+ echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD
+ cat conftest.$ac_ext >&5
+ fi
+ rm -f conftest* conftst*
+
+ # Do not use the global_symbol_pipe unless it works.
+ if test "$pipe_works" = yes; then
+ break
+ else
+ lt_cv_sys_global_symbol_pipe=
+ fi
+done
+])
+if test -z "$lt_cv_sys_global_symbol_pipe"; then
+ lt_cv_sys_global_symbol_to_cdecl=
+fi
+if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then
+ AC_MSG_RESULT(failed)
+else
+ AC_MSG_RESULT(ok)
+fi
+]) # AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE
+
+
+# AC_LIBTOOL_PROG_COMPILER_PIC([TAGNAME])
+# ---------------------------------------
+AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC],
+[_LT_AC_TAGVAR(lt_prog_compiler_wl, $1)=
+_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=
+_LT_AC_TAGVAR(lt_prog_compiler_static, $1)=
+
+AC_MSG_CHECKING([for $compiler option to produce PIC])
+ ifelse([$1],[CXX],[
+ # C++ specific cases for pic, static, wl, etc.
+ if test "$GXX" = yes; then
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-static'
+
+ case $host_os in
+ aix*)
+ # All AIX code is PIC.
+ if test "$host_cpu" = ia64; then
+ # AIX 5 now supports IA64 processor
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ fi
+ ;;
+ amigaos*)
+ # FIXME: we need at least 68020 code to build shared libraries, but
+ # adding the `-m68020' flag to GCC prevents building anything better,
+ # like `-m68040'.
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'
+ ;;
+ beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)
+ # PIC is the default for these OSes.
+ ;;
+ mingw* | os2* | pw32*)
+ # This hack is so that the source file can tell whether it is being
+ # built for inclusion in a dll (and should export symbols for example).
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'
+ ;;
+ darwin* | rhapsody*)
+ # PIC is the default on this platform
+ # Common symbols not allowed in MH_DYLIB files
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'
+ ;;
+ *djgpp*)
+ # DJGPP does not support shared libraries at all
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=
+ ;;
+ sysv4*MP*)
+ if test -d /usr/nec; then
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic
+ fi
+ ;;
+ hpux*)
+ # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but
+ # not for PA HP-UX.
+ case "$host_cpu" in
+ hppa*64*|ia64*)
+ ;;
+ *)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+ ;;
+ esac
+ ;;
+ *)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+ ;;
+ esac
+ else
+ case $host_os in
+ aix4* | aix5*)
+ # All AIX code is PIC.
+ if test "$host_cpu" = ia64; then
+ # AIX 5 now supports IA64 processor
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ else
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'
+ fi
+ ;;
+ chorus*)
+ case $cc_basename in
+ cxch68)
+ # Green Hills C++ Compiler
+ # _LT_AC_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a"
+ ;;
+ esac
+ ;;
+ dgux*)
+ case $cc_basename in
+ ec++)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+ ;;
+ ghcx)
+ # Green Hills C++ Compiler
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ freebsd* | kfreebsd*-gnu)
+ # FreeBSD uses GNU C++
+ ;;
+ hpux9* | hpux10* | hpux11*)
+ case $cc_basename in
+ CC)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)="${ac_cv_prog_cc_wl}-a ${ac_cv_prog_cc_wl}archive"
+ if test "$host_cpu" != ia64; then
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='+Z'
+ fi
+ ;;
+ aCC)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)="${ac_cv_prog_cc_wl}-a ${ac_cv_prog_cc_wl}archive"
+ case "$host_cpu" in
+ hppa*64*|ia64*)
+ # +Z the default
+ ;;
+ *)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='+Z'
+ ;;
+ esac
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ irix5* | irix6* | nonstopux*)
+ case $cc_basename in
+ CC)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+ # CC pic flag -KPIC is the default.
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ linux*)
+ case $cc_basename in
+ KCC)
+ # KAI C++ Compiler
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+ ;;
+ icpc)
+ # Intel C++
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-static'
+ ;;
+ cxx)
+ # Compaq C++
+ # Make sure the PIC flag is empty. It appears that all Alpha
+ # Linux and Compaq Tru64 Unix objects are PIC.
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ lynxos*)
+ ;;
+ m88k*)
+ ;;
+ mvs*)
+ case $cc_basename in
+ cxx)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall'
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ netbsd*)
+ ;;
+ osf3* | osf4* | osf5*)
+ case $cc_basename in
+ KCC)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'
+ ;;
+ RCC)
+ # Rational C++ 2.4.1
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+ ;;
+ cxx)
+ # Digital/Compaq C++
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ # Make sure the PIC flag is empty. It appears that all Alpha
+ # Linux and Compaq Tru64 Unix objects are PIC.
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ psos*)
+ ;;
+ sco*)
+ case $cc_basename in
+ CC)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ solaris*)
+ case $cc_basename in
+ CC)
+ # Sun C++ 4.2, 5.x and Centerline C++
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '
+ ;;
+ gcx)
+ # Green Hills C++ Compiler
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ sunos4*)
+ case $cc_basename in
+ CC)
+ # Sun C++ 4.x
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ ;;
+ lcc)
+ # Lucid
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ tandem*)
+ case $cc_basename in
+ NCC)
+ # NonStop-UX NCC 3.20
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+ ;;
+ *)
+ ;;
+ esac
+ ;;
+ unixware*)
+ ;;
+ vxworks*)
+ ;;
+ *)
+ _LT_AC_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no
+ ;;
+ esac
+ fi
+],
+[
+ if test "$GCC" = yes; then
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-static'
+
+ case $host_os in
+ aix*)
+ # All AIX code is PIC.
+ if test "$host_cpu" = ia64; then
+ # AIX 5 now supports IA64 processor
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ fi
+ ;;
+
+ amigaos*)
+ # FIXME: we need at least 68020 code to build shared libraries, but
+ # adding the `-m68020' flag to GCC prevents building anything better,
+ # like `-m68040'.
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'
+ ;;
+
+ beos* | cygwin* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)
+ # PIC is the default for these OSes.
+ ;;
+
+ mingw* | pw32* | os2*)
+ # This hack is so that the source file can tell whether it is being
+ # built for inclusion in a dll (and should export symbols for example).
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'
+ ;;
+
+ darwin* | rhapsody*)
+ # PIC is the default on this platform
+ # Common symbols not allowed in MH_DYLIB files
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'
+ ;;
+
+ msdosdjgpp*)
+ # Just because we use GCC doesn't mean we suddenly get shared libraries
+ # on systems that don't support them.
+ _LT_AC_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no
+ enable_shared=no
+ ;;
+
+ sysv4*MP*)
+ if test -d /usr/nec; then
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic
+ fi
+ ;;
+
+ hpux*)
+ # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but
+ # not for PA HP-UX.
+ case "$host_cpu" in
+ hppa*64*|ia64*)
+ # +Z the default
+ ;;
+ *)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+ ;;
+ esac
+ ;;
+
+ *)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+ ;;
+ esac
+ else
+ # PORTME Check for flag to pass linker flags through the system compiler.
+ case $host_os in
+ aix*)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ if test "$host_cpu" = ia64; then
+ # AIX 5 now supports IA64 processor
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ else
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'
+ fi
+ ;;
+
+ mingw* | pw32* | os2*)
+ # This hack is so that the source file can tell whether it is being
+ # built for inclusion in a dll (and should export symbols for example).
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'
+ ;;
+
+ hpux9* | hpux10* | hpux11*)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but
+ # not for PA HP-UX.
+ case "$host_cpu" in
+ hppa*64*|ia64*)
+ # +Z the default
+ ;;
+ *)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='+Z'
+ ;;
+ esac
+ # Is there a better lt_prog_compiler_static that works with the bundled CC?
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive'
+ ;;
+
+ irix5* | irix6* | nonstopux*)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ # PIC (with -KPIC) is the default.
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+ ;;
+
+ newsos6)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ ;;
+
+ linux*)
+ case $CC in
+ icc* | ecc*)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-static'
+ ;;
+ ccc*)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ # All Alpha code is PIC.
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+ ;;
+ esac
+ ;;
+
+ osf3* | osf4* | osf5*)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ # All OSF/1 code is PIC.
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+ ;;
+
+ sco3.2v5*)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-Kpic'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-dn'
+ ;;
+
+ solaris*)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ ;;
+
+ sunos4*)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ ;;
+
+ sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)
+ _LT_AC_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ ;;
+
+ sysv4*MP*)
+ if test -d /usr/nec ;then
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ fi
+ ;;
+
+ uts4*)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+ _LT_AC_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+ ;;
+
+ *)
+ _LT_AC_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no
+ ;;
+ esac
+ fi
+])
+AC_MSG_RESULT([$_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)])
+
+#
+# Check to make sure the PIC flag actually works.
+#
+if test -n "$_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)"; then
+ AC_LIBTOOL_COMPILER_OPTION([if $compiler PIC flag $_LT_AC_TAGVAR(lt_prog_compiler_pic, $1) works],
+ _LT_AC_TAGVAR(lt_prog_compiler_pic_works, $1),
+ [$_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)ifelse([$1],[],[ -DPIC],[ifelse([$1],[CXX],[ -DPIC],[])])], [],
+ [case $_LT_AC_TAGVAR(lt_prog_compiler_pic, $1) in
+ "" | " "*) ;;
+ *) _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)" ;;
+ esac],
+ [_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=
+ _LT_AC_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no])
+fi
+case "$host_os" in
+ # For platforms which do not support PIC, -DPIC is meaningless:
+ *djgpp*)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)=
+ ;;
+ *)
+ _LT_AC_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_AC_TAGVAR(lt_prog_compiler_pic, $1)ifelse([$1],[],[ -DPIC],[ifelse([$1],[CXX],[ -DPIC],[])])"
+ ;;
+esac
+])
+
+
+# AC_LIBTOOL_PROG_LD_SHLIBS([TAGNAME])
+# ------------------------------------
+# See if the linker supports building shared libraries.
+AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS],
+[AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])
+ifelse([$1],[CXX],[
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'
+ case $host_os in
+ aix4* | aix5*)
+ # If we're using GNU nm, then we don't want the "-C" option.
+ # -C means demangle to AIX nm, but means don't demangle with GNU nm
+ if $NM -V 2>&1 | grep 'GNU' > /dev/null; then
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\[$]2 == "T") || (\[$]2 == "D") || (\[$]2 == "B")) && ([substr](\[$]3,1,1) != ".")) { print \[$]3 } }'\'' | sort -u > $export_symbols'
+ else
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\[$]2 == "T") || (\[$]2 == "D") || (\[$]2 == "B")) && ([substr](\[$]3,1,1) != ".")) { print \[$]3 } }'\'' | sort -u > $export_symbols'
+ fi
+ ;;
+ pw32*)
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)="$ltdll_cmds"
+ ;;
+ cygwin* | mingw*)
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGS]] /s/.* \([[^ ]]*\)/\1 DATA/'\'' | $SED -e '\''/^[[AITW]] /s/.* //'\'' | sort | uniq > $export_symbols'
+ ;;
+ *)
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'
+ ;;
+ esac
+],[
+ runpath_var=
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=
+ _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=no
+ _LT_AC_TAGVAR(archive_cmds, $1)=
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)=
+ _LT_AC_TAGVAR(old_archive_From_new_cmds, $1)=
+ _LT_AC_TAGVAR(old_archive_from_expsyms_cmds, $1)=
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)=
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=
+ _LT_AC_TAGVAR(thread_safe_flag_spec, $1)=
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)=
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=no
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=unsupported
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=unknown
+ _LT_AC_TAGVAR(hardcode_automatic, $1)=no
+ _LT_AC_TAGVAR(module_cmds, $1)=
+ _LT_AC_TAGVAR(module_expsym_cmds, $1)=
+ _LT_AC_TAGVAR(always_export_symbols, $1)=no
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'
+ # include_expsyms should be a list of space-separated symbols to be *always*
+ # included in the symbol list
+ _LT_AC_TAGVAR(include_expsyms, $1)=
+ # exclude_expsyms can be an extended regexp of symbols to exclude
+ # it will be wrapped by ` (' and `)$', so one must not match beginning or
+ # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc',
+ # as well as any symbol that contains `d'.
+ _LT_AC_TAGVAR(exclude_expsyms, $1)="_GLOBAL_OFFSET_TABLE_"
+ # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out
+ # platforms (ab)use it in PIC code, but their linkers get confused if
+ # the symbol is explicitly referenced. Since portable code cannot
+ # rely on this symbol name, it's probably fine to never include it in
+ # preloaded symbol tables.
+ extract_expsyms_cmds=
+
+ case $host_os in
+ cygwin* | mingw* | pw32*)
+ # FIXME: the MSVC++ port hasn't been tested in a loooong time
+ # When not using gcc, we currently assume that we are using
+ # Microsoft Visual C++.
+ if test "$GCC" != yes; then
+ with_gnu_ld=no
+ fi
+ ;;
+ openbsd*)
+ with_gnu_ld=no
+ ;;
+ esac
+
+ _LT_AC_TAGVAR(ld_shlibs, $1)=yes
+ if test "$with_gnu_ld" = yes; then
+ # If archive_cmds runs LD, not CC, wlarc should be empty
+ wlarc='${wl}'
+
+ # See if GNU ld supports shared libraries.
+ case $host_os in
+ aix3* | aix4* | aix5*)
+ # On AIX/PPC, the GNU linker is very broken
+ if test "$host_cpu" != ia64; then
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ cat <<EOF 1>&2
+
+*** Warning: the GNU linker, at least up to release 2.9.1, is reported
+*** to be unable to reliably create shared libraries on AIX.
+*** Therefore, libtool is disabling shared libraries support. If you
+*** really care for shared libraries, you may want to modify your PATH
+*** so that a non-GNU linker is found, and then restart.
+
+EOF
+ fi
+ ;;
+
+ amigaos*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+
+ # Samuel A. Falvo II <kc5tja@dolphin.openprojects.net> reports
+ # that the semantics of dynamic libraries on AmigaOS, at least up
+ # to version 4, is to share data among multiple programs linked
+ # with the same dynamic library. Since this doesn't match the
+ # behavior of shared libraries on other platforms, we can't use
+ # them.
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+
+ beos*)
+ if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported
+ # Joseph Beckenbach <jrb3@best.com> says some releases of gcc
+ # support --undefined. This deserves some investigation. FIXME
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+ else
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+
+ cygwin* | mingw* | pw32*)
+ # _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,
+ # as there is no search path for DLLs.
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported
+ _LT_AC_TAGVAR(always_export_symbols, $1)=no
+ _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=yes
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGS]] /s/.* \([[^ ]]*\)/\1 DATA/'\'' | $SED -e '\''/^[[AITW]] /s/.* //'\'' | sort | uniq > $export_symbols'
+
+ if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib'
+ # If the export-symbols file already is a .def file (1st line
+ # is EXPORTS), use it as is; otherwise, prepend...
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+ cp $export_symbols $output_objdir/$soname.def;
+ else
+ echo EXPORTS > $output_objdir/$soname.def;
+ cat $export_symbols >> $output_objdir/$soname.def;
+ fi~
+ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--image-base=0x10000000 ${wl}--out-implib,$lib'
+ else
+ ld_shlibs=no
+ fi
+ ;;
+
+ netbsd*)
+ if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib'
+ wlarc=
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+ fi
+ ;;
+
+ solaris* | sysv5*)
+ if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ cat <<EOF 1>&2
+
+*** Warning: The releases 2.8.* of the GNU linker cannot reliably
+*** create shared libraries on Solaris systems. Therefore, libtool
+*** is disabling shared libraries support. We urge you to upgrade GNU
+*** binutils to release 2.9.1 or newer. Another option is to modify
+*** your PATH or compiler configuration so that the native linker is
+*** used, and then restart.
+
+EOF
+ elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+ else
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+
+ sunos4*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags'
+ wlarc=
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ linux*)
+ if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then
+ tmp_archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+ _LT_AC_TAGVAR(archive_cmds, $1)="$tmp_archive_cmds"
+ supports_anon_versioning=no
+ case `$LD -v 2>/dev/null` in
+ *\ [01].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11
+ *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ...
+ *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ...
+ *\ 2.11.*) ;; # other 2.11 versions
+ *) supports_anon_versioning=yes ;;
+ esac
+ if test $supports_anon_versioning = yes; then
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $output_objdir/$libname.ver~
+cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~
+$echo "local: *; };" >> $output_objdir/$libname.ver~
+ $CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'
+ else
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)="$tmp_archive_cmds"
+ fi
+ else
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+
+ *)
+ if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+ else
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+ esac
+
+ if test "$_LT_AC_TAGVAR(ld_shlibs, $1)" = yes; then
+ runpath_var=LD_RUN_PATH
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir'
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+ # ancient GNU ld didn't support --whole-archive et. al.
+ if $LD --help 2>&1 | grep 'no-whole-archive' > /dev/null; then
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'
+ else
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=
+ fi
+ fi
+ else
+ # PORTME fill in a description of your system's linker (not GNU ld)
+ case $host_os in
+ aix3*)
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported
+ _LT_AC_TAGVAR(always_export_symbols, $1)=yes
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname'
+ # Note: this linker hardcodes the directories in LIBPATH if there
+ # are no directories specified by -L.
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ if test "$GCC" = yes && test -z "$link_static_flag"; then
+ # Neither direct hardcoding nor static linking is supported with a
+ # broken collect2.
+ _LT_AC_TAGVAR(hardcode_direct, $1)=unsupported
+ fi
+ ;;
+
+ aix4* | aix5*)
+ if test "$host_cpu" = ia64; then
+ # On IA64, the linker does run time linking by default, so we don't
+ # have to do anything special.
+ aix_use_runtimelinking=no
+ exp_sym_flag='-Bexport'
+ no_entry_flag=""
+ else
+ # If we're using GNU nm, then we don't want the "-C" option.
+ # -C means demangle to AIX nm, but means don't demangle with GNU nm
+ if $NM -V 2>&1 | grep 'GNU' > /dev/null; then
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\[$]2 == "T") || (\[$]2 == "D") || (\[$]2 == "B")) && ([substr](\[$]3,1,1) != ".")) { print \[$]3 } }'\'' | sort -u > $export_symbols'
+ else
+ _LT_AC_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\[$]2 == "T") || (\[$]2 == "D") || (\[$]2 == "B")) && ([substr](\[$]3,1,1) != ".")) { print \[$]3 } }'\'' | sort -u > $export_symbols'
+ fi
+ aix_use_runtimelinking=no
+
+ # Test if we are trying to use run time linking or normal
+ # AIX style linking. If -brtl is somewhere in LDFLAGS, we
+ # need to do runtime linking.
+ case $host_os in aix4.[[23]]|aix4.[[23]].*|aix5*)
+ for ld_flag in $LDFLAGS; do
+ if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then
+ aix_use_runtimelinking=yes
+ break
+ fi
+ done
+ esac
+
+ exp_sym_flag='-bexport'
+ no_entry_flag='-bnoentry'
+ fi
+
+ # When large executables or shared objects are built, AIX ld can
+ # have problems creating the table of contents. If linking a library
+ # or program results in "error TOC overflow" add -mminimal-toc to
+ # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not
+ # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.
+
+ _LT_AC_TAGVAR(archive_cmds, $1)=''
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=':'
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=yes
+
+ if test "$GCC" = yes; then
+ case $host_os in aix4.[012]|aix4.[012].*)
+ # We only want to do this on AIX 4.2 and lower, the check
+ # below for broken collect2 doesn't work under 4.3+
+ collect2name=`${CC} -print-prog-name=collect2`
+ if test -f "$collect2name" && \
+ strings "$collect2name" | grep resolve_lib_name >/dev/null
+ then
+ # We have reworked collect2
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ else
+ # We have old collect2
+ _LT_AC_TAGVAR(hardcode_direct, $1)=unsupported
+ # It fails to find uninstalled libraries when the uninstalled
+ # path is not listed in the libpath. Setting hardcode_minus_L
+ # to unsupported forces relinking
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=
+ fi
+ esac
+ shared_flag='-shared'
+ else
+ # not using gcc
+ if test "$host_cpu" = ia64; then
+ # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release
+ # chokes on -Wl,-G. The following line is correct:
+ shared_flag='-G'
+ else
+ if test "$aix_use_runtimelinking" = yes; then
+ shared_flag='${wl}-G'
+ else
+ shared_flag='${wl}-bM:SRE'
+ fi
+ fi
+ fi
+
+ # It seems that -bexpall does not export symbols beginning with
+ # underscore (_), so it is better to generate a list of symbols to export.
+ _LT_AC_TAGVAR(always_export_symbols, $1)=yes
+ if test "$aix_use_runtimelinking" = yes; then
+ # Warning - without using the other runtime loading flags (-brtl),
+ # -berok will link without error, but may produce a broken library.
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-berok'
+ # Determine the default libpath from the value encoded in an empty executable.
+ _LT_AC_SYS_LIBPATH_AIX
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then echo "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols $shared_flag"
+ else
+ if test "$host_cpu" = ia64; then
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib'
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)="-z nodefs"
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$no_entry_flag \${wl}$exp_sym_flag:\$export_symbols"
+ else
+ # Determine the default libpath from the value encoded in an empty executable.
+ _LT_AC_SYS_LIBPATH_AIX
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"
+ # Warning - without using the other run time loading flags,
+ # -berok will link without error, but may produce a broken library.
+ _LT_AC_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok'
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok'
+ # -bexpall does not export symbols beginning with underscore (_)
+ _LT_AC_TAGVAR(always_export_symbols, $1)=yes
+ # Exported symbols can be pulled into shared objects from archives
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)=' '
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=yes
+ # This is similar to how AIX traditionally builds it's shared libraries.
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs $compiler_flags ${wl}-bE:$export_symbols ${wl}-bnoentry${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'
+ fi
+ fi
+ ;;
+
+ amigaos*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/a2ixlibrary.data~$echo "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$echo "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$echo "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$echo "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ # see comment about different semantics on the GNU ld section
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+
+ bsdi4*)
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic
+ ;;
+
+ cygwin* | mingw* | pw32*)
+ # When not using gcc, we currently assume that we are using
+ # Microsoft Visual C++.
+ # hardcode_libdir_flag_spec is actually meaningless, as there is
+ # no search path for DLLs.
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=' '
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported
+ # Tell ltmain to make .lib files, not .a files.
+ libext=lib
+ # Tell ltmain to make .dll files, not .so files.
+ shrext_cmds=".dll"
+ # FIXME: Setting linknames here is a bad hack.
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `echo "$deplibs" | $SED -e '\''s/ -lc$//'\''` -link -dll~linknames='
+ # The linker will automatically build a .lib file if we build a DLL.
+ _LT_AC_TAGVAR(old_archive_From_new_cmds, $1)='true'
+ # FIXME: Should let the user specify the lib program.
+ _LT_AC_TAGVAR(old_archive_cmds, $1)='lib /OUT:$oldlib$oldobjs$old_deplibs'
+ fix_srcfile_path='`cygpath -w "$srcfile"`'
+ _LT_AC_TAGVAR(enable_shared_with_static_runtimes, $1)=yes
+ ;;
+
+ darwin* | rhapsody*)
+ if test "$GXX" = yes ; then
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+ case "$host_os" in
+ rhapsody* | darwin1.[[012]])
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined suppress'
+ ;;
+ *) # Darwin 1.3 on
+ if test -z ${MACOSX_DEPLOYMENT_TARGET} ; then
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'
+ else
+ case ${MACOSX_DEPLOYMENT_TARGET} in
+ 10.[[012]])
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-flat_namespace -undefined suppress'
+ ;;
+ 10.*)
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)='-undefined dynamic_lookup'
+ ;;
+ esac
+ fi
+ ;;
+ esac
+ lt_int_apple_cc_single_mod=no
+ output_verbose_link_cmd='echo'
+ if $CC -dumpspecs 2>&1 | grep 'single_module' >/dev/null ; then
+ lt_int_apple_cc_single_mod=yes
+ fi
+ if test "X$lt_int_apple_cc_single_mod" = Xyes ; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring'
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -r ${wl}-bind_at_load -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring'
+ fi
+ _LT_AC_TAGVAR(module_cmds, $1)='$CC ${wl}-bind_at_load $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags'
+ # Don't fix this by using the ld -exported_symbols_list flag, it doesn't exist in older darwin ld's
+ if test "X$lt_int_apple_cc_single_mod" = Xyes ; then
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -dynamiclib -single_module $allow_undefined_flag -o $lib $libobjs $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'
+ else
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC -r ${wl}-bind_at_load -keep_private_externs -nostdlib -o ${lib}-master.o $libobjs~$CC -dynamiclib $allow_undefined_flag -o $lib ${lib}-master.o $deplibs $compiler_flags -install_name $rpath/$soname $verstring~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'
+ fi
+ _LT_AC_TAGVAR(module_expsym_cmds, $1)='sed -e "s,#.*,," -e "s,^[ ]*,," -e "s,^\(..*\),_&," < $export_symbols > $output_objdir/${libname}-symbols.expsym~$CC $allow_undefined_flag -o $lib -bundle $libobjs $deplibs$compiler_flags~nmedit -s $output_objdir/${libname}-symbols.expsym ${lib}'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no
+ _LT_AC_TAGVAR(hardcode_automatic, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=unsupported
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='-all_load $convenience'
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=yes
+ else
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ fi
+ ;;
+
+ dgux*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ freebsd1*)
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+
+ # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor
+ # support. Future versions do this automatically, but an explicit c++rt0.o
+ # does not break anything, and helps significantly (at the cost of a little
+ # extra space).
+ freebsd2.2*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ # Unfortunately, older versions of FreeBSD 2 do not have this feature.
+ freebsd2*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ # FreeBSD 3 and greater uses gcc -shared to do shared libraries.
+ freebsd* | kfreebsd*-gnu)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -o $lib $libobjs $deplibs $compiler_flags'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ hpux9*)
+ if test "$GCC" = yes; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/$soname~$CC -shared -fPIC ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$rm $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+ fi
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+
+ # hardcode_minus_L: Not really in the search PATH,
+ # but as the default location of the library.
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+ ;;
+
+ hpux10* | hpux11*)
+ if test "$GCC" = yes -a "$with_gnu_ld" = no; then
+ case "$host_cpu" in
+ hppa*64*|ia64*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+ ;;
+ *)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'
+ ;;
+ esac
+ else
+ case "$host_cpu" in
+ hppa*64*|ia64*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -b +h $soname -o $lib $libobjs $deplibs $linker_flags'
+ ;;
+ *)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'
+ ;;
+ esac
+ fi
+ if test "$with_gnu_ld" = no; then
+ case "$host_cpu" in
+ hppa*64*)
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='+b $libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+ ia64*)
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+
+ # hardcode_minus_L: Not really in the search PATH,
+ # but as the default location of the library.
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ ;;
+ *)
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+
+ # hardcode_minus_L: Not really in the search PATH,
+ # but as the default location of the library.
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ ;;
+ esac
+ fi
+ ;;
+
+ irix5* | irix6* | nonstopux*)
+ if test "$GCC" = yes; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec_ld, $1)='-rpath $libdir'
+ fi
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=yes
+ ;;
+
+ netbsd*)
+ if echo __ELF__ | $CC -E - | grep __ELF__ >/dev/null; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF
+ fi
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ newsos6)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ openbsd*)
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+ else
+ case $host_os in
+ openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+ ;;
+ *)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+ ;;
+ esac
+ fi
+ ;;
+
+ os2*)
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=unsupported
+ _LT_AC_TAGVAR(archive_cmds, $1)='$echo "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$echo "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~$echo DATA >> $output_objdir/$libname.def~$echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~$echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def'
+ _LT_AC_TAGVAR(old_archive_From_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def'
+ ;;
+
+ osf3*)
+ if test "$GCC" = yes; then
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+ else
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib'
+ fi
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ ;;
+
+ osf4* | osf5*) # as osf3* with the addition of -msym flag
+ if test "$GCC" = yes; then
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && echo ${wl}-set_version ${wl}$verstring` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+ else
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*'
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -shared${allow_undefined_flag} $libobjs $deplibs $linker_flags -msym -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${output_objdir}/so_locations -o $lib'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; echo "-hidden">> $lib.exp~
+ $LD -shared${allow_undefined_flag} -input $lib.exp $linker_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && echo -set_version $verstring` -update_registry ${objdir}/so_locations -o $lib~$rm $lib.exp'
+
+ # Both c and cxx compiler support -rpath directly
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'
+ fi
+ _LT_AC_TAGVAR(hardcode_libdir_separator, $1)=:
+ ;;
+
+ sco3.2v5*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport'
+ runpath_var=LD_RUN_PATH
+ hardcode_runpath_var=yes
+ ;;
+
+ solaris*)
+ _LT_AC_TAGVAR(no_undefined_flag, $1)=' -z text'
+ if test "$GCC" = yes; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~
+ $CC -shared ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$rm $lib.exp'
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~
+ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$rm $lib.exp'
+ fi
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ case $host_os in
+ solaris2.[[0-5]] | solaris2.[[0-5]].*) ;;
+ *) # Supported since Solaris 2.6 (maybe 2.5.1?)
+ _LT_AC_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' ;;
+ esac
+ _LT_AC_TAGVAR(link_all_deplibs, $1)=yes
+ ;;
+
+ sunos4*)
+ if test "x$host_vendor" = xsequent; then
+ # Use $CC to link under sequent, because it throws in some extra .o
+ # files that make .init and .fini sections work.
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags'
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags'
+ fi
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=yes
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ sysv4)
+ case $host_vendor in
+ sni)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes # is this really true???
+ ;;
+ siemens)
+ ## LD is ld it makes a PLAMLIB
+ ## CC just makes a GrossModule.
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no
+ ;;
+ motorola)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie
+ ;;
+ esac
+ runpath_var='LD_RUN_PATH'
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ sysv4.3*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ _LT_AC_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport'
+ ;;
+
+ sysv4*MP*)
+ if test -d /usr/nec; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ runpath_var=LD_RUN_PATH
+ hardcode_runpath_var=yes
+ _LT_AC_TAGVAR(ld_shlibs, $1)=yes
+ fi
+ ;;
+
+ sysv4.2uw2*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_direct, $1)=yes
+ _LT_AC_TAGVAR(hardcode_minus_L, $1)=no
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ hardcode_runpath_var=yes
+ runpath_var=LD_RUN_PATH
+ ;;
+
+ sysv5OpenUNIX8* | sysv5UnixWare7* | sysv5uw[[78]]* | unixware7*)
+ _LT_AC_TAGVAR(no_undefined_flag, $1)='${wl}-z ${wl}text'
+ if test "$GCC" = yes; then
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+ else
+ _LT_AC_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+ fi
+ runpath_var='LD_RUN_PATH'
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ sysv5*)
+ _LT_AC_TAGVAR(no_undefined_flag, $1)=' -z text'
+ # $CC -shared without GNU ld will not create a library from C++
+ # object files and a static libstdc++, better avoid it by now
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(archive_expsym_cmds, $1)='$echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~$echo "local: *; };" >> $lib.exp~
+ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$rm $lib.exp'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)=
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ runpath_var='LD_RUN_PATH'
+ ;;
+
+ uts4*)
+ _LT_AC_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+ _LT_AC_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+ _LT_AC_TAGVAR(hardcode_shlibpath_var, $1)=no
+ ;;
+
+ *)
+ _LT_AC_TAGVAR(ld_shlibs, $1)=no
+ ;;
+ esac
+ fi
+])
+AC_MSG_RESULT([$_LT_AC_TAGVAR(ld_shlibs, $1)])
+test "$_LT_AC_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no
+
+variables_saved_for_relink="PATH $shlibpath_var $runpath_var"
+if test "$GCC" = yes; then
+ variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH"
+fi
+
+#
+# Do we need to explicitly link libc?
+#
+case "x$_LT_AC_TAGVAR(archive_cmds_need_lc, $1)" in
+x|xyes)
+ # Assume -lc should be added
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=yes
+
+ if test "$enable_shared" = yes && test "$GCC" = yes; then
+ case $_LT_AC_TAGVAR(archive_cmds, $1) in
+ *'~'*)
+ # FIXME: we may have to deal with multi-command sequences.
+ ;;
+ '$CC '*)
+ # Test whether the compiler implicitly links with -lc since on some
+ # systems, -lgcc has to come before -lc. If gcc already passes -lc
+ # to ld, don't add -lc before -lgcc.
+ AC_MSG_CHECKING([whether -lc should be explicitly linked in])
+ $rm conftest*
+ printf "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+ if AC_TRY_EVAL(ac_compile) 2>conftest.err; then
+ soname=conftest
+ lib=conftest
+ libobjs=conftest.$ac_objext
+ deplibs=
+ wl=$_LT_AC_TAGVAR(lt_prog_compiler_wl, $1)
+ compiler_flags=-v
+ linker_flags=-v
+ verstring=
+ output_objdir=.
+ libname=conftest
+ lt_save_allow_undefined_flag=$_LT_AC_TAGVAR(allow_undefined_flag, $1)
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=
+ if AC_TRY_EVAL(_LT_AC_TAGVAR(archive_cmds, $1) 2\>\&1 \| grep \" -lc \" \>/dev/null 2\>\&1)
+ then
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=no
+ else
+ _LT_AC_TAGVAR(archive_cmds_need_lc, $1)=yes
+ fi
+ _LT_AC_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag
+ else
+ cat conftest.err 1>&5
+ fi
+ $rm conftest*
+ AC_MSG_RESULT([$_LT_AC_TAGVAR(archive_cmds_need_lc, $1)])
+ ;;
+ esac
+ fi
+ ;;
+esac
+])# AC_LIBTOOL_PROG_LD_SHLIBS
+
+
+# _LT_AC_FILE_LTDLL_C
+# -------------------
+# Be careful that the start marker always follows a newline.
+AC_DEFUN([_LT_AC_FILE_LTDLL_C], [
+# /* ltdll.c starts here */
+# #define WIN32_LEAN_AND_MEAN
+# #include <windows.h>
+# #undef WIN32_LEAN_AND_MEAN
+# #include <stdio.h>
+#
+# #ifndef __CYGWIN__
+# # ifdef __CYGWIN32__
+# # define __CYGWIN__ __CYGWIN32__
+# # endif
+# #endif
+#
+# #ifdef __cplusplus
+# extern "C" {
+# #endif
+# BOOL APIENTRY DllMain (HINSTANCE hInst, DWORD reason, LPVOID reserved);
+# #ifdef __cplusplus
+# }
+# #endif
+#
+# #ifdef __CYGWIN__
+# #include <cygwin/cygwin_dll.h>
+# DECLARE_CYGWIN_DLL( DllMain );
+# #endif
+# HINSTANCE __hDllInstance_base;
+#
+# BOOL APIENTRY
+# DllMain (HINSTANCE hInst, DWORD reason, LPVOID reserved)
+# {
+# __hDllInstance_base = hInst;
+# return TRUE;
+# }
+# /* ltdll.c ends here */
+])# _LT_AC_FILE_LTDLL_C
+
+
+# _LT_AC_TAGVAR(VARNAME, [TAGNAME])
+# ---------------------------------
+AC_DEFUN([_LT_AC_TAGVAR], [ifelse([$2], [], [$1], [$1_$2])])
+
+
+# old names
+AC_DEFUN([AM_PROG_LIBTOOL], [AC_PROG_LIBTOOL])
+AC_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)])
+AC_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)])
+AC_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)])
+AC_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)])
+AC_DEFUN([AM_PROG_LD], [AC_PROG_LD])
+AC_DEFUN([AM_PROG_NM], [AC_PROG_NM])
+
+# This is just to silence aclocal about the macro not being used
+ifelse([AC_DISABLE_FAST_INSTALL])
+
+AC_DEFUN([LT_AC_PROG_GCJ],
+[AC_CHECK_TOOL(GCJ, gcj, no)
+ test "x${GCJFLAGS+set}" = xset || GCJFLAGS="-g -O2"
+ AC_SUBST(GCJFLAGS)
+])
+
+AC_DEFUN([LT_AC_PROG_RC],
+[AC_CHECK_TOOL(RC, windres, no)
+])
+
+############################################################
+# NOTE: This macro has been submitted for inclusion into #
+# GNU Autoconf as AC_PROG_SED. When it is available in #
+# a released version of Autoconf we should remove this #
+# macro and use it instead. #
+############################################################
+# LT_AC_PROG_SED
+# --------------
+# Check for a fully-functional sed program, that truncates
+# as few characters as possible. Prefer GNU sed if found.
+AC_DEFUN([LT_AC_PROG_SED],
+[AC_MSG_CHECKING([for a sed that does not truncate output])
+AC_CACHE_VAL(lt_cv_path_SED,
+[# Loop through the user's path and test for sed and gsed.
+# Then use that list of sed's as ones to test for truncation.
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+ IFS=$as_save_IFS
+ test -z "$as_dir" && as_dir=.
+ for lt_ac_prog in sed gsed; do
+ for ac_exec_ext in '' $ac_executable_extensions; do
+ if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then
+ lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext"
+ fi
+ done
+ done
+done
+lt_ac_max=0
+lt_ac_count=0
+# Add /usr/xpg4/bin/sed as it is typically found on Solaris
+# along with /bin/sed that truncates output.
+for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do
+ test ! -f $lt_ac_sed && break
+ cat /dev/null > conftest.in
+ lt_ac_count=0
+ echo $ECHO_N "0123456789$ECHO_C" >conftest.in
+ # Check for GNU sed and select it if it is found.
+ if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then
+ lt_cv_path_SED=$lt_ac_sed
+ break
+ fi
+ while true; do
+ cat conftest.in conftest.in >conftest.tmp
+ mv conftest.tmp conftest.in
+ cp conftest.in conftest.nl
+ echo >>conftest.nl
+ $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break
+ cmp -s conftest.out conftest.nl || break
+ # 10000 chars as input seems more than enough
+ test $lt_ac_count -gt 10 && break
+ lt_ac_count=`expr $lt_ac_count + 1`
+ if test $lt_ac_count -gt $lt_ac_max; then
+ lt_ac_max=$lt_ac_count
+ lt_cv_path_SED=$lt_ac_sed
+ fi
+ done
+done
+SED=$lt_cv_path_SED
+])
+AC_MSG_RESULT([$SED])
+])
-//{{NO_DEPENDENCIES}}\r
-// Microsoft Developer Studio generated include file.\r
-// Used by saml.rc\r
-//\r
-\r
-// Next default values for new objects\r
-// \r
-#ifdef APSTUDIO_INVOKED\r
-#ifndef APSTUDIO_READONLY_SYMBOLS\r
-#define _APS_NEXT_RESOURCE_VALUE 101\r
-#define _APS_NEXT_COMMAND_VALUE 40001\r
-#define _APS_NEXT_CONTROL_VALUE 1000\r
-#define _APS_NEXT_SYMED_VALUE 101\r
-#endif\r
-#endif\r
+//{{NO_DEPENDENCIES}}
+// Microsoft Developer Studio generated include file.
+// Used by saml.rc
+//
+
+// Next default values for new objects
+//
+#ifdef APSTUDIO_INVOKED
+#ifndef APSTUDIO_READONLY_SYMBOLS
+#define _APS_NEXT_RESOURCE_VALUE 101
+#define _APS_NEXT_COMMAND_VALUE 40001
+#define _APS_NEXT_CONTROL_VALUE 1000
+#define _APS_NEXT_SYMED_VALUE 101
+#endif
+#endif
{
}
-const KeyDescriptor& MetadataCredentialContext::getKeyDescriptor() const\r
-{\r
- return m_descriptor;\r
-}\r
+const KeyDescriptor& MetadataCredentialContext::getKeyDescriptor() const
+{
+ return m_descriptor;
+}
-/* adler32.c -- compute the Adler-32 checksum of a data stream\r
- * Copyright (C) 1995-2004 Mark Adler\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/* @(#) $Id$ */\r
-\r
-#define ZLIB_INTERNAL\r
-#include "zlib.h"\r
-\r
-#define BASE 65521UL /* largest prime smaller than 65536 */\r
-#define NMAX 5552\r
-/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */\r
-\r
-#define DO1(buf,i) {adler += (buf)[i]; sum2 += adler;}\r
-#define DO2(buf,i) DO1(buf,i); DO1(buf,i+1);\r
-#define DO4(buf,i) DO2(buf,i); DO2(buf,i+2);\r
-#define DO8(buf,i) DO4(buf,i); DO4(buf,i+4);\r
-#define DO16(buf) DO8(buf,0); DO8(buf,8);\r
-\r
-/* use NO_DIVIDE if your processor does not do division in hardware */\r
-#ifdef NO_DIVIDE\r
-# define MOD(a) \\r
- do { \\r
- if (a >= (BASE << 16)) a -= (BASE << 16); \\r
- if (a >= (BASE << 15)) a -= (BASE << 15); \\r
- if (a >= (BASE << 14)) a -= (BASE << 14); \\r
- if (a >= (BASE << 13)) a -= (BASE << 13); \\r
- if (a >= (BASE << 12)) a -= (BASE << 12); \\r
- if (a >= (BASE << 11)) a -= (BASE << 11); \\r
- if (a >= (BASE << 10)) a -= (BASE << 10); \\r
- if (a >= (BASE << 9)) a -= (BASE << 9); \\r
- if (a >= (BASE << 8)) a -= (BASE << 8); \\r
- if (a >= (BASE << 7)) a -= (BASE << 7); \\r
- if (a >= (BASE << 6)) a -= (BASE << 6); \\r
- if (a >= (BASE << 5)) a -= (BASE << 5); \\r
- if (a >= (BASE << 4)) a -= (BASE << 4); \\r
- if (a >= (BASE << 3)) a -= (BASE << 3); \\r
- if (a >= (BASE << 2)) a -= (BASE << 2); \\r
- if (a >= (BASE << 1)) a -= (BASE << 1); \\r
- if (a >= BASE) a -= BASE; \\r
- } while (0)\r
-# define MOD4(a) \\r
- do { \\r
- if (a >= (BASE << 4)) a -= (BASE << 4); \\r
- if (a >= (BASE << 3)) a -= (BASE << 3); \\r
- if (a >= (BASE << 2)) a -= (BASE << 2); \\r
- if (a >= (BASE << 1)) a -= (BASE << 1); \\r
- if (a >= BASE) a -= BASE; \\r
- } while (0)\r
-#else\r
-# define MOD(a) a %= BASE\r
-# define MOD4(a) a %= BASE\r
-#endif\r
-\r
-/* ========================================================================= */\r
-uLong ZEXPORT adler32(adler, buf, len)\r
- uLong adler;\r
- const Bytef *buf;\r
- uInt len;\r
-{\r
- unsigned long sum2;\r
- unsigned n;\r
-\r
- /* split Adler-32 into component sums */\r
- sum2 = (adler >> 16) & 0xffff;\r
- adler &= 0xffff;\r
-\r
- /* in case user likes doing a byte at a time, keep it fast */\r
- if (len == 1) {\r
- adler += buf[0];\r
- if (adler >= BASE)\r
- adler -= BASE;\r
- sum2 += adler;\r
- if (sum2 >= BASE)\r
- sum2 -= BASE;\r
- return adler | (sum2 << 16);\r
- }\r
-\r
- /* initial Adler-32 value (deferred check for len == 1 speed) */\r
- if (buf == Z_NULL)\r
- return 1L;\r
-\r
- /* in case short lengths are provided, keep it somewhat fast */\r
- if (len < 16) {\r
- while (len--) {\r
- adler += *buf++;\r
- sum2 += adler;\r
- }\r
- if (adler >= BASE)\r
- adler -= BASE;\r
- MOD4(sum2); /* only added so many BASE's */\r
- return adler | (sum2 << 16);\r
- }\r
-\r
- /* do length NMAX blocks -- requires just one modulo operation */\r
- while (len >= NMAX) {\r
- len -= NMAX;\r
- n = NMAX / 16; /* NMAX is divisible by 16 */\r
- do {\r
- DO16(buf); /* 16 sums unrolled */\r
- buf += 16;\r
- } while (--n);\r
- MOD(adler);\r
- MOD(sum2);\r
- }\r
-\r
- /* do remaining bytes (less than NMAX, still just one modulo) */\r
- if (len) { /* avoid modulos if none remaining */\r
- while (len >= 16) {\r
- len -= 16;\r
- DO16(buf);\r
- buf += 16;\r
- }\r
- while (len--) {\r
- adler += *buf++;\r
- sum2 += adler;\r
- }\r
- MOD(adler);\r
- MOD(sum2);\r
- }\r
-\r
- /* return recombined sums */\r
- return adler | (sum2 << 16);\r
-}\r
-\r
-/* ========================================================================= */\r
-uLong ZEXPORT adler32_combine(adler1, adler2, len2)\r
- uLong adler1;\r
- uLong adler2;\r
- z_off_t len2;\r
-{\r
- unsigned long sum1;\r
- unsigned long sum2;\r
- unsigned rem;\r
-\r
- /* the derivation of this formula is left as an exercise for the reader */\r
- rem = (unsigned)(len2 % BASE);\r
- sum1 = adler1 & 0xffff;\r
- sum2 = rem * sum1;\r
- MOD(sum2);\r
- sum1 += (adler2 & 0xffff) + BASE - 1;\r
- sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;\r
- if (sum1 > BASE) sum1 -= BASE;\r
- if (sum1 > BASE) sum1 -= BASE;\r
- if (sum2 > (BASE << 1)) sum2 -= (BASE << 1);\r
- if (sum2 > BASE) sum2 -= BASE;\r
- return sum1 | (sum2 << 16);\r
-}\r
+/* adler32.c -- compute the Adler-32 checksum of a data stream
+ * Copyright (C) 1995-2004 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#define ZLIB_INTERNAL
+#include "zlib.h"
+
+#define BASE 65521UL /* largest prime smaller than 65536 */
+#define NMAX 5552
+/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
+
+#define DO1(buf,i) {adler += (buf)[i]; sum2 += adler;}
+#define DO2(buf,i) DO1(buf,i); DO1(buf,i+1);
+#define DO4(buf,i) DO2(buf,i); DO2(buf,i+2);
+#define DO8(buf,i) DO4(buf,i); DO4(buf,i+4);
+#define DO16(buf) DO8(buf,0); DO8(buf,8);
+
+/* use NO_DIVIDE if your processor does not do division in hardware */
+#ifdef NO_DIVIDE
+# define MOD(a) \
+ do { \
+ if (a >= (BASE << 16)) a -= (BASE << 16); \
+ if (a >= (BASE << 15)) a -= (BASE << 15); \
+ if (a >= (BASE << 14)) a -= (BASE << 14); \
+ if (a >= (BASE << 13)) a -= (BASE << 13); \
+ if (a >= (BASE << 12)) a -= (BASE << 12); \
+ if (a >= (BASE << 11)) a -= (BASE << 11); \
+ if (a >= (BASE << 10)) a -= (BASE << 10); \
+ if (a >= (BASE << 9)) a -= (BASE << 9); \
+ if (a >= (BASE << 8)) a -= (BASE << 8); \
+ if (a >= (BASE << 7)) a -= (BASE << 7); \
+ if (a >= (BASE << 6)) a -= (BASE << 6); \
+ if (a >= (BASE << 5)) a -= (BASE << 5); \
+ if (a >= (BASE << 4)) a -= (BASE << 4); \
+ if (a >= (BASE << 3)) a -= (BASE << 3); \
+ if (a >= (BASE << 2)) a -= (BASE << 2); \
+ if (a >= (BASE << 1)) a -= (BASE << 1); \
+ if (a >= BASE) a -= BASE; \
+ } while (0)
+# define MOD4(a) \
+ do { \
+ if (a >= (BASE << 4)) a -= (BASE << 4); \
+ if (a >= (BASE << 3)) a -= (BASE << 3); \
+ if (a >= (BASE << 2)) a -= (BASE << 2); \
+ if (a >= (BASE << 1)) a -= (BASE << 1); \
+ if (a >= BASE) a -= BASE; \
+ } while (0)
+#else
+# define MOD(a) a %= BASE
+# define MOD4(a) a %= BASE
+#endif
+
+/* ========================================================================= */
+uLong ZEXPORT adler32(adler, buf, len)
+ uLong adler;
+ const Bytef *buf;
+ uInt len;
+{
+ unsigned long sum2;
+ unsigned n;
+
+ /* split Adler-32 into component sums */
+ sum2 = (adler >> 16) & 0xffff;
+ adler &= 0xffff;
+
+ /* in case user likes doing a byte at a time, keep it fast */
+ if (len == 1) {
+ adler += buf[0];
+ if (adler >= BASE)
+ adler -= BASE;
+ sum2 += adler;
+ if (sum2 >= BASE)
+ sum2 -= BASE;
+ return adler | (sum2 << 16);
+ }
+
+ /* initial Adler-32 value (deferred check for len == 1 speed) */
+ if (buf == Z_NULL)
+ return 1L;
+
+ /* in case short lengths are provided, keep it somewhat fast */
+ if (len < 16) {
+ while (len--) {
+ adler += *buf++;
+ sum2 += adler;
+ }
+ if (adler >= BASE)
+ adler -= BASE;
+ MOD4(sum2); /* only added so many BASE's */
+ return adler | (sum2 << 16);
+ }
+
+ /* do length NMAX blocks -- requires just one modulo operation */
+ while (len >= NMAX) {
+ len -= NMAX;
+ n = NMAX / 16; /* NMAX is divisible by 16 */
+ do {
+ DO16(buf); /* 16 sums unrolled */
+ buf += 16;
+ } while (--n);
+ MOD(adler);
+ MOD(sum2);
+ }
+
+ /* do remaining bytes (less than NMAX, still just one modulo) */
+ if (len) { /* avoid modulos if none remaining */
+ while (len >= 16) {
+ len -= 16;
+ DO16(buf);
+ buf += 16;
+ }
+ while (len--) {
+ adler += *buf++;
+ sum2 += adler;
+ }
+ MOD(adler);
+ MOD(sum2);
+ }
+
+ /* return recombined sums */
+ return adler | (sum2 << 16);
+}
+
+/* ========================================================================= */
+uLong ZEXPORT adler32_combine(adler1, adler2, len2)
+ uLong adler1;
+ uLong adler2;
+ z_off_t len2;
+{
+ unsigned long sum1;
+ unsigned long sum2;
+ unsigned rem;
+
+ /* the derivation of this formula is left as an exercise for the reader */
+ rem = (unsigned)(len2 % BASE);
+ sum1 = adler1 & 0xffff;
+ sum2 = rem * sum1;
+ MOD(sum2);
+ sum1 += (adler2 & 0xffff) + BASE - 1;
+ sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
+ if (sum1 > BASE) sum1 -= BASE;
+ if (sum1 > BASE) sum1 -= BASE;
+ if (sum2 > (BASE << 1)) sum2 -= (BASE << 1);
+ if (sum2 > BASE) sum2 -= BASE;
+ return sum1 | (sum2 << 16);
+}
-/* compress.c -- compress a memory buffer\r
- * Copyright (C) 1995-2003 Jean-loup Gailly.\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/* @(#) $Id$ */\r
-\r
-#define ZLIB_INTERNAL\r
-#include "zlib.h"\r
-\r
-/* ===========================================================================\r
- Compresses the source buffer into the destination buffer. The level\r
- parameter has the same meaning as in deflateInit. sourceLen is the byte\r
- length of the source buffer. Upon entry, destLen is the total size of the\r
- destination buffer, which must be at least 0.1% larger than sourceLen plus\r
- 12 bytes. Upon exit, destLen is the actual size of the compressed buffer.\r
-\r
- compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
- memory, Z_BUF_ERROR if there was not enough room in the output buffer,\r
- Z_STREAM_ERROR if the level parameter is invalid.\r
-*/\r
-int ZEXPORT compress2 (dest, destLen, source, sourceLen, level)\r
- Bytef *dest;\r
- uLongf *destLen;\r
- const Bytef *source;\r
- uLong sourceLen;\r
- int level;\r
-{\r
- z_stream stream;\r
- int err;\r
-\r
- stream.next_in = (Bytef*)source;\r
- stream.avail_in = (uInt)sourceLen;\r
-#ifdef MAXSEG_64K\r
- /* Check for source > 64K on 16-bit machine: */\r
- if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;\r
-#endif\r
- stream.next_out = dest;\r
- stream.avail_out = (uInt)*destLen;\r
- if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR;\r
-\r
- stream.zalloc = (alloc_func)0;\r
- stream.zfree = (free_func)0;\r
- stream.opaque = (voidpf)0;\r
-\r
- err = deflateInit(&stream, level);\r
- if (err != Z_OK) return err;\r
-\r
- err = deflate(&stream, Z_FINISH);\r
- if (err != Z_STREAM_END) {\r
- deflateEnd(&stream);\r
- return err == Z_OK ? Z_BUF_ERROR : err;\r
- }\r
- *destLen = stream.total_out;\r
-\r
- err = deflateEnd(&stream);\r
- return err;\r
-}\r
-\r
-/* ===========================================================================\r
- */\r
-int ZEXPORT compress (dest, destLen, source, sourceLen)\r
- Bytef *dest;\r
- uLongf *destLen;\r
- const Bytef *source;\r
- uLong sourceLen;\r
-{\r
- return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION);\r
-}\r
-\r
-/* ===========================================================================\r
- If the default memLevel or windowBits for deflateInit() is changed, then\r
- this function needs to be updated.\r
- */\r
-uLong ZEXPORT compressBound (sourceLen)\r
- uLong sourceLen;\r
-{\r
- return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) + 11;\r
-}\r
+/* compress.c -- compress a memory buffer
+ * Copyright (C) 1995-2003 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#define ZLIB_INTERNAL
+#include "zlib.h"
+
+/* ===========================================================================
+ Compresses the source buffer into the destination buffer. The level
+ parameter has the same meaning as in deflateInit. sourceLen is the byte
+ length of the source buffer. Upon entry, destLen is the total size of the
+ destination buffer, which must be at least 0.1% larger than sourceLen plus
+ 12 bytes. Upon exit, destLen is the actual size of the compressed buffer.
+
+ compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
+ memory, Z_BUF_ERROR if there was not enough room in the output buffer,
+ Z_STREAM_ERROR if the level parameter is invalid.
+*/
+int ZEXPORT compress2 (dest, destLen, source, sourceLen, level)
+ Bytef *dest;
+ uLongf *destLen;
+ const Bytef *source;
+ uLong sourceLen;
+ int level;
+{
+ z_stream stream;
+ int err;
+
+ stream.next_in = (Bytef*)source;
+ stream.avail_in = (uInt)sourceLen;
+#ifdef MAXSEG_64K
+ /* Check for source > 64K on 16-bit machine: */
+ if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;
+#endif
+ stream.next_out = dest;
+ stream.avail_out = (uInt)*destLen;
+ if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR;
+
+ stream.zalloc = (alloc_func)0;
+ stream.zfree = (free_func)0;
+ stream.opaque = (voidpf)0;
+
+ err = deflateInit(&stream, level);
+ if (err != Z_OK) return err;
+
+ err = deflate(&stream, Z_FINISH);
+ if (err != Z_STREAM_END) {
+ deflateEnd(&stream);
+ return err == Z_OK ? Z_BUF_ERROR : err;
+ }
+ *destLen = stream.total_out;
+
+ err = deflateEnd(&stream);
+ return err;
+}
+
+/* ===========================================================================
+ */
+int ZEXPORT compress (dest, destLen, source, sourceLen)
+ Bytef *dest;
+ uLongf *destLen;
+ const Bytef *source;
+ uLong sourceLen;
+{
+ return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION);
+}
+
+/* ===========================================================================
+ If the default memLevel or windowBits for deflateInit() is changed, then
+ this function needs to be updated.
+ */
+uLong ZEXPORT compressBound (sourceLen)
+ uLong sourceLen;
+{
+ return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) + 11;
+}
-/* crc32.c -- compute the CRC-32 of a data stream\r
- * Copyright (C) 1995-2005 Mark Adler\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- *\r
- * Thanks to Rodney Brown <rbrown64@csc.com.au> for his contribution of faster\r
- * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing\r
- * tables for updating the shift register in one step with three exclusive-ors\r
- * instead of four steps with four exclusive-ors. This results in about a\r
- * factor of two increase in speed on a Power PC G4 (PPC7455) using gcc -O3.\r
- */\r
-\r
-/* @(#) $Id$ */\r
-\r
-/*\r
- Note on the use of DYNAMIC_CRC_TABLE: there is no mutex or semaphore\r
- protection on the static variables used to control the first-use generation\r
- of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should\r
- first call get_crc_table() to initialize the tables before allowing more than\r
- one thread to use crc32().\r
- */\r
-\r
-#ifdef MAKECRCH\r
-# include <stdio.h>\r
-# ifndef DYNAMIC_CRC_TABLE\r
-# define DYNAMIC_CRC_TABLE\r
-# endif /* !DYNAMIC_CRC_TABLE */\r
-#endif /* MAKECRCH */\r
-\r
-#include "zutil.h" /* for STDC and FAR definitions */\r
-\r
-#define local static\r
-\r
-/* Find a four-byte integer type for crc32_little() and crc32_big(). */\r
-#ifndef NOBYFOUR\r
-# ifdef STDC /* need ANSI C limits.h to determine sizes */\r
-# include <limits.h>\r
-# define BYFOUR\r
-# if (UINT_MAX == 0xffffffffUL)\r
- typedef unsigned int u4;\r
-# else\r
-# if (ULONG_MAX == 0xffffffffUL)\r
- typedef unsigned long u4;\r
-# else\r
-# if (USHRT_MAX == 0xffffffffUL)\r
- typedef unsigned short u4;\r
-# else\r
-# undef BYFOUR /* can't find a four-byte integer type! */\r
-# endif\r
-# endif\r
-# endif\r
-# endif /* STDC */\r
-#endif /* !NOBYFOUR */\r
-\r
-/* Definitions for doing the crc four data bytes at a time. */\r
-#ifdef BYFOUR\r
-# define REV(w) (((w)>>24)+(((w)>>8)&0xff00)+ \\r
- (((w)&0xff00)<<8)+(((w)&0xff)<<24))\r
- local unsigned long crc32_little OF((unsigned long,\r
- const unsigned char FAR *, unsigned));\r
- local unsigned long crc32_big OF((unsigned long,\r
- const unsigned char FAR *, unsigned));\r
-# define TBLS 8\r
-#else\r
-# define TBLS 1\r
-#endif /* BYFOUR */\r
-\r
-/* Local functions for crc concatenation */\r
-local unsigned long gf2_matrix_times OF((unsigned long *mat,\r
- unsigned long vec));\r
-local void gf2_matrix_square OF((unsigned long *square, unsigned long *mat));\r
-\r
-#ifdef DYNAMIC_CRC_TABLE\r
-\r
-local volatile int crc_table_empty = 1;\r
-local unsigned long FAR crc_table[TBLS][256];\r
-local void make_crc_table OF((void));\r
-#ifdef MAKECRCH\r
- local void write_table OF((FILE *, const unsigned long FAR *));\r
-#endif /* MAKECRCH */\r
-/*\r
- Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:\r
- 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.\r
-\r
- Polynomials over GF(2) are represented in binary, one bit per coefficient,\r
- with the lowest powers in the most significant bit. Then adding polynomials\r
- is just exclusive-or, and multiplying a polynomial by x is a right shift by\r
- one. If we call the above polynomial p, and represent a byte as the\r
- polynomial q, also with the lowest power in the most significant bit (so the\r
- byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,\r
- where a mod b means the remainder after dividing a by b.\r
-\r
- This calculation is done using the shift-register method of multiplying and\r
- taking the remainder. The register is initialized to zero, and for each\r
- incoming bit, x^32 is added mod p to the register if the bit is a one (where\r
- x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by\r
- x (which is shifting right by one and adding x^32 mod p if the bit shifted\r
- out is a one). We start with the highest power (least significant bit) of\r
- q and repeat for all eight bits of q.\r
-\r
- The first table is simply the CRC of all possible eight bit values. This is\r
- all the information needed to generate CRCs on data a byte at a time for all\r
- combinations of CRC register values and incoming bytes. The remaining tables\r
- allow for word-at-a-time CRC calculation for both big-endian and little-\r
- endian machines, where a word is four bytes.\r
-*/\r
-local void make_crc_table()\r
-{\r
- unsigned long c;\r
- int n, k;\r
- unsigned long poly; /* polynomial exclusive-or pattern */\r
- /* terms of polynomial defining this crc (except x^32): */\r
- static volatile int first = 1; /* flag to limit concurrent making */\r
- static const unsigned char p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};\r
-\r
- /* See if another task is already doing this (not thread-safe, but better\r
- than nothing -- significantly reduces duration of vulnerability in\r
- case the advice about DYNAMIC_CRC_TABLE is ignored) */\r
- if (first) {\r
- first = 0;\r
-\r
- /* make exclusive-or pattern from polynomial (0xedb88320UL) */\r
- poly = 0UL;\r
- for (n = 0; n < sizeof(p)/sizeof(unsigned char); n++)\r
- poly |= 1UL << (31 - p[n]);\r
-\r
- /* generate a crc for every 8-bit value */\r
- for (n = 0; n < 256; n++) {\r
- c = (unsigned long)n;\r
- for (k = 0; k < 8; k++)\r
- c = c & 1 ? poly ^ (c >> 1) : c >> 1;\r
- crc_table[0][n] = c;\r
- }\r
-\r
-#ifdef BYFOUR\r
- /* generate crc for each value followed by one, two, and three zeros,\r
- and then the byte reversal of those as well as the first table */\r
- for (n = 0; n < 256; n++) {\r
- c = crc_table[0][n];\r
- crc_table[4][n] = REV(c);\r
- for (k = 1; k < 4; k++) {\r
- c = crc_table[0][c & 0xff] ^ (c >> 8);\r
- crc_table[k][n] = c;\r
- crc_table[k + 4][n] = REV(c);\r
- }\r
- }\r
-#endif /* BYFOUR */\r
-\r
- crc_table_empty = 0;\r
- }\r
- else { /* not first */\r
- /* wait for the other guy to finish (not efficient, but rare) */\r
- while (crc_table_empty)\r
- ;\r
- }\r
-\r
-#ifdef MAKECRCH\r
- /* write out CRC tables to crc32.h */\r
- {\r
- FILE *out;\r
-\r
- out = fopen("crc32.h", "w");\r
- if (out == NULL) return;\r
- fprintf(out, "/* crc32.h -- tables for rapid CRC calculation\n");\r
- fprintf(out, " * Generated automatically by crc32.c\n */\n\n");\r
- fprintf(out, "local const unsigned long FAR ");\r
- fprintf(out, "crc_table[TBLS][256] =\n{\n {\n");\r
- write_table(out, crc_table[0]);\r
-# ifdef BYFOUR\r
- fprintf(out, "#ifdef BYFOUR\n");\r
- for (k = 1; k < 8; k++) {\r
- fprintf(out, " },\n {\n");\r
- write_table(out, crc_table[k]);\r
- }\r
- fprintf(out, "#endif\n");\r
-# endif /* BYFOUR */\r
- fprintf(out, " }\n};\n");\r
- fclose(out);\r
- }\r
-#endif /* MAKECRCH */\r
-}\r
-\r
-#ifdef MAKECRCH\r
-local void write_table(out, table)\r
- FILE *out;\r
- const unsigned long FAR *table;\r
-{\r
- int n;\r
-\r
- for (n = 0; n < 256; n++)\r
- fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : " ", table[n],\r
- n == 255 ? "\n" : (n % 5 == 4 ? ",\n" : ", "));\r
-}\r
-#endif /* MAKECRCH */\r
-\r
-#else /* !DYNAMIC_CRC_TABLE */\r
-/* ========================================================================\r
- * Tables of CRC-32s of all single-byte values, made by make_crc_table().\r
- */\r
-#include "crc32.h"\r
-#endif /* DYNAMIC_CRC_TABLE */\r
-\r
-/* =========================================================================\r
- * This function can be used by asm versions of crc32()\r
- */\r
-const unsigned long FAR * ZEXPORT get_crc_table()\r
-{\r
-#ifdef DYNAMIC_CRC_TABLE\r
- if (crc_table_empty)\r
- make_crc_table();\r
-#endif /* DYNAMIC_CRC_TABLE */\r
- return (const unsigned long FAR *)crc_table;\r
-}\r
-\r
-/* ========================================================================= */\r
-#define DO1 crc = crc_table[0][((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8)\r
-#define DO8 DO1; DO1; DO1; DO1; DO1; DO1; DO1; DO1\r
-\r
-/* ========================================================================= */\r
-unsigned long ZEXPORT crc32(crc, buf, len)\r
- unsigned long crc;\r
- const unsigned char FAR *buf;\r
- unsigned len;\r
-{\r
- if (buf == Z_NULL) return 0UL;\r
-\r
-#ifdef DYNAMIC_CRC_TABLE\r
- if (crc_table_empty)\r
- make_crc_table();\r
-#endif /* DYNAMIC_CRC_TABLE */\r
-\r
-#ifdef BYFOUR\r
- if (sizeof(void *) == sizeof(ptrdiff_t)) {\r
- u4 endian;\r
-\r
- endian = 1;\r
- if (*((unsigned char *)(&endian)))\r
- return crc32_little(crc, buf, len);\r
- else\r
- return crc32_big(crc, buf, len);\r
- }\r
-#endif /* BYFOUR */\r
- crc = crc ^ 0xffffffffUL;\r
- while (len >= 8) {\r
- DO8;\r
- len -= 8;\r
- }\r
- if (len) do {\r
- DO1;\r
- } while (--len);\r
- return crc ^ 0xffffffffUL;\r
-}\r
-\r
-#ifdef BYFOUR\r
-\r
-/* ========================================================================= */\r
-#define DOLIT4 c ^= *buf4++; \\r
- c = crc_table[3][c & 0xff] ^ crc_table[2][(c >> 8) & 0xff] ^ \\r
- crc_table[1][(c >> 16) & 0xff] ^ crc_table[0][c >> 24]\r
-#define DOLIT32 DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4\r
-\r
-/* ========================================================================= */\r
-local unsigned long crc32_little(crc, buf, len)\r
- unsigned long crc;\r
- const unsigned char FAR *buf;\r
- unsigned len;\r
-{\r
- register u4 c;\r
- register const u4 FAR *buf4;\r
-\r
- c = (u4)crc;\r
- c = ~c;\r
- while (len && ((ptrdiff_t)buf & 3)) {\r
- c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);\r
- len--;\r
- }\r
-\r
- buf4 = (const u4 FAR *)(const void FAR *)buf;\r
- while (len >= 32) {\r
- DOLIT32;\r
- len -= 32;\r
- }\r
- while (len >= 4) {\r
- DOLIT4;\r
- len -= 4;\r
- }\r
- buf = (const unsigned char FAR *)buf4;\r
-\r
- if (len) do {\r
- c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);\r
- } while (--len);\r
- c = ~c;\r
- return (unsigned long)c;\r
-}\r
-\r
-/* ========================================================================= */\r
-#define DOBIG4 c ^= *++buf4; \\r
- c = crc_table[4][c & 0xff] ^ crc_table[5][(c >> 8) & 0xff] ^ \\r
- crc_table[6][(c >> 16) & 0xff] ^ crc_table[7][c >> 24]\r
-#define DOBIG32 DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4\r
-\r
-/* ========================================================================= */\r
-local unsigned long crc32_big(crc, buf, len)\r
- unsigned long crc;\r
- const unsigned char FAR *buf;\r
- unsigned len;\r
-{\r
- register u4 c;\r
- register const u4 FAR *buf4;\r
-\r
- c = REV((u4)crc);\r
- c = ~c;\r
- while (len && ((ptrdiff_t)buf & 3)) {\r
- c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);\r
- len--;\r
- }\r
-\r
- buf4 = (const u4 FAR *)(const void FAR *)buf;\r
- buf4--;\r
- while (len >= 32) {\r
- DOBIG32;\r
- len -= 32;\r
- }\r
- while (len >= 4) {\r
- DOBIG4;\r
- len -= 4;\r
- }\r
- buf4++;\r
- buf = (const unsigned char FAR *)buf4;\r
-\r
- if (len) do {\r
- c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);\r
- } while (--len);\r
- c = ~c;\r
- return (unsigned long)(REV(c));\r
-}\r
-\r
-#endif /* BYFOUR */\r
-\r
-#define GF2_DIM 32 /* dimension of GF(2) vectors (length of CRC) */\r
-\r
-/* ========================================================================= */\r
-local unsigned long gf2_matrix_times(mat, vec)\r
- unsigned long *mat;\r
- unsigned long vec;\r
-{\r
- unsigned long sum;\r
-\r
- sum = 0;\r
- while (vec) {\r
- if (vec & 1)\r
- sum ^= *mat;\r
- vec >>= 1;\r
- mat++;\r
- }\r
- return sum;\r
-}\r
-\r
-/* ========================================================================= */\r
-local void gf2_matrix_square(square, mat)\r
- unsigned long *square;\r
- unsigned long *mat;\r
-{\r
- int n;\r
-\r
- for (n = 0; n < GF2_DIM; n++)\r
- square[n] = gf2_matrix_times(mat, mat[n]);\r
-}\r
-\r
-/* ========================================================================= */\r
-uLong ZEXPORT crc32_combine(crc1, crc2, len2)\r
- uLong crc1;\r
- uLong crc2;\r
- z_off_t len2;\r
-{\r
- int n;\r
- unsigned long row;\r
- unsigned long even[GF2_DIM]; /* even-power-of-two zeros operator */\r
- unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */\r
-\r
- /* degenerate case */\r
- if (len2 == 0)\r
- return crc1;\r
-\r
- /* put operator for one zero bit in odd */\r
- odd[0] = 0xedb88320L; /* CRC-32 polynomial */\r
- row = 1;\r
- for (n = 1; n < GF2_DIM; n++) {\r
- odd[n] = row;\r
- row <<= 1;\r
- }\r
-\r
- /* put operator for two zero bits in even */\r
- gf2_matrix_square(even, odd);\r
-\r
- /* put operator for four zero bits in odd */\r
- gf2_matrix_square(odd, even);\r
-\r
- /* apply len2 zeros to crc1 (first square will put the operator for one\r
- zero byte, eight zero bits, in even) */\r
- do {\r
- /* apply zeros operator for this bit of len2 */\r
- gf2_matrix_square(even, odd);\r
- if (len2 & 1)\r
- crc1 = gf2_matrix_times(even, crc1);\r
- len2 >>= 1;\r
-\r
- /* if no more bits set, then done */\r
- if (len2 == 0)\r
- break;\r
-\r
- /* another iteration of the loop with odd and even swapped */\r
- gf2_matrix_square(odd, even);\r
- if (len2 & 1)\r
- crc1 = gf2_matrix_times(odd, crc1);\r
- len2 >>= 1;\r
-\r
- /* if no more bits set, then done */\r
- } while (len2 != 0);\r
-\r
- /* return combined crc */\r
- crc1 ^= crc2;\r
- return crc1;\r
-}\r
+/* crc32.c -- compute the CRC-32 of a data stream
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ *
+ * Thanks to Rodney Brown <rbrown64@csc.com.au> for his contribution of faster
+ * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
+ * tables for updating the shift register in one step with three exclusive-ors
+ * instead of four steps with four exclusive-ors. This results in about a
+ * factor of two increase in speed on a Power PC G4 (PPC7455) using gcc -O3.
+ */
+
+/* @(#) $Id$ */
+
+/*
+ Note on the use of DYNAMIC_CRC_TABLE: there is no mutex or semaphore
+ protection on the static variables used to control the first-use generation
+ of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
+ first call get_crc_table() to initialize the tables before allowing more than
+ one thread to use crc32().
+ */
+
+#ifdef MAKECRCH
+# include <stdio.h>
+# ifndef DYNAMIC_CRC_TABLE
+# define DYNAMIC_CRC_TABLE
+# endif /* !DYNAMIC_CRC_TABLE */
+#endif /* MAKECRCH */
+
+#include "zutil.h" /* for STDC and FAR definitions */
+
+#define local static
+
+/* Find a four-byte integer type for crc32_little() and crc32_big(). */
+#ifndef NOBYFOUR
+# ifdef STDC /* need ANSI C limits.h to determine sizes */
+# include <limits.h>
+# define BYFOUR
+# if (UINT_MAX == 0xffffffffUL)
+ typedef unsigned int u4;
+# else
+# if (ULONG_MAX == 0xffffffffUL)
+ typedef unsigned long u4;
+# else
+# if (USHRT_MAX == 0xffffffffUL)
+ typedef unsigned short u4;
+# else
+# undef BYFOUR /* can't find a four-byte integer type! */
+# endif
+# endif
+# endif
+# endif /* STDC */
+#endif /* !NOBYFOUR */
+
+/* Definitions for doing the crc four data bytes at a time. */
+#ifdef BYFOUR
+# define REV(w) (((w)>>24)+(((w)>>8)&0xff00)+ \
+ (((w)&0xff00)<<8)+(((w)&0xff)<<24))
+ local unsigned long crc32_little OF((unsigned long,
+ const unsigned char FAR *, unsigned));
+ local unsigned long crc32_big OF((unsigned long,
+ const unsigned char FAR *, unsigned));
+# define TBLS 8
+#else
+# define TBLS 1
+#endif /* BYFOUR */
+
+/* Local functions for crc concatenation */
+local unsigned long gf2_matrix_times OF((unsigned long *mat,
+ unsigned long vec));
+local void gf2_matrix_square OF((unsigned long *square, unsigned long *mat));
+
+#ifdef DYNAMIC_CRC_TABLE
+
+local volatile int crc_table_empty = 1;
+local unsigned long FAR crc_table[TBLS][256];
+local void make_crc_table OF((void));
+#ifdef MAKECRCH
+ local void write_table OF((FILE *, const unsigned long FAR *));
+#endif /* MAKECRCH */
+/*
+ Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
+ x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1.
+
+ Polynomials over GF(2) are represented in binary, one bit per coefficient,
+ with the lowest powers in the most significant bit. Then adding polynomials
+ is just exclusive-or, and multiplying a polynomial by x is a right shift by
+ one. If we call the above polynomial p, and represent a byte as the
+ polynomial q, also with the lowest power in the most significant bit (so the
+ byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
+ where a mod b means the remainder after dividing a by b.
+
+ This calculation is done using the shift-register method of multiplying and
+ taking the remainder. The register is initialized to zero, and for each
+ incoming bit, x^32 is added mod p to the register if the bit is a one (where
+ x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by
+ x (which is shifting right by one and adding x^32 mod p if the bit shifted
+ out is a one). We start with the highest power (least significant bit) of
+ q and repeat for all eight bits of q.
+
+ The first table is simply the CRC of all possible eight bit values. This is
+ all the information needed to generate CRCs on data a byte at a time for all
+ combinations of CRC register values and incoming bytes. The remaining tables
+ allow for word-at-a-time CRC calculation for both big-endian and little-
+ endian machines, where a word is four bytes.
+*/
+local void make_crc_table()
+{
+ unsigned long c;
+ int n, k;
+ unsigned long poly; /* polynomial exclusive-or pattern */
+ /* terms of polynomial defining this crc (except x^32): */
+ static volatile int first = 1; /* flag to limit concurrent making */
+ static const unsigned char p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};
+
+ /* See if another task is already doing this (not thread-safe, but better
+ than nothing -- significantly reduces duration of vulnerability in
+ case the advice about DYNAMIC_CRC_TABLE is ignored) */
+ if (first) {
+ first = 0;
+
+ /* make exclusive-or pattern from polynomial (0xedb88320UL) */
+ poly = 0UL;
+ for (n = 0; n < sizeof(p)/sizeof(unsigned char); n++)
+ poly |= 1UL << (31 - p[n]);
+
+ /* generate a crc for every 8-bit value */
+ for (n = 0; n < 256; n++) {
+ c = (unsigned long)n;
+ for (k = 0; k < 8; k++)
+ c = c & 1 ? poly ^ (c >> 1) : c >> 1;
+ crc_table[0][n] = c;
+ }
+
+#ifdef BYFOUR
+ /* generate crc for each value followed by one, two, and three zeros,
+ and then the byte reversal of those as well as the first table */
+ for (n = 0; n < 256; n++) {
+ c = crc_table[0][n];
+ crc_table[4][n] = REV(c);
+ for (k = 1; k < 4; k++) {
+ c = crc_table[0][c & 0xff] ^ (c >> 8);
+ crc_table[k][n] = c;
+ crc_table[k + 4][n] = REV(c);
+ }
+ }
+#endif /* BYFOUR */
+
+ crc_table_empty = 0;
+ }
+ else { /* not first */
+ /* wait for the other guy to finish (not efficient, but rare) */
+ while (crc_table_empty)
+ ;
+ }
+
+#ifdef MAKECRCH
+ /* write out CRC tables to crc32.h */
+ {
+ FILE *out;
+
+ out = fopen("crc32.h", "w");
+ if (out == NULL) return;
+ fprintf(out, "/* crc32.h -- tables for rapid CRC calculation\n");
+ fprintf(out, " * Generated automatically by crc32.c\n */\n\n");
+ fprintf(out, "local const unsigned long FAR ");
+ fprintf(out, "crc_table[TBLS][256] =\n{\n {\n");
+ write_table(out, crc_table[0]);
+# ifdef BYFOUR
+ fprintf(out, "#ifdef BYFOUR\n");
+ for (k = 1; k < 8; k++) {
+ fprintf(out, " },\n {\n");
+ write_table(out, crc_table[k]);
+ }
+ fprintf(out, "#endif\n");
+# endif /* BYFOUR */
+ fprintf(out, " }\n};\n");
+ fclose(out);
+ }
+#endif /* MAKECRCH */
+}
+
+#ifdef MAKECRCH
+local void write_table(out, table)
+ FILE *out;
+ const unsigned long FAR *table;
+{
+ int n;
+
+ for (n = 0; n < 256; n++)
+ fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : " ", table[n],
+ n == 255 ? "\n" : (n % 5 == 4 ? ",\n" : ", "));
+}
+#endif /* MAKECRCH */
+
+#else /* !DYNAMIC_CRC_TABLE */
+/* ========================================================================
+ * Tables of CRC-32s of all single-byte values, made by make_crc_table().
+ */
+#include "crc32.h"
+#endif /* DYNAMIC_CRC_TABLE */
+
+/* =========================================================================
+ * This function can be used by asm versions of crc32()
+ */
+const unsigned long FAR * ZEXPORT get_crc_table()
+{
+#ifdef DYNAMIC_CRC_TABLE
+ if (crc_table_empty)
+ make_crc_table();
+#endif /* DYNAMIC_CRC_TABLE */
+ return (const unsigned long FAR *)crc_table;
+}
+
+/* ========================================================================= */
+#define DO1 crc = crc_table[0][((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8)
+#define DO8 DO1; DO1; DO1; DO1; DO1; DO1; DO1; DO1
+
+/* ========================================================================= */
+unsigned long ZEXPORT crc32(crc, buf, len)
+ unsigned long crc;
+ const unsigned char FAR *buf;
+ unsigned len;
+{
+ if (buf == Z_NULL) return 0UL;
+
+#ifdef DYNAMIC_CRC_TABLE
+ if (crc_table_empty)
+ make_crc_table();
+#endif /* DYNAMIC_CRC_TABLE */
+
+#ifdef BYFOUR
+ if (sizeof(void *) == sizeof(ptrdiff_t)) {
+ u4 endian;
+
+ endian = 1;
+ if (*((unsigned char *)(&endian)))
+ return crc32_little(crc, buf, len);
+ else
+ return crc32_big(crc, buf, len);
+ }
+#endif /* BYFOUR */
+ crc = crc ^ 0xffffffffUL;
+ while (len >= 8) {
+ DO8;
+ len -= 8;
+ }
+ if (len) do {
+ DO1;
+ } while (--len);
+ return crc ^ 0xffffffffUL;
+}
+
+#ifdef BYFOUR
+
+/* ========================================================================= */
+#define DOLIT4 c ^= *buf4++; \
+ c = crc_table[3][c & 0xff] ^ crc_table[2][(c >> 8) & 0xff] ^ \
+ crc_table[1][(c >> 16) & 0xff] ^ crc_table[0][c >> 24]
+#define DOLIT32 DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4
+
+/* ========================================================================= */
+local unsigned long crc32_little(crc, buf, len)
+ unsigned long crc;
+ const unsigned char FAR *buf;
+ unsigned len;
+{
+ register u4 c;
+ register const u4 FAR *buf4;
+
+ c = (u4)crc;
+ c = ~c;
+ while (len && ((ptrdiff_t)buf & 3)) {
+ c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);
+ len--;
+ }
+
+ buf4 = (const u4 FAR *)(const void FAR *)buf;
+ while (len >= 32) {
+ DOLIT32;
+ len -= 32;
+ }
+ while (len >= 4) {
+ DOLIT4;
+ len -= 4;
+ }
+ buf = (const unsigned char FAR *)buf4;
+
+ if (len) do {
+ c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);
+ } while (--len);
+ c = ~c;
+ return (unsigned long)c;
+}
+
+/* ========================================================================= */
+#define DOBIG4 c ^= *++buf4; \
+ c = crc_table[4][c & 0xff] ^ crc_table[5][(c >> 8) & 0xff] ^ \
+ crc_table[6][(c >> 16) & 0xff] ^ crc_table[7][c >> 24]
+#define DOBIG32 DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4
+
+/* ========================================================================= */
+local unsigned long crc32_big(crc, buf, len)
+ unsigned long crc;
+ const unsigned char FAR *buf;
+ unsigned len;
+{
+ register u4 c;
+ register const u4 FAR *buf4;
+
+ c = REV((u4)crc);
+ c = ~c;
+ while (len && ((ptrdiff_t)buf & 3)) {
+ c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);
+ len--;
+ }
+
+ buf4 = (const u4 FAR *)(const void FAR *)buf;
+ buf4--;
+ while (len >= 32) {
+ DOBIG32;
+ len -= 32;
+ }
+ while (len >= 4) {
+ DOBIG4;
+ len -= 4;
+ }
+ buf4++;
+ buf = (const unsigned char FAR *)buf4;
+
+ if (len) do {
+ c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);
+ } while (--len);
+ c = ~c;
+ return (unsigned long)(REV(c));
+}
+
+#endif /* BYFOUR */
+
+#define GF2_DIM 32 /* dimension of GF(2) vectors (length of CRC) */
+
+/* ========================================================================= */
+local unsigned long gf2_matrix_times(mat, vec)
+ unsigned long *mat;
+ unsigned long vec;
+{
+ unsigned long sum;
+
+ sum = 0;
+ while (vec) {
+ if (vec & 1)
+ sum ^= *mat;
+ vec >>= 1;
+ mat++;
+ }
+ return sum;
+}
+
+/* ========================================================================= */
+local void gf2_matrix_square(square, mat)
+ unsigned long *square;
+ unsigned long *mat;
+{
+ int n;
+
+ for (n = 0; n < GF2_DIM; n++)
+ square[n] = gf2_matrix_times(mat, mat[n]);
+}
+
+/* ========================================================================= */
+uLong ZEXPORT crc32_combine(crc1, crc2, len2)
+ uLong crc1;
+ uLong crc2;
+ z_off_t len2;
+{
+ int n;
+ unsigned long row;
+ unsigned long even[GF2_DIM]; /* even-power-of-two zeros operator */
+ unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */
+
+ /* degenerate case */
+ if (len2 == 0)
+ return crc1;
+
+ /* put operator for one zero bit in odd */
+ odd[0] = 0xedb88320L; /* CRC-32 polynomial */
+ row = 1;
+ for (n = 1; n < GF2_DIM; n++) {
+ odd[n] = row;
+ row <<= 1;
+ }
+
+ /* put operator for two zero bits in even */
+ gf2_matrix_square(even, odd);
+
+ /* put operator for four zero bits in odd */
+ gf2_matrix_square(odd, even);
+
+ /* apply len2 zeros to crc1 (first square will put the operator for one
+ zero byte, eight zero bits, in even) */
+ do {
+ /* apply zeros operator for this bit of len2 */
+ gf2_matrix_square(even, odd);
+ if (len2 & 1)
+ crc1 = gf2_matrix_times(even, crc1);
+ len2 >>= 1;
+
+ /* if no more bits set, then done */
+ if (len2 == 0)
+ break;
+
+ /* another iteration of the loop with odd and even swapped */
+ gf2_matrix_square(odd, even);
+ if (len2 & 1)
+ crc1 = gf2_matrix_times(odd, crc1);
+ len2 >>= 1;
+
+ /* if no more bits set, then done */
+ } while (len2 != 0);
+
+ /* return combined crc */
+ crc1 ^= crc2;
+ return crc1;
+}
-/* crc32.h -- tables for rapid CRC calculation\r
- * Generated automatically by crc32.c\r
- */\r
-\r
-local const unsigned long FAR crc_table[TBLS][256] =\r
-{\r
- {\r
- 0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,\r
- 0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,\r
- 0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,\r
- 0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,\r
- 0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,\r
- 0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,\r
- 0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,\r
- 0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,\r
- 0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,\r
- 0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,\r
- 0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,\r
- 0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,\r
- 0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,\r
- 0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,\r
- 0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,\r
- 0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,\r
- 0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,\r
- 0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,\r
- 0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,\r
- 0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,\r
- 0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,\r
- 0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,\r
- 0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,\r
- 0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,\r
- 0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,\r
- 0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,\r
- 0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,\r
- 0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,\r
- 0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,\r
- 0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,\r
- 0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,\r
- 0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,\r
- 0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,\r
- 0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,\r
- 0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,\r
- 0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,\r
- 0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,\r
- 0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,\r
- 0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,\r
- 0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,\r
- 0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,\r
- 0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,\r
- 0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,\r
- 0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,\r
- 0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,\r
- 0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,\r
- 0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,\r
- 0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,\r
- 0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,\r
- 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,\r
- 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,\r
- 0x2d02ef8dUL\r
-#ifdef BYFOUR\r
- },\r
- {\r
- 0x00000000UL, 0x191b3141UL, 0x32366282UL, 0x2b2d53c3UL, 0x646cc504UL,\r
- 0x7d77f445UL, 0x565aa786UL, 0x4f4196c7UL, 0xc8d98a08UL, 0xd1c2bb49UL,\r
- 0xfaefe88aUL, 0xe3f4d9cbUL, 0xacb54f0cUL, 0xb5ae7e4dUL, 0x9e832d8eUL,\r
- 0x87981ccfUL, 0x4ac21251UL, 0x53d92310UL, 0x78f470d3UL, 0x61ef4192UL,\r
- 0x2eaed755UL, 0x37b5e614UL, 0x1c98b5d7UL, 0x05838496UL, 0x821b9859UL,\r
- 0x9b00a918UL, 0xb02dfadbUL, 0xa936cb9aUL, 0xe6775d5dUL, 0xff6c6c1cUL,\r
- 0xd4413fdfUL, 0xcd5a0e9eUL, 0x958424a2UL, 0x8c9f15e3UL, 0xa7b24620UL,\r
- 0xbea97761UL, 0xf1e8e1a6UL, 0xe8f3d0e7UL, 0xc3de8324UL, 0xdac5b265UL,\r
- 0x5d5daeaaUL, 0x44469febUL, 0x6f6bcc28UL, 0x7670fd69UL, 0x39316baeUL,\r
- 0x202a5aefUL, 0x0b07092cUL, 0x121c386dUL, 0xdf4636f3UL, 0xc65d07b2UL,\r
- 0xed705471UL, 0xf46b6530UL, 0xbb2af3f7UL, 0xa231c2b6UL, 0x891c9175UL,\r
- 0x9007a034UL, 0x179fbcfbUL, 0x0e848dbaUL, 0x25a9de79UL, 0x3cb2ef38UL,\r
- 0x73f379ffUL, 0x6ae848beUL, 0x41c51b7dUL, 0x58de2a3cUL, 0xf0794f05UL,\r
- 0xe9627e44UL, 0xc24f2d87UL, 0xdb541cc6UL, 0x94158a01UL, 0x8d0ebb40UL,\r
- 0xa623e883UL, 0xbf38d9c2UL, 0x38a0c50dUL, 0x21bbf44cUL, 0x0a96a78fUL,\r
- 0x138d96ceUL, 0x5ccc0009UL, 0x45d73148UL, 0x6efa628bUL, 0x77e153caUL,\r
- 0xbabb5d54UL, 0xa3a06c15UL, 0x888d3fd6UL, 0x91960e97UL, 0xded79850UL,\r
- 0xc7cca911UL, 0xece1fad2UL, 0xf5facb93UL, 0x7262d75cUL, 0x6b79e61dUL,\r
- 0x4054b5deUL, 0x594f849fUL, 0x160e1258UL, 0x0f152319UL, 0x243870daUL,\r
- 0x3d23419bUL, 0x65fd6ba7UL, 0x7ce65ae6UL, 0x57cb0925UL, 0x4ed03864UL,\r
- 0x0191aea3UL, 0x188a9fe2UL, 0x33a7cc21UL, 0x2abcfd60UL, 0xad24e1afUL,\r
- 0xb43fd0eeUL, 0x9f12832dUL, 0x8609b26cUL, 0xc94824abUL, 0xd05315eaUL,\r
- 0xfb7e4629UL, 0xe2657768UL, 0x2f3f79f6UL, 0x362448b7UL, 0x1d091b74UL,\r
- 0x04122a35UL, 0x4b53bcf2UL, 0x52488db3UL, 0x7965de70UL, 0x607eef31UL,\r
- 0xe7e6f3feUL, 0xfefdc2bfUL, 0xd5d0917cUL, 0xcccba03dUL, 0x838a36faUL,\r
- 0x9a9107bbUL, 0xb1bc5478UL, 0xa8a76539UL, 0x3b83984bUL, 0x2298a90aUL,\r
- 0x09b5fac9UL, 0x10aecb88UL, 0x5fef5d4fUL, 0x46f46c0eUL, 0x6dd93fcdUL,\r
- 0x74c20e8cUL, 0xf35a1243UL, 0xea412302UL, 0xc16c70c1UL, 0xd8774180UL,\r
- 0x9736d747UL, 0x8e2de606UL, 0xa500b5c5UL, 0xbc1b8484UL, 0x71418a1aUL,\r
- 0x685abb5bUL, 0x4377e898UL, 0x5a6cd9d9UL, 0x152d4f1eUL, 0x0c367e5fUL,\r
- 0x271b2d9cUL, 0x3e001cddUL, 0xb9980012UL, 0xa0833153UL, 0x8bae6290UL,\r
- 0x92b553d1UL, 0xddf4c516UL, 0xc4eff457UL, 0xefc2a794UL, 0xf6d996d5UL,\r
- 0xae07bce9UL, 0xb71c8da8UL, 0x9c31de6bUL, 0x852aef2aUL, 0xca6b79edUL,\r
- 0xd37048acUL, 0xf85d1b6fUL, 0xe1462a2eUL, 0x66de36e1UL, 0x7fc507a0UL,\r
- 0x54e85463UL, 0x4df36522UL, 0x02b2f3e5UL, 0x1ba9c2a4UL, 0x30849167UL,\r
- 0x299fa026UL, 0xe4c5aeb8UL, 0xfdde9ff9UL, 0xd6f3cc3aUL, 0xcfe8fd7bUL,\r
- 0x80a96bbcUL, 0x99b25afdUL, 0xb29f093eUL, 0xab84387fUL, 0x2c1c24b0UL,\r
- 0x350715f1UL, 0x1e2a4632UL, 0x07317773UL, 0x4870e1b4UL, 0x516bd0f5UL,\r
- 0x7a468336UL, 0x635db277UL, 0xcbfad74eUL, 0xd2e1e60fUL, 0xf9ccb5ccUL,\r
- 0xe0d7848dUL, 0xaf96124aUL, 0xb68d230bUL, 0x9da070c8UL, 0x84bb4189UL,\r
- 0x03235d46UL, 0x1a386c07UL, 0x31153fc4UL, 0x280e0e85UL, 0x674f9842UL,\r
- 0x7e54a903UL, 0x5579fac0UL, 0x4c62cb81UL, 0x8138c51fUL, 0x9823f45eUL,\r
- 0xb30ea79dUL, 0xaa1596dcUL, 0xe554001bUL, 0xfc4f315aUL, 0xd7626299UL,\r
- 0xce7953d8UL, 0x49e14f17UL, 0x50fa7e56UL, 0x7bd72d95UL, 0x62cc1cd4UL,\r
- 0x2d8d8a13UL, 0x3496bb52UL, 0x1fbbe891UL, 0x06a0d9d0UL, 0x5e7ef3ecUL,\r
- 0x4765c2adUL, 0x6c48916eUL, 0x7553a02fUL, 0x3a1236e8UL, 0x230907a9UL,\r
- 0x0824546aUL, 0x113f652bUL, 0x96a779e4UL, 0x8fbc48a5UL, 0xa4911b66UL,\r
- 0xbd8a2a27UL, 0xf2cbbce0UL, 0xebd08da1UL, 0xc0fdde62UL, 0xd9e6ef23UL,\r
- 0x14bce1bdUL, 0x0da7d0fcUL, 0x268a833fUL, 0x3f91b27eUL, 0x70d024b9UL,\r
- 0x69cb15f8UL, 0x42e6463bUL, 0x5bfd777aUL, 0xdc656bb5UL, 0xc57e5af4UL,\r
- 0xee530937UL, 0xf7483876UL, 0xb809aeb1UL, 0xa1129ff0UL, 0x8a3fcc33UL,\r
- 0x9324fd72UL\r
- },\r
- {\r
- 0x00000000UL, 0x01c26a37UL, 0x0384d46eUL, 0x0246be59UL, 0x0709a8dcUL,\r
- 0x06cbc2ebUL, 0x048d7cb2UL, 0x054f1685UL, 0x0e1351b8UL, 0x0fd13b8fUL,\r
- 0x0d9785d6UL, 0x0c55efe1UL, 0x091af964UL, 0x08d89353UL, 0x0a9e2d0aUL,\r
- 0x0b5c473dUL, 0x1c26a370UL, 0x1de4c947UL, 0x1fa2771eUL, 0x1e601d29UL,\r
- 0x1b2f0bacUL, 0x1aed619bUL, 0x18abdfc2UL, 0x1969b5f5UL, 0x1235f2c8UL,\r
- 0x13f798ffUL, 0x11b126a6UL, 0x10734c91UL, 0x153c5a14UL, 0x14fe3023UL,\r
- 0x16b88e7aUL, 0x177ae44dUL, 0x384d46e0UL, 0x398f2cd7UL, 0x3bc9928eUL,\r
- 0x3a0bf8b9UL, 0x3f44ee3cUL, 0x3e86840bUL, 0x3cc03a52UL, 0x3d025065UL,\r
- 0x365e1758UL, 0x379c7d6fUL, 0x35dac336UL, 0x3418a901UL, 0x3157bf84UL,\r
- 0x3095d5b3UL, 0x32d36beaUL, 0x331101ddUL, 0x246be590UL, 0x25a98fa7UL,\r
- 0x27ef31feUL, 0x262d5bc9UL, 0x23624d4cUL, 0x22a0277bUL, 0x20e69922UL,\r
- 0x2124f315UL, 0x2a78b428UL, 0x2bbade1fUL, 0x29fc6046UL, 0x283e0a71UL,\r
- 0x2d711cf4UL, 0x2cb376c3UL, 0x2ef5c89aUL, 0x2f37a2adUL, 0x709a8dc0UL,\r
- 0x7158e7f7UL, 0x731e59aeUL, 0x72dc3399UL, 0x7793251cUL, 0x76514f2bUL,\r
- 0x7417f172UL, 0x75d59b45UL, 0x7e89dc78UL, 0x7f4bb64fUL, 0x7d0d0816UL,\r
- 0x7ccf6221UL, 0x798074a4UL, 0x78421e93UL, 0x7a04a0caUL, 0x7bc6cafdUL,\r
- 0x6cbc2eb0UL, 0x6d7e4487UL, 0x6f38fadeUL, 0x6efa90e9UL, 0x6bb5866cUL,\r
- 0x6a77ec5bUL, 0x68315202UL, 0x69f33835UL, 0x62af7f08UL, 0x636d153fUL,\r
- 0x612bab66UL, 0x60e9c151UL, 0x65a6d7d4UL, 0x6464bde3UL, 0x662203baUL,\r
- 0x67e0698dUL, 0x48d7cb20UL, 0x4915a117UL, 0x4b531f4eUL, 0x4a917579UL,\r
- 0x4fde63fcUL, 0x4e1c09cbUL, 0x4c5ab792UL, 0x4d98dda5UL, 0x46c49a98UL,\r
- 0x4706f0afUL, 0x45404ef6UL, 0x448224c1UL, 0x41cd3244UL, 0x400f5873UL,\r
- 0x4249e62aUL, 0x438b8c1dUL, 0x54f16850UL, 0x55330267UL, 0x5775bc3eUL,\r
- 0x56b7d609UL, 0x53f8c08cUL, 0x523aaabbUL, 0x507c14e2UL, 0x51be7ed5UL,\r
- 0x5ae239e8UL, 0x5b2053dfUL, 0x5966ed86UL, 0x58a487b1UL, 0x5deb9134UL,\r
- 0x5c29fb03UL, 0x5e6f455aUL, 0x5fad2f6dUL, 0xe1351b80UL, 0xe0f771b7UL,\r
- 0xe2b1cfeeUL, 0xe373a5d9UL, 0xe63cb35cUL, 0xe7fed96bUL, 0xe5b86732UL,\r
- 0xe47a0d05UL, 0xef264a38UL, 0xeee4200fUL, 0xeca29e56UL, 0xed60f461UL,\r
- 0xe82fe2e4UL, 0xe9ed88d3UL, 0xebab368aUL, 0xea695cbdUL, 0xfd13b8f0UL,\r
- 0xfcd1d2c7UL, 0xfe976c9eUL, 0xff5506a9UL, 0xfa1a102cUL, 0xfbd87a1bUL,\r
- 0xf99ec442UL, 0xf85cae75UL, 0xf300e948UL, 0xf2c2837fUL, 0xf0843d26UL,\r
- 0xf1465711UL, 0xf4094194UL, 0xf5cb2ba3UL, 0xf78d95faUL, 0xf64fffcdUL,\r
- 0xd9785d60UL, 0xd8ba3757UL, 0xdafc890eUL, 0xdb3ee339UL, 0xde71f5bcUL,\r
- 0xdfb39f8bUL, 0xddf521d2UL, 0xdc374be5UL, 0xd76b0cd8UL, 0xd6a966efUL,\r
- 0xd4efd8b6UL, 0xd52db281UL, 0xd062a404UL, 0xd1a0ce33UL, 0xd3e6706aUL,\r
- 0xd2241a5dUL, 0xc55efe10UL, 0xc49c9427UL, 0xc6da2a7eUL, 0xc7184049UL,\r
- 0xc25756ccUL, 0xc3953cfbUL, 0xc1d382a2UL, 0xc011e895UL, 0xcb4dafa8UL,\r
- 0xca8fc59fUL, 0xc8c97bc6UL, 0xc90b11f1UL, 0xcc440774UL, 0xcd866d43UL,\r
- 0xcfc0d31aUL, 0xce02b92dUL, 0x91af9640UL, 0x906dfc77UL, 0x922b422eUL,\r
- 0x93e92819UL, 0x96a63e9cUL, 0x976454abUL, 0x9522eaf2UL, 0x94e080c5UL,\r
- 0x9fbcc7f8UL, 0x9e7eadcfUL, 0x9c381396UL, 0x9dfa79a1UL, 0x98b56f24UL,\r
- 0x99770513UL, 0x9b31bb4aUL, 0x9af3d17dUL, 0x8d893530UL, 0x8c4b5f07UL,\r
- 0x8e0de15eUL, 0x8fcf8b69UL, 0x8a809decUL, 0x8b42f7dbUL, 0x89044982UL,\r
- 0x88c623b5UL, 0x839a6488UL, 0x82580ebfUL, 0x801eb0e6UL, 0x81dcdad1UL,\r
- 0x8493cc54UL, 0x8551a663UL, 0x8717183aUL, 0x86d5720dUL, 0xa9e2d0a0UL,\r
- 0xa820ba97UL, 0xaa6604ceUL, 0xaba46ef9UL, 0xaeeb787cUL, 0xaf29124bUL,\r
- 0xad6fac12UL, 0xacadc625UL, 0xa7f18118UL, 0xa633eb2fUL, 0xa4755576UL,\r
- 0xa5b73f41UL, 0xa0f829c4UL, 0xa13a43f3UL, 0xa37cfdaaUL, 0xa2be979dUL,\r
- 0xb5c473d0UL, 0xb40619e7UL, 0xb640a7beUL, 0xb782cd89UL, 0xb2cddb0cUL,\r
- 0xb30fb13bUL, 0xb1490f62UL, 0xb08b6555UL, 0xbbd72268UL, 0xba15485fUL,\r
- 0xb853f606UL, 0xb9919c31UL, 0xbcde8ab4UL, 0xbd1ce083UL, 0xbf5a5edaUL,\r
- 0xbe9834edUL\r
- },\r
- {\r
- 0x00000000UL, 0xb8bc6765UL, 0xaa09c88bUL, 0x12b5afeeUL, 0x8f629757UL,\r
- 0x37def032UL, 0x256b5fdcUL, 0x9dd738b9UL, 0xc5b428efUL, 0x7d084f8aUL,\r
- 0x6fbde064UL, 0xd7018701UL, 0x4ad6bfb8UL, 0xf26ad8ddUL, 0xe0df7733UL,\r
- 0x58631056UL, 0x5019579fUL, 0xe8a530faUL, 0xfa109f14UL, 0x42acf871UL,\r
- 0xdf7bc0c8UL, 0x67c7a7adUL, 0x75720843UL, 0xcdce6f26UL, 0x95ad7f70UL,\r
- 0x2d111815UL, 0x3fa4b7fbUL, 0x8718d09eUL, 0x1acfe827UL, 0xa2738f42UL,\r
- 0xb0c620acUL, 0x087a47c9UL, 0xa032af3eUL, 0x188ec85bUL, 0x0a3b67b5UL,\r
- 0xb28700d0UL, 0x2f503869UL, 0x97ec5f0cUL, 0x8559f0e2UL, 0x3de59787UL,\r
- 0x658687d1UL, 0xdd3ae0b4UL, 0xcf8f4f5aUL, 0x7733283fUL, 0xeae41086UL,\r
- 0x525877e3UL, 0x40edd80dUL, 0xf851bf68UL, 0xf02bf8a1UL, 0x48979fc4UL,\r
- 0x5a22302aUL, 0xe29e574fUL, 0x7f496ff6UL, 0xc7f50893UL, 0xd540a77dUL,\r
- 0x6dfcc018UL, 0x359fd04eUL, 0x8d23b72bUL, 0x9f9618c5UL, 0x272a7fa0UL,\r
- 0xbafd4719UL, 0x0241207cUL, 0x10f48f92UL, 0xa848e8f7UL, 0x9b14583dUL,\r
- 0x23a83f58UL, 0x311d90b6UL, 0x89a1f7d3UL, 0x1476cf6aUL, 0xaccaa80fUL,\r
- 0xbe7f07e1UL, 0x06c36084UL, 0x5ea070d2UL, 0xe61c17b7UL, 0xf4a9b859UL,\r
- 0x4c15df3cUL, 0xd1c2e785UL, 0x697e80e0UL, 0x7bcb2f0eUL, 0xc377486bUL,\r
- 0xcb0d0fa2UL, 0x73b168c7UL, 0x6104c729UL, 0xd9b8a04cUL, 0x446f98f5UL,\r
- 0xfcd3ff90UL, 0xee66507eUL, 0x56da371bUL, 0x0eb9274dUL, 0xb6054028UL,\r
- 0xa4b0efc6UL, 0x1c0c88a3UL, 0x81dbb01aUL, 0x3967d77fUL, 0x2bd27891UL,\r
- 0x936e1ff4UL, 0x3b26f703UL, 0x839a9066UL, 0x912f3f88UL, 0x299358edUL,\r
- 0xb4446054UL, 0x0cf80731UL, 0x1e4da8dfUL, 0xa6f1cfbaUL, 0xfe92dfecUL,\r
- 0x462eb889UL, 0x549b1767UL, 0xec277002UL, 0x71f048bbUL, 0xc94c2fdeUL,\r
- 0xdbf98030UL, 0x6345e755UL, 0x6b3fa09cUL, 0xd383c7f9UL, 0xc1366817UL,\r
- 0x798a0f72UL, 0xe45d37cbUL, 0x5ce150aeUL, 0x4e54ff40UL, 0xf6e89825UL,\r
- 0xae8b8873UL, 0x1637ef16UL, 0x048240f8UL, 0xbc3e279dUL, 0x21e91f24UL,\r
- 0x99557841UL, 0x8be0d7afUL, 0x335cb0caUL, 0xed59b63bUL, 0x55e5d15eUL,\r
- 0x47507eb0UL, 0xffec19d5UL, 0x623b216cUL, 0xda874609UL, 0xc832e9e7UL,\r
- 0x708e8e82UL, 0x28ed9ed4UL, 0x9051f9b1UL, 0x82e4565fUL, 0x3a58313aUL,\r
- 0xa78f0983UL, 0x1f336ee6UL, 0x0d86c108UL, 0xb53aa66dUL, 0xbd40e1a4UL,\r
- 0x05fc86c1UL, 0x1749292fUL, 0xaff54e4aUL, 0x322276f3UL, 0x8a9e1196UL,\r
- 0x982bbe78UL, 0x2097d91dUL, 0x78f4c94bUL, 0xc048ae2eUL, 0xd2fd01c0UL,\r
- 0x6a4166a5UL, 0xf7965e1cUL, 0x4f2a3979UL, 0x5d9f9697UL, 0xe523f1f2UL,\r
- 0x4d6b1905UL, 0xf5d77e60UL, 0xe762d18eUL, 0x5fdeb6ebUL, 0xc2098e52UL,\r
- 0x7ab5e937UL, 0x680046d9UL, 0xd0bc21bcUL, 0x88df31eaUL, 0x3063568fUL,\r
- 0x22d6f961UL, 0x9a6a9e04UL, 0x07bda6bdUL, 0xbf01c1d8UL, 0xadb46e36UL,\r
- 0x15080953UL, 0x1d724e9aUL, 0xa5ce29ffUL, 0xb77b8611UL, 0x0fc7e174UL,\r
- 0x9210d9cdUL, 0x2aacbea8UL, 0x38191146UL, 0x80a57623UL, 0xd8c66675UL,\r
- 0x607a0110UL, 0x72cfaefeUL, 0xca73c99bUL, 0x57a4f122UL, 0xef189647UL,\r
- 0xfdad39a9UL, 0x45115eccUL, 0x764dee06UL, 0xcef18963UL, 0xdc44268dUL,\r
- 0x64f841e8UL, 0xf92f7951UL, 0x41931e34UL, 0x5326b1daUL, 0xeb9ad6bfUL,\r
- 0xb3f9c6e9UL, 0x0b45a18cUL, 0x19f00e62UL, 0xa14c6907UL, 0x3c9b51beUL,\r
- 0x842736dbUL, 0x96929935UL, 0x2e2efe50UL, 0x2654b999UL, 0x9ee8defcUL,\r
- 0x8c5d7112UL, 0x34e11677UL, 0xa9362eceUL, 0x118a49abUL, 0x033fe645UL,\r
- 0xbb838120UL, 0xe3e09176UL, 0x5b5cf613UL, 0x49e959fdUL, 0xf1553e98UL,\r
- 0x6c820621UL, 0xd43e6144UL, 0xc68bceaaUL, 0x7e37a9cfUL, 0xd67f4138UL,\r
- 0x6ec3265dUL, 0x7c7689b3UL, 0xc4caeed6UL, 0x591dd66fUL, 0xe1a1b10aUL,\r
- 0xf3141ee4UL, 0x4ba87981UL, 0x13cb69d7UL, 0xab770eb2UL, 0xb9c2a15cUL,\r
- 0x017ec639UL, 0x9ca9fe80UL, 0x241599e5UL, 0x36a0360bUL, 0x8e1c516eUL,\r
- 0x866616a7UL, 0x3eda71c2UL, 0x2c6fde2cUL, 0x94d3b949UL, 0x090481f0UL,\r
- 0xb1b8e695UL, 0xa30d497bUL, 0x1bb12e1eUL, 0x43d23e48UL, 0xfb6e592dUL,\r
- 0xe9dbf6c3UL, 0x516791a6UL, 0xccb0a91fUL, 0x740cce7aUL, 0x66b96194UL,\r
- 0xde0506f1UL\r
- },\r
- {\r
- 0x00000000UL, 0x96300777UL, 0x2c610eeeUL, 0xba510999UL, 0x19c46d07UL,\r
- 0x8ff46a70UL, 0x35a563e9UL, 0xa395649eUL, 0x3288db0eUL, 0xa4b8dc79UL,\r
- 0x1ee9d5e0UL, 0x88d9d297UL, 0x2b4cb609UL, 0xbd7cb17eUL, 0x072db8e7UL,\r
- 0x911dbf90UL, 0x6410b71dUL, 0xf220b06aUL, 0x4871b9f3UL, 0xde41be84UL,\r
- 0x7dd4da1aUL, 0xebe4dd6dUL, 0x51b5d4f4UL, 0xc785d383UL, 0x56986c13UL,\r
- 0xc0a86b64UL, 0x7af962fdUL, 0xecc9658aUL, 0x4f5c0114UL, 0xd96c0663UL,\r
- 0x633d0ffaUL, 0xf50d088dUL, 0xc8206e3bUL, 0x5e10694cUL, 0xe44160d5UL,\r
- 0x727167a2UL, 0xd1e4033cUL, 0x47d4044bUL, 0xfd850dd2UL, 0x6bb50aa5UL,\r
- 0xfaa8b535UL, 0x6c98b242UL, 0xd6c9bbdbUL, 0x40f9bcacUL, 0xe36cd832UL,\r
- 0x755cdf45UL, 0xcf0dd6dcUL, 0x593dd1abUL, 0xac30d926UL, 0x3a00de51UL,\r
- 0x8051d7c8UL, 0x1661d0bfUL, 0xb5f4b421UL, 0x23c4b356UL, 0x9995bacfUL,\r
- 0x0fa5bdb8UL, 0x9eb80228UL, 0x0888055fUL, 0xb2d90cc6UL, 0x24e90bb1UL,\r
- 0x877c6f2fUL, 0x114c6858UL, 0xab1d61c1UL, 0x3d2d66b6UL, 0x9041dc76UL,\r
- 0x0671db01UL, 0xbc20d298UL, 0x2a10d5efUL, 0x8985b171UL, 0x1fb5b606UL,\r
- 0xa5e4bf9fUL, 0x33d4b8e8UL, 0xa2c90778UL, 0x34f9000fUL, 0x8ea80996UL,\r
- 0x18980ee1UL, 0xbb0d6a7fUL, 0x2d3d6d08UL, 0x976c6491UL, 0x015c63e6UL,\r
- 0xf4516b6bUL, 0x62616c1cUL, 0xd8306585UL, 0x4e0062f2UL, 0xed95066cUL,\r
- 0x7ba5011bUL, 0xc1f40882UL, 0x57c40ff5UL, 0xc6d9b065UL, 0x50e9b712UL,\r
- 0xeab8be8bUL, 0x7c88b9fcUL, 0xdf1ddd62UL, 0x492dda15UL, 0xf37cd38cUL,\r
- 0x654cd4fbUL, 0x5861b24dUL, 0xce51b53aUL, 0x7400bca3UL, 0xe230bbd4UL,\r
- 0x41a5df4aUL, 0xd795d83dUL, 0x6dc4d1a4UL, 0xfbf4d6d3UL, 0x6ae96943UL,\r
- 0xfcd96e34UL, 0x468867adUL, 0xd0b860daUL, 0x732d0444UL, 0xe51d0333UL,\r
- 0x5f4c0aaaUL, 0xc97c0dddUL, 0x3c710550UL, 0xaa410227UL, 0x10100bbeUL,\r
- 0x86200cc9UL, 0x25b56857UL, 0xb3856f20UL, 0x09d466b9UL, 0x9fe461ceUL,\r
- 0x0ef9de5eUL, 0x98c9d929UL, 0x2298d0b0UL, 0xb4a8d7c7UL, 0x173db359UL,\r
- 0x810db42eUL, 0x3b5cbdb7UL, 0xad6cbac0UL, 0x2083b8edUL, 0xb6b3bf9aUL,\r
- 0x0ce2b603UL, 0x9ad2b174UL, 0x3947d5eaUL, 0xaf77d29dUL, 0x1526db04UL,\r
- 0x8316dc73UL, 0x120b63e3UL, 0x843b6494UL, 0x3e6a6d0dUL, 0xa85a6a7aUL,\r
- 0x0bcf0ee4UL, 0x9dff0993UL, 0x27ae000aUL, 0xb19e077dUL, 0x44930ff0UL,\r
- 0xd2a30887UL, 0x68f2011eUL, 0xfec20669UL, 0x5d5762f7UL, 0xcb676580UL,\r
- 0x71366c19UL, 0xe7066b6eUL, 0x761bd4feUL, 0xe02bd389UL, 0x5a7ada10UL,\r
- 0xcc4add67UL, 0x6fdfb9f9UL, 0xf9efbe8eUL, 0x43beb717UL, 0xd58eb060UL,\r
- 0xe8a3d6d6UL, 0x7e93d1a1UL, 0xc4c2d838UL, 0x52f2df4fUL, 0xf167bbd1UL,\r
- 0x6757bca6UL, 0xdd06b53fUL, 0x4b36b248UL, 0xda2b0dd8UL, 0x4c1b0aafUL,\r
- 0xf64a0336UL, 0x607a0441UL, 0xc3ef60dfUL, 0x55df67a8UL, 0xef8e6e31UL,\r
- 0x79be6946UL, 0x8cb361cbUL, 0x1a8366bcUL, 0xa0d26f25UL, 0x36e26852UL,\r
- 0x95770cccUL, 0x03470bbbUL, 0xb9160222UL, 0x2f260555UL, 0xbe3bbac5UL,\r
- 0x280bbdb2UL, 0x925ab42bUL, 0x046ab35cUL, 0xa7ffd7c2UL, 0x31cfd0b5UL,\r
- 0x8b9ed92cUL, 0x1daede5bUL, 0xb0c2649bUL, 0x26f263ecUL, 0x9ca36a75UL,\r
- 0x0a936d02UL, 0xa906099cUL, 0x3f360eebUL, 0x85670772UL, 0x13570005UL,\r
- 0x824abf95UL, 0x147ab8e2UL, 0xae2bb17bUL, 0x381bb60cUL, 0x9b8ed292UL,\r
- 0x0dbed5e5UL, 0xb7efdc7cUL, 0x21dfdb0bUL, 0xd4d2d386UL, 0x42e2d4f1UL,\r
- 0xf8b3dd68UL, 0x6e83da1fUL, 0xcd16be81UL, 0x5b26b9f6UL, 0xe177b06fUL,\r
- 0x7747b718UL, 0xe65a0888UL, 0x706a0fffUL, 0xca3b0666UL, 0x5c0b0111UL,\r
- 0xff9e658fUL, 0x69ae62f8UL, 0xd3ff6b61UL, 0x45cf6c16UL, 0x78e20aa0UL,\r
- 0xeed20dd7UL, 0x5483044eUL, 0xc2b30339UL, 0x612667a7UL, 0xf71660d0UL,\r
- 0x4d476949UL, 0xdb776e3eUL, 0x4a6ad1aeUL, 0xdc5ad6d9UL, 0x660bdf40UL,\r
- 0xf03bd837UL, 0x53aebca9UL, 0xc59ebbdeUL, 0x7fcfb247UL, 0xe9ffb530UL,\r
- 0x1cf2bdbdUL, 0x8ac2bacaUL, 0x3093b353UL, 0xa6a3b424UL, 0x0536d0baUL,\r
- 0x9306d7cdUL, 0x2957de54UL, 0xbf67d923UL, 0x2e7a66b3UL, 0xb84a61c4UL,\r
- 0x021b685dUL, 0x942b6f2aUL, 0x37be0bb4UL, 0xa18e0cc3UL, 0x1bdf055aUL,\r
- 0x8def022dUL\r
- },\r
- {\r
- 0x00000000UL, 0x41311b19UL, 0x82623632UL, 0xc3532d2bUL, 0x04c56c64UL,\r
- 0x45f4777dUL, 0x86a75a56UL, 0xc796414fUL, 0x088ad9c8UL, 0x49bbc2d1UL,\r
- 0x8ae8effaUL, 0xcbd9f4e3UL, 0x0c4fb5acUL, 0x4d7eaeb5UL, 0x8e2d839eUL,\r
- 0xcf1c9887UL, 0x5112c24aUL, 0x1023d953UL, 0xd370f478UL, 0x9241ef61UL,\r
- 0x55d7ae2eUL, 0x14e6b537UL, 0xd7b5981cUL, 0x96848305UL, 0x59981b82UL,\r
- 0x18a9009bUL, 0xdbfa2db0UL, 0x9acb36a9UL, 0x5d5d77e6UL, 0x1c6c6cffUL,\r
- 0xdf3f41d4UL, 0x9e0e5acdUL, 0xa2248495UL, 0xe3159f8cUL, 0x2046b2a7UL,\r
- 0x6177a9beUL, 0xa6e1e8f1UL, 0xe7d0f3e8UL, 0x2483dec3UL, 0x65b2c5daUL,\r
- 0xaaae5d5dUL, 0xeb9f4644UL, 0x28cc6b6fUL, 0x69fd7076UL, 0xae6b3139UL,\r
- 0xef5a2a20UL, 0x2c09070bUL, 0x6d381c12UL, 0xf33646dfUL, 0xb2075dc6UL,\r
- 0x715470edUL, 0x30656bf4UL, 0xf7f32abbUL, 0xb6c231a2UL, 0x75911c89UL,\r
- 0x34a00790UL, 0xfbbc9f17UL, 0xba8d840eUL, 0x79dea925UL, 0x38efb23cUL,\r
- 0xff79f373UL, 0xbe48e86aUL, 0x7d1bc541UL, 0x3c2ade58UL, 0x054f79f0UL,\r
- 0x447e62e9UL, 0x872d4fc2UL, 0xc61c54dbUL, 0x018a1594UL, 0x40bb0e8dUL,\r
- 0x83e823a6UL, 0xc2d938bfUL, 0x0dc5a038UL, 0x4cf4bb21UL, 0x8fa7960aUL,\r
- 0xce968d13UL, 0x0900cc5cUL, 0x4831d745UL, 0x8b62fa6eUL, 0xca53e177UL,\r
- 0x545dbbbaUL, 0x156ca0a3UL, 0xd63f8d88UL, 0x970e9691UL, 0x5098d7deUL,\r
- 0x11a9ccc7UL, 0xd2fae1ecUL, 0x93cbfaf5UL, 0x5cd76272UL, 0x1de6796bUL,\r
- 0xdeb55440UL, 0x9f844f59UL, 0x58120e16UL, 0x1923150fUL, 0xda703824UL,\r
- 0x9b41233dUL, 0xa76bfd65UL, 0xe65ae67cUL, 0x2509cb57UL, 0x6438d04eUL,\r
- 0xa3ae9101UL, 0xe29f8a18UL, 0x21cca733UL, 0x60fdbc2aUL, 0xafe124adUL,\r
- 0xeed03fb4UL, 0x2d83129fUL, 0x6cb20986UL, 0xab2448c9UL, 0xea1553d0UL,\r
- 0x29467efbUL, 0x687765e2UL, 0xf6793f2fUL, 0xb7482436UL, 0x741b091dUL,\r
- 0x352a1204UL, 0xf2bc534bUL, 0xb38d4852UL, 0x70de6579UL, 0x31ef7e60UL,\r
- 0xfef3e6e7UL, 0xbfc2fdfeUL, 0x7c91d0d5UL, 0x3da0cbccUL, 0xfa368a83UL,\r
- 0xbb07919aUL, 0x7854bcb1UL, 0x3965a7a8UL, 0x4b98833bUL, 0x0aa99822UL,\r
- 0xc9fab509UL, 0x88cbae10UL, 0x4f5def5fUL, 0x0e6cf446UL, 0xcd3fd96dUL,\r
- 0x8c0ec274UL, 0x43125af3UL, 0x022341eaUL, 0xc1706cc1UL, 0x804177d8UL,\r
- 0x47d73697UL, 0x06e62d8eUL, 0xc5b500a5UL, 0x84841bbcUL, 0x1a8a4171UL,\r
- 0x5bbb5a68UL, 0x98e87743UL, 0xd9d96c5aUL, 0x1e4f2d15UL, 0x5f7e360cUL,\r
- 0x9c2d1b27UL, 0xdd1c003eUL, 0x120098b9UL, 0x533183a0UL, 0x9062ae8bUL,\r
- 0xd153b592UL, 0x16c5f4ddUL, 0x57f4efc4UL, 0x94a7c2efUL, 0xd596d9f6UL,\r
- 0xe9bc07aeUL, 0xa88d1cb7UL, 0x6bde319cUL, 0x2aef2a85UL, 0xed796bcaUL,\r
- 0xac4870d3UL, 0x6f1b5df8UL, 0x2e2a46e1UL, 0xe136de66UL, 0xa007c57fUL,\r
- 0x6354e854UL, 0x2265f34dUL, 0xe5f3b202UL, 0xa4c2a91bUL, 0x67918430UL,\r
- 0x26a09f29UL, 0xb8aec5e4UL, 0xf99fdefdUL, 0x3accf3d6UL, 0x7bfde8cfUL,\r
- 0xbc6ba980UL, 0xfd5ab299UL, 0x3e099fb2UL, 0x7f3884abUL, 0xb0241c2cUL,\r
- 0xf1150735UL, 0x32462a1eUL, 0x73773107UL, 0xb4e17048UL, 0xf5d06b51UL,\r
- 0x3683467aUL, 0x77b25d63UL, 0x4ed7facbUL, 0x0fe6e1d2UL, 0xccb5ccf9UL,\r
- 0x8d84d7e0UL, 0x4a1296afUL, 0x0b238db6UL, 0xc870a09dUL, 0x8941bb84UL,\r
- 0x465d2303UL, 0x076c381aUL, 0xc43f1531UL, 0x850e0e28UL, 0x42984f67UL,\r
- 0x03a9547eUL, 0xc0fa7955UL, 0x81cb624cUL, 0x1fc53881UL, 0x5ef42398UL,\r
- 0x9da70eb3UL, 0xdc9615aaUL, 0x1b0054e5UL, 0x5a314ffcUL, 0x996262d7UL,\r
- 0xd85379ceUL, 0x174fe149UL, 0x567efa50UL, 0x952dd77bUL, 0xd41ccc62UL,\r
- 0x138a8d2dUL, 0x52bb9634UL, 0x91e8bb1fUL, 0xd0d9a006UL, 0xecf37e5eUL,\r
- 0xadc26547UL, 0x6e91486cUL, 0x2fa05375UL, 0xe836123aUL, 0xa9070923UL,\r
- 0x6a542408UL, 0x2b653f11UL, 0xe479a796UL, 0xa548bc8fUL, 0x661b91a4UL,\r
- 0x272a8abdUL, 0xe0bccbf2UL, 0xa18dd0ebUL, 0x62defdc0UL, 0x23efe6d9UL,\r
- 0xbde1bc14UL, 0xfcd0a70dUL, 0x3f838a26UL, 0x7eb2913fUL, 0xb924d070UL,\r
- 0xf815cb69UL, 0x3b46e642UL, 0x7a77fd5bUL, 0xb56b65dcUL, 0xf45a7ec5UL,\r
- 0x370953eeUL, 0x763848f7UL, 0xb1ae09b8UL, 0xf09f12a1UL, 0x33cc3f8aUL,\r
- 0x72fd2493UL\r
- },\r
- {\r
- 0x00000000UL, 0x376ac201UL, 0x6ed48403UL, 0x59be4602UL, 0xdca80907UL,\r
- 0xebc2cb06UL, 0xb27c8d04UL, 0x85164f05UL, 0xb851130eUL, 0x8f3bd10fUL,\r
- 0xd685970dUL, 0xe1ef550cUL, 0x64f91a09UL, 0x5393d808UL, 0x0a2d9e0aUL,\r
- 0x3d475c0bUL, 0x70a3261cUL, 0x47c9e41dUL, 0x1e77a21fUL, 0x291d601eUL,\r
- 0xac0b2f1bUL, 0x9b61ed1aUL, 0xc2dfab18UL, 0xf5b56919UL, 0xc8f23512UL,\r
- 0xff98f713UL, 0xa626b111UL, 0x914c7310UL, 0x145a3c15UL, 0x2330fe14UL,\r
- 0x7a8eb816UL, 0x4de47a17UL, 0xe0464d38UL, 0xd72c8f39UL, 0x8e92c93bUL,\r
- 0xb9f80b3aUL, 0x3cee443fUL, 0x0b84863eUL, 0x523ac03cUL, 0x6550023dUL,\r
- 0x58175e36UL, 0x6f7d9c37UL, 0x36c3da35UL, 0x01a91834UL, 0x84bf5731UL,\r
- 0xb3d59530UL, 0xea6bd332UL, 0xdd011133UL, 0x90e56b24UL, 0xa78fa925UL,\r
- 0xfe31ef27UL, 0xc95b2d26UL, 0x4c4d6223UL, 0x7b27a022UL, 0x2299e620UL,\r
- 0x15f32421UL, 0x28b4782aUL, 0x1fdeba2bUL, 0x4660fc29UL, 0x710a3e28UL,\r
- 0xf41c712dUL, 0xc376b32cUL, 0x9ac8f52eUL, 0xada2372fUL, 0xc08d9a70UL,\r
- 0xf7e75871UL, 0xae591e73UL, 0x9933dc72UL, 0x1c259377UL, 0x2b4f5176UL,\r
- 0x72f11774UL, 0x459bd575UL, 0x78dc897eUL, 0x4fb64b7fUL, 0x16080d7dUL,\r
- 0x2162cf7cUL, 0xa4748079UL, 0x931e4278UL, 0xcaa0047aUL, 0xfdcac67bUL,\r
- 0xb02ebc6cUL, 0x87447e6dUL, 0xdefa386fUL, 0xe990fa6eUL, 0x6c86b56bUL,\r
- 0x5bec776aUL, 0x02523168UL, 0x3538f369UL, 0x087faf62UL, 0x3f156d63UL,\r
- 0x66ab2b61UL, 0x51c1e960UL, 0xd4d7a665UL, 0xe3bd6464UL, 0xba032266UL,\r
- 0x8d69e067UL, 0x20cbd748UL, 0x17a11549UL, 0x4e1f534bUL, 0x7975914aUL,\r
- 0xfc63de4fUL, 0xcb091c4eUL, 0x92b75a4cUL, 0xa5dd984dUL, 0x989ac446UL,\r
- 0xaff00647UL, 0xf64e4045UL, 0xc1248244UL, 0x4432cd41UL, 0x73580f40UL,\r
- 0x2ae64942UL, 0x1d8c8b43UL, 0x5068f154UL, 0x67023355UL, 0x3ebc7557UL,\r
- 0x09d6b756UL, 0x8cc0f853UL, 0xbbaa3a52UL, 0xe2147c50UL, 0xd57ebe51UL,\r
- 0xe839e25aUL, 0xdf53205bUL, 0x86ed6659UL, 0xb187a458UL, 0x3491eb5dUL,\r
- 0x03fb295cUL, 0x5a456f5eUL, 0x6d2fad5fUL, 0x801b35e1UL, 0xb771f7e0UL,\r
- 0xeecfb1e2UL, 0xd9a573e3UL, 0x5cb33ce6UL, 0x6bd9fee7UL, 0x3267b8e5UL,\r
- 0x050d7ae4UL, 0x384a26efUL, 0x0f20e4eeUL, 0x569ea2ecUL, 0x61f460edUL,\r
- 0xe4e22fe8UL, 0xd388ede9UL, 0x8a36abebUL, 0xbd5c69eaUL, 0xf0b813fdUL,\r
- 0xc7d2d1fcUL, 0x9e6c97feUL, 0xa90655ffUL, 0x2c101afaUL, 0x1b7ad8fbUL,\r
- 0x42c49ef9UL, 0x75ae5cf8UL, 0x48e900f3UL, 0x7f83c2f2UL, 0x263d84f0UL,\r
- 0x115746f1UL, 0x944109f4UL, 0xa32bcbf5UL, 0xfa958df7UL, 0xcdff4ff6UL,\r
- 0x605d78d9UL, 0x5737bad8UL, 0x0e89fcdaUL, 0x39e33edbUL, 0xbcf571deUL,\r
- 0x8b9fb3dfUL, 0xd221f5ddUL, 0xe54b37dcUL, 0xd80c6bd7UL, 0xef66a9d6UL,\r
- 0xb6d8efd4UL, 0x81b22dd5UL, 0x04a462d0UL, 0x33cea0d1UL, 0x6a70e6d3UL,\r
- 0x5d1a24d2UL, 0x10fe5ec5UL, 0x27949cc4UL, 0x7e2adac6UL, 0x494018c7UL,\r
- 0xcc5657c2UL, 0xfb3c95c3UL, 0xa282d3c1UL, 0x95e811c0UL, 0xa8af4dcbUL,\r
- 0x9fc58fcaUL, 0xc67bc9c8UL, 0xf1110bc9UL, 0x740744ccUL, 0x436d86cdUL,\r
- 0x1ad3c0cfUL, 0x2db902ceUL, 0x4096af91UL, 0x77fc6d90UL, 0x2e422b92UL,\r
- 0x1928e993UL, 0x9c3ea696UL, 0xab546497UL, 0xf2ea2295UL, 0xc580e094UL,\r
- 0xf8c7bc9fUL, 0xcfad7e9eUL, 0x9613389cUL, 0xa179fa9dUL, 0x246fb598UL,\r
- 0x13057799UL, 0x4abb319bUL, 0x7dd1f39aUL, 0x3035898dUL, 0x075f4b8cUL,\r
- 0x5ee10d8eUL, 0x698bcf8fUL, 0xec9d808aUL, 0xdbf7428bUL, 0x82490489UL,\r
- 0xb523c688UL, 0x88649a83UL, 0xbf0e5882UL, 0xe6b01e80UL, 0xd1dadc81UL,\r
- 0x54cc9384UL, 0x63a65185UL, 0x3a181787UL, 0x0d72d586UL, 0xa0d0e2a9UL,\r
- 0x97ba20a8UL, 0xce0466aaUL, 0xf96ea4abUL, 0x7c78ebaeUL, 0x4b1229afUL,\r
- 0x12ac6fadUL, 0x25c6adacUL, 0x1881f1a7UL, 0x2feb33a6UL, 0x765575a4UL,\r
- 0x413fb7a5UL, 0xc429f8a0UL, 0xf3433aa1UL, 0xaafd7ca3UL, 0x9d97bea2UL,\r
- 0xd073c4b5UL, 0xe71906b4UL, 0xbea740b6UL, 0x89cd82b7UL, 0x0cdbcdb2UL,\r
- 0x3bb10fb3UL, 0x620f49b1UL, 0x55658bb0UL, 0x6822d7bbUL, 0x5f4815baUL,\r
- 0x06f653b8UL, 0x319c91b9UL, 0xb48adebcUL, 0x83e01cbdUL, 0xda5e5abfUL,\r
- 0xed3498beUL\r
- },\r
- {\r
- 0x00000000UL, 0x6567bcb8UL, 0x8bc809aaUL, 0xeeafb512UL, 0x5797628fUL,\r
- 0x32f0de37UL, 0xdc5f6b25UL, 0xb938d79dUL, 0xef28b4c5UL, 0x8a4f087dUL,\r
- 0x64e0bd6fUL, 0x018701d7UL, 0xb8bfd64aUL, 0xddd86af2UL, 0x3377dfe0UL,\r
- 0x56106358UL, 0x9f571950UL, 0xfa30a5e8UL, 0x149f10faUL, 0x71f8ac42UL,\r
- 0xc8c07bdfUL, 0xada7c767UL, 0x43087275UL, 0x266fcecdUL, 0x707fad95UL,\r
- 0x1518112dUL, 0xfbb7a43fUL, 0x9ed01887UL, 0x27e8cf1aUL, 0x428f73a2UL,\r
- 0xac20c6b0UL, 0xc9477a08UL, 0x3eaf32a0UL, 0x5bc88e18UL, 0xb5673b0aUL,\r
- 0xd00087b2UL, 0x6938502fUL, 0x0c5fec97UL, 0xe2f05985UL, 0x8797e53dUL,\r
- 0xd1878665UL, 0xb4e03addUL, 0x5a4f8fcfUL, 0x3f283377UL, 0x8610e4eaUL,\r
- 0xe3775852UL, 0x0dd8ed40UL, 0x68bf51f8UL, 0xa1f82bf0UL, 0xc49f9748UL,\r
- 0x2a30225aUL, 0x4f579ee2UL, 0xf66f497fUL, 0x9308f5c7UL, 0x7da740d5UL,\r
- 0x18c0fc6dUL, 0x4ed09f35UL, 0x2bb7238dUL, 0xc518969fUL, 0xa07f2a27UL,\r
- 0x1947fdbaUL, 0x7c204102UL, 0x928ff410UL, 0xf7e848a8UL, 0x3d58149bUL,\r
- 0x583fa823UL, 0xb6901d31UL, 0xd3f7a189UL, 0x6acf7614UL, 0x0fa8caacUL,\r
- 0xe1077fbeUL, 0x8460c306UL, 0xd270a05eUL, 0xb7171ce6UL, 0x59b8a9f4UL,\r
- 0x3cdf154cUL, 0x85e7c2d1UL, 0xe0807e69UL, 0x0e2fcb7bUL, 0x6b4877c3UL,\r
- 0xa20f0dcbUL, 0xc768b173UL, 0x29c70461UL, 0x4ca0b8d9UL, 0xf5986f44UL,\r
- 0x90ffd3fcUL, 0x7e5066eeUL, 0x1b37da56UL, 0x4d27b90eUL, 0x284005b6UL,\r
- 0xc6efb0a4UL, 0xa3880c1cUL, 0x1ab0db81UL, 0x7fd76739UL, 0x9178d22bUL,\r
- 0xf41f6e93UL, 0x03f7263bUL, 0x66909a83UL, 0x883f2f91UL, 0xed589329UL,\r
- 0x546044b4UL, 0x3107f80cUL, 0xdfa84d1eUL, 0xbacff1a6UL, 0xecdf92feUL,\r
- 0x89b82e46UL, 0x67179b54UL, 0x027027ecUL, 0xbb48f071UL, 0xde2f4cc9UL,\r
- 0x3080f9dbUL, 0x55e74563UL, 0x9ca03f6bUL, 0xf9c783d3UL, 0x176836c1UL,\r
- 0x720f8a79UL, 0xcb375de4UL, 0xae50e15cUL, 0x40ff544eUL, 0x2598e8f6UL,\r
- 0x73888baeUL, 0x16ef3716UL, 0xf8408204UL, 0x9d273ebcUL, 0x241fe921UL,\r
- 0x41785599UL, 0xafd7e08bUL, 0xcab05c33UL, 0x3bb659edUL, 0x5ed1e555UL,\r
- 0xb07e5047UL, 0xd519ecffUL, 0x6c213b62UL, 0x094687daUL, 0xe7e932c8UL,\r
- 0x828e8e70UL, 0xd49eed28UL, 0xb1f95190UL, 0x5f56e482UL, 0x3a31583aUL,\r
- 0x83098fa7UL, 0xe66e331fUL, 0x08c1860dUL, 0x6da63ab5UL, 0xa4e140bdUL,\r
- 0xc186fc05UL, 0x2f294917UL, 0x4a4ef5afUL, 0xf3762232UL, 0x96119e8aUL,\r
- 0x78be2b98UL, 0x1dd99720UL, 0x4bc9f478UL, 0x2eae48c0UL, 0xc001fdd2UL,\r
- 0xa566416aUL, 0x1c5e96f7UL, 0x79392a4fUL, 0x97969f5dUL, 0xf2f123e5UL,\r
- 0x05196b4dUL, 0x607ed7f5UL, 0x8ed162e7UL, 0xebb6de5fUL, 0x528e09c2UL,\r
- 0x37e9b57aUL, 0xd9460068UL, 0xbc21bcd0UL, 0xea31df88UL, 0x8f566330UL,\r
- 0x61f9d622UL, 0x049e6a9aUL, 0xbda6bd07UL, 0xd8c101bfUL, 0x366eb4adUL,\r
- 0x53090815UL, 0x9a4e721dUL, 0xff29cea5UL, 0x11867bb7UL, 0x74e1c70fUL,\r
- 0xcdd91092UL, 0xa8beac2aUL, 0x46111938UL, 0x2376a580UL, 0x7566c6d8UL,\r
- 0x10017a60UL, 0xfeaecf72UL, 0x9bc973caUL, 0x22f1a457UL, 0x479618efUL,\r
- 0xa939adfdUL, 0xcc5e1145UL, 0x06ee4d76UL, 0x6389f1ceUL, 0x8d2644dcUL,\r
- 0xe841f864UL, 0x51792ff9UL, 0x341e9341UL, 0xdab12653UL, 0xbfd69aebUL,\r
- 0xe9c6f9b3UL, 0x8ca1450bUL, 0x620ef019UL, 0x07694ca1UL, 0xbe519b3cUL,\r
- 0xdb362784UL, 0x35999296UL, 0x50fe2e2eUL, 0x99b95426UL, 0xfcdee89eUL,\r
- 0x12715d8cUL, 0x7716e134UL, 0xce2e36a9UL, 0xab498a11UL, 0x45e63f03UL,\r
- 0x208183bbUL, 0x7691e0e3UL, 0x13f65c5bUL, 0xfd59e949UL, 0x983e55f1UL,\r
- 0x2106826cUL, 0x44613ed4UL, 0xaace8bc6UL, 0xcfa9377eUL, 0x38417fd6UL,\r
- 0x5d26c36eUL, 0xb389767cUL, 0xd6eecac4UL, 0x6fd61d59UL, 0x0ab1a1e1UL,\r
- 0xe41e14f3UL, 0x8179a84bUL, 0xd769cb13UL, 0xb20e77abUL, 0x5ca1c2b9UL,\r
- 0x39c67e01UL, 0x80fea99cUL, 0xe5991524UL, 0x0b36a036UL, 0x6e511c8eUL,\r
- 0xa7166686UL, 0xc271da3eUL, 0x2cde6f2cUL, 0x49b9d394UL, 0xf0810409UL,\r
- 0x95e6b8b1UL, 0x7b490da3UL, 0x1e2eb11bUL, 0x483ed243UL, 0x2d596efbUL,\r
- 0xc3f6dbe9UL, 0xa6916751UL, 0x1fa9b0ccUL, 0x7ace0c74UL, 0x9461b966UL,\r
- 0xf10605deUL\r
-#endif\r
- }\r
-};\r
+/* crc32.h -- tables for rapid CRC calculation
+ * Generated automatically by crc32.c
+ */
+
+local const unsigned long FAR crc_table[TBLS][256] =
+{
+ {
+ 0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
+ 0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
+ 0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
+ 0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
+ 0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
+ 0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
+ 0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
+ 0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
+ 0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
+ 0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
+ 0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
+ 0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
+ 0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
+ 0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
+ 0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
+ 0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
+ 0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
+ 0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
+ 0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
+ 0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
+ 0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
+ 0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
+ 0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
+ 0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
+ 0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
+ 0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
+ 0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
+ 0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
+ 0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
+ 0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
+ 0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
+ 0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
+ 0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
+ 0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
+ 0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
+ 0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
+ 0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
+ 0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
+ 0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
+ 0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
+ 0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
+ 0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
+ 0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
+ 0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
+ 0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
+ 0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
+ 0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
+ 0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
+ 0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
+ 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
+ 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
+ 0x2d02ef8dUL
+#ifdef BYFOUR
+ },
+ {
+ 0x00000000UL, 0x191b3141UL, 0x32366282UL, 0x2b2d53c3UL, 0x646cc504UL,
+ 0x7d77f445UL, 0x565aa786UL, 0x4f4196c7UL, 0xc8d98a08UL, 0xd1c2bb49UL,
+ 0xfaefe88aUL, 0xe3f4d9cbUL, 0xacb54f0cUL, 0xb5ae7e4dUL, 0x9e832d8eUL,
+ 0x87981ccfUL, 0x4ac21251UL, 0x53d92310UL, 0x78f470d3UL, 0x61ef4192UL,
+ 0x2eaed755UL, 0x37b5e614UL, 0x1c98b5d7UL, 0x05838496UL, 0x821b9859UL,
+ 0x9b00a918UL, 0xb02dfadbUL, 0xa936cb9aUL, 0xe6775d5dUL, 0xff6c6c1cUL,
+ 0xd4413fdfUL, 0xcd5a0e9eUL, 0x958424a2UL, 0x8c9f15e3UL, 0xa7b24620UL,
+ 0xbea97761UL, 0xf1e8e1a6UL, 0xe8f3d0e7UL, 0xc3de8324UL, 0xdac5b265UL,
+ 0x5d5daeaaUL, 0x44469febUL, 0x6f6bcc28UL, 0x7670fd69UL, 0x39316baeUL,
+ 0x202a5aefUL, 0x0b07092cUL, 0x121c386dUL, 0xdf4636f3UL, 0xc65d07b2UL,
+ 0xed705471UL, 0xf46b6530UL, 0xbb2af3f7UL, 0xa231c2b6UL, 0x891c9175UL,
+ 0x9007a034UL, 0x179fbcfbUL, 0x0e848dbaUL, 0x25a9de79UL, 0x3cb2ef38UL,
+ 0x73f379ffUL, 0x6ae848beUL, 0x41c51b7dUL, 0x58de2a3cUL, 0xf0794f05UL,
+ 0xe9627e44UL, 0xc24f2d87UL, 0xdb541cc6UL, 0x94158a01UL, 0x8d0ebb40UL,
+ 0xa623e883UL, 0xbf38d9c2UL, 0x38a0c50dUL, 0x21bbf44cUL, 0x0a96a78fUL,
+ 0x138d96ceUL, 0x5ccc0009UL, 0x45d73148UL, 0x6efa628bUL, 0x77e153caUL,
+ 0xbabb5d54UL, 0xa3a06c15UL, 0x888d3fd6UL, 0x91960e97UL, 0xded79850UL,
+ 0xc7cca911UL, 0xece1fad2UL, 0xf5facb93UL, 0x7262d75cUL, 0x6b79e61dUL,
+ 0x4054b5deUL, 0x594f849fUL, 0x160e1258UL, 0x0f152319UL, 0x243870daUL,
+ 0x3d23419bUL, 0x65fd6ba7UL, 0x7ce65ae6UL, 0x57cb0925UL, 0x4ed03864UL,
+ 0x0191aea3UL, 0x188a9fe2UL, 0x33a7cc21UL, 0x2abcfd60UL, 0xad24e1afUL,
+ 0xb43fd0eeUL, 0x9f12832dUL, 0x8609b26cUL, 0xc94824abUL, 0xd05315eaUL,
+ 0xfb7e4629UL, 0xe2657768UL, 0x2f3f79f6UL, 0x362448b7UL, 0x1d091b74UL,
+ 0x04122a35UL, 0x4b53bcf2UL, 0x52488db3UL, 0x7965de70UL, 0x607eef31UL,
+ 0xe7e6f3feUL, 0xfefdc2bfUL, 0xd5d0917cUL, 0xcccba03dUL, 0x838a36faUL,
+ 0x9a9107bbUL, 0xb1bc5478UL, 0xa8a76539UL, 0x3b83984bUL, 0x2298a90aUL,
+ 0x09b5fac9UL, 0x10aecb88UL, 0x5fef5d4fUL, 0x46f46c0eUL, 0x6dd93fcdUL,
+ 0x74c20e8cUL, 0xf35a1243UL, 0xea412302UL, 0xc16c70c1UL, 0xd8774180UL,
+ 0x9736d747UL, 0x8e2de606UL, 0xa500b5c5UL, 0xbc1b8484UL, 0x71418a1aUL,
+ 0x685abb5bUL, 0x4377e898UL, 0x5a6cd9d9UL, 0x152d4f1eUL, 0x0c367e5fUL,
+ 0x271b2d9cUL, 0x3e001cddUL, 0xb9980012UL, 0xa0833153UL, 0x8bae6290UL,
+ 0x92b553d1UL, 0xddf4c516UL, 0xc4eff457UL, 0xefc2a794UL, 0xf6d996d5UL,
+ 0xae07bce9UL, 0xb71c8da8UL, 0x9c31de6bUL, 0x852aef2aUL, 0xca6b79edUL,
+ 0xd37048acUL, 0xf85d1b6fUL, 0xe1462a2eUL, 0x66de36e1UL, 0x7fc507a0UL,
+ 0x54e85463UL, 0x4df36522UL, 0x02b2f3e5UL, 0x1ba9c2a4UL, 0x30849167UL,
+ 0x299fa026UL, 0xe4c5aeb8UL, 0xfdde9ff9UL, 0xd6f3cc3aUL, 0xcfe8fd7bUL,
+ 0x80a96bbcUL, 0x99b25afdUL, 0xb29f093eUL, 0xab84387fUL, 0x2c1c24b0UL,
+ 0x350715f1UL, 0x1e2a4632UL, 0x07317773UL, 0x4870e1b4UL, 0x516bd0f5UL,
+ 0x7a468336UL, 0x635db277UL, 0xcbfad74eUL, 0xd2e1e60fUL, 0xf9ccb5ccUL,
+ 0xe0d7848dUL, 0xaf96124aUL, 0xb68d230bUL, 0x9da070c8UL, 0x84bb4189UL,
+ 0x03235d46UL, 0x1a386c07UL, 0x31153fc4UL, 0x280e0e85UL, 0x674f9842UL,
+ 0x7e54a903UL, 0x5579fac0UL, 0x4c62cb81UL, 0x8138c51fUL, 0x9823f45eUL,
+ 0xb30ea79dUL, 0xaa1596dcUL, 0xe554001bUL, 0xfc4f315aUL, 0xd7626299UL,
+ 0xce7953d8UL, 0x49e14f17UL, 0x50fa7e56UL, 0x7bd72d95UL, 0x62cc1cd4UL,
+ 0x2d8d8a13UL, 0x3496bb52UL, 0x1fbbe891UL, 0x06a0d9d0UL, 0x5e7ef3ecUL,
+ 0x4765c2adUL, 0x6c48916eUL, 0x7553a02fUL, 0x3a1236e8UL, 0x230907a9UL,
+ 0x0824546aUL, 0x113f652bUL, 0x96a779e4UL, 0x8fbc48a5UL, 0xa4911b66UL,
+ 0xbd8a2a27UL, 0xf2cbbce0UL, 0xebd08da1UL, 0xc0fdde62UL, 0xd9e6ef23UL,
+ 0x14bce1bdUL, 0x0da7d0fcUL, 0x268a833fUL, 0x3f91b27eUL, 0x70d024b9UL,
+ 0x69cb15f8UL, 0x42e6463bUL, 0x5bfd777aUL, 0xdc656bb5UL, 0xc57e5af4UL,
+ 0xee530937UL, 0xf7483876UL, 0xb809aeb1UL, 0xa1129ff0UL, 0x8a3fcc33UL,
+ 0x9324fd72UL
+ },
+ {
+ 0x00000000UL, 0x01c26a37UL, 0x0384d46eUL, 0x0246be59UL, 0x0709a8dcUL,
+ 0x06cbc2ebUL, 0x048d7cb2UL, 0x054f1685UL, 0x0e1351b8UL, 0x0fd13b8fUL,
+ 0x0d9785d6UL, 0x0c55efe1UL, 0x091af964UL, 0x08d89353UL, 0x0a9e2d0aUL,
+ 0x0b5c473dUL, 0x1c26a370UL, 0x1de4c947UL, 0x1fa2771eUL, 0x1e601d29UL,
+ 0x1b2f0bacUL, 0x1aed619bUL, 0x18abdfc2UL, 0x1969b5f5UL, 0x1235f2c8UL,
+ 0x13f798ffUL, 0x11b126a6UL, 0x10734c91UL, 0x153c5a14UL, 0x14fe3023UL,
+ 0x16b88e7aUL, 0x177ae44dUL, 0x384d46e0UL, 0x398f2cd7UL, 0x3bc9928eUL,
+ 0x3a0bf8b9UL, 0x3f44ee3cUL, 0x3e86840bUL, 0x3cc03a52UL, 0x3d025065UL,
+ 0x365e1758UL, 0x379c7d6fUL, 0x35dac336UL, 0x3418a901UL, 0x3157bf84UL,
+ 0x3095d5b3UL, 0x32d36beaUL, 0x331101ddUL, 0x246be590UL, 0x25a98fa7UL,
+ 0x27ef31feUL, 0x262d5bc9UL, 0x23624d4cUL, 0x22a0277bUL, 0x20e69922UL,
+ 0x2124f315UL, 0x2a78b428UL, 0x2bbade1fUL, 0x29fc6046UL, 0x283e0a71UL,
+ 0x2d711cf4UL, 0x2cb376c3UL, 0x2ef5c89aUL, 0x2f37a2adUL, 0x709a8dc0UL,
+ 0x7158e7f7UL, 0x731e59aeUL, 0x72dc3399UL, 0x7793251cUL, 0x76514f2bUL,
+ 0x7417f172UL, 0x75d59b45UL, 0x7e89dc78UL, 0x7f4bb64fUL, 0x7d0d0816UL,
+ 0x7ccf6221UL, 0x798074a4UL, 0x78421e93UL, 0x7a04a0caUL, 0x7bc6cafdUL,
+ 0x6cbc2eb0UL, 0x6d7e4487UL, 0x6f38fadeUL, 0x6efa90e9UL, 0x6bb5866cUL,
+ 0x6a77ec5bUL, 0x68315202UL, 0x69f33835UL, 0x62af7f08UL, 0x636d153fUL,
+ 0x612bab66UL, 0x60e9c151UL, 0x65a6d7d4UL, 0x6464bde3UL, 0x662203baUL,
+ 0x67e0698dUL, 0x48d7cb20UL, 0x4915a117UL, 0x4b531f4eUL, 0x4a917579UL,
+ 0x4fde63fcUL, 0x4e1c09cbUL, 0x4c5ab792UL, 0x4d98dda5UL, 0x46c49a98UL,
+ 0x4706f0afUL, 0x45404ef6UL, 0x448224c1UL, 0x41cd3244UL, 0x400f5873UL,
+ 0x4249e62aUL, 0x438b8c1dUL, 0x54f16850UL, 0x55330267UL, 0x5775bc3eUL,
+ 0x56b7d609UL, 0x53f8c08cUL, 0x523aaabbUL, 0x507c14e2UL, 0x51be7ed5UL,
+ 0x5ae239e8UL, 0x5b2053dfUL, 0x5966ed86UL, 0x58a487b1UL, 0x5deb9134UL,
+ 0x5c29fb03UL, 0x5e6f455aUL, 0x5fad2f6dUL, 0xe1351b80UL, 0xe0f771b7UL,
+ 0xe2b1cfeeUL, 0xe373a5d9UL, 0xe63cb35cUL, 0xe7fed96bUL, 0xe5b86732UL,
+ 0xe47a0d05UL, 0xef264a38UL, 0xeee4200fUL, 0xeca29e56UL, 0xed60f461UL,
+ 0xe82fe2e4UL, 0xe9ed88d3UL, 0xebab368aUL, 0xea695cbdUL, 0xfd13b8f0UL,
+ 0xfcd1d2c7UL, 0xfe976c9eUL, 0xff5506a9UL, 0xfa1a102cUL, 0xfbd87a1bUL,
+ 0xf99ec442UL, 0xf85cae75UL, 0xf300e948UL, 0xf2c2837fUL, 0xf0843d26UL,
+ 0xf1465711UL, 0xf4094194UL, 0xf5cb2ba3UL, 0xf78d95faUL, 0xf64fffcdUL,
+ 0xd9785d60UL, 0xd8ba3757UL, 0xdafc890eUL, 0xdb3ee339UL, 0xde71f5bcUL,
+ 0xdfb39f8bUL, 0xddf521d2UL, 0xdc374be5UL, 0xd76b0cd8UL, 0xd6a966efUL,
+ 0xd4efd8b6UL, 0xd52db281UL, 0xd062a404UL, 0xd1a0ce33UL, 0xd3e6706aUL,
+ 0xd2241a5dUL, 0xc55efe10UL, 0xc49c9427UL, 0xc6da2a7eUL, 0xc7184049UL,
+ 0xc25756ccUL, 0xc3953cfbUL, 0xc1d382a2UL, 0xc011e895UL, 0xcb4dafa8UL,
+ 0xca8fc59fUL, 0xc8c97bc6UL, 0xc90b11f1UL, 0xcc440774UL, 0xcd866d43UL,
+ 0xcfc0d31aUL, 0xce02b92dUL, 0x91af9640UL, 0x906dfc77UL, 0x922b422eUL,
+ 0x93e92819UL, 0x96a63e9cUL, 0x976454abUL, 0x9522eaf2UL, 0x94e080c5UL,
+ 0x9fbcc7f8UL, 0x9e7eadcfUL, 0x9c381396UL, 0x9dfa79a1UL, 0x98b56f24UL,
+ 0x99770513UL, 0x9b31bb4aUL, 0x9af3d17dUL, 0x8d893530UL, 0x8c4b5f07UL,
+ 0x8e0de15eUL, 0x8fcf8b69UL, 0x8a809decUL, 0x8b42f7dbUL, 0x89044982UL,
+ 0x88c623b5UL, 0x839a6488UL, 0x82580ebfUL, 0x801eb0e6UL, 0x81dcdad1UL,
+ 0x8493cc54UL, 0x8551a663UL, 0x8717183aUL, 0x86d5720dUL, 0xa9e2d0a0UL,
+ 0xa820ba97UL, 0xaa6604ceUL, 0xaba46ef9UL, 0xaeeb787cUL, 0xaf29124bUL,
+ 0xad6fac12UL, 0xacadc625UL, 0xa7f18118UL, 0xa633eb2fUL, 0xa4755576UL,
+ 0xa5b73f41UL, 0xa0f829c4UL, 0xa13a43f3UL, 0xa37cfdaaUL, 0xa2be979dUL,
+ 0xb5c473d0UL, 0xb40619e7UL, 0xb640a7beUL, 0xb782cd89UL, 0xb2cddb0cUL,
+ 0xb30fb13bUL, 0xb1490f62UL, 0xb08b6555UL, 0xbbd72268UL, 0xba15485fUL,
+ 0xb853f606UL, 0xb9919c31UL, 0xbcde8ab4UL, 0xbd1ce083UL, 0xbf5a5edaUL,
+ 0xbe9834edUL
+ },
+ {
+ 0x00000000UL, 0xb8bc6765UL, 0xaa09c88bUL, 0x12b5afeeUL, 0x8f629757UL,
+ 0x37def032UL, 0x256b5fdcUL, 0x9dd738b9UL, 0xc5b428efUL, 0x7d084f8aUL,
+ 0x6fbde064UL, 0xd7018701UL, 0x4ad6bfb8UL, 0xf26ad8ddUL, 0xe0df7733UL,
+ 0x58631056UL, 0x5019579fUL, 0xe8a530faUL, 0xfa109f14UL, 0x42acf871UL,
+ 0xdf7bc0c8UL, 0x67c7a7adUL, 0x75720843UL, 0xcdce6f26UL, 0x95ad7f70UL,
+ 0x2d111815UL, 0x3fa4b7fbUL, 0x8718d09eUL, 0x1acfe827UL, 0xa2738f42UL,
+ 0xb0c620acUL, 0x087a47c9UL, 0xa032af3eUL, 0x188ec85bUL, 0x0a3b67b5UL,
+ 0xb28700d0UL, 0x2f503869UL, 0x97ec5f0cUL, 0x8559f0e2UL, 0x3de59787UL,
+ 0x658687d1UL, 0xdd3ae0b4UL, 0xcf8f4f5aUL, 0x7733283fUL, 0xeae41086UL,
+ 0x525877e3UL, 0x40edd80dUL, 0xf851bf68UL, 0xf02bf8a1UL, 0x48979fc4UL,
+ 0x5a22302aUL, 0xe29e574fUL, 0x7f496ff6UL, 0xc7f50893UL, 0xd540a77dUL,
+ 0x6dfcc018UL, 0x359fd04eUL, 0x8d23b72bUL, 0x9f9618c5UL, 0x272a7fa0UL,
+ 0xbafd4719UL, 0x0241207cUL, 0x10f48f92UL, 0xa848e8f7UL, 0x9b14583dUL,
+ 0x23a83f58UL, 0x311d90b6UL, 0x89a1f7d3UL, 0x1476cf6aUL, 0xaccaa80fUL,
+ 0xbe7f07e1UL, 0x06c36084UL, 0x5ea070d2UL, 0xe61c17b7UL, 0xf4a9b859UL,
+ 0x4c15df3cUL, 0xd1c2e785UL, 0x697e80e0UL, 0x7bcb2f0eUL, 0xc377486bUL,
+ 0xcb0d0fa2UL, 0x73b168c7UL, 0x6104c729UL, 0xd9b8a04cUL, 0x446f98f5UL,
+ 0xfcd3ff90UL, 0xee66507eUL, 0x56da371bUL, 0x0eb9274dUL, 0xb6054028UL,
+ 0xa4b0efc6UL, 0x1c0c88a3UL, 0x81dbb01aUL, 0x3967d77fUL, 0x2bd27891UL,
+ 0x936e1ff4UL, 0x3b26f703UL, 0x839a9066UL, 0x912f3f88UL, 0x299358edUL,
+ 0xb4446054UL, 0x0cf80731UL, 0x1e4da8dfUL, 0xa6f1cfbaUL, 0xfe92dfecUL,
+ 0x462eb889UL, 0x549b1767UL, 0xec277002UL, 0x71f048bbUL, 0xc94c2fdeUL,
+ 0xdbf98030UL, 0x6345e755UL, 0x6b3fa09cUL, 0xd383c7f9UL, 0xc1366817UL,
+ 0x798a0f72UL, 0xe45d37cbUL, 0x5ce150aeUL, 0x4e54ff40UL, 0xf6e89825UL,
+ 0xae8b8873UL, 0x1637ef16UL, 0x048240f8UL, 0xbc3e279dUL, 0x21e91f24UL,
+ 0x99557841UL, 0x8be0d7afUL, 0x335cb0caUL, 0xed59b63bUL, 0x55e5d15eUL,
+ 0x47507eb0UL, 0xffec19d5UL, 0x623b216cUL, 0xda874609UL, 0xc832e9e7UL,
+ 0x708e8e82UL, 0x28ed9ed4UL, 0x9051f9b1UL, 0x82e4565fUL, 0x3a58313aUL,
+ 0xa78f0983UL, 0x1f336ee6UL, 0x0d86c108UL, 0xb53aa66dUL, 0xbd40e1a4UL,
+ 0x05fc86c1UL, 0x1749292fUL, 0xaff54e4aUL, 0x322276f3UL, 0x8a9e1196UL,
+ 0x982bbe78UL, 0x2097d91dUL, 0x78f4c94bUL, 0xc048ae2eUL, 0xd2fd01c0UL,
+ 0x6a4166a5UL, 0xf7965e1cUL, 0x4f2a3979UL, 0x5d9f9697UL, 0xe523f1f2UL,
+ 0x4d6b1905UL, 0xf5d77e60UL, 0xe762d18eUL, 0x5fdeb6ebUL, 0xc2098e52UL,
+ 0x7ab5e937UL, 0x680046d9UL, 0xd0bc21bcUL, 0x88df31eaUL, 0x3063568fUL,
+ 0x22d6f961UL, 0x9a6a9e04UL, 0x07bda6bdUL, 0xbf01c1d8UL, 0xadb46e36UL,
+ 0x15080953UL, 0x1d724e9aUL, 0xa5ce29ffUL, 0xb77b8611UL, 0x0fc7e174UL,
+ 0x9210d9cdUL, 0x2aacbea8UL, 0x38191146UL, 0x80a57623UL, 0xd8c66675UL,
+ 0x607a0110UL, 0x72cfaefeUL, 0xca73c99bUL, 0x57a4f122UL, 0xef189647UL,
+ 0xfdad39a9UL, 0x45115eccUL, 0x764dee06UL, 0xcef18963UL, 0xdc44268dUL,
+ 0x64f841e8UL, 0xf92f7951UL, 0x41931e34UL, 0x5326b1daUL, 0xeb9ad6bfUL,
+ 0xb3f9c6e9UL, 0x0b45a18cUL, 0x19f00e62UL, 0xa14c6907UL, 0x3c9b51beUL,
+ 0x842736dbUL, 0x96929935UL, 0x2e2efe50UL, 0x2654b999UL, 0x9ee8defcUL,
+ 0x8c5d7112UL, 0x34e11677UL, 0xa9362eceUL, 0x118a49abUL, 0x033fe645UL,
+ 0xbb838120UL, 0xe3e09176UL, 0x5b5cf613UL, 0x49e959fdUL, 0xf1553e98UL,
+ 0x6c820621UL, 0xd43e6144UL, 0xc68bceaaUL, 0x7e37a9cfUL, 0xd67f4138UL,
+ 0x6ec3265dUL, 0x7c7689b3UL, 0xc4caeed6UL, 0x591dd66fUL, 0xe1a1b10aUL,
+ 0xf3141ee4UL, 0x4ba87981UL, 0x13cb69d7UL, 0xab770eb2UL, 0xb9c2a15cUL,
+ 0x017ec639UL, 0x9ca9fe80UL, 0x241599e5UL, 0x36a0360bUL, 0x8e1c516eUL,
+ 0x866616a7UL, 0x3eda71c2UL, 0x2c6fde2cUL, 0x94d3b949UL, 0x090481f0UL,
+ 0xb1b8e695UL, 0xa30d497bUL, 0x1bb12e1eUL, 0x43d23e48UL, 0xfb6e592dUL,
+ 0xe9dbf6c3UL, 0x516791a6UL, 0xccb0a91fUL, 0x740cce7aUL, 0x66b96194UL,
+ 0xde0506f1UL
+ },
+ {
+ 0x00000000UL, 0x96300777UL, 0x2c610eeeUL, 0xba510999UL, 0x19c46d07UL,
+ 0x8ff46a70UL, 0x35a563e9UL, 0xa395649eUL, 0x3288db0eUL, 0xa4b8dc79UL,
+ 0x1ee9d5e0UL, 0x88d9d297UL, 0x2b4cb609UL, 0xbd7cb17eUL, 0x072db8e7UL,
+ 0x911dbf90UL, 0x6410b71dUL, 0xf220b06aUL, 0x4871b9f3UL, 0xde41be84UL,
+ 0x7dd4da1aUL, 0xebe4dd6dUL, 0x51b5d4f4UL, 0xc785d383UL, 0x56986c13UL,
+ 0xc0a86b64UL, 0x7af962fdUL, 0xecc9658aUL, 0x4f5c0114UL, 0xd96c0663UL,
+ 0x633d0ffaUL, 0xf50d088dUL, 0xc8206e3bUL, 0x5e10694cUL, 0xe44160d5UL,
+ 0x727167a2UL, 0xd1e4033cUL, 0x47d4044bUL, 0xfd850dd2UL, 0x6bb50aa5UL,
+ 0xfaa8b535UL, 0x6c98b242UL, 0xd6c9bbdbUL, 0x40f9bcacUL, 0xe36cd832UL,
+ 0x755cdf45UL, 0xcf0dd6dcUL, 0x593dd1abUL, 0xac30d926UL, 0x3a00de51UL,
+ 0x8051d7c8UL, 0x1661d0bfUL, 0xb5f4b421UL, 0x23c4b356UL, 0x9995bacfUL,
+ 0x0fa5bdb8UL, 0x9eb80228UL, 0x0888055fUL, 0xb2d90cc6UL, 0x24e90bb1UL,
+ 0x877c6f2fUL, 0x114c6858UL, 0xab1d61c1UL, 0x3d2d66b6UL, 0x9041dc76UL,
+ 0x0671db01UL, 0xbc20d298UL, 0x2a10d5efUL, 0x8985b171UL, 0x1fb5b606UL,
+ 0xa5e4bf9fUL, 0x33d4b8e8UL, 0xa2c90778UL, 0x34f9000fUL, 0x8ea80996UL,
+ 0x18980ee1UL, 0xbb0d6a7fUL, 0x2d3d6d08UL, 0x976c6491UL, 0x015c63e6UL,
+ 0xf4516b6bUL, 0x62616c1cUL, 0xd8306585UL, 0x4e0062f2UL, 0xed95066cUL,
+ 0x7ba5011bUL, 0xc1f40882UL, 0x57c40ff5UL, 0xc6d9b065UL, 0x50e9b712UL,
+ 0xeab8be8bUL, 0x7c88b9fcUL, 0xdf1ddd62UL, 0x492dda15UL, 0xf37cd38cUL,
+ 0x654cd4fbUL, 0x5861b24dUL, 0xce51b53aUL, 0x7400bca3UL, 0xe230bbd4UL,
+ 0x41a5df4aUL, 0xd795d83dUL, 0x6dc4d1a4UL, 0xfbf4d6d3UL, 0x6ae96943UL,
+ 0xfcd96e34UL, 0x468867adUL, 0xd0b860daUL, 0x732d0444UL, 0xe51d0333UL,
+ 0x5f4c0aaaUL, 0xc97c0dddUL, 0x3c710550UL, 0xaa410227UL, 0x10100bbeUL,
+ 0x86200cc9UL, 0x25b56857UL, 0xb3856f20UL, 0x09d466b9UL, 0x9fe461ceUL,
+ 0x0ef9de5eUL, 0x98c9d929UL, 0x2298d0b0UL, 0xb4a8d7c7UL, 0x173db359UL,
+ 0x810db42eUL, 0x3b5cbdb7UL, 0xad6cbac0UL, 0x2083b8edUL, 0xb6b3bf9aUL,
+ 0x0ce2b603UL, 0x9ad2b174UL, 0x3947d5eaUL, 0xaf77d29dUL, 0x1526db04UL,
+ 0x8316dc73UL, 0x120b63e3UL, 0x843b6494UL, 0x3e6a6d0dUL, 0xa85a6a7aUL,
+ 0x0bcf0ee4UL, 0x9dff0993UL, 0x27ae000aUL, 0xb19e077dUL, 0x44930ff0UL,
+ 0xd2a30887UL, 0x68f2011eUL, 0xfec20669UL, 0x5d5762f7UL, 0xcb676580UL,
+ 0x71366c19UL, 0xe7066b6eUL, 0x761bd4feUL, 0xe02bd389UL, 0x5a7ada10UL,
+ 0xcc4add67UL, 0x6fdfb9f9UL, 0xf9efbe8eUL, 0x43beb717UL, 0xd58eb060UL,
+ 0xe8a3d6d6UL, 0x7e93d1a1UL, 0xc4c2d838UL, 0x52f2df4fUL, 0xf167bbd1UL,
+ 0x6757bca6UL, 0xdd06b53fUL, 0x4b36b248UL, 0xda2b0dd8UL, 0x4c1b0aafUL,
+ 0xf64a0336UL, 0x607a0441UL, 0xc3ef60dfUL, 0x55df67a8UL, 0xef8e6e31UL,
+ 0x79be6946UL, 0x8cb361cbUL, 0x1a8366bcUL, 0xa0d26f25UL, 0x36e26852UL,
+ 0x95770cccUL, 0x03470bbbUL, 0xb9160222UL, 0x2f260555UL, 0xbe3bbac5UL,
+ 0x280bbdb2UL, 0x925ab42bUL, 0x046ab35cUL, 0xa7ffd7c2UL, 0x31cfd0b5UL,
+ 0x8b9ed92cUL, 0x1daede5bUL, 0xb0c2649bUL, 0x26f263ecUL, 0x9ca36a75UL,
+ 0x0a936d02UL, 0xa906099cUL, 0x3f360eebUL, 0x85670772UL, 0x13570005UL,
+ 0x824abf95UL, 0x147ab8e2UL, 0xae2bb17bUL, 0x381bb60cUL, 0x9b8ed292UL,
+ 0x0dbed5e5UL, 0xb7efdc7cUL, 0x21dfdb0bUL, 0xd4d2d386UL, 0x42e2d4f1UL,
+ 0xf8b3dd68UL, 0x6e83da1fUL, 0xcd16be81UL, 0x5b26b9f6UL, 0xe177b06fUL,
+ 0x7747b718UL, 0xe65a0888UL, 0x706a0fffUL, 0xca3b0666UL, 0x5c0b0111UL,
+ 0xff9e658fUL, 0x69ae62f8UL, 0xd3ff6b61UL, 0x45cf6c16UL, 0x78e20aa0UL,
+ 0xeed20dd7UL, 0x5483044eUL, 0xc2b30339UL, 0x612667a7UL, 0xf71660d0UL,
+ 0x4d476949UL, 0xdb776e3eUL, 0x4a6ad1aeUL, 0xdc5ad6d9UL, 0x660bdf40UL,
+ 0xf03bd837UL, 0x53aebca9UL, 0xc59ebbdeUL, 0x7fcfb247UL, 0xe9ffb530UL,
+ 0x1cf2bdbdUL, 0x8ac2bacaUL, 0x3093b353UL, 0xa6a3b424UL, 0x0536d0baUL,
+ 0x9306d7cdUL, 0x2957de54UL, 0xbf67d923UL, 0x2e7a66b3UL, 0xb84a61c4UL,
+ 0x021b685dUL, 0x942b6f2aUL, 0x37be0bb4UL, 0xa18e0cc3UL, 0x1bdf055aUL,
+ 0x8def022dUL
+ },
+ {
+ 0x00000000UL, 0x41311b19UL, 0x82623632UL, 0xc3532d2bUL, 0x04c56c64UL,
+ 0x45f4777dUL, 0x86a75a56UL, 0xc796414fUL, 0x088ad9c8UL, 0x49bbc2d1UL,
+ 0x8ae8effaUL, 0xcbd9f4e3UL, 0x0c4fb5acUL, 0x4d7eaeb5UL, 0x8e2d839eUL,
+ 0xcf1c9887UL, 0x5112c24aUL, 0x1023d953UL, 0xd370f478UL, 0x9241ef61UL,
+ 0x55d7ae2eUL, 0x14e6b537UL, 0xd7b5981cUL, 0x96848305UL, 0x59981b82UL,
+ 0x18a9009bUL, 0xdbfa2db0UL, 0x9acb36a9UL, 0x5d5d77e6UL, 0x1c6c6cffUL,
+ 0xdf3f41d4UL, 0x9e0e5acdUL, 0xa2248495UL, 0xe3159f8cUL, 0x2046b2a7UL,
+ 0x6177a9beUL, 0xa6e1e8f1UL, 0xe7d0f3e8UL, 0x2483dec3UL, 0x65b2c5daUL,
+ 0xaaae5d5dUL, 0xeb9f4644UL, 0x28cc6b6fUL, 0x69fd7076UL, 0xae6b3139UL,
+ 0xef5a2a20UL, 0x2c09070bUL, 0x6d381c12UL, 0xf33646dfUL, 0xb2075dc6UL,
+ 0x715470edUL, 0x30656bf4UL, 0xf7f32abbUL, 0xb6c231a2UL, 0x75911c89UL,
+ 0x34a00790UL, 0xfbbc9f17UL, 0xba8d840eUL, 0x79dea925UL, 0x38efb23cUL,
+ 0xff79f373UL, 0xbe48e86aUL, 0x7d1bc541UL, 0x3c2ade58UL, 0x054f79f0UL,
+ 0x447e62e9UL, 0x872d4fc2UL, 0xc61c54dbUL, 0x018a1594UL, 0x40bb0e8dUL,
+ 0x83e823a6UL, 0xc2d938bfUL, 0x0dc5a038UL, 0x4cf4bb21UL, 0x8fa7960aUL,
+ 0xce968d13UL, 0x0900cc5cUL, 0x4831d745UL, 0x8b62fa6eUL, 0xca53e177UL,
+ 0x545dbbbaUL, 0x156ca0a3UL, 0xd63f8d88UL, 0x970e9691UL, 0x5098d7deUL,
+ 0x11a9ccc7UL, 0xd2fae1ecUL, 0x93cbfaf5UL, 0x5cd76272UL, 0x1de6796bUL,
+ 0xdeb55440UL, 0x9f844f59UL, 0x58120e16UL, 0x1923150fUL, 0xda703824UL,
+ 0x9b41233dUL, 0xa76bfd65UL, 0xe65ae67cUL, 0x2509cb57UL, 0x6438d04eUL,
+ 0xa3ae9101UL, 0xe29f8a18UL, 0x21cca733UL, 0x60fdbc2aUL, 0xafe124adUL,
+ 0xeed03fb4UL, 0x2d83129fUL, 0x6cb20986UL, 0xab2448c9UL, 0xea1553d0UL,
+ 0x29467efbUL, 0x687765e2UL, 0xf6793f2fUL, 0xb7482436UL, 0x741b091dUL,
+ 0x352a1204UL, 0xf2bc534bUL, 0xb38d4852UL, 0x70de6579UL, 0x31ef7e60UL,
+ 0xfef3e6e7UL, 0xbfc2fdfeUL, 0x7c91d0d5UL, 0x3da0cbccUL, 0xfa368a83UL,
+ 0xbb07919aUL, 0x7854bcb1UL, 0x3965a7a8UL, 0x4b98833bUL, 0x0aa99822UL,
+ 0xc9fab509UL, 0x88cbae10UL, 0x4f5def5fUL, 0x0e6cf446UL, 0xcd3fd96dUL,
+ 0x8c0ec274UL, 0x43125af3UL, 0x022341eaUL, 0xc1706cc1UL, 0x804177d8UL,
+ 0x47d73697UL, 0x06e62d8eUL, 0xc5b500a5UL, 0x84841bbcUL, 0x1a8a4171UL,
+ 0x5bbb5a68UL, 0x98e87743UL, 0xd9d96c5aUL, 0x1e4f2d15UL, 0x5f7e360cUL,
+ 0x9c2d1b27UL, 0xdd1c003eUL, 0x120098b9UL, 0x533183a0UL, 0x9062ae8bUL,
+ 0xd153b592UL, 0x16c5f4ddUL, 0x57f4efc4UL, 0x94a7c2efUL, 0xd596d9f6UL,
+ 0xe9bc07aeUL, 0xa88d1cb7UL, 0x6bde319cUL, 0x2aef2a85UL, 0xed796bcaUL,
+ 0xac4870d3UL, 0x6f1b5df8UL, 0x2e2a46e1UL, 0xe136de66UL, 0xa007c57fUL,
+ 0x6354e854UL, 0x2265f34dUL, 0xe5f3b202UL, 0xa4c2a91bUL, 0x67918430UL,
+ 0x26a09f29UL, 0xb8aec5e4UL, 0xf99fdefdUL, 0x3accf3d6UL, 0x7bfde8cfUL,
+ 0xbc6ba980UL, 0xfd5ab299UL, 0x3e099fb2UL, 0x7f3884abUL, 0xb0241c2cUL,
+ 0xf1150735UL, 0x32462a1eUL, 0x73773107UL, 0xb4e17048UL, 0xf5d06b51UL,
+ 0x3683467aUL, 0x77b25d63UL, 0x4ed7facbUL, 0x0fe6e1d2UL, 0xccb5ccf9UL,
+ 0x8d84d7e0UL, 0x4a1296afUL, 0x0b238db6UL, 0xc870a09dUL, 0x8941bb84UL,
+ 0x465d2303UL, 0x076c381aUL, 0xc43f1531UL, 0x850e0e28UL, 0x42984f67UL,
+ 0x03a9547eUL, 0xc0fa7955UL, 0x81cb624cUL, 0x1fc53881UL, 0x5ef42398UL,
+ 0x9da70eb3UL, 0xdc9615aaUL, 0x1b0054e5UL, 0x5a314ffcUL, 0x996262d7UL,
+ 0xd85379ceUL, 0x174fe149UL, 0x567efa50UL, 0x952dd77bUL, 0xd41ccc62UL,
+ 0x138a8d2dUL, 0x52bb9634UL, 0x91e8bb1fUL, 0xd0d9a006UL, 0xecf37e5eUL,
+ 0xadc26547UL, 0x6e91486cUL, 0x2fa05375UL, 0xe836123aUL, 0xa9070923UL,
+ 0x6a542408UL, 0x2b653f11UL, 0xe479a796UL, 0xa548bc8fUL, 0x661b91a4UL,
+ 0x272a8abdUL, 0xe0bccbf2UL, 0xa18dd0ebUL, 0x62defdc0UL, 0x23efe6d9UL,
+ 0xbde1bc14UL, 0xfcd0a70dUL, 0x3f838a26UL, 0x7eb2913fUL, 0xb924d070UL,
+ 0xf815cb69UL, 0x3b46e642UL, 0x7a77fd5bUL, 0xb56b65dcUL, 0xf45a7ec5UL,
+ 0x370953eeUL, 0x763848f7UL, 0xb1ae09b8UL, 0xf09f12a1UL, 0x33cc3f8aUL,
+ 0x72fd2493UL
+ },
+ {
+ 0x00000000UL, 0x376ac201UL, 0x6ed48403UL, 0x59be4602UL, 0xdca80907UL,
+ 0xebc2cb06UL, 0xb27c8d04UL, 0x85164f05UL, 0xb851130eUL, 0x8f3bd10fUL,
+ 0xd685970dUL, 0xe1ef550cUL, 0x64f91a09UL, 0x5393d808UL, 0x0a2d9e0aUL,
+ 0x3d475c0bUL, 0x70a3261cUL, 0x47c9e41dUL, 0x1e77a21fUL, 0x291d601eUL,
+ 0xac0b2f1bUL, 0x9b61ed1aUL, 0xc2dfab18UL, 0xf5b56919UL, 0xc8f23512UL,
+ 0xff98f713UL, 0xa626b111UL, 0x914c7310UL, 0x145a3c15UL, 0x2330fe14UL,
+ 0x7a8eb816UL, 0x4de47a17UL, 0xe0464d38UL, 0xd72c8f39UL, 0x8e92c93bUL,
+ 0xb9f80b3aUL, 0x3cee443fUL, 0x0b84863eUL, 0x523ac03cUL, 0x6550023dUL,
+ 0x58175e36UL, 0x6f7d9c37UL, 0x36c3da35UL, 0x01a91834UL, 0x84bf5731UL,
+ 0xb3d59530UL, 0xea6bd332UL, 0xdd011133UL, 0x90e56b24UL, 0xa78fa925UL,
+ 0xfe31ef27UL, 0xc95b2d26UL, 0x4c4d6223UL, 0x7b27a022UL, 0x2299e620UL,
+ 0x15f32421UL, 0x28b4782aUL, 0x1fdeba2bUL, 0x4660fc29UL, 0x710a3e28UL,
+ 0xf41c712dUL, 0xc376b32cUL, 0x9ac8f52eUL, 0xada2372fUL, 0xc08d9a70UL,
+ 0xf7e75871UL, 0xae591e73UL, 0x9933dc72UL, 0x1c259377UL, 0x2b4f5176UL,
+ 0x72f11774UL, 0x459bd575UL, 0x78dc897eUL, 0x4fb64b7fUL, 0x16080d7dUL,
+ 0x2162cf7cUL, 0xa4748079UL, 0x931e4278UL, 0xcaa0047aUL, 0xfdcac67bUL,
+ 0xb02ebc6cUL, 0x87447e6dUL, 0xdefa386fUL, 0xe990fa6eUL, 0x6c86b56bUL,
+ 0x5bec776aUL, 0x02523168UL, 0x3538f369UL, 0x087faf62UL, 0x3f156d63UL,
+ 0x66ab2b61UL, 0x51c1e960UL, 0xd4d7a665UL, 0xe3bd6464UL, 0xba032266UL,
+ 0x8d69e067UL, 0x20cbd748UL, 0x17a11549UL, 0x4e1f534bUL, 0x7975914aUL,
+ 0xfc63de4fUL, 0xcb091c4eUL, 0x92b75a4cUL, 0xa5dd984dUL, 0x989ac446UL,
+ 0xaff00647UL, 0xf64e4045UL, 0xc1248244UL, 0x4432cd41UL, 0x73580f40UL,
+ 0x2ae64942UL, 0x1d8c8b43UL, 0x5068f154UL, 0x67023355UL, 0x3ebc7557UL,
+ 0x09d6b756UL, 0x8cc0f853UL, 0xbbaa3a52UL, 0xe2147c50UL, 0xd57ebe51UL,
+ 0xe839e25aUL, 0xdf53205bUL, 0x86ed6659UL, 0xb187a458UL, 0x3491eb5dUL,
+ 0x03fb295cUL, 0x5a456f5eUL, 0x6d2fad5fUL, 0x801b35e1UL, 0xb771f7e0UL,
+ 0xeecfb1e2UL, 0xd9a573e3UL, 0x5cb33ce6UL, 0x6bd9fee7UL, 0x3267b8e5UL,
+ 0x050d7ae4UL, 0x384a26efUL, 0x0f20e4eeUL, 0x569ea2ecUL, 0x61f460edUL,
+ 0xe4e22fe8UL, 0xd388ede9UL, 0x8a36abebUL, 0xbd5c69eaUL, 0xf0b813fdUL,
+ 0xc7d2d1fcUL, 0x9e6c97feUL, 0xa90655ffUL, 0x2c101afaUL, 0x1b7ad8fbUL,
+ 0x42c49ef9UL, 0x75ae5cf8UL, 0x48e900f3UL, 0x7f83c2f2UL, 0x263d84f0UL,
+ 0x115746f1UL, 0x944109f4UL, 0xa32bcbf5UL, 0xfa958df7UL, 0xcdff4ff6UL,
+ 0x605d78d9UL, 0x5737bad8UL, 0x0e89fcdaUL, 0x39e33edbUL, 0xbcf571deUL,
+ 0x8b9fb3dfUL, 0xd221f5ddUL, 0xe54b37dcUL, 0xd80c6bd7UL, 0xef66a9d6UL,
+ 0xb6d8efd4UL, 0x81b22dd5UL, 0x04a462d0UL, 0x33cea0d1UL, 0x6a70e6d3UL,
+ 0x5d1a24d2UL, 0x10fe5ec5UL, 0x27949cc4UL, 0x7e2adac6UL, 0x494018c7UL,
+ 0xcc5657c2UL, 0xfb3c95c3UL, 0xa282d3c1UL, 0x95e811c0UL, 0xa8af4dcbUL,
+ 0x9fc58fcaUL, 0xc67bc9c8UL, 0xf1110bc9UL, 0x740744ccUL, 0x436d86cdUL,
+ 0x1ad3c0cfUL, 0x2db902ceUL, 0x4096af91UL, 0x77fc6d90UL, 0x2e422b92UL,
+ 0x1928e993UL, 0x9c3ea696UL, 0xab546497UL, 0xf2ea2295UL, 0xc580e094UL,
+ 0xf8c7bc9fUL, 0xcfad7e9eUL, 0x9613389cUL, 0xa179fa9dUL, 0x246fb598UL,
+ 0x13057799UL, 0x4abb319bUL, 0x7dd1f39aUL, 0x3035898dUL, 0x075f4b8cUL,
+ 0x5ee10d8eUL, 0x698bcf8fUL, 0xec9d808aUL, 0xdbf7428bUL, 0x82490489UL,
+ 0xb523c688UL, 0x88649a83UL, 0xbf0e5882UL, 0xe6b01e80UL, 0xd1dadc81UL,
+ 0x54cc9384UL, 0x63a65185UL, 0x3a181787UL, 0x0d72d586UL, 0xa0d0e2a9UL,
+ 0x97ba20a8UL, 0xce0466aaUL, 0xf96ea4abUL, 0x7c78ebaeUL, 0x4b1229afUL,
+ 0x12ac6fadUL, 0x25c6adacUL, 0x1881f1a7UL, 0x2feb33a6UL, 0x765575a4UL,
+ 0x413fb7a5UL, 0xc429f8a0UL, 0xf3433aa1UL, 0xaafd7ca3UL, 0x9d97bea2UL,
+ 0xd073c4b5UL, 0xe71906b4UL, 0xbea740b6UL, 0x89cd82b7UL, 0x0cdbcdb2UL,
+ 0x3bb10fb3UL, 0x620f49b1UL, 0x55658bb0UL, 0x6822d7bbUL, 0x5f4815baUL,
+ 0x06f653b8UL, 0x319c91b9UL, 0xb48adebcUL, 0x83e01cbdUL, 0xda5e5abfUL,
+ 0xed3498beUL
+ },
+ {
+ 0x00000000UL, 0x6567bcb8UL, 0x8bc809aaUL, 0xeeafb512UL, 0x5797628fUL,
+ 0x32f0de37UL, 0xdc5f6b25UL, 0xb938d79dUL, 0xef28b4c5UL, 0x8a4f087dUL,
+ 0x64e0bd6fUL, 0x018701d7UL, 0xb8bfd64aUL, 0xddd86af2UL, 0x3377dfe0UL,
+ 0x56106358UL, 0x9f571950UL, 0xfa30a5e8UL, 0x149f10faUL, 0x71f8ac42UL,
+ 0xc8c07bdfUL, 0xada7c767UL, 0x43087275UL, 0x266fcecdUL, 0x707fad95UL,
+ 0x1518112dUL, 0xfbb7a43fUL, 0x9ed01887UL, 0x27e8cf1aUL, 0x428f73a2UL,
+ 0xac20c6b0UL, 0xc9477a08UL, 0x3eaf32a0UL, 0x5bc88e18UL, 0xb5673b0aUL,
+ 0xd00087b2UL, 0x6938502fUL, 0x0c5fec97UL, 0xe2f05985UL, 0x8797e53dUL,
+ 0xd1878665UL, 0xb4e03addUL, 0x5a4f8fcfUL, 0x3f283377UL, 0x8610e4eaUL,
+ 0xe3775852UL, 0x0dd8ed40UL, 0x68bf51f8UL, 0xa1f82bf0UL, 0xc49f9748UL,
+ 0x2a30225aUL, 0x4f579ee2UL, 0xf66f497fUL, 0x9308f5c7UL, 0x7da740d5UL,
+ 0x18c0fc6dUL, 0x4ed09f35UL, 0x2bb7238dUL, 0xc518969fUL, 0xa07f2a27UL,
+ 0x1947fdbaUL, 0x7c204102UL, 0x928ff410UL, 0xf7e848a8UL, 0x3d58149bUL,
+ 0x583fa823UL, 0xb6901d31UL, 0xd3f7a189UL, 0x6acf7614UL, 0x0fa8caacUL,
+ 0xe1077fbeUL, 0x8460c306UL, 0xd270a05eUL, 0xb7171ce6UL, 0x59b8a9f4UL,
+ 0x3cdf154cUL, 0x85e7c2d1UL, 0xe0807e69UL, 0x0e2fcb7bUL, 0x6b4877c3UL,
+ 0xa20f0dcbUL, 0xc768b173UL, 0x29c70461UL, 0x4ca0b8d9UL, 0xf5986f44UL,
+ 0x90ffd3fcUL, 0x7e5066eeUL, 0x1b37da56UL, 0x4d27b90eUL, 0x284005b6UL,
+ 0xc6efb0a4UL, 0xa3880c1cUL, 0x1ab0db81UL, 0x7fd76739UL, 0x9178d22bUL,
+ 0xf41f6e93UL, 0x03f7263bUL, 0x66909a83UL, 0x883f2f91UL, 0xed589329UL,
+ 0x546044b4UL, 0x3107f80cUL, 0xdfa84d1eUL, 0xbacff1a6UL, 0xecdf92feUL,
+ 0x89b82e46UL, 0x67179b54UL, 0x027027ecUL, 0xbb48f071UL, 0xde2f4cc9UL,
+ 0x3080f9dbUL, 0x55e74563UL, 0x9ca03f6bUL, 0xf9c783d3UL, 0x176836c1UL,
+ 0x720f8a79UL, 0xcb375de4UL, 0xae50e15cUL, 0x40ff544eUL, 0x2598e8f6UL,
+ 0x73888baeUL, 0x16ef3716UL, 0xf8408204UL, 0x9d273ebcUL, 0x241fe921UL,
+ 0x41785599UL, 0xafd7e08bUL, 0xcab05c33UL, 0x3bb659edUL, 0x5ed1e555UL,
+ 0xb07e5047UL, 0xd519ecffUL, 0x6c213b62UL, 0x094687daUL, 0xe7e932c8UL,
+ 0x828e8e70UL, 0xd49eed28UL, 0xb1f95190UL, 0x5f56e482UL, 0x3a31583aUL,
+ 0x83098fa7UL, 0xe66e331fUL, 0x08c1860dUL, 0x6da63ab5UL, 0xa4e140bdUL,
+ 0xc186fc05UL, 0x2f294917UL, 0x4a4ef5afUL, 0xf3762232UL, 0x96119e8aUL,
+ 0x78be2b98UL, 0x1dd99720UL, 0x4bc9f478UL, 0x2eae48c0UL, 0xc001fdd2UL,
+ 0xa566416aUL, 0x1c5e96f7UL, 0x79392a4fUL, 0x97969f5dUL, 0xf2f123e5UL,
+ 0x05196b4dUL, 0x607ed7f5UL, 0x8ed162e7UL, 0xebb6de5fUL, 0x528e09c2UL,
+ 0x37e9b57aUL, 0xd9460068UL, 0xbc21bcd0UL, 0xea31df88UL, 0x8f566330UL,
+ 0x61f9d622UL, 0x049e6a9aUL, 0xbda6bd07UL, 0xd8c101bfUL, 0x366eb4adUL,
+ 0x53090815UL, 0x9a4e721dUL, 0xff29cea5UL, 0x11867bb7UL, 0x74e1c70fUL,
+ 0xcdd91092UL, 0xa8beac2aUL, 0x46111938UL, 0x2376a580UL, 0x7566c6d8UL,
+ 0x10017a60UL, 0xfeaecf72UL, 0x9bc973caUL, 0x22f1a457UL, 0x479618efUL,
+ 0xa939adfdUL, 0xcc5e1145UL, 0x06ee4d76UL, 0x6389f1ceUL, 0x8d2644dcUL,
+ 0xe841f864UL, 0x51792ff9UL, 0x341e9341UL, 0xdab12653UL, 0xbfd69aebUL,
+ 0xe9c6f9b3UL, 0x8ca1450bUL, 0x620ef019UL, 0x07694ca1UL, 0xbe519b3cUL,
+ 0xdb362784UL, 0x35999296UL, 0x50fe2e2eUL, 0x99b95426UL, 0xfcdee89eUL,
+ 0x12715d8cUL, 0x7716e134UL, 0xce2e36a9UL, 0xab498a11UL, 0x45e63f03UL,
+ 0x208183bbUL, 0x7691e0e3UL, 0x13f65c5bUL, 0xfd59e949UL, 0x983e55f1UL,
+ 0x2106826cUL, 0x44613ed4UL, 0xaace8bc6UL, 0xcfa9377eUL, 0x38417fd6UL,
+ 0x5d26c36eUL, 0xb389767cUL, 0xd6eecac4UL, 0x6fd61d59UL, 0x0ab1a1e1UL,
+ 0xe41e14f3UL, 0x8179a84bUL, 0xd769cb13UL, 0xb20e77abUL, 0x5ca1c2b9UL,
+ 0x39c67e01UL, 0x80fea99cUL, 0xe5991524UL, 0x0b36a036UL, 0x6e511c8eUL,
+ 0xa7166686UL, 0xc271da3eUL, 0x2cde6f2cUL, 0x49b9d394UL, 0xf0810409UL,
+ 0x95e6b8b1UL, 0x7b490da3UL, 0x1e2eb11bUL, 0x483ed243UL, 0x2d596efbUL,
+ 0xc3f6dbe9UL, 0xa6916751UL, 0x1fa9b0ccUL, 0x7ace0c74UL, 0x9461b966UL,
+ 0xf10605deUL
+#endif
+ }
+};
-/* deflate.c -- compress data using the deflation algorithm\r
- * Copyright (C) 1995-2005 Jean-loup Gailly.\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/*\r
- * ALGORITHM\r
- *\r
- * The "deflation" process depends on being able to identify portions\r
- * of the input text which are identical to earlier input (within a\r
- * sliding window trailing behind the input currently being processed).\r
- *\r
- * The most straightforward technique turns out to be the fastest for\r
- * most input files: try all possible matches and select the longest.\r
- * The key feature of this algorithm is that insertions into the string\r
- * dictionary are very simple and thus fast, and deletions are avoided\r
- * completely. Insertions are performed at each input character, whereas\r
- * string matches are performed only when the previous match ends. So it\r
- * is preferable to spend more time in matches to allow very fast string\r
- * insertions and avoid deletions. The matching algorithm for small\r
- * strings is inspired from that of Rabin & Karp. A brute force approach\r
- * is used to find longer strings when a small match has been found.\r
- * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze\r
- * (by Leonid Broukhis).\r
- * A previous version of this file used a more sophisticated algorithm\r
- * (by Fiala and Greene) which is guaranteed to run in linear amortized\r
- * time, but has a larger average cost, uses more memory and is patented.\r
- * However the F&G algorithm may be faster for some highly redundant\r
- * files if the parameter max_chain_length (described below) is too large.\r
- *\r
- * ACKNOWLEDGEMENTS\r
- *\r
- * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and\r
- * I found it in 'freeze' written by Leonid Broukhis.\r
- * Thanks to many people for bug reports and testing.\r
- *\r
- * REFERENCES\r
- *\r
- * Deutsch, L.P.,"DEFLATE Compressed Data Format Specification".\r
- * Available in http://www.ietf.org/rfc/rfc1951.txt\r
- *\r
- * A description of the Rabin and Karp algorithm is given in the book\r
- * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.\r
- *\r
- * Fiala,E.R., and Greene,D.H.\r
- * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595\r
- *\r
- */\r
-\r
-/* @(#) $Id$ */\r
-\r
-#include "deflate.h"\r
-\r
-const char deflate_copyright[] =\r
- " deflate 1.2.3 Copyright 1995-2005 Jean-loup Gailly ";\r
-/*\r
- If you use the zlib library in a product, an acknowledgment is welcome\r
- in the documentation of your product. If for some reason you cannot\r
- include such an acknowledgment, I would appreciate that you keep this\r
- copyright string in the executable of your product.\r
- */\r
-\r
-/* ===========================================================================\r
- * Function prototypes.\r
- */\r
-typedef enum {\r
- need_more, /* block not completed, need more input or more output */\r
- block_done, /* block flush performed */\r
- finish_started, /* finish started, need only more output at next deflate */\r
- finish_done /* finish done, accept no more input or output */\r
-} block_state;\r
-\r
-typedef block_state (*compress_func) OF((deflate_state *s, int flush));\r
-/* Compression function. Returns the block state after the call. */\r
-\r
-local void fill_window OF((deflate_state *s));\r
-local block_state deflate_stored OF((deflate_state *s, int flush));\r
-local block_state deflate_fast OF((deflate_state *s, int flush));\r
-#ifndef FASTEST\r
-local block_state deflate_slow OF((deflate_state *s, int flush));\r
-#endif\r
-local void lm_init OF((deflate_state *s));\r
-local void putShortMSB OF((deflate_state *s, uInt b));\r
-local void flush_pending OF((z_streamp strm));\r
-local int read_buf OF((z_streamp strm, Bytef *buf, unsigned size));\r
-#ifndef FASTEST\r
-#ifdef ASMV\r
- void match_init OF((void)); /* asm code initialization */\r
- uInt longest_match OF((deflate_state *s, IPos cur_match));\r
-#else\r
-local uInt longest_match OF((deflate_state *s, IPos cur_match));\r
-#endif\r
-#endif\r
-local uInt longest_match_fast OF((deflate_state *s, IPos cur_match));\r
-\r
-#ifdef DEBUG\r
-local void check_match OF((deflate_state *s, IPos start, IPos match,\r
- int length));\r
-#endif\r
-\r
-/* ===========================================================================\r
- * Local data\r
- */\r
-\r
-#define NIL 0\r
-/* Tail of hash chains */\r
-\r
-#ifndef TOO_FAR\r
-# define TOO_FAR 4096\r
-#endif\r
-/* Matches of length 3 are discarded if their distance exceeds TOO_FAR */\r
-\r
-#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)\r
-/* Minimum amount of lookahead, except at the end of the input file.\r
- * See deflate.c for comments about the MIN_MATCH+1.\r
- */\r
-\r
-/* Values for max_lazy_match, good_match and max_chain_length, depending on\r
- * the desired pack level (0..9). The values given below have been tuned to\r
- * exclude worst case performance for pathological files. Better values may be\r
- * found for specific files.\r
- */\r
-typedef struct config_s {\r
- ush good_length; /* reduce lazy search above this match length */\r
- ush max_lazy; /* do not perform lazy search above this match length */\r
- ush nice_length; /* quit search above this match length */\r
- ush max_chain;\r
- compress_func func;\r
-} config;\r
-\r
-#ifdef FASTEST\r
-local const config configuration_table[2] = {\r
-/* good lazy nice chain */\r
-/* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */\r
-/* 1 */ {4, 4, 8, 4, deflate_fast}}; /* max speed, no lazy matches */\r
-#else\r
-local const config configuration_table[10] = {\r
-/* good lazy nice chain */\r
-/* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */\r
-/* 1 */ {4, 4, 8, 4, deflate_fast}, /* max speed, no lazy matches */\r
-/* 2 */ {4, 5, 16, 8, deflate_fast},\r
-/* 3 */ {4, 6, 32, 32, deflate_fast},\r
-\r
-/* 4 */ {4, 4, 16, 16, deflate_slow}, /* lazy matches */\r
-/* 5 */ {8, 16, 32, 32, deflate_slow},\r
-/* 6 */ {8, 16, 128, 128, deflate_slow},\r
-/* 7 */ {8, 32, 128, 256, deflate_slow},\r
-/* 8 */ {32, 128, 258, 1024, deflate_slow},\r
-/* 9 */ {32, 258, 258, 4096, deflate_slow}}; /* max compression */\r
-#endif\r
-\r
-/* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4\r
- * For deflate_fast() (levels <= 3) good is ignored and lazy has a different\r
- * meaning.\r
- */\r
-\r
-#define EQUAL 0\r
-/* result of memcmp for equal strings */\r
-\r
-#ifndef NO_DUMMY_DECL\r
-struct static_tree_desc_s {int dummy;}; /* for buggy compilers */\r
-#endif\r
-\r
-/* ===========================================================================\r
- * Update a hash value with the given input byte\r
- * IN assertion: all calls to to UPDATE_HASH are made with consecutive\r
- * input characters, so that a running hash key can be computed from the\r
- * previous key instead of complete recalculation each time.\r
- */\r
-#define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask)\r
-\r
-\r
-/* ===========================================================================\r
- * Insert string str in the dictionary and set match_head to the previous head\r
- * of the hash chain (the most recent string with same hash key). Return\r
- * the previous length of the hash chain.\r
- * If this file is compiled with -DFASTEST, the compression level is forced\r
- * to 1, and no hash chains are maintained.\r
- * IN assertion: all calls to to INSERT_STRING are made with consecutive\r
- * input characters and the first MIN_MATCH bytes of str are valid\r
- * (except for the last MIN_MATCH-1 bytes of the input file).\r
- */\r
-#ifdef FASTEST\r
-#define INSERT_STRING(s, str, match_head) \\r
- (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \\r
- match_head = s->head[s->ins_h], \\r
- s->head[s->ins_h] = (Pos)(str))\r
-#else\r
-#define INSERT_STRING(s, str, match_head) \\r
- (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \\r
- match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \\r
- s->head[s->ins_h] = (Pos)(str))\r
-#endif\r
-\r
-/* ===========================================================================\r
- * Initialize the hash table (avoiding 64K overflow for 16 bit systems).\r
- * prev[] will be initialized on the fly.\r
- */\r
-#define CLEAR_HASH(s) \\r
- s->head[s->hash_size-1] = NIL; \\r
- zmemzero((Bytef *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflateInit_(strm, level, version, stream_size)\r
- z_streamp strm;\r
- int level;\r
- const char *version;\r
- int stream_size;\r
-{\r
- return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL,\r
- Z_DEFAULT_STRATEGY, version, stream_size);\r
- /* To do: ignore strm->next_in if we use it as window */\r
-}\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy,\r
- version, stream_size)\r
- z_streamp strm;\r
- int level;\r
- int method;\r
- int windowBits;\r
- int memLevel;\r
- int strategy;\r
- const char *version;\r
- int stream_size;\r
-{\r
- deflate_state *s;\r
- int wrap = 1;\r
- static const char my_version[] = ZLIB_VERSION;\r
-\r
- ushf *overlay;\r
- /* We overlay pending_buf and d_buf+l_buf. This works since the average\r
- * output size for (length,distance) codes is <= 24 bits.\r
- */\r
-\r
- if (version == Z_NULL || version[0] != my_version[0] ||\r
- stream_size != sizeof(z_stream)) {\r
- return Z_VERSION_ERROR;\r
- }\r
- if (strm == Z_NULL) return Z_STREAM_ERROR;\r
-\r
- strm->msg = Z_NULL;\r
- if (strm->zalloc == (alloc_func)0) {\r
- strm->zalloc = zcalloc;\r
- strm->opaque = (voidpf)0;\r
- }\r
- if (strm->zfree == (free_func)0) strm->zfree = zcfree;\r
-\r
-#ifdef FASTEST\r
- if (level != 0) level = 1;\r
-#else\r
- if (level == Z_DEFAULT_COMPRESSION) level = 6;\r
-#endif\r
-\r
- if (windowBits < 0) { /* suppress zlib wrapper */\r
- wrap = 0;\r
- windowBits = -windowBits;\r
- }\r
-#ifdef GZIP\r
- else if (windowBits > 15) {\r
- wrap = 2; /* write gzip wrapper instead */\r
- windowBits -= 16;\r
- }\r
-#endif\r
- if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED ||\r
- windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\r
- strategy < 0 || strategy > Z_FIXED) {\r
- return Z_STREAM_ERROR;\r
- }\r
- if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */\r
- s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state));\r
- if (s == Z_NULL) return Z_MEM_ERROR;\r
- strm->state = (struct internal_state FAR *)s;\r
- s->strm = strm;\r
-\r
- s->wrap = wrap;\r
- s->gzhead = Z_NULL;\r
- s->w_bits = windowBits;\r
- s->w_size = 1 << s->w_bits;\r
- s->w_mask = s->w_size - 1;\r
-\r
- s->hash_bits = memLevel + 7;\r
- s->hash_size = 1 << s->hash_bits;\r
- s->hash_mask = s->hash_size - 1;\r
- s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);\r
-\r
- s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));\r
- s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos));\r
- s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos));\r
-\r
- s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\r
-\r
- overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\r
- s->pending_buf = (uchf *) overlay;\r
- s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);\r
-\r
- if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||\r
- s->pending_buf == Z_NULL) {\r
- s->status = FINISH_STATE;\r
- strm->msg = (char*)ERR_MSG(Z_MEM_ERROR);\r
- deflateEnd (strm);\r
- return Z_MEM_ERROR;\r
- }\r
- s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\r
- s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\r
-\r
- s->level = level;\r
- s->strategy = strategy;\r
- s->method = (Byte)method;\r
-\r
- return deflateReset(strm);\r
-}\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength)\r
- z_streamp strm;\r
- const Bytef *dictionary;\r
- uInt dictLength;\r
-{\r
- deflate_state *s;\r
- uInt length = dictLength;\r
- uInt n;\r
- IPos hash_head = 0;\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL ||\r
- strm->state->wrap == 2 ||\r
- (strm->state->wrap == 1 && strm->state->status != INIT_STATE))\r
- return Z_STREAM_ERROR;\r
-\r
- s = strm->state;\r
- if (s->wrap)\r
- strm->adler = adler32(strm->adler, dictionary, dictLength);\r
-\r
- if (length < MIN_MATCH) return Z_OK;\r
- if (length > MAX_DIST(s)) {\r
- length = MAX_DIST(s);\r
- dictionary += dictLength - length; /* use the tail of the dictionary */\r
- }\r
- zmemcpy(s->window, dictionary, length);\r
- s->strstart = length;\r
- s->block_start = (long)length;\r
-\r
- /* Insert all strings in the hash table (except for the last two bytes).\r
- * s->lookahead stays null, so s->ins_h will be recomputed at the next\r
- * call of fill_window.\r
- */\r
- s->ins_h = s->window[0];\r
- UPDATE_HASH(s, s->ins_h, s->window[1]);\r
- for (n = 0; n <= length - MIN_MATCH; n++) {\r
- INSERT_STRING(s, n, hash_head);\r
- }\r
- if (hash_head) hash_head = 0; /* to make compiler happy */\r
- return Z_OK;\r
-}\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflateReset (strm)\r
- z_streamp strm;\r
-{\r
- deflate_state *s;\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL ||\r
- strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0) {\r
- return Z_STREAM_ERROR;\r
- }\r
-\r
- strm->total_in = strm->total_out = 0;\r
- strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */\r
- strm->data_type = Z_UNKNOWN;\r
-\r
- s = (deflate_state *)strm->state;\r
- s->pending = 0;\r
- s->pending_out = s->pending_buf;\r
-\r
- if (s->wrap < 0) {\r
- s->wrap = -s->wrap; /* was made negative by deflate(..., Z_FINISH); */\r
- }\r
- s->status = s->wrap ? INIT_STATE : BUSY_STATE;\r
- strm->adler =\r
-#ifdef GZIP\r
- s->wrap == 2 ? crc32(0L, Z_NULL, 0) :\r
-#endif\r
- adler32(0L, Z_NULL, 0);\r
- s->last_flush = Z_NO_FLUSH;\r
-\r
- _tr_init(s);\r
- lm_init(s);\r
-\r
- return Z_OK;\r
-}\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflateSetHeader (strm, head)\r
- z_streamp strm;\r
- gz_headerp head;\r
-{\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- if (strm->state->wrap != 2) return Z_STREAM_ERROR;\r
- strm->state->gzhead = head;\r
- return Z_OK;\r
-}\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflatePrime (strm, bits, value)\r
- z_streamp strm;\r
- int bits;\r
- int value;\r
-{\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- strm->state->bi_valid = bits;\r
- strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));\r
- return Z_OK;\r
-}\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflateParams(strm, level, strategy)\r
- z_streamp strm;\r
- int level;\r
- int strategy;\r
-{\r
- deflate_state *s;\r
- compress_func func;\r
- int err = Z_OK;\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- s = strm->state;\r
-\r
-#ifdef FASTEST\r
- if (level != 0) level = 1;\r
-#else\r
- if (level == Z_DEFAULT_COMPRESSION) level = 6;\r
-#endif\r
- if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {\r
- return Z_STREAM_ERROR;\r
- }\r
- func = configuration_table[s->level].func;\r
-\r
- if (func != configuration_table[level].func && strm->total_in != 0) {\r
- /* Flush the last buffer: */\r
- err = deflate(strm, Z_PARTIAL_FLUSH);\r
- }\r
- if (s->level != level) {\r
- s->level = level;\r
- s->max_lazy_match = configuration_table[level].max_lazy;\r
- s->good_match = configuration_table[level].good_length;\r
- s->nice_match = configuration_table[level].nice_length;\r
- s->max_chain_length = configuration_table[level].max_chain;\r
- }\r
- s->strategy = strategy;\r
- return err;\r
-}\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain)\r
- z_streamp strm;\r
- int good_length;\r
- int max_lazy;\r
- int nice_length;\r
- int max_chain;\r
-{\r
- deflate_state *s;\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- s = strm->state;\r
- s->good_match = good_length;\r
- s->max_lazy_match = max_lazy;\r
- s->nice_match = nice_length;\r
- s->max_chain_length = max_chain;\r
- return Z_OK;\r
-}\r
-\r
-/* =========================================================================\r
- * For the default windowBits of 15 and memLevel of 8, this function returns\r
- * a close to exact, as well as small, upper bound on the compressed size.\r
- * They are coded as constants here for a reason--if the #define's are\r
- * changed, then this function needs to be changed as well. The return\r
- * value for 15 and 8 only works for those exact settings.\r
- *\r
- * For any setting other than those defaults for windowBits and memLevel,\r
- * the value returned is a conservative worst case for the maximum expansion\r
- * resulting from using fixed blocks instead of stored blocks, which deflate\r
- * can emit on compressed data for some combinations of the parameters.\r
- *\r
- * This function could be more sophisticated to provide closer upper bounds\r
- * for every combination of windowBits and memLevel, as well as wrap.\r
- * But even the conservative upper bound of about 14% expansion does not\r
- * seem onerous for output buffer allocation.\r
- */\r
-uLong ZEXPORT deflateBound(strm, sourceLen)\r
- z_streamp strm;\r
- uLong sourceLen;\r
-{\r
- deflate_state *s;\r
- uLong destLen;\r
-\r
- /* conservative upper bound */\r
- destLen = sourceLen +\r
- ((sourceLen + 7) >> 3) + ((sourceLen + 63) >> 6) + 11;\r
-\r
- /* if can't get parameters, return conservative bound */\r
- if (strm == Z_NULL || strm->state == Z_NULL)\r
- return destLen;\r
-\r
- /* if not default parameters, return conservative bound */\r
- s = strm->state;\r
- if (s->w_bits != 15 || s->hash_bits != 8 + 7)\r
- return destLen;\r
-\r
- /* default settings: return tight bound for that case */\r
- return compressBound(sourceLen);\r
-}\r
-\r
-/* =========================================================================\r
- * Put a short in the pending buffer. The 16-bit value is put in MSB order.\r
- * IN assertion: the stream state is correct and there is enough room in\r
- * pending_buf.\r
- */\r
-local void putShortMSB (s, b)\r
- deflate_state *s;\r
- uInt b;\r
-{\r
- put_byte(s, (Byte)(b >> 8));\r
- put_byte(s, (Byte)(b & 0xff));\r
-}\r
-\r
-/* =========================================================================\r
- * Flush as much pending output as possible. All deflate() output goes\r
- * through this function so some applications may wish to modify it\r
- * to avoid allocating a large strm->next_out buffer and copying into it.\r
- * (See also read_buf()).\r
- */\r
-local void flush_pending(strm)\r
- z_streamp strm;\r
-{\r
- unsigned len = strm->state->pending;\r
-\r
- if (len > strm->avail_out) len = strm->avail_out;\r
- if (len == 0) return;\r
-\r
- zmemcpy(strm->next_out, strm->state->pending_out, len);\r
- strm->next_out += len;\r
- strm->state->pending_out += len;\r
- strm->total_out += len;\r
- strm->avail_out -= len;\r
- strm->state->pending -= len;\r
- if (strm->state->pending == 0) {\r
- strm->state->pending_out = strm->state->pending_buf;\r
- }\r
-}\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflate (strm, flush)\r
- z_streamp strm;\r
- int flush;\r
-{\r
- int old_flush; /* value of flush param for previous deflate call */\r
- deflate_state *s;\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL ||\r
- flush > Z_FINISH || flush < 0) {\r
- return Z_STREAM_ERROR;\r
- }\r
- s = strm->state;\r
-\r
- if (strm->next_out == Z_NULL ||\r
- (strm->next_in == Z_NULL && strm->avail_in != 0) ||\r
- (s->status == FINISH_STATE && flush != Z_FINISH)) {\r
- ERR_RETURN(strm, Z_STREAM_ERROR);\r
- }\r
- if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR);\r
-\r
- s->strm = strm; /* just in case */\r
- old_flush = s->last_flush;\r
- s->last_flush = flush;\r
-\r
- /* Write the header */\r
- if (s->status == INIT_STATE) {\r
-#ifdef GZIP\r
- if (s->wrap == 2) {\r
- strm->adler = crc32(0L, Z_NULL, 0);\r
- put_byte(s, 31);\r
- put_byte(s, 139);\r
- put_byte(s, 8);\r
- if (s->gzhead == NULL) {\r
- put_byte(s, 0);\r
- put_byte(s, 0);\r
- put_byte(s, 0);\r
- put_byte(s, 0);\r
- put_byte(s, 0);\r
- put_byte(s, s->level == 9 ? 2 :\r
- (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?\r
- 4 : 0));\r
- put_byte(s, OS_CODE);\r
- s->status = BUSY_STATE;\r
- }\r
- else {\r
- put_byte(s, (s->gzhead->text ? 1 : 0) +\r
- (s->gzhead->hcrc ? 2 : 0) +\r
- (s->gzhead->extra == Z_NULL ? 0 : 4) +\r
- (s->gzhead->name == Z_NULL ? 0 : 8) +\r
- (s->gzhead->comment == Z_NULL ? 0 : 16)\r
- );\r
- put_byte(s, (Byte)(s->gzhead->time & 0xff));\r
- put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff));\r
- put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff));\r
- put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff));\r
- put_byte(s, s->level == 9 ? 2 :\r
- (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?\r
- 4 : 0));\r
- put_byte(s, s->gzhead->os & 0xff);\r
- if (s->gzhead->extra != NULL) {\r
- put_byte(s, s->gzhead->extra_len & 0xff);\r
- put_byte(s, (s->gzhead->extra_len >> 8) & 0xff);\r
- }\r
- if (s->gzhead->hcrc)\r
- strm->adler = crc32(strm->adler, s->pending_buf,\r
- s->pending);\r
- s->gzindex = 0;\r
- s->status = EXTRA_STATE;\r
- }\r
- }\r
- else\r
-#endif\r
- {\r
- uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;\r
- uInt level_flags;\r
-\r
- if (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2)\r
- level_flags = 0;\r
- else if (s->level < 6)\r
- level_flags = 1;\r
- else if (s->level == 6)\r
- level_flags = 2;\r
- else\r
- level_flags = 3;\r
- header |= (level_flags << 6);\r
- if (s->strstart != 0) header |= PRESET_DICT;\r
- header += 31 - (header % 31);\r
-\r
- s->status = BUSY_STATE;\r
- putShortMSB(s, header);\r
-\r
- /* Save the adler32 of the preset dictionary: */\r
- if (s->strstart != 0) {\r
- putShortMSB(s, (uInt)(strm->adler >> 16));\r
- putShortMSB(s, (uInt)(strm->adler & 0xffff));\r
- }\r
- strm->adler = adler32(0L, Z_NULL, 0);\r
- }\r
- }\r
-#ifdef GZIP\r
- if (s->status == EXTRA_STATE) {\r
- if (s->gzhead->extra != NULL) {\r
- uInt beg = s->pending; /* start of bytes to update crc */\r
-\r
- while (s->gzindex < (s->gzhead->extra_len & 0xffff)) {\r
- if (s->pending == s->pending_buf_size) {\r
- if (s->gzhead->hcrc && s->pending > beg)\r
- strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
- s->pending - beg);\r
- flush_pending(strm);\r
- beg = s->pending;\r
- if (s->pending == s->pending_buf_size)\r
- break;\r
- }\r
- put_byte(s, s->gzhead->extra[s->gzindex]);\r
- s->gzindex++;\r
- }\r
- if (s->gzhead->hcrc && s->pending > beg)\r
- strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
- s->pending - beg);\r
- if (s->gzindex == s->gzhead->extra_len) {\r
- s->gzindex = 0;\r
- s->status = NAME_STATE;\r
- }\r
- }\r
- else\r
- s->status = NAME_STATE;\r
- }\r
- if (s->status == NAME_STATE) {\r
- if (s->gzhead->name != NULL) {\r
- uInt beg = s->pending; /* start of bytes to update crc */\r
- int val;\r
-\r
- do {\r
- if (s->pending == s->pending_buf_size) {\r
- if (s->gzhead->hcrc && s->pending > beg)\r
- strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
- s->pending - beg);\r
- flush_pending(strm);\r
- beg = s->pending;\r
- if (s->pending == s->pending_buf_size) {\r
- val = 1;\r
- break;\r
- }\r
- }\r
- val = s->gzhead->name[s->gzindex++];\r
- put_byte(s, val);\r
- } while (val != 0);\r
- if (s->gzhead->hcrc && s->pending > beg)\r
- strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
- s->pending - beg);\r
- if (val == 0) {\r
- s->gzindex = 0;\r
- s->status = COMMENT_STATE;\r
- }\r
- }\r
- else\r
- s->status = COMMENT_STATE;\r
- }\r
- if (s->status == COMMENT_STATE) {\r
- if (s->gzhead->comment != NULL) {\r
- uInt beg = s->pending; /* start of bytes to update crc */\r
- int val;\r
-\r
- do {\r
- if (s->pending == s->pending_buf_size) {\r
- if (s->gzhead->hcrc && s->pending > beg)\r
- strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
- s->pending - beg);\r
- flush_pending(strm);\r
- beg = s->pending;\r
- if (s->pending == s->pending_buf_size) {\r
- val = 1;\r
- break;\r
- }\r
- }\r
- val = s->gzhead->comment[s->gzindex++];\r
- put_byte(s, val);\r
- } while (val != 0);\r
- if (s->gzhead->hcrc && s->pending > beg)\r
- strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
- s->pending - beg);\r
- if (val == 0)\r
- s->status = HCRC_STATE;\r
- }\r
- else\r
- s->status = HCRC_STATE;\r
- }\r
- if (s->status == HCRC_STATE) {\r
- if (s->gzhead->hcrc) {\r
- if (s->pending + 2 > s->pending_buf_size)\r
- flush_pending(strm);\r
- if (s->pending + 2 <= s->pending_buf_size) {\r
- put_byte(s, (Byte)(strm->adler & 0xff));\r
- put_byte(s, (Byte)((strm->adler >> 8) & 0xff));\r
- strm->adler = crc32(0L, Z_NULL, 0);\r
- s->status = BUSY_STATE;\r
- }\r
- }\r
- else\r
- s->status = BUSY_STATE;\r
- }\r
-#endif\r
-\r
- /* Flush as much pending output as possible */\r
- if (s->pending != 0) {\r
- flush_pending(strm);\r
- if (strm->avail_out == 0) {\r
- /* Since avail_out is 0, deflate will be called again with\r
- * more output space, but possibly with both pending and\r
- * avail_in equal to zero. There won't be anything to do,\r
- * but this is not an error situation so make sure we\r
- * return OK instead of BUF_ERROR at next call of deflate:\r
- */\r
- s->last_flush = -1;\r
- return Z_OK;\r
- }\r
-\r
- /* Make sure there is something to do and avoid duplicate consecutive\r
- * flushes. For repeated and useless calls with Z_FINISH, we keep\r
- * returning Z_STREAM_END instead of Z_BUF_ERROR.\r
- */\r
- } else if (strm->avail_in == 0 && flush <= old_flush &&\r
- flush != Z_FINISH) {\r
- ERR_RETURN(strm, Z_BUF_ERROR);\r
- }\r
-\r
- /* User must not provide more input after the first FINISH: */\r
- if (s->status == FINISH_STATE && strm->avail_in != 0) {\r
- ERR_RETURN(strm, Z_BUF_ERROR);\r
- }\r
-\r
- /* Start a new block or continue the current one.\r
- */\r
- if (strm->avail_in != 0 || s->lookahead != 0 ||\r
- (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) {\r
- block_state bstate;\r
-\r
- bstate = (*(configuration_table[s->level].func))(s, flush);\r
-\r
- if (bstate == finish_started || bstate == finish_done) {\r
- s->status = FINISH_STATE;\r
- }\r
- if (bstate == need_more || bstate == finish_started) {\r
- if (strm->avail_out == 0) {\r
- s->last_flush = -1; /* avoid BUF_ERROR next call, see above */\r
- }\r
- return Z_OK;\r
- /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\r
- * of deflate should use the same flush parameter to make sure\r
- * that the flush is complete. So we don't have to output an\r
- * empty block here, this will be done at next call. This also\r
- * ensures that for a very small output buffer, we emit at most\r
- * one empty block.\r
- */\r
- }\r
- if (bstate == block_done) {\r
- if (flush == Z_PARTIAL_FLUSH) {\r
- _tr_align(s);\r
- } else { /* FULL_FLUSH or SYNC_FLUSH */\r
- _tr_stored_block(s, (char*)0, 0L, 0);\r
- /* For a full flush, this empty block will be recognized\r
- * as a special marker by inflate_sync().\r
- */\r
- if (flush == Z_FULL_FLUSH) {\r
- CLEAR_HASH(s); /* forget history */\r
- }\r
- }\r
- flush_pending(strm);\r
- if (strm->avail_out == 0) {\r
- s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */\r
- return Z_OK;\r
- }\r
- }\r
- }\r
- Assert(strm->avail_out > 0, "bug2");\r
-\r
- if (flush != Z_FINISH) return Z_OK;\r
- if (s->wrap <= 0) return Z_STREAM_END;\r
-\r
- /* Write the trailer */\r
-#ifdef GZIP\r
- if (s->wrap == 2) {\r
- put_byte(s, (Byte)(strm->adler & 0xff));\r
- put_byte(s, (Byte)((strm->adler >> 8) & 0xff));\r
- put_byte(s, (Byte)((strm->adler >> 16) & 0xff));\r
- put_byte(s, (Byte)((strm->adler >> 24) & 0xff));\r
- put_byte(s, (Byte)(strm->total_in & 0xff));\r
- put_byte(s, (Byte)((strm->total_in >> 8) & 0xff));\r
- put_byte(s, (Byte)((strm->total_in >> 16) & 0xff));\r
- put_byte(s, (Byte)((strm->total_in >> 24) & 0xff));\r
- }\r
- else\r
-#endif\r
- {\r
- putShortMSB(s, (uInt)(strm->adler >> 16));\r
- putShortMSB(s, (uInt)(strm->adler & 0xffff));\r
- }\r
- flush_pending(strm);\r
- /* If avail_out is zero, the application will call deflate again\r
- * to flush the rest.\r
- */\r
- if (s->wrap > 0) s->wrap = -s->wrap; /* write the trailer only once! */\r
- return s->pending != 0 ? Z_OK : Z_STREAM_END;\r
-}\r
-\r
-/* ========================================================================= */\r
-int ZEXPORT deflateEnd (strm)\r
- z_streamp strm;\r
-{\r
- int status;\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
-\r
- status = strm->state->status;\r
- if (status != INIT_STATE &&\r
- status != EXTRA_STATE &&\r
- status != NAME_STATE &&\r
- status != COMMENT_STATE &&\r
- status != HCRC_STATE &&\r
- status != BUSY_STATE &&\r
- status != FINISH_STATE) {\r
- return Z_STREAM_ERROR;\r
- }\r
-\r
- /* Deallocate in reverse order of allocations: */\r
- TRY_FREE(strm, strm->state->pending_buf);\r
- TRY_FREE(strm, strm->state->head);\r
- TRY_FREE(strm, strm->state->prev);\r
- TRY_FREE(strm, strm->state->window);\r
-\r
- ZFREE(strm, strm->state);\r
- strm->state = Z_NULL;\r
-\r
- return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK;\r
-}\r
-\r
-/* =========================================================================\r
- * Copy the source state to the destination state.\r
- * To simplify the source, this is not supported for 16-bit MSDOS (which\r
- * doesn't have enough memory anyway to duplicate compression states).\r
- */\r
-int ZEXPORT deflateCopy (dest, source)\r
- z_streamp dest;\r
- z_streamp source;\r
-{\r
-#ifdef MAXSEG_64K\r
- return Z_STREAM_ERROR;\r
-#else\r
- deflate_state *ds;\r
- deflate_state *ss;\r
- ushf *overlay;\r
-\r
-\r
- if (source == Z_NULL || dest == Z_NULL || source->state == Z_NULL) {\r
- return Z_STREAM_ERROR;\r
- }\r
-\r
- ss = source->state;\r
-\r
- zmemcpy(dest, source, sizeof(z_stream));\r
-\r
- ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state));\r
- if (ds == Z_NULL) return Z_MEM_ERROR;\r
- dest->state = (struct internal_state FAR *) ds;\r
- zmemcpy(ds, ss, sizeof(deflate_state));\r
- ds->strm = dest;\r
-\r
- ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));\r
- ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos));\r
- ds->head = (Posf *) ZALLOC(dest, ds->hash_size, sizeof(Pos));\r
- overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);\r
- ds->pending_buf = (uchf *) overlay;\r
-\r
- if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||\r
- ds->pending_buf == Z_NULL) {\r
- deflateEnd (dest);\r
- return Z_MEM_ERROR;\r
- }\r
- /* following zmemcpy do not work for 16-bit MSDOS */\r
- zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));\r
- zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));\r
- zmemcpy(ds->head, ss->head, ds->hash_size * sizeof(Pos));\r
- zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);\r
-\r
- ds->pending_out = ds->pending_buf + (ss->pending_out - ss->pending_buf);\r
- ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);\r
- ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;\r
-\r
- ds->l_desc.dyn_tree = ds->dyn_ltree;\r
- ds->d_desc.dyn_tree = ds->dyn_dtree;\r
- ds->bl_desc.dyn_tree = ds->bl_tree;\r
-\r
- return Z_OK;\r
-#endif /* MAXSEG_64K */\r
-}\r
-\r
-/* ===========================================================================\r
- * Read a new buffer from the current input stream, update the adler32\r
- * and total number of bytes read. All deflate() input goes through\r
- * this function so some applications may wish to modify it to avoid\r
- * allocating a large strm->next_in buffer and copying from it.\r
- * (See also flush_pending()).\r
- */\r
-local int read_buf(strm, buf, size)\r
- z_streamp strm;\r
- Bytef *buf;\r
- unsigned size;\r
-{\r
- unsigned len = strm->avail_in;\r
-\r
- if (len > size) len = size;\r
- if (len == 0) return 0;\r
-\r
- strm->avail_in -= len;\r
-\r
- if (strm->state->wrap == 1) {\r
- strm->adler = adler32(strm->adler, strm->next_in, len);\r
- }\r
-#ifdef GZIP\r
- else if (strm->state->wrap == 2) {\r
- strm->adler = crc32(strm->adler, strm->next_in, len);\r
- }\r
-#endif\r
- zmemcpy(buf, strm->next_in, len);\r
- strm->next_in += len;\r
- strm->total_in += len;\r
-\r
- return (int)len;\r
-}\r
-\r
-/* ===========================================================================\r
- * Initialize the "longest match" routines for a new zlib stream\r
- */\r
-local void lm_init (s)\r
- deflate_state *s;\r
-{\r
- s->window_size = (ulg)2L*s->w_size;\r
-\r
- CLEAR_HASH(s);\r
-\r
- /* Set the default configuration parameters:\r
- */\r
- s->max_lazy_match = configuration_table[s->level].max_lazy;\r
- s->good_match = configuration_table[s->level].good_length;\r
- s->nice_match = configuration_table[s->level].nice_length;\r
- s->max_chain_length = configuration_table[s->level].max_chain;\r
-\r
- s->strstart = 0;\r
- s->block_start = 0L;\r
- s->lookahead = 0;\r
- s->match_length = s->prev_length = MIN_MATCH-1;\r
- s->match_available = 0;\r
- s->ins_h = 0;\r
-#ifndef FASTEST\r
-#ifdef ASMV\r
- match_init(); /* initialize the asm code */\r
-#endif\r
-#endif\r
-}\r
-\r
-#ifndef FASTEST\r
-/* ===========================================================================\r
- * Set match_start to the longest match starting at the given string and\r
- * return its length. Matches shorter or equal to prev_length are discarded,\r
- * in which case the result is equal to prev_length and match_start is\r
- * garbage.\r
- * IN assertions: cur_match is the head of the hash chain for the current\r
- * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\r
- * OUT assertion: the match length is not greater than s->lookahead.\r
- */\r
-#ifndef ASMV\r
-/* For 80x86 and 680x0, an optimized version will be provided in match.asm or\r
- * match.S. The code will be functionally equivalent.\r
- */\r
-local uInt longest_match(s, cur_match)\r
- deflate_state *s;\r
- IPos cur_match; /* current match */\r
-{\r
- unsigned chain_length = s->max_chain_length;/* max hash chain length */\r
- register Bytef *scan = s->window + s->strstart; /* current string */\r
- register Bytef *match; /* matched string */\r
- register int len; /* length of current match */\r
- int best_len = s->prev_length; /* best match length so far */\r
- int nice_match = s->nice_match; /* stop if match long enough */\r
- IPos limit = s->strstart > (IPos)MAX_DIST(s) ?\r
- s->strstart - (IPos)MAX_DIST(s) : NIL;\r
- /* Stop when cur_match becomes <= limit. To simplify the code,\r
- * we prevent matches with the string of window index 0.\r
- */\r
- Posf *prev = s->prev;\r
- uInt wmask = s->w_mask;\r
-\r
-#ifdef UNALIGNED_OK\r
- /* Compare two bytes at a time. Note: this is not always beneficial.\r
- * Try with and without -DUNALIGNED_OK to check.\r
- */\r
- register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;\r
- register ush scan_start = *(ushf*)scan;\r
- register ush scan_end = *(ushf*)(scan+best_len-1);\r
-#else\r
- register Bytef *strend = s->window + s->strstart + MAX_MATCH;\r
- register Byte scan_end1 = scan[best_len-1];\r
- register Byte scan_end = scan[best_len];\r
-#endif\r
-\r
- /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\r
- * It is easy to get rid of this optimization if necessary.\r
- */\r
- Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");\r
-\r
- /* Do not waste too much time if we already have a good match: */\r
- if (s->prev_length >= s->good_match) {\r
- chain_length >>= 2;\r
- }\r
- /* Do not look for matches beyond the end of the input. This is necessary\r
- * to make deflate deterministic.\r
- */\r
- if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;\r
-\r
- Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");\r
-\r
- do {\r
- Assert(cur_match < s->strstart, "no future");\r
- match = s->window + cur_match;\r
-\r
- /* Skip to next match if the match length cannot increase\r
- * or if the match length is less than 2. Note that the checks below\r
- * for insufficient lookahead only occur occasionally for performance\r
- * reasons. Therefore uninitialized memory will be accessed, and\r
- * conditional jumps will be made that depend on those values.\r
- * However the length of the match is limited to the lookahead, so\r
- * the output of deflate is not affected by the uninitialized values.\r
- */\r
-#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)\r
- /* This code assumes sizeof(unsigned short) == 2. Do not use\r
- * UNALIGNED_OK if your compiler uses a different size.\r
- */\r
- if (*(ushf*)(match+best_len-1) != scan_end ||\r
- *(ushf*)match != scan_start) continue;\r
-\r
- /* It is not necessary to compare scan[2] and match[2] since they are\r
- * always equal when the other bytes match, given that the hash keys\r
- * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at\r
- * strstart+3, +5, ... up to strstart+257. We check for insufficient\r
- * lookahead only every 4th comparison; the 128th check will be made\r
- * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is\r
- * necessary to put more guard bytes at the end of the window, or\r
- * to check more often for insufficient lookahead.\r
- */\r
- Assert(scan[2] == match[2], "scan[2]?");\r
- scan++, match++;\r
- do {\r
- } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&\r
- *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&\r
- *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&\r
- *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&\r
- scan < strend);\r
- /* The funny "do {}" generates better code on most compilers */\r
-\r
- /* Here, scan <= window+strstart+257 */\r
- Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");\r
- if (*scan == *match) scan++;\r
-\r
- len = (MAX_MATCH - 1) - (int)(strend-scan);\r
- scan = strend - (MAX_MATCH-1);\r
-\r
-#else /* UNALIGNED_OK */\r
-\r
- if (match[best_len] != scan_end ||\r
- match[best_len-1] != scan_end1 ||\r
- *match != *scan ||\r
- *++match != scan[1]) continue;\r
-\r
- /* The check at best_len-1 can be removed because it will be made\r
- * again later. (This heuristic is not always a win.)\r
- * It is not necessary to compare scan[2] and match[2] since they\r
- * are always equal when the other bytes match, given that\r
- * the hash keys are equal and that HASH_BITS >= 8.\r
- */\r
- scan += 2, match++;\r
- Assert(*scan == *match, "match[2]?");\r
-\r
- /* We check for insufficient lookahead only every 8th comparison;\r
- * the 256th check will be made at strstart+258.\r
- */\r
- do {\r
- } while (*++scan == *++match && *++scan == *++match &&\r
- *++scan == *++match && *++scan == *++match &&\r
- *++scan == *++match && *++scan == *++match &&\r
- *++scan == *++match && *++scan == *++match &&\r
- scan < strend);\r
-\r
- Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");\r
-\r
- len = MAX_MATCH - (int)(strend - scan);\r
- scan = strend - MAX_MATCH;\r
-\r
-#endif /* UNALIGNED_OK */\r
-\r
- if (len > best_len) {\r
- s->match_start = cur_match;\r
- best_len = len;\r
- if (len >= nice_match) break;\r
-#ifdef UNALIGNED_OK\r
- scan_end = *(ushf*)(scan+best_len-1);\r
-#else\r
- scan_end1 = scan[best_len-1];\r
- scan_end = scan[best_len];\r
-#endif\r
- }\r
- } while ((cur_match = prev[cur_match & wmask]) > limit\r
- && --chain_length != 0);\r
-\r
- if ((uInt)best_len <= s->lookahead) return (uInt)best_len;\r
- return s->lookahead;\r
-}\r
-#endif /* ASMV */\r
-#endif /* FASTEST */\r
-\r
-/* ---------------------------------------------------------------------------\r
- * Optimized version for level == 1 or strategy == Z_RLE only\r
- */\r
-local uInt longest_match_fast(s, cur_match)\r
- deflate_state *s;\r
- IPos cur_match; /* current match */\r
-{\r
- register Bytef *scan = s->window + s->strstart; /* current string */\r
- register Bytef *match; /* matched string */\r
- register int len; /* length of current match */\r
- register Bytef *strend = s->window + s->strstart + MAX_MATCH;\r
-\r
- /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\r
- * It is easy to get rid of this optimization if necessary.\r
- */\r
- Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");\r
-\r
- Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");\r
-\r
- Assert(cur_match < s->strstart, "no future");\r
-\r
- match = s->window + cur_match;\r
-\r
- /* Return failure if the match length is less than 2:\r
- */\r
- if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;\r
-\r
- /* The check at best_len-1 can be removed because it will be made\r
- * again later. (This heuristic is not always a win.)\r
- * It is not necessary to compare scan[2] and match[2] since they\r
- * are always equal when the other bytes match, given that\r
- * the hash keys are equal and that HASH_BITS >= 8.\r
- */\r
- scan += 2, match += 2;\r
- Assert(*scan == *match, "match[2]?");\r
-\r
- /* We check for insufficient lookahead only every 8th comparison;\r
- * the 256th check will be made at strstart+258.\r
- */\r
- do {\r
- } while (*++scan == *++match && *++scan == *++match &&\r
- *++scan == *++match && *++scan == *++match &&\r
- *++scan == *++match && *++scan == *++match &&\r
- *++scan == *++match && *++scan == *++match &&\r
- scan < strend);\r
-\r
- Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");\r
-\r
- len = MAX_MATCH - (int)(strend - scan);\r
-\r
- if (len < MIN_MATCH) return MIN_MATCH - 1;\r
-\r
- s->match_start = cur_match;\r
- return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;\r
-}\r
-\r
-#ifdef DEBUG\r
-/* ===========================================================================\r
- * Check that the match at match_start is indeed a match.\r
- */\r
-local void check_match(s, start, match, length)\r
- deflate_state *s;\r
- IPos start, match;\r
- int length;\r
-{\r
- /* check that the match is indeed a match */\r
- if (zmemcmp(s->window + match,\r
- s->window + start, length) != EQUAL) {\r
- fprintf(stderr, " start %u, match %u, length %d\n",\r
- start, match, length);\r
- do {\r
- fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);\r
- } while (--length != 0);\r
- z_error("invalid match");\r
- }\r
- if (z_verbose > 1) {\r
- fprintf(stderr,"\\[%d,%d]", start-match, length);\r
- do { putc(s->window[start++], stderr); } while (--length != 0);\r
- }\r
-}\r
-#else\r
-# define check_match(s, start, match, length)\r
-#endif /* DEBUG */\r
-\r
-/* ===========================================================================\r
- * Fill the window when the lookahead becomes insufficient.\r
- * Updates strstart and lookahead.\r
- *\r
- * IN assertion: lookahead < MIN_LOOKAHEAD\r
- * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\r
- * At least one byte has been read, or avail_in == 0; reads are\r
- * performed for at least two bytes (required for the zip translate_eol\r
- * option -- not supported here).\r
- */\r
-local void fill_window(s)\r
- deflate_state *s;\r
-{\r
- register unsigned n, m;\r
- register Posf *p;\r
- unsigned more; /* Amount of free space at the end of the window. */\r
- uInt wsize = s->w_size;\r
-\r
- do {\r
- more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);\r
-\r
- /* Deal with !@#$% 64K limit: */\r
- if (sizeof(int) <= 2) {\r
- if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\r
- more = wsize;\r
-\r
- } else if (more == (unsigned)(-1)) {\r
- /* Very unlikely, but possible on 16 bit machine if\r
- * strstart == 0 && lookahead == 1 (input done a byte at time)\r
- */\r
- more--;\r
- }\r
- }\r
-\r
- /* If the window is almost full and there is insufficient lookahead,\r
- * move the upper half to the lower one to make room in the upper half.\r
- */\r
- if (s->strstart >= wsize+MAX_DIST(s)) {\r
-\r
- zmemcpy(s->window, s->window+wsize, (unsigned)wsize);\r
- s->match_start -= wsize;\r
- s->strstart -= wsize; /* we now have strstart >= MAX_DIST */\r
- s->block_start -= (long) wsize;\r
-\r
- /* Slide the hash table (could be avoided with 32 bit values\r
- at the expense of memory usage). We slide even when level == 0\r
- to keep the hash table consistent if we switch back to level > 0\r
- later. (Using level 0 permanently is not an optimal usage of\r
- zlib, so we don't care about this pathological case.)\r
- */\r
- /* %%% avoid this when Z_RLE */\r
- n = s->hash_size;\r
- p = &s->head[n];\r
- do {\r
- m = *--p;\r
- *p = (Pos)(m >= wsize ? m-wsize : NIL);\r
- } while (--n);\r
-\r
- n = wsize;\r
-#ifndef FASTEST\r
- p = &s->prev[n];\r
- do {\r
- m = *--p;\r
- *p = (Pos)(m >= wsize ? m-wsize : NIL);\r
- /* If n is not on any hash chain, prev[n] is garbage but\r
- * its value will never be used.\r
- */\r
- } while (--n);\r
-#endif\r
- more += wsize;\r
- }\r
- if (s->strm->avail_in == 0) return;\r
-\r
- /* If there was no sliding:\r
- * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\r
- * more == window_size - lookahead - strstart\r
- * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\r
- * => more >= window_size - 2*WSIZE + 2\r
- * In the BIG_MEM or MMAP case (not yet supported),\r
- * window_size == input_size + MIN_LOOKAHEAD &&\r
- * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\r
- * Otherwise, window_size == 2*WSIZE so more >= 2.\r
- * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\r
- */\r
- Assert(more >= 2, "more < 2");\r
-\r
- n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);\r
- s->lookahead += n;\r
-\r
- /* Initialize the hash value now that we have some input: */\r
- if (s->lookahead >= MIN_MATCH) {\r
- s->ins_h = s->window[s->strstart];\r
- UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);\r
-#if MIN_MATCH != 3\r
- Call UPDATE_HASH() MIN_MATCH-3 more times\r
-#endif\r
- }\r
- /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\r
- * but this is not important since only literal bytes will be emitted.\r
- */\r
-\r
- } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);\r
-}\r
-\r
-/* ===========================================================================\r
- * Flush the current block, with given end-of-file flag.\r
- * IN assertion: strstart is set to the end of the current match.\r
- */\r
-#define FLUSH_BLOCK_ONLY(s, eof) { \\r
- _tr_flush_block(s, (s->block_start >= 0L ? \\r
- (charf *)&s->window[(unsigned)s->block_start] : \\r
- (charf *)Z_NULL), \\r
- (ulg)((long)s->strstart - s->block_start), \\r
- (eof)); \\r
- s->block_start = s->strstart; \\r
- flush_pending(s->strm); \\r
- Tracev((stderr,"[FLUSH]")); \\r
-}\r
-\r
-/* Same but force premature exit if necessary. */\r
-#define FLUSH_BLOCK(s, eof) { \\r
- FLUSH_BLOCK_ONLY(s, eof); \\r
- if (s->strm->avail_out == 0) return (eof) ? finish_started : need_more; \\r
-}\r
-\r
-/* ===========================================================================\r
- * Copy without compression as much as possible from the input stream, return\r
- * the current block state.\r
- * This function does not insert new strings in the dictionary since\r
- * uncompressible data is probably not useful. This function is used\r
- * only for the level=0 compression option.\r
- * NOTE: this function should be optimized to avoid extra copying from\r
- * window to pending_buf.\r
- */\r
-local block_state deflate_stored(s, flush)\r
- deflate_state *s;\r
- int flush;\r
-{\r
- /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\r
- * to pending_buf_size, and each stored block has a 5 byte header:\r
- */\r
- ulg max_block_size = 0xffff;\r
- ulg max_start;\r
-\r
- if (max_block_size > s->pending_buf_size - 5) {\r
- max_block_size = s->pending_buf_size - 5;\r
- }\r
-\r
- /* Copy as much as possible from input to output: */\r
- for (;;) {\r
- /* Fill the window as much as possible: */\r
- if (s->lookahead <= 1) {\r
-\r
- Assert(s->strstart < s->w_size+MAX_DIST(s) ||\r
- s->block_start >= (long)s->w_size, "slide too late");\r
-\r
- fill_window(s);\r
- if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more;\r
-\r
- if (s->lookahead == 0) break; /* flush the current block */\r
- }\r
- Assert(s->block_start >= 0L, "block gone");\r
-\r
- s->strstart += s->lookahead;\r
- s->lookahead = 0;\r
-\r
- /* Emit a stored block if pending_buf will be full: */\r
- max_start = s->block_start + max_block_size;\r
- if (s->strstart == 0 || (ulg)s->strstart >= max_start) {\r
- /* strstart == 0 is possible when wraparound on 16-bit machine */\r
- s->lookahead = (uInt)(s->strstart - max_start);\r
- s->strstart = (uInt)max_start;\r
- FLUSH_BLOCK(s, 0);\r
- }\r
- /* Flush if we may have to slide, otherwise block_start may become\r
- * negative and the data will be gone:\r
- */\r
- if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {\r
- FLUSH_BLOCK(s, 0);\r
- }\r
- }\r
- FLUSH_BLOCK(s, flush == Z_FINISH);\r
- return flush == Z_FINISH ? finish_done : block_done;\r
-}\r
-\r
-/* ===========================================================================\r
- * Compress as much as possible from the input stream, return the current\r
- * block state.\r
- * This function does not perform lazy evaluation of matches and inserts\r
- * new strings in the dictionary only for unmatched strings or for short\r
- * matches. It is used only for the fast compression options.\r
- */\r
-local block_state deflate_fast(s, flush)\r
- deflate_state *s;\r
- int flush;\r
-{\r
- IPos hash_head = NIL; /* head of the hash chain */\r
- int bflush; /* set if current block must be flushed */\r
-\r
- for (;;) {\r
- /* Make sure that we always have enough lookahead, except\r
- * at the end of the input file. We need MAX_MATCH bytes\r
- * for the next match, plus MIN_MATCH bytes to insert the\r
- * string following the next match.\r
- */\r
- if (s->lookahead < MIN_LOOKAHEAD) {\r
- fill_window(s);\r
- if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\r
- return need_more;\r
- }\r
- if (s->lookahead == 0) break; /* flush the current block */\r
- }\r
-\r
- /* Insert the string window[strstart .. strstart+2] in the\r
- * dictionary, and set hash_head to the head of the hash chain:\r
- */\r
- if (s->lookahead >= MIN_MATCH) {\r
- INSERT_STRING(s, s->strstart, hash_head);\r
- }\r
-\r
- /* Find the longest match, discarding those <= prev_length.\r
- * At this point we have always match_length < MIN_MATCH\r
- */\r
- if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {\r
- /* To simplify the code, we prevent matches with the string\r
- * of window index 0 (in particular we have to avoid a match\r
- * of the string with itself at the start of the input file).\r
- */\r
-#ifdef FASTEST\r
- if ((s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) ||\r
- (s->strategy == Z_RLE && s->strstart - hash_head == 1)) {\r
- s->match_length = longest_match_fast (s, hash_head);\r
- }\r
-#else\r
- if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {\r
- s->match_length = longest_match (s, hash_head);\r
- } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {\r
- s->match_length = longest_match_fast (s, hash_head);\r
- }\r
-#endif\r
- /* longest_match() or longest_match_fast() sets match_start */\r
- }\r
- if (s->match_length >= MIN_MATCH) {\r
- check_match(s, s->strstart, s->match_start, s->match_length);\r
-\r
- _tr_tally_dist(s, s->strstart - s->match_start,\r
- s->match_length - MIN_MATCH, bflush);\r
-\r
- s->lookahead -= s->match_length;\r
-\r
- /* Insert new strings in the hash table only if the match length\r
- * is not too large. This saves time but degrades compression.\r
- */\r
-#ifndef FASTEST\r
- if (s->match_length <= s->max_insert_length &&\r
- s->lookahead >= MIN_MATCH) {\r
- s->match_length--; /* string at strstart already in table */\r
- do {\r
- s->strstart++;\r
- INSERT_STRING(s, s->strstart, hash_head);\r
- /* strstart never exceeds WSIZE-MAX_MATCH, so there are\r
- * always MIN_MATCH bytes ahead.\r
- */\r
- } while (--s->match_length != 0);\r
- s->strstart++;\r
- } else\r
-#endif\r
- {\r
- s->strstart += s->match_length;\r
- s->match_length = 0;\r
- s->ins_h = s->window[s->strstart];\r
- UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);\r
-#if MIN_MATCH != 3\r
- Call UPDATE_HASH() MIN_MATCH-3 more times\r
-#endif\r
- /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\r
- * matter since it will be recomputed at next deflate call.\r
- */\r
- }\r
- } else {\r
- /* No match, output a literal byte */\r
- Tracevv((stderr,"%c", s->window[s->strstart]));\r
- _tr_tally_lit (s, s->window[s->strstart], bflush);\r
- s->lookahead--;\r
- s->strstart++;\r
- }\r
- if (bflush) FLUSH_BLOCK(s, 0);\r
- }\r
- FLUSH_BLOCK(s, flush == Z_FINISH);\r
- return flush == Z_FINISH ? finish_done : block_done;\r
-}\r
-\r
-#ifndef FASTEST\r
-/* ===========================================================================\r
- * Same as above, but achieves better compression. We use a lazy\r
- * evaluation for matches: a match is finally adopted only if there is\r
- * no better match at the next window position.\r
- */\r
-local block_state deflate_slow(s, flush)\r
- deflate_state *s;\r
- int flush;\r
-{\r
- IPos hash_head = NIL; /* head of hash chain */\r
- int bflush; /* set if current block must be flushed */\r
-\r
- /* Process the input block. */\r
- for (;;) {\r
- /* Make sure that we always have enough lookahead, except\r
- * at the end of the input file. We need MAX_MATCH bytes\r
- * for the next match, plus MIN_MATCH bytes to insert the\r
- * string following the next match.\r
- */\r
- if (s->lookahead < MIN_LOOKAHEAD) {\r
- fill_window(s);\r
- if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\r
- return need_more;\r
- }\r
- if (s->lookahead == 0) break; /* flush the current block */\r
- }\r
-\r
- /* Insert the string window[strstart .. strstart+2] in the\r
- * dictionary, and set hash_head to the head of the hash chain:\r
- */\r
- if (s->lookahead >= MIN_MATCH) {\r
- INSERT_STRING(s, s->strstart, hash_head);\r
- }\r
-\r
- /* Find the longest match, discarding those <= prev_length.\r
- */\r
- s->prev_length = s->match_length, s->prev_match = s->match_start;\r
- s->match_length = MIN_MATCH-1;\r
-\r
- if (hash_head != NIL && s->prev_length < s->max_lazy_match &&\r
- s->strstart - hash_head <= MAX_DIST(s)) {\r
- /* To simplify the code, we prevent matches with the string\r
- * of window index 0 (in particular we have to avoid a match\r
- * of the string with itself at the start of the input file).\r
- */\r
- if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {\r
- s->match_length = longest_match (s, hash_head);\r
- } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {\r
- s->match_length = longest_match_fast (s, hash_head);\r
- }\r
- /* longest_match() or longest_match_fast() sets match_start */\r
-\r
- if (s->match_length <= 5 && (s->strategy == Z_FILTERED\r
-#if TOO_FAR <= 32767\r
- || (s->match_length == MIN_MATCH &&\r
- s->strstart - s->match_start > TOO_FAR)\r
-#endif\r
- )) {\r
-\r
- /* If prev_match is also MIN_MATCH, match_start is garbage\r
- * but we will ignore the current match anyway.\r
- */\r
- s->match_length = MIN_MATCH-1;\r
- }\r
- }\r
- /* If there was a match at the previous step and the current\r
- * match is not better, output the previous match:\r
- */\r
- if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {\r
- uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;\r
- /* Do not insert strings in hash table beyond this. */\r
-\r
- check_match(s, s->strstart-1, s->prev_match, s->prev_length);\r
-\r
- _tr_tally_dist(s, s->strstart -1 - s->prev_match,\r
- s->prev_length - MIN_MATCH, bflush);\r
-\r
- /* Insert in hash table all strings up to the end of the match.\r
- * strstart-1 and strstart are already inserted. If there is not\r
- * enough lookahead, the last two strings are not inserted in\r
- * the hash table.\r
- */\r
- s->lookahead -= s->prev_length-1;\r
- s->prev_length -= 2;\r
- do {\r
- if (++s->strstart <= max_insert) {\r
- INSERT_STRING(s, s->strstart, hash_head);\r
- }\r
- } while (--s->prev_length != 0);\r
- s->match_available = 0;\r
- s->match_length = MIN_MATCH-1;\r
- s->strstart++;\r
-\r
- if (bflush) FLUSH_BLOCK(s, 0);\r
-\r
- } else if (s->match_available) {\r
- /* If there was no match at the previous position, output a\r
- * single literal. If there was a match but the current match\r
- * is longer, truncate the previous match to a single literal.\r
- */\r
- Tracevv((stderr,"%c", s->window[s->strstart-1]));\r
- _tr_tally_lit(s, s->window[s->strstart-1], bflush);\r
- if (bflush) {\r
- FLUSH_BLOCK_ONLY(s, 0);\r
- }\r
- s->strstart++;\r
- s->lookahead--;\r
- if (s->strm->avail_out == 0) return need_more;\r
- } else {\r
- /* There is no previous match to compare with, wait for\r
- * the next step to decide.\r
- */\r
- s->match_available = 1;\r
- s->strstart++;\r
- s->lookahead--;\r
- }\r
- }\r
- Assert (flush != Z_NO_FLUSH, "no flush?");\r
- if (s->match_available) {\r
- Tracevv((stderr,"%c", s->window[s->strstart-1]));\r
- _tr_tally_lit(s, s->window[s->strstart-1], bflush);\r
- s->match_available = 0;\r
- }\r
- FLUSH_BLOCK(s, flush == Z_FINISH);\r
- return flush == Z_FINISH ? finish_done : block_done;\r
-}\r
-#endif /* FASTEST */\r
-\r
-#if 0\r
-/* ===========================================================================\r
- * For Z_RLE, simply look for runs of bytes, generate matches only of distance\r
- * one. Do not maintain a hash table. (It will be regenerated if this run of\r
- * deflate switches away from Z_RLE.)\r
- */\r
-local block_state deflate_rle(s, flush)\r
- deflate_state *s;\r
- int flush;\r
-{\r
- int bflush; /* set if current block must be flushed */\r
- uInt run; /* length of run */\r
- uInt max; /* maximum length of run */\r
- uInt prev; /* byte at distance one to match */\r
- Bytef *scan; /* scan for end of run */\r
-\r
- for (;;) {\r
- /* Make sure that we always have enough lookahead, except\r
- * at the end of the input file. We need MAX_MATCH bytes\r
- * for the longest encodable run.\r
- */\r
- if (s->lookahead < MAX_MATCH) {\r
- fill_window(s);\r
- if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {\r
- return need_more;\r
- }\r
- if (s->lookahead == 0) break; /* flush the current block */\r
- }\r
-\r
- /* See how many times the previous byte repeats */\r
- run = 0;\r
- if (s->strstart > 0) { /* if there is a previous byte, that is */\r
- max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH;\r
- scan = s->window + s->strstart - 1;\r
- prev = *scan++;\r
- do {\r
- if (*scan++ != prev)\r
- break;\r
- } while (++run < max);\r
- }\r
-\r
- /* Emit match if have run of MIN_MATCH or longer, else emit literal */\r
- if (run >= MIN_MATCH) {\r
- check_match(s, s->strstart, s->strstart - 1, run);\r
- _tr_tally_dist(s, 1, run - MIN_MATCH, bflush);\r
- s->lookahead -= run;\r
- s->strstart += run;\r
- } else {\r
- /* No match, output a literal byte */\r
- Tracevv((stderr,"%c", s->window[s->strstart]));\r
- _tr_tally_lit (s, s->window[s->strstart], bflush);\r
- s->lookahead--;\r
- s->strstart++;\r
- }\r
- if (bflush) FLUSH_BLOCK(s, 0);\r
- }\r
- FLUSH_BLOCK(s, flush == Z_FINISH);\r
- return flush == Z_FINISH ? finish_done : block_done;\r
-}\r
-#endif\r
+/* deflate.c -- compress data using the deflation algorithm
+ * Copyright (C) 1995-2005 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 http://www.ietf.org/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.2.3 Copyright 1995-2005 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));
+#ifndef FASTEST
+local block_state deflate_slow OF((deflate_state *s, int flush));
+#endif
+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));
+#ifndef FASTEST
+#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
+#endif
+local uInt longest_match_fast OF((deflate_state *s, IPos cur_match));
+
+#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;
+
+#ifdef FASTEST
+local const config configuration_table[2] = {
+/* good lazy nice chain */
+/* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */
+/* 1 */ {4, 4, 8, 4, deflate_fast}}; /* max speed, no lazy matches */
+#else
+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}, /* max 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}}; /* max compression */
+#endif
+
+/* 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 */
+
+#ifndef NO_DUMMY_DECL
+struct static_tree_desc_s {int dummy;}; /* for buggy compilers */
+#endif
+
+/* ===========================================================================
+ * 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)<<s->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)]), \
+ match_head = s->prev[(str) & s->w_mask] = 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 wrap = 1;
+ 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 == (alloc_func)0) {
+ strm->zalloc = zcalloc;
+ strm->opaque = (voidpf)0;
+ }
+ if (strm->zfree == (free_func)0) strm->zfree = zcfree;
+
+#ifdef FASTEST
+ if (level != 0) level = 1;
+#else
+ if (level == Z_DEFAULT_COMPRESSION) level = 6;
+#endif
+
+ if (windowBits < 0) { /* suppress zlib wrapper */
+ wrap = 0;
+ windowBits = -windowBits;
+ }
+#ifdef GZIP
+ else if (windowBits > 15) {
+ wrap = 2; /* write gzip wrapper instead */
+ windowBits -= 16;
+ }
+#endif
+ if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED ||
+ windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
+ strategy < 0 || strategy > Z_FIXED) {
+ return Z_STREAM_ERROR;
+ }
+ if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */
+ 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->wrap = wrap;
+ s->gzhead = Z_NULL;
+ 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) {
+ s->status = FINISH_STATE;
+ 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->wrap == 2 ||
+ (strm->state->wrap == 1 && strm->state->status != INIT_STATE))
+ return Z_STREAM_ERROR;
+
+ s = strm->state;
+ if (s->wrap)
+ strm->adler = adler32(strm->adler, dictionary, dictLength);
+
+ if (length < MIN_MATCH) return Z_OK;
+ if (length > MAX_DIST(s)) {
+ length = MAX_DIST(s);
+ dictionary += dictLength - length; /* use the tail of the dictionary */
+ }
+ 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 == (alloc_func)0 || strm->zfree == (free_func)0) {
+ 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->wrap < 0) {
+ s->wrap = -s->wrap; /* was made negative by deflate(..., Z_FINISH); */
+ }
+ s->status = s->wrap ? INIT_STATE : BUSY_STATE;
+ strm->adler =
+#ifdef GZIP
+ s->wrap == 2 ? crc32(0L, Z_NULL, 0) :
+#endif
+ adler32(0L, Z_NULL, 0);
+ s->last_flush = Z_NO_FLUSH;
+
+ _tr_init(s);
+ lm_init(s);
+
+ return Z_OK;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateSetHeader (strm, head)
+ z_streamp strm;
+ gz_headerp head;
+{
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+ if (strm->state->wrap != 2) return Z_STREAM_ERROR;
+ strm->state->gzhead = head;
+ return Z_OK;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflatePrime (strm, bits, value)
+ z_streamp strm;
+ int bits;
+ int value;
+{
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+ strm->state->bi_valid = bits;
+ strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
+ 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;
+
+#ifdef FASTEST
+ if (level != 0) level = 1;
+#else
+ if (level == Z_DEFAULT_COMPRESSION) level = 6;
+#endif
+ if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {
+ 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;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain)
+ z_streamp strm;
+ int good_length;
+ int max_lazy;
+ int nice_length;
+ int max_chain;
+{
+ deflate_state *s;
+
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+ s = strm->state;
+ s->good_match = good_length;
+ s->max_lazy_match = max_lazy;
+ s->nice_match = nice_length;
+ s->max_chain_length = max_chain;
+ return Z_OK;
+}
+
+/* =========================================================================
+ * For the default windowBits of 15 and memLevel of 8, this function returns
+ * a close to exact, as well as small, upper bound on the compressed size.
+ * They are coded as constants here for a reason--if the #define's are
+ * changed, then this function needs to be changed as well. The return
+ * value for 15 and 8 only works for those exact settings.
+ *
+ * For any setting other than those defaults for windowBits and memLevel,
+ * the value returned is a conservative worst case for the maximum expansion
+ * resulting from using fixed blocks instead of stored blocks, which deflate
+ * can emit on compressed data for some combinations of the parameters.
+ *
+ * This function could be more sophisticated to provide closer upper bounds
+ * for every combination of windowBits and memLevel, as well as wrap.
+ * But even the conservative upper bound of about 14% expansion does not
+ * seem onerous for output buffer allocation.
+ */
+uLong ZEXPORT deflateBound(strm, sourceLen)
+ z_streamp strm;
+ uLong sourceLen;
+{
+ deflate_state *s;
+ uLong destLen;
+
+ /* conservative upper bound */
+ destLen = sourceLen +
+ ((sourceLen + 7) >> 3) + ((sourceLen + 63) >> 6) + 11;
+
+ /* if can't get parameters, return conservative bound */
+ if (strm == Z_NULL || strm->state == Z_NULL)
+ return destLen;
+
+ /* if not default parameters, return conservative bound */
+ s = strm->state;
+ if (s->w_bits != 15 || s->hash_bits != 8 + 7)
+ return destLen;
+
+ /* default settings: return tight bound for that case */
+ return compressBound(sourceLen);
+}
+
+/* =========================================================================
+ * 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 header */
+ if (s->status == INIT_STATE) {
+#ifdef GZIP
+ if (s->wrap == 2) {
+ strm->adler = crc32(0L, Z_NULL, 0);
+ put_byte(s, 31);
+ put_byte(s, 139);
+ put_byte(s, 8);
+ if (s->gzhead == NULL) {
+ put_byte(s, 0);
+ put_byte(s, 0);
+ put_byte(s, 0);
+ put_byte(s, 0);
+ put_byte(s, 0);
+ put_byte(s, s->level == 9 ? 2 :
+ (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
+ 4 : 0));
+ put_byte(s, OS_CODE);
+ s->status = BUSY_STATE;
+ }
+ else {
+ put_byte(s, (s->gzhead->text ? 1 : 0) +
+ (s->gzhead->hcrc ? 2 : 0) +
+ (s->gzhead->extra == Z_NULL ? 0 : 4) +
+ (s->gzhead->name == Z_NULL ? 0 : 8) +
+ (s->gzhead->comment == Z_NULL ? 0 : 16)
+ );
+ put_byte(s, (Byte)(s->gzhead->time & 0xff));
+ put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff));
+ put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff));
+ put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff));
+ put_byte(s, s->level == 9 ? 2 :
+ (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
+ 4 : 0));
+ put_byte(s, s->gzhead->os & 0xff);
+ if (s->gzhead->extra != NULL) {
+ put_byte(s, s->gzhead->extra_len & 0xff);
+ put_byte(s, (s->gzhead->extra_len >> 8) & 0xff);
+ }
+ if (s->gzhead->hcrc)
+ strm->adler = crc32(strm->adler, s->pending_buf,
+ s->pending);
+ s->gzindex = 0;
+ s->status = EXTRA_STATE;
+ }
+ }
+ else
+#endif
+ {
+ uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
+ uInt level_flags;
+
+ if (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2)
+ level_flags = 0;
+ else if (s->level < 6)
+ level_flags = 1;
+ else if (s->level == 6)
+ level_flags = 2;
+ else
+ 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 = adler32(0L, Z_NULL, 0);
+ }
+ }
+#ifdef GZIP
+ if (s->status == EXTRA_STATE) {
+ if (s->gzhead->extra != NULL) {
+ uInt beg = s->pending; /* start of bytes to update crc */
+
+ while (s->gzindex < (s->gzhead->extra_len & 0xffff)) {
+ if (s->pending == s->pending_buf_size) {
+ if (s->gzhead->hcrc && s->pending > beg)
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
+ s->pending - beg);
+ flush_pending(strm);
+ beg = s->pending;
+ if (s->pending == s->pending_buf_size)
+ break;
+ }
+ put_byte(s, s->gzhead->extra[s->gzindex]);
+ s->gzindex++;
+ }
+ if (s->gzhead->hcrc && s->pending > beg)
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
+ s->pending - beg);
+ if (s->gzindex == s->gzhead->extra_len) {
+ s->gzindex = 0;
+ s->status = NAME_STATE;
+ }
+ }
+ else
+ s->status = NAME_STATE;
+ }
+ if (s->status == NAME_STATE) {
+ if (s->gzhead->name != NULL) {
+ uInt beg = s->pending; /* start of bytes to update crc */
+ int val;
+
+ do {
+ if (s->pending == s->pending_buf_size) {
+ if (s->gzhead->hcrc && s->pending > beg)
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
+ s->pending - beg);
+ flush_pending(strm);
+ beg = s->pending;
+ if (s->pending == s->pending_buf_size) {
+ val = 1;
+ break;
+ }
+ }
+ val = s->gzhead->name[s->gzindex++];
+ put_byte(s, val);
+ } while (val != 0);
+ if (s->gzhead->hcrc && s->pending > beg)
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
+ s->pending - beg);
+ if (val == 0) {
+ s->gzindex = 0;
+ s->status = COMMENT_STATE;
+ }
+ }
+ else
+ s->status = COMMENT_STATE;
+ }
+ if (s->status == COMMENT_STATE) {
+ if (s->gzhead->comment != NULL) {
+ uInt beg = s->pending; /* start of bytes to update crc */
+ int val;
+
+ do {
+ if (s->pending == s->pending_buf_size) {
+ if (s->gzhead->hcrc && s->pending > beg)
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
+ s->pending - beg);
+ flush_pending(strm);
+ beg = s->pending;
+ if (s->pending == s->pending_buf_size) {
+ val = 1;
+ break;
+ }
+ }
+ val = s->gzhead->comment[s->gzindex++];
+ put_byte(s, val);
+ } while (val != 0);
+ if (s->gzhead->hcrc && s->pending > beg)
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,
+ s->pending - beg);
+ if (val == 0)
+ s->status = HCRC_STATE;
+ }
+ else
+ s->status = HCRC_STATE;
+ }
+ if (s->status == HCRC_STATE) {
+ if (s->gzhead->hcrc) {
+ if (s->pending + 2 > s->pending_buf_size)
+ flush_pending(strm);
+ if (s->pending + 2 <= s->pending_buf_size) {
+ put_byte(s, (Byte)(strm->adler & 0xff));
+ put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
+ strm->adler = crc32(0L, Z_NULL, 0);
+ s->status = BUSY_STATE;
+ }
+ }
+ else
+ s->status = BUSY_STATE;
+ }
+#endif
+
+ /* 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_BUF_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->wrap <= 0) return Z_STREAM_END;
+
+ /* Write the trailer */
+#ifdef GZIP
+ if (s->wrap == 2) {
+ put_byte(s, (Byte)(strm->adler & 0xff));
+ put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
+ put_byte(s, (Byte)((strm->adler >> 16) & 0xff));
+ put_byte(s, (Byte)((strm->adler >> 24) & 0xff));
+ put_byte(s, (Byte)(strm->total_in & 0xff));
+ put_byte(s, (Byte)((strm->total_in >> 8) & 0xff));
+ put_byte(s, (Byte)((strm->total_in >> 16) & 0xff));
+ put_byte(s, (Byte)((strm->total_in >> 24) & 0xff));
+ }
+ else
+#endif
+ {
+ 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.
+ */
+ if (s->wrap > 0) s->wrap = -s->wrap; /* 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 != EXTRA_STATE &&
+ status != NAME_STATE &&
+ status != COMMENT_STATE &&
+ status != HCRC_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;
+
+ zmemcpy(dest, source, sizeof(z_stream));
+
+ ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state));
+ if (ds == Z_NULL) return Z_MEM_ERROR;
+ dest->state = (struct internal_state FAR *) ds;
+ zmemcpy(ds, ss, sizeof(deflate_state));
+ 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 /* MAXSEG_64K */
+}
+
+/* ===========================================================================
+ * 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->wrap == 1) {
+ strm->adler = adler32(strm->adler, strm->next_in, len);
+ }
+#ifdef GZIP
+ else if (strm->state->wrap == 2) {
+ strm->adler = crc32(strm->adler, strm->next_in, len);
+ }
+#endif
+ 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;
+#ifndef FASTEST
+#ifdef ASMV
+ match_init(); /* initialize the asm code */
+#endif
+#endif
+}
+
+#ifndef FASTEST
+/* ===========================================================================
+ * 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.
+ */
+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. Note that the checks below
+ * for insufficient lookahead only occur occasionally for performance
+ * reasons. Therefore uninitialized memory will be accessed, and
+ * conditional jumps will be made that depend on those values.
+ * However the length of the match is limited to the lookahead, so
+ * the output of deflate is not affected by the uninitialized values.
+ */
+#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;
+}
+#endif /* ASMV */
+#endif /* FASTEST */
+
+/* ---------------------------------------------------------------------------
+ * Optimized version for level == 1 or strategy == Z_RLE only
+ */
+local uInt longest_match_fast(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 (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;
+}
+
+#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 /* DEBUG */
+
+/* ===========================================================================
+ * 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 (sizeof(int) <= 2) {
+ 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 && lookahead == 1 (input done a 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.
+ */
+ 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.)
+ */
+ /* %%% avoid this when Z_RLE */
+ 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).
+ */
+#ifdef FASTEST
+ if ((s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) ||
+ (s->strategy == Z_RLE && s->strstart - hash_head == 1)) {
+ s->match_length = longest_match_fast (s, hash_head);
+ }
+#else
+ if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {
+ s->match_length = longest_match (s, hash_head);
+ } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
+ s->match_length = longest_match_fast (s, hash_head);
+ }
+#endif
+ /* longest_match() or longest_match_fast() 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 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;
+}
+
+#ifndef FASTEST
+/* ===========================================================================
+ * 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->strategy != Z_RLE) {
+ s->match_length = longest_match (s, hash_head);
+ } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
+ s->match_length = longest_match_fast (s, hash_head);
+ }
+ /* longest_match() or longest_match_fast() sets match_start */
+
+ if (s->match_length <= 5 && (s->strategy == Z_FILTERED
+#if TOO_FAR <= 32767
+ || (s->match_length == MIN_MATCH &&
+ s->strstart - s->match_start > TOO_FAR)
+#endif
+ )) {
+
+ /* 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;
+}
+#endif /* FASTEST */
+
+#if 0
+/* ===========================================================================
+ * For Z_RLE, simply look for runs of bytes, generate matches only of distance
+ * one. Do not maintain a hash table. (It will be regenerated if this run of
+ * deflate switches away from Z_RLE.)
+ */
+local block_state deflate_rle(s, flush)
+ deflate_state *s;
+ int flush;
+{
+ int bflush; /* set if current block must be flushed */
+ uInt run; /* length of run */
+ uInt max; /* maximum length of run */
+ uInt prev; /* byte at distance one to match */
+ Bytef *scan; /* scan for end of run */
+
+ for (;;) {
+ /* Make sure that we always have enough lookahead, except
+ * at the end of the input file. We need MAX_MATCH bytes
+ * for the longest encodable run.
+ */
+ if (s->lookahead < MAX_MATCH) {
+ fill_window(s);
+ if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {
+ return need_more;
+ }
+ if (s->lookahead == 0) break; /* flush the current block */
+ }
+
+ /* See how many times the previous byte repeats */
+ run = 0;
+ if (s->strstart > 0) { /* if there is a previous byte, that is */
+ max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH;
+ scan = s->window + s->strstart - 1;
+ prev = *scan++;
+ do {
+ if (*scan++ != prev)
+ break;
+ } while (++run < max);
+ }
+
+ /* Emit match if have run of MIN_MATCH or longer, else emit literal */
+ if (run >= MIN_MATCH) {
+ check_match(s, s->strstart, s->strstart - 1, run);
+ _tr_tally_dist(s, 1, run - MIN_MATCH, bflush);
+ s->lookahead -= run;
+ s->strstart += run;
+ } 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;
+}
+#endif
-/* deflate.h -- internal compression state\r
- * Copyright (C) 1995-2004 Jean-loup Gailly\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/* WARNING: this file should *not* be used by applications. It is\r
- part of the implementation of the compression library and is\r
- subject to change. Applications should only use zlib.h.\r
- */\r
-\r
-/* @(#) $Id$ */\r
-\r
-#ifndef DEFLATE_H\r
-#define DEFLATE_H\r
-\r
-#include "zutil.h"\r
-\r
-/* define NO_GZIP when compiling if you want to disable gzip header and\r
- trailer creation by deflate(). NO_GZIP would be used to avoid linking in\r
- the crc code when it is not needed. For shared libraries, gzip encoding\r
- should be left enabled. */\r
-#ifndef NO_GZIP\r
-# define GZIP\r
-#endif\r
-\r
-/* ===========================================================================\r
- * Internal compression state.\r
- */\r
-\r
-#define LENGTH_CODES 29\r
-/* number of length codes, not counting the special END_BLOCK code */\r
-\r
-#define LITERALS 256\r
-/* number of literal bytes 0..255 */\r
-\r
-#define L_CODES (LITERALS+1+LENGTH_CODES)\r
-/* number of Literal or Length codes, including the END_BLOCK code */\r
-\r
-#define D_CODES 30\r
-/* number of distance codes */\r
-\r
-#define BL_CODES 19\r
-/* number of codes used to transfer the bit lengths */\r
-\r
-#define HEAP_SIZE (2*L_CODES+1)\r
-/* maximum heap size */\r
-\r
-#define MAX_BITS 15\r
-/* All codes must not exceed MAX_BITS bits */\r
-\r
-#define INIT_STATE 42\r
-#define EXTRA_STATE 69\r
-#define NAME_STATE 73\r
-#define COMMENT_STATE 91\r
-#define HCRC_STATE 103\r
-#define BUSY_STATE 113\r
-#define FINISH_STATE 666\r
-/* Stream status */\r
-\r
-\r
-/* Data structure describing a single value and its code string. */\r
-typedef struct ct_data_s {\r
- union {\r
- ush freq; /* frequency count */\r
- ush code; /* bit string */\r
- } fc;\r
- union {\r
- ush dad; /* father node in Huffman tree */\r
- ush len; /* length of bit string */\r
- } dl;\r
-} FAR ct_data;\r
-\r
-#define Freq fc.freq\r
-#define Code fc.code\r
-#define Dad dl.dad\r
-#define Len dl.len\r
-\r
-typedef struct static_tree_desc_s static_tree_desc;\r
-\r
-typedef struct tree_desc_s {\r
- ct_data *dyn_tree; /* the dynamic tree */\r
- int max_code; /* largest code with non zero frequency */\r
- static_tree_desc *stat_desc; /* the corresponding static tree */\r
-} FAR tree_desc;\r
-\r
-typedef ush Pos;\r
-typedef Pos FAR Posf;\r
-typedef unsigned IPos;\r
-\r
-/* A Pos is an index in the character window. We use short instead of int to\r
- * save space in the various tables. IPos is used only for parameter passing.\r
- */\r
-\r
-typedef struct internal_state {\r
- z_streamp strm; /* pointer back to this zlib stream */\r
- int status; /* as the name implies */\r
- Bytef *pending_buf; /* output still pending */\r
- ulg pending_buf_size; /* size of pending_buf */\r
- Bytef *pending_out; /* next pending byte to output to the stream */\r
- uInt pending; /* nb of bytes in the pending buffer */\r
- int wrap; /* bit 0 true for zlib, bit 1 true for gzip */\r
- gz_headerp gzhead; /* gzip header information to write */\r
- uInt gzindex; /* where in extra, name, or comment */\r
- Byte method; /* STORED (for zip only) or DEFLATED */\r
- int last_flush; /* value of flush param for previous deflate call */\r
-\r
- /* used by deflate.c: */\r
-\r
- uInt w_size; /* LZ77 window size (32K by default) */\r
- uInt w_bits; /* log2(w_size) (8..16) */\r
- uInt w_mask; /* w_size - 1 */\r
-\r
- Bytef *window;\r
- /* Sliding window. Input bytes are read into the second half of the window,\r
- * and move to the first half later to keep a dictionary of at least wSize\r
- * bytes. With this organization, matches are limited to a distance of\r
- * wSize-MAX_MATCH bytes, but this ensures that IO is always\r
- * performed with a length multiple of the block size. Also, it limits\r
- * the window size to 64K, which is quite useful on MSDOS.\r
- * To do: use the user input buffer as sliding window.\r
- */\r
-\r
- ulg window_size;\r
- /* Actual size of window: 2*wSize, except when the user input buffer\r
- * is directly used as sliding window.\r
- */\r
-\r
- Posf *prev;\r
- /* Link to older string with same hash index. To limit the size of this\r
- * array to 64K, this link is maintained only for the last 32K strings.\r
- * An index in this array is thus a window index modulo 32K.\r
- */\r
-\r
- Posf *head; /* Heads of the hash chains or NIL. */\r
-\r
- uInt ins_h; /* hash index of string to be inserted */\r
- uInt hash_size; /* number of elements in hash table */\r
- uInt hash_bits; /* log2(hash_size) */\r
- uInt hash_mask; /* hash_size-1 */\r
-\r
- uInt hash_shift;\r
- /* Number of bits by which ins_h must be shifted at each input\r
- * step. It must be such that after MIN_MATCH steps, the oldest\r
- * byte no longer takes part in the hash key, that is:\r
- * hash_shift * MIN_MATCH >= hash_bits\r
- */\r
-\r
- long block_start;\r
- /* Window position at the beginning of the current output block. Gets\r
- * negative when the window is moved backwards.\r
- */\r
-\r
- uInt match_length; /* length of best match */\r
- IPos prev_match; /* previous match */\r
- int match_available; /* set if previous match exists */\r
- uInt strstart; /* start of string to insert */\r
- uInt match_start; /* start of matching string */\r
- uInt lookahead; /* number of valid bytes ahead in window */\r
-\r
- uInt prev_length;\r
- /* Length of the best match at previous step. Matches not greater than this\r
- * are discarded. This is used in the lazy match evaluation.\r
- */\r
-\r
- uInt max_chain_length;\r
- /* To speed up deflation, hash chains are never searched beyond this\r
- * length. A higher limit improves compression ratio but degrades the\r
- * speed.\r
- */\r
-\r
- uInt max_lazy_match;\r
- /* Attempt to find a better match only when the current match is strictly\r
- * smaller than this value. This mechanism is used only for compression\r
- * levels >= 4.\r
- */\r
-# define max_insert_length max_lazy_match\r
- /* Insert new strings in the hash table only if the match length is not\r
- * greater than this length. This saves time but degrades compression.\r
- * max_insert_length is used only for compression levels <= 3.\r
- */\r
-\r
- int level; /* compression level (1..9) */\r
- int strategy; /* favor or force Huffman coding*/\r
-\r
- uInt good_match;\r
- /* Use a faster search when the previous match is longer than this */\r
-\r
- int nice_match; /* Stop searching when current match exceeds this */\r
-\r
- /* used by trees.c: */\r
- /* Didn't use ct_data typedef below to supress compiler warning */\r
- struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\r
- struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\r
- struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\r
-\r
- struct tree_desc_s l_desc; /* desc. for literal tree */\r
- struct tree_desc_s d_desc; /* desc. for distance tree */\r
- struct tree_desc_s bl_desc; /* desc. for bit length tree */\r
-\r
- ush bl_count[MAX_BITS+1];\r
- /* number of codes at each bit length for an optimal tree */\r
-\r
- int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\r
- int heap_len; /* number of elements in the heap */\r
- int heap_max; /* element of largest frequency */\r
- /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\r
- * The same heap array is used to build all trees.\r
- */\r
-\r
- uch depth[2*L_CODES+1];\r
- /* Depth of each subtree used as tie breaker for trees of equal frequency\r
- */\r
-\r
- uchf *l_buf; /* buffer for literals or lengths */\r
-\r
- uInt lit_bufsize;\r
- /* Size of match buffer for literals/lengths. There are 4 reasons for\r
- * limiting lit_bufsize to 64K:\r
- * - frequencies can be kept in 16 bit counters\r
- * - if compression is not successful for the first block, all input\r
- * data is still in the window so we can still emit a stored block even\r
- * when input comes from standard input. (This can also be done for\r
- * all blocks if lit_bufsize is not greater than 32K.)\r
- * - if compression is not successful for a file smaller than 64K, we can\r
- * even emit a stored file instead of a stored block (saving 5 bytes).\r
- * This is applicable only for zip (not gzip or zlib).\r
- * - creating new Huffman trees less frequently may not provide fast\r
- * adaptation to changes in the input data statistics. (Take for\r
- * example a binary file with poorly compressible code followed by\r
- * a highly compressible string table.) Smaller buffer sizes give\r
- * fast adaptation but have of course the overhead of transmitting\r
- * trees more frequently.\r
- * - I can't count above 4\r
- */\r
-\r
- uInt last_lit; /* running index in l_buf */\r
-\r
- ushf *d_buf;\r
- /* Buffer for distances. To simplify the code, d_buf and l_buf have\r
- * the same number of elements. To use different lengths, an extra flag\r
- * array would be necessary.\r
- */\r
-\r
- ulg opt_len; /* bit length of current block with optimal trees */\r
- ulg static_len; /* bit length of current block with static trees */\r
- uInt matches; /* number of string matches in current block */\r
- int last_eob_len; /* bit length of EOB code for last block */\r
-\r
-#ifdef DEBUG\r
- ulg compressed_len; /* total bit length of compressed file mod 2^32 */\r
- ulg bits_sent; /* bit length of compressed data sent mod 2^32 */\r
-#endif\r
-\r
- ush bi_buf;\r
- /* Output buffer. bits are inserted starting at the bottom (least\r
- * significant bits).\r
- */\r
- int bi_valid;\r
- /* Number of valid bits in bi_buf. All bits above the last valid bit\r
- * are always zero.\r
- */\r
-\r
-} FAR deflate_state;\r
-\r
-/* Output a byte on the stream.\r
- * IN assertion: there is enough room in pending_buf.\r
- */\r
-#define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}\r
-\r
-\r
-#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)\r
-/* Minimum amount of lookahead, except at the end of the input file.\r
- * See deflate.c for comments about the MIN_MATCH+1.\r
- */\r
-\r
-#define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)\r
-/* In order to simplify the code, particularly on 16 bit machines, match\r
- * distances are limited to MAX_DIST instead of WSIZE.\r
- */\r
-\r
- /* in trees.c */\r
-void _tr_init OF((deflate_state *s));\r
-int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));\r
-void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,\r
- int eof));\r
-void _tr_align OF((deflate_state *s));\r
-void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,\r
- int eof));\r
-\r
-#define d_code(dist) \\r
- ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])\r
-/* Mapping from a distance to a distance code. dist is the distance - 1 and\r
- * must not have side effects. _dist_code[256] and _dist_code[257] are never\r
- * used.\r
- */\r
-\r
-#ifndef DEBUG\r
-/* Inline versions of _tr_tally for speed: */\r
-\r
-#if defined(GEN_TREES_H) || !defined(STDC)\r
- extern uch _length_code[];\r
- extern uch _dist_code[];\r
-#else\r
- extern const uch _length_code[];\r
- extern const uch _dist_code[];\r
-#endif\r
-\r
-# define _tr_tally_lit(s, c, flush) \\r
- { uch cc = (c); \\r
- s->d_buf[s->last_lit] = 0; \\r
- s->l_buf[s->last_lit++] = cc; \\r
- s->dyn_ltree[cc].Freq++; \\r
- flush = (s->last_lit == s->lit_bufsize-1); \\r
- }\r
-# define _tr_tally_dist(s, distance, length, flush) \\r
- { uch len = (length); \\r
- ush dist = (distance); \\r
- s->d_buf[s->last_lit] = dist; \\r
- s->l_buf[s->last_lit++] = len; \\r
- dist--; \\r
- s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \\r
- s->dyn_dtree[d_code(dist)].Freq++; \\r
- flush = (s->last_lit == s->lit_bufsize-1); \\r
- }\r
-#else\r
-# define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)\r
-# define _tr_tally_dist(s, distance, length, flush) \\r
- flush = _tr_tally(s, distance, length)\r
-#endif\r
-\r
-#endif /* DEFLATE_H */\r
+/* deflate.h -- internal compression state
+ * Copyright (C) 1995-2004 Jean-loup Gailly
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+ part of the implementation of the compression library and is
+ subject to change. Applications should only use zlib.h.
+ */
+
+/* @(#) $Id$ */
+
+#ifndef DEFLATE_H
+#define DEFLATE_H
+
+#include "zutil.h"
+
+/* define NO_GZIP when compiling if you want to disable gzip header and
+ trailer creation by deflate(). NO_GZIP would be used to avoid linking in
+ the crc code when it is not needed. For shared libraries, gzip encoding
+ should be left enabled. */
+#ifndef NO_GZIP
+# define GZIP
+#endif
+
+/* ===========================================================================
+ * Internal compression state.
+ */
+
+#define LENGTH_CODES 29
+/* number of length codes, not counting the special END_BLOCK code */
+
+#define LITERALS 256
+/* number of literal bytes 0..255 */
+
+#define L_CODES (LITERALS+1+LENGTH_CODES)
+/* number of Literal or Length codes, including the END_BLOCK code */
+
+#define D_CODES 30
+/* number of distance codes */
+
+#define BL_CODES 19
+/* number of codes used to transfer the bit lengths */
+
+#define HEAP_SIZE (2*L_CODES+1)
+/* maximum heap size */
+
+#define MAX_BITS 15
+/* All codes must not exceed MAX_BITS bits */
+
+#define INIT_STATE 42
+#define EXTRA_STATE 69
+#define NAME_STATE 73
+#define COMMENT_STATE 91
+#define HCRC_STATE 103
+#define BUSY_STATE 113
+#define FINISH_STATE 666
+/* Stream status */
+
+
+/* Data structure describing a single value and its code string. */
+typedef struct ct_data_s {
+ union {
+ ush freq; /* frequency count */
+ ush code; /* bit string */
+ } fc;
+ union {
+ ush dad; /* father node in Huffman tree */
+ ush len; /* length of bit string */
+ } dl;
+} FAR ct_data;
+
+#define Freq fc.freq
+#define Code fc.code
+#define Dad dl.dad
+#define Len dl.len
+
+typedef struct static_tree_desc_s static_tree_desc;
+
+typedef struct tree_desc_s {
+ ct_data *dyn_tree; /* the dynamic tree */
+ int max_code; /* largest code with non zero frequency */
+ static_tree_desc *stat_desc; /* the corresponding static tree */
+} FAR tree_desc;
+
+typedef ush Pos;
+typedef Pos FAR Posf;
+typedef unsigned IPos;
+
+/* A Pos is an index in the character window. We use short instead of int to
+ * save space in the various tables. IPos is used only for parameter passing.
+ */
+
+typedef struct internal_state {
+ z_streamp strm; /* pointer back to this zlib stream */
+ int status; /* as the name implies */
+ Bytef *pending_buf; /* output still pending */
+ ulg pending_buf_size; /* size of pending_buf */
+ Bytef *pending_out; /* next pending byte to output to the stream */
+ uInt pending; /* nb of bytes in the pending buffer */
+ int wrap; /* bit 0 true for zlib, bit 1 true for gzip */
+ gz_headerp gzhead; /* gzip header information to write */
+ uInt gzindex; /* where in extra, name, or comment */
+ Byte method; /* STORED (for zip only) or DEFLATED */
+ int last_flush; /* value of flush param for previous deflate call */
+
+ /* used by deflate.c: */
+
+ uInt w_size; /* LZ77 window size (32K by default) */
+ uInt w_bits; /* log2(w_size) (8..16) */
+ uInt w_mask; /* w_size - 1 */
+
+ Bytef *window;
+ /* Sliding window. Input bytes are read into the second half of the window,
+ * and move to the first half later to keep a dictionary of at least wSize
+ * bytes. With this organization, matches are limited to a distance of
+ * wSize-MAX_MATCH bytes, but this ensures that IO is always
+ * performed with a length multiple of the block size. Also, it limits
+ * the window size to 64K, which is quite useful on MSDOS.
+ * To do: use the user input buffer as sliding window.
+ */
+
+ ulg window_size;
+ /* Actual size of window: 2*wSize, except when the user input buffer
+ * is directly used as sliding window.
+ */
+
+ Posf *prev;
+ /* Link to older string with same hash index. To limit the size of this
+ * array to 64K, this link is maintained only for the last 32K strings.
+ * An index in this array is thus a window index modulo 32K.
+ */
+
+ Posf *head; /* Heads of the hash chains or NIL. */
+
+ uInt ins_h; /* hash index of string to be inserted */
+ uInt hash_size; /* number of elements in hash table */
+ uInt hash_bits; /* log2(hash_size) */
+ uInt hash_mask; /* hash_size-1 */
+
+ uInt hash_shift;
+ /* Number of bits by which ins_h must be shifted at each input
+ * step. It must be such that after MIN_MATCH steps, the oldest
+ * byte no longer takes part in the hash key, that is:
+ * hash_shift * MIN_MATCH >= hash_bits
+ */
+
+ long block_start;
+ /* Window position at the beginning of the current output block. Gets
+ * negative when the window is moved backwards.
+ */
+
+ uInt match_length; /* length of best match */
+ IPos prev_match; /* previous match */
+ int match_available; /* set if previous match exists */
+ uInt strstart; /* start of string to insert */
+ uInt match_start; /* start of matching string */
+ uInt lookahead; /* number of valid bytes ahead in window */
+
+ uInt prev_length;
+ /* Length of the best match at previous step. Matches not greater than this
+ * are discarded. This is used in the lazy match evaluation.
+ */
+
+ uInt max_chain_length;
+ /* To speed up deflation, hash chains are never searched beyond this
+ * length. A higher limit improves compression ratio but degrades the
+ * speed.
+ */
+
+ uInt max_lazy_match;
+ /* Attempt to find a better match only when the current match is strictly
+ * smaller than this value. This mechanism is used only for compression
+ * levels >= 4.
+ */
+# define max_insert_length max_lazy_match
+ /* Insert new strings in the hash table only if the match length is not
+ * greater than this length. This saves time but degrades compression.
+ * max_insert_length is used only for compression levels <= 3.
+ */
+
+ int level; /* compression level (1..9) */
+ int strategy; /* favor or force Huffman coding*/
+
+ uInt good_match;
+ /* Use a faster search when the previous match is longer than this */
+
+ int nice_match; /* Stop searching when current match exceeds this */
+
+ /* used by trees.c: */
+ /* Didn't use ct_data typedef below to supress compiler warning */
+ struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
+ struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
+ struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
+
+ struct tree_desc_s l_desc; /* desc. for literal tree */
+ struct tree_desc_s d_desc; /* desc. for distance tree */
+ struct tree_desc_s bl_desc; /* desc. for bit length tree */
+
+ ush bl_count[MAX_BITS+1];
+ /* number of codes at each bit length for an optimal tree */
+
+ int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
+ int heap_len; /* number of elements in the heap */
+ int heap_max; /* element of largest frequency */
+ /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
+ * The same heap array is used to build all trees.
+ */
+
+ uch depth[2*L_CODES+1];
+ /* Depth of each subtree used as tie breaker for trees of equal frequency
+ */
+
+ uchf *l_buf; /* buffer for literals or lengths */
+
+ uInt lit_bufsize;
+ /* Size of match buffer for literals/lengths. There are 4 reasons for
+ * limiting lit_bufsize to 64K:
+ * - frequencies can be kept in 16 bit counters
+ * - if compression is not successful for the first block, all input
+ * data is still in the window so we can still emit a stored block even
+ * when input comes from standard input. (This can also be done for
+ * all blocks if lit_bufsize is not greater than 32K.)
+ * - if compression is not successful for a file smaller than 64K, we can
+ * even emit a stored file instead of a stored block (saving 5 bytes).
+ * This is applicable only for zip (not gzip or zlib).
+ * - creating new Huffman trees less frequently may not provide fast
+ * adaptation to changes in the input data statistics. (Take for
+ * example a binary file with poorly compressible code followed by
+ * a highly compressible string table.) Smaller buffer sizes give
+ * fast adaptation but have of course the overhead of transmitting
+ * trees more frequently.
+ * - I can't count above 4
+ */
+
+ uInt last_lit; /* running index in l_buf */
+
+ ushf *d_buf;
+ /* Buffer for distances. To simplify the code, d_buf and l_buf have
+ * the same number of elements. To use different lengths, an extra flag
+ * array would be necessary.
+ */
+
+ ulg opt_len; /* bit length of current block with optimal trees */
+ ulg static_len; /* bit length of current block with static trees */
+ uInt matches; /* number of string matches in current block */
+ int last_eob_len; /* bit length of EOB code for last block */
+
+#ifdef DEBUG
+ ulg compressed_len; /* total bit length of compressed file mod 2^32 */
+ ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
+#endif
+
+ ush bi_buf;
+ /* Output buffer. bits are inserted starting at the bottom (least
+ * significant bits).
+ */
+ int bi_valid;
+ /* Number of valid bits in bi_buf. All bits above the last valid bit
+ * are always zero.
+ */
+
+} FAR deflate_state;
+
+/* Output a byte on the stream.
+ * IN assertion: there is enough room in pending_buf.
+ */
+#define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}
+
+
+#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
+/* Minimum amount of lookahead, except at the end of the input file.
+ * See deflate.c for comments about the MIN_MATCH+1.
+ */
+
+#define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)
+/* In order to simplify the code, particularly on 16 bit machines, match
+ * distances are limited to MAX_DIST instead of WSIZE.
+ */
+
+ /* in trees.c */
+void _tr_init OF((deflate_state *s));
+int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
+void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,
+ int eof));
+void _tr_align OF((deflate_state *s));
+void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
+ int eof));
+
+#define d_code(dist) \
+ ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
+/* Mapping from a distance to a distance code. dist is the distance - 1 and
+ * must not have side effects. _dist_code[256] and _dist_code[257] are never
+ * used.
+ */
+
+#ifndef DEBUG
+/* Inline versions of _tr_tally for speed: */
+
+#if defined(GEN_TREES_H) || !defined(STDC)
+ extern uch _length_code[];
+ extern uch _dist_code[];
+#else
+ extern const uch _length_code[];
+ extern const uch _dist_code[];
+#endif
+
+# define _tr_tally_lit(s, c, flush) \
+ { uch cc = (c); \
+ s->d_buf[s->last_lit] = 0; \
+ s->l_buf[s->last_lit++] = cc; \
+ s->dyn_ltree[cc].Freq++; \
+ flush = (s->last_lit == s->lit_bufsize-1); \
+ }
+# define _tr_tally_dist(s, distance, length, flush) \
+ { uch len = (length); \
+ ush dist = (distance); \
+ s->d_buf[s->last_lit] = dist; \
+ s->l_buf[s->last_lit++] = len; \
+ dist--; \
+ s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
+ s->dyn_dtree[d_code(dist)].Freq++; \
+ flush = (s->last_lit == s->lit_bufsize-1); \
+ }
+#else
+# define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)
+# define _tr_tally_dist(s, distance, length, flush) \
+ flush = _tr_tally(s, distance, length)
+#endif
+
+#endif /* DEFLATE_H */
-/* inffast.c -- fast decoding\r
- * Copyright (C) 1995-2004 Mark Adler\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-#include "zutil.h"\r
-#include "inftrees.h"\r
-#include "inflate.h"\r
-#include "inffast.h"\r
-\r
-#ifndef ASMINF\r
-\r
-/* Allow machine dependent optimization for post-increment or pre-increment.\r
- Based on testing to date,\r
- Pre-increment preferred for:\r
- - PowerPC G3 (Adler)\r
- - MIPS R5000 (Randers-Pehrson)\r
- Post-increment preferred for:\r
- - none\r
- No measurable difference:\r
- - Pentium III (Anderson)\r
- - M68060 (Nikl)\r
- */\r
-#ifdef POSTINC\r
-# define OFF 0\r
-# define PUP(a) *(a)++\r
-#else\r
-# define OFF 1\r
-# define PUP(a) *++(a)\r
-#endif\r
-\r
-/*\r
- Decode literal, length, and distance codes and write out the resulting\r
- literal and match bytes until either not enough input or output is\r
- available, an end-of-block is encountered, or a data error is encountered.\r
- When large enough input and output buffers are supplied to inflate(), for\r
- example, a 16K input buffer and a 64K output buffer, more than 95% of the\r
- inflate execution time is spent in this routine.\r
-\r
- Entry assumptions:\r
-\r
- state->mode == LEN\r
- strm->avail_in >= 6\r
- strm->avail_out >= 258\r
- start >= strm->avail_out\r
- state->bits < 8\r
-\r
- On return, state->mode is one of:\r
-\r
- LEN -- ran out of enough output space or enough available input\r
- TYPE -- reached end of block code, inflate() to interpret next block\r
- BAD -- error in block data\r
-\r
- Notes:\r
-\r
- - The maximum input bits used by a length/distance pair is 15 bits for the\r
- length code, 5 bits for the length extra, 15 bits for the distance code,\r
- and 13 bits for the distance extra. This totals 48 bits, or six bytes.\r
- Therefore if strm->avail_in >= 6, then there is enough input to avoid\r
- checking for available input while decoding.\r
-\r
- - The maximum bytes that a single length/distance pair can output is 258\r
- bytes, which is the maximum length that can be coded. inflate_fast()\r
- requires strm->avail_out >= 258 for each loop to avoid checking for\r
- output space.\r
- */\r
-void inflate_fast(strm, start)\r
-z_streamp strm;\r
-unsigned start; /* inflate()'s starting value for strm->avail_out */\r
-{\r
- struct inflate_state FAR *state;\r
- unsigned char FAR *in; /* local strm->next_in */\r
- unsigned char FAR *last; /* while in < last, enough input available */\r
- unsigned char FAR *out; /* local strm->next_out */\r
- unsigned char FAR *beg; /* inflate()'s initial strm->next_out */\r
- unsigned char FAR *end; /* while out < end, enough space available */\r
-#ifdef INFLATE_STRICT\r
- unsigned dmax; /* maximum distance from zlib header */\r
-#endif\r
- unsigned wsize; /* window size or zero if not using window */\r
- unsigned whave; /* valid bytes in the window */\r
- unsigned write; /* window write index */\r
- unsigned char FAR *window; /* allocated sliding window, if wsize != 0 */\r
- unsigned long hold; /* local strm->hold */\r
- unsigned bits; /* local strm->bits */\r
- code const FAR *lcode; /* local strm->lencode */\r
- code const FAR *dcode; /* local strm->distcode */\r
- unsigned lmask; /* mask for first level of length codes */\r
- unsigned dmask; /* mask for first level of distance codes */\r
- code this; /* retrieved table entry */\r
- unsigned op; /* code bits, operation, extra bits, or */\r
- /* window position, window bytes to copy */\r
- unsigned len; /* match length, unused bytes */\r
- unsigned dist; /* match distance */\r
- unsigned char FAR *from; /* where to copy match from */\r
-\r
- /* copy state to local variables */\r
- state = (struct inflate_state FAR *)strm->state;\r
- in = strm->next_in - OFF;\r
- last = in + (strm->avail_in - 5);\r
- out = strm->next_out - OFF;\r
- beg = out - (start - strm->avail_out);\r
- end = out + (strm->avail_out - 257);\r
-#ifdef INFLATE_STRICT\r
- dmax = state->dmax;\r
-#endif\r
- wsize = state->wsize;\r
- whave = state->whave;\r
- write = state->write;\r
- window = state->window;\r
- hold = state->hold;\r
- bits = state->bits;\r
- lcode = state->lencode;\r
- dcode = state->distcode;\r
- lmask = (1U << state->lenbits) - 1;\r
- dmask = (1U << state->distbits) - 1;\r
-\r
- /* decode literals and length/distances until end-of-block or not enough\r
- input data or output space */\r
- do {\r
- if (bits < 15) {\r
- hold += (unsigned long)(PUP(in)) << bits;\r
- bits += 8;\r
- hold += (unsigned long)(PUP(in)) << bits;\r
- bits += 8;\r
- }\r
- this = lcode[hold & lmask];\r
- dolen:\r
- op = (unsigned)(this.bits);\r
- hold >>= op;\r
- bits -= op;\r
- op = (unsigned)(this.op);\r
- if (op == 0) { /* literal */\r
- Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?\r
- "inflate: literal '%c'\n" :\r
- "inflate: literal 0x%02x\n", this.val));\r
- PUP(out) = (unsigned char)(this.val);\r
- }\r
- else if (op & 16) { /* length base */\r
- len = (unsigned)(this.val);\r
- op &= 15; /* number of extra bits */\r
- if (op) {\r
- if (bits < op) {\r
- hold += (unsigned long)(PUP(in)) << bits;\r
- bits += 8;\r
- }\r
- len += (unsigned)hold & ((1U << op) - 1);\r
- hold >>= op;\r
- bits -= op;\r
- }\r
- Tracevv((stderr, "inflate: length %u\n", len));\r
- if (bits < 15) {\r
- hold += (unsigned long)(PUP(in)) << bits;\r
- bits += 8;\r
- hold += (unsigned long)(PUP(in)) << bits;\r
- bits += 8;\r
- }\r
- this = dcode[hold & dmask];\r
- dodist:\r
- op = (unsigned)(this.bits);\r
- hold >>= op;\r
- bits -= op;\r
- op = (unsigned)(this.op);\r
- if (op & 16) { /* distance base */\r
- dist = (unsigned)(this.val);\r
- op &= 15; /* number of extra bits */\r
- if (bits < op) {\r
- hold += (unsigned long)(PUP(in)) << bits;\r
- bits += 8;\r
- if (bits < op) {\r
- hold += (unsigned long)(PUP(in)) << bits;\r
- bits += 8;\r
- }\r
- }\r
- dist += (unsigned)hold & ((1U << op) - 1);\r
-#ifdef INFLATE_STRICT\r
- if (dist > dmax) {\r
- strm->msg = (char *)"invalid distance too far back";\r
- state->mode = BAD;\r
- break;\r
- }\r
-#endif\r
- hold >>= op;\r
- bits -= op;\r
- Tracevv((stderr, "inflate: distance %u\n", dist));\r
- op = (unsigned)(out - beg); /* max distance in output */\r
- if (dist > op) { /* see if copy from window */\r
- op = dist - op; /* distance back in window */\r
- if (op > whave) {\r
- strm->msg = (char *)"invalid distance too far back";\r
- state->mode = BAD;\r
- break;\r
- }\r
- from = window - OFF;\r
- if (write == 0) { /* very common case */\r
- from += wsize - op;\r
- if (op < len) { /* some from window */\r
- len -= op;\r
- do {\r
- PUP(out) = PUP(from);\r
- } while (--op);\r
- from = out - dist; /* rest from output */\r
- }\r
- }\r
- else if (write < op) { /* wrap around window */\r
- from += wsize + write - op;\r
- op -= write;\r
- if (op < len) { /* some from end of window */\r
- len -= op;\r
- do {\r
- PUP(out) = PUP(from);\r
- } while (--op);\r
- from = window - OFF;\r
- if (write < len) { /* some from start of window */\r
- op = write;\r
- len -= op;\r
- do {\r
- PUP(out) = PUP(from);\r
- } while (--op);\r
- from = out - dist; /* rest from output */\r
- }\r
- }\r
- }\r
- else { /* contiguous in window */\r
- from += write - op;\r
- if (op < len) { /* some from window */\r
- len -= op;\r
- do {\r
- PUP(out) = PUP(from);\r
- } while (--op);\r
- from = out - dist; /* rest from output */\r
- }\r
- }\r
- while (len > 2) {\r
- PUP(out) = PUP(from);\r
- PUP(out) = PUP(from);\r
- PUP(out) = PUP(from);\r
- len -= 3;\r
- }\r
- if (len) {\r
- PUP(out) = PUP(from);\r
- if (len > 1)\r
- PUP(out) = PUP(from);\r
- }\r
- }\r
- else {\r
- from = out - dist; /* copy direct from output */\r
- do { /* minimum length is three */\r
- PUP(out) = PUP(from);\r
- PUP(out) = PUP(from);\r
- PUP(out) = PUP(from);\r
- len -= 3;\r
- } while (len > 2);\r
- if (len) {\r
- PUP(out) = PUP(from);\r
- if (len > 1)\r
- PUP(out) = PUP(from);\r
- }\r
- }\r
- }\r
- else if ((op & 64) == 0) { /* 2nd level distance code */\r
- this = dcode[this.val + (hold & ((1U << op) - 1))];\r
- goto dodist;\r
- }\r
- else {\r
- strm->msg = (char *)"invalid distance code";\r
- state->mode = BAD;\r
- break;\r
- }\r
- }\r
- else if ((op & 64) == 0) { /* 2nd level length code */\r
- this = lcode[this.val + (hold & ((1U << op) - 1))];\r
- goto dolen;\r
- }\r
- else if (op & 32) { /* end-of-block */\r
- Tracevv((stderr, "inflate: end of block\n"));\r
- state->mode = TYPE;\r
- break;\r
- }\r
- else {\r
- strm->msg = (char *)"invalid literal/length code";\r
- state->mode = BAD;\r
- break;\r
- }\r
- } while (in < last && out < end);\r
-\r
- /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\r
- len = bits >> 3;\r
- in -= len;\r
- bits -= len << 3;\r
- hold &= (1U << bits) - 1;\r
-\r
- /* update state and return */\r
- strm->next_in = in + OFF;\r
- strm->next_out = out + OFF;\r
- strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));\r
- strm->avail_out = (unsigned)(out < end ?\r
- 257 + (end - out) : 257 - (out - end));\r
- state->hold = hold;\r
- state->bits = bits;\r
- return;\r
-}\r
-\r
-/*\r
- inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe):\r
- - Using bit fields for code structure\r
- - Different op definition to avoid & for extra bits (do & for table bits)\r
- - Three separate decoding do-loops for direct, window, and write == 0\r
- - Special case for distance > 1 copies to do overlapped load and store copy\r
- - Explicit branch predictions (based on measured branch probabilities)\r
- - Deferring match copy and interspersed it with decoding subsequent codes\r
- - Swapping literal/length else\r
- - Swapping window/direct else\r
- - Larger unrolled copy loops (three is about right)\r
- - Moving len -= 3 statement into middle of loop\r
- */\r
-\r
-#endif /* !ASMINF */\r
+/* inffast.c -- fast decoding
+ * Copyright (C) 1995-2004 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+#include "inflate.h"
+#include "inffast.h"
+
+#ifndef ASMINF
+
+/* Allow machine dependent optimization for post-increment or pre-increment.
+ Based on testing to date,
+ Pre-increment preferred for:
+ - PowerPC G3 (Adler)
+ - MIPS R5000 (Randers-Pehrson)
+ Post-increment preferred for:
+ - none
+ No measurable difference:
+ - Pentium III (Anderson)
+ - M68060 (Nikl)
+ */
+#ifdef POSTINC
+# define OFF 0
+# define PUP(a) *(a)++
+#else
+# define OFF 1
+# define PUP(a) *++(a)
+#endif
+
+/*
+ Decode literal, length, and distance codes and write out the resulting
+ literal and match bytes until either not enough input or output is
+ available, an end-of-block is encountered, or a data error is encountered.
+ When large enough input and output buffers are supplied to inflate(), for
+ example, a 16K input buffer and a 64K output buffer, more than 95% of the
+ inflate execution time is spent in this routine.
+
+ Entry assumptions:
+
+ state->mode == LEN
+ strm->avail_in >= 6
+ strm->avail_out >= 258
+ start >= strm->avail_out
+ state->bits < 8
+
+ On return, state->mode is one of:
+
+ LEN -- ran out of enough output space or enough available input
+ TYPE -- reached end of block code, inflate() to interpret next block
+ BAD -- error in block data
+
+ Notes:
+
+ - The maximum input bits used by a length/distance pair is 15 bits for the
+ length code, 5 bits for the length extra, 15 bits for the distance code,
+ and 13 bits for the distance extra. This totals 48 bits, or six bytes.
+ Therefore if strm->avail_in >= 6, then there is enough input to avoid
+ checking for available input while decoding.
+
+ - The maximum bytes that a single length/distance pair can output is 258
+ bytes, which is the maximum length that can be coded. inflate_fast()
+ requires strm->avail_out >= 258 for each loop to avoid checking for
+ output space.
+ */
+void inflate_fast(strm, start)
+z_streamp strm;
+unsigned start; /* inflate()'s starting value for strm->avail_out */
+{
+ struct inflate_state FAR *state;
+ unsigned char FAR *in; /* local strm->next_in */
+ unsigned char FAR *last; /* while in < last, enough input available */
+ unsigned char FAR *out; /* local strm->next_out */
+ unsigned char FAR *beg; /* inflate()'s initial strm->next_out */
+ unsigned char FAR *end; /* while out < end, enough space available */
+#ifdef INFLATE_STRICT
+ unsigned dmax; /* maximum distance from zlib header */
+#endif
+ unsigned wsize; /* window size or zero if not using window */
+ unsigned whave; /* valid bytes in the window */
+ unsigned write; /* window write index */
+ unsigned char FAR *window; /* allocated sliding window, if wsize != 0 */
+ unsigned long hold; /* local strm->hold */
+ unsigned bits; /* local strm->bits */
+ code const FAR *lcode; /* local strm->lencode */
+ code const FAR *dcode; /* local strm->distcode */
+ unsigned lmask; /* mask for first level of length codes */
+ unsigned dmask; /* mask for first level of distance codes */
+ code this; /* retrieved table entry */
+ unsigned op; /* code bits, operation, extra bits, or */
+ /* window position, window bytes to copy */
+ unsigned len; /* match length, unused bytes */
+ unsigned dist; /* match distance */
+ unsigned char FAR *from; /* where to copy match from */
+
+ /* copy state to local variables */
+ state = (struct inflate_state FAR *)strm->state;
+ in = strm->next_in - OFF;
+ last = in + (strm->avail_in - 5);
+ out = strm->next_out - OFF;
+ beg = out - (start - strm->avail_out);
+ end = out + (strm->avail_out - 257);
+#ifdef INFLATE_STRICT
+ dmax = state->dmax;
+#endif
+ wsize = state->wsize;
+ whave = state->whave;
+ write = state->write;
+ window = state->window;
+ hold = state->hold;
+ bits = state->bits;
+ lcode = state->lencode;
+ dcode = state->distcode;
+ lmask = (1U << state->lenbits) - 1;
+ dmask = (1U << state->distbits) - 1;
+
+ /* decode literals and length/distances until end-of-block or not enough
+ input data or output space */
+ do {
+ if (bits < 15) {
+ hold += (unsigned long)(PUP(in)) << bits;
+ bits += 8;
+ hold += (unsigned long)(PUP(in)) << bits;
+ bits += 8;
+ }
+ this = lcode[hold & lmask];
+ dolen:
+ op = (unsigned)(this.bits);
+ hold >>= op;
+ bits -= op;
+ op = (unsigned)(this.op);
+ if (op == 0) { /* literal */
+ Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?
+ "inflate: literal '%c'\n" :
+ "inflate: literal 0x%02x\n", this.val));
+ PUP(out) = (unsigned char)(this.val);
+ }
+ else if (op & 16) { /* length base */
+ len = (unsigned)(this.val);
+ op &= 15; /* number of extra bits */
+ if (op) {
+ if (bits < op) {
+ hold += (unsigned long)(PUP(in)) << bits;
+ bits += 8;
+ }
+ len += (unsigned)hold & ((1U << op) - 1);
+ hold >>= op;
+ bits -= op;
+ }
+ Tracevv((stderr, "inflate: length %u\n", len));
+ if (bits < 15) {
+ hold += (unsigned long)(PUP(in)) << bits;
+ bits += 8;
+ hold += (unsigned long)(PUP(in)) << bits;
+ bits += 8;
+ }
+ this = dcode[hold & dmask];
+ dodist:
+ op = (unsigned)(this.bits);
+ hold >>= op;
+ bits -= op;
+ op = (unsigned)(this.op);
+ if (op & 16) { /* distance base */
+ dist = (unsigned)(this.val);
+ op &= 15; /* number of extra bits */
+ if (bits < op) {
+ hold += (unsigned long)(PUP(in)) << bits;
+ bits += 8;
+ if (bits < op) {
+ hold += (unsigned long)(PUP(in)) << bits;
+ bits += 8;
+ }
+ }
+ dist += (unsigned)hold & ((1U << op) - 1);
+#ifdef INFLATE_STRICT
+ if (dist > dmax) {
+ strm->msg = (char *)"invalid distance too far back";
+ state->mode = BAD;
+ break;
+ }
+#endif
+ hold >>= op;
+ bits -= op;
+ Tracevv((stderr, "inflate: distance %u\n", dist));
+ op = (unsigned)(out - beg); /* max distance in output */
+ if (dist > op) { /* see if copy from window */
+ op = dist - op; /* distance back in window */
+ if (op > whave) {
+ strm->msg = (char *)"invalid distance too far back";
+ state->mode = BAD;
+ break;
+ }
+ from = window - OFF;
+ if (write == 0) { /* very common case */
+ from += wsize - op;
+ if (op < len) { /* some from window */
+ len -= op;
+ do {
+ PUP(out) = PUP(from);
+ } while (--op);
+ from = out - dist; /* rest from output */
+ }
+ }
+ else if (write < op) { /* wrap around window */
+ from += wsize + write - op;
+ op -= write;
+ if (op < len) { /* some from end of window */
+ len -= op;
+ do {
+ PUP(out) = PUP(from);
+ } while (--op);
+ from = window - OFF;
+ if (write < len) { /* some from start of window */
+ op = write;
+ len -= op;
+ do {
+ PUP(out) = PUP(from);
+ } while (--op);
+ from = out - dist; /* rest from output */
+ }
+ }
+ }
+ else { /* contiguous in window */
+ from += write - op;
+ if (op < len) { /* some from window */
+ len -= op;
+ do {
+ PUP(out) = PUP(from);
+ } while (--op);
+ from = out - dist; /* rest from output */
+ }
+ }
+ while (len > 2) {
+ PUP(out) = PUP(from);
+ PUP(out) = PUP(from);
+ PUP(out) = PUP(from);
+ len -= 3;
+ }
+ if (len) {
+ PUP(out) = PUP(from);
+ if (len > 1)
+ PUP(out) = PUP(from);
+ }
+ }
+ else {
+ from = out - dist; /* copy direct from output */
+ do { /* minimum length is three */
+ PUP(out) = PUP(from);
+ PUP(out) = PUP(from);
+ PUP(out) = PUP(from);
+ len -= 3;
+ } while (len > 2);
+ if (len) {
+ PUP(out) = PUP(from);
+ if (len > 1)
+ PUP(out) = PUP(from);
+ }
+ }
+ }
+ else if ((op & 64) == 0) { /* 2nd level distance code */
+ this = dcode[this.val + (hold & ((1U << op) - 1))];
+ goto dodist;
+ }
+ else {
+ strm->msg = (char *)"invalid distance code";
+ state->mode = BAD;
+ break;
+ }
+ }
+ else if ((op & 64) == 0) { /* 2nd level length code */
+ this = lcode[this.val + (hold & ((1U << op) - 1))];
+ goto dolen;
+ }
+ else if (op & 32) { /* end-of-block */
+ Tracevv((stderr, "inflate: end of block\n"));
+ state->mode = TYPE;
+ break;
+ }
+ else {
+ strm->msg = (char *)"invalid literal/length code";
+ state->mode = BAD;
+ break;
+ }
+ } while (in < last && out < end);
+
+ /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
+ len = bits >> 3;
+ in -= len;
+ bits -= len << 3;
+ hold &= (1U << bits) - 1;
+
+ /* update state and return */
+ strm->next_in = in + OFF;
+ strm->next_out = out + OFF;
+ strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
+ strm->avail_out = (unsigned)(out < end ?
+ 257 + (end - out) : 257 - (out - end));
+ state->hold = hold;
+ state->bits = bits;
+ return;
+}
+
+/*
+ inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe):
+ - Using bit fields for code structure
+ - Different op definition to avoid & for extra bits (do & for table bits)
+ - Three separate decoding do-loops for direct, window, and write == 0
+ - Special case for distance > 1 copies to do overlapped load and store copy
+ - Explicit branch predictions (based on measured branch probabilities)
+ - Deferring match copy and interspersed it with decoding subsequent codes
+ - Swapping literal/length else
+ - Swapping window/direct else
+ - Larger unrolled copy loops (three is about right)
+ - Moving len -= 3 statement into middle of loop
+ */
+
+#endif /* !ASMINF */
-/* inffast.h -- header to use inffast.c\r
- * Copyright (C) 1995-2003 Mark Adler\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/* WARNING: this file should *not* be used by applications. It is\r
- part of the implementation of the compression library and is\r
- subject to change. Applications should only use zlib.h.\r
- */\r
-\r
-void inflate_fast OF((z_streamp strm, unsigned start));\r
+/* inffast.h -- header to use inffast.c
+ * Copyright (C) 1995-2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+ part of the implementation of the compression library and is
+ subject to change. Applications should only use zlib.h.
+ */
+
+void inflate_fast OF((z_streamp strm, unsigned start));
- /* inffixed.h -- table for decoding fixed codes\r
- * Generated automatically by makefixed().\r
- */\r
-\r
- /* WARNING: this file should *not* be used by applications. It\r
- is part of the implementation of the compression library and\r
- is subject to change. Applications should only use zlib.h.\r
- */\r
-\r
- static const code lenfix[512] = {\r
- {96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48},\r
- {0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128},\r
- {0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59},\r
- {0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176},\r
- {0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20},\r
- {21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100},\r
- {0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8},\r
- {0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216},\r
- {18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76},\r
- {0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114},\r
- {0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},\r
- {0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148},\r
- {20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42},\r
- {0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86},\r
- {0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15},\r
- {0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236},\r
- {16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62},\r
- {0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142},\r
- {0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31},\r
- {0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162},\r
- {0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25},\r
- {0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105},\r
- {0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4},\r
- {0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202},\r
- {17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69},\r
- {0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125},\r
- {0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13},\r
- {0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195},\r
- {19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35},\r
- {0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91},\r
- {0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19},\r
- {0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246},\r
- {16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55},\r
- {0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135},\r
- {0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99},\r
- {0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190},\r
- {0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16},\r
- {20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96},\r
- {0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6},\r
- {0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209},\r
- {17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},\r
- {0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116},\r
- {0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4},\r
- {0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153},\r
- {20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44},\r
- {0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82},\r
- {0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11},\r
- {0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},\r
- {16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58},\r
- {0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138},\r
- {0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51},\r
- {0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173},\r
- {0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30},\r
- {0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110},\r
- {0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0},\r
- {0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195},\r
- {16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65},\r
- {0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121},\r
- {0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},\r
- {0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258},\r
- {19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37},\r
- {0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93},\r
- {0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23},\r
- {0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251},\r
- {16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51},\r
- {0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},\r
- {0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67},\r
- {0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183},\r
- {0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23},\r
- {64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103},\r
- {0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9},\r
- {0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223},\r
- {18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79},\r
- {0,9,255}\r
- };\r
-\r
- static const code distfix[32] = {\r
- {16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025},\r
- {21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193},\r
- {18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385},\r
- {19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577},\r
- {16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073},\r
- {22,5,193},{64,5,0}\r
- };\r
+ /* inffixed.h -- table for decoding fixed codes
+ * Generated automatically by makefixed().
+ */
+
+ /* WARNING: this file should *not* be used by applications. It
+ is part of the implementation of the compression library and
+ is subject to change. Applications should only use zlib.h.
+ */
+
+ static const code lenfix[512] = {
+ {96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48},
+ {0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128},
+ {0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59},
+ {0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176},
+ {0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20},
+ {21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100},
+ {0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8},
+ {0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216},
+ {18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76},
+ {0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114},
+ {0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},
+ {0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148},
+ {20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42},
+ {0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86},
+ {0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15},
+ {0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236},
+ {16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62},
+ {0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142},
+ {0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31},
+ {0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162},
+ {0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25},
+ {0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105},
+ {0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4},
+ {0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202},
+ {17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69},
+ {0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125},
+ {0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13},
+ {0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195},
+ {19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35},
+ {0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91},
+ {0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19},
+ {0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246},
+ {16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55},
+ {0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135},
+ {0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99},
+ {0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190},
+ {0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16},
+ {20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96},
+ {0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6},
+ {0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209},
+ {17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},
+ {0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116},
+ {0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4},
+ {0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153},
+ {20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44},
+ {0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82},
+ {0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11},
+ {0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},
+ {16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58},
+ {0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138},
+ {0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51},
+ {0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173},
+ {0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30},
+ {0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110},
+ {0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0},
+ {0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195},
+ {16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65},
+ {0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121},
+ {0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},
+ {0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258},
+ {19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37},
+ {0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93},
+ {0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23},
+ {0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251},
+ {16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51},
+ {0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},
+ {0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67},
+ {0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183},
+ {0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23},
+ {64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103},
+ {0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9},
+ {0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223},
+ {18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79},
+ {0,9,255}
+ };
+
+ static const code distfix[32] = {
+ {16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025},
+ {21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193},
+ {18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385},
+ {19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577},
+ {16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073},
+ {22,5,193},{64,5,0}
+ };
-/* inflate.c -- zlib decompression\r
- * Copyright (C) 1995-2005 Mark Adler\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/*\r
- * Change history:\r
- *\r
- * 1.2.beta0 24 Nov 2002\r
- * - First version -- complete rewrite of inflate to simplify code, avoid\r
- * creation of window when not needed, minimize use of window when it is\r
- * needed, make inffast.c even faster, implement gzip decoding, and to\r
- * improve code readability and style over the previous zlib inflate code\r
- *\r
- * 1.2.beta1 25 Nov 2002\r
- * - Use pointers for available input and output checking in inffast.c\r
- * - Remove input and output counters in inffast.c\r
- * - Change inffast.c entry and loop from avail_in >= 7 to >= 6\r
- * - Remove unnecessary second byte pull from length extra in inffast.c\r
- * - Unroll direct copy to three copies per loop in inffast.c\r
- *\r
- * 1.2.beta2 4 Dec 2002\r
- * - Change external routine names to reduce potential conflicts\r
- * - Correct filename to inffixed.h for fixed tables in inflate.c\r
- * - Make hbuf[] unsigned char to match parameter type in inflate.c\r
- * - Change strm->next_out[-state->offset] to *(strm->next_out - state->offset)\r
- * to avoid negation problem on Alphas (64 bit) in inflate.c\r
- *\r
- * 1.2.beta3 22 Dec 2002\r
- * - Add comments on state->bits assertion in inffast.c\r
- * - Add comments on op field in inftrees.h\r
- * - Fix bug in reuse of allocated window after inflateReset()\r
- * - Remove bit fields--back to byte structure for speed\r
- * - Remove distance extra == 0 check in inflate_fast()--only helps for lengths\r
- * - Change post-increments to pre-increments in inflate_fast(), PPC biased?\r
- * - Add compile time option, POSTINC, to use post-increments instead (Intel?)\r
- * - Make MATCH copy in inflate() much faster for when inflate_fast() not used\r
- * - Use local copies of stream next and avail values, as well as local bit\r
- * buffer and bit count in inflate()--for speed when inflate_fast() not used\r
- *\r
- * 1.2.beta4 1 Jan 2003\r
- * - Split ptr - 257 statements in inflate_table() to avoid compiler warnings\r
- * - Move a comment on output buffer sizes from inffast.c to inflate.c\r
- * - Add comments in inffast.c to introduce the inflate_fast() routine\r
- * - Rearrange window copies in inflate_fast() for speed and simplification\r
- * - Unroll last copy for window match in inflate_fast()\r
- * - Use local copies of window variables in inflate_fast() for speed\r
- * - Pull out common write == 0 case for speed in inflate_fast()\r
- * - Make op and len in inflate_fast() unsigned for consistency\r
- * - Add FAR to lcode and dcode declarations in inflate_fast()\r
- * - Simplified bad distance check in inflate_fast()\r
- * - Added inflateBackInit(), inflateBack(), and inflateBackEnd() in new\r
- * source file infback.c to provide a call-back interface to inflate for\r
- * programs like gzip and unzip -- uses window as output buffer to avoid\r
- * window copying\r
- *\r
- * 1.2.beta5 1 Jan 2003\r
- * - Improved inflateBack() interface to allow the caller to provide initial\r
- * input in strm.\r
- * - Fixed stored blocks bug in inflateBack()\r
- *\r
- * 1.2.beta6 4 Jan 2003\r
- * - Added comments in inffast.c on effectiveness of POSTINC\r
- * - Typecasting all around to reduce compiler warnings\r
- * - Changed loops from while (1) or do {} while (1) to for (;;), again to\r
- * make compilers happy\r
- * - Changed type of window in inflateBackInit() to unsigned char *\r
- *\r
- * 1.2.beta7 27 Jan 2003\r
- * - Changed many types to unsigned or unsigned short to avoid warnings\r
- * - Added inflateCopy() function\r
- *\r
- * 1.2.0 9 Mar 2003\r
- * - Changed inflateBack() interface to provide separate opaque descriptors\r
- * for the in() and out() functions\r
- * - Changed inflateBack() argument and in_func typedef to swap the length\r
- * and buffer address return values for the input function\r
- * - Check next_in and next_out for Z_NULL on entry to inflate()\r
- *\r
- * The history for versions after 1.2.0 are in ChangeLog in zlib distribution.\r
- */\r
-\r
-#include "zutil.h"\r
-#include "inftrees.h"\r
-#include "inflate.h"\r
-#include "inffast.h"\r
-\r
-#ifdef MAKEFIXED\r
-# ifndef BUILDFIXED\r
-# define BUILDFIXED\r
-# endif\r
-#endif\r
-\r
-/* function prototypes */\r
-local void fixedtables OF((struct inflate_state FAR *state));\r
-local int updatewindow OF((z_streamp strm, unsigned out));\r
-#ifdef BUILDFIXED\r
- void makefixed OF((void));\r
-#endif\r
-local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,\r
- unsigned len));\r
-\r
-int ZEXPORT inflateReset(strm)\r
-z_streamp strm;\r
-{\r
- struct inflate_state FAR *state;\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- state = (struct inflate_state FAR *)strm->state;\r
- strm->total_in = strm->total_out = state->total = 0;\r
- strm->msg = Z_NULL;\r
- strm->adler = 1; /* to support ill-conceived Java test suite */\r
- state->mode = HEAD;\r
- state->last = 0;\r
- state->havedict = 0;\r
- state->dmax = 32768U;\r
- state->head = Z_NULL;\r
- state->wsize = 0;\r
- state->whave = 0;\r
- state->write = 0;\r
- state->hold = 0;\r
- state->bits = 0;\r
- state->lencode = state->distcode = state->next = state->codes;\r
- Tracev((stderr, "inflate: reset\n"));\r
- return Z_OK;\r
-}\r
-\r
-int ZEXPORT inflatePrime(strm, bits, value)\r
-z_streamp strm;\r
-int bits;\r
-int value;\r
-{\r
- struct inflate_state FAR *state;\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- state = (struct inflate_state FAR *)strm->state;\r
- if (bits > 16 || state->bits + bits > 32) return Z_STREAM_ERROR;\r
- value &= (1L << bits) - 1;\r
- state->hold += value << state->bits;\r
- state->bits += bits;\r
- return Z_OK;\r
-}\r
-\r
-int ZEXPORT inflateInit2_(strm, windowBits, version, stream_size)\r
-z_streamp strm;\r
-int windowBits;\r
-const char *version;\r
-int stream_size;\r
-{\r
- struct inflate_state FAR *state;\r
-\r
- if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||\r
- stream_size != (int)(sizeof(z_stream)))\r
- return Z_VERSION_ERROR;\r
- if (strm == Z_NULL) return Z_STREAM_ERROR;\r
- strm->msg = Z_NULL; /* in case we return an error */\r
- if (strm->zalloc == (alloc_func)0) {\r
- strm->zalloc = zcalloc;\r
- strm->opaque = (voidpf)0;\r
- }\r
- if (strm->zfree == (free_func)0) strm->zfree = zcfree;\r
- state = (struct inflate_state FAR *)\r
- ZALLOC(strm, 1, sizeof(struct inflate_state));\r
- if (state == Z_NULL) return Z_MEM_ERROR;\r
- Tracev((stderr, "inflate: allocated\n"));\r
- strm->state = (struct internal_state FAR *)state;\r
- if (windowBits < 0) {\r
- state->wrap = 0;\r
- windowBits = -windowBits;\r
- }\r
- else {\r
- state->wrap = (windowBits >> 4) + 1;\r
-#ifdef GUNZIP\r
- if (windowBits < 48) windowBits &= 15;\r
-#endif\r
- }\r
- if (windowBits < 8 || windowBits > 15) {\r
- ZFREE(strm, state);\r
- strm->state = Z_NULL;\r
- return Z_STREAM_ERROR;\r
- }\r
- state->wbits = (unsigned)windowBits;\r
- state->window = Z_NULL;\r
- return inflateReset(strm);\r
-}\r
-\r
-int ZEXPORT inflateInit_(strm, version, stream_size)\r
-z_streamp strm;\r
-const char *version;\r
-int stream_size;\r
-{\r
- return inflateInit2_(strm, DEF_WBITS, version, stream_size);\r
-}\r
-\r
-/*\r
- Return state with length and distance decoding tables and index sizes set to\r
- fixed code decoding. Normally this returns fixed tables from inffixed.h.\r
- If BUILDFIXED is defined, then instead this routine builds the tables the\r
- first time it's called, and returns those tables the first time and\r
- thereafter. This reduces the size of the code by about 2K bytes, in\r
- exchange for a little execution time. However, BUILDFIXED should not be\r
- used for threaded applications, since the rewriting of the tables and virgin\r
- may not be thread-safe.\r
- */\r
-local void fixedtables(state)\r
-struct inflate_state FAR *state;\r
-{\r
-#ifdef BUILDFIXED\r
- static int virgin = 1;\r
- static code *lenfix, *distfix;\r
- static code fixed[544];\r
-\r
- /* build fixed huffman tables if first call (may not be thread safe) */\r
- if (virgin) {\r
- unsigned sym, bits;\r
- static code *next;\r
-\r
- /* literal/length table */\r
- sym = 0;\r
- while (sym < 144) state->lens[sym++] = 8;\r
- while (sym < 256) state->lens[sym++] = 9;\r
- while (sym < 280) state->lens[sym++] = 7;\r
- while (sym < 288) state->lens[sym++] = 8;\r
- next = fixed;\r
- lenfix = next;\r
- bits = 9;\r
- inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);\r
-\r
- /* distance table */\r
- sym = 0;\r
- while (sym < 32) state->lens[sym++] = 5;\r
- distfix = next;\r
- bits = 5;\r
- inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);\r
-\r
- /* do this just once */\r
- virgin = 0;\r
- }\r
-#else /* !BUILDFIXED */\r
-# include "inffixed.h"\r
-#endif /* BUILDFIXED */\r
- state->lencode = lenfix;\r
- state->lenbits = 9;\r
- state->distcode = distfix;\r
- state->distbits = 5;\r
-}\r
-\r
-#ifdef MAKEFIXED\r
-#include <stdio.h>\r
-\r
-/*\r
- Write out the inffixed.h that is #include'd above. Defining MAKEFIXED also\r
- defines BUILDFIXED, so the tables are built on the fly. makefixed() writes\r
- those tables to stdout, which would be piped to inffixed.h. A small program\r
- can simply call makefixed to do this:\r
-\r
- void makefixed(void);\r
-\r
- int main(void)\r
- {\r
- makefixed();\r
- return 0;\r
- }\r
-\r
- Then that can be linked with zlib built with MAKEFIXED defined and run:\r
-\r
- a.out > inffixed.h\r
- */\r
-void makefixed()\r
-{\r
- unsigned low, size;\r
- struct inflate_state state;\r
-\r
- fixedtables(&state);\r
- puts(" /* inffixed.h -- table for decoding fixed codes");\r
- puts(" * Generated automatically by makefixed().");\r
- puts(" */");\r
- puts("");\r
- puts(" /* WARNING: this file should *not* be used by applications.");\r
- puts(" It is part of the implementation of this library and is");\r
- puts(" subject to change. Applications should only use zlib.h.");\r
- puts(" */");\r
- puts("");\r
- size = 1U << 9;\r
- printf(" static const code lenfix[%u] = {", size);\r
- low = 0;\r
- for (;;) {\r
- if ((low % 7) == 0) printf("\n ");\r
- printf("{%u,%u,%d}", state.lencode[low].op, state.lencode[low].bits,\r
- state.lencode[low].val);\r
- if (++low == size) break;\r
- putchar(',');\r
- }\r
- puts("\n };");\r
- size = 1U << 5;\r
- printf("\n static const code distfix[%u] = {", size);\r
- low = 0;\r
- for (;;) {\r
- if ((low % 6) == 0) printf("\n ");\r
- printf("{%u,%u,%d}", state.distcode[low].op, state.distcode[low].bits,\r
- state.distcode[low].val);\r
- if (++low == size) break;\r
- putchar(',');\r
- }\r
- puts("\n };");\r
-}\r
-#endif /* MAKEFIXED */\r
-\r
-/*\r
- Update the window with the last wsize (normally 32K) bytes written before\r
- returning. If window does not exist yet, create it. This is only called\r
- when a window is already in use, or when output has been written during this\r
- inflate call, but the end of the deflate stream has not been reached yet.\r
- It is also called to create a window for dictionary data when a dictionary\r
- is loaded.\r
-\r
- Providing output buffers larger than 32K to inflate() should provide a speed\r
- advantage, since only the last 32K of output is copied to the sliding window\r
- upon return from inflate(), and since all distances after the first 32K of\r
- output will fall in the output data, making match copies simpler and faster.\r
- The advantage may be dependent on the size of the processor's data caches.\r
- */\r
-local int updatewindow(strm, out)\r
-z_streamp strm;\r
-unsigned out;\r
-{\r
- struct inflate_state FAR *state;\r
- unsigned copy, dist;\r
-\r
- state = (struct inflate_state FAR *)strm->state;\r
-\r
- /* if it hasn't been done already, allocate space for the window */\r
- if (state->window == Z_NULL) {\r
- state->window = (unsigned char FAR *)\r
- ZALLOC(strm, 1U << state->wbits,\r
- sizeof(unsigned char));\r
- if (state->window == Z_NULL) return 1;\r
- }\r
-\r
- /* if window not in use yet, initialize */\r
- if (state->wsize == 0) {\r
- state->wsize = 1U << state->wbits;\r
- state->write = 0;\r
- state->whave = 0;\r
- }\r
-\r
- /* copy state->wsize or less output bytes into the circular window */\r
- copy = out - strm->avail_out;\r
- if (copy >= state->wsize) {\r
- zmemcpy(state->window, strm->next_out - state->wsize, state->wsize);\r
- state->write = 0;\r
- state->whave = state->wsize;\r
- }\r
- else {\r
- dist = state->wsize - state->write;\r
- if (dist > copy) dist = copy;\r
- zmemcpy(state->window + state->write, strm->next_out - copy, dist);\r
- copy -= dist;\r
- if (copy) {\r
- zmemcpy(state->window, strm->next_out - copy, copy);\r
- state->write = copy;\r
- state->whave = state->wsize;\r
- }\r
- else {\r
- state->write += dist;\r
- if (state->write == state->wsize) state->write = 0;\r
- if (state->whave < state->wsize) state->whave += dist;\r
- }\r
- }\r
- return 0;\r
-}\r
-\r
-/* Macros for inflate(): */\r
-\r
-/* check function to use adler32() for zlib or crc32() for gzip */\r
-#ifdef GUNZIP\r
-# define UPDATE(check, buf, len) \\r
- (state->flags ? crc32(check, buf, len) : adler32(check, buf, len))\r
-#else\r
-# define UPDATE(check, buf, len) adler32(check, buf, len)\r
-#endif\r
-\r
-/* check macros for header crc */\r
-#ifdef GUNZIP\r
-# define CRC2(check, word) \\r
- do { \\r
- hbuf[0] = (unsigned char)(word); \\r
- hbuf[1] = (unsigned char)((word) >> 8); \\r
- check = crc32(check, hbuf, 2); \\r
- } while (0)\r
-\r
-# define CRC4(check, word) \\r
- do { \\r
- hbuf[0] = (unsigned char)(word); \\r
- hbuf[1] = (unsigned char)((word) >> 8); \\r
- hbuf[2] = (unsigned char)((word) >> 16); \\r
- hbuf[3] = (unsigned char)((word) >> 24); \\r
- check = crc32(check, hbuf, 4); \\r
- } while (0)\r
-#endif\r
-\r
-/* Load registers with state in inflate() for speed */\r
-#define LOAD() \\r
- do { \\r
- put = strm->next_out; \\r
- left = strm->avail_out; \\r
- next = strm->next_in; \\r
- have = strm->avail_in; \\r
- hold = state->hold; \\r
- bits = state->bits; \\r
- } while (0)\r
-\r
-/* Restore state from registers in inflate() */\r
-#define RESTORE() \\r
- do { \\r
- strm->next_out = put; \\r
- strm->avail_out = left; \\r
- strm->next_in = next; \\r
- strm->avail_in = have; \\r
- state->hold = hold; \\r
- state->bits = bits; \\r
- } while (0)\r
-\r
-/* Clear the input bit accumulator */\r
-#define INITBITS() \\r
- do { \\r
- hold = 0; \\r
- bits = 0; \\r
- } while (0)\r
-\r
-/* Get a byte of input into the bit accumulator, or return from inflate()\r
- if there is no input available. */\r
-#define PULLBYTE() \\r
- do { \\r
- if (have == 0) goto inf_leave; \\r
- have--; \\r
- hold += (unsigned long)(*next++) << bits; \\r
- bits += 8; \\r
- } while (0)\r
-\r
-/* Assure that there are at least n bits in the bit accumulator. If there is\r
- not enough available input to do that, then return from inflate(). */\r
-#define NEEDBITS(n) \\r
- do { \\r
- while (bits < (unsigned)(n)) \\r
- PULLBYTE(); \\r
- } while (0)\r
-\r
-/* Return the low n bits of the bit accumulator (n < 16) */\r
-#define BITS(n) \\r
- ((unsigned)hold & ((1U << (n)) - 1))\r
-\r
-/* Remove n bits from the bit accumulator */\r
-#define DROPBITS(n) \\r
- do { \\r
- hold >>= (n); \\r
- bits -= (unsigned)(n); \\r
- } while (0)\r
-\r
-/* Remove zero to seven bits as needed to go to a byte boundary */\r
-#define BYTEBITS() \\r
- do { \\r
- hold >>= bits & 7; \\r
- bits -= bits & 7; \\r
- } while (0)\r
-\r
-/* Reverse the bytes in a 32-bit value */\r
-#define REVERSE(q) \\r
- ((((q) >> 24) & 0xff) + (((q) >> 8) & 0xff00) + \\r
- (((q) & 0xff00) << 8) + (((q) & 0xff) << 24))\r
-\r
-/*\r
- inflate() uses a state machine to process as much input data and generate as\r
- much output data as possible before returning. The state machine is\r
- structured roughly as follows:\r
-\r
- for (;;) switch (state) {\r
- ...\r
- case STATEn:\r
- if (not enough input data or output space to make progress)\r
- return;\r
- ... make progress ...\r
- state = STATEm;\r
- break;\r
- ...\r
- }\r
-\r
- so when inflate() is called again, the same case is attempted again, and\r
- if the appropriate resources are provided, the machine proceeds to the\r
- next state. The NEEDBITS() macro is usually the way the state evaluates\r
- whether it can proceed or should return. NEEDBITS() does the return if\r
- the requested bits are not available. The typical use of the BITS macros\r
- is:\r
-\r
- NEEDBITS(n);\r
- ... do something with BITS(n) ...\r
- DROPBITS(n);\r
-\r
- where NEEDBITS(n) either returns from inflate() if there isn't enough\r
- input left to load n bits into the accumulator, or it continues. BITS(n)\r
- gives the low n bits in the accumulator. When done, DROPBITS(n) drops\r
- the low n bits off the accumulator. INITBITS() clears the accumulator\r
- and sets the number of available bits to zero. BYTEBITS() discards just\r
- enough bits to put the accumulator on a byte boundary. After BYTEBITS()\r
- and a NEEDBITS(8), then BITS(8) would return the next byte in the stream.\r
-\r
- NEEDBITS(n) uses PULLBYTE() to get an available byte of input, or to return\r
- if there is no input available. The decoding of variable length codes uses\r
- PULLBYTE() directly in order to pull just enough bytes to decode the next\r
- code, and no more.\r
-\r
- Some states loop until they get enough input, making sure that enough\r
- state information is maintained to continue the loop where it left off\r
- if NEEDBITS() returns in the loop. For example, want, need, and keep\r
- would all have to actually be part of the saved state in case NEEDBITS()\r
- returns:\r
-\r
- case STATEw:\r
- while (want < need) {\r
- NEEDBITS(n);\r
- keep[want++] = BITS(n);\r
- DROPBITS(n);\r
- }\r
- state = STATEx;\r
- case STATEx:\r
-\r
- As shown above, if the next state is also the next case, then the break\r
- is omitted.\r
-\r
- A state may also return if there is not enough output space available to\r
- complete that state. Those states are copying stored data, writing a\r
- literal byte, and copying a matching string.\r
-\r
- When returning, a "goto inf_leave" is used to update the total counters,\r
- update the check value, and determine whether any progress has been made\r
- during that inflate() call in order to return the proper return code.\r
- Progress is defined as a change in either strm->avail_in or strm->avail_out.\r
- When there is a window, goto inf_leave will update the window with the last\r
- output written. If a goto inf_leave occurs in the middle of decompression\r
- and there is no window currently, goto inf_leave will create one and copy\r
- output to the window for the next call of inflate().\r
-\r
- In this implementation, the flush parameter of inflate() only affects the\r
- return code (per zlib.h). inflate() always writes as much as possible to\r
- strm->next_out, given the space available and the provided input--the effect\r
- documented in zlib.h of Z_SYNC_FLUSH. Furthermore, inflate() always defers\r
- the allocation of and copying into a sliding window until necessary, which\r
- provides the effect documented in zlib.h for Z_FINISH when the entire input\r
- stream available. So the only thing the flush parameter actually does is:\r
- when flush is set to Z_FINISH, inflate() cannot return Z_OK. Instead it\r
- will return Z_BUF_ERROR if it has not reached the end of the stream.\r
- */\r
-\r
-int ZEXPORT inflate(strm, flush)\r
-z_streamp strm;\r
-int flush;\r
-{\r
- struct inflate_state FAR *state;\r
- unsigned char FAR *next; /* next input */\r
- unsigned char FAR *put; /* next output */\r
- unsigned have, left; /* available input and output */\r
- unsigned long hold; /* bit buffer */\r
- unsigned bits; /* bits in bit buffer */\r
- unsigned in, out; /* save starting available input and output */\r
- unsigned copy; /* number of stored or match bytes to copy */\r
- unsigned char FAR *from; /* where to copy match bytes from */\r
- code this; /* current decoding table entry */\r
- code last; /* parent table entry */\r
- unsigned len; /* length to copy for repeats, bits to drop */\r
- int ret; /* return code */\r
-#ifdef GUNZIP\r
- unsigned char hbuf[4]; /* buffer for gzip header crc calculation */\r
-#endif\r
- static const unsigned short order[19] = /* permutation of code lengths */\r
- {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL || strm->next_out == Z_NULL ||\r
- (strm->next_in == Z_NULL && strm->avail_in != 0))\r
- return Z_STREAM_ERROR;\r
-\r
- state = (struct inflate_state FAR *)strm->state;\r
- if (state->mode == TYPE) state->mode = TYPEDO; /* skip check */\r
- LOAD();\r
- in = have;\r
- out = left;\r
- ret = Z_OK;\r
- for (;;)\r
- switch (state->mode) {\r
- case HEAD:\r
- if (state->wrap == 0) {\r
- state->mode = TYPEDO;\r
- break;\r
- }\r
- NEEDBITS(16);\r
-#ifdef GUNZIP\r
- if ((state->wrap & 2) && hold == 0x8b1f) { /* gzip header */\r
- state->check = crc32(0L, Z_NULL, 0);\r
- CRC2(state->check, hold);\r
- INITBITS();\r
- state->mode = FLAGS;\r
- break;\r
- }\r
- state->flags = 0; /* expect zlib header */\r
- if (state->head != Z_NULL)\r
- state->head->done = -1;\r
- if (!(state->wrap & 1) || /* check if zlib header allowed */\r
-#else\r
- if (\r
-#endif\r
- ((BITS(8) << 8) + (hold >> 8)) % 31) {\r
- strm->msg = (char *)"incorrect header check";\r
- state->mode = BAD;\r
- break;\r
- }\r
- if (BITS(4) != Z_DEFLATED) {\r
- strm->msg = (char *)"unknown compression method";\r
- state->mode = BAD;\r
- break;\r
- }\r
- DROPBITS(4);\r
- len = BITS(4) + 8;\r
- if (len > state->wbits) {\r
- strm->msg = (char *)"invalid window size";\r
- state->mode = BAD;\r
- break;\r
- }\r
- state->dmax = 1U << len;\r
- Tracev((stderr, "inflate: zlib header ok\n"));\r
- strm->adler = state->check = adler32(0L, Z_NULL, 0);\r
- state->mode = hold & 0x200 ? DICTID : TYPE;\r
- INITBITS();\r
- break;\r
-#ifdef GUNZIP\r
- case FLAGS:\r
- NEEDBITS(16);\r
- state->flags = (int)(hold);\r
- if ((state->flags & 0xff) != Z_DEFLATED) {\r
- strm->msg = (char *)"unknown compression method";\r
- state->mode = BAD;\r
- break;\r
- }\r
- if (state->flags & 0xe000) {\r
- strm->msg = (char *)"unknown header flags set";\r
- state->mode = BAD;\r
- break;\r
- }\r
- if (state->head != Z_NULL)\r
- state->head->text = (int)((hold >> 8) & 1);\r
- if (state->flags & 0x0200) CRC2(state->check, hold);\r
- INITBITS();\r
- state->mode = TIME;\r
- case TIME:\r
- NEEDBITS(32);\r
- if (state->head != Z_NULL)\r
- state->head->time = hold;\r
- if (state->flags & 0x0200) CRC4(state->check, hold);\r
- INITBITS();\r
- state->mode = OS;\r
- case OS:\r
- NEEDBITS(16);\r
- if (state->head != Z_NULL) {\r
- state->head->xflags = (int)(hold & 0xff);\r
- state->head->os = (int)(hold >> 8);\r
- }\r
- if (state->flags & 0x0200) CRC2(state->check, hold);\r
- INITBITS();\r
- state->mode = EXLEN;\r
- case EXLEN:\r
- if (state->flags & 0x0400) {\r
- NEEDBITS(16);\r
- state->length = (unsigned)(hold);\r
- if (state->head != Z_NULL)\r
- state->head->extra_len = (unsigned)hold;\r
- if (state->flags & 0x0200) CRC2(state->check, hold);\r
- INITBITS();\r
- }\r
- else if (state->head != Z_NULL)\r
- state->head->extra = Z_NULL;\r
- state->mode = EXTRA;\r
- case EXTRA:\r
- if (state->flags & 0x0400) {\r
- copy = state->length;\r
- if (copy > have) copy = have;\r
- if (copy) {\r
- if (state->head != Z_NULL &&\r
- state->head->extra != Z_NULL) {\r
- len = state->head->extra_len - state->length;\r
- zmemcpy(state->head->extra + len, next,\r
- len + copy > state->head->extra_max ?\r
- state->head->extra_max - len : copy);\r
- }\r
- if (state->flags & 0x0200)\r
- state->check = crc32(state->check, next, copy);\r
- have -= copy;\r
- next += copy;\r
- state->length -= copy;\r
- }\r
- if (state->length) goto inf_leave;\r
- }\r
- state->length = 0;\r
- state->mode = NAME;\r
- case NAME:\r
- if (state->flags & 0x0800) {\r
- if (have == 0) goto inf_leave;\r
- copy = 0;\r
- do {\r
- len = (unsigned)(next[copy++]);\r
- if (state->head != Z_NULL &&\r
- state->head->name != Z_NULL &&\r
- state->length < state->head->name_max)\r
- state->head->name[state->length++] = len;\r
- } while (len && copy < have);\r
- if (state->flags & 0x0200)\r
- state->check = crc32(state->check, next, copy);\r
- have -= copy;\r
- next += copy;\r
- if (len) goto inf_leave;\r
- }\r
- else if (state->head != Z_NULL)\r
- state->head->name = Z_NULL;\r
- state->length = 0;\r
- state->mode = COMMENT;\r
- case COMMENT:\r
- if (state->flags & 0x1000) {\r
- if (have == 0) goto inf_leave;\r
- copy = 0;\r
- do {\r
- len = (unsigned)(next[copy++]);\r
- if (state->head != Z_NULL &&\r
- state->head->comment != Z_NULL &&\r
- state->length < state->head->comm_max)\r
- state->head->comment[state->length++] = len;\r
- } while (len && copy < have);\r
- if (state->flags & 0x0200)\r
- state->check = crc32(state->check, next, copy);\r
- have -= copy;\r
- next += copy;\r
- if (len) goto inf_leave;\r
- }\r
- else if (state->head != Z_NULL)\r
- state->head->comment = Z_NULL;\r
- state->mode = HCRC;\r
- case HCRC:\r
- if (state->flags & 0x0200) {\r
- NEEDBITS(16);\r
- if (hold != (state->check & 0xffff)) {\r
- strm->msg = (char *)"header crc mismatch";\r
- state->mode = BAD;\r
- break;\r
- }\r
- INITBITS();\r
- }\r
- if (state->head != Z_NULL) {\r
- state->head->hcrc = (int)((state->flags >> 9) & 1);\r
- state->head->done = 1;\r
- }\r
- strm->adler = state->check = crc32(0L, Z_NULL, 0);\r
- state->mode = TYPE;\r
- break;\r
-#endif\r
- case DICTID:\r
- NEEDBITS(32);\r
- strm->adler = state->check = REVERSE(hold);\r
- INITBITS();\r
- state->mode = DICT;\r
- case DICT:\r
- if (state->havedict == 0) {\r
- RESTORE();\r
- return Z_NEED_DICT;\r
- }\r
- strm->adler = state->check = adler32(0L, Z_NULL, 0);\r
- state->mode = TYPE;\r
- case TYPE:\r
- if (flush == Z_BLOCK) goto inf_leave;\r
- case TYPEDO:\r
- if (state->last) {\r
- BYTEBITS();\r
- state->mode = CHECK;\r
- break;\r
- }\r
- NEEDBITS(3);\r
- state->last = BITS(1);\r
- DROPBITS(1);\r
- switch (BITS(2)) {\r
- case 0: /* stored block */\r
- Tracev((stderr, "inflate: stored block%s\n",\r
- state->last ? " (last)" : ""));\r
- state->mode = STORED;\r
- break;\r
- case 1: /* fixed block */\r
- fixedtables(state);\r
- Tracev((stderr, "inflate: fixed codes block%s\n",\r
- state->last ? " (last)" : ""));\r
- state->mode = LEN; /* decode codes */\r
- break;\r
- case 2: /* dynamic block */\r
- Tracev((stderr, "inflate: dynamic codes block%s\n",\r
- state->last ? " (last)" : ""));\r
- state->mode = TABLE;\r
- break;\r
- case 3:\r
- strm->msg = (char *)"invalid block type";\r
- state->mode = BAD;\r
- }\r
- DROPBITS(2);\r
- break;\r
- case STORED:\r
- BYTEBITS(); /* go to byte boundary */\r
- NEEDBITS(32);\r
- if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {\r
- strm->msg = (char *)"invalid stored block lengths";\r
- state->mode = BAD;\r
- break;\r
- }\r
- state->length = (unsigned)hold & 0xffff;\r
- Tracev((stderr, "inflate: stored length %u\n",\r
- state->length));\r
- INITBITS();\r
- state->mode = COPY;\r
- case COPY:\r
- copy = state->length;\r
- if (copy) {\r
- if (copy > have) copy = have;\r
- if (copy > left) copy = left;\r
- if (copy == 0) goto inf_leave;\r
- zmemcpy(put, next, copy);\r
- have -= copy;\r
- next += copy;\r
- left -= copy;\r
- put += copy;\r
- state->length -= copy;\r
- break;\r
- }\r
- Tracev((stderr, "inflate: stored end\n"));\r
- state->mode = TYPE;\r
- break;\r
- case TABLE:\r
- NEEDBITS(14);\r
- state->nlen = BITS(5) + 257;\r
- DROPBITS(5);\r
- state->ndist = BITS(5) + 1;\r
- DROPBITS(5);\r
- state->ncode = BITS(4) + 4;\r
- DROPBITS(4);\r
-#ifndef PKZIP_BUG_WORKAROUND\r
- if (state->nlen > 286 || state->ndist > 30) {\r
- strm->msg = (char *)"too many length or distance symbols";\r
- state->mode = BAD;\r
- break;\r
- }\r
-#endif\r
- Tracev((stderr, "inflate: table sizes ok\n"));\r
- state->have = 0;\r
- state->mode = LENLENS;\r
- case LENLENS:\r
- while (state->have < state->ncode) {\r
- NEEDBITS(3);\r
- state->lens[order[state->have++]] = (unsigned short)BITS(3);\r
- DROPBITS(3);\r
- }\r
- while (state->have < 19)\r
- state->lens[order[state->have++]] = 0;\r
- state->next = state->codes;\r
- state->lencode = (code const FAR *)(state->next);\r
- state->lenbits = 7;\r
- ret = inflate_table(CODES, state->lens, 19, &(state->next),\r
- &(state->lenbits), state->work);\r
- if (ret) {\r
- strm->msg = (char *)"invalid code lengths set";\r
- state->mode = BAD;\r
- break;\r
- }\r
- Tracev((stderr, "inflate: code lengths ok\n"));\r
- state->have = 0;\r
- state->mode = CODELENS;\r
- case CODELENS:\r
- while (state->have < state->nlen + state->ndist) {\r
- for (;;) {\r
- this = state->lencode[BITS(state->lenbits)];\r
- if ((unsigned)(this.bits) <= bits) break;\r
- PULLBYTE();\r
- }\r
- if (this.val < 16) {\r
- NEEDBITS(this.bits);\r
- DROPBITS(this.bits);\r
- state->lens[state->have++] = this.val;\r
- }\r
- else {\r
- if (this.val == 16) {\r
- NEEDBITS(this.bits + 2);\r
- DROPBITS(this.bits);\r
- if (state->have == 0) {\r
- strm->msg = (char *)"invalid bit length repeat";\r
- state->mode = BAD;\r
- break;\r
- }\r
- len = state->lens[state->have - 1];\r
- copy = 3 + BITS(2);\r
- DROPBITS(2);\r
- }\r
- else if (this.val == 17) {\r
- NEEDBITS(this.bits + 3);\r
- DROPBITS(this.bits);\r
- len = 0;\r
- copy = 3 + BITS(3);\r
- DROPBITS(3);\r
- }\r
- else {\r
- NEEDBITS(this.bits + 7);\r
- DROPBITS(this.bits);\r
- len = 0;\r
- copy = 11 + BITS(7);\r
- DROPBITS(7);\r
- }\r
- if (state->have + copy > state->nlen + state->ndist) {\r
- strm->msg = (char *)"invalid bit length repeat";\r
- state->mode = BAD;\r
- break;\r
- }\r
- while (copy--)\r
- state->lens[state->have++] = (unsigned short)len;\r
- }\r
- }\r
-\r
- /* handle error breaks in while */\r
- if (state->mode == BAD) break;\r
-\r
- /* build code tables */\r
- state->next = state->codes;\r
- state->lencode = (code const FAR *)(state->next);\r
- state->lenbits = 9;\r
- ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),\r
- &(state->lenbits), state->work);\r
- if (ret) {\r
- strm->msg = (char *)"invalid literal/lengths set";\r
- state->mode = BAD;\r
- break;\r
- }\r
- state->distcode = (code const FAR *)(state->next);\r
- state->distbits = 6;\r
- ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,\r
- &(state->next), &(state->distbits), state->work);\r
- if (ret) {\r
- strm->msg = (char *)"invalid distances set";\r
- state->mode = BAD;\r
- break;\r
- }\r
- Tracev((stderr, "inflate: codes ok\n"));\r
- state->mode = LEN;\r
- case LEN:\r
- if (have >= 6 && left >= 258) {\r
- RESTORE();\r
- inflate_fast(strm, out);\r
- LOAD();\r
- break;\r
- }\r
- for (;;) {\r
- this = state->lencode[BITS(state->lenbits)];\r
- if ((unsigned)(this.bits) <= bits) break;\r
- PULLBYTE();\r
- }\r
- if (this.op && (this.op & 0xf0) == 0) {\r
- last = this;\r
- for (;;) {\r
- this = state->lencode[last.val +\r
- (BITS(last.bits + last.op) >> last.bits)];\r
- if ((unsigned)(last.bits + this.bits) <= bits) break;\r
- PULLBYTE();\r
- }\r
- DROPBITS(last.bits);\r
- }\r
- DROPBITS(this.bits);\r
- state->length = (unsigned)this.val;\r
- if ((int)(this.op) == 0) {\r
- Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?\r
- "inflate: literal '%c'\n" :\r
- "inflate: literal 0x%02x\n", this.val));\r
- state->mode = LIT;\r
- break;\r
- }\r
- if (this.op & 32) {\r
- Tracevv((stderr, "inflate: end of block\n"));\r
- state->mode = TYPE;\r
- break;\r
- }\r
- if (this.op & 64) {\r
- strm->msg = (char *)"invalid literal/length code";\r
- state->mode = BAD;\r
- break;\r
- }\r
- state->extra = (unsigned)(this.op) & 15;\r
- state->mode = LENEXT;\r
- case LENEXT:\r
- if (state->extra) {\r
- NEEDBITS(state->extra);\r
- state->length += BITS(state->extra);\r
- DROPBITS(state->extra);\r
- }\r
- Tracevv((stderr, "inflate: length %u\n", state->length));\r
- state->mode = DIST;\r
- case DIST:\r
- for (;;) {\r
- this = state->distcode[BITS(state->distbits)];\r
- if ((unsigned)(this.bits) <= bits) break;\r
- PULLBYTE();\r
- }\r
- if ((this.op & 0xf0) == 0) {\r
- last = this;\r
- for (;;) {\r
- this = state->distcode[last.val +\r
- (BITS(last.bits + last.op) >> last.bits)];\r
- if ((unsigned)(last.bits + this.bits) <= bits) break;\r
- PULLBYTE();\r
- }\r
- DROPBITS(last.bits);\r
- }\r
- DROPBITS(this.bits);\r
- if (this.op & 64) {\r
- strm->msg = (char *)"invalid distance code";\r
- state->mode = BAD;\r
- break;\r
- }\r
- state->offset = (unsigned)this.val;\r
- state->extra = (unsigned)(this.op) & 15;\r
- state->mode = DISTEXT;\r
- case DISTEXT:\r
- if (state->extra) {\r
- NEEDBITS(state->extra);\r
- state->offset += BITS(state->extra);\r
- DROPBITS(state->extra);\r
- }\r
-#ifdef INFLATE_STRICT\r
- if (state->offset > state->dmax) {\r
- strm->msg = (char *)"invalid distance too far back";\r
- state->mode = BAD;\r
- break;\r
- }\r
-#endif\r
- if (state->offset > state->whave + out - left) {\r
- strm->msg = (char *)"invalid distance too far back";\r
- state->mode = BAD;\r
- break;\r
- }\r
- Tracevv((stderr, "inflate: distance %u\n", state->offset));\r
- state->mode = MATCH;\r
- case MATCH:\r
- if (left == 0) goto inf_leave;\r
- copy = out - left;\r
- if (state->offset > copy) { /* copy from window */\r
- copy = state->offset - copy;\r
- if (copy > state->write) {\r
- copy -= state->write;\r
- from = state->window + (state->wsize - copy);\r
- }\r
- else\r
- from = state->window + (state->write - copy);\r
- if (copy > state->length) copy = state->length;\r
- }\r
- else { /* copy from output */\r
- from = put - state->offset;\r
- copy = state->length;\r
- }\r
- if (copy > left) copy = left;\r
- left -= copy;\r
- state->length -= copy;\r
- do {\r
- *put++ = *from++;\r
- } while (--copy);\r
- if (state->length == 0) state->mode = LEN;\r
- break;\r
- case LIT:\r
- if (left == 0) goto inf_leave;\r
- *put++ = (unsigned char)(state->length);\r
- left--;\r
- state->mode = LEN;\r
- break;\r
- case CHECK:\r
- if (state->wrap) {\r
- NEEDBITS(32);\r
- out -= left;\r
- strm->total_out += out;\r
- state->total += out;\r
- if (out)\r
- strm->adler = state->check =\r
- UPDATE(state->check, put - out, out);\r
- out = left;\r
- if ((\r
-#ifdef GUNZIP\r
- state->flags ? hold :\r
-#endif\r
- REVERSE(hold)) != state->check) {\r
- strm->msg = (char *)"incorrect data check";\r
- state->mode = BAD;\r
- break;\r
- }\r
- INITBITS();\r
- Tracev((stderr, "inflate: check matches trailer\n"));\r
- }\r
-#ifdef GUNZIP\r
- state->mode = LENGTH;\r
- case LENGTH:\r
- if (state->wrap && state->flags) {\r
- NEEDBITS(32);\r
- if (hold != (state->total & 0xffffffffUL)) {\r
- strm->msg = (char *)"incorrect length check";\r
- state->mode = BAD;\r
- break;\r
- }\r
- INITBITS();\r
- Tracev((stderr, "inflate: length matches trailer\n"));\r
- }\r
-#endif\r
- state->mode = DONE;\r
- case DONE:\r
- ret = Z_STREAM_END;\r
- goto inf_leave;\r
- case BAD:\r
- ret = Z_DATA_ERROR;\r
- goto inf_leave;\r
- case MEM:\r
- return Z_MEM_ERROR;\r
- case SYNC:\r
- default:\r
- return Z_STREAM_ERROR;\r
- }\r
-\r
- /*\r
- Return from inflate(), updating the total counts and the check value.\r
- If there was no progress during the inflate() call, return a buffer\r
- error. Call updatewindow() to create and/or update the window state.\r
- Note: a memory error from inflate() is non-recoverable.\r
- */\r
- inf_leave:\r
- RESTORE();\r
- if (state->wsize || (state->mode < CHECK && out != strm->avail_out))\r
- if (updatewindow(strm, out)) {\r
- state->mode = MEM;\r
- return Z_MEM_ERROR;\r
- }\r
- in -= strm->avail_in;\r
- out -= strm->avail_out;\r
- strm->total_in += in;\r
- strm->total_out += out;\r
- state->total += out;\r
- if (state->wrap && out)\r
- strm->adler = state->check =\r
- UPDATE(state->check, strm->next_out - out, out);\r
- strm->data_type = state->bits + (state->last ? 64 : 0) +\r
- (state->mode == TYPE ? 128 : 0);\r
- if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK)\r
- ret = Z_BUF_ERROR;\r
- return ret;\r
-}\r
-\r
-int ZEXPORT inflateEnd(strm)\r
-z_streamp strm;\r
-{\r
- struct inflate_state FAR *state;\r
- if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)\r
- return Z_STREAM_ERROR;\r
- state = (struct inflate_state FAR *)strm->state;\r
- if (state->window != Z_NULL) ZFREE(strm, state->window);\r
- ZFREE(strm, strm->state);\r
- strm->state = Z_NULL;\r
- Tracev((stderr, "inflate: end\n"));\r
- return Z_OK;\r
-}\r
-\r
-int ZEXPORT inflateSetDictionary(strm, dictionary, dictLength)\r
-z_streamp strm;\r
-const Bytef *dictionary;\r
-uInt dictLength;\r
-{\r
- struct inflate_state FAR *state;\r
- unsigned long id;\r
-\r
- /* check state */\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- state = (struct inflate_state FAR *)strm->state;\r
- if (state->wrap != 0 && state->mode != DICT)\r
- return Z_STREAM_ERROR;\r
-\r
- /* check for correct dictionary id */\r
- if (state->mode == DICT) {\r
- id = adler32(0L, Z_NULL, 0);\r
- id = adler32(id, dictionary, dictLength);\r
- if (id != state->check)\r
- return Z_DATA_ERROR;\r
- }\r
-\r
- /* copy dictionary to window */\r
- if (updatewindow(strm, strm->avail_out)) {\r
- state->mode = MEM;\r
- return Z_MEM_ERROR;\r
- }\r
- if (dictLength > state->wsize) {\r
- zmemcpy(state->window, dictionary + dictLength - state->wsize,\r
- state->wsize);\r
- state->whave = state->wsize;\r
- }\r
- else {\r
- zmemcpy(state->window + state->wsize - dictLength, dictionary,\r
- dictLength);\r
- state->whave = dictLength;\r
- }\r
- state->havedict = 1;\r
- Tracev((stderr, "inflate: dictionary set\n"));\r
- return Z_OK;\r
-}\r
-\r
-int ZEXPORT inflateGetHeader(strm, head)\r
-z_streamp strm;\r
-gz_headerp head;\r
-{\r
- struct inflate_state FAR *state;\r
-\r
- /* check state */\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- state = (struct inflate_state FAR *)strm->state;\r
- if ((state->wrap & 2) == 0) return Z_STREAM_ERROR;\r
-\r
- /* save header structure */\r
- state->head = head;\r
- head->done = 0;\r
- return Z_OK;\r
-}\r
-\r
-/*\r
- Search buf[0..len-1] for the pattern: 0, 0, 0xff, 0xff. Return when found\r
- or when out of input. When called, *have is the number of pattern bytes\r
- found in order so far, in 0..3. On return *have is updated to the new\r
- state. If on return *have equals four, then the pattern was found and the\r
- return value is how many bytes were read including the last byte of the\r
- pattern. If *have is less than four, then the pattern has not been found\r
- yet and the return value is len. In the latter case, syncsearch() can be\r
- called again with more data and the *have state. *have is initialized to\r
- zero for the first call.\r
- */\r
-local unsigned syncsearch(have, buf, len)\r
-unsigned FAR *have;\r
-unsigned char FAR *buf;\r
-unsigned len;\r
-{\r
- unsigned got;\r
- unsigned next;\r
-\r
- got = *have;\r
- next = 0;\r
- while (next < len && got < 4) {\r
- if ((int)(buf[next]) == (got < 2 ? 0 : 0xff))\r
- got++;\r
- else if (buf[next])\r
- got = 0;\r
- else\r
- got = 4 - got;\r
- next++;\r
- }\r
- *have = got;\r
- return next;\r
-}\r
-\r
-int ZEXPORT inflateSync(strm)\r
-z_streamp strm;\r
-{\r
- unsigned len; /* number of bytes to look at or looked at */\r
- unsigned long in, out; /* temporary to save total_in and total_out */\r
- unsigned char buf[4]; /* to restore bit buffer to byte string */\r
- struct inflate_state FAR *state;\r
-\r
- /* check parameters */\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- state = (struct inflate_state FAR *)strm->state;\r
- if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR;\r
-\r
- /* if first time, start search in bit buffer */\r
- if (state->mode != SYNC) {\r
- state->mode = SYNC;\r
- state->hold <<= state->bits & 7;\r
- state->bits -= state->bits & 7;\r
- len = 0;\r
- while (state->bits >= 8) {\r
- buf[len++] = (unsigned char)(state->hold);\r
- state->hold >>= 8;\r
- state->bits -= 8;\r
- }\r
- state->have = 0;\r
- syncsearch(&(state->have), buf, len);\r
- }\r
-\r
- /* search available input */\r
- len = syncsearch(&(state->have), strm->next_in, strm->avail_in);\r
- strm->avail_in -= len;\r
- strm->next_in += len;\r
- strm->total_in += len;\r
-\r
- /* return no joy or set up to restart inflate() on a new block */\r
- if (state->have != 4) return Z_DATA_ERROR;\r
- in = strm->total_in; out = strm->total_out;\r
- inflateReset(strm);\r
- strm->total_in = in; strm->total_out = out;\r
- state->mode = TYPE;\r
- return Z_OK;\r
-}\r
-\r
-/*\r
- Returns true if inflate is currently at the end of a block generated by\r
- Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP\r
- implementation to provide an additional safety check. PPP uses\r
- Z_SYNC_FLUSH but removes the length bytes of the resulting empty stored\r
- block. When decompressing, PPP checks that at the end of input packet,\r
- inflate is waiting for these length bytes.\r
- */\r
-int ZEXPORT inflateSyncPoint(strm)\r
-z_streamp strm;\r
-{\r
- struct inflate_state FAR *state;\r
-\r
- if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
- state = (struct inflate_state FAR *)strm->state;\r
- return state->mode == STORED && state->bits == 0;\r
-}\r
-\r
-int ZEXPORT inflateCopy(dest, source)\r
-z_streamp dest;\r
-z_streamp source;\r
-{\r
- struct inflate_state FAR *state;\r
- struct inflate_state FAR *copy;\r
- unsigned char FAR *window;\r
- unsigned wsize;\r
-\r
- /* check input */\r
- if (dest == Z_NULL || source == Z_NULL || source->state == Z_NULL ||\r
- source->zalloc == (alloc_func)0 || source->zfree == (free_func)0)\r
- return Z_STREAM_ERROR;\r
- state = (struct inflate_state FAR *)source->state;\r
-\r
- /* allocate space */\r
- copy = (struct inflate_state FAR *)\r
- ZALLOC(source, 1, sizeof(struct inflate_state));\r
- if (copy == Z_NULL) return Z_MEM_ERROR;\r
- window = Z_NULL;\r
- if (state->window != Z_NULL) {\r
- window = (unsigned char FAR *)\r
- ZALLOC(source, 1U << state->wbits, sizeof(unsigned char));\r
- if (window == Z_NULL) {\r
- ZFREE(source, copy);\r
- return Z_MEM_ERROR;\r
- }\r
- }\r
-\r
- /* copy state */\r
- zmemcpy(dest, source, sizeof(z_stream));\r
- zmemcpy(copy, state, sizeof(struct inflate_state));\r
- if (state->lencode >= state->codes &&\r
- state->lencode <= state->codes + ENOUGH - 1) {\r
- copy->lencode = copy->codes + (state->lencode - state->codes);\r
- copy->distcode = copy->codes + (state->distcode - state->codes);\r
- }\r
- copy->next = copy->codes + (state->next - state->codes);\r
- if (window != Z_NULL) {\r
- wsize = 1U << state->wbits;\r
- zmemcpy(window, state->window, wsize);\r
- }\r
- copy->window = window;\r
- dest->state = (struct internal_state FAR *)copy;\r
- return Z_OK;\r
-}\r
+/* inflate.c -- zlib decompression
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/*
+ * Change history:
+ *
+ * 1.2.beta0 24 Nov 2002
+ * - First version -- complete rewrite of inflate to simplify code, avoid
+ * creation of window when not needed, minimize use of window when it is
+ * needed, make inffast.c even faster, implement gzip decoding, and to
+ * improve code readability and style over the previous zlib inflate code
+ *
+ * 1.2.beta1 25 Nov 2002
+ * - Use pointers for available input and output checking in inffast.c
+ * - Remove input and output counters in inffast.c
+ * - Change inffast.c entry and loop from avail_in >= 7 to >= 6
+ * - Remove unnecessary second byte pull from length extra in inffast.c
+ * - Unroll direct copy to three copies per loop in inffast.c
+ *
+ * 1.2.beta2 4 Dec 2002
+ * - Change external routine names to reduce potential conflicts
+ * - Correct filename to inffixed.h for fixed tables in inflate.c
+ * - Make hbuf[] unsigned char to match parameter type in inflate.c
+ * - Change strm->next_out[-state->offset] to *(strm->next_out - state->offset)
+ * to avoid negation problem on Alphas (64 bit) in inflate.c
+ *
+ * 1.2.beta3 22 Dec 2002
+ * - Add comments on state->bits assertion in inffast.c
+ * - Add comments on op field in inftrees.h
+ * - Fix bug in reuse of allocated window after inflateReset()
+ * - Remove bit fields--back to byte structure for speed
+ * - Remove distance extra == 0 check in inflate_fast()--only helps for lengths
+ * - Change post-increments to pre-increments in inflate_fast(), PPC biased?
+ * - Add compile time option, POSTINC, to use post-increments instead (Intel?)
+ * - Make MATCH copy in inflate() much faster for when inflate_fast() not used
+ * - Use local copies of stream next and avail values, as well as local bit
+ * buffer and bit count in inflate()--for speed when inflate_fast() not used
+ *
+ * 1.2.beta4 1 Jan 2003
+ * - Split ptr - 257 statements in inflate_table() to avoid compiler warnings
+ * - Move a comment on output buffer sizes from inffast.c to inflate.c
+ * - Add comments in inffast.c to introduce the inflate_fast() routine
+ * - Rearrange window copies in inflate_fast() for speed and simplification
+ * - Unroll last copy for window match in inflate_fast()
+ * - Use local copies of window variables in inflate_fast() for speed
+ * - Pull out common write == 0 case for speed in inflate_fast()
+ * - Make op and len in inflate_fast() unsigned for consistency
+ * - Add FAR to lcode and dcode declarations in inflate_fast()
+ * - Simplified bad distance check in inflate_fast()
+ * - Added inflateBackInit(), inflateBack(), and inflateBackEnd() in new
+ * source file infback.c to provide a call-back interface to inflate for
+ * programs like gzip and unzip -- uses window as output buffer to avoid
+ * window copying
+ *
+ * 1.2.beta5 1 Jan 2003
+ * - Improved inflateBack() interface to allow the caller to provide initial
+ * input in strm.
+ * - Fixed stored blocks bug in inflateBack()
+ *
+ * 1.2.beta6 4 Jan 2003
+ * - Added comments in inffast.c on effectiveness of POSTINC
+ * - Typecasting all around to reduce compiler warnings
+ * - Changed loops from while (1) or do {} while (1) to for (;;), again to
+ * make compilers happy
+ * - Changed type of window in inflateBackInit() to unsigned char *
+ *
+ * 1.2.beta7 27 Jan 2003
+ * - Changed many types to unsigned or unsigned short to avoid warnings
+ * - Added inflateCopy() function
+ *
+ * 1.2.0 9 Mar 2003
+ * - Changed inflateBack() interface to provide separate opaque descriptors
+ * for the in() and out() functions
+ * - Changed inflateBack() argument and in_func typedef to swap the length
+ * and buffer address return values for the input function
+ * - Check next_in and next_out for Z_NULL on entry to inflate()
+ *
+ * The history for versions after 1.2.0 are in ChangeLog in zlib distribution.
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+#include "inflate.h"
+#include "inffast.h"
+
+#ifdef MAKEFIXED
+# ifndef BUILDFIXED
+# define BUILDFIXED
+# endif
+#endif
+
+/* function prototypes */
+local void fixedtables OF((struct inflate_state FAR *state));
+local int updatewindow OF((z_streamp strm, unsigned out));
+#ifdef BUILDFIXED
+ void makefixed OF((void));
+#endif
+local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
+ unsigned len));
+
+int ZEXPORT inflateReset(strm)
+z_streamp strm;
+{
+ struct inflate_state FAR *state;
+
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+ state = (struct inflate_state FAR *)strm->state;
+ strm->total_in = strm->total_out = state->total = 0;
+ strm->msg = Z_NULL;
+ strm->adler = 1; /* to support ill-conceived Java test suite */
+ state->mode = HEAD;
+ state->last = 0;
+ state->havedict = 0;
+ state->dmax = 32768U;
+ state->head = Z_NULL;
+ state->wsize = 0;
+ state->whave = 0;
+ state->write = 0;
+ state->hold = 0;
+ state->bits = 0;
+ state->lencode = state->distcode = state->next = state->codes;
+ Tracev((stderr, "inflate: reset\n"));
+ return Z_OK;
+}
+
+int ZEXPORT inflatePrime(strm, bits, value)
+z_streamp strm;
+int bits;
+int value;
+{
+ struct inflate_state FAR *state;
+
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+ state = (struct inflate_state FAR *)strm->state;
+ if (bits > 16 || state->bits + bits > 32) return Z_STREAM_ERROR;
+ value &= (1L << bits) - 1;
+ state->hold += value << state->bits;
+ state->bits += bits;
+ return Z_OK;
+}
+
+int ZEXPORT inflateInit2_(strm, windowBits, version, stream_size)
+z_streamp strm;
+int windowBits;
+const char *version;
+int stream_size;
+{
+ struct inflate_state FAR *state;
+
+ if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
+ stream_size != (int)(sizeof(z_stream)))
+ return Z_VERSION_ERROR;
+ if (strm == Z_NULL) return Z_STREAM_ERROR;
+ strm->msg = Z_NULL; /* in case we return an error */
+ if (strm->zalloc == (alloc_func)0) {
+ strm->zalloc = zcalloc;
+ strm->opaque = (voidpf)0;
+ }
+ if (strm->zfree == (free_func)0) strm->zfree = zcfree;
+ state = (struct inflate_state FAR *)
+ ZALLOC(strm, 1, sizeof(struct inflate_state));
+ if (state == Z_NULL) return Z_MEM_ERROR;
+ Tracev((stderr, "inflate: allocated\n"));
+ strm->state = (struct internal_state FAR *)state;
+ if (windowBits < 0) {
+ state->wrap = 0;
+ windowBits = -windowBits;
+ }
+ else {
+ state->wrap = (windowBits >> 4) + 1;
+#ifdef GUNZIP
+ if (windowBits < 48) windowBits &= 15;
+#endif
+ }
+ if (windowBits < 8 || windowBits > 15) {
+ ZFREE(strm, state);
+ strm->state = Z_NULL;
+ return Z_STREAM_ERROR;
+ }
+ state->wbits = (unsigned)windowBits;
+ state->window = Z_NULL;
+ return inflateReset(strm);
+}
+
+int ZEXPORT inflateInit_(strm, version, stream_size)
+z_streamp strm;
+const char *version;
+int stream_size;
+{
+ return inflateInit2_(strm, DEF_WBITS, version, stream_size);
+}
+
+/*
+ Return state with length and distance decoding tables and index sizes set to
+ fixed code decoding. Normally this returns fixed tables from inffixed.h.
+ If BUILDFIXED is defined, then instead this routine builds the tables the
+ first time it's called, and returns those tables the first time and
+ thereafter. This reduces the size of the code by about 2K bytes, in
+ exchange for a little execution time. However, BUILDFIXED should not be
+ used for threaded applications, since the rewriting of the tables and virgin
+ may not be thread-safe.
+ */
+local void fixedtables(state)
+struct inflate_state FAR *state;
+{
+#ifdef BUILDFIXED
+ static int virgin = 1;
+ static code *lenfix, *distfix;
+ static code fixed[544];
+
+ /* build fixed huffman tables if first call (may not be thread safe) */
+ if (virgin) {
+ unsigned sym, bits;
+ static code *next;
+
+ /* literal/length table */
+ sym = 0;
+ while (sym < 144) state->lens[sym++] = 8;
+ while (sym < 256) state->lens[sym++] = 9;
+ while (sym < 280) state->lens[sym++] = 7;
+ while (sym < 288) state->lens[sym++] = 8;
+ next = fixed;
+ lenfix = next;
+ bits = 9;
+ inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
+
+ /* distance table */
+ sym = 0;
+ while (sym < 32) state->lens[sym++] = 5;
+ distfix = next;
+ bits = 5;
+ inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
+
+ /* do this just once */
+ virgin = 0;
+ }
+#else /* !BUILDFIXED */
+# include "inffixed.h"
+#endif /* BUILDFIXED */
+ state->lencode = lenfix;
+ state->lenbits = 9;
+ state->distcode = distfix;
+ state->distbits = 5;
+}
+
+#ifdef MAKEFIXED
+#include <stdio.h>
+
+/*
+ Write out the inffixed.h that is #include'd above. Defining MAKEFIXED also
+ defines BUILDFIXED, so the tables are built on the fly. makefixed() writes
+ those tables to stdout, which would be piped to inffixed.h. A small program
+ can simply call makefixed to do this:
+
+ void makefixed(void);
+
+ int main(void)
+ {
+ makefixed();
+ return 0;
+ }
+
+ Then that can be linked with zlib built with MAKEFIXED defined and run:
+
+ a.out > inffixed.h
+ */
+void makefixed()
+{
+ unsigned low, size;
+ struct inflate_state state;
+
+ fixedtables(&state);
+ puts(" /* inffixed.h -- table for decoding fixed codes");
+ puts(" * Generated automatically by makefixed().");
+ puts(" */");
+ puts("");
+ puts(" /* WARNING: this file should *not* be used by applications.");
+ puts(" It is part of the implementation of this library and is");
+ puts(" subject to change. Applications should only use zlib.h.");
+ puts(" */");
+ puts("");
+ size = 1U << 9;
+ printf(" static const code lenfix[%u] = {", size);
+ low = 0;
+ for (;;) {
+ if ((low % 7) == 0) printf("\n ");
+ printf("{%u,%u,%d}", state.lencode[low].op, state.lencode[low].bits,
+ state.lencode[low].val);
+ if (++low == size) break;
+ putchar(',');
+ }
+ puts("\n };");
+ size = 1U << 5;
+ printf("\n static const code distfix[%u] = {", size);
+ low = 0;
+ for (;;) {
+ if ((low % 6) == 0) printf("\n ");
+ printf("{%u,%u,%d}", state.distcode[low].op, state.distcode[low].bits,
+ state.distcode[low].val);
+ if (++low == size) break;
+ putchar(',');
+ }
+ puts("\n };");
+}
+#endif /* MAKEFIXED */
+
+/*
+ Update the window with the last wsize (normally 32K) bytes written before
+ returning. If window does not exist yet, create it. This is only called
+ when a window is already in use, or when output has been written during this
+ inflate call, but the end of the deflate stream has not been reached yet.
+ It is also called to create a window for dictionary data when a dictionary
+ is loaded.
+
+ Providing output buffers larger than 32K to inflate() should provide a speed
+ advantage, since only the last 32K of output is copied to the sliding window
+ upon return from inflate(), and since all distances after the first 32K of
+ output will fall in the output data, making match copies simpler and faster.
+ The advantage may be dependent on the size of the processor's data caches.
+ */
+local int updatewindow(strm, out)
+z_streamp strm;
+unsigned out;
+{
+ struct inflate_state FAR *state;
+ unsigned copy, dist;
+
+ state = (struct inflate_state FAR *)strm->state;
+
+ /* if it hasn't been done already, allocate space for the window */
+ if (state->window == Z_NULL) {
+ state->window = (unsigned char FAR *)
+ ZALLOC(strm, 1U << state->wbits,
+ sizeof(unsigned char));
+ if (state->window == Z_NULL) return 1;
+ }
+
+ /* if window not in use yet, initialize */
+ if (state->wsize == 0) {
+ state->wsize = 1U << state->wbits;
+ state->write = 0;
+ state->whave = 0;
+ }
+
+ /* copy state->wsize or less output bytes into the circular window */
+ copy = out - strm->avail_out;
+ if (copy >= state->wsize) {
+ zmemcpy(state->window, strm->next_out - state->wsize, state->wsize);
+ state->write = 0;
+ state->whave = state->wsize;
+ }
+ else {
+ dist = state->wsize - state->write;
+ if (dist > copy) dist = copy;
+ zmemcpy(state->window + state->write, strm->next_out - copy, dist);
+ copy -= dist;
+ if (copy) {
+ zmemcpy(state->window, strm->next_out - copy, copy);
+ state->write = copy;
+ state->whave = state->wsize;
+ }
+ else {
+ state->write += dist;
+ if (state->write == state->wsize) state->write = 0;
+ if (state->whave < state->wsize) state->whave += dist;
+ }
+ }
+ return 0;
+}
+
+/* Macros for inflate(): */
+
+/* check function to use adler32() for zlib or crc32() for gzip */
+#ifdef GUNZIP
+# define UPDATE(check, buf, len) \
+ (state->flags ? crc32(check, buf, len) : adler32(check, buf, len))
+#else
+# define UPDATE(check, buf, len) adler32(check, buf, len)
+#endif
+
+/* check macros for header crc */
+#ifdef GUNZIP
+# define CRC2(check, word) \
+ do { \
+ hbuf[0] = (unsigned char)(word); \
+ hbuf[1] = (unsigned char)((word) >> 8); \
+ check = crc32(check, hbuf, 2); \
+ } while (0)
+
+# define CRC4(check, word) \
+ do { \
+ hbuf[0] = (unsigned char)(word); \
+ hbuf[1] = (unsigned char)((word) >> 8); \
+ hbuf[2] = (unsigned char)((word) >> 16); \
+ hbuf[3] = (unsigned char)((word) >> 24); \
+ check = crc32(check, hbuf, 4); \
+ } while (0)
+#endif
+
+/* Load registers with state in inflate() for speed */
+#define LOAD() \
+ do { \
+ put = strm->next_out; \
+ left = strm->avail_out; \
+ next = strm->next_in; \
+ have = strm->avail_in; \
+ hold = state->hold; \
+ bits = state->bits; \
+ } while (0)
+
+/* Restore state from registers in inflate() */
+#define RESTORE() \
+ do { \
+ strm->next_out = put; \
+ strm->avail_out = left; \
+ strm->next_in = next; \
+ strm->avail_in = have; \
+ state->hold = hold; \
+ state->bits = bits; \
+ } while (0)
+
+/* Clear the input bit accumulator */
+#define INITBITS() \
+ do { \
+ hold = 0; \
+ bits = 0; \
+ } while (0)
+
+/* Get a byte of input into the bit accumulator, or return from inflate()
+ if there is no input available. */
+#define PULLBYTE() \
+ do { \
+ if (have == 0) goto inf_leave; \
+ have--; \
+ hold += (unsigned long)(*next++) << bits; \
+ bits += 8; \
+ } while (0)
+
+/* Assure that there are at least n bits in the bit accumulator. If there is
+ not enough available input to do that, then return from inflate(). */
+#define NEEDBITS(n) \
+ do { \
+ while (bits < (unsigned)(n)) \
+ PULLBYTE(); \
+ } while (0)
+
+/* Return the low n bits of the bit accumulator (n < 16) */
+#define BITS(n) \
+ ((unsigned)hold & ((1U << (n)) - 1))
+
+/* Remove n bits from the bit accumulator */
+#define DROPBITS(n) \
+ do { \
+ hold >>= (n); \
+ bits -= (unsigned)(n); \
+ } while (0)
+
+/* Remove zero to seven bits as needed to go to a byte boundary */
+#define BYTEBITS() \
+ do { \
+ hold >>= bits & 7; \
+ bits -= bits & 7; \
+ } while (0)
+
+/* Reverse the bytes in a 32-bit value */
+#define REVERSE(q) \
+ ((((q) >> 24) & 0xff) + (((q) >> 8) & 0xff00) + \
+ (((q) & 0xff00) << 8) + (((q) & 0xff) << 24))
+
+/*
+ inflate() uses a state machine to process as much input data and generate as
+ much output data as possible before returning. The state machine is
+ structured roughly as follows:
+
+ for (;;) switch (state) {
+ ...
+ case STATEn:
+ if (not enough input data or output space to make progress)
+ return;
+ ... make progress ...
+ state = STATEm;
+ break;
+ ...
+ }
+
+ so when inflate() is called again, the same case is attempted again, and
+ if the appropriate resources are provided, the machine proceeds to the
+ next state. The NEEDBITS() macro is usually the way the state evaluates
+ whether it can proceed or should return. NEEDBITS() does the return if
+ the requested bits are not available. The typical use of the BITS macros
+ is:
+
+ NEEDBITS(n);
+ ... do something with BITS(n) ...
+ DROPBITS(n);
+
+ where NEEDBITS(n) either returns from inflate() if there isn't enough
+ input left to load n bits into the accumulator, or it continues. BITS(n)
+ gives the low n bits in the accumulator. When done, DROPBITS(n) drops
+ the low n bits off the accumulator. INITBITS() clears the accumulator
+ and sets the number of available bits to zero. BYTEBITS() discards just
+ enough bits to put the accumulator on a byte boundary. After BYTEBITS()
+ and a NEEDBITS(8), then BITS(8) would return the next byte in the stream.
+
+ NEEDBITS(n) uses PULLBYTE() to get an available byte of input, or to return
+ if there is no input available. The decoding of variable length codes uses
+ PULLBYTE() directly in order to pull just enough bytes to decode the next
+ code, and no more.
+
+ Some states loop until they get enough input, making sure that enough
+ state information is maintained to continue the loop where it left off
+ if NEEDBITS() returns in the loop. For example, want, need, and keep
+ would all have to actually be part of the saved state in case NEEDBITS()
+ returns:
+
+ case STATEw:
+ while (want < need) {
+ NEEDBITS(n);
+ keep[want++] = BITS(n);
+ DROPBITS(n);
+ }
+ state = STATEx;
+ case STATEx:
+
+ As shown above, if the next state is also the next case, then the break
+ is omitted.
+
+ A state may also return if there is not enough output space available to
+ complete that state. Those states are copying stored data, writing a
+ literal byte, and copying a matching string.
+
+ When returning, a "goto inf_leave" is used to update the total counters,
+ update the check value, and determine whether any progress has been made
+ during that inflate() call in order to return the proper return code.
+ Progress is defined as a change in either strm->avail_in or strm->avail_out.
+ When there is a window, goto inf_leave will update the window with the last
+ output written. If a goto inf_leave occurs in the middle of decompression
+ and there is no window currently, goto inf_leave will create one and copy
+ output to the window for the next call of inflate().
+
+ In this implementation, the flush parameter of inflate() only affects the
+ return code (per zlib.h). inflate() always writes as much as possible to
+ strm->next_out, given the space available and the provided input--the effect
+ documented in zlib.h of Z_SYNC_FLUSH. Furthermore, inflate() always defers
+ the allocation of and copying into a sliding window until necessary, which
+ provides the effect documented in zlib.h for Z_FINISH when the entire input
+ stream available. So the only thing the flush parameter actually does is:
+ when flush is set to Z_FINISH, inflate() cannot return Z_OK. Instead it
+ will return Z_BUF_ERROR if it has not reached the end of the stream.
+ */
+
+int ZEXPORT inflate(strm, flush)
+z_streamp strm;
+int flush;
+{
+ struct inflate_state FAR *state;
+ unsigned char FAR *next; /* next input */
+ unsigned char FAR *put; /* next output */
+ unsigned have, left; /* available input and output */
+ unsigned long hold; /* bit buffer */
+ unsigned bits; /* bits in bit buffer */
+ unsigned in, out; /* save starting available input and output */
+ unsigned copy; /* number of stored or match bytes to copy */
+ unsigned char FAR *from; /* where to copy match bytes from */
+ code this; /* current decoding table entry */
+ code last; /* parent table entry */
+ unsigned len; /* length to copy for repeats, bits to drop */
+ int ret; /* return code */
+#ifdef GUNZIP
+ unsigned char hbuf[4]; /* buffer for gzip header crc calculation */
+#endif
+ static const unsigned short order[19] = /* permutation of code lengths */
+ {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
+
+ if (strm == Z_NULL || strm->state == Z_NULL || strm->next_out == Z_NULL ||
+ (strm->next_in == Z_NULL && strm->avail_in != 0))
+ return Z_STREAM_ERROR;
+
+ state = (struct inflate_state FAR *)strm->state;
+ if (state->mode == TYPE) state->mode = TYPEDO; /* skip check */
+ LOAD();
+ in = have;
+ out = left;
+ ret = Z_OK;
+ for (;;)
+ switch (state->mode) {
+ case HEAD:
+ if (state->wrap == 0) {
+ state->mode = TYPEDO;
+ break;
+ }
+ NEEDBITS(16);
+#ifdef GUNZIP
+ if ((state->wrap & 2) && hold == 0x8b1f) { /* gzip header */
+ state->check = crc32(0L, Z_NULL, 0);
+ CRC2(state->check, hold);
+ INITBITS();
+ state->mode = FLAGS;
+ break;
+ }
+ state->flags = 0; /* expect zlib header */
+ if (state->head != Z_NULL)
+ state->head->done = -1;
+ if (!(state->wrap & 1) || /* check if zlib header allowed */
+#else
+ if (
+#endif
+ ((BITS(8) << 8) + (hold >> 8)) % 31) {
+ strm->msg = (char *)"incorrect header check";
+ state->mode = BAD;
+ break;
+ }
+ if (BITS(4) != Z_DEFLATED) {
+ strm->msg = (char *)"unknown compression method";
+ state->mode = BAD;
+ break;
+ }
+ DROPBITS(4);
+ len = BITS(4) + 8;
+ if (len > state->wbits) {
+ strm->msg = (char *)"invalid window size";
+ state->mode = BAD;
+ break;
+ }
+ state->dmax = 1U << len;
+ Tracev((stderr, "inflate: zlib header ok\n"));
+ strm->adler = state->check = adler32(0L, Z_NULL, 0);
+ state->mode = hold & 0x200 ? DICTID : TYPE;
+ INITBITS();
+ break;
+#ifdef GUNZIP
+ case FLAGS:
+ NEEDBITS(16);
+ state->flags = (int)(hold);
+ if ((state->flags & 0xff) != Z_DEFLATED) {
+ strm->msg = (char *)"unknown compression method";
+ state->mode = BAD;
+ break;
+ }
+ if (state->flags & 0xe000) {
+ strm->msg = (char *)"unknown header flags set";
+ state->mode = BAD;
+ break;
+ }
+ if (state->head != Z_NULL)
+ state->head->text = (int)((hold >> 8) & 1);
+ if (state->flags & 0x0200) CRC2(state->check, hold);
+ INITBITS();
+ state->mode = TIME;
+ case TIME:
+ NEEDBITS(32);
+ if (state->head != Z_NULL)
+ state->head->time = hold;
+ if (state->flags & 0x0200) CRC4(state->check, hold);
+ INITBITS();
+ state->mode = OS;
+ case OS:
+ NEEDBITS(16);
+ if (state->head != Z_NULL) {
+ state->head->xflags = (int)(hold & 0xff);
+ state->head->os = (int)(hold >> 8);
+ }
+ if (state->flags & 0x0200) CRC2(state->check, hold);
+ INITBITS();
+ state->mode = EXLEN;
+ case EXLEN:
+ if (state->flags & 0x0400) {
+ NEEDBITS(16);
+ state->length = (unsigned)(hold);
+ if (state->head != Z_NULL)
+ state->head->extra_len = (unsigned)hold;
+ if (state->flags & 0x0200) CRC2(state->check, hold);
+ INITBITS();
+ }
+ else if (state->head != Z_NULL)
+ state->head->extra = Z_NULL;
+ state->mode = EXTRA;
+ case EXTRA:
+ if (state->flags & 0x0400) {
+ copy = state->length;
+ if (copy > have) copy = have;
+ if (copy) {
+ if (state->head != Z_NULL &&
+ state->head->extra != Z_NULL) {
+ len = state->head->extra_len - state->length;
+ zmemcpy(state->head->extra + len, next,
+ len + copy > state->head->extra_max ?
+ state->head->extra_max - len : copy);
+ }
+ if (state->flags & 0x0200)
+ state->check = crc32(state->check, next, copy);
+ have -= copy;
+ next += copy;
+ state->length -= copy;
+ }
+ if (state->length) goto inf_leave;
+ }
+ state->length = 0;
+ state->mode = NAME;
+ case NAME:
+ if (state->flags & 0x0800) {
+ if (have == 0) goto inf_leave;
+ copy = 0;
+ do {
+ len = (unsigned)(next[copy++]);
+ if (state->head != Z_NULL &&
+ state->head->name != Z_NULL &&
+ state->length < state->head->name_max)
+ state->head->name[state->length++] = len;
+ } while (len && copy < have);
+ if (state->flags & 0x0200)
+ state->check = crc32(state->check, next, copy);
+ have -= copy;
+ next += copy;
+ if (len) goto inf_leave;
+ }
+ else if (state->head != Z_NULL)
+ state->head->name = Z_NULL;
+ state->length = 0;
+ state->mode = COMMENT;
+ case COMMENT:
+ if (state->flags & 0x1000) {
+ if (have == 0) goto inf_leave;
+ copy = 0;
+ do {
+ len = (unsigned)(next[copy++]);
+ if (state->head != Z_NULL &&
+ state->head->comment != Z_NULL &&
+ state->length < state->head->comm_max)
+ state->head->comment[state->length++] = len;
+ } while (len && copy < have);
+ if (state->flags & 0x0200)
+ state->check = crc32(state->check, next, copy);
+ have -= copy;
+ next += copy;
+ if (len) goto inf_leave;
+ }
+ else if (state->head != Z_NULL)
+ state->head->comment = Z_NULL;
+ state->mode = HCRC;
+ case HCRC:
+ if (state->flags & 0x0200) {
+ NEEDBITS(16);
+ if (hold != (state->check & 0xffff)) {
+ strm->msg = (char *)"header crc mismatch";
+ state->mode = BAD;
+ break;
+ }
+ INITBITS();
+ }
+ if (state->head != Z_NULL) {
+ state->head->hcrc = (int)((state->flags >> 9) & 1);
+ state->head->done = 1;
+ }
+ strm->adler = state->check = crc32(0L, Z_NULL, 0);
+ state->mode = TYPE;
+ break;
+#endif
+ case DICTID:
+ NEEDBITS(32);
+ strm->adler = state->check = REVERSE(hold);
+ INITBITS();
+ state->mode = DICT;
+ case DICT:
+ if (state->havedict == 0) {
+ RESTORE();
+ return Z_NEED_DICT;
+ }
+ strm->adler = state->check = adler32(0L, Z_NULL, 0);
+ state->mode = TYPE;
+ case TYPE:
+ if (flush == Z_BLOCK) goto inf_leave;
+ case TYPEDO:
+ if (state->last) {
+ BYTEBITS();
+ state->mode = CHECK;
+ break;
+ }
+ NEEDBITS(3);
+ state->last = BITS(1);
+ DROPBITS(1);
+ switch (BITS(2)) {
+ case 0: /* stored block */
+ Tracev((stderr, "inflate: stored block%s\n",
+ state->last ? " (last)" : ""));
+ state->mode = STORED;
+ break;
+ case 1: /* fixed block */
+ fixedtables(state);
+ Tracev((stderr, "inflate: fixed codes block%s\n",
+ state->last ? " (last)" : ""));
+ state->mode = LEN; /* decode codes */
+ break;
+ case 2: /* dynamic block */
+ Tracev((stderr, "inflate: dynamic codes block%s\n",
+ state->last ? " (last)" : ""));
+ state->mode = TABLE;
+ break;
+ case 3:
+ strm->msg = (char *)"invalid block type";
+ state->mode = BAD;
+ }
+ DROPBITS(2);
+ break;
+ case STORED:
+ BYTEBITS(); /* go to byte boundary */
+ NEEDBITS(32);
+ if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
+ strm->msg = (char *)"invalid stored block lengths";
+ state->mode = BAD;
+ break;
+ }
+ state->length = (unsigned)hold & 0xffff;
+ Tracev((stderr, "inflate: stored length %u\n",
+ state->length));
+ INITBITS();
+ state->mode = COPY;
+ case COPY:
+ copy = state->length;
+ if (copy) {
+ if (copy > have) copy = have;
+ if (copy > left) copy = left;
+ if (copy == 0) goto inf_leave;
+ zmemcpy(put, next, copy);
+ have -= copy;
+ next += copy;
+ left -= copy;
+ put += copy;
+ state->length -= copy;
+ break;
+ }
+ Tracev((stderr, "inflate: stored end\n"));
+ state->mode = TYPE;
+ break;
+ case TABLE:
+ NEEDBITS(14);
+ state->nlen = BITS(5) + 257;
+ DROPBITS(5);
+ state->ndist = BITS(5) + 1;
+ DROPBITS(5);
+ state->ncode = BITS(4) + 4;
+ DROPBITS(4);
+#ifndef PKZIP_BUG_WORKAROUND
+ if (state->nlen > 286 || state->ndist > 30) {
+ strm->msg = (char *)"too many length or distance symbols";
+ state->mode = BAD;
+ break;
+ }
+#endif
+ Tracev((stderr, "inflate: table sizes ok\n"));
+ state->have = 0;
+ state->mode = LENLENS;
+ case LENLENS:
+ while (state->have < state->ncode) {
+ NEEDBITS(3);
+ state->lens[order[state->have++]] = (unsigned short)BITS(3);
+ DROPBITS(3);
+ }
+ while (state->have < 19)
+ state->lens[order[state->have++]] = 0;
+ state->next = state->codes;
+ state->lencode = (code const FAR *)(state->next);
+ state->lenbits = 7;
+ ret = inflate_table(CODES, state->lens, 19, &(state->next),
+ &(state->lenbits), state->work);
+ if (ret) {
+ strm->msg = (char *)"invalid code lengths set";
+ state->mode = BAD;
+ break;
+ }
+ Tracev((stderr, "inflate: code lengths ok\n"));
+ state->have = 0;
+ state->mode = CODELENS;
+ case CODELENS:
+ while (state->have < state->nlen + state->ndist) {
+ for (;;) {
+ this = state->lencode[BITS(state->lenbits)];
+ if ((unsigned)(this.bits) <= bits) break;
+ PULLBYTE();
+ }
+ if (this.val < 16) {
+ NEEDBITS(this.bits);
+ DROPBITS(this.bits);
+ state->lens[state->have++] = this.val;
+ }
+ else {
+ if (this.val == 16) {
+ NEEDBITS(this.bits + 2);
+ DROPBITS(this.bits);
+ if (state->have == 0) {
+ strm->msg = (char *)"invalid bit length repeat";
+ state->mode = BAD;
+ break;
+ }
+ len = state->lens[state->have - 1];
+ copy = 3 + BITS(2);
+ DROPBITS(2);
+ }
+ else if (this.val == 17) {
+ NEEDBITS(this.bits + 3);
+ DROPBITS(this.bits);
+ len = 0;
+ copy = 3 + BITS(3);
+ DROPBITS(3);
+ }
+ else {
+ NEEDBITS(this.bits + 7);
+ DROPBITS(this.bits);
+ len = 0;
+ copy = 11 + BITS(7);
+ DROPBITS(7);
+ }
+ if (state->have + copy > state->nlen + state->ndist) {
+ strm->msg = (char *)"invalid bit length repeat";
+ state->mode = BAD;
+ break;
+ }
+ while (copy--)
+ state->lens[state->have++] = (unsigned short)len;
+ }
+ }
+
+ /* handle error breaks in while */
+ if (state->mode == BAD) break;
+
+ /* build code tables */
+ state->next = state->codes;
+ state->lencode = (code const FAR *)(state->next);
+ state->lenbits = 9;
+ ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
+ &(state->lenbits), state->work);
+ if (ret) {
+ strm->msg = (char *)"invalid literal/lengths set";
+ state->mode = BAD;
+ break;
+ }
+ state->distcode = (code const FAR *)(state->next);
+ state->distbits = 6;
+ ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
+ &(state->next), &(state->distbits), state->work);
+ if (ret) {
+ strm->msg = (char *)"invalid distances set";
+ state->mode = BAD;
+ break;
+ }
+ Tracev((stderr, "inflate: codes ok\n"));
+ state->mode = LEN;
+ case LEN:
+ if (have >= 6 && left >= 258) {
+ RESTORE();
+ inflate_fast(strm, out);
+ LOAD();
+ break;
+ }
+ for (;;) {
+ this = state->lencode[BITS(state->lenbits)];
+ if ((unsigned)(this.bits) <= bits) break;
+ PULLBYTE();
+ }
+ if (this.op && (this.op & 0xf0) == 0) {
+ last = this;
+ for (;;) {
+ this = state->lencode[last.val +
+ (BITS(last.bits + last.op) >> last.bits)];
+ if ((unsigned)(last.bits + this.bits) <= bits) break;
+ PULLBYTE();
+ }
+ DROPBITS(last.bits);
+ }
+ DROPBITS(this.bits);
+ state->length = (unsigned)this.val;
+ if ((int)(this.op) == 0) {
+ Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?
+ "inflate: literal '%c'\n" :
+ "inflate: literal 0x%02x\n", this.val));
+ state->mode = LIT;
+ break;
+ }
+ if (this.op & 32) {
+ Tracevv((stderr, "inflate: end of block\n"));
+ state->mode = TYPE;
+ break;
+ }
+ if (this.op & 64) {
+ strm->msg = (char *)"invalid literal/length code";
+ state->mode = BAD;
+ break;
+ }
+ state->extra = (unsigned)(this.op) & 15;
+ state->mode = LENEXT;
+ case LENEXT:
+ if (state->extra) {
+ NEEDBITS(state->extra);
+ state->length += BITS(state->extra);
+ DROPBITS(state->extra);
+ }
+ Tracevv((stderr, "inflate: length %u\n", state->length));
+ state->mode = DIST;
+ case DIST:
+ for (;;) {
+ this = state->distcode[BITS(state->distbits)];
+ if ((unsigned)(this.bits) <= bits) break;
+ PULLBYTE();
+ }
+ if ((this.op & 0xf0) == 0) {
+ last = this;
+ for (;;) {
+ this = state->distcode[last.val +
+ (BITS(last.bits + last.op) >> last.bits)];
+ if ((unsigned)(last.bits + this.bits) <= bits) break;
+ PULLBYTE();
+ }
+ DROPBITS(last.bits);
+ }
+ DROPBITS(this.bits);
+ if (this.op & 64) {
+ strm->msg = (char *)"invalid distance code";
+ state->mode = BAD;
+ break;
+ }
+ state->offset = (unsigned)this.val;
+ state->extra = (unsigned)(this.op) & 15;
+ state->mode = DISTEXT;
+ case DISTEXT:
+ if (state->extra) {
+ NEEDBITS(state->extra);
+ state->offset += BITS(state->extra);
+ DROPBITS(state->extra);
+ }
+#ifdef INFLATE_STRICT
+ if (state->offset > state->dmax) {
+ strm->msg = (char *)"invalid distance too far back";
+ state->mode = BAD;
+ break;
+ }
+#endif
+ if (state->offset > state->whave + out - left) {
+ strm->msg = (char *)"invalid distance too far back";
+ state->mode = BAD;
+ break;
+ }
+ Tracevv((stderr, "inflate: distance %u\n", state->offset));
+ state->mode = MATCH;
+ case MATCH:
+ if (left == 0) goto inf_leave;
+ copy = out - left;
+ if (state->offset > copy) { /* copy from window */
+ copy = state->offset - copy;
+ if (copy > state->write) {
+ copy -= state->write;
+ from = state->window + (state->wsize - copy);
+ }
+ else
+ from = state->window + (state->write - copy);
+ if (copy > state->length) copy = state->length;
+ }
+ else { /* copy from output */
+ from = put - state->offset;
+ copy = state->length;
+ }
+ if (copy > left) copy = left;
+ left -= copy;
+ state->length -= copy;
+ do {
+ *put++ = *from++;
+ } while (--copy);
+ if (state->length == 0) state->mode = LEN;
+ break;
+ case LIT:
+ if (left == 0) goto inf_leave;
+ *put++ = (unsigned char)(state->length);
+ left--;
+ state->mode = LEN;
+ break;
+ case CHECK:
+ if (state->wrap) {
+ NEEDBITS(32);
+ out -= left;
+ strm->total_out += out;
+ state->total += out;
+ if (out)
+ strm->adler = state->check =
+ UPDATE(state->check, put - out, out);
+ out = left;
+ if ((
+#ifdef GUNZIP
+ state->flags ? hold :
+#endif
+ REVERSE(hold)) != state->check) {
+ strm->msg = (char *)"incorrect data check";
+ state->mode = BAD;
+ break;
+ }
+ INITBITS();
+ Tracev((stderr, "inflate: check matches trailer\n"));
+ }
+#ifdef GUNZIP
+ state->mode = LENGTH;
+ case LENGTH:
+ if (state->wrap && state->flags) {
+ NEEDBITS(32);
+ if (hold != (state->total & 0xffffffffUL)) {
+ strm->msg = (char *)"incorrect length check";
+ state->mode = BAD;
+ break;
+ }
+ INITBITS();
+ Tracev((stderr, "inflate: length matches trailer\n"));
+ }
+#endif
+ state->mode = DONE;
+ case DONE:
+ ret = Z_STREAM_END;
+ goto inf_leave;
+ case BAD:
+ ret = Z_DATA_ERROR;
+ goto inf_leave;
+ case MEM:
+ return Z_MEM_ERROR;
+ case SYNC:
+ default:
+ return Z_STREAM_ERROR;
+ }
+
+ /*
+ Return from inflate(), updating the total counts and the check value.
+ If there was no progress during the inflate() call, return a buffer
+ error. Call updatewindow() to create and/or update the window state.
+ Note: a memory error from inflate() is non-recoverable.
+ */
+ inf_leave:
+ RESTORE();
+ if (state->wsize || (state->mode < CHECK && out != strm->avail_out))
+ if (updatewindow(strm, out)) {
+ state->mode = MEM;
+ return Z_MEM_ERROR;
+ }
+ in -= strm->avail_in;
+ out -= strm->avail_out;
+ strm->total_in += in;
+ strm->total_out += out;
+ state->total += out;
+ if (state->wrap && out)
+ strm->adler = state->check =
+ UPDATE(state->check, strm->next_out - out, out);
+ strm->data_type = state->bits + (state->last ? 64 : 0) +
+ (state->mode == TYPE ? 128 : 0);
+ if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK)
+ ret = Z_BUF_ERROR;
+ return ret;
+}
+
+int ZEXPORT inflateEnd(strm)
+z_streamp strm;
+{
+ struct inflate_state FAR *state;
+ if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
+ return Z_STREAM_ERROR;
+ state = (struct inflate_state FAR *)strm->state;
+ if (state->window != Z_NULL) ZFREE(strm, state->window);
+ ZFREE(strm, strm->state);
+ strm->state = Z_NULL;
+ Tracev((stderr, "inflate: end\n"));
+ return Z_OK;
+}
+
+int ZEXPORT inflateSetDictionary(strm, dictionary, dictLength)
+z_streamp strm;
+const Bytef *dictionary;
+uInt dictLength;
+{
+ struct inflate_state FAR *state;
+ unsigned long id;
+
+ /* check state */
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+ state = (struct inflate_state FAR *)strm->state;
+ if (state->wrap != 0 && state->mode != DICT)
+ return Z_STREAM_ERROR;
+
+ /* check for correct dictionary id */
+ if (state->mode == DICT) {
+ id = adler32(0L, Z_NULL, 0);
+ id = adler32(id, dictionary, dictLength);
+ if (id != state->check)
+ return Z_DATA_ERROR;
+ }
+
+ /* copy dictionary to window */
+ if (updatewindow(strm, strm->avail_out)) {
+ state->mode = MEM;
+ return Z_MEM_ERROR;
+ }
+ if (dictLength > state->wsize) {
+ zmemcpy(state->window, dictionary + dictLength - state->wsize,
+ state->wsize);
+ state->whave = state->wsize;
+ }
+ else {
+ zmemcpy(state->window + state->wsize - dictLength, dictionary,
+ dictLength);
+ state->whave = dictLength;
+ }
+ state->havedict = 1;
+ Tracev((stderr, "inflate: dictionary set\n"));
+ return Z_OK;
+}
+
+int ZEXPORT inflateGetHeader(strm, head)
+z_streamp strm;
+gz_headerp head;
+{
+ struct inflate_state FAR *state;
+
+ /* check state */
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+ state = (struct inflate_state FAR *)strm->state;
+ if ((state->wrap & 2) == 0) return Z_STREAM_ERROR;
+
+ /* save header structure */
+ state->head = head;
+ head->done = 0;
+ return Z_OK;
+}
+
+/*
+ Search buf[0..len-1] for the pattern: 0, 0, 0xff, 0xff. Return when found
+ or when out of input. When called, *have is the number of pattern bytes
+ found in order so far, in 0..3. On return *have is updated to the new
+ state. If on return *have equals four, then the pattern was found and the
+ return value is how many bytes were read including the last byte of the
+ pattern. If *have is less than four, then the pattern has not been found
+ yet and the return value is len. In the latter case, syncsearch() can be
+ called again with more data and the *have state. *have is initialized to
+ zero for the first call.
+ */
+local unsigned syncsearch(have, buf, len)
+unsigned FAR *have;
+unsigned char FAR *buf;
+unsigned len;
+{
+ unsigned got;
+ unsigned next;
+
+ got = *have;
+ next = 0;
+ while (next < len && got < 4) {
+ if ((int)(buf[next]) == (got < 2 ? 0 : 0xff))
+ got++;
+ else if (buf[next])
+ got = 0;
+ else
+ got = 4 - got;
+ next++;
+ }
+ *have = got;
+ return next;
+}
+
+int ZEXPORT inflateSync(strm)
+z_streamp strm;
+{
+ unsigned len; /* number of bytes to look at or looked at */
+ unsigned long in, out; /* temporary to save total_in and total_out */
+ unsigned char buf[4]; /* to restore bit buffer to byte string */
+ struct inflate_state FAR *state;
+
+ /* check parameters */
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+ state = (struct inflate_state FAR *)strm->state;
+ if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR;
+
+ /* if first time, start search in bit buffer */
+ if (state->mode != SYNC) {
+ state->mode = SYNC;
+ state->hold <<= state->bits & 7;
+ state->bits -= state->bits & 7;
+ len = 0;
+ while (state->bits >= 8) {
+ buf[len++] = (unsigned char)(state->hold);
+ state->hold >>= 8;
+ state->bits -= 8;
+ }
+ state->have = 0;
+ syncsearch(&(state->have), buf, len);
+ }
+
+ /* search available input */
+ len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
+ strm->avail_in -= len;
+ strm->next_in += len;
+ strm->total_in += len;
+
+ /* return no joy or set up to restart inflate() on a new block */
+ if (state->have != 4) return Z_DATA_ERROR;
+ in = strm->total_in; out = strm->total_out;
+ inflateReset(strm);
+ strm->total_in = in; strm->total_out = out;
+ state->mode = TYPE;
+ 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(strm)
+z_streamp strm;
+{
+ struct inflate_state FAR *state;
+
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+ state = (struct inflate_state FAR *)strm->state;
+ return state->mode == STORED && state->bits == 0;
+}
+
+int ZEXPORT inflateCopy(dest, source)
+z_streamp dest;
+z_streamp source;
+{
+ struct inflate_state FAR *state;
+ struct inflate_state FAR *copy;
+ unsigned char FAR *window;
+ unsigned wsize;
+
+ /* check input */
+ if (dest == Z_NULL || source == Z_NULL || source->state == Z_NULL ||
+ source->zalloc == (alloc_func)0 || source->zfree == (free_func)0)
+ return Z_STREAM_ERROR;
+ state = (struct inflate_state FAR *)source->state;
+
+ /* allocate space */
+ copy = (struct inflate_state FAR *)
+ ZALLOC(source, 1, sizeof(struct inflate_state));
+ if (copy == Z_NULL) return Z_MEM_ERROR;
+ window = Z_NULL;
+ if (state->window != Z_NULL) {
+ window = (unsigned char FAR *)
+ ZALLOC(source, 1U << state->wbits, sizeof(unsigned char));
+ if (window == Z_NULL) {
+ ZFREE(source, copy);
+ return Z_MEM_ERROR;
+ }
+ }
+
+ /* copy state */
+ zmemcpy(dest, source, sizeof(z_stream));
+ zmemcpy(copy, state, sizeof(struct inflate_state));
+ if (state->lencode >= state->codes &&
+ state->lencode <= state->codes + ENOUGH - 1) {
+ copy->lencode = copy->codes + (state->lencode - state->codes);
+ copy->distcode = copy->codes + (state->distcode - state->codes);
+ }
+ copy->next = copy->codes + (state->next - state->codes);
+ if (window != Z_NULL) {
+ wsize = 1U << state->wbits;
+ zmemcpy(window, state->window, wsize);
+ }
+ copy->window = window;
+ dest->state = (struct internal_state FAR *)copy;
+ return Z_OK;
+}
-/* inflate.h -- internal inflate state definition\r
- * Copyright (C) 1995-2004 Mark Adler\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/* WARNING: this file should *not* be used by applications. It is\r
- part of the implementation of the compression library and is\r
- subject to change. Applications should only use zlib.h.\r
- */\r
-\r
-/* define NO_GZIP when compiling if you want to disable gzip header and\r
- trailer decoding by inflate(). NO_GZIP would be used to avoid linking in\r
- the crc code when it is not needed. For shared libraries, gzip decoding\r
- should be left enabled. */\r
-#ifndef NO_GZIP\r
-# define GUNZIP\r
-#endif\r
-\r
-/* Possible inflate modes between inflate() calls */\r
-typedef enum {\r
- HEAD, /* i: waiting for magic header */\r
- FLAGS, /* i: waiting for method and flags (gzip) */\r
- TIME, /* i: waiting for modification time (gzip) */\r
- OS, /* i: waiting for extra flags and operating system (gzip) */\r
- EXLEN, /* i: waiting for extra length (gzip) */\r
- EXTRA, /* i: waiting for extra bytes (gzip) */\r
- NAME, /* i: waiting for end of file name (gzip) */\r
- COMMENT, /* i: waiting for end of comment (gzip) */\r
- HCRC, /* i: waiting for header crc (gzip) */\r
- DICTID, /* i: waiting for dictionary check value */\r
- DICT, /* waiting for inflateSetDictionary() call */\r
- TYPE, /* i: waiting for type bits, including last-flag bit */\r
- TYPEDO, /* i: same, but skip check to exit inflate on new block */\r
- STORED, /* i: waiting for stored size (length and complement) */\r
- COPY, /* i/o: waiting for input or output to copy stored block */\r
- TABLE, /* i: waiting for dynamic block table lengths */\r
- LENLENS, /* i: waiting for code length code lengths */\r
- CODELENS, /* i: waiting for length/lit and distance code lengths */\r
- LEN, /* i: waiting for length/lit code */\r
- LENEXT, /* i: waiting for length extra bits */\r
- DIST, /* i: waiting for distance code */\r
- DISTEXT, /* i: waiting for distance extra bits */\r
- MATCH, /* o: waiting for output space to copy string */\r
- LIT, /* o: waiting for output space to write literal */\r
- CHECK, /* i: waiting for 32-bit check value */\r
- LENGTH, /* i: waiting for 32-bit length (gzip) */\r
- DONE, /* finished check, done -- remain here until reset */\r
- BAD, /* got a data error -- remain here until reset */\r
- MEM, /* got an inflate() memory error -- remain here until reset */\r
- SYNC /* looking for synchronization bytes to restart inflate() */\r
-} inflate_mode;\r
-\r
-/*\r
- State transitions between above modes -\r
-\r
- (most modes can go to the BAD or MEM mode -- not shown for clarity)\r
-\r
- Process header:\r
- HEAD -> (gzip) or (zlib)\r
- (gzip) -> FLAGS -> TIME -> OS -> EXLEN -> EXTRA -> NAME\r
- NAME -> COMMENT -> HCRC -> TYPE\r
- (zlib) -> DICTID or TYPE\r
- DICTID -> DICT -> TYPE\r
- Read deflate blocks:\r
- TYPE -> STORED or TABLE or LEN or CHECK\r
- STORED -> COPY -> TYPE\r
- TABLE -> LENLENS -> CODELENS -> LEN\r
- Read deflate codes:\r
- LEN -> LENEXT or LIT or TYPE\r
- LENEXT -> DIST -> DISTEXT -> MATCH -> LEN\r
- LIT -> LEN\r
- Process trailer:\r
- CHECK -> LENGTH -> DONE\r
- */\r
-\r
-/* state maintained between inflate() calls. Approximately 7K bytes. */\r
-struct inflate_state {\r
- inflate_mode mode; /* current inflate mode */\r
- int last; /* true if processing last block */\r
- int wrap; /* bit 0 true for zlib, bit 1 true for gzip */\r
- int havedict; /* true if dictionary provided */\r
- int flags; /* gzip header method and flags (0 if zlib) */\r
- unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */\r
- unsigned long check; /* protected copy of check value */\r
- unsigned long total; /* protected copy of output count */\r
- gz_headerp head; /* where to save gzip header information */\r
- /* sliding window */\r
- unsigned wbits; /* log base 2 of requested window size */\r
- unsigned wsize; /* window size or zero if not using window */\r
- unsigned whave; /* valid bytes in the window */\r
- unsigned write; /* window write index */\r
- unsigned char FAR *window; /* allocated sliding window, if needed */\r
- /* bit accumulator */\r
- unsigned long hold; /* input bit accumulator */\r
- unsigned bits; /* number of bits in "in" */\r
- /* for string and stored block copying */\r
- unsigned length; /* literal or length of data to copy */\r
- unsigned offset; /* distance back to copy string from */\r
- /* for table and code decoding */\r
- unsigned extra; /* extra bits needed */\r
- /* fixed and dynamic code tables */\r
- code const FAR *lencode; /* starting table for length/literal codes */\r
- code const FAR *distcode; /* starting table for distance codes */\r
- unsigned lenbits; /* index bits for lencode */\r
- unsigned distbits; /* index bits for distcode */\r
- /* dynamic table building */\r
- unsigned ncode; /* number of code length code lengths */\r
- unsigned nlen; /* number of length code lengths */\r
- unsigned ndist; /* number of distance code lengths */\r
- unsigned have; /* number of code lengths in lens[] */\r
- code FAR *next; /* next available space in codes[] */\r
- unsigned short lens[320]; /* temporary storage for code lengths */\r
- unsigned short work[288]; /* work area for code table building */\r
- code codes[ENOUGH]; /* space for code tables */\r
-};\r
+/* inflate.h -- internal inflate state definition
+ * Copyright (C) 1995-2004 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+ part of the implementation of the compression library and is
+ subject to change. Applications should only use zlib.h.
+ */
+
+/* define NO_GZIP when compiling if you want to disable gzip header and
+ trailer decoding by inflate(). NO_GZIP would be used to avoid linking in
+ the crc code when it is not needed. For shared libraries, gzip decoding
+ should be left enabled. */
+#ifndef NO_GZIP
+# define GUNZIP
+#endif
+
+/* Possible inflate modes between inflate() calls */
+typedef enum {
+ HEAD, /* i: waiting for magic header */
+ FLAGS, /* i: waiting for method and flags (gzip) */
+ TIME, /* i: waiting for modification time (gzip) */
+ OS, /* i: waiting for extra flags and operating system (gzip) */
+ EXLEN, /* i: waiting for extra length (gzip) */
+ EXTRA, /* i: waiting for extra bytes (gzip) */
+ NAME, /* i: waiting for end of file name (gzip) */
+ COMMENT, /* i: waiting for end of comment (gzip) */
+ HCRC, /* i: waiting for header crc (gzip) */
+ DICTID, /* i: waiting for dictionary check value */
+ DICT, /* waiting for inflateSetDictionary() call */
+ TYPE, /* i: waiting for type bits, including last-flag bit */
+ TYPEDO, /* i: same, but skip check to exit inflate on new block */
+ STORED, /* i: waiting for stored size (length and complement) */
+ COPY, /* i/o: waiting for input or output to copy stored block */
+ TABLE, /* i: waiting for dynamic block table lengths */
+ LENLENS, /* i: waiting for code length code lengths */
+ CODELENS, /* i: waiting for length/lit and distance code lengths */
+ LEN, /* i: waiting for length/lit code */
+ LENEXT, /* i: waiting for length extra bits */
+ DIST, /* i: waiting for distance code */
+ DISTEXT, /* i: waiting for distance extra bits */
+ MATCH, /* o: waiting for output space to copy string */
+ LIT, /* o: waiting for output space to write literal */
+ CHECK, /* i: waiting for 32-bit check value */
+ LENGTH, /* i: waiting for 32-bit length (gzip) */
+ DONE, /* finished check, done -- remain here until reset */
+ BAD, /* got a data error -- remain here until reset */
+ MEM, /* got an inflate() memory error -- remain here until reset */
+ SYNC /* looking for synchronization bytes to restart inflate() */
+} inflate_mode;
+
+/*
+ State transitions between above modes -
+
+ (most modes can go to the BAD or MEM mode -- not shown for clarity)
+
+ Process header:
+ HEAD -> (gzip) or (zlib)
+ (gzip) -> FLAGS -> TIME -> OS -> EXLEN -> EXTRA -> NAME
+ NAME -> COMMENT -> HCRC -> TYPE
+ (zlib) -> DICTID or TYPE
+ DICTID -> DICT -> TYPE
+ Read deflate blocks:
+ TYPE -> STORED or TABLE or LEN or CHECK
+ STORED -> COPY -> TYPE
+ TABLE -> LENLENS -> CODELENS -> LEN
+ Read deflate codes:
+ LEN -> LENEXT or LIT or TYPE
+ LENEXT -> DIST -> DISTEXT -> MATCH -> LEN
+ LIT -> LEN
+ Process trailer:
+ CHECK -> LENGTH -> DONE
+ */
+
+/* state maintained between inflate() calls. Approximately 7K bytes. */
+struct inflate_state {
+ inflate_mode mode; /* current inflate mode */
+ int last; /* true if processing last block */
+ int wrap; /* bit 0 true for zlib, bit 1 true for gzip */
+ int havedict; /* true if dictionary provided */
+ int flags; /* gzip header method and flags (0 if zlib) */
+ unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */
+ unsigned long check; /* protected copy of check value */
+ unsigned long total; /* protected copy of output count */
+ gz_headerp head; /* where to save gzip header information */
+ /* sliding window */
+ unsigned wbits; /* log base 2 of requested window size */
+ unsigned wsize; /* window size or zero if not using window */
+ unsigned whave; /* valid bytes in the window */
+ unsigned write; /* window write index */
+ unsigned char FAR *window; /* allocated sliding window, if needed */
+ /* bit accumulator */
+ unsigned long hold; /* input bit accumulator */
+ unsigned bits; /* number of bits in "in" */
+ /* for string and stored block copying */
+ unsigned length; /* literal or length of data to copy */
+ unsigned offset; /* distance back to copy string from */
+ /* for table and code decoding */
+ unsigned extra; /* extra bits needed */
+ /* fixed and dynamic code tables */
+ code const FAR *lencode; /* starting table for length/literal codes */
+ code const FAR *distcode; /* starting table for distance codes */
+ unsigned lenbits; /* index bits for lencode */
+ unsigned distbits; /* index bits for distcode */
+ /* dynamic table building */
+ unsigned ncode; /* number of code length code lengths */
+ unsigned nlen; /* number of length code lengths */
+ unsigned ndist; /* number of distance code lengths */
+ unsigned have; /* number of code lengths in lens[] */
+ code FAR *next; /* next available space in codes[] */
+ unsigned short lens[320]; /* temporary storage for code lengths */
+ unsigned short work[288]; /* work area for code table building */
+ code codes[ENOUGH]; /* space for code tables */
+};
-/* inftrees.c -- generate Huffman trees for efficient decoding\r
- * Copyright (C) 1995-2005 Mark Adler\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-#include "zutil.h"\r
-#include "inftrees.h"\r
-\r
-#define MAXBITS 15\r
-\r
-const char inflate_copyright[] =\r
- " inflate 1.2.3 Copyright 1995-2005 Mark Adler ";\r
-/*\r
- If you use the zlib library in a product, an acknowledgment is welcome\r
- in the documentation of your product. If for some reason you cannot\r
- include such an acknowledgment, I would appreciate that you keep this\r
- copyright string in the executable of your product.\r
- */\r
-\r
-/*\r
- Build a set of tables to decode the provided canonical Huffman code.\r
- The code lengths are lens[0..codes-1]. The result starts at *table,\r
- whose indices are 0..2^bits-1. work is a writable array of at least\r
- lens shorts, which is used as a work area. type is the type of code\r
- to be generated, CODES, LENS, or DISTS. On return, zero is success,\r
- -1 is an invalid code, and +1 means that ENOUGH isn't enough. table\r
- on return points to the next available entry's address. bits is the\r
- requested root table index bits, and on return it is the actual root\r
- table index bits. It will differ if the request is greater than the\r
- longest code or if it is less than the shortest code.\r
- */\r
-int inflate_table(type, lens, codes, table, bits, work)\r
-codetype type;\r
-unsigned short FAR *lens;\r
-unsigned codes;\r
-code FAR * FAR *table;\r
-unsigned FAR *bits;\r
-unsigned short FAR *work;\r
-{\r
- unsigned len; /* a code's length in bits */\r
- unsigned sym; /* index of code symbols */\r
- unsigned min, max; /* minimum and maximum code lengths */\r
- unsigned root; /* number of index bits for root table */\r
- unsigned curr; /* number of index bits for current table */\r
- unsigned drop; /* code bits to drop for sub-table */\r
- int left; /* number of prefix codes available */\r
- unsigned used; /* code entries in table used */\r
- unsigned huff; /* Huffman code */\r
- unsigned incr; /* for incrementing code, index */\r
- unsigned fill; /* index for replicating entries */\r
- unsigned low; /* low bits for current root entry */\r
- unsigned mask; /* mask for low root bits */\r
- code this; /* table entry for duplication */\r
- code FAR *next; /* next available space in table */\r
- const unsigned short FAR *base; /* base value table to use */\r
- const unsigned short FAR *extra; /* extra bits table to use */\r
- int end; /* use base and extra for symbol > end */\r
- unsigned short count[MAXBITS+1]; /* number of codes of each length */\r
- unsigned short offs[MAXBITS+1]; /* offsets in table for each length */\r
- static const unsigned short lbase[31] = { /* Length codes 257..285 base */\r
- 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\r
- 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};\r
- static const unsigned short lext[31] = { /* Length codes 257..285 extra */\r
- 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\r
- 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 201, 196};\r
- static const unsigned short dbase[32] = { /* Distance codes 0..29 base */\r
- 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\r
- 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\r
- 8193, 12289, 16385, 24577, 0, 0};\r
- static const unsigned short dext[32] = { /* Distance codes 0..29 extra */\r
- 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\r
- 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\r
- 28, 28, 29, 29, 64, 64};\r
-\r
- /*\r
- Process a set of code lengths to create a canonical Huffman code. The\r
- code lengths are lens[0..codes-1]. Each length corresponds to the\r
- symbols 0..codes-1. The Huffman code is generated by first sorting the\r
- symbols by length from short to long, and retaining the symbol order\r
- for codes with equal lengths. Then the code starts with all zero bits\r
- for the first code of the shortest length, and the codes are integer\r
- increments for the same length, and zeros are appended as the length\r
- increases. For the deflate format, these bits are stored backwards\r
- from their more natural integer increment ordering, and so when the\r
- decoding tables are built in the large loop below, the integer codes\r
- are incremented backwards.\r
-\r
- This routine assumes, but does not check, that all of the entries in\r
- lens[] are in the range 0..MAXBITS. The caller must assure this.\r
- 1..MAXBITS is interpreted as that code length. zero means that that\r
- symbol does not occur in this code.\r
-\r
- The codes are sorted by computing a count of codes for each length,\r
- creating from that a table of starting indices for each length in the\r
- sorted table, and then entering the symbols in order in the sorted\r
- table. The sorted table is work[], with that space being provided by\r
- the caller.\r
-\r
- The length counts are used for other purposes as well, i.e. finding\r
- the minimum and maximum length codes, determining if there are any\r
- codes at all, checking for a valid set of lengths, and looking ahead\r
- at length counts to determine sub-table sizes when building the\r
- decoding tables.\r
- */\r
-\r
- /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\r
- for (len = 0; len <= MAXBITS; len++)\r
- count[len] = 0;\r
- for (sym = 0; sym < codes; sym++)\r
- count[lens[sym]]++;\r
-\r
- /* bound code lengths, force root to be within code lengths */\r
- root = *bits;\r
- for (max = MAXBITS; max >= 1; max--)\r
- if (count[max] != 0) break;\r
- if (root > max) root = max;\r
- if (max == 0) { /* no symbols to code at all */\r
- this.op = (unsigned char)64; /* invalid code marker */\r
- this.bits = (unsigned char)1;\r
- this.val = (unsigned short)0;\r
- *(*table)++ = this; /* make a table to force an error */\r
- *(*table)++ = this;\r
- *bits = 1;\r
- return 0; /* no symbols, but wait for decoding to report error */\r
- }\r
- for (min = 1; min <= MAXBITS; min++)\r
- if (count[min] != 0) break;\r
- if (root < min) root = min;\r
-\r
- /* check for an over-subscribed or incomplete set of lengths */\r
- left = 1;\r
- for (len = 1; len <= MAXBITS; len++) {\r
- left <<= 1;\r
- left -= count[len];\r
- if (left < 0) return -1; /* over-subscribed */\r
- }\r
- if (left > 0 && (type == CODES || max != 1))\r
- return -1; /* incomplete set */\r
-\r
- /* generate offsets into symbol table for each length for sorting */\r
- offs[1] = 0;\r
- for (len = 1; len < MAXBITS; len++)\r
- offs[len + 1] = offs[len] + count[len];\r
-\r
- /* sort symbols by length, by symbol order within each length */\r
- for (sym = 0; sym < codes; sym++)\r
- if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym;\r
-\r
- /*\r
- Create and fill in decoding tables. In this loop, the table being\r
- filled is at next and has curr index bits. The code being used is huff\r
- with length len. That code is converted to an index by dropping drop\r
- bits off of the bottom. For codes where len is less than drop + curr,\r
- those top drop + curr - len bits are incremented through all values to\r
- fill the table with replicated entries.\r
-\r
- root is the number of index bits for the root table. When len exceeds\r
- root, sub-tables are created pointed to by the root entry with an index\r
- of the low root bits of huff. This is saved in low to check for when a\r
- new sub-table should be started. drop is zero when the root table is\r
- being filled, and drop is root when sub-tables are being filled.\r
-\r
- When a new sub-table is needed, it is necessary to look ahead in the\r
- code lengths to determine what size sub-table is needed. The length\r
- counts are used for this, and so count[] is decremented as codes are\r
- entered in the tables.\r
-\r
- used keeps track of how many table entries have been allocated from the\r
- provided *table space. It is checked when a LENS table is being made\r
- against the space in *table, ENOUGH, minus the maximum space needed by\r
- the worst case distance code, MAXD. This should never happen, but the\r
- sufficiency of ENOUGH has not been proven exhaustively, hence the check.\r
- This assumes that when type == LENS, bits == 9.\r
-\r
- sym increments through all symbols, and the loop terminates when\r
- all codes of length max, i.e. all codes, have been processed. This\r
- routine permits incomplete codes, so another loop after this one fills\r
- in the rest of the decoding tables with invalid code markers.\r
- */\r
-\r
- /* set up for code type */\r
- switch (type) {\r
- case CODES:\r
- base = extra = work; /* dummy value--not used */\r
- end = 19;\r
- break;\r
- case LENS:\r
- base = lbase;\r
- base -= 257;\r
- extra = lext;\r
- extra -= 257;\r
- end = 256;\r
- break;\r
- default: /* DISTS */\r
- base = dbase;\r
- extra = dext;\r
- end = -1;\r
- }\r
-\r
- /* initialize state for loop */\r
- huff = 0; /* starting code */\r
- sym = 0; /* starting code symbol */\r
- len = min; /* starting code length */\r
- next = *table; /* current table to fill in */\r
- curr = root; /* current table index bits */\r
- drop = 0; /* current bits to drop from code for index */\r
- low = (unsigned)(-1); /* trigger new sub-table when len > root */\r
- used = 1U << root; /* use root table entries */\r
- mask = used - 1; /* mask for comparing low */\r
-\r
- /* check available table space */\r
- if (type == LENS && used >= ENOUGH - MAXD)\r
- return 1;\r
-\r
- /* process all codes and make table entries */\r
- for (;;) {\r
- /* create table entry */\r
- this.bits = (unsigned char)(len - drop);\r
- if ((int)(work[sym]) < end) {\r
- this.op = (unsigned char)0;\r
- this.val = work[sym];\r
- }\r
- else if ((int)(work[sym]) > end) {\r
- this.op = (unsigned char)(extra[work[sym]]);\r
- this.val = base[work[sym]];\r
- }\r
- else {\r
- this.op = (unsigned char)(32 + 64); /* end of block */\r
- this.val = 0;\r
- }\r
-\r
- /* replicate for those indices with low len bits equal to huff */\r
- incr = 1U << (len - drop);\r
- fill = 1U << curr;\r
- min = fill; /* save offset to next table */\r
- do {\r
- fill -= incr;\r
- next[(huff >> drop) + fill] = this;\r
- } while (fill != 0);\r
-\r
- /* backwards increment the len-bit code huff */\r
- incr = 1U << (len - 1);\r
- while (huff & incr)\r
- incr >>= 1;\r
- if (incr != 0) {\r
- huff &= incr - 1;\r
- huff += incr;\r
- }\r
- else\r
- huff = 0;\r
-\r
- /* go to next symbol, update count, len */\r
- sym++;\r
- if (--(count[len]) == 0) {\r
- if (len == max) break;\r
- len = lens[work[sym]];\r
- }\r
-\r
- /* create new sub-table if needed */\r
- if (len > root && (huff & mask) != low) {\r
- /* if first time, transition to sub-tables */\r
- if (drop == 0)\r
- drop = root;\r
-\r
- /* increment past last table */\r
- next += min; /* here min is 1 << curr */\r
-\r
- /* determine length of next table */\r
- curr = len - drop;\r
- left = (int)(1 << curr);\r
- while (curr + drop < max) {\r
- left -= count[curr + drop];\r
- if (left <= 0) break;\r
- curr++;\r
- left <<= 1;\r
- }\r
-\r
- /* check for enough space */\r
- used += 1U << curr;\r
- if (type == LENS && used >= ENOUGH - MAXD)\r
- return 1;\r
-\r
- /* point entry in root table to sub-table */\r
- low = huff & mask;\r
- (*table)[low].op = (unsigned char)curr;\r
- (*table)[low].bits = (unsigned char)root;\r
- (*table)[low].val = (unsigned short)(next - *table);\r
- }\r
- }\r
-\r
- /*\r
- Fill in rest of table for incomplete codes. This loop is similar to the\r
- loop above in incrementing huff for table indices. It is assumed that\r
- len is equal to curr + drop, so there is no loop needed to increment\r
- through high index bits. When the current sub-table is filled, the loop\r
- drops back to the root table to fill in any remaining entries there.\r
- */\r
- this.op = (unsigned char)64; /* invalid code marker */\r
- this.bits = (unsigned char)(len - drop);\r
- this.val = (unsigned short)0;\r
- while (huff != 0) {\r
- /* when done with sub-table, drop back to root table */\r
- if (drop != 0 && (huff & mask) != low) {\r
- drop = 0;\r
- len = root;\r
- next = *table;\r
- this.bits = (unsigned char)len;\r
- }\r
-\r
- /* put invalid code marker in table */\r
- next[huff >> drop] = this;\r
-\r
- /* backwards increment the len-bit code huff */\r
- incr = 1U << (len - 1);\r
- while (huff & incr)\r
- incr >>= 1;\r
- if (incr != 0) {\r
- huff &= incr - 1;\r
- huff += incr;\r
- }\r
- else\r
- huff = 0;\r
- }\r
-\r
- /* set return parameters */\r
- *table += used;\r
- *bits = root;\r
- return 0;\r
-}\r
+/* inftrees.c -- generate Huffman trees for efficient decoding
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+
+#define MAXBITS 15
+
+const char inflate_copyright[] =
+ " inflate 1.2.3 Copyright 1995-2005 Mark Adler ";
+/*
+ If you use the zlib library in a product, an acknowledgment is welcome
+ in the documentation of your product. If for some reason you cannot
+ include such an acknowledgment, I would appreciate that you keep this
+ copyright string in the executable of your product.
+ */
+
+/*
+ Build a set of tables to decode the provided canonical Huffman code.
+ The code lengths are lens[0..codes-1]. The result starts at *table,
+ whose indices are 0..2^bits-1. work is a writable array of at least
+ lens shorts, which is used as a work area. type is the type of code
+ to be generated, CODES, LENS, or DISTS. On return, zero is success,
+ -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
+ on return points to the next available entry's address. bits is the
+ requested root table index bits, and on return it is the actual root
+ table index bits. It will differ if the request is greater than the
+ longest code or if it is less than the shortest code.
+ */
+int inflate_table(type, lens, codes, table, bits, work)
+codetype type;
+unsigned short FAR *lens;
+unsigned codes;
+code FAR * FAR *table;
+unsigned FAR *bits;
+unsigned short FAR *work;
+{
+ unsigned len; /* a code's length in bits */
+ unsigned sym; /* index of code symbols */
+ unsigned min, max; /* minimum and maximum code lengths */
+ unsigned root; /* number of index bits for root table */
+ unsigned curr; /* number of index bits for current table */
+ unsigned drop; /* code bits to drop for sub-table */
+ int left; /* number of prefix codes available */
+ unsigned used; /* code entries in table used */
+ unsigned huff; /* Huffman code */
+ unsigned incr; /* for incrementing code, index */
+ unsigned fill; /* index for replicating entries */
+ unsigned low; /* low bits for current root entry */
+ unsigned mask; /* mask for low root bits */
+ code this; /* table entry for duplication */
+ code FAR *next; /* next available space in table */
+ const unsigned short FAR *base; /* base value table to use */
+ const unsigned short FAR *extra; /* extra bits table to use */
+ int end; /* use base and extra for symbol > end */
+ unsigned short count[MAXBITS+1]; /* number of codes of each length */
+ unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
+ static const unsigned short lbase[31] = { /* Length codes 257..285 base */
+ 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
+ 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
+ static const unsigned short lext[31] = { /* Length codes 257..285 extra */
+ 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
+ 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 201, 196};
+ static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
+ 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
+ 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
+ 8193, 12289, 16385, 24577, 0, 0};
+ static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
+ 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
+ 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
+ 28, 28, 29, 29, 64, 64};
+
+ /*
+ Process a set of code lengths to create a canonical Huffman code. The
+ code lengths are lens[0..codes-1]. Each length corresponds to the
+ symbols 0..codes-1. The Huffman code is generated by first sorting the
+ symbols by length from short to long, and retaining the symbol order
+ for codes with equal lengths. Then the code starts with all zero bits
+ for the first code of the shortest length, and the codes are integer
+ increments for the same length, and zeros are appended as the length
+ increases. For the deflate format, these bits are stored backwards
+ from their more natural integer increment ordering, and so when the
+ decoding tables are built in the large loop below, the integer codes
+ are incremented backwards.
+
+ This routine assumes, but does not check, that all of the entries in
+ lens[] are in the range 0..MAXBITS. The caller must assure this.
+ 1..MAXBITS is interpreted as that code length. zero means that that
+ symbol does not occur in this code.
+
+ The codes are sorted by computing a count of codes for each length,
+ creating from that a table of starting indices for each length in the
+ sorted table, and then entering the symbols in order in the sorted
+ table. The sorted table is work[], with that space being provided by
+ the caller.
+
+ The length counts are used for other purposes as well, i.e. finding
+ the minimum and maximum length codes, determining if there are any
+ codes at all, checking for a valid set of lengths, and looking ahead
+ at length counts to determine sub-table sizes when building the
+ decoding tables.
+ */
+
+ /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
+ for (len = 0; len <= MAXBITS; len++)
+ count[len] = 0;
+ for (sym = 0; sym < codes; sym++)
+ count[lens[sym]]++;
+
+ /* bound code lengths, force root to be within code lengths */
+ root = *bits;
+ for (max = MAXBITS; max >= 1; max--)
+ if (count[max] != 0) break;
+ if (root > max) root = max;
+ if (max == 0) { /* no symbols to code at all */
+ this.op = (unsigned char)64; /* invalid code marker */
+ this.bits = (unsigned char)1;
+ this.val = (unsigned short)0;
+ *(*table)++ = this; /* make a table to force an error */
+ *(*table)++ = this;
+ *bits = 1;
+ return 0; /* no symbols, but wait for decoding to report error */
+ }
+ for (min = 1; min <= MAXBITS; min++)
+ if (count[min] != 0) break;
+ if (root < min) root = min;
+
+ /* check for an over-subscribed or incomplete set of lengths */
+ left = 1;
+ for (len = 1; len <= MAXBITS; len++) {
+ left <<= 1;
+ left -= count[len];
+ if (left < 0) return -1; /* over-subscribed */
+ }
+ if (left > 0 && (type == CODES || max != 1))
+ return -1; /* incomplete set */
+
+ /* generate offsets into symbol table for each length for sorting */
+ offs[1] = 0;
+ for (len = 1; len < MAXBITS; len++)
+ offs[len + 1] = offs[len] + count[len];
+
+ /* sort symbols by length, by symbol order within each length */
+ for (sym = 0; sym < codes; sym++)
+ if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym;
+
+ /*
+ Create and fill in decoding tables. In this loop, the table being
+ filled is at next and has curr index bits. The code being used is huff
+ with length len. That code is converted to an index by dropping drop
+ bits off of the bottom. For codes where len is less than drop + curr,
+ those top drop + curr - len bits are incremented through all values to
+ fill the table with replicated entries.
+
+ root is the number of index bits for the root table. When len exceeds
+ root, sub-tables are created pointed to by the root entry with an index
+ of the low root bits of huff. This is saved in low to check for when a
+ new sub-table should be started. drop is zero when the root table is
+ being filled, and drop is root when sub-tables are being filled.
+
+ When a new sub-table is needed, it is necessary to look ahead in the
+ code lengths to determine what size sub-table is needed. The length
+ counts are used for this, and so count[] is decremented as codes are
+ entered in the tables.
+
+ used keeps track of how many table entries have been allocated from the
+ provided *table space. It is checked when a LENS table is being made
+ against the space in *table, ENOUGH, minus the maximum space needed by
+ the worst case distance code, MAXD. This should never happen, but the
+ sufficiency of ENOUGH has not been proven exhaustively, hence the check.
+ This assumes that when type == LENS, bits == 9.
+
+ sym increments through all symbols, and the loop terminates when
+ all codes of length max, i.e. all codes, have been processed. This
+ routine permits incomplete codes, so another loop after this one fills
+ in the rest of the decoding tables with invalid code markers.
+ */
+
+ /* set up for code type */
+ switch (type) {
+ case CODES:
+ base = extra = work; /* dummy value--not used */
+ end = 19;
+ break;
+ case LENS:
+ base = lbase;
+ base -= 257;
+ extra = lext;
+ extra -= 257;
+ end = 256;
+ break;
+ default: /* DISTS */
+ base = dbase;
+ extra = dext;
+ end = -1;
+ }
+
+ /* initialize state for loop */
+ huff = 0; /* starting code */
+ sym = 0; /* starting code symbol */
+ len = min; /* starting code length */
+ next = *table; /* current table to fill in */
+ curr = root; /* current table index bits */
+ drop = 0; /* current bits to drop from code for index */
+ low = (unsigned)(-1); /* trigger new sub-table when len > root */
+ used = 1U << root; /* use root table entries */
+ mask = used - 1; /* mask for comparing low */
+
+ /* check available table space */
+ if (type == LENS && used >= ENOUGH - MAXD)
+ return 1;
+
+ /* process all codes and make table entries */
+ for (;;) {
+ /* create table entry */
+ this.bits = (unsigned char)(len - drop);
+ if ((int)(work[sym]) < end) {
+ this.op = (unsigned char)0;
+ this.val = work[sym];
+ }
+ else if ((int)(work[sym]) > end) {
+ this.op = (unsigned char)(extra[work[sym]]);
+ this.val = base[work[sym]];
+ }
+ else {
+ this.op = (unsigned char)(32 + 64); /* end of block */
+ this.val = 0;
+ }
+
+ /* replicate for those indices with low len bits equal to huff */
+ incr = 1U << (len - drop);
+ fill = 1U << curr;
+ min = fill; /* save offset to next table */
+ do {
+ fill -= incr;
+ next[(huff >> drop) + fill] = this;
+ } while (fill != 0);
+
+ /* backwards increment the len-bit code huff */
+ incr = 1U << (len - 1);
+ while (huff & incr)
+ incr >>= 1;
+ if (incr != 0) {
+ huff &= incr - 1;
+ huff += incr;
+ }
+ else
+ huff = 0;
+
+ /* go to next symbol, update count, len */
+ sym++;
+ if (--(count[len]) == 0) {
+ if (len == max) break;
+ len = lens[work[sym]];
+ }
+
+ /* create new sub-table if needed */
+ if (len > root && (huff & mask) != low) {
+ /* if first time, transition to sub-tables */
+ if (drop == 0)
+ drop = root;
+
+ /* increment past last table */
+ next += min; /* here min is 1 << curr */
+
+ /* determine length of next table */
+ curr = len - drop;
+ left = (int)(1 << curr);
+ while (curr + drop < max) {
+ left -= count[curr + drop];
+ if (left <= 0) break;
+ curr++;
+ left <<= 1;
+ }
+
+ /* check for enough space */
+ used += 1U << curr;
+ if (type == LENS && used >= ENOUGH - MAXD)
+ return 1;
+
+ /* point entry in root table to sub-table */
+ low = huff & mask;
+ (*table)[low].op = (unsigned char)curr;
+ (*table)[low].bits = (unsigned char)root;
+ (*table)[low].val = (unsigned short)(next - *table);
+ }
+ }
+
+ /*
+ Fill in rest of table for incomplete codes. This loop is similar to the
+ loop above in incrementing huff for table indices. It is assumed that
+ len is equal to curr + drop, so there is no loop needed to increment
+ through high index bits. When the current sub-table is filled, the loop
+ drops back to the root table to fill in any remaining entries there.
+ */
+ this.op = (unsigned char)64; /* invalid code marker */
+ this.bits = (unsigned char)(len - drop);
+ this.val = (unsigned short)0;
+ while (huff != 0) {
+ /* when done with sub-table, drop back to root table */
+ if (drop != 0 && (huff & mask) != low) {
+ drop = 0;
+ len = root;
+ next = *table;
+ this.bits = (unsigned char)len;
+ }
+
+ /* put invalid code marker in table */
+ next[huff >> drop] = this;
+
+ /* backwards increment the len-bit code huff */
+ incr = 1U << (len - 1);
+ while (huff & incr)
+ incr >>= 1;
+ if (incr != 0) {
+ huff &= incr - 1;
+ huff += incr;
+ }
+ else
+ huff = 0;
+ }
+
+ /* set return parameters */
+ *table += used;
+ *bits = root;
+ return 0;
+}
-/* inftrees.h -- header to use inftrees.c\r
- * Copyright (C) 1995-2005 Mark Adler\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/* WARNING: this file should *not* be used by applications. It is\r
- part of the implementation of the compression library and is\r
- subject to change. Applications should only use zlib.h.\r
- */\r
-\r
-/* Structure for decoding tables. Each entry provides either the\r
- information needed to do the operation requested by the code that\r
- indexed that table entry, or it provides a pointer to another\r
- table that indexes more bits of the code. op indicates whether\r
- the entry is a pointer to another table, a literal, a length or\r
- distance, an end-of-block, or an invalid code. For a table\r
- pointer, the low four bits of op is the number of index bits of\r
- that table. For a length or distance, the low four bits of op\r
- is the number of extra bits to get after the code. bits is\r
- the number of bits in this code or part of the code to drop off\r
- of the bit buffer. val is the actual byte to output in the case\r
- of a literal, the base length or distance, or the offset from\r
- the current table to the next table. Each entry is four bytes. */\r
-typedef struct {\r
- unsigned char op; /* operation, extra bits, table bits */\r
- unsigned char bits; /* bits in this part of the code */\r
- unsigned short val; /* offset in table or code value */\r
-} code;\r
-\r
-/* op values as set by inflate_table():\r
- 00000000 - literal\r
- 0000tttt - table link, tttt != 0 is the number of table index bits\r
- 0001eeee - length or distance, eeee is the number of extra bits\r
- 01100000 - end of block\r
- 01000000 - invalid code\r
- */\r
-\r
-/* Maximum size of dynamic tree. The maximum found in a long but non-\r
- exhaustive search was 1444 code structures (852 for length/literals\r
- and 592 for distances, the latter actually the result of an\r
- exhaustive search). The true maximum is not known, but the value\r
- below is more than safe. */\r
-#define ENOUGH 2048\r
-#define MAXD 592\r
-\r
-/* Type of code to build for inftable() */\r
-typedef enum {\r
- CODES,\r
- LENS,\r
- DISTS\r
-} codetype;\r
-\r
-extern int inflate_table OF((codetype type, unsigned short FAR *lens,\r
- unsigned codes, code FAR * FAR *table,\r
- unsigned FAR *bits, unsigned short FAR *work));\r
+/* inftrees.h -- header to use inftrees.c
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+ part of the implementation of the compression library and is
+ subject to change. Applications should only use zlib.h.
+ */
+
+/* Structure for decoding tables. Each entry provides either the
+ information needed to do the operation requested by the code that
+ indexed that table entry, or it provides a pointer to another
+ table that indexes more bits of the code. op indicates whether
+ the entry is a pointer to another table, a literal, a length or
+ distance, an end-of-block, or an invalid code. For a table
+ pointer, the low four bits of op is the number of index bits of
+ that table. For a length or distance, the low four bits of op
+ is the number of extra bits to get after the code. bits is
+ the number of bits in this code or part of the code to drop off
+ of the bit buffer. val is the actual byte to output in the case
+ of a literal, the base length or distance, or the offset from
+ the current table to the next table. Each entry is four bytes. */
+typedef struct {
+ unsigned char op; /* operation, extra bits, table bits */
+ unsigned char bits; /* bits in this part of the code */
+ unsigned short val; /* offset in table or code value */
+} code;
+
+/* op values as set by inflate_table():
+ 00000000 - literal
+ 0000tttt - table link, tttt != 0 is the number of table index bits
+ 0001eeee - length or distance, eeee is the number of extra bits
+ 01100000 - end of block
+ 01000000 - invalid code
+ */
+
+/* Maximum size of dynamic tree. The maximum found in a long but non-
+ exhaustive search was 1444 code structures (852 for length/literals
+ and 592 for distances, the latter actually the result of an
+ exhaustive search). The true maximum is not known, but the value
+ below is more than safe. */
+#define ENOUGH 2048
+#define MAXD 592
+
+/* Type of code to build for inftable() */
+typedef enum {
+ CODES,
+ LENS,
+ DISTS
+} codetype;
+
+extern int inflate_table OF((codetype type, unsigned short FAR *lens,
+ unsigned codes, code FAR * FAR *table,
+ unsigned FAR *bits, unsigned short FAR *work));
-/* trees.c -- output deflated data using Huffman coding\r
- * Copyright (C) 1995-2005 Jean-loup Gailly\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/*\r
- * ALGORITHM\r
- *\r
- * The "deflation" process uses several Huffman trees. The more\r
- * common source values are represented by shorter bit sequences.\r
- *\r
- * Each code tree is stored in a compressed form which is itself\r
- * a Huffman encoding of the lengths of all the code strings (in\r
- * ascending order by source values). The actual code strings are\r
- * reconstructed from the lengths in the inflate process, as described\r
- * in the deflate specification.\r
- *\r
- * REFERENCES\r
- *\r
- * Deutsch, L.P.,"'Deflate' Compressed Data Format Specification".\r
- * Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc\r
- *\r
- * Storer, James A.\r
- * Data Compression: Methods and Theory, pp. 49-50.\r
- * Computer Science Press, 1988. ISBN 0-7167-8156-5.\r
- *\r
- * Sedgewick, R.\r
- * Algorithms, p290.\r
- * Addison-Wesley, 1983. ISBN 0-201-06672-6.\r
- */\r
-\r
-/* @(#) $Id$ */\r
-\r
-/* #define GEN_TREES_H */\r
-\r
-#include "deflate.h"\r
-\r
-#ifdef DEBUG\r
-# include <ctype.h>\r
-#endif\r
-\r
-/* ===========================================================================\r
- * Constants\r
- */\r
-\r
-#define MAX_BL_BITS 7\r
-/* Bit length codes must not exceed MAX_BL_BITS bits */\r
-\r
-#define END_BLOCK 256\r
-/* end of block literal code */\r
-\r
-#define REP_3_6 16\r
-/* repeat previous bit length 3-6 times (2 bits of repeat count) */\r
-\r
-#define REPZ_3_10 17\r
-/* repeat a zero length 3-10 times (3 bits of repeat count) */\r
-\r
-#define REPZ_11_138 18\r
-/* repeat a zero length 11-138 times (7 bits of repeat count) */\r
-\r
-local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */\r
- = {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};\r
-\r
-local const int extra_dbits[D_CODES] /* extra bits for each distance code */\r
- = {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};\r
-\r
-local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */\r
- = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7};\r
-\r
-local const uch bl_order[BL_CODES]\r
- = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15};\r
-/* The lengths of the bit length codes are sent in order of decreasing\r
- * probability, to avoid transmitting the lengths for unused bit length codes.\r
- */\r
-\r
-#define Buf_size (8 * 2*sizeof(char))\r
-/* Number of bits used within bi_buf. (bi_buf might be implemented on\r
- * more than 16 bits on some systems.)\r
- */\r
-\r
-/* ===========================================================================\r
- * Local data. These are initialized only once.\r
- */\r
-\r
-#define DIST_CODE_LEN 512 /* see definition of array dist_code below */\r
-\r
-#if defined(GEN_TREES_H) || !defined(STDC)\r
-/* non ANSI compilers may not accept trees.h */\r
-\r
-local ct_data static_ltree[L_CODES+2];\r
-/* The static literal tree. Since the bit lengths are imposed, there is no\r
- * need for the L_CODES extra codes used during heap construction. However\r
- * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\r
- * below).\r
- */\r
-\r
-local ct_data static_dtree[D_CODES];\r
-/* The static distance tree. (Actually a trivial tree since all codes use\r
- * 5 bits.)\r
- */\r
-\r
-uch _dist_code[DIST_CODE_LEN];\r
-/* Distance codes. The first 256 values correspond to the distances\r
- * 3 .. 258, the last 256 values correspond to the top 8 bits of\r
- * the 15 bit distances.\r
- */\r
-\r
-uch _length_code[MAX_MATCH-MIN_MATCH+1];\r
-/* length code for each normalized match length (0 == MIN_MATCH) */\r
-\r
-local int base_length[LENGTH_CODES];\r
-/* First normalized length for each code (0 = MIN_MATCH) */\r
-\r
-local int base_dist[D_CODES];\r
-/* First normalized distance for each code (0 = distance of 1) */\r
-\r
-#else\r
-# include "trees.h"\r
-#endif /* GEN_TREES_H */\r
-\r
-struct static_tree_desc_s {\r
- const ct_data *static_tree; /* static tree or NULL */\r
- const intf *extra_bits; /* extra bits for each code or NULL */\r
- int extra_base; /* base index for extra_bits */\r
- int elems; /* max number of elements in the tree */\r
- int max_length; /* max bit length for the codes */\r
-};\r
-\r
-local static_tree_desc static_l_desc =\r
-{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};\r
-\r
-local static_tree_desc static_d_desc =\r
-{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};\r
-\r
-local static_tree_desc static_bl_desc =\r
-{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};\r
-\r
-/* ===========================================================================\r
- * Local (static) routines in this file.\r
- */\r
-\r
-local void tr_static_init OF((void));\r
-local void init_block OF((deflate_state *s));\r
-local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));\r
-local void gen_bitlen OF((deflate_state *s, tree_desc *desc));\r
-local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));\r
-local void build_tree OF((deflate_state *s, tree_desc *desc));\r
-local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));\r
-local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));\r
-local int build_bl_tree OF((deflate_state *s));\r
-local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,\r
- int blcodes));\r
-local void compress_block OF((deflate_state *s, ct_data *ltree,\r
- ct_data *dtree));\r
-local void set_data_type OF((deflate_state *s));\r
-local unsigned bi_reverse OF((unsigned value, int length));\r
-local void bi_windup OF((deflate_state *s));\r
-local void bi_flush OF((deflate_state *s));\r
-local void copy_block OF((deflate_state *s, charf *buf, unsigned len,\r
- int header));\r
-\r
-#ifdef GEN_TREES_H\r
-local void gen_trees_header OF((void));\r
-#endif\r
-\r
-#ifndef DEBUG\r
-# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)\r
- /* Send a code of the given tree. c and tree must not have side effects */\r
-\r
-#else /* DEBUG */\r
-# define send_code(s, c, tree) \\r
- { if (z_verbose>2) fprintf(stderr,"\ncd %3d ",(c)); \\r
- send_bits(s, tree[c].Code, tree[c].Len); }\r
-#endif\r
-\r
-/* ===========================================================================\r
- * Output a short LSB first on the stream.\r
- * IN assertion: there is enough room in pendingBuf.\r
- */\r
-#define put_short(s, w) { \\r
- put_byte(s, (uch)((w) & 0xff)); \\r
- put_byte(s, (uch)((ush)(w) >> 8)); \\r
-}\r
-\r
-/* ===========================================================================\r
- * Send a value on a given number of bits.\r
- * IN assertion: length <= 16 and value fits in length bits.\r
- */\r
-#ifdef DEBUG\r
-local void send_bits OF((deflate_state *s, int value, int length));\r
-\r
-local void send_bits(s, value, length)\r
- deflate_state *s;\r
- int value; /* value to send */\r
- int length; /* number of bits */\r
-{\r
- Tracevv((stderr," l %2d v %4x ", length, value));\r
- Assert(length > 0 && length <= 15, "invalid length");\r
- s->bits_sent += (ulg)length;\r
-\r
- /* If not enough room in bi_buf, use (valid) bits from bi_buf and\r
- * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))\r
- * unused bits in value.\r
- */\r
- if (s->bi_valid > (int)Buf_size - length) {\r
- s->bi_buf |= (value << s->bi_valid);\r
- put_short(s, s->bi_buf);\r
- s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);\r
- s->bi_valid += length - Buf_size;\r
- } else {\r
- s->bi_buf |= value << s->bi_valid;\r
- s->bi_valid += length;\r
- }\r
-}\r
-#else /* !DEBUG */\r
-\r
-#define send_bits(s, value, length) \\r
-{ int len = length;\\r
- if (s->bi_valid > (int)Buf_size - len) {\\r
- int val = value;\\r
- s->bi_buf |= (val << s->bi_valid);\\r
- put_short(s, s->bi_buf);\\r
- s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\\r
- s->bi_valid += len - Buf_size;\\r
- } else {\\r
- s->bi_buf |= (value) << s->bi_valid;\\r
- s->bi_valid += len;\\r
- }\\r
-}\r
-#endif /* DEBUG */\r
-\r
-\r
-/* the arguments must not have side effects */\r
-\r
-/* ===========================================================================\r
- * Initialize the various 'constant' tables.\r
- */\r
-local void tr_static_init()\r
-{\r
-#if defined(GEN_TREES_H) || !defined(STDC)\r
- static int static_init_done = 0;\r
- int n; /* iterates over tree elements */\r
- int bits; /* bit counter */\r
- int length; /* length value */\r
- int code; /* code value */\r
- int dist; /* distance index */\r
- ush bl_count[MAX_BITS+1];\r
- /* number of codes at each bit length for an optimal tree */\r
-\r
- if (static_init_done) return;\r
-\r
- /* For some embedded targets, global variables are not initialized: */\r
- static_l_desc.static_tree = static_ltree;\r
- static_l_desc.extra_bits = extra_lbits;\r
- static_d_desc.static_tree = static_dtree;\r
- static_d_desc.extra_bits = extra_dbits;\r
- static_bl_desc.extra_bits = extra_blbits;\r
-\r
- /* Initialize the mapping length (0..255) -> length code (0..28) */\r
- length = 0;\r
- for (code = 0; code < LENGTH_CODES-1; code++) {\r
- base_length[code] = length;\r
- for (n = 0; n < (1<<extra_lbits[code]); n++) {\r
- _length_code[length++] = (uch)code;\r
- }\r
- }\r
- Assert (length == 256, "tr_static_init: length != 256");\r
- /* Note that the length 255 (match length 258) can be represented\r
- * in two different ways: code 284 + 5 bits or code 285, so we\r
- * overwrite length_code[255] to use the best encoding:\r
- */\r
- _length_code[length-1] = (uch)code;\r
-\r
- /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\r
- dist = 0;\r
- for (code = 0 ; code < 16; code++) {\r
- base_dist[code] = dist;\r
- for (n = 0; n < (1<<extra_dbits[code]); n++) {\r
- _dist_code[dist++] = (uch)code;\r
- }\r
- }\r
- Assert (dist == 256, "tr_static_init: dist != 256");\r
- dist >>= 7; /* from now on, all distances are divided by 128 */\r
- for ( ; code < D_CODES; code++) {\r
- base_dist[code] = dist << 7;\r
- for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {\r
- _dist_code[256 + dist++] = (uch)code;\r
- }\r
- }\r
- Assert (dist == 256, "tr_static_init: 256+dist != 512");\r
-\r
- /* Construct the codes of the static literal tree */\r
- for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;\r
- n = 0;\r
- while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;\r
- while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;\r
- while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;\r
- while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;\r
- /* Codes 286 and 287 do not exist, but we must include them in the\r
- * tree construction to get a canonical Huffman tree (longest code\r
- * all ones)\r
- */\r
- gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);\r
-\r
- /* The static distance tree is trivial: */\r
- for (n = 0; n < D_CODES; n++) {\r
- static_dtree[n].Len = 5;\r
- static_dtree[n].Code = bi_reverse((unsigned)n, 5);\r
- }\r
- static_init_done = 1;\r
-\r
-# ifdef GEN_TREES_H\r
- gen_trees_header();\r
-# endif\r
-#endif /* defined(GEN_TREES_H) || !defined(STDC) */\r
-}\r
-\r
-/* ===========================================================================\r
- * Genererate the file trees.h describing the static trees.\r
- */\r
-#ifdef GEN_TREES_H\r
-# ifndef DEBUG\r
-# include <stdio.h>\r
-# endif\r
-\r
-# define SEPARATOR(i, last, width) \\r
- ((i) == (last)? "\n};\n\n" : \\r
- ((i) % (width) == (width)-1 ? ",\n" : ", "))\r
-\r
-void gen_trees_header()\r
-{\r
- FILE *header = fopen("trees.h", "w");\r
- int i;\r
-\r
- Assert (header != NULL, "Can't open trees.h");\r
- fprintf(header,\r
- "/* header created automatically with -DGEN_TREES_H */\n\n");\r
-\r
- fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");\r
- for (i = 0; i < L_CODES+2; i++) {\r
- fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,\r
- static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));\r
- }\r
-\r
- fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");\r
- for (i = 0; i < D_CODES; i++) {\r
- fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,\r
- static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));\r
- }\r
-\r
- fprintf(header, "const uch _dist_code[DIST_CODE_LEN] = {\n");\r
- for (i = 0; i < DIST_CODE_LEN; i++) {\r
- fprintf(header, "%2u%s", _dist_code[i],\r
- SEPARATOR(i, DIST_CODE_LEN-1, 20));\r
- }\r
-\r
- fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");\r
- for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {\r
- fprintf(header, "%2u%s", _length_code[i],\r
- SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));\r
- }\r
-\r
- fprintf(header, "local const int base_length[LENGTH_CODES] = {\n");\r
- for (i = 0; i < LENGTH_CODES; i++) {\r
- fprintf(header, "%1u%s", base_length[i],\r
- SEPARATOR(i, LENGTH_CODES-1, 20));\r
- }\r
-\r
- fprintf(header, "local const int base_dist[D_CODES] = {\n");\r
- for (i = 0; i < D_CODES; i++) {\r
- fprintf(header, "%5u%s", base_dist[i],\r
- SEPARATOR(i, D_CODES-1, 10));\r
- }\r
-\r
- fclose(header);\r
-}\r
-#endif /* GEN_TREES_H */\r
-\r
-/* ===========================================================================\r
- * Initialize the tree data structures for a new zlib stream.\r
- */\r
-void _tr_init(s)\r
- deflate_state *s;\r
-{\r
- tr_static_init();\r
-\r
- s->l_desc.dyn_tree = s->dyn_ltree;\r
- s->l_desc.stat_desc = &static_l_desc;\r
-\r
- s->d_desc.dyn_tree = s->dyn_dtree;\r
- s->d_desc.stat_desc = &static_d_desc;\r
-\r
- s->bl_desc.dyn_tree = s->bl_tree;\r
- s->bl_desc.stat_desc = &static_bl_desc;\r
-\r
- s->bi_buf = 0;\r
- s->bi_valid = 0;\r
- s->last_eob_len = 8; /* enough lookahead for inflate */\r
-#ifdef DEBUG\r
- s->compressed_len = 0L;\r
- s->bits_sent = 0L;\r
-#endif\r
-\r
- /* Initialize the first block of the first file: */\r
- init_block(s);\r
-}\r
-\r
-/* ===========================================================================\r
- * Initialize a new block.\r
- */\r
-local void init_block(s)\r
- deflate_state *s;\r
-{\r
- int n; /* iterates over tree elements */\r
-\r
- /* Initialize the trees. */\r
- for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;\r
- for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;\r
- for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;\r
-\r
- s->dyn_ltree[END_BLOCK].Freq = 1;\r
- s->opt_len = s->static_len = 0L;\r
- s->last_lit = s->matches = 0;\r
-}\r
-\r
-#define SMALLEST 1\r
-/* Index within the heap array of least frequent node in the Huffman tree */\r
-\r
-\r
-/* ===========================================================================\r
- * Remove the smallest element from the heap and recreate the heap with\r
- * one less element. Updates heap and heap_len.\r
- */\r
-#define pqremove(s, tree, top) \\r
-{\\r
- top = s->heap[SMALLEST]; \\r
- s->heap[SMALLEST] = s->heap[s->heap_len--]; \\r
- pqdownheap(s, tree, SMALLEST); \\r
-}\r
-\r
-/* ===========================================================================\r
- * Compares to subtrees, using the tree depth as tie breaker when\r
- * the subtrees have equal frequency. This minimizes the worst case length.\r
- */\r
-#define smaller(tree, n, m, depth) \\r
- (tree[n].Freq < tree[m].Freq || \\r
- (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))\r
-\r
-/* ===========================================================================\r
- * Restore the heap property by moving down the tree starting at node k,\r
- * exchanging a node with the smallest of its two sons if necessary, stopping\r
- * when the heap property is re-established (each father smaller than its\r
- * two sons).\r
- */\r
-local void pqdownheap(s, tree, k)\r
- deflate_state *s;\r
- ct_data *tree; /* the tree to restore */\r
- int k; /* node to move down */\r
-{\r
- int v = s->heap[k];\r
- int j = k << 1; /* left son of k */\r
- while (j <= s->heap_len) {\r
- /* Set j to the smallest of the two sons: */\r
- if (j < s->heap_len &&\r
- smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {\r
- j++;\r
- }\r
- /* Exit if v is smaller than both sons */\r
- if (smaller(tree, v, s->heap[j], s->depth)) break;\r
-\r
- /* Exchange v with the smallest son */\r
- s->heap[k] = s->heap[j]; k = j;\r
-\r
- /* And continue down the tree, setting j to the left son of k */\r
- j <<= 1;\r
- }\r
- s->heap[k] = v;\r
-}\r
-\r
-/* ===========================================================================\r
- * Compute the optimal bit lengths for a tree and update the total bit length\r
- * for the current block.\r
- * IN assertion: the fields freq and dad are set, heap[heap_max] and\r
- * above are the tree nodes sorted by increasing frequency.\r
- * OUT assertions: the field len is set to the optimal bit length, the\r
- * array bl_count contains the frequencies for each bit length.\r
- * The length opt_len is updated; static_len is also updated if stree is\r
- * not null.\r
- */\r
-local void gen_bitlen(s, desc)\r
- deflate_state *s;\r
- tree_desc *desc; /* the tree descriptor */\r
-{\r
- ct_data *tree = desc->dyn_tree;\r
- int max_code = desc->max_code;\r
- const ct_data *stree = desc->stat_desc->static_tree;\r
- const intf *extra = desc->stat_desc->extra_bits;\r
- int base = desc->stat_desc->extra_base;\r
- int max_length = desc->stat_desc->max_length;\r
- int h; /* heap index */\r
- int n, m; /* iterate over the tree elements */\r
- int bits; /* bit length */\r
- int xbits; /* extra bits */\r
- ush f; /* frequency */\r
- int overflow = 0; /* number of elements with bit length too large */\r
-\r
- for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;\r
-\r
- /* In a first pass, compute the optimal bit lengths (which may\r
- * overflow in the case of the bit length tree).\r
- */\r
- tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */\r
-\r
- for (h = s->heap_max+1; h < HEAP_SIZE; h++) {\r
- n = s->heap[h];\r
- bits = tree[tree[n].Dad].Len + 1;\r
- if (bits > max_length) bits = max_length, overflow++;\r
- tree[n].Len = (ush)bits;\r
- /* We overwrite tree[n].Dad which is no longer needed */\r
-\r
- if (n > max_code) continue; /* not a leaf node */\r
-\r
- s->bl_count[bits]++;\r
- xbits = 0;\r
- if (n >= base) xbits = extra[n-base];\r
- f = tree[n].Freq;\r
- s->opt_len += (ulg)f * (bits + xbits);\r
- if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);\r
- }\r
- if (overflow == 0) return;\r
-\r
- Trace((stderr,"\nbit length overflow\n"));\r
- /* This happens for example on obj2 and pic of the Calgary corpus */\r
-\r
- /* Find the first bit length which could increase: */\r
- do {\r
- bits = max_length-1;\r
- while (s->bl_count[bits] == 0) bits--;\r
- s->bl_count[bits]--; /* move one leaf down the tree */\r
- s->bl_count[bits+1] += 2; /* move one overflow item as its brother */\r
- s->bl_count[max_length]--;\r
- /* The brother of the overflow item also moves one step up,\r
- * but this does not affect bl_count[max_length]\r
- */\r
- overflow -= 2;\r
- } while (overflow > 0);\r
-\r
- /* Now recompute all bit lengths, scanning in increasing frequency.\r
- * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\r
- * lengths instead of fixing only the wrong ones. This idea is taken\r
- * from 'ar' written by Haruhiko Okumura.)\r
- */\r
- for (bits = max_length; bits != 0; bits--) {\r
- n = s->bl_count[bits];\r
- while (n != 0) {\r
- m = s->heap[--h];\r
- if (m > max_code) continue;\r
- if ((unsigned) tree[m].Len != (unsigned) bits) {\r
- Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));\r
- s->opt_len += ((long)bits - (long)tree[m].Len)\r
- *(long)tree[m].Freq;\r
- tree[m].Len = (ush)bits;\r
- }\r
- n--;\r
- }\r
- }\r
-}\r
-\r
-/* ===========================================================================\r
- * Generate the codes for a given tree and bit counts (which need not be\r
- * optimal).\r
- * IN assertion: the array bl_count contains the bit length statistics for\r
- * the given tree and the field len is set for all tree elements.\r
- * OUT assertion: the field code is set for all tree elements of non\r
- * zero code length.\r
- */\r
-local void gen_codes (tree, max_code, bl_count)\r
- ct_data *tree; /* the tree to decorate */\r
- int max_code; /* largest code with non zero frequency */\r
- ushf *bl_count; /* number of codes at each bit length */\r
-{\r
- ush next_code[MAX_BITS+1]; /* next code value for each bit length */\r
- ush code = 0; /* running code value */\r
- int bits; /* bit index */\r
- int n; /* code index */\r
-\r
- /* The distribution counts are first used to generate the code values\r
- * without bit reversal.\r
- */\r
- for (bits = 1; bits <= MAX_BITS; bits++) {\r
- next_code[bits] = code = (code + bl_count[bits-1]) << 1;\r
- }\r
- /* Check that the bit counts in bl_count are consistent. The last code\r
- * must be all ones.\r
- */\r
- Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\r
- "inconsistent bit counts");\r
- Tracev((stderr,"\ngen_codes: max_code %d ", max_code));\r
-\r
- for (n = 0; n <= max_code; n++) {\r
- int len = tree[n].Len;\r
- if (len == 0) continue;\r
- /* Now reverse the bits */\r
- tree[n].Code = bi_reverse(next_code[len]++, len);\r
-\r
- Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",\r
- n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\r
- }\r
-}\r
-\r
-/* ===========================================================================\r
- * Construct one Huffman tree and assigns the code bit strings and lengths.\r
- * Update the total bit length for the current block.\r
- * IN assertion: the field freq is set for all tree elements.\r
- * OUT assertions: the fields len and code are set to the optimal bit length\r
- * and corresponding code. The length opt_len is updated; static_len is\r
- * also updated if stree is not null. The field max_code is set.\r
- */\r
-local void build_tree(s, desc)\r
- deflate_state *s;\r
- tree_desc *desc; /* the tree descriptor */\r
-{\r
- ct_data *tree = desc->dyn_tree;\r
- const ct_data *stree = desc->stat_desc->static_tree;\r
- int elems = desc->stat_desc->elems;\r
- int n, m; /* iterate over heap elements */\r
- int max_code = -1; /* largest code with non zero frequency */\r
- int node; /* new node being created */\r
-\r
- /* Construct the initial heap, with least frequent element in\r
- * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\r
- * heap[0] is not used.\r
- */\r
- s->heap_len = 0, s->heap_max = HEAP_SIZE;\r
-\r
- for (n = 0; n < elems; n++) {\r
- if (tree[n].Freq != 0) {\r
- s->heap[++(s->heap_len)] = max_code = n;\r
- s->depth[n] = 0;\r
- } else {\r
- tree[n].Len = 0;\r
- }\r
- }\r
-\r
- /* The pkzip format requires that at least one distance code exists,\r
- * and that at least one bit should be sent even if there is only one\r
- * possible code. So to avoid special checks later on we force at least\r
- * two codes of non zero frequency.\r
- */\r
- while (s->heap_len < 2) {\r
- node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);\r
- tree[node].Freq = 1;\r
- s->depth[node] = 0;\r
- s->opt_len--; if (stree) s->static_len -= stree[node].Len;\r
- /* node is 0 or 1 so it does not have extra bits */\r
- }\r
- desc->max_code = max_code;\r
-\r
- /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\r
- * establish sub-heaps of increasing lengths:\r
- */\r
- for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);\r
-\r
- /* Construct the Huffman tree by repeatedly combining the least two\r
- * frequent nodes.\r
- */\r
- node = elems; /* next internal node of the tree */\r
- do {\r
- pqremove(s, tree, n); /* n = node of least frequency */\r
- m = s->heap[SMALLEST]; /* m = node of next least frequency */\r
-\r
- s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */\r
- s->heap[--(s->heap_max)] = m;\r
-\r
- /* Create a new node father of n and m */\r
- tree[node].Freq = tree[n].Freq + tree[m].Freq;\r
- s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?\r
- s->depth[n] : s->depth[m]) + 1);\r
- tree[n].Dad = tree[m].Dad = (ush)node;\r
-#ifdef DUMP_BL_TREE\r
- if (tree == s->bl_tree) {\r
- fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)",\r
- node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);\r
- }\r
-#endif\r
- /* and insert the new node in the heap */\r
- s->heap[SMALLEST] = node++;\r
- pqdownheap(s, tree, SMALLEST);\r
-\r
- } while (s->heap_len >= 2);\r
-\r
- s->heap[--(s->heap_max)] = s->heap[SMALLEST];\r
-\r
- /* At this point, the fields freq and dad are set. We can now\r
- * generate the bit lengths.\r
- */\r
- gen_bitlen(s, (tree_desc *)desc);\r
-\r
- /* The field len is now set, we can generate the bit codes */\r
- gen_codes ((ct_data *)tree, max_code, s->bl_count);\r
-}\r
-\r
-/* ===========================================================================\r
- * Scan a literal or distance tree to determine the frequencies of the codes\r
- * in the bit length tree.\r
- */\r
-local void scan_tree (s, tree, max_code)\r
- deflate_state *s;\r
- ct_data *tree; /* the tree to be scanned */\r
- int max_code; /* and its largest code of non zero frequency */\r
-{\r
- int n; /* iterates over all tree elements */\r
- int prevlen = -1; /* last emitted length */\r
- int curlen; /* length of current code */\r
- int nextlen = tree[0].Len; /* length of next code */\r
- int count = 0; /* repeat count of the current code */\r
- int max_count = 7; /* max repeat count */\r
- int min_count = 4; /* min repeat count */\r
-\r
- if (nextlen == 0) max_count = 138, min_count = 3;\r
- tree[max_code+1].Len = (ush)0xffff; /* guard */\r
-\r
- for (n = 0; n <= max_code; n++) {\r
- curlen = nextlen; nextlen = tree[n+1].Len;\r
- if (++count < max_count && curlen == nextlen) {\r
- continue;\r
- } else if (count < min_count) {\r
- s->bl_tree[curlen].Freq += count;\r
- } else if (curlen != 0) {\r
- if (curlen != prevlen) s->bl_tree[curlen].Freq++;\r
- s->bl_tree[REP_3_6].Freq++;\r
- } else if (count <= 10) {\r
- s->bl_tree[REPZ_3_10].Freq++;\r
- } else {\r
- s->bl_tree[REPZ_11_138].Freq++;\r
- }\r
- count = 0; prevlen = curlen;\r
- if (nextlen == 0) {\r
- max_count = 138, min_count = 3;\r
- } else if (curlen == nextlen) {\r
- max_count = 6, min_count = 3;\r
- } else {\r
- max_count = 7, min_count = 4;\r
- }\r
- }\r
-}\r
-\r
-/* ===========================================================================\r
- * Send a literal or distance tree in compressed form, using the codes in\r
- * bl_tree.\r
- */\r
-local void send_tree (s, tree, max_code)\r
- deflate_state *s;\r
- ct_data *tree; /* the tree to be scanned */\r
- int max_code; /* and its largest code of non zero frequency */\r
-{\r
- int n; /* iterates over all tree elements */\r
- int prevlen = -1; /* last emitted length */\r
- int curlen; /* length of current code */\r
- int nextlen = tree[0].Len; /* length of next code */\r
- int count = 0; /* repeat count of the current code */\r
- int max_count = 7; /* max repeat count */\r
- int min_count = 4; /* min repeat count */\r
-\r
- /* tree[max_code+1].Len = -1; */ /* guard already set */\r
- if (nextlen == 0) max_count = 138, min_count = 3;\r
-\r
- for (n = 0; n <= max_code; n++) {\r
- curlen = nextlen; nextlen = tree[n+1].Len;\r
- if (++count < max_count && curlen == nextlen) {\r
- continue;\r
- } else if (count < min_count) {\r
- do { send_code(s, curlen, s->bl_tree); } while (--count != 0);\r
-\r
- } else if (curlen != 0) {\r
- if (curlen != prevlen) {\r
- send_code(s, curlen, s->bl_tree); count--;\r
- }\r
- Assert(count >= 3 && count <= 6, " 3_6?");\r
- send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);\r
-\r
- } else if (count <= 10) {\r
- send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);\r
-\r
- } else {\r
- send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);\r
- }\r
- count = 0; prevlen = curlen;\r
- if (nextlen == 0) {\r
- max_count = 138, min_count = 3;\r
- } else if (curlen == nextlen) {\r
- max_count = 6, min_count = 3;\r
- } else {\r
- max_count = 7, min_count = 4;\r
- }\r
- }\r
-}\r
-\r
-/* ===========================================================================\r
- * Construct the Huffman tree for the bit lengths and return the index in\r
- * bl_order of the last bit length code to send.\r
- */\r
-local int build_bl_tree(s)\r
- deflate_state *s;\r
-{\r
- int max_blindex; /* index of last bit length code of non zero freq */\r
-\r
- /* Determine the bit length frequencies for literal and distance trees */\r
- scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);\r
- scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);\r
-\r
- /* Build the bit length tree: */\r
- build_tree(s, (tree_desc *)(&(s->bl_desc)));\r
- /* opt_len now includes the length of the tree representations, except\r
- * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\r
- */\r
-\r
- /* Determine the number of bit length codes to send. The pkzip format\r
- * requires that at least 4 bit length codes be sent. (appnote.txt says\r
- * 3 but the actual value used is 4.)\r
- */\r
- for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {\r
- if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;\r
- }\r
- /* Update opt_len to include the bit length tree and counts */\r
- s->opt_len += 3*(max_blindex+1) + 5+5+4;\r
- Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",\r
- s->opt_len, s->static_len));\r
-\r
- return max_blindex;\r
-}\r
-\r
-/* ===========================================================================\r
- * Send the header for a block using dynamic Huffman trees: the counts, the\r
- * lengths of the bit length codes, the literal tree and the distance tree.\r
- * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\r
- */\r
-local void send_all_trees(s, lcodes, dcodes, blcodes)\r
- deflate_state *s;\r
- int lcodes, dcodes, blcodes; /* number of codes for each tree */\r
-{\r
- int rank; /* index in bl_order */\r
-\r
- Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");\r
- Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\r
- "too many codes");\r
- Tracev((stderr, "\nbl counts: "));\r
- send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\r
- send_bits(s, dcodes-1, 5);\r
- send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\r
- for (rank = 0; rank < blcodes; rank++) {\r
- Tracev((stderr, "\nbl code %2d ", bl_order[rank]));\r
- send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);\r
- }\r
- Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));\r
-\r
- send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */\r
- Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));\r
-\r
- send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */\r
- Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));\r
-}\r
-\r
-/* ===========================================================================\r
- * Send a stored block\r
- */\r
-void _tr_stored_block(s, buf, stored_len, eof)\r
- deflate_state *s;\r
- charf *buf; /* input block */\r
- ulg stored_len; /* length of input block */\r
- int eof; /* true if this is the last block for a file */\r
-{\r
- send_bits(s, (STORED_BLOCK<<1)+eof, 3); /* send block type */\r
-#ifdef DEBUG\r
- s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;\r
- s->compressed_len += (stored_len + 4) << 3;\r
-#endif\r
- copy_block(s, buf, (unsigned)stored_len, 1); /* with header */\r
-}\r
-\r
-/* ===========================================================================\r
- * Send one empty static block to give enough lookahead for inflate.\r
- * This takes 10 bits, of which 7 may remain in the bit buffer.\r
- * The current inflate code requires 9 bits of lookahead. If the\r
- * last two codes for the previous block (real code plus EOB) were coded\r
- * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode\r
- * the last real code. In this case we send two empty static blocks instead\r
- * of one. (There are no problems if the previous block is stored or fixed.)\r
- * To simplify the code, we assume the worst case of last real code encoded\r
- * on one bit only.\r
- */\r
-void _tr_align(s)\r
- deflate_state *s;\r
-{\r
- send_bits(s, STATIC_TREES<<1, 3);\r
- send_code(s, END_BLOCK, static_ltree);\r
-#ifdef DEBUG\r
- s->compressed_len += 10L; /* 3 for block type, 7 for EOB */\r
-#endif\r
- bi_flush(s);\r
- /* Of the 10 bits for the empty block, we have already sent\r
- * (10 - bi_valid) bits. The lookahead for the last real code (before\r
- * the EOB of the previous block) was thus at least one plus the length\r
- * of the EOB plus what we have just sent of the empty static block.\r
- */\r
- if (1 + s->last_eob_len + 10 - s->bi_valid < 9) {\r
- send_bits(s, STATIC_TREES<<1, 3);\r
- send_code(s, END_BLOCK, static_ltree);\r
-#ifdef DEBUG\r
- s->compressed_len += 10L;\r
-#endif\r
- bi_flush(s);\r
- }\r
- s->last_eob_len = 7;\r
-}\r
-\r
-/* ===========================================================================\r
- * Determine the best encoding for the current block: dynamic trees, static\r
- * trees or store, and output the encoded block to the zip file.\r
- */\r
-void _tr_flush_block(s, buf, stored_len, eof)\r
- deflate_state *s;\r
- charf *buf; /* input block, or NULL if too old */\r
- ulg stored_len; /* length of input block */\r
- int eof; /* true if this is the last block for a file */\r
-{\r
- ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */\r
- int max_blindex = 0; /* index of last bit length code of non zero freq */\r
-\r
- /* Build the Huffman trees unless a stored block is forced */\r
- if (s->level > 0) {\r
-\r
- /* Check if the file is binary or text */\r
- if (stored_len > 0 && s->strm->data_type == Z_UNKNOWN)\r
- set_data_type(s);\r
-\r
- /* Construct the literal and distance trees */\r
- build_tree(s, (tree_desc *)(&(s->l_desc)));\r
- Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,\r
- s->static_len));\r
-\r
- build_tree(s, (tree_desc *)(&(s->d_desc)));\r
- Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,\r
- s->static_len));\r
- /* At this point, opt_len and static_len are the total bit lengths of\r
- * the compressed block data, excluding the tree representations.\r
- */\r
-\r
- /* Build the bit length tree for the above two trees, and get the index\r
- * in bl_order of the last bit length code to send.\r
- */\r
- max_blindex = build_bl_tree(s);\r
-\r
- /* Determine the best encoding. Compute the block lengths in bytes. */\r
- opt_lenb = (s->opt_len+3+7)>>3;\r
- static_lenb = (s->static_len+3+7)>>3;\r
-\r
- Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",\r
- opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\r
- s->last_lit));\r
-\r
- if (static_lenb <= opt_lenb) opt_lenb = static_lenb;\r
-\r
- } else {\r
- Assert(buf != (char*)0, "lost buf");\r
- opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\r
- }\r
-\r
-#ifdef FORCE_STORED\r
- if (buf != (char*)0) { /* force stored block */\r
-#else\r
- if (stored_len+4 <= opt_lenb && buf != (char*)0) {\r
- /* 4: two words for the lengths */\r
-#endif\r
- /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\r
- * Otherwise we can't have processed more than WSIZE input bytes since\r
- * the last block flush, because compression would have been\r
- * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\r
- * transform a block into a stored block.\r
- */\r
- _tr_stored_block(s, buf, stored_len, eof);\r
-\r
-#ifdef FORCE_STATIC\r
- } else if (static_lenb >= 0) { /* force static trees */\r
-#else\r
- } else if (s->strategy == Z_FIXED || static_lenb == opt_lenb) {\r
-#endif\r
- send_bits(s, (STATIC_TREES<<1)+eof, 3);\r
- compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);\r
-#ifdef DEBUG\r
- s->compressed_len += 3 + s->static_len;\r
-#endif\r
- } else {\r
- send_bits(s, (DYN_TREES<<1)+eof, 3);\r
- send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,\r
- max_blindex+1);\r
- compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);\r
-#ifdef DEBUG\r
- s->compressed_len += 3 + s->opt_len;\r
-#endif\r
- }\r
- Assert (s->compressed_len == s->bits_sent, "bad compressed size");\r
- /* The above check is made mod 2^32, for files larger than 512 MB\r
- * and uLong implemented on 32 bits.\r
- */\r
- init_block(s);\r
-\r
- if (eof) {\r
- bi_windup(s);\r
-#ifdef DEBUG\r
- s->compressed_len += 7; /* align on byte boundary */\r
-#endif\r
- }\r
- Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,\r
- s->compressed_len-7*eof));\r
-}\r
-\r
-/* ===========================================================================\r
- * Save the match info and tally the frequency counts. Return true if\r
- * the current block must be flushed.\r
- */\r
-int _tr_tally (s, dist, lc)\r
- deflate_state *s;\r
- unsigned dist; /* distance of matched string */\r
- unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\r
-{\r
- s->d_buf[s->last_lit] = (ush)dist;\r
- s->l_buf[s->last_lit++] = (uch)lc;\r
- if (dist == 0) {\r
- /* lc is the unmatched char */\r
- s->dyn_ltree[lc].Freq++;\r
- } else {\r
- s->matches++;\r
- /* Here, lc is the match length - MIN_MATCH */\r
- dist--; /* dist = match distance - 1 */\r
- Assert((ush)dist < (ush)MAX_DIST(s) &&\r
- (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\r
- (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");\r
-\r
- s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;\r
- s->dyn_dtree[d_code(dist)].Freq++;\r
- }\r
-\r
-#ifdef TRUNCATE_BLOCK\r
- /* Try to guess if it is profitable to stop the current block here */\r
- if ((s->last_lit & 0x1fff) == 0 && s->level > 2) {\r
- /* Compute an upper bound for the compressed length */\r
- ulg out_length = (ulg)s->last_lit*8L;\r
- ulg in_length = (ulg)((long)s->strstart - s->block_start);\r
- int dcode;\r
- for (dcode = 0; dcode < D_CODES; dcode++) {\r
- out_length += (ulg)s->dyn_dtree[dcode].Freq *\r
- (5L+extra_dbits[dcode]);\r
- }\r
- out_length >>= 3;\r
- Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",\r
- s->last_lit, in_length, out_length,\r
- 100L - out_length*100L/in_length));\r
- if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1;\r
- }\r
-#endif\r
- return (s->last_lit == s->lit_bufsize-1);\r
- /* We avoid equality with lit_bufsize because of wraparound at 64K\r
- * on 16 bit machines and because stored blocks are restricted to\r
- * 64K-1 bytes.\r
- */\r
-}\r
-\r
-/* ===========================================================================\r
- * Send the block data compressed using the given Huffman trees\r
- */\r
-local void compress_block(s, ltree, dtree)\r
- deflate_state *s;\r
- ct_data *ltree; /* literal tree */\r
- ct_data *dtree; /* distance tree */\r
-{\r
- unsigned dist; /* distance of matched string */\r
- int lc; /* match length or unmatched char (if dist == 0) */\r
- unsigned lx = 0; /* running index in l_buf */\r
- unsigned code; /* the code to send */\r
- int extra; /* number of extra bits to send */\r
-\r
- if (s->last_lit != 0) do {\r
- dist = s->d_buf[lx];\r
- lc = s->l_buf[lx++];\r
- if (dist == 0) {\r
- send_code(s, lc, ltree); /* send a literal byte */\r
- Tracecv(isgraph(lc), (stderr," '%c' ", lc));\r
- } else {\r
- /* Here, lc is the match length - MIN_MATCH */\r
- code = _length_code[lc];\r
- send_code(s, code+LITERALS+1, ltree); /* send the length code */\r
- extra = extra_lbits[code];\r
- if (extra != 0) {\r
- lc -= base_length[code];\r
- send_bits(s, lc, extra); /* send the extra length bits */\r
- }\r
- dist--; /* dist is now the match distance - 1 */\r
- code = d_code(dist);\r
- Assert (code < D_CODES, "bad d_code");\r
-\r
- send_code(s, code, dtree); /* send the distance code */\r
- extra = extra_dbits[code];\r
- if (extra != 0) {\r
- dist -= base_dist[code];\r
- send_bits(s, dist, extra); /* send the extra distance bits */\r
- }\r
- } /* literal or match pair ? */\r
-\r
- /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\r
- Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\r
- "pendingBuf overflow");\r
-\r
- } while (lx < s->last_lit);\r
-\r
- send_code(s, END_BLOCK, ltree);\r
- s->last_eob_len = ltree[END_BLOCK].Len;\r
-}\r
-\r
-/* ===========================================================================\r
- * Set the data type to BINARY or TEXT, using a crude approximation:\r
- * set it to Z_TEXT if all symbols are either printable characters (33 to 255)\r
- * or white spaces (9 to 13, or 32); or set it to Z_BINARY otherwise.\r
- * IN assertion: the fields Freq of dyn_ltree are set.\r
- */\r
-local void set_data_type(s)\r
- deflate_state *s;\r
-{\r
- int n;\r
-\r
- for (n = 0; n < 9; n++)\r
- if (s->dyn_ltree[n].Freq != 0)\r
- break;\r
- if (n == 9)\r
- for (n = 14; n < 32; n++)\r
- if (s->dyn_ltree[n].Freq != 0)\r
- break;\r
- s->strm->data_type = (n == 32) ? Z_TEXT : Z_BINARY;\r
-}\r
-\r
-/* ===========================================================================\r
- * Reverse the first len bits of a code, using straightforward code (a faster\r
- * method would use a table)\r
- * IN assertion: 1 <= len <= 15\r
- */\r
-local unsigned bi_reverse(code, len)\r
- unsigned code; /* the value to invert */\r
- int len; /* its bit length */\r
-{\r
- register unsigned res = 0;\r
- do {\r
- res |= code & 1;\r
- code >>= 1, res <<= 1;\r
- } while (--len > 0);\r
- return res >> 1;\r
-}\r
-\r
-/* ===========================================================================\r
- * Flush the bit buffer, keeping at most 7 bits in it.\r
- */\r
-local void bi_flush(s)\r
- deflate_state *s;\r
-{\r
- if (s->bi_valid == 16) {\r
- put_short(s, s->bi_buf);\r
- s->bi_buf = 0;\r
- s->bi_valid = 0;\r
- } else if (s->bi_valid >= 8) {\r
- put_byte(s, (Byte)s->bi_buf);\r
- s->bi_buf >>= 8;\r
- s->bi_valid -= 8;\r
- }\r
-}\r
-\r
-/* ===========================================================================\r
- * Flush the bit buffer and align the output on a byte boundary\r
- */\r
-local void bi_windup(s)\r
- deflate_state *s;\r
-{\r
- if (s->bi_valid > 8) {\r
- put_short(s, s->bi_buf);\r
- } else if (s->bi_valid > 0) {\r
- put_byte(s, (Byte)s->bi_buf);\r
- }\r
- s->bi_buf = 0;\r
- s->bi_valid = 0;\r
-#ifdef DEBUG\r
- s->bits_sent = (s->bits_sent+7) & ~7;\r
-#endif\r
-}\r
-\r
-/* ===========================================================================\r
- * Copy a stored block, storing first the length and its\r
- * one's complement if requested.\r
- */\r
-local void copy_block(s, buf, len, header)\r
- deflate_state *s;\r
- charf *buf; /* the input data */\r
- unsigned len; /* its length */\r
- int header; /* true if block header must be written */\r
-{\r
- bi_windup(s); /* align on byte boundary */\r
- s->last_eob_len = 8; /* enough lookahead for inflate */\r
-\r
- if (header) {\r
- put_short(s, (ush)len);\r
- put_short(s, (ush)~len);\r
-#ifdef DEBUG\r
- s->bits_sent += 2*16;\r
-#endif\r
- }\r
-#ifdef DEBUG\r
- s->bits_sent += (ulg)len<<3;\r
-#endif\r
- while (len--) {\r
- put_byte(s, *buf++);\r
- }\r
-}\r
+/* trees.c -- output deflated data using Huffman coding
+ * Copyright (C) 1995-2005 Jean-loup Gailly
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/*
+ * ALGORITHM
+ *
+ * The "deflation" process uses several Huffman trees. The more
+ * common source values are represented by shorter bit sequences.
+ *
+ * Each code tree is stored in a compressed form which is itself
+ * a Huffman encoding of the lengths of all the code strings (in
+ * ascending order by source values). The actual code strings are
+ * reconstructed from the lengths in the inflate process, as described
+ * in the deflate specification.
+ *
+ * REFERENCES
+ *
+ * Deutsch, L.P.,"'Deflate' Compressed Data Format Specification".
+ * Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc
+ *
+ * Storer, James A.
+ * Data Compression: Methods and Theory, pp. 49-50.
+ * Computer Science Press, 1988. ISBN 0-7167-8156-5.
+ *
+ * Sedgewick, R.
+ * Algorithms, p290.
+ * Addison-Wesley, 1983. ISBN 0-201-06672-6.
+ */
+
+/* @(#) $Id$ */
+
+/* #define GEN_TREES_H */
+
+#include "deflate.h"
+
+#ifdef DEBUG
+# include <ctype.h>
+#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 */
+
+
+/* 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<<extra_lbits[code]); n++) {
+ _length_code[length++] = (uch)code;
+ }
+ }
+ Assert (length == 256, "tr_static_init: length != 256");
+ /* Note that the length 255 (match length 258) can be represented
+ * in two different ways: code 284 + 5 bits or code 285, so we
+ * overwrite length_code[255] to use the best encoding:
+ */
+ _length_code[length-1] = (uch)code;
+
+ /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
+ dist = 0;
+ for (code = 0 ; code < 16; code++) {
+ base_dist[code] = dist;
+ for (n = 0; n < (1<<extra_dbits[code]); n++) {
+ _dist_code[dist++] = (uch)code;
+ }
+ }
+ Assert (dist == 256, "tr_static_init: dist != 256");
+ dist >>= 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 <stdio.h>
+# 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 ((unsigned) 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<<MAX_BITS)-1,
+ "inconsistent bit counts");
+ Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
+
+ for (n = 0; n <= max_code; n++) {
+ int len = tree[n].Len;
+ if (len == 0) continue;
+ /* Now reverse the bits */
+ tree[n].Code = bi_reverse(next_code[len]++, len);
+
+ Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
+ n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
+ }
+}
+
+/* ===========================================================================
+ * Construct one Huffman tree and assigns the code bit strings and lengths.
+ * Update the total bit length for the current block.
+ * IN assertion: the field freq is set for all tree elements.
+ * OUT assertions: the fields len and code are set to the optimal bit length
+ * and corresponding code. The length opt_len is updated; static_len is
+ * also updated if stree is not null. The field max_code is set.
+ */
+local void build_tree(s, desc)
+ deflate_state *s;
+ tree_desc *desc; /* the tree descriptor */
+{
+ ct_data *tree = desc->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)((s->depth[n] >= s->depth[m] ?
+ 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 binary or text */
+ if (stored_len > 0 && s->strm->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 the block lengths 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 (s->strategy == Z_FIXED || 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((uInt)(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 BINARY or TEXT, using a crude approximation:
+ * set it to Z_TEXT if all symbols are either printable characters (33 to 255)
+ * or white spaces (9 to 13, or 32); or set it to Z_BINARY otherwise.
+ * IN assertion: the fields Freq of dyn_ltree are set.
+ */
+local void set_data_type(s)
+ deflate_state *s;
+{
+ int n;
+
+ for (n = 0; n < 9; n++)
+ if (s->dyn_ltree[n].Freq != 0)
+ break;
+ if (n == 9)
+ for (n = 14; n < 32; n++)
+ if (s->dyn_ltree[n].Freq != 0)
+ break;
+ s->strm->data_type = (n == 32) ? Z_TEXT : Z_BINARY;
+}
+
+/* ===========================================================================
+ * 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++);
+ }
+}
-/* header created automatically with -DGEN_TREES_H */\r
-\r
-local const ct_data static_ltree[L_CODES+2] = {\r
-{{ 12},{ 8}}, {{140},{ 8}}, {{ 76},{ 8}}, {{204},{ 8}}, {{ 44},{ 8}},\r
-{{172},{ 8}}, {{108},{ 8}}, {{236},{ 8}}, {{ 28},{ 8}}, {{156},{ 8}},\r
-{{ 92},{ 8}}, {{220},{ 8}}, {{ 60},{ 8}}, {{188},{ 8}}, {{124},{ 8}},\r
-{{252},{ 8}}, {{ 2},{ 8}}, {{130},{ 8}}, {{ 66},{ 8}}, {{194},{ 8}},\r
-{{ 34},{ 8}}, {{162},{ 8}}, {{ 98},{ 8}}, {{226},{ 8}}, {{ 18},{ 8}},\r
-{{146},{ 8}}, {{ 82},{ 8}}, {{210},{ 8}}, {{ 50},{ 8}}, {{178},{ 8}},\r
-{{114},{ 8}}, {{242},{ 8}}, {{ 10},{ 8}}, {{138},{ 8}}, {{ 74},{ 8}},\r
-{{202},{ 8}}, {{ 42},{ 8}}, {{170},{ 8}}, {{106},{ 8}}, {{234},{ 8}},\r
-{{ 26},{ 8}}, {{154},{ 8}}, {{ 90},{ 8}}, {{218},{ 8}}, {{ 58},{ 8}},\r
-{{186},{ 8}}, {{122},{ 8}}, {{250},{ 8}}, {{ 6},{ 8}}, {{134},{ 8}},\r
-{{ 70},{ 8}}, {{198},{ 8}}, {{ 38},{ 8}}, {{166},{ 8}}, {{102},{ 8}},\r
-{{230},{ 8}}, {{ 22},{ 8}}, {{150},{ 8}}, {{ 86},{ 8}}, {{214},{ 8}},\r
-{{ 54},{ 8}}, {{182},{ 8}}, {{118},{ 8}}, {{246},{ 8}}, {{ 14},{ 8}},\r
-{{142},{ 8}}, {{ 78},{ 8}}, {{206},{ 8}}, {{ 46},{ 8}}, {{174},{ 8}},\r
-{{110},{ 8}}, {{238},{ 8}}, {{ 30},{ 8}}, {{158},{ 8}}, {{ 94},{ 8}},\r
-{{222},{ 8}}, {{ 62},{ 8}}, {{190},{ 8}}, {{126},{ 8}}, {{254},{ 8}},\r
-{{ 1},{ 8}}, {{129},{ 8}}, {{ 65},{ 8}}, {{193},{ 8}}, {{ 33},{ 8}},\r
-{{161},{ 8}}, {{ 97},{ 8}}, {{225},{ 8}}, {{ 17},{ 8}}, {{145},{ 8}},\r
-{{ 81},{ 8}}, {{209},{ 8}}, {{ 49},{ 8}}, {{177},{ 8}}, {{113},{ 8}},\r
-{{241},{ 8}}, {{ 9},{ 8}}, {{137},{ 8}}, {{ 73},{ 8}}, {{201},{ 8}},\r
-{{ 41},{ 8}}, {{169},{ 8}}, {{105},{ 8}}, {{233},{ 8}}, {{ 25},{ 8}},\r
-{{153},{ 8}}, {{ 89},{ 8}}, {{217},{ 8}}, {{ 57},{ 8}}, {{185},{ 8}},\r
-{{121},{ 8}}, {{249},{ 8}}, {{ 5},{ 8}}, {{133},{ 8}}, {{ 69},{ 8}},\r
-{{197},{ 8}}, {{ 37},{ 8}}, {{165},{ 8}}, {{101},{ 8}}, {{229},{ 8}},\r
-{{ 21},{ 8}}, {{149},{ 8}}, {{ 85},{ 8}}, {{213},{ 8}}, {{ 53},{ 8}},\r
-{{181},{ 8}}, {{117},{ 8}}, {{245},{ 8}}, {{ 13},{ 8}}, {{141},{ 8}},\r
-{{ 77},{ 8}}, {{205},{ 8}}, {{ 45},{ 8}}, {{173},{ 8}}, {{109},{ 8}},\r
-{{237},{ 8}}, {{ 29},{ 8}}, {{157},{ 8}}, {{ 93},{ 8}}, {{221},{ 8}},\r
-{{ 61},{ 8}}, {{189},{ 8}}, {{125},{ 8}}, {{253},{ 8}}, {{ 19},{ 9}},\r
-{{275},{ 9}}, {{147},{ 9}}, {{403},{ 9}}, {{ 83},{ 9}}, {{339},{ 9}},\r
-{{211},{ 9}}, {{467},{ 9}}, {{ 51},{ 9}}, {{307},{ 9}}, {{179},{ 9}},\r
-{{435},{ 9}}, {{115},{ 9}}, {{371},{ 9}}, {{243},{ 9}}, {{499},{ 9}},\r
-{{ 11},{ 9}}, {{267},{ 9}}, {{139},{ 9}}, {{395},{ 9}}, {{ 75},{ 9}},\r
-{{331},{ 9}}, {{203},{ 9}}, {{459},{ 9}}, {{ 43},{ 9}}, {{299},{ 9}},\r
-{{171},{ 9}}, {{427},{ 9}}, {{107},{ 9}}, {{363},{ 9}}, {{235},{ 9}},\r
-{{491},{ 9}}, {{ 27},{ 9}}, {{283},{ 9}}, {{155},{ 9}}, {{411},{ 9}},\r
-{{ 91},{ 9}}, {{347},{ 9}}, {{219},{ 9}}, {{475},{ 9}}, {{ 59},{ 9}},\r
-{{315},{ 9}}, {{187},{ 9}}, {{443},{ 9}}, {{123},{ 9}}, {{379},{ 9}},\r
-{{251},{ 9}}, {{507},{ 9}}, {{ 7},{ 9}}, {{263},{ 9}}, {{135},{ 9}},\r
-{{391},{ 9}}, {{ 71},{ 9}}, {{327},{ 9}}, {{199},{ 9}}, {{455},{ 9}},\r
-{{ 39},{ 9}}, {{295},{ 9}}, {{167},{ 9}}, {{423},{ 9}}, {{103},{ 9}},\r
-{{359},{ 9}}, {{231},{ 9}}, {{487},{ 9}}, {{ 23},{ 9}}, {{279},{ 9}},\r
-{{151},{ 9}}, {{407},{ 9}}, {{ 87},{ 9}}, {{343},{ 9}}, {{215},{ 9}},\r
-{{471},{ 9}}, {{ 55},{ 9}}, {{311},{ 9}}, {{183},{ 9}}, {{439},{ 9}},\r
-{{119},{ 9}}, {{375},{ 9}}, {{247},{ 9}}, {{503},{ 9}}, {{ 15},{ 9}},\r
-{{271},{ 9}}, {{143},{ 9}}, {{399},{ 9}}, {{ 79},{ 9}}, {{335},{ 9}},\r
-{{207},{ 9}}, {{463},{ 9}}, {{ 47},{ 9}}, {{303},{ 9}}, {{175},{ 9}},\r
-{{431},{ 9}}, {{111},{ 9}}, {{367},{ 9}}, {{239},{ 9}}, {{495},{ 9}},\r
-{{ 31},{ 9}}, {{287},{ 9}}, {{159},{ 9}}, {{415},{ 9}}, {{ 95},{ 9}},\r
-{{351},{ 9}}, {{223},{ 9}}, {{479},{ 9}}, {{ 63},{ 9}}, {{319},{ 9}},\r
-{{191},{ 9}}, {{447},{ 9}}, {{127},{ 9}}, {{383},{ 9}}, {{255},{ 9}},\r
-{{511},{ 9}}, {{ 0},{ 7}}, {{ 64},{ 7}}, {{ 32},{ 7}}, {{ 96},{ 7}},\r
-{{ 16},{ 7}}, {{ 80},{ 7}}, {{ 48},{ 7}}, {{112},{ 7}}, {{ 8},{ 7}},\r
-{{ 72},{ 7}}, {{ 40},{ 7}}, {{104},{ 7}}, {{ 24},{ 7}}, {{ 88},{ 7}},\r
-{{ 56},{ 7}}, {{120},{ 7}}, {{ 4},{ 7}}, {{ 68},{ 7}}, {{ 36},{ 7}},\r
-{{100},{ 7}}, {{ 20},{ 7}}, {{ 84},{ 7}}, {{ 52},{ 7}}, {{116},{ 7}},\r
-{{ 3},{ 8}}, {{131},{ 8}}, {{ 67},{ 8}}, {{195},{ 8}}, {{ 35},{ 8}},\r
-{{163},{ 8}}, {{ 99},{ 8}}, {{227},{ 8}}\r
-};\r
-\r
-local const ct_data static_dtree[D_CODES] = {\r
-{{ 0},{ 5}}, {{16},{ 5}}, {{ 8},{ 5}}, {{24},{ 5}}, {{ 4},{ 5}},\r
-{{20},{ 5}}, {{12},{ 5}}, {{28},{ 5}}, {{ 2},{ 5}}, {{18},{ 5}},\r
-{{10},{ 5}}, {{26},{ 5}}, {{ 6},{ 5}}, {{22},{ 5}}, {{14},{ 5}},\r
-{{30},{ 5}}, {{ 1},{ 5}}, {{17},{ 5}}, {{ 9},{ 5}}, {{25},{ 5}},\r
-{{ 5},{ 5}}, {{21},{ 5}}, {{13},{ 5}}, {{29},{ 5}}, {{ 3},{ 5}},\r
-{{19},{ 5}}, {{11},{ 5}}, {{27},{ 5}}, {{ 7},{ 5}}, {{23},{ 5}}\r
-};\r
-\r
-const uch _dist_code[DIST_CODE_LEN] = {\r
- 0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8,\r
- 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10,\r
-10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\r
-11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,\r
-12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13,\r
-13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13,\r
-13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,\r
-14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,\r
-14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,\r
-14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15,\r
-15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,\r
-15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,\r
-15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 0, 0, 16, 17,\r
-18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22,\r
-23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\r
-24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,\r
-26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,\r
-26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27,\r
-27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,\r
-27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\r
-28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\r
-28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\r
-28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,\r
-29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,\r
-29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,\r
-29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29\r
-};\r
-\r
-const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\r
- 0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 12, 12,\r
-13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16,\r
-17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19,\r
-19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,\r
-21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22,\r
-22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23,\r
-23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\r
-24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\r
-25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,\r
-25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26,\r
-26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,\r
-26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,\r
-27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28\r
-};\r
-\r
-local const int base_length[LENGTH_CODES] = {\r
-0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56,\r
-64, 80, 96, 112, 128, 160, 192, 224, 0\r
-};\r
-\r
-local const int base_dist[D_CODES] = {\r
- 0, 1, 2, 3, 4, 6, 8, 12, 16, 24,\r
- 32, 48, 64, 96, 128, 192, 256, 384, 512, 768,\r
- 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576\r
-};\r
-\r
+/* 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
+};
+
-/* zconf.h -- configuration of the zlib compression library\r
- * Copyright (C) 1995-2005 Jean-loup Gailly.\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/* @(#) $Id$ */\r
-\r
-#ifndef ZCONF_H\r
-#define ZCONF_H\r
-\r
-/*\r
- * If you *really* need a unique prefix for all types and library functions,\r
- * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it.\r
- */\r
-#ifdef Z_PREFIX\r
-# define deflateInit_ z_deflateInit_\r
-# define deflate z_deflate\r
-# define deflateEnd z_deflateEnd\r
-# define inflateInit_ z_inflateInit_\r
-# define inflate z_inflate\r
-# define inflateEnd z_inflateEnd\r
-# define deflateInit2_ z_deflateInit2_\r
-# define deflateSetDictionary z_deflateSetDictionary\r
-# define deflateCopy z_deflateCopy\r
-# define deflateReset z_deflateReset\r
-# define deflateParams z_deflateParams\r
-# define deflateBound z_deflateBound\r
-# define deflatePrime z_deflatePrime\r
-# define inflateInit2_ z_inflateInit2_\r
-# define inflateSetDictionary z_inflateSetDictionary\r
-# define inflateSync z_inflateSync\r
-# define inflateSyncPoint z_inflateSyncPoint\r
-# define inflateCopy z_inflateCopy\r
-# define inflateReset z_inflateReset\r
-# define inflateBack z_inflateBack\r
-# define inflateBackEnd z_inflateBackEnd\r
-# define compress z_compress\r
-# define compress2 z_compress2\r
-# define compressBound z_compressBound\r
-# define uncompress z_uncompress\r
-# define adler32 z_adler32\r
-# define crc32 z_crc32\r
-# define get_crc_table z_get_crc_table\r
-# define zError z_zError\r
-\r
-# define alloc_func z_alloc_func\r
-# define free_func z_free_func\r
-# define in_func z_in_func\r
-# define out_func z_out_func\r
-# define Byte z_Byte\r
-# define uInt z_uInt\r
-# define uLong z_uLong\r
-# define Bytef z_Bytef\r
-# define charf z_charf\r
-# define intf z_intf\r
-# define uIntf z_uIntf\r
-# define uLongf z_uLongf\r
-# define voidpf z_voidpf\r
-# define voidp z_voidp\r
-#endif\r
-\r
-#if defined(__MSDOS__) && !defined(MSDOS)\r
-# define MSDOS\r
-#endif\r
-#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2)\r
-# define OS2\r
-#endif\r
-#if defined(_WINDOWS) && !defined(WINDOWS)\r
-# define WINDOWS\r
-#endif\r
-#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__)\r
-# ifndef WIN32\r
-# define WIN32\r
-# endif\r
-#endif\r
-#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32)\r
-# if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__)\r
-# ifndef SYS16BIT\r
-# define SYS16BIT\r
-# endif\r
-# endif\r
-#endif\r
-\r
-/*\r
- * Compile with -DMAXSEG_64K if the alloc function cannot allocate more\r
- * than 64k bytes at a time (needed on systems with 16-bit int).\r
- */\r
-#ifdef SYS16BIT\r
-# define MAXSEG_64K\r
-#endif\r
-#ifdef MSDOS\r
-# define UNALIGNED_OK\r
-#endif\r
-\r
-#ifdef __STDC_VERSION__\r
-# ifndef STDC\r
-# define STDC\r
-# endif\r
-# if __STDC_VERSION__ >= 199901L\r
-# ifndef STDC99\r
-# define STDC99\r
-# endif\r
-# endif\r
-#endif\r
-#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus))\r
-# define STDC\r
-#endif\r
-#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__))\r
-# define STDC\r
-#endif\r
-#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32))\r
-# define STDC\r
-#endif\r
-#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__))\r
-# define STDC\r
-#endif\r
-\r
-#if defined(__OS400__) && !defined(STDC) /* iSeries (formerly AS/400). */\r
-# define STDC\r
-#endif\r
-\r
-#ifndef STDC\r
-# ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */\r
-# define const /* note: need a more gentle solution here */\r
-# endif\r
-#endif\r
-\r
-/* Some Mac compilers merge all .h files incorrectly: */\r
-#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__)\r
-# define NO_DUMMY_DECL\r
-#endif\r
-\r
-/* Maximum value for memLevel in deflateInit2 */\r
-#ifndef MAX_MEM_LEVEL\r
-# ifdef MAXSEG_64K\r
-# define MAX_MEM_LEVEL 8\r
-# else\r
-# define MAX_MEM_LEVEL 9\r
-# endif\r
-#endif\r
-\r
-/* Maximum value for windowBits in deflateInit2 and inflateInit2.\r
- * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files\r
- * created by gzip. (Files created by minigzip can still be extracted by\r
- * gzip.)\r
- */\r
-#ifndef MAX_WBITS\r
-# define MAX_WBITS 15 /* 32K LZ77 window */\r
-#endif\r
-\r
-/* The memory requirements for deflate are (in bytes):\r
- (1 << (windowBits+2)) + (1 << (memLevel+9))\r
- that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values)\r
- plus a few kilobytes for small objects. For example, if you want to reduce\r
- the default memory requirements from 256K to 128K, compile with\r
- make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"\r
- Of course this will generally degrade compression (there's no free lunch).\r
-\r
- The memory requirements for inflate are (in bytes) 1 << windowBits\r
- that is, 32K for windowBits=15 (default value) plus a few kilobytes\r
- for small objects.\r
-*/\r
-\r
- /* Type declarations */\r
-\r
-#ifndef OF /* function prototypes */\r
-# ifdef STDC\r
-# define OF(args) args\r
-# else\r
-# define OF(args) ()\r
-# endif\r
-#endif\r
-\r
-/* The following definitions for FAR are needed only for MSDOS mixed\r
- * model programming (small or medium model with some far allocations).\r
- * This was tested only with MSC; for other MSDOS compilers you may have\r
- * to define NO_MEMCPY in zutil.h. If you don't need the mixed model,\r
- * just define FAR to be empty.\r
- */\r
-#ifdef SYS16BIT\r
-# if defined(M_I86SM) || defined(M_I86MM)\r
- /* MSC small or medium model */\r
-# define SMALL_MEDIUM\r
-# ifdef _MSC_VER\r
-# define FAR _far\r
-# else\r
-# define FAR far\r
-# endif\r
-# endif\r
-# if (defined(__SMALL__) || defined(__MEDIUM__))\r
- /* Turbo C small or medium model */\r
-# define SMALL_MEDIUM\r
-# ifdef __BORLANDC__\r
-# define FAR _far\r
-# else\r
-# define FAR far\r
-# endif\r
-# endif\r
-#endif\r
-\r
-#if defined(WINDOWS) || defined(WIN32)\r
- /* If building or using zlib as a DLL, define ZLIB_DLL.\r
- * This is not mandatory, but it offers a little performance increase.\r
- */\r
-# ifdef ZLIB_DLL\r
-# if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500))\r
-# ifdef ZLIB_INTERNAL\r
-# define ZEXTERN extern __declspec(dllexport)\r
-# else\r
-# define ZEXTERN extern __declspec(dllimport)\r
-# endif\r
-# endif\r
-# endif /* ZLIB_DLL */\r
- /* If building or using zlib with the WINAPI/WINAPIV calling convention,\r
- * define ZLIB_WINAPI.\r
- * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI.\r
- */\r
-# ifdef ZLIB_WINAPI\r
-# ifdef FAR\r
-# undef FAR\r
-# endif\r
-# include <windows.h>\r
- /* No need for _export, use ZLIB.DEF instead. */\r
- /* For complete Windows compatibility, use WINAPI, not __stdcall. */\r
-# define ZEXPORT WINAPI\r
-# ifdef WIN32\r
-# define ZEXPORTVA WINAPIV\r
-# else\r
-# define ZEXPORTVA FAR CDECL\r
-# endif\r
-# endif\r
-#endif\r
-\r
-#if defined (__BEOS__)\r
-# ifdef ZLIB_DLL\r
-# ifdef ZLIB_INTERNAL\r
-# define ZEXPORT __declspec(dllexport)\r
-# define ZEXPORTVA __declspec(dllexport)\r
-# else\r
-# define ZEXPORT __declspec(dllimport)\r
-# define ZEXPORTVA __declspec(dllimport)\r
-# endif\r
-# endif\r
-#endif\r
-\r
-#ifndef ZEXTERN\r
-# define ZEXTERN extern\r
-#endif\r
-#ifndef ZEXPORT\r
-# define ZEXPORT\r
-#endif\r
-#ifndef ZEXPORTVA\r
-# define ZEXPORTVA\r
-#endif\r
-\r
-#ifndef FAR\r
-# define FAR\r
-#endif\r
-\r
-#if !defined(__MACTYPES__)\r
-typedef unsigned char Byte; /* 8 bits */\r
-#endif\r
-typedef unsigned int uInt; /* 16 bits or more */\r
-typedef unsigned long uLong; /* 32 bits or more */\r
-\r
-#ifdef SMALL_MEDIUM\r
- /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */\r
-# define Bytef Byte FAR\r
-#else\r
- typedef Byte FAR Bytef;\r
-#endif\r
-typedef char FAR charf;\r
-typedef int FAR intf;\r
-typedef uInt FAR uIntf;\r
-typedef uLong FAR uLongf;\r
-\r
-#ifdef STDC\r
- typedef void const *voidpc;\r
- typedef void FAR *voidpf;\r
- typedef void *voidp;\r
-#else\r
- typedef Byte const *voidpc;\r
- typedef Byte FAR *voidpf;\r
- typedef Byte *voidp;\r
-#endif\r
-\r
-#if 0 /* HAVE_UNISTD_H -- this line is updated by ./configure */\r
-# include <sys/types.h> /* for off_t */\r
-# include <unistd.h> /* for SEEK_* and off_t */\r
-# ifdef VMS\r
-# include <unixio.h> /* for off_t */\r
-# endif\r
-# define z_off_t off_t\r
-#endif\r
-#ifndef SEEK_SET\r
-# define SEEK_SET 0 /* Seek from beginning of file. */\r
-# define SEEK_CUR 1 /* Seek from current position. */\r
-# define SEEK_END 2 /* Set file pointer to EOF plus "offset" */\r
-#endif\r
-#ifndef z_off_t\r
-# define z_off_t long\r
-#endif\r
-\r
-#if defined(__OS400__)\r
-# define NO_vsnprintf\r
-#endif\r
-\r
-#if defined(__MVS__)\r
-# define NO_vsnprintf\r
-# ifdef FAR\r
-# undef FAR\r
-# endif\r
-#endif\r
-\r
-/* MVS linker does not support external names larger than 8 bytes */\r
-#if defined(__MVS__)\r
-# pragma map(deflateInit_,"DEIN")\r
-# pragma map(deflateInit2_,"DEIN2")\r
-# pragma map(deflateEnd,"DEEND")\r
-# pragma map(deflateBound,"DEBND")\r
-# pragma map(inflateInit_,"ININ")\r
-# pragma map(inflateInit2_,"ININ2")\r
-# pragma map(inflateEnd,"INEND")\r
-# pragma map(inflateSync,"INSY")\r
-# pragma map(inflateSetDictionary,"INSEDI")\r
-# pragma map(compressBound,"CMBND")\r
-# pragma map(inflate_table,"INTABL")\r
-# pragma map(inflate_fast,"INFA")\r
-# pragma map(inflate_copyright,"INCOPY")\r
-#endif\r
-\r
-#endif /* ZCONF_H */\r
+/* zconf.h -- configuration of the zlib compression library
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#ifndef ZCONF_H
+#define ZCONF_H
+
+/*
+ * If you *really* need a unique prefix for all types and library functions,
+ * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it.
+ */
+#ifdef Z_PREFIX
+# define deflateInit_ z_deflateInit_
+# define deflate z_deflate
+# define deflateEnd z_deflateEnd
+# define inflateInit_ z_inflateInit_
+# define inflate z_inflate
+# define inflateEnd z_inflateEnd
+# define deflateInit2_ z_deflateInit2_
+# define deflateSetDictionary z_deflateSetDictionary
+# define deflateCopy z_deflateCopy
+# define deflateReset z_deflateReset
+# define deflateParams z_deflateParams
+# define deflateBound z_deflateBound
+# define deflatePrime z_deflatePrime
+# define inflateInit2_ z_inflateInit2_
+# define inflateSetDictionary z_inflateSetDictionary
+# define inflateSync z_inflateSync
+# define inflateSyncPoint z_inflateSyncPoint
+# define inflateCopy z_inflateCopy
+# define inflateReset z_inflateReset
+# define inflateBack z_inflateBack
+# define inflateBackEnd z_inflateBackEnd
+# define compress z_compress
+# define compress2 z_compress2
+# define compressBound z_compressBound
+# define uncompress z_uncompress
+# define adler32 z_adler32
+# define crc32 z_crc32
+# define get_crc_table z_get_crc_table
+# define zError z_zError
+
+# define alloc_func z_alloc_func
+# define free_func z_free_func
+# define in_func z_in_func
+# define out_func z_out_func
+# define Byte z_Byte
+# define uInt z_uInt
+# define uLong z_uLong
+# define Bytef z_Bytef
+# define charf z_charf
+# define intf z_intf
+# define uIntf z_uIntf
+# define uLongf z_uLongf
+# define voidpf z_voidpf
+# define voidp z_voidp
+#endif
+
+#if defined(__MSDOS__) && !defined(MSDOS)
+# define MSDOS
+#endif
+#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2)
+# define OS2
+#endif
+#if defined(_WINDOWS) && !defined(WINDOWS)
+# define WINDOWS
+#endif
+#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__)
+# ifndef WIN32
+# define WIN32
+# endif
+#endif
+#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32)
+# if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__)
+# ifndef SYS16BIT
+# define SYS16BIT
+# endif
+# endif
+#endif
+
+/*
+ * Compile with -DMAXSEG_64K if the alloc function cannot allocate more
+ * than 64k bytes at a time (needed on systems with 16-bit int).
+ */
+#ifdef SYS16BIT
+# define MAXSEG_64K
+#endif
+#ifdef MSDOS
+# define UNALIGNED_OK
+#endif
+
+#ifdef __STDC_VERSION__
+# ifndef STDC
+# define STDC
+# endif
+# if __STDC_VERSION__ >= 199901L
+# ifndef STDC99
+# define STDC99
+# endif
+# endif
+#endif
+#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus))
+# define STDC
+#endif
+#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__))
+# define STDC
+#endif
+#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32))
+# define STDC
+#endif
+#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__))
+# define STDC
+#endif
+
+#if defined(__OS400__) && !defined(STDC) /* iSeries (formerly AS/400). */
+# define STDC
+#endif
+
+#ifndef STDC
+# ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */
+# define const /* note: need a more gentle solution here */
+# endif
+#endif
+
+/* Some Mac compilers merge all .h files incorrectly: */
+#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__)
+# define NO_DUMMY_DECL
+#endif
+
+/* Maximum value for memLevel in deflateInit2 */
+#ifndef MAX_MEM_LEVEL
+# ifdef MAXSEG_64K
+# define MAX_MEM_LEVEL 8
+# else
+# define MAX_MEM_LEVEL 9
+# endif
+#endif
+
+/* Maximum value for windowBits in deflateInit2 and inflateInit2.
+ * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files
+ * created by gzip. (Files created by minigzip can still be extracted by
+ * gzip.)
+ */
+#ifndef MAX_WBITS
+# define MAX_WBITS 15 /* 32K LZ77 window */
+#endif
+
+/* The memory requirements for deflate are (in bytes):
+ (1 << (windowBits+2)) + (1 << (memLevel+9))
+ that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values)
+ plus a few kilobytes for small objects. For example, if you want to reduce
+ the default memory requirements from 256K to 128K, compile with
+ make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
+ Of course this will generally degrade compression (there's no free lunch).
+
+ The memory requirements for inflate are (in bytes) 1 << windowBits
+ that is, 32K for windowBits=15 (default value) plus a few kilobytes
+ for small objects.
+*/
+
+ /* Type declarations */
+
+#ifndef OF /* function prototypes */
+# ifdef STDC
+# define OF(args) args
+# else
+# define OF(args) ()
+# endif
+#endif
+
+/* The following definitions for FAR are needed only for MSDOS mixed
+ * model programming (small or medium model with some far allocations).
+ * This was tested only with MSC; for other MSDOS compilers you may have
+ * to define NO_MEMCPY in zutil.h. If you don't need the mixed model,
+ * just define FAR to be empty.
+ */
+#ifdef SYS16BIT
+# if defined(M_I86SM) || defined(M_I86MM)
+ /* MSC small or medium model */
+# define SMALL_MEDIUM
+# ifdef _MSC_VER
+# define FAR _far
+# else
+# define FAR far
+# endif
+# endif
+# if (defined(__SMALL__) || defined(__MEDIUM__))
+ /* Turbo C small or medium model */
+# define SMALL_MEDIUM
+# ifdef __BORLANDC__
+# define FAR _far
+# else
+# define FAR far
+# endif
+# endif
+#endif
+
+#if defined(WINDOWS) || defined(WIN32)
+ /* If building or using zlib as a DLL, define ZLIB_DLL.
+ * This is not mandatory, but it offers a little performance increase.
+ */
+# ifdef ZLIB_DLL
+# if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500))
+# ifdef ZLIB_INTERNAL
+# define ZEXTERN extern __declspec(dllexport)
+# else
+# define ZEXTERN extern __declspec(dllimport)
+# endif
+# endif
+# endif /* ZLIB_DLL */
+ /* If building or using zlib with the WINAPI/WINAPIV calling convention,
+ * define ZLIB_WINAPI.
+ * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI.
+ */
+# ifdef ZLIB_WINAPI
+# ifdef FAR
+# undef FAR
+# endif
+# include <windows.h>
+ /* No need for _export, use ZLIB.DEF instead. */
+ /* For complete Windows compatibility, use WINAPI, not __stdcall. */
+# define ZEXPORT WINAPI
+# ifdef WIN32
+# define ZEXPORTVA WINAPIV
+# else
+# define ZEXPORTVA FAR CDECL
+# endif
+# endif
+#endif
+
+#if defined (__BEOS__)
+# ifdef ZLIB_DLL
+# ifdef ZLIB_INTERNAL
+# define ZEXPORT __declspec(dllexport)
+# define ZEXPORTVA __declspec(dllexport)
+# else
+# define ZEXPORT __declspec(dllimport)
+# define ZEXPORTVA __declspec(dllimport)
+# endif
+# endif
+#endif
+
+#ifndef ZEXTERN
+# define ZEXTERN extern
+#endif
+#ifndef ZEXPORT
+# define ZEXPORT
+#endif
+#ifndef ZEXPORTVA
+# define ZEXPORTVA
+#endif
+
+#ifndef FAR
+# define FAR
+#endif
+
+#if !defined(__MACTYPES__)
+typedef unsigned char Byte; /* 8 bits */
+#endif
+typedef unsigned int uInt; /* 16 bits or more */
+typedef unsigned long uLong; /* 32 bits or more */
+
+#ifdef SMALL_MEDIUM
+ /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */
+# define Bytef Byte FAR
+#else
+ typedef Byte FAR Bytef;
+#endif
+typedef char FAR charf;
+typedef int FAR intf;
+typedef uInt FAR uIntf;
+typedef uLong FAR uLongf;
+
+#ifdef STDC
+ typedef void const *voidpc;
+ typedef void FAR *voidpf;
+ typedef void *voidp;
+#else
+ typedef Byte const *voidpc;
+ typedef Byte FAR *voidpf;
+ typedef Byte *voidp;
+#endif
+
+#if 0 /* HAVE_UNISTD_H -- this line is updated by ./configure */
+# include <sys/types.h> /* for off_t */
+# include <unistd.h> /* for SEEK_* and off_t */
+# ifdef VMS
+# include <unixio.h> /* for off_t */
+# endif
+# define z_off_t off_t
+#endif
+#ifndef SEEK_SET
+# define SEEK_SET 0 /* Seek from beginning of file. */
+# define SEEK_CUR 1 /* Seek from current position. */
+# define SEEK_END 2 /* Set file pointer to EOF plus "offset" */
+#endif
+#ifndef z_off_t
+# define z_off_t long
+#endif
+
+#if defined(__OS400__)
+# define NO_vsnprintf
+#endif
+
+#if defined(__MVS__)
+# define NO_vsnprintf
+# ifdef FAR
+# undef FAR
+# endif
+#endif
+
+/* MVS linker does not support external names larger than 8 bytes */
+#if defined(__MVS__)
+# pragma map(deflateInit_,"DEIN")
+# pragma map(deflateInit2_,"DEIN2")
+# pragma map(deflateEnd,"DEEND")
+# pragma map(deflateBound,"DEBND")
+# pragma map(inflateInit_,"ININ")
+# pragma map(inflateInit2_,"ININ2")
+# pragma map(inflateEnd,"INEND")
+# pragma map(inflateSync,"INSY")
+# pragma map(inflateSetDictionary,"INSEDI")
+# pragma map(compressBound,"CMBND")
+# pragma map(inflate_table,"INTABL")
+# pragma map(inflate_fast,"INFA")
+# pragma map(inflate_copyright,"INCOPY")
+#endif
+
+#endif /* ZCONF_H */
-/* zlib.h -- interface of the 'zlib' general purpose compression library\r
- version 1.2.3, July 18th, 2005\r
-\r
- Copyright (C) 1995-2005 Jean-loup Gailly and Mark Adler\r
-\r
- This software is provided 'as-is', without any express or implied\r
- warranty. In no event will the authors be held liable for any damages\r
- arising from the use of this software.\r
-\r
- Permission is granted to anyone to use this software for any purpose,\r
- including commercial applications, and to alter it and redistribute it\r
- freely, subject to the following restrictions:\r
-\r
- 1. The origin of this software must not be misrepresented; you must not\r
- claim that you wrote the original software. If you use this software\r
- in a product, an acknowledgment in the product documentation would be\r
- appreciated but is not required.\r
- 2. Altered source versions must be plainly marked as such, and must not be\r
- misrepresented as being the original software.\r
- 3. This notice may not be removed or altered from any source distribution.\r
-\r
- Jean-loup Gailly Mark Adler\r
- jloup@gzip.org madler@alumni.caltech.edu\r
-\r
-\r
- The data format used by the zlib library is described by RFCs (Request for\r
- Comments) 1950 to 1952 in the files http://www.ietf.org/rfc/rfc1950.txt\r
- (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).\r
-*/\r
-\r
-#ifndef ZLIB_H\r
-#define ZLIB_H\r
-\r
-#include "zconf.h"\r
-\r
-#ifdef __cplusplus\r
-extern "C" {\r
-#endif\r
-\r
-#define ZLIB_VERSION "1.2.3"\r
-#define ZLIB_VERNUM 0x1230\r
-\r
-/*\r
- The 'zlib' compression library provides in-memory compression and\r
- decompression functions, including integrity checks of the uncompressed\r
- data. This version of the library supports only one compression method\r
- (deflation) but other algorithms will be added later and will have the same\r
- stream interface.\r
-\r
- Compression can be done in a single step if the buffers are large\r
- enough (for example if an input file is mmap'ed), or can be done by\r
- repeated calls of the compression function. In the latter case, the\r
- application must provide more input and/or consume the output\r
- (providing more output space) before each call.\r
-\r
- The compressed data format used by default by the in-memory functions is\r
- the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped\r
- around a deflate stream, which is itself documented in RFC 1951.\r
-\r
- The library also supports reading and writing files in gzip (.gz) format\r
- with an interface similar to that of stdio using the functions that start\r
- with "gz". The gzip format is different from the zlib format. gzip is a\r
- gzip wrapper, documented in RFC 1952, wrapped around a deflate stream.\r
-\r
- This library can optionally read and write gzip streams in memory as well.\r
-\r
- The zlib format was designed to be compact and fast for use in memory\r
- and on communications channels. The gzip format was designed for single-\r
- file compression on file systems, has a larger header than zlib to maintain\r
- directory information, and uses a different, slower check method than zlib.\r
-\r
- The library does not install any signal handler. The decoder checks\r
- the consistency of the compressed data, so the library should never\r
- crash even in case of corrupted input.\r
-*/\r
-\r
-typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size));\r
-typedef void (*free_func) OF((voidpf opaque, voidpf address));\r
-\r
-struct internal_state;\r
-\r
-typedef struct z_stream_s {\r
- Bytef *next_in; /* next input byte */\r
- uInt avail_in; /* number of bytes available at next_in */\r
- uLong total_in; /* total nb of input bytes read so far */\r
-\r
- Bytef *next_out; /* next output byte should be put there */\r
- uInt avail_out; /* remaining free space at next_out */\r
- uLong total_out; /* total nb of bytes output so far */\r
-\r
- char *msg; /* last error message, NULL if no error */\r
- struct internal_state FAR *state; /* not visible by applications */\r
-\r
- alloc_func zalloc; /* used to allocate the internal state */\r
- free_func zfree; /* used to free the internal state */\r
- voidpf opaque; /* private data object passed to zalloc and zfree */\r
-\r
- int data_type; /* best guess about the data type: binary or text */\r
- uLong adler; /* adler32 value of the uncompressed data */\r
- uLong reserved; /* reserved for future use */\r
-} z_stream;\r
-\r
-typedef z_stream FAR *z_streamp;\r
-\r
-/*\r
- gzip header information passed to and from zlib routines. See RFC 1952\r
- for more details on the meanings of these fields.\r
-*/\r
-typedef struct gz_header_s {\r
- int text; /* true if compressed data believed to be text */\r
- uLong time; /* modification time */\r
- int xflags; /* extra flags (not used when writing a gzip file) */\r
- int os; /* operating system */\r
- Bytef *extra; /* pointer to extra field or Z_NULL if none */\r
- uInt extra_len; /* extra field length (valid if extra != Z_NULL) */\r
- uInt extra_max; /* space at extra (only when reading header) */\r
- Bytef *name; /* pointer to zero-terminated file name or Z_NULL */\r
- uInt name_max; /* space at name (only when reading header) */\r
- Bytef *comment; /* pointer to zero-terminated comment or Z_NULL */\r
- uInt comm_max; /* space at comment (only when reading header) */\r
- int hcrc; /* true if there was or will be a header crc */\r
- int done; /* true when done reading gzip header (not used\r
- when writing a gzip file) */\r
-} gz_header;\r
-\r
-typedef gz_header FAR *gz_headerp;\r
-\r
-/*\r
- The application must update next_in and avail_in when avail_in has\r
- dropped to zero. It must update next_out and avail_out when avail_out\r
- has dropped to zero. The application must initialize zalloc, zfree and\r
- opaque before calling the init function. All other fields are set by the\r
- compression library and must not be updated by the application.\r
-\r
- The opaque value provided by the application will be passed as the first\r
- parameter for calls of zalloc and zfree. This can be useful for custom\r
- memory management. The compression library attaches no meaning to the\r
- opaque value.\r
-\r
- zalloc must return Z_NULL if there is not enough memory for the object.\r
- If zlib is used in a multi-threaded application, zalloc and zfree must be\r
- thread safe.\r
-\r
- On 16-bit systems, the functions zalloc and zfree must be able to allocate\r
- exactly 65536 bytes, but will not be required to allocate more than this\r
- if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS,\r
- pointers returned by zalloc for objects of exactly 65536 bytes *must*\r
- have their offset normalized to zero. The default allocation function\r
- provided by this library ensures this (see zutil.c). To reduce memory\r
- requirements and avoid any allocation of 64K objects, at the expense of\r
- compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h).\r
-\r
- The fields total_in and total_out can be used for statistics or\r
- progress reports. After compression, total_in holds the total size of\r
- the uncompressed data and may be saved for use in the decompressor\r
- (particularly if the decompressor wants to decompress everything in\r
- a single step).\r
-*/\r
-\r
- /* constants */\r
-\r
-#define Z_NO_FLUSH 0\r
-#define Z_PARTIAL_FLUSH 1 /* will be removed, use Z_SYNC_FLUSH instead */\r
-#define Z_SYNC_FLUSH 2\r
-#define Z_FULL_FLUSH 3\r
-#define Z_FINISH 4\r
-#define Z_BLOCK 5\r
-/* Allowed flush values; see deflate() and inflate() below for details */\r
-\r
-#define Z_OK 0\r
-#define Z_STREAM_END 1\r
-#define Z_NEED_DICT 2\r
-#define Z_ERRNO (-1)\r
-#define Z_STREAM_ERROR (-2)\r
-#define Z_DATA_ERROR (-3)\r
-#define Z_MEM_ERROR (-4)\r
-#define Z_BUF_ERROR (-5)\r
-#define Z_VERSION_ERROR (-6)\r
-/* Return codes for the compression/decompression functions. Negative\r
- * values are errors, positive values are used for special but normal events.\r
- */\r
-\r
-#define Z_NO_COMPRESSION 0\r
-#define Z_BEST_SPEED 1\r
-#define Z_BEST_COMPRESSION 9\r
-#define Z_DEFAULT_COMPRESSION (-1)\r
-/* compression levels */\r
-\r
-#define Z_FILTERED 1\r
-#define Z_HUFFMAN_ONLY 2\r
-#define Z_RLE 3\r
-#define Z_FIXED 4\r
-#define Z_DEFAULT_STRATEGY 0\r
-/* compression strategy; see deflateInit2() below for details */\r
-\r
-#define Z_BINARY 0\r
-#define Z_TEXT 1\r
-#define Z_ASCII Z_TEXT /* for compatibility with 1.2.2 and earlier */\r
-#define Z_UNKNOWN 2\r
-/* Possible values of the data_type field (though see inflate()) */\r
-\r
-#define Z_DEFLATED 8\r
-/* The deflate compression method (the only one supported in this version) */\r
-\r
-#define Z_NULL 0 /* for initializing zalloc, zfree, opaque */\r
-\r
-#define zlib_version zlibVersion()\r
-/* for compatibility with versions < 1.0.2 */\r
-\r
- /* basic functions */\r
-\r
-ZEXTERN const char * ZEXPORT zlibVersion OF((void));\r
-/* The application can compare zlibVersion and ZLIB_VERSION for consistency.\r
- If the first character differs, the library code actually used is\r
- not compatible with the zlib.h header file used by the application.\r
- This check is automatically made by deflateInit and inflateInit.\r
- */\r
-\r
-/*\r
-ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level));\r
-\r
- Initializes the internal stream state for compression. The fields\r
- zalloc, zfree and opaque must be initialized before by the caller.\r
- If zalloc and zfree are set to Z_NULL, deflateInit updates them to\r
- use default allocation functions.\r
-\r
- The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9:\r
- 1 gives best speed, 9 gives best compression, 0 gives no compression at\r
- all (the input data is simply copied a block at a time).\r
- Z_DEFAULT_COMPRESSION requests a default compromise between speed and\r
- compression (currently equivalent to level 6).\r
-\r
- deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not\r
- enough memory, Z_STREAM_ERROR if level is not a valid compression level,\r
- Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible\r
- with the version assumed by the caller (ZLIB_VERSION).\r
- msg is set to null if there is no error message. deflateInit does not\r
- perform any compression: this will be done by deflate().\r
-*/\r
-\r
-\r
-ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush));\r
-/*\r
- deflate compresses as much data as possible, and stops when the input\r
- buffer becomes empty or the output buffer becomes full. It may introduce some\r
- output latency (reading input without producing any output) except when\r
- forced to flush.\r
-\r
- The detailed semantics are as follows. deflate performs one or both of the\r
- following actions:\r
-\r
- - Compress more input starting at next_in and update next_in and avail_in\r
- accordingly. If not all input can be processed (because there is not\r
- enough room in the output buffer), next_in and avail_in are updated and\r
- processing will resume at this point for the next call of deflate().\r
-\r
- - Provide more output starting at next_out and update next_out and avail_out\r
- accordingly. This action is forced if the parameter flush is non zero.\r
- Forcing flush frequently degrades the compression ratio, so this parameter\r
- should be set only when necessary (in interactive applications).\r
- Some output may be provided even if flush is not set.\r
-\r
- Before the call of deflate(), the application should ensure that at least\r
- one of the actions is possible, by providing more input and/or consuming\r
- more output, and updating avail_in or avail_out accordingly; avail_out\r
- should never be zero before the call. The application can consume the\r
- compressed output when it wants, for example when the output buffer is full\r
- (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK\r
- and with zero avail_out, it must be called again after making room in the\r
- output buffer because there might be more output pending.\r
-\r
- Normally the parameter flush is set to Z_NO_FLUSH, which allows deflate to\r
- decide how much data to accumualte before producing output, in order to\r
- maximize compression.\r
-\r
- If the parameter flush is set to Z_SYNC_FLUSH, all pending output is\r
- flushed to the output buffer and the output is aligned on a byte boundary, so\r
- that the decompressor can get all input data available so far. (In particular\r
- avail_in is zero after the call if enough output space has been provided\r
- before the call.) Flushing may degrade compression for some compression\r
- algorithms and so it should be used only when necessary.\r
-\r
- If flush is set to Z_FULL_FLUSH, all output is flushed as with\r
- Z_SYNC_FLUSH, and the compression state is reset so that decompression can\r
- restart from this point if previous compressed data has been damaged or if\r
- random access is desired. Using Z_FULL_FLUSH too often can seriously degrade\r
- compression.\r
-\r
- If deflate returns with avail_out == 0, this function must be called again\r
- with the same value of the flush parameter and more output space (updated\r
- avail_out), until the flush is complete (deflate returns with non-zero\r
- avail_out). In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that\r
- avail_out is greater than six to avoid repeated flush markers due to\r
- avail_out == 0 on return.\r
-\r
- If the parameter flush is set to Z_FINISH, pending input is processed,\r
- pending output is flushed and deflate returns with Z_STREAM_END if there\r
- was enough output space; if deflate returns with Z_OK, this function must be\r
- called again with Z_FINISH and more output space (updated avail_out) but no\r
- more input data, until it returns with Z_STREAM_END or an error. After\r
- deflate has returned Z_STREAM_END, the only possible operations on the\r
- stream are deflateReset or deflateEnd.\r
-\r
- Z_FINISH can be used immediately after deflateInit if all the compression\r
- is to be done in a single step. In this case, avail_out must be at least\r
- the value returned by deflateBound (see below). If deflate does not return\r
- Z_STREAM_END, then it must be called again as described above.\r
-\r
- deflate() sets strm->adler to the adler32 checksum of all input read\r
- so far (that is, total_in bytes).\r
-\r
- deflate() may update strm->data_type if it can make a good guess about\r
- the input data type (Z_BINARY or Z_TEXT). In doubt, the data is considered\r
- binary. This field is only for information purposes and does not affect\r
- the compression algorithm in any manner.\r
-\r
- deflate() returns Z_OK if some progress has been made (more input\r
- processed or more output produced), Z_STREAM_END if all input has been\r
- consumed and all output has been produced (only when flush is set to\r
- Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example\r
- if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible\r
- (for example avail_in or avail_out was zero). Note that Z_BUF_ERROR is not\r
- fatal, and deflate() can be called again with more input and more output\r
- space to continue compressing.\r
-*/\r
-\r
-\r
-ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm));\r
-/*\r
- All dynamically allocated data structures for this stream are freed.\r
- This function discards any unprocessed input and does not flush any\r
- pending output.\r
-\r
- deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the\r
- stream state was inconsistent, Z_DATA_ERROR if the stream was freed\r
- prematurely (some input or output was discarded). In the error case,\r
- msg may be set but then points to a static string (which must not be\r
- deallocated).\r
-*/\r
-\r
-\r
-/*\r
-ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm));\r
-\r
- Initializes the internal stream state for decompression. The fields\r
- next_in, avail_in, zalloc, zfree and opaque must be initialized before by\r
- the caller. If next_in is not Z_NULL and avail_in is large enough (the exact\r
- value depends on the compression method), inflateInit determines the\r
- compression method from the zlib header and allocates all data structures\r
- accordingly; otherwise the allocation will be deferred to the first call of\r
- inflate. If zalloc and zfree are set to Z_NULL, inflateInit updates them to\r
- use default allocation functions.\r
-\r
- inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
- memory, Z_VERSION_ERROR if the zlib library version is incompatible with the\r
- version assumed by the caller. msg is set to null if there is no error\r
- message. inflateInit does not perform any decompression apart from reading\r
- the zlib header if present: this will be done by inflate(). (So next_in and\r
- avail_in may be modified, but next_out and avail_out are unchanged.)\r
-*/\r
-\r
-\r
-ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush));\r
-/*\r
- inflate decompresses as much data as possible, and stops when the input\r
- buffer becomes empty or the output buffer becomes full. It may introduce\r
- some output latency (reading input without producing any output) except when\r
- forced to flush.\r
-\r
- The detailed semantics are as follows. inflate performs one or both of the\r
- following actions:\r
-\r
- - Decompress more input starting at next_in and update next_in and avail_in\r
- accordingly. If not all input can be processed (because there is not\r
- enough room in the output buffer), next_in is updated and processing\r
- will resume at this point for the next call of inflate().\r
-\r
- - Provide more output starting at next_out and update next_out and avail_out\r
- accordingly. inflate() provides as much output as possible, until there\r
- is no more input data or no more space in the output buffer (see below\r
- about the flush parameter).\r
-\r
- Before the call of inflate(), the application should ensure that at least\r
- one of the actions is possible, by providing more input and/or consuming\r
- more output, and updating the next_* and avail_* values accordingly.\r
- The application can consume the uncompressed output when it wants, for\r
- example when the output buffer is full (avail_out == 0), or after each\r
- call of inflate(). If inflate returns Z_OK and with zero avail_out, it\r
- must be called again after making room in the output buffer because there\r
- might be more output pending.\r
-\r
- The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH,\r
- Z_FINISH, or Z_BLOCK. Z_SYNC_FLUSH requests that inflate() flush as much\r
- output as possible to the output buffer. Z_BLOCK requests that inflate() stop\r
- if and when it gets to the next deflate block boundary. When decoding the\r
- zlib or gzip format, this will cause inflate() to return immediately after\r
- the header and before the first block. When doing a raw inflate, inflate()\r
- will go ahead and process the first block, and will return when it gets to\r
- the end of that block, or when it runs out of data.\r
-\r
- The Z_BLOCK option assists in appending to or combining deflate streams.\r
- Also to assist in this, on return inflate() will set strm->data_type to the\r
- number of unused bits in the last byte taken from strm->next_in, plus 64\r
- if inflate() is currently decoding the last block in the deflate stream,\r
- plus 128 if inflate() returned immediately after decoding an end-of-block\r
- code or decoding the complete header up to just before the first byte of the\r
- deflate stream. The end-of-block will not be indicated until all of the\r
- uncompressed data from that block has been written to strm->next_out. The\r
- number of unused bits may in general be greater than seven, except when\r
- bit 7 of data_type is set, in which case the number of unused bits will be\r
- less than eight.\r
-\r
- inflate() should normally be called until it returns Z_STREAM_END or an\r
- error. However if all decompression is to be performed in a single step\r
- (a single call of inflate), the parameter flush should be set to\r
- Z_FINISH. In this case all pending input is processed and all pending\r
- output is flushed; avail_out must be large enough to hold all the\r
- uncompressed data. (The size of the uncompressed data may have been saved\r
- by the compressor for this purpose.) The next operation on this stream must\r
- be inflateEnd to deallocate the decompression state. The use of Z_FINISH\r
- is never required, but can be used to inform inflate that a faster approach\r
- may be used for the single inflate() call.\r
-\r
- In this implementation, inflate() always flushes as much output as\r
- possible to the output buffer, and always uses the faster approach on the\r
- first call. So the only effect of the flush parameter in this implementation\r
- is on the return value of inflate(), as noted below, or when it returns early\r
- because Z_BLOCK is used.\r
-\r
- If a preset dictionary is needed after this call (see inflateSetDictionary\r
- below), inflate sets strm->adler to the adler32 checksum of the dictionary\r
- chosen by the compressor and returns Z_NEED_DICT; otherwise it sets\r
- strm->adler to the adler32 checksum of all output produced so far (that is,\r
- total_out bytes) and returns Z_OK, Z_STREAM_END or an error code as described\r
- below. At the end of the stream, inflate() checks that its computed adler32\r
- checksum is equal to that saved by the compressor and returns Z_STREAM_END\r
- only if the checksum is correct.\r
-\r
- inflate() will decompress and check either zlib-wrapped or gzip-wrapped\r
- deflate data. The header type is detected automatically. Any information\r
- contained in the gzip header is not retained, so applications that need that\r
- information should instead use raw inflate, see inflateInit2() below, or\r
- inflateBack() and perform their own processing of the gzip header and\r
- trailer.\r
-\r
- inflate() returns Z_OK if some progress has been made (more input processed\r
- or more output produced), Z_STREAM_END if the end of the compressed data has\r
- been reached and all uncompressed output has been produced, Z_NEED_DICT if a\r
- preset dictionary is needed at this point, Z_DATA_ERROR if the input data was\r
- corrupted (input stream not conforming to the zlib format or incorrect check\r
- value), Z_STREAM_ERROR if the stream structure was inconsistent (for example\r
- if next_in or next_out was NULL), Z_MEM_ERROR if there was not enough memory,\r
- Z_BUF_ERROR if no progress is possible or if there was not enough room in the\r
- output buffer when Z_FINISH is used. Note that Z_BUF_ERROR is not fatal, and\r
- inflate() can be called again with more input and more output space to\r
- continue decompressing. If Z_DATA_ERROR is returned, the application may then\r
- call inflateSync() to look for a good compression block if a partial recovery\r
- of the data is desired.\r
-*/\r
-\r
-\r
-ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm));\r
-/*\r
- All dynamically allocated data structures for this stream are freed.\r
- This function discards any unprocessed input and does not flush any\r
- pending output.\r
-\r
- inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state\r
- was inconsistent. In the error case, msg may be set but then points to a\r
- static string (which must not be deallocated).\r
-*/\r
-\r
- /* Advanced functions */\r
-\r
-/*\r
- The following functions are needed only in some special applications.\r
-*/\r
-\r
-/*\r
-ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm,\r
- int level,\r
- int method,\r
- int windowBits,\r
- int memLevel,\r
- int strategy));\r
-\r
- This is another version of deflateInit with more compression options. The\r
- fields next_in, zalloc, zfree and opaque must be initialized before by\r
- the caller.\r
-\r
- The method parameter is the compression method. It must be Z_DEFLATED in\r
- this version of the library.\r
-\r
- The windowBits parameter is the base two logarithm of the window size\r
- (the size of the history buffer). It should be in the range 8..15 for this\r
- version of the library. Larger values of this parameter result in better\r
- compression at the expense of memory usage. The default value is 15 if\r
- deflateInit is used instead.\r
-\r
- windowBits can also be -8..-15 for raw deflate. In this case, -windowBits\r
- determines the window size. deflate() will then generate raw deflate data\r
- with no zlib header or trailer, and will not compute an adler32 check value.\r
-\r
- windowBits can also be greater than 15 for optional gzip encoding. Add\r
- 16 to windowBits to write a simple gzip header and trailer around the\r
- compressed data instead of a zlib wrapper. The gzip header will have no\r
- file name, no extra data, no comment, no modification time (set to zero),\r
- no header crc, and the operating system will be set to 255 (unknown). If a\r
- gzip stream is being written, strm->adler is a crc32 instead of an adler32.\r
-\r
- The memLevel parameter specifies how much memory should be allocated\r
- for the internal compression state. memLevel=1 uses minimum memory but\r
- is slow and reduces compression ratio; memLevel=9 uses maximum memory\r
- for optimal speed. The default value is 8. See zconf.h for total memory\r
- usage as a function of windowBits and memLevel.\r
-\r
- The strategy parameter is used to tune the compression algorithm. Use the\r
- value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a\r
- filter (or predictor), Z_HUFFMAN_ONLY to force Huffman encoding only (no\r
- string match), or Z_RLE to limit match distances to one (run-length\r
- encoding). Filtered data consists mostly of small values with a somewhat\r
- random distribution. In this case, the compression algorithm is tuned to\r
- compress them better. The effect of Z_FILTERED is to force more Huffman\r
- coding and less string matching; it is somewhat intermediate between\r
- Z_DEFAULT and Z_HUFFMAN_ONLY. Z_RLE is designed to be almost as fast as\r
- Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy\r
- parameter only affects the compression ratio but not the correctness of the\r
- compressed output even if it is not set appropriately. Z_FIXED prevents the\r
- use of dynamic Huffman codes, allowing for a simpler decoder for special\r
- applications.\r
-\r
- deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
- memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid\r
- method). msg is set to null if there is no error message. deflateInit2 does\r
- not perform any compression: this will be done by deflate().\r
-*/\r
-\r
-ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm,\r
- const Bytef *dictionary,\r
- uInt dictLength));\r
-/*\r
- Initializes the compression dictionary from the given byte sequence\r
- without producing any compressed output. This function must be called\r
- immediately after deflateInit, deflateInit2 or deflateReset, before any\r
- call of deflate. The compressor and decompressor must use exactly the same\r
- dictionary (see inflateSetDictionary).\r
-\r
- The dictionary should consist of strings (byte sequences) that are likely\r
- to be encountered later in the data to be compressed, with the most commonly\r
- used strings preferably put towards the end of the dictionary. Using a\r
- dictionary is most useful when the data to be compressed is short and can be\r
- predicted with good accuracy; the data can then be compressed better than\r
- with the default empty dictionary.\r
-\r
- Depending on the size of the compression data structures selected by\r
- deflateInit or deflateInit2, a part of the dictionary may in effect be\r
- discarded, for example if the dictionary is larger than the window size in\r
- deflate or deflate2. Thus the strings most likely to be useful should be\r
- put at the end of the dictionary, not at the front. In addition, the\r
- current implementation of deflate will use at most the window size minus\r
- 262 bytes of the provided dictionary.\r
-\r
- Upon return of this function, strm->adler is set to the adler32 value\r
- of the dictionary; the decompressor may later use this value to determine\r
- which dictionary has been used by the compressor. (The adler32 value\r
- applies to the whole dictionary even if only a subset of the dictionary is\r
- actually used by the compressor.) If a raw deflate was requested, then the\r
- adler32 value is not computed and strm->adler is not set.\r
-\r
- deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a\r
- parameter is invalid (such as NULL dictionary) or the stream state is\r
- inconsistent (for example if deflate has already been called for this stream\r
- or if the compression method is bsort). deflateSetDictionary does not\r
- perform any compression: this will be done by deflate().\r
-*/\r
-\r
-ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest,\r
- z_streamp source));\r
-/*\r
- Sets the destination stream as a complete copy of the source stream.\r
-\r
- This function can be useful when several compression strategies will be\r
- tried, for example when there are several ways of pre-processing the input\r
- data with a filter. The streams that will be discarded should then be freed\r
- by calling deflateEnd. Note that deflateCopy duplicates the internal\r
- compression state which can be quite large, so this strategy is slow and\r
- can consume lots of memory.\r
-\r
- deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not\r
- enough memory, Z_STREAM_ERROR if the source stream state was inconsistent\r
- (such as zalloc being NULL). msg is left unchanged in both source and\r
- destination.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm));\r
-/*\r
- This function is equivalent to deflateEnd followed by deflateInit,\r
- but does not free and reallocate all the internal compression state.\r
- The stream will keep the same compression level and any other attributes\r
- that may have been set by deflateInit2.\r
-\r
- deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source\r
- stream state was inconsistent (such as zalloc or state being NULL).\r
-*/\r
-\r
-ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm,\r
- int level,\r
- int strategy));\r
-/*\r
- Dynamically update the compression level and compression strategy. The\r
- interpretation of level and strategy is as in deflateInit2. This can be\r
- used to switch between compression and straight copy of the input data, or\r
- to switch to a different kind of input data requiring a different\r
- strategy. If the compression level is changed, the input available so far\r
- is compressed with the old level (and may be flushed); the new level will\r
- take effect only at the next call of deflate().\r
-\r
- Before the call of deflateParams, the stream state must be set as for\r
- a call of deflate(), since the currently available input may have to\r
- be compressed and flushed. In particular, strm->avail_out must be non-zero.\r
-\r
- deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source\r
- stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR\r
- if strm->avail_out was zero.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm,\r
- int good_length,\r
- int max_lazy,\r
- int nice_length,\r
- int max_chain));\r
-/*\r
- Fine tune deflate's internal compression parameters. This should only be\r
- used by someone who understands the algorithm used by zlib's deflate for\r
- searching for the best matching string, and even then only by the most\r
- fanatic optimizer trying to squeeze out the last compressed bit for their\r
- specific input data. Read the deflate.c source code for the meaning of the\r
- max_lazy, good_length, nice_length, and max_chain parameters.\r
-\r
- deflateTune() can be called after deflateInit() or deflateInit2(), and\r
- returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream.\r
- */\r
-\r
-ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm,\r
- uLong sourceLen));\r
-/*\r
- deflateBound() returns an upper bound on the compressed size after\r
- deflation of sourceLen bytes. It must be called after deflateInit()\r
- or deflateInit2(). This would be used to allocate an output buffer\r
- for deflation in a single pass, and so would be called before deflate().\r
-*/\r
-\r
-ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm,\r
- int bits,\r
- int value));\r
-/*\r
- deflatePrime() inserts bits in the deflate output stream. The intent\r
- is that this function is used to start off the deflate output with the\r
- bits leftover from a previous deflate stream when appending to it. As such,\r
- this function can only be used for raw deflate, and must be used before the\r
- first deflate() call after a deflateInit2() or deflateReset(). bits must be\r
- less than or equal to 16, and that many of the least significant bits of\r
- value will be inserted in the output.\r
-\r
- deflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source\r
- stream state was inconsistent.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm,\r
- gz_headerp head));\r
-/*\r
- deflateSetHeader() provides gzip header information for when a gzip\r
- stream is requested by deflateInit2(). deflateSetHeader() may be called\r
- after deflateInit2() or deflateReset() and before the first call of\r
- deflate(). The text, time, os, extra field, name, and comment information\r
- in the provided gz_header structure are written to the gzip header (xflag is\r
- ignored -- the extra flags are set according to the compression level). The\r
- caller must assure that, if not Z_NULL, name and comment are terminated with\r
- a zero byte, and that if extra is not Z_NULL, that extra_len bytes are\r
- available there. If hcrc is true, a gzip header crc is included. Note that\r
- the current versions of the command-line version of gzip (up through version\r
- 1.3.x) do not support header crc's, and will report that it is a "multi-part\r
- gzip file" and give up.\r
-\r
- If deflateSetHeader is not used, the default gzip header has text false,\r
- the time set to zero, and os set to 255, with no extra, name, or comment\r
- fields. The gzip header is returned to the default state by deflateReset().\r
-\r
- deflateSetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source\r
- stream state was inconsistent.\r
-*/\r
-\r
-/*\r
-ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm,\r
- int windowBits));\r
-\r
- This is another version of inflateInit with an extra parameter. The\r
- fields next_in, avail_in, zalloc, zfree and opaque must be initialized\r
- before by the caller.\r
-\r
- The windowBits parameter is the base two logarithm of the maximum window\r
- size (the size of the history buffer). It should be in the range 8..15 for\r
- this version of the library. The default value is 15 if inflateInit is used\r
- instead. windowBits must be greater than or equal to the windowBits value\r
- provided to deflateInit2() while compressing, or it must be equal to 15 if\r
- deflateInit2() was not used. If a compressed stream with a larger window\r
- size is given as input, inflate() will return with the error code\r
- Z_DATA_ERROR instead of trying to allocate a larger window.\r
-\r
- windowBits can also be -8..-15 for raw inflate. In this case, -windowBits\r
- determines the window size. inflate() will then process raw deflate data,\r
- not looking for a zlib or gzip header, not generating a check value, and not\r
- looking for any check values for comparison at the end of the stream. This\r
- is for use with other formats that use the deflate compressed data format\r
- such as zip. Those formats provide their own check values. If a custom\r
- format is developed using the raw deflate format for compressed data, it is\r
- recommended that a check value such as an adler32 or a crc32 be applied to\r
- the uncompressed data as is done in the zlib, gzip, and zip formats. For\r
- most applications, the zlib format should be used as is. Note that comments\r
- above on the use in deflateInit2() applies to the magnitude of windowBits.\r
-\r
- windowBits can also be greater than 15 for optional gzip decoding. Add\r
- 32 to windowBits to enable zlib and gzip decoding with automatic header\r
- detection, or add 16 to decode only the gzip format (the zlib format will\r
- return a Z_DATA_ERROR). If a gzip stream is being decoded, strm->adler is\r
- a crc32 instead of an adler32.\r
-\r
- inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
- memory, Z_STREAM_ERROR if a parameter is invalid (such as a null strm). msg\r
- is set to null if there is no error message. inflateInit2 does not perform\r
- any decompression apart from reading the zlib header if present: this will\r
- be done by inflate(). (So next_in and avail_in may be modified, but next_out\r
- and avail_out are unchanged.)\r
-*/\r
-\r
-ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm,\r
- const Bytef *dictionary,\r
- uInt dictLength));\r
-/*\r
- Initializes the decompression dictionary from the given uncompressed byte\r
- sequence. This function must be called immediately after a call of inflate,\r
- if that call returned Z_NEED_DICT. The dictionary chosen by the compressor\r
- can be determined from the adler32 value returned by that call of inflate.\r
- The compressor and decompressor must use exactly the same dictionary (see\r
- deflateSetDictionary). For raw inflate, this function can be called\r
- immediately after inflateInit2() or inflateReset() and before any call of\r
- inflate() to set the dictionary. The application must insure that the\r
- dictionary that was used for compression is provided.\r
-\r
- inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a\r
- parameter is invalid (such as NULL dictionary) or the stream state is\r
- inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the\r
- expected one (incorrect adler32 value). inflateSetDictionary does not\r
- perform any decompression: this will be done by subsequent calls of\r
- inflate().\r
-*/\r
-\r
-ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm));\r
-/*\r
- Skips invalid compressed data until a full flush point (see above the\r
- description of deflate with Z_FULL_FLUSH) can be found, or until all\r
- available input is skipped. No output is provided.\r
-\r
- inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR\r
- if no more input was provided, Z_DATA_ERROR if no flush point has been found,\r
- or Z_STREAM_ERROR if the stream structure was inconsistent. In the success\r
- case, the application may save the current current value of total_in which\r
- indicates where valid compressed data was found. In the error case, the\r
- application may repeatedly call inflateSync, providing more input each time,\r
- until success or end of the input data.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest,\r
- z_streamp source));\r
-/*\r
- Sets the destination stream as a complete copy of the source stream.\r
-\r
- This function can be useful when randomly accessing a large stream. The\r
- first pass through the stream can periodically record the inflate state,\r
- allowing restarting inflate at those points when randomly accessing the\r
- stream.\r
-\r
- inflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not\r
- enough memory, Z_STREAM_ERROR if the source stream state was inconsistent\r
- (such as zalloc being NULL). msg is left unchanged in both source and\r
- destination.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm));\r
-/*\r
- This function is equivalent to inflateEnd followed by inflateInit,\r
- but does not free and reallocate all the internal decompression state.\r
- The stream will keep attributes that may have been set by inflateInit2.\r
-\r
- inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source\r
- stream state was inconsistent (such as zalloc or state being NULL).\r
-*/\r
-\r
-ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm,\r
- int bits,\r
- int value));\r
-/*\r
- This function inserts bits in the inflate input stream. The intent is\r
- that this function is used to start inflating at a bit position in the\r
- middle of a byte. The provided bits will be used before any bytes are used\r
- from next_in. This function should only be used with raw inflate, and\r
- should be used before the first inflate() call after inflateInit2() or\r
- inflateReset(). bits must be less than or equal to 16, and that many of the\r
- least significant bits of value will be inserted in the input.\r
-\r
- inflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source\r
- stream state was inconsistent.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm,\r
- gz_headerp head));\r
-/*\r
- inflateGetHeader() requests that gzip header information be stored in the\r
- provided gz_header structure. inflateGetHeader() may be called after\r
- inflateInit2() or inflateReset(), and before the first call of inflate().\r
- As inflate() processes the gzip stream, head->done is zero until the header\r
- is completed, at which time head->done is set to one. If a zlib stream is\r
- being decoded, then head->done is set to -1 to indicate that there will be\r
- no gzip header information forthcoming. Note that Z_BLOCK can be used to\r
- force inflate() to return immediately after header processing is complete\r
- and before any actual data is decompressed.\r
-\r
- The text, time, xflags, and os fields are filled in with the gzip header\r
- contents. hcrc is set to true if there is a header CRC. (The header CRC\r
- was valid if done is set to one.) If extra is not Z_NULL, then extra_max\r
- contains the maximum number of bytes to write to extra. Once done is true,\r
- extra_len contains the actual extra field length, and extra contains the\r
- extra field, or that field truncated if extra_max is less than extra_len.\r
- If name is not Z_NULL, then up to name_max characters are written there,\r
- terminated with a zero unless the length is greater than name_max. If\r
- comment is not Z_NULL, then up to comm_max characters are written there,\r
- terminated with a zero unless the length is greater than comm_max. When\r
- any of extra, name, or comment are not Z_NULL and the respective field is\r
- not present in the header, then that field is set to Z_NULL to signal its\r
- absence. This allows the use of deflateSetHeader() with the returned\r
- structure to duplicate the header. However if those fields are set to\r
- allocated memory, then the application will need to save those pointers\r
- elsewhere so that they can be eventually freed.\r
-\r
- If inflateGetHeader is not used, then the header information is simply\r
- discarded. The header is always checked for validity, including the header\r
- CRC if present. inflateReset() will reset the process to discard the header\r
- information. The application would need to call inflateGetHeader() again to\r
- retrieve the header from the next gzip stream.\r
-\r
- inflateGetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source\r
- stream state was inconsistent.\r
-*/\r
-\r
-/*\r
-ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits,\r
- unsigned char FAR *window));\r
-\r
- Initialize the internal stream state for decompression using inflateBack()\r
- calls. The fields zalloc, zfree and opaque in strm must be initialized\r
- before the call. If zalloc and zfree are Z_NULL, then the default library-\r
- derived memory allocation routines are used. windowBits is the base two\r
- logarithm of the window size, in the range 8..15. window is a caller\r
- supplied buffer of that size. Except for special applications where it is\r
- assured that deflate was used with small window sizes, windowBits must be 15\r
- and a 32K byte window must be supplied to be able to decompress general\r
- deflate streams.\r
-\r
- See inflateBack() for the usage of these routines.\r
-\r
- inflateBackInit will return Z_OK on success, Z_STREAM_ERROR if any of\r
- the paramaters are invalid, Z_MEM_ERROR if the internal state could not\r
- be allocated, or Z_VERSION_ERROR if the version of the library does not\r
- match the version of the header file.\r
-*/\r
-\r
-typedef unsigned (*in_func) OF((void FAR *, unsigned char FAR * FAR *));\r
-typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned));\r
-\r
-ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm,\r
- in_func in, void FAR *in_desc,\r
- out_func out, void FAR *out_desc));\r
-/*\r
- inflateBack() does a raw inflate with a single call using a call-back\r
- interface for input and output. This is more efficient than inflate() for\r
- file i/o applications in that it avoids copying between the output and the\r
- sliding window by simply making the window itself the output buffer. This\r
- function trusts the application to not change the output buffer passed by\r
- the output function, at least until inflateBack() returns.\r
-\r
- inflateBackInit() must be called first to allocate the internal state\r
- and to initialize the state with the user-provided window buffer.\r
- inflateBack() may then be used multiple times to inflate a complete, raw\r
- deflate stream with each call. inflateBackEnd() is then called to free\r
- the allocated state.\r
-\r
- A raw deflate stream is one with no zlib or gzip header or trailer.\r
- This routine would normally be used in a utility that reads zip or gzip\r
- files and writes out uncompressed files. The utility would decode the\r
- header and process the trailer on its own, hence this routine expects\r
- only the raw deflate stream to decompress. This is different from the\r
- normal behavior of inflate(), which expects either a zlib or gzip header and\r
- trailer around the deflate stream.\r
-\r
- inflateBack() uses two subroutines supplied by the caller that are then\r
- called by inflateBack() for input and output. inflateBack() calls those\r
- routines until it reads a complete deflate stream and writes out all of the\r
- uncompressed data, or until it encounters an error. The function's\r
- parameters and return types are defined above in the in_func and out_func\r
- typedefs. inflateBack() will call in(in_desc, &buf) which should return the\r
- number of bytes of provided input, and a pointer to that input in buf. If\r
- there is no input available, in() must return zero--buf is ignored in that\r
- case--and inflateBack() will return a buffer error. inflateBack() will call\r
- out(out_desc, buf, len) to write the uncompressed data buf[0..len-1]. out()\r
- should return zero on success, or non-zero on failure. If out() returns\r
- non-zero, inflateBack() will return with an error. Neither in() nor out()\r
- are permitted to change the contents of the window provided to\r
- inflateBackInit(), which is also the buffer that out() uses to write from.\r
- The length written by out() will be at most the window size. Any non-zero\r
- amount of input may be provided by in().\r
-\r
- For convenience, inflateBack() can be provided input on the first call by\r
- setting strm->next_in and strm->avail_in. If that input is exhausted, then\r
- in() will be called. Therefore strm->next_in must be initialized before\r
- calling inflateBack(). If strm->next_in is Z_NULL, then in() will be called\r
- immediately for input. If strm->next_in is not Z_NULL, then strm->avail_in\r
- must also be initialized, and then if strm->avail_in is not zero, input will\r
- initially be taken from strm->next_in[0 .. strm->avail_in - 1].\r
-\r
- The in_desc and out_desc parameters of inflateBack() is passed as the\r
- first parameter of in() and out() respectively when they are called. These\r
- descriptors can be optionally used to pass any information that the caller-\r
- supplied in() and out() functions need to do their job.\r
-\r
- On return, inflateBack() will set strm->next_in and strm->avail_in to\r
- pass back any unused input that was provided by the last in() call. The\r
- return values of inflateBack() can be Z_STREAM_END on success, Z_BUF_ERROR\r
- if in() or out() returned an error, Z_DATA_ERROR if there was a format\r
- error in the deflate stream (in which case strm->msg is set to indicate the\r
- nature of the error), or Z_STREAM_ERROR if the stream was not properly\r
- initialized. In the case of Z_BUF_ERROR, an input or output error can be\r
- distinguished using strm->next_in which will be Z_NULL only if in() returned\r
- an error. If strm->next is not Z_NULL, then the Z_BUF_ERROR was due to\r
- out() returning non-zero. (in() will always be called before out(), so\r
- strm->next_in is assured to be defined if out() returns non-zero.) Note\r
- that inflateBack() cannot return Z_OK.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm));\r
-/*\r
- All memory allocated by inflateBackInit() is freed.\r
-\r
- inflateBackEnd() returns Z_OK on success, or Z_STREAM_ERROR if the stream\r
- state was inconsistent.\r
-*/\r
-\r
-ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void));\r
-/* Return flags indicating compile-time options.\r
-\r
- Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other:\r
- 1.0: size of uInt\r
- 3.2: size of uLong\r
- 5.4: size of voidpf (pointer)\r
- 7.6: size of z_off_t\r
-\r
- Compiler, assembler, and debug options:\r
- 8: DEBUG\r
- 9: ASMV or ASMINF -- use ASM code\r
- 10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention\r
- 11: 0 (reserved)\r
-\r
- One-time table building (smaller code, but not thread-safe if true):\r
- 12: BUILDFIXED -- build static block decoding tables when needed\r
- 13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed\r
- 14,15: 0 (reserved)\r
-\r
- Library content (indicates missing functionality):\r
- 16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking\r
- deflate code when not needed)\r
- 17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect\r
- and decode gzip streams (to avoid linking crc code)\r
- 18-19: 0 (reserved)\r
-\r
- Operation variations (changes in library functionality):\r
- 20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate\r
- 21: FASTEST -- deflate algorithm with only one, lowest compression level\r
- 22,23: 0 (reserved)\r
-\r
- The sprintf variant used by gzprintf (zero is best):\r
- 24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format\r
- 25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure!\r
- 26: 0 = returns value, 1 = void -- 1 means inferred string length returned\r
-\r
- Remainder:\r
- 27-31: 0 (reserved)\r
- */\r
-\r
-\r
- /* utility functions */\r
-\r
-/*\r
- The following utility functions are implemented on top of the\r
- basic stream-oriented functions. To simplify the interface, some\r
- default options are assumed (compression level and memory usage,\r
- standard memory allocation functions). The source code of these\r
- utility functions can easily be modified if you need special options.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT compress OF((Bytef *dest, uLongf *destLen,\r
- const Bytef *source, uLong sourceLen));\r
-/*\r
- Compresses the source buffer into the destination buffer. sourceLen is\r
- the byte length of the source buffer. Upon entry, destLen is the total\r
- size of the destination buffer, which must be at least the value returned\r
- by compressBound(sourceLen). Upon exit, destLen is the actual size of the\r
- compressed buffer.\r
- This function can be used to compress a whole file at once if the\r
- input file is mmap'ed.\r
- compress returns Z_OK if success, Z_MEM_ERROR if there was not\r
- enough memory, Z_BUF_ERROR if there was not enough room in the output\r
- buffer.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT compress2 OF((Bytef *dest, uLongf *destLen,\r
- const Bytef *source, uLong sourceLen,\r
- int level));\r
-/*\r
- Compresses the source buffer into the destination buffer. The level\r
- parameter has the same meaning as in deflateInit. sourceLen is the byte\r
- length of the source buffer. Upon entry, destLen is the total size of the\r
- destination buffer, which must be at least the value returned by\r
- compressBound(sourceLen). Upon exit, destLen is the actual size of the\r
- compressed buffer.\r
-\r
- compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
- memory, Z_BUF_ERROR if there was not enough room in the output buffer,\r
- Z_STREAM_ERROR if the level parameter is invalid.\r
-*/\r
-\r
-ZEXTERN uLong ZEXPORT compressBound OF((uLong sourceLen));\r
-/*\r
- compressBound() returns an upper bound on the compressed size after\r
- compress() or compress2() on sourceLen bytes. It would be used before\r
- a compress() or compress2() call to allocate the destination buffer.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT uncompress OF((Bytef *dest, uLongf *destLen,\r
- const Bytef *source, uLong sourceLen));\r
-/*\r
- Decompresses the source buffer into the destination buffer. sourceLen is\r
- the byte length of the source buffer. Upon entry, destLen is the total\r
- size of the destination buffer, which must be large enough to hold the\r
- entire uncompressed data. (The size of the uncompressed data must have\r
- been saved previously by the compressor and transmitted to the decompressor\r
- by some mechanism outside the scope of this compression library.)\r
- Upon exit, destLen is the actual size of the compressed buffer.\r
- This function can be used to decompress a whole file at once if the\r
- input file is mmap'ed.\r
-\r
- uncompress returns Z_OK if success, Z_MEM_ERROR if there was not\r
- enough memory, Z_BUF_ERROR if there was not enough room in the output\r
- buffer, or Z_DATA_ERROR if the input data was corrupted or incomplete.\r
-*/\r
-\r
-\r
-typedef voidp gzFile;\r
-\r
-ZEXTERN gzFile ZEXPORT gzopen OF((const char *path, const char *mode));\r
-/*\r
- Opens a gzip (.gz) file for reading or writing. The mode parameter\r
- is as in fopen ("rb" or "wb") but can also include a compression level\r
- ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for\r
- Huffman only compression as in "wb1h", or 'R' for run-length encoding\r
- as in "wb1R". (See the description of deflateInit2 for more information\r
- about the strategy parameter.)\r
-\r
- gzopen can be used to read a file which is not in gzip format; in this\r
- case gzread will directly read from the file without decompression.\r
-\r
- gzopen returns NULL if the file could not be opened or if there was\r
- insufficient memory to allocate the (de)compression state; errno\r
- can be checked to distinguish the two cases (if errno is zero, the\r
- zlib error is Z_MEM_ERROR). */\r
-\r
-ZEXTERN gzFile ZEXPORT gzdopen OF((int fd, const char *mode));\r
-/*\r
- gzdopen() associates a gzFile with the file descriptor fd. File\r
- descriptors are obtained from calls like open, dup, creat, pipe or\r
- fileno (in the file has been previously opened with fopen).\r
- The mode parameter is as in gzopen.\r
- The next call of gzclose on the returned gzFile will also close the\r
- file descriptor fd, just like fclose(fdopen(fd), mode) closes the file\r
- descriptor fd. If you want to keep fd open, use gzdopen(dup(fd), mode).\r
- gzdopen returns NULL if there was insufficient memory to allocate\r
- the (de)compression state.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy));\r
-/*\r
- Dynamically update the compression level or strategy. See the description\r
- of deflateInit2 for the meaning of these parameters.\r
- gzsetparams returns Z_OK if success, or Z_STREAM_ERROR if the file was not\r
- opened for writing.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzread OF((gzFile file, voidp buf, unsigned len));\r
-/*\r
- Reads the given number of uncompressed bytes from the compressed file.\r
- If the input file was not in gzip format, gzread copies the given number\r
- of bytes into the buffer.\r
- gzread returns the number of uncompressed bytes actually read (0 for\r
- end of file, -1 for error). */\r
-\r
-ZEXTERN int ZEXPORT gzwrite OF((gzFile file,\r
- voidpc buf, unsigned len));\r
-/*\r
- Writes the given number of uncompressed bytes into the compressed file.\r
- gzwrite returns the number of uncompressed bytes actually written\r
- (0 in case of error).\r
-*/\r
-\r
-ZEXTERN int ZEXPORTVA gzprintf OF((gzFile file, const char *format, ...));\r
-/*\r
- Converts, formats, and writes the args to the compressed file under\r
- control of the format string, as in fprintf. gzprintf returns the number of\r
- uncompressed bytes actually written (0 in case of error). The number of\r
- uncompressed bytes written is limited to 4095. The caller should assure that\r
- this limit is not exceeded. If it is exceeded, then gzprintf() will return\r
- return an error (0) with nothing written. In this case, there may also be a\r
- buffer overflow with unpredictable consequences, which is possible only if\r
- zlib was compiled with the insecure functions sprintf() or vsprintf()\r
- because the secure snprintf() or vsnprintf() functions were not available.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s));\r
-/*\r
- Writes the given null-terminated string to the compressed file, excluding\r
- the terminating null character.\r
- gzputs returns the number of characters written, or -1 in case of error.\r
-*/\r
-\r
-ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len));\r
-/*\r
- Reads bytes from the compressed file until len-1 characters are read, or\r
- a newline character is read and transferred to buf, or an end-of-file\r
- condition is encountered. The string is then terminated with a null\r
- character.\r
- gzgets returns buf, or Z_NULL in case of error.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzputc OF((gzFile file, int c));\r
-/*\r
- Writes c, converted to an unsigned char, into the compressed file.\r
- gzputc returns the value that was written, or -1 in case of error.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzgetc OF((gzFile file));\r
-/*\r
- Reads one byte from the compressed file. gzgetc returns this byte\r
- or -1 in case of end of file or error.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzungetc OF((int c, gzFile file));\r
-/*\r
- Push one character back onto the stream to be read again later.\r
- Only one character of push-back is allowed. gzungetc() returns the\r
- character pushed, or -1 on failure. gzungetc() will fail if a\r
- character has been pushed but not read yet, or if c is -1. The pushed\r
- character will be discarded if the stream is repositioned with gzseek()\r
- or gzrewind().\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzflush OF((gzFile file, int flush));\r
-/*\r
- Flushes all pending output into the compressed file. The parameter\r
- flush is as in the deflate() function. The return value is the zlib\r
- error number (see function gzerror below). gzflush returns Z_OK if\r
- the flush parameter is Z_FINISH and all output could be flushed.\r
- gzflush should be called only when strictly necessary because it can\r
- degrade compression.\r
-*/\r
-\r
-ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile file,\r
- z_off_t offset, int whence));\r
-/*\r
- Sets the starting position for the next gzread or gzwrite on the\r
- given compressed file. The offset represents a number of bytes in the\r
- uncompressed data stream. The whence parameter is defined as in lseek(2);\r
- the value SEEK_END is not supported.\r
- If the file is opened for reading, this function is emulated but can be\r
- extremely slow. If the file is opened for writing, only forward seeks are\r
- supported; gzseek then compresses a sequence of zeroes up to the new\r
- starting position.\r
-\r
- gzseek returns the resulting offset location as measured in bytes from\r
- the beginning of the uncompressed stream, or -1 in case of error, in\r
- particular if the file is opened for writing and the new starting position\r
- would be before the current position.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzrewind OF((gzFile file));\r
-/*\r
- Rewinds the given file. This function is supported only for reading.\r
-\r
- gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET)\r
-*/\r
-\r
-ZEXTERN z_off_t ZEXPORT gztell OF((gzFile file));\r
-/*\r
- Returns the starting position for the next gzread or gzwrite on the\r
- given compressed file. This position represents a number of bytes in the\r
- uncompressed data stream.\r
-\r
- gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR)\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzeof OF((gzFile file));\r
-/*\r
- Returns 1 when EOF has previously been detected reading the given\r
- input stream, otherwise zero.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzdirect OF((gzFile file));\r
-/*\r
- Returns 1 if file is being read directly without decompression, otherwise\r
- zero.\r
-*/\r
-\r
-ZEXTERN int ZEXPORT gzclose OF((gzFile file));\r
-/*\r
- Flushes all pending output if necessary, closes the compressed file\r
- and deallocates all the (de)compression state. The return value is the zlib\r
- error number (see function gzerror below).\r
-*/\r
-\r
-ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum));\r
-/*\r
- Returns the error message for the last error which occurred on the\r
- given compressed file. errnum is set to zlib error number. If an\r
- error occurred in the file system and not in the compression library,\r
- errnum is set to Z_ERRNO and the application may consult errno\r
- to get the exact error code.\r
-*/\r
-\r
-ZEXTERN void ZEXPORT gzclearerr OF((gzFile file));\r
-/*\r
- Clears the error and end-of-file flags for file. This is analogous to the\r
- clearerr() function in stdio. This is useful for continuing to read a gzip\r
- file that is being written concurrently.\r
-*/\r
-\r
- /* checksum functions */\r
-\r
-/*\r
- These functions are not related to compression but are exported\r
- anyway because they might be useful in applications using the\r
- compression library.\r
-*/\r
-\r
-ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len));\r
-/*\r
- Update a running Adler-32 checksum with the bytes buf[0..len-1] and\r
- return the updated checksum. If buf is NULL, this function returns\r
- the required initial value for the checksum.\r
- An Adler-32 checksum is almost as reliable as a CRC32 but can be computed\r
- much faster. Usage example:\r
-\r
- uLong adler = adler32(0L, Z_NULL, 0);\r
-\r
- while (read_buffer(buffer, length) != EOF) {\r
- adler = adler32(adler, buffer, length);\r
- }\r
- if (adler != original_adler) error();\r
-*/\r
-\r
-ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2,\r
- z_off_t len2));\r
-/*\r
- Combine two Adler-32 checksums into one. For two sequences of bytes, seq1\r
- and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for\r
- each, adler1 and adler2. adler32_combine() returns the Adler-32 checksum of\r
- seq1 and seq2 concatenated, requiring only adler1, adler2, and len2.\r
-*/\r
-\r
-ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len));\r
-/*\r
- Update a running CRC-32 with the bytes buf[0..len-1] and return the\r
- updated CRC-32. If buf is NULL, this function returns the required initial\r
- value for the for the crc. Pre- and post-conditioning (one's complement) is\r
- performed within this function so it shouldn't be done by the application.\r
- Usage example:\r
-\r
- uLong crc = crc32(0L, Z_NULL, 0);\r
-\r
- while (read_buffer(buffer, length) != EOF) {\r
- crc = crc32(crc, buffer, length);\r
- }\r
- if (crc != original_crc) error();\r
-*/\r
-\r
-ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2));\r
-\r
-/*\r
- Combine two CRC-32 check values into one. For two sequences of bytes,\r
- seq1 and seq2 with lengths len1 and len2, CRC-32 check values were\r
- calculated for each, crc1 and crc2. crc32_combine() returns the CRC-32\r
- check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and\r
- len2.\r
-*/\r
-\r
-\r
- /* various hacks, don't look :) */\r
-\r
-/* deflateInit and inflateInit are macros to allow checking the zlib version\r
- * and the compiler's view of z_stream:\r
- */\r
-ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level,\r
- const char *version, int stream_size));\r
-ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm,\r
- const char *version, int stream_size));\r
-ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int level, int method,\r
- int windowBits, int memLevel,\r
- int strategy, const char *version,\r
- int stream_size));\r
-ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int windowBits,\r
- const char *version, int stream_size));\r
-ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits,\r
- unsigned char FAR *window,\r
- const char *version,\r
- int stream_size));\r
-#define deflateInit(strm, level) \\r
- deflateInit_((strm), (level), ZLIB_VERSION, sizeof(z_stream))\r
-#define inflateInit(strm) \\r
- inflateInit_((strm), ZLIB_VERSION, sizeof(z_stream))\r
-#define deflateInit2(strm, level, method, windowBits, memLevel, strategy) \\r
- deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\\r
- (strategy), ZLIB_VERSION, sizeof(z_stream))\r
-#define inflateInit2(strm, windowBits) \\r
- inflateInit2_((strm), (windowBits), ZLIB_VERSION, sizeof(z_stream))\r
-#define inflateBackInit(strm, windowBits, window) \\r
- inflateBackInit_((strm), (windowBits), (window), \\r
- ZLIB_VERSION, sizeof(z_stream))\r
-\r
-\r
-#if !defined(ZUTIL_H) && !defined(NO_DUMMY_DECL)\r
- struct internal_state {int dummy;}; /* hack for buggy compilers */\r
-#endif\r
-\r
-ZEXTERN const char * ZEXPORT zError OF((int));\r
-ZEXTERN int ZEXPORT inflateSyncPoint OF((z_streamp z));\r
-ZEXTERN const uLongf * ZEXPORT get_crc_table OF((void));\r
-\r
-#ifdef __cplusplus\r
-}\r
-#endif\r
-\r
-#endif /* ZLIB_H */\r
+/* zlib.h -- interface of the 'zlib' general purpose compression library
+ version 1.2.3, July 18th, 2005
+
+ Copyright (C) 1995-2005 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 http://www.ietf.org/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.2.3"
+#define ZLIB_VERNUM 0x1230
+
+/*
+ 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 compressed data format used by default by the in-memory functions is
+ the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped
+ around a deflate stream, which is itself documented in RFC 1951.
+
+ The library also supports reading and writing files in gzip (.gz) format
+ with an interface similar to that of stdio using the functions that start
+ with "gz". The gzip format is different from the zlib format. gzip is a
+ gzip wrapper, documented in RFC 1952, wrapped around a deflate stream.
+
+ This library can optionally read and write gzip streams in memory as well.
+
+ The zlib format was designed to be compact and fast for use in memory
+ and on communications channels. The gzip format was designed for single-
+ file compression on file systems, has a larger header than zlib to maintain
+ directory information, and uses a different, slower check method than zlib.
+
+ 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: binary or text */
+ uLong adler; /* adler32 value of the uncompressed data */
+ uLong reserved; /* reserved for future use */
+} z_stream;
+
+typedef z_stream FAR *z_streamp;
+
+/*
+ gzip header information passed to and from zlib routines. See RFC 1952
+ for more details on the meanings of these fields.
+*/
+typedef struct gz_header_s {
+ int text; /* true if compressed data believed to be text */
+ uLong time; /* modification time */
+ int xflags; /* extra flags (not used when writing a gzip file) */
+ int os; /* operating system */
+ Bytef *extra; /* pointer to extra field or Z_NULL if none */
+ uInt extra_len; /* extra field length (valid if extra != Z_NULL) */
+ uInt extra_max; /* space at extra (only when reading header) */
+ Bytef *name; /* pointer to zero-terminated file name or Z_NULL */
+ uInt name_max; /* space at name (only when reading header) */
+ Bytef *comment; /* pointer to zero-terminated comment or Z_NULL */
+ uInt comm_max; /* space at comment (only when reading header) */
+ int hcrc; /* true if there was or will be a header crc */
+ int done; /* true when done reading gzip header (not used
+ when writing a gzip file) */
+} gz_header;
+
+typedef gz_header FAR *gz_headerp;
+
+/*
+ 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
+#define Z_BLOCK 5
+/* Allowed flush values; see deflate() and inflate() 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_RLE 3
+#define Z_FIXED 4
+#define Z_DEFAULT_STRATEGY 0
+/* compression strategy; see deflateInit2() below for details */
+
+#define Z_BINARY 0
+#define Z_TEXT 1
+#define Z_ASCII Z_TEXT /* for compatibility with 1.2.2 and earlier */
+#define Z_UNKNOWN 2
+/* Possible values of the data_type field (though see inflate()) */
+
+#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.
+
+ Normally the parameter flush is set to Z_NO_FLUSH, which allows deflate to
+ decide how much data to accumualte before producing output, in order to
+ maximize compression.
+
+ 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
+ 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). In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that
+ avail_out is greater than six to avoid repeated flush markers due to
+ avail_out == 0 on return.
+
+ 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
+ the value returned by deflateBound (see below). 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 strm->data_type if it can make a good guess about
+ the input data type (Z_BINARY or Z_TEXT). 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). Note that Z_BUF_ERROR is not
+ fatal, and deflate() can be called again with more input and more output
+ space to continue compressing.
+*/
+
+
+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 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.
+
+ The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH,
+ Z_FINISH, or Z_BLOCK. Z_SYNC_FLUSH requests that inflate() flush as much
+ output as possible to the output buffer. Z_BLOCK requests that inflate() stop
+ if and when it gets to the next deflate block boundary. When decoding the
+ zlib or gzip format, this will cause inflate() to return immediately after
+ the header and before the first block. When doing a raw inflate, inflate()
+ will go ahead and process the first block, and will return when it gets to
+ the end of that block, or when it runs out of data.
+
+ The Z_BLOCK option assists in appending to or combining deflate streams.
+ Also to assist in this, on return inflate() will set strm->data_type to the
+ number of unused bits in the last byte taken from strm->next_in, plus 64
+ if inflate() is currently decoding the last block in the deflate stream,
+ plus 128 if inflate() returned immediately after decoding an end-of-block
+ code or decoding the complete header up to just before the first byte of the
+ deflate stream. The end-of-block will not be indicated until all of the
+ uncompressed data from that block has been written to strm->next_out. The
+ number of unused bits may in general be greater than seven, except when
+ bit 7 of data_type is set, in which case the number of unused bits will be
+ less than eight.
+
+ 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 approach
+ may be used for the single inflate() call.
+
+ In this implementation, inflate() always flushes as much output as
+ possible to the output buffer, and always uses the faster approach on the
+ first call. So the only effect of the flush parameter in this implementation
+ is on the return value of inflate(), as noted below, or when it returns early
+ because Z_BLOCK is used.
+
+ If a preset dictionary is needed after this call (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() will decompress and check either zlib-wrapped or gzip-wrapped
+ deflate data. The header type is detected automatically. Any information
+ contained in the gzip header is not retained, so applications that need that
+ information should instead use raw inflate, see inflateInit2() below, or
+ inflateBack() and perform their own processing of the gzip header and
+ trailer.
+
+ 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 check
+ value), 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. Note that Z_BUF_ERROR is not fatal, and
+ inflate() can be called again with more input and more output space to
+ continue decompressing. If Z_DATA_ERROR is returned, the application may then
+ call inflateSync() to look for a good compression block if a partial recovery
+ of the data is desired.
+*/
+
+
+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.
+
+ windowBits can also be -8..-15 for raw deflate. In this case, -windowBits
+ determines the window size. deflate() will then generate raw deflate data
+ with no zlib header or trailer, and will not compute an adler32 check value.
+
+ windowBits can also be greater than 15 for optional gzip encoding. Add
+ 16 to windowBits to write a simple gzip header and trailer around the
+ compressed data instead of a zlib wrapper. The gzip header will have no
+ file name, no extra data, no comment, no modification time (set to zero),
+ no header crc, and the operating system will be set to 255 (unknown). If a
+ gzip stream is being written, strm->adler is a crc32 instead of an adler32.
+
+ 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), Z_HUFFMAN_ONLY to force Huffman encoding only (no
+ string match), or Z_RLE to limit match distances to one (run-length
+ encoding). 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. Z_RLE is designed to be almost as fast as
+ Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy
+ parameter only affects the compression ratio but not the correctness of the
+ compressed output even if it is not set appropriately. Z_FIXED prevents the
+ use of dynamic Huffman codes, allowing for a simpler decoder for special
+ applications.
+
+ 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. In addition, the
+ current implementation of deflate will use at most the window size minus
+ 262 bytes of the provided dictionary.
+
+ 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.) If a raw deflate was requested, then the
+ adler32 value is not computed and strm->adler is not set.
+
+ 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 deflateTune OF((z_streamp strm,
+ int good_length,
+ int max_lazy,
+ int nice_length,
+ int max_chain));
+/*
+ Fine tune deflate's internal compression parameters. This should only be
+ used by someone who understands the algorithm used by zlib's deflate for
+ searching for the best matching string, and even then only by the most
+ fanatic optimizer trying to squeeze out the last compressed bit for their
+ specific input data. Read the deflate.c source code for the meaning of the
+ max_lazy, good_length, nice_length, and max_chain parameters.
+
+ deflateTune() can be called after deflateInit() or deflateInit2(), and
+ returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream.
+ */
+
+ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm,
+ uLong sourceLen));
+/*
+ deflateBound() returns an upper bound on the compressed size after
+ deflation of sourceLen bytes. It must be called after deflateInit()
+ or deflateInit2(). This would be used to allocate an output buffer
+ for deflation in a single pass, and so would be called before deflate().
+*/
+
+ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm,
+ int bits,
+ int value));
+/*
+ deflatePrime() inserts bits in the deflate output stream. The intent
+ is that this function is used to start off the deflate output with the
+ bits leftover from a previous deflate stream when appending to it. As such,
+ this function can only be used for raw deflate, and must be used before the
+ first deflate() call after a deflateInit2() or deflateReset(). bits must be
+ less than or equal to 16, and that many of the least significant bits of
+ value will be inserted in the output.
+
+ deflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source
+ stream state was inconsistent.
+*/
+
+ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm,
+ gz_headerp head));
+/*
+ deflateSetHeader() provides gzip header information for when a gzip
+ stream is requested by deflateInit2(). deflateSetHeader() may be called
+ after deflateInit2() or deflateReset() and before the first call of
+ deflate(). The text, time, os, extra field, name, and comment information
+ in the provided gz_header structure are written to the gzip header (xflag is
+ ignored -- the extra flags are set according to the compression level). The
+ caller must assure that, if not Z_NULL, name and comment are terminated with
+ a zero byte, and that if extra is not Z_NULL, that extra_len bytes are
+ available there. If hcrc is true, a gzip header crc is included. Note that
+ the current versions of the command-line version of gzip (up through version
+ 1.3.x) do not support header crc's, and will report that it is a "multi-part
+ gzip file" and give up.
+
+ If deflateSetHeader is not used, the default gzip header has text false,
+ the time set to zero, and os set to 255, with no extra, name, or comment
+ fields. The gzip header is returned to the default state by deflateReset().
+
+ deflateSetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source
+ stream state was inconsistent.
+*/
+
+/*
+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. windowBits must be greater than or equal to the windowBits value
+ provided to deflateInit2() while compressing, or it must be equal to 15 if
+ deflateInit2() was not used. 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.
+
+ windowBits can also be -8..-15 for raw inflate. In this case, -windowBits
+ determines the window size. inflate() will then process raw deflate data,
+ not looking for a zlib or gzip header, not generating a check value, and not
+ looking for any check values for comparison at the end of the stream. This
+ is for use with other formats that use the deflate compressed data format
+ such as zip. Those formats provide their own check values. If a custom
+ format is developed using the raw deflate format for compressed data, it is
+ recommended that a check value such as an adler32 or a crc32 be applied to
+ the uncompressed data as is done in the zlib, gzip, and zip formats. For
+ most applications, the zlib format should be used as is. Note that comments
+ above on the use in deflateInit2() applies to the magnitude of windowBits.
+
+ windowBits can also be greater than 15 for optional gzip decoding. Add
+ 32 to windowBits to enable zlib and gzip decoding with automatic header
+ detection, or add 16 to decode only the gzip format (the zlib format will
+ return a Z_DATA_ERROR). If a gzip stream is being decoded, strm->adler is
+ a crc32 instead of an adler32.
+
+ 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 null strm). 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 that call returned Z_NEED_DICT. The dictionary chosen by the compressor
+ can be determined from the adler32 value returned by that call of inflate.
+ The compressor and decompressor must use exactly the same dictionary (see
+ deflateSetDictionary). For raw inflate, this function can be called
+ immediately after inflateInit2() or inflateReset() and before any call of
+ inflate() to set the dictionary. The application must insure that the
+ dictionary that was used for compression is provided.
+
+ 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 inflateCopy 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 randomly accessing a large stream. The
+ first pass through the stream can periodically record the inflate state,
+ allowing restarting inflate at those points when randomly accessing the
+ stream.
+
+ inflateCopy 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 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).
+*/
+
+ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm,
+ int bits,
+ int value));
+/*
+ This function inserts bits in the inflate input stream. The intent is
+ that this function is used to start inflating at a bit position in the
+ middle of a byte. The provided bits will be used before any bytes are used
+ from next_in. This function should only be used with raw inflate, and
+ should be used before the first inflate() call after inflateInit2() or
+ inflateReset(). bits must be less than or equal to 16, and that many of the
+ least significant bits of value will be inserted in the input.
+
+ inflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source
+ stream state was inconsistent.
+*/
+
+ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm,
+ gz_headerp head));
+/*
+ inflateGetHeader() requests that gzip header information be stored in the
+ provided gz_header structure. inflateGetHeader() may be called after
+ inflateInit2() or inflateReset(), and before the first call of inflate().
+ As inflate() processes the gzip stream, head->done is zero until the header
+ is completed, at which time head->done is set to one. If a zlib stream is
+ being decoded, then head->done is set to -1 to indicate that there will be
+ no gzip header information forthcoming. Note that Z_BLOCK can be used to
+ force inflate() to return immediately after header processing is complete
+ and before any actual data is decompressed.
+
+ The text, time, xflags, and os fields are filled in with the gzip header
+ contents. hcrc is set to true if there is a header CRC. (The header CRC
+ was valid if done is set to one.) If extra is not Z_NULL, then extra_max
+ contains the maximum number of bytes to write to extra. Once done is true,
+ extra_len contains the actual extra field length, and extra contains the
+ extra field, or that field truncated if extra_max is less than extra_len.
+ If name is not Z_NULL, then up to name_max characters are written there,
+ terminated with a zero unless the length is greater than name_max. If
+ comment is not Z_NULL, then up to comm_max characters are written there,
+ terminated with a zero unless the length is greater than comm_max. When
+ any of extra, name, or comment are not Z_NULL and the respective field is
+ not present in the header, then that field is set to Z_NULL to signal its
+ absence. This allows the use of deflateSetHeader() with the returned
+ structure to duplicate the header. However if those fields are set to
+ allocated memory, then the application will need to save those pointers
+ elsewhere so that they can be eventually freed.
+
+ If inflateGetHeader is not used, then the header information is simply
+ discarded. The header is always checked for validity, including the header
+ CRC if present. inflateReset() will reset the process to discard the header
+ information. The application would need to call inflateGetHeader() again to
+ retrieve the header from the next gzip stream.
+
+ inflateGetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source
+ stream state was inconsistent.
+*/
+
+/*
+ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits,
+ unsigned char FAR *window));
+
+ Initialize the internal stream state for decompression using inflateBack()
+ calls. The fields zalloc, zfree and opaque in strm must be initialized
+ before the call. If zalloc and zfree are Z_NULL, then the default library-
+ derived memory allocation routines are used. windowBits is the base two
+ logarithm of the window size, in the range 8..15. window is a caller
+ supplied buffer of that size. Except for special applications where it is
+ assured that deflate was used with small window sizes, windowBits must be 15
+ and a 32K byte window must be supplied to be able to decompress general
+ deflate streams.
+
+ See inflateBack() for the usage of these routines.
+
+ inflateBackInit will return Z_OK on success, Z_STREAM_ERROR if any of
+ the paramaters are invalid, Z_MEM_ERROR if the internal state could not
+ be allocated, or Z_VERSION_ERROR if the version of the library does not
+ match the version of the header file.
+*/
+
+typedef unsigned (*in_func) OF((void FAR *, unsigned char FAR * FAR *));
+typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned));
+
+ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm,
+ in_func in, void FAR *in_desc,
+ out_func out, void FAR *out_desc));
+/*
+ inflateBack() does a raw inflate with a single call using a call-back
+ interface for input and output. This is more efficient than inflate() for
+ file i/o applications in that it avoids copying between the output and the
+ sliding window by simply making the window itself the output buffer. This
+ function trusts the application to not change the output buffer passed by
+ the output function, at least until inflateBack() returns.
+
+ inflateBackInit() must be called first to allocate the internal state
+ and to initialize the state with the user-provided window buffer.
+ inflateBack() may then be used multiple times to inflate a complete, raw
+ deflate stream with each call. inflateBackEnd() is then called to free
+ the allocated state.
+
+ A raw deflate stream is one with no zlib or gzip header or trailer.
+ This routine would normally be used in a utility that reads zip or gzip
+ files and writes out uncompressed files. The utility would decode the
+ header and process the trailer on its own, hence this routine expects
+ only the raw deflate stream to decompress. This is different from the
+ normal behavior of inflate(), which expects either a zlib or gzip header and
+ trailer around the deflate stream.
+
+ inflateBack() uses two subroutines supplied by the caller that are then
+ called by inflateBack() for input and output. inflateBack() calls those
+ routines until it reads a complete deflate stream and writes out all of the
+ uncompressed data, or until it encounters an error. The function's
+ parameters and return types are defined above in the in_func and out_func
+ typedefs. inflateBack() will call in(in_desc, &buf) which should return the
+ number of bytes of provided input, and a pointer to that input in buf. If
+ there is no input available, in() must return zero--buf is ignored in that
+ case--and inflateBack() will return a buffer error. inflateBack() will call
+ out(out_desc, buf, len) to write the uncompressed data buf[0..len-1]. out()
+ should return zero on success, or non-zero on failure. If out() returns
+ non-zero, inflateBack() will return with an error. Neither in() nor out()
+ are permitted to change the contents of the window provided to
+ inflateBackInit(), which is also the buffer that out() uses to write from.
+ The length written by out() will be at most the window size. Any non-zero
+ amount of input may be provided by in().
+
+ For convenience, inflateBack() can be provided input on the first call by
+ setting strm->next_in and strm->avail_in. If that input is exhausted, then
+ in() will be called. Therefore strm->next_in must be initialized before
+ calling inflateBack(). If strm->next_in is Z_NULL, then in() will be called
+ immediately for input. If strm->next_in is not Z_NULL, then strm->avail_in
+ must also be initialized, and then if strm->avail_in is not zero, input will
+ initially be taken from strm->next_in[0 .. strm->avail_in - 1].
+
+ The in_desc and out_desc parameters of inflateBack() is passed as the
+ first parameter of in() and out() respectively when they are called. These
+ descriptors can be optionally used to pass any information that the caller-
+ supplied in() and out() functions need to do their job.
+
+ On return, inflateBack() will set strm->next_in and strm->avail_in to
+ pass back any unused input that was provided by the last in() call. The
+ return values of inflateBack() can be Z_STREAM_END on success, Z_BUF_ERROR
+ if in() or out() returned an error, Z_DATA_ERROR if there was a format
+ error in the deflate stream (in which case strm->msg is set to indicate the
+ nature of the error), or Z_STREAM_ERROR if the stream was not properly
+ initialized. In the case of Z_BUF_ERROR, an input or output error can be
+ distinguished using strm->next_in which will be Z_NULL only if in() returned
+ an error. If strm->next is not Z_NULL, then the Z_BUF_ERROR was due to
+ out() returning non-zero. (in() will always be called before out(), so
+ strm->next_in is assured to be defined if out() returns non-zero.) Note
+ that inflateBack() cannot return Z_OK.
+*/
+
+ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm));
+/*
+ All memory allocated by inflateBackInit() is freed.
+
+ inflateBackEnd() returns Z_OK on success, or Z_STREAM_ERROR if the stream
+ state was inconsistent.
+*/
+
+ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void));
+/* Return flags indicating compile-time options.
+
+ Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other:
+ 1.0: size of uInt
+ 3.2: size of uLong
+ 5.4: size of voidpf (pointer)
+ 7.6: size of z_off_t
+
+ Compiler, assembler, and debug options:
+ 8: DEBUG
+ 9: ASMV or ASMINF -- use ASM code
+ 10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention
+ 11: 0 (reserved)
+
+ One-time table building (smaller code, but not thread-safe if true):
+ 12: BUILDFIXED -- build static block decoding tables when needed
+ 13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed
+ 14,15: 0 (reserved)
+
+ Library content (indicates missing functionality):
+ 16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking
+ deflate code when not needed)
+ 17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect
+ and decode gzip streams (to avoid linking crc code)
+ 18-19: 0 (reserved)
+
+ Operation variations (changes in library functionality):
+ 20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate
+ 21: FASTEST -- deflate algorithm with only one, lowest compression level
+ 22,23: 0 (reserved)
+
+ The sprintf variant used by gzprintf (zero is best):
+ 24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format
+ 25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure!
+ 26: 0 = returns value, 1 = void -- 1 means inferred string length returned
+
+ Remainder:
+ 27-31: 0 (reserved)
+ */
+
+
+ /* 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 the value returned
+ by compressBound(sourceLen). 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 the value returned by
+ compressBound(sourceLen). 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 uLong ZEXPORT compressBound OF((uLong sourceLen));
+/*
+ compressBound() returns an upper bound on the compressed size after
+ compress() or compress2() on sourceLen bytes. It would be used before
+ a compress() or compress2() call to allocate the destination buffer.
+*/
+
+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 or incomplete.
+*/
+
+
+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", or 'R' for run-length encoding
+ as in "wb1R". (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,
+ voidpc 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). The number of
+ uncompressed bytes written is limited to 4095. The caller should assure that
+ this limit is not exceeded. If it is exceeded, then gzprintf() will return
+ return an error (0) with nothing written. In this case, there may also be a
+ buffer overflow with unpredictable consequences, which is possible only if
+ zlib was compiled with the insecure functions sprintf() or vsprintf()
+ because the secure snprintf() or vsnprintf() functions were not available.
+*/
+
+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 gzungetc OF((int c, gzFile file));
+/*
+ Push one character back onto the stream to be read again later.
+ Only one character of push-back is allowed. gzungetc() returns the
+ character pushed, or -1 on failure. gzungetc() will fail if a
+ character has been pushed but not read yet, or if c is -1. The pushed
+ character will be discarded if the stream is repositioned with gzseek()
+ or gzrewind().
+*/
+
+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 gzdirect OF((gzFile file));
+/*
+ Returns 1 if file is being read directly without decompression, 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.
+*/
+
+ZEXTERN void ZEXPORT gzclearerr OF((gzFile file));
+/*
+ Clears the error and end-of-file flags for file. This is analogous to the
+ clearerr() function in stdio. This is useful for continuing to read a gzip
+ file that is being written concurrently.
+*/
+
+ /* 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 adler32_combine OF((uLong adler1, uLong adler2,
+ z_off_t len2));
+/*
+ Combine two Adler-32 checksums into one. For two sequences of bytes, seq1
+ and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for
+ each, adler1 and adler2. adler32_combine() returns the Adler-32 checksum of
+ seq1 and seq2 concatenated, requiring only adler1, adler2, and len2.
+*/
+
+ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len));
+/*
+ Update a running CRC-32 with the bytes buf[0..len-1] and return the
+ updated CRC-32. If buf is NULL, this function returns the required initial
+ value for the 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();
+*/
+
+ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2));
+
+/*
+ Combine two CRC-32 check values into one. For two sequences of bytes,
+ seq1 and seq2 with lengths len1 and len2, CRC-32 check values were
+ calculated for each, crc1 and crc2. crc32_combine() returns the CRC-32
+ check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and
+ len2.
+*/
+
+
+ /* 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));
+ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits,
+ unsigned char FAR *window,
+ 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))
+#define inflateBackInit(strm, windowBits, window) \
+ inflateBackInit_((strm), (windowBits), (window), \
+ ZLIB_VERSION, sizeof(z_stream))
+
+
+#if !defined(ZUTIL_H) && !defined(NO_DUMMY_DECL)
+ struct internal_state {int dummy;}; /* hack for buggy compilers */
+#endif
+
+ZEXTERN const char * ZEXPORT zError OF((int));
+ZEXTERN int ZEXPORT inflateSyncPoint OF((z_streamp z));
+ZEXTERN const uLongf * ZEXPORT get_crc_table OF((void));
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* ZLIB_H */
-/* zutil.c -- target dependent utility functions for the compression library\r
- * Copyright (C) 1995-2005 Jean-loup Gailly.\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/* @(#) $Id$ */\r
-\r
-#include "zutil.h"\r
-\r
-#ifndef NO_DUMMY_DECL\r
-struct internal_state {int dummy;}; /* for buggy compilers */\r
-#endif\r
-\r
-const char * const z_errmsg[10] = {\r
-"need dictionary", /* Z_NEED_DICT 2 */\r
-"stream end", /* Z_STREAM_END 1 */\r
-"", /* Z_OK 0 */\r
-"file error", /* Z_ERRNO (-1) */\r
-"stream error", /* Z_STREAM_ERROR (-2) */\r
-"data error", /* Z_DATA_ERROR (-3) */\r
-"insufficient memory", /* Z_MEM_ERROR (-4) */\r
-"buffer error", /* Z_BUF_ERROR (-5) */\r
-"incompatible version",/* Z_VERSION_ERROR (-6) */\r
-""};\r
-\r
-\r
-const char * ZEXPORT zlibVersion()\r
-{\r
- return ZLIB_VERSION;\r
-}\r
-\r
-uLong ZEXPORT zlibCompileFlags()\r
-{\r
- uLong flags;\r
-\r
- flags = 0;\r
- switch (sizeof(uInt)) {\r
- case 2: break;\r
- case 4: flags += 1; break;\r
- case 8: flags += 2; break;\r
- default: flags += 3;\r
- }\r
- switch (sizeof(uLong)) {\r
- case 2: break;\r
- case 4: flags += 1 << 2; break;\r
- case 8: flags += 2 << 2; break;\r
- default: flags += 3 << 2;\r
- }\r
- switch (sizeof(voidpf)) {\r
- case 2: break;\r
- case 4: flags += 1 << 4; break;\r
- case 8: flags += 2 << 4; break;\r
- default: flags += 3 << 4;\r
- }\r
- switch (sizeof(z_off_t)) {\r
- case 2: break;\r
- case 4: flags += 1 << 6; break;\r
- case 8: flags += 2 << 6; break;\r
- default: flags += 3 << 6;\r
- }\r
-#ifdef DEBUG\r
- flags += 1 << 8;\r
-#endif\r
-#if defined(ASMV) || defined(ASMINF)\r
- flags += 1 << 9;\r
-#endif\r
-#ifdef ZLIB_WINAPI\r
- flags += 1 << 10;\r
-#endif\r
-#ifdef BUILDFIXED\r
- flags += 1 << 12;\r
-#endif\r
-#ifdef DYNAMIC_CRC_TABLE\r
- flags += 1 << 13;\r
-#endif\r
-#ifdef NO_GZCOMPRESS\r
- flags += 1L << 16;\r
-#endif\r
-#ifdef NO_GZIP\r
- flags += 1L << 17;\r
-#endif\r
-#ifdef PKZIP_BUG_WORKAROUND\r
- flags += 1L << 20;\r
-#endif\r
-#ifdef FASTEST\r
- flags += 1L << 21;\r
-#endif\r
-#ifdef STDC\r
-# ifdef NO_vsnprintf\r
- flags += 1L << 25;\r
-# ifdef HAS_vsprintf_void\r
- flags += 1L << 26;\r
-# endif\r
-# else\r
-# ifdef HAS_vsnprintf_void\r
- flags += 1L << 26;\r
-# endif\r
-# endif\r
-#else\r
- flags += 1L << 24;\r
-# ifdef NO_snprintf\r
- flags += 1L << 25;\r
-# ifdef HAS_sprintf_void\r
- flags += 1L << 26;\r
-# endif\r
-# else\r
-# ifdef HAS_snprintf_void\r
- flags += 1L << 26;\r
-# endif\r
-# endif\r
-#endif\r
- return flags;\r
-}\r
-\r
-#ifdef DEBUG\r
-\r
-# ifndef verbose\r
-# define verbose 0\r
-# endif\r
-int z_verbose = verbose;\r
-\r
-void z_error (m)\r
- char *m;\r
-{\r
- fprintf(stderr, "%s\n", m);\r
- exit(1);\r
-}\r
-#endif\r
-\r
-/* exported to allow conversion of error code to string for compress() and\r
- * uncompress()\r
- */\r
-const char * ZEXPORT zError(err)\r
- int err;\r
-{\r
- return ERR_MSG(err);\r
-}\r
-\r
-#if defined(_WIN32_WCE)\r
- /* The Microsoft C Run-Time Library for Windows CE doesn't have\r
- * errno. We define it as a global variable to simplify porting.\r
- * Its value is always 0 and should not be used.\r
- */\r
- int errno = 0;\r
-#endif\r
-\r
-#ifndef HAVE_MEMCPY\r
-\r
-void zmemcpy(dest, source, len)\r
- Bytef* dest;\r
- const Bytef* source;\r
- uInt len;\r
-{\r
- if (len == 0) return;\r
- do {\r
- *dest++ = *source++; /* ??? to be unrolled */\r
- } while (--len != 0);\r
-}\r
-\r
-int zmemcmp(s1, s2, len)\r
- const Bytef* s1;\r
- const Bytef* s2;\r
- uInt len;\r
-{\r
- uInt j;\r
-\r
- for (j = 0; j < len; j++) {\r
- if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1;\r
- }\r
- return 0;\r
-}\r
-\r
-void zmemzero(dest, len)\r
- Bytef* dest;\r
- uInt len;\r
-{\r
- if (len == 0) return;\r
- do {\r
- *dest++ = 0; /* ??? to be unrolled */\r
- } while (--len != 0);\r
-}\r
-#endif\r
-\r
-\r
-#ifdef SYS16BIT\r
-\r
-#ifdef __TURBOC__\r
-/* Turbo C in 16-bit mode */\r
-\r
-# define MY_ZCALLOC\r
-\r
-/* Turbo C malloc() does not allow dynamic allocation of 64K bytes\r
- * and farmalloc(64K) returns a pointer with an offset of 8, so we\r
- * must fix the pointer. Warning: the pointer must be put back to its\r
- * original form in order to free it, use zcfree().\r
- */\r
-\r
-#define MAX_PTR 10\r
-/* 10*64K = 640K */\r
-\r
-local int next_ptr = 0;\r
-\r
-typedef struct ptr_table_s {\r
- voidpf org_ptr;\r
- voidpf new_ptr;\r
-} ptr_table;\r
-\r
-local ptr_table table[MAX_PTR];\r
-/* This table is used to remember the original form of pointers\r
- * to large buffers (64K). Such pointers are normalized with a zero offset.\r
- * Since MSDOS is not a preemptive multitasking OS, this table is not\r
- * protected from concurrent access. This hack doesn't work anyway on\r
- * a protected system like OS/2. Use Microsoft C instead.\r
- */\r
-\r
-voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)\r
-{\r
- voidpf buf = opaque; /* just to make some compilers happy */\r
- ulg bsize = (ulg)items*size;\r
-\r
- /* If we allocate less than 65520 bytes, we assume that farmalloc\r
- * will return a usable pointer which doesn't have to be normalized.\r
- */\r
- if (bsize < 65520L) {\r
- buf = farmalloc(bsize);\r
- if (*(ush*)&buf != 0) return buf;\r
- } else {\r
- buf = farmalloc(bsize + 16L);\r
- }\r
- if (buf == NULL || next_ptr >= MAX_PTR) return NULL;\r
- table[next_ptr].org_ptr = buf;\r
-\r
- /* Normalize the pointer to seg:0 */\r
- *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;\r
- *(ush*)&buf = 0;\r
- table[next_ptr++].new_ptr = buf;\r
- return buf;\r
-}\r
-\r
-void zcfree (voidpf opaque, voidpf ptr)\r
-{\r
- int n;\r
- if (*(ush*)&ptr != 0) { /* object < 64K */\r
- farfree(ptr);\r
- return;\r
- }\r
- /* Find the original pointer */\r
- for (n = 0; n < next_ptr; n++) {\r
- if (ptr != table[n].new_ptr) continue;\r
-\r
- farfree(table[n].org_ptr);\r
- while (++n < next_ptr) {\r
- table[n-1] = table[n];\r
- }\r
- next_ptr--;\r
- return;\r
- }\r
- ptr = opaque; /* just to make some compilers happy */\r
- Assert(0, "zcfree: ptr not found");\r
-}\r
-\r
-#endif /* __TURBOC__ */\r
-\r
-\r
-#ifdef M_I86\r
-/* Microsoft C in 16-bit mode */\r
-\r
-# define MY_ZCALLOC\r
-\r
-#if (!defined(_MSC_VER) || (_MSC_VER <= 600))\r
-# define _halloc halloc\r
-# define _hfree hfree\r
-#endif\r
-\r
-voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)\r
-{\r
- if (opaque) opaque = 0; /* to make compiler happy */\r
- return _halloc((long)items, size);\r
-}\r
-\r
-void zcfree (voidpf opaque, voidpf ptr)\r
-{\r
- if (opaque) opaque = 0; /* to make compiler happy */\r
- _hfree(ptr);\r
-}\r
-\r
-#endif /* M_I86 */\r
-\r
-#endif /* SYS16BIT */\r
-\r
-\r
-#ifndef MY_ZCALLOC /* Any system without a special alloc function */\r
-\r
-#ifndef STDC\r
-extern voidp malloc OF((uInt size));\r
-extern voidp calloc OF((uInt items, uInt size));\r
-extern void free OF((voidpf ptr));\r
-#endif\r
-\r
-voidpf zcalloc (opaque, items, size)\r
- voidpf opaque;\r
- unsigned items;\r
- unsigned size;\r
-{\r
- if (opaque) items += size - size; /* make compiler happy */\r
- return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :\r
- (voidpf)calloc(items, size);\r
-}\r
-\r
-void zcfree (opaque, ptr)\r
- voidpf opaque;\r
- voidpf ptr;\r
-{\r
- free(ptr);\r
- if (opaque) return; /* make compiler happy */\r
-}\r
-\r
-#endif /* MY_ZCALLOC */\r
+/* zutil.c -- target dependent utility functions for the compression library
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#include "zutil.h"
+
+#ifndef NO_DUMMY_DECL
+struct internal_state {int dummy;}; /* for buggy compilers */
+#endif
+
+const char * const z_errmsg[10] = {
+"need dictionary", /* Z_NEED_DICT 2 */
+"stream end", /* Z_STREAM_END 1 */
+"", /* Z_OK 0 */
+"file error", /* Z_ERRNO (-1) */
+"stream error", /* Z_STREAM_ERROR (-2) */
+"data error", /* Z_DATA_ERROR (-3) */
+"insufficient memory", /* Z_MEM_ERROR (-4) */
+"buffer error", /* Z_BUF_ERROR (-5) */
+"incompatible version",/* Z_VERSION_ERROR (-6) */
+""};
+
+
+const char * ZEXPORT zlibVersion()
+{
+ return ZLIB_VERSION;
+}
+
+uLong ZEXPORT zlibCompileFlags()
+{
+ uLong flags;
+
+ flags = 0;
+ switch (sizeof(uInt)) {
+ case 2: break;
+ case 4: flags += 1; break;
+ case 8: flags += 2; break;
+ default: flags += 3;
+ }
+ switch (sizeof(uLong)) {
+ case 2: break;
+ case 4: flags += 1 << 2; break;
+ case 8: flags += 2 << 2; break;
+ default: flags += 3 << 2;
+ }
+ switch (sizeof(voidpf)) {
+ case 2: break;
+ case 4: flags += 1 << 4; break;
+ case 8: flags += 2 << 4; break;
+ default: flags += 3 << 4;
+ }
+ switch (sizeof(z_off_t)) {
+ case 2: break;
+ case 4: flags += 1 << 6; break;
+ case 8: flags += 2 << 6; break;
+ default: flags += 3 << 6;
+ }
+#ifdef DEBUG
+ flags += 1 << 8;
+#endif
+#if defined(ASMV) || defined(ASMINF)
+ flags += 1 << 9;
+#endif
+#ifdef ZLIB_WINAPI
+ flags += 1 << 10;
+#endif
+#ifdef BUILDFIXED
+ flags += 1 << 12;
+#endif
+#ifdef DYNAMIC_CRC_TABLE
+ flags += 1 << 13;
+#endif
+#ifdef NO_GZCOMPRESS
+ flags += 1L << 16;
+#endif
+#ifdef NO_GZIP
+ flags += 1L << 17;
+#endif
+#ifdef PKZIP_BUG_WORKAROUND
+ flags += 1L << 20;
+#endif
+#ifdef FASTEST
+ flags += 1L << 21;
+#endif
+#ifdef STDC
+# ifdef NO_vsnprintf
+ flags += 1L << 25;
+# ifdef HAS_vsprintf_void
+ flags += 1L << 26;
+# endif
+# else
+# ifdef HAS_vsnprintf_void
+ flags += 1L << 26;
+# endif
+# endif
+#else
+ flags += 1L << 24;
+# ifdef NO_snprintf
+ flags += 1L << 25;
+# ifdef HAS_sprintf_void
+ flags += 1L << 26;
+# endif
+# else
+# ifdef HAS_snprintf_void
+ flags += 1L << 26;
+# endif
+# endif
+#endif
+ return flags;
+}
+
+#ifdef DEBUG
+
+# ifndef verbose
+# define verbose 0
+# endif
+int z_verbose = verbose;
+
+void z_error (m)
+ char *m;
+{
+ fprintf(stderr, "%s\n", m);
+ exit(1);
+}
+#endif
+
+/* exported to allow conversion of error code to string for compress() and
+ * uncompress()
+ */
+const char * ZEXPORT zError(err)
+ int err;
+{
+ return ERR_MSG(err);
+}
+
+#if defined(_WIN32_WCE)
+ /* The Microsoft C Run-Time Library for Windows CE doesn't have
+ * errno. We define it as a global variable to simplify porting.
+ * Its value is always 0 and should not be used.
+ */
+ int errno = 0;
+#endif
+
+#ifndef HAVE_MEMCPY
+
+void zmemcpy(dest, source, len)
+ Bytef* dest;
+ const Bytef* source;
+ uInt len;
+{
+ if (len == 0) return;
+ do {
+ *dest++ = *source++; /* ??? to be unrolled */
+ } while (--len != 0);
+}
+
+int zmemcmp(s1, s2, len)
+ const Bytef* s1;
+ const Bytef* s2;
+ uInt len;
+{
+ uInt j;
+
+ for (j = 0; j < len; j++) {
+ if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1;
+ }
+ return 0;
+}
+
+void zmemzero(dest, len)
+ Bytef* dest;
+ uInt len;
+{
+ if (len == 0) return;
+ do {
+ *dest++ = 0; /* ??? to be unrolled */
+ } while (--len != 0);
+}
+#endif
+
+
+#ifdef SYS16BIT
+
+#ifdef __TURBOC__
+/* Turbo C in 16-bit mode */
+
+# define MY_ZCALLOC
+
+/* Turbo C malloc() does not allow dynamic allocation of 64K bytes
+ * and farmalloc(64K) returns a pointer with an offset of 8, so we
+ * must fix the pointer. Warning: the pointer must be put back to its
+ * original form in order to free it, use zcfree().
+ */
+
+#define MAX_PTR 10
+/* 10*64K = 640K */
+
+local int next_ptr = 0;
+
+typedef struct ptr_table_s {
+ voidpf org_ptr;
+ voidpf new_ptr;
+} ptr_table;
+
+local ptr_table table[MAX_PTR];
+/* This table is used to remember the original form of pointers
+ * to large buffers (64K). Such pointers are normalized with a zero offset.
+ * Since MSDOS is not a preemptive multitasking OS, this table is not
+ * protected from concurrent access. This hack doesn't work anyway on
+ * a protected system like OS/2. Use Microsoft C instead.
+ */
+
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
+{
+ voidpf buf = opaque; /* just to make some compilers happy */
+ ulg bsize = (ulg)items*size;
+
+ /* If we allocate less than 65520 bytes, we assume that farmalloc
+ * will return a usable pointer which doesn't have to be normalized.
+ */
+ if (bsize < 65520L) {
+ buf = farmalloc(bsize);
+ if (*(ush*)&buf != 0) return buf;
+ } else {
+ buf = farmalloc(bsize + 16L);
+ }
+ if (buf == NULL || next_ptr >= MAX_PTR) return NULL;
+ table[next_ptr].org_ptr = buf;
+
+ /* Normalize the pointer to seg:0 */
+ *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
+ *(ush*)&buf = 0;
+ table[next_ptr++].new_ptr = buf;
+ return buf;
+}
+
+void zcfree (voidpf opaque, voidpf ptr)
+{
+ int n;
+ if (*(ush*)&ptr != 0) { /* object < 64K */
+ farfree(ptr);
+ return;
+ }
+ /* Find the original pointer */
+ for (n = 0; n < next_ptr; n++) {
+ if (ptr != table[n].new_ptr) continue;
+
+ farfree(table[n].org_ptr);
+ while (++n < next_ptr) {
+ table[n-1] = table[n];
+ }
+ next_ptr--;
+ return;
+ }
+ ptr = opaque; /* just to make some compilers happy */
+ Assert(0, "zcfree: ptr not found");
+}
+
+#endif /* __TURBOC__ */
+
+
+#ifdef M_I86
+/* Microsoft C in 16-bit mode */
+
+# define MY_ZCALLOC
+
+#if (!defined(_MSC_VER) || (_MSC_VER <= 600))
+# define _halloc halloc
+# define _hfree hfree
+#endif
+
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
+{
+ if (opaque) opaque = 0; /* to make compiler happy */
+ return _halloc((long)items, size);
+}
+
+void zcfree (voidpf opaque, voidpf ptr)
+{
+ if (opaque) opaque = 0; /* to make compiler happy */
+ _hfree(ptr);
+}
+
+#endif /* M_I86 */
+
+#endif /* SYS16BIT */
+
+
+#ifndef MY_ZCALLOC /* Any system without a special alloc function */
+
+#ifndef STDC
+extern voidp malloc OF((uInt size));
+extern voidp calloc OF((uInt items, uInt size));
+extern void free OF((voidpf ptr));
+#endif
+
+voidpf zcalloc (opaque, items, size)
+ voidpf opaque;
+ unsigned items;
+ unsigned size;
+{
+ if (opaque) items += size - size; /* make compiler happy */
+ return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :
+ (voidpf)calloc(items, size);
+}
+
+void zcfree (opaque, ptr)
+ voidpf opaque;
+ voidpf ptr;
+{
+ free(ptr);
+ if (opaque) return; /* make compiler happy */
+}
+
+#endif /* MY_ZCALLOC */
-/* zutil.h -- internal interface and configuration of the compression library\r
- * Copyright (C) 1995-2005 Jean-loup Gailly.\r
- * For conditions of distribution and use, see copyright notice in zlib.h\r
- */\r
-\r
-/* WARNING: this file should *not* be used by applications. It is\r
- part of the implementation of the compression library and is\r
- subject to change. Applications should only use zlib.h.\r
- */\r
-\r
-/* @(#) $Id$ */\r
-\r
-#ifndef ZUTIL_H\r
-#define ZUTIL_H\r
-\r
-#define ZLIB_INTERNAL\r
-#include "zlib.h"\r
-\r
-#ifdef STDC\r
-# ifndef _WIN32_WCE\r
-# include <stddef.h>\r
-# endif\r
-# include <string.h>\r
-# include <stdlib.h>\r
-#endif\r
-#ifdef NO_ERRNO_H\r
-# ifdef _WIN32_WCE\r
- /* The Microsoft C Run-Time Library for Windows CE doesn't have\r
- * errno. We define it as a global variable to simplify porting.\r
- * Its value is always 0 and should not be used. We rename it to\r
- * avoid conflict with other libraries that use the same workaround.\r
- */\r
-# define errno z_errno\r
-# endif\r
- extern int errno;\r
-#else\r
-# ifndef _WIN32_WCE\r
-# include <errno.h>\r
-# endif\r
-#endif\r
-\r
-#ifndef local\r
-# define local static\r
-#endif\r
-/* compile with -Dlocal if your debugger can't find static symbols */\r
-\r
-typedef unsigned char uch;\r
-typedef uch FAR uchf;\r
-typedef unsigned short ush;\r
-typedef ush FAR ushf;\r
-typedef unsigned long ulg;\r
-\r
-extern const char * const z_errmsg[10]; /* indexed by 2-zlib_error */\r
-/* (size given to avoid silly warnings with Visual C++) */\r
-\r
-#define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)]\r
-\r
-#define ERR_RETURN(strm,err) \\r
- return (strm->msg = (char*)ERR_MSG(err), (err))\r
-/* To be used only when the state is known to be valid */\r
-\r
- /* common constants */\r
-\r
-#ifndef DEF_WBITS\r
-# define DEF_WBITS MAX_WBITS\r
-#endif\r
-/* default windowBits for decompression. MAX_WBITS is for compression only */\r
-\r
-#if MAX_MEM_LEVEL >= 8\r
-# define DEF_MEM_LEVEL 8\r
-#else\r
-# define DEF_MEM_LEVEL MAX_MEM_LEVEL\r
-#endif\r
-/* default memLevel */\r
-\r
-#define STORED_BLOCK 0\r
-#define STATIC_TREES 1\r
-#define DYN_TREES 2\r
-/* The three kinds of block type */\r
-\r
-#define MIN_MATCH 3\r
-#define MAX_MATCH 258\r
-/* The minimum and maximum match lengths */\r
-\r
-#define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */\r
-\r
- /* target dependencies */\r
-\r
-#if defined(MSDOS) || (defined(WINDOWS) && !defined(WIN32))\r
-# define OS_CODE 0x00\r
-# if defined(__TURBOC__) || defined(__BORLANDC__)\r
-# if(__STDC__ == 1) && (defined(__LARGE__) || defined(__COMPACT__))\r
- /* Allow compilation with ANSI keywords only enabled */\r
- void _Cdecl farfree( void *block );\r
- void *_Cdecl farmalloc( unsigned long nbytes );\r
-# else\r
-# include <alloc.h>\r
-# endif\r
-# else /* MSC or DJGPP */\r
-# include <malloc.h>\r
-# endif\r
-#endif\r
-\r
-#ifdef AMIGA\r
-# define OS_CODE 0x01\r
-#endif\r
-\r
-#if defined(VAXC) || defined(VMS)\r
-# define OS_CODE 0x02\r
-# define F_OPEN(name, mode) \\r
- fopen((name), (mode), "mbc=60", "ctx=stm", "rfm=fix", "mrs=512")\r
-#endif\r
-\r
-#if defined(ATARI) || defined(atarist)\r
-# define OS_CODE 0x05\r
-#endif\r
-\r
-#ifdef OS2\r
-# define OS_CODE 0x06\r
-# ifdef M_I86\r
- #include <malloc.h>\r
-# endif\r
-#endif\r
-\r
-#if defined(MACOS) || defined(TARGET_OS_MAC)\r
-# define OS_CODE 0x07\r
-# if defined(__MWERKS__) && __dest_os != __be_os && __dest_os != __win32_os\r
-# include <unix.h> /* for fdopen */\r
-# else\r
-# ifndef fdopen\r
-# define fdopen(fd,mode) NULL /* No fdopen() */\r
-# endif\r
-# endif\r
-#endif\r
-\r
-#ifdef TOPS20\r
-# define OS_CODE 0x0a\r
-#endif\r
-\r
-#ifdef WIN32\r
-# ifndef __CYGWIN__ /* Cygwin is Unix, not Win32 */\r
-# define OS_CODE 0x0b\r
-# endif\r
-#endif\r
-\r
-#ifdef __50SERIES /* Prime/PRIMOS */\r
-# define OS_CODE 0x0f\r
-#endif\r
-\r
-#if defined(_BEOS_) || defined(RISCOS)\r
-# define fdopen(fd,mode) NULL /* No fdopen() */\r
-#endif\r
-\r
-#if (defined(_MSC_VER) && (_MSC_VER > 600))\r
-# if defined(_WIN32_WCE)\r
-# define fdopen(fd,mode) NULL /* No fdopen() */\r
-# ifndef _PTRDIFF_T_DEFINED\r
- typedef int ptrdiff_t;\r
-# define _PTRDIFF_T_DEFINED\r
-# endif\r
-# else\r
-# define fdopen(fd,type) _fdopen(fd,type)\r
-# endif\r
-#endif\r
-\r
- /* common defaults */\r
-\r
-#ifndef OS_CODE\r
-# define OS_CODE 0x03 /* assume Unix */\r
-#endif\r
-\r
-#ifndef F_OPEN\r
-# define F_OPEN(name, mode) fopen((name), (mode))\r
-#endif\r
-\r
- /* functions */\r
-\r
-#if defined(STDC99) || (defined(__TURBOC__) && __TURBOC__ >= 0x550)\r
-# ifndef HAVE_VSNPRINTF\r
-# define HAVE_VSNPRINTF\r
-# endif\r
-#endif\r
-#if defined(__CYGWIN__)\r
-# ifndef HAVE_VSNPRINTF\r
-# define HAVE_VSNPRINTF\r
-# endif\r
-#endif\r
-#ifndef HAVE_VSNPRINTF\r
-# ifdef MSDOS\r
- /* vsnprintf may exist on some MS-DOS compilers (DJGPP?),\r
- but for now we just assume it doesn't. */\r
-# define NO_vsnprintf\r
-# endif\r
-# ifdef __TURBOC__\r
-# define NO_vsnprintf\r
-# endif\r
-# ifdef WIN32\r
- /* In Win32, vsnprintf is available as the "non-ANSI" _vsnprintf. */\r
-# if !defined(vsnprintf) && !defined(NO_vsnprintf)\r
-# define vsnprintf _vsnprintf\r
-# endif\r
-# endif\r
-# ifdef __SASC\r
-# define NO_vsnprintf\r
-# endif\r
-#endif\r
-#ifdef VMS\r
-# define NO_vsnprintf\r
-#endif\r
-\r
-#if defined(pyr)\r
-# define NO_MEMCPY\r
-#endif\r
-#if defined(SMALL_MEDIUM) && !defined(_MSC_VER) && !defined(__SC__)\r
- /* Use our own functions for small and medium model with MSC <= 5.0.\r
- * You may have to use the same strategy for Borland C (untested).\r
- * The __SC__ check is for Symantec.\r
- */\r
-# define NO_MEMCPY\r
-#endif\r
-#if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY)\r
-# define HAVE_MEMCPY\r
-#endif\r
-#ifdef HAVE_MEMCPY\r
-# ifdef SMALL_MEDIUM /* MSDOS small or medium model */\r
-# define zmemcpy _fmemcpy\r
-# define zmemcmp _fmemcmp\r
-# define zmemzero(dest, len) _fmemset(dest, 0, len)\r
-# else\r
-# define zmemcpy memcpy\r
-# define zmemcmp memcmp\r
-# define zmemzero(dest, len) memset(dest, 0, len)\r
-# endif\r
-#else\r
- extern void zmemcpy OF((Bytef* dest, const Bytef* source, uInt len));\r
- extern int zmemcmp OF((const Bytef* s1, const Bytef* s2, uInt len));\r
- extern void zmemzero OF((Bytef* dest, uInt len));\r
-#endif\r
-\r
-/* Diagnostic functions */\r
-#ifdef DEBUG\r
-# include <stdio.h>\r
- extern int z_verbose;\r
- extern void z_error OF((char *m));\r
-# define Assert(cond,msg) {if(!(cond)) z_error(msg);}\r
-# define Trace(x) {if (z_verbose>=0) fprintf x ;}\r
-# define Tracev(x) {if (z_verbose>0) fprintf x ;}\r
-# define Tracevv(x) {if (z_verbose>1) fprintf x ;}\r
-# define Tracec(c,x) {if (z_verbose>0 && (c)) fprintf x ;}\r
-# define Tracecv(c,x) {if (z_verbose>1 && (c)) fprintf x ;}\r
-#else\r
-# define Assert(cond,msg)\r
-# define Trace(x)\r
-# define Tracev(x)\r
-# define Tracevv(x)\r
-# define Tracec(c,x)\r
-# define Tracecv(c,x)\r
-#endif\r
-\r
-\r
-voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size));\r
-void zcfree OF((voidpf opaque, voidpf ptr));\r
-\r
-#define ZALLOC(strm, items, size) \\r
- (*((strm)->zalloc))((strm)->opaque, (items), (size))\r
-#define ZFREE(strm, addr) (*((strm)->zfree))((strm)->opaque, (voidpf)(addr))\r
-#define TRY_FREE(s, p) {if (p) ZFREE(s, p);}\r
-\r
-#endif /* ZUTIL_H */\r
+/* zutil.h -- internal interface and configuration of the compression library
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+ part of the implementation of the compression library and is
+ subject to change. Applications should only use zlib.h.
+ */
+
+/* @(#) $Id$ */
+
+#ifndef ZUTIL_H
+#define ZUTIL_H
+
+#define ZLIB_INTERNAL
+#include "zlib.h"
+
+#ifdef STDC
+# ifndef _WIN32_WCE
+# include <stddef.h>
+# endif
+# include <string.h>
+# include <stdlib.h>
+#endif
+#ifdef NO_ERRNO_H
+# ifdef _WIN32_WCE
+ /* The Microsoft C Run-Time Library for Windows CE doesn't have
+ * errno. We define it as a global variable to simplify porting.
+ * Its value is always 0 and should not be used. We rename it to
+ * avoid conflict with other libraries that use the same workaround.
+ */
+# define errno z_errno
+# endif
+ extern int errno;
+#else
+# ifndef _WIN32_WCE
+# include <errno.h>
+# endif
+#endif
+
+#ifndef local
+# define local static
+#endif
+/* compile with -Dlocal if your debugger can't find static symbols */
+
+typedef unsigned char uch;
+typedef uch FAR uchf;
+typedef unsigned short ush;
+typedef ush FAR ushf;
+typedef unsigned long ulg;
+
+extern const char * const z_errmsg[10]; /* indexed by 2-zlib_error */
+/* (size given to avoid silly warnings with Visual C++) */
+
+#define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)]
+
+#define ERR_RETURN(strm,err) \
+ return (strm->msg = (char*)ERR_MSG(err), (err))
+/* To be used only when the state is known to be valid */
+
+ /* common constants */
+
+#ifndef DEF_WBITS
+# define DEF_WBITS MAX_WBITS
+#endif
+/* default windowBits for decompression. MAX_WBITS is for compression only */
+
+#if MAX_MEM_LEVEL >= 8
+# define DEF_MEM_LEVEL 8
+#else
+# define DEF_MEM_LEVEL MAX_MEM_LEVEL
+#endif
+/* default memLevel */
+
+#define STORED_BLOCK 0
+#define STATIC_TREES 1
+#define DYN_TREES 2
+/* The three kinds of block type */
+
+#define MIN_MATCH 3
+#define MAX_MATCH 258
+/* The minimum and maximum match lengths */
+
+#define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */
+
+ /* target dependencies */
+
+#if defined(MSDOS) || (defined(WINDOWS) && !defined(WIN32))
+# define OS_CODE 0x00
+# if defined(__TURBOC__) || defined(__BORLANDC__)
+# if(__STDC__ == 1) && (defined(__LARGE__) || defined(__COMPACT__))
+ /* Allow compilation with ANSI keywords only enabled */
+ void _Cdecl farfree( void *block );
+ void *_Cdecl farmalloc( unsigned long nbytes );
+# else
+# include <alloc.h>
+# endif
+# else /* MSC or DJGPP */
+# include <malloc.h>
+# endif
+#endif
+
+#ifdef AMIGA
+# define OS_CODE 0x01
+#endif
+
+#if defined(VAXC) || defined(VMS)
+# define OS_CODE 0x02
+# define F_OPEN(name, mode) \
+ fopen((name), (mode), "mbc=60", "ctx=stm", "rfm=fix", "mrs=512")
+#endif
+
+#if defined(ATARI) || defined(atarist)
+# define OS_CODE 0x05
+#endif
+
+#ifdef OS2
+# define OS_CODE 0x06
+# ifdef M_I86
+ #include <malloc.h>
+# endif
+#endif
+
+#if defined(MACOS) || defined(TARGET_OS_MAC)
+# define OS_CODE 0x07
+# if defined(__MWERKS__) && __dest_os != __be_os && __dest_os != __win32_os
+# include <unix.h> /* for fdopen */
+# else
+# ifndef fdopen
+# define fdopen(fd,mode) NULL /* No fdopen() */
+# endif
+# endif
+#endif
+
+#ifdef TOPS20
+# define OS_CODE 0x0a
+#endif
+
+#ifdef WIN32
+# ifndef __CYGWIN__ /* Cygwin is Unix, not Win32 */
+# define OS_CODE 0x0b
+# endif
+#endif
+
+#ifdef __50SERIES /* Prime/PRIMOS */
+# define OS_CODE 0x0f
+#endif
+
+#if defined(_BEOS_) || defined(RISCOS)
+# define fdopen(fd,mode) NULL /* No fdopen() */
+#endif
+
+#if (defined(_MSC_VER) && (_MSC_VER > 600))
+# if defined(_WIN32_WCE)
+# define fdopen(fd,mode) NULL /* No fdopen() */
+# ifndef _PTRDIFF_T_DEFINED
+ typedef int ptrdiff_t;
+# define _PTRDIFF_T_DEFINED
+# endif
+# else
+# define fdopen(fd,type) _fdopen(fd,type)
+# endif
+#endif
+
+ /* common defaults */
+
+#ifndef OS_CODE
+# define OS_CODE 0x03 /* assume Unix */
+#endif
+
+#ifndef F_OPEN
+# define F_OPEN(name, mode) fopen((name), (mode))
+#endif
+
+ /* functions */
+
+#if defined(STDC99) || (defined(__TURBOC__) && __TURBOC__ >= 0x550)
+# ifndef HAVE_VSNPRINTF
+# define HAVE_VSNPRINTF
+# endif
+#endif
+#if defined(__CYGWIN__)
+# ifndef HAVE_VSNPRINTF
+# define HAVE_VSNPRINTF
+# endif
+#endif
+#ifndef HAVE_VSNPRINTF
+# ifdef MSDOS
+ /* vsnprintf may exist on some MS-DOS compilers (DJGPP?),
+ but for now we just assume it doesn't. */
+# define NO_vsnprintf
+# endif
+# ifdef __TURBOC__
+# define NO_vsnprintf
+# endif
+# ifdef WIN32
+ /* In Win32, vsnprintf is available as the "non-ANSI" _vsnprintf. */
+# if !defined(vsnprintf) && !defined(NO_vsnprintf)
+# define vsnprintf _vsnprintf
+# endif
+# endif
+# ifdef __SASC
+# define NO_vsnprintf
+# endif
+#endif
+#ifdef VMS
+# define NO_vsnprintf
+#endif
+
+#if defined(pyr)
+# define NO_MEMCPY
+#endif
+#if defined(SMALL_MEDIUM) && !defined(_MSC_VER) && !defined(__SC__)
+ /* Use our own functions for small and medium model with MSC <= 5.0.
+ * You may have to use the same strategy for Borland C (untested).
+ * The __SC__ check is for Symantec.
+ */
+# define NO_MEMCPY
+#endif
+#if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY)
+# define HAVE_MEMCPY
+#endif
+#ifdef HAVE_MEMCPY
+# ifdef SMALL_MEDIUM /* MSDOS small or medium model */
+# define zmemcpy _fmemcpy
+# define zmemcmp _fmemcmp
+# define zmemzero(dest, len) _fmemset(dest, 0, len)
+# else
+# define zmemcpy memcpy
+# define zmemcmp memcmp
+# define zmemzero(dest, len) memset(dest, 0, len)
+# endif
+#else
+ extern void zmemcpy OF((Bytef* dest, const Bytef* source, uInt len));
+ extern int zmemcmp OF((const Bytef* s1, const Bytef* s2, uInt len));
+ extern void zmemzero OF((Bytef* dest, uInt len));
+#endif
+
+/* Diagnostic functions */
+#ifdef DEBUG
+# include <stdio.h>
+ extern int z_verbose;
+ extern void z_error OF((char *m));
+# define Assert(cond,msg) {if(!(cond)) z_error(msg);}
+# define Trace(x) {if (z_verbose>=0) fprintf x ;}
+# define Tracev(x) {if (z_verbose>0) fprintf x ;}
+# define Tracevv(x) {if (z_verbose>1) fprintf x ;}
+# define Tracec(c,x) {if (z_verbose>0 && (c)) fprintf x ;}
+# define Tracecv(c,x) {if (z_verbose>1 && (c)) fprintf x ;}
+#else
+# define Assert(cond,msg)
+# define Trace(x)
+# define Tracev(x)
+# define Tracevv(x)
+# define Tracec(c,x)
+# define Tracecv(c,x)
+#endif
+
+
+voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size));
+void zcfree OF((voidpf opaque, voidpf ptr));
+
+#define ZALLOC(strm, items, size) \
+ (*((strm)->zalloc))((strm)->opaque, (items), (size))
+#define ZFREE(strm, addr) (*((strm)->zfree))((strm)->opaque, (voidpf)(addr))
+#define TRY_FREE(s, p) {if (p) ZFREE(s, p);}
+
+#endif /* ZUTIL_H */
-/*\r
- * Copyright 2001-2009 Internet2\r
- * \r
- * Licensed under the Apache License, Version 2.0 (the "License");\r
- * you may not use this file except in compliance with the License.\r
- * You may obtain a copy of the License at\r
- *\r
- * http://www.apache.org/licenses/LICENSE-2.0\r
- *\r
- * Unless required by applicable law or agreed to in writing, software\r
- * distributed under the License is distributed on an "AS IS" BASIS,\r
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r
- * See the License for the specific language governing permissions and\r
- * limitations under the License.\r
- */\r
-\r
-#include "internal.h"\r
-\r
-#include <saml/SAMLConfig.h>\r
-#include <saml/binding/MessageDecoder.h>\r
-#include <saml/binding/MessageEncoder.h>\r
-#include <saml/binding/SecurityPolicy.h>\r
-#include <saml/binding/SecurityPolicyRule.h>\r
-#include <saml/saml2/metadata/Metadata.h>\r
-#include <saml/saml2/metadata/MetadataProvider.h>\r
-#include <xmltooling/io/HTTPRequest.h>\r
-#include <xmltooling/io/HTTPResponse.h>\r
-#include <xmltooling/security/Credential.h>\r
-#include <xmltooling/security/CredentialCriteria.h>\r
-#include <xmltooling/security/TrustEngine.h>\r
-#include <xmltooling/util/URLEncoder.h>\r
-\r
-using namespace opensaml::saml2md;\r
-using namespace opensaml;\r
-using namespace xmlsignature;\r
-\r
-class SAMLBindingBaseTestCase : public HTTPRequest, public HTTPResponse\r
-{\r
-protected:\r
- CredentialResolver* m_creds; \r
- MetadataProvider* m_metadata;\r
- TrustEngine* m_trust;\r
- map<string,string> m_fields;\r
- map<string,string> m_headers;\r
- string m_method,m_url,m_query;\r
- vector<XSECCryptoX509*> m_clientCerts;\r
- vector<const SecurityPolicyRule*> m_rules;\r
-\r
-public:\r
- void setUp() {\r
- m_creds=NULL;\r
- m_metadata=NULL;\r
- m_trust=NULL;\r
- m_fields.clear();\r
- m_headers.clear();\r
- m_method.erase();\r
- m_url.erase();\r
- m_query.erase();\r
-\r
- try {\r
- string config = data_path + "binding/ExampleMetadataProvider.xml";\r
- ifstream in(config.c_str());\r
- DOMDocument* doc=XMLToolingConfig::getConfig().getParser().parse(in);\r
- XercesJanitor<DOMDocument> janitor(doc);\r
- \r
- auto_ptr_XMLCh path("path");\r
- string s = data_path + "binding/example-metadata.xml";\r
- auto_ptr_XMLCh file(s.c_str());\r
- doc->getDocumentElement()->setAttributeNS(NULL,path.get(),file.get());\r
- \r
- m_metadata = SAMLConfig::getConfig().MetadataProviderManager.newPlugin(\r
- XML_METADATA_PROVIDER,doc->getDocumentElement()\r
- );\r
- m_metadata->init();\r
-\r
- config = data_path + "FilesystemCredentialResolver.xml";\r
- ifstream in2(config.c_str());\r
- DOMDocument* doc2=XMLToolingConfig::getConfig().getParser().parse(in2);\r
- XercesJanitor<DOMDocument> janitor2(doc2);\r
- m_creds = XMLToolingConfig::getConfig().CredentialResolverManager.newPlugin(\r
- FILESYSTEM_CREDENTIAL_RESOLVER,doc2->getDocumentElement()\r
- );\r
- \r
- m_trust = XMLToolingConfig::getConfig().TrustEngineManager.newPlugin(EXPLICIT_KEY_TRUSTENGINE, NULL);\r
-\r
- m_rules.push_back(SAMLConfig::getConfig().SecurityPolicyRuleManager.newPlugin(MESSAGEFLOW_POLICY_RULE,NULL));\r
- m_rules.push_back(SAMLConfig::getConfig().SecurityPolicyRuleManager.newPlugin(SIMPLESIGNING_POLICY_RULE,NULL));\r
- m_rules.push_back(SAMLConfig::getConfig().SecurityPolicyRuleManager.newPlugin(XMLSIGNING_POLICY_RULE,NULL));\r
- }\r
- catch (XMLToolingException& ex) {\r
- TS_TRACE(ex.what());\r
- tearDown();\r
- throw;\r
- }\r
-\r
- }\r
- \r
- void tearDown() {\r
- for_each(m_rules.begin(), m_rules.end(), xmltooling::cleanup<SecurityPolicyRule>());\r
- m_rules.clear();\r
- delete m_creds;\r
- delete m_metadata;\r
- delete m_trust;\r
- m_creds=NULL;\r
- m_metadata=NULL;\r
- m_trust=NULL;\r
- m_fields.clear();\r
- m_headers.clear();\r
- m_method.erase();\r
- m_url.erase();\r
- m_query.erase();\r
- }\r
-\r
- // HTTPRequest methods\r
-\r
- const char* getMethod() const {\r
- return m_method.c_str();\r
- }\r
-\r
- const char* getScheme() const {\r
- return "https";\r
- }\r
-\r
- const char* getHostname() const {\r
- return "localhost";\r
- }\r
-\r
- int getPort() const {\r
- return 443;\r
- }\r
-\r
- string getContentType() const {\r
- return "application/x-www-form-urlencoded";\r
- }\r
-\r
- long getContentLength() const {\r
- return -1;\r
- }\r
-\r
- const char* getRequestURI() const {\r
- return "/";\r
- }\r
-\r
- const char* getRequestURL() const {\r
- return m_url.c_str();\r
- }\r
- \r
- const char* getRequestBody() const {\r
- return NULL;\r
- }\r
- \r
- const char* getQueryString() const {\r
- return m_query.c_str();\r
- }\r
- \r
- string getRemoteUser() const {\r
- return "";\r
- }\r
-\r
- string getRemoteAddr() const {\r
- return "127.0.0.1";\r
- }\r
-\r
- const std::vector<XSECCryptoX509*>& getClientCertificates() const {\r
- return m_clientCerts;\r
- }\r
-\r
- string getHeader(const char* name) const {\r
- map<string,string>::const_iterator i=m_headers.find(name);\r
- return i==m_headers.end() ? "" : i->second;\r
- }\r
- \r
- const char* getParameter(const char* name) const {\r
- map<string,string>::const_iterator i=m_fields.find(name);\r
- return i==m_fields.end() ? NULL : i->second.c_str();\r
- }\r
-\r
- vector<const char*>::size_type getParameters(const char* name, vector<const char*>& values) const {\r
- values.clear();\r
- map<string,string>::const_iterator i=m_fields.find(name);\r
- if (i!=m_fields.end())\r
- values.push_back(i->second.c_str());\r
- return values.size();\r
- }\r
- \r
- // HTTPResponse methods\r
- \r
- void setResponseHeader(const char* name, const char* value) {\r
- m_headers[name] = value ? value : "";\r
- }\r
-\r
- // The amount of error checking missing from this is incredible, but as long\r
- // as the test data isn't unexpected or malformed, it should work.\r
- \r
- long sendRedirect(const char* url) {\r
- m_method = "GET";\r
- char* dup = strdup(url);\r
- char* pch = strchr(dup,'?');\r
- if (pch) {\r
- *pch++=0;\r
- m_query = pch;\r
- char* name=pch;\r
- while (name && *name) {\r
- pch=strchr(pch,'=');\r
- *pch++=0;\r
- char* value=pch;\r
- pch=strchr(pch,'&');\r
- if (pch)\r
- *pch++=0;\r
- XMLToolingConfig::getConfig().getURLEncoder()->decode(value);\r
- m_fields[name] = value;\r
- name = pch; \r
- }\r
- }\r
- m_url = dup;\r
- free(dup);\r
- return m_fields.size();\r
- }\r
- \r
- string html_decode(const string& s) const {\r
- string decoded;\r
- const char* ch=s.c_str();\r
- while (*ch) {\r
- if (*ch=='&') {\r
- if (!strncmp(ch,"<",4)) {\r
- decoded+='<'; ch+=4;\r
- }\r
- else if (!strncmp(ch,">",4)) {\r
- decoded+='>'; ch+=4;\r
- }\r
- else if (!strncmp(ch,""",6)) {\r
- decoded+='"'; ch+=6;\r
- }\r
- else if (*++ch=='#') {\r
- decoded+=(char)atoi(++ch);\r
- ch=strchr(ch,';')+1;\r
- }\r
- }\r
- else {\r
- decoded+=*ch++;\r
- }\r
- }\r
- return decoded;\r
- }\r
- \r
- using HTTPResponse::sendResponse;\r
-\r
- long sendResponse(std::istream& inputStream, long status) {\r
- m_method="POST";\r
- string page,line;\r
- while (getline(inputStream,line))\r
- page += line + '\n';\r
- \r
- const char* pch=strstr(page.c_str(),"action=\"");\r
- pch+=strlen("action=\"");\r
- m_url = html_decode(page.substr(pch-page.c_str(),strchr(pch,'"')-pch));\r
-\r
- while (pch=strstr(pch,"<input type=\"hidden\" name=\"")) {\r
- pch+=strlen("<input type=\"hidden\" name=\"");\r
- string name = page.substr(pch-page.c_str(),strchr(pch,'"')-pch);\r
- pch=strstr(pch,"value=\"");\r
- pch+=strlen("value=\"");\r
- m_fields[name] = html_decode(page.substr(pch-page.c_str(),strchr(pch,'"')-pch));\r
- }\r
- return m_fields.size();\r
- }\r
-};\r
+/*
+ * Copyright 2001-2009 Internet2
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include "internal.h"
+
+#include <saml/SAMLConfig.h>
+#include <saml/binding/MessageDecoder.h>
+#include <saml/binding/MessageEncoder.h>
+#include <saml/binding/SecurityPolicy.h>
+#include <saml/binding/SecurityPolicyRule.h>
+#include <saml/saml2/metadata/Metadata.h>
+#include <saml/saml2/metadata/MetadataProvider.h>
+#include <xmltooling/io/HTTPRequest.h>
+#include <xmltooling/io/HTTPResponse.h>
+#include <xmltooling/security/Credential.h>
+#include <xmltooling/security/CredentialCriteria.h>
+#include <xmltooling/security/TrustEngine.h>
+#include <xmltooling/util/URLEncoder.h>
+
+using namespace opensaml::saml2md;
+using namespace opensaml;
+using namespace xmlsignature;
+
+class SAMLBindingBaseTestCase : public HTTPRequest, public HTTPResponse
+{
+protected:
+ CredentialResolver* m_creds;
+ MetadataProvider* m_metadata;
+ TrustEngine* m_trust;
+ map<string,string> m_fields;
+ map<string,string> m_headers;
+ string m_method,m_url,m_query;
+ vector<XSECCryptoX509*> m_clientCerts;
+ vector<const SecurityPolicyRule*> m_rules;
+
+public:
+ void setUp() {
+ m_creds=NULL;
+ m_metadata=NULL;
+ m_trust=NULL;
+ m_fields.clear();
+ m_headers.clear();
+ m_method.erase();
+ m_url.erase();
+ m_query.erase();
+
+ try {
+ string config = data_path + "binding/ExampleMetadataProvider.xml";
+ ifstream in(config.c_str());
+ DOMDocument* doc=XMLToolingConfig::getConfig().getParser().parse(in);
+ XercesJanitor<DOMDocument> janitor(doc);
+
+ auto_ptr_XMLCh path("path");
+ string s = data_path + "binding/example-metadata.xml";
+ auto_ptr_XMLCh file(s.c_str());
+ doc->getDocumentElement()->setAttributeNS(NULL,path.get(),file.get());
+
+ m_metadata = SAMLConfig::getConfig().MetadataProviderManager.newPlugin(
+ XML_METADATA_PROVIDER,doc->getDocumentElement()
+ );
+ m_metadata->init();
+
+ config = data_path + "FilesystemCredentialResolver.xml";
+ ifstream in2(config.c_str());
+ DOMDocument* doc2=XMLToolingConfig::getConfig().getParser().parse(in2);
+ XercesJanitor<DOMDocument> janitor2(doc2);
+ m_creds = XMLToolingConfig::getConfig().CredentialResolverManager.newPlugin(
+ FILESYSTEM_CREDENTIAL_RESOLVER,doc2->getDocumentElement()
+ );
+
+ m_trust = XMLToolingConfig::getConfig().TrustEngineManager.newPlugin(EXPLICIT_KEY_TRUSTENGINE, NULL);
+
+ m_rules.push_back(SAMLConfig::getConfig().SecurityPolicyRuleManager.newPlugin(MESSAGEFLOW_POLICY_RULE,NULL));
+ m_rules.push_back(SAMLConfig::getConfig().SecurityPolicyRuleManager.newPlugin(SIMPLESIGNING_POLICY_RULE,NULL));
+ m_rules.push_back(SAMLConfig::getConfig().SecurityPolicyRuleManager.newPlugin(XMLSIGNING_POLICY_RULE,NULL));
+ }
+ catch (XMLToolingException& ex) {
+ TS_TRACE(ex.what());
+ tearDown();
+ throw;
+ }
+
+ }
+
+ void tearDown() {
+ for_each(m_rules.begin(), m_rules.end(), xmltooling::cleanup<SecurityPolicyRule>());
+ m_rules.clear();
+ delete m_creds;
+ delete m_metadata;
+ delete m_trust;
+ m_creds=NULL;
+ m_metadata=NULL;
+ m_trust=NULL;
+ m_fields.clear();
+ m_headers.clear();
+ m_method.erase();
+ m_url.erase();
+ m_query.erase();
+ }
+
+ // HTTPRequest methods
+
+ const char* getMethod() const {
+ return m_method.c_str();
+ }
+
+ const char* getScheme() const {
+ return "https";
+ }
+
+ const char* getHostname() const {
+ return "localhost";
+ }
+
+ int getPort() const {
+ return 443;
+ }
+
+ string getContentType() const {
+ return "application/x-www-form-urlencoded";
+ }
+
+ long getContentLength() const {
+ return -1;
+ }
+
+ const char* getRequestURI() const {
+ return "/";
+ }
+
+ const char* getRequestURL() const {
+ return m_url.c_str();
+ }
+
+ const char* getRequestBody() const {
+ return NULL;
+ }
+
+ const char* getQueryString() const {
+ return m_query.c_str();
+ }
+
+ string getRemoteUser() const {
+ return "";
+ }
+
+ string getRemoteAddr() const {
+ return "127.0.0.1";
+ }
+
+ const std::vector<XSECCryptoX509*>& getClientCertificates() const {
+ return m_clientCerts;
+ }
+
+ string getHeader(const char* name) const {
+ map<string,string>::const_iterator i=m_headers.find(name);
+ return i==m_headers.end() ? "" : i->second;
+ }
+
+ const char* getParameter(const char* name) const {
+ map<string,string>::const_iterator i=m_fields.find(name);
+ return i==m_fields.end() ? NULL : i->second.c_str();
+ }
+
+ vector<const char*>::size_type getParameters(const char* name, vector<const char*>& values) const {
+ values.clear();
+ map<string,string>::const_iterator i=m_fields.find(name);
+ if (i!=m_fields.end())
+ values.push_back(i->second.c_str());
+ return values.size();
+ }
+
+ // HTTPResponse methods
+
+ void setResponseHeader(const char* name, const char* value) {
+ m_headers[name] = value ? value : "";
+ }
+
+ // The amount of error checking missing from this is incredible, but as long
+ // as the test data isn't unexpected or malformed, it should work.
+
+ long sendRedirect(const char* url) {
+ m_method = "GET";
+ char* dup = strdup(url);
+ char* pch = strchr(dup,'?');
+ if (pch) {
+ *pch++=0;
+ m_query = pch;
+ char* name=pch;
+ while (name && *name) {
+ pch=strchr(pch,'=');
+ *pch++=0;
+ char* value=pch;
+ pch=strchr(pch,'&');
+ if (pch)
+ *pch++=0;
+ XMLToolingConfig::getConfig().getURLEncoder()->decode(value);
+ m_fields[name] = value;
+ name = pch;
+ }
+ }
+ m_url = dup;
+ free(dup);
+ return m_fields.size();
+ }
+
+ string html_decode(const string& s) const {
+ string decoded;
+ const char* ch=s.c_str();
+ while (*ch) {
+ if (*ch=='&') {
+ if (!strncmp(ch,"<",4)) {
+ decoded+='<'; ch+=4;
+ }
+ else if (!strncmp(ch,">",4)) {
+ decoded+='>'; ch+=4;
+ }
+ else if (!strncmp(ch,""",6)) {
+ decoded+='"'; ch+=6;
+ }
+ else if (*++ch=='#') {
+ decoded+=(char)atoi(++ch);
+ ch=strchr(ch,';')+1;
+ }
+ }
+ else {
+ decoded+=*ch++;
+ }
+ }
+ return decoded;
+ }
+
+ using HTTPResponse::sendResponse;
+
+ long sendResponse(std::istream& inputStream, long status) {
+ m_method="POST";
+ string page,line;
+ while (getline(inputStream,line))
+ page += line + '\n';
+
+ const char* pch=strstr(page.c_str(),"action=\"");
+ pch+=strlen("action=\"");
+ m_url = html_decode(page.substr(pch-page.c_str(),strchr(pch,'"')-pch));
+
+ while (pch=strstr(pch,"<input type=\"hidden\" name=\"")) {
+ pch+=strlen("<input type=\"hidden\" name=\"");
+ string name = page.substr(pch-page.c_str(),strchr(pch,'"')-pch);
+ pch=strstr(pch,"value=\"");
+ pch+=strlen("value=\"");
+ m_fields[name] = html_decode(page.substr(pch-page.c_str(),strchr(pch,'"')-pch));
+ }
+ return m_fields.size();
+ }
+};
-/*\r
- * Copyright 2001-2009 Internet2\r
- * \r
- * Licensed under the Apache License, Version 2.0 (the "License");\r
- * you may not use this file except in compliance with the License.\r
- * You may obtain a copy of the License at\r
- *\r
- * http://www.apache.org/licenses/LICENSE-2.0\r
- *\r
- * Unless required by applicable law or agreed to in writing, software\r
- * distributed under the License is distributed on an "AS IS" BASIS,\r
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r
- * See the License for the specific language governing permissions and\r
- * limitations under the License.\r
- */\r
-\r
-#include "binding.h"\r
-\r
-#include <saml/binding/ArtifactMap.h>\r
-#include <saml/saml1/core/Assertions.h>\r
-#include <saml/saml1/core/Protocols.h>\r
-#include <saml/saml1/binding/SAMLArtifactType0001.h>\r
-#include <xmltooling/signature/Signature.h>\r
-#include <xmltooling/validation/ValidatorSuite.h>\r
-\r
-using namespace opensaml::saml1p;\r
-using namespace opensaml::saml1;\r
-\r
-class SAML1ArtifactTest : public CxxTest::TestSuite,\r
- public SAMLBindingBaseTestCase, public MessageEncoder::ArtifactGenerator, public MessageDecoder::ArtifactResolver {\r
-public:\r
- void setUp() {\r
- SAMLBindingBaseTestCase::setUp();\r
- }\r
-\r
- void tearDown() {\r
- SAMLBindingBaseTestCase::tearDown();\r
- }\r
-\r
- void testSAML1Artifact() {\r
- try {\r
- xmltooling::QName idprole(samlconstants::SAML20MD_NS, IDPSSODescriptor::LOCAL_NAME);\r
- SecurityPolicy policy(m_metadata, &idprole, m_trust, false);\r
- policy.getRules().assign(m_rules.begin(), m_rules.end());\r
-\r
- // Read message to use from file.\r
- string path = data_path + "saml1/binding/SAML1Assertion.xml";\r
- ifstream in(path.c_str());\r
- DOMDocument* doc=XMLToolingConfig::getConfig().getParser().parse(in);\r
- XercesJanitor<DOMDocument> janitor(doc);\r
- auto_ptr<saml1::Assertion> toSend(\r
- dynamic_cast<saml1::Assertion*>(XMLObjectBuilder::buildOneFromElement(doc->getDocumentElement(),true))\r
- );\r
- janitor.release();\r
-\r
- CredentialCriteria cc;\r
- cc.setUsage(Credential::SIGNING_CREDENTIAL);\r
- Locker clocker(m_creds);\r
- const Credential* cred = m_creds->resolve(&cc);\r
- TSM_ASSERT("Retrieved credential was null", cred!=NULL);\r
-\r
- // Encode message.\r
- auto_ptr<MessageEncoder> encoder(\r
- SAMLConfig::getConfig().MessageEncoderManager.newPlugin(\r
- samlconstants::SAML1_PROFILE_BROWSER_ARTIFACT, pair<const DOMElement*,const XMLCh*>(NULL,NULL)\r
- )\r
- );\r
- Locker locker(m_metadata);\r
- encoder->encode(\r
- *this,\r
- toSend.get(),\r
- "https://sp.example.org/SAML/SSO",\r
- m_metadata->getEntityDescriptor(MetadataProvider::Criteria("https://sp.example.org/")).first,\r
- "state",\r
- this,\r
- cred\r
- );\r
- toSend.release();\r
- \r
- // Decode message.\r
- string relayState;\r
- auto_ptr<MessageDecoder> decoder(\r
- SAMLConfig::getConfig().MessageDecoderManager.newPlugin(\r
- samlconstants::SAML1_PROFILE_BROWSER_ARTIFACT, pair<const DOMElement*,const XMLCh*>(NULL,NULL)\r
- )\r
- );\r
- decoder->setArtifactResolver(this);\r
- auto_ptr<Response> response(dynamic_cast<Response*>(decoder->decode(relayState,*this,policy)));\r
- \r
- // Test the results.\r
- TSM_ASSERT_EQUALS("TARGET was not the expected result.", relayState, "state");\r
- TSM_ASSERT("SAML Response not decoded successfully.", response.get());\r
- TSM_ASSERT("Message was not verified.", policy.isAuthenticated());\r
- auto_ptr_char entityID(policy.getIssuer()->getName());\r
- TSM_ASSERT("Issuer was not expected.", !strcmp(entityID.get(),"https://idp.example.org/"));\r
- TSM_ASSERT_EQUALS("Assertion count was not correct.", response->getAssertions().size(), 1);\r
-\r
- // Trigger a replay.\r
- policy.reset();\r
- TSM_ASSERT_THROWS("Did not catch the replay.", decoder->decode(relayState,*this,policy), BindingException);\r
- }\r
- catch (XMLToolingException& ex) {\r
- TS_TRACE(ex.what());\r
- throw;\r
- }\r
- }\r
-\r
- SAMLArtifact* generateSAML1Artifact(const EntityDescriptor* relyingParty) const {\r
- return new SAMLArtifactType0001(SAMLConfig::getConfig().hashSHA1("https://idp.example.org/"));\r
- }\r
- \r
- saml2p::SAML2Artifact* generateSAML2Artifact(const EntityDescriptor* relyingParty) const {\r
- throw BindingException("Not implemented.");\r
- }\r
- \r
- Response* resolve(\r
- const vector<SAMLArtifact*>& artifacts,\r
- const IDPSSODescriptor& idpDescriptor,\r
- SecurityPolicy& policy\r
- ) const {\r
- TSM_ASSERT_EQUALS("Too many artifacts.", artifacts.size(), 1);\r
- XMLObject* xmlObject =\r
- SAMLConfig::getConfig().getArtifactMap()->retrieveContent(artifacts.front(), "https://sp.example.org/");\r
- saml1::Assertion* assertion = dynamic_cast<saml1::Assertion*>(xmlObject);\r
- TSM_ASSERT("Not an assertion.", assertion!=NULL);\r
- auto_ptr<Response> response(ResponseBuilder::buildResponse());\r
- response->getAssertions().push_back(assertion);\r
- Status* status = StatusBuilder::buildStatus();\r
- response->setStatus(status);\r
- StatusCode* sc = StatusCodeBuilder::buildStatusCode();\r
- status->setStatusCode(sc);\r
- sc->setValue(&StatusCode::SUCCESS);\r
- response->setSignature(SignatureBuilder::buildSignature());\r
- vector<Signature*> sigs(1,response->getSignature());\r
- CredentialCriteria cc;\r
- cc.setUsage(Credential::SIGNING_CREDENTIAL);\r
- Locker clocker(m_creds);\r
- const Credential* cred = m_creds->resolve(&cc);\r
- TSM_ASSERT("Retrieved credential was null", cred!=NULL);\r
- response->marshall((DOMDocument*)NULL,&sigs,cred);\r
- SchemaValidators.validate(response.get());\r
- policy.evaluate(*(response.get()), this);\r
- return response.release();\r
- }\r
-\r
- saml2p::ArtifactResponse* resolve(\r
- const saml2p::SAML2Artifact& artifact,\r
- const SSODescriptorType& ssoDescriptor,\r
- SecurityPolicy& policy\r
- ) const {\r
- throw BindingException("Not implemented.");\r
- }\r
-};\r
+/*
+ * Copyright 2001-2009 Internet2
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include "binding.h"
+
+#include <saml/binding/ArtifactMap.h>
+#include <saml/saml1/core/Assertions.h>
+#include <saml/saml1/core/Protocols.h>
+#include <saml/saml1/binding/SAMLArtifactType0001.h>
+#include <xmltooling/signature/Signature.h>
+#include <xmltooling/validation/ValidatorSuite.h>
+
+using namespace opensaml::saml1p;
+using namespace opensaml::saml1;
+
+class SAML1ArtifactTest : public CxxTest::TestSuite,
+ public SAMLBindingBaseTestCase, public MessageEncoder::ArtifactGenerator, public MessageDecoder::ArtifactResolver {
+public:
+ void setUp() {
+ SAMLBindingBaseTestCase::setUp();
+ }
+
+ void tearDown() {
+ SAMLBindingBaseTestCase::tearDown();
+ }
+
+ void testSAML1Artifact() {
+ try {
+ xmltooling::QName idprole(samlconstants::SAML20MD_NS, IDPSSODescriptor::LOCAL_NAME);
+ SecurityPolicy policy(m_metadata, &idprole, m_trust, false);
+ policy.getRules().assign(m_rules.begin(), m_rules.end());
+
+ // Read message to use from file.
+ string path = data_path + "saml1/binding/SAML1Assertion.xml";
+ ifstream in(path.c_str());
+ DOMDocument* doc=XMLToolingConfig::getConfig().getParser().parse(in);
+ XercesJanitor<DOMDocument> janitor(doc);
+ auto_ptr<saml1::Assertion> toSend(
+ dynamic_cast<saml1::Assertion*>(XMLObjectBuilder::buildOneFromElement(doc->getDocumentElement(),true))
+ );
+ janitor.release();
+
+ CredentialCriteria cc;
+ cc.setUsage(Credential::SIGNING_CREDENTIAL);
+ Locker clocker(m_creds);
+ const Credential* cred = m_creds->resolve(&cc);
+ TSM_ASSERT("Retrieved credential was null", cred!=NULL);
+
+ // Encode message.
+ auto_ptr<MessageEncoder> encoder(
+ SAMLConfig::getConfig().MessageEncoderManager.newPlugin(
+ samlconstants::SAML1_PROFILE_BROWSER_ARTIFACT, pair<const DOMElement*,const XMLCh*>(NULL,NULL)
+ )
+ );
+ Locker locker(m_metadata);
+ encoder->encode(
+ *this,
+ toSend.get(),
+ "https://sp.example.org/SAML/SSO",
+ m_metadata->getEntityDescriptor(MetadataProvider::Criteria("https://sp.example.org/")).first,
+ "state",
+ this,
+ cred
+ );
+ toSend.release();
+
+ // Decode message.
+ string relayState;
+ auto_ptr<MessageDecoder> decoder(
+ SAMLConfig::getConfig().MessageDecoderManager.newPlugin(
+ samlconstants::SAML1_PROFILE_BROWSER_ARTIFACT, pair<const DOMElement*,const XMLCh*>(NULL,NULL)
+ )
+ );
+ decoder->setArtifactResolver(this);
+ auto_ptr<Response> response(dynamic_cast<Response*>(decoder->decode(relayState,*this,policy)));
+
+ // Test the results.
+ TSM_ASSERT_EQUALS("TARGET was not the expected result.", relayState, "state");
+ TSM_ASSERT("SAML Response not decoded successfully.", response.get());
+ TSM_ASSERT("Message was not verified.", policy.isAuthenticated());
+ auto_ptr_char entityID(policy.getIssuer()->getName());
+ TSM_ASSERT("Issuer was not expected.", !strcmp(entityID.get(),"https://idp.example.org/"));
+ TSM_ASSERT_EQUALS("Assertion count was not correct.", response->getAssertions().size(), 1);
+
+ // Trigger a replay.
+ policy.reset();
+ TSM_ASSERT_THROWS("Did not catch the replay.", decoder->decode(relayState,*this,policy), BindingException);
+ }
+ catch (XMLToolingException& ex) {
+ TS_TRACE(ex.what());
+ throw;
+ }
+ }
+
+ SAMLArtifact* generateSAML1Artifact(const EntityDescriptor* relyingParty) const {
+ return new SAMLArtifactType0001(SAMLConfig::getConfig().hashSHA1("https://idp.example.org/"));
+ }
+
+ saml2p::SAML2Artifact* generateSAML2Artifact(const EntityDescriptor* relyingParty) const {
+ throw BindingException("Not implemented.");
+ }
+
+ Response* resolve(
+ const vector<SAMLArtifact*>& artifacts,
+ const IDPSSODescriptor& idpDescriptor,
+ SecurityPolicy& policy
+ ) const {
+ TSM_ASSERT_EQUALS("Too many artifacts.", artifacts.size(), 1);
+ XMLObject* xmlObject =
+ SAMLConfig::getConfig().getArtifactMap()->retrieveContent(artifacts.front(), "https://sp.example.org/");
+ saml1::Assertion* assertion = dynamic_cast<saml1::Assertion*>(xmlObject);
+ TSM_ASSERT("Not an assertion.", assertion!=NULL);
+ auto_ptr<Response> response(ResponseBuilder::buildResponse());
+ response->getAssertions().push_back(assertion);
+ Status* status = StatusBuilder::buildStatus();
+ response->setStatus(status);
+ StatusCode* sc = StatusCodeBuilder::buildStatusCode();
+ status->setStatusCode(sc);
+ sc->setValue(&StatusCode::SUCCESS);
+ response->setSignature(SignatureBuilder::buildSignature());
+ vector<Signature*> sigs(1,response->getSignature());
+ CredentialCriteria cc;
+ cc.setUsage(Credential::SIGNING_CREDENTIAL);
+ Locker clocker(m_creds);
+ const Credential* cred = m_creds->resolve(&cc);
+ TSM_ASSERT("Retrieved credential was null", cred!=NULL);
+ response->marshall((DOMDocument*)NULL,&sigs,cred);
+ SchemaValidators.validate(response.get());
+ policy.evaluate(*(response.get()), this);
+ return response.release();
+ }
+
+ saml2p::ArtifactResponse* resolve(
+ const saml2p::SAML2Artifact& artifact,
+ const SSODescriptorType& ssoDescriptor,
+ SecurityPolicy& policy
+ ) const {
+ throw BindingException("Not implemented.");
+ }
+};