Compare commits
2 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
75277be173 | ||
|
|
4b29e0458f |
27
AUTHORS
27
AUTHORS
@@ -1,27 +0,0 @@
|
|||||||
|
|
||||||
Authors of XZ Utils
|
|
||||||
===================
|
|
||||||
|
|
||||||
XZ Utils is developed and maintained by Lasse Collin
|
|
||||||
<lasse.collin@tukaani.org>.
|
|
||||||
|
|
||||||
Major parts of liblzma are based on code written by Igor Pavlov,
|
|
||||||
specifically the LZMA SDK <http://7-zip.org/sdk.html>. Without
|
|
||||||
this code, XZ Utils wouldn't exist.
|
|
||||||
|
|
||||||
The SHA-256 implementation in liblzma is based on the code found from
|
|
||||||
7-Zip <http://7-zip.org/>, which has a modified version of the SHA-256
|
|
||||||
code found from Crypto++ <http://www.cryptopp.com/>. The SHA-256 code
|
|
||||||
in Crypto++ was written by Kevin Springle and Wei Dai.
|
|
||||||
|
|
||||||
Some scripts have been adapted from gzip. The original versions
|
|
||||||
were written by Jean-loup Gailly, Charles Levert, and Paul Eggert.
|
|
||||||
Andrew Dudman helped adapting the scripts and their man pages for
|
|
||||||
XZ Utils.
|
|
||||||
|
|
||||||
The GNU Autotools-based build system contains files from many authors,
|
|
||||||
which I'm not trying to list here.
|
|
||||||
|
|
||||||
Several people have contributed fixes or reported bugs. Most of them
|
|
||||||
are mentioned in the file THANKS.
|
|
||||||
|
|
||||||
249
CMakeLists.txt
Normal file
249
CMakeLists.txt
Normal file
@@ -0,0 +1,249 @@
|
|||||||
|
cmake_minimum_required(VERSION 2.4.4)
|
||||||
|
set(CMAKE_ALLOW_LOOSE_LOOP_CONSTRUCTS ON)
|
||||||
|
|
||||||
|
project(zlib C)
|
||||||
|
|
||||||
|
set(VERSION "1.2.11")
|
||||||
|
|
||||||
|
option(ASM686 "Enable building i686 assembly implementation")
|
||||||
|
option(AMD64 "Enable building amd64 assembly implementation")
|
||||||
|
|
||||||
|
set(INSTALL_BIN_DIR "${CMAKE_INSTALL_PREFIX}/bin" CACHE PATH "Installation directory for executables")
|
||||||
|
set(INSTALL_LIB_DIR "${CMAKE_INSTALL_PREFIX}/lib" CACHE PATH "Installation directory for libraries")
|
||||||
|
set(INSTALL_INC_DIR "${CMAKE_INSTALL_PREFIX}/include" CACHE PATH "Installation directory for headers")
|
||||||
|
set(INSTALL_MAN_DIR "${CMAKE_INSTALL_PREFIX}/share/man" CACHE PATH "Installation directory for manual pages")
|
||||||
|
set(INSTALL_PKGCONFIG_DIR "${CMAKE_INSTALL_PREFIX}/share/pkgconfig" CACHE PATH "Installation directory for pkgconfig (.pc) files")
|
||||||
|
|
||||||
|
include(CheckTypeSize)
|
||||||
|
include(CheckFunctionExists)
|
||||||
|
include(CheckIncludeFile)
|
||||||
|
include(CheckCSourceCompiles)
|
||||||
|
enable_testing()
|
||||||
|
|
||||||
|
check_include_file(sys/types.h HAVE_SYS_TYPES_H)
|
||||||
|
check_include_file(stdint.h HAVE_STDINT_H)
|
||||||
|
check_include_file(stddef.h HAVE_STDDEF_H)
|
||||||
|
|
||||||
|
#
|
||||||
|
# Check to see if we have large file support
|
||||||
|
#
|
||||||
|
set(CMAKE_REQUIRED_DEFINITIONS -D_LARGEFILE64_SOURCE=1)
|
||||||
|
# We add these other definitions here because CheckTypeSize.cmake
|
||||||
|
# in CMake 2.4.x does not automatically do so and we want
|
||||||
|
# compatibility with CMake 2.4.x.
|
||||||
|
if(HAVE_SYS_TYPES_H)
|
||||||
|
list(APPEND CMAKE_REQUIRED_DEFINITIONS -DHAVE_SYS_TYPES_H)
|
||||||
|
endif()
|
||||||
|
if(HAVE_STDINT_H)
|
||||||
|
list(APPEND CMAKE_REQUIRED_DEFINITIONS -DHAVE_STDINT_H)
|
||||||
|
endif()
|
||||||
|
if(HAVE_STDDEF_H)
|
||||||
|
list(APPEND CMAKE_REQUIRED_DEFINITIONS -DHAVE_STDDEF_H)
|
||||||
|
endif()
|
||||||
|
check_type_size(off64_t OFF64_T)
|
||||||
|
if(HAVE_OFF64_T)
|
||||||
|
add_definitions(-D_LARGEFILE64_SOURCE=1)
|
||||||
|
endif()
|
||||||
|
set(CMAKE_REQUIRED_DEFINITIONS) # clear variable
|
||||||
|
|
||||||
|
#
|
||||||
|
# Check for fseeko
|
||||||
|
#
|
||||||
|
check_function_exists(fseeko HAVE_FSEEKO)
|
||||||
|
if(NOT HAVE_FSEEKO)
|
||||||
|
add_definitions(-DNO_FSEEKO)
|
||||||
|
endif()
|
||||||
|
|
||||||
|
#
|
||||||
|
# Check for unistd.h
|
||||||
|
#
|
||||||
|
check_include_file(unistd.h Z_HAVE_UNISTD_H)
|
||||||
|
|
||||||
|
if(MSVC)
|
||||||
|
set(CMAKE_DEBUG_POSTFIX "d")
|
||||||
|
add_definitions(-D_CRT_SECURE_NO_DEPRECATE)
|
||||||
|
add_definitions(-D_CRT_NONSTDC_NO_DEPRECATE)
|
||||||
|
include_directories(${CMAKE_CURRENT_SOURCE_DIR})
|
||||||
|
endif()
|
||||||
|
|
||||||
|
if(NOT CMAKE_CURRENT_SOURCE_DIR STREQUAL CMAKE_CURRENT_BINARY_DIR)
|
||||||
|
# If we're doing an out of source build and the user has a zconf.h
|
||||||
|
# in their source tree...
|
||||||
|
if(EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/zconf.h)
|
||||||
|
message(STATUS "Renaming")
|
||||||
|
message(STATUS " ${CMAKE_CURRENT_SOURCE_DIR}/zconf.h")
|
||||||
|
message(STATUS "to 'zconf.h.included' because this file is included with zlib")
|
||||||
|
message(STATUS "but CMake generates it automatically in the build directory.")
|
||||||
|
file(RENAME ${CMAKE_CURRENT_SOURCE_DIR}/zconf.h ${CMAKE_CURRENT_SOURCE_DIR}/zconf.h.included)
|
||||||
|
endif()
|
||||||
|
endif()
|
||||||
|
|
||||||
|
set(ZLIB_PC ${CMAKE_CURRENT_BINARY_DIR}/zlib.pc)
|
||||||
|
configure_file( ${CMAKE_CURRENT_SOURCE_DIR}/zlib.pc.cmakein
|
||||||
|
${ZLIB_PC} @ONLY)
|
||||||
|
configure_file( ${CMAKE_CURRENT_SOURCE_DIR}/zconf.h.cmakein
|
||||||
|
${CMAKE_CURRENT_BINARY_DIR}/zconf.h @ONLY)
|
||||||
|
include_directories(${CMAKE_CURRENT_BINARY_DIR} ${CMAKE_SOURCE_DIR})
|
||||||
|
|
||||||
|
|
||||||
|
#============================================================================
|
||||||
|
# zlib
|
||||||
|
#============================================================================
|
||||||
|
|
||||||
|
set(ZLIB_PUBLIC_HDRS
|
||||||
|
${CMAKE_CURRENT_BINARY_DIR}/zconf.h
|
||||||
|
zlib.h
|
||||||
|
)
|
||||||
|
set(ZLIB_PRIVATE_HDRS
|
||||||
|
crc32.h
|
||||||
|
deflate.h
|
||||||
|
gzguts.h
|
||||||
|
inffast.h
|
||||||
|
inffixed.h
|
||||||
|
inflate.h
|
||||||
|
inftrees.h
|
||||||
|
trees.h
|
||||||
|
zutil.h
|
||||||
|
)
|
||||||
|
set(ZLIB_SRCS
|
||||||
|
adler32.c
|
||||||
|
compress.c
|
||||||
|
crc32.c
|
||||||
|
deflate.c
|
||||||
|
gzclose.c
|
||||||
|
gzlib.c
|
||||||
|
gzread.c
|
||||||
|
gzwrite.c
|
||||||
|
inflate.c
|
||||||
|
infback.c
|
||||||
|
inftrees.c
|
||||||
|
inffast.c
|
||||||
|
trees.c
|
||||||
|
uncompr.c
|
||||||
|
zutil.c
|
||||||
|
)
|
||||||
|
|
||||||
|
if(NOT MINGW)
|
||||||
|
set(ZLIB_DLL_SRCS
|
||||||
|
win32/zlib1.rc # If present will override custom build rule below.
|
||||||
|
)
|
||||||
|
endif()
|
||||||
|
|
||||||
|
if(CMAKE_COMPILER_IS_GNUCC)
|
||||||
|
if(ASM686)
|
||||||
|
set(ZLIB_ASMS contrib/asm686/match.S)
|
||||||
|
elseif (AMD64)
|
||||||
|
set(ZLIB_ASMS contrib/amd64/amd64-match.S)
|
||||||
|
endif ()
|
||||||
|
|
||||||
|
if(ZLIB_ASMS)
|
||||||
|
add_definitions(-DASMV)
|
||||||
|
set_source_files_properties(${ZLIB_ASMS} PROPERTIES LANGUAGE C COMPILE_FLAGS -DNO_UNDERLINE)
|
||||||
|
endif()
|
||||||
|
endif()
|
||||||
|
|
||||||
|
if(MSVC)
|
||||||
|
if(ASM686)
|
||||||
|
ENABLE_LANGUAGE(ASM_MASM)
|
||||||
|
set(ZLIB_ASMS
|
||||||
|
contrib/masmx86/inffas32.asm
|
||||||
|
contrib/masmx86/match686.asm
|
||||||
|
)
|
||||||
|
elseif (AMD64)
|
||||||
|
ENABLE_LANGUAGE(ASM_MASM)
|
||||||
|
set(ZLIB_ASMS
|
||||||
|
contrib/masmx64/gvmat64.asm
|
||||||
|
contrib/masmx64/inffasx64.asm
|
||||||
|
)
|
||||||
|
endif()
|
||||||
|
|
||||||
|
if(ZLIB_ASMS)
|
||||||
|
add_definitions(-DASMV -DASMINF)
|
||||||
|
endif()
|
||||||
|
endif()
|
||||||
|
|
||||||
|
# parse the full version number from zlib.h and include in ZLIB_FULL_VERSION
|
||||||
|
file(READ ${CMAKE_CURRENT_SOURCE_DIR}/zlib.h _zlib_h_contents)
|
||||||
|
string(REGEX REPLACE ".*#define[ \t]+ZLIB_VERSION[ \t]+\"([-0-9A-Za-z.]+)\".*"
|
||||||
|
"\\1" ZLIB_FULL_VERSION ${_zlib_h_contents})
|
||||||
|
|
||||||
|
if(MINGW)
|
||||||
|
# This gets us DLL resource information when compiling on MinGW.
|
||||||
|
if(NOT CMAKE_RC_COMPILER)
|
||||||
|
set(CMAKE_RC_COMPILER windres.exe)
|
||||||
|
endif()
|
||||||
|
|
||||||
|
add_custom_command(OUTPUT ${CMAKE_CURRENT_BINARY_DIR}/zlib1rc.obj
|
||||||
|
COMMAND ${CMAKE_RC_COMPILER}
|
||||||
|
-D GCC_WINDRES
|
||||||
|
-I ${CMAKE_CURRENT_SOURCE_DIR}
|
||||||
|
-I ${CMAKE_CURRENT_BINARY_DIR}
|
||||||
|
-o ${CMAKE_CURRENT_BINARY_DIR}/zlib1rc.obj
|
||||||
|
-i ${CMAKE_CURRENT_SOURCE_DIR}/win32/zlib1.rc)
|
||||||
|
set(ZLIB_DLL_SRCS ${CMAKE_CURRENT_BINARY_DIR}/zlib1rc.obj)
|
||||||
|
endif(MINGW)
|
||||||
|
|
||||||
|
add_library(zlib SHARED ${ZLIB_SRCS} ${ZLIB_ASMS} ${ZLIB_DLL_SRCS} ${ZLIB_PUBLIC_HDRS} ${ZLIB_PRIVATE_HDRS})
|
||||||
|
add_library(zlibstatic STATIC ${ZLIB_SRCS} ${ZLIB_ASMS} ${ZLIB_PUBLIC_HDRS} ${ZLIB_PRIVATE_HDRS})
|
||||||
|
set_target_properties(zlib PROPERTIES DEFINE_SYMBOL ZLIB_DLL)
|
||||||
|
set_target_properties(zlib PROPERTIES SOVERSION 1)
|
||||||
|
|
||||||
|
if(NOT CYGWIN)
|
||||||
|
# This property causes shared libraries on Linux to have the full version
|
||||||
|
# encoded into their final filename. We disable this on Cygwin because
|
||||||
|
# it causes cygz-${ZLIB_FULL_VERSION}.dll to be created when cygz.dll
|
||||||
|
# seems to be the default.
|
||||||
|
#
|
||||||
|
# This has no effect with MSVC, on that platform the version info for
|
||||||
|
# the DLL comes from the resource file win32/zlib1.rc
|
||||||
|
set_target_properties(zlib PROPERTIES VERSION ${ZLIB_FULL_VERSION})
|
||||||
|
endif()
|
||||||
|
|
||||||
|
if(UNIX)
|
||||||
|
# On unix-like platforms the library is almost always called libz
|
||||||
|
set_target_properties(zlib zlibstatic PROPERTIES OUTPUT_NAME z)
|
||||||
|
if(NOT APPLE)
|
||||||
|
set_target_properties(zlib PROPERTIES LINK_FLAGS "-Wl,--version-script,\"${CMAKE_CURRENT_SOURCE_DIR}/zlib.map\"")
|
||||||
|
endif()
|
||||||
|
elseif(BUILD_SHARED_LIBS AND WIN32)
|
||||||
|
# Creates zlib1.dll when building shared library version
|
||||||
|
set_target_properties(zlib PROPERTIES SUFFIX "1.dll")
|
||||||
|
endif()
|
||||||
|
|
||||||
|
if(NOT SKIP_INSTALL_LIBRARIES AND NOT SKIP_INSTALL_ALL )
|
||||||
|
install(TARGETS zlib zlibstatic
|
||||||
|
RUNTIME DESTINATION "${INSTALL_BIN_DIR}"
|
||||||
|
ARCHIVE DESTINATION "${INSTALL_LIB_DIR}"
|
||||||
|
LIBRARY DESTINATION "${INSTALL_LIB_DIR}" )
|
||||||
|
endif()
|
||||||
|
if(NOT SKIP_INSTALL_HEADERS AND NOT SKIP_INSTALL_ALL )
|
||||||
|
install(FILES ${ZLIB_PUBLIC_HDRS} DESTINATION "${INSTALL_INC_DIR}")
|
||||||
|
endif()
|
||||||
|
if(NOT SKIP_INSTALL_FILES AND NOT SKIP_INSTALL_ALL )
|
||||||
|
install(FILES zlib.3 DESTINATION "${INSTALL_MAN_DIR}/man3")
|
||||||
|
endif()
|
||||||
|
if(NOT SKIP_INSTALL_FILES AND NOT SKIP_INSTALL_ALL )
|
||||||
|
install(FILES ${ZLIB_PC} DESTINATION "${INSTALL_PKGCONFIG_DIR}")
|
||||||
|
endif()
|
||||||
|
|
||||||
|
#============================================================================
|
||||||
|
# Example binaries
|
||||||
|
#============================================================================
|
||||||
|
|
||||||
|
add_executable(example test/example.c)
|
||||||
|
target_link_libraries(example zlib)
|
||||||
|
add_test(example example)
|
||||||
|
|
||||||
|
add_executable(minigzip test/minigzip.c)
|
||||||
|
target_link_libraries(minigzip zlib)
|
||||||
|
|
||||||
|
if(HAVE_OFF64_T)
|
||||||
|
add_executable(example64 test/example.c)
|
||||||
|
target_link_libraries(example64 zlib)
|
||||||
|
set_target_properties(example64 PROPERTIES COMPILE_FLAGS "-D_FILE_OFFSET_BITS=64")
|
||||||
|
add_test(example64 example64)
|
||||||
|
|
||||||
|
add_executable(minigzip64 test/minigzip.c)
|
||||||
|
target_link_libraries(minigzip64 zlib)
|
||||||
|
set_target_properties(minigzip64 PROPERTIES COMPILE_FLAGS "-D_FILE_OFFSET_BITS=64")
|
||||||
|
endif()
|
||||||
65
COPYING
65
COPYING
@@ -1,65 +0,0 @@
|
|||||||
|
|
||||||
XZ Utils Licensing
|
|
||||||
==================
|
|
||||||
|
|
||||||
Different licenses apply to different files in this package. Here
|
|
||||||
is a rough summary of which licenses apply to which parts of this
|
|
||||||
package (but check the individual files to be sure!):
|
|
||||||
|
|
||||||
- liblzma is in the public domain.
|
|
||||||
|
|
||||||
- xz, xzdec, and lzmadec command line tools are in the public
|
|
||||||
domain unless GNU getopt_long had to be compiled and linked
|
|
||||||
in from the lib directory. The getopt_long code is under
|
|
||||||
GNU LGPLv2.1+.
|
|
||||||
|
|
||||||
- The scripts to grep, diff, and view compressed files have been
|
|
||||||
adapted from gzip. These scripts and their documentation are
|
|
||||||
under GNU GPLv2+.
|
|
||||||
|
|
||||||
- All the documentation in the doc directory and most of the
|
|
||||||
XZ Utils specific documentation files in other directories
|
|
||||||
are in the public domain.
|
|
||||||
|
|
||||||
- Translated messages are in the public domain.
|
|
||||||
|
|
||||||
- The build system contains public domain files, and files that
|
|
||||||
are under GNU GPLv2+ or GNU GPLv3+. None of these files end up
|
|
||||||
in the binaries being built.
|
|
||||||
|
|
||||||
- Test files and test code in the tests directory, and debugging
|
|
||||||
utilities in the debug directory are in the public domain.
|
|
||||||
|
|
||||||
- The extra directory may contain public domain files, and files
|
|
||||||
that are under various free software licenses.
|
|
||||||
|
|
||||||
You can do whatever you want with the files that have been put into
|
|
||||||
the public domain. If you find public domain legally problematic,
|
|
||||||
take the previous sentence as a license grant. If you still find
|
|
||||||
the lack of copyright legally problematic, you have too many
|
|
||||||
lawyers.
|
|
||||||
|
|
||||||
As usual, this software is provided "as is", without any warranty.
|
|
||||||
|
|
||||||
If you copy significant amounts of public domain code from XZ Utils
|
|
||||||
into your project, acknowledging this somewhere in your software is
|
|
||||||
polite (especially if it is proprietary, non-free software), but
|
|
||||||
naturally it is not legally required. Here is an example of a good
|
|
||||||
notice to put into "about box" or into documentation:
|
|
||||||
|
|
||||||
This software includes code from XZ Utils <http://tukaani.org/xz/>.
|
|
||||||
|
|
||||||
The following license texts are included in the following files:
|
|
||||||
- COPYING.LGPLv2.1: GNU Lesser General Public License version 2.1
|
|
||||||
- COPYING.GPLv2: GNU General Public License version 2
|
|
||||||
- COPYING.GPLv3: GNU General Public License version 3
|
|
||||||
|
|
||||||
Note that the toolchain (compiler, linker etc.) may add some code
|
|
||||||
pieces that are copyrighted. Thus, it is possible that e.g. liblzma
|
|
||||||
binary wouldn't actually be in the public domain in its entirety
|
|
||||||
even though it contains no copyrighted code from the XZ Utils source
|
|
||||||
package.
|
|
||||||
|
|
||||||
If you have questions, don't hesitate to ask the author(s) for more
|
|
||||||
information.
|
|
||||||
|
|
||||||
339
COPYING.GPLv2
339
COPYING.GPLv2
@@ -1,339 +0,0 @@
|
|||||||
GNU GENERAL PUBLIC LICENSE
|
|
||||||
Version 2, June 1991
|
|
||||||
|
|
||||||
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
|
|
||||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
||||||
Everyone is permitted to copy and distribute verbatim copies
|
|
||||||
of this license document, but changing it is not allowed.
|
|
||||||
|
|
||||||
Preamble
|
|
||||||
|
|
||||||
The licenses for most software are designed to take away your
|
|
||||||
freedom to share and change it. By contrast, the GNU General Public
|
|
||||||
License is intended to guarantee your freedom to share and change free
|
|
||||||
software--to make sure the software is free for all its users. This
|
|
||||||
General Public License applies to most of the Free Software
|
|
||||||
Foundation's software and to any other program whose authors commit to
|
|
||||||
using it. (Some other Free Software Foundation software is covered by
|
|
||||||
the GNU Lesser General Public License instead.) You can apply it to
|
|
||||||
your programs, too.
|
|
||||||
|
|
||||||
When we speak of free software, we are referring to freedom, not
|
|
||||||
price. Our General Public Licenses are designed to make sure that you
|
|
||||||
have the freedom to distribute copies of free software (and charge for
|
|
||||||
this service if you wish), that you receive source code or can get it
|
|
||||||
if you want it, that you can change the software or use pieces of it
|
|
||||||
in new free programs; and that you know you can do these things.
|
|
||||||
|
|
||||||
To protect your rights, we need to make restrictions that forbid
|
|
||||||
anyone to deny you these rights or to ask you to surrender the rights.
|
|
||||||
These restrictions translate to certain responsibilities for you if you
|
|
||||||
distribute copies of the software, or if you modify it.
|
|
||||||
|
|
||||||
For example, if you distribute copies of such a program, whether
|
|
||||||
gratis or for a fee, you must give the recipients all the rights that
|
|
||||||
you have. You must make sure that they, too, receive or can get the
|
|
||||||
source code. And you must show them these terms so they know their
|
|
||||||
rights.
|
|
||||||
|
|
||||||
We protect your rights with two steps: (1) copyright the software, and
|
|
||||||
(2) offer you this license which gives you legal permission to copy,
|
|
||||||
distribute and/or modify the software.
|
|
||||||
|
|
||||||
Also, for each author's protection and ours, we want to make certain
|
|
||||||
that everyone understands that there is no warranty for this free
|
|
||||||
software. If the software is modified by someone else and passed on, we
|
|
||||||
want its recipients to know that what they have is not the original, so
|
|
||||||
that any problems introduced by others will not reflect on the original
|
|
||||||
authors' reputations.
|
|
||||||
|
|
||||||
Finally, any free program is threatened constantly by software
|
|
||||||
patents. We wish to avoid the danger that redistributors of a free
|
|
||||||
program will individually obtain patent licenses, in effect making the
|
|
||||||
program proprietary. To prevent this, we have made it clear that any
|
|
||||||
patent must be licensed for everyone's free use or not licensed at all.
|
|
||||||
|
|
||||||
The precise terms and conditions for copying, distribution and
|
|
||||||
modification follow.
|
|
||||||
|
|
||||||
GNU GENERAL PUBLIC LICENSE
|
|
||||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
|
||||||
|
|
||||||
0. This License applies to any program or other work which contains
|
|
||||||
a notice placed by the copyright holder saying it may be distributed
|
|
||||||
under the terms of this General Public License. The "Program", below,
|
|
||||||
refers to any such program or work, and a "work based on the Program"
|
|
||||||
means either the Program or any derivative work under copyright law:
|
|
||||||
that is to say, a work containing the Program or a portion of it,
|
|
||||||
either verbatim or with modifications and/or translated into another
|
|
||||||
language. (Hereinafter, translation is included without limitation in
|
|
||||||
the term "modification".) Each licensee is addressed as "you".
|
|
||||||
|
|
||||||
Activities other than copying, distribution and modification are not
|
|
||||||
covered by this License; they are outside its scope. The act of
|
|
||||||
running the Program is not restricted, and the output from the Program
|
|
||||||
is covered only if its contents constitute a work based on the
|
|
||||||
Program (independent of having been made by running the Program).
|
|
||||||
Whether that is true depends on what the Program does.
|
|
||||||
|
|
||||||
1. You may copy and distribute verbatim copies of the Program's
|
|
||||||
source code as you receive it, in any medium, provided that you
|
|
||||||
conspicuously and appropriately publish on each copy an appropriate
|
|
||||||
copyright notice and disclaimer of warranty; keep intact all the
|
|
||||||
notices that refer to this License and to the absence of any warranty;
|
|
||||||
and give any other recipients of the Program a copy of this License
|
|
||||||
along with the Program.
|
|
||||||
|
|
||||||
You may charge a fee for the physical act of transferring a copy, and
|
|
||||||
you may at your option offer warranty protection in exchange for a fee.
|
|
||||||
|
|
||||||
2. You may modify your copy or copies of the Program or any portion
|
|
||||||
of it, thus forming a work based on the Program, and copy and
|
|
||||||
distribute such modifications or work under the terms of Section 1
|
|
||||||
above, provided that you also meet all of these conditions:
|
|
||||||
|
|
||||||
a) You must cause the modified files to carry prominent notices
|
|
||||||
stating that you changed the files and the date of any change.
|
|
||||||
|
|
||||||
b) You must cause any work that you distribute or publish, that in
|
|
||||||
whole or in part contains or is derived from the Program or any
|
|
||||||
part thereof, to be licensed as a whole at no charge to all third
|
|
||||||
parties under the terms of this License.
|
|
||||||
|
|
||||||
c) If the modified program normally reads commands interactively
|
|
||||||
when run, you must cause it, when started running for such
|
|
||||||
interactive use in the most ordinary way, to print or display an
|
|
||||||
announcement including an appropriate copyright notice and a
|
|
||||||
notice that there is no warranty (or else, saying that you provide
|
|
||||||
a warranty) and that users may redistribute the program under
|
|
||||||
these conditions, and telling the user how to view a copy of this
|
|
||||||
License. (Exception: if the Program itself is interactive but
|
|
||||||
does not normally print such an announcement, your work based on
|
|
||||||
the Program is not required to print an announcement.)
|
|
||||||
|
|
||||||
These requirements apply to the modified work as a whole. If
|
|
||||||
identifiable sections of that work are not derived from the Program,
|
|
||||||
and can be reasonably considered independent and separate works in
|
|
||||||
themselves, then this License, and its terms, do not apply to those
|
|
||||||
sections when you distribute them as separate works. But when you
|
|
||||||
distribute the same sections as part of a whole which is a work based
|
|
||||||
on the Program, the distribution of the whole must be on the terms of
|
|
||||||
this License, whose permissions for other licensees extend to the
|
|
||||||
entire whole, and thus to each and every part regardless of who wrote it.
|
|
||||||
|
|
||||||
Thus, it is not the intent of this section to claim rights or contest
|
|
||||||
your rights to work written entirely by you; rather, the intent is to
|
|
||||||
exercise the right to control the distribution of derivative or
|
|
||||||
collective works based on the Program.
|
|
||||||
|
|
||||||
In addition, mere aggregation of another work not based on the Program
|
|
||||||
with the Program (or with a work based on the Program) on a volume of
|
|
||||||
a storage or distribution medium does not bring the other work under
|
|
||||||
the scope of this License.
|
|
||||||
|
|
||||||
3. You may copy and distribute the Program (or a work based on it,
|
|
||||||
under Section 2) in object code or executable form under the terms of
|
|
||||||
Sections 1 and 2 above provided that you also do one of the following:
|
|
||||||
|
|
||||||
a) Accompany it with the complete corresponding machine-readable
|
|
||||||
source code, which must be distributed under the terms of Sections
|
|
||||||
1 and 2 above on a medium customarily used for software interchange; or,
|
|
||||||
|
|
||||||
b) Accompany it with a written offer, valid for at least three
|
|
||||||
years, to give any third party, for a charge no more than your
|
|
||||||
cost of physically performing source distribution, a complete
|
|
||||||
machine-readable copy of the corresponding source code, to be
|
|
||||||
distributed under the terms of Sections 1 and 2 above on a medium
|
|
||||||
customarily used for software interchange; or,
|
|
||||||
|
|
||||||
c) Accompany it with the information you received as to the offer
|
|
||||||
to distribute corresponding source code. (This alternative is
|
|
||||||
allowed only for noncommercial distribution and only if you
|
|
||||||
received the program in object code or executable form with such
|
|
||||||
an offer, in accord with Subsection b above.)
|
|
||||||
|
|
||||||
The source code for a work means the preferred form of the work for
|
|
||||||
making modifications to it. For an executable work, complete source
|
|
||||||
code means all the source code for all modules it contains, plus any
|
|
||||||
associated interface definition files, plus the scripts used to
|
|
||||||
control compilation and installation of the executable. However, as a
|
|
||||||
special exception, the source code distributed need not include
|
|
||||||
anything that is normally distributed (in either source or binary
|
|
||||||
form) with the major components (compiler, kernel, and so on) of the
|
|
||||||
operating system on which the executable runs, unless that component
|
|
||||||
itself accompanies the executable.
|
|
||||||
|
|
||||||
If distribution of executable or object code is made by offering
|
|
||||||
access to copy from a designated place, then offering equivalent
|
|
||||||
access to copy the source code from the same place counts as
|
|
||||||
distribution of the source code, even though third parties are not
|
|
||||||
compelled to copy the source along with the object code.
|
|
||||||
|
|
||||||
4. You may not copy, modify, sublicense, or distribute the Program
|
|
||||||
except as expressly provided under this License. Any attempt
|
|
||||||
otherwise to copy, modify, sublicense or distribute the Program is
|
|
||||||
void, and will automatically terminate your rights under this License.
|
|
||||||
However, parties who have received copies, or rights, from you under
|
|
||||||
this License will not have their licenses terminated so long as such
|
|
||||||
parties remain in full compliance.
|
|
||||||
|
|
||||||
5. You are not required to accept this License, since you have not
|
|
||||||
signed it. However, nothing else grants you permission to modify or
|
|
||||||
distribute the Program or its derivative works. These actions are
|
|
||||||
prohibited by law if you do not accept this License. Therefore, by
|
|
||||||
modifying or distributing the Program (or any work based on the
|
|
||||||
Program), you indicate your acceptance of this License to do so, and
|
|
||||||
all its terms and conditions for copying, distributing or modifying
|
|
||||||
the Program or works based on it.
|
|
||||||
|
|
||||||
6. Each time you redistribute the Program (or any work based on the
|
|
||||||
Program), the recipient automatically receives a license from the
|
|
||||||
original licensor to copy, distribute or modify the Program subject to
|
|
||||||
these terms and conditions. You may not impose any further
|
|
||||||
restrictions on the recipients' exercise of the rights granted herein.
|
|
||||||
You are not responsible for enforcing compliance by third parties to
|
|
||||||
this License.
|
|
||||||
|
|
||||||
7. If, as a consequence of a court judgment or allegation of patent
|
|
||||||
infringement or for any other reason (not limited to patent issues),
|
|
||||||
conditions are imposed on you (whether by court order, agreement or
|
|
||||||
otherwise) that contradict the conditions of this License, they do not
|
|
||||||
excuse you from the conditions of this License. If you cannot
|
|
||||||
distribute so as to satisfy simultaneously your obligations under this
|
|
||||||
License and any other pertinent obligations, then as a consequence you
|
|
||||||
may not distribute the Program at all. For example, if a patent
|
|
||||||
license would not permit royalty-free redistribution of the Program by
|
|
||||||
all those who receive copies directly or indirectly through you, then
|
|
||||||
the only way you could satisfy both it and this License would be to
|
|
||||||
refrain entirely from distribution of the Program.
|
|
||||||
|
|
||||||
If any portion of this section is held invalid or unenforceable under
|
|
||||||
any particular circumstance, the balance of the section is intended to
|
|
||||||
apply and the section as a whole is intended to apply in other
|
|
||||||
circumstances.
|
|
||||||
|
|
||||||
It is not the purpose of this section to induce you to infringe any
|
|
||||||
patents or other property right claims or to contest validity of any
|
|
||||||
such claims; this section has the sole purpose of protecting the
|
|
||||||
integrity of the free software distribution system, which is
|
|
||||||
implemented by public license practices. Many people have made
|
|
||||||
generous contributions to the wide range of software distributed
|
|
||||||
through that system in reliance on consistent application of that
|
|
||||||
system; it is up to the author/donor to decide if he or she is willing
|
|
||||||
to distribute software through any other system and a licensee cannot
|
|
||||||
impose that choice.
|
|
||||||
|
|
||||||
This section is intended to make thoroughly clear what is believed to
|
|
||||||
be a consequence of the rest of this License.
|
|
||||||
|
|
||||||
8. If the distribution and/or use of the Program is restricted in
|
|
||||||
certain countries either by patents or by copyrighted interfaces, the
|
|
||||||
original copyright holder who places the Program under this License
|
|
||||||
may add an explicit geographical distribution limitation excluding
|
|
||||||
those countries, so that distribution is permitted only in or among
|
|
||||||
countries not thus excluded. In such case, this License incorporates
|
|
||||||
the limitation as if written in the body of this License.
|
|
||||||
|
|
||||||
9. The Free Software Foundation may publish revised and/or new versions
|
|
||||||
of the General Public License from time to time. Such new versions will
|
|
||||||
be similar in spirit to the present version, but may differ in detail to
|
|
||||||
address new problems or concerns.
|
|
||||||
|
|
||||||
Each version is given a distinguishing version number. If the Program
|
|
||||||
specifies a version number of this License which applies to it and "any
|
|
||||||
later version", you have the option of following the terms and conditions
|
|
||||||
either of that version or of any later version published by the Free
|
|
||||||
Software Foundation. If the Program does not specify a version number of
|
|
||||||
this License, you may choose any version ever published by the Free Software
|
|
||||||
Foundation.
|
|
||||||
|
|
||||||
10. If you wish to incorporate parts of the Program into other free
|
|
||||||
programs whose distribution conditions are different, write to the author
|
|
||||||
to ask for permission. For software which is copyrighted by the Free
|
|
||||||
Software Foundation, write to the Free Software Foundation; we sometimes
|
|
||||||
make exceptions for this. Our decision will be guided by the two goals
|
|
||||||
of preserving the free status of all derivatives of our free software and
|
|
||||||
of promoting the sharing and reuse of software generally.
|
|
||||||
|
|
||||||
NO WARRANTY
|
|
||||||
|
|
||||||
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
|
|
||||||
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
|
|
||||||
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
|
|
||||||
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
|
|
||||||
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
||||||
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
|
|
||||||
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
|
|
||||||
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
|
|
||||||
REPAIR OR CORRECTION.
|
|
||||||
|
|
||||||
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
|
||||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
|
|
||||||
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
|
||||||
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
|
|
||||||
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
|
|
||||||
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
|
|
||||||
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
|
|
||||||
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
|
|
||||||
POSSIBILITY OF SUCH DAMAGES.
|
|
||||||
|
|
||||||
END OF TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
How to Apply These Terms to Your New Programs
|
|
||||||
|
|
||||||
If you develop a new program, and you want it to be of the greatest
|
|
||||||
possible use to the public, the best way to achieve this is to make it
|
|
||||||
free software which everyone can redistribute and change under these terms.
|
|
||||||
|
|
||||||
To do so, attach the following notices to the program. It is safest
|
|
||||||
to attach them to the start of each source file to most effectively
|
|
||||||
convey the exclusion of warranty; and each file should have at least
|
|
||||||
the "copyright" line and a pointer to where the full notice is found.
|
|
||||||
|
|
||||||
<one line to give the program's name and a brief idea of what it does.>
|
|
||||||
Copyright (C) <year> <name of author>
|
|
||||||
|
|
||||||
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.,
|
|
||||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
||||||
|
|
||||||
Also add information on how to contact you by electronic and paper mail.
|
|
||||||
|
|
||||||
If the program is interactive, make it output a short notice like this
|
|
||||||
when it starts in an interactive mode:
|
|
||||||
|
|
||||||
Gnomovision version 69, Copyright (C) year name of author
|
|
||||||
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
|
||||||
This is free software, and you are welcome to redistribute it
|
|
||||||
under certain conditions; type `show c' for details.
|
|
||||||
|
|
||||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
|
||||||
parts of the General Public License. Of course, the commands you use may
|
|
||||||
be called something other than `show w' and `show c'; they could even be
|
|
||||||
mouse-clicks or menu items--whatever suits your program.
|
|
||||||
|
|
||||||
You should also get your employer (if you work as a programmer) or your
|
|
||||||
school, if any, to sign a "copyright disclaimer" for the program, if
|
|
||||||
necessary. Here is a sample; alter the names:
|
|
||||||
|
|
||||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
|
|
||||||
`Gnomovision' (which makes passes at compilers) written by James Hacker.
|
|
||||||
|
|
||||||
<signature of Ty Coon>, 1 April 1989
|
|
||||||
Ty Coon, President of Vice
|
|
||||||
|
|
||||||
This General Public License does not permit incorporating your program into
|
|
||||||
proprietary programs. If your program is a subroutine library, you may
|
|
||||||
consider it more useful to permit linking proprietary applications with the
|
|
||||||
library. If this is what you want to do, use the GNU Lesser General
|
|
||||||
Public License instead of this License.
|
|
||||||
674
COPYING.GPLv3
674
COPYING.GPLv3
@@ -1,674 +0,0 @@
|
|||||||
GNU GENERAL PUBLIC LICENSE
|
|
||||||
Version 3, 29 June 2007
|
|
||||||
|
|
||||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
|
||||||
Everyone is permitted to copy and distribute verbatim copies
|
|
||||||
of this license document, but changing it is not allowed.
|
|
||||||
|
|
||||||
Preamble
|
|
||||||
|
|
||||||
The GNU General Public License is a free, copyleft license for
|
|
||||||
software and other kinds of works.
|
|
||||||
|
|
||||||
The licenses for most software and other practical works are designed
|
|
||||||
to take away your freedom to share and change the works. By contrast,
|
|
||||||
the GNU General Public License is intended to guarantee your freedom to
|
|
||||||
share and change all versions of a program--to make sure it remains free
|
|
||||||
software for all its users. We, the Free Software Foundation, use the
|
|
||||||
GNU General Public License for most of our software; it applies also to
|
|
||||||
any other work released this way by its authors. You can apply it to
|
|
||||||
your programs, too.
|
|
||||||
|
|
||||||
When we speak of free software, we are referring to freedom, not
|
|
||||||
price. Our General Public Licenses are designed to make sure that you
|
|
||||||
have the freedom to distribute copies of free software (and charge for
|
|
||||||
them if you wish), that you receive source code or can get it if you
|
|
||||||
want it, that you can change the software or use pieces of it in new
|
|
||||||
free programs, and that you know you can do these things.
|
|
||||||
|
|
||||||
To protect your rights, we need to prevent others from denying you
|
|
||||||
these rights or asking you to surrender the rights. Therefore, you have
|
|
||||||
certain responsibilities if you distribute copies of the software, or if
|
|
||||||
you modify it: responsibilities to respect the freedom of others.
|
|
||||||
|
|
||||||
For example, if you distribute copies of such a program, whether
|
|
||||||
gratis or for a fee, you must pass on to the recipients the same
|
|
||||||
freedoms that you received. You must make sure that they, too, receive
|
|
||||||
or can get the source code. And you must show them these terms so they
|
|
||||||
know their rights.
|
|
||||||
|
|
||||||
Developers that use the GNU GPL protect your rights with two steps:
|
|
||||||
(1) assert copyright on the software, and (2) offer you this License
|
|
||||||
giving you legal permission to copy, distribute and/or modify it.
|
|
||||||
|
|
||||||
For the developers' and authors' protection, the GPL clearly explains
|
|
||||||
that there is no warranty for this free software. For both users' and
|
|
||||||
authors' sake, the GPL requires that modified versions be marked as
|
|
||||||
changed, so that their problems will not be attributed erroneously to
|
|
||||||
authors of previous versions.
|
|
||||||
|
|
||||||
Some devices are designed to deny users access to install or run
|
|
||||||
modified versions of the software inside them, although the manufacturer
|
|
||||||
can do so. This is fundamentally incompatible with the aim of
|
|
||||||
protecting users' freedom to change the software. The systematic
|
|
||||||
pattern of such abuse occurs in the area of products for individuals to
|
|
||||||
use, which is precisely where it is most unacceptable. Therefore, we
|
|
||||||
have designed this version of the GPL to prohibit the practice for those
|
|
||||||
products. If such problems arise substantially in other domains, we
|
|
||||||
stand ready to extend this provision to those domains in future versions
|
|
||||||
of the GPL, as needed to protect the freedom of users.
|
|
||||||
|
|
||||||
Finally, every program is threatened constantly by software patents.
|
|
||||||
States should not allow patents to restrict development and use of
|
|
||||||
software on general-purpose computers, but in those that do, we wish to
|
|
||||||
avoid the special danger that patents applied to a free program could
|
|
||||||
make it effectively proprietary. To prevent this, the GPL assures that
|
|
||||||
patents cannot be used to render the program non-free.
|
|
||||||
|
|
||||||
The precise terms and conditions for copying, distribution and
|
|
||||||
modification follow.
|
|
||||||
|
|
||||||
TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
0. Definitions.
|
|
||||||
|
|
||||||
"This License" refers to version 3 of the GNU General Public License.
|
|
||||||
|
|
||||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
|
||||||
works, such as semiconductor masks.
|
|
||||||
|
|
||||||
"The Program" refers to any copyrightable work licensed under this
|
|
||||||
License. Each licensee is addressed as "you". "Licensees" and
|
|
||||||
"recipients" may be individuals or organizations.
|
|
||||||
|
|
||||||
To "modify" a work means to copy from or adapt all or part of the work
|
|
||||||
in a fashion requiring copyright permission, other than the making of an
|
|
||||||
exact copy. The resulting work is called a "modified version" of the
|
|
||||||
earlier work or a work "based on" the earlier work.
|
|
||||||
|
|
||||||
A "covered work" means either the unmodified Program or a work based
|
|
||||||
on the Program.
|
|
||||||
|
|
||||||
To "propagate" a work means to do anything with it that, without
|
|
||||||
permission, would make you directly or secondarily liable for
|
|
||||||
infringement under applicable copyright law, except executing it on a
|
|
||||||
computer or modifying a private copy. Propagation includes copying,
|
|
||||||
distribution (with or without modification), making available to the
|
|
||||||
public, and in some countries other activities as well.
|
|
||||||
|
|
||||||
To "convey" a work means any kind of propagation that enables other
|
|
||||||
parties to make or receive copies. Mere interaction with a user through
|
|
||||||
a computer network, with no transfer of a copy, is not conveying.
|
|
||||||
|
|
||||||
An interactive user interface displays "Appropriate Legal Notices"
|
|
||||||
to the extent that it includes a convenient and prominently visible
|
|
||||||
feature that (1) displays an appropriate copyright notice, and (2)
|
|
||||||
tells the user that there is no warranty for the work (except to the
|
|
||||||
extent that warranties are provided), that licensees may convey the
|
|
||||||
work under this License, and how to view a copy of this License. If
|
|
||||||
the interface presents a list of user commands or options, such as a
|
|
||||||
menu, a prominent item in the list meets this criterion.
|
|
||||||
|
|
||||||
1. Source Code.
|
|
||||||
|
|
||||||
The "source code" for a work means the preferred form of the work
|
|
||||||
for making modifications to it. "Object code" means any non-source
|
|
||||||
form of a work.
|
|
||||||
|
|
||||||
A "Standard Interface" means an interface that either is an official
|
|
||||||
standard defined by a recognized standards body, or, in the case of
|
|
||||||
interfaces specified for a particular programming language, one that
|
|
||||||
is widely used among developers working in that language.
|
|
||||||
|
|
||||||
The "System Libraries" of an executable work include anything, other
|
|
||||||
than the work as a whole, that (a) is included in the normal form of
|
|
||||||
packaging a Major Component, but which is not part of that Major
|
|
||||||
Component, and (b) serves only to enable use of the work with that
|
|
||||||
Major Component, or to implement a Standard Interface for which an
|
|
||||||
implementation is available to the public in source code form. A
|
|
||||||
"Major Component", in this context, means a major essential component
|
|
||||||
(kernel, window system, and so on) of the specific operating system
|
|
||||||
(if any) on which the executable work runs, or a compiler used to
|
|
||||||
produce the work, or an object code interpreter used to run it.
|
|
||||||
|
|
||||||
The "Corresponding Source" for a work in object code form means all
|
|
||||||
the source code needed to generate, install, and (for an executable
|
|
||||||
work) run the object code and to modify the work, including scripts to
|
|
||||||
control those activities. However, it does not include the work's
|
|
||||||
System Libraries, or general-purpose tools or generally available free
|
|
||||||
programs which are used unmodified in performing those activities but
|
|
||||||
which are not part of the work. For example, Corresponding Source
|
|
||||||
includes interface definition files associated with source files for
|
|
||||||
the work, and the source code for shared libraries and dynamically
|
|
||||||
linked subprograms that the work is specifically designed to require,
|
|
||||||
such as by intimate data communication or control flow between those
|
|
||||||
subprograms and other parts of the work.
|
|
||||||
|
|
||||||
The Corresponding Source need not include anything that users
|
|
||||||
can regenerate automatically from other parts of the Corresponding
|
|
||||||
Source.
|
|
||||||
|
|
||||||
The Corresponding Source for a work in source code form is that
|
|
||||||
same work.
|
|
||||||
|
|
||||||
2. Basic Permissions.
|
|
||||||
|
|
||||||
All rights granted under this License are granted for the term of
|
|
||||||
copyright on the Program, and are irrevocable provided the stated
|
|
||||||
conditions are met. This License explicitly affirms your unlimited
|
|
||||||
permission to run the unmodified Program. The output from running a
|
|
||||||
covered work is covered by this License only if the output, given its
|
|
||||||
content, constitutes a covered work. This License acknowledges your
|
|
||||||
rights of fair use or other equivalent, as provided by copyright law.
|
|
||||||
|
|
||||||
You may make, run and propagate covered works that you do not
|
|
||||||
convey, without conditions so long as your license otherwise remains
|
|
||||||
in force. You may convey covered works to others for the sole purpose
|
|
||||||
of having them make modifications exclusively for you, or provide you
|
|
||||||
with facilities for running those works, provided that you comply with
|
|
||||||
the terms of this License in conveying all material for which you do
|
|
||||||
not control copyright. Those thus making or running the covered works
|
|
||||||
for you must do so exclusively on your behalf, under your direction
|
|
||||||
and control, on terms that prohibit them from making any copies of
|
|
||||||
your copyrighted material outside their relationship with you.
|
|
||||||
|
|
||||||
Conveying under any other circumstances is permitted solely under
|
|
||||||
the conditions stated below. Sublicensing is not allowed; section 10
|
|
||||||
makes it unnecessary.
|
|
||||||
|
|
||||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
|
||||||
|
|
||||||
No covered work shall be deemed part of an effective technological
|
|
||||||
measure under any applicable law fulfilling obligations under article
|
|
||||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
|
||||||
similar laws prohibiting or restricting circumvention of such
|
|
||||||
measures.
|
|
||||||
|
|
||||||
When you convey a covered work, you waive any legal power to forbid
|
|
||||||
circumvention of technological measures to the extent such circumvention
|
|
||||||
is effected by exercising rights under this License with respect to
|
|
||||||
the covered work, and you disclaim any intention to limit operation or
|
|
||||||
modification of the work as a means of enforcing, against the work's
|
|
||||||
users, your or third parties' legal rights to forbid circumvention of
|
|
||||||
technological measures.
|
|
||||||
|
|
||||||
4. Conveying Verbatim Copies.
|
|
||||||
|
|
||||||
You may convey verbatim copies of the Program's source code as you
|
|
||||||
receive it, in any medium, provided that you conspicuously and
|
|
||||||
appropriately publish on each copy an appropriate copyright notice;
|
|
||||||
keep intact all notices stating that this License and any
|
|
||||||
non-permissive terms added in accord with section 7 apply to the code;
|
|
||||||
keep intact all notices of the absence of any warranty; and give all
|
|
||||||
recipients a copy of this License along with the Program.
|
|
||||||
|
|
||||||
You may charge any price or no price for each copy that you convey,
|
|
||||||
and you may offer support or warranty protection for a fee.
|
|
||||||
|
|
||||||
5. Conveying Modified Source Versions.
|
|
||||||
|
|
||||||
You may convey a work based on the Program, or the modifications to
|
|
||||||
produce it from the Program, in the form of source code under the
|
|
||||||
terms of section 4, provided that you also meet all of these conditions:
|
|
||||||
|
|
||||||
a) The work must carry prominent notices stating that you modified
|
|
||||||
it, and giving a relevant date.
|
|
||||||
|
|
||||||
b) The work must carry prominent notices stating that it is
|
|
||||||
released under this License and any conditions added under section
|
|
||||||
7. This requirement modifies the requirement in section 4 to
|
|
||||||
"keep intact all notices".
|
|
||||||
|
|
||||||
c) You must license the entire work, as a whole, under this
|
|
||||||
License to anyone who comes into possession of a copy. This
|
|
||||||
License will therefore apply, along with any applicable section 7
|
|
||||||
additional terms, to the whole of the work, and all its parts,
|
|
||||||
regardless of how they are packaged. This License gives no
|
|
||||||
permission to license the work in any other way, but it does not
|
|
||||||
invalidate such permission if you have separately received it.
|
|
||||||
|
|
||||||
d) If the work has interactive user interfaces, each must display
|
|
||||||
Appropriate Legal Notices; however, if the Program has interactive
|
|
||||||
interfaces that do not display Appropriate Legal Notices, your
|
|
||||||
work need not make them do so.
|
|
||||||
|
|
||||||
A compilation of a covered work with other separate and independent
|
|
||||||
works, which are not by their nature extensions of the covered work,
|
|
||||||
and which are not combined with it such as to form a larger program,
|
|
||||||
in or on a volume of a storage or distribution medium, is called an
|
|
||||||
"aggregate" if the compilation and its resulting copyright are not
|
|
||||||
used to limit the access or legal rights of the compilation's users
|
|
||||||
beyond what the individual works permit. Inclusion of a covered work
|
|
||||||
in an aggregate does not cause this License to apply to the other
|
|
||||||
parts of the aggregate.
|
|
||||||
|
|
||||||
6. Conveying Non-Source Forms.
|
|
||||||
|
|
||||||
You may convey a covered work in object code form under the terms
|
|
||||||
of sections 4 and 5, provided that you also convey the
|
|
||||||
machine-readable Corresponding Source under the terms of this License,
|
|
||||||
in one of these ways:
|
|
||||||
|
|
||||||
a) Convey the object code in, or embodied in, a physical product
|
|
||||||
(including a physical distribution medium), accompanied by the
|
|
||||||
Corresponding Source fixed on a durable physical medium
|
|
||||||
customarily used for software interchange.
|
|
||||||
|
|
||||||
b) Convey the object code in, or embodied in, a physical product
|
|
||||||
(including a physical distribution medium), accompanied by a
|
|
||||||
written offer, valid for at least three years and valid for as
|
|
||||||
long as you offer spare parts or customer support for that product
|
|
||||||
model, to give anyone who possesses the object code either (1) a
|
|
||||||
copy of the Corresponding Source for all the software in the
|
|
||||||
product that is covered by this License, on a durable physical
|
|
||||||
medium customarily used for software interchange, for a price no
|
|
||||||
more than your reasonable cost of physically performing this
|
|
||||||
conveying of source, or (2) access to copy the
|
|
||||||
Corresponding Source from a network server at no charge.
|
|
||||||
|
|
||||||
c) Convey individual copies of the object code with a copy of the
|
|
||||||
written offer to provide the Corresponding Source. This
|
|
||||||
alternative is allowed only occasionally and noncommercially, and
|
|
||||||
only if you received the object code with such an offer, in accord
|
|
||||||
with subsection 6b.
|
|
||||||
|
|
||||||
d) Convey the object code by offering access from a designated
|
|
||||||
place (gratis or for a charge), and offer equivalent access to the
|
|
||||||
Corresponding Source in the same way through the same place at no
|
|
||||||
further charge. You need not require recipients to copy the
|
|
||||||
Corresponding Source along with the object code. If the place to
|
|
||||||
copy the object code is a network server, the Corresponding Source
|
|
||||||
may be on a different server (operated by you or a third party)
|
|
||||||
that supports equivalent copying facilities, provided you maintain
|
|
||||||
clear directions next to the object code saying where to find the
|
|
||||||
Corresponding Source. Regardless of what server hosts the
|
|
||||||
Corresponding Source, you remain obligated to ensure that it is
|
|
||||||
available for as long as needed to satisfy these requirements.
|
|
||||||
|
|
||||||
e) Convey the object code using peer-to-peer transmission, provided
|
|
||||||
you inform other peers where the object code and Corresponding
|
|
||||||
Source of the work are being offered to the general public at no
|
|
||||||
charge under subsection 6d.
|
|
||||||
|
|
||||||
A separable portion of the object code, whose source code is excluded
|
|
||||||
from the Corresponding Source as a System Library, need not be
|
|
||||||
included in conveying the object code work.
|
|
||||||
|
|
||||||
A "User Product" is either (1) a "consumer product", which means any
|
|
||||||
tangible personal property which is normally used for personal, family,
|
|
||||||
or household purposes, or (2) anything designed or sold for incorporation
|
|
||||||
into a dwelling. In determining whether a product is a consumer product,
|
|
||||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
|
||||||
product received by a particular user, "normally used" refers to a
|
|
||||||
typical or common use of that class of product, regardless of the status
|
|
||||||
of the particular user or of the way in which the particular user
|
|
||||||
actually uses, or expects or is expected to use, the product. A product
|
|
||||||
is a consumer product regardless of whether the product has substantial
|
|
||||||
commercial, industrial or non-consumer uses, unless such uses represent
|
|
||||||
the only significant mode of use of the product.
|
|
||||||
|
|
||||||
"Installation Information" for a User Product means any methods,
|
|
||||||
procedures, authorization keys, or other information required to install
|
|
||||||
and execute modified versions of a covered work in that User Product from
|
|
||||||
a modified version of its Corresponding Source. The information must
|
|
||||||
suffice to ensure that the continued functioning of the modified object
|
|
||||||
code is in no case prevented or interfered with solely because
|
|
||||||
modification has been made.
|
|
||||||
|
|
||||||
If you convey an object code work under this section in, or with, or
|
|
||||||
specifically for use in, a User Product, and the conveying occurs as
|
|
||||||
part of a transaction in which the right of possession and use of the
|
|
||||||
User Product is transferred to the recipient in perpetuity or for a
|
|
||||||
fixed term (regardless of how the transaction is characterized), the
|
|
||||||
Corresponding Source conveyed under this section must be accompanied
|
|
||||||
by the Installation Information. But this requirement does not apply
|
|
||||||
if neither you nor any third party retains the ability to install
|
|
||||||
modified object code on the User Product (for example, the work has
|
|
||||||
been installed in ROM).
|
|
||||||
|
|
||||||
The requirement to provide Installation Information does not include a
|
|
||||||
requirement to continue to provide support service, warranty, or updates
|
|
||||||
for a work that has been modified or installed by the recipient, or for
|
|
||||||
the User Product in which it has been modified or installed. Access to a
|
|
||||||
network may be denied when the modification itself materially and
|
|
||||||
adversely affects the operation of the network or violates the rules and
|
|
||||||
protocols for communication across the network.
|
|
||||||
|
|
||||||
Corresponding Source conveyed, and Installation Information provided,
|
|
||||||
in accord with this section must be in a format that is publicly
|
|
||||||
documented (and with an implementation available to the public in
|
|
||||||
source code form), and must require no special password or key for
|
|
||||||
unpacking, reading or copying.
|
|
||||||
|
|
||||||
7. Additional Terms.
|
|
||||||
|
|
||||||
"Additional permissions" are terms that supplement the terms of this
|
|
||||||
License by making exceptions from one or more of its conditions.
|
|
||||||
Additional permissions that are applicable to the entire Program shall
|
|
||||||
be treated as though they were included in this License, to the extent
|
|
||||||
that they are valid under applicable law. If additional permissions
|
|
||||||
apply only to part of the Program, that part may be used separately
|
|
||||||
under those permissions, but the entire Program remains governed by
|
|
||||||
this License without regard to the additional permissions.
|
|
||||||
|
|
||||||
When you convey a copy of a covered work, you may at your option
|
|
||||||
remove any additional permissions from that copy, or from any part of
|
|
||||||
it. (Additional permissions may be written to require their own
|
|
||||||
removal in certain cases when you modify the work.) You may place
|
|
||||||
additional permissions on material, added by you to a covered work,
|
|
||||||
for which you have or can give appropriate copyright permission.
|
|
||||||
|
|
||||||
Notwithstanding any other provision of this License, for material you
|
|
||||||
add to a covered work, you may (if authorized by the copyright holders of
|
|
||||||
that material) supplement the terms of this License with terms:
|
|
||||||
|
|
||||||
a) Disclaiming warranty or limiting liability differently from the
|
|
||||||
terms of sections 15 and 16 of this License; or
|
|
||||||
|
|
||||||
b) Requiring preservation of specified reasonable legal notices or
|
|
||||||
author attributions in that material or in the Appropriate Legal
|
|
||||||
Notices displayed by works containing it; or
|
|
||||||
|
|
||||||
c) Prohibiting misrepresentation of the origin of that material, or
|
|
||||||
requiring that modified versions of such material be marked in
|
|
||||||
reasonable ways as different from the original version; or
|
|
||||||
|
|
||||||
d) Limiting the use for publicity purposes of names of licensors or
|
|
||||||
authors of the material; or
|
|
||||||
|
|
||||||
e) Declining to grant rights under trademark law for use of some
|
|
||||||
trade names, trademarks, or service marks; or
|
|
||||||
|
|
||||||
f) Requiring indemnification of licensors and authors of that
|
|
||||||
material by anyone who conveys the material (or modified versions of
|
|
||||||
it) with contractual assumptions of liability to the recipient, for
|
|
||||||
any liability that these contractual assumptions directly impose on
|
|
||||||
those licensors and authors.
|
|
||||||
|
|
||||||
All other non-permissive additional terms are considered "further
|
|
||||||
restrictions" within the meaning of section 10. If the Program as you
|
|
||||||
received it, or any part of it, contains a notice stating that it is
|
|
||||||
governed by this License along with a term that is a further
|
|
||||||
restriction, you may remove that term. If a license document contains
|
|
||||||
a further restriction but permits relicensing or conveying under this
|
|
||||||
License, you may add to a covered work material governed by the terms
|
|
||||||
of that license document, provided that the further restriction does
|
|
||||||
not survive such relicensing or conveying.
|
|
||||||
|
|
||||||
If you add terms to a covered work in accord with this section, you
|
|
||||||
must place, in the relevant source files, a statement of the
|
|
||||||
additional terms that apply to those files, or a notice indicating
|
|
||||||
where to find the applicable terms.
|
|
||||||
|
|
||||||
Additional terms, permissive or non-permissive, may be stated in the
|
|
||||||
form of a separately written license, or stated as exceptions;
|
|
||||||
the above requirements apply either way.
|
|
||||||
|
|
||||||
8. Termination.
|
|
||||||
|
|
||||||
You may not propagate or modify a covered work except as expressly
|
|
||||||
provided under this License. Any attempt otherwise to propagate or
|
|
||||||
modify it is void, and will automatically terminate your rights under
|
|
||||||
this License (including any patent licenses granted under the third
|
|
||||||
paragraph of section 11).
|
|
||||||
|
|
||||||
However, if you cease all violation of this License, then your
|
|
||||||
license from a particular copyright holder is reinstated (a)
|
|
||||||
provisionally, unless and until the copyright holder explicitly and
|
|
||||||
finally terminates your license, and (b) permanently, if the copyright
|
|
||||||
holder fails to notify you of the violation by some reasonable means
|
|
||||||
prior to 60 days after the cessation.
|
|
||||||
|
|
||||||
Moreover, your license from a particular copyright holder is
|
|
||||||
reinstated permanently if the copyright holder notifies you of the
|
|
||||||
violation by some reasonable means, this is the first time you have
|
|
||||||
received notice of violation of this License (for any work) from that
|
|
||||||
copyright holder, and you cure the violation prior to 30 days after
|
|
||||||
your receipt of the notice.
|
|
||||||
|
|
||||||
Termination of your rights under this section does not terminate the
|
|
||||||
licenses of parties who have received copies or rights from you under
|
|
||||||
this License. If your rights have been terminated and not permanently
|
|
||||||
reinstated, you do not qualify to receive new licenses for the same
|
|
||||||
material under section 10.
|
|
||||||
|
|
||||||
9. Acceptance Not Required for Having Copies.
|
|
||||||
|
|
||||||
You are not required to accept this License in order to receive or
|
|
||||||
run a copy of the Program. Ancillary propagation of a covered work
|
|
||||||
occurring solely as a consequence of using peer-to-peer transmission
|
|
||||||
to receive a copy likewise does not require acceptance. However,
|
|
||||||
nothing other than this License grants you permission to propagate or
|
|
||||||
modify any covered work. These actions infringe copyright if you do
|
|
||||||
not accept this License. Therefore, by modifying or propagating a
|
|
||||||
covered work, you indicate your acceptance of this License to do so.
|
|
||||||
|
|
||||||
10. Automatic Licensing of Downstream Recipients.
|
|
||||||
|
|
||||||
Each time you convey a covered work, the recipient automatically
|
|
||||||
receives a license from the original licensors, to run, modify and
|
|
||||||
propagate that work, subject to this License. You are not responsible
|
|
||||||
for enforcing compliance by third parties with this License.
|
|
||||||
|
|
||||||
An "entity transaction" is a transaction transferring control of an
|
|
||||||
organization, or substantially all assets of one, or subdividing an
|
|
||||||
organization, or merging organizations. If propagation of a covered
|
|
||||||
work results from an entity transaction, each party to that
|
|
||||||
transaction who receives a copy of the work also receives whatever
|
|
||||||
licenses to the work the party's predecessor in interest had or could
|
|
||||||
give under the previous paragraph, plus a right to possession of the
|
|
||||||
Corresponding Source of the work from the predecessor in interest, if
|
|
||||||
the predecessor has it or can get it with reasonable efforts.
|
|
||||||
|
|
||||||
You may not impose any further restrictions on the exercise of the
|
|
||||||
rights granted or affirmed under this License. For example, you may
|
|
||||||
not impose a license fee, royalty, or other charge for exercise of
|
|
||||||
rights granted under this License, and you may not initiate litigation
|
|
||||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
|
||||||
any patent claim is infringed by making, using, selling, offering for
|
|
||||||
sale, or importing the Program or any portion of it.
|
|
||||||
|
|
||||||
11. Patents.
|
|
||||||
|
|
||||||
A "contributor" is a copyright holder who authorizes use under this
|
|
||||||
License of the Program or a work on which the Program is based. The
|
|
||||||
work thus licensed is called the contributor's "contributor version".
|
|
||||||
|
|
||||||
A contributor's "essential patent claims" are all patent claims
|
|
||||||
owned or controlled by the contributor, whether already acquired or
|
|
||||||
hereafter acquired, that would be infringed by some manner, permitted
|
|
||||||
by this License, of making, using, or selling its contributor version,
|
|
||||||
but do not include claims that would be infringed only as a
|
|
||||||
consequence of further modification of the contributor version. For
|
|
||||||
purposes of this definition, "control" includes the right to grant
|
|
||||||
patent sublicenses in a manner consistent with the requirements of
|
|
||||||
this License.
|
|
||||||
|
|
||||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
|
||||||
patent license under the contributor's essential patent claims, to
|
|
||||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
|
||||||
propagate the contents of its contributor version.
|
|
||||||
|
|
||||||
In the following three paragraphs, a "patent license" is any express
|
|
||||||
agreement or commitment, however denominated, not to enforce a patent
|
|
||||||
(such as an express permission to practice a patent or covenant not to
|
|
||||||
sue for patent infringement). To "grant" such a patent license to a
|
|
||||||
party means to make such an agreement or commitment not to enforce a
|
|
||||||
patent against the party.
|
|
||||||
|
|
||||||
If you convey a covered work, knowingly relying on a patent license,
|
|
||||||
and the Corresponding Source of the work is not available for anyone
|
|
||||||
to copy, free of charge and under the terms of this License, through a
|
|
||||||
publicly available network server or other readily accessible means,
|
|
||||||
then you must either (1) cause the Corresponding Source to be so
|
|
||||||
available, or (2) arrange to deprive yourself of the benefit of the
|
|
||||||
patent license for this particular work, or (3) arrange, in a manner
|
|
||||||
consistent with the requirements of this License, to extend the patent
|
|
||||||
license to downstream recipients. "Knowingly relying" means you have
|
|
||||||
actual knowledge that, but for the patent license, your conveying the
|
|
||||||
covered work in a country, or your recipient's use of the covered work
|
|
||||||
in a country, would infringe one or more identifiable patents in that
|
|
||||||
country that you have reason to believe are valid.
|
|
||||||
|
|
||||||
If, pursuant to or in connection with a single transaction or
|
|
||||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
|
||||||
covered work, and grant a patent license to some of the parties
|
|
||||||
receiving the covered work authorizing them to use, propagate, modify
|
|
||||||
or convey a specific copy of the covered work, then the patent license
|
|
||||||
you grant is automatically extended to all recipients of the covered
|
|
||||||
work and works based on it.
|
|
||||||
|
|
||||||
A patent license is "discriminatory" if it does not include within
|
|
||||||
the scope of its coverage, prohibits the exercise of, or is
|
|
||||||
conditioned on the non-exercise of one or more of the rights that are
|
|
||||||
specifically granted under this License. You may not convey a covered
|
|
||||||
work if you are a party to an arrangement with a third party that is
|
|
||||||
in the business of distributing software, under which you make payment
|
|
||||||
to the third party based on the extent of your activity of conveying
|
|
||||||
the work, and under which the third party grants, to any of the
|
|
||||||
parties who would receive the covered work from you, a discriminatory
|
|
||||||
patent license (a) in connection with copies of the covered work
|
|
||||||
conveyed by you (or copies made from those copies), or (b) primarily
|
|
||||||
for and in connection with specific products or compilations that
|
|
||||||
contain the covered work, unless you entered into that arrangement,
|
|
||||||
or that patent license was granted, prior to 28 March 2007.
|
|
||||||
|
|
||||||
Nothing in this License shall be construed as excluding or limiting
|
|
||||||
any implied license or other defenses to infringement that may
|
|
||||||
otherwise be available to you under applicable patent law.
|
|
||||||
|
|
||||||
12. No Surrender of Others' Freedom.
|
|
||||||
|
|
||||||
If conditions are imposed on you (whether by court order, agreement or
|
|
||||||
otherwise) that contradict the conditions of this License, they do not
|
|
||||||
excuse you from the conditions of this License. If you cannot convey a
|
|
||||||
covered work so as to satisfy simultaneously your obligations under this
|
|
||||||
License and any other pertinent obligations, then as a consequence you may
|
|
||||||
not convey it at all. For example, if you agree to terms that obligate you
|
|
||||||
to collect a royalty for further conveying from those to whom you convey
|
|
||||||
the Program, the only way you could satisfy both those terms and this
|
|
||||||
License would be to refrain entirely from conveying the Program.
|
|
||||||
|
|
||||||
13. Use with the GNU Affero General Public License.
|
|
||||||
|
|
||||||
Notwithstanding any other provision of this License, you have
|
|
||||||
permission to link or combine any covered work with a work licensed
|
|
||||||
under version 3 of the GNU Affero General Public License into a single
|
|
||||||
combined work, and to convey the resulting work. The terms of this
|
|
||||||
License will continue to apply to the part which is the covered work,
|
|
||||||
but the special requirements of the GNU Affero General Public License,
|
|
||||||
section 13, concerning interaction through a network will apply to the
|
|
||||||
combination as such.
|
|
||||||
|
|
||||||
14. Revised Versions of this License.
|
|
||||||
|
|
||||||
The Free Software Foundation may publish revised and/or new versions of
|
|
||||||
the GNU General Public License from time to time. Such new versions will
|
|
||||||
be similar in spirit to the present version, but may differ in detail to
|
|
||||||
address new problems or concerns.
|
|
||||||
|
|
||||||
Each version is given a distinguishing version number. If the
|
|
||||||
Program specifies that a certain numbered version of the GNU General
|
|
||||||
Public License "or any later version" applies to it, you have the
|
|
||||||
option of following the terms and conditions either of that numbered
|
|
||||||
version or of any later version published by the Free Software
|
|
||||||
Foundation. If the Program does not specify a version number of the
|
|
||||||
GNU General Public License, you may choose any version ever published
|
|
||||||
by the Free Software Foundation.
|
|
||||||
|
|
||||||
If the Program specifies that a proxy can decide which future
|
|
||||||
versions of the GNU General Public License can be used, that proxy's
|
|
||||||
public statement of acceptance of a version permanently authorizes you
|
|
||||||
to choose that version for the Program.
|
|
||||||
|
|
||||||
Later license versions may give you additional or different
|
|
||||||
permissions. However, no additional obligations are imposed on any
|
|
||||||
author or copyright holder as a result of your choosing to follow a
|
|
||||||
later version.
|
|
||||||
|
|
||||||
15. Disclaimer of Warranty.
|
|
||||||
|
|
||||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
|
||||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
|
||||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
|
||||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
|
||||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
|
||||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
|
||||||
|
|
||||||
16. Limitation of Liability.
|
|
||||||
|
|
||||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
|
||||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
|
||||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
|
||||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
|
||||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
|
||||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
|
||||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
|
||||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
|
||||||
SUCH DAMAGES.
|
|
||||||
|
|
||||||
17. Interpretation of Sections 15 and 16.
|
|
||||||
|
|
||||||
If the disclaimer of warranty and limitation of liability provided
|
|
||||||
above cannot be given local legal effect according to their terms,
|
|
||||||
reviewing courts shall apply local law that most closely approximates
|
|
||||||
an absolute waiver of all civil liability in connection with the
|
|
||||||
Program, unless a warranty or assumption of liability accompanies a
|
|
||||||
copy of the Program in return for a fee.
|
|
||||||
|
|
||||||
END OF TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
How to Apply These Terms to Your New Programs
|
|
||||||
|
|
||||||
If you develop a new program, and you want it to be of the greatest
|
|
||||||
possible use to the public, the best way to achieve this is to make it
|
|
||||||
free software which everyone can redistribute and change under these terms.
|
|
||||||
|
|
||||||
To do so, attach the following notices to the program. It is safest
|
|
||||||
to attach them to the start of each source file to most effectively
|
|
||||||
state the exclusion of warranty; and each file should have at least
|
|
||||||
the "copyright" line and a pointer to where the full notice is found.
|
|
||||||
|
|
||||||
<one line to give the program's name and a brief idea of what it does.>
|
|
||||||
Copyright (C) <year> <name of author>
|
|
||||||
|
|
||||||
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 3 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, see <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
Also add information on how to contact you by electronic and paper mail.
|
|
||||||
|
|
||||||
If the program does terminal interaction, make it output a short
|
|
||||||
notice like this when it starts in an interactive mode:
|
|
||||||
|
|
||||||
<program> Copyright (C) <year> <name of author>
|
|
||||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
|
||||||
This is free software, and you are welcome to redistribute it
|
|
||||||
under certain conditions; type `show c' for details.
|
|
||||||
|
|
||||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
|
||||||
parts of the General Public License. Of course, your program's commands
|
|
||||||
might be different; for a GUI interface, you would use an "about box".
|
|
||||||
|
|
||||||
You should also get your employer (if you work as a programmer) or school,
|
|
||||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
|
||||||
For more information on this, and how to apply and follow the GNU GPL, see
|
|
||||||
<http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
The GNU General Public License does not permit incorporating your program
|
|
||||||
into proprietary programs. If your program is a subroutine library, you
|
|
||||||
may consider it more useful to permit linking proprietary applications with
|
|
||||||
the library. If this is what you want to do, use the GNU Lesser General
|
|
||||||
Public License instead of this License. But first, please read
|
|
||||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
|
||||||
502
COPYING.LGPLv2.1
502
COPYING.LGPLv2.1
@@ -1,502 +0,0 @@
|
|||||||
GNU LESSER GENERAL PUBLIC LICENSE
|
|
||||||
Version 2.1, February 1999
|
|
||||||
|
|
||||||
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
|
|
||||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
||||||
Everyone is permitted to copy and distribute verbatim copies
|
|
||||||
of this license document, but changing it is not allowed.
|
|
||||||
|
|
||||||
[This is the first released version of the Lesser GPL. It also counts
|
|
||||||
as the successor of the GNU Library Public License, version 2, hence
|
|
||||||
the version number 2.1.]
|
|
||||||
|
|
||||||
Preamble
|
|
||||||
|
|
||||||
The licenses for most software are designed to take away your
|
|
||||||
freedom to share and change it. By contrast, the GNU General Public
|
|
||||||
Licenses are intended to guarantee your freedom to share and change
|
|
||||||
free software--to make sure the software is free for all its users.
|
|
||||||
|
|
||||||
This license, the Lesser General Public License, applies to some
|
|
||||||
specially designated software packages--typically libraries--of the
|
|
||||||
Free Software Foundation and other authors who decide to use it. You
|
|
||||||
can use it too, but we suggest you first think carefully about whether
|
|
||||||
this license or the ordinary General Public License is the better
|
|
||||||
strategy to use in any particular case, based on the explanations below.
|
|
||||||
|
|
||||||
When we speak of free software, we are referring to freedom of use,
|
|
||||||
not price. Our General Public Licenses are designed to make sure that
|
|
||||||
you have the freedom to distribute copies of free software (and charge
|
|
||||||
for this service if you wish); that you receive source code or can get
|
|
||||||
it if you want it; that you can change the software and use pieces of
|
|
||||||
it in new free programs; and that you are informed that you can do
|
|
||||||
these things.
|
|
||||||
|
|
||||||
To protect your rights, we need to make restrictions that forbid
|
|
||||||
distributors to deny you these rights or to ask you to surrender these
|
|
||||||
rights. These restrictions translate to certain responsibilities for
|
|
||||||
you if you distribute copies of the library or if you modify it.
|
|
||||||
|
|
||||||
For example, if you distribute copies of the library, whether gratis
|
|
||||||
or for a fee, you must give the recipients all the rights that we gave
|
|
||||||
you. You must make sure that they, too, receive or can get the source
|
|
||||||
code. If you link other code with the library, you must provide
|
|
||||||
complete object files to the recipients, so that they can relink them
|
|
||||||
with the library after making changes to the library and recompiling
|
|
||||||
it. And you must show them these terms so they know their rights.
|
|
||||||
|
|
||||||
We protect your rights with a two-step method: (1) we copyright the
|
|
||||||
library, and (2) we offer you this license, which gives you legal
|
|
||||||
permission to copy, distribute and/or modify the library.
|
|
||||||
|
|
||||||
To protect each distributor, we want to make it very clear that
|
|
||||||
there is no warranty for the free library. Also, if the library is
|
|
||||||
modified by someone else and passed on, the recipients should know
|
|
||||||
that what they have is not the original version, so that the original
|
|
||||||
author's reputation will not be affected by problems that might be
|
|
||||||
introduced by others.
|
|
||||||
|
|
||||||
Finally, software patents pose a constant threat to the existence of
|
|
||||||
any free program. We wish to make sure that a company cannot
|
|
||||||
effectively restrict the users of a free program by obtaining a
|
|
||||||
restrictive license from a patent holder. Therefore, we insist that
|
|
||||||
any patent license obtained for a version of the library must be
|
|
||||||
consistent with the full freedom of use specified in this license.
|
|
||||||
|
|
||||||
Most GNU software, including some libraries, is covered by the
|
|
||||||
ordinary GNU General Public License. This license, the GNU Lesser
|
|
||||||
General Public License, applies to certain designated libraries, and
|
|
||||||
is quite different from the ordinary General Public License. We use
|
|
||||||
this license for certain libraries in order to permit linking those
|
|
||||||
libraries into non-free programs.
|
|
||||||
|
|
||||||
When a program is linked with a library, whether statically or using
|
|
||||||
a shared library, the combination of the two is legally speaking a
|
|
||||||
combined work, a derivative of the original library. The ordinary
|
|
||||||
General Public License therefore permits such linking only if the
|
|
||||||
entire combination fits its criteria of freedom. The Lesser General
|
|
||||||
Public License permits more lax criteria for linking other code with
|
|
||||||
the library.
|
|
||||||
|
|
||||||
We call this license the "Lesser" General Public License because it
|
|
||||||
does Less to protect the user's freedom than the ordinary General
|
|
||||||
Public License. It also provides other free software developers Less
|
|
||||||
of an advantage over competing non-free programs. These disadvantages
|
|
||||||
are the reason we use the ordinary General Public License for many
|
|
||||||
libraries. However, the Lesser license provides advantages in certain
|
|
||||||
special circumstances.
|
|
||||||
|
|
||||||
For example, on rare occasions, there may be a special need to
|
|
||||||
encourage the widest possible use of a certain library, so that it becomes
|
|
||||||
a de-facto standard. To achieve this, non-free programs must be
|
|
||||||
allowed to use the library. A more frequent case is that a free
|
|
||||||
library does the same job as widely used non-free libraries. In this
|
|
||||||
case, there is little to gain by limiting the free library to free
|
|
||||||
software only, so we use the Lesser General Public License.
|
|
||||||
|
|
||||||
In other cases, permission to use a particular library in non-free
|
|
||||||
programs enables a greater number of people to use a large body of
|
|
||||||
free software. For example, permission to use the GNU C Library in
|
|
||||||
non-free programs enables many more people to use the whole GNU
|
|
||||||
operating system, as well as its variant, the GNU/Linux operating
|
|
||||||
system.
|
|
||||||
|
|
||||||
Although the Lesser General Public License is Less protective of the
|
|
||||||
users' freedom, it does ensure that the user of a program that is
|
|
||||||
linked with the Library has the freedom and the wherewithal to run
|
|
||||||
that program using a modified version of the Library.
|
|
||||||
|
|
||||||
The precise terms and conditions for copying, distribution and
|
|
||||||
modification follow. Pay close attention to the difference between a
|
|
||||||
"work based on the library" and a "work that uses the library". The
|
|
||||||
former contains code derived from the library, whereas the latter must
|
|
||||||
be combined with the library in order to run.
|
|
||||||
|
|
||||||
GNU LESSER GENERAL PUBLIC LICENSE
|
|
||||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
|
||||||
|
|
||||||
0. This License Agreement applies to any software library or other
|
|
||||||
program which contains a notice placed by the copyright holder or
|
|
||||||
other authorized party saying it may be distributed under the terms of
|
|
||||||
this Lesser General Public License (also called "this License").
|
|
||||||
Each licensee is addressed as "you".
|
|
||||||
|
|
||||||
A "library" means a collection of software functions and/or data
|
|
||||||
prepared so as to be conveniently linked with application programs
|
|
||||||
(which use some of those functions and data) to form executables.
|
|
||||||
|
|
||||||
The "Library", below, refers to any such software library or work
|
|
||||||
which has been distributed under these terms. A "work based on the
|
|
||||||
Library" means either the Library or any derivative work under
|
|
||||||
copyright law: that is to say, a work containing the Library or a
|
|
||||||
portion of it, either verbatim or with modifications and/or translated
|
|
||||||
straightforwardly into another language. (Hereinafter, translation is
|
|
||||||
included without limitation in the term "modification".)
|
|
||||||
|
|
||||||
"Source code" for a work means the preferred form of the work for
|
|
||||||
making modifications to it. For a library, complete source code means
|
|
||||||
all the source code for all modules it contains, plus any associated
|
|
||||||
interface definition files, plus the scripts used to control compilation
|
|
||||||
and installation of the library.
|
|
||||||
|
|
||||||
Activities other than copying, distribution and modification are not
|
|
||||||
covered by this License; they are outside its scope. The act of
|
|
||||||
running a program using the Library is not restricted, and output from
|
|
||||||
such a program is covered only if its contents constitute a work based
|
|
||||||
on the Library (independent of the use of the Library in a tool for
|
|
||||||
writing it). Whether that is true depends on what the Library does
|
|
||||||
and what the program that uses the Library does.
|
|
||||||
|
|
||||||
1. You may copy and distribute verbatim copies of the Library's
|
|
||||||
complete source code as you receive it, in any medium, provided that
|
|
||||||
you conspicuously and appropriately publish on each copy an
|
|
||||||
appropriate copyright notice and disclaimer of warranty; keep intact
|
|
||||||
all the notices that refer to this License and to the absence of any
|
|
||||||
warranty; and distribute a copy of this License along with the
|
|
||||||
Library.
|
|
||||||
|
|
||||||
You may charge a fee for the physical act of transferring a copy,
|
|
||||||
and you may at your option offer warranty protection in exchange for a
|
|
||||||
fee.
|
|
||||||
|
|
||||||
2. You may modify your copy or copies of the Library or any portion
|
|
||||||
of it, thus forming a work based on the Library, and copy and
|
|
||||||
distribute such modifications or work under the terms of Section 1
|
|
||||||
above, provided that you also meet all of these conditions:
|
|
||||||
|
|
||||||
a) The modified work must itself be a software library.
|
|
||||||
|
|
||||||
b) You must cause the files modified to carry prominent notices
|
|
||||||
stating that you changed the files and the date of any change.
|
|
||||||
|
|
||||||
c) You must cause the whole of the work to be licensed at no
|
|
||||||
charge to all third parties under the terms of this License.
|
|
||||||
|
|
||||||
d) If a facility in the modified Library refers to a function or a
|
|
||||||
table of data to be supplied by an application program that uses
|
|
||||||
the facility, other than as an argument passed when the facility
|
|
||||||
is invoked, then you must make a good faith effort to ensure that,
|
|
||||||
in the event an application does not supply such function or
|
|
||||||
table, the facility still operates, and performs whatever part of
|
|
||||||
its purpose remains meaningful.
|
|
||||||
|
|
||||||
(For example, a function in a library to compute square roots has
|
|
||||||
a purpose that is entirely well-defined independent of the
|
|
||||||
application. Therefore, Subsection 2d requires that any
|
|
||||||
application-supplied function or table used by this function must
|
|
||||||
be optional: if the application does not supply it, the square
|
|
||||||
root function must still compute square roots.)
|
|
||||||
|
|
||||||
These requirements apply to the modified work as a whole. If
|
|
||||||
identifiable sections of that work are not derived from the Library,
|
|
||||||
and can be reasonably considered independent and separate works in
|
|
||||||
themselves, then this License, and its terms, do not apply to those
|
|
||||||
sections when you distribute them as separate works. But when you
|
|
||||||
distribute the same sections as part of a whole which is a work based
|
|
||||||
on the Library, the distribution of the whole must be on the terms of
|
|
||||||
this License, whose permissions for other licensees extend to the
|
|
||||||
entire whole, and thus to each and every part regardless of who wrote
|
|
||||||
it.
|
|
||||||
|
|
||||||
Thus, it is not the intent of this section to claim rights or contest
|
|
||||||
your rights to work written entirely by you; rather, the intent is to
|
|
||||||
exercise the right to control the distribution of derivative or
|
|
||||||
collective works based on the Library.
|
|
||||||
|
|
||||||
In addition, mere aggregation of another work not based on the Library
|
|
||||||
with the Library (or with a work based on the Library) on a volume of
|
|
||||||
a storage or distribution medium does not bring the other work under
|
|
||||||
the scope of this License.
|
|
||||||
|
|
||||||
3. You may opt to apply the terms of the ordinary GNU General Public
|
|
||||||
License instead of this License to a given copy of the Library. To do
|
|
||||||
this, you must alter all the notices that refer to this License, so
|
|
||||||
that they refer to the ordinary GNU General Public License, version 2,
|
|
||||||
instead of to this License. (If a newer version than version 2 of the
|
|
||||||
ordinary GNU General Public License has appeared, then you can specify
|
|
||||||
that version instead if you wish.) Do not make any other change in
|
|
||||||
these notices.
|
|
||||||
|
|
||||||
Once this change is made in a given copy, it is irreversible for
|
|
||||||
that copy, so the ordinary GNU General Public License applies to all
|
|
||||||
subsequent copies and derivative works made from that copy.
|
|
||||||
|
|
||||||
This option is useful when you wish to copy part of the code of
|
|
||||||
the Library into a program that is not a library.
|
|
||||||
|
|
||||||
4. You may copy and distribute the Library (or a portion or
|
|
||||||
derivative of it, under Section 2) in object code or executable form
|
|
||||||
under the terms of Sections 1 and 2 above provided that you accompany
|
|
||||||
it with the complete corresponding machine-readable source code, which
|
|
||||||
must be distributed under the terms of Sections 1 and 2 above on a
|
|
||||||
medium customarily used for software interchange.
|
|
||||||
|
|
||||||
If distribution of object code is made by offering access to copy
|
|
||||||
from a designated place, then offering equivalent access to copy the
|
|
||||||
source code from the same place satisfies the requirement to
|
|
||||||
distribute the source code, even though third parties are not
|
|
||||||
compelled to copy the source along with the object code.
|
|
||||||
|
|
||||||
5. A program that contains no derivative of any portion of the
|
|
||||||
Library, but is designed to work with the Library by being compiled or
|
|
||||||
linked with it, is called a "work that uses the Library". Such a
|
|
||||||
work, in isolation, is not a derivative work of the Library, and
|
|
||||||
therefore falls outside the scope of this License.
|
|
||||||
|
|
||||||
However, linking a "work that uses the Library" with the Library
|
|
||||||
creates an executable that is a derivative of the Library (because it
|
|
||||||
contains portions of the Library), rather than a "work that uses the
|
|
||||||
library". The executable is therefore covered by this License.
|
|
||||||
Section 6 states terms for distribution of such executables.
|
|
||||||
|
|
||||||
When a "work that uses the Library" uses material from a header file
|
|
||||||
that is part of the Library, the object code for the work may be a
|
|
||||||
derivative work of the Library even though the source code is not.
|
|
||||||
Whether this is true is especially significant if the work can be
|
|
||||||
linked without the Library, or if the work is itself a library. The
|
|
||||||
threshold for this to be true is not precisely defined by law.
|
|
||||||
|
|
||||||
If such an object file uses only numerical parameters, data
|
|
||||||
structure layouts and accessors, and small macros and small inline
|
|
||||||
functions (ten lines or less in length), then the use of the object
|
|
||||||
file is unrestricted, regardless of whether it is legally a derivative
|
|
||||||
work. (Executables containing this object code plus portions of the
|
|
||||||
Library will still fall under Section 6.)
|
|
||||||
|
|
||||||
Otherwise, if the work is a derivative of the Library, you may
|
|
||||||
distribute the object code for the work under the terms of Section 6.
|
|
||||||
Any executables containing that work also fall under Section 6,
|
|
||||||
whether or not they are linked directly with the Library itself.
|
|
||||||
|
|
||||||
6. As an exception to the Sections above, you may also combine or
|
|
||||||
link a "work that uses the Library" with the Library to produce a
|
|
||||||
work containing portions of the Library, and distribute that work
|
|
||||||
under terms of your choice, provided that the terms permit
|
|
||||||
modification of the work for the customer's own use and reverse
|
|
||||||
engineering for debugging such modifications.
|
|
||||||
|
|
||||||
You must give prominent notice with each copy of the work that the
|
|
||||||
Library is used in it and that the Library and its use are covered by
|
|
||||||
this License. You must supply a copy of this License. If the work
|
|
||||||
during execution displays copyright notices, you must include the
|
|
||||||
copyright notice for the Library among them, as well as a reference
|
|
||||||
directing the user to the copy of this License. Also, you must do one
|
|
||||||
of these things:
|
|
||||||
|
|
||||||
a) Accompany the work with the complete corresponding
|
|
||||||
machine-readable source code for the Library including whatever
|
|
||||||
changes were used in the work (which must be distributed under
|
|
||||||
Sections 1 and 2 above); and, if the work is an executable linked
|
|
||||||
with the Library, with the complete machine-readable "work that
|
|
||||||
uses the Library", as object code and/or source code, so that the
|
|
||||||
user can modify the Library and then relink to produce a modified
|
|
||||||
executable containing the modified Library. (It is understood
|
|
||||||
that the user who changes the contents of definitions files in the
|
|
||||||
Library will not necessarily be able to recompile the application
|
|
||||||
to use the modified definitions.)
|
|
||||||
|
|
||||||
b) Use a suitable shared library mechanism for linking with the
|
|
||||||
Library. A suitable mechanism is one that (1) uses at run time a
|
|
||||||
copy of the library already present on the user's computer system,
|
|
||||||
rather than copying library functions into the executable, and (2)
|
|
||||||
will operate properly with a modified version of the library, if
|
|
||||||
the user installs one, as long as the modified version is
|
|
||||||
interface-compatible with the version that the work was made with.
|
|
||||||
|
|
||||||
c) Accompany the work with a written offer, valid for at
|
|
||||||
least three years, to give the same user the materials
|
|
||||||
specified in Subsection 6a, above, for a charge no more
|
|
||||||
than the cost of performing this distribution.
|
|
||||||
|
|
||||||
d) If distribution of the work is made by offering access to copy
|
|
||||||
from a designated place, offer equivalent access to copy the above
|
|
||||||
specified materials from the same place.
|
|
||||||
|
|
||||||
e) Verify that the user has already received a copy of these
|
|
||||||
materials or that you have already sent this user a copy.
|
|
||||||
|
|
||||||
For an executable, the required form of the "work that uses the
|
|
||||||
Library" must include any data and utility programs needed for
|
|
||||||
reproducing the executable from it. However, as a special exception,
|
|
||||||
the materials to be distributed need not include anything that is
|
|
||||||
normally distributed (in either source or binary form) with the major
|
|
||||||
components (compiler, kernel, and so on) of the operating system on
|
|
||||||
which the executable runs, unless that component itself accompanies
|
|
||||||
the executable.
|
|
||||||
|
|
||||||
It may happen that this requirement contradicts the license
|
|
||||||
restrictions of other proprietary libraries that do not normally
|
|
||||||
accompany the operating system. Such a contradiction means you cannot
|
|
||||||
use both them and the Library together in an executable that you
|
|
||||||
distribute.
|
|
||||||
|
|
||||||
7. You may place library facilities that are a work based on the
|
|
||||||
Library side-by-side in a single library together with other library
|
|
||||||
facilities not covered by this License, and distribute such a combined
|
|
||||||
library, provided that the separate distribution of the work based on
|
|
||||||
the Library and of the other library facilities is otherwise
|
|
||||||
permitted, and provided that you do these two things:
|
|
||||||
|
|
||||||
a) Accompany the combined library with a copy of the same work
|
|
||||||
based on the Library, uncombined with any other library
|
|
||||||
facilities. This must be distributed under the terms of the
|
|
||||||
Sections above.
|
|
||||||
|
|
||||||
b) Give prominent notice with the combined library of the fact
|
|
||||||
that part of it is a work based on the Library, and explaining
|
|
||||||
where to find the accompanying uncombined form of the same work.
|
|
||||||
|
|
||||||
8. You may not copy, modify, sublicense, link with, or distribute
|
|
||||||
the Library except as expressly provided under this License. Any
|
|
||||||
attempt otherwise to copy, modify, sublicense, link with, or
|
|
||||||
distribute the Library is void, and will automatically terminate your
|
|
||||||
rights under this License. However, parties who have received copies,
|
|
||||||
or rights, from you under this License will not have their licenses
|
|
||||||
terminated so long as such parties remain in full compliance.
|
|
||||||
|
|
||||||
9. You are not required to accept this License, since you have not
|
|
||||||
signed it. However, nothing else grants you permission to modify or
|
|
||||||
distribute the Library or its derivative works. These actions are
|
|
||||||
prohibited by law if you do not accept this License. Therefore, by
|
|
||||||
modifying or distributing the Library (or any work based on the
|
|
||||||
Library), you indicate your acceptance of this License to do so, and
|
|
||||||
all its terms and conditions for copying, distributing or modifying
|
|
||||||
the Library or works based on it.
|
|
||||||
|
|
||||||
10. Each time you redistribute the Library (or any work based on the
|
|
||||||
Library), the recipient automatically receives a license from the
|
|
||||||
original licensor to copy, distribute, link with or modify the Library
|
|
||||||
subject to these terms and conditions. You may not impose any further
|
|
||||||
restrictions on the recipients' exercise of the rights granted herein.
|
|
||||||
You are not responsible for enforcing compliance by third parties with
|
|
||||||
this License.
|
|
||||||
|
|
||||||
11. If, as a consequence of a court judgment or allegation of patent
|
|
||||||
infringement or for any other reason (not limited to patent issues),
|
|
||||||
conditions are imposed on you (whether by court order, agreement or
|
|
||||||
otherwise) that contradict the conditions of this License, they do not
|
|
||||||
excuse you from the conditions of this License. If you cannot
|
|
||||||
distribute so as to satisfy simultaneously your obligations under this
|
|
||||||
License and any other pertinent obligations, then as a consequence you
|
|
||||||
may not distribute the Library at all. For example, if a patent
|
|
||||||
license would not permit royalty-free redistribution of the Library by
|
|
||||||
all those who receive copies directly or indirectly through you, then
|
|
||||||
the only way you could satisfy both it and this License would be to
|
|
||||||
refrain entirely from distribution of the Library.
|
|
||||||
|
|
||||||
If any portion of this section is held invalid or unenforceable under any
|
|
||||||
particular circumstance, the balance of the section is intended to apply,
|
|
||||||
and the section as a whole is intended to apply in other circumstances.
|
|
||||||
|
|
||||||
It is not the purpose of this section to induce you to infringe any
|
|
||||||
patents or other property right claims or to contest validity of any
|
|
||||||
such claims; this section has the sole purpose of protecting the
|
|
||||||
integrity of the free software distribution system which is
|
|
||||||
implemented by public license practices. Many people have made
|
|
||||||
generous contributions to the wide range of software distributed
|
|
||||||
through that system in reliance on consistent application of that
|
|
||||||
system; it is up to the author/donor to decide if he or she is willing
|
|
||||||
to distribute software through any other system and a licensee cannot
|
|
||||||
impose that choice.
|
|
||||||
|
|
||||||
This section is intended to make thoroughly clear what is believed to
|
|
||||||
be a consequence of the rest of this License.
|
|
||||||
|
|
||||||
12. If the distribution and/or use of the Library is restricted in
|
|
||||||
certain countries either by patents or by copyrighted interfaces, the
|
|
||||||
original copyright holder who places the Library under this License may add
|
|
||||||
an explicit geographical distribution limitation excluding those countries,
|
|
||||||
so that distribution is permitted only in or among countries not thus
|
|
||||||
excluded. In such case, this License incorporates the limitation as if
|
|
||||||
written in the body of this License.
|
|
||||||
|
|
||||||
13. The Free Software Foundation may publish revised and/or new
|
|
||||||
versions of the Lesser General Public License from time to time.
|
|
||||||
Such new versions will be similar in spirit to the present version,
|
|
||||||
but may differ in detail to address new problems or concerns.
|
|
||||||
|
|
||||||
Each version is given a distinguishing version number. If the Library
|
|
||||||
specifies a version number of this License which applies to it and
|
|
||||||
"any later version", you have the option of following the terms and
|
|
||||||
conditions either of that version or of any later version published by
|
|
||||||
the Free Software Foundation. If the Library does not specify a
|
|
||||||
license version number, you may choose any version ever published by
|
|
||||||
the Free Software Foundation.
|
|
||||||
|
|
||||||
14. If you wish to incorporate parts of the Library into other free
|
|
||||||
programs whose distribution conditions are incompatible with these,
|
|
||||||
write to the author to ask for permission. For software which is
|
|
||||||
copyrighted by the Free Software Foundation, write to the Free
|
|
||||||
Software Foundation; we sometimes make exceptions for this. Our
|
|
||||||
decision will be guided by the two goals of preserving the free status
|
|
||||||
of all derivatives of our free software and of promoting the sharing
|
|
||||||
and reuse of software generally.
|
|
||||||
|
|
||||||
NO WARRANTY
|
|
||||||
|
|
||||||
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
|
|
||||||
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
|
|
||||||
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
|
|
||||||
OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
|
|
||||||
KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
|
|
||||||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
|
|
||||||
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
|
|
||||||
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
|
||||||
|
|
||||||
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
|
|
||||||
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
|
|
||||||
AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
|
|
||||||
FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
|
|
||||||
CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
|
|
||||||
LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
|
|
||||||
RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
|
|
||||||
FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
|
|
||||||
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
|
|
||||||
DAMAGES.
|
|
||||||
|
|
||||||
END OF TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
How to Apply These Terms to Your New Libraries
|
|
||||||
|
|
||||||
If you develop a new library, and you want it to be of the greatest
|
|
||||||
possible use to the public, we recommend making it free software that
|
|
||||||
everyone can redistribute and change. You can do so by permitting
|
|
||||||
redistribution under these terms (or, alternatively, under the terms of the
|
|
||||||
ordinary General Public License).
|
|
||||||
|
|
||||||
To apply these terms, attach the following notices to the library. It is
|
|
||||||
safest to attach them to the start of each source file to most effectively
|
|
||||||
convey the exclusion of warranty; and each file should have at least the
|
|
||||||
"copyright" line and a pointer to where the full notice is found.
|
|
||||||
|
|
||||||
<one line to give the library's name and a brief idea of what it does.>
|
|
||||||
Copyright (C) <year> <name of author>
|
|
||||||
|
|
||||||
This library is free software; you can redistribute it and/or
|
|
||||||
modify it under the terms of the GNU Lesser General Public
|
|
||||||
License as published by the Free Software Foundation; either
|
|
||||||
version 2.1 of the License, or (at your option) any later version.
|
|
||||||
|
|
||||||
This library 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
|
|
||||||
Lesser General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU Lesser General Public
|
|
||||||
License along with this library; if not, write to the Free Software
|
|
||||||
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
||||||
|
|
||||||
Also add information on how to contact you by electronic and paper mail.
|
|
||||||
|
|
||||||
You should also get your employer (if you work as a programmer) or your
|
|
||||||
school, if any, to sign a "copyright disclaimer" for the library, if
|
|
||||||
necessary. Here is a sample; alter the names:
|
|
||||||
|
|
||||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the
|
|
||||||
library `Frob' (a library for tweaking knobs) written by James Random Hacker.
|
|
||||||
|
|
||||||
<signature of Ty Coon>, 1 April 1990
|
|
||||||
Ty Coon, President of Vice
|
|
||||||
|
|
||||||
That's all there is to it!
|
|
||||||
1234
Doxyfile.in
1234
Doxyfile.in
File diff suppressed because it is too large
Load Diff
368
FAQ
Normal file
368
FAQ
Normal file
@@ -0,0 +1,368 @@
|
|||||||
|
|
||||||
|
Frequently Asked Questions about zlib
|
||||||
|
|
||||||
|
|
||||||
|
If your question is not there, please check the zlib home page
|
||||||
|
http://zlib.net/ which may have more recent information.
|
||||||
|
The lastest zlib FAQ is at http://zlib.net/zlib_faq.html
|
||||||
|
|
||||||
|
|
||||||
|
1. Is zlib Y2K-compliant?
|
||||||
|
|
||||||
|
Yes. zlib doesn't handle dates.
|
||||||
|
|
||||||
|
2. Where can I get a Windows DLL version?
|
||||||
|
|
||||||
|
The zlib sources can be compiled without change to produce a DLL. See the
|
||||||
|
file win32/DLL_FAQ.txt in the zlib distribution. Pointers to the
|
||||||
|
precompiled DLL are found in the zlib web site at http://zlib.net/ .
|
||||||
|
|
||||||
|
3. Where can I get a Visual Basic interface to zlib?
|
||||||
|
|
||||||
|
See
|
||||||
|
* http://marknelson.us/1997/01/01/zlib-engine/
|
||||||
|
* win32/DLL_FAQ.txt in the zlib distribution
|
||||||
|
|
||||||
|
4. compress() returns Z_BUF_ERROR.
|
||||||
|
|
||||||
|
Make sure that before the call of compress(), the length of the compressed
|
||||||
|
buffer is equal to the available size of the compressed buffer and not
|
||||||
|
zero. For Visual Basic, check that this parameter is passed by reference
|
||||||
|
("as any"), not by value ("as long").
|
||||||
|
|
||||||
|
5. deflate() or inflate() returns Z_BUF_ERROR.
|
||||||
|
|
||||||
|
Before making the call, make sure that avail_in and avail_out are not zero.
|
||||||
|
When setting the parameter flush equal to Z_FINISH, also make sure that
|
||||||
|
avail_out is big enough to allow processing all pending input. Note that a
|
||||||
|
Z_BUF_ERROR is not fatal--another call to deflate() or inflate() can be
|
||||||
|
made with more input or output space. A Z_BUF_ERROR may in fact be
|
||||||
|
unavoidable depending on how the functions are used, since it is not
|
||||||
|
possible to tell whether or not there is more output pending when
|
||||||
|
strm.avail_out returns with zero. See http://zlib.net/zlib_how.html for a
|
||||||
|
heavily annotated example.
|
||||||
|
|
||||||
|
6. Where's the zlib documentation (man pages, etc.)?
|
||||||
|
|
||||||
|
It's in zlib.h . Examples of zlib usage are in the files test/example.c
|
||||||
|
and test/minigzip.c, with more in examples/ .
|
||||||
|
|
||||||
|
7. Why don't you use GNU autoconf or libtool or ...?
|
||||||
|
|
||||||
|
Because we would like to keep zlib as a very small and simple package.
|
||||||
|
zlib is rather portable and doesn't need much configuration.
|
||||||
|
|
||||||
|
8. I found a bug in zlib.
|
||||||
|
|
||||||
|
Most of the time, such problems are due to an incorrect usage of zlib.
|
||||||
|
Please try to reproduce the problem with a small program and send the
|
||||||
|
corresponding source to us at zlib@gzip.org . Do not send multi-megabyte
|
||||||
|
data files without prior agreement.
|
||||||
|
|
||||||
|
9. Why do I get "undefined reference to gzputc"?
|
||||||
|
|
||||||
|
If "make test" produces something like
|
||||||
|
|
||||||
|
example.o(.text+0x154): undefined reference to `gzputc'
|
||||||
|
|
||||||
|
check that you don't have old files libz.* in /usr/lib, /usr/local/lib or
|
||||||
|
/usr/X11R6/lib. Remove any old versions, then do "make install".
|
||||||
|
|
||||||
|
10. I need a Delphi interface to zlib.
|
||||||
|
|
||||||
|
See the contrib/delphi directory in the zlib distribution.
|
||||||
|
|
||||||
|
11. Can zlib handle .zip archives?
|
||||||
|
|
||||||
|
Not by itself, no. See the directory contrib/minizip in the zlib
|
||||||
|
distribution.
|
||||||
|
|
||||||
|
12. Can zlib handle .Z files?
|
||||||
|
|
||||||
|
No, sorry. You have to spawn an uncompress or gunzip subprocess, or adapt
|
||||||
|
the code of uncompress on your own.
|
||||||
|
|
||||||
|
13. How can I make a Unix shared library?
|
||||||
|
|
||||||
|
By default a shared (and a static) library is built for Unix. So:
|
||||||
|
|
||||||
|
make distclean
|
||||||
|
./configure
|
||||||
|
make
|
||||||
|
|
||||||
|
14. How do I install a shared zlib library on Unix?
|
||||||
|
|
||||||
|
After the above, then:
|
||||||
|
|
||||||
|
make install
|
||||||
|
|
||||||
|
However, many flavors of Unix come with a shared zlib already installed.
|
||||||
|
Before going to the trouble of compiling a shared version of zlib and
|
||||||
|
trying to install it, you may want to check if it's already there! If you
|
||||||
|
can #include <zlib.h>, it's there. The -lz option will probably link to
|
||||||
|
it. You can check the version at the top of zlib.h or with the
|
||||||
|
ZLIB_VERSION symbol defined in zlib.h .
|
||||||
|
|
||||||
|
15. I have a question about OttoPDF.
|
||||||
|
|
||||||
|
We are not the authors of OttoPDF. The real author is on the OttoPDF web
|
||||||
|
site: Joel Hainley, jhainley@myndkryme.com.
|
||||||
|
|
||||||
|
16. Can zlib decode Flate data in an Adobe PDF file?
|
||||||
|
|
||||||
|
Yes. See http://www.pdflib.com/ . To modify PDF forms, see
|
||||||
|
http://sourceforge.net/projects/acroformtool/ .
|
||||||
|
|
||||||
|
17. Why am I getting this "register_frame_info not found" error on Solaris?
|
||||||
|
|
||||||
|
After installing zlib 1.1.4 on Solaris 2.6, running applications using zlib
|
||||||
|
generates an error such as:
|
||||||
|
|
||||||
|
ld.so.1: rpm: fatal: relocation error: file /usr/local/lib/libz.so:
|
||||||
|
symbol __register_frame_info: referenced symbol not found
|
||||||
|
|
||||||
|
The symbol __register_frame_info is not part of zlib, it is generated by
|
||||||
|
the C compiler (cc or gcc). You must recompile applications using zlib
|
||||||
|
which have this problem. This problem is specific to Solaris. See
|
||||||
|
http://www.sunfreeware.com for Solaris versions of zlib and applications
|
||||||
|
using zlib.
|
||||||
|
|
||||||
|
18. Why does gzip give an error on a file I make with compress/deflate?
|
||||||
|
|
||||||
|
The compress and deflate functions produce data in the zlib format, which
|
||||||
|
is different and incompatible with the gzip format. The gz* functions in
|
||||||
|
zlib on the other hand use the gzip format. Both the zlib and gzip formats
|
||||||
|
use the same compressed data format internally, but have different headers
|
||||||
|
and trailers around the compressed data.
|
||||||
|
|
||||||
|
19. Ok, so why are there two different formats?
|
||||||
|
|
||||||
|
The gzip format was designed to retain the directory information about a
|
||||||
|
single file, such as the name and last modification date. The zlib format
|
||||||
|
on the other hand was designed for in-memory and communication channel
|
||||||
|
applications, and has a much more compact header and trailer and uses a
|
||||||
|
faster integrity check than gzip.
|
||||||
|
|
||||||
|
20. Well that's nice, but how do I make a gzip file in memory?
|
||||||
|
|
||||||
|
You can request that deflate write the gzip format instead of the zlib
|
||||||
|
format using deflateInit2(). You can also request that inflate decode the
|
||||||
|
gzip format using inflateInit2(). Read zlib.h for more details.
|
||||||
|
|
||||||
|
21. Is zlib thread-safe?
|
||||||
|
|
||||||
|
Yes. However any library routines that zlib uses and any application-
|
||||||
|
provided memory allocation routines must also be thread-safe. zlib's gz*
|
||||||
|
functions use stdio library routines, and most of zlib's functions use the
|
||||||
|
library memory allocation routines by default. zlib's *Init* functions
|
||||||
|
allow for the application to provide custom memory allocation routines.
|
||||||
|
|
||||||
|
Of course, you should only operate on any given zlib or gzip stream from a
|
||||||
|
single thread at a time.
|
||||||
|
|
||||||
|
22. Can I use zlib in my commercial application?
|
||||||
|
|
||||||
|
Yes. Please read the license in zlib.h.
|
||||||
|
|
||||||
|
23. Is zlib under the GNU license?
|
||||||
|
|
||||||
|
No. Please read the license in zlib.h.
|
||||||
|
|
||||||
|
24. The license says that altered source versions must be "plainly marked". So
|
||||||
|
what exactly do I need to do to meet that requirement?
|
||||||
|
|
||||||
|
You need to change the ZLIB_VERSION and ZLIB_VERNUM #defines in zlib.h. In
|
||||||
|
particular, the final version number needs to be changed to "f", and an
|
||||||
|
identification string should be appended to ZLIB_VERSION. Version numbers
|
||||||
|
x.x.x.f are reserved for modifications to zlib by others than the zlib
|
||||||
|
maintainers. For example, if the version of the base zlib you are altering
|
||||||
|
is "1.2.3.4", then in zlib.h you should change ZLIB_VERNUM to 0x123f, and
|
||||||
|
ZLIB_VERSION to something like "1.2.3.f-zachary-mods-v3". You can also
|
||||||
|
update the version strings in deflate.c and inftrees.c.
|
||||||
|
|
||||||
|
For altered source distributions, you should also note the origin and
|
||||||
|
nature of the changes in zlib.h, as well as in ChangeLog and README, along
|
||||||
|
with the dates of the alterations. The origin should include at least your
|
||||||
|
name (or your company's name), and an email address to contact for help or
|
||||||
|
issues with the library.
|
||||||
|
|
||||||
|
Note that distributing a compiled zlib library along with zlib.h and
|
||||||
|
zconf.h is also a source distribution, and so you should change
|
||||||
|
ZLIB_VERSION and ZLIB_VERNUM and note the origin and nature of the changes
|
||||||
|
in zlib.h as you would for a full source distribution.
|
||||||
|
|
||||||
|
25. Will zlib work on a big-endian or little-endian architecture, and can I
|
||||||
|
exchange compressed data between them?
|
||||||
|
|
||||||
|
Yes and yes.
|
||||||
|
|
||||||
|
26. Will zlib work on a 64-bit machine?
|
||||||
|
|
||||||
|
Yes. It has been tested on 64-bit machines, and has no dependence on any
|
||||||
|
data types being limited to 32-bits in length. If you have any
|
||||||
|
difficulties, please provide a complete problem report to zlib@gzip.org
|
||||||
|
|
||||||
|
27. Will zlib decompress data from the PKWare Data Compression Library?
|
||||||
|
|
||||||
|
No. The PKWare DCL uses a completely different compressed data format than
|
||||||
|
does PKZIP and zlib. However, you can look in zlib's contrib/blast
|
||||||
|
directory for a possible solution to your problem.
|
||||||
|
|
||||||
|
28. Can I access data randomly in a compressed stream?
|
||||||
|
|
||||||
|
No, not without some preparation. If when compressing you periodically use
|
||||||
|
Z_FULL_FLUSH, carefully write all the pending data at those points, and
|
||||||
|
keep an index of those locations, then you can start decompression at those
|
||||||
|
points. You have to be careful to not use Z_FULL_FLUSH too often, since it
|
||||||
|
can significantly degrade compression. Alternatively, you can scan a
|
||||||
|
deflate stream once to generate an index, and then use that index for
|
||||||
|
random access. See examples/zran.c .
|
||||||
|
|
||||||
|
29. Does zlib work on MVS, OS/390, CICS, etc.?
|
||||||
|
|
||||||
|
It has in the past, but we have not heard of any recent evidence. There
|
||||||
|
were working ports of zlib 1.1.4 to MVS, but those links no longer work.
|
||||||
|
If you know of recent, successful applications of zlib on these operating
|
||||||
|
systems, please let us know. Thanks.
|
||||||
|
|
||||||
|
30. Is there some simpler, easier to read version of inflate I can look at to
|
||||||
|
understand the deflate format?
|
||||||
|
|
||||||
|
First off, you should read RFC 1951. Second, yes. Look in zlib's
|
||||||
|
contrib/puff directory.
|
||||||
|
|
||||||
|
31. Does zlib infringe on any patents?
|
||||||
|
|
||||||
|
As far as we know, no. In fact, that was originally the whole point behind
|
||||||
|
zlib. Look here for some more information:
|
||||||
|
|
||||||
|
http://www.gzip.org/#faq11
|
||||||
|
|
||||||
|
32. Can zlib work with greater than 4 GB of data?
|
||||||
|
|
||||||
|
Yes. inflate() and deflate() will process any amount of data correctly.
|
||||||
|
Each call of inflate() or deflate() is limited to input and output chunks
|
||||||
|
of the maximum value that can be stored in the compiler's "unsigned int"
|
||||||
|
type, but there is no limit to the number of chunks. Note however that the
|
||||||
|
strm.total_in and strm_total_out counters may be limited to 4 GB. These
|
||||||
|
counters are provided as a convenience and are not used internally by
|
||||||
|
inflate() or deflate(). The application can easily set up its own counters
|
||||||
|
updated after each call of inflate() or deflate() to count beyond 4 GB.
|
||||||
|
compress() and uncompress() may be limited to 4 GB, since they operate in a
|
||||||
|
single call. gzseek() and gztell() may be limited to 4 GB depending on how
|
||||||
|
zlib is compiled. See the zlibCompileFlags() function in zlib.h.
|
||||||
|
|
||||||
|
The word "may" appears several times above since there is a 4 GB limit only
|
||||||
|
if the compiler's "long" type is 32 bits. If the compiler's "long" type is
|
||||||
|
64 bits, then the limit is 16 exabytes.
|
||||||
|
|
||||||
|
33. Does zlib have any security vulnerabilities?
|
||||||
|
|
||||||
|
The only one that we are aware of is potentially in gzprintf(). If zlib is
|
||||||
|
compiled to use sprintf() or vsprintf(), then there is no protection
|
||||||
|
against a buffer overflow of an 8K string space (or other value as set by
|
||||||
|
gzbuffer()), other than the caller of gzprintf() assuring that the output
|
||||||
|
will not exceed 8K. On the other hand, if zlib is compiled to use
|
||||||
|
snprintf() or vsnprintf(), which should normally be the case, then there is
|
||||||
|
no vulnerability. The ./configure script will display warnings if an
|
||||||
|
insecure variation of sprintf() will be used by gzprintf(). Also the
|
||||||
|
zlibCompileFlags() function will return information on what variant of
|
||||||
|
sprintf() is used by gzprintf().
|
||||||
|
|
||||||
|
If you don't have snprintf() or vsnprintf() and would like one, you can
|
||||||
|
find a portable implementation here:
|
||||||
|
|
||||||
|
http://www.ijs.si/software/snprintf/
|
||||||
|
|
||||||
|
Note that you should be using the most recent version of zlib. Versions
|
||||||
|
1.1.3 and before were subject to a double-free vulnerability, and versions
|
||||||
|
1.2.1 and 1.2.2 were subject to an access exception when decompressing
|
||||||
|
invalid compressed data.
|
||||||
|
|
||||||
|
34. Is there a Java version of zlib?
|
||||||
|
|
||||||
|
Probably what you want is to use zlib in Java. zlib is already included
|
||||||
|
as part of the Java SDK in the java.util.zip package. If you really want
|
||||||
|
a version of zlib written in the Java language, look on the zlib home
|
||||||
|
page for links: http://zlib.net/ .
|
||||||
|
|
||||||
|
35. I get this or that compiler or source-code scanner warning when I crank it
|
||||||
|
up to maximally-pedantic. Can't you guys write proper code?
|
||||||
|
|
||||||
|
Many years ago, we gave up attempting to avoid warnings on every compiler
|
||||||
|
in the universe. It just got to be a waste of time, and some compilers
|
||||||
|
were downright silly as well as contradicted each other. So now, we simply
|
||||||
|
make sure that the code always works.
|
||||||
|
|
||||||
|
36. Valgrind (or some similar memory access checker) says that deflate is
|
||||||
|
performing a conditional jump that depends on an uninitialized value.
|
||||||
|
Isn't that a bug?
|
||||||
|
|
||||||
|
No. That is intentional for performance reasons, and the output of deflate
|
||||||
|
is not affected. This only started showing up recently since zlib 1.2.x
|
||||||
|
uses malloc() by default for allocations, whereas earlier versions used
|
||||||
|
calloc(), which zeros out the allocated memory. Even though the code was
|
||||||
|
correct, versions 1.2.4 and later was changed to not stimulate these
|
||||||
|
checkers.
|
||||||
|
|
||||||
|
37. Will zlib read the (insert any ancient or arcane format here) compressed
|
||||||
|
data format?
|
||||||
|
|
||||||
|
Probably not. Look in the comp.compression FAQ for pointers to various
|
||||||
|
formats and associated software.
|
||||||
|
|
||||||
|
38. How can I encrypt/decrypt zip files with zlib?
|
||||||
|
|
||||||
|
zlib doesn't support encryption. The original PKZIP encryption is very
|
||||||
|
weak and can be broken with freely available programs. To get strong
|
||||||
|
encryption, use GnuPG, http://www.gnupg.org/ , which already includes zlib
|
||||||
|
compression. For PKZIP compatible "encryption", look at
|
||||||
|
http://www.info-zip.org/
|
||||||
|
|
||||||
|
39. What's the difference between the "gzip" and "deflate" HTTP 1.1 encodings?
|
||||||
|
|
||||||
|
"gzip" is the gzip format, and "deflate" is the zlib format. They should
|
||||||
|
probably have called the second one "zlib" instead to avoid confusion with
|
||||||
|
the raw deflate compressed data format. While the HTTP 1.1 RFC 2616
|
||||||
|
correctly points to the zlib specification in RFC 1950 for the "deflate"
|
||||||
|
transfer encoding, there have been reports of servers and browsers that
|
||||||
|
incorrectly produce or expect raw deflate data per the deflate
|
||||||
|
specification in RFC 1951, most notably Microsoft. So even though the
|
||||||
|
"deflate" transfer encoding using the zlib format would be the more
|
||||||
|
efficient approach (and in fact exactly what the zlib format was designed
|
||||||
|
for), using the "gzip" transfer encoding is probably more reliable due to
|
||||||
|
an unfortunate choice of name on the part of the HTTP 1.1 authors.
|
||||||
|
|
||||||
|
Bottom line: use the gzip format for HTTP 1.1 encoding.
|
||||||
|
|
||||||
|
40. Does zlib support the new "Deflate64" format introduced by PKWare?
|
||||||
|
|
||||||
|
No. PKWare has apparently decided to keep that format proprietary, since
|
||||||
|
they have not documented it as they have previous compression formats. In
|
||||||
|
any case, the compression improvements are so modest compared to other more
|
||||||
|
modern approaches, that it's not worth the effort to implement.
|
||||||
|
|
||||||
|
41. I'm having a problem with the zip functions in zlib, can you help?
|
||||||
|
|
||||||
|
There are no zip functions in zlib. You are probably using minizip by
|
||||||
|
Giles Vollant, which is found in the contrib directory of zlib. It is not
|
||||||
|
part of zlib. In fact none of the stuff in contrib is part of zlib. The
|
||||||
|
files in there are not supported by the zlib authors. You need to contact
|
||||||
|
the authors of the respective contribution for help.
|
||||||
|
|
||||||
|
42. The match.asm code in contrib is under the GNU General Public License.
|
||||||
|
Since it's part of zlib, doesn't that mean that all of zlib falls under the
|
||||||
|
GNU GPL?
|
||||||
|
|
||||||
|
No. The files in contrib are not part of zlib. They were contributed by
|
||||||
|
other authors and are provided as a convenience to the user within the zlib
|
||||||
|
distribution. Each item in contrib has its own license.
|
||||||
|
|
||||||
|
43. Is zlib subject to export controls? What is its ECCN?
|
||||||
|
|
||||||
|
zlib is not subject to export controls, and so is classified as EAR99.
|
||||||
|
|
||||||
|
44. Can you please sign these lengthy legal documents and fax them back to us
|
||||||
|
so that we can use your software in our product?
|
||||||
|
|
||||||
|
No. Go away. Shoo.
|
||||||
68
INDEX
Normal file
68
INDEX
Normal file
@@ -0,0 +1,68 @@
|
|||||||
|
CMakeLists.txt cmake build file
|
||||||
|
ChangeLog history of changes
|
||||||
|
FAQ Frequently Asked Questions about zlib
|
||||||
|
INDEX this file
|
||||||
|
Makefile dummy Makefile that tells you to ./configure
|
||||||
|
Makefile.in template for Unix Makefile
|
||||||
|
README guess what
|
||||||
|
configure configure script for Unix
|
||||||
|
make_vms.com makefile for VMS
|
||||||
|
test/example.c zlib usages examples for build testing
|
||||||
|
test/minigzip.c minimal gzip-like functionality for build testing
|
||||||
|
test/infcover.c inf*.c code coverage for build coverage testing
|
||||||
|
treebuild.xml XML description of source file dependencies
|
||||||
|
zconf.h.cmakein zconf.h template for cmake
|
||||||
|
zconf.h.in zconf.h template for configure
|
||||||
|
zlib.3 Man page for zlib
|
||||||
|
zlib.3.pdf Man page in PDF format
|
||||||
|
zlib.map Linux symbol information
|
||||||
|
zlib.pc.in Template for pkg-config descriptor
|
||||||
|
zlib.pc.cmakein zlib.pc template for cmake
|
||||||
|
zlib2ansi perl script to convert source files for C++ compilation
|
||||||
|
|
||||||
|
amiga/ makefiles for Amiga SAS C
|
||||||
|
as400/ makefiles for AS/400
|
||||||
|
doc/ documentation for formats and algorithms
|
||||||
|
msdos/ makefiles for MSDOS
|
||||||
|
nintendods/ makefile for Nintendo DS
|
||||||
|
old/ makefiles for various architectures and zlib documentation
|
||||||
|
files that have not yet been updated for zlib 1.2.x
|
||||||
|
qnx/ makefiles for QNX
|
||||||
|
watcom/ makefiles for OpenWatcom
|
||||||
|
win32/ makefiles for Windows
|
||||||
|
|
||||||
|
zlib public header files (required for library use):
|
||||||
|
zconf.h
|
||||||
|
zlib.h
|
||||||
|
|
||||||
|
private source files used to build the zlib library:
|
||||||
|
adler32.c
|
||||||
|
compress.c
|
||||||
|
crc32.c
|
||||||
|
crc32.h
|
||||||
|
deflate.c
|
||||||
|
deflate.h
|
||||||
|
gzclose.c
|
||||||
|
gzguts.h
|
||||||
|
gzlib.c
|
||||||
|
gzread.c
|
||||||
|
gzwrite.c
|
||||||
|
infback.c
|
||||||
|
inffast.c
|
||||||
|
inffast.h
|
||||||
|
inffixed.h
|
||||||
|
inflate.c
|
||||||
|
inflate.h
|
||||||
|
inftrees.c
|
||||||
|
inftrees.h
|
||||||
|
trees.c
|
||||||
|
trees.h
|
||||||
|
uncompr.c
|
||||||
|
zutil.c
|
||||||
|
zutil.h
|
||||||
|
|
||||||
|
source files for sample programs
|
||||||
|
See examples/README.examples
|
||||||
|
|
||||||
|
unsupported contributions by third parties
|
||||||
|
See contrib/README.contrib
|
||||||
554
INSTALL
554
INSTALL
@@ -1,554 +0,0 @@
|
|||||||
|
|
||||||
XZ Utils Installation
|
|
||||||
=====================
|
|
||||||
|
|
||||||
0. Preface
|
|
||||||
1. Supported platforms
|
|
||||||
1.1. Compilers
|
|
||||||
1.2. Platform-specific notes
|
|
||||||
1.2.1. AIX
|
|
||||||
1.2.2. IRIX
|
|
||||||
1.2.3. MINIX 3
|
|
||||||
1.2.4. OpenVMS
|
|
||||||
1.2.5. Solaris, OpenSolaris, and derivatives
|
|
||||||
1.2.6. Tru64
|
|
||||||
1.2.7. Windows
|
|
||||||
1.2.8. DOS
|
|
||||||
1.3. Adding support for new platforms
|
|
||||||
2. configure options
|
|
||||||
2.1. Static vs. dynamic linking of liblzma
|
|
||||||
2.2. Optimizing xzdec and lzmadec
|
|
||||||
3. xzgrep and other scripts
|
|
||||||
3.1. Dependencies
|
|
||||||
3.2. PATH
|
|
||||||
4. Troubleshooting
|
|
||||||
4.1. "No C99 compiler was found."
|
|
||||||
4.2. "No POSIX conforming shell (sh) was found."
|
|
||||||
4.3. configure works but build fails at crc32_x86.S
|
|
||||||
4.4. Lots of warnings about symbol visibility
|
|
||||||
4.5. "make check" fails
|
|
||||||
4.6. liblzma.so (or similar) not found when running xz
|
|
||||||
|
|
||||||
|
|
||||||
0. Preface
|
|
||||||
----------
|
|
||||||
|
|
||||||
If you aren't familiar with building packages that use GNU Autotools,
|
|
||||||
see the file INSTALL.generic for generic instructions before reading
|
|
||||||
further.
|
|
||||||
|
|
||||||
If you are going to build a package for distribution, see also the
|
|
||||||
file PACKAGERS. It contains information that should help making the
|
|
||||||
binary packages as good as possible, but the information isn't very
|
|
||||||
interesting to those making local builds for private use or for use
|
|
||||||
in special situations like embedded systems.
|
|
||||||
|
|
||||||
|
|
||||||
1. Supported platforms
|
|
||||||
----------------------
|
|
||||||
|
|
||||||
XZ Utils are developed on GNU/Linux, but they should work on many
|
|
||||||
POSIX-like operating systems like *BSDs and Solaris, and even on
|
|
||||||
a few non-POSIX operating systems.
|
|
||||||
|
|
||||||
|
|
||||||
1.1. Compilers
|
|
||||||
|
|
||||||
A C99 compiler is required to compile XZ Utils. If you use GCC, you
|
|
||||||
need at least version 3.x.x. GCC version 2.xx.x doesn't support some
|
|
||||||
C99 features used in XZ Utils source code, thus GCC 2 won't compile
|
|
||||||
XZ Utils.
|
|
||||||
|
|
||||||
XZ Utils takes advantage of some GNU C extensions when building
|
|
||||||
with GCC. Because these extensions are used only when building
|
|
||||||
with GCC, it should be possible to use any C99 compiler.
|
|
||||||
|
|
||||||
|
|
||||||
1.2. Platform-specific notes
|
|
||||||
|
|
||||||
1.2.1. AIX
|
|
||||||
|
|
||||||
If you use IBM XL C compiler, pass CC=xlc_r to configure. If
|
|
||||||
you use CC=xlc instead, you must disable threading support
|
|
||||||
with --disable-threads (usually not recommended).
|
|
||||||
|
|
||||||
|
|
||||||
1.2.2. IRIX
|
|
||||||
|
|
||||||
MIPSpro 7.4.4m has been reported to produce broken code if using
|
|
||||||
the -O2 optimization flag ("make check" fails). Using -O1 should
|
|
||||||
work.
|
|
||||||
|
|
||||||
A problem has been reported when using shared liblzma. Passing
|
|
||||||
--disable-shared to configure works around this. Alternatively,
|
|
||||||
putting "-64" to CFLAGS to build a 64-bit version might help too.
|
|
||||||
|
|
||||||
|
|
||||||
1.2.3. MINIX 3
|
|
||||||
|
|
||||||
The default install of MINIX 3 includes Amsterdam Compiler Kit (ACK),
|
|
||||||
which doesn't support C99. Install GCC to compile XZ Utils.
|
|
||||||
|
|
||||||
MINIX 3.1.8 and older have bugs in /usr/include/stdint.h, which has
|
|
||||||
to be patched before XZ Utils can be compiled correctly. See
|
|
||||||
<http://gforge.cs.vu.nl/gf/project/minix/tracker/?action=TrackerItemEdit&tracker_item_id=537>.
|
|
||||||
|
|
||||||
MINIX 3.2.0 and later use a different libc and aren't affected by
|
|
||||||
the above bug.
|
|
||||||
|
|
||||||
XZ Utils doesn't have code to detect the amount of physical RAM and
|
|
||||||
number of CPU cores on MINIX 3.
|
|
||||||
|
|
||||||
See section 4.4 in this file about symbol visibility warnings (you
|
|
||||||
may want to pass gl_cv_cc_visibility=no to configure).
|
|
||||||
|
|
||||||
|
|
||||||
1.2.4. OpenVMS
|
|
||||||
|
|
||||||
XZ Utils can be built for OpenVMS, but the build system files
|
|
||||||
are not included in the XZ Utils source package. The required
|
|
||||||
OpenVMS-specific files are maintained by Jouk Jansen and can be
|
|
||||||
downloaded here:
|
|
||||||
|
|
||||||
http://nchrem.tnw.tudelft.nl/openvms/software2.html#xzutils
|
|
||||||
|
|
||||||
|
|
||||||
1.2.5. Solaris, OpenSolaris, and derivatives
|
|
||||||
|
|
||||||
The following linker error has been reported on some x86 systems:
|
|
||||||
|
|
||||||
ld: fatal: relocation error: R_386_GOTOFF: ...
|
|
||||||
|
|
||||||
This can be worked around by passing gl_cv_cc_visibility=no
|
|
||||||
as an argument to the configure script.
|
|
||||||
|
|
||||||
test_scripts.sh in "make check" may fail if good enough tools are
|
|
||||||
missing from PATH (/usr/xpg4/bin or /usr/xpg6/bin). See sections
|
|
||||||
4.5 and 3.2 for more information.
|
|
||||||
|
|
||||||
|
|
||||||
1.2.6. Tru64
|
|
||||||
|
|
||||||
If you try to use the native C compiler on Tru64 (passing CC=cc to
|
|
||||||
configure), you may need the workaround mention in section 4.1 in
|
|
||||||
this file (pass also ac_cv_prog_cc_c99= to configure).
|
|
||||||
|
|
||||||
|
|
||||||
1.2.7. Windows
|
|
||||||
|
|
||||||
Building XZ Utils on Windows is supported under the following
|
|
||||||
environments:
|
|
||||||
|
|
||||||
- MinGW-w64 + MSYS (32-bit and 64-bit x86): This is used
|
|
||||||
for building the official binary packages for Windows.
|
|
||||||
There is windows/build.bash to ease packaging XZ Utils with
|
|
||||||
MinGW(-w64) + MSYS into a redistributable .zip or .7z file.
|
|
||||||
See windows/INSTALL-MinGW.txt for more information.
|
|
||||||
|
|
||||||
- MinGW + MSYS (32-bit x86): I haven't recently tested this.
|
|
||||||
|
|
||||||
- Cygwin 1.7.35 and later: NOTE that using XZ Utils >= 5.2.0
|
|
||||||
under Cygwin older than 1.7.35 can lead to DATA LOSS! If
|
|
||||||
you must use an old Cygwin version, stick to XZ Utils 5.0.x
|
|
||||||
which is safe under older Cygwin versions. You can check
|
|
||||||
the Cygwin version with the command "cygcheck -V".
|
|
||||||
|
|
||||||
- Microsoft Visual Studio 2013 update 2 or later (MSVC for short):
|
|
||||||
See windows/INSTALL-MSVC.txt for more information.
|
|
||||||
|
|
||||||
It may be possible to build liblzma with other toolchains too, but
|
|
||||||
that will probably require writing a separate makefile. Building
|
|
||||||
the command line tools with non-GNU toolchains will be harder than
|
|
||||||
building only liblzma.
|
|
||||||
|
|
||||||
Even if liblzma is built with MinGW(-w64), the resulting DLL can
|
|
||||||
be used by other compilers and linkers, including MSVC. See
|
|
||||||
windows/README-Windows.txt for details.
|
|
||||||
|
|
||||||
|
|
||||||
1.2.8. DOS
|
|
||||||
|
|
||||||
There is an experimental Makefile in the "dos" directory to build
|
|
||||||
XZ Utils on DOS using DJGPP. Support for long file names (LFN) is
|
|
||||||
needed. See dos/README for more information.
|
|
||||||
|
|
||||||
GNU Autotools based build hasn't been tried on DOS. If you try, I
|
|
||||||
would like to hear if it worked.
|
|
||||||
|
|
||||||
|
|
||||||
1.3. Adding support for new platforms
|
|
||||||
|
|
||||||
If you have written patches to make XZ Utils to work on previously
|
|
||||||
unsupported platform, please send the patches to me! I will consider
|
|
||||||
including them to the official version. It's nice to minimize the
|
|
||||||
need of third-party patching.
|
|
||||||
|
|
||||||
One exception: Don't request or send patches to change the whole
|
|
||||||
source package to C89. I find C99 substantially nicer to write and
|
|
||||||
maintain. However, the public library headers must be in C89 to
|
|
||||||
avoid frustrating those who maintain programs, which are strictly
|
|
||||||
in C89 or C++.
|
|
||||||
|
|
||||||
|
|
||||||
2. configure options
|
|
||||||
--------------------
|
|
||||||
|
|
||||||
In most cases, the defaults are what you want. Many of the options
|
|
||||||
below are useful only when building a size-optimized version of
|
|
||||||
liblzma or command line tools.
|
|
||||||
|
|
||||||
--enable-encoders=LIST
|
|
||||||
--disable-encoders
|
|
||||||
Specify a comma-separated LIST of filter encoders to
|
|
||||||
build. See "./configure --help" for exact list of
|
|
||||||
available filter encoders. The default is to build all
|
|
||||||
supported encoders.
|
|
||||||
|
|
||||||
If LIST is empty or --disable-encoders is used, no filter
|
|
||||||
encoders will be built and also the code shared between
|
|
||||||
encoders will be omitted.
|
|
||||||
|
|
||||||
Disabling encoders will remove some symbols from the
|
|
||||||
liblzma ABI, so this option should be used only when it
|
|
||||||
is known to not cause problems.
|
|
||||||
|
|
||||||
--enable-decoders=LIST
|
|
||||||
--disable-decoders
|
|
||||||
This is like --enable-encoders but for decoders. The
|
|
||||||
default is to build all supported decoders.
|
|
||||||
|
|
||||||
--enable-match-finders=LIST
|
|
||||||
liblzma includes two categories of match finders:
|
|
||||||
hash chains and binary trees. Hash chains (hc3 and hc4)
|
|
||||||
are quite fast but they don't provide the best compression
|
|
||||||
ratio. Binary trees (bt2, bt3 and bt4) give excellent
|
|
||||||
compression ratio, but they are slower and need more
|
|
||||||
memory than hash chains.
|
|
||||||
|
|
||||||
You need to enable at least one match finder to build the
|
|
||||||
LZMA1 or LZMA2 filter encoders. Usually hash chains are
|
|
||||||
used only in the fast mode, while binary trees are used to
|
|
||||||
when the best compression ratio is wanted.
|
|
||||||
|
|
||||||
The default is to build all the match finders if LZMA1
|
|
||||||
or LZMA2 filter encoders are being built.
|
|
||||||
|
|
||||||
--enable-checks=LIST
|
|
||||||
liblzma support multiple integrity checks. CRC32 is
|
|
||||||
mandatory, and cannot be omitted. See "./configure --help"
|
|
||||||
for exact list of available integrity check types.
|
|
||||||
|
|
||||||
liblzma and the command line tools can decompress files
|
|
||||||
which use unsupported integrity check type, but naturally
|
|
||||||
the file integrity cannot be verified in that case.
|
|
||||||
|
|
||||||
Disabling integrity checks may remove some symbols from
|
|
||||||
the liblzma ABI, so this option should be used only when
|
|
||||||
it is known to not cause problems.
|
|
||||||
|
|
||||||
--disable-xz
|
|
||||||
--disable-xzdec
|
|
||||||
--disable-lzmadec
|
|
||||||
--disable-lzmainfo
|
|
||||||
Don't build and install the command line tool mentioned
|
|
||||||
in the option name.
|
|
||||||
|
|
||||||
NOTE: Disabling xz will skip some tests in "make check".
|
|
||||||
|
|
||||||
NOTE: If xzdec is disabled and lzmadec is left enabled,
|
|
||||||
a dangling man page symlink lzmadec.1 -> xzdec.1 is
|
|
||||||
created.
|
|
||||||
|
|
||||||
--disable-lzma-links
|
|
||||||
Don't create symlinks for LZMA Utils compatibility.
|
|
||||||
This includes lzma, unlzma, and lzcat. If scripts are
|
|
||||||
installed, also lzdiff, lzcmp, lzgrep, lzegrep, lzfgrep,
|
|
||||||
lzmore, and lzless will be omitted if this option is used.
|
|
||||||
|
|
||||||
--disable-scripts
|
|
||||||
Don't install the scripts xzdiff, xzgrep, xzmore, xzless,
|
|
||||||
and their symlinks.
|
|
||||||
|
|
||||||
--disable-doc
|
|
||||||
Don't install the documentation files to $docdir
|
|
||||||
(often /usr/doc/xz or /usr/local/doc/xz). Man pages
|
|
||||||
will still be installed. The $docdir can be changed
|
|
||||||
with --docdir=DIR.
|
|
||||||
|
|
||||||
--disable-assembler
|
|
||||||
liblzma includes some assembler optimizations. Currently
|
|
||||||
there is only assembler code for CRC32 and CRC64 for
|
|
||||||
32-bit x86.
|
|
||||||
|
|
||||||
All the assembler code in liblzma is position-independent
|
|
||||||
code, which is suitable for use in shared libraries and
|
|
||||||
position-independent executables. So far only i386
|
|
||||||
instructions are used, but the code is optimized for i686
|
|
||||||
class CPUs. If you are compiling liblzma exclusively for
|
|
||||||
pre-i686 systems, you may want to disable the assembler
|
|
||||||
code.
|
|
||||||
|
|
||||||
--enable-unaligned-access
|
|
||||||
Allow liblzma to use unaligned memory access for 16-bit
|
|
||||||
and 32-bit loads and stores. This should be enabled only
|
|
||||||
when the hardware supports this, i.e. when unaligned
|
|
||||||
access is fast. Some operating system kernels emulate
|
|
||||||
unaligned access, which is extremely slow. This option
|
|
||||||
shouldn't be used on systems that rely on such emulation.
|
|
||||||
|
|
||||||
Unaligned access is enabled by default on x86, x86-64,
|
|
||||||
and big endian PowerPC.
|
|
||||||
|
|
||||||
--enable-small
|
|
||||||
Reduce the size of liblzma by selecting smaller but
|
|
||||||
semantically equivalent version of some functions, and
|
|
||||||
omit precomputed lookup tables. This option tends to
|
|
||||||
make liblzma slightly slower.
|
|
||||||
|
|
||||||
Note that while omitting the precomputed tables makes
|
|
||||||
liblzma smaller on disk, the tables are still needed at
|
|
||||||
run time, and need to be computed at startup. This also
|
|
||||||
means that the RAM holding the tables won't be shared
|
|
||||||
between applications linked against shared liblzma.
|
|
||||||
|
|
||||||
This option doesn't modify CFLAGS to tell the compiler
|
|
||||||
to optimize for size. You need to add -Os or equivalent
|
|
||||||
flag(s) to CFLAGS manually.
|
|
||||||
|
|
||||||
--enable-assume-ram=SIZE
|
|
||||||
On the most common operating systems, XZ Utils is able to
|
|
||||||
detect the amount of physical memory on the system. This
|
|
||||||
information is used by the options --memlimit-compress,
|
|
||||||
--memlimit-decompress, and --memlimit when setting the
|
|
||||||
limit to a percentage of total RAM.
|
|
||||||
|
|
||||||
On some systems, there is no code to detect the amount of
|
|
||||||
RAM though. Using --enable-assume-ram one can set how much
|
|
||||||
memory to assume on these systems. SIZE is given as MiB.
|
|
||||||
The default is 128 MiB.
|
|
||||||
|
|
||||||
Feel free to send patches to add support for detecting
|
|
||||||
the amount of RAM on the operating system you use. See
|
|
||||||
src/common/tuklib_physmem.c for details.
|
|
||||||
|
|
||||||
--enable-threads=METHOD
|
|
||||||
Threading support is enabled by default so normally there
|
|
||||||
is no need to specify this option.
|
|
||||||
|
|
||||||
Supported values for METHOD:
|
|
||||||
|
|
||||||
yes Autodetect the threading method. If none
|
|
||||||
is found, configure will give an error.
|
|
||||||
|
|
||||||
posix Use POSIX pthreads. This is the default
|
|
||||||
except on Windows outside Cygwin.
|
|
||||||
|
|
||||||
win95 Use Windows 95 compatible threads. This
|
|
||||||
is compatible with Windows XP and later
|
|
||||||
too. This is the default for 32-bit x86
|
|
||||||
Windows builds. The `win95' threading is
|
|
||||||
incompatible with --enable-small.
|
|
||||||
|
|
||||||
vista Use Windows Vista compatible threads. The
|
|
||||||
resulting binaries won't run on Windows XP
|
|
||||||
or older. This is the default for Windows
|
|
||||||
excluding 32-bit x86 builds (that is, on
|
|
||||||
x86-64 the default is `vista').
|
|
||||||
|
|
||||||
no Disable threading support. This is the
|
|
||||||
same as using --disable-threads.
|
|
||||||
NOTE: If combined with --enable-small, the
|
|
||||||
resulting liblzma won't be thread safe,
|
|
||||||
that is, if a multi-threaded application
|
|
||||||
calls any liblzma functions from more than
|
|
||||||
one thread, something bad may happen.
|
|
||||||
|
|
||||||
--enable-symbol-versions
|
|
||||||
Use symbol versioning for liblzma. This is enabled by
|
|
||||||
default on GNU/Linux, other GNU-based systems, and
|
|
||||||
FreeBSD.
|
|
||||||
|
|
||||||
--enable-debug
|
|
||||||
This enables the assert() macro and possibly some other
|
|
||||||
run-time consistency checks. It makes the code slower, so
|
|
||||||
you normally don't want to have this enabled.
|
|
||||||
|
|
||||||
--enable-werror
|
|
||||||
If building with GCC, make all compiler warnings an error,
|
|
||||||
that abort the compilation. This may help catching bugs,
|
|
||||||
and should work on most systems. This has no effect on the
|
|
||||||
resulting binaries.
|
|
||||||
|
|
||||||
|
|
||||||
2.1. Static vs. dynamic linking of liblzma
|
|
||||||
|
|
||||||
On 32-bit x86, linking against static liblzma can give a minor
|
|
||||||
speed improvement. Static libraries on x86 are usually compiled as
|
|
||||||
position-dependent code (non-PIC) and shared libraries are built as
|
|
||||||
position-independent code (PIC). PIC wastes one register, which can
|
|
||||||
make the code slightly slower compared to a non-PIC version. (Note
|
|
||||||
that this doesn't apply to x86-64.)
|
|
||||||
|
|
||||||
If you want to link xz against static liblzma, the simplest way
|
|
||||||
is to pass --disable-shared to configure. If you want also shared
|
|
||||||
liblzma, run configure again and run "make install" only for
|
|
||||||
src/liblzma.
|
|
||||||
|
|
||||||
|
|
||||||
2.2. Optimizing xzdec and lzmadec
|
|
||||||
|
|
||||||
xzdec and lzmadec are intended to be relatively small instead of
|
|
||||||
optimizing for the best speed. Thus, it is a good idea to build
|
|
||||||
xzdec and lzmadec separately:
|
|
||||||
|
|
||||||
- To link the tools against static liblzma, pass --disable-shared
|
|
||||||
to configure.
|
|
||||||
|
|
||||||
- To select somewhat size-optimized variant of some things in
|
|
||||||
liblzma, pass --enable-small to configure.
|
|
||||||
|
|
||||||
- Tell the compiler to optimize for size instead of speed.
|
|
||||||
E.g. with GCC, put -Os into CFLAGS.
|
|
||||||
|
|
||||||
- xzdec and lzmadec will never use multithreading capabilities of
|
|
||||||
liblzma. You can avoid dependency on libpthread by passing
|
|
||||||
--disable-threads to configure.
|
|
||||||
|
|
||||||
- There are and will be no translated messages for xzdec and
|
|
||||||
lzmadec, so it is fine to pass also --disable-nls to configure.
|
|
||||||
|
|
||||||
- Only decoder code is needed, so you can speed up the build
|
|
||||||
slightly by passing --disable-encoders to configure. This
|
|
||||||
shouldn't affect the final size of the executables though,
|
|
||||||
because the linker is able to omit the encoder code anyway.
|
|
||||||
|
|
||||||
If you have no use for xzdec or lzmadec, you can disable them with
|
|
||||||
--disable-xzdec and --disable-lzmadec.
|
|
||||||
|
|
||||||
|
|
||||||
3. xzgrep and other scripts
|
|
||||||
---------------------------
|
|
||||||
|
|
||||||
3.1. Dependencies
|
|
||||||
|
|
||||||
POSIX shell (sh) and bunch of other standard POSIX tools are required
|
|
||||||
to run the scripts. The configure script tries to find a POSIX
|
|
||||||
compliant sh, but if it fails, you can force the shell by passing
|
|
||||||
gl_cv_posix_shell=/path/to/posix-sh as an argument to the configure
|
|
||||||
script.
|
|
||||||
|
|
||||||
xzdiff (xzcmp/lzdiff/lzcmp) may use mktemp if it is available. As
|
|
||||||
a fallback xzdiff will use mkdir to securely create a temporary
|
|
||||||
directory. Having mktemp available is still recommended since the
|
|
||||||
mkdir fallback method isn't as robust as mktemp is. The original
|
|
||||||
mktemp can be found from <http://www.mktemp.org/>. On GNU, most will
|
|
||||||
use the mktemp program from GNU coreutils instead of the original
|
|
||||||
implementation. Both mktemp versions are fine.
|
|
||||||
|
|
||||||
In addition to using xz to decompress .xz files, xzgrep and xzdiff
|
|
||||||
use gzip, bzip2, and lzop to support .gz, bz2, and .lzo files.
|
|
||||||
|
|
||||||
|
|
||||||
3.2. PATH
|
|
||||||
|
|
||||||
The scripts assume that the required tools (standard POSIX utilities,
|
|
||||||
mktemp, and xz) are in PATH; the scripts don't set the PATH themselves.
|
|
||||||
Some people like this while some think this is a bug. Those in the
|
|
||||||
latter group can easily patch the scripts before running the configure
|
|
||||||
script by taking advantage of a placeholder line in the scripts.
|
|
||||||
|
|
||||||
For example, to make the scripts prefix /usr/bin:/bin to PATH:
|
|
||||||
|
|
||||||
perl -pi -e 's|^#SET_PATH.*$|PATH=/usr/bin:/bin:\$PATH|' \
|
|
||||||
src/scripts/xz*.in
|
|
||||||
|
|
||||||
|
|
||||||
4. Troubleshooting
|
|
||||||
------------------
|
|
||||||
|
|
||||||
4.1. "No C99 compiler was found."
|
|
||||||
|
|
||||||
You need a C99 compiler to build XZ Utils. If the configure script
|
|
||||||
cannot find a C99 compiler and you think you have such a compiler
|
|
||||||
installed, set the compiler command by passing CC=/path/to/c99 as
|
|
||||||
an argument to the configure script.
|
|
||||||
|
|
||||||
If you get this error even when you think your compiler supports C99,
|
|
||||||
you can override the test by passing ac_cv_prog_cc_c99= as an argument
|
|
||||||
to the configure script. The test for C99 compiler is not perfect (and
|
|
||||||
it is not as easy to make it perfect as it sounds), so sometimes this
|
|
||||||
may be needed. You will get a compile error if your compiler doesn't
|
|
||||||
support enough C99.
|
|
||||||
|
|
||||||
|
|
||||||
4.2. "No POSIX conforming shell (sh) was found."
|
|
||||||
|
|
||||||
xzgrep and other scripts need a shell that (roughly) conforms
|
|
||||||
to POSIX. The configure script tries to find such a shell. If
|
|
||||||
it fails, you can force the shell to be used by passing
|
|
||||||
gl_cv_posix_shell=/path/to/posix-sh as an argument to the configure
|
|
||||||
script. Alternatively you can omit the installation of scripts and
|
|
||||||
this error by passing --disable-scripts to configure.
|
|
||||||
|
|
||||||
|
|
||||||
4.3. configure works but build fails at crc32_x86.S
|
|
||||||
|
|
||||||
The easy fix is to pass --disable-assembler to the configure script.
|
|
||||||
|
|
||||||
The configure script determines if assembler code can be used by
|
|
||||||
looking at the configure triplet; there is currently no check if
|
|
||||||
the assembler code can actually actually be built. The x86 assembler
|
|
||||||
code should work on x86 GNU/Linux, *BSDs, Solaris, Darwin, MinGW,
|
|
||||||
Cygwin, and DJGPP. On other x86 systems, there may be problems and
|
|
||||||
the assembler code may need to be disabled with the configure option.
|
|
||||||
|
|
||||||
If you get this error when building for x86-64, you have specified or
|
|
||||||
the configure script has misguessed your architecture. Pass the
|
|
||||||
correct configure triplet using the --build=CPU-COMPANY-SYSTEM option
|
|
||||||
(see INSTALL.generic).
|
|
||||||
|
|
||||||
|
|
||||||
4.4. Lots of warnings about symbol visibility
|
|
||||||
|
|
||||||
On some systems where symbol visibility isn't supported, GCC may
|
|
||||||
still accept the visibility options and attributes, which will make
|
|
||||||
configure think that visibility is supported. This will result in
|
|
||||||
many compiler warnings. You can avoid the warnings by forcing the
|
|
||||||
visibility support off by passing gl_cv_cc_visibility=no as an
|
|
||||||
argument to the configure script. This has no effect on the
|
|
||||||
resulting binaries, but fewer warnings looks nicer and may allow
|
|
||||||
using --enable-werror.
|
|
||||||
|
|
||||||
|
|
||||||
4.5. "make check" fails
|
|
||||||
|
|
||||||
If the other tests pass but test_scripts.sh fails, then the problem
|
|
||||||
is in the scripts in src/scripts. Comparing the contents of
|
|
||||||
tests/xzgrep_test_output to tests/xzgrep_expected_output might
|
|
||||||
give a good idea about problems in xzgrep. One possibility is that
|
|
||||||
some tools are missing from the current PATH or the tools lack
|
|
||||||
support for some POSIX features. This can happen at least on
|
|
||||||
Solaris where the tools in /bin may be ancient but good enough
|
|
||||||
tools are available in /usr/xpg4/bin or /usr/xpg6/bin. One fix
|
|
||||||
for this problem is described in section 3.2 of this file.
|
|
||||||
|
|
||||||
If tests other than test_scripts.sh fail, a likely reason is that
|
|
||||||
libtool links the test programs against an installed version of
|
|
||||||
liblzma instead of the version that was just built. This is
|
|
||||||
obviously a bug which seems to happen on some platforms.
|
|
||||||
A workaround is to uninstall the old liblzma versions first.
|
|
||||||
|
|
||||||
If the problem isn't any of those described above, then it's likely
|
|
||||||
a bug in XZ Utils or in the compiler. See the platform-specific
|
|
||||||
notes in this file for possible known problems. Please report
|
|
||||||
a bug if you cannot solve the problem. See README for contact
|
|
||||||
information.
|
|
||||||
|
|
||||||
|
|
||||||
4.6. liblzma.so (or similar) not found when running xz
|
|
||||||
|
|
||||||
If you installed the package with "make install" and get an error
|
|
||||||
about liblzma.so (or a similarly named file) being missing, try
|
|
||||||
running "ldconfig" to update the run-time linker cache (if your
|
|
||||||
operating system has such a command).
|
|
||||||
|
|
||||||
365
INSTALL.generic
365
INSTALL.generic
@@ -1,365 +0,0 @@
|
|||||||
Installation Instructions
|
|
||||||
*************************
|
|
||||||
|
|
||||||
Copyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005,
|
|
||||||
2006, 2007, 2008, 2009, 2010 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
Copying and distribution of this file, with or without modification,
|
|
||||||
are permitted in any medium without royalty provided the copyright
|
|
||||||
notice and this notice are preserved. This file is offered as-is,
|
|
||||||
without warranty of any kind.
|
|
||||||
|
|
||||||
Basic Installation
|
|
||||||
==================
|
|
||||||
|
|
||||||
Briefly, the shell commands `./configure; make; make install' should
|
|
||||||
configure, build, and install this package. The following
|
|
||||||
more-detailed instructions are generic; see the `README' file for
|
|
||||||
instructions specific to this package. Some packages provide this
|
|
||||||
`INSTALL' file but do not implement all of the features documented
|
|
||||||
below. The lack of an optional feature in a given package is not
|
|
||||||
necessarily a bug. More recommendations for GNU packages can be found
|
|
||||||
in *note Makefile Conventions: (standards)Makefile Conventions.
|
|
||||||
|
|
||||||
The `configure' shell script attempts to guess correct values for
|
|
||||||
various system-dependent variables used during compilation. It uses
|
|
||||||
those values to create a `Makefile' in each directory of the package.
|
|
||||||
It may also create one or more `.h' files containing system-dependent
|
|
||||||
definitions. Finally, it creates a shell script `config.status' that
|
|
||||||
you can run in the future to recreate the current configuration, and a
|
|
||||||
file `config.log' containing compiler output (useful mainly for
|
|
||||||
debugging `configure').
|
|
||||||
|
|
||||||
It can also use an optional file (typically called `config.cache'
|
|
||||||
and enabled with `--cache-file=config.cache' or simply `-C') that saves
|
|
||||||
the results of its tests to speed up reconfiguring. Caching is
|
|
||||||
disabled by default to prevent problems with accidental use of stale
|
|
||||||
cache files.
|
|
||||||
|
|
||||||
If you need to do unusual things to compile the package, please try
|
|
||||||
to figure out how `configure' could check whether to do them, and mail
|
|
||||||
diffs or instructions to the address given in the `README' so they can
|
|
||||||
be considered for the next release. If you are using the cache, and at
|
|
||||||
some point `config.cache' contains results you don't want to keep, you
|
|
||||||
may remove or edit it.
|
|
||||||
|
|
||||||
The file `configure.ac' (or `configure.in') is used to create
|
|
||||||
`configure' by a program called `autoconf'. You need `configure.ac' if
|
|
||||||
you want to change it or regenerate `configure' using a newer version
|
|
||||||
of `autoconf'.
|
|
||||||
|
|
||||||
The simplest way to compile this package is:
|
|
||||||
|
|
||||||
1. `cd' to the directory containing the package's source code and type
|
|
||||||
`./configure' to configure the package for your system.
|
|
||||||
|
|
||||||
Running `configure' might take a while. While running, it prints
|
|
||||||
some messages telling which features it is checking for.
|
|
||||||
|
|
||||||
2. Type `make' to compile the package.
|
|
||||||
|
|
||||||
3. Optionally, type `make check' to run any self-tests that come with
|
|
||||||
the package, generally using the just-built uninstalled binaries.
|
|
||||||
|
|
||||||
4. Type `make install' to install the programs and any data files and
|
|
||||||
documentation. When installing into a prefix owned by root, it is
|
|
||||||
recommended that the package be configured and built as a regular
|
|
||||||
user, and only the `make install' phase executed with root
|
|
||||||
privileges.
|
|
||||||
|
|
||||||
5. Optionally, type `make installcheck' to repeat any self-tests, but
|
|
||||||
this time using the binaries in their final installed location.
|
|
||||||
This target does not install anything. Running this target as a
|
|
||||||
regular user, particularly if the prior `make install' required
|
|
||||||
root privileges, verifies that the installation completed
|
|
||||||
correctly.
|
|
||||||
|
|
||||||
6. You can remove the program binaries and object files from the
|
|
||||||
source code directory by typing `make clean'. To also remove the
|
|
||||||
files that `configure' created (so you can compile the package for
|
|
||||||
a different kind of computer), type `make distclean'. There is
|
|
||||||
also a `make maintainer-clean' target, but that is intended mainly
|
|
||||||
for the package's developers. If you use it, you may have to get
|
|
||||||
all sorts of other programs in order to regenerate files that came
|
|
||||||
with the distribution.
|
|
||||||
|
|
||||||
7. Often, you can also type `make uninstall' to remove the installed
|
|
||||||
files again. In practice, not all packages have tested that
|
|
||||||
uninstallation works correctly, even though it is required by the
|
|
||||||
GNU Coding Standards.
|
|
||||||
|
|
||||||
8. Some packages, particularly those that use Automake, provide `make
|
|
||||||
distcheck', which can by used by developers to test that all other
|
|
||||||
targets like `make install' and `make uninstall' work correctly.
|
|
||||||
This target is generally not run by end users.
|
|
||||||
|
|
||||||
Compilers and Options
|
|
||||||
=====================
|
|
||||||
|
|
||||||
Some systems require unusual options for compilation or linking that
|
|
||||||
the `configure' script does not know about. Run `./configure --help'
|
|
||||||
for details on some of the pertinent environment variables.
|
|
||||||
|
|
||||||
You can give `configure' initial values for configuration parameters
|
|
||||||
by setting variables in the command line or in the environment. Here
|
|
||||||
is an example:
|
|
||||||
|
|
||||||
./configure CC=c99 CFLAGS=-g LIBS=-lposix
|
|
||||||
|
|
||||||
*Note Defining Variables::, for more details.
|
|
||||||
|
|
||||||
Compiling For Multiple Architectures
|
|
||||||
====================================
|
|
||||||
|
|
||||||
You can compile the package for more than one kind of computer at the
|
|
||||||
same time, by placing the object files for each architecture in their
|
|
||||||
own directory. To do this, you can use GNU `make'. `cd' to the
|
|
||||||
directory where you want the object files and executables to go and run
|
|
||||||
the `configure' script. `configure' automatically checks for the
|
|
||||||
source code in the directory that `configure' is in and in `..'. This
|
|
||||||
is known as a "VPATH" build.
|
|
||||||
|
|
||||||
With a non-GNU `make', it is safer to compile the package for one
|
|
||||||
architecture at a time in the source code directory. After you have
|
|
||||||
installed the package for one architecture, use `make distclean' before
|
|
||||||
reconfiguring for another architecture.
|
|
||||||
|
|
||||||
On MacOS X 10.5 and later systems, you can create libraries and
|
|
||||||
executables that work on multiple system types--known as "fat" or
|
|
||||||
"universal" binaries--by specifying multiple `-arch' options to the
|
|
||||||
compiler but only a single `-arch' option to the preprocessor. Like
|
|
||||||
this:
|
|
||||||
|
|
||||||
./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
|
|
||||||
CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
|
|
||||||
CPP="gcc -E" CXXCPP="g++ -E"
|
|
||||||
|
|
||||||
This is not guaranteed to produce working output in all cases, you
|
|
||||||
may have to build one architecture at a time and combine the results
|
|
||||||
using the `lipo' tool if you have problems.
|
|
||||||
|
|
||||||
Installation Names
|
|
||||||
==================
|
|
||||||
|
|
||||||
By default, `make install' installs the package's commands under
|
|
||||||
`/usr/local/bin', include files under `/usr/local/include', etc. You
|
|
||||||
can specify an installation prefix other than `/usr/local' by giving
|
|
||||||
`configure' the option `--prefix=PREFIX', where PREFIX must be an
|
|
||||||
absolute file name.
|
|
||||||
|
|
||||||
You can specify separate installation prefixes for
|
|
||||||
architecture-specific files and architecture-independent files. If you
|
|
||||||
pass the option `--exec-prefix=PREFIX' to `configure', the package uses
|
|
||||||
PREFIX as the prefix for installing programs and libraries.
|
|
||||||
Documentation and other data files still use the regular prefix.
|
|
||||||
|
|
||||||
In addition, if you use an unusual directory layout you can give
|
|
||||||
options like `--bindir=DIR' to specify different values for particular
|
|
||||||
kinds of files. Run `configure --help' for a list of the directories
|
|
||||||
you can set and what kinds of files go in them. In general, the
|
|
||||||
default for these options is expressed in terms of `${prefix}', so that
|
|
||||||
specifying just `--prefix' will affect all of the other directory
|
|
||||||
specifications that were not explicitly provided.
|
|
||||||
|
|
||||||
The most portable way to affect installation locations is to pass the
|
|
||||||
correct locations to `configure'; however, many packages provide one or
|
|
||||||
both of the following shortcuts of passing variable assignments to the
|
|
||||||
`make install' command line to change installation locations without
|
|
||||||
having to reconfigure or recompile.
|
|
||||||
|
|
||||||
The first method involves providing an override variable for each
|
|
||||||
affected directory. For example, `make install
|
|
||||||
prefix=/alternate/directory' will choose an alternate location for all
|
|
||||||
directory configuration variables that were expressed in terms of
|
|
||||||
`${prefix}'. Any directories that were specified during `configure',
|
|
||||||
but not in terms of `${prefix}', must each be overridden at install
|
|
||||||
time for the entire installation to be relocated. The approach of
|
|
||||||
makefile variable overrides for each directory variable is required by
|
|
||||||
the GNU Coding Standards, and ideally causes no recompilation.
|
|
||||||
However, some platforms have known limitations with the semantics of
|
|
||||||
shared libraries that end up requiring recompilation when using this
|
|
||||||
method, particularly noticeable in packages that use GNU Libtool.
|
|
||||||
|
|
||||||
The second method involves providing the `DESTDIR' variable. For
|
|
||||||
example, `make install DESTDIR=/alternate/directory' will prepend
|
|
||||||
`/alternate/directory' before all installation names. The approach of
|
|
||||||
`DESTDIR' overrides is not required by the GNU Coding Standards, and
|
|
||||||
does not work on platforms that have drive letters. On the other hand,
|
|
||||||
it does better at avoiding recompilation issues, and works well even
|
|
||||||
when some directory options were not specified in terms of `${prefix}'
|
|
||||||
at `configure' time.
|
|
||||||
|
|
||||||
Optional Features
|
|
||||||
=================
|
|
||||||
|
|
||||||
If the package supports it, you can cause programs to be installed
|
|
||||||
with an extra prefix or suffix on their names by giving `configure' the
|
|
||||||
option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
|
|
||||||
|
|
||||||
Some packages pay attention to `--enable-FEATURE' options to
|
|
||||||
`configure', where FEATURE indicates an optional part of the package.
|
|
||||||
They may also pay attention to `--with-PACKAGE' options, where PACKAGE
|
|
||||||
is something like `gnu-as' or `x' (for the X Window System). The
|
|
||||||
`README' should mention any `--enable-' and `--with-' options that the
|
|
||||||
package recognizes.
|
|
||||||
|
|
||||||
For packages that use the X Window System, `configure' can usually
|
|
||||||
find the X include and library files automatically, but if it doesn't,
|
|
||||||
you can use the `configure' options `--x-includes=DIR' and
|
|
||||||
`--x-libraries=DIR' to specify their locations.
|
|
||||||
|
|
||||||
Some packages offer the ability to configure how verbose the
|
|
||||||
execution of `make' will be. For these packages, running `./configure
|
|
||||||
--enable-silent-rules' sets the default to minimal output, which can be
|
|
||||||
overridden with `make V=1'; while running `./configure
|
|
||||||
--disable-silent-rules' sets the default to verbose, which can be
|
|
||||||
overridden with `make V=0'.
|
|
||||||
|
|
||||||
Particular systems
|
|
||||||
==================
|
|
||||||
|
|
||||||
On HP-UX, the default C compiler is not ANSI C compatible. If GNU
|
|
||||||
CC is not installed, it is recommended to use the following options in
|
|
||||||
order to use an ANSI C compiler:
|
|
||||||
|
|
||||||
./configure CC="cc -Ae -D_XOPEN_SOURCE=500"
|
|
||||||
|
|
||||||
and if that doesn't work, install pre-built binaries of GCC for HP-UX.
|
|
||||||
|
|
||||||
On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot
|
|
||||||
parse its `<wchar.h>' header file. The option `-nodtk' can be used as
|
|
||||||
a workaround. If GNU CC is not installed, it is therefore recommended
|
|
||||||
to try
|
|
||||||
|
|
||||||
./configure CC="cc"
|
|
||||||
|
|
||||||
and if that doesn't work, try
|
|
||||||
|
|
||||||
./configure CC="cc -nodtk"
|
|
||||||
|
|
||||||
On Solaris, don't put `/usr/ucb' early in your `PATH'. This
|
|
||||||
directory contains several dysfunctional programs; working variants of
|
|
||||||
these programs are available in `/usr/bin'. So, if you need `/usr/ucb'
|
|
||||||
in your `PATH', put it _after_ `/usr/bin'.
|
|
||||||
|
|
||||||
On Haiku, software installed for all users goes in `/boot/common',
|
|
||||||
not `/usr/local'. It is recommended to use the following options:
|
|
||||||
|
|
||||||
./configure --prefix=/boot/common
|
|
||||||
|
|
||||||
Specifying the System Type
|
|
||||||
==========================
|
|
||||||
|
|
||||||
There may be some features `configure' cannot figure out
|
|
||||||
automatically, but needs to determine by the type of machine the package
|
|
||||||
will run on. Usually, assuming the package is built to be run on the
|
|
||||||
_same_ architectures, `configure' can figure that out, but if it prints
|
|
||||||
a message saying it cannot guess the machine type, give it the
|
|
||||||
`--build=TYPE' option. TYPE can either be a short name for the system
|
|
||||||
type, such as `sun4', or a canonical name which has the form:
|
|
||||||
|
|
||||||
CPU-COMPANY-SYSTEM
|
|
||||||
|
|
||||||
where SYSTEM can have one of these forms:
|
|
||||||
|
|
||||||
OS
|
|
||||||
KERNEL-OS
|
|
||||||
|
|
||||||
See the file `config.sub' for the possible values of each field. If
|
|
||||||
`config.sub' isn't included in this package, then this package doesn't
|
|
||||||
need to know the machine type.
|
|
||||||
|
|
||||||
If you are _building_ compiler tools for cross-compiling, you should
|
|
||||||
use the option `--target=TYPE' to select the type of system they will
|
|
||||||
produce code for.
|
|
||||||
|
|
||||||
If you want to _use_ a cross compiler, that generates code for a
|
|
||||||
platform different from the build platform, you should specify the
|
|
||||||
"host" platform (i.e., that on which the generated programs will
|
|
||||||
eventually be run) with `--host=TYPE'.
|
|
||||||
|
|
||||||
Sharing Defaults
|
|
||||||
================
|
|
||||||
|
|
||||||
If you want to set default values for `configure' scripts to share,
|
|
||||||
you can create a site shell script called `config.site' that gives
|
|
||||||
default values for variables like `CC', `cache_file', and `prefix'.
|
|
||||||
`configure' looks for `PREFIX/share/config.site' if it exists, then
|
|
||||||
`PREFIX/etc/config.site' if it exists. Or, you can set the
|
|
||||||
`CONFIG_SITE' environment variable to the location of the site script.
|
|
||||||
A warning: not all `configure' scripts look for a site script.
|
|
||||||
|
|
||||||
Defining Variables
|
|
||||||
==================
|
|
||||||
|
|
||||||
Variables not defined in a site shell script can be set in the
|
|
||||||
environment passed to `configure'. However, some packages may run
|
|
||||||
configure again during the build, and the customized values of these
|
|
||||||
variables may be lost. In order to avoid this problem, you should set
|
|
||||||
them in the `configure' command line, using `VAR=value'. For example:
|
|
||||||
|
|
||||||
./configure CC=/usr/local2/bin/gcc
|
|
||||||
|
|
||||||
causes the specified `gcc' to be used as the C compiler (unless it is
|
|
||||||
overridden in the site shell script).
|
|
||||||
|
|
||||||
Unfortunately, this technique does not work for `CONFIG_SHELL' due to
|
|
||||||
an Autoconf bug. Until the bug is fixed you can use this workaround:
|
|
||||||
|
|
||||||
CONFIG_SHELL=/bin/bash /bin/bash ./configure CONFIG_SHELL=/bin/bash
|
|
||||||
|
|
||||||
`configure' Invocation
|
|
||||||
======================
|
|
||||||
|
|
||||||
`configure' recognizes the following options to control how it
|
|
||||||
operates.
|
|
||||||
|
|
||||||
`--help'
|
|
||||||
`-h'
|
|
||||||
Print a summary of all of the options to `configure', and exit.
|
|
||||||
|
|
||||||
`--help=short'
|
|
||||||
`--help=recursive'
|
|
||||||
Print a summary of the options unique to this package's
|
|
||||||
`configure', and exit. The `short' variant lists options used
|
|
||||||
only in the top level, while the `recursive' variant lists options
|
|
||||||
also present in any nested packages.
|
|
||||||
|
|
||||||
`--version'
|
|
||||||
`-V'
|
|
||||||
Print the version of Autoconf used to generate the `configure'
|
|
||||||
script, and exit.
|
|
||||||
|
|
||||||
`--cache-file=FILE'
|
|
||||||
Enable the cache: use and save the results of the tests in FILE,
|
|
||||||
traditionally `config.cache'. FILE defaults to `/dev/null' to
|
|
||||||
disable caching.
|
|
||||||
|
|
||||||
`--config-cache'
|
|
||||||
`-C'
|
|
||||||
Alias for `--cache-file=config.cache'.
|
|
||||||
|
|
||||||
`--quiet'
|
|
||||||
`--silent'
|
|
||||||
`-q'
|
|
||||||
Do not print messages saying which checks are being made. To
|
|
||||||
suppress all normal output, redirect it to `/dev/null' (any error
|
|
||||||
messages will still be shown).
|
|
||||||
|
|
||||||
`--srcdir=DIR'
|
|
||||||
Look for the package's source code in directory DIR. Usually
|
|
||||||
`configure' can determine that directory automatically.
|
|
||||||
|
|
||||||
`--prefix=DIR'
|
|
||||||
Use DIR as the installation prefix. *note Installation Names::
|
|
||||||
for more details, including other options available for fine-tuning
|
|
||||||
the installation locations.
|
|
||||||
|
|
||||||
`--no-create'
|
|
||||||
`-n'
|
|
||||||
Run the configure checks, but stop before creating any output
|
|
||||||
files.
|
|
||||||
|
|
||||||
`configure' also accepts some other, not widely useful, options. Run
|
|
||||||
`configure --help' for more details.
|
|
||||||
|
|
||||||
5
Makefile
Normal file
5
Makefile
Normal file
@@ -0,0 +1,5 @@
|
|||||||
|
all:
|
||||||
|
-@echo "Please use ./configure first. Thank you."
|
||||||
|
|
||||||
|
distclean:
|
||||||
|
make -f Makefile.in distclean
|
||||||
109
Makefile.am
109
Makefile.am
@@ -1,109 +0,0 @@
|
|||||||
##
|
|
||||||
## Author: Lasse Collin
|
|
||||||
##
|
|
||||||
## This file has been put into the public domain.
|
|
||||||
## You can do whatever you want with this file.
|
|
||||||
##
|
|
||||||
|
|
||||||
# Use -n to prevent gzip from adding a timestamp to the .gz headers.
|
|
||||||
GZIP_ENV = -9n
|
|
||||||
|
|
||||||
DIST_SUBDIRS = lib src po tests debug
|
|
||||||
SUBDIRS =
|
|
||||||
|
|
||||||
if COND_GNULIB
|
|
||||||
SUBDIRS += lib
|
|
||||||
endif
|
|
||||||
|
|
||||||
SUBDIRS += src po tests
|
|
||||||
|
|
||||||
if COND_DOC
|
|
||||||
dist_doc_DATA = \
|
|
||||||
AUTHORS \
|
|
||||||
COPYING \
|
|
||||||
COPYING.GPLv2 \
|
|
||||||
NEWS \
|
|
||||||
README \
|
|
||||||
THANKS \
|
|
||||||
TODO \
|
|
||||||
doc/faq.txt \
|
|
||||||
doc/history.txt \
|
|
||||||
doc/xz-file-format.txt \
|
|
||||||
doc/lzma-file-format.txt
|
|
||||||
|
|
||||||
examplesdir = $(docdir)/examples
|
|
||||||
dist_examples_DATA = \
|
|
||||||
doc/examples/00_README.txt \
|
|
||||||
doc/examples/01_compress_easy.c \
|
|
||||||
doc/examples/02_decompress.c \
|
|
||||||
doc/examples/03_compress_custom.c \
|
|
||||||
doc/examples/04_compress_easy_mt.c \
|
|
||||||
doc/examples/Makefile
|
|
||||||
|
|
||||||
examplesolddir = $(docdir)/examples_old
|
|
||||||
dist_examplesold_DATA = \
|
|
||||||
doc/examples_old/xz_pipe_comp.c \
|
|
||||||
doc/examples_old/xz_pipe_decomp.c
|
|
||||||
endif
|
|
||||||
|
|
||||||
EXTRA_DIST = \
|
|
||||||
extra \
|
|
||||||
dos \
|
|
||||||
windows \
|
|
||||||
macosx \
|
|
||||||
autogen.sh \
|
|
||||||
Doxyfile.in \
|
|
||||||
COPYING.GPLv2 \
|
|
||||||
COPYING.GPLv3 \
|
|
||||||
COPYING.LGPLv2.1 \
|
|
||||||
INSTALL.generic \
|
|
||||||
PACKAGERS \
|
|
||||||
build-aux/manconv.sh \
|
|
||||||
build-aux/version.sh
|
|
||||||
|
|
||||||
ACLOCAL_AMFLAGS = -I m4
|
|
||||||
|
|
||||||
# List of man pages to conver to PDF and plain text in the dist-hook target.
|
|
||||||
manfiles = \
|
|
||||||
src/xz/xz.1 \
|
|
||||||
src/xzdec/xzdec.1 \
|
|
||||||
src/lzmainfo/lzmainfo.1 \
|
|
||||||
src/scripts/xzdiff.1 \
|
|
||||||
src/scripts/xzgrep.1 \
|
|
||||||
src/scripts/xzless.1 \
|
|
||||||
src/scripts/xzmore.1
|
|
||||||
|
|
||||||
# Create ChangeLog from output of "git log --date=iso --stat".
|
|
||||||
# Convert the man pages to PDF and plain text (ASCII only) formats.
|
|
||||||
dist-hook:
|
|
||||||
if test -d "$(srcdir)/.git" && type git > /dev/null 2>&1; then \
|
|
||||||
( cd "$(srcdir)" && git log --date=iso --stat ) \
|
|
||||||
> "$(distdir)/ChangeLog"; \
|
|
||||||
fi
|
|
||||||
if type groff > /dev/null 2>&1 && type ps2pdf > /dev/null 2>&1; then \
|
|
||||||
dest="$(distdir)/doc/man" && \
|
|
||||||
$(MKDIR_P) "$$dest/pdf-a4" "$$dest/pdf-letter" "$$dest/txt" && \
|
|
||||||
for FILE in $(manfiles); do \
|
|
||||||
BASE=`basename $$FILE .1` && \
|
|
||||||
sh "$(srcdir)/build-aux/manconv.sh" pdf a4 \
|
|
||||||
< "$(srcdir)/$$FILE" \
|
|
||||||
> "$$dest/pdf-a4/$$BASE-a4.pdf" && \
|
|
||||||
sh "$(srcdir)/build-aux/manconv.sh" pdf letter \
|
|
||||||
< "$(srcdir)/$$FILE" \
|
|
||||||
> "$$dest/pdf-letter/$$BASE-letter.pdf" && \
|
|
||||||
sh "$(srcdir)/build-aux/manconv.sh" ascii \
|
|
||||||
< "$(srcdir)/$$FILE" \
|
|
||||||
> "$$dest/txt/$$BASE.txt"; \
|
|
||||||
done; \
|
|
||||||
fi
|
|
||||||
|
|
||||||
# This works with GNU tar and gives cleaner package than normal 'make dist'.
|
|
||||||
mydist:
|
|
||||||
sh "$(srcdir)/src/liblzma/validate_map.sh"
|
|
||||||
VERSION=$(VERSION); \
|
|
||||||
if test -d "$(srcdir)/.git" && type git > /dev/null 2>&1; then \
|
|
||||||
SNAPSHOT=`cd "$(srcdir)" && git describe --abbrev=4 | cut -b2-`; \
|
|
||||||
test -n "$$SNAPSHOT" && VERSION=$$SNAPSHOT; \
|
|
||||||
fi; \
|
|
||||||
TAR_OPTIONS='--owner=0 --group=0 --numeric-owner --mode=u+rw,go+r-w' \
|
|
||||||
$(MAKE) VERSION="$$VERSION" dist-gzip
|
|
||||||
1429
Makefile.in
1429
Makefile.in
File diff suppressed because it is too large
Load Diff
505
NEWS
505
NEWS
@@ -1,505 +0,0 @@
|
|||||||
|
|
||||||
XZ Utils Release Notes
|
|
||||||
======================
|
|
||||||
|
|
||||||
5.2.2 (2015-09-29)
|
|
||||||
|
|
||||||
* Fixed bugs in QNX-specific code.
|
|
||||||
|
|
||||||
* Omitted the use of pipe2() even if it is available to avoid
|
|
||||||
portability issues with some old Linux and glibc combinations.
|
|
||||||
|
|
||||||
* Updated German translation.
|
|
||||||
|
|
||||||
* Added project files to build static and shared liblzma (not the
|
|
||||||
whole XZ Utils) with Visual Studio 2013 update 2 or later.
|
|
||||||
|
|
||||||
* Documented that threaded decompression hasn't been implemented
|
|
||||||
yet. A 5.2.0 NEWS entry describing multi-threading support had
|
|
||||||
incorrectly said "decompression" when it should have said
|
|
||||||
"compression".
|
|
||||||
|
|
||||||
|
|
||||||
5.2.1 (2015-02-26)
|
|
||||||
|
|
||||||
* Fixed a compression-ratio regression in fast mode of LZMA1 and
|
|
||||||
LZMA2. The bug is present in 5.1.4beta and 5.2.0 releases.
|
|
||||||
|
|
||||||
* Fixed a portability problem in xz that affected at least OpenBSD.
|
|
||||||
|
|
||||||
* Fixed xzdiff to be compatible with FreeBSD's mktemp which differs
|
|
||||||
from most other mktemp implementations.
|
|
||||||
|
|
||||||
* Changed CPU core count detection to use cpuset_getaffinity() on
|
|
||||||
FreeBSD.
|
|
||||||
|
|
||||||
|
|
||||||
5.2.0 (2014-12-21)
|
|
||||||
|
|
||||||
Since 5.1.4beta:
|
|
||||||
|
|
||||||
* All fixes from 5.0.8
|
|
||||||
|
|
||||||
* liblzma: Fixed lzma_stream_encoder_mt_memusage() when a preset
|
|
||||||
was used.
|
|
||||||
|
|
||||||
* xzdiff: If mktemp isn't installed, mkdir will be used as
|
|
||||||
a fallback to create a temporary directory. Installing mktemp
|
|
||||||
is still recommended.
|
|
||||||
|
|
||||||
* Updated French, German, Italian, Polish, and Vietnamese
|
|
||||||
translations.
|
|
||||||
|
|
||||||
Summary of fixes and new features added in the 5.1.x development
|
|
||||||
releases:
|
|
||||||
|
|
||||||
* liblzma:
|
|
||||||
|
|
||||||
- Added support for multi-threaded compression. See the
|
|
||||||
lzma_mt structure, lzma_stream_encoder_mt(), and
|
|
||||||
lzma_stream_encoder_mt_memusage() in <lzma/container.h>,
|
|
||||||
lzma_get_progress() in <lzma/base.h>, and lzma_cputhreads()
|
|
||||||
in <lzma/hardware.h> for details.
|
|
||||||
|
|
||||||
- Made the uses of lzma_allocator const correct.
|
|
||||||
|
|
||||||
- Added lzma_block_uncomp_encode() to create uncompressed
|
|
||||||
.xz Blocks using LZMA2 uncompressed chunks.
|
|
||||||
|
|
||||||
- Added support for LZMA_IGNORE_CHECK.
|
|
||||||
|
|
||||||
- A few speed optimizations were made.
|
|
||||||
|
|
||||||
- Added support for symbol versioning. It is enabled by default
|
|
||||||
on GNU/Linux, other GNU-based systems, and FreeBSD.
|
|
||||||
|
|
||||||
- liblzma (not the whole XZ Utils) should now be buildable
|
|
||||||
with MSVC 2013 update 2 or later using windows/config.h.
|
|
||||||
|
|
||||||
* xz:
|
|
||||||
|
|
||||||
- Fixed a race condition in the signal handling. It was
|
|
||||||
possible that e.g. the first SIGINT didn't make xz exit
|
|
||||||
if reading or writing blocked and one had bad luck. The fix
|
|
||||||
is non-trivial, so as of writing it is unknown if it will be
|
|
||||||
backported to the v5.0 branch.
|
|
||||||
|
|
||||||
- Multi-threaded compression can be enabled with the
|
|
||||||
--threads (-T) option.
|
|
||||||
[Fixed: This originally said "decompression".]
|
|
||||||
|
|
||||||
- New command line options in xz: --single-stream,
|
|
||||||
--block-size=SIZE, --block-list=SIZES,
|
|
||||||
--flush-timeout=TIMEOUT, and --ignore-check.
|
|
||||||
|
|
||||||
- xz -lvv now shows the minimum xz version that is required to
|
|
||||||
decompress the file. Currently it is 5.0.0 for all supported
|
|
||||||
.xz files except files with empty LZMA2 streams require 5.0.2.
|
|
||||||
|
|
||||||
* xzdiff and xzgrep now support .lzo files if lzop is installed.
|
|
||||||
The .tzo suffix is also recognized as a shorthand for .tar.lzo.
|
|
||||||
|
|
||||||
|
|
||||||
5.1.4beta (2014-09-14)
|
|
||||||
|
|
||||||
* All fixes from 5.0.6
|
|
||||||
|
|
||||||
* liblzma: Fixed the use of presets in threaded encoder
|
|
||||||
initialization.
|
|
||||||
|
|
||||||
* xz --block-list and --block-size can now be used together
|
|
||||||
in single-threaded mode. Previously the combination only
|
|
||||||
worked in multi-threaded mode.
|
|
||||||
|
|
||||||
* Added support for LZMA_IGNORE_CHECK to liblzma and made it
|
|
||||||
available in xz as --ignore-check.
|
|
||||||
|
|
||||||
* liblzma speed optimizations:
|
|
||||||
|
|
||||||
- Initialization of a new LZMA1 or LZMA2 encoder has been
|
|
||||||
optimized. (The speed of reinitializing an already-allocated
|
|
||||||
encoder isn't affected.) This helps when compressing many
|
|
||||||
small buffers with lzma_stream_buffer_encode() and other
|
|
||||||
similar situations where an already-allocated encoder state
|
|
||||||
isn't reused. This speed-up is visible in xz too if one
|
|
||||||
compresses many small files one at a time instead running xz
|
|
||||||
once and giving all files as command-line arguments.
|
|
||||||
|
|
||||||
- Buffer comparisons are now much faster when unaligned access
|
|
||||||
is allowed (configured with --enable-unaligned-access). This
|
|
||||||
speeds up encoding significantly. There is arch-specific code
|
|
||||||
for 32-bit and 64-bit x86 (32-bit needs SSE2 for the best
|
|
||||||
results and there's no run-time CPU detection for now).
|
|
||||||
For other archs there is only generic code which probably
|
|
||||||
isn't as optimal as arch-specific solutions could be.
|
|
||||||
|
|
||||||
- A few speed optimizations were made to the SHA-256 code.
|
|
||||||
(Note that the builtin SHA-256 code isn't used on all
|
|
||||||
operating systems.)
|
|
||||||
|
|
||||||
* liblzma can now be built with MSVC 2013 update 2 or later
|
|
||||||
using windows/config.h.
|
|
||||||
|
|
||||||
* Vietnamese translation was added.
|
|
||||||
|
|
||||||
|
|
||||||
5.1.3alpha (2013-10-26)
|
|
||||||
|
|
||||||
* All fixes from 5.0.5
|
|
||||||
|
|
||||||
* liblzma:
|
|
||||||
|
|
||||||
- Fixed a deadlock in the threaded encoder.
|
|
||||||
|
|
||||||
- Made the uses of lzma_allocator const correct.
|
|
||||||
|
|
||||||
- Added lzma_block_uncomp_encode() to create uncompressed
|
|
||||||
.xz Blocks using LZMA2 uncompressed chunks.
|
|
||||||
|
|
||||||
- Added support for native threads on Windows and the ability
|
|
||||||
to detect the number of CPU cores.
|
|
||||||
|
|
||||||
* xz:
|
|
||||||
|
|
||||||
- Fixed a race condition in the signal handling. It was
|
|
||||||
possible that e.g. the first SIGINT didn't make xz exit
|
|
||||||
if reading or writing blocked and one had bad luck. The fix
|
|
||||||
is non-trivial, so as of writing it is unknown if it will be
|
|
||||||
backported to the v5.0 branch.
|
|
||||||
|
|
||||||
- Made the progress indicator work correctly in threaded mode.
|
|
||||||
|
|
||||||
- Threaded encoder now works together with --block-list=SIZES.
|
|
||||||
|
|
||||||
- Added preliminary support for --flush-timeout=TIMEOUT.
|
|
||||||
It can be useful for (somewhat) real-time streaming. For
|
|
||||||
now the decompression side has to be done with something
|
|
||||||
else than the xz tool due to how xz does buffering, but this
|
|
||||||
should be fixed.
|
|
||||||
|
|
||||||
|
|
||||||
5.1.2alpha (2012-07-04)
|
|
||||||
|
|
||||||
* All fixes from 5.0.3 and 5.0.4
|
|
||||||
|
|
||||||
* liblzma:
|
|
||||||
|
|
||||||
- Fixed a deadlock and an invalid free() in the threaded encoder.
|
|
||||||
|
|
||||||
- Added support for symbol versioning. It is enabled by default
|
|
||||||
on GNU/Linux, other GNU-based systems, and FreeBSD.
|
|
||||||
|
|
||||||
- Use SHA-256 implementation from the operating system if one is
|
|
||||||
available in libc, libmd, or libutil. liblzma won't use e.g.
|
|
||||||
OpenSSL or libgcrypt to avoid introducing new dependencies.
|
|
||||||
|
|
||||||
- Fixed liblzma.pc for static linking.
|
|
||||||
|
|
||||||
- Fixed a few portability bugs.
|
|
||||||
|
|
||||||
* xz --decompress --single-stream now fixes the input position after
|
|
||||||
successful decompression. Now the following works:
|
|
||||||
|
|
||||||
echo foo | xz > foo.xz
|
|
||||||
echo bar | xz >> foo.xz
|
|
||||||
( xz -dc --single-stream ; xz -dc --single-stream ) < foo.xz
|
|
||||||
|
|
||||||
Note that it doesn't work if the input is not seekable
|
|
||||||
or if there is Stream Padding between the concatenated
|
|
||||||
.xz Streams.
|
|
||||||
|
|
||||||
* xz -lvv now shows the minimum xz version that is required to
|
|
||||||
decompress the file. Currently it is 5.0.0 for all supported .xz
|
|
||||||
files except files with empty LZMA2 streams require 5.0.2.
|
|
||||||
|
|
||||||
* Added an *incomplete* implementation of --block-list=SIZES to xz.
|
|
||||||
It only works correctly in single-threaded mode and when
|
|
||||||
--block-size isn't used at the same time. --block-list allows
|
|
||||||
specifying the sizes of Blocks which can be useful e.g. when
|
|
||||||
creating files for random-access reading.
|
|
||||||
|
|
||||||
|
|
||||||
5.1.1alpha (2011-04-12)
|
|
||||||
|
|
||||||
* All fixes from 5.0.2
|
|
||||||
|
|
||||||
* liblzma fixes that will also be included in 5.0.3:
|
|
||||||
|
|
||||||
- A memory leak was fixed.
|
|
||||||
|
|
||||||
- lzma_stream_buffer_encode() no longer creates an empty .xz
|
|
||||||
Block if encoding an empty buffer. Such an empty Block with
|
|
||||||
LZMA2 data would trigger a bug in 5.0.1 and older (see the
|
|
||||||
first bullet point in 5.0.2 notes). When releasing 5.0.2,
|
|
||||||
I thought that no encoder creates this kind of files but
|
|
||||||
I was wrong.
|
|
||||||
|
|
||||||
- Validate function arguments better in a few functions. Most
|
|
||||||
importantly, specifying an unsupported integrity check to
|
|
||||||
lzma_stream_buffer_encode() no longer creates a corrupt .xz
|
|
||||||
file. Probably no application tries to do that, so this
|
|
||||||
shouldn't be a big problem in practice.
|
|
||||||
|
|
||||||
- Document that lzma_block_buffer_encode(),
|
|
||||||
lzma_easy_buffer_encode(), lzma_stream_encoder(), and
|
|
||||||
lzma_stream_buffer_encode() may return LZMA_UNSUPPORTED_CHECK.
|
|
||||||
|
|
||||||
- The return values of the _memusage() functions are now
|
|
||||||
documented better.
|
|
||||||
|
|
||||||
* Support for multithreaded compression was added using the simplest
|
|
||||||
method, which splits the input data into blocks and compresses
|
|
||||||
them independently. Other methods will be added in the future.
|
|
||||||
The current method has room for improvement, e.g. it is possible
|
|
||||||
to reduce the memory usage.
|
|
||||||
|
|
||||||
* Added the options --single-stream and --block-size=SIZE to xz.
|
|
||||||
|
|
||||||
* xzdiff and xzgrep now support .lzo files if lzop is installed.
|
|
||||||
The .tzo suffix is also recognized as a shorthand for .tar.lzo.
|
|
||||||
|
|
||||||
* Support for short 8.3 filenames under DOS was added to xz. It is
|
|
||||||
experimental and may change before it gets into a stable release.
|
|
||||||
|
|
||||||
|
|
||||||
5.0.8 (2014-12-21)
|
|
||||||
|
|
||||||
* Fixed an old bug in xzgrep that affected OpenBSD and probably
|
|
||||||
a few other operating systems too.
|
|
||||||
|
|
||||||
* Updated French and German translations.
|
|
||||||
|
|
||||||
* Added support for detecting the amount of RAM on AmigaOS/AROS.
|
|
||||||
|
|
||||||
* Minor build system updates.
|
|
||||||
|
|
||||||
|
|
||||||
5.0.7 (2014-09-20)
|
|
||||||
|
|
||||||
* Fix regressions introduced in 5.0.6:
|
|
||||||
|
|
||||||
- Fix building with non-GNU make.
|
|
||||||
|
|
||||||
- Fix invalid Libs.private value in liblzma.pc which broke
|
|
||||||
static linking against liblzma if the linker flags were
|
|
||||||
taken from pkg-config.
|
|
||||||
|
|
||||||
|
|
||||||
5.0.6 (2014-09-14)
|
|
||||||
|
|
||||||
* xzgrep now exits with status 0 if at least one file matched.
|
|
||||||
|
|
||||||
* A few minor portability and build system fixes
|
|
||||||
|
|
||||||
|
|
||||||
5.0.5 (2013-06-30)
|
|
||||||
|
|
||||||
* lzmadec and liblzma's lzma_alone_decoder(): Support decompressing
|
|
||||||
.lzma files that have less common settings in the headers
|
|
||||||
(dictionary size other than 2^n or 2^n + 2^(n-1), or uncompressed
|
|
||||||
size greater than 256 GiB). The limitations existed to avoid false
|
|
||||||
positives when detecting .lzma files. The lc + lp <= 4 limitation
|
|
||||||
still remains since liblzma's LZMA decoder has that limitation.
|
|
||||||
|
|
||||||
NOTE: xz's .lzma support or liblzma's lzma_auto_decoder() are NOT
|
|
||||||
affected by this change. They still consider uncommon .lzma headers
|
|
||||||
as not being in the .lzma format. Changing this would give way too
|
|
||||||
many false positives.
|
|
||||||
|
|
||||||
* xz:
|
|
||||||
|
|
||||||
- Interaction of preset and custom filter chain options was
|
|
||||||
made less illogical. This affects only certain less typical
|
|
||||||
uses cases so few people are expected to notice this change.
|
|
||||||
|
|
||||||
Now when a custom filter chain option (e.g. --lzma2) is
|
|
||||||
specified, all preset options (-0 ... -9, -e) earlier are on
|
|
||||||
the command line are completely forgotten. Similarly, when
|
|
||||||
a preset option is specified, all custom filter chain options
|
|
||||||
earlier on the command line are completely forgotten.
|
|
||||||
|
|
||||||
Example 1: "xz -9 --lzma2=preset=5 -e" is equivalent to "xz -e"
|
|
||||||
which is equivalent to "xz -6e". Earlier -e didn't put xz back
|
|
||||||
into preset mode and thus the example command was equivalent
|
|
||||||
to "xz --lzma2=preset=5".
|
|
||||||
|
|
||||||
Example 2: "xz -9e --lzma2=preset=5 -7" is equivalent to
|
|
||||||
"xz -7". Earlier a custom filter chain option didn't make
|
|
||||||
xz forget the -e option so the example was equivalent to
|
|
||||||
"xz -7e".
|
|
||||||
|
|
||||||
- Fixes and improvements to error handling.
|
|
||||||
|
|
||||||
- Various fixes to the man page.
|
|
||||||
|
|
||||||
* xzless: Fixed to work with "less" versions 448 and later.
|
|
||||||
|
|
||||||
* xzgrep: Made -h an alias for --no-filename.
|
|
||||||
|
|
||||||
* Include the previously missing debug/translation.bash which can
|
|
||||||
be useful for translators.
|
|
||||||
|
|
||||||
* Include a build script for Mac OS X. This has been in the Git
|
|
||||||
repository since 2010 but due to a mistake in Makefile.am the
|
|
||||||
script hasn't been included in a release tarball before.
|
|
||||||
|
|
||||||
|
|
||||||
5.0.4 (2012-06-22)
|
|
||||||
|
|
||||||
* liblzma:
|
|
||||||
|
|
||||||
- Fix lzma_index_init(). It could crash if memory allocation
|
|
||||||
failed.
|
|
||||||
|
|
||||||
- Fix the possibility of an incorrect LZMA_BUF_ERROR when a BCJ
|
|
||||||
filter is used and the application only provides exactly as
|
|
||||||
much output space as is the uncompressed size of the file.
|
|
||||||
|
|
||||||
- Fix a bug in doc/examples_old/xz_pipe_decompress.c. It didn't
|
|
||||||
check if the last call to lzma_code() really returned
|
|
||||||
LZMA_STREAM_END, which made the program think that truncated
|
|
||||||
files are valid.
|
|
||||||
|
|
||||||
- New example programs in doc/examples (old programs are now in
|
|
||||||
doc/examples_old). These have more comments and more detailed
|
|
||||||
error handling.
|
|
||||||
|
|
||||||
* Fix "xz -lvv foo.xz". It could crash on some corrupted files.
|
|
||||||
|
|
||||||
* Fix output of "xz --robot -lv" and "xz --robot -lvv" which
|
|
||||||
incorrectly printed the filename also in the "foo (x/x)" format.
|
|
||||||
|
|
||||||
* Fix exit status of "xzdiff foo.xz bar.xz".
|
|
||||||
|
|
||||||
* Fix exit status of "xzgrep foo binary_file".
|
|
||||||
|
|
||||||
* Fix portability to EBCDIC systems.
|
|
||||||
|
|
||||||
* Fix a configure issue on AIX with the XL C compiler. See INSTALL
|
|
||||||
for details.
|
|
||||||
|
|
||||||
* Update French, German, Italian, and Polish translations.
|
|
||||||
|
|
||||||
|
|
||||||
5.0.3 (2011-05-21)
|
|
||||||
|
|
||||||
* liblzma fixes:
|
|
||||||
|
|
||||||
- A memory leak was fixed.
|
|
||||||
|
|
||||||
- lzma_stream_buffer_encode() no longer creates an empty .xz
|
|
||||||
Block if encoding an empty buffer. Such an empty Block with
|
|
||||||
LZMA2 data would trigger a bug in 5.0.1 and older (see the
|
|
||||||
first bullet point in 5.0.2 notes). When releasing 5.0.2,
|
|
||||||
I thought that no encoder creates this kind of files but
|
|
||||||
I was wrong.
|
|
||||||
|
|
||||||
- Validate function arguments better in a few functions. Most
|
|
||||||
importantly, specifying an unsupported integrity check to
|
|
||||||
lzma_stream_buffer_encode() no longer creates a corrupt .xz
|
|
||||||
file. Probably no application tries to do that, so this
|
|
||||||
shouldn't be a big problem in practice.
|
|
||||||
|
|
||||||
- Document that lzma_block_buffer_encode(),
|
|
||||||
lzma_easy_buffer_encode(), lzma_stream_encoder(), and
|
|
||||||
lzma_stream_buffer_encode() may return LZMA_UNSUPPORTED_CHECK.
|
|
||||||
|
|
||||||
- The return values of the _memusage() functions are now
|
|
||||||
documented better.
|
|
||||||
|
|
||||||
* Fix command name detection in xzgrep. xzegrep and xzfgrep now
|
|
||||||
correctly use egrep and fgrep instead of grep.
|
|
||||||
|
|
||||||
* French translation was added.
|
|
||||||
|
|
||||||
|
|
||||||
5.0.2 (2011-04-01)
|
|
||||||
|
|
||||||
* LZMA2 decompressor now correctly accepts LZMA2 streams with no
|
|
||||||
uncompressed data. Previously it considered them corrupt. The
|
|
||||||
bug can affect applications that use raw LZMA2 streams. It is
|
|
||||||
very unlikely to affect .xz files because no compressor creates
|
|
||||||
.xz files with empty LZMA2 streams. (Empty .xz files are a
|
|
||||||
different thing than empty LZMA2 streams.)
|
|
||||||
|
|
||||||
* "xz --suffix=.foo filename.foo" now refuses to compress the
|
|
||||||
file due to it already having the suffix .foo. It was already
|
|
||||||
documented on the man page, but the code lacked the test.
|
|
||||||
|
|
||||||
* "xzgrep -l foo bar.xz" works now.
|
|
||||||
|
|
||||||
* Polish translation was added.
|
|
||||||
|
|
||||||
|
|
||||||
5.0.1 (2011-01-29)
|
|
||||||
|
|
||||||
* xz --force now (de)compresses files that have setuid, setgid,
|
|
||||||
or sticky bit set and files that have multiple hard links.
|
|
||||||
The man page had it documented this way already, but the code
|
|
||||||
had a bug.
|
|
||||||
|
|
||||||
* gzip and bzip2 support in xzdiff was fixed.
|
|
||||||
|
|
||||||
* Portability fixes
|
|
||||||
|
|
||||||
* Minor fix to Czech translation
|
|
||||||
|
|
||||||
|
|
||||||
5.0.0 (2010-10-23)
|
|
||||||
|
|
||||||
Only the most important changes compared to 4.999.9beta are listed
|
|
||||||
here. One change is especially important:
|
|
||||||
|
|
||||||
* The memory usage limit is now disabled by default. Some scripts
|
|
||||||
written before this change may have used --memory=max on xz command
|
|
||||||
line or in XZ_OPT. THESE USES OF --memory=max SHOULD BE REMOVED
|
|
||||||
NOW, because they interfere with user's ability to set the memory
|
|
||||||
usage limit himself. If user-specified limit causes problems to
|
|
||||||
your script, blame the user.
|
|
||||||
|
|
||||||
Other significant changes:
|
|
||||||
|
|
||||||
* Added support for XZ_DEFAULTS environment variable. This variable
|
|
||||||
allows users to set default options for xz, e.g. default memory
|
|
||||||
usage limit or default compression level. Scripts that use xz
|
|
||||||
must never set or unset XZ_DEFAULTS. Scripts should use XZ_OPT
|
|
||||||
instead if they need a way to pass options to xz via an
|
|
||||||
environment variable.
|
|
||||||
|
|
||||||
* The compression settings associated with the preset levels
|
|
||||||
-0 ... -9 have been changed. --extreme was changed a little too.
|
|
||||||
It is now less likely to make compression worse, but with some
|
|
||||||
files the new --extreme may compress slightly worse than the old
|
|
||||||
--extreme.
|
|
||||||
|
|
||||||
* If a preset level (-0 ... -9) is specified after a custom filter
|
|
||||||
chain options have been used (e.g. --lzma2), the custom filter
|
|
||||||
chain will be forgotten. Earlier the preset options were
|
|
||||||
completely ignored after custom filter chain options had been
|
|
||||||
seen.
|
|
||||||
|
|
||||||
* xz will create sparse files when decompressing if the uncompressed
|
|
||||||
data contains long sequences of binary zeros. This is done even
|
|
||||||
when writing to standard output that is connected to a regular
|
|
||||||
file and certain additional conditions are met to make it safe.
|
|
||||||
|
|
||||||
* Support for "xz --list" was added. Combine with --verbose or
|
|
||||||
--verbose --verbose (-vv) for detailed output.
|
|
||||||
|
|
||||||
* I had hoped that liblzma API would have been stable after
|
|
||||||
4.999.9beta, but there have been a couple of changes in the
|
|
||||||
advanced features, which don't affect most applications:
|
|
||||||
|
|
||||||
- Index handling code was revised. If you were using the old
|
|
||||||
API, you will get a compiler error (so it's easy to notice).
|
|
||||||
|
|
||||||
- A subtle but important change was made to the Block handling
|
|
||||||
API. lzma_block.version has to be initialized even for
|
|
||||||
lzma_block_header_decode(). Code that doesn't do it will work
|
|
||||||
for now, but might break in the future, which makes this API
|
|
||||||
change easy to miss.
|
|
||||||
|
|
||||||
* The major soname has been bumped to 5.0.0. liblzma API and ABI
|
|
||||||
are now stable, so the need to recompile programs linking against
|
|
||||||
liblzma shouldn't arise soon.
|
|
||||||
|
|
||||||
231
PACKAGERS
231
PACKAGERS
@@ -1,231 +0,0 @@
|
|||||||
|
|
||||||
Information to packagers of XZ Utils
|
|
||||||
====================================
|
|
||||||
|
|
||||||
0. Preface
|
|
||||||
1. Package naming
|
|
||||||
2. Package description
|
|
||||||
3. License
|
|
||||||
4. configure options
|
|
||||||
5. Additional documentation
|
|
||||||
6. Extra files
|
|
||||||
7. Installing XZ Utils and LZMA Utils in parallel
|
|
||||||
8. Example
|
|
||||||
|
|
||||||
|
|
||||||
0. Preface
|
|
||||||
----------
|
|
||||||
|
|
||||||
This document is meant for people who create and maintain XZ Utils
|
|
||||||
packages for operating system distributions. The focus is on GNU/Linux
|
|
||||||
systems, but most things apply to other systems too.
|
|
||||||
|
|
||||||
While the standard "configure && make DESTDIR=$PKG install" should
|
|
||||||
give a pretty good package, there are some details which packagers
|
|
||||||
may want to tweak.
|
|
||||||
|
|
||||||
Packagers should also read the INSTALL file.
|
|
||||||
|
|
||||||
|
|
||||||
1. Package naming
|
|
||||||
-----------------
|
|
||||||
|
|
||||||
The preferred name for the XZ Utils package is "xz", because that's
|
|
||||||
the name of the upstream tarball. Naturally you may have good reasons
|
|
||||||
to use some other name; I won't get angry about it. ;-) It's just nice
|
|
||||||
to be able to point people to the correct package name without asking
|
|
||||||
what distro they have.
|
|
||||||
|
|
||||||
If your distro policy is to split things into small pieces, here is
|
|
||||||
one suggestion:
|
|
||||||
|
|
||||||
xz xz, xzdec, scripts (xzdiff, xzgrep, etc.), docs
|
|
||||||
xz-lzma lzma, unlzma, lzcat, lzgrep etc. symlinks and
|
|
||||||
lzmadec binary for compatibility with LZMA Utils
|
|
||||||
liblzma liblzma.so.*
|
|
||||||
liblzma-devel liblzma.so, liblzma.a, API headers
|
|
||||||
|
|
||||||
|
|
||||||
2. Package description
|
|
||||||
----------------------
|
|
||||||
|
|
||||||
Here is a suggestion which you may use as the package description.
|
|
||||||
If you can use only one-line description, pick only the first line.
|
|
||||||
Naturally, feel free to use some other description if you find it
|
|
||||||
better, and maybe send it to me too.
|
|
||||||
|
|
||||||
Library and command line tools for XZ and LZMA compressed files
|
|
||||||
|
|
||||||
XZ Utils provide a general purpose data compression library
|
|
||||||
and command line tools. The native file format is the .xz
|
|
||||||
format, but also the legacy .lzma format is supported. The .xz
|
|
||||||
format supports multiple compression algorithms, of which LZMA2
|
|
||||||
is currently the primary algorithm. With typical files, XZ Utils
|
|
||||||
create about 30 % smaller files than gzip.
|
|
||||||
|
|
||||||
If you are splitting XZ Utils into multiple packages, here are some
|
|
||||||
suggestions for package descriptions:
|
|
||||||
|
|
||||||
xz:
|
|
||||||
|
|
||||||
Command line tools for XZ and LZMA compressed files
|
|
||||||
|
|
||||||
This package includes the xz compression tool and other command
|
|
||||||
line tools from XZ Utils. xz has command line syntax similar to
|
|
||||||
that of gzip. The native file format is the .xz format, but also
|
|
||||||
the legacy .lzma format is supported. The .xz format supports
|
|
||||||
multiple compression algorithms, of which LZMA2 is currently the
|
|
||||||
primary algorithm. With typical files, XZ Utils create about 30 %
|
|
||||||
smaller files than gzip.
|
|
||||||
|
|
||||||
Note that this package doesn't include the files needed for
|
|
||||||
LZMA Utils 4.32.x compatibility. Install also the xz-lzma
|
|
||||||
package to make XZ Utils emulate LZMA Utils 4.32.x.
|
|
||||||
|
|
||||||
xz-lzma:
|
|
||||||
|
|
||||||
LZMA Utils emulation with XZ Utils
|
|
||||||
|
|
||||||
This package includes executables and symlinks to make
|
|
||||||
XZ Utils emulate lzma, unlzma, lzcat, and other command
|
|
||||||
line tools found from the legacy LZMA Utils 4.32.x package.
|
|
||||||
|
|
||||||
liblzma:
|
|
||||||
|
|
||||||
Library for XZ and LZMA compressed files
|
|
||||||
|
|
||||||
liblzma is a general purpose data compression library with
|
|
||||||
an API similar to that of zlib. liblzma supports multiple
|
|
||||||
algorithms, of which LZMA2 is currently the primary algorithm.
|
|
||||||
The native file format is .xz, but also the legacy .lzma
|
|
||||||
format and raw streams (no headers at all) are supported.
|
|
||||||
|
|
||||||
This package includes the shared library.
|
|
||||||
|
|
||||||
liblzma-devel:
|
|
||||||
|
|
||||||
Library for XZ and LZMA compressed files
|
|
||||||
|
|
||||||
This package includes the API headers, static library, and
|
|
||||||
other development files related to liblzma.
|
|
||||||
|
|
||||||
|
|
||||||
3. License
|
|
||||||
----------
|
|
||||||
|
|
||||||
If the package manager supports a license field, you probably should
|
|
||||||
put GPLv2+ there (GNU GPL v2 or later). The interesting parts of
|
|
||||||
XZ Utils are in the public domain, but some less important files
|
|
||||||
ending up into the binary package are under GPLv2+. So it is simplest
|
|
||||||
to just say GPLv2+ if you cannot specify "public domain and GPLv2+".
|
|
||||||
|
|
||||||
If you split XZ Utils into multiple packages as described earlier
|
|
||||||
in this file, liblzma and liblzma-dev packages will contain only
|
|
||||||
public domain code (from XZ Utils at least; compiler or linker may
|
|
||||||
add some third-party code, which may be copyrighted).
|
|
||||||
|
|
||||||
|
|
||||||
4. configure options
|
|
||||||
--------------------
|
|
||||||
|
|
||||||
Unless you are building a package for a distribution that is meant
|
|
||||||
only for embedded systems, don't use the following configure options:
|
|
||||||
|
|
||||||
--enable-debug
|
|
||||||
--enable-encoders (*)
|
|
||||||
--enable-decoders
|
|
||||||
--enable-match-finders
|
|
||||||
--enable-checks
|
|
||||||
--enable-small (*)
|
|
||||||
--disable-threads (*)
|
|
||||||
|
|
||||||
(*) These are OK when building xzdec and lzmadec as described
|
|
||||||
in INSTALL.
|
|
||||||
|
|
||||||
xzdec and lzmadec don't provide any functionality that isn't already
|
|
||||||
available in the xz tool. Shipping xzdec and lzmadec without size
|
|
||||||
optimization and statically-linked liblzma isn't very useful. Doing
|
|
||||||
that would give users the xzdec man page, which may make it easier
|
|
||||||
for people to find out that such tools exists, but the executables
|
|
||||||
wouldn't have any advantage over the full-featured xz.
|
|
||||||
|
|
||||||
|
|
||||||
5. Additional documentation
|
|
||||||
---------------------------
|
|
||||||
|
|
||||||
"make install" copies some additional documentation to $docdir
|
|
||||||
(--docdir in configure). There is a copy of the GNU GPL v2, which
|
|
||||||
can be replaced with a symlink if your distro ships with shared
|
|
||||||
copies of the common license texts.
|
|
||||||
|
|
||||||
liblzma API is currently only documented using Doxygen tags in the
|
|
||||||
API headers. It hasn't been tested much how good results Doxygen
|
|
||||||
is able to make from the tags (e.g. Doxyfile might need tweaking,
|
|
||||||
the tagging may need to be improved etc.), so it might be simpler
|
|
||||||
to just let people read docs directly from the .h files for now,
|
|
||||||
and also save quite a bit in package size at the same time.
|
|
||||||
|
|
||||||
|
|
||||||
6. Extra files
|
|
||||||
--------------
|
|
||||||
|
|
||||||
The "extra" directory contains some small extra tools or other files.
|
|
||||||
The exact set of extra files can vary between XZ Utils releases. The
|
|
||||||
extra files have only limited use or they are too dangerous to be
|
|
||||||
put directly to $bindir (7z2lzma.sh is a good example, since it can
|
|
||||||
silently create corrupt output if certain conditions are not met).
|
|
||||||
|
|
||||||
If you feel like it, you may copy the extra directory under the doc
|
|
||||||
directory (e.g. /usr/share/doc/xz/extra). Maybe some people will find
|
|
||||||
them useful. However, most people needing these tools probably are
|
|
||||||
able to find them from the source package too.
|
|
||||||
|
|
||||||
The "debug" directory contains some tools that are useful only when
|
|
||||||
hacking on XZ Utils. Don't package these tools.
|
|
||||||
|
|
||||||
|
|
||||||
7. Installing XZ Utils and LZMA Utils in parallel
|
|
||||||
-------------------------------------------------
|
|
||||||
|
|
||||||
XZ Utils and LZMA Utils 4.32.x can be installed in parallel by
|
|
||||||
omitting the compatibility symlinks (lzma, unlzma, lzcat, lzgrep etc.)
|
|
||||||
from the XZ Utils package. It's probably a good idea to still package
|
|
||||||
the symlinks into a separate package so that users may choose if they
|
|
||||||
want to use XZ Utils or LZMA Utils for handling .lzma files.
|
|
||||||
|
|
||||||
|
|
||||||
8. Example
|
|
||||||
----------
|
|
||||||
|
|
||||||
Here is an example for i686 GNU/Linux that
|
|
||||||
- links xz and lzmainfo against shared liblzma;
|
|
||||||
- links size-optimized xzdec and lzmadec against static liblzma
|
|
||||||
while avoiding libpthread dependency;
|
|
||||||
- includes only shared liblzma in the final package; and
|
|
||||||
- copies also the "extra" directory to the package.
|
|
||||||
|
|
||||||
PKG=/tmp/xz-pkg
|
|
||||||
tar xf xz-x.y.z.tar.gz
|
|
||||||
cd xz-x.y.z
|
|
||||||
./configure \
|
|
||||||
--prefix=/usr \
|
|
||||||
--disable-static \
|
|
||||||
--disable-xzdec \
|
|
||||||
--disable-lzmadec \
|
|
||||||
CFLAGS='-march=i686 -mtune=generic -O2'
|
|
||||||
make
|
|
||||||
make DESTDIR=$PKG install-strip
|
|
||||||
make clean
|
|
||||||
./configure \
|
|
||||||
--prefix=/usr \
|
|
||||||
--disable-shared \
|
|
||||||
--disable-nls \
|
|
||||||
--disable-encoders \
|
|
||||||
--enable-small \
|
|
||||||
--disable-threads \
|
|
||||||
CFLAGS='-march=i686 -mtune=generic -Os'
|
|
||||||
make -C src/liblzma
|
|
||||||
make -C src/xzdec
|
|
||||||
make -C src/xzdec DESTDIR=$PKG install-strip
|
|
||||||
cp -a extra $PKG/usr/share/doc/xz
|
|
||||||
|
|
||||||
357
README
357
README
@@ -1,308 +1,115 @@
|
|||||||
|
ZLIB DATA COMPRESSION LIBRARY
|
||||||
|
|
||||||
XZ Utils
|
zlib 1.2.11 is a general purpose data compression library. All the code is
|
||||||
========
|
thread safe. The data format used by the zlib library is described by RFCs
|
||||||
|
(Request for Comments) 1950 to 1952 in the files
|
||||||
0. Overview
|
http://tools.ietf.org/html/rfc1950 (zlib format), rfc1951 (deflate format) and
|
||||||
1. Documentation
|
rfc1952 (gzip format).
|
||||||
1.1. Overall documentation
|
|
||||||
1.2. Documentation for command-line tools
|
|
||||||
1.3. Documentation for liblzma
|
|
||||||
2. Version numbering
|
|
||||||
3. Reporting bugs
|
|
||||||
4. Translating the xz tool
|
|
||||||
5. Other implementations of the .xz format
|
|
||||||
6. Contact information
|
|
||||||
|
|
||||||
|
All functions of the compression library are documented in the file zlib.h
|
||||||
|
(volunteer to write man pages welcome, contact zlib@gzip.org). A usage example
|
||||||
|
of the library is given in the file test/example.c which also tests that
|
||||||
|
the library is working correctly. Another example is given in the file
|
||||||
|
test/minigzip.c. The compression library itself is composed of all source
|
||||||
|
files in the root directory.
|
||||||
|
|
||||||
0. Overview
|
To compile all files and run the test program, follow the instructions given at
|
||||||
-----------
|
the top of Makefile.in. In short "./configure; make test", and if that goes
|
||||||
|
well, "make install" should work for most flavors of Unix. For Windows, use
|
||||||
XZ Utils provide a general-purpose data-compression library plus
|
one of the special makefiles in win32/ or contrib/vstudio/ . For VMS, use
|
||||||
command-line tools. The native file format is the .xz format, but
|
make_vms.com.
|
||||||
also the legacy .lzma format is supported. The .xz format supports
|
|
||||||
multiple compression algorithms, which are called "filters" in the
|
|
||||||
context of XZ Utils. The primary filter is currently LZMA2. With
|
|
||||||
typical files, XZ Utils create about 30 % smaller files than gzip.
|
|
||||||
|
|
||||||
To ease adapting support for the .xz format into existing applications
|
Questions about zlib should be sent to <zlib@gzip.org>, or to Gilles Vollant
|
||||||
and scripts, the API of liblzma is somewhat similar to the API of the
|
<info@winimage.com> for the Windows DLL version. The zlib home page is
|
||||||
popular zlib library. For the same reason, the command-line tool xz
|
http://zlib.net/ . Before reporting a problem, please check this site to
|
||||||
has a command-line syntax similar to that of gzip.
|
verify that you have the latest version of zlib; otherwise get the latest
|
||||||
|
version and check whether the problem still exists or not.
|
||||||
|
|
||||||
When aiming for the highest compression ratio, the LZMA2 encoder uses
|
PLEASE read the zlib FAQ http://zlib.net/zlib_faq.html before asking for help.
|
||||||
a lot of CPU time and may use, depending on the settings, even
|
|
||||||
hundreds of megabytes of RAM. However, in fast modes, the LZMA2 encoder
|
|
||||||
competes with bzip2 in compression speed, RAM usage, and compression
|
|
||||||
ratio.
|
|
||||||
|
|
||||||
LZMA2 is reasonably fast to decompress. It is a little slower than
|
Mark Nelson <markn@ieee.org> wrote an article about zlib for the Jan. 1997
|
||||||
gzip, but a lot faster than bzip2. Being fast to decompress means
|
issue of Dr. Dobb's Journal; a copy of the article is available at
|
||||||
that the .xz format is especially nice when the same file will be
|
http://marknelson.us/1997/01/01/zlib-engine/ .
|
||||||
decompressed very many times (usually on different computers), which
|
|
||||||
is the case e.g. when distributing software packages. In such
|
|
||||||
situations, it's not too bad if the compression takes some time,
|
|
||||||
since that needs to be done only once to benefit many people.
|
|
||||||
|
|
||||||
With some file types, combining (or "chaining") LZMA2 with an
|
The changes made in version 1.2.11 are documented in the file ChangeLog.
|
||||||
additional filter can improve the compression ratio. A filter chain may
|
|
||||||
contain up to four filters, although usually only one or two are used.
|
|
||||||
For example, putting a BCJ (Branch/Call/Jump) filter before LZMA2
|
|
||||||
in the filter chain can improve compression ratio of executable files.
|
|
||||||
|
|
||||||
Since the .xz format allows adding new filter IDs, it is possible that
|
Unsupported third party contributions are provided in directory contrib/ .
|
||||||
some day there will be a filter that is, for example, much faster to
|
|
||||||
compress than LZMA2 (but probably with worse compression ratio).
|
|
||||||
Similarly, it is possible that some day there is a filter that will
|
|
||||||
compress better than LZMA2.
|
|
||||||
|
|
||||||
XZ Utils doesn't support multithreaded compression or decompression
|
zlib is available in Java using the java.util.zip package, documented at
|
||||||
yet. It has been planned though and taken into account when designing
|
http://java.sun.com/developer/technicalArticles/Programming/compression/ .
|
||||||
the .xz file format.
|
|
||||||
|
|
||||||
|
A Perl interface to zlib written by Paul Marquess <pmqs@cpan.org> is available
|
||||||
|
at CPAN (Comprehensive Perl Archive Network) sites, including
|
||||||
|
http://search.cpan.org/~pmqs/IO-Compress-Zlib/ .
|
||||||
|
|
||||||
1. Documentation
|
A Python interface to zlib written by A.M. Kuchling <amk@amk.ca> is
|
||||||
----------------
|
available in Python 1.5 and later versions, see
|
||||||
|
http://docs.python.org/library/zlib.html .
|
||||||
|
|
||||||
1.1. Overall documentation
|
zlib is built into tcl: http://wiki.tcl.tk/4610 .
|
||||||
|
|
||||||
README This file
|
An experimental package to read and write files in .zip format, written on top
|
||||||
|
of zlib by Gilles Vollant <info@winimage.com>, is available in the
|
||||||
|
contrib/minizip directory of zlib.
|
||||||
|
|
||||||
INSTALL.generic Generic install instructions for those not familiar
|
|
||||||
with packages using GNU Autotools
|
|
||||||
INSTALL Installation instructions specific to XZ Utils
|
|
||||||
PACKAGERS Information to packagers of XZ Utils
|
|
||||||
|
|
||||||
COPYING XZ Utils copyright and license information
|
Notes for some targets:
|
||||||
COPYING.GPLv2 GNU General Public License version 2
|
|
||||||
COPYING.GPLv3 GNU General Public License version 3
|
|
||||||
COPYING.LGPLv2.1 GNU Lesser General Public License version 2.1
|
|
||||||
|
|
||||||
AUTHORS The main authors of XZ Utils
|
- For Windows DLL versions, please see win32/DLL_FAQ.txt
|
||||||
THANKS Incomplete list of people who have helped making
|
|
||||||
this software
|
|
||||||
NEWS User-visible changes between XZ Utils releases
|
|
||||||
ChangeLog Detailed list of changes (commit log)
|
|
||||||
TODO Known bugs and some sort of to-do list
|
|
||||||
|
|
||||||
Note that only some of the above files are included in binary
|
- For 64-bit Irix, deflate.c must be compiled without any optimization. With
|
||||||
packages.
|
-O, one libpng test fails. The test works in 32 bit mode (with the -n32
|
||||||
|
compiler flag). The compiler bug has been reported to SGI.
|
||||||
|
|
||||||
1.2. Documentation for command-line tools
|
|
||||||
|
|
||||||
The command-line tools are documented as man pages. In source code
|
|
||||||
releases (and possibly also in some binary packages), the man pages
|
|
||||||
are also provided in plain text (ASCII only) and PDF formats in the
|
|
||||||
directory "doc/man" to make the man pages more accessible to those
|
|
||||||
whose operating system doesn't provide an easy way to view man pages.
|
|
||||||
|
|
||||||
|
- zlib doesn't work with gcc 2.6.3 on a DEC 3000/300LX under OSF/1 2.1 it works
|
||||||
|
when compiled with cc.
|
||||||
|
|
||||||
1.3. Documentation for liblzma
|
- On Digital Unix 4.0D (formely OSF/1) on AlphaServer, the cc option -std1 is
|
||||||
|
necessary to get gzprintf working correctly. This is done by configure.
|
||||||
|
|
||||||
The liblzma API headers include short docs about each function
|
- zlib doesn't work on HP-UX 9.05 with some versions of /bin/cc. It works with
|
||||||
and data type as Doxygen tags. These docs should be quite OK as
|
other compilers. Use "make test" to check your compiler.
|
||||||
a quick reference.
|
|
||||||
|
|
||||||
I have planned to write a bunch of very well documented example
|
|
||||||
programs, which (due to comments) should work as a tutorial to
|
|
||||||
various features of liblzma. No such example programs have been
|
|
||||||
written yet.
|
|
||||||
|
|
||||||
For now, if you have never used liblzma, libbzip2, or zlib, I
|
- gzdopen is not supported on RISCOS or BEOS.
|
||||||
recommend learning the *basics* of the zlib API. Once you know that,
|
|
||||||
it should be easier to learn liblzma.
|
|
||||||
|
|
||||||
http://zlib.net/manual.html
|
- For PalmOs, see http://palmzlib.sourceforge.net/
|
||||||
http://zlib.net/zlib_how.html
|
|
||||||
|
|
||||||
|
|
||||||
2. Version numbering
|
Acknowledgments:
|
||||||
--------------------
|
|
||||||
|
|
||||||
The version number format of XZ Utils is X.Y.ZS:
|
The deflate format used by zlib was defined by Phil Katz. The deflate and
|
||||||
|
zlib specifications were written by L. Peter Deutsch. Thanks to all the
|
||||||
|
people who reported problems and suggested various improvements in zlib; they
|
||||||
|
are too numerous to cite here.
|
||||||
|
|
||||||
- X is the major version. When this is incremented, the library
|
Copyright notice:
|
||||||
API and ABI break.
|
|
||||||
|
|
||||||
- Y is the minor version. It is incremented when new features
|
(C) 1995-2017 Jean-loup Gailly and Mark Adler
|
||||||
are added without breaking the existing API or ABI. An even Y
|
|
||||||
indicates a stable release and an odd Y indicates unstable
|
|
||||||
(alpha or beta version).
|
|
||||||
|
|
||||||
- Z is the revision. This has a different meaning for stable and
|
This software is provided 'as-is', without any express or implied
|
||||||
unstable releases:
|
warranty. In no event will the authors be held liable for any damages
|
||||||
|
arising from the use of this software.
|
||||||
|
|
||||||
* Stable: Z is incremented when bugs get fixed without adding
|
Permission is granted to anyone to use this software for any purpose,
|
||||||
any new features. This is intended to be convenient for
|
including commercial applications, and to alter it and redistribute it
|
||||||
downstream distributors that want bug fixes but don't want
|
freely, subject to the following restrictions:
|
||||||
any new features to minimize the risk of introducing new bugs.
|
|
||||||
|
|
||||||
* Unstable: Z is just a counter. API or ABI of features added
|
1. The origin of this software must not be misrepresented; you must not
|
||||||
in earlier unstable releases having the same X.Y may break.
|
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.
|
||||||
|
|
||||||
- S indicates stability of the release. It is missing from the
|
Jean-loup Gailly Mark Adler
|
||||||
stable releases, where Y is an even number. When Y is odd, S
|
jloup@gzip.org madler@alumni.caltech.edu
|
||||||
is either "alpha" or "beta" to make it very clear that such
|
|
||||||
versions are not stable releases. The same X.Y.Z combination is
|
|
||||||
not used for more than one stability level, i.e. after X.Y.Zalpha,
|
|
||||||
the next version can be X.Y.(Z+1)beta but not X.Y.Zbeta.
|
|
||||||
|
|
||||||
|
If you use the zlib library in a product, we would appreciate *not* receiving
|
||||||
|
lengthy legal documents to sign. The sources are provided for free but without
|
||||||
|
warranty of any kind. The library has been entirely written by Jean-loup
|
||||||
|
Gailly and Mark Adler; it does not include third-party code.
|
||||||
|
|
||||||
3. Reporting bugs
|
If you redistribute modified sources, we would appreciate that you include in
|
||||||
-----------------
|
the file ChangeLog history information documenting your changes. Please read
|
||||||
|
the FAQ for more information on the distribution of modified source versions.
|
||||||
Naturally it is easiest for me if you already know what causes the
|
|
||||||
unexpected behavior. Even better if you have a patch to propose.
|
|
||||||
However, quite often the reason for unexpected behavior is unknown,
|
|
||||||
so here are a few things to do before sending a bug report:
|
|
||||||
|
|
||||||
1. Try to create a small example how to reproduce the issue.
|
|
||||||
|
|
||||||
2. Compile XZ Utils with debugging code using configure switches
|
|
||||||
--enable-debug and, if possible, --disable-shared. If you are
|
|
||||||
using GCC, use CFLAGS='-O0 -ggdb3'. Don't strip the resulting
|
|
||||||
binaries.
|
|
||||||
|
|
||||||
3. Turn on core dumps. The exact command depends on your shell;
|
|
||||||
for example in GNU bash it is done with "ulimit -c unlimited",
|
|
||||||
and in tcsh with "limit coredumpsize unlimited".
|
|
||||||
|
|
||||||
4. Try to reproduce the suspected bug. If you get "assertion failed"
|
|
||||||
message, be sure to include the complete message in your bug
|
|
||||||
report. If the application leaves a coredump, get a backtrace
|
|
||||||
using gdb:
|
|
||||||
$ gdb /path/to/app-binary # Load the app to the debugger.
|
|
||||||
(gdb) core core # Open the coredump.
|
|
||||||
(gdb) bt # Print the backtrace. Copy & paste to bug report.
|
|
||||||
(gdb) quit # Quit gdb.
|
|
||||||
|
|
||||||
Report your bug via email or IRC (see Contact information below).
|
|
||||||
Don't send core dump files or any executables. If you have a small
|
|
||||||
example file(s) (total size less than 256 KiB), please include
|
|
||||||
it/them as an attachment. If you have bigger test files, put them
|
|
||||||
online somewhere and include a URL to the file(s) in the bug report.
|
|
||||||
|
|
||||||
Always include the exact version number of XZ Utils in the bug report.
|
|
||||||
If you are using a snapshot from the git repository, use "git describe"
|
|
||||||
to get the exact snapshot version. If you are using XZ Utils shipped
|
|
||||||
in an operating system distribution, mention the distribution name,
|
|
||||||
distribution version, and exact xz package version; if you cannot
|
|
||||||
repeat the bug with the code compiled from unpatched source code,
|
|
||||||
you probably need to report a bug to your distribution's bug tracking
|
|
||||||
system.
|
|
||||||
|
|
||||||
|
|
||||||
4. Translating the xz tool
|
|
||||||
--------------------------
|
|
||||||
|
|
||||||
The messages from the xz tool have been translated into a few
|
|
||||||
languages. Before starting to translate into a new language, ask
|
|
||||||
the author whether someone else hasn't already started working on it.
|
|
||||||
|
|
||||||
Test your translation. Testing includes comparing the translated
|
|
||||||
output to the original English version by running the same commands
|
|
||||||
in both your target locale and with LC_ALL=C. Ask someone to
|
|
||||||
proof-read and test the translation.
|
|
||||||
|
|
||||||
Testing can be done e.g. by installing xz into a temporary directory:
|
|
||||||
|
|
||||||
./configure --disable-shared --prefix=/tmp/xz-test
|
|
||||||
# <Edit the .po file in the po directory.>
|
|
||||||
make -C po update-po
|
|
||||||
make install
|
|
||||||
bash debug/translation.bash | less
|
|
||||||
bash debug/translation.bash | less -S # For --list outputs
|
|
||||||
|
|
||||||
Repeat the above as needed (no need to re-run configure though).
|
|
||||||
|
|
||||||
Note especially the following:
|
|
||||||
|
|
||||||
- The output of --help and --long-help must look nice on
|
|
||||||
an 80-column terminal. It's OK to add extra lines if needed.
|
|
||||||
|
|
||||||
- In contrast, don't add extra lines to error messages and such.
|
|
||||||
They are often preceded with e.g. a filename on the same line,
|
|
||||||
so you have no way to predict where to put a \n. Let the terminal
|
|
||||||
do the wrapping even if it looks ugly. Adding new lines will be
|
|
||||||
even uglier in the generic case even if it looks nice in a few
|
|
||||||
limited examples.
|
|
||||||
|
|
||||||
- Be careful with column alignment in tables and table-like output
|
|
||||||
(--list, --list --verbose --verbose, --info-memory, --help, and
|
|
||||||
--long-help):
|
|
||||||
|
|
||||||
* All descriptions of options in --help should start in the
|
|
||||||
same column (but it doesn't need to be the same column as
|
|
||||||
in the English messages; just be consistent if you change it).
|
|
||||||
Check that both --help and --long-help look OK, since they
|
|
||||||
share several strings.
|
|
||||||
|
|
||||||
* --list --verbose and --info-memory print lines that have
|
|
||||||
the format "Description: %s". If you need a longer
|
|
||||||
description, you can put extra space between the colon
|
|
||||||
and %s. Then you may need to add extra space to other
|
|
||||||
strings too so that the result as a whole looks good (all
|
|
||||||
values start at the same column).
|
|
||||||
|
|
||||||
* The columns of the actual tables in --list --verbose --verbose
|
|
||||||
should be aligned properly. Abbreviate if necessary. It might
|
|
||||||
be good to keep at least 2 or 3 spaces between column headings
|
|
||||||
and avoid spaces in the headings so that the columns stand out
|
|
||||||
better, but this is a matter of opinion. Do what you think
|
|
||||||
looks best.
|
|
||||||
|
|
||||||
- Be careful to put a period at the end of a sentence when the
|
|
||||||
original version has it, and don't put it when the original
|
|
||||||
doesn't have it. Similarly, be careful with \n characters
|
|
||||||
at the beginning and end of the strings.
|
|
||||||
|
|
||||||
- Read the TRANSLATORS comments that have been extracted from the
|
|
||||||
source code and included in xz.pot. If they suggest testing the
|
|
||||||
translation with some type of command, do it. If testing needs
|
|
||||||
input files, use e.g. tests/files/good-*.xz.
|
|
||||||
|
|
||||||
- When updating the translation, read the fuzzy (modified) strings
|
|
||||||
carefully, and don't mark them as updated before you actually
|
|
||||||
have updated them. Reading through the unchanged messages can be
|
|
||||||
good too; sometimes you may find a better wording for them.
|
|
||||||
|
|
||||||
- If you find language problems in the original English strings,
|
|
||||||
feel free to suggest improvements. Ask if something is unclear.
|
|
||||||
|
|
||||||
- The translated messages should be understandable (sometimes this
|
|
||||||
may be a problem with the original English messages too). Don't
|
|
||||||
make a direct word-by-word translation from English especially if
|
|
||||||
the result doesn't sound good in your language.
|
|
||||||
|
|
||||||
In short, take your time and pay attention to the details. Making
|
|
||||||
a good translation is not a quick and trivial thing to do. The
|
|
||||||
translated xz should look as polished as the English version.
|
|
||||||
|
|
||||||
|
|
||||||
5. Other implementations of the .xz format
|
|
||||||
------------------------------------------
|
|
||||||
|
|
||||||
7-Zip and the p7zip port of 7-Zip support the .xz format starting
|
|
||||||
from the version 9.00alpha.
|
|
||||||
|
|
||||||
http://7-zip.org/
|
|
||||||
http://p7zip.sourceforge.net/
|
|
||||||
|
|
||||||
XZ Embedded is a limited implementation written for use in the Linux
|
|
||||||
kernel, but it is also suitable for other embedded use.
|
|
||||||
|
|
||||||
http://tukaani.org/xz/embedded.html
|
|
||||||
|
|
||||||
|
|
||||||
6. Contact information
|
|
||||||
----------------------
|
|
||||||
|
|
||||||
If you have questions, bug reports, patches etc. related to XZ Utils,
|
|
||||||
contact Lasse Collin <lasse.collin@tukaani.org> (in Finnish or English).
|
|
||||||
I'm sometimes slow at replying. If you haven't got a reply within two
|
|
||||||
weeks, assume that your email has got lost and resend it or use IRC.
|
|
||||||
|
|
||||||
You can find me also from #tukaani on Freenode; my nick is Larhzu.
|
|
||||||
The channel tends to be pretty quiet, so just ask your question and
|
|
||||||
someone may wake up.
|
|
||||||
|
|
||||||
|
|||||||
@@ -1,2 +0,0 @@
|
|||||||
# cpython-source-deps
|
|
||||||
Source for packages that the cpython build process depends on
|
|
||||||
116
THANKS
116
THANKS
@@ -1,116 +0,0 @@
|
|||||||
|
|
||||||
Thanks
|
|
||||||
======
|
|
||||||
|
|
||||||
Some people have helped more, some less, but nevertheless everyone's help
|
|
||||||
has been important. :-) In alphabetical order:
|
|
||||||
- Mark Adler
|
|
||||||
- H. Peter Anvin
|
|
||||||
- Jeff Bastian
|
|
||||||
- Nelson H. F. Beebe
|
|
||||||
- Karl Berry
|
|
||||||
- Anders F. Björklund
|
|
||||||
- Emmanuel Blot
|
|
||||||
- Martin Blumenstingl
|
|
||||||
- Jakub Bogusz
|
|
||||||
- Maarten Bosmans
|
|
||||||
- Trent W. Buck
|
|
||||||
- James Buren
|
|
||||||
- David Burklund
|
|
||||||
- Daniel Mealha Cabrita
|
|
||||||
- Milo Casagrande
|
|
||||||
- Marek Černocký
|
|
||||||
- Tomer Chachamu
|
|
||||||
- Gabi Davar
|
|
||||||
- Chris Donawa
|
|
||||||
- Andrew Dudman
|
|
||||||
- Markus Duft
|
|
||||||
- İsmail Dönmez
|
|
||||||
- Robert Elz
|
|
||||||
- Gilles Espinasse
|
|
||||||
- Denis Excoffier
|
|
||||||
- Michael Felt
|
|
||||||
- Michael Fox
|
|
||||||
- Mike Frysinger
|
|
||||||
- Daniel Richard G.
|
|
||||||
- Bill Glessner
|
|
||||||
- Jason Gorski
|
|
||||||
- Juan Manuel Guerrero
|
|
||||||
- Diederik de Haas
|
|
||||||
- Joachim Henke
|
|
||||||
- Christian Hesse
|
|
||||||
- Vincenzo Innocente
|
|
||||||
- Peter Ivanov
|
|
||||||
- Jouk Jansen
|
|
||||||
- Jun I Jin
|
|
||||||
- Per Øyvind Karlsen
|
|
||||||
- Thomas Klausner
|
|
||||||
- Richard Koch
|
|
||||||
- Ville Koskinen
|
|
||||||
- Jan Kratochvil
|
|
||||||
- Christian Kujau
|
|
||||||
- Stephan Kulow
|
|
||||||
- Peter Lawler
|
|
||||||
- James M Leddy
|
|
||||||
- Hin-Tak Leung
|
|
||||||
- Andraž 'ruskie' Levstik
|
|
||||||
- Cary Lewis
|
|
||||||
- Wim Lewis
|
|
||||||
- Lorenzo De Liso
|
|
||||||
- Bela Lubkin
|
|
||||||
- Gregory Margo
|
|
||||||
- Jim Meyering
|
|
||||||
- Arkadiusz Miskiewicz
|
|
||||||
- Conley Moorhous
|
|
||||||
- Rafał Mużyło
|
|
||||||
- Adrien Nader
|
|
||||||
- Hongbo Ni
|
|
||||||
- Jonathan Nieder
|
|
||||||
- Andre Noll
|
|
||||||
- Peter O'Gorman
|
|
||||||
- Peter Pallinger
|
|
||||||
- Rui Paulo
|
|
||||||
- Igor Pavlov
|
|
||||||
- Diego Elio Pettenò
|
|
||||||
- Elbert Pol
|
|
||||||
- Mikko Pouru
|
|
||||||
- Trần Ngọc Quân
|
|
||||||
- Pavel Raiskup
|
|
||||||
- Ole André Vadla Ravnås
|
|
||||||
- Robert Readman
|
|
||||||
- Bernhard Reutner-Fischer
|
|
||||||
- Eric S. Raymond
|
|
||||||
- Cristian Rodríguez
|
|
||||||
- Christian von Roques
|
|
||||||
- Torsten Rupp
|
|
||||||
- Jukka Salmi
|
|
||||||
- Alexandre Sauvé
|
|
||||||
- Benno Schulenberg
|
|
||||||
- Andreas Schwab
|
|
||||||
- Dan Shechter
|
|
||||||
- Stuart Shelton
|
|
||||||
- Brad Smith
|
|
||||||
- Jonathan Stott
|
|
||||||
- Dan Stromberg
|
|
||||||
- Vincent Torri
|
|
||||||
- Paul Townsend
|
|
||||||
- Mohammed Adnène Trojette
|
|
||||||
- Alexey Tourbin
|
|
||||||
- Patrick J. Volkerding
|
|
||||||
- Martin Väth
|
|
||||||
- Adam Walling
|
|
||||||
- Christian Weisgerber
|
|
||||||
- Bert Wesarg
|
|
||||||
- Fredrik Wikstrom
|
|
||||||
- Ralf Wildenhues
|
|
||||||
- Charles Wilson
|
|
||||||
- Lars Wirzenius
|
|
||||||
- Pilorz Wojciech
|
|
||||||
- Ryan Young
|
|
||||||
- Andreas Zieringer
|
|
||||||
|
|
||||||
Also thanks to all the people who have participated in the Tukaani project.
|
|
||||||
|
|
||||||
I have probably forgot to add some names to the above list. Sorry about
|
|
||||||
that and thanks for your help.
|
|
||||||
|
|
||||||
111
TODO
111
TODO
@@ -1,111 +0,0 @@
|
|||||||
|
|
||||||
XZ Utils To-Do List
|
|
||||||
===================
|
|
||||||
|
|
||||||
Known bugs
|
|
||||||
----------
|
|
||||||
|
|
||||||
The test suite is too incomplete.
|
|
||||||
|
|
||||||
If the memory usage limit is less than about 13 MiB, xz is unable to
|
|
||||||
automatically scale down the compression settings enough even though
|
|
||||||
it would be possible by switching from BT2/BT3/BT4 match finder to
|
|
||||||
HC3/HC4.
|
|
||||||
|
|
||||||
XZ Utils compress some files significantly worse than LZMA Utils.
|
|
||||||
This is due to faster compression presets used by XZ Utils, and
|
|
||||||
can often be worked around by using "xz --extreme". With some files
|
|
||||||
--extreme isn't enough though: it's most likely with files that
|
|
||||||
compress extremely well, so going from compression ratio of 0.003
|
|
||||||
to 0.004 means big relative increase in the compressed file size.
|
|
||||||
|
|
||||||
xz doesn't quote unprintable characters when it displays file names
|
|
||||||
given on the command line.
|
|
||||||
|
|
||||||
tuklib_exit() doesn't block signals => EINTR is possible.
|
|
||||||
|
|
||||||
SIGTSTP is not handled. If xz is stopped, the estimated remaining
|
|
||||||
time and calculated (de)compression speed won't make sense in the
|
|
||||||
progress indicator (xz --verbose).
|
|
||||||
|
|
||||||
If liblzma has created threads and fork() gets called, liblzma
|
|
||||||
code will break in the child process unless it calls exec() and
|
|
||||||
doesn't touch liblzma.
|
|
||||||
|
|
||||||
|
|
||||||
Missing features
|
|
||||||
----------------
|
|
||||||
|
|
||||||
Add support for storing metadata in .xz files. A preliminary
|
|
||||||
idea is to create a new Stream type for metadata. When both
|
|
||||||
metadata and data are wanted in the same .xz file, two or more
|
|
||||||
Streams would be concatenated.
|
|
||||||
|
|
||||||
The state stored in lzma_stream should be cloneable, which would
|
|
||||||
be mostly useful when using a preset dictionary in LZMA2, but
|
|
||||||
it may have other uses too. Compare to deflateCopy() in zlib.
|
|
||||||
|
|
||||||
Support LZMA_FINISH in raw decoder to indicate end of LZMA1 and
|
|
||||||
other streams that don't have an end of payload marker.
|
|
||||||
|
|
||||||
Adjust dictionary size when the input file size is known.
|
|
||||||
Maybe do this only if an option is given.
|
|
||||||
|
|
||||||
xz doesn't support copying extended attributes, access control
|
|
||||||
lists etc. from source to target file.
|
|
||||||
|
|
||||||
Multithreaded compression:
|
|
||||||
- Reduce memory usage of the current method.
|
|
||||||
- Implement threaded match finders.
|
|
||||||
- Implement pigz-style threading in LZMA2.
|
|
||||||
|
|
||||||
Multithreaded decompression
|
|
||||||
|
|
||||||
Buffer-to-buffer coding could use less RAM (especially when
|
|
||||||
decompressing LZMA1 or LZMA2).
|
|
||||||
|
|
||||||
I/O library is not implemented (similar to gzopen() in zlib).
|
|
||||||
It will be a separate library that supports uncompressed, .gz,
|
|
||||||
.bz2, .lzma, and .xz files.
|
|
||||||
|
|
||||||
Support changing lzma_options_lzma.mode with lzma_filters_update().
|
|
||||||
|
|
||||||
Support LZMA_FULL_FLUSH for lzma_stream_decoder() to stop at
|
|
||||||
Block and Stream boundaries.
|
|
||||||
|
|
||||||
lzma_strerror() to convert lzma_ret to human readable form?
|
|
||||||
This is tricky, because the same error codes are used with
|
|
||||||
slightly different meanings, and this cannot be fixed anymore.
|
|
||||||
|
|
||||||
Make it possible to adjust LZMA2 options in the middle of a Block
|
|
||||||
so that the encoding speed vs. compression ratio can be optimized
|
|
||||||
when the compressed data is streamed over network.
|
|
||||||
|
|
||||||
Improved BCJ filters. The current filters are small but they aren't
|
|
||||||
so great when compressing binary packages that contain various file
|
|
||||||
types. Specifically, they make things worse if there are static
|
|
||||||
libraries or Linux kernel modules. The filtering could also be
|
|
||||||
more effective (without getting overly complex), for example,
|
|
||||||
streamable variant BCJ2 from 7-Zip could be implemented.
|
|
||||||
|
|
||||||
Filter that autodetects specific data types in the input stream
|
|
||||||
and applies appropriate filters for the corrects parts of the input.
|
|
||||||
Perhaps combine this with the BCJ filter improvement point above.
|
|
||||||
|
|
||||||
Long-range LZ77 method as a separate filter or as a new LZMA2
|
|
||||||
match finder.
|
|
||||||
|
|
||||||
|
|
||||||
Documentation
|
|
||||||
-------------
|
|
||||||
|
|
||||||
More tutorial programs are needed for liblzma.
|
|
||||||
|
|
||||||
Document the LZMA1 and LZMA2 algorithms.
|
|
||||||
|
|
||||||
|
|
||||||
Miscellaneous
|
|
||||||
------------
|
|
||||||
|
|
||||||
Try to get the media type for .xz registered at IANA.
|
|
||||||
|
|
||||||
1228
aclocal.m4
vendored
1228
aclocal.m4
vendored
File diff suppressed because it is too large
Load Diff
186
adler32.c
Normal file
186
adler32.c
Normal file
@@ -0,0 +1,186 @@
|
|||||||
|
/* adler32.c -- compute the Adler-32 checksum of a data stream
|
||||||
|
* Copyright (C) 1995-2011, 2016 Mark Adler
|
||||||
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* @(#) $Id$ */
|
||||||
|
|
||||||
|
#include "zutil.h"
|
||||||
|
|
||||||
|
local uLong adler32_combine_ OF((uLong adler1, uLong adler2, z_off64_t len2));
|
||||||
|
|
||||||
|
#define BASE 65521U /* 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 --
|
||||||
|
try it both ways to see which is faster */
|
||||||
|
#ifdef NO_DIVIDE
|
||||||
|
/* note that this assumes BASE is 65521, where 65536 % 65521 == 15
|
||||||
|
(thank you to John Reiser for pointing this out) */
|
||||||
|
# define CHOP(a) \
|
||||||
|
do { \
|
||||||
|
unsigned long tmp = a >> 16; \
|
||||||
|
a &= 0xffffUL; \
|
||||||
|
a += (tmp << 4) - tmp; \
|
||||||
|
} while (0)
|
||||||
|
# define MOD28(a) \
|
||||||
|
do { \
|
||||||
|
CHOP(a); \
|
||||||
|
if (a >= BASE) a -= BASE; \
|
||||||
|
} while (0)
|
||||||
|
# define MOD(a) \
|
||||||
|
do { \
|
||||||
|
CHOP(a); \
|
||||||
|
MOD28(a); \
|
||||||
|
} while (0)
|
||||||
|
# define MOD63(a) \
|
||||||
|
do { /* this assumes a is not negative */ \
|
||||||
|
z_off64_t tmp = a >> 32; \
|
||||||
|
a &= 0xffffffffL; \
|
||||||
|
a += (tmp << 8) - (tmp << 5) + tmp; \
|
||||||
|
tmp = a >> 16; \
|
||||||
|
a &= 0xffffL; \
|
||||||
|
a += (tmp << 4) - tmp; \
|
||||||
|
tmp = a >> 16; \
|
||||||
|
a &= 0xffffL; \
|
||||||
|
a += (tmp << 4) - tmp; \
|
||||||
|
if (a >= BASE) a -= BASE; \
|
||||||
|
} while (0)
|
||||||
|
#else
|
||||||
|
# define MOD(a) a %= BASE
|
||||||
|
# define MOD28(a) a %= BASE
|
||||||
|
# define MOD63(a) a %= BASE
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* ========================================================================= */
|
||||||
|
uLong ZEXPORT adler32_z(adler, buf, len)
|
||||||
|
uLong adler;
|
||||||
|
const Bytef *buf;
|
||||||
|
z_size_t 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;
|
||||||
|
MOD28(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(adler, buf, len)
|
||||||
|
uLong adler;
|
||||||
|
const Bytef *buf;
|
||||||
|
uInt len;
|
||||||
|
{
|
||||||
|
return adler32_z(adler, buf, len);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* ========================================================================= */
|
||||||
|
local uLong adler32_combine_(adler1, adler2, len2)
|
||||||
|
uLong adler1;
|
||||||
|
uLong adler2;
|
||||||
|
z_off64_t len2;
|
||||||
|
{
|
||||||
|
unsigned long sum1;
|
||||||
|
unsigned long sum2;
|
||||||
|
unsigned rem;
|
||||||
|
|
||||||
|
/* for negative len, return invalid adler32 as a clue for debugging */
|
||||||
|
if (len2 < 0)
|
||||||
|
return 0xffffffffUL;
|
||||||
|
|
||||||
|
/* the derivation of this formula is left as an exercise for the reader */
|
||||||
|
MOD63(len2); /* assumes len2 >= 0 */
|
||||||
|
rem = (unsigned)len2;
|
||||||
|
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 >= ((unsigned long)BASE << 1)) sum2 -= ((unsigned long)BASE << 1);
|
||||||
|
if (sum2 >= BASE) sum2 -= BASE;
|
||||||
|
return sum1 | (sum2 << 16);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* ========================================================================= */
|
||||||
|
uLong ZEXPORT adler32_combine(adler1, adler2, len2)
|
||||||
|
uLong adler1;
|
||||||
|
uLong adler2;
|
||||||
|
z_off_t len2;
|
||||||
|
{
|
||||||
|
return adler32_combine_(adler1, adler2, len2);
|
||||||
|
}
|
||||||
|
|
||||||
|
uLong ZEXPORT adler32_combine64(adler1, adler2, len2)
|
||||||
|
uLong adler1;
|
||||||
|
uLong adler2;
|
||||||
|
z_off64_t len2;
|
||||||
|
{
|
||||||
|
return adler32_combine_(adler1, adler2, len2);
|
||||||
|
}
|
||||||
69
amiga/Makefile.pup
Normal file
69
amiga/Makefile.pup
Normal file
@@ -0,0 +1,69 @@
|
|||||||
|
# Amiga powerUP (TM) Makefile
|
||||||
|
# makefile for libpng and SAS C V6.58/7.00 PPC compiler
|
||||||
|
# Copyright (C) 1998 by Andreas R. Kleinert
|
||||||
|
|
||||||
|
LIBNAME = libzip.a
|
||||||
|
|
||||||
|
CC = scppc
|
||||||
|
CFLAGS = NOSTKCHK NOSINT OPTIMIZE OPTGO OPTPEEP OPTINLOCAL OPTINL \
|
||||||
|
OPTLOOP OPTRDEP=8 OPTDEP=8 OPTCOMP=8 NOVER
|
||||||
|
AR = ppc-amigaos-ar cr
|
||||||
|
RANLIB = ppc-amigaos-ranlib
|
||||||
|
LD = ppc-amigaos-ld -r
|
||||||
|
LDFLAGS = -o
|
||||||
|
LDLIBS = LIB:scppc.a LIB:end.o
|
||||||
|
RM = delete quiet
|
||||||
|
|
||||||
|
OBJS = adler32.o compress.o crc32.o gzclose.o gzlib.o gzread.o gzwrite.o \
|
||||||
|
uncompr.o deflate.o trees.o zutil.o inflate.o infback.o inftrees.o inffast.o
|
||||||
|
|
||||||
|
TEST_OBJS = example.o minigzip.o
|
||||||
|
|
||||||
|
all: example minigzip
|
||||||
|
|
||||||
|
check: test
|
||||||
|
test: all
|
||||||
|
example
|
||||||
|
echo hello world | minigzip | minigzip -d
|
||||||
|
|
||||||
|
$(LIBNAME): $(OBJS)
|
||||||
|
$(AR) $@ $(OBJS)
|
||||||
|
-$(RANLIB) $@
|
||||||
|
|
||||||
|
example: example.o $(LIBNAME)
|
||||||
|
$(LD) $(LDFLAGS) $@ LIB:c_ppc.o $@.o $(LIBNAME) $(LDLIBS)
|
||||||
|
|
||||||
|
minigzip: minigzip.o $(LIBNAME)
|
||||||
|
$(LD) $(LDFLAGS) $@ LIB:c_ppc.o $@.o $(LIBNAME) $(LDLIBS)
|
||||||
|
|
||||||
|
mostlyclean: clean
|
||||||
|
clean:
|
||||||
|
$(RM) *.o example minigzip $(LIBNAME) foo.gz
|
||||||
|
|
||||||
|
zip:
|
||||||
|
zip -ul9 zlib README ChangeLog Makefile Make????.??? Makefile.?? \
|
||||||
|
descrip.mms *.[ch]
|
||||||
|
|
||||||
|
tgz:
|
||||||
|
cd ..; tar cfz zlib/zlib.tgz zlib/README zlib/ChangeLog zlib/Makefile \
|
||||||
|
zlib/Make????.??? zlib/Makefile.?? zlib/descrip.mms zlib/*.[ch]
|
||||||
|
|
||||||
|
# DO NOT DELETE THIS LINE -- make depend depends on it.
|
||||||
|
|
||||||
|
adler32.o: zlib.h zconf.h
|
||||||
|
compress.o: zlib.h zconf.h
|
||||||
|
crc32.o: crc32.h zlib.h zconf.h
|
||||||
|
deflate.o: deflate.h zutil.h zlib.h zconf.h
|
||||||
|
example.o: zlib.h zconf.h
|
||||||
|
gzclose.o: zlib.h zconf.h gzguts.h
|
||||||
|
gzlib.o: zlib.h zconf.h gzguts.h
|
||||||
|
gzread.o: zlib.h zconf.h gzguts.h
|
||||||
|
gzwrite.o: zlib.h zconf.h gzguts.h
|
||||||
|
inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
|
||||||
|
inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
|
||||||
|
infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
|
||||||
|
inftrees.o: zutil.h zlib.h zconf.h inftrees.h
|
||||||
|
minigzip.o: zlib.h zconf.h
|
||||||
|
trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
|
||||||
|
uncompr.o: zlib.h zconf.h
|
||||||
|
zutil.o: zutil.h zlib.h zconf.h
|
||||||
68
amiga/Makefile.sas
Normal file
68
amiga/Makefile.sas
Normal file
@@ -0,0 +1,68 @@
|
|||||||
|
# SMakefile for zlib
|
||||||
|
# Modified from the standard UNIX Makefile Copyright Jean-loup Gailly
|
||||||
|
# Osma Ahvenlampi <Osma.Ahvenlampi@hut.fi>
|
||||||
|
# Amiga, SAS/C 6.56 & Smake
|
||||||
|
|
||||||
|
CC=sc
|
||||||
|
CFLAGS=OPT
|
||||||
|
#CFLAGS=OPT CPU=68030
|
||||||
|
#CFLAGS=DEBUG=LINE
|
||||||
|
LDFLAGS=LIB z.lib
|
||||||
|
|
||||||
|
SCOPTIONS=OPTSCHED OPTINLINE OPTALIAS OPTTIME OPTINLOCAL STRMERGE \
|
||||||
|
NOICONS PARMS=BOTH NOSTACKCHECK UTILLIB NOVERSION ERRORREXX \
|
||||||
|
DEF=POSTINC
|
||||||
|
|
||||||
|
OBJS = adler32.o compress.o crc32.o gzclose.o gzlib.o gzread.o gzwrite.o \
|
||||||
|
uncompr.o deflate.o trees.o zutil.o inflate.o infback.o inftrees.o inffast.o
|
||||||
|
|
||||||
|
TEST_OBJS = example.o minigzip.o
|
||||||
|
|
||||||
|
all: SCOPTIONS example minigzip
|
||||||
|
|
||||||
|
check: test
|
||||||
|
test: all
|
||||||
|
example
|
||||||
|
echo hello world | minigzip | minigzip -d
|
||||||
|
|
||||||
|
install: z.lib
|
||||||
|
copy clone zlib.h zconf.h INCLUDE:
|
||||||
|
copy clone z.lib LIB:
|
||||||
|
|
||||||
|
z.lib: $(OBJS)
|
||||||
|
oml z.lib r $(OBJS)
|
||||||
|
|
||||||
|
example: example.o z.lib
|
||||||
|
$(CC) $(CFLAGS) LINK TO $@ example.o $(LDFLAGS)
|
||||||
|
|
||||||
|
minigzip: minigzip.o z.lib
|
||||||
|
$(CC) $(CFLAGS) LINK TO $@ minigzip.o $(LDFLAGS)
|
||||||
|
|
||||||
|
mostlyclean: clean
|
||||||
|
clean:
|
||||||
|
-delete force quiet example minigzip *.o z.lib foo.gz *.lnk SCOPTIONS
|
||||||
|
|
||||||
|
SCOPTIONS: Makefile.sas
|
||||||
|
copy to $@ <from <
|
||||||
|
$(SCOPTIONS)
|
||||||
|
<
|
||||||
|
|
||||||
|
# DO NOT DELETE THIS LINE -- make depend depends on it.
|
||||||
|
|
||||||
|
adler32.o: zlib.h zconf.h
|
||||||
|
compress.o: zlib.h zconf.h
|
||||||
|
crc32.o: crc32.h zlib.h zconf.h
|
||||||
|
deflate.o: deflate.h zutil.h zlib.h zconf.h
|
||||||
|
example.o: zlib.h zconf.h
|
||||||
|
gzclose.o: zlib.h zconf.h gzguts.h
|
||||||
|
gzlib.o: zlib.h zconf.h gzguts.h
|
||||||
|
gzread.o: zlib.h zconf.h gzguts.h
|
||||||
|
gzwrite.o: zlib.h zconf.h gzguts.h
|
||||||
|
inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
|
||||||
|
inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
|
||||||
|
infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
|
||||||
|
inftrees.o: zutil.h zlib.h zconf.h inftrees.h
|
||||||
|
minigzip.o: zlib.h zconf.h
|
||||||
|
trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
|
||||||
|
uncompr.o: zlib.h zconf.h
|
||||||
|
zutil.o: zutil.h zlib.h zconf.h
|
||||||
22
autogen.sh
22
autogen.sh
@@ -1,22 +0,0 @@
|
|||||||
#!/bin/sh
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
#
|
|
||||||
# Author: Lasse Collin
|
|
||||||
#
|
|
||||||
# This file has been put into the public domain.
|
|
||||||
# You can do whatever you want with this file.
|
|
||||||
#
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
# The result of using "autoreconf -fi" should be identical to using this
|
|
||||||
# script. I'm leaving this script here just in case someone finds it useful.
|
|
||||||
|
|
||||||
set -e -x
|
|
||||||
|
|
||||||
${AUTOPOINT:-autopoint} -f
|
|
||||||
${LIBTOOLIZE:-libtoolize} -c -f || glibtoolize -c -f
|
|
||||||
${ACLOCAL:-aclocal} -I m4
|
|
||||||
${AUTOCONF:-autoconf}
|
|
||||||
${AUTOHEADER:-autoheader}
|
|
||||||
${AUTOMAKE:-automake} -acf --foreign
|
|
||||||
@@ -1,347 +0,0 @@
|
|||||||
#! /bin/sh
|
|
||||||
# Wrapper for compilers which do not understand '-c -o'.
|
|
||||||
|
|
||||||
scriptversion=2012-10-14.11; # UTC
|
|
||||||
|
|
||||||
# Copyright (C) 1999-2014 Free Software Foundation, Inc.
|
|
||||||
# Written by Tom Tromey <tromey@cygnus.com>.
|
|
||||||
#
|
|
||||||
# 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, 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, see <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
# 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.
|
|
||||||
|
|
||||||
# This file is maintained in Automake, please report
|
|
||||||
# bugs to <bug-automake@gnu.org> or send patches to
|
|
||||||
# <automake-patches@gnu.org>.
|
|
||||||
|
|
||||||
nl='
|
|
||||||
'
|
|
||||||
|
|
||||||
# We need space, tab and new line, in precisely that order. Quoting is
|
|
||||||
# there to prevent tools from complaining about whitespace usage.
|
|
||||||
IFS=" "" $nl"
|
|
||||||
|
|
||||||
file_conv=
|
|
||||||
|
|
||||||
# func_file_conv build_file lazy
|
|
||||||
# Convert a $build file to $host form and store it in $file
|
|
||||||
# Currently only supports Windows hosts. If the determined conversion
|
|
||||||
# type is listed in (the comma separated) LAZY, no conversion will
|
|
||||||
# take place.
|
|
||||||
func_file_conv ()
|
|
||||||
{
|
|
||||||
file=$1
|
|
||||||
case $file in
|
|
||||||
/ | /[!/]*) # absolute file, and not a UNC file
|
|
||||||
if test -z "$file_conv"; then
|
|
||||||
# lazily determine how to convert abs files
|
|
||||||
case `uname -s` in
|
|
||||||
MINGW*)
|
|
||||||
file_conv=mingw
|
|
||||||
;;
|
|
||||||
CYGWIN*)
|
|
||||||
file_conv=cygwin
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
file_conv=wine
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
case $file_conv/,$2, in
|
|
||||||
*,$file_conv,*)
|
|
||||||
;;
|
|
||||||
mingw/*)
|
|
||||||
file=`cmd //C echo "$file " | sed -e 's/"\(.*\) " *$/\1/'`
|
|
||||||
;;
|
|
||||||
cygwin/*)
|
|
||||||
file=`cygpath -m "$file" || echo "$file"`
|
|
||||||
;;
|
|
||||||
wine/*)
|
|
||||||
file=`winepath -w "$file" || echo "$file"`
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
}
|
|
||||||
|
|
||||||
# func_cl_dashL linkdir
|
|
||||||
# Make cl look for libraries in LINKDIR
|
|
||||||
func_cl_dashL ()
|
|
||||||
{
|
|
||||||
func_file_conv "$1"
|
|
||||||
if test -z "$lib_path"; then
|
|
||||||
lib_path=$file
|
|
||||||
else
|
|
||||||
lib_path="$lib_path;$file"
|
|
||||||
fi
|
|
||||||
linker_opts="$linker_opts -LIBPATH:$file"
|
|
||||||
}
|
|
||||||
|
|
||||||
# func_cl_dashl library
|
|
||||||
# Do a library search-path lookup for cl
|
|
||||||
func_cl_dashl ()
|
|
||||||
{
|
|
||||||
lib=$1
|
|
||||||
found=no
|
|
||||||
save_IFS=$IFS
|
|
||||||
IFS=';'
|
|
||||||
for dir in $lib_path $LIB
|
|
||||||
do
|
|
||||||
IFS=$save_IFS
|
|
||||||
if $shared && test -f "$dir/$lib.dll.lib"; then
|
|
||||||
found=yes
|
|
||||||
lib=$dir/$lib.dll.lib
|
|
||||||
break
|
|
||||||
fi
|
|
||||||
if test -f "$dir/$lib.lib"; then
|
|
||||||
found=yes
|
|
||||||
lib=$dir/$lib.lib
|
|
||||||
break
|
|
||||||
fi
|
|
||||||
if test -f "$dir/lib$lib.a"; then
|
|
||||||
found=yes
|
|
||||||
lib=$dir/lib$lib.a
|
|
||||||
break
|
|
||||||
fi
|
|
||||||
done
|
|
||||||
IFS=$save_IFS
|
|
||||||
|
|
||||||
if test "$found" != yes; then
|
|
||||||
lib=$lib.lib
|
|
||||||
fi
|
|
||||||
}
|
|
||||||
|
|
||||||
# func_cl_wrapper cl arg...
|
|
||||||
# Adjust compile command to suit cl
|
|
||||||
func_cl_wrapper ()
|
|
||||||
{
|
|
||||||
# Assume a capable shell
|
|
||||||
lib_path=
|
|
||||||
shared=:
|
|
||||||
linker_opts=
|
|
||||||
for arg
|
|
||||||
do
|
|
||||||
if test -n "$eat"; then
|
|
||||||
eat=
|
|
||||||
else
|
|
||||||
case $1 in
|
|
||||||
-o)
|
|
||||||
# configure might choose to run compile as 'compile cc -o foo foo.c'.
|
|
||||||
eat=1
|
|
||||||
case $2 in
|
|
||||||
*.o | *.[oO][bB][jJ])
|
|
||||||
func_file_conv "$2"
|
|
||||||
set x "$@" -Fo"$file"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
func_file_conv "$2"
|
|
||||||
set x "$@" -Fe"$file"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
-I)
|
|
||||||
eat=1
|
|
||||||
func_file_conv "$2" mingw
|
|
||||||
set x "$@" -I"$file"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
-I*)
|
|
||||||
func_file_conv "${1#-I}" mingw
|
|
||||||
set x "$@" -I"$file"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
-l)
|
|
||||||
eat=1
|
|
||||||
func_cl_dashl "$2"
|
|
||||||
set x "$@" "$lib"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
-l*)
|
|
||||||
func_cl_dashl "${1#-l}"
|
|
||||||
set x "$@" "$lib"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
-L)
|
|
||||||
eat=1
|
|
||||||
func_cl_dashL "$2"
|
|
||||||
;;
|
|
||||||
-L*)
|
|
||||||
func_cl_dashL "${1#-L}"
|
|
||||||
;;
|
|
||||||
-static)
|
|
||||||
shared=false
|
|
||||||
;;
|
|
||||||
-Wl,*)
|
|
||||||
arg=${1#-Wl,}
|
|
||||||
save_ifs="$IFS"; IFS=','
|
|
||||||
for flag in $arg; do
|
|
||||||
IFS="$save_ifs"
|
|
||||||
linker_opts="$linker_opts $flag"
|
|
||||||
done
|
|
||||||
IFS="$save_ifs"
|
|
||||||
;;
|
|
||||||
-Xlinker)
|
|
||||||
eat=1
|
|
||||||
linker_opts="$linker_opts $2"
|
|
||||||
;;
|
|
||||||
-*)
|
|
||||||
set x "$@" "$1"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
*.cc | *.CC | *.cxx | *.CXX | *.[cC]++)
|
|
||||||
func_file_conv "$1"
|
|
||||||
set x "$@" -Tp"$file"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
*.c | *.cpp | *.CPP | *.lib | *.LIB | *.Lib | *.OBJ | *.obj | *.[oO])
|
|
||||||
func_file_conv "$1" mingw
|
|
||||||
set x "$@" "$file"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
set x "$@" "$1"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
shift
|
|
||||||
done
|
|
||||||
if test -n "$linker_opts"; then
|
|
||||||
linker_opts="-link$linker_opts"
|
|
||||||
fi
|
|
||||||
exec "$@" $linker_opts
|
|
||||||
exit 1
|
|
||||||
}
|
|
||||||
|
|
||||||
eat=
|
|
||||||
|
|
||||||
case $1 in
|
|
||||||
'')
|
|
||||||
echo "$0: No command. Try '$0 --help' for more information." 1>&2
|
|
||||||
exit 1;
|
|
||||||
;;
|
|
||||||
-h | --h*)
|
|
||||||
cat <<\EOF
|
|
||||||
Usage: compile [--help] [--version] PROGRAM [ARGS]
|
|
||||||
|
|
||||||
Wrapper for compilers which do not understand '-c -o'.
|
|
||||||
Remove '-o dest.o' from ARGS, run PROGRAM with the remaining
|
|
||||||
arguments, and rename the output as expected.
|
|
||||||
|
|
||||||
If you are trying to build a whole package this is not the
|
|
||||||
right script to run: please start by reading the file 'INSTALL'.
|
|
||||||
|
|
||||||
Report bugs to <bug-automake@gnu.org>.
|
|
||||||
EOF
|
|
||||||
exit $?
|
|
||||||
;;
|
|
||||||
-v | --v*)
|
|
||||||
echo "compile $scriptversion"
|
|
||||||
exit $?
|
|
||||||
;;
|
|
||||||
cl | *[/\\]cl | cl.exe | *[/\\]cl.exe )
|
|
||||||
func_cl_wrapper "$@" # Doesn't return...
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
|
|
||||||
ofile=
|
|
||||||
cfile=
|
|
||||||
|
|
||||||
for arg
|
|
||||||
do
|
|
||||||
if test -n "$eat"; then
|
|
||||||
eat=
|
|
||||||
else
|
|
||||||
case $1 in
|
|
||||||
-o)
|
|
||||||
# configure might choose to run compile as 'compile cc -o foo foo.c'.
|
|
||||||
# So we strip '-o arg' only if arg is an object.
|
|
||||||
eat=1
|
|
||||||
case $2 in
|
|
||||||
*.o | *.obj)
|
|
||||||
ofile=$2
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
set x "$@" -o "$2"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
*.c)
|
|
||||||
cfile=$1
|
|
||||||
set x "$@" "$1"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
set x "$@" "$1"
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
shift
|
|
||||||
done
|
|
||||||
|
|
||||||
if test -z "$ofile" || test -z "$cfile"; then
|
|
||||||
# If no '-o' option was seen then we might have been invoked from a
|
|
||||||
# pattern rule where we don't need one. That is ok -- this is a
|
|
||||||
# normal compilation that the losing compiler can handle. If no
|
|
||||||
# '.c' file was seen then we are probably linking. That is also
|
|
||||||
# ok.
|
|
||||||
exec "$@"
|
|
||||||
fi
|
|
||||||
|
|
||||||
# Name of file we expect compiler to create.
|
|
||||||
cofile=`echo "$cfile" | sed 's|^.*[\\/]||; s|^[a-zA-Z]:||; s/\.c$/.o/'`
|
|
||||||
|
|
||||||
# Create the lock directory.
|
|
||||||
# Note: use '[/\\:.-]' here to ensure that we don't use the same name
|
|
||||||
# that we are using for the .o file. Also, base the name on the expected
|
|
||||||
# object file name, since that is what matters with a parallel build.
|
|
||||||
lockdir=`echo "$cofile" | sed -e 's|[/\\:.-]|_|g'`.d
|
|
||||||
while true; do
|
|
||||||
if mkdir "$lockdir" >/dev/null 2>&1; then
|
|
||||||
break
|
|
||||||
fi
|
|
||||||
sleep 1
|
|
||||||
done
|
|
||||||
# FIXME: race condition here if user kills between mkdir and trap.
|
|
||||||
trap "rmdir '$lockdir'; exit 1" 1 2 15
|
|
||||||
|
|
||||||
# Run the compile.
|
|
||||||
"$@"
|
|
||||||
ret=$?
|
|
||||||
|
|
||||||
if test -f "$cofile"; then
|
|
||||||
test "$cofile" = "$ofile" || mv "$cofile" "$ofile"
|
|
||||||
elif test -f "${cofile}bj"; then
|
|
||||||
test "${cofile}bj" = "$ofile" || mv "${cofile}bj" "$ofile"
|
|
||||||
fi
|
|
||||||
|
|
||||||
rmdir "$lockdir"
|
|
||||||
exit $ret
|
|
||||||
|
|
||||||
# Local Variables:
|
|
||||||
# mode: shell-script
|
|
||||||
# sh-indentation: 2
|
|
||||||
# eval: (add-hook 'write-file-hooks 'time-stamp)
|
|
||||||
# time-stamp-start: "scriptversion="
|
|
||||||
# time-stamp-format: "%:y-%02m-%02d.%02H"
|
|
||||||
# time-stamp-time-zone: "UTC"
|
|
||||||
# time-stamp-end: "; # UTC"
|
|
||||||
# End:
|
|
||||||
1421
build-aux/config.guess
vendored
1421
build-aux/config.guess
vendored
File diff suppressed because it is too large
Load Diff
@@ -1,672 +0,0 @@
|
|||||||
#! /bin/sh
|
|
||||||
# Output a system dependent set of variables, describing how to set the
|
|
||||||
# run time search path of shared libraries in an executable.
|
|
||||||
#
|
|
||||||
# Copyright 1996-2010 Free Software Foundation, Inc.
|
|
||||||
# Taken from GNU libtool, 2001
|
|
||||||
# Originally by Gordon Matzigkeit <gord@gnu.ai.mit.edu>, 1996
|
|
||||||
#
|
|
||||||
# This file is free software; the Free Software Foundation gives
|
|
||||||
# unlimited permission to copy and/or distribute it, with or without
|
|
||||||
# modifications, as long as this notice is preserved.
|
|
||||||
#
|
|
||||||
# The first argument passed to this file is the canonical host specification,
|
|
||||||
# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM
|
|
||||||
# or
|
|
||||||
# CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM
|
|
||||||
# The environment variables CC, GCC, LDFLAGS, LD, with_gnu_ld
|
|
||||||
# should be set by the caller.
|
|
||||||
#
|
|
||||||
# The set of defined variables is at the end of this script.
|
|
||||||
|
|
||||||
# Known limitations:
|
|
||||||
# - On IRIX 6.5 with CC="cc", the run time search patch must not be longer
|
|
||||||
# than 256 bytes, otherwise the compiler driver will dump core. The only
|
|
||||||
# known workaround is to choose shorter directory names for the build
|
|
||||||
# directory and/or the installation directory.
|
|
||||||
|
|
||||||
# All known linkers require a `.a' archive for static linking (except MSVC,
|
|
||||||
# which needs '.lib').
|
|
||||||
libext=a
|
|
||||||
shrext=.so
|
|
||||||
|
|
||||||
host="$1"
|
|
||||||
host_cpu=`echo "$host" | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'`
|
|
||||||
host_vendor=`echo "$host" | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'`
|
|
||||||
host_os=`echo "$host" | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'`
|
|
||||||
|
|
||||||
# Code taken from libtool.m4's _LT_CC_BASENAME.
|
|
||||||
|
|
||||||
for cc_temp in $CC""; do
|
|
||||||
case $cc_temp in
|
|
||||||
compile | *[\\/]compile | ccache | *[\\/]ccache ) ;;
|
|
||||||
distcc | *[\\/]distcc | purify | *[\\/]purify ) ;;
|
|
||||||
\-*) ;;
|
|
||||||
*) break;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
cc_basename=`echo "$cc_temp" | sed -e 's%^.*/%%'`
|
|
||||||
|
|
||||||
# Code taken from libtool.m4's _LT_COMPILER_PIC.
|
|
||||||
|
|
||||||
wl=
|
|
||||||
if test "$GCC" = yes; then
|
|
||||||
wl='-Wl,'
|
|
||||||
else
|
|
||||||
case "$host_os" in
|
|
||||||
aix*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
darwin*)
|
|
||||||
case $cc_basename in
|
|
||||||
xlc*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
mingw* | cygwin* | pw32* | os2* | cegcc*)
|
|
||||||
;;
|
|
||||||
hpux9* | hpux10* | hpux11*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
irix5* | irix6* | nonstopux*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
newsos6)
|
|
||||||
;;
|
|
||||||
linux* | k*bsd*-gnu)
|
|
||||||
case $cc_basename in
|
|
||||||
ecc*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
icc* | ifort*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
lf95*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
pgcc | pgf77 | pgf90)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
ccc*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
como)
|
|
||||||
wl='-lopt='
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
case `$CC -V 2>&1 | sed 5q` in
|
|
||||||
*Sun\ C*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
osf3* | osf4* | osf5*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
rdos*)
|
|
||||||
;;
|
|
||||||
solaris*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
sunos4*)
|
|
||||||
wl='-Qoption ld '
|
|
||||||
;;
|
|
||||||
sysv4 | sysv4.2uw2* | sysv4.3*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
sysv4*MP*)
|
|
||||||
;;
|
|
||||||
sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
unicos*)
|
|
||||||
wl='-Wl,'
|
|
||||||
;;
|
|
||||||
uts4*)
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
|
|
||||||
# Code taken from libtool.m4's _LT_LINKER_SHLIBS.
|
|
||||||
|
|
||||||
hardcode_libdir_flag_spec=
|
|
||||||
hardcode_libdir_separator=
|
|
||||||
hardcode_direct=no
|
|
||||||
hardcode_minus_L=no
|
|
||||||
|
|
||||||
case "$host_os" in
|
|
||||||
cygwin* | mingw* | pw32* | cegcc*)
|
|
||||||
# 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
|
|
||||||
;;
|
|
||||||
interix*)
|
|
||||||
# we just hope/assume this is gcc and not c89 (= MSVC++)
|
|
||||||
with_gnu_ld=yes
|
|
||||||
;;
|
|
||||||
openbsd*)
|
|
||||||
with_gnu_ld=no
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
|
|
||||||
ld_shlibs=yes
|
|
||||||
if test "$with_gnu_ld" = yes; then
|
|
||||||
# Set some defaults for GNU ld with shared library support. These
|
|
||||||
# are reset later if shared libraries are not supported. Putting them
|
|
||||||
# here allows them to be overridden if necessary.
|
|
||||||
# Unlike libtool, we use -rpath here, not --rpath, since the documented
|
|
||||||
# option of GNU ld is called -rpath, not --rpath.
|
|
||||||
hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
|
|
||||||
case "$host_os" in
|
|
||||||
aix[3-9]*)
|
|
||||||
# On AIX/PPC, the GNU linker is very broken
|
|
||||||
if test "$host_cpu" != ia64; then
|
|
||||||
ld_shlibs=no
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
amigaos*)
|
|
||||||
hardcode_libdir_flag_spec='-L$libdir'
|
|
||||||
hardcode_minus_L=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 cannot use
|
|
||||||
# them.
|
|
||||||
ld_shlibs=no
|
|
||||||
;;
|
|
||||||
beos*)
|
|
||||||
if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then
|
|
||||||
:
|
|
||||||
else
|
|
||||||
ld_shlibs=no
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
cygwin* | mingw* | pw32* | cegcc*)
|
|
||||||
# hardcode_libdir_flag_spec is actually meaningless, as there is
|
|
||||||
# no search path for DLLs.
|
|
||||||
hardcode_libdir_flag_spec='-L$libdir'
|
|
||||||
if $LD --help 2>&1 | grep 'auto-import' > /dev/null; then
|
|
||||||
:
|
|
||||||
else
|
|
||||||
ld_shlibs=no
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
interix[3-9]*)
|
|
||||||
hardcode_direct=no
|
|
||||||
hardcode_libdir_flag_spec='${wl}-rpath,$libdir'
|
|
||||||
;;
|
|
||||||
gnu* | linux* | k*bsd*-gnu)
|
|
||||||
if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then
|
|
||||||
:
|
|
||||||
else
|
|
||||||
ld_shlibs=no
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
netbsd*)
|
|
||||||
;;
|
|
||||||
solaris*)
|
|
||||||
if $LD -v 2>&1 | grep 'BFD 2\.8' > /dev/null; then
|
|
||||||
ld_shlibs=no
|
|
||||||
elif $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then
|
|
||||||
:
|
|
||||||
else
|
|
||||||
ld_shlibs=no
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*)
|
|
||||||
case `$LD -v 2>&1` in
|
|
||||||
*\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*)
|
|
||||||
ld_shlibs=no
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then
|
|
||||||
hardcode_libdir_flag_spec='`test -z "$SCOABSPATH" && echo ${wl}-rpath,$libdir`'
|
|
||||||
else
|
|
||||||
ld_shlibs=no
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
sunos4*)
|
|
||||||
hardcode_direct=yes
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
if $LD --help 2>&1 | grep ': supported targets:.* elf' > /dev/null; then
|
|
||||||
:
|
|
||||||
else
|
|
||||||
ld_shlibs=no
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
if test "$ld_shlibs" = no; then
|
|
||||||
hardcode_libdir_flag_spec=
|
|
||||||
fi
|
|
||||||
else
|
|
||||||
case "$host_os" in
|
|
||||||
aix3*)
|
|
||||||
# Note: this linker hardcodes the directories in LIBPATH if there
|
|
||||||
# are no directories specified by -L.
|
|
||||||
hardcode_minus_L=yes
|
|
||||||
if test "$GCC" = yes; then
|
|
||||||
# Neither direct hardcoding nor static linking is supported with a
|
|
||||||
# broken collect2.
|
|
||||||
hardcode_direct=unsupported
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
aix[4-9]*)
|
|
||||||
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
|
|
||||||
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].*|aix[5-9]*)
|
|
||||||
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
|
|
||||||
fi
|
|
||||||
hardcode_direct=yes
|
|
||||||
hardcode_libdir_separator=':'
|
|
||||||
if test "$GCC" = yes; then
|
|
||||||
case $host_os in aix4.[012]|aix4.[012].*)
|
|
||||||
collect2name=`${CC} -print-prog-name=collect2`
|
|
||||||
if test -f "$collect2name" && \
|
|
||||||
strings "$collect2name" | grep resolve_lib_name >/dev/null
|
|
||||||
then
|
|
||||||
# We have reworked collect2
|
|
||||||
:
|
|
||||||
else
|
|
||||||
# We have old collect2
|
|
||||||
hardcode_direct=unsupported
|
|
||||||
hardcode_minus_L=yes
|
|
||||||
hardcode_libdir_flag_spec='-L$libdir'
|
|
||||||
hardcode_libdir_separator=
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
# Begin _LT_AC_SYS_LIBPATH_AIX.
|
|
||||||
echo 'int main () { return 0; }' > conftest.c
|
|
||||||
${CC} ${LDFLAGS} conftest.c -o conftest
|
|
||||||
aix_libpath=`dump -H conftest 2>/dev/null | sed -n -e '/Import File Strings/,/^$/ { /^0/ { s/^0 *\(.*\)$/\1/; p; }
|
|
||||||
}'`
|
|
||||||
if test -z "$aix_libpath"; then
|
|
||||||
aix_libpath=`dump -HX64 conftest 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
|
|
||||||
rm -f conftest.c conftest
|
|
||||||
# End _LT_AC_SYS_LIBPATH_AIX.
|
|
||||||
if test "$aix_use_runtimelinking" = yes; then
|
|
||||||
hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath"
|
|
||||||
else
|
|
||||||
if test "$host_cpu" = ia64; then
|
|
||||||
hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib'
|
|
||||||
else
|
|
||||||
hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath"
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
amigaos*)
|
|
||||||
hardcode_libdir_flag_spec='-L$libdir'
|
|
||||||
hardcode_minus_L=yes
|
|
||||||
# see comment about different semantics on the GNU ld section
|
|
||||||
ld_shlibs=no
|
|
||||||
;;
|
|
||||||
bsdi[45]*)
|
|
||||||
;;
|
|
||||||
cygwin* | mingw* | pw32* | cegcc*)
|
|
||||||
# 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.
|
|
||||||
hardcode_libdir_flag_spec=' '
|
|
||||||
libext=lib
|
|
||||||
;;
|
|
||||||
darwin* | rhapsody*)
|
|
||||||
hardcode_direct=no
|
|
||||||
if test "$GCC" = yes ; then
|
|
||||||
:
|
|
||||||
else
|
|
||||||
case $cc_basename in
|
|
||||||
xlc*)
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
ld_shlibs=no
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
dgux*)
|
|
||||||
hardcode_libdir_flag_spec='-L$libdir'
|
|
||||||
;;
|
|
||||||
freebsd1*)
|
|
||||||
ld_shlibs=no
|
|
||||||
;;
|
|
||||||
freebsd2.2*)
|
|
||||||
hardcode_libdir_flag_spec='-R$libdir'
|
|
||||||
hardcode_direct=yes
|
|
||||||
;;
|
|
||||||
freebsd2*)
|
|
||||||
hardcode_direct=yes
|
|
||||||
hardcode_minus_L=yes
|
|
||||||
;;
|
|
||||||
freebsd* | dragonfly*)
|
|
||||||
hardcode_libdir_flag_spec='-R$libdir'
|
|
||||||
hardcode_direct=yes
|
|
||||||
;;
|
|
||||||
hpux9*)
|
|
||||||
hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir'
|
|
||||||
hardcode_libdir_separator=:
|
|
||||||
hardcode_direct=yes
|
|
||||||
# hardcode_minus_L: Not really in the search PATH,
|
|
||||||
# but as the default location of the library.
|
|
||||||
hardcode_minus_L=yes
|
|
||||||
;;
|
|
||||||
hpux10*)
|
|
||||||
if test "$with_gnu_ld" = no; then
|
|
||||||
hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir'
|
|
||||||
hardcode_libdir_separator=:
|
|
||||||
hardcode_direct=yes
|
|
||||||
# hardcode_minus_L: Not really in the search PATH,
|
|
||||||
# but as the default location of the library.
|
|
||||||
hardcode_minus_L=yes
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
hpux11*)
|
|
||||||
if test "$with_gnu_ld" = no; then
|
|
||||||
hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir'
|
|
||||||
hardcode_libdir_separator=:
|
|
||||||
case $host_cpu in
|
|
||||||
hppa*64*|ia64*)
|
|
||||||
hardcode_direct=no
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
hardcode_direct=yes
|
|
||||||
# hardcode_minus_L: Not really in the search PATH,
|
|
||||||
# but as the default location of the library.
|
|
||||||
hardcode_minus_L=yes
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
irix5* | irix6* | nonstopux*)
|
|
||||||
hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
|
|
||||||
hardcode_libdir_separator=:
|
|
||||||
;;
|
|
||||||
netbsd*)
|
|
||||||
hardcode_libdir_flag_spec='-R$libdir'
|
|
||||||
hardcode_direct=yes
|
|
||||||
;;
|
|
||||||
newsos6)
|
|
||||||
hardcode_direct=yes
|
|
||||||
hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
|
|
||||||
hardcode_libdir_separator=:
|
|
||||||
;;
|
|
||||||
openbsd*)
|
|
||||||
if test -f /usr/libexec/ld.so; then
|
|
||||||
hardcode_direct=yes
|
|
||||||
if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
|
|
||||||
hardcode_libdir_flag_spec='${wl}-rpath,$libdir'
|
|
||||||
else
|
|
||||||
case "$host_os" in
|
|
||||||
openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*)
|
|
||||||
hardcode_libdir_flag_spec='-R$libdir'
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
hardcode_libdir_flag_spec='${wl}-rpath,$libdir'
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
else
|
|
||||||
ld_shlibs=no
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
os2*)
|
|
||||||
hardcode_libdir_flag_spec='-L$libdir'
|
|
||||||
hardcode_minus_L=yes
|
|
||||||
;;
|
|
||||||
osf3*)
|
|
||||||
hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
|
|
||||||
hardcode_libdir_separator=:
|
|
||||||
;;
|
|
||||||
osf4* | osf5*)
|
|
||||||
if test "$GCC" = yes; then
|
|
||||||
hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
|
|
||||||
else
|
|
||||||
# Both cc and cxx compiler support -rpath directly
|
|
||||||
hardcode_libdir_flag_spec='-rpath $libdir'
|
|
||||||
fi
|
|
||||||
hardcode_libdir_separator=:
|
|
||||||
;;
|
|
||||||
solaris*)
|
|
||||||
hardcode_libdir_flag_spec='-R$libdir'
|
|
||||||
;;
|
|
||||||
sunos4*)
|
|
||||||
hardcode_libdir_flag_spec='-L$libdir'
|
|
||||||
hardcode_direct=yes
|
|
||||||
hardcode_minus_L=yes
|
|
||||||
;;
|
|
||||||
sysv4)
|
|
||||||
case $host_vendor in
|
|
||||||
sni)
|
|
||||||
hardcode_direct=yes # is this really true???
|
|
||||||
;;
|
|
||||||
siemens)
|
|
||||||
hardcode_direct=no
|
|
||||||
;;
|
|
||||||
motorola)
|
|
||||||
hardcode_direct=no #Motorola manual says yes, but my tests say they lie
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
sysv4.3*)
|
|
||||||
;;
|
|
||||||
sysv4*MP*)
|
|
||||||
if test -d /usr/nec; then
|
|
||||||
ld_shlibs=yes
|
|
||||||
fi
|
|
||||||
;;
|
|
||||||
sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*)
|
|
||||||
;;
|
|
||||||
sysv5* | sco3.2v5* | sco5v6*)
|
|
||||||
hardcode_libdir_flag_spec='`test -z "$SCOABSPATH" && echo ${wl}-R,$libdir`'
|
|
||||||
hardcode_libdir_separator=':'
|
|
||||||
;;
|
|
||||||
uts4*)
|
|
||||||
hardcode_libdir_flag_spec='-L$libdir'
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
ld_shlibs=no
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
|
|
||||||
# Check dynamic linker characteristics
|
|
||||||
# Code taken from libtool.m4's _LT_SYS_DYNAMIC_LINKER.
|
|
||||||
# Unlike libtool.m4, here we don't care about _all_ names of the library, but
|
|
||||||
# only about the one the linker finds when passed -lNAME. This is the last
|
|
||||||
# element of library_names_spec in libtool.m4, or possibly two of them if the
|
|
||||||
# linker has special search rules.
|
|
||||||
library_names_spec= # the last element of library_names_spec in libtool.m4
|
|
||||||
libname_spec='lib$name'
|
|
||||||
case "$host_os" in
|
|
||||||
aix3*)
|
|
||||||
library_names_spec='$libname.a'
|
|
||||||
;;
|
|
||||||
aix[4-9]*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
amigaos*)
|
|
||||||
library_names_spec='$libname.a'
|
|
||||||
;;
|
|
||||||
beos*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
bsdi[45]*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
cygwin* | mingw* | pw32* | cegcc*)
|
|
||||||
shrext=.dll
|
|
||||||
library_names_spec='$libname.dll.a $libname.lib'
|
|
||||||
;;
|
|
||||||
darwin* | rhapsody*)
|
|
||||||
shrext=.dylib
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
dgux*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
freebsd1*)
|
|
||||||
;;
|
|
||||||
freebsd* | dragonfly*)
|
|
||||||
case "$host_os" in
|
|
||||||
freebsd[123]*)
|
|
||||||
library_names_spec='$libname$shrext$versuffix' ;;
|
|
||||||
*)
|
|
||||||
library_names_spec='$libname$shrext' ;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
gnu*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
hpux9* | hpux10* | hpux11*)
|
|
||||||
case $host_cpu in
|
|
||||||
ia64*)
|
|
||||||
shrext=.so
|
|
||||||
;;
|
|
||||||
hppa*64*)
|
|
||||||
shrext=.sl
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
shrext=.sl
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
interix[3-9]*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
irix5* | irix6* | nonstopux*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
case "$host_os" in
|
|
||||||
irix5* | nonstopux*)
|
|
||||||
libsuff= shlibsuff=
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
case $LD in
|
|
||||||
*-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= ;;
|
|
||||||
*-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 ;;
|
|
||||||
*-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 ;;
|
|
||||||
*) libsuff= shlibsuff= ;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
linux*oldld* | linux*aout* | linux*coff*)
|
|
||||||
;;
|
|
||||||
linux* | k*bsd*-gnu)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
knetbsd*-gnu)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
netbsd*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
newsos6)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
nto-qnx*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
openbsd*)
|
|
||||||
library_names_spec='$libname$shrext$versuffix'
|
|
||||||
;;
|
|
||||||
os2*)
|
|
||||||
libname_spec='$name'
|
|
||||||
shrext=.dll
|
|
||||||
library_names_spec='$libname.a'
|
|
||||||
;;
|
|
||||||
osf3* | osf4* | osf5*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
rdos*)
|
|
||||||
;;
|
|
||||||
solaris*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
sunos4*)
|
|
||||||
library_names_spec='$libname$shrext$versuffix'
|
|
||||||
;;
|
|
||||||
sysv4 | sysv4.3*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
sysv4*MP*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
uts4*)
|
|
||||||
library_names_spec='$libname$shrext'
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
|
|
||||||
sed_quote_subst='s/\(["`$\\]\)/\\\1/g'
|
|
||||||
escaped_wl=`echo "X$wl" | sed -e 's/^X//' -e "$sed_quote_subst"`
|
|
||||||
shlibext=`echo "$shrext" | sed -e 's,^\.,,'`
|
|
||||||
escaped_libname_spec=`echo "X$libname_spec" | sed -e 's/^X//' -e "$sed_quote_subst"`
|
|
||||||
escaped_library_names_spec=`echo "X$library_names_spec" | sed -e 's/^X//' -e "$sed_quote_subst"`
|
|
||||||
escaped_hardcode_libdir_flag_spec=`echo "X$hardcode_libdir_flag_spec" | sed -e 's/^X//' -e "$sed_quote_subst"`
|
|
||||||
|
|
||||||
LC_ALL=C sed -e 's/^\([a-zA-Z0-9_]*\)=/acl_cv_\1=/' <<EOF
|
|
||||||
|
|
||||||
# How to pass a linker flag through the compiler.
|
|
||||||
wl="$escaped_wl"
|
|
||||||
|
|
||||||
# Static library suffix (normally "a").
|
|
||||||
libext="$libext"
|
|
||||||
|
|
||||||
# Shared library suffix (normally "so").
|
|
||||||
shlibext="$shlibext"
|
|
||||||
|
|
||||||
# Format of library name prefix.
|
|
||||||
libname_spec="$escaped_libname_spec"
|
|
||||||
|
|
||||||
# Library names that the linker finds when passed -lNAME.
|
|
||||||
library_names_spec="$escaped_library_names_spec"
|
|
||||||
|
|
||||||
# Flag to hardcode \$libdir into a binary during linking.
|
|
||||||
# This must work even if \$libdir does not exist.
|
|
||||||
hardcode_libdir_flag_spec="$escaped_hardcode_libdir_flag_spec"
|
|
||||||
|
|
||||||
# Whether we need a single -rpath flag with a separated argument.
|
|
||||||
hardcode_libdir_separator="$hardcode_libdir_separator"
|
|
||||||
|
|
||||||
# Set to yes if using DIR/libNAME.so during linking hardcodes DIR into the
|
|
||||||
# resulting binary.
|
|
||||||
hardcode_direct="$hardcode_direct"
|
|
||||||
|
|
||||||
# Set to yes if using the -LDIR flag during linking hardcodes DIR into the
|
|
||||||
# resulting binary.
|
|
||||||
hardcode_minus_L="$hardcode_minus_L"
|
|
||||||
|
|
||||||
EOF
|
|
||||||
1807
build-aux/config.sub
vendored
1807
build-aux/config.sub
vendored
File diff suppressed because it is too large
Load Diff
@@ -1,791 +0,0 @@
|
|||||||
#! /bin/sh
|
|
||||||
# depcomp - compile a program generating dependencies as side-effects
|
|
||||||
|
|
||||||
scriptversion=2013-05-30.07; # UTC
|
|
||||||
|
|
||||||
# Copyright (C) 1999-2014 Free Software Foundation, Inc.
|
|
||||||
|
|
||||||
# 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, 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, see <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
# 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.
|
|
||||||
|
|
||||||
# Originally written by Alexandre Oliva <oliva@dcc.unicamp.br>.
|
|
||||||
|
|
||||||
case $1 in
|
|
||||||
'')
|
|
||||||
echo "$0: No command. Try '$0 --help' for more information." 1>&2
|
|
||||||
exit 1;
|
|
||||||
;;
|
|
||||||
-h | --h*)
|
|
||||||
cat <<\EOF
|
|
||||||
Usage: depcomp [--help] [--version] PROGRAM [ARGS]
|
|
||||||
|
|
||||||
Run PROGRAMS ARGS to compile a file, generating dependencies
|
|
||||||
as side-effects.
|
|
||||||
|
|
||||||
Environment variables:
|
|
||||||
depmode Dependency tracking mode.
|
|
||||||
source Source file read by 'PROGRAMS ARGS'.
|
|
||||||
object Object file output by 'PROGRAMS ARGS'.
|
|
||||||
DEPDIR directory where to store dependencies.
|
|
||||||
depfile Dependency file to output.
|
|
||||||
tmpdepfile Temporary file to use when outputting dependencies.
|
|
||||||
libtool Whether libtool is used (yes/no).
|
|
||||||
|
|
||||||
Report bugs to <bug-automake@gnu.org>.
|
|
||||||
EOF
|
|
||||||
exit $?
|
|
||||||
;;
|
|
||||||
-v | --v*)
|
|
||||||
echo "depcomp $scriptversion"
|
|
||||||
exit $?
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
|
|
||||||
# Get the directory component of the given path, and save it in the
|
|
||||||
# global variables '$dir'. Note that this directory component will
|
|
||||||
# be either empty or ending with a '/' character. This is deliberate.
|
|
||||||
set_dir_from ()
|
|
||||||
{
|
|
||||||
case $1 in
|
|
||||||
*/*) dir=`echo "$1" | sed -e 's|/[^/]*$|/|'`;;
|
|
||||||
*) dir=;;
|
|
||||||
esac
|
|
||||||
}
|
|
||||||
|
|
||||||
# Get the suffix-stripped basename of the given path, and save it the
|
|
||||||
# global variable '$base'.
|
|
||||||
set_base_from ()
|
|
||||||
{
|
|
||||||
base=`echo "$1" | sed -e 's|^.*/||' -e 's/\.[^.]*$//'`
|
|
||||||
}
|
|
||||||
|
|
||||||
# If no dependency file was actually created by the compiler invocation,
|
|
||||||
# we still have to create a dummy depfile, to avoid errors with the
|
|
||||||
# Makefile "include basename.Plo" scheme.
|
|
||||||
make_dummy_depfile ()
|
|
||||||
{
|
|
||||||
echo "#dummy" > "$depfile"
|
|
||||||
}
|
|
||||||
|
|
||||||
# Factor out some common post-processing of the generated depfile.
|
|
||||||
# Requires the auxiliary global variable '$tmpdepfile' to be set.
|
|
||||||
aix_post_process_depfile ()
|
|
||||||
{
|
|
||||||
# If the compiler actually managed to produce a dependency file,
|
|
||||||
# post-process it.
|
|
||||||
if test -f "$tmpdepfile"; then
|
|
||||||
# Each line is of the form 'foo.o: dependency.h'.
|
|
||||||
# Do two passes, one to just change these to
|
|
||||||
# $object: dependency.h
|
|
||||||
# and one to simply output
|
|
||||||
# dependency.h:
|
|
||||||
# which is needed to avoid the deleted-header problem.
|
|
||||||
{ sed -e "s,^.*\.[$lower]*:,$object:," < "$tmpdepfile"
|
|
||||||
sed -e "s,^.*\.[$lower]*:[$tab ]*,," -e 's,$,:,' < "$tmpdepfile"
|
|
||||||
} > "$depfile"
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
else
|
|
||||||
make_dummy_depfile
|
|
||||||
fi
|
|
||||||
}
|
|
||||||
|
|
||||||
# A tabulation character.
|
|
||||||
tab=' '
|
|
||||||
# A newline character.
|
|
||||||
nl='
|
|
||||||
'
|
|
||||||
# Character ranges might be problematic outside the C locale.
|
|
||||||
# These definitions help.
|
|
||||||
upper=ABCDEFGHIJKLMNOPQRSTUVWXYZ
|
|
||||||
lower=abcdefghijklmnopqrstuvwxyz
|
|
||||||
digits=0123456789
|
|
||||||
alpha=${upper}${lower}
|
|
||||||
|
|
||||||
if test -z "$depmode" || test -z "$source" || test -z "$object"; then
|
|
||||||
echo "depcomp: Variables source, object and depmode must be set" 1>&2
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
|
|
||||||
# Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po.
|
|
||||||
depfile=${depfile-`echo "$object" |
|
|
||||||
sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`}
|
|
||||||
tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`}
|
|
||||||
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
|
|
||||||
# Avoid interferences from the environment.
|
|
||||||
gccflag= dashmflag=
|
|
||||||
|
|
||||||
# Some modes work just like other modes, but use different flags. We
|
|
||||||
# parameterize here, but still list the modes in the big case below,
|
|
||||||
# to make depend.m4 easier to write. Note that we *cannot* use a case
|
|
||||||
# here, because this file can only contain one case statement.
|
|
||||||
if test "$depmode" = hp; then
|
|
||||||
# HP compiler uses -M and no extra arg.
|
|
||||||
gccflag=-M
|
|
||||||
depmode=gcc
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test "$depmode" = dashXmstdout; then
|
|
||||||
# This is just like dashmstdout with a different argument.
|
|
||||||
dashmflag=-xM
|
|
||||||
depmode=dashmstdout
|
|
||||||
fi
|
|
||||||
|
|
||||||
cygpath_u="cygpath -u -f -"
|
|
||||||
if test "$depmode" = msvcmsys; then
|
|
||||||
# This is just like msvisualcpp but w/o cygpath translation.
|
|
||||||
# Just convert the backslash-escaped backslashes to single forward
|
|
||||||
# slashes to satisfy depend.m4
|
|
||||||
cygpath_u='sed s,\\\\,/,g'
|
|
||||||
depmode=msvisualcpp
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test "$depmode" = msvc7msys; then
|
|
||||||
# This is just like msvc7 but w/o cygpath translation.
|
|
||||||
# Just convert the backslash-escaped backslashes to single forward
|
|
||||||
# slashes to satisfy depend.m4
|
|
||||||
cygpath_u='sed s,\\\\,/,g'
|
|
||||||
depmode=msvc7
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test "$depmode" = xlc; then
|
|
||||||
# IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information.
|
|
||||||
gccflag=-qmakedep=gcc,-MF
|
|
||||||
depmode=gcc
|
|
||||||
fi
|
|
||||||
|
|
||||||
case "$depmode" in
|
|
||||||
gcc3)
|
|
||||||
## gcc 3 implements dependency tracking that does exactly what
|
|
||||||
## we want. Yay! Note: for some reason libtool 1.4 doesn't like
|
|
||||||
## it if -MD -MP comes after the -MF stuff. Hmm.
|
|
||||||
## Unfortunately, FreeBSD c89 acceptance of flags depends upon
|
|
||||||
## the command line argument order; so add the flags where they
|
|
||||||
## appear in depend2.am. Note that the slowdown incurred here
|
|
||||||
## affects only configure: in makefiles, %FASTDEP% shortcuts this.
|
|
||||||
for arg
|
|
||||||
do
|
|
||||||
case $arg in
|
|
||||||
-c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;;
|
|
||||||
*) set fnord "$@" "$arg" ;;
|
|
||||||
esac
|
|
||||||
shift # fnord
|
|
||||||
shift # $arg
|
|
||||||
done
|
|
||||||
"$@"
|
|
||||||
stat=$?
|
|
||||||
if test $stat -ne 0; then
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
exit $stat
|
|
||||||
fi
|
|
||||||
mv "$tmpdepfile" "$depfile"
|
|
||||||
;;
|
|
||||||
|
|
||||||
gcc)
|
|
||||||
## Note that this doesn't just cater to obsosete pre-3.x GCC compilers.
|
|
||||||
## but also to in-use compilers like IMB xlc/xlC and the HP C compiler.
|
|
||||||
## (see the conditional assignment to $gccflag above).
|
|
||||||
## There are various ways to get dependency output from gcc. Here's
|
|
||||||
## why we pick this rather obscure method:
|
|
||||||
## - Don't want to use -MD because we'd like the dependencies to end
|
|
||||||
## up in a subdir. Having to rename by hand is ugly.
|
|
||||||
## (We might end up doing this anyway to support other compilers.)
|
|
||||||
## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like
|
|
||||||
## -MM, not -M (despite what the docs say). Also, it might not be
|
|
||||||
## supported by the other compilers which use the 'gcc' depmode.
|
|
||||||
## - Using -M directly means running the compiler twice (even worse
|
|
||||||
## than renaming).
|
|
||||||
if test -z "$gccflag"; then
|
|
||||||
gccflag=-MD,
|
|
||||||
fi
|
|
||||||
"$@" -Wp,"$gccflag$tmpdepfile"
|
|
||||||
stat=$?
|
|
||||||
if test $stat -ne 0; then
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
exit $stat
|
|
||||||
fi
|
|
||||||
rm -f "$depfile"
|
|
||||||
echo "$object : \\" > "$depfile"
|
|
||||||
# The second -e expression handles DOS-style file names with drive
|
|
||||||
# letters.
|
|
||||||
sed -e 's/^[^:]*: / /' \
|
|
||||||
-e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile"
|
|
||||||
## This next piece of magic avoids the "deleted header file" problem.
|
|
||||||
## The problem is that when a header file which appears in a .P file
|
|
||||||
## is deleted, the dependency causes make to die (because there is
|
|
||||||
## typically no way to rebuild the header). We avoid this by adding
|
|
||||||
## dummy dependencies for each header file. Too bad gcc doesn't do
|
|
||||||
## this for us directly.
|
|
||||||
## Some versions of gcc put a space before the ':'. On the theory
|
|
||||||
## that the space means something, we add a space to the output as
|
|
||||||
## well. hp depmode also adds that space, but also prefixes the VPATH
|
|
||||||
## to the object. Take care to not repeat it in the output.
|
|
||||||
## Some versions of the HPUX 10.20 sed can't process this invocation
|
|
||||||
## correctly. Breaking it into two sed invocations is a workaround.
|
|
||||||
tr ' ' "$nl" < "$tmpdepfile" \
|
|
||||||
| sed -e 's/^\\$//' -e '/^$/d' -e "s|.*$object$||" -e '/:$/d' \
|
|
||||||
| sed -e 's/$/ :/' >> "$depfile"
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
;;
|
|
||||||
|
|
||||||
hp)
|
|
||||||
# This case exists only to let depend.m4 do its work. It works by
|
|
||||||
# looking at the text of this script. This case will never be run,
|
|
||||||
# since it is checked for above.
|
|
||||||
exit 1
|
|
||||||
;;
|
|
||||||
|
|
||||||
sgi)
|
|
||||||
if test "$libtool" = yes; then
|
|
||||||
"$@" "-Wp,-MDupdate,$tmpdepfile"
|
|
||||||
else
|
|
||||||
"$@" -MDupdate "$tmpdepfile"
|
|
||||||
fi
|
|
||||||
stat=$?
|
|
||||||
if test $stat -ne 0; then
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
exit $stat
|
|
||||||
fi
|
|
||||||
rm -f "$depfile"
|
|
||||||
|
|
||||||
if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files
|
|
||||||
echo "$object : \\" > "$depfile"
|
|
||||||
# Clip off the initial element (the dependent). Don't try to be
|
|
||||||
# clever and replace this with sed code, as IRIX sed won't handle
|
|
||||||
# lines with more than a fixed number of characters (4096 in
|
|
||||||
# IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines;
|
|
||||||
# the IRIX cc adds comments like '#:fec' to the end of the
|
|
||||||
# dependency line.
|
|
||||||
tr ' ' "$nl" < "$tmpdepfile" \
|
|
||||||
| sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' \
|
|
||||||
| tr "$nl" ' ' >> "$depfile"
|
|
||||||
echo >> "$depfile"
|
|
||||||
# The second pass generates a dummy entry for each header file.
|
|
||||||
tr ' ' "$nl" < "$tmpdepfile" \
|
|
||||||
| sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \
|
|
||||||
>> "$depfile"
|
|
||||||
else
|
|
||||||
make_dummy_depfile
|
|
||||||
fi
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
;;
|
|
||||||
|
|
||||||
xlc)
|
|
||||||
# This case exists only to let depend.m4 do its work. It works by
|
|
||||||
# looking at the text of this script. This case will never be run,
|
|
||||||
# since it is checked for above.
|
|
||||||
exit 1
|
|
||||||
;;
|
|
||||||
|
|
||||||
aix)
|
|
||||||
# The C for AIX Compiler uses -M and outputs the dependencies
|
|
||||||
# in a .u file. In older versions, this file always lives in the
|
|
||||||
# current directory. Also, the AIX compiler puts '$object:' at the
|
|
||||||
# start of each line; $object doesn't have directory information.
|
|
||||||
# Version 6 uses the directory in both cases.
|
|
||||||
set_dir_from "$object"
|
|
||||||
set_base_from "$object"
|
|
||||||
if test "$libtool" = yes; then
|
|
||||||
tmpdepfile1=$dir$base.u
|
|
||||||
tmpdepfile2=$base.u
|
|
||||||
tmpdepfile3=$dir.libs/$base.u
|
|
||||||
"$@" -Wc,-M
|
|
||||||
else
|
|
||||||
tmpdepfile1=$dir$base.u
|
|
||||||
tmpdepfile2=$dir$base.u
|
|
||||||
tmpdepfile3=$dir$base.u
|
|
||||||
"$@" -M
|
|
||||||
fi
|
|
||||||
stat=$?
|
|
||||||
if test $stat -ne 0; then
|
|
||||||
rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
|
|
||||||
exit $stat
|
|
||||||
fi
|
|
||||||
|
|
||||||
for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
|
|
||||||
do
|
|
||||||
test -f "$tmpdepfile" && break
|
|
||||||
done
|
|
||||||
aix_post_process_depfile
|
|
||||||
;;
|
|
||||||
|
|
||||||
tcc)
|
|
||||||
# tcc (Tiny C Compiler) understand '-MD -MF file' since version 0.9.26
|
|
||||||
# FIXME: That version still under development at the moment of writing.
|
|
||||||
# Make that this statement remains true also for stable, released
|
|
||||||
# versions.
|
|
||||||
# It will wrap lines (doesn't matter whether long or short) with a
|
|
||||||
# trailing '\', as in:
|
|
||||||
#
|
|
||||||
# foo.o : \
|
|
||||||
# foo.c \
|
|
||||||
# foo.h \
|
|
||||||
#
|
|
||||||
# It will put a trailing '\' even on the last line, and will use leading
|
|
||||||
# spaces rather than leading tabs (at least since its commit 0394caf7
|
|
||||||
# "Emit spaces for -MD").
|
|
||||||
"$@" -MD -MF "$tmpdepfile"
|
|
||||||
stat=$?
|
|
||||||
if test $stat -ne 0; then
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
exit $stat
|
|
||||||
fi
|
|
||||||
rm -f "$depfile"
|
|
||||||
# Each non-empty line is of the form 'foo.o : \' or ' dep.h \'.
|
|
||||||
# We have to change lines of the first kind to '$object: \'.
|
|
||||||
sed -e "s|.*:|$object :|" < "$tmpdepfile" > "$depfile"
|
|
||||||
# And for each line of the second kind, we have to emit a 'dep.h:'
|
|
||||||
# dummy dependency, to avoid the deleted-header problem.
|
|
||||||
sed -n -e 's|^ *\(.*\) *\\$|\1:|p' < "$tmpdepfile" >> "$depfile"
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
;;
|
|
||||||
|
|
||||||
## The order of this option in the case statement is important, since the
|
|
||||||
## shell code in configure will try each of these formats in the order
|
|
||||||
## listed in this file. A plain '-MD' option would be understood by many
|
|
||||||
## compilers, so we must ensure this comes after the gcc and icc options.
|
|
||||||
pgcc)
|
|
||||||
# Portland's C compiler understands '-MD'.
|
|
||||||
# Will always output deps to 'file.d' where file is the root name of the
|
|
||||||
# source file under compilation, even if file resides in a subdirectory.
|
|
||||||
# The object file name does not affect the name of the '.d' file.
|
|
||||||
# pgcc 10.2 will output
|
|
||||||
# foo.o: sub/foo.c sub/foo.h
|
|
||||||
# and will wrap long lines using '\' :
|
|
||||||
# foo.o: sub/foo.c ... \
|
|
||||||
# sub/foo.h ... \
|
|
||||||
# ...
|
|
||||||
set_dir_from "$object"
|
|
||||||
# Use the source, not the object, to determine the base name, since
|
|
||||||
# that's sadly what pgcc will do too.
|
|
||||||
set_base_from "$source"
|
|
||||||
tmpdepfile=$base.d
|
|
||||||
|
|
||||||
# For projects that build the same source file twice into different object
|
|
||||||
# files, the pgcc approach of using the *source* file root name can cause
|
|
||||||
# problems in parallel builds. Use a locking strategy to avoid stomping on
|
|
||||||
# the same $tmpdepfile.
|
|
||||||
lockdir=$base.d-lock
|
|
||||||
trap "
|
|
||||||
echo '$0: caught signal, cleaning up...' >&2
|
|
||||||
rmdir '$lockdir'
|
|
||||||
exit 1
|
|
||||||
" 1 2 13 15
|
|
||||||
numtries=100
|
|
||||||
i=$numtries
|
|
||||||
while test $i -gt 0; do
|
|
||||||
# mkdir is a portable test-and-set.
|
|
||||||
if mkdir "$lockdir" 2>/dev/null; then
|
|
||||||
# This process acquired the lock.
|
|
||||||
"$@" -MD
|
|
||||||
stat=$?
|
|
||||||
# Release the lock.
|
|
||||||
rmdir "$lockdir"
|
|
||||||
break
|
|
||||||
else
|
|
||||||
# If the lock is being held by a different process, wait
|
|
||||||
# until the winning process is done or we timeout.
|
|
||||||
while test -d "$lockdir" && test $i -gt 0; do
|
|
||||||
sleep 1
|
|
||||||
i=`expr $i - 1`
|
|
||||||
done
|
|
||||||
fi
|
|
||||||
i=`expr $i - 1`
|
|
||||||
done
|
|
||||||
trap - 1 2 13 15
|
|
||||||
if test $i -le 0; then
|
|
||||||
echo "$0: failed to acquire lock after $numtries attempts" >&2
|
|
||||||
echo "$0: check lockdir '$lockdir'" >&2
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test $stat -ne 0; then
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
exit $stat
|
|
||||||
fi
|
|
||||||
rm -f "$depfile"
|
|
||||||
# Each line is of the form `foo.o: dependent.h',
|
|
||||||
# or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'.
|
|
||||||
# Do two passes, one to just change these to
|
|
||||||
# `$object: dependent.h' and one to simply `dependent.h:'.
|
|
||||||
sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile"
|
|
||||||
# Some versions of the HPUX 10.20 sed can't process this invocation
|
|
||||||
# correctly. Breaking it into two sed invocations is a workaround.
|
|
||||||
sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" \
|
|
||||||
| sed -e 's/$/ :/' >> "$depfile"
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
;;
|
|
||||||
|
|
||||||
hp2)
|
|
||||||
# The "hp" stanza above does not work with aCC (C++) and HP's ia64
|
|
||||||
# compilers, which have integrated preprocessors. The correct option
|
|
||||||
# to use with these is +Maked; it writes dependencies to a file named
|
|
||||||
# 'foo.d', which lands next to the object file, wherever that
|
|
||||||
# happens to be.
|
|
||||||
# Much of this is similar to the tru64 case; see comments there.
|
|
||||||
set_dir_from "$object"
|
|
||||||
set_base_from "$object"
|
|
||||||
if test "$libtool" = yes; then
|
|
||||||
tmpdepfile1=$dir$base.d
|
|
||||||
tmpdepfile2=$dir.libs/$base.d
|
|
||||||
"$@" -Wc,+Maked
|
|
||||||
else
|
|
||||||
tmpdepfile1=$dir$base.d
|
|
||||||
tmpdepfile2=$dir$base.d
|
|
||||||
"$@" +Maked
|
|
||||||
fi
|
|
||||||
stat=$?
|
|
||||||
if test $stat -ne 0; then
|
|
||||||
rm -f "$tmpdepfile1" "$tmpdepfile2"
|
|
||||||
exit $stat
|
|
||||||
fi
|
|
||||||
|
|
||||||
for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2"
|
|
||||||
do
|
|
||||||
test -f "$tmpdepfile" && break
|
|
||||||
done
|
|
||||||
if test -f "$tmpdepfile"; then
|
|
||||||
sed -e "s,^.*\.[$lower]*:,$object:," "$tmpdepfile" > "$depfile"
|
|
||||||
# Add 'dependent.h:' lines.
|
|
||||||
sed -ne '2,${
|
|
||||||
s/^ *//
|
|
||||||
s/ \\*$//
|
|
||||||
s/$/:/
|
|
||||||
p
|
|
||||||
}' "$tmpdepfile" >> "$depfile"
|
|
||||||
else
|
|
||||||
make_dummy_depfile
|
|
||||||
fi
|
|
||||||
rm -f "$tmpdepfile" "$tmpdepfile2"
|
|
||||||
;;
|
|
||||||
|
|
||||||
tru64)
|
|
||||||
# The Tru64 compiler uses -MD to generate dependencies as a side
|
|
||||||
# effect. 'cc -MD -o foo.o ...' puts the dependencies into 'foo.o.d'.
|
|
||||||
# At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put
|
|
||||||
# dependencies in 'foo.d' instead, so we check for that too.
|
|
||||||
# Subdirectories are respected.
|
|
||||||
set_dir_from "$object"
|
|
||||||
set_base_from "$object"
|
|
||||||
|
|
||||||
if test "$libtool" = yes; then
|
|
||||||
# Libtool generates 2 separate objects for the 2 libraries. These
|
|
||||||
# two compilations output dependencies in $dir.libs/$base.o.d and
|
|
||||||
# in $dir$base.o.d. We have to check for both files, because
|
|
||||||
# one of the two compilations can be disabled. We should prefer
|
|
||||||
# $dir$base.o.d over $dir.libs/$base.o.d because the latter is
|
|
||||||
# automatically cleaned when .libs/ is deleted, while ignoring
|
|
||||||
# the former would cause a distcleancheck panic.
|
|
||||||
tmpdepfile1=$dir$base.o.d # libtool 1.5
|
|
||||||
tmpdepfile2=$dir.libs/$base.o.d # Likewise.
|
|
||||||
tmpdepfile3=$dir.libs/$base.d # Compaq CCC V6.2-504
|
|
||||||
"$@" -Wc,-MD
|
|
||||||
else
|
|
||||||
tmpdepfile1=$dir$base.d
|
|
||||||
tmpdepfile2=$dir$base.d
|
|
||||||
tmpdepfile3=$dir$base.d
|
|
||||||
"$@" -MD
|
|
||||||
fi
|
|
||||||
|
|
||||||
stat=$?
|
|
||||||
if test $stat -ne 0; then
|
|
||||||
rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
|
|
||||||
exit $stat
|
|
||||||
fi
|
|
||||||
|
|
||||||
for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
|
|
||||||
do
|
|
||||||
test -f "$tmpdepfile" && break
|
|
||||||
done
|
|
||||||
# Same post-processing that is required for AIX mode.
|
|
||||||
aix_post_process_depfile
|
|
||||||
;;
|
|
||||||
|
|
||||||
msvc7)
|
|
||||||
if test "$libtool" = yes; then
|
|
||||||
showIncludes=-Wc,-showIncludes
|
|
||||||
else
|
|
||||||
showIncludes=-showIncludes
|
|
||||||
fi
|
|
||||||
"$@" $showIncludes > "$tmpdepfile"
|
|
||||||
stat=$?
|
|
||||||
grep -v '^Note: including file: ' "$tmpdepfile"
|
|
||||||
if test $stat -ne 0; then
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
exit $stat
|
|
||||||
fi
|
|
||||||
rm -f "$depfile"
|
|
||||||
echo "$object : \\" > "$depfile"
|
|
||||||
# The first sed program below extracts the file names and escapes
|
|
||||||
# backslashes for cygpath. The second sed program outputs the file
|
|
||||||
# name when reading, but also accumulates all include files in the
|
|
||||||
# hold buffer in order to output them again at the end. This only
|
|
||||||
# works with sed implementations that can handle large buffers.
|
|
||||||
sed < "$tmpdepfile" -n '
|
|
||||||
/^Note: including file: *\(.*\)/ {
|
|
||||||
s//\1/
|
|
||||||
s/\\/\\\\/g
|
|
||||||
p
|
|
||||||
}' | $cygpath_u | sort -u | sed -n '
|
|
||||||
s/ /\\ /g
|
|
||||||
s/\(.*\)/'"$tab"'\1 \\/p
|
|
||||||
s/.\(.*\) \\/\1:/
|
|
||||||
H
|
|
||||||
$ {
|
|
||||||
s/.*/'"$tab"'/
|
|
||||||
G
|
|
||||||
p
|
|
||||||
}' >> "$depfile"
|
|
||||||
echo >> "$depfile" # make sure the fragment doesn't end with a backslash
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
;;
|
|
||||||
|
|
||||||
msvc7msys)
|
|
||||||
# This case exists only to let depend.m4 do its work. It works by
|
|
||||||
# looking at the text of this script. This case will never be run,
|
|
||||||
# since it is checked for above.
|
|
||||||
exit 1
|
|
||||||
;;
|
|
||||||
|
|
||||||
#nosideeffect)
|
|
||||||
# This comment above is used by automake to tell side-effect
|
|
||||||
# dependency tracking mechanisms from slower ones.
|
|
||||||
|
|
||||||
dashmstdout)
|
|
||||||
# Important note: in order to support this mode, a compiler *must*
|
|
||||||
# always write the preprocessed file to stdout, regardless of -o.
|
|
||||||
"$@" || exit $?
|
|
||||||
|
|
||||||
# Remove the call to Libtool.
|
|
||||||
if test "$libtool" = yes; then
|
|
||||||
while test "X$1" != 'X--mode=compile'; do
|
|
||||||
shift
|
|
||||||
done
|
|
||||||
shift
|
|
||||||
fi
|
|
||||||
|
|
||||||
# Remove '-o $object'.
|
|
||||||
IFS=" "
|
|
||||||
for arg
|
|
||||||
do
|
|
||||||
case $arg in
|
|
||||||
-o)
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
$object)
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
set fnord "$@" "$arg"
|
|
||||||
shift # fnord
|
|
||||||
shift # $arg
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
|
|
||||||
test -z "$dashmflag" && dashmflag=-M
|
|
||||||
# Require at least two characters before searching for ':'
|
|
||||||
# in the target name. This is to cope with DOS-style filenames:
|
|
||||||
# a dependency such as 'c:/foo/bar' could be seen as target 'c' otherwise.
|
|
||||||
"$@" $dashmflag |
|
|
||||||
sed "s|^[$tab ]*[^:$tab ][^:][^:]*:[$tab ]*|$object: |" > "$tmpdepfile"
|
|
||||||
rm -f "$depfile"
|
|
||||||
cat < "$tmpdepfile" > "$depfile"
|
|
||||||
# Some versions of the HPUX 10.20 sed can't process this sed invocation
|
|
||||||
# correctly. Breaking it into two sed invocations is a workaround.
|
|
||||||
tr ' ' "$nl" < "$tmpdepfile" \
|
|
||||||
| sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' \
|
|
||||||
| sed -e 's/$/ :/' >> "$depfile"
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
;;
|
|
||||||
|
|
||||||
dashXmstdout)
|
|
||||||
# This case only exists to satisfy depend.m4. It is never actually
|
|
||||||
# run, as this mode is specially recognized in the preamble.
|
|
||||||
exit 1
|
|
||||||
;;
|
|
||||||
|
|
||||||
makedepend)
|
|
||||||
"$@" || exit $?
|
|
||||||
# Remove any Libtool call
|
|
||||||
if test "$libtool" = yes; then
|
|
||||||
while test "X$1" != 'X--mode=compile'; do
|
|
||||||
shift
|
|
||||||
done
|
|
||||||
shift
|
|
||||||
fi
|
|
||||||
# X makedepend
|
|
||||||
shift
|
|
||||||
cleared=no eat=no
|
|
||||||
for arg
|
|
||||||
do
|
|
||||||
case $cleared in
|
|
||||||
no)
|
|
||||||
set ""; shift
|
|
||||||
cleared=yes ;;
|
|
||||||
esac
|
|
||||||
if test $eat = yes; then
|
|
||||||
eat=no
|
|
||||||
continue
|
|
||||||
fi
|
|
||||||
case "$arg" in
|
|
||||||
-D*|-I*)
|
|
||||||
set fnord "$@" "$arg"; shift ;;
|
|
||||||
# Strip any option that makedepend may not understand. Remove
|
|
||||||
# the object too, otherwise makedepend will parse it as a source file.
|
|
||||||
-arch)
|
|
||||||
eat=yes ;;
|
|
||||||
-*|$object)
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
set fnord "$@" "$arg"; shift ;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
obj_suffix=`echo "$object" | sed 's/^.*\././'`
|
|
||||||
touch "$tmpdepfile"
|
|
||||||
${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@"
|
|
||||||
rm -f "$depfile"
|
|
||||||
# makedepend may prepend the VPATH from the source file name to the object.
|
|
||||||
# No need to regex-escape $object, excess matching of '.' is harmless.
|
|
||||||
sed "s|^.*\($object *:\)|\1|" "$tmpdepfile" > "$depfile"
|
|
||||||
# Some versions of the HPUX 10.20 sed can't process the last invocation
|
|
||||||
# correctly. Breaking it into two sed invocations is a workaround.
|
|
||||||
sed '1,2d' "$tmpdepfile" \
|
|
||||||
| tr ' ' "$nl" \
|
|
||||||
| sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' \
|
|
||||||
| sed -e 's/$/ :/' >> "$depfile"
|
|
||||||
rm -f "$tmpdepfile" "$tmpdepfile".bak
|
|
||||||
;;
|
|
||||||
|
|
||||||
cpp)
|
|
||||||
# Important note: in order to support this mode, a compiler *must*
|
|
||||||
# always write the preprocessed file to stdout.
|
|
||||||
"$@" || exit $?
|
|
||||||
|
|
||||||
# Remove the call to Libtool.
|
|
||||||
if test "$libtool" = yes; then
|
|
||||||
while test "X$1" != 'X--mode=compile'; do
|
|
||||||
shift
|
|
||||||
done
|
|
||||||
shift
|
|
||||||
fi
|
|
||||||
|
|
||||||
# Remove '-o $object'.
|
|
||||||
IFS=" "
|
|
||||||
for arg
|
|
||||||
do
|
|
||||||
case $arg in
|
|
||||||
-o)
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
$object)
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
set fnord "$@" "$arg"
|
|
||||||
shift # fnord
|
|
||||||
shift # $arg
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
|
|
||||||
"$@" -E \
|
|
||||||
| sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \
|
|
||||||
-e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \
|
|
||||||
| sed '$ s: \\$::' > "$tmpdepfile"
|
|
||||||
rm -f "$depfile"
|
|
||||||
echo "$object : \\" > "$depfile"
|
|
||||||
cat < "$tmpdepfile" >> "$depfile"
|
|
||||||
sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile"
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
;;
|
|
||||||
|
|
||||||
msvisualcpp)
|
|
||||||
# Important note: in order to support this mode, a compiler *must*
|
|
||||||
# always write the preprocessed file to stdout.
|
|
||||||
"$@" || exit $?
|
|
||||||
|
|
||||||
# Remove the call to Libtool.
|
|
||||||
if test "$libtool" = yes; then
|
|
||||||
while test "X$1" != 'X--mode=compile'; do
|
|
||||||
shift
|
|
||||||
done
|
|
||||||
shift
|
|
||||||
fi
|
|
||||||
|
|
||||||
IFS=" "
|
|
||||||
for arg
|
|
||||||
do
|
|
||||||
case "$arg" in
|
|
||||||
-o)
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
$object)
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
"-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI")
|
|
||||||
set fnord "$@"
|
|
||||||
shift
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
set fnord "$@" "$arg"
|
|
||||||
shift
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
"$@" -E 2>/dev/null |
|
|
||||||
sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile"
|
|
||||||
rm -f "$depfile"
|
|
||||||
echo "$object : \\" > "$depfile"
|
|
||||||
sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::'"$tab"'\1 \\:p' >> "$depfile"
|
|
||||||
echo "$tab" >> "$depfile"
|
|
||||||
sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile"
|
|
||||||
rm -f "$tmpdepfile"
|
|
||||||
;;
|
|
||||||
|
|
||||||
msvcmsys)
|
|
||||||
# This case exists only to let depend.m4 do its work. It works by
|
|
||||||
# looking at the text of this script. This case will never be run,
|
|
||||||
# since it is checked for above.
|
|
||||||
exit 1
|
|
||||||
;;
|
|
||||||
|
|
||||||
none)
|
|
||||||
exec "$@"
|
|
||||||
;;
|
|
||||||
|
|
||||||
*)
|
|
||||||
echo "Unknown depmode $depmode" 1>&2
|
|
||||||
exit 1
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
|
|
||||||
exit 0
|
|
||||||
|
|
||||||
# Local Variables:
|
|
||||||
# mode: shell-script
|
|
||||||
# sh-indentation: 2
|
|
||||||
# eval: (add-hook 'write-file-hooks 'time-stamp)
|
|
||||||
# time-stamp-start: "scriptversion="
|
|
||||||
# time-stamp-format: "%:y-%02m-%02d.%02H"
|
|
||||||
# time-stamp-time-zone: "UTC"
|
|
||||||
# time-stamp-end: "; # UTC"
|
|
||||||
# End:
|
|
||||||
@@ -1,501 +0,0 @@
|
|||||||
#!/bin/sh
|
|
||||||
# install - install a program, script, or datafile
|
|
||||||
|
|
||||||
scriptversion=2013-12-25.23; # UTC
|
|
||||||
|
|
||||||
# This originates from X11R5 (mit/util/scripts/install.sh), which was
|
|
||||||
# later released in X11R6 (xc/config/util/install.sh) with the
|
|
||||||
# following copyright and license.
|
|
||||||
#
|
|
||||||
# Copyright (C) 1994 X Consortium
|
|
||||||
#
|
|
||||||
# Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
||||||
# of this software and associated documentation files (the "Software"), to
|
|
||||||
# deal in the Software without restriction, including without limitation the
|
|
||||||
# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
|
||||||
# sell copies of the Software, and to permit persons to whom the Software is
|
|
||||||
# furnished to do so, subject to the following conditions:
|
|
||||||
#
|
|
||||||
# The above copyright notice and this permission notice shall be included in
|
|
||||||
# all copies or substantial portions of the Software.
|
|
||||||
#
|
|
||||||
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
||||||
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
||||||
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
||||||
# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
|
|
||||||
# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
|
|
||||||
# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
||||||
#
|
|
||||||
# Except as contained in this notice, the name of the X Consortium shall not
|
|
||||||
# be used in advertising or otherwise to promote the sale, use or other deal-
|
|
||||||
# ings in this Software without prior written authorization from the X Consor-
|
|
||||||
# tium.
|
|
||||||
#
|
|
||||||
#
|
|
||||||
# FSF changes to this file are in the public domain.
|
|
||||||
#
|
|
||||||
# Calling this script install-sh is preferred over install.sh, to prevent
|
|
||||||
# 'make' implicit rules from creating a file called install from it
|
|
||||||
# when there is no Makefile.
|
|
||||||
#
|
|
||||||
# This script is compatible with the BSD install script, but was written
|
|
||||||
# from scratch.
|
|
||||||
|
|
||||||
tab=' '
|
|
||||||
nl='
|
|
||||||
'
|
|
||||||
IFS=" $tab$nl"
|
|
||||||
|
|
||||||
# Set DOITPROG to "echo" to test this script.
|
|
||||||
|
|
||||||
doit=${DOITPROG-}
|
|
||||||
doit_exec=${doit:-exec}
|
|
||||||
|
|
||||||
# Put in absolute file names if you don't have them in your path;
|
|
||||||
# or use environment vars.
|
|
||||||
|
|
||||||
chgrpprog=${CHGRPPROG-chgrp}
|
|
||||||
chmodprog=${CHMODPROG-chmod}
|
|
||||||
chownprog=${CHOWNPROG-chown}
|
|
||||||
cmpprog=${CMPPROG-cmp}
|
|
||||||
cpprog=${CPPROG-cp}
|
|
||||||
mkdirprog=${MKDIRPROG-mkdir}
|
|
||||||
mvprog=${MVPROG-mv}
|
|
||||||
rmprog=${RMPROG-rm}
|
|
||||||
stripprog=${STRIPPROG-strip}
|
|
||||||
|
|
||||||
posix_mkdir=
|
|
||||||
|
|
||||||
# Desired mode of installed file.
|
|
||||||
mode=0755
|
|
||||||
|
|
||||||
chgrpcmd=
|
|
||||||
chmodcmd=$chmodprog
|
|
||||||
chowncmd=
|
|
||||||
mvcmd=$mvprog
|
|
||||||
rmcmd="$rmprog -f"
|
|
||||||
stripcmd=
|
|
||||||
|
|
||||||
src=
|
|
||||||
dst=
|
|
||||||
dir_arg=
|
|
||||||
dst_arg=
|
|
||||||
|
|
||||||
copy_on_change=false
|
|
||||||
is_target_a_directory=possibly
|
|
||||||
|
|
||||||
usage="\
|
|
||||||
Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE
|
|
||||||
or: $0 [OPTION]... SRCFILES... DIRECTORY
|
|
||||||
or: $0 [OPTION]... -t DIRECTORY SRCFILES...
|
|
||||||
or: $0 [OPTION]... -d DIRECTORIES...
|
|
||||||
|
|
||||||
In the 1st form, copy SRCFILE to DSTFILE.
|
|
||||||
In the 2nd and 3rd, copy all SRCFILES to DIRECTORY.
|
|
||||||
In the 4th, create DIRECTORIES.
|
|
||||||
|
|
||||||
Options:
|
|
||||||
--help display this help and exit.
|
|
||||||
--version display version info and exit.
|
|
||||||
|
|
||||||
-c (ignored)
|
|
||||||
-C install only if different (preserve the last data modification time)
|
|
||||||
-d create directories instead of installing files.
|
|
||||||
-g GROUP $chgrpprog installed files to GROUP.
|
|
||||||
-m MODE $chmodprog installed files to MODE.
|
|
||||||
-o USER $chownprog installed files to USER.
|
|
||||||
-s $stripprog installed files.
|
|
||||||
-t DIRECTORY install into DIRECTORY.
|
|
||||||
-T report an error if DSTFILE is a directory.
|
|
||||||
|
|
||||||
Environment variables override the default commands:
|
|
||||||
CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG
|
|
||||||
RMPROG STRIPPROG
|
|
||||||
"
|
|
||||||
|
|
||||||
while test $# -ne 0; do
|
|
||||||
case $1 in
|
|
||||||
-c) ;;
|
|
||||||
|
|
||||||
-C) copy_on_change=true;;
|
|
||||||
|
|
||||||
-d) dir_arg=true;;
|
|
||||||
|
|
||||||
-g) chgrpcmd="$chgrpprog $2"
|
|
||||||
shift;;
|
|
||||||
|
|
||||||
--help) echo "$usage"; exit $?;;
|
|
||||||
|
|
||||||
-m) mode=$2
|
|
||||||
case $mode in
|
|
||||||
*' '* | *"$tab"* | *"$nl"* | *'*'* | *'?'* | *'['*)
|
|
||||||
echo "$0: invalid mode: $mode" >&2
|
|
||||||
exit 1;;
|
|
||||||
esac
|
|
||||||
shift;;
|
|
||||||
|
|
||||||
-o) chowncmd="$chownprog $2"
|
|
||||||
shift;;
|
|
||||||
|
|
||||||
-s) stripcmd=$stripprog;;
|
|
||||||
|
|
||||||
-t)
|
|
||||||
is_target_a_directory=always
|
|
||||||
dst_arg=$2
|
|
||||||
# Protect names problematic for 'test' and other utilities.
|
|
||||||
case $dst_arg in
|
|
||||||
-* | [=\(\)!]) dst_arg=./$dst_arg;;
|
|
||||||
esac
|
|
||||||
shift;;
|
|
||||||
|
|
||||||
-T) is_target_a_directory=never;;
|
|
||||||
|
|
||||||
--version) echo "$0 $scriptversion"; exit $?;;
|
|
||||||
|
|
||||||
--) shift
|
|
||||||
break;;
|
|
||||||
|
|
||||||
-*) echo "$0: invalid option: $1" >&2
|
|
||||||
exit 1;;
|
|
||||||
|
|
||||||
*) break;;
|
|
||||||
esac
|
|
||||||
shift
|
|
||||||
done
|
|
||||||
|
|
||||||
# We allow the use of options -d and -T together, by making -d
|
|
||||||
# take the precedence; this is for compatibility with GNU install.
|
|
||||||
|
|
||||||
if test -n "$dir_arg"; then
|
|
||||||
if test -n "$dst_arg"; then
|
|
||||||
echo "$0: target directory not allowed when installing a directory." >&2
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then
|
|
||||||
# When -d is used, all remaining arguments are directories to create.
|
|
||||||
# When -t is used, the destination is already specified.
|
|
||||||
# Otherwise, the last argument is the destination. Remove it from $@.
|
|
||||||
for arg
|
|
||||||
do
|
|
||||||
if test -n "$dst_arg"; then
|
|
||||||
# $@ is not empty: it contains at least $arg.
|
|
||||||
set fnord "$@" "$dst_arg"
|
|
||||||
shift # fnord
|
|
||||||
fi
|
|
||||||
shift # arg
|
|
||||||
dst_arg=$arg
|
|
||||||
# Protect names problematic for 'test' and other utilities.
|
|
||||||
case $dst_arg in
|
|
||||||
-* | [=\(\)!]) dst_arg=./$dst_arg;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test $# -eq 0; then
|
|
||||||
if test -z "$dir_arg"; then
|
|
||||||
echo "$0: no input file specified." >&2
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
# It's OK to call 'install-sh -d' without argument.
|
|
||||||
# This can happen when creating conditional directories.
|
|
||||||
exit 0
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test -z "$dir_arg"; then
|
|
||||||
if test $# -gt 1 || test "$is_target_a_directory" = always; then
|
|
||||||
if test ! -d "$dst_arg"; then
|
|
||||||
echo "$0: $dst_arg: Is not a directory." >&2
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test -z "$dir_arg"; then
|
|
||||||
do_exit='(exit $ret); exit $ret'
|
|
||||||
trap "ret=129; $do_exit" 1
|
|
||||||
trap "ret=130; $do_exit" 2
|
|
||||||
trap "ret=141; $do_exit" 13
|
|
||||||
trap "ret=143; $do_exit" 15
|
|
||||||
|
|
||||||
# Set umask so as not to create temps with too-generous modes.
|
|
||||||
# However, 'strip' requires both read and write access to temps.
|
|
||||||
case $mode in
|
|
||||||
# Optimize common cases.
|
|
||||||
*644) cp_umask=133;;
|
|
||||||
*755) cp_umask=22;;
|
|
||||||
|
|
||||||
*[0-7])
|
|
||||||
if test -z "$stripcmd"; then
|
|
||||||
u_plus_rw=
|
|
||||||
else
|
|
||||||
u_plus_rw='% 200'
|
|
||||||
fi
|
|
||||||
cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;
|
|
||||||
*)
|
|
||||||
if test -z "$stripcmd"; then
|
|
||||||
u_plus_rw=
|
|
||||||
else
|
|
||||||
u_plus_rw=,u+rw
|
|
||||||
fi
|
|
||||||
cp_umask=$mode$u_plus_rw;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
|
|
||||||
for src
|
|
||||||
do
|
|
||||||
# Protect names problematic for 'test' and other utilities.
|
|
||||||
case $src in
|
|
||||||
-* | [=\(\)!]) src=./$src;;
|
|
||||||
esac
|
|
||||||
|
|
||||||
if test -n "$dir_arg"; then
|
|
||||||
dst=$src
|
|
||||||
dstdir=$dst
|
|
||||||
test -d "$dstdir"
|
|
||||||
dstdir_status=$?
|
|
||||||
else
|
|
||||||
|
|
||||||
# Waiting for this to be detected by the "$cpprog $src $dsttmp" command
|
|
||||||
# might cause directories to be created, which would be especially bad
|
|
||||||
# if $src (and thus $dsttmp) contains '*'.
|
|
||||||
if test ! -f "$src" && test ! -d "$src"; then
|
|
||||||
echo "$0: $src does not exist." >&2
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test -z "$dst_arg"; then
|
|
||||||
echo "$0: no destination specified." >&2
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
dst=$dst_arg
|
|
||||||
|
|
||||||
# If destination is a directory, append the input filename; won't work
|
|
||||||
# if double slashes aren't ignored.
|
|
||||||
if test -d "$dst"; then
|
|
||||||
if test "$is_target_a_directory" = never; then
|
|
||||||
echo "$0: $dst_arg: Is a directory" >&2
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
dstdir=$dst
|
|
||||||
dst=$dstdir/`basename "$src"`
|
|
||||||
dstdir_status=0
|
|
||||||
else
|
|
||||||
dstdir=`dirname "$dst"`
|
|
||||||
test -d "$dstdir"
|
|
||||||
dstdir_status=$?
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
|
|
||||||
obsolete_mkdir_used=false
|
|
||||||
|
|
||||||
if test $dstdir_status != 0; then
|
|
||||||
case $posix_mkdir in
|
|
||||||
'')
|
|
||||||
# Create intermediate dirs using mode 755 as modified by the umask.
|
|
||||||
# This is like FreeBSD 'install' as of 1997-10-28.
|
|
||||||
umask=`umask`
|
|
||||||
case $stripcmd.$umask in
|
|
||||||
# Optimize common cases.
|
|
||||||
*[2367][2367]) mkdir_umask=$umask;;
|
|
||||||
.*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;
|
|
||||||
|
|
||||||
*[0-7])
|
|
||||||
mkdir_umask=`expr $umask + 22 \
|
|
||||||
- $umask % 100 % 40 + $umask % 20 \
|
|
||||||
- $umask % 10 % 4 + $umask % 2
|
|
||||||
`;;
|
|
||||||
*) mkdir_umask=$umask,go-w;;
|
|
||||||
esac
|
|
||||||
|
|
||||||
# With -d, create the new directory with the user-specified mode.
|
|
||||||
# Otherwise, rely on $mkdir_umask.
|
|
||||||
if test -n "$dir_arg"; then
|
|
||||||
mkdir_mode=-m$mode
|
|
||||||
else
|
|
||||||
mkdir_mode=
|
|
||||||
fi
|
|
||||||
|
|
||||||
posix_mkdir=false
|
|
||||||
case $umask in
|
|
||||||
*[123567][0-7][0-7])
|
|
||||||
# POSIX mkdir -p sets u+wx bits regardless of umask, which
|
|
||||||
# is incompatible with FreeBSD 'install' when (umask & 300) != 0.
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$
|
|
||||||
trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0
|
|
||||||
|
|
||||||
if (umask $mkdir_umask &&
|
|
||||||
exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1
|
|
||||||
then
|
|
||||||
if test -z "$dir_arg" || {
|
|
||||||
# Check for POSIX incompatibilities with -m.
|
|
||||||
# HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or
|
|
||||||
# other-writable bit of parent directory when it shouldn't.
|
|
||||||
# FreeBSD 6.1 mkdir -m -p sets mode of existing directory.
|
|
||||||
ls_ld_tmpdir=`ls -ld "$tmpdir"`
|
|
||||||
case $ls_ld_tmpdir in
|
|
||||||
d????-?r-*) different_mode=700;;
|
|
||||||
d????-?--*) different_mode=755;;
|
|
||||||
*) false;;
|
|
||||||
esac &&
|
|
||||||
$mkdirprog -m$different_mode -p -- "$tmpdir" && {
|
|
||||||
ls_ld_tmpdir_1=`ls -ld "$tmpdir"`
|
|
||||||
test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1"
|
|
||||||
}
|
|
||||||
}
|
|
||||||
then posix_mkdir=:
|
|
||||||
fi
|
|
||||||
rmdir "$tmpdir/d" "$tmpdir"
|
|
||||||
else
|
|
||||||
# Remove any dirs left behind by ancient mkdir implementations.
|
|
||||||
rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null
|
|
||||||
fi
|
|
||||||
trap '' 0;;
|
|
||||||
esac;;
|
|
||||||
esac
|
|
||||||
|
|
||||||
if
|
|
||||||
$posix_mkdir && (
|
|
||||||
umask $mkdir_umask &&
|
|
||||||
$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir"
|
|
||||||
)
|
|
||||||
then :
|
|
||||||
else
|
|
||||||
|
|
||||||
# The umask is ridiculous, or mkdir does not conform to POSIX,
|
|
||||||
# or it failed possibly due to a race condition. Create the
|
|
||||||
# directory the slow way, step by step, checking for races as we go.
|
|
||||||
|
|
||||||
case $dstdir in
|
|
||||||
/*) prefix='/';;
|
|
||||||
[-=\(\)!]*) prefix='./';;
|
|
||||||
*) prefix='';;
|
|
||||||
esac
|
|
||||||
|
|
||||||
oIFS=$IFS
|
|
||||||
IFS=/
|
|
||||||
set -f
|
|
||||||
set fnord $dstdir
|
|
||||||
shift
|
|
||||||
set +f
|
|
||||||
IFS=$oIFS
|
|
||||||
|
|
||||||
prefixes=
|
|
||||||
|
|
||||||
for d
|
|
||||||
do
|
|
||||||
test X"$d" = X && continue
|
|
||||||
|
|
||||||
prefix=$prefix$d
|
|
||||||
if test -d "$prefix"; then
|
|
||||||
prefixes=
|
|
||||||
else
|
|
||||||
if $posix_mkdir; then
|
|
||||||
(umask=$mkdir_umask &&
|
|
||||||
$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break
|
|
||||||
# Don't fail if two instances are running concurrently.
|
|
||||||
test -d "$prefix" || exit 1
|
|
||||||
else
|
|
||||||
case $prefix in
|
|
||||||
*\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;;
|
|
||||||
*) qprefix=$prefix;;
|
|
||||||
esac
|
|
||||||
prefixes="$prefixes '$qprefix'"
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
prefix=$prefix/
|
|
||||||
done
|
|
||||||
|
|
||||||
if test -n "$prefixes"; then
|
|
||||||
# Don't fail if two instances are running concurrently.
|
|
||||||
(umask $mkdir_umask &&
|
|
||||||
eval "\$doit_exec \$mkdirprog $prefixes") ||
|
|
||||||
test -d "$dstdir" || exit 1
|
|
||||||
obsolete_mkdir_used=true
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test -n "$dir_arg"; then
|
|
||||||
{ test -z "$chowncmd" || $doit $chowncmd "$dst"; } &&
|
|
||||||
{ test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } &&
|
|
||||||
{ test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false ||
|
|
||||||
test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1
|
|
||||||
else
|
|
||||||
|
|
||||||
# Make a couple of temp file names in the proper directory.
|
|
||||||
dsttmp=$dstdir/_inst.$$_
|
|
||||||
rmtmp=$dstdir/_rm.$$_
|
|
||||||
|
|
||||||
# Trap to clean up those temp files at exit.
|
|
||||||
trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0
|
|
||||||
|
|
||||||
# Copy the file name to the temp name.
|
|
||||||
(umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") &&
|
|
||||||
|
|
||||||
# and set any options; do chmod last to preserve setuid bits.
|
|
||||||
#
|
|
||||||
# If any of these fail, we abort the whole thing. If we want to
|
|
||||||
# ignore errors from any of these, just make sure not to ignore
|
|
||||||
# errors from the above "$doit $cpprog $src $dsttmp" command.
|
|
||||||
#
|
|
||||||
{ test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } &&
|
|
||||||
{ test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } &&
|
|
||||||
{ test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } &&
|
|
||||||
{ test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } &&
|
|
||||||
|
|
||||||
# If -C, don't bother to copy if it wouldn't change the file.
|
|
||||||
if $copy_on_change &&
|
|
||||||
old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` &&
|
|
||||||
new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` &&
|
|
||||||
set -f &&
|
|
||||||
set X $old && old=:$2:$4:$5:$6 &&
|
|
||||||
set X $new && new=:$2:$4:$5:$6 &&
|
|
||||||
set +f &&
|
|
||||||
test "$old" = "$new" &&
|
|
||||||
$cmpprog "$dst" "$dsttmp" >/dev/null 2>&1
|
|
||||||
then
|
|
||||||
rm -f "$dsttmp"
|
|
||||||
else
|
|
||||||
# Rename the file to the real destination.
|
|
||||||
$doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null ||
|
|
||||||
|
|
||||||
# The rename failed, perhaps because mv can't rename something else
|
|
||||||
# to itself, or perhaps because mv is so ancient that it does not
|
|
||||||
# support -f.
|
|
||||||
{
|
|
||||||
# Now remove or move aside any old file at destination location.
|
|
||||||
# We try this two ways since rm can't unlink itself on some
|
|
||||||
# systems and the destination file might be busy for other
|
|
||||||
# reasons. In this case, the final cleanup might fail but the new
|
|
||||||
# file should still install successfully.
|
|
||||||
{
|
|
||||||
test ! -f "$dst" ||
|
|
||||||
$doit $rmcmd -f "$dst" 2>/dev/null ||
|
|
||||||
{ $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null &&
|
|
||||||
{ $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; }
|
|
||||||
} ||
|
|
||||||
{ echo "$0: cannot unlink or rename $dst" >&2
|
|
||||||
(exit 1); exit 1
|
|
||||||
}
|
|
||||||
} &&
|
|
||||||
|
|
||||||
# Now rename the file to the real destination.
|
|
||||||
$doit $mvcmd "$dsttmp" "$dst"
|
|
||||||
}
|
|
||||||
fi || exit 1
|
|
||||||
|
|
||||||
trap '' 0
|
|
||||||
fi
|
|
||||||
done
|
|
||||||
|
|
||||||
# Local variables:
|
|
||||||
# eval: (add-hook 'write-file-hooks 'time-stamp)
|
|
||||||
# time-stamp-start: "scriptversion="
|
|
||||||
# time-stamp-format: "%:y-%02m-%02d.%02H"
|
|
||||||
# time-stamp-time-zone: "UTC"
|
|
||||||
# time-stamp-end: "; # UTC"
|
|
||||||
# End:
|
|
||||||
11147
build-aux/ltmain.sh
11147
build-aux/ltmain.sh
File diff suppressed because it is too large
Load Diff
@@ -1,58 +0,0 @@
|
|||||||
#!/bin/sh
|
|
||||||
#
|
|
||||||
###############################################################################
|
|
||||||
#
|
|
||||||
# Wrapper for GNU groff to convert man pages to a few formats
|
|
||||||
#
|
|
||||||
# Usage: manconv.sh FORMAT [PAPER_SIZE] < in.1 > out.suffix
|
|
||||||
#
|
|
||||||
# FORMAT can be ascii, utf8, ps, or pdf. PAPER_SIZE can be anything that
|
|
||||||
# groff accepts, e.g. a4 or letter. See groff_font(5). PAPER_SIZE defaults
|
|
||||||
# to a4 and is used only when FORMAT is ps (PostScript) or pdf.
|
|
||||||
#
|
|
||||||
# Multiple man pages can be given at once e.g. to create a single PDF file
|
|
||||||
# with continuous page numbering.
|
|
||||||
#
|
|
||||||
###############################################################################
|
|
||||||
#
|
|
||||||
# Author: Lasse Collin
|
|
||||||
#
|
|
||||||
# This file has been put into the public domain.
|
|
||||||
# You can do whatever you want with this file.
|
|
||||||
#
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
FORMAT=$1
|
|
||||||
PAPER=${2-a4}
|
|
||||||
|
|
||||||
# Make PostScript and PDF output more readable:
|
|
||||||
# - Use 11 pt font instead of the default 10 pt.
|
|
||||||
# - Use larger paragraph spacing than the default 0.4v (man(7) only).
|
|
||||||
FONT=11
|
|
||||||
PD=0.8
|
|
||||||
|
|
||||||
SED_PD="
|
|
||||||
/^\\.TH /s/\$/\\
|
|
||||||
.PD $PD/
|
|
||||||
s/^\\.PD\$/.PD $PD/"
|
|
||||||
|
|
||||||
case $FORMAT in
|
|
||||||
ascii)
|
|
||||||
groff -t -mandoc -Tascii | col -bx
|
|
||||||
;;
|
|
||||||
utf8)
|
|
||||||
groff -t -mandoc -Tutf8 | col -bx
|
|
||||||
;;
|
|
||||||
ps)
|
|
||||||
sed "$SED_PD" | groff -dpaper=$PAPER -t -mandoc \
|
|
||||||
-rC1 -rS$FONT -Tps -P-p$PAPER
|
|
||||||
;;
|
|
||||||
pdf)
|
|
||||||
sed "$SED_PD" | groff -dpaper=$PAPER -t -mandoc \
|
|
||||||
-rC1 -rS$FONT -Tps -P-p$PAPER | ps2pdf - -
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
echo 'Invalid arguments' >&2
|
|
||||||
exit 1
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
@@ -1,215 +0,0 @@
|
|||||||
#! /bin/sh
|
|
||||||
# Common wrapper for a few potentially missing GNU programs.
|
|
||||||
|
|
||||||
scriptversion=2013-10-28.13; # UTC
|
|
||||||
|
|
||||||
# Copyright (C) 1996-2014 Free Software Foundation, Inc.
|
|
||||||
# Originally written by Fran,cois Pinard <pinard@iro.umontreal.ca>, 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, 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, see <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
# 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.
|
|
||||||
|
|
||||||
if test $# -eq 0; then
|
|
||||||
echo 1>&2 "Try '$0 --help' for more information"
|
|
||||||
exit 1
|
|
||||||
fi
|
|
||||||
|
|
||||||
case $1 in
|
|
||||||
|
|
||||||
--is-lightweight)
|
|
||||||
# Used by our autoconf macros to check whether the available missing
|
|
||||||
# script is modern enough.
|
|
||||||
exit 0
|
|
||||||
;;
|
|
||||||
|
|
||||||
--run)
|
|
||||||
# Back-compat with the calling convention used by older automake.
|
|
||||||
shift
|
|
||||||
;;
|
|
||||||
|
|
||||||
-h|--h|--he|--hel|--help)
|
|
||||||
echo "\
|
|
||||||
$0 [OPTION]... PROGRAM [ARGUMENT]...
|
|
||||||
|
|
||||||
Run 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due
|
|
||||||
to PROGRAM being missing or too old.
|
|
||||||
|
|
||||||
Options:
|
|
||||||
-h, --help display this help and exit
|
|
||||||
-v, --version output version information and exit
|
|
||||||
|
|
||||||
Supported PROGRAM values:
|
|
||||||
aclocal autoconf autoheader autom4te automake makeinfo
|
|
||||||
bison yacc flex lex help2man
|
|
||||||
|
|
||||||
Version suffixes to PROGRAM as well as the prefixes 'gnu-', 'gnu', and
|
|
||||||
'g' are ignored when checking the name.
|
|
||||||
|
|
||||||
Send bug reports to <bug-automake@gnu.org>."
|
|
||||||
exit $?
|
|
||||||
;;
|
|
||||||
|
|
||||||
-v|--v|--ve|--ver|--vers|--versi|--versio|--version)
|
|
||||||
echo "missing $scriptversion (GNU Automake)"
|
|
||||||
exit $?
|
|
||||||
;;
|
|
||||||
|
|
||||||
-*)
|
|
||||||
echo 1>&2 "$0: unknown '$1' option"
|
|
||||||
echo 1>&2 "Try '$0 --help' for more information"
|
|
||||||
exit 1
|
|
||||||
;;
|
|
||||||
|
|
||||||
esac
|
|
||||||
|
|
||||||
# Run the given program, remember its exit status.
|
|
||||||
"$@"; st=$?
|
|
||||||
|
|
||||||
# If it succeeded, we are done.
|
|
||||||
test $st -eq 0 && exit 0
|
|
||||||
|
|
||||||
# Also exit now if we it failed (or wasn't found), and '--version' was
|
|
||||||
# passed; such an option is passed most likely to detect whether the
|
|
||||||
# program is present and works.
|
|
||||||
case $2 in --version|--help) exit $st;; esac
|
|
||||||
|
|
||||||
# Exit code 63 means version mismatch. This often happens when the user
|
|
||||||
# tries to use an ancient version of a tool on a file that requires a
|
|
||||||
# minimum version.
|
|
||||||
if test $st -eq 63; then
|
|
||||||
msg="probably too old"
|
|
||||||
elif test $st -eq 127; then
|
|
||||||
# Program was missing.
|
|
||||||
msg="missing on your system"
|
|
||||||
else
|
|
||||||
# Program was found and executed, but failed. Give up.
|
|
||||||
exit $st
|
|
||||||
fi
|
|
||||||
|
|
||||||
perl_URL=http://www.perl.org/
|
|
||||||
flex_URL=http://flex.sourceforge.net/
|
|
||||||
gnu_software_URL=http://www.gnu.org/software
|
|
||||||
|
|
||||||
program_details ()
|
|
||||||
{
|
|
||||||
case $1 in
|
|
||||||
aclocal|automake)
|
|
||||||
echo "The '$1' program is part of the GNU Automake package:"
|
|
||||||
echo "<$gnu_software_URL/automake>"
|
|
||||||
echo "It also requires GNU Autoconf, GNU m4 and Perl in order to run:"
|
|
||||||
echo "<$gnu_software_URL/autoconf>"
|
|
||||||
echo "<$gnu_software_URL/m4/>"
|
|
||||||
echo "<$perl_URL>"
|
|
||||||
;;
|
|
||||||
autoconf|autom4te|autoheader)
|
|
||||||
echo "The '$1' program is part of the GNU Autoconf package:"
|
|
||||||
echo "<$gnu_software_URL/autoconf/>"
|
|
||||||
echo "It also requires GNU m4 and Perl in order to run:"
|
|
||||||
echo "<$gnu_software_URL/m4/>"
|
|
||||||
echo "<$perl_URL>"
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
}
|
|
||||||
|
|
||||||
give_advice ()
|
|
||||||
{
|
|
||||||
# Normalize program name to check for.
|
|
||||||
normalized_program=`echo "$1" | sed '
|
|
||||||
s/^gnu-//; t
|
|
||||||
s/^gnu//; t
|
|
||||||
s/^g//; t'`
|
|
||||||
|
|
||||||
printf '%s\n' "'$1' is $msg."
|
|
||||||
|
|
||||||
configure_deps="'configure.ac' or m4 files included by 'configure.ac'"
|
|
||||||
case $normalized_program in
|
|
||||||
autoconf*)
|
|
||||||
echo "You should only need it if you modified 'configure.ac',"
|
|
||||||
echo "or m4 files included by it."
|
|
||||||
program_details 'autoconf'
|
|
||||||
;;
|
|
||||||
autoheader*)
|
|
||||||
echo "You should only need it if you modified 'acconfig.h' or"
|
|
||||||
echo "$configure_deps."
|
|
||||||
program_details 'autoheader'
|
|
||||||
;;
|
|
||||||
automake*)
|
|
||||||
echo "You should only need it if you modified 'Makefile.am' or"
|
|
||||||
echo "$configure_deps."
|
|
||||||
program_details 'automake'
|
|
||||||
;;
|
|
||||||
aclocal*)
|
|
||||||
echo "You should only need it if you modified 'acinclude.m4' or"
|
|
||||||
echo "$configure_deps."
|
|
||||||
program_details 'aclocal'
|
|
||||||
;;
|
|
||||||
autom4te*)
|
|
||||||
echo "You might have modified some maintainer files that require"
|
|
||||||
echo "the 'autom4te' program to be rebuilt."
|
|
||||||
program_details 'autom4te'
|
|
||||||
;;
|
|
||||||
bison*|yacc*)
|
|
||||||
echo "You should only need it if you modified a '.y' file."
|
|
||||||
echo "You may want to install the GNU Bison package:"
|
|
||||||
echo "<$gnu_software_URL/bison/>"
|
|
||||||
;;
|
|
||||||
lex*|flex*)
|
|
||||||
echo "You should only need it if you modified a '.l' file."
|
|
||||||
echo "You may want to install the Fast Lexical Analyzer package:"
|
|
||||||
echo "<$flex_URL>"
|
|
||||||
;;
|
|
||||||
help2man*)
|
|
||||||
echo "You should only need it if you modified a dependency" \
|
|
||||||
"of a man page."
|
|
||||||
echo "You may want to install the GNU Help2man package:"
|
|
||||||
echo "<$gnu_software_URL/help2man/>"
|
|
||||||
;;
|
|
||||||
makeinfo*)
|
|
||||||
echo "You should only need it if you modified a '.texi' file, or"
|
|
||||||
echo "any other file indirectly affecting the aspect of the manual."
|
|
||||||
echo "You might want to install the Texinfo package:"
|
|
||||||
echo "<$gnu_software_URL/texinfo/>"
|
|
||||||
echo "The spurious makeinfo call might also be the consequence of"
|
|
||||||
echo "using a buggy 'make' (AIX, DU, IRIX), in which case you might"
|
|
||||||
echo "want to install GNU make:"
|
|
||||||
echo "<$gnu_software_URL/make/>"
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
echo "You might have modified some files without having the proper"
|
|
||||||
echo "tools for further handling them. Check the 'README' file, it"
|
|
||||||
echo "often tells you about the needed prerequisites for installing"
|
|
||||||
echo "this package. You may also peek at any GNU archive site, in"
|
|
||||||
echo "case some other package contains this missing '$1' program."
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
}
|
|
||||||
|
|
||||||
give_advice "$1" | sed -e '1s/^/WARNING: /' \
|
|
||||||
-e '2,$s/^/ /' >&2
|
|
||||||
|
|
||||||
# Propagate the correct exit status (expected to be 127 for a program
|
|
||||||
# not found, 63 for a program that failed due to version mismatch).
|
|
||||||
exit $st
|
|
||||||
|
|
||||||
# Local variables:
|
|
||||||
# eval: (add-hook 'write-file-hooks 'time-stamp)
|
|
||||||
# time-stamp-start: "scriptversion="
|
|
||||||
# time-stamp-format: "%:y-%02m-%02d.%02H"
|
|
||||||
# time-stamp-time-zone: "UTC"
|
|
||||||
# time-stamp-end: "; # UTC"
|
|
||||||
# End:
|
|
||||||
@@ -1,24 +0,0 @@
|
|||||||
#!/bin/sh
|
|
||||||
#
|
|
||||||
#############################################################################
|
|
||||||
#
|
|
||||||
# Get the version string from version.h and print it out without
|
|
||||||
# trailing newline. This makes it suitable for use in configure.ac.
|
|
||||||
#
|
|
||||||
#############################################################################
|
|
||||||
#
|
|
||||||
# Author: Lasse Collin
|
|
||||||
#
|
|
||||||
# This file has been put into the public domain.
|
|
||||||
# You can do whatever you want with this file.
|
|
||||||
#
|
|
||||||
#############################################################################
|
|
||||||
|
|
||||||
sed -n 's/LZMA_VERSION_STABILITY_ALPHA/alpha/
|
|
||||||
s/LZMA_VERSION_STABILITY_BETA/beta/
|
|
||||||
s/LZMA_VERSION_STABILITY_STABLE//
|
|
||||||
s/^#define LZMA_VERSION_[MPS][AIT][AJNT][A-Z]* //p' \
|
|
||||||
src/liblzma/api/lzma/version.h \
|
|
||||||
| tr '\n' '|' \
|
|
||||||
| sed 's/|/./; s/|/./; s/|//g' \
|
|
||||||
| tr -d '\r\n'
|
|
||||||
86
compress.c
Normal file
86
compress.c
Normal file
@@ -0,0 +1,86 @@
|
|||||||
|
/* compress.c -- compress a memory buffer
|
||||||
|
* Copyright (C) 1995-2005, 2014, 2016 Jean-loup Gailly, Mark Adler
|
||||||
|
* 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;
|
||||||
|
const uInt max = (uInt)-1;
|
||||||
|
uLong left;
|
||||||
|
|
||||||
|
left = *destLen;
|
||||||
|
*destLen = 0;
|
||||||
|
|
||||||
|
stream.zalloc = (alloc_func)0;
|
||||||
|
stream.zfree = (free_func)0;
|
||||||
|
stream.opaque = (voidpf)0;
|
||||||
|
|
||||||
|
err = deflateInit(&stream, level);
|
||||||
|
if (err != Z_OK) return err;
|
||||||
|
|
||||||
|
stream.next_out = dest;
|
||||||
|
stream.avail_out = 0;
|
||||||
|
stream.next_in = (z_const Bytef *)source;
|
||||||
|
stream.avail_in = 0;
|
||||||
|
|
||||||
|
do {
|
||||||
|
if (stream.avail_out == 0) {
|
||||||
|
stream.avail_out = left > (uLong)max ? max : (uInt)left;
|
||||||
|
left -= stream.avail_out;
|
||||||
|
}
|
||||||
|
if (stream.avail_in == 0) {
|
||||||
|
stream.avail_in = sourceLen > (uLong)max ? max : (uInt)sourceLen;
|
||||||
|
sourceLen -= stream.avail_in;
|
||||||
|
}
|
||||||
|
err = deflate(&stream, sourceLen ? Z_NO_FLUSH : Z_FINISH);
|
||||||
|
} while (err == Z_OK);
|
||||||
|
|
||||||
|
*destLen = stream.total_out;
|
||||||
|
deflateEnd(&stream);
|
||||||
|
return err == Z_STREAM_END ? Z_OK : 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) +
|
||||||
|
(sourceLen >> 25) + 13;
|
||||||
|
}
|
||||||
485
config.h.in
485
config.h.in
@@ -1,485 +0,0 @@
|
|||||||
/* config.h.in. Generated from configure.ac by autoheader. */
|
|
||||||
|
|
||||||
/* Define if building universal (internal helper macro) */
|
|
||||||
#undef AC_APPLE_UNIVERSAL_BUILD
|
|
||||||
|
|
||||||
/* How many MiB of RAM to assume if the real amount cannot be determined. */
|
|
||||||
#undef ASSUME_RAM
|
|
||||||
|
|
||||||
/* Define to 1 if translation of program messages to the user's native
|
|
||||||
language is requested. */
|
|
||||||
#undef ENABLE_NLS
|
|
||||||
|
|
||||||
/* Define to 1 if bswap_16 is available. */
|
|
||||||
#undef HAVE_BSWAP_16
|
|
||||||
|
|
||||||
/* Define to 1 if bswap_32 is available. */
|
|
||||||
#undef HAVE_BSWAP_32
|
|
||||||
|
|
||||||
/* Define to 1 if bswap_64 is available. */
|
|
||||||
#undef HAVE_BSWAP_64
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <byteswap.h> header file. */
|
|
||||||
#undef HAVE_BYTESWAP_H
|
|
||||||
|
|
||||||
/* Define to 1 if the system has the type `CC_SHA256_CTX'. */
|
|
||||||
#undef HAVE_CC_SHA256_CTX
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `CC_SHA256_Init' function. */
|
|
||||||
#undef HAVE_CC_SHA256_INIT
|
|
||||||
|
|
||||||
/* Define to 1 if you have the MacOS X function CFLocaleCopyCurrent in the
|
|
||||||
CoreFoundation framework. */
|
|
||||||
#undef HAVE_CFLOCALECOPYCURRENT
|
|
||||||
|
|
||||||
/* Define to 1 if you have the MacOS X function CFPreferencesCopyAppValue in
|
|
||||||
the CoreFoundation framework. */
|
|
||||||
#undef HAVE_CFPREFERENCESCOPYAPPVALUE
|
|
||||||
|
|
||||||
/* Define to 1 if crc32 integrity check is enabled. */
|
|
||||||
#undef HAVE_CHECK_CRC32
|
|
||||||
|
|
||||||
/* Define to 1 if crc64 integrity check is enabled. */
|
|
||||||
#undef HAVE_CHECK_CRC64
|
|
||||||
|
|
||||||
/* Define to 1 if sha256 integrity check is enabled. */
|
|
||||||
#undef HAVE_CHECK_SHA256
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `clock_gettime' function. */
|
|
||||||
#undef HAVE_CLOCK_GETTIME
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <CommonCrypto/CommonDigest.h> header file. */
|
|
||||||
#undef HAVE_COMMONCRYPTO_COMMONDIGEST_H
|
|
||||||
|
|
||||||
/* Define if the GNU dcgettext() function is already present or preinstalled.
|
|
||||||
*/
|
|
||||||
#undef HAVE_DCGETTEXT
|
|
||||||
|
|
||||||
/* Define to 1 if you have the declaration of `CLOCK_MONOTONIC', and to 0 if
|
|
||||||
you don't. */
|
|
||||||
#undef HAVE_DECL_CLOCK_MONOTONIC
|
|
||||||
|
|
||||||
/* Define to 1 if you have the declaration of `program_invocation_name', and
|
|
||||||
to 0 if you don't. */
|
|
||||||
#undef HAVE_DECL_PROGRAM_INVOCATION_NAME
|
|
||||||
|
|
||||||
/* Define to 1 if arm decoder is enabled. */
|
|
||||||
#undef HAVE_DECODER_ARM
|
|
||||||
|
|
||||||
/* Define to 1 if armthumb decoder is enabled. */
|
|
||||||
#undef HAVE_DECODER_ARMTHUMB
|
|
||||||
|
|
||||||
/* Define to 1 if delta decoder is enabled. */
|
|
||||||
#undef HAVE_DECODER_DELTA
|
|
||||||
|
|
||||||
/* Define to 1 if ia64 decoder is enabled. */
|
|
||||||
#undef HAVE_DECODER_IA64
|
|
||||||
|
|
||||||
/* Define to 1 if lzma1 decoder is enabled. */
|
|
||||||
#undef HAVE_DECODER_LZMA1
|
|
||||||
|
|
||||||
/* Define to 1 if lzma2 decoder is enabled. */
|
|
||||||
#undef HAVE_DECODER_LZMA2
|
|
||||||
|
|
||||||
/* Define to 1 if powerpc decoder is enabled. */
|
|
||||||
#undef HAVE_DECODER_POWERPC
|
|
||||||
|
|
||||||
/* Define to 1 if sparc decoder is enabled. */
|
|
||||||
#undef HAVE_DECODER_SPARC
|
|
||||||
|
|
||||||
/* Define to 1 if x86 decoder is enabled. */
|
|
||||||
#undef HAVE_DECODER_X86
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <dlfcn.h> header file. */
|
|
||||||
#undef HAVE_DLFCN_H
|
|
||||||
|
|
||||||
/* Define to 1 if arm encoder is enabled. */
|
|
||||||
#undef HAVE_ENCODER_ARM
|
|
||||||
|
|
||||||
/* Define to 1 if armthumb encoder is enabled. */
|
|
||||||
#undef HAVE_ENCODER_ARMTHUMB
|
|
||||||
|
|
||||||
/* Define to 1 if delta encoder is enabled. */
|
|
||||||
#undef HAVE_ENCODER_DELTA
|
|
||||||
|
|
||||||
/* Define to 1 if ia64 encoder is enabled. */
|
|
||||||
#undef HAVE_ENCODER_IA64
|
|
||||||
|
|
||||||
/* Define to 1 if lzma1 encoder is enabled. */
|
|
||||||
#undef HAVE_ENCODER_LZMA1
|
|
||||||
|
|
||||||
/* Define to 1 if lzma2 encoder is enabled. */
|
|
||||||
#undef HAVE_ENCODER_LZMA2
|
|
||||||
|
|
||||||
/* Define to 1 if powerpc encoder is enabled. */
|
|
||||||
#undef HAVE_ENCODER_POWERPC
|
|
||||||
|
|
||||||
/* Define to 1 if sparc encoder is enabled. */
|
|
||||||
#undef HAVE_ENCODER_SPARC
|
|
||||||
|
|
||||||
/* Define to 1 if x86 encoder is enabled. */
|
|
||||||
#undef HAVE_ENCODER_X86
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <fcntl.h> header file. */
|
|
||||||
#undef HAVE_FCNTL_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `futimens' function. */
|
|
||||||
#undef HAVE_FUTIMENS
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `futimes' function. */
|
|
||||||
#undef HAVE_FUTIMES
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `futimesat' function. */
|
|
||||||
#undef HAVE_FUTIMESAT
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <getopt.h> header file. */
|
|
||||||
#undef HAVE_GETOPT_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `getopt_long' function. */
|
|
||||||
#undef HAVE_GETOPT_LONG
|
|
||||||
|
|
||||||
/* Define if the GNU gettext() function is already present or preinstalled. */
|
|
||||||
#undef HAVE_GETTEXT
|
|
||||||
|
|
||||||
/* Define if you have the iconv() function and it works. */
|
|
||||||
#undef HAVE_ICONV
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <immintrin.h> header file. */
|
|
||||||
#undef HAVE_IMMINTRIN_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <inttypes.h> header file. */
|
|
||||||
#undef HAVE_INTTYPES_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <limits.h> header file. */
|
|
||||||
#undef HAVE_LIMITS_H
|
|
||||||
|
|
||||||
/* Define to 1 if mbrtowc and mbstate_t are properly declared. */
|
|
||||||
#undef HAVE_MBRTOWC
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <memory.h> header file. */
|
|
||||||
#undef HAVE_MEMORY_H
|
|
||||||
|
|
||||||
/* Define to 1 to enable bt2 match finder. */
|
|
||||||
#undef HAVE_MF_BT2
|
|
||||||
|
|
||||||
/* Define to 1 to enable bt3 match finder. */
|
|
||||||
#undef HAVE_MF_BT3
|
|
||||||
|
|
||||||
/* Define to 1 to enable bt4 match finder. */
|
|
||||||
#undef HAVE_MF_BT4
|
|
||||||
|
|
||||||
/* Define to 1 to enable hc3 match finder. */
|
|
||||||
#undef HAVE_MF_HC3
|
|
||||||
|
|
||||||
/* Define to 1 to enable hc4 match finder. */
|
|
||||||
#undef HAVE_MF_HC4
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <minix/sha2.h> header file. */
|
|
||||||
#undef HAVE_MINIX_SHA2_H
|
|
||||||
|
|
||||||
/* Define to 1 if getopt.h declares extern int optreset. */
|
|
||||||
#undef HAVE_OPTRESET
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `posix_fadvise' function. */
|
|
||||||
#undef HAVE_POSIX_FADVISE
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `pthread_condattr_setclock' function. */
|
|
||||||
#undef HAVE_PTHREAD_CONDATTR_SETCLOCK
|
|
||||||
|
|
||||||
/* Have PTHREAD_PRIO_INHERIT. */
|
|
||||||
#undef HAVE_PTHREAD_PRIO_INHERIT
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `SHA256Init' function. */
|
|
||||||
#undef HAVE_SHA256INIT
|
|
||||||
|
|
||||||
/* Define to 1 if the system has the type `SHA256_CTX'. */
|
|
||||||
#undef HAVE_SHA256_CTX
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <sha256.h> header file. */
|
|
||||||
#undef HAVE_SHA256_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `SHA256_Init' function. */
|
|
||||||
#undef HAVE_SHA256_INIT
|
|
||||||
|
|
||||||
/* Define to 1 if the system has the type `SHA2_CTX'. */
|
|
||||||
#undef HAVE_SHA2_CTX
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <sha2.h> header file. */
|
|
||||||
#undef HAVE_SHA2_H
|
|
||||||
|
|
||||||
/* Define to 1 if optimizing for size. */
|
|
||||||
#undef HAVE_SMALL
|
|
||||||
|
|
||||||
/* Define to 1 if stdbool.h conforms to C99. */
|
|
||||||
#undef HAVE_STDBOOL_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <stdint.h> header file. */
|
|
||||||
#undef HAVE_STDINT_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <stdlib.h> header file. */
|
|
||||||
#undef HAVE_STDLIB_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <strings.h> header file. */
|
|
||||||
#undef HAVE_STRINGS_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <string.h> header file. */
|
|
||||||
#undef HAVE_STRING_H
|
|
||||||
|
|
||||||
/* Define to 1 if `st_atimensec' is a member of `struct stat'. */
|
|
||||||
#undef HAVE_STRUCT_STAT_ST_ATIMENSEC
|
|
||||||
|
|
||||||
/* Define to 1 if `st_atimespec.tv_nsec' is a member of `struct stat'. */
|
|
||||||
#undef HAVE_STRUCT_STAT_ST_ATIMESPEC_TV_NSEC
|
|
||||||
|
|
||||||
/* Define to 1 if `st_atim.st__tim.tv_nsec' is a member of `struct stat'. */
|
|
||||||
#undef HAVE_STRUCT_STAT_ST_ATIM_ST__TIM_TV_NSEC
|
|
||||||
|
|
||||||
/* Define to 1 if `st_atim.tv_nsec' is a member of `struct stat'. */
|
|
||||||
#undef HAVE_STRUCT_STAT_ST_ATIM_TV_NSEC
|
|
||||||
|
|
||||||
/* Define to 1 if `st_uatime' is a member of `struct stat'. */
|
|
||||||
#undef HAVE_STRUCT_STAT_ST_UATIME
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <sys/byteorder.h> header file. */
|
|
||||||
#undef HAVE_SYS_BYTEORDER_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <sys/endian.h> header file. */
|
|
||||||
#undef HAVE_SYS_ENDIAN_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <sys/param.h> header file. */
|
|
||||||
#undef HAVE_SYS_PARAM_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <sys/stat.h> header file. */
|
|
||||||
#undef HAVE_SYS_STAT_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <sys/time.h> header file. */
|
|
||||||
#undef HAVE_SYS_TIME_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <sys/types.h> header file. */
|
|
||||||
#undef HAVE_SYS_TYPES_H
|
|
||||||
|
|
||||||
/* Define to 1 if the system has the type `uintptr_t'. */
|
|
||||||
#undef HAVE_UINTPTR_T
|
|
||||||
|
|
||||||
/* Define to 1 if you have the <unistd.h> header file. */
|
|
||||||
#undef HAVE_UNISTD_H
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `utime' function. */
|
|
||||||
#undef HAVE_UTIME
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `utimes' function. */
|
|
||||||
#undef HAVE_UTIMES
|
|
||||||
|
|
||||||
/* Define to 1 or 0, depending whether the compiler supports simple visibility
|
|
||||||
declarations. */
|
|
||||||
#undef HAVE_VISIBILITY
|
|
||||||
|
|
||||||
/* Define to 1 if you have the `wcwidth' function. */
|
|
||||||
#undef HAVE_WCWIDTH
|
|
||||||
|
|
||||||
/* Define to 1 if the system has the type `_Bool'. */
|
|
||||||
#undef HAVE__BOOL
|
|
||||||
|
|
||||||
/* Define to 1 if _mm_movemask_epi8 is available. */
|
|
||||||
#undef HAVE__MM_MOVEMASK_EPI8
|
|
||||||
|
|
||||||
/* Define to the sub-directory where libtool stores uninstalled libraries. */
|
|
||||||
#undef LT_OBJDIR
|
|
||||||
|
|
||||||
/* Define to 1 when using POSIX threads (pthreads). */
|
|
||||||
#undef MYTHREAD_POSIX
|
|
||||||
|
|
||||||
/* Define to 1 when using Windows Vista compatible threads. This uses features
|
|
||||||
that are not available on Windows XP. */
|
|
||||||
#undef MYTHREAD_VISTA
|
|
||||||
|
|
||||||
/* Define to 1 when using Windows 95 (and thus XP) compatible threads. This
|
|
||||||
avoids use of features that were added in Windows Vista. */
|
|
||||||
#undef MYTHREAD_WIN95
|
|
||||||
|
|
||||||
/* Define to 1 to disable debugging code. */
|
|
||||||
#undef NDEBUG
|
|
||||||
|
|
||||||
/* Name of package */
|
|
||||||
#undef PACKAGE
|
|
||||||
|
|
||||||
/* Define to the address where bug reports for this package should be sent. */
|
|
||||||
#undef PACKAGE_BUGREPORT
|
|
||||||
|
|
||||||
/* Define to the full name of this package. */
|
|
||||||
#undef PACKAGE_NAME
|
|
||||||
|
|
||||||
/* Define to the full name and version of this package. */
|
|
||||||
#undef PACKAGE_STRING
|
|
||||||
|
|
||||||
/* Define to the one symbol short name of this package. */
|
|
||||||
#undef PACKAGE_TARNAME
|
|
||||||
|
|
||||||
/* Define to the home page for this package. */
|
|
||||||
#undef PACKAGE_URL
|
|
||||||
|
|
||||||
/* Define to the version of this package. */
|
|
||||||
#undef PACKAGE_VERSION
|
|
||||||
|
|
||||||
/* Define to necessary symbol if this constant uses a non-standard name on
|
|
||||||
your system. */
|
|
||||||
#undef PTHREAD_CREATE_JOINABLE
|
|
||||||
|
|
||||||
/* The size of `size_t', as computed by sizeof. */
|
|
||||||
#undef SIZEOF_SIZE_T
|
|
||||||
|
|
||||||
/* Define to 1 if you have the ANSI C header files. */
|
|
||||||
#undef STDC_HEADERS
|
|
||||||
|
|
||||||
/* Define to 1 if the number of available CPU cores can be detected with
|
|
||||||
cpuset(2). */
|
|
||||||
#undef TUKLIB_CPUCORES_CPUSET
|
|
||||||
|
|
||||||
/* Define to 1 if the number of available CPU cores can be detected with
|
|
||||||
pstat_getdynamic(). */
|
|
||||||
#undef TUKLIB_CPUCORES_PSTAT_GETDYNAMIC
|
|
||||||
|
|
||||||
/* Define to 1 if the number of available CPU cores can be detected with
|
|
||||||
sysconf(_SC_NPROCESSORS_ONLN) or sysconf(_SC_NPROC_ONLN). */
|
|
||||||
#undef TUKLIB_CPUCORES_SYSCONF
|
|
||||||
|
|
||||||
/* Define to 1 if the number of available CPU cores can be detected with
|
|
||||||
sysctl(). */
|
|
||||||
#undef TUKLIB_CPUCORES_SYSCTL
|
|
||||||
|
|
||||||
/* Define to 1 if the system supports fast unaligned access to 16-bit and
|
|
||||||
32-bit integers. */
|
|
||||||
#undef TUKLIB_FAST_UNALIGNED_ACCESS
|
|
||||||
|
|
||||||
/* Define to 1 if the amount of physical memory can be detected with
|
|
||||||
_system_configuration.physmem. */
|
|
||||||
#undef TUKLIB_PHYSMEM_AIX
|
|
||||||
|
|
||||||
/* Define to 1 if the amount of physical memory can be detected with
|
|
||||||
getinvent_r(). */
|
|
||||||
#undef TUKLIB_PHYSMEM_GETINVENT_R
|
|
||||||
|
|
||||||
/* Define to 1 if the amount of physical memory can be detected with
|
|
||||||
getsysinfo(). */
|
|
||||||
#undef TUKLIB_PHYSMEM_GETSYSINFO
|
|
||||||
|
|
||||||
/* Define to 1 if the amount of physical memory can be detected with
|
|
||||||
pstat_getstatic(). */
|
|
||||||
#undef TUKLIB_PHYSMEM_PSTAT_GETSTATIC
|
|
||||||
|
|
||||||
/* Define to 1 if the amount of physical memory can be detected with
|
|
||||||
sysconf(_SC_PAGESIZE) and sysconf(_SC_PHYS_PAGES). */
|
|
||||||
#undef TUKLIB_PHYSMEM_SYSCONF
|
|
||||||
|
|
||||||
/* Define to 1 if the amount of physical memory can be detected with sysctl().
|
|
||||||
*/
|
|
||||||
#undef TUKLIB_PHYSMEM_SYSCTL
|
|
||||||
|
|
||||||
/* Define to 1 if the amount of physical memory can be detected with Linux
|
|
||||||
sysinfo(). */
|
|
||||||
#undef TUKLIB_PHYSMEM_SYSINFO
|
|
||||||
|
|
||||||
/* Enable extensions on AIX 3, Interix. */
|
|
||||||
#ifndef _ALL_SOURCE
|
|
||||||
# undef _ALL_SOURCE
|
|
||||||
#endif
|
|
||||||
/* Enable GNU extensions on systems that have them. */
|
|
||||||
#ifndef _GNU_SOURCE
|
|
||||||
# undef _GNU_SOURCE
|
|
||||||
#endif
|
|
||||||
/* Enable threading extensions on Solaris. */
|
|
||||||
#ifndef _POSIX_PTHREAD_SEMANTICS
|
|
||||||
# undef _POSIX_PTHREAD_SEMANTICS
|
|
||||||
#endif
|
|
||||||
/* Enable extensions on HP NonStop. */
|
|
||||||
#ifndef _TANDEM_SOURCE
|
|
||||||
# undef _TANDEM_SOURCE
|
|
||||||
#endif
|
|
||||||
/* Enable general extensions on Solaris. */
|
|
||||||
#ifndef __EXTENSIONS__
|
|
||||||
# undef __EXTENSIONS__
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
/* Version number of package */
|
|
||||||
#undef VERSION
|
|
||||||
|
|
||||||
/* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most
|
|
||||||
significant byte first (like Motorola and SPARC, unlike Intel). */
|
|
||||||
#if defined AC_APPLE_UNIVERSAL_BUILD
|
|
||||||
# if defined __BIG_ENDIAN__
|
|
||||||
# define WORDS_BIGENDIAN 1
|
|
||||||
# endif
|
|
||||||
#else
|
|
||||||
# ifndef WORDS_BIGENDIAN
|
|
||||||
# undef WORDS_BIGENDIAN
|
|
||||||
# endif
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Enable large inode numbers on Mac OS X 10.5. */
|
|
||||||
#ifndef _DARWIN_USE_64_BIT_INODE
|
|
||||||
# define _DARWIN_USE_64_BIT_INODE 1
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* Number of bits in a file offset, on hosts where this is settable. */
|
|
||||||
#undef _FILE_OFFSET_BITS
|
|
||||||
|
|
||||||
/* Define for large files, on AIX-style hosts. */
|
|
||||||
#undef _LARGE_FILES
|
|
||||||
|
|
||||||
/* Define to 1 if on MINIX. */
|
|
||||||
#undef _MINIX
|
|
||||||
|
|
||||||
/* Define to 2 if the system does not provide POSIX.1 features except with
|
|
||||||
this defined. */
|
|
||||||
#undef _POSIX_1_SOURCE
|
|
||||||
|
|
||||||
/* Define to 1 if you need to in order for `stat' and other things to work. */
|
|
||||||
#undef _POSIX_SOURCE
|
|
||||||
|
|
||||||
/* Define for Solaris 2.5.1 so the uint32_t typedef from <sys/synch.h>,
|
|
||||||
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
|
|
||||||
#define below would cause a syntax error. */
|
|
||||||
#undef _UINT32_T
|
|
||||||
|
|
||||||
/* Define for Solaris 2.5.1 so the uint64_t typedef from <sys/synch.h>,
|
|
||||||
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
|
|
||||||
#define below would cause a syntax error. */
|
|
||||||
#undef _UINT64_T
|
|
||||||
|
|
||||||
/* Define for Solaris 2.5.1 so the uint8_t typedef from <sys/synch.h>,
|
|
||||||
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
|
|
||||||
#define below would cause a syntax error. */
|
|
||||||
#undef _UINT8_T
|
|
||||||
|
|
||||||
/* Define to rpl_ if the getopt replacement functions and variables should be
|
|
||||||
used. */
|
|
||||||
#undef __GETOPT_PREFIX
|
|
||||||
|
|
||||||
/* Define to the type of a signed integer type of width exactly 32 bits if
|
|
||||||
such a type exists and the standard includes do not define it. */
|
|
||||||
#undef int32_t
|
|
||||||
|
|
||||||
/* Define to the type of a signed integer type of width exactly 64 bits if
|
|
||||||
such a type exists and the standard includes do not define it. */
|
|
||||||
#undef int64_t
|
|
||||||
|
|
||||||
/* Define to the type of an unsigned integer type of width exactly 16 bits if
|
|
||||||
such a type exists and the standard includes do not define it. */
|
|
||||||
#undef uint16_t
|
|
||||||
|
|
||||||
/* Define to the type of an unsigned integer type of width exactly 32 bits if
|
|
||||||
such a type exists and the standard includes do not define it. */
|
|
||||||
#undef uint32_t
|
|
||||||
|
|
||||||
/* Define to the type of an unsigned integer type of width exactly 64 bits if
|
|
||||||
such a type exists and the standard includes do not define it. */
|
|
||||||
#undef uint64_t
|
|
||||||
|
|
||||||
/* Define to the type of an unsigned integer type of width exactly 8 bits if
|
|
||||||
such a type exists and the standard includes do not define it. */
|
|
||||||
#undef uint8_t
|
|
||||||
|
|
||||||
/* Define to the type of an unsigned integer type wide enough to hold a
|
|
||||||
pointer, if such a type exists, and if the system does not define it. */
|
|
||||||
#undef uintptr_t
|
|
||||||
22819
configure
vendored
Normal file → Executable file
22819
configure
vendored
Normal file → Executable file
File diff suppressed because it is too large
Load Diff
842
configure.ac
842
configure.ac
@@ -1,842 +0,0 @@
|
|||||||
# -*- Autoconf -*-
|
|
||||||
# Process this file with autoconf to produce a configure script.
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
#
|
|
||||||
# Author: Lasse Collin
|
|
||||||
#
|
|
||||||
# This file has been put into the public domain.
|
|
||||||
# You can do whatever you want with this file.
|
|
||||||
#
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
# NOTE: Don't add useless checks. autoscan detects this and that, but don't
|
|
||||||
# let it confuse you. For example, we don't care about checking for behavior
|
|
||||||
# of malloc(), stat(), or lstat(), since we don't use those functions in
|
|
||||||
# a way that would cause the problems the autoconf macros check.
|
|
||||||
|
|
||||||
AC_PREREQ([2.64])
|
|
||||||
|
|
||||||
AC_INIT([XZ Utils], m4_esyscmd([/bin/sh build-aux/version.sh]),
|
|
||||||
[lasse.collin@tukaani.org], [xz], [http://tukaani.org/xz/])
|
|
||||||
AC_CONFIG_SRCDIR([src/liblzma/common/common.h])
|
|
||||||
AC_CONFIG_AUX_DIR([build-aux])
|
|
||||||
AC_CONFIG_MACRO_DIR([m4])
|
|
||||||
AC_CONFIG_HEADER([config.h])
|
|
||||||
|
|
||||||
echo
|
|
||||||
echo "$PACKAGE_STRING"
|
|
||||||
|
|
||||||
echo
|
|
||||||
echo "System type:"
|
|
||||||
# This is needed to know if assembler optimizations can be used.
|
|
||||||
AC_CANONICAL_HOST
|
|
||||||
|
|
||||||
# We do some special things on Windows (32-bit or 64-bit) builds.
|
|
||||||
case $host_os in
|
|
||||||
mingw* | cygwin | msys) is_w32=yes ;;
|
|
||||||
*) is_w32=no ;;
|
|
||||||
esac
|
|
||||||
AM_CONDITIONAL([COND_W32], [test "$is_w32" = yes])
|
|
||||||
|
|
||||||
# We need to use $EXEEXT with $(LN_S) when creating symlinks to
|
|
||||||
# executables. Cygwin is an exception to this, since it is recommended
|
|
||||||
# that symlinks don't have the .exe suffix. To make this work, we
|
|
||||||
# define LN_EXEEXT.
|
|
||||||
#
|
|
||||||
# MSYS2 is treated the same way as Cygwin. It uses plain "msys" like
|
|
||||||
# the original MSYS when building MSYS/MSYS2-binaries. Hopefully this
|
|
||||||
# doesn't break things for the original MSYS developers. Note that this
|
|
||||||
# doesn't affect normal MSYS/MSYS2 users building non-MSYS/MSYS2 binaries
|
|
||||||
# since in that case the $host_os is usually mingw32.
|
|
||||||
case $host_os in
|
|
||||||
cygwin | msys) LN_EXEEXT= ;;
|
|
||||||
*) LN_EXEEXT='$(EXEEXT)' ;;
|
|
||||||
esac
|
|
||||||
AC_SUBST([LN_EXEEXT])
|
|
||||||
|
|
||||||
echo
|
|
||||||
echo "Configure options:"
|
|
||||||
AM_CFLAGS=
|
|
||||||
|
|
||||||
|
|
||||||
#############
|
|
||||||
# Debugging #
|
|
||||||
#############
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([if debugging code should be compiled])
|
|
||||||
AC_ARG_ENABLE([debug], AS_HELP_STRING([--enable-debug], [Enable debugging code.]),
|
|
||||||
[], enable_debug=no)
|
|
||||||
if test "x$enable_debug" = xyes; then
|
|
||||||
AC_MSG_RESULT([yes])
|
|
||||||
else
|
|
||||||
AC_DEFINE([NDEBUG], [1], [Define to 1 to disable debugging code.])
|
|
||||||
AC_MSG_RESULT([no])
|
|
||||||
fi
|
|
||||||
|
|
||||||
|
|
||||||
###########
|
|
||||||
# Filters #
|
|
||||||
###########
|
|
||||||
|
|
||||||
m4_define([SUPPORTED_FILTERS], [lzma1,lzma2,delta,x86,powerpc,ia64,arm,armthumb,sparc])dnl
|
|
||||||
m4_define([SIMPLE_FILTERS], [x86,powerpc,ia64,arm,armthumb,sparc])
|
|
||||||
m4_define([LZ_FILTERS], [lzma1,lzma2])
|
|
||||||
|
|
||||||
m4_foreach([NAME], [SUPPORTED_FILTERS],
|
|
||||||
[enable_filter_[]NAME=no
|
|
||||||
enable_encoder_[]NAME=no
|
|
||||||
enable_decoder_[]NAME=no
|
|
||||||
])dnl
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([which encoders to build])
|
|
||||||
AC_ARG_ENABLE([encoders], AS_HELP_STRING([--enable-encoders=LIST],
|
|
||||||
[Comma-separated list of encoders to build. Default=all.
|
|
||||||
Available encoders:]
|
|
||||||
m4_translit(m4_defn([SUPPORTED_FILTERS]), [,], [ ])),
|
|
||||||
[], [enable_encoders=SUPPORTED_FILTERS])
|
|
||||||
enable_encoders=`echo "$enable_encoders" | sed 's/,/ /g'`
|
|
||||||
if test "x$enable_encoders" = xno || test "x$enable_encoders" = x; then
|
|
||||||
AC_MSG_RESULT([(none)])
|
|
||||||
else
|
|
||||||
for arg in $enable_encoders
|
|
||||||
do
|
|
||||||
case $arg in m4_foreach([NAME], [SUPPORTED_FILTERS], [
|
|
||||||
NAME)
|
|
||||||
enable_filter_[]NAME=yes
|
|
||||||
enable_encoder_[]NAME=yes
|
|
||||||
AC_DEFINE(HAVE_ENCODER_[]m4_toupper(NAME), [1],
|
|
||||||
[Define to 1 if] NAME [encoder is enabled.])
|
|
||||||
;;])
|
|
||||||
*)
|
|
||||||
AC_MSG_RESULT([])
|
|
||||||
AC_MSG_ERROR([unknown filter: $arg])
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
AC_MSG_RESULT([$enable_encoders])
|
|
||||||
fi
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([which decoders to build])
|
|
||||||
AC_ARG_ENABLE([decoders], AS_HELP_STRING([--enable-decoders=LIST],
|
|
||||||
[Comma-separated list of decoders to build. Default=all.
|
|
||||||
Available decoders are the same as available encoders.]),
|
|
||||||
[], [enable_decoders=SUPPORTED_FILTERS])
|
|
||||||
enable_decoders=`echo "$enable_decoders" | sed 's/,/ /g'`
|
|
||||||
if test "x$enable_decoders" = xno || test "x$enable_decoders" = x; then
|
|
||||||
AC_MSG_RESULT([(none)])
|
|
||||||
else
|
|
||||||
for arg in $enable_decoders
|
|
||||||
do
|
|
||||||
case $arg in m4_foreach([NAME], [SUPPORTED_FILTERS], [
|
|
||||||
NAME)
|
|
||||||
enable_filter_[]NAME=yes
|
|
||||||
enable_decoder_[]NAME=yes
|
|
||||||
AC_DEFINE(HAVE_DECODER_[]m4_toupper(NAME), [1],
|
|
||||||
[Define to 1 if] NAME [decoder is enabled.])
|
|
||||||
;;])
|
|
||||||
*)
|
|
||||||
AC_MSG_RESULT([])
|
|
||||||
AC_MSG_ERROR([unknown filter: $arg])
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
|
|
||||||
# LZMA2 requires that LZMA1 is enabled.
|
|
||||||
test "x$enable_encoder_lzma2" = xyes && enable_encoder_lzma1=yes
|
|
||||||
test "x$enable_decoder_lzma2" = xyes && enable_decoder_lzma1=yes
|
|
||||||
|
|
||||||
AC_MSG_RESULT([$enable_decoders])
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test "x$enable_encoder_lzma2$enable_encoder_lzma1" = xyesno \
|
|
||||||
|| test "x$enable_decoder_lzma2$enable_decoder_lzma1" = xyesno; then
|
|
||||||
AC_MSG_ERROR([LZMA2 requires that LZMA1 is also enabled.])
|
|
||||||
fi
|
|
||||||
|
|
||||||
AM_CONDITIONAL(COND_MAIN_ENCODER, test "x$enable_encoders" != xno && test "x$enable_encoders" != x)
|
|
||||||
AM_CONDITIONAL(COND_MAIN_DECODER, test "x$enable_decoders" != xno && test "x$enable_decoders" != x)
|
|
||||||
|
|
||||||
m4_foreach([NAME], [SUPPORTED_FILTERS],
|
|
||||||
[AM_CONDITIONAL(COND_FILTER_[]m4_toupper(NAME), test "x$enable_filter_[]NAME" = xyes)
|
|
||||||
AM_CONDITIONAL(COND_ENCODER_[]m4_toupper(NAME), test "x$enable_encoder_[]NAME" = xyes)
|
|
||||||
AM_CONDITIONAL(COND_DECODER_[]m4_toupper(NAME), test "x$enable_decoder_[]NAME" = xyes)
|
|
||||||
])dnl
|
|
||||||
|
|
||||||
# The so called "simple filters" share common code.
|
|
||||||
enable_filter_simple=no
|
|
||||||
enable_encoder_simple=no
|
|
||||||
enable_decoder_simple=no
|
|
||||||
m4_foreach([NAME], [SIMPLE_FILTERS],
|
|
||||||
[test "x$enable_filter_[]NAME" = xyes && enable_filter_simple=yes
|
|
||||||
test "x$enable_encoder_[]NAME" = xyes && enable_encoder_simple=yes
|
|
||||||
test "x$enable_decoder_[]NAME" = xyes && enable_decoder_simple=yes
|
|
||||||
])dnl
|
|
||||||
AM_CONDITIONAL(COND_FILTER_SIMPLE, test "x$enable_filter_simple" = xyes)
|
|
||||||
AM_CONDITIONAL(COND_ENCODER_SIMPLE, test "x$enable_encoder_simple" = xyes)
|
|
||||||
AM_CONDITIONAL(COND_DECODER_SIMPLE, test "x$enable_decoder_simple" = xyes)
|
|
||||||
|
|
||||||
# LZ-based filters share common code.
|
|
||||||
enable_filter_lz=no
|
|
||||||
enable_encoder_lz=no
|
|
||||||
enable_decoder_lz=no
|
|
||||||
m4_foreach([NAME], [LZ_FILTERS],
|
|
||||||
[test "x$enable_filter_[]NAME" = xyes && enable_filter_lz=yes
|
|
||||||
test "x$enable_encoder_[]NAME" = xyes && enable_encoder_lz=yes
|
|
||||||
test "x$enable_decoder_[]NAME" = xyes && enable_decoder_lz=yes
|
|
||||||
])dnl
|
|
||||||
AM_CONDITIONAL(COND_FILTER_LZ, test "x$enable_filter_lz" = xyes)
|
|
||||||
AM_CONDITIONAL(COND_ENCODER_LZ, test "x$enable_encoder_lz" = xyes)
|
|
||||||
AM_CONDITIONAL(COND_DECODER_LZ, test "x$enable_decoder_lz" = xyes)
|
|
||||||
|
|
||||||
|
|
||||||
#################
|
|
||||||
# Match finders #
|
|
||||||
#################
|
|
||||||
|
|
||||||
m4_define([SUPPORTED_MATCH_FINDERS], [hc3,hc4,bt2,bt3,bt4])
|
|
||||||
|
|
||||||
m4_foreach([NAME], [SUPPORTED_MATCH_FINDERS],
|
|
||||||
[enable_match_finder_[]NAME=no
|
|
||||||
])
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([which match finders to build])
|
|
||||||
AC_ARG_ENABLE([match-finders], AS_HELP_STRING([--enable-match-finders=LIST],
|
|
||||||
[Comma-separated list of match finders to build. Default=all.
|
|
||||||
At least one match finder is required for encoding with
|
|
||||||
the LZMA1 and LZMA2 filters. Available match finders:]
|
|
||||||
m4_translit(m4_defn([SUPPORTED_MATCH_FINDERS]), [,], [ ])), [],
|
|
||||||
[enable_match_finders=SUPPORTED_MATCH_FINDERS])
|
|
||||||
enable_match_finders=`echo "$enable_match_finders" | sed 's/,/ /g'`
|
|
||||||
if test "x$enable_encoder_lz" = xyes ; then
|
|
||||||
for arg in $enable_match_finders
|
|
||||||
do
|
|
||||||
case $arg in m4_foreach([NAME], [SUPPORTED_MATCH_FINDERS], [
|
|
||||||
NAME)
|
|
||||||
enable_match_finder_[]NAME=yes
|
|
||||||
AC_DEFINE(HAVE_MF_[]m4_toupper(NAME), [1],
|
|
||||||
[Define to 1 to enable] NAME [match finder.])
|
|
||||||
;;])
|
|
||||||
*)
|
|
||||||
AC_MSG_RESULT([])
|
|
||||||
AC_MSG_ERROR([unknown match finder: $arg])
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
AC_MSG_RESULT([$enable_match_finders])
|
|
||||||
else
|
|
||||||
AC_MSG_RESULT([(none because not building any LZ-based encoder)])
|
|
||||||
fi
|
|
||||||
|
|
||||||
|
|
||||||
####################
|
|
||||||
# Integrity checks #
|
|
||||||
####################
|
|
||||||
|
|
||||||
m4_define([SUPPORTED_CHECKS], [crc32,crc64,sha256])
|
|
||||||
|
|
||||||
m4_foreach([NAME], [SUPPORTED_CHECKS],
|
|
||||||
[enable_check_[]NAME=no
|
|
||||||
])dnl
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([which integrity checks to build])
|
|
||||||
AC_ARG_ENABLE([checks], AS_HELP_STRING([--enable-checks=LIST],
|
|
||||||
[Comma-separated list of integrity checks to build.
|
|
||||||
Default=all. Available integrity checks:]
|
|
||||||
m4_translit(m4_defn([SUPPORTED_CHECKS]), [,], [ ])),
|
|
||||||
[], [enable_checks=SUPPORTED_CHECKS])
|
|
||||||
enable_checks=`echo "$enable_checks" | sed 's/,/ /g'`
|
|
||||||
if test "x$enable_checks" = xno || test "x$enable_checks" = x; then
|
|
||||||
AC_MSG_RESULT([(none)])
|
|
||||||
else
|
|
||||||
for arg in $enable_checks
|
|
||||||
do
|
|
||||||
case $arg in m4_foreach([NAME], [SUPPORTED_CHECKS], [
|
|
||||||
NAME)
|
|
||||||
enable_check_[]NAME=yes
|
|
||||||
AC_DEFINE(HAVE_CHECK_[]m4_toupper(NAME), [1],
|
|
||||||
[Define to 1 if] NAME
|
|
||||||
[integrity check is enabled.])
|
|
||||||
;;])
|
|
||||||
*)
|
|
||||||
AC_MSG_RESULT([])
|
|
||||||
AC_MSG_ERROR([unknown integrity check: $arg])
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
done
|
|
||||||
AC_MSG_RESULT([$enable_checks])
|
|
||||||
fi
|
|
||||||
if test "x$enable_check_crc32" = xno ; then
|
|
||||||
AC_MSG_ERROR([For now, the CRC32 check must always be enabled.])
|
|
||||||
fi
|
|
||||||
|
|
||||||
m4_foreach([NAME], [SUPPORTED_CHECKS],
|
|
||||||
[AM_CONDITIONAL(COND_CHECK_[]m4_toupper(NAME), test "x$enable_check_[]NAME" = xyes)
|
|
||||||
])dnl
|
|
||||||
|
|
||||||
|
|
||||||
###########################
|
|
||||||
# Assembler optimizations #
|
|
||||||
###########################
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([if assembler optimizations should be used])
|
|
||||||
AC_ARG_ENABLE([assembler], AS_HELP_STRING([--disable-assembler],
|
|
||||||
[Do not use assembler optimizations even if such exist
|
|
||||||
for the architecture.]),
|
|
||||||
[], [enable_assembler=yes])
|
|
||||||
if test "x$enable_assembler" = xyes; then
|
|
||||||
enable_assembler=no
|
|
||||||
case $host_os in
|
|
||||||
# Darwin should work too but only if not creating universal
|
|
||||||
# binaries. Solaris x86 could work too but I cannot test.
|
|
||||||
linux* | *bsd* | mingw* | cygwin | msys | *djgpp*)
|
|
||||||
case $host_cpu in
|
|
||||||
i?86) enable_assembler=x86 ;;
|
|
||||||
x86_64) enable_assembler=x86_64 ;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
case $enable_assembler in
|
|
||||||
x86 | x86_64 | no)
|
|
||||||
AC_MSG_RESULT([$enable_assembler])
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
AC_MSG_RESULT([])
|
|
||||||
AC_MSG_ERROR([--enable-assembler accepts only `yes', `no', `x86', or `x86_64'.])
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
AM_CONDITIONAL(COND_ASM_X86, test "x$enable_assembler" = xx86)
|
|
||||||
AM_CONDITIONAL(COND_ASM_X86_64, test "x$enable_assembler" = xx86_64)
|
|
||||||
|
|
||||||
|
|
||||||
#####################
|
|
||||||
# Size optimization #
|
|
||||||
#####################
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([if small size is preferred over speed])
|
|
||||||
AC_ARG_ENABLE([small], AS_HELP_STRING([--enable-small],
|
|
||||||
[Make liblzma smaller and a little slower.
|
|
||||||
This is disabled by default to optimize for speed.]),
|
|
||||||
[], [enable_small=no])
|
|
||||||
if test "x$enable_small" = xyes; then
|
|
||||||
AC_DEFINE([HAVE_SMALL], [1], [Define to 1 if optimizing for size.])
|
|
||||||
elif test "x$enable_small" != xno; then
|
|
||||||
AC_MSG_RESULT([])
|
|
||||||
AC_MSG_ERROR([--enable-small accepts only `yes' or `no'])
|
|
||||||
fi
|
|
||||||
AC_MSG_RESULT([$enable_small])
|
|
||||||
AM_CONDITIONAL(COND_SMALL, test "x$enable_small" = xyes)
|
|
||||||
|
|
||||||
|
|
||||||
#############
|
|
||||||
# Threading #
|
|
||||||
#############
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([if threading support is wanted])
|
|
||||||
AC_ARG_ENABLE([threads], AS_HELP_STRING([--enable-threads=METHOD],
|
|
||||||
[Supported METHODS are `yes', `no', `posix', `win95', and
|
|
||||||
`vista'. The default is `yes'. Using `no' together with
|
|
||||||
--enable-small makes liblzma thread unsafe.]),
|
|
||||||
[], [enable_threads=yes])
|
|
||||||
|
|
||||||
if test "x$enable_threads" = xyes; then
|
|
||||||
case $host_os in
|
|
||||||
mingw*)
|
|
||||||
case $host_cpu in
|
|
||||||
i?86) enable_threads=win95 ;;
|
|
||||||
*) enable_threads=vista ;;
|
|
||||||
esac
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
enable_threads=posix
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
|
|
||||||
case $enable_threads in
|
|
||||||
posix | win95 | vista)
|
|
||||||
AC_MSG_RESULT([yes, $enable_threads])
|
|
||||||
;;
|
|
||||||
no)
|
|
||||||
AC_MSG_RESULT([no])
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
AC_MSG_RESULT([])
|
|
||||||
AC_MSG_ERROR([--enable-threads only accepts `yes', `no', `posix', `win95', or `vista'])
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
|
|
||||||
# The Win95 threading lacks thread-safe one-time initialization function.
|
|
||||||
# It's better to disallow it instead of allowing threaded but thread-unsafe
|
|
||||||
# build.
|
|
||||||
if test "x$enable_small$enable_threads" = xyeswin95; then
|
|
||||||
AC_MSG_ERROR([--enable-threads=win95 and --enable-small cannot be
|
|
||||||
used at the same time])
|
|
||||||
fi
|
|
||||||
|
|
||||||
# We use the actual result a little later.
|
|
||||||
|
|
||||||
|
|
||||||
#########################
|
|
||||||
# Assumed amount of RAM #
|
|
||||||
#########################
|
|
||||||
|
|
||||||
# We use 128 MiB as default, because it will allow decompressing files
|
|
||||||
# created with "xz -9". It would be slightly safer to guess a lower value,
|
|
||||||
# but most systems, on which we don't have any way to determine the amount
|
|
||||||
# of RAM, will probably have at least 128 MiB of RAM.
|
|
||||||
AC_MSG_CHECKING([how much RAM to assume if the real amount is unknown])
|
|
||||||
AC_ARG_ENABLE([assume-ram], AS_HELP_STRING([--enable-assume-ram=SIZE],
|
|
||||||
[If and only if the real amount of RAM cannot be determined,
|
|
||||||
assume SIZE MiB. The default is 128 MiB. This affects the
|
|
||||||
default memory usage limit.]),
|
|
||||||
[], [enable_assume_ram=128])
|
|
||||||
assume_ram_check=`echo "$enable_assume_ram" | tr -d 0123456789`
|
|
||||||
if test -z "$enable_assume_ram" || test -n "$assume_ram_check"; then
|
|
||||||
AC_MSG_RESULT([])
|
|
||||||
AC_MSG_ERROR([--enable-assume-ram accepts only an integer argument])
|
|
||||||
fi
|
|
||||||
AC_MSG_RESULT([$enable_assume_ram MiB])
|
|
||||||
AC_DEFINE_UNQUOTED([ASSUME_RAM], [$enable_assume_ram],
|
|
||||||
[How many MiB of RAM to assume if the real amount cannot
|
|
||||||
be determined.])
|
|
||||||
|
|
||||||
|
|
||||||
#########################
|
|
||||||
# Components to install #
|
|
||||||
#########################
|
|
||||||
|
|
||||||
AC_ARG_ENABLE([xz], [AS_HELP_STRING([--disable-xz],
|
|
||||||
[do not build the xz tool])],
|
|
||||||
[], [enable_xz=yes])
|
|
||||||
AM_CONDITIONAL([COND_XZ], [test x$enable_xz != xno])
|
|
||||||
|
|
||||||
AC_ARG_ENABLE([xzdec], [AS_HELP_STRING([--disable-xzdec],
|
|
||||||
[do not build xzdec])],
|
|
||||||
[], [enable_xzdec=yes])
|
|
||||||
AM_CONDITIONAL([COND_XZDEC], [test x$enable_xzdec != xno])
|
|
||||||
|
|
||||||
AC_ARG_ENABLE([lzmadec], [AS_HELP_STRING([--disable-lzmadec],
|
|
||||||
[do not build lzmadec
|
|
||||||
(it exists primarily for LZMA Utils compatibility)])],
|
|
||||||
[], [enable_lzmadec=yes])
|
|
||||||
AM_CONDITIONAL([COND_LZMADEC], [test x$enable_lzmadec != xno])
|
|
||||||
|
|
||||||
AC_ARG_ENABLE([lzmainfo], [AS_HELP_STRING([--disable-lzmainfo],
|
|
||||||
[do not build lzmainfo
|
|
||||||
(it exists primarily for LZMA Utils compatibility)])],
|
|
||||||
[], [enable_lzmainfo=yes])
|
|
||||||
AM_CONDITIONAL([COND_LZMAINFO], [test x$enable_lzmainfo != xno])
|
|
||||||
|
|
||||||
AC_ARG_ENABLE([lzma-links], [AS_HELP_STRING([--disable-lzma-links],
|
|
||||||
[do not create symlinks for LZMA Utils compatibility])],
|
|
||||||
[], [enable_lzma_links=yes])
|
|
||||||
AM_CONDITIONAL([COND_LZMALINKS], [test x$enable_lzma_links != xno])
|
|
||||||
|
|
||||||
AC_ARG_ENABLE([scripts], [AS_HELP_STRING([--disable-scripts],
|
|
||||||
[do not install the scripts xzdiff, xzgrep, xzless, xzmore,
|
|
||||||
and their symlinks])],
|
|
||||||
[], [enable_scripts=yes])
|
|
||||||
AM_CONDITIONAL([COND_SCRIPTS], [test x$enable_scripts != xno])
|
|
||||||
|
|
||||||
AC_ARG_ENABLE([doc], [AS_HELP_STRING([--disable-doc],
|
|
||||||
[do not install documentation files to docdir
|
|
||||||
(man pages will still be installed)])],
|
|
||||||
[], [enable_doc=yes])
|
|
||||||
AM_CONDITIONAL([COND_DOC], [test x$enable_doc != xno])
|
|
||||||
|
|
||||||
|
|
||||||
#####################
|
|
||||||
# Symbol versioning #
|
|
||||||
#####################
|
|
||||||
|
|
||||||
AC_MSG_CHECKING([if library symbol versioning should be used])
|
|
||||||
AC_ARG_ENABLE([symbol-versions], [AS_HELP_STRING([--enable-symbol-versions],
|
|
||||||
[Use symbol versioning for liblzma. Enabled by default on
|
|
||||||
GNU/Linux, other GNU-based systems, and FreeBSD.])],
|
|
||||||
[], [enable_symbol_versions=auto])
|
|
||||||
if test "x$enable_symbol_versions" = xauto; then
|
|
||||||
case $host_os in
|
|
||||||
# NOTE: Even if one omits -gnu on GNU/Linux (e.g.
|
|
||||||
# i486-slackware-linux), configure will (via config.sub)
|
|
||||||
# append -gnu (e.g. i486-slackware-linux-gnu), and this
|
|
||||||
# test will work correctly.
|
|
||||||
gnu* | *-gnu* | freebsd*)
|
|
||||||
enable_symbol_versions=yes
|
|
||||||
;;
|
|
||||||
*)
|
|
||||||
enable_symbol_versions=no
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
fi
|
|
||||||
AC_MSG_RESULT([$enable_symbol_versions])
|
|
||||||
AM_CONDITIONAL([COND_SYMVERS], [test "x$enable_symbol_versions" = xyes])
|
|
||||||
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
# Checks for programs.
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
echo
|
|
||||||
gl_POSIX_SHELL
|
|
||||||
if test -z "$POSIX_SHELL" && test "x$enable_scripts" = xyes ; then
|
|
||||||
AC_MSG_ERROR([No POSIX conforming shell (sh) was found.])
|
|
||||||
fi
|
|
||||||
|
|
||||||
echo
|
|
||||||
echo "Initializing Automake:"
|
|
||||||
|
|
||||||
# We don't use "subdir-objects" yet because it breaks "make distclean" when
|
|
||||||
# dependencies are enabled (as of Automake 1.14.1) due to this bug:
|
|
||||||
# http://debbugs.gnu.org/cgi/bugreport.cgi?bug=17354
|
|
||||||
# The -Wno-unsupported is used to silence warnings about missing
|
|
||||||
# "subdir-objects".
|
|
||||||
AM_INIT_AUTOMAKE([1.12 foreign tar-v7 filename-length-max=99 serial-tests -Wno-unsupported])
|
|
||||||
AC_PROG_LN_S
|
|
||||||
|
|
||||||
AC_PROG_CC_C99
|
|
||||||
if test x$ac_cv_prog_cc_c99 = xno ; then
|
|
||||||
AC_MSG_ERROR([No C99 compiler was found.])
|
|
||||||
fi
|
|
||||||
|
|
||||||
AM_PROG_CC_C_O
|
|
||||||
AM_PROG_AS
|
|
||||||
AC_USE_SYSTEM_EXTENSIONS
|
|
||||||
|
|
||||||
case $enable_threads in
|
|
||||||
posix)
|
|
||||||
echo
|
|
||||||
echo "POSIX threading support:"
|
|
||||||
AX_PTHREAD([:]) dnl We don't need the HAVE_PTHREAD macro.
|
|
||||||
LIBS="$LIBS $PTHREAD_LIBS"
|
|
||||||
AM_CFLAGS="$AM_CFLAGS $PTHREAD_CFLAGS"
|
|
||||||
|
|
||||||
dnl NOTE: PTHREAD_CC is ignored. It would be useful on AIX,
|
|
||||||
dnl but it's tricky to get it right together with
|
|
||||||
dnl AC_PROG_CC_C99. Thus, this is handled by telling the
|
|
||||||
dnl user in INSTALL to set the correct CC manually.
|
|
||||||
|
|
||||||
AC_DEFINE([MYTHREAD_POSIX], [1],
|
|
||||||
[Define to 1 when using POSIX threads (pthreads).])
|
|
||||||
|
|
||||||
# These are nice to have but not mandatory.
|
|
||||||
#
|
|
||||||
# FIXME: xz uses clock_gettime if it is available and can do
|
|
||||||
# it even when threading is disabled. Moving this outside
|
|
||||||
# of pthread detection may be undesirable because then
|
|
||||||
# liblzma may get linked against librt even when librt isn't
|
|
||||||
# needed by liblzma.
|
|
||||||
OLD_CFLAGS=$CFLAGS
|
|
||||||
CFLAGS="$CFLAGS $PTHREAD_CFLAGS"
|
|
||||||
AC_SEARCH_LIBS([clock_gettime], [rt])
|
|
||||||
AC_CHECK_FUNCS([clock_gettime pthread_condattr_setclock])
|
|
||||||
AC_CHECK_DECLS([CLOCK_MONOTONIC], [], [], [[#include <time.h>]])
|
|
||||||
CFLAGS=$OLD_CFLAGS
|
|
||||||
;;
|
|
||||||
win95)
|
|
||||||
AC_DEFINE([MYTHREAD_WIN95], [1], [Define to 1 when using
|
|
||||||
Windows 95 (and thus XP) compatible threads.
|
|
||||||
This avoids use of features that were added in
|
|
||||||
Windows Vista.])
|
|
||||||
;;
|
|
||||||
vista)
|
|
||||||
AC_DEFINE([MYTHREAD_VISTA], [1], [Define to 1 when using
|
|
||||||
Windows Vista compatible threads. This uses
|
|
||||||
features that are not available on Windows XP.])
|
|
||||||
;;
|
|
||||||
esac
|
|
||||||
AM_CONDITIONAL([COND_THREADS], [test "x$enable_threads" != xno])
|
|
||||||
|
|
||||||
echo
|
|
||||||
echo "Initializing Libtool:"
|
|
||||||
LT_PREREQ([2.2])
|
|
||||||
LT_INIT([win32-dll])
|
|
||||||
LT_LANG([Windows Resource])
|
|
||||||
|
|
||||||
# This is a bit wrong since it is possible to request that only some libs
|
|
||||||
# are built as shared. Using that feature isn't so common though, and this
|
|
||||||
# breaks only on Windows (at least for now) if the user enables only some
|
|
||||||
# libs as shared.
|
|
||||||
AM_CONDITIONAL([COND_SHARED], [test "x$enable_shared" != xno])
|
|
||||||
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
# Checks for libraries.
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
echo
|
|
||||||
echo "Initializing gettext:"
|
|
||||||
AM_GNU_GETTEXT_VERSION([0.18])
|
|
||||||
AM_GNU_GETTEXT([external])
|
|
||||||
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
# Checks for header files.
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
echo
|
|
||||||
echo "System headers and functions:"
|
|
||||||
|
|
||||||
# There is currently no workarounds in this package if some of
|
|
||||||
# these headers are missing.
|
|
||||||
AC_CHECK_HEADERS([fcntl.h limits.h sys/time.h],
|
|
||||||
[],
|
|
||||||
[AC_MSG_ERROR([Required header file(s) are missing.])])
|
|
||||||
|
|
||||||
# This allows the use of the intrinsic functions if they are available.
|
|
||||||
AC_CHECK_HEADERS([immintrin.h])
|
|
||||||
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
# Checks for typedefs, structures, and compiler characteristics.
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
dnl We don't need these as long as we need a C99 compiler anyway.
|
|
||||||
dnl AC_C_INLINE
|
|
||||||
dnl AC_C_RESTRICT
|
|
||||||
|
|
||||||
AC_HEADER_STDBOOL
|
|
||||||
|
|
||||||
AC_TYPE_UINT8_T
|
|
||||||
AC_TYPE_UINT16_T
|
|
||||||
AC_TYPE_INT32_T
|
|
||||||
AC_TYPE_UINT32_T
|
|
||||||
AC_TYPE_INT64_T
|
|
||||||
AC_TYPE_UINT64_T
|
|
||||||
AC_TYPE_UINTPTR_T
|
|
||||||
|
|
||||||
AC_CHECK_SIZEOF([size_t])
|
|
||||||
|
|
||||||
# The command line tool can copy high resolution timestamps if such
|
|
||||||
# information is available in struct stat. Otherwise one second accuracy
|
|
||||||
# is used.
|
|
||||||
AC_CHECK_MEMBERS([
|
|
||||||
struct stat.st_atim.tv_nsec,
|
|
||||||
struct stat.st_atimespec.tv_nsec,
|
|
||||||
struct stat.st_atimensec,
|
|
||||||
struct stat.st_uatime,
|
|
||||||
struct stat.st_atim.st__tim.tv_nsec])
|
|
||||||
|
|
||||||
AC_SYS_LARGEFILE
|
|
||||||
AC_C_BIGENDIAN
|
|
||||||
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
# Checks for library functions.
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
# Gnulib replacements as needed
|
|
||||||
gl_GETOPT
|
|
||||||
|
|
||||||
# Find the best function to set timestamps.
|
|
||||||
AC_CHECK_FUNCS([futimens futimes futimesat utimes utime], [break])
|
|
||||||
|
|
||||||
# This is nice to have but not mandatory.
|
|
||||||
AC_CHECK_FUNCS([posix_fadvise])
|
|
||||||
|
|
||||||
TUKLIB_PROGNAME
|
|
||||||
TUKLIB_INTEGER
|
|
||||||
TUKLIB_PHYSMEM
|
|
||||||
TUKLIB_CPUCORES
|
|
||||||
TUKLIB_MBSTR
|
|
||||||
|
|
||||||
# Check for system-provided SHA-256. At least the following is supported:
|
|
||||||
#
|
|
||||||
# OS Headers Library Type Function
|
|
||||||
# FreeBSD sys/types.h + sha256.h libmd SHA256_CTX SHA256_Init
|
|
||||||
# NetBSD sys/types.h + sha2.h SHA256_CTX SHA256_Init
|
|
||||||
# OpenBSD sys/types.h + sha2.h SHA2_CTX SHA256Init
|
|
||||||
# Solaris sys/types.h + sha2.h libmd SHA256_CTX SHA256Init
|
|
||||||
# MINIX 3 sys/types.h + minix/sha2.h libutil SHA256_CTX SHA256_Init
|
|
||||||
# Darwin CommonCrypto/CommonDigest.h CC_SHA256_CTX CC_SHA256_Init
|
|
||||||
#
|
|
||||||
# Note that Darwin's CC_SHA256_Update takes buffer size as uint32_t instead
|
|
||||||
# of size_t.
|
|
||||||
#
|
|
||||||
# We don't check for e.g. OpenSSL or libgcrypt because we don't want
|
|
||||||
# to introduce dependencies to other packages by default. Maybe such
|
|
||||||
# libraries could be supported via additional configure options though.
|
|
||||||
#
|
|
||||||
if test "x$enable_check_sha256" = "xyes"; then
|
|
||||||
# Test for Common Crypto before others, because Darwin has sha256.h
|
|
||||||
# too and we don't want to use that, because on older versions it
|
|
||||||
# uses OpenSSL functions, whose SHA256_Init is not guaranteed to
|
|
||||||
# succeed.
|
|
||||||
sha256_header_found=no
|
|
||||||
AC_CHECK_HEADERS(
|
|
||||||
[CommonCrypto/CommonDigest.h sha256.h sha2.h minix/sha2.h],
|
|
||||||
[sha256_header_found=yes ; break])
|
|
||||||
if test "x$sha256_header_found" = xyes; then
|
|
||||||
AC_CHECK_TYPES([CC_SHA256_CTX, SHA256_CTX, SHA2_CTX], [], [],
|
|
||||||
[[#ifdef HAVE_SYS_TYPES_H
|
|
||||||
# include <sys/types.h>
|
|
||||||
#endif
|
|
||||||
#ifdef HAVE_COMMONCRYPTO_COMMONDIGEST_H
|
|
||||||
# include <CommonCrypto/CommonDigest.h>
|
|
||||||
#endif
|
|
||||||
#ifdef HAVE_SHA256_H
|
|
||||||
# include <sha256.h>
|
|
||||||
#endif
|
|
||||||
#ifdef HAVE_SHA2_H
|
|
||||||
# include <sha2.h>
|
|
||||||
#endif
|
|
||||||
#ifdef HAVE_MINIX_SHA2_H
|
|
||||||
# include <minix/sha2.h>
|
|
||||||
#endif]])
|
|
||||||
AC_SEARCH_LIBS([SHA256_Init], [md util])
|
|
||||||
AC_SEARCH_LIBS([SHA256Init], [md])
|
|
||||||
AC_CHECK_FUNCS([CC_SHA256_Init SHA256_Init SHA256Init],
|
|
||||||
[break])
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
AM_CONDITIONAL([COND_INTERNAL_SHA256],
|
|
||||||
[test "x$ac_cv_func_SHA256_Init" != xyes \
|
|
||||||
&& test "x$ac_cv_func_SHA256Init" != xyes \
|
|
||||||
&& test "x$ac_cv_func_CC_SHA256_Init" != xyes])
|
|
||||||
|
|
||||||
# Check for SSE2 intrinsics.
|
|
||||||
AC_CHECK_DECL([_mm_movemask_epi8],
|
|
||||||
[AC_DEFINE([HAVE__MM_MOVEMASK_EPI8], [1],
|
|
||||||
[Define to 1 if _mm_movemask_epi8 is available.])],
|
|
||||||
[],
|
|
||||||
[#ifdef HAVE_IMMINTRIN_H
|
|
||||||
#include <immintrin.h>
|
|
||||||
#endif])
|
|
||||||
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
# If using GCC, set some additional AM_CFLAGS:
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
if test "$GCC" = yes ; then
|
|
||||||
echo
|
|
||||||
echo "GCC extensions:"
|
|
||||||
fi
|
|
||||||
|
|
||||||
# Always do the visibility check but don't set AM_CFLAGS on Windows.
|
|
||||||
# This way things get set properly even on Windows.
|
|
||||||
gl_VISIBILITY
|
|
||||||
if test -n "$CFLAG_VISIBILITY" && test "$is_w32" = no; then
|
|
||||||
AM_CFLAGS="$AM_CFLAGS $CFLAG_VISIBILITY"
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test "$GCC" = yes ; then
|
|
||||||
# Enable as much warnings as possible. These commented warnings won't
|
|
||||||
# work for this package though:
|
|
||||||
# * -Wunreachable-code breaks several assert(0) cases, which are
|
|
||||||
# backed up with "return LZMA_PROG_ERROR".
|
|
||||||
# * -Wcast-qual would break various things where we need a non-const
|
|
||||||
# pointer although we don't modify anything through it.
|
|
||||||
# * -Wcast-align breaks optimized CRC32 and CRC64 implementation
|
|
||||||
# on some architectures (not on x86), where this warning is bogus,
|
|
||||||
# because we take care of correct alignment.
|
|
||||||
# * -Winline, -Wdisabled-optimization, -Wunsafe-loop-optimizations
|
|
||||||
# don't seem so useful here; at least the last one gives some
|
|
||||||
# warnings which are not bugs.
|
|
||||||
for NEW_FLAG in \
|
|
||||||
-Wall \
|
|
||||||
-Wextra \
|
|
||||||
-Wvla \
|
|
||||||
-Wformat=2 \
|
|
||||||
-Winit-self \
|
|
||||||
-Wmissing-include-dirs \
|
|
||||||
-Wstrict-aliasing \
|
|
||||||
-Wfloat-equal \
|
|
||||||
-Wundef \
|
|
||||||
-Wshadow \
|
|
||||||
-Wpointer-arith \
|
|
||||||
-Wbad-function-cast \
|
|
||||||
-Wwrite-strings \
|
|
||||||
-Wlogical-op \
|
|
||||||
-Waggregate-return \
|
|
||||||
-Wstrict-prototypes \
|
|
||||||
-Wold-style-definition \
|
|
||||||
-Wmissing-prototypes \
|
|
||||||
-Wmissing-declarations \
|
|
||||||
-Wmissing-noreturn \
|
|
||||||
-Wredundant-decls
|
|
||||||
do
|
|
||||||
AC_MSG_CHECKING([if $CC accepts $NEW_FLAG])
|
|
||||||
OLD_CFLAGS="$CFLAGS"
|
|
||||||
CFLAGS="$CFLAGS $NEW_FLAG -Werror"
|
|
||||||
AC_COMPILE_IFELSE([AC_LANG_SOURCE(
|
|
||||||
[void foo(void); void foo(void) { }])], [
|
|
||||||
AM_CFLAGS="$AM_CFLAGS $NEW_FLAG"
|
|
||||||
AC_MSG_RESULT([yes])
|
|
||||||
], [
|
|
||||||
AC_MSG_RESULT([no])
|
|
||||||
])
|
|
||||||
CFLAGS="$OLD_CFLAGS"
|
|
||||||
done
|
|
||||||
|
|
||||||
AC_ARG_ENABLE([werror],
|
|
||||||
AS_HELP_STRING([--enable-werror], [Enable -Werror to abort
|
|
||||||
compilation on all compiler warnings.]),
|
|
||||||
[], [enable_werror=no])
|
|
||||||
if test "x$enable_werror" = "xyes"; then
|
|
||||||
AM_CFLAGS="$AM_CFLAGS -Werror"
|
|
||||||
fi
|
|
||||||
fi
|
|
||||||
|
|
||||||
|
|
||||||
###############################################################################
|
|
||||||
# Create the makefiles and config.h
|
|
||||||
###############################################################################
|
|
||||||
|
|
||||||
echo
|
|
||||||
|
|
||||||
# Don't build the lib directory at all if we don't need any replacement
|
|
||||||
# functions.
|
|
||||||
AM_CONDITIONAL([COND_GNULIB], test -n "$LIBOBJS")
|
|
||||||
|
|
||||||
# Add default AM_CFLAGS.
|
|
||||||
AC_SUBST([AM_CFLAGS])
|
|
||||||
|
|
||||||
# This is needed for src/scripts.
|
|
||||||
xz=`echo xz | sed "$program_transform_name"`
|
|
||||||
AC_SUBST([xz])
|
|
||||||
|
|
||||||
AC_CONFIG_FILES([
|
|
||||||
Doxyfile
|
|
||||||
Makefile
|
|
||||||
po/Makefile.in
|
|
||||||
lib/Makefile
|
|
||||||
src/Makefile
|
|
||||||
src/liblzma/Makefile
|
|
||||||
src/liblzma/api/Makefile
|
|
||||||
src/xz/Makefile
|
|
||||||
src/xzdec/Makefile
|
|
||||||
src/lzmainfo/Makefile
|
|
||||||
src/scripts/Makefile
|
|
||||||
tests/Makefile
|
|
||||||
debug/Makefile
|
|
||||||
])
|
|
||||||
AC_CONFIG_FILES([src/scripts/xzdiff], [chmod +x src/scripts/xzdiff])
|
|
||||||
AC_CONFIG_FILES([src/scripts/xzgrep], [chmod +x src/scripts/xzgrep])
|
|
||||||
AC_CONFIG_FILES([src/scripts/xzmore], [chmod +x src/scripts/xzmore])
|
|
||||||
AC_CONFIG_FILES([src/scripts/xzless], [chmod +x src/scripts/xzless])
|
|
||||||
|
|
||||||
AC_OUTPUT
|
|
||||||
|
|
||||||
# Some warnings
|
|
||||||
if test x$tuklib_cv_physmem_method = xunknown; then
|
|
||||||
echo
|
|
||||||
echo "WARNING:"
|
|
||||||
echo "No supported method to detect the amount of RAM."
|
|
||||||
echo "Consider using --enable-assume-ram (if you didn't already)"
|
|
||||||
echo "or make a patch to add support for this operating system."
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test x$tuklib_cv_cpucores_method = xunknown; then
|
|
||||||
echo
|
|
||||||
echo "WARNING:"
|
|
||||||
echo "No supported method to detect the number of CPU cores."
|
|
||||||
fi
|
|
||||||
|
|
||||||
if test "x$enable_threads$enable_small" = xnoyes; then
|
|
||||||
echo
|
|
||||||
echo "NOTE:"
|
|
||||||
echo "liblzma will be thread unsafe due the combination"
|
|
||||||
echo "of --disable-threads --enable-small."
|
|
||||||
fi
|
|
||||||
78
contrib/README.contrib
Normal file
78
contrib/README.contrib
Normal file
@@ -0,0 +1,78 @@
|
|||||||
|
All files under this contrib directory are UNSUPPORTED. There were
|
||||||
|
provided by users of zlib and were not tested by the authors of zlib.
|
||||||
|
Use at your own risk. Please contact the authors of the contributions
|
||||||
|
for help about these, not the zlib authors. Thanks.
|
||||||
|
|
||||||
|
|
||||||
|
ada/ by Dmitriy Anisimkov <anisimkov@yahoo.com>
|
||||||
|
Support for Ada
|
||||||
|
See http://zlib-ada.sourceforge.net/
|
||||||
|
|
||||||
|
amd64/ by Mikhail Teterin <mi@ALDAN.algebra.com>
|
||||||
|
asm code for AMD64
|
||||||
|
See patch at http://www.freebsd.org/cgi/query-pr.cgi?pr=bin/96393
|
||||||
|
|
||||||
|
asm686/ by Brian Raiter <breadbox@muppetlabs.com>
|
||||||
|
asm code for Pentium and PPro/PII, using the AT&T (GNU as) syntax
|
||||||
|
See http://www.muppetlabs.com/~breadbox/software/assembly.html
|
||||||
|
|
||||||
|
blast/ by Mark Adler <madler@alumni.caltech.edu>
|
||||||
|
Decompressor for output of PKWare Data Compression Library (DCL)
|
||||||
|
|
||||||
|
delphi/ by Cosmin Truta <cosmint@cs.ubbcluj.ro>
|
||||||
|
Support for Delphi and C++ Builder
|
||||||
|
|
||||||
|
dotzlib/ by Henrik Ravn <henrik@ravn.com>
|
||||||
|
Support for Microsoft .Net and Visual C++ .Net
|
||||||
|
|
||||||
|
gcc_gvmat64/by Gilles Vollant <info@winimage.com>
|
||||||
|
GCC Version of x86 64-bit (AMD64 and Intel EM64t) code for x64
|
||||||
|
assembler to replace longest_match() and inflate_fast()
|
||||||
|
|
||||||
|
infback9/ by Mark Adler <madler@alumni.caltech.edu>
|
||||||
|
Unsupported diffs to infback to decode the deflate64 format
|
||||||
|
|
||||||
|
inflate86/ by Chris Anderson <christop@charm.net>
|
||||||
|
Tuned x86 gcc asm code to replace inflate_fast()
|
||||||
|
|
||||||
|
iostream/ by Kevin Ruland <kevin@rodin.wustl.edu>
|
||||||
|
A C++ I/O streams interface to the zlib gz* functions
|
||||||
|
|
||||||
|
iostream2/ by Tyge Løvset <Tyge.Lovset@cmr.no>
|
||||||
|
Another C++ I/O streams interface
|
||||||
|
|
||||||
|
iostream3/ by Ludwig Schwardt <schwardt@sun.ac.za>
|
||||||
|
and Kevin Ruland <kevin@rodin.wustl.edu>
|
||||||
|
Yet another C++ I/O streams interface
|
||||||
|
|
||||||
|
masmx64/ by Gilles Vollant <info@winimage.com>
|
||||||
|
x86 64-bit (AMD64 and Intel EM64t) code for x64 assembler to
|
||||||
|
replace longest_match() and inflate_fast(), also masm x86
|
||||||
|
64-bits translation of Chris Anderson inflate_fast()
|
||||||
|
|
||||||
|
masmx86/ by Gilles Vollant <info@winimage.com>
|
||||||
|
x86 asm code to replace longest_match() and inflate_fast(),
|
||||||
|
for Visual C++ and MASM (32 bits).
|
||||||
|
Based on Brian Raiter (asm686) and Chris Anderson (inflate86)
|
||||||
|
|
||||||
|
minizip/ by Gilles Vollant <info@winimage.com>
|
||||||
|
Mini zip and unzip based on zlib
|
||||||
|
Includes Zip64 support by Mathias Svensson <mathias@result42.com>
|
||||||
|
See http://www.winimage.com/zLibDll/minizip.html
|
||||||
|
|
||||||
|
pascal/ by Bob Dellaca <bobdl@xtra.co.nz> et al.
|
||||||
|
Support for Pascal
|
||||||
|
|
||||||
|
puff/ by Mark Adler <madler@alumni.caltech.edu>
|
||||||
|
Small, low memory usage inflate. Also serves to provide an
|
||||||
|
unambiguous description of the deflate format.
|
||||||
|
|
||||||
|
testzlib/ by Gilles Vollant <info@winimage.com>
|
||||||
|
Example of the use of zlib
|
||||||
|
|
||||||
|
untgz/ by Pedro A. Aranda Gutierrez <paag@tid.es>
|
||||||
|
A very simple tar.gz file extractor using zlib
|
||||||
|
|
||||||
|
vstudio/ by Gilles Vollant <info@winimage.com>
|
||||||
|
Building a minizip-enhanced zlib with Microsoft Visual Studio
|
||||||
|
Includes vc11 from kreuzerkrieg and vc12 from davispuh
|
||||||
106
contrib/ada/buffer_demo.adb
Normal file
106
contrib/ada/buffer_demo.adb
Normal file
@@ -0,0 +1,106 @@
|
|||||||
|
----------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2004 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- Open source license information is in the zlib.ads file. --
|
||||||
|
----------------------------------------------------------------
|
||||||
|
--
|
||||||
|
-- $Id: buffer_demo.adb,v 1.3 2004/09/06 06:55:35 vagul Exp $
|
||||||
|
|
||||||
|
-- This demo program provided by Dr Steve Sangwine <sjs@essex.ac.uk>
|
||||||
|
--
|
||||||
|
-- Demonstration of a problem with Zlib-Ada (already fixed) when a buffer
|
||||||
|
-- of exactly the correct size is used for decompressed data, and the last
|
||||||
|
-- few bytes passed in to Zlib are checksum bytes.
|
||||||
|
|
||||||
|
-- This program compresses a string of text, and then decompresses the
|
||||||
|
-- compressed text into a buffer of the same size as the original text.
|
||||||
|
|
||||||
|
with Ada.Streams; use Ada.Streams;
|
||||||
|
with Ada.Text_IO;
|
||||||
|
|
||||||
|
with ZLib; use ZLib;
|
||||||
|
|
||||||
|
procedure Buffer_Demo is
|
||||||
|
EOL : Character renames ASCII.LF;
|
||||||
|
Text : constant String
|
||||||
|
:= "Four score and seven years ago our fathers brought forth," & EOL &
|
||||||
|
"upon this continent, a new nation, conceived in liberty," & EOL &
|
||||||
|
"and dedicated to the proposition that `all men are created equal'.";
|
||||||
|
|
||||||
|
Source : Stream_Element_Array (1 .. Text'Length);
|
||||||
|
for Source'Address use Text'Address;
|
||||||
|
|
||||||
|
begin
|
||||||
|
Ada.Text_IO.Put (Text);
|
||||||
|
Ada.Text_IO.New_Line;
|
||||||
|
Ada.Text_IO.Put_Line
|
||||||
|
("Uncompressed size : " & Positive'Image (Text'Length) & " bytes");
|
||||||
|
|
||||||
|
declare
|
||||||
|
Compressed_Data : Stream_Element_Array (1 .. Text'Length);
|
||||||
|
L : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
Compress : declare
|
||||||
|
Compressor : Filter_Type;
|
||||||
|
I : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
Deflate_Init (Compressor);
|
||||||
|
|
||||||
|
-- Compress the whole of T at once.
|
||||||
|
|
||||||
|
Translate (Compressor, Source, I, Compressed_Data, L, Finish);
|
||||||
|
pragma Assert (I = Source'Last);
|
||||||
|
|
||||||
|
Close (Compressor);
|
||||||
|
|
||||||
|
Ada.Text_IO.Put_Line
|
||||||
|
("Compressed size : "
|
||||||
|
& Stream_Element_Offset'Image (L) & " bytes");
|
||||||
|
end Compress;
|
||||||
|
|
||||||
|
-- Now we decompress the data, passing short blocks of data to Zlib
|
||||||
|
-- (because this demonstrates the problem - the last block passed will
|
||||||
|
-- contain checksum information and there will be no output, only a
|
||||||
|
-- check inside Zlib that the checksum is correct).
|
||||||
|
|
||||||
|
Decompress : declare
|
||||||
|
Decompressor : Filter_Type;
|
||||||
|
|
||||||
|
Uncompressed_Data : Stream_Element_Array (1 .. Text'Length);
|
||||||
|
|
||||||
|
Block_Size : constant := 4;
|
||||||
|
-- This makes sure that the last block contains
|
||||||
|
-- only Adler checksum data.
|
||||||
|
|
||||||
|
P : Stream_Element_Offset := Compressed_Data'First - 1;
|
||||||
|
O : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
Inflate_Init (Decompressor);
|
||||||
|
|
||||||
|
loop
|
||||||
|
Translate
|
||||||
|
(Decompressor,
|
||||||
|
Compressed_Data
|
||||||
|
(P + 1 .. Stream_Element_Offset'Min (P + Block_Size, L)),
|
||||||
|
P,
|
||||||
|
Uncompressed_Data
|
||||||
|
(Total_Out (Decompressor) + 1 .. Uncompressed_Data'Last),
|
||||||
|
O,
|
||||||
|
No_Flush);
|
||||||
|
|
||||||
|
Ada.Text_IO.Put_Line
|
||||||
|
("Total in : " & Count'Image (Total_In (Decompressor)) &
|
||||||
|
", out : " & Count'Image (Total_Out (Decompressor)));
|
||||||
|
|
||||||
|
exit when P = L;
|
||||||
|
end loop;
|
||||||
|
|
||||||
|
Ada.Text_IO.New_Line;
|
||||||
|
Ada.Text_IO.Put_Line
|
||||||
|
("Decompressed text matches original text : "
|
||||||
|
& Boolean'Image (Uncompressed_Data = Source));
|
||||||
|
end Decompress;
|
||||||
|
end;
|
||||||
|
end Buffer_Demo;
|
||||||
156
contrib/ada/mtest.adb
Normal file
156
contrib/ada/mtest.adb
Normal file
@@ -0,0 +1,156 @@
|
|||||||
|
----------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2003 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- Open source license information is in the zlib.ads file. --
|
||||||
|
----------------------------------------------------------------
|
||||||
|
-- Continuous test for ZLib multithreading. If the test would fail
|
||||||
|
-- we should provide thread safe allocation routines for the Z_Stream.
|
||||||
|
--
|
||||||
|
-- $Id: mtest.adb,v 1.4 2004/07/23 07:49:54 vagul Exp $
|
||||||
|
|
||||||
|
with ZLib;
|
||||||
|
with Ada.Streams;
|
||||||
|
with Ada.Numerics.Discrete_Random;
|
||||||
|
with Ada.Text_IO;
|
||||||
|
with Ada.Exceptions;
|
||||||
|
with Ada.Task_Identification;
|
||||||
|
|
||||||
|
procedure MTest is
|
||||||
|
use Ada.Streams;
|
||||||
|
use ZLib;
|
||||||
|
|
||||||
|
Stop : Boolean := False;
|
||||||
|
|
||||||
|
pragma Atomic (Stop);
|
||||||
|
|
||||||
|
subtype Visible_Symbols is Stream_Element range 16#20# .. 16#7E#;
|
||||||
|
|
||||||
|
package Random_Elements is
|
||||||
|
new Ada.Numerics.Discrete_Random (Visible_Symbols);
|
||||||
|
|
||||||
|
task type Test_Task;
|
||||||
|
|
||||||
|
task body Test_Task is
|
||||||
|
Buffer : Stream_Element_Array (1 .. 100_000);
|
||||||
|
Gen : Random_Elements.Generator;
|
||||||
|
|
||||||
|
Buffer_First : Stream_Element_Offset;
|
||||||
|
Compare_First : Stream_Element_Offset;
|
||||||
|
|
||||||
|
Deflate : Filter_Type;
|
||||||
|
Inflate : Filter_Type;
|
||||||
|
|
||||||
|
procedure Further (Item : in Stream_Element_Array);
|
||||||
|
|
||||||
|
procedure Read_Buffer
|
||||||
|
(Item : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Last : out Ada.Streams.Stream_Element_Offset);
|
||||||
|
|
||||||
|
-------------
|
||||||
|
-- Further --
|
||||||
|
-------------
|
||||||
|
|
||||||
|
procedure Further (Item : in Stream_Element_Array) is
|
||||||
|
|
||||||
|
procedure Compare (Item : in Stream_Element_Array);
|
||||||
|
|
||||||
|
-------------
|
||||||
|
-- Compare --
|
||||||
|
-------------
|
||||||
|
|
||||||
|
procedure Compare (Item : in Stream_Element_Array) is
|
||||||
|
Next_First : Stream_Element_Offset := Compare_First + Item'Length;
|
||||||
|
begin
|
||||||
|
if Buffer (Compare_First .. Next_First - 1) /= Item then
|
||||||
|
raise Program_Error;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
Compare_First := Next_First;
|
||||||
|
end Compare;
|
||||||
|
|
||||||
|
procedure Compare_Write is new ZLib.Write (Write => Compare);
|
||||||
|
begin
|
||||||
|
Compare_Write (Inflate, Item, No_Flush);
|
||||||
|
end Further;
|
||||||
|
|
||||||
|
-----------------
|
||||||
|
-- Read_Buffer --
|
||||||
|
-----------------
|
||||||
|
|
||||||
|
procedure Read_Buffer
|
||||||
|
(Item : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Last : out Ada.Streams.Stream_Element_Offset)
|
||||||
|
is
|
||||||
|
Buff_Diff : Stream_Element_Offset := Buffer'Last - Buffer_First;
|
||||||
|
Next_First : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
if Item'Length <= Buff_Diff then
|
||||||
|
Last := Item'Last;
|
||||||
|
|
||||||
|
Next_First := Buffer_First + Item'Length;
|
||||||
|
|
||||||
|
Item := Buffer (Buffer_First .. Next_First - 1);
|
||||||
|
|
||||||
|
Buffer_First := Next_First;
|
||||||
|
else
|
||||||
|
Last := Item'First + Buff_Diff;
|
||||||
|
Item (Item'First .. Last) := Buffer (Buffer_First .. Buffer'Last);
|
||||||
|
Buffer_First := Buffer'Last + 1;
|
||||||
|
end if;
|
||||||
|
end Read_Buffer;
|
||||||
|
|
||||||
|
procedure Translate is new Generic_Translate
|
||||||
|
(Data_In => Read_Buffer,
|
||||||
|
Data_Out => Further);
|
||||||
|
|
||||||
|
begin
|
||||||
|
Random_Elements.Reset (Gen);
|
||||||
|
|
||||||
|
Buffer := (others => 20);
|
||||||
|
|
||||||
|
Main : loop
|
||||||
|
for J in Buffer'Range loop
|
||||||
|
Buffer (J) := Random_Elements.Random (Gen);
|
||||||
|
|
||||||
|
Deflate_Init (Deflate);
|
||||||
|
Inflate_Init (Inflate);
|
||||||
|
|
||||||
|
Buffer_First := Buffer'First;
|
||||||
|
Compare_First := Buffer'First;
|
||||||
|
|
||||||
|
Translate (Deflate);
|
||||||
|
|
||||||
|
if Compare_First /= Buffer'Last + 1 then
|
||||||
|
raise Program_Error;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
Ada.Text_IO.Put_Line
|
||||||
|
(Ada.Task_Identification.Image
|
||||||
|
(Ada.Task_Identification.Current_Task)
|
||||||
|
& Stream_Element_Offset'Image (J)
|
||||||
|
& ZLib.Count'Image (Total_Out (Deflate)));
|
||||||
|
|
||||||
|
Close (Deflate);
|
||||||
|
Close (Inflate);
|
||||||
|
|
||||||
|
exit Main when Stop;
|
||||||
|
end loop;
|
||||||
|
end loop Main;
|
||||||
|
exception
|
||||||
|
when E : others =>
|
||||||
|
Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Information (E));
|
||||||
|
Stop := True;
|
||||||
|
end Test_Task;
|
||||||
|
|
||||||
|
Test : array (1 .. 4) of Test_Task;
|
||||||
|
|
||||||
|
pragma Unreferenced (Test);
|
||||||
|
|
||||||
|
Dummy : Character;
|
||||||
|
|
||||||
|
begin
|
||||||
|
Ada.Text_IO.Get_Immediate (Dummy);
|
||||||
|
Stop := True;
|
||||||
|
end MTest;
|
||||||
156
contrib/ada/read.adb
Normal file
156
contrib/ada/read.adb
Normal file
@@ -0,0 +1,156 @@
|
|||||||
|
----------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2003 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- Open source license information is in the zlib.ads file. --
|
||||||
|
----------------------------------------------------------------
|
||||||
|
|
||||||
|
-- $Id: read.adb,v 1.8 2004/05/31 10:53:40 vagul Exp $
|
||||||
|
|
||||||
|
-- Test/demo program for the generic read interface.
|
||||||
|
|
||||||
|
with Ada.Numerics.Discrete_Random;
|
||||||
|
with Ada.Streams;
|
||||||
|
with Ada.Text_IO;
|
||||||
|
|
||||||
|
with ZLib;
|
||||||
|
|
||||||
|
procedure Read is
|
||||||
|
|
||||||
|
use Ada.Streams;
|
||||||
|
|
||||||
|
------------------------------------
|
||||||
|
-- Test configuration parameters --
|
||||||
|
------------------------------------
|
||||||
|
|
||||||
|
File_Size : Stream_Element_Offset := 100_000;
|
||||||
|
|
||||||
|
Continuous : constant Boolean := False;
|
||||||
|
-- If this constant is True, the test would be repeated again and again,
|
||||||
|
-- with increment File_Size for every iteration.
|
||||||
|
|
||||||
|
Header : constant ZLib.Header_Type := ZLib.Default;
|
||||||
|
-- Do not use Header other than Default in ZLib versions 1.1.4 and older.
|
||||||
|
|
||||||
|
Init_Random : constant := 8;
|
||||||
|
-- We are using the same random sequence, in case of we catch bug,
|
||||||
|
-- so we would be able to reproduce it.
|
||||||
|
|
||||||
|
-- End --
|
||||||
|
|
||||||
|
Pack_Size : Stream_Element_Offset;
|
||||||
|
Offset : Stream_Element_Offset;
|
||||||
|
|
||||||
|
Filter : ZLib.Filter_Type;
|
||||||
|
|
||||||
|
subtype Visible_Symbols
|
||||||
|
is Stream_Element range 16#20# .. 16#7E#;
|
||||||
|
|
||||||
|
package Random_Elements is new
|
||||||
|
Ada.Numerics.Discrete_Random (Visible_Symbols);
|
||||||
|
|
||||||
|
Gen : Random_Elements.Generator;
|
||||||
|
Period : constant Stream_Element_Offset := 200;
|
||||||
|
-- Period constant variable for random generator not to be very random.
|
||||||
|
-- Bigger period, harder random.
|
||||||
|
|
||||||
|
Read_Buffer : Stream_Element_Array (1 .. 2048);
|
||||||
|
Read_First : Stream_Element_Offset;
|
||||||
|
Read_Last : Stream_Element_Offset;
|
||||||
|
|
||||||
|
procedure Reset;
|
||||||
|
|
||||||
|
procedure Read
|
||||||
|
(Item : out Stream_Element_Array;
|
||||||
|
Last : out Stream_Element_Offset);
|
||||||
|
-- this procedure is for generic instantiation of
|
||||||
|
-- ZLib.Read
|
||||||
|
-- reading data from the File_In.
|
||||||
|
|
||||||
|
procedure Read is new ZLib.Read
|
||||||
|
(Read,
|
||||||
|
Read_Buffer,
|
||||||
|
Rest_First => Read_First,
|
||||||
|
Rest_Last => Read_Last);
|
||||||
|
|
||||||
|
----------
|
||||||
|
-- Read --
|
||||||
|
----------
|
||||||
|
|
||||||
|
procedure Read
|
||||||
|
(Item : out Stream_Element_Array;
|
||||||
|
Last : out Stream_Element_Offset) is
|
||||||
|
begin
|
||||||
|
Last := Stream_Element_Offset'Min
|
||||||
|
(Item'Last,
|
||||||
|
Item'First + File_Size - Offset);
|
||||||
|
|
||||||
|
for J in Item'First .. Last loop
|
||||||
|
if J < Item'First + Period then
|
||||||
|
Item (J) := Random_Elements.Random (Gen);
|
||||||
|
else
|
||||||
|
Item (J) := Item (J - Period);
|
||||||
|
end if;
|
||||||
|
|
||||||
|
Offset := Offset + 1;
|
||||||
|
end loop;
|
||||||
|
end Read;
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- Reset --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
procedure Reset is
|
||||||
|
begin
|
||||||
|
Random_Elements.Reset (Gen, Init_Random);
|
||||||
|
Pack_Size := 0;
|
||||||
|
Offset := 1;
|
||||||
|
Read_First := Read_Buffer'Last + 1;
|
||||||
|
Read_Last := Read_Buffer'Last;
|
||||||
|
end Reset;
|
||||||
|
|
||||||
|
begin
|
||||||
|
Ada.Text_IO.Put_Line ("ZLib " & ZLib.Version);
|
||||||
|
|
||||||
|
loop
|
||||||
|
for Level in ZLib.Compression_Level'Range loop
|
||||||
|
|
||||||
|
Ada.Text_IO.Put ("Level ="
|
||||||
|
& ZLib.Compression_Level'Image (Level));
|
||||||
|
|
||||||
|
-- Deflate using generic instantiation.
|
||||||
|
|
||||||
|
ZLib.Deflate_Init
|
||||||
|
(Filter,
|
||||||
|
Level,
|
||||||
|
Header => Header);
|
||||||
|
|
||||||
|
Reset;
|
||||||
|
|
||||||
|
Ada.Text_IO.Put
|
||||||
|
(Stream_Element_Offset'Image (File_Size) & " ->");
|
||||||
|
|
||||||
|
loop
|
||||||
|
declare
|
||||||
|
Buffer : Stream_Element_Array (1 .. 1024);
|
||||||
|
Last : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
Read (Filter, Buffer, Last);
|
||||||
|
|
||||||
|
Pack_Size := Pack_Size + Last - Buffer'First + 1;
|
||||||
|
|
||||||
|
exit when Last < Buffer'Last;
|
||||||
|
end;
|
||||||
|
end loop;
|
||||||
|
|
||||||
|
Ada.Text_IO.Put_Line (Stream_Element_Offset'Image (Pack_Size));
|
||||||
|
|
||||||
|
ZLib.Close (Filter);
|
||||||
|
end loop;
|
||||||
|
|
||||||
|
exit when not Continuous;
|
||||||
|
|
||||||
|
File_Size := File_Size + 1;
|
||||||
|
end loop;
|
||||||
|
end Read;
|
||||||
65
contrib/ada/readme.txt
Normal file
65
contrib/ada/readme.txt
Normal file
@@ -0,0 +1,65 @@
|
|||||||
|
ZLib for Ada thick binding (ZLib.Ada)
|
||||||
|
Release 1.3
|
||||||
|
|
||||||
|
ZLib.Ada is a thick binding interface to the popular ZLib data
|
||||||
|
compression library, available at http://www.gzip.org/zlib/.
|
||||||
|
It provides Ada-style access to the ZLib C library.
|
||||||
|
|
||||||
|
|
||||||
|
Here are the main changes since ZLib.Ada 1.2:
|
||||||
|
|
||||||
|
- Attension: ZLib.Read generic routine have a initialization requirement
|
||||||
|
for Read_Last parameter now. It is a bit incompartible with previous version,
|
||||||
|
but extends functionality, we could use new parameters Allow_Read_Some and
|
||||||
|
Flush now.
|
||||||
|
|
||||||
|
- Added Is_Open routines to ZLib and ZLib.Streams packages.
|
||||||
|
|
||||||
|
- Add pragma Assert to check Stream_Element is 8 bit.
|
||||||
|
|
||||||
|
- Fix extraction to buffer with exact known decompressed size. Error reported by
|
||||||
|
Steve Sangwine.
|
||||||
|
|
||||||
|
- Fix definition of ULong (changed to unsigned_long), fix regression on 64 bits
|
||||||
|
computers. Patch provided by Pascal Obry.
|
||||||
|
|
||||||
|
- Add Status_Error exception definition.
|
||||||
|
|
||||||
|
- Add pragma Assertion that Ada.Streams.Stream_Element size is 8 bit.
|
||||||
|
|
||||||
|
|
||||||
|
How to build ZLib.Ada under GNAT
|
||||||
|
|
||||||
|
You should have the ZLib library already build on your computer, before
|
||||||
|
building ZLib.Ada. Make the directory of ZLib.Ada sources current and
|
||||||
|
issue the command:
|
||||||
|
|
||||||
|
gnatmake test -largs -L<directory where libz.a is> -lz
|
||||||
|
|
||||||
|
Or use the GNAT project file build for GNAT 3.15 or later:
|
||||||
|
|
||||||
|
gnatmake -Pzlib.gpr -L<directory where libz.a is>
|
||||||
|
|
||||||
|
|
||||||
|
How to build ZLib.Ada under Aonix ObjectAda for Win32 7.2.2
|
||||||
|
|
||||||
|
1. Make a project with all *.ads and *.adb files from the distribution.
|
||||||
|
2. Build the libz.a library from the ZLib C sources.
|
||||||
|
3. Rename libz.a to z.lib.
|
||||||
|
4. Add the library z.lib to the project.
|
||||||
|
5. Add the libc.lib library from the ObjectAda distribution to the project.
|
||||||
|
6. Build the executable using test.adb as a main procedure.
|
||||||
|
|
||||||
|
|
||||||
|
How to use ZLib.Ada
|
||||||
|
|
||||||
|
The source files test.adb and read.adb are small demo programs that show
|
||||||
|
the main functionality of ZLib.Ada.
|
||||||
|
|
||||||
|
The routines from the package specifications are commented.
|
||||||
|
|
||||||
|
|
||||||
|
Homepage: http://zlib-ada.sourceforge.net/
|
||||||
|
Author: Dmitriy Anisimkov <anisimkov@yahoo.com>
|
||||||
|
|
||||||
|
Contributors: Pascal Obry <pascal@obry.org>, Steve Sangwine <sjs@essex.ac.uk>
|
||||||
463
contrib/ada/test.adb
Normal file
463
contrib/ada/test.adb
Normal file
@@ -0,0 +1,463 @@
|
|||||||
|
----------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2003 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- Open source license information is in the zlib.ads file. --
|
||||||
|
----------------------------------------------------------------
|
||||||
|
|
||||||
|
-- $Id: test.adb,v 1.17 2003/08/12 12:13:30 vagul Exp $
|
||||||
|
|
||||||
|
-- The program has a few aims.
|
||||||
|
-- 1. Test ZLib.Ada95 thick binding functionality.
|
||||||
|
-- 2. Show the example of use main functionality of the ZLib.Ada95 binding.
|
||||||
|
-- 3. Build this program automatically compile all ZLib.Ada95 packages under
|
||||||
|
-- GNAT Ada95 compiler.
|
||||||
|
|
||||||
|
with ZLib.Streams;
|
||||||
|
with Ada.Streams.Stream_IO;
|
||||||
|
with Ada.Numerics.Discrete_Random;
|
||||||
|
|
||||||
|
with Ada.Text_IO;
|
||||||
|
|
||||||
|
with Ada.Calendar;
|
||||||
|
|
||||||
|
procedure Test is
|
||||||
|
|
||||||
|
use Ada.Streams;
|
||||||
|
use Stream_IO;
|
||||||
|
|
||||||
|
------------------------------------
|
||||||
|
-- Test configuration parameters --
|
||||||
|
------------------------------------
|
||||||
|
|
||||||
|
File_Size : Count := 100_000;
|
||||||
|
Continuous : constant Boolean := False;
|
||||||
|
|
||||||
|
Header : constant ZLib.Header_Type := ZLib.Default;
|
||||||
|
-- ZLib.None;
|
||||||
|
-- ZLib.Auto;
|
||||||
|
-- ZLib.GZip;
|
||||||
|
-- Do not use Header other then Default in ZLib versions 1.1.4
|
||||||
|
-- and older.
|
||||||
|
|
||||||
|
Strategy : constant ZLib.Strategy_Type := ZLib.Default_Strategy;
|
||||||
|
Init_Random : constant := 10;
|
||||||
|
|
||||||
|
-- End --
|
||||||
|
|
||||||
|
In_File_Name : constant String := "testzlib.in";
|
||||||
|
-- Name of the input file
|
||||||
|
|
||||||
|
Z_File_Name : constant String := "testzlib.zlb";
|
||||||
|
-- Name of the compressed file.
|
||||||
|
|
||||||
|
Out_File_Name : constant String := "testzlib.out";
|
||||||
|
-- Name of the decompressed file.
|
||||||
|
|
||||||
|
File_In : File_Type;
|
||||||
|
File_Out : File_Type;
|
||||||
|
File_Back : File_Type;
|
||||||
|
File_Z : ZLib.Streams.Stream_Type;
|
||||||
|
|
||||||
|
Filter : ZLib.Filter_Type;
|
||||||
|
|
||||||
|
Time_Stamp : Ada.Calendar.Time;
|
||||||
|
|
||||||
|
procedure Generate_File;
|
||||||
|
-- Generate file of spetsified size with some random data.
|
||||||
|
-- The random data is repeatable, for the good compression.
|
||||||
|
|
||||||
|
procedure Compare_Streams
|
||||||
|
(Left, Right : in out Root_Stream_Type'Class);
|
||||||
|
-- The procedure compearing data in 2 streams.
|
||||||
|
-- It is for compare data before and after compression/decompression.
|
||||||
|
|
||||||
|
procedure Compare_Files (Left, Right : String);
|
||||||
|
-- Compare files. Based on the Compare_Streams.
|
||||||
|
|
||||||
|
procedure Copy_Streams
|
||||||
|
(Source, Target : in out Root_Stream_Type'Class;
|
||||||
|
Buffer_Size : in Stream_Element_Offset := 1024);
|
||||||
|
-- Copying data from one stream to another. It is for test stream
|
||||||
|
-- interface of the library.
|
||||||
|
|
||||||
|
procedure Data_In
|
||||||
|
(Item : out Stream_Element_Array;
|
||||||
|
Last : out Stream_Element_Offset);
|
||||||
|
-- this procedure is for generic instantiation of
|
||||||
|
-- ZLib.Generic_Translate.
|
||||||
|
-- reading data from the File_In.
|
||||||
|
|
||||||
|
procedure Data_Out (Item : in Stream_Element_Array);
|
||||||
|
-- this procedure is for generic instantiation of
|
||||||
|
-- ZLib.Generic_Translate.
|
||||||
|
-- writing data to the File_Out.
|
||||||
|
|
||||||
|
procedure Stamp;
|
||||||
|
-- Store the timestamp to the local variable.
|
||||||
|
|
||||||
|
procedure Print_Statistic (Msg : String; Data_Size : ZLib.Count);
|
||||||
|
-- Print the time statistic with the message.
|
||||||
|
|
||||||
|
procedure Translate is new ZLib.Generic_Translate
|
||||||
|
(Data_In => Data_In,
|
||||||
|
Data_Out => Data_Out);
|
||||||
|
-- This procedure is moving data from File_In to File_Out
|
||||||
|
-- with compression or decompression, depend on initialization of
|
||||||
|
-- Filter parameter.
|
||||||
|
|
||||||
|
-------------------
|
||||||
|
-- Compare_Files --
|
||||||
|
-------------------
|
||||||
|
|
||||||
|
procedure Compare_Files (Left, Right : String) is
|
||||||
|
Left_File, Right_File : File_Type;
|
||||||
|
begin
|
||||||
|
Open (Left_File, In_File, Left);
|
||||||
|
Open (Right_File, In_File, Right);
|
||||||
|
Compare_Streams (Stream (Left_File).all, Stream (Right_File).all);
|
||||||
|
Close (Left_File);
|
||||||
|
Close (Right_File);
|
||||||
|
end Compare_Files;
|
||||||
|
|
||||||
|
---------------------
|
||||||
|
-- Compare_Streams --
|
||||||
|
---------------------
|
||||||
|
|
||||||
|
procedure Compare_Streams
|
||||||
|
(Left, Right : in out Ada.Streams.Root_Stream_Type'Class)
|
||||||
|
is
|
||||||
|
Left_Buffer, Right_Buffer : Stream_Element_Array (0 .. 16#FFF#);
|
||||||
|
Left_Last, Right_Last : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
loop
|
||||||
|
Read (Left, Left_Buffer, Left_Last);
|
||||||
|
Read (Right, Right_Buffer, Right_Last);
|
||||||
|
|
||||||
|
if Left_Last /= Right_Last then
|
||||||
|
Ada.Text_IO.Put_Line ("Compare error :"
|
||||||
|
& Stream_Element_Offset'Image (Left_Last)
|
||||||
|
& " /= "
|
||||||
|
& Stream_Element_Offset'Image (Right_Last));
|
||||||
|
|
||||||
|
raise Constraint_Error;
|
||||||
|
|
||||||
|
elsif Left_Buffer (0 .. Left_Last)
|
||||||
|
/= Right_Buffer (0 .. Right_Last)
|
||||||
|
then
|
||||||
|
Ada.Text_IO.Put_Line ("ERROR: IN and OUT files is not equal.");
|
||||||
|
raise Constraint_Error;
|
||||||
|
|
||||||
|
end if;
|
||||||
|
|
||||||
|
exit when Left_Last < Left_Buffer'Last;
|
||||||
|
end loop;
|
||||||
|
end Compare_Streams;
|
||||||
|
|
||||||
|
------------------
|
||||||
|
-- Copy_Streams --
|
||||||
|
------------------
|
||||||
|
|
||||||
|
procedure Copy_Streams
|
||||||
|
(Source, Target : in out Ada.Streams.Root_Stream_Type'Class;
|
||||||
|
Buffer_Size : in Stream_Element_Offset := 1024)
|
||||||
|
is
|
||||||
|
Buffer : Stream_Element_Array (1 .. Buffer_Size);
|
||||||
|
Last : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
loop
|
||||||
|
Read (Source, Buffer, Last);
|
||||||
|
Write (Target, Buffer (1 .. Last));
|
||||||
|
|
||||||
|
exit when Last < Buffer'Last;
|
||||||
|
end loop;
|
||||||
|
end Copy_Streams;
|
||||||
|
|
||||||
|
-------------
|
||||||
|
-- Data_In --
|
||||||
|
-------------
|
||||||
|
|
||||||
|
procedure Data_In
|
||||||
|
(Item : out Stream_Element_Array;
|
||||||
|
Last : out Stream_Element_Offset) is
|
||||||
|
begin
|
||||||
|
Read (File_In, Item, Last);
|
||||||
|
end Data_In;
|
||||||
|
|
||||||
|
--------------
|
||||||
|
-- Data_Out --
|
||||||
|
--------------
|
||||||
|
|
||||||
|
procedure Data_Out (Item : in Stream_Element_Array) is
|
||||||
|
begin
|
||||||
|
Write (File_Out, Item);
|
||||||
|
end Data_Out;
|
||||||
|
|
||||||
|
-------------------
|
||||||
|
-- Generate_File --
|
||||||
|
-------------------
|
||||||
|
|
||||||
|
procedure Generate_File is
|
||||||
|
subtype Visible_Symbols is Stream_Element range 16#20# .. 16#7E#;
|
||||||
|
|
||||||
|
package Random_Elements is
|
||||||
|
new Ada.Numerics.Discrete_Random (Visible_Symbols);
|
||||||
|
|
||||||
|
Gen : Random_Elements.Generator;
|
||||||
|
Buffer : Stream_Element_Array := (1 .. 77 => 16#20#) & 10;
|
||||||
|
|
||||||
|
Buffer_Count : constant Count := File_Size / Buffer'Length;
|
||||||
|
-- Number of same buffers in the packet.
|
||||||
|
|
||||||
|
Density : constant Count := 30; -- from 0 to Buffer'Length - 2;
|
||||||
|
|
||||||
|
procedure Fill_Buffer (J, D : in Count);
|
||||||
|
-- Change the part of the buffer.
|
||||||
|
|
||||||
|
-----------------
|
||||||
|
-- Fill_Buffer --
|
||||||
|
-----------------
|
||||||
|
|
||||||
|
procedure Fill_Buffer (J, D : in Count) is
|
||||||
|
begin
|
||||||
|
for K in 0 .. D loop
|
||||||
|
Buffer
|
||||||
|
(Stream_Element_Offset ((J + K) mod (Buffer'Length - 1) + 1))
|
||||||
|
:= Random_Elements.Random (Gen);
|
||||||
|
|
||||||
|
end loop;
|
||||||
|
end Fill_Buffer;
|
||||||
|
|
||||||
|
begin
|
||||||
|
Random_Elements.Reset (Gen, Init_Random);
|
||||||
|
|
||||||
|
Create (File_In, Out_File, In_File_Name);
|
||||||
|
|
||||||
|
Fill_Buffer (1, Buffer'Length - 2);
|
||||||
|
|
||||||
|
for J in 1 .. Buffer_Count loop
|
||||||
|
Write (File_In, Buffer);
|
||||||
|
|
||||||
|
Fill_Buffer (J, Density);
|
||||||
|
end loop;
|
||||||
|
|
||||||
|
-- fill remain size.
|
||||||
|
|
||||||
|
Write
|
||||||
|
(File_In,
|
||||||
|
Buffer
|
||||||
|
(1 .. Stream_Element_Offset
|
||||||
|
(File_Size - Buffer'Length * Buffer_Count)));
|
||||||
|
|
||||||
|
Flush (File_In);
|
||||||
|
Close (File_In);
|
||||||
|
end Generate_File;
|
||||||
|
|
||||||
|
---------------------
|
||||||
|
-- Print_Statistic --
|
||||||
|
---------------------
|
||||||
|
|
||||||
|
procedure Print_Statistic (Msg : String; Data_Size : ZLib.Count) is
|
||||||
|
use Ada.Calendar;
|
||||||
|
use Ada.Text_IO;
|
||||||
|
|
||||||
|
package Count_IO is new Integer_IO (ZLib.Count);
|
||||||
|
|
||||||
|
Curr_Dur : Duration := Clock - Time_Stamp;
|
||||||
|
begin
|
||||||
|
Put (Msg);
|
||||||
|
|
||||||
|
Set_Col (20);
|
||||||
|
Ada.Text_IO.Put ("size =");
|
||||||
|
|
||||||
|
Count_IO.Put
|
||||||
|
(Data_Size,
|
||||||
|
Width => Stream_IO.Count'Image (File_Size)'Length);
|
||||||
|
|
||||||
|
Put_Line (" duration =" & Duration'Image (Curr_Dur));
|
||||||
|
end Print_Statistic;
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- Stamp --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
procedure Stamp is
|
||||||
|
begin
|
||||||
|
Time_Stamp := Ada.Calendar.Clock;
|
||||||
|
end Stamp;
|
||||||
|
|
||||||
|
begin
|
||||||
|
Ada.Text_IO.Put_Line ("ZLib " & ZLib.Version);
|
||||||
|
|
||||||
|
loop
|
||||||
|
Generate_File;
|
||||||
|
|
||||||
|
for Level in ZLib.Compression_Level'Range loop
|
||||||
|
|
||||||
|
Ada.Text_IO.Put_Line ("Level ="
|
||||||
|
& ZLib.Compression_Level'Image (Level));
|
||||||
|
|
||||||
|
-- Test generic interface.
|
||||||
|
Open (File_In, In_File, In_File_Name);
|
||||||
|
Create (File_Out, Out_File, Z_File_Name);
|
||||||
|
|
||||||
|
Stamp;
|
||||||
|
|
||||||
|
-- Deflate using generic instantiation.
|
||||||
|
|
||||||
|
ZLib.Deflate_Init
|
||||||
|
(Filter => Filter,
|
||||||
|
Level => Level,
|
||||||
|
Strategy => Strategy,
|
||||||
|
Header => Header);
|
||||||
|
|
||||||
|
Translate (Filter);
|
||||||
|
Print_Statistic ("Generic compress", ZLib.Total_Out (Filter));
|
||||||
|
ZLib.Close (Filter);
|
||||||
|
|
||||||
|
Close (File_In);
|
||||||
|
Close (File_Out);
|
||||||
|
|
||||||
|
Open (File_In, In_File, Z_File_Name);
|
||||||
|
Create (File_Out, Out_File, Out_File_Name);
|
||||||
|
|
||||||
|
Stamp;
|
||||||
|
|
||||||
|
-- Inflate using generic instantiation.
|
||||||
|
|
||||||
|
ZLib.Inflate_Init (Filter, Header => Header);
|
||||||
|
|
||||||
|
Translate (Filter);
|
||||||
|
Print_Statistic ("Generic decompress", ZLib.Total_Out (Filter));
|
||||||
|
|
||||||
|
ZLib.Close (Filter);
|
||||||
|
|
||||||
|
Close (File_In);
|
||||||
|
Close (File_Out);
|
||||||
|
|
||||||
|
Compare_Files (In_File_Name, Out_File_Name);
|
||||||
|
|
||||||
|
-- Test stream interface.
|
||||||
|
|
||||||
|
-- Compress to the back stream.
|
||||||
|
|
||||||
|
Open (File_In, In_File, In_File_Name);
|
||||||
|
Create (File_Back, Out_File, Z_File_Name);
|
||||||
|
|
||||||
|
Stamp;
|
||||||
|
|
||||||
|
ZLib.Streams.Create
|
||||||
|
(Stream => File_Z,
|
||||||
|
Mode => ZLib.Streams.Out_Stream,
|
||||||
|
Back => ZLib.Streams.Stream_Access
|
||||||
|
(Stream (File_Back)),
|
||||||
|
Back_Compressed => True,
|
||||||
|
Level => Level,
|
||||||
|
Strategy => Strategy,
|
||||||
|
Header => Header);
|
||||||
|
|
||||||
|
Copy_Streams
|
||||||
|
(Source => Stream (File_In).all,
|
||||||
|
Target => File_Z);
|
||||||
|
|
||||||
|
-- Flushing internal buffers to the back stream.
|
||||||
|
|
||||||
|
ZLib.Streams.Flush (File_Z, ZLib.Finish);
|
||||||
|
|
||||||
|
Print_Statistic ("Write compress",
|
||||||
|
ZLib.Streams.Write_Total_Out (File_Z));
|
||||||
|
|
||||||
|
ZLib.Streams.Close (File_Z);
|
||||||
|
|
||||||
|
Close (File_In);
|
||||||
|
Close (File_Back);
|
||||||
|
|
||||||
|
-- Compare reading from original file and from
|
||||||
|
-- decompression stream.
|
||||||
|
|
||||||
|
Open (File_In, In_File, In_File_Name);
|
||||||
|
Open (File_Back, In_File, Z_File_Name);
|
||||||
|
|
||||||
|
ZLib.Streams.Create
|
||||||
|
(Stream => File_Z,
|
||||||
|
Mode => ZLib.Streams.In_Stream,
|
||||||
|
Back => ZLib.Streams.Stream_Access
|
||||||
|
(Stream (File_Back)),
|
||||||
|
Back_Compressed => True,
|
||||||
|
Header => Header);
|
||||||
|
|
||||||
|
Stamp;
|
||||||
|
Compare_Streams (Stream (File_In).all, File_Z);
|
||||||
|
|
||||||
|
Print_Statistic ("Read decompress",
|
||||||
|
ZLib.Streams.Read_Total_Out (File_Z));
|
||||||
|
|
||||||
|
ZLib.Streams.Close (File_Z);
|
||||||
|
Close (File_In);
|
||||||
|
Close (File_Back);
|
||||||
|
|
||||||
|
-- Compress by reading from compression stream.
|
||||||
|
|
||||||
|
Open (File_Back, In_File, In_File_Name);
|
||||||
|
Create (File_Out, Out_File, Z_File_Name);
|
||||||
|
|
||||||
|
ZLib.Streams.Create
|
||||||
|
(Stream => File_Z,
|
||||||
|
Mode => ZLib.Streams.In_Stream,
|
||||||
|
Back => ZLib.Streams.Stream_Access
|
||||||
|
(Stream (File_Back)),
|
||||||
|
Back_Compressed => False,
|
||||||
|
Level => Level,
|
||||||
|
Strategy => Strategy,
|
||||||
|
Header => Header);
|
||||||
|
|
||||||
|
Stamp;
|
||||||
|
Copy_Streams
|
||||||
|
(Source => File_Z,
|
||||||
|
Target => Stream (File_Out).all);
|
||||||
|
|
||||||
|
Print_Statistic ("Read compress",
|
||||||
|
ZLib.Streams.Read_Total_Out (File_Z));
|
||||||
|
|
||||||
|
ZLib.Streams.Close (File_Z);
|
||||||
|
|
||||||
|
Close (File_Out);
|
||||||
|
Close (File_Back);
|
||||||
|
|
||||||
|
-- Decompress to decompression stream.
|
||||||
|
|
||||||
|
Open (File_In, In_File, Z_File_Name);
|
||||||
|
Create (File_Back, Out_File, Out_File_Name);
|
||||||
|
|
||||||
|
ZLib.Streams.Create
|
||||||
|
(Stream => File_Z,
|
||||||
|
Mode => ZLib.Streams.Out_Stream,
|
||||||
|
Back => ZLib.Streams.Stream_Access
|
||||||
|
(Stream (File_Back)),
|
||||||
|
Back_Compressed => False,
|
||||||
|
Header => Header);
|
||||||
|
|
||||||
|
Stamp;
|
||||||
|
|
||||||
|
Copy_Streams
|
||||||
|
(Source => Stream (File_In).all,
|
||||||
|
Target => File_Z);
|
||||||
|
|
||||||
|
Print_Statistic ("Write decompress",
|
||||||
|
ZLib.Streams.Write_Total_Out (File_Z));
|
||||||
|
|
||||||
|
ZLib.Streams.Close (File_Z);
|
||||||
|
Close (File_In);
|
||||||
|
Close (File_Back);
|
||||||
|
|
||||||
|
Compare_Files (In_File_Name, Out_File_Name);
|
||||||
|
end loop;
|
||||||
|
|
||||||
|
Ada.Text_IO.Put_Line (Count'Image (File_Size) & " Ok.");
|
||||||
|
|
||||||
|
exit when not Continuous;
|
||||||
|
|
||||||
|
File_Size := File_Size + 1;
|
||||||
|
end loop;
|
||||||
|
end Test;
|
||||||
225
contrib/ada/zlib-streams.adb
Normal file
225
contrib/ada/zlib-streams.adb
Normal file
@@ -0,0 +1,225 @@
|
|||||||
|
----------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2003 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- Open source license information is in the zlib.ads file. --
|
||||||
|
----------------------------------------------------------------
|
||||||
|
|
||||||
|
-- $Id: zlib-streams.adb,v 1.10 2004/05/31 10:53:40 vagul Exp $
|
||||||
|
|
||||||
|
with Ada.Unchecked_Deallocation;
|
||||||
|
|
||||||
|
package body ZLib.Streams is
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- Close --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
procedure Close (Stream : in out Stream_Type) is
|
||||||
|
procedure Free is new Ada.Unchecked_Deallocation
|
||||||
|
(Stream_Element_Array, Buffer_Access);
|
||||||
|
begin
|
||||||
|
if Stream.Mode = Out_Stream or Stream.Mode = Duplex then
|
||||||
|
-- We should flush the data written by the writer.
|
||||||
|
|
||||||
|
Flush (Stream, Finish);
|
||||||
|
|
||||||
|
Close (Stream.Writer);
|
||||||
|
end if;
|
||||||
|
|
||||||
|
if Stream.Mode = In_Stream or Stream.Mode = Duplex then
|
||||||
|
Close (Stream.Reader);
|
||||||
|
Free (Stream.Buffer);
|
||||||
|
end if;
|
||||||
|
end Close;
|
||||||
|
|
||||||
|
------------
|
||||||
|
-- Create --
|
||||||
|
------------
|
||||||
|
|
||||||
|
procedure Create
|
||||||
|
(Stream : out Stream_Type;
|
||||||
|
Mode : in Stream_Mode;
|
||||||
|
Back : in Stream_Access;
|
||||||
|
Back_Compressed : in Boolean;
|
||||||
|
Level : in Compression_Level := Default_Compression;
|
||||||
|
Strategy : in Strategy_Type := Default_Strategy;
|
||||||
|
Header : in Header_Type := Default;
|
||||||
|
Read_Buffer_Size : in Ada.Streams.Stream_Element_Offset
|
||||||
|
:= Default_Buffer_Size;
|
||||||
|
Write_Buffer_Size : in Ada.Streams.Stream_Element_Offset
|
||||||
|
:= Default_Buffer_Size)
|
||||||
|
is
|
||||||
|
|
||||||
|
subtype Buffer_Subtype is Stream_Element_Array (1 .. Read_Buffer_Size);
|
||||||
|
|
||||||
|
procedure Init_Filter
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Compress : in Boolean);
|
||||||
|
|
||||||
|
-----------------
|
||||||
|
-- Init_Filter --
|
||||||
|
-----------------
|
||||||
|
|
||||||
|
procedure Init_Filter
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Compress : in Boolean) is
|
||||||
|
begin
|
||||||
|
if Compress then
|
||||||
|
Deflate_Init
|
||||||
|
(Filter, Level, Strategy, Header => Header);
|
||||||
|
else
|
||||||
|
Inflate_Init (Filter, Header => Header);
|
||||||
|
end if;
|
||||||
|
end Init_Filter;
|
||||||
|
|
||||||
|
begin
|
||||||
|
Stream.Back := Back;
|
||||||
|
Stream.Mode := Mode;
|
||||||
|
|
||||||
|
if Mode = Out_Stream or Mode = Duplex then
|
||||||
|
Init_Filter (Stream.Writer, Back_Compressed);
|
||||||
|
Stream.Buffer_Size := Write_Buffer_Size;
|
||||||
|
else
|
||||||
|
Stream.Buffer_Size := 0;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
if Mode = In_Stream or Mode = Duplex then
|
||||||
|
Init_Filter (Stream.Reader, not Back_Compressed);
|
||||||
|
|
||||||
|
Stream.Buffer := new Buffer_Subtype;
|
||||||
|
Stream.Rest_First := Stream.Buffer'Last + 1;
|
||||||
|
Stream.Rest_Last := Stream.Buffer'Last;
|
||||||
|
end if;
|
||||||
|
end Create;
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- Flush --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
procedure Flush
|
||||||
|
(Stream : in out Stream_Type;
|
||||||
|
Mode : in Flush_Mode := Sync_Flush)
|
||||||
|
is
|
||||||
|
Buffer : Stream_Element_Array (1 .. Stream.Buffer_Size);
|
||||||
|
Last : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
loop
|
||||||
|
Flush (Stream.Writer, Buffer, Last, Mode);
|
||||||
|
|
||||||
|
Ada.Streams.Write (Stream.Back.all, Buffer (1 .. Last));
|
||||||
|
|
||||||
|
exit when Last < Buffer'Last;
|
||||||
|
end loop;
|
||||||
|
end Flush;
|
||||||
|
|
||||||
|
-------------
|
||||||
|
-- Is_Open --
|
||||||
|
-------------
|
||||||
|
|
||||||
|
function Is_Open (Stream : Stream_Type) return Boolean is
|
||||||
|
begin
|
||||||
|
return Is_Open (Stream.Reader) or else Is_Open (Stream.Writer);
|
||||||
|
end Is_Open;
|
||||||
|
|
||||||
|
----------
|
||||||
|
-- Read --
|
||||||
|
----------
|
||||||
|
|
||||||
|
procedure Read
|
||||||
|
(Stream : in out Stream_Type;
|
||||||
|
Item : out Stream_Element_Array;
|
||||||
|
Last : out Stream_Element_Offset)
|
||||||
|
is
|
||||||
|
|
||||||
|
procedure Read
|
||||||
|
(Item : out Stream_Element_Array;
|
||||||
|
Last : out Stream_Element_Offset);
|
||||||
|
|
||||||
|
----------
|
||||||
|
-- Read --
|
||||||
|
----------
|
||||||
|
|
||||||
|
procedure Read
|
||||||
|
(Item : out Stream_Element_Array;
|
||||||
|
Last : out Stream_Element_Offset) is
|
||||||
|
begin
|
||||||
|
Ada.Streams.Read (Stream.Back.all, Item, Last);
|
||||||
|
end Read;
|
||||||
|
|
||||||
|
procedure Read is new ZLib.Read
|
||||||
|
(Read => Read,
|
||||||
|
Buffer => Stream.Buffer.all,
|
||||||
|
Rest_First => Stream.Rest_First,
|
||||||
|
Rest_Last => Stream.Rest_Last);
|
||||||
|
|
||||||
|
begin
|
||||||
|
Read (Stream.Reader, Item, Last);
|
||||||
|
end Read;
|
||||||
|
|
||||||
|
-------------------
|
||||||
|
-- Read_Total_In --
|
||||||
|
-------------------
|
||||||
|
|
||||||
|
function Read_Total_In (Stream : in Stream_Type) return Count is
|
||||||
|
begin
|
||||||
|
return Total_In (Stream.Reader);
|
||||||
|
end Read_Total_In;
|
||||||
|
|
||||||
|
--------------------
|
||||||
|
-- Read_Total_Out --
|
||||||
|
--------------------
|
||||||
|
|
||||||
|
function Read_Total_Out (Stream : in Stream_Type) return Count is
|
||||||
|
begin
|
||||||
|
return Total_Out (Stream.Reader);
|
||||||
|
end Read_Total_Out;
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- Write --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
procedure Write
|
||||||
|
(Stream : in out Stream_Type;
|
||||||
|
Item : in Stream_Element_Array)
|
||||||
|
is
|
||||||
|
|
||||||
|
procedure Write (Item : in Stream_Element_Array);
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- Write --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
procedure Write (Item : in Stream_Element_Array) is
|
||||||
|
begin
|
||||||
|
Ada.Streams.Write (Stream.Back.all, Item);
|
||||||
|
end Write;
|
||||||
|
|
||||||
|
procedure Write is new ZLib.Write
|
||||||
|
(Write => Write,
|
||||||
|
Buffer_Size => Stream.Buffer_Size);
|
||||||
|
|
||||||
|
begin
|
||||||
|
Write (Stream.Writer, Item, No_Flush);
|
||||||
|
end Write;
|
||||||
|
|
||||||
|
--------------------
|
||||||
|
-- Write_Total_In --
|
||||||
|
--------------------
|
||||||
|
|
||||||
|
function Write_Total_In (Stream : in Stream_Type) return Count is
|
||||||
|
begin
|
||||||
|
return Total_In (Stream.Writer);
|
||||||
|
end Write_Total_In;
|
||||||
|
|
||||||
|
---------------------
|
||||||
|
-- Write_Total_Out --
|
||||||
|
---------------------
|
||||||
|
|
||||||
|
function Write_Total_Out (Stream : in Stream_Type) return Count is
|
||||||
|
begin
|
||||||
|
return Total_Out (Stream.Writer);
|
||||||
|
end Write_Total_Out;
|
||||||
|
|
||||||
|
end ZLib.Streams;
|
||||||
114
contrib/ada/zlib-streams.ads
Normal file
114
contrib/ada/zlib-streams.ads
Normal file
@@ -0,0 +1,114 @@
|
|||||||
|
----------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2003 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- Open source license information is in the zlib.ads file. --
|
||||||
|
----------------------------------------------------------------
|
||||||
|
|
||||||
|
-- $Id: zlib-streams.ads,v 1.12 2004/05/31 10:53:40 vagul Exp $
|
||||||
|
|
||||||
|
package ZLib.Streams is
|
||||||
|
|
||||||
|
type Stream_Mode is (In_Stream, Out_Stream, Duplex);
|
||||||
|
|
||||||
|
type Stream_Access is access all Ada.Streams.Root_Stream_Type'Class;
|
||||||
|
|
||||||
|
type Stream_Type is
|
||||||
|
new Ada.Streams.Root_Stream_Type with private;
|
||||||
|
|
||||||
|
procedure Read
|
||||||
|
(Stream : in out Stream_Type;
|
||||||
|
Item : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Last : out Ada.Streams.Stream_Element_Offset);
|
||||||
|
|
||||||
|
procedure Write
|
||||||
|
(Stream : in out Stream_Type;
|
||||||
|
Item : in Ada.Streams.Stream_Element_Array);
|
||||||
|
|
||||||
|
procedure Flush
|
||||||
|
(Stream : in out Stream_Type;
|
||||||
|
Mode : in Flush_Mode := Sync_Flush);
|
||||||
|
-- Flush the written data to the back stream,
|
||||||
|
-- all data placed to the compressor is flushing to the Back stream.
|
||||||
|
-- Should not be used until necessary, because it is decreasing
|
||||||
|
-- compression.
|
||||||
|
|
||||||
|
function Read_Total_In (Stream : in Stream_Type) return Count;
|
||||||
|
pragma Inline (Read_Total_In);
|
||||||
|
-- Return total number of bytes read from back stream so far.
|
||||||
|
|
||||||
|
function Read_Total_Out (Stream : in Stream_Type) return Count;
|
||||||
|
pragma Inline (Read_Total_Out);
|
||||||
|
-- Return total number of bytes read so far.
|
||||||
|
|
||||||
|
function Write_Total_In (Stream : in Stream_Type) return Count;
|
||||||
|
pragma Inline (Write_Total_In);
|
||||||
|
-- Return total number of bytes written so far.
|
||||||
|
|
||||||
|
function Write_Total_Out (Stream : in Stream_Type) return Count;
|
||||||
|
pragma Inline (Write_Total_Out);
|
||||||
|
-- Return total number of bytes written to the back stream.
|
||||||
|
|
||||||
|
procedure Create
|
||||||
|
(Stream : out Stream_Type;
|
||||||
|
Mode : in Stream_Mode;
|
||||||
|
Back : in Stream_Access;
|
||||||
|
Back_Compressed : in Boolean;
|
||||||
|
Level : in Compression_Level := Default_Compression;
|
||||||
|
Strategy : in Strategy_Type := Default_Strategy;
|
||||||
|
Header : in Header_Type := Default;
|
||||||
|
Read_Buffer_Size : in Ada.Streams.Stream_Element_Offset
|
||||||
|
:= Default_Buffer_Size;
|
||||||
|
Write_Buffer_Size : in Ada.Streams.Stream_Element_Offset
|
||||||
|
:= Default_Buffer_Size);
|
||||||
|
-- Create the Comression/Decompression stream.
|
||||||
|
-- If mode is In_Stream then Write operation is disabled.
|
||||||
|
-- If mode is Out_Stream then Read operation is disabled.
|
||||||
|
|
||||||
|
-- If Back_Compressed is true then
|
||||||
|
-- Data written to the Stream is compressing to the Back stream
|
||||||
|
-- and data read from the Stream is decompressed data from the Back stream.
|
||||||
|
|
||||||
|
-- If Back_Compressed is false then
|
||||||
|
-- Data written to the Stream is decompressing to the Back stream
|
||||||
|
-- and data read from the Stream is compressed data from the Back stream.
|
||||||
|
|
||||||
|
-- !!! When the Need_Header is False ZLib-Ada is using undocumented
|
||||||
|
-- ZLib 1.1.4 functionality to do not create/wait for ZLib headers.
|
||||||
|
|
||||||
|
function Is_Open (Stream : Stream_Type) return Boolean;
|
||||||
|
|
||||||
|
procedure Close (Stream : in out Stream_Type);
|
||||||
|
|
||||||
|
private
|
||||||
|
|
||||||
|
use Ada.Streams;
|
||||||
|
|
||||||
|
type Buffer_Access is access all Stream_Element_Array;
|
||||||
|
|
||||||
|
type Stream_Type
|
||||||
|
is new Root_Stream_Type with
|
||||||
|
record
|
||||||
|
Mode : Stream_Mode;
|
||||||
|
|
||||||
|
Buffer : Buffer_Access;
|
||||||
|
Rest_First : Stream_Element_Offset;
|
||||||
|
Rest_Last : Stream_Element_Offset;
|
||||||
|
-- Buffer for Read operation.
|
||||||
|
-- We need to have this buffer in the record
|
||||||
|
-- because not all read data from back stream
|
||||||
|
-- could be processed during the read operation.
|
||||||
|
|
||||||
|
Buffer_Size : Stream_Element_Offset;
|
||||||
|
-- Buffer size for write operation.
|
||||||
|
-- We do not need to have this buffer
|
||||||
|
-- in the record because all data could be
|
||||||
|
-- processed in the write operation.
|
||||||
|
|
||||||
|
Back : Stream_Access;
|
||||||
|
Reader : Filter_Type;
|
||||||
|
Writer : Filter_Type;
|
||||||
|
end record;
|
||||||
|
|
||||||
|
end ZLib.Streams;
|
||||||
141
contrib/ada/zlib-thin.adb
Normal file
141
contrib/ada/zlib-thin.adb
Normal file
@@ -0,0 +1,141 @@
|
|||||||
|
----------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2003 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- Open source license information is in the zlib.ads file. --
|
||||||
|
----------------------------------------------------------------
|
||||||
|
|
||||||
|
-- $Id: zlib-thin.adb,v 1.8 2003/12/14 18:27:31 vagul Exp $
|
||||||
|
|
||||||
|
package body ZLib.Thin is
|
||||||
|
|
||||||
|
ZLIB_VERSION : constant Chars_Ptr := zlibVersion;
|
||||||
|
|
||||||
|
Z_Stream_Size : constant Int := Z_Stream'Size / System.Storage_Unit;
|
||||||
|
|
||||||
|
--------------
|
||||||
|
-- Avail_In --
|
||||||
|
--------------
|
||||||
|
|
||||||
|
function Avail_In (Strm : in Z_Stream) return UInt is
|
||||||
|
begin
|
||||||
|
return Strm.Avail_In;
|
||||||
|
end Avail_In;
|
||||||
|
|
||||||
|
---------------
|
||||||
|
-- Avail_Out --
|
||||||
|
---------------
|
||||||
|
|
||||||
|
function Avail_Out (Strm : in Z_Stream) return UInt is
|
||||||
|
begin
|
||||||
|
return Strm.Avail_Out;
|
||||||
|
end Avail_Out;
|
||||||
|
|
||||||
|
------------------
|
||||||
|
-- Deflate_Init --
|
||||||
|
------------------
|
||||||
|
|
||||||
|
function Deflate_Init
|
||||||
|
(strm : Z_Streamp;
|
||||||
|
level : Int;
|
||||||
|
method : Int;
|
||||||
|
windowBits : Int;
|
||||||
|
memLevel : Int;
|
||||||
|
strategy : Int)
|
||||||
|
return Int is
|
||||||
|
begin
|
||||||
|
return deflateInit2
|
||||||
|
(strm,
|
||||||
|
level,
|
||||||
|
method,
|
||||||
|
windowBits,
|
||||||
|
memLevel,
|
||||||
|
strategy,
|
||||||
|
ZLIB_VERSION,
|
||||||
|
Z_Stream_Size);
|
||||||
|
end Deflate_Init;
|
||||||
|
|
||||||
|
------------------
|
||||||
|
-- Inflate_Init --
|
||||||
|
------------------
|
||||||
|
|
||||||
|
function Inflate_Init (strm : Z_Streamp; windowBits : Int) return Int is
|
||||||
|
begin
|
||||||
|
return inflateInit2 (strm, windowBits, ZLIB_VERSION, Z_Stream_Size);
|
||||||
|
end Inflate_Init;
|
||||||
|
|
||||||
|
------------------------
|
||||||
|
-- Last_Error_Message --
|
||||||
|
------------------------
|
||||||
|
|
||||||
|
function Last_Error_Message (Strm : in Z_Stream) return String is
|
||||||
|
use Interfaces.C.Strings;
|
||||||
|
begin
|
||||||
|
if Strm.msg = Null_Ptr then
|
||||||
|
return "";
|
||||||
|
else
|
||||||
|
return Value (Strm.msg);
|
||||||
|
end if;
|
||||||
|
end Last_Error_Message;
|
||||||
|
|
||||||
|
------------
|
||||||
|
-- Set_In --
|
||||||
|
------------
|
||||||
|
|
||||||
|
procedure Set_In
|
||||||
|
(Strm : in out Z_Stream;
|
||||||
|
Buffer : in Voidp;
|
||||||
|
Size : in UInt) is
|
||||||
|
begin
|
||||||
|
Strm.Next_In := Buffer;
|
||||||
|
Strm.Avail_In := Size;
|
||||||
|
end Set_In;
|
||||||
|
|
||||||
|
------------------
|
||||||
|
-- Set_Mem_Func --
|
||||||
|
------------------
|
||||||
|
|
||||||
|
procedure Set_Mem_Func
|
||||||
|
(Strm : in out Z_Stream;
|
||||||
|
Opaque : in Voidp;
|
||||||
|
Alloc : in alloc_func;
|
||||||
|
Free : in free_func) is
|
||||||
|
begin
|
||||||
|
Strm.opaque := Opaque;
|
||||||
|
Strm.zalloc := Alloc;
|
||||||
|
Strm.zfree := Free;
|
||||||
|
end Set_Mem_Func;
|
||||||
|
|
||||||
|
-------------
|
||||||
|
-- Set_Out --
|
||||||
|
-------------
|
||||||
|
|
||||||
|
procedure Set_Out
|
||||||
|
(Strm : in out Z_Stream;
|
||||||
|
Buffer : in Voidp;
|
||||||
|
Size : in UInt) is
|
||||||
|
begin
|
||||||
|
Strm.Next_Out := Buffer;
|
||||||
|
Strm.Avail_Out := Size;
|
||||||
|
end Set_Out;
|
||||||
|
|
||||||
|
--------------
|
||||||
|
-- Total_In --
|
||||||
|
--------------
|
||||||
|
|
||||||
|
function Total_In (Strm : in Z_Stream) return ULong is
|
||||||
|
begin
|
||||||
|
return Strm.Total_In;
|
||||||
|
end Total_In;
|
||||||
|
|
||||||
|
---------------
|
||||||
|
-- Total_Out --
|
||||||
|
---------------
|
||||||
|
|
||||||
|
function Total_Out (Strm : in Z_Stream) return ULong is
|
||||||
|
begin
|
||||||
|
return Strm.Total_Out;
|
||||||
|
end Total_Out;
|
||||||
|
|
||||||
|
end ZLib.Thin;
|
||||||
450
contrib/ada/zlib-thin.ads
Normal file
450
contrib/ada/zlib-thin.ads
Normal file
@@ -0,0 +1,450 @@
|
|||||||
|
----------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2003 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- Open source license information is in the zlib.ads file. --
|
||||||
|
----------------------------------------------------------------
|
||||||
|
|
||||||
|
-- $Id: zlib-thin.ads,v 1.11 2004/07/23 06:33:11 vagul Exp $
|
||||||
|
|
||||||
|
with Interfaces.C.Strings;
|
||||||
|
|
||||||
|
with System;
|
||||||
|
|
||||||
|
private package ZLib.Thin is
|
||||||
|
|
||||||
|
-- From zconf.h
|
||||||
|
|
||||||
|
MAX_MEM_LEVEL : constant := 9; -- zconf.h:105
|
||||||
|
-- zconf.h:105
|
||||||
|
MAX_WBITS : constant := 15; -- zconf.h:115
|
||||||
|
-- 32K LZ77 window
|
||||||
|
-- zconf.h:115
|
||||||
|
SEEK_SET : constant := 8#0000#; -- zconf.h:244
|
||||||
|
-- Seek from beginning of file.
|
||||||
|
-- zconf.h:244
|
||||||
|
SEEK_CUR : constant := 1; -- zconf.h:245
|
||||||
|
-- Seek from current position.
|
||||||
|
-- zconf.h:245
|
||||||
|
SEEK_END : constant := 2; -- zconf.h:246
|
||||||
|
-- Set file pointer to EOF plus "offset"
|
||||||
|
-- zconf.h:246
|
||||||
|
|
||||||
|
type Byte is new Interfaces.C.unsigned_char; -- 8 bits
|
||||||
|
-- zconf.h:214
|
||||||
|
type UInt is new Interfaces.C.unsigned; -- 16 bits or more
|
||||||
|
-- zconf.h:216
|
||||||
|
type Int is new Interfaces.C.int;
|
||||||
|
|
||||||
|
type ULong is new Interfaces.C.unsigned_long; -- 32 bits or more
|
||||||
|
-- zconf.h:217
|
||||||
|
subtype Chars_Ptr is Interfaces.C.Strings.chars_ptr;
|
||||||
|
|
||||||
|
type ULong_Access is access ULong;
|
||||||
|
type Int_Access is access Int;
|
||||||
|
|
||||||
|
subtype Voidp is System.Address; -- zconf.h:232
|
||||||
|
|
||||||
|
subtype Byte_Access is Voidp;
|
||||||
|
|
||||||
|
Nul : constant Voidp := System.Null_Address;
|
||||||
|
-- end from zconf
|
||||||
|
|
||||||
|
Z_NO_FLUSH : constant := 8#0000#; -- zlib.h:125
|
||||||
|
-- zlib.h:125
|
||||||
|
Z_PARTIAL_FLUSH : constant := 1; -- zlib.h:126
|
||||||
|
-- will be removed, use
|
||||||
|
-- Z_SYNC_FLUSH instead
|
||||||
|
-- zlib.h:126
|
||||||
|
Z_SYNC_FLUSH : constant := 2; -- zlib.h:127
|
||||||
|
-- zlib.h:127
|
||||||
|
Z_FULL_FLUSH : constant := 3; -- zlib.h:128
|
||||||
|
-- zlib.h:128
|
||||||
|
Z_FINISH : constant := 4; -- zlib.h:129
|
||||||
|
-- zlib.h:129
|
||||||
|
Z_OK : constant := 8#0000#; -- zlib.h:132
|
||||||
|
-- zlib.h:132
|
||||||
|
Z_STREAM_END : constant := 1; -- zlib.h:133
|
||||||
|
-- zlib.h:133
|
||||||
|
Z_NEED_DICT : constant := 2; -- zlib.h:134
|
||||||
|
-- zlib.h:134
|
||||||
|
Z_ERRNO : constant := -1; -- zlib.h:135
|
||||||
|
-- zlib.h:135
|
||||||
|
Z_STREAM_ERROR : constant := -2; -- zlib.h:136
|
||||||
|
-- zlib.h:136
|
||||||
|
Z_DATA_ERROR : constant := -3; -- zlib.h:137
|
||||||
|
-- zlib.h:137
|
||||||
|
Z_MEM_ERROR : constant := -4; -- zlib.h:138
|
||||||
|
-- zlib.h:138
|
||||||
|
Z_BUF_ERROR : constant := -5; -- zlib.h:139
|
||||||
|
-- zlib.h:139
|
||||||
|
Z_VERSION_ERROR : constant := -6; -- zlib.h:140
|
||||||
|
-- zlib.h:140
|
||||||
|
Z_NO_COMPRESSION : constant := 8#0000#; -- zlib.h:145
|
||||||
|
-- zlib.h:145
|
||||||
|
Z_BEST_SPEED : constant := 1; -- zlib.h:146
|
||||||
|
-- zlib.h:146
|
||||||
|
Z_BEST_COMPRESSION : constant := 9; -- zlib.h:147
|
||||||
|
-- zlib.h:147
|
||||||
|
Z_DEFAULT_COMPRESSION : constant := -1; -- zlib.h:148
|
||||||
|
-- zlib.h:148
|
||||||
|
Z_FILTERED : constant := 1; -- zlib.h:151
|
||||||
|
-- zlib.h:151
|
||||||
|
Z_HUFFMAN_ONLY : constant := 2; -- zlib.h:152
|
||||||
|
-- zlib.h:152
|
||||||
|
Z_DEFAULT_STRATEGY : constant := 8#0000#; -- zlib.h:153
|
||||||
|
-- zlib.h:153
|
||||||
|
Z_BINARY : constant := 8#0000#; -- zlib.h:156
|
||||||
|
-- zlib.h:156
|
||||||
|
Z_ASCII : constant := 1; -- zlib.h:157
|
||||||
|
-- zlib.h:157
|
||||||
|
Z_UNKNOWN : constant := 2; -- zlib.h:158
|
||||||
|
-- zlib.h:158
|
||||||
|
Z_DEFLATED : constant := 8; -- zlib.h:161
|
||||||
|
-- zlib.h:161
|
||||||
|
Z_NULL : constant := 8#0000#; -- zlib.h:164
|
||||||
|
-- for initializing zalloc, zfree, opaque
|
||||||
|
-- zlib.h:164
|
||||||
|
type gzFile is new Voidp; -- zlib.h:646
|
||||||
|
|
||||||
|
type Z_Stream is private;
|
||||||
|
|
||||||
|
type Z_Streamp is access all Z_Stream; -- zlib.h:89
|
||||||
|
|
||||||
|
type alloc_func is access function
|
||||||
|
(Opaque : Voidp;
|
||||||
|
Items : UInt;
|
||||||
|
Size : UInt)
|
||||||
|
return Voidp; -- zlib.h:63
|
||||||
|
|
||||||
|
type free_func is access procedure (opaque : Voidp; address : Voidp);
|
||||||
|
|
||||||
|
function zlibVersion return Chars_Ptr;
|
||||||
|
|
||||||
|
function Deflate (strm : Z_Streamp; flush : Int) return Int;
|
||||||
|
|
||||||
|
function DeflateEnd (strm : Z_Streamp) return Int;
|
||||||
|
|
||||||
|
function Inflate (strm : Z_Streamp; flush : Int) return Int;
|
||||||
|
|
||||||
|
function InflateEnd (strm : Z_Streamp) return Int;
|
||||||
|
|
||||||
|
function deflateSetDictionary
|
||||||
|
(strm : Z_Streamp;
|
||||||
|
dictionary : Byte_Access;
|
||||||
|
dictLength : UInt)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function deflateCopy (dest : Z_Streamp; source : Z_Streamp) return Int;
|
||||||
|
-- zlib.h:478
|
||||||
|
|
||||||
|
function deflateReset (strm : Z_Streamp) return Int; -- zlib.h:495
|
||||||
|
|
||||||
|
function deflateParams
|
||||||
|
(strm : Z_Streamp;
|
||||||
|
level : Int;
|
||||||
|
strategy : Int)
|
||||||
|
return Int; -- zlib.h:506
|
||||||
|
|
||||||
|
function inflateSetDictionary
|
||||||
|
(strm : Z_Streamp;
|
||||||
|
dictionary : Byte_Access;
|
||||||
|
dictLength : UInt)
|
||||||
|
return Int; -- zlib.h:548
|
||||||
|
|
||||||
|
function inflateSync (strm : Z_Streamp) return Int; -- zlib.h:565
|
||||||
|
|
||||||
|
function inflateReset (strm : Z_Streamp) return Int; -- zlib.h:580
|
||||||
|
|
||||||
|
function compress
|
||||||
|
(dest : Byte_Access;
|
||||||
|
destLen : ULong_Access;
|
||||||
|
source : Byte_Access;
|
||||||
|
sourceLen : ULong)
|
||||||
|
return Int; -- zlib.h:601
|
||||||
|
|
||||||
|
function compress2
|
||||||
|
(dest : Byte_Access;
|
||||||
|
destLen : ULong_Access;
|
||||||
|
source : Byte_Access;
|
||||||
|
sourceLen : ULong;
|
||||||
|
level : Int)
|
||||||
|
return Int; -- zlib.h:615
|
||||||
|
|
||||||
|
function uncompress
|
||||||
|
(dest : Byte_Access;
|
||||||
|
destLen : ULong_Access;
|
||||||
|
source : Byte_Access;
|
||||||
|
sourceLen : ULong)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function gzopen (path : Chars_Ptr; mode : Chars_Ptr) return gzFile;
|
||||||
|
|
||||||
|
function gzdopen (fd : Int; mode : Chars_Ptr) return gzFile;
|
||||||
|
|
||||||
|
function gzsetparams
|
||||||
|
(file : gzFile;
|
||||||
|
level : Int;
|
||||||
|
strategy : Int)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function gzread
|
||||||
|
(file : gzFile;
|
||||||
|
buf : Voidp;
|
||||||
|
len : UInt)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function gzwrite
|
||||||
|
(file : in gzFile;
|
||||||
|
buf : in Voidp;
|
||||||
|
len : in UInt)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function gzprintf (file : in gzFile; format : in Chars_Ptr) return Int;
|
||||||
|
|
||||||
|
function gzputs (file : in gzFile; s : in Chars_Ptr) return Int;
|
||||||
|
|
||||||
|
function gzgets
|
||||||
|
(file : gzFile;
|
||||||
|
buf : Chars_Ptr;
|
||||||
|
len : Int)
|
||||||
|
return Chars_Ptr;
|
||||||
|
|
||||||
|
function gzputc (file : gzFile; char : Int) return Int;
|
||||||
|
|
||||||
|
function gzgetc (file : gzFile) return Int;
|
||||||
|
|
||||||
|
function gzflush (file : gzFile; flush : Int) return Int;
|
||||||
|
|
||||||
|
function gzseek
|
||||||
|
(file : gzFile;
|
||||||
|
offset : Int;
|
||||||
|
whence : Int)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function gzrewind (file : gzFile) return Int;
|
||||||
|
|
||||||
|
function gztell (file : gzFile) return Int;
|
||||||
|
|
||||||
|
function gzeof (file : gzFile) return Int;
|
||||||
|
|
||||||
|
function gzclose (file : gzFile) return Int;
|
||||||
|
|
||||||
|
function gzerror (file : gzFile; errnum : Int_Access) return Chars_Ptr;
|
||||||
|
|
||||||
|
function adler32
|
||||||
|
(adler : ULong;
|
||||||
|
buf : Byte_Access;
|
||||||
|
len : UInt)
|
||||||
|
return ULong;
|
||||||
|
|
||||||
|
function crc32
|
||||||
|
(crc : ULong;
|
||||||
|
buf : Byte_Access;
|
||||||
|
len : UInt)
|
||||||
|
return ULong;
|
||||||
|
|
||||||
|
function deflateInit
|
||||||
|
(strm : Z_Streamp;
|
||||||
|
level : Int;
|
||||||
|
version : Chars_Ptr;
|
||||||
|
stream_size : Int)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function deflateInit2
|
||||||
|
(strm : Z_Streamp;
|
||||||
|
level : Int;
|
||||||
|
method : Int;
|
||||||
|
windowBits : Int;
|
||||||
|
memLevel : Int;
|
||||||
|
strategy : Int;
|
||||||
|
version : Chars_Ptr;
|
||||||
|
stream_size : Int)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function Deflate_Init
|
||||||
|
(strm : Z_Streamp;
|
||||||
|
level : Int;
|
||||||
|
method : Int;
|
||||||
|
windowBits : Int;
|
||||||
|
memLevel : Int;
|
||||||
|
strategy : Int)
|
||||||
|
return Int;
|
||||||
|
pragma Inline (Deflate_Init);
|
||||||
|
|
||||||
|
function inflateInit
|
||||||
|
(strm : Z_Streamp;
|
||||||
|
version : Chars_Ptr;
|
||||||
|
stream_size : Int)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function inflateInit2
|
||||||
|
(strm : in Z_Streamp;
|
||||||
|
windowBits : in Int;
|
||||||
|
version : in Chars_Ptr;
|
||||||
|
stream_size : in Int)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function inflateBackInit
|
||||||
|
(strm : in Z_Streamp;
|
||||||
|
windowBits : in Int;
|
||||||
|
window : in Byte_Access;
|
||||||
|
version : in Chars_Ptr;
|
||||||
|
stream_size : in Int)
|
||||||
|
return Int;
|
||||||
|
-- Size of window have to be 2**windowBits.
|
||||||
|
|
||||||
|
function Inflate_Init (strm : Z_Streamp; windowBits : Int) return Int;
|
||||||
|
pragma Inline (Inflate_Init);
|
||||||
|
|
||||||
|
function zError (err : Int) return Chars_Ptr;
|
||||||
|
|
||||||
|
function inflateSyncPoint (z : Z_Streamp) return Int;
|
||||||
|
|
||||||
|
function get_crc_table return ULong_Access;
|
||||||
|
|
||||||
|
-- Interface to the available fields of the z_stream structure.
|
||||||
|
-- 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.
|
||||||
|
|
||||||
|
procedure Set_In
|
||||||
|
(Strm : in out Z_Stream;
|
||||||
|
Buffer : in Voidp;
|
||||||
|
Size : in UInt);
|
||||||
|
pragma Inline (Set_In);
|
||||||
|
|
||||||
|
procedure Set_Out
|
||||||
|
(Strm : in out Z_Stream;
|
||||||
|
Buffer : in Voidp;
|
||||||
|
Size : in UInt);
|
||||||
|
pragma Inline (Set_Out);
|
||||||
|
|
||||||
|
procedure Set_Mem_Func
|
||||||
|
(Strm : in out Z_Stream;
|
||||||
|
Opaque : in Voidp;
|
||||||
|
Alloc : in alloc_func;
|
||||||
|
Free : in free_func);
|
||||||
|
pragma Inline (Set_Mem_Func);
|
||||||
|
|
||||||
|
function Last_Error_Message (Strm : in Z_Stream) return String;
|
||||||
|
pragma Inline (Last_Error_Message);
|
||||||
|
|
||||||
|
function Avail_Out (Strm : in Z_Stream) return UInt;
|
||||||
|
pragma Inline (Avail_Out);
|
||||||
|
|
||||||
|
function Avail_In (Strm : in Z_Stream) return UInt;
|
||||||
|
pragma Inline (Avail_In);
|
||||||
|
|
||||||
|
function Total_In (Strm : in Z_Stream) return ULong;
|
||||||
|
pragma Inline (Total_In);
|
||||||
|
|
||||||
|
function Total_Out (Strm : in Z_Stream) return ULong;
|
||||||
|
pragma Inline (Total_Out);
|
||||||
|
|
||||||
|
function inflateCopy
|
||||||
|
(dest : in Z_Streamp;
|
||||||
|
Source : in Z_Streamp)
|
||||||
|
return Int;
|
||||||
|
|
||||||
|
function compressBound (Source_Len : in ULong) return ULong;
|
||||||
|
|
||||||
|
function deflateBound
|
||||||
|
(Strm : in Z_Streamp;
|
||||||
|
Source_Len : in ULong)
|
||||||
|
return ULong;
|
||||||
|
|
||||||
|
function gzungetc (C : in Int; File : in gzFile) return Int;
|
||||||
|
|
||||||
|
function zlibCompileFlags return ULong;
|
||||||
|
|
||||||
|
private
|
||||||
|
|
||||||
|
type Z_Stream is record -- zlib.h:68
|
||||||
|
Next_In : Voidp := Nul; -- next input byte
|
||||||
|
Avail_In : UInt := 0; -- number of bytes available at next_in
|
||||||
|
Total_In : ULong := 0; -- total nb of input bytes read so far
|
||||||
|
Next_Out : Voidp := Nul; -- next output byte should be put there
|
||||||
|
Avail_Out : UInt := 0; -- remaining free space at next_out
|
||||||
|
Total_Out : ULong := 0; -- total nb of bytes output so far
|
||||||
|
msg : Chars_Ptr; -- last error message, NULL if no error
|
||||||
|
state : Voidp; -- not visible by applications
|
||||||
|
zalloc : alloc_func := null; -- used to allocate the internal state
|
||||||
|
zfree : free_func := null; -- used to free the internal state
|
||||||
|
opaque : Voidp; -- private data object passed to
|
||||||
|
-- zalloc and zfree
|
||||||
|
data_type : Int; -- best guess about the data type:
|
||||||
|
-- ascii or binary
|
||||||
|
adler : ULong; -- adler32 value of the uncompressed
|
||||||
|
-- data
|
||||||
|
reserved : ULong; -- reserved for future use
|
||||||
|
end record;
|
||||||
|
|
||||||
|
pragma Convention (C, Z_Stream);
|
||||||
|
|
||||||
|
pragma Import (C, zlibVersion, "zlibVersion");
|
||||||
|
pragma Import (C, Deflate, "deflate");
|
||||||
|
pragma Import (C, DeflateEnd, "deflateEnd");
|
||||||
|
pragma Import (C, Inflate, "inflate");
|
||||||
|
pragma Import (C, InflateEnd, "inflateEnd");
|
||||||
|
pragma Import (C, deflateSetDictionary, "deflateSetDictionary");
|
||||||
|
pragma Import (C, deflateCopy, "deflateCopy");
|
||||||
|
pragma Import (C, deflateReset, "deflateReset");
|
||||||
|
pragma Import (C, deflateParams, "deflateParams");
|
||||||
|
pragma Import (C, inflateSetDictionary, "inflateSetDictionary");
|
||||||
|
pragma Import (C, inflateSync, "inflateSync");
|
||||||
|
pragma Import (C, inflateReset, "inflateReset");
|
||||||
|
pragma Import (C, compress, "compress");
|
||||||
|
pragma Import (C, compress2, "compress2");
|
||||||
|
pragma Import (C, uncompress, "uncompress");
|
||||||
|
pragma Import (C, gzopen, "gzopen");
|
||||||
|
pragma Import (C, gzdopen, "gzdopen");
|
||||||
|
pragma Import (C, gzsetparams, "gzsetparams");
|
||||||
|
pragma Import (C, gzread, "gzread");
|
||||||
|
pragma Import (C, gzwrite, "gzwrite");
|
||||||
|
pragma Import (C, gzprintf, "gzprintf");
|
||||||
|
pragma Import (C, gzputs, "gzputs");
|
||||||
|
pragma Import (C, gzgets, "gzgets");
|
||||||
|
pragma Import (C, gzputc, "gzputc");
|
||||||
|
pragma Import (C, gzgetc, "gzgetc");
|
||||||
|
pragma Import (C, gzflush, "gzflush");
|
||||||
|
pragma Import (C, gzseek, "gzseek");
|
||||||
|
pragma Import (C, gzrewind, "gzrewind");
|
||||||
|
pragma Import (C, gztell, "gztell");
|
||||||
|
pragma Import (C, gzeof, "gzeof");
|
||||||
|
pragma Import (C, gzclose, "gzclose");
|
||||||
|
pragma Import (C, gzerror, "gzerror");
|
||||||
|
pragma Import (C, adler32, "adler32");
|
||||||
|
pragma Import (C, crc32, "crc32");
|
||||||
|
pragma Import (C, deflateInit, "deflateInit_");
|
||||||
|
pragma Import (C, inflateInit, "inflateInit_");
|
||||||
|
pragma Import (C, deflateInit2, "deflateInit2_");
|
||||||
|
pragma Import (C, inflateInit2, "inflateInit2_");
|
||||||
|
pragma Import (C, zError, "zError");
|
||||||
|
pragma Import (C, inflateSyncPoint, "inflateSyncPoint");
|
||||||
|
pragma Import (C, get_crc_table, "get_crc_table");
|
||||||
|
|
||||||
|
-- since zlib 1.2.0:
|
||||||
|
|
||||||
|
pragma Import (C, inflateCopy, "inflateCopy");
|
||||||
|
pragma Import (C, compressBound, "compressBound");
|
||||||
|
pragma Import (C, deflateBound, "deflateBound");
|
||||||
|
pragma Import (C, gzungetc, "gzungetc");
|
||||||
|
pragma Import (C, zlibCompileFlags, "zlibCompileFlags");
|
||||||
|
|
||||||
|
pragma Import (C, inflateBackInit, "inflateBackInit_");
|
||||||
|
|
||||||
|
-- I stopped binding the inflateBack routines, because realize that
|
||||||
|
-- it does not support zlib and gzip headers for now, and have no
|
||||||
|
-- symmetric deflateBack routines.
|
||||||
|
-- ZLib-Ada is symmetric regarding deflate/inflate data transformation
|
||||||
|
-- and has a similar generic callback interface for the
|
||||||
|
-- deflate/inflate transformation based on the regular Deflate/Inflate
|
||||||
|
-- routines.
|
||||||
|
|
||||||
|
-- pragma Import (C, inflateBack, "inflateBack");
|
||||||
|
-- pragma Import (C, inflateBackEnd, "inflateBackEnd");
|
||||||
|
|
||||||
|
end ZLib.Thin;
|
||||||
701
contrib/ada/zlib.adb
Normal file
701
contrib/ada/zlib.adb
Normal file
@@ -0,0 +1,701 @@
|
|||||||
|
----------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2004 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- Open source license information is in the zlib.ads file. --
|
||||||
|
----------------------------------------------------------------
|
||||||
|
|
||||||
|
-- $Id: zlib.adb,v 1.31 2004/09/06 06:53:19 vagul Exp $
|
||||||
|
|
||||||
|
with Ada.Exceptions;
|
||||||
|
with Ada.Unchecked_Conversion;
|
||||||
|
with Ada.Unchecked_Deallocation;
|
||||||
|
|
||||||
|
with Interfaces.C.Strings;
|
||||||
|
|
||||||
|
with ZLib.Thin;
|
||||||
|
|
||||||
|
package body ZLib is
|
||||||
|
|
||||||
|
use type Thin.Int;
|
||||||
|
|
||||||
|
type Z_Stream is new Thin.Z_Stream;
|
||||||
|
|
||||||
|
type Return_Code_Enum is
|
||||||
|
(OK,
|
||||||
|
STREAM_END,
|
||||||
|
NEED_DICT,
|
||||||
|
ERRNO,
|
||||||
|
STREAM_ERROR,
|
||||||
|
DATA_ERROR,
|
||||||
|
MEM_ERROR,
|
||||||
|
BUF_ERROR,
|
||||||
|
VERSION_ERROR);
|
||||||
|
|
||||||
|
type Flate_Step_Function is access
|
||||||
|
function (Strm : in Thin.Z_Streamp; Flush : in Thin.Int) return Thin.Int;
|
||||||
|
pragma Convention (C, Flate_Step_Function);
|
||||||
|
|
||||||
|
type Flate_End_Function is access
|
||||||
|
function (Ctrm : in Thin.Z_Streamp) return Thin.Int;
|
||||||
|
pragma Convention (C, Flate_End_Function);
|
||||||
|
|
||||||
|
type Flate_Type is record
|
||||||
|
Step : Flate_Step_Function;
|
||||||
|
Done : Flate_End_Function;
|
||||||
|
end record;
|
||||||
|
|
||||||
|
subtype Footer_Array is Stream_Element_Array (1 .. 8);
|
||||||
|
|
||||||
|
Simple_GZip_Header : constant Stream_Element_Array (1 .. 10)
|
||||||
|
:= (16#1f#, 16#8b#, -- Magic header
|
||||||
|
16#08#, -- Z_DEFLATED
|
||||||
|
16#00#, -- Flags
|
||||||
|
16#00#, 16#00#, 16#00#, 16#00#, -- Time
|
||||||
|
16#00#, -- XFlags
|
||||||
|
16#03# -- OS code
|
||||||
|
);
|
||||||
|
-- The simplest gzip header is not for informational, but just for
|
||||||
|
-- gzip format compatibility.
|
||||||
|
-- Note that some code below is using assumption
|
||||||
|
-- Simple_GZip_Header'Last > Footer_Array'Last, so do not make
|
||||||
|
-- Simple_GZip_Header'Last <= Footer_Array'Last.
|
||||||
|
|
||||||
|
Return_Code : constant array (Thin.Int range <>) of Return_Code_Enum
|
||||||
|
:= (0 => OK,
|
||||||
|
1 => STREAM_END,
|
||||||
|
2 => NEED_DICT,
|
||||||
|
-1 => ERRNO,
|
||||||
|
-2 => STREAM_ERROR,
|
||||||
|
-3 => DATA_ERROR,
|
||||||
|
-4 => MEM_ERROR,
|
||||||
|
-5 => BUF_ERROR,
|
||||||
|
-6 => VERSION_ERROR);
|
||||||
|
|
||||||
|
Flate : constant array (Boolean) of Flate_Type
|
||||||
|
:= (True => (Step => Thin.Deflate'Access,
|
||||||
|
Done => Thin.DeflateEnd'Access),
|
||||||
|
False => (Step => Thin.Inflate'Access,
|
||||||
|
Done => Thin.InflateEnd'Access));
|
||||||
|
|
||||||
|
Flush_Finish : constant array (Boolean) of Flush_Mode
|
||||||
|
:= (True => Finish, False => No_Flush);
|
||||||
|
|
||||||
|
procedure Raise_Error (Stream : in Z_Stream);
|
||||||
|
pragma Inline (Raise_Error);
|
||||||
|
|
||||||
|
procedure Raise_Error (Message : in String);
|
||||||
|
pragma Inline (Raise_Error);
|
||||||
|
|
||||||
|
procedure Check_Error (Stream : in Z_Stream; Code : in Thin.Int);
|
||||||
|
|
||||||
|
procedure Free is new Ada.Unchecked_Deallocation
|
||||||
|
(Z_Stream, Z_Stream_Access);
|
||||||
|
|
||||||
|
function To_Thin_Access is new Ada.Unchecked_Conversion
|
||||||
|
(Z_Stream_Access, Thin.Z_Streamp);
|
||||||
|
|
||||||
|
procedure Translate_GZip
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
In_Data : in Ada.Streams.Stream_Element_Array;
|
||||||
|
In_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Out_Data : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Out_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode);
|
||||||
|
-- Separate translate routine for make gzip header.
|
||||||
|
|
||||||
|
procedure Translate_Auto
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
In_Data : in Ada.Streams.Stream_Element_Array;
|
||||||
|
In_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Out_Data : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Out_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode);
|
||||||
|
-- translate routine without additional headers.
|
||||||
|
|
||||||
|
-----------------
|
||||||
|
-- Check_Error --
|
||||||
|
-----------------
|
||||||
|
|
||||||
|
procedure Check_Error (Stream : in Z_Stream; Code : in Thin.Int) is
|
||||||
|
use type Thin.Int;
|
||||||
|
begin
|
||||||
|
if Code /= Thin.Z_OK then
|
||||||
|
Raise_Error
|
||||||
|
(Return_Code_Enum'Image (Return_Code (Code))
|
||||||
|
& ": " & Last_Error_Message (Stream));
|
||||||
|
end if;
|
||||||
|
end Check_Error;
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- Close --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
procedure Close
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Ignore_Error : in Boolean := False)
|
||||||
|
is
|
||||||
|
Code : Thin.Int;
|
||||||
|
begin
|
||||||
|
if not Ignore_Error and then not Is_Open (Filter) then
|
||||||
|
raise Status_Error;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
Code := Flate (Filter.Compression).Done (To_Thin_Access (Filter.Strm));
|
||||||
|
|
||||||
|
if Ignore_Error or else Code = Thin.Z_OK then
|
||||||
|
Free (Filter.Strm);
|
||||||
|
else
|
||||||
|
declare
|
||||||
|
Error_Message : constant String
|
||||||
|
:= Last_Error_Message (Filter.Strm.all);
|
||||||
|
begin
|
||||||
|
Free (Filter.Strm);
|
||||||
|
Ada.Exceptions.Raise_Exception
|
||||||
|
(ZLib_Error'Identity,
|
||||||
|
Return_Code_Enum'Image (Return_Code (Code))
|
||||||
|
& ": " & Error_Message);
|
||||||
|
end;
|
||||||
|
end if;
|
||||||
|
end Close;
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- CRC32 --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
function CRC32
|
||||||
|
(CRC : in Unsigned_32;
|
||||||
|
Data : in Ada.Streams.Stream_Element_Array)
|
||||||
|
return Unsigned_32
|
||||||
|
is
|
||||||
|
use Thin;
|
||||||
|
begin
|
||||||
|
return Unsigned_32 (crc32 (ULong (CRC),
|
||||||
|
Data'Address,
|
||||||
|
Data'Length));
|
||||||
|
end CRC32;
|
||||||
|
|
||||||
|
procedure CRC32
|
||||||
|
(CRC : in out Unsigned_32;
|
||||||
|
Data : in Ada.Streams.Stream_Element_Array) is
|
||||||
|
begin
|
||||||
|
CRC := CRC32 (CRC, Data);
|
||||||
|
end CRC32;
|
||||||
|
|
||||||
|
------------------
|
||||||
|
-- Deflate_Init --
|
||||||
|
------------------
|
||||||
|
|
||||||
|
procedure Deflate_Init
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Level : in Compression_Level := Default_Compression;
|
||||||
|
Strategy : in Strategy_Type := Default_Strategy;
|
||||||
|
Method : in Compression_Method := Deflated;
|
||||||
|
Window_Bits : in Window_Bits_Type := Default_Window_Bits;
|
||||||
|
Memory_Level : in Memory_Level_Type := Default_Memory_Level;
|
||||||
|
Header : in Header_Type := Default)
|
||||||
|
is
|
||||||
|
use type Thin.Int;
|
||||||
|
Win_Bits : Thin.Int := Thin.Int (Window_Bits);
|
||||||
|
begin
|
||||||
|
if Is_Open (Filter) then
|
||||||
|
raise Status_Error;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
-- We allow ZLib to make header only in case of default header type.
|
||||||
|
-- Otherwise we would either do header by ourselfs, or do not do
|
||||||
|
-- header at all.
|
||||||
|
|
||||||
|
if Header = None or else Header = GZip then
|
||||||
|
Win_Bits := -Win_Bits;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
-- For the GZip CRC calculation and make headers.
|
||||||
|
|
||||||
|
if Header = GZip then
|
||||||
|
Filter.CRC := 0;
|
||||||
|
Filter.Offset := Simple_GZip_Header'First;
|
||||||
|
else
|
||||||
|
Filter.Offset := Simple_GZip_Header'Last + 1;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
Filter.Strm := new Z_Stream;
|
||||||
|
Filter.Compression := True;
|
||||||
|
Filter.Stream_End := False;
|
||||||
|
Filter.Header := Header;
|
||||||
|
|
||||||
|
if Thin.Deflate_Init
|
||||||
|
(To_Thin_Access (Filter.Strm),
|
||||||
|
Level => Thin.Int (Level),
|
||||||
|
method => Thin.Int (Method),
|
||||||
|
windowBits => Win_Bits,
|
||||||
|
memLevel => Thin.Int (Memory_Level),
|
||||||
|
strategy => Thin.Int (Strategy)) /= Thin.Z_OK
|
||||||
|
then
|
||||||
|
Raise_Error (Filter.Strm.all);
|
||||||
|
end if;
|
||||||
|
end Deflate_Init;
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- Flush --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
procedure Flush
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Out_Data : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Out_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode)
|
||||||
|
is
|
||||||
|
No_Data : Stream_Element_Array := (1 .. 0 => 0);
|
||||||
|
Last : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
Translate (Filter, No_Data, Last, Out_Data, Out_Last, Flush);
|
||||||
|
end Flush;
|
||||||
|
|
||||||
|
-----------------------
|
||||||
|
-- Generic_Translate --
|
||||||
|
-----------------------
|
||||||
|
|
||||||
|
procedure Generic_Translate
|
||||||
|
(Filter : in out ZLib.Filter_Type;
|
||||||
|
In_Buffer_Size : in Integer := Default_Buffer_Size;
|
||||||
|
Out_Buffer_Size : in Integer := Default_Buffer_Size)
|
||||||
|
is
|
||||||
|
In_Buffer : Stream_Element_Array
|
||||||
|
(1 .. Stream_Element_Offset (In_Buffer_Size));
|
||||||
|
Out_Buffer : Stream_Element_Array
|
||||||
|
(1 .. Stream_Element_Offset (Out_Buffer_Size));
|
||||||
|
Last : Stream_Element_Offset;
|
||||||
|
In_Last : Stream_Element_Offset;
|
||||||
|
In_First : Stream_Element_Offset;
|
||||||
|
Out_Last : Stream_Element_Offset;
|
||||||
|
begin
|
||||||
|
Main : loop
|
||||||
|
Data_In (In_Buffer, Last);
|
||||||
|
|
||||||
|
In_First := In_Buffer'First;
|
||||||
|
|
||||||
|
loop
|
||||||
|
Translate
|
||||||
|
(Filter => Filter,
|
||||||
|
In_Data => In_Buffer (In_First .. Last),
|
||||||
|
In_Last => In_Last,
|
||||||
|
Out_Data => Out_Buffer,
|
||||||
|
Out_Last => Out_Last,
|
||||||
|
Flush => Flush_Finish (Last < In_Buffer'First));
|
||||||
|
|
||||||
|
if Out_Buffer'First <= Out_Last then
|
||||||
|
Data_Out (Out_Buffer (Out_Buffer'First .. Out_Last));
|
||||||
|
end if;
|
||||||
|
|
||||||
|
exit Main when Stream_End (Filter);
|
||||||
|
|
||||||
|
-- The end of in buffer.
|
||||||
|
|
||||||
|
exit when In_Last = Last;
|
||||||
|
|
||||||
|
In_First := In_Last + 1;
|
||||||
|
end loop;
|
||||||
|
end loop Main;
|
||||||
|
|
||||||
|
end Generic_Translate;
|
||||||
|
|
||||||
|
------------------
|
||||||
|
-- Inflate_Init --
|
||||||
|
------------------
|
||||||
|
|
||||||
|
procedure Inflate_Init
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Window_Bits : in Window_Bits_Type := Default_Window_Bits;
|
||||||
|
Header : in Header_Type := Default)
|
||||||
|
is
|
||||||
|
use type Thin.Int;
|
||||||
|
Win_Bits : Thin.Int := Thin.Int (Window_Bits);
|
||||||
|
|
||||||
|
procedure Check_Version;
|
||||||
|
-- Check the latest header types compatibility.
|
||||||
|
|
||||||
|
procedure Check_Version is
|
||||||
|
begin
|
||||||
|
if Version <= "1.1.4" then
|
||||||
|
Raise_Error
|
||||||
|
("Inflate header type " & Header_Type'Image (Header)
|
||||||
|
& " incompatible with ZLib version " & Version);
|
||||||
|
end if;
|
||||||
|
end Check_Version;
|
||||||
|
|
||||||
|
begin
|
||||||
|
if Is_Open (Filter) then
|
||||||
|
raise Status_Error;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
case Header is
|
||||||
|
when None =>
|
||||||
|
Check_Version;
|
||||||
|
|
||||||
|
-- Inflate data without headers determined
|
||||||
|
-- by negative Win_Bits.
|
||||||
|
|
||||||
|
Win_Bits := -Win_Bits;
|
||||||
|
when GZip =>
|
||||||
|
Check_Version;
|
||||||
|
|
||||||
|
-- Inflate gzip data defined by flag 16.
|
||||||
|
|
||||||
|
Win_Bits := Win_Bits + 16;
|
||||||
|
when Auto =>
|
||||||
|
Check_Version;
|
||||||
|
|
||||||
|
-- Inflate with automatic detection
|
||||||
|
-- of gzip or native header defined by flag 32.
|
||||||
|
|
||||||
|
Win_Bits := Win_Bits + 32;
|
||||||
|
when Default => null;
|
||||||
|
end case;
|
||||||
|
|
||||||
|
Filter.Strm := new Z_Stream;
|
||||||
|
Filter.Compression := False;
|
||||||
|
Filter.Stream_End := False;
|
||||||
|
Filter.Header := Header;
|
||||||
|
|
||||||
|
if Thin.Inflate_Init
|
||||||
|
(To_Thin_Access (Filter.Strm), Win_Bits) /= Thin.Z_OK
|
||||||
|
then
|
||||||
|
Raise_Error (Filter.Strm.all);
|
||||||
|
end if;
|
||||||
|
end Inflate_Init;
|
||||||
|
|
||||||
|
-------------
|
||||||
|
-- Is_Open --
|
||||||
|
-------------
|
||||||
|
|
||||||
|
function Is_Open (Filter : in Filter_Type) return Boolean is
|
||||||
|
begin
|
||||||
|
return Filter.Strm /= null;
|
||||||
|
end Is_Open;
|
||||||
|
|
||||||
|
-----------------
|
||||||
|
-- Raise_Error --
|
||||||
|
-----------------
|
||||||
|
|
||||||
|
procedure Raise_Error (Message : in String) is
|
||||||
|
begin
|
||||||
|
Ada.Exceptions.Raise_Exception (ZLib_Error'Identity, Message);
|
||||||
|
end Raise_Error;
|
||||||
|
|
||||||
|
procedure Raise_Error (Stream : in Z_Stream) is
|
||||||
|
begin
|
||||||
|
Raise_Error (Last_Error_Message (Stream));
|
||||||
|
end Raise_Error;
|
||||||
|
|
||||||
|
----------
|
||||||
|
-- Read --
|
||||||
|
----------
|
||||||
|
|
||||||
|
procedure Read
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Item : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode := No_Flush)
|
||||||
|
is
|
||||||
|
In_Last : Stream_Element_Offset;
|
||||||
|
Item_First : Ada.Streams.Stream_Element_Offset := Item'First;
|
||||||
|
V_Flush : Flush_Mode := Flush;
|
||||||
|
|
||||||
|
begin
|
||||||
|
pragma Assert (Rest_First in Buffer'First .. Buffer'Last + 1);
|
||||||
|
pragma Assert (Rest_Last in Buffer'First - 1 .. Buffer'Last);
|
||||||
|
|
||||||
|
loop
|
||||||
|
if Rest_Last = Buffer'First - 1 then
|
||||||
|
V_Flush := Finish;
|
||||||
|
|
||||||
|
elsif Rest_First > Rest_Last then
|
||||||
|
Read (Buffer, Rest_Last);
|
||||||
|
Rest_First := Buffer'First;
|
||||||
|
|
||||||
|
if Rest_Last < Buffer'First then
|
||||||
|
V_Flush := Finish;
|
||||||
|
end if;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
Translate
|
||||||
|
(Filter => Filter,
|
||||||
|
In_Data => Buffer (Rest_First .. Rest_Last),
|
||||||
|
In_Last => In_Last,
|
||||||
|
Out_Data => Item (Item_First .. Item'Last),
|
||||||
|
Out_Last => Last,
|
||||||
|
Flush => V_Flush);
|
||||||
|
|
||||||
|
Rest_First := In_Last + 1;
|
||||||
|
|
||||||
|
exit when Stream_End (Filter)
|
||||||
|
or else Last = Item'Last
|
||||||
|
or else (Last >= Item'First and then Allow_Read_Some);
|
||||||
|
|
||||||
|
Item_First := Last + 1;
|
||||||
|
end loop;
|
||||||
|
end Read;
|
||||||
|
|
||||||
|
----------------
|
||||||
|
-- Stream_End --
|
||||||
|
----------------
|
||||||
|
|
||||||
|
function Stream_End (Filter : in Filter_Type) return Boolean is
|
||||||
|
begin
|
||||||
|
if Filter.Header = GZip and Filter.Compression then
|
||||||
|
return Filter.Stream_End
|
||||||
|
and then Filter.Offset = Footer_Array'Last + 1;
|
||||||
|
else
|
||||||
|
return Filter.Stream_End;
|
||||||
|
end if;
|
||||||
|
end Stream_End;
|
||||||
|
|
||||||
|
--------------
|
||||||
|
-- Total_In --
|
||||||
|
--------------
|
||||||
|
|
||||||
|
function Total_In (Filter : in Filter_Type) return Count is
|
||||||
|
begin
|
||||||
|
return Count (Thin.Total_In (To_Thin_Access (Filter.Strm).all));
|
||||||
|
end Total_In;
|
||||||
|
|
||||||
|
---------------
|
||||||
|
-- Total_Out --
|
||||||
|
---------------
|
||||||
|
|
||||||
|
function Total_Out (Filter : in Filter_Type) return Count is
|
||||||
|
begin
|
||||||
|
return Count (Thin.Total_Out (To_Thin_Access (Filter.Strm).all));
|
||||||
|
end Total_Out;
|
||||||
|
|
||||||
|
---------------
|
||||||
|
-- Translate --
|
||||||
|
---------------
|
||||||
|
|
||||||
|
procedure Translate
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
In_Data : in Ada.Streams.Stream_Element_Array;
|
||||||
|
In_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Out_Data : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Out_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode) is
|
||||||
|
begin
|
||||||
|
if Filter.Header = GZip and then Filter.Compression then
|
||||||
|
Translate_GZip
|
||||||
|
(Filter => Filter,
|
||||||
|
In_Data => In_Data,
|
||||||
|
In_Last => In_Last,
|
||||||
|
Out_Data => Out_Data,
|
||||||
|
Out_Last => Out_Last,
|
||||||
|
Flush => Flush);
|
||||||
|
else
|
||||||
|
Translate_Auto
|
||||||
|
(Filter => Filter,
|
||||||
|
In_Data => In_Data,
|
||||||
|
In_Last => In_Last,
|
||||||
|
Out_Data => Out_Data,
|
||||||
|
Out_Last => Out_Last,
|
||||||
|
Flush => Flush);
|
||||||
|
end if;
|
||||||
|
end Translate;
|
||||||
|
|
||||||
|
--------------------
|
||||||
|
-- Translate_Auto --
|
||||||
|
--------------------
|
||||||
|
|
||||||
|
procedure Translate_Auto
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
In_Data : in Ada.Streams.Stream_Element_Array;
|
||||||
|
In_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Out_Data : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Out_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode)
|
||||||
|
is
|
||||||
|
use type Thin.Int;
|
||||||
|
Code : Thin.Int;
|
||||||
|
|
||||||
|
begin
|
||||||
|
if not Is_Open (Filter) then
|
||||||
|
raise Status_Error;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
if Out_Data'Length = 0 and then In_Data'Length = 0 then
|
||||||
|
raise Constraint_Error;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
Set_Out (Filter.Strm.all, Out_Data'Address, Out_Data'Length);
|
||||||
|
Set_In (Filter.Strm.all, In_Data'Address, In_Data'Length);
|
||||||
|
|
||||||
|
Code := Flate (Filter.Compression).Step
|
||||||
|
(To_Thin_Access (Filter.Strm),
|
||||||
|
Thin.Int (Flush));
|
||||||
|
|
||||||
|
if Code = Thin.Z_STREAM_END then
|
||||||
|
Filter.Stream_End := True;
|
||||||
|
else
|
||||||
|
Check_Error (Filter.Strm.all, Code);
|
||||||
|
end if;
|
||||||
|
|
||||||
|
In_Last := In_Data'Last
|
||||||
|
- Stream_Element_Offset (Avail_In (Filter.Strm.all));
|
||||||
|
Out_Last := Out_Data'Last
|
||||||
|
- Stream_Element_Offset (Avail_Out (Filter.Strm.all));
|
||||||
|
end Translate_Auto;
|
||||||
|
|
||||||
|
--------------------
|
||||||
|
-- Translate_GZip --
|
||||||
|
--------------------
|
||||||
|
|
||||||
|
procedure Translate_GZip
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
In_Data : in Ada.Streams.Stream_Element_Array;
|
||||||
|
In_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Out_Data : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Out_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode)
|
||||||
|
is
|
||||||
|
Out_First : Stream_Element_Offset;
|
||||||
|
|
||||||
|
procedure Add_Data (Data : in Stream_Element_Array);
|
||||||
|
-- Add data to stream from the Filter.Offset till necessary,
|
||||||
|
-- used for add gzip headr/footer.
|
||||||
|
|
||||||
|
procedure Put_32
|
||||||
|
(Item : in out Stream_Element_Array;
|
||||||
|
Data : in Unsigned_32);
|
||||||
|
pragma Inline (Put_32);
|
||||||
|
|
||||||
|
--------------
|
||||||
|
-- Add_Data --
|
||||||
|
--------------
|
||||||
|
|
||||||
|
procedure Add_Data (Data : in Stream_Element_Array) is
|
||||||
|
Data_First : Stream_Element_Offset renames Filter.Offset;
|
||||||
|
Data_Last : Stream_Element_Offset;
|
||||||
|
Data_Len : Stream_Element_Offset; -- -1
|
||||||
|
Out_Len : Stream_Element_Offset; -- -1
|
||||||
|
begin
|
||||||
|
Out_First := Out_Last + 1;
|
||||||
|
|
||||||
|
if Data_First > Data'Last then
|
||||||
|
return;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
Data_Len := Data'Last - Data_First;
|
||||||
|
Out_Len := Out_Data'Last - Out_First;
|
||||||
|
|
||||||
|
if Data_Len <= Out_Len then
|
||||||
|
Out_Last := Out_First + Data_Len;
|
||||||
|
Data_Last := Data'Last;
|
||||||
|
else
|
||||||
|
Out_Last := Out_Data'Last;
|
||||||
|
Data_Last := Data_First + Out_Len;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
Out_Data (Out_First .. Out_Last) := Data (Data_First .. Data_Last);
|
||||||
|
|
||||||
|
Data_First := Data_Last + 1;
|
||||||
|
Out_First := Out_Last + 1;
|
||||||
|
end Add_Data;
|
||||||
|
|
||||||
|
------------
|
||||||
|
-- Put_32 --
|
||||||
|
------------
|
||||||
|
|
||||||
|
procedure Put_32
|
||||||
|
(Item : in out Stream_Element_Array;
|
||||||
|
Data : in Unsigned_32)
|
||||||
|
is
|
||||||
|
D : Unsigned_32 := Data;
|
||||||
|
begin
|
||||||
|
for J in Item'First .. Item'First + 3 loop
|
||||||
|
Item (J) := Stream_Element (D and 16#FF#);
|
||||||
|
D := Shift_Right (D, 8);
|
||||||
|
end loop;
|
||||||
|
end Put_32;
|
||||||
|
|
||||||
|
begin
|
||||||
|
Out_Last := Out_Data'First - 1;
|
||||||
|
|
||||||
|
if not Filter.Stream_End then
|
||||||
|
Add_Data (Simple_GZip_Header);
|
||||||
|
|
||||||
|
Translate_Auto
|
||||||
|
(Filter => Filter,
|
||||||
|
In_Data => In_Data,
|
||||||
|
In_Last => In_Last,
|
||||||
|
Out_Data => Out_Data (Out_First .. Out_Data'Last),
|
||||||
|
Out_Last => Out_Last,
|
||||||
|
Flush => Flush);
|
||||||
|
|
||||||
|
CRC32 (Filter.CRC, In_Data (In_Data'First .. In_Last));
|
||||||
|
end if;
|
||||||
|
|
||||||
|
if Filter.Stream_End and then Out_Last <= Out_Data'Last then
|
||||||
|
-- This detection method would work only when
|
||||||
|
-- Simple_GZip_Header'Last > Footer_Array'Last
|
||||||
|
|
||||||
|
if Filter.Offset = Simple_GZip_Header'Last + 1 then
|
||||||
|
Filter.Offset := Footer_Array'First;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
declare
|
||||||
|
Footer : Footer_Array;
|
||||||
|
begin
|
||||||
|
Put_32 (Footer, Filter.CRC);
|
||||||
|
Put_32 (Footer (Footer'First + 4 .. Footer'Last),
|
||||||
|
Unsigned_32 (Total_In (Filter)));
|
||||||
|
Add_Data (Footer);
|
||||||
|
end;
|
||||||
|
end if;
|
||||||
|
end Translate_GZip;
|
||||||
|
|
||||||
|
-------------
|
||||||
|
-- Version --
|
||||||
|
-------------
|
||||||
|
|
||||||
|
function Version return String is
|
||||||
|
begin
|
||||||
|
return Interfaces.C.Strings.Value (Thin.zlibVersion);
|
||||||
|
end Version;
|
||||||
|
|
||||||
|
-----------
|
||||||
|
-- Write --
|
||||||
|
-----------
|
||||||
|
|
||||||
|
procedure Write
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Item : in Ada.Streams.Stream_Element_Array;
|
||||||
|
Flush : in Flush_Mode := No_Flush)
|
||||||
|
is
|
||||||
|
Buffer : Stream_Element_Array (1 .. Buffer_Size);
|
||||||
|
In_Last : Stream_Element_Offset;
|
||||||
|
Out_Last : Stream_Element_Offset;
|
||||||
|
In_First : Stream_Element_Offset := Item'First;
|
||||||
|
begin
|
||||||
|
if Item'Length = 0 and Flush = No_Flush then
|
||||||
|
return;
|
||||||
|
end if;
|
||||||
|
|
||||||
|
loop
|
||||||
|
Translate
|
||||||
|
(Filter => Filter,
|
||||||
|
In_Data => Item (In_First .. Item'Last),
|
||||||
|
In_Last => In_Last,
|
||||||
|
Out_Data => Buffer,
|
||||||
|
Out_Last => Out_Last,
|
||||||
|
Flush => Flush);
|
||||||
|
|
||||||
|
if Out_Last >= Buffer'First then
|
||||||
|
Write (Buffer (1 .. Out_Last));
|
||||||
|
end if;
|
||||||
|
|
||||||
|
exit when In_Last = Item'Last or Stream_End (Filter);
|
||||||
|
|
||||||
|
In_First := In_Last + 1;
|
||||||
|
end loop;
|
||||||
|
end Write;
|
||||||
|
|
||||||
|
end ZLib;
|
||||||
328
contrib/ada/zlib.ads
Normal file
328
contrib/ada/zlib.ads
Normal file
@@ -0,0 +1,328 @@
|
|||||||
|
------------------------------------------------------------------------------
|
||||||
|
-- ZLib for Ada thick binding. --
|
||||||
|
-- --
|
||||||
|
-- Copyright (C) 2002-2004 Dmitriy Anisimkov --
|
||||||
|
-- --
|
||||||
|
-- This library 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 library 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 library; if not, write to the Free Software Foundation, --
|
||||||
|
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
|
||||||
|
-- --
|
||||||
|
-- As a special exception, if other files instantiate generics from this --
|
||||||
|
-- unit, or you link this unit with other files to produce an executable, --
|
||||||
|
-- this unit does not by itself cause the resulting executable to be --
|
||||||
|
-- covered by the GNU General Public License. This exception does not --
|
||||||
|
-- however invalidate any other reasons why the executable file might be --
|
||||||
|
-- covered by the GNU Public License. --
|
||||||
|
------------------------------------------------------------------------------
|
||||||
|
|
||||||
|
-- $Id: zlib.ads,v 1.26 2004/09/06 06:53:19 vagul Exp $
|
||||||
|
|
||||||
|
with Ada.Streams;
|
||||||
|
|
||||||
|
with Interfaces;
|
||||||
|
|
||||||
|
package ZLib is
|
||||||
|
|
||||||
|
ZLib_Error : exception;
|
||||||
|
Status_Error : exception;
|
||||||
|
|
||||||
|
type Compression_Level is new Integer range -1 .. 9;
|
||||||
|
|
||||||
|
type Flush_Mode is private;
|
||||||
|
|
||||||
|
type Compression_Method is private;
|
||||||
|
|
||||||
|
type Window_Bits_Type is new Integer range 8 .. 15;
|
||||||
|
|
||||||
|
type Memory_Level_Type is new Integer range 1 .. 9;
|
||||||
|
|
||||||
|
type Unsigned_32 is new Interfaces.Unsigned_32;
|
||||||
|
|
||||||
|
type Strategy_Type is private;
|
||||||
|
|
||||||
|
type Header_Type is (None, Auto, Default, GZip);
|
||||||
|
-- Header type usage have a some limitation for inflate.
|
||||||
|
-- See comment for Inflate_Init.
|
||||||
|
|
||||||
|
subtype Count is Ada.Streams.Stream_Element_Count;
|
||||||
|
|
||||||
|
Default_Memory_Level : constant Memory_Level_Type := 8;
|
||||||
|
Default_Window_Bits : constant Window_Bits_Type := 15;
|
||||||
|
|
||||||
|
----------------------------------
|
||||||
|
-- Compression method constants --
|
||||||
|
----------------------------------
|
||||||
|
|
||||||
|
Deflated : constant Compression_Method;
|
||||||
|
-- Only one method allowed in this ZLib version
|
||||||
|
|
||||||
|
---------------------------------
|
||||||
|
-- Compression level constants --
|
||||||
|
---------------------------------
|
||||||
|
|
||||||
|
No_Compression : constant Compression_Level := 0;
|
||||||
|
Best_Speed : constant Compression_Level := 1;
|
||||||
|
Best_Compression : constant Compression_Level := 9;
|
||||||
|
Default_Compression : constant Compression_Level := -1;
|
||||||
|
|
||||||
|
--------------------------
|
||||||
|
-- Flush mode constants --
|
||||||
|
--------------------------
|
||||||
|
|
||||||
|
No_Flush : constant Flush_Mode;
|
||||||
|
-- Regular way for compression, no flush
|
||||||
|
|
||||||
|
Partial_Flush : constant Flush_Mode;
|
||||||
|
-- Will be removed, use Z_SYNC_FLUSH instead
|
||||||
|
|
||||||
|
Sync_Flush : constant Flush_Mode;
|
||||||
|
-- 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.
|
||||||
|
|
||||||
|
Block_Flush : constant Flush_Mode;
|
||||||
|
-- Z_BLOCK requests that inflate() stop
|
||||||
|
-- if and when it get 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.
|
||||||
|
|
||||||
|
Full_Flush : constant Flush_Mode;
|
||||||
|
-- All output is flushed as with 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
|
||||||
|
-- Full_Flush too often can seriously degrade the compression.
|
||||||
|
|
||||||
|
Finish : constant Flush_Mode;
|
||||||
|
-- Just for tell the compressor that input data is complete.
|
||||||
|
|
||||||
|
------------------------------------
|
||||||
|
-- Compression strategy constants --
|
||||||
|
------------------------------------
|
||||||
|
|
||||||
|
-- RLE stategy could be used only in version 1.2.0 and later.
|
||||||
|
|
||||||
|
Filtered : constant Strategy_Type;
|
||||||
|
Huffman_Only : constant Strategy_Type;
|
||||||
|
RLE : constant Strategy_Type;
|
||||||
|
Default_Strategy : constant Strategy_Type;
|
||||||
|
|
||||||
|
Default_Buffer_Size : constant := 4096;
|
||||||
|
|
||||||
|
type Filter_Type is tagged limited private;
|
||||||
|
-- The filter is for compression and for decompression.
|
||||||
|
-- The usage of the type is depend of its initialization.
|
||||||
|
|
||||||
|
function Version return String;
|
||||||
|
pragma Inline (Version);
|
||||||
|
-- Return string representation of the ZLib version.
|
||||||
|
|
||||||
|
procedure Deflate_Init
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Level : in Compression_Level := Default_Compression;
|
||||||
|
Strategy : in Strategy_Type := Default_Strategy;
|
||||||
|
Method : in Compression_Method := Deflated;
|
||||||
|
Window_Bits : in Window_Bits_Type := Default_Window_Bits;
|
||||||
|
Memory_Level : in Memory_Level_Type := Default_Memory_Level;
|
||||||
|
Header : in Header_Type := Default);
|
||||||
|
-- Compressor initialization.
|
||||||
|
-- When Header parameter is Auto or Default, then default zlib header
|
||||||
|
-- would be provided for compressed data.
|
||||||
|
-- When Header is GZip, then gzip header would be set instead of
|
||||||
|
-- default header.
|
||||||
|
-- When Header is None, no header would be set for compressed data.
|
||||||
|
|
||||||
|
procedure Inflate_Init
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Window_Bits : in Window_Bits_Type := Default_Window_Bits;
|
||||||
|
Header : in Header_Type := Default);
|
||||||
|
-- Decompressor initialization.
|
||||||
|
-- Default header type mean that ZLib default header is expecting in the
|
||||||
|
-- input compressed stream.
|
||||||
|
-- Header type None mean that no header is expecting in the input stream.
|
||||||
|
-- GZip header type mean that GZip header is expecting in the
|
||||||
|
-- input compressed stream.
|
||||||
|
-- Auto header type mean that header type (GZip or Native) would be
|
||||||
|
-- detected automatically in the input stream.
|
||||||
|
-- Note that header types parameter values None, GZip and Auto are
|
||||||
|
-- supported for inflate routine only in ZLib versions 1.2.0.2 and later.
|
||||||
|
-- Deflate_Init is supporting all header types.
|
||||||
|
|
||||||
|
function Is_Open (Filter : in Filter_Type) return Boolean;
|
||||||
|
pragma Inline (Is_Open);
|
||||||
|
-- Is the filter opened for compression or decompression.
|
||||||
|
|
||||||
|
procedure Close
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Ignore_Error : in Boolean := False);
|
||||||
|
-- Closing the compression or decompressor.
|
||||||
|
-- If stream is closing before the complete and Ignore_Error is False,
|
||||||
|
-- The exception would be raised.
|
||||||
|
|
||||||
|
generic
|
||||||
|
with procedure Data_In
|
||||||
|
(Item : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Last : out Ada.Streams.Stream_Element_Offset);
|
||||||
|
with procedure Data_Out
|
||||||
|
(Item : in Ada.Streams.Stream_Element_Array);
|
||||||
|
procedure Generic_Translate
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
In_Buffer_Size : in Integer := Default_Buffer_Size;
|
||||||
|
Out_Buffer_Size : in Integer := Default_Buffer_Size);
|
||||||
|
-- Compress/decompress data fetch from Data_In routine and pass the result
|
||||||
|
-- to the Data_Out routine. User should provide Data_In and Data_Out
|
||||||
|
-- for compression/decompression data flow.
|
||||||
|
-- Compression or decompression depend on Filter initialization.
|
||||||
|
|
||||||
|
function Total_In (Filter : in Filter_Type) return Count;
|
||||||
|
pragma Inline (Total_In);
|
||||||
|
-- Returns total number of input bytes read so far
|
||||||
|
|
||||||
|
function Total_Out (Filter : in Filter_Type) return Count;
|
||||||
|
pragma Inline (Total_Out);
|
||||||
|
-- Returns total number of bytes output so far
|
||||||
|
|
||||||
|
function CRC32
|
||||||
|
(CRC : in Unsigned_32;
|
||||||
|
Data : in Ada.Streams.Stream_Element_Array)
|
||||||
|
return Unsigned_32;
|
||||||
|
pragma Inline (CRC32);
|
||||||
|
-- Compute CRC32, it could be necessary for make gzip format
|
||||||
|
|
||||||
|
procedure CRC32
|
||||||
|
(CRC : in out Unsigned_32;
|
||||||
|
Data : in Ada.Streams.Stream_Element_Array);
|
||||||
|
pragma Inline (CRC32);
|
||||||
|
-- Compute CRC32, it could be necessary for make gzip format
|
||||||
|
|
||||||
|
-------------------------------------------------
|
||||||
|
-- Below is more complex low level routines. --
|
||||||
|
-------------------------------------------------
|
||||||
|
|
||||||
|
procedure Translate
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
In_Data : in Ada.Streams.Stream_Element_Array;
|
||||||
|
In_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Out_Data : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Out_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode);
|
||||||
|
-- Compress/decompress the In_Data buffer and place the result into
|
||||||
|
-- Out_Data. In_Last is the index of last element from In_Data accepted by
|
||||||
|
-- the Filter. Out_Last is the last element of the received data from
|
||||||
|
-- Filter. To tell the filter that incoming data are complete put the
|
||||||
|
-- Flush parameter to Finish.
|
||||||
|
|
||||||
|
function Stream_End (Filter : in Filter_Type) return Boolean;
|
||||||
|
pragma Inline (Stream_End);
|
||||||
|
-- Return the true when the stream is complete.
|
||||||
|
|
||||||
|
procedure Flush
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Out_Data : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Out_Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode);
|
||||||
|
pragma Inline (Flush);
|
||||||
|
-- Flushing the data from the compressor.
|
||||||
|
|
||||||
|
generic
|
||||||
|
with procedure Write
|
||||||
|
(Item : in Ada.Streams.Stream_Element_Array);
|
||||||
|
-- User should provide this routine for accept
|
||||||
|
-- compressed/decompressed data.
|
||||||
|
|
||||||
|
Buffer_Size : in Ada.Streams.Stream_Element_Offset
|
||||||
|
:= Default_Buffer_Size;
|
||||||
|
-- Buffer size for Write user routine.
|
||||||
|
|
||||||
|
procedure Write
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Item : in Ada.Streams.Stream_Element_Array;
|
||||||
|
Flush : in Flush_Mode := No_Flush);
|
||||||
|
-- Compress/Decompress data from Item to the generic parameter procedure
|
||||||
|
-- Write. Output buffer size could be set in Buffer_Size generic parameter.
|
||||||
|
|
||||||
|
generic
|
||||||
|
with procedure Read
|
||||||
|
(Item : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Last : out Ada.Streams.Stream_Element_Offset);
|
||||||
|
-- User should provide data for compression/decompression
|
||||||
|
-- thru this routine.
|
||||||
|
|
||||||
|
Buffer : in out Ada.Streams.Stream_Element_Array;
|
||||||
|
-- Buffer for keep remaining data from the previous
|
||||||
|
-- back read.
|
||||||
|
|
||||||
|
Rest_First, Rest_Last : in out Ada.Streams.Stream_Element_Offset;
|
||||||
|
-- Rest_First have to be initialized to Buffer'Last + 1
|
||||||
|
-- Rest_Last have to be initialized to Buffer'Last
|
||||||
|
-- before usage.
|
||||||
|
|
||||||
|
Allow_Read_Some : in Boolean := False;
|
||||||
|
-- Is it allowed to return Last < Item'Last before end of data.
|
||||||
|
|
||||||
|
procedure Read
|
||||||
|
(Filter : in out Filter_Type;
|
||||||
|
Item : out Ada.Streams.Stream_Element_Array;
|
||||||
|
Last : out Ada.Streams.Stream_Element_Offset;
|
||||||
|
Flush : in Flush_Mode := No_Flush);
|
||||||
|
-- Compress/Decompress data from generic parameter procedure Read to the
|
||||||
|
-- Item. User should provide Buffer and initialized Rest_First, Rest_Last
|
||||||
|
-- indicators. If Allow_Read_Some is True, Read routines could return
|
||||||
|
-- Last < Item'Last only at end of stream.
|
||||||
|
|
||||||
|
private
|
||||||
|
|
||||||
|
use Ada.Streams;
|
||||||
|
|
||||||
|
pragma Assert (Ada.Streams.Stream_Element'Size = 8);
|
||||||
|
pragma Assert (Ada.Streams.Stream_Element'Modulus = 2**8);
|
||||||
|
|
||||||
|
type Flush_Mode is new Integer range 0 .. 5;
|
||||||
|
|
||||||
|
type Compression_Method is new Integer range 8 .. 8;
|
||||||
|
|
||||||
|
type Strategy_Type is new Integer range 0 .. 3;
|
||||||
|
|
||||||
|
No_Flush : constant Flush_Mode := 0;
|
||||||
|
Partial_Flush : constant Flush_Mode := 1;
|
||||||
|
Sync_Flush : constant Flush_Mode := 2;
|
||||||
|
Full_Flush : constant Flush_Mode := 3;
|
||||||
|
Finish : constant Flush_Mode := 4;
|
||||||
|
Block_Flush : constant Flush_Mode := 5;
|
||||||
|
|
||||||
|
Filtered : constant Strategy_Type := 1;
|
||||||
|
Huffman_Only : constant Strategy_Type := 2;
|
||||||
|
RLE : constant Strategy_Type := 3;
|
||||||
|
Default_Strategy : constant Strategy_Type := 0;
|
||||||
|
|
||||||
|
Deflated : constant Compression_Method := 8;
|
||||||
|
|
||||||
|
type Z_Stream;
|
||||||
|
|
||||||
|
type Z_Stream_Access is access all Z_Stream;
|
||||||
|
|
||||||
|
type Filter_Type is tagged limited record
|
||||||
|
Strm : Z_Stream_Access;
|
||||||
|
Compression : Boolean;
|
||||||
|
Stream_End : Boolean;
|
||||||
|
Header : Header_Type;
|
||||||
|
CRC : Unsigned_32;
|
||||||
|
Offset : Stream_Element_Offset;
|
||||||
|
-- Offset for gzip header/footer output.
|
||||||
|
end record;
|
||||||
|
|
||||||
|
end ZLib;
|
||||||
20
contrib/ada/zlib.gpr
Normal file
20
contrib/ada/zlib.gpr
Normal file
@@ -0,0 +1,20 @@
|
|||||||
|
project Zlib is
|
||||||
|
|
||||||
|
for Languages use ("Ada");
|
||||||
|
for Source_Dirs use (".");
|
||||||
|
for Object_Dir use ".";
|
||||||
|
for Main use ("test.adb", "mtest.adb", "read.adb", "buffer_demo");
|
||||||
|
|
||||||
|
package Compiler is
|
||||||
|
for Default_Switches ("ada") use ("-gnatwcfilopru", "-gnatVcdfimorst", "-gnatyabcefhiklmnoprst");
|
||||||
|
end Compiler;
|
||||||
|
|
||||||
|
package Linker is
|
||||||
|
for Default_Switches ("ada") use ("-lz");
|
||||||
|
end Linker;
|
||||||
|
|
||||||
|
package Builder is
|
||||||
|
for Default_Switches ("ada") use ("-s", "-gnatQ");
|
||||||
|
end Builder;
|
||||||
|
|
||||||
|
end Zlib;
|
||||||
452
contrib/amd64/amd64-match.S
Normal file
452
contrib/amd64/amd64-match.S
Normal file
@@ -0,0 +1,452 @@
|
|||||||
|
/*
|
||||||
|
* match.S -- optimized version of longest_match()
|
||||||
|
* based on the similar work by Gilles Vollant, and Brian Raiter, written 1998
|
||||||
|
*
|
||||||
|
* This is free software; you can redistribute it and/or modify it
|
||||||
|
* under the terms of the BSD License. Use by owners of Che Guevarra
|
||||||
|
* parafernalia is prohibited, where possible, and highly discouraged
|
||||||
|
* elsewhere.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef NO_UNDERLINE
|
||||||
|
# define match_init _match_init
|
||||||
|
# define longest_match _longest_match
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define scanend ebx
|
||||||
|
#define scanendw bx
|
||||||
|
#define chainlenwmask edx /* high word: current chain len low word: s->wmask */
|
||||||
|
#define curmatch rsi
|
||||||
|
#define curmatchd esi
|
||||||
|
#define windowbestlen r8
|
||||||
|
#define scanalign r9
|
||||||
|
#define scanalignd r9d
|
||||||
|
#define window r10
|
||||||
|
#define bestlen r11
|
||||||
|
#define bestlend r11d
|
||||||
|
#define scanstart r12d
|
||||||
|
#define scanstartw r12w
|
||||||
|
#define scan r13
|
||||||
|
#define nicematch r14d
|
||||||
|
#define limit r15
|
||||||
|
#define limitd r15d
|
||||||
|
#define prev rcx
|
||||||
|
|
||||||
|
/*
|
||||||
|
* The 258 is a "magic number, not a parameter -- changing it
|
||||||
|
* breaks the hell loose
|
||||||
|
*/
|
||||||
|
#define MAX_MATCH (258)
|
||||||
|
#define MIN_MATCH (3)
|
||||||
|
#define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
|
||||||
|
#define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7)
|
||||||
|
|
||||||
|
/* stack frame offsets */
|
||||||
|
#define LocalVarsSize (112)
|
||||||
|
#define _chainlenwmask ( 8-LocalVarsSize)(%rsp)
|
||||||
|
#define _windowbestlen (16-LocalVarsSize)(%rsp)
|
||||||
|
#define save_r14 (24-LocalVarsSize)(%rsp)
|
||||||
|
#define save_rsi (32-LocalVarsSize)(%rsp)
|
||||||
|
#define save_rbx (40-LocalVarsSize)(%rsp)
|
||||||
|
#define save_r12 (56-LocalVarsSize)(%rsp)
|
||||||
|
#define save_r13 (64-LocalVarsSize)(%rsp)
|
||||||
|
#define save_r15 (80-LocalVarsSize)(%rsp)
|
||||||
|
|
||||||
|
|
||||||
|
.globl match_init, longest_match
|
||||||
|
|
||||||
|
/*
|
||||||
|
* On AMD64 the first argument of a function (in our case -- the pointer to
|
||||||
|
* deflate_state structure) is passed in %rdi, hence our offsets below are
|
||||||
|
* all off of that.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* you can check the structure offset by running
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include "deflate.h"
|
||||||
|
|
||||||
|
void print_depl()
|
||||||
|
{
|
||||||
|
deflate_state ds;
|
||||||
|
deflate_state *s=&ds;
|
||||||
|
printf("size pointer=%u\n",(int)sizeof(void*));
|
||||||
|
|
||||||
|
printf("#define dsWSize (%3u)(%%rdi)\n",(int)(((char*)&(s->w_size))-((char*)s)));
|
||||||
|
printf("#define dsWMask (%3u)(%%rdi)\n",(int)(((char*)&(s->w_mask))-((char*)s)));
|
||||||
|
printf("#define dsWindow (%3u)(%%rdi)\n",(int)(((char*)&(s->window))-((char*)s)));
|
||||||
|
printf("#define dsPrev (%3u)(%%rdi)\n",(int)(((char*)&(s->prev))-((char*)s)));
|
||||||
|
printf("#define dsMatchLen (%3u)(%%rdi)\n",(int)(((char*)&(s->match_length))-((char*)s)));
|
||||||
|
printf("#define dsPrevMatch (%3u)(%%rdi)\n",(int)(((char*)&(s->prev_match))-((char*)s)));
|
||||||
|
printf("#define dsStrStart (%3u)(%%rdi)\n",(int)(((char*)&(s->strstart))-((char*)s)));
|
||||||
|
printf("#define dsMatchStart (%3u)(%%rdi)\n",(int)(((char*)&(s->match_start))-((char*)s)));
|
||||||
|
printf("#define dsLookahead (%3u)(%%rdi)\n",(int)(((char*)&(s->lookahead))-((char*)s)));
|
||||||
|
printf("#define dsPrevLen (%3u)(%%rdi)\n",(int)(((char*)&(s->prev_length))-((char*)s)));
|
||||||
|
printf("#define dsMaxChainLen (%3u)(%%rdi)\n",(int)(((char*)&(s->max_chain_length))-((char*)s)));
|
||||||
|
printf("#define dsGoodMatch (%3u)(%%rdi)\n",(int)(((char*)&(s->good_match))-((char*)s)));
|
||||||
|
printf("#define dsNiceMatch (%3u)(%%rdi)\n",(int)(((char*)&(s->nice_match))-((char*)s)));
|
||||||
|
}
|
||||||
|
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
to compile for XCode 3.2 on MacOSX x86_64
|
||||||
|
- run "gcc -g -c -DXCODE_MAC_X64_STRUCTURE amd64-match.S"
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
#ifndef CURRENT_LINX_XCODE_MAC_X64_STRUCTURE
|
||||||
|
#define dsWSize ( 68)(%rdi)
|
||||||
|
#define dsWMask ( 76)(%rdi)
|
||||||
|
#define dsWindow ( 80)(%rdi)
|
||||||
|
#define dsPrev ( 96)(%rdi)
|
||||||
|
#define dsMatchLen (144)(%rdi)
|
||||||
|
#define dsPrevMatch (148)(%rdi)
|
||||||
|
#define dsStrStart (156)(%rdi)
|
||||||
|
#define dsMatchStart (160)(%rdi)
|
||||||
|
#define dsLookahead (164)(%rdi)
|
||||||
|
#define dsPrevLen (168)(%rdi)
|
||||||
|
#define dsMaxChainLen (172)(%rdi)
|
||||||
|
#define dsGoodMatch (188)(%rdi)
|
||||||
|
#define dsNiceMatch (192)(%rdi)
|
||||||
|
|
||||||
|
#else
|
||||||
|
|
||||||
|
#ifndef STRUCT_OFFSET
|
||||||
|
# define STRUCT_OFFSET (0)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
|
||||||
|
#define dsWSize ( 56 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsWMask ( 64 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsWindow ( 72 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsPrev ( 88 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsMatchLen (136 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsPrevMatch (140 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsStrStart (148 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsMatchStart (152 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsLookahead (156 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsPrevLen (160 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsMaxChainLen (164 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsGoodMatch (180 + STRUCT_OFFSET)(%rdi)
|
||||||
|
#define dsNiceMatch (184 + STRUCT_OFFSET)(%rdi)
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
.text
|
||||||
|
|
||||||
|
/* uInt longest_match(deflate_state *deflatestate, IPos curmatch) */
|
||||||
|
|
||||||
|
longest_match:
|
||||||
|
/*
|
||||||
|
* Retrieve the function arguments. %curmatch will hold cur_match
|
||||||
|
* throughout the entire function (passed via rsi on amd64).
|
||||||
|
* rdi will hold the pointer to the deflate_state (first arg on amd64)
|
||||||
|
*/
|
||||||
|
mov %rsi, save_rsi
|
||||||
|
mov %rbx, save_rbx
|
||||||
|
mov %r12, save_r12
|
||||||
|
mov %r13, save_r13
|
||||||
|
mov %r14, save_r14
|
||||||
|
mov %r15, save_r15
|
||||||
|
|
||||||
|
/* uInt wmask = s->w_mask; */
|
||||||
|
/* unsigned chain_length = s->max_chain_length; */
|
||||||
|
/* if (s->prev_length >= s->good_match) { */
|
||||||
|
/* chain_length >>= 2; */
|
||||||
|
/* } */
|
||||||
|
|
||||||
|
movl dsPrevLen, %eax
|
||||||
|
movl dsGoodMatch, %ebx
|
||||||
|
cmpl %ebx, %eax
|
||||||
|
movl dsWMask, %eax
|
||||||
|
movl dsMaxChainLen, %chainlenwmask
|
||||||
|
jl LastMatchGood
|
||||||
|
shrl $2, %chainlenwmask
|
||||||
|
LastMatchGood:
|
||||||
|
|
||||||
|
/* chainlen is decremented once beforehand so that the function can */
|
||||||
|
/* use the sign flag instead of the zero flag for the exit test. */
|
||||||
|
/* It is then shifted into the high word, to make room for the wmask */
|
||||||
|
/* value, which it will always accompany. */
|
||||||
|
|
||||||
|
decl %chainlenwmask
|
||||||
|
shll $16, %chainlenwmask
|
||||||
|
orl %eax, %chainlenwmask
|
||||||
|
|
||||||
|
/* if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead; */
|
||||||
|
|
||||||
|
movl dsNiceMatch, %eax
|
||||||
|
movl dsLookahead, %ebx
|
||||||
|
cmpl %eax, %ebx
|
||||||
|
jl LookaheadLess
|
||||||
|
movl %eax, %ebx
|
||||||
|
LookaheadLess: movl %ebx, %nicematch
|
||||||
|
|
||||||
|
/* register Bytef *scan = s->window + s->strstart; */
|
||||||
|
|
||||||
|
mov dsWindow, %window
|
||||||
|
movl dsStrStart, %limitd
|
||||||
|
lea (%limit, %window), %scan
|
||||||
|
|
||||||
|
/* Determine how many bytes the scan ptr is off from being */
|
||||||
|
/* dword-aligned. */
|
||||||
|
|
||||||
|
mov %scan, %scanalign
|
||||||
|
negl %scanalignd
|
||||||
|
andl $3, %scanalignd
|
||||||
|
|
||||||
|
/* IPos limit = s->strstart > (IPos)MAX_DIST(s) ? */
|
||||||
|
/* s->strstart - (IPos)MAX_DIST(s) : NIL; */
|
||||||
|
|
||||||
|
movl dsWSize, %eax
|
||||||
|
subl $MIN_LOOKAHEAD, %eax
|
||||||
|
xorl %ecx, %ecx
|
||||||
|
subl %eax, %limitd
|
||||||
|
cmovng %ecx, %limitd
|
||||||
|
|
||||||
|
/* int best_len = s->prev_length; */
|
||||||
|
|
||||||
|
movl dsPrevLen, %bestlend
|
||||||
|
|
||||||
|
/* Store the sum of s->window + best_len in %windowbestlen locally, and in memory. */
|
||||||
|
|
||||||
|
lea (%window, %bestlen), %windowbestlen
|
||||||
|
mov %windowbestlen, _windowbestlen
|
||||||
|
|
||||||
|
/* register ush scan_start = *(ushf*)scan; */
|
||||||
|
/* register ush scan_end = *(ushf*)(scan+best_len-1); */
|
||||||
|
/* Posf *prev = s->prev; */
|
||||||
|
|
||||||
|
movzwl (%scan), %scanstart
|
||||||
|
movzwl -1(%scan, %bestlen), %scanend
|
||||||
|
mov dsPrev, %prev
|
||||||
|
|
||||||
|
/* Jump into the main loop. */
|
||||||
|
|
||||||
|
movl %chainlenwmask, _chainlenwmask
|
||||||
|
jmp LoopEntry
|
||||||
|
|
||||||
|
.balign 16
|
||||||
|
|
||||||
|
/* do {
|
||||||
|
* match = s->window + cur_match;
|
||||||
|
* if (*(ushf*)(match+best_len-1) != scan_end ||
|
||||||
|
* *(ushf*)match != scan_start) continue;
|
||||||
|
* [...]
|
||||||
|
* } while ((cur_match = prev[cur_match & wmask]) > limit
|
||||||
|
* && --chain_length != 0);
|
||||||
|
*
|
||||||
|
* Here is the inner loop of the function. The function will spend the
|
||||||
|
* majority of its time in this loop, and majority of that time will
|
||||||
|
* be spent in the first ten instructions.
|
||||||
|
*/
|
||||||
|
LookupLoop:
|
||||||
|
andl %chainlenwmask, %curmatchd
|
||||||
|
movzwl (%prev, %curmatch, 2), %curmatchd
|
||||||
|
cmpl %limitd, %curmatchd
|
||||||
|
jbe LeaveNow
|
||||||
|
subl $0x00010000, %chainlenwmask
|
||||||
|
js LeaveNow
|
||||||
|
LoopEntry: cmpw -1(%windowbestlen, %curmatch), %scanendw
|
||||||
|
jne LookupLoop
|
||||||
|
cmpw %scanstartw, (%window, %curmatch)
|
||||||
|
jne LookupLoop
|
||||||
|
|
||||||
|
/* Store the current value of chainlen. */
|
||||||
|
movl %chainlenwmask, _chainlenwmask
|
||||||
|
|
||||||
|
/* %scan is the string under scrutiny, and %prev to the string we */
|
||||||
|
/* are hoping to match it up with. In actuality, %esi and %edi are */
|
||||||
|
/* both pointed (MAX_MATCH_8 - scanalign) bytes ahead, and %edx is */
|
||||||
|
/* initialized to -(MAX_MATCH_8 - scanalign). */
|
||||||
|
|
||||||
|
mov $(-MAX_MATCH_8), %rdx
|
||||||
|
lea (%curmatch, %window), %windowbestlen
|
||||||
|
lea MAX_MATCH_8(%windowbestlen, %scanalign), %windowbestlen
|
||||||
|
lea MAX_MATCH_8(%scan, %scanalign), %prev
|
||||||
|
|
||||||
|
/* the prefetching below makes very little difference... */
|
||||||
|
prefetcht1 (%windowbestlen, %rdx)
|
||||||
|
prefetcht1 (%prev, %rdx)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Test the strings for equality, 8 bytes at a time. At the end,
|
||||||
|
* adjust %rdx so that it is offset to the exact byte that mismatched.
|
||||||
|
*
|
||||||
|
* It should be confessed that this loop usually does not represent
|
||||||
|
* much of the total running time. Replacing it with a more
|
||||||
|
* straightforward "rep cmpsb" would not drastically degrade
|
||||||
|
* performance -- unrolling it, for example, makes no difference.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#undef USE_SSE /* works, but is 6-7% slower, than non-SSE... */
|
||||||
|
|
||||||
|
LoopCmps:
|
||||||
|
#ifdef USE_SSE
|
||||||
|
/* Preload the SSE registers */
|
||||||
|
movdqu (%windowbestlen, %rdx), %xmm1
|
||||||
|
movdqu (%prev, %rdx), %xmm2
|
||||||
|
pcmpeqb %xmm2, %xmm1
|
||||||
|
movdqu 16(%windowbestlen, %rdx), %xmm3
|
||||||
|
movdqu 16(%prev, %rdx), %xmm4
|
||||||
|
pcmpeqb %xmm4, %xmm3
|
||||||
|
movdqu 32(%windowbestlen, %rdx), %xmm5
|
||||||
|
movdqu 32(%prev, %rdx), %xmm6
|
||||||
|
pcmpeqb %xmm6, %xmm5
|
||||||
|
movdqu 48(%windowbestlen, %rdx), %xmm7
|
||||||
|
movdqu 48(%prev, %rdx), %xmm8
|
||||||
|
pcmpeqb %xmm8, %xmm7
|
||||||
|
|
||||||
|
/* Check the comparisions' results */
|
||||||
|
pmovmskb %xmm1, %rax
|
||||||
|
notw %ax
|
||||||
|
bsfw %ax, %ax
|
||||||
|
jnz LeaveLoopCmps
|
||||||
|
|
||||||
|
/* this is the only iteration of the loop with a possibility of having
|
||||||
|
incremented rdx by 0x108 (each loop iteration add 16*4 = 0x40
|
||||||
|
and (0x40*4)+8=0x108 */
|
||||||
|
add $8, %rdx
|
||||||
|
jz LenMaximum
|
||||||
|
add $8, %rdx
|
||||||
|
|
||||||
|
|
||||||
|
pmovmskb %xmm3, %rax
|
||||||
|
notw %ax
|
||||||
|
bsfw %ax, %ax
|
||||||
|
jnz LeaveLoopCmps
|
||||||
|
|
||||||
|
|
||||||
|
add $16, %rdx
|
||||||
|
|
||||||
|
|
||||||
|
pmovmskb %xmm5, %rax
|
||||||
|
notw %ax
|
||||||
|
bsfw %ax, %ax
|
||||||
|
jnz LeaveLoopCmps
|
||||||
|
|
||||||
|
add $16, %rdx
|
||||||
|
|
||||||
|
|
||||||
|
pmovmskb %xmm7, %rax
|
||||||
|
notw %ax
|
||||||
|
bsfw %ax, %ax
|
||||||
|
jnz LeaveLoopCmps
|
||||||
|
|
||||||
|
add $16, %rdx
|
||||||
|
|
||||||
|
jmp LoopCmps
|
||||||
|
LeaveLoopCmps: add %rax, %rdx
|
||||||
|
#else
|
||||||
|
mov (%windowbestlen, %rdx), %rax
|
||||||
|
xor (%prev, %rdx), %rax
|
||||||
|
jnz LeaveLoopCmps
|
||||||
|
|
||||||
|
mov 8(%windowbestlen, %rdx), %rax
|
||||||
|
xor 8(%prev, %rdx), %rax
|
||||||
|
jnz LeaveLoopCmps8
|
||||||
|
|
||||||
|
mov 16(%windowbestlen, %rdx), %rax
|
||||||
|
xor 16(%prev, %rdx), %rax
|
||||||
|
jnz LeaveLoopCmps16
|
||||||
|
|
||||||
|
add $24, %rdx
|
||||||
|
jnz LoopCmps
|
||||||
|
jmp LenMaximum
|
||||||
|
# if 0
|
||||||
|
/*
|
||||||
|
* This three-liner is tantalizingly simple, but bsf is a slow instruction,
|
||||||
|
* and the complicated alternative down below is quite a bit faster. Sad...
|
||||||
|
*/
|
||||||
|
|
||||||
|
LeaveLoopCmps: bsf %rax, %rax /* find the first non-zero bit */
|
||||||
|
shrl $3, %eax /* divide by 8 to get the byte */
|
||||||
|
add %rax, %rdx
|
||||||
|
# else
|
||||||
|
LeaveLoopCmps16:
|
||||||
|
add $8, %rdx
|
||||||
|
LeaveLoopCmps8:
|
||||||
|
add $8, %rdx
|
||||||
|
LeaveLoopCmps: testl $0xFFFFFFFF, %eax /* Check the first 4 bytes */
|
||||||
|
jnz Check16
|
||||||
|
add $4, %rdx
|
||||||
|
shr $32, %rax
|
||||||
|
Check16: testw $0xFFFF, %ax
|
||||||
|
jnz LenLower
|
||||||
|
add $2, %rdx
|
||||||
|
shrl $16, %eax
|
||||||
|
LenLower: subb $1, %al
|
||||||
|
adc $0, %rdx
|
||||||
|
# endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Calculate the length of the match. If it is longer than MAX_MATCH, */
|
||||||
|
/* then automatically accept it as the best possible match and leave. */
|
||||||
|
|
||||||
|
lea (%prev, %rdx), %rax
|
||||||
|
sub %scan, %rax
|
||||||
|
cmpl $MAX_MATCH, %eax
|
||||||
|
jge LenMaximum
|
||||||
|
|
||||||
|
/* If the length of the match is not longer than the best match we */
|
||||||
|
/* have so far, then forget it and return to the lookup loop. */
|
||||||
|
|
||||||
|
cmpl %bestlend, %eax
|
||||||
|
jg LongerMatch
|
||||||
|
mov _windowbestlen, %windowbestlen
|
||||||
|
mov dsPrev, %prev
|
||||||
|
movl _chainlenwmask, %edx
|
||||||
|
jmp LookupLoop
|
||||||
|
|
||||||
|
/* s->match_start = cur_match; */
|
||||||
|
/* best_len = len; */
|
||||||
|
/* if (len >= nice_match) break; */
|
||||||
|
/* scan_end = *(ushf*)(scan+best_len-1); */
|
||||||
|
|
||||||
|
LongerMatch:
|
||||||
|
movl %eax, %bestlend
|
||||||
|
movl %curmatchd, dsMatchStart
|
||||||
|
cmpl %nicematch, %eax
|
||||||
|
jge LeaveNow
|
||||||
|
|
||||||
|
lea (%window, %bestlen), %windowbestlen
|
||||||
|
mov %windowbestlen, _windowbestlen
|
||||||
|
|
||||||
|
movzwl -1(%scan, %rax), %scanend
|
||||||
|
mov dsPrev, %prev
|
||||||
|
movl _chainlenwmask, %chainlenwmask
|
||||||
|
jmp LookupLoop
|
||||||
|
|
||||||
|
/* Accept the current string, with the maximum possible length. */
|
||||||
|
|
||||||
|
LenMaximum:
|
||||||
|
movl $MAX_MATCH, %bestlend
|
||||||
|
movl %curmatchd, dsMatchStart
|
||||||
|
|
||||||
|
/* if ((uInt)best_len <= s->lookahead) return (uInt)best_len; */
|
||||||
|
/* return s->lookahead; */
|
||||||
|
|
||||||
|
LeaveNow:
|
||||||
|
movl dsLookahead, %eax
|
||||||
|
cmpl %eax, %bestlend
|
||||||
|
cmovngl %bestlend, %eax
|
||||||
|
LookaheadRet:
|
||||||
|
|
||||||
|
/* Restore the registers and return from whence we came. */
|
||||||
|
|
||||||
|
mov save_rsi, %rsi
|
||||||
|
mov save_rbx, %rbx
|
||||||
|
mov save_r12, %r12
|
||||||
|
mov save_r13, %r13
|
||||||
|
mov save_r14, %r14
|
||||||
|
mov save_r15, %r15
|
||||||
|
|
||||||
|
ret
|
||||||
|
|
||||||
|
match_init: ret
|
||||||
51
contrib/asm686/README.686
Normal file
51
contrib/asm686/README.686
Normal file
@@ -0,0 +1,51 @@
|
|||||||
|
This is a patched version of zlib, modified to use
|
||||||
|
Pentium-Pro-optimized assembly code in the deflation algorithm. The
|
||||||
|
files changed/added by this patch are:
|
||||||
|
|
||||||
|
README.686
|
||||||
|
match.S
|
||||||
|
|
||||||
|
The speedup that this patch provides varies, depending on whether the
|
||||||
|
compiler used to build the original version of zlib falls afoul of the
|
||||||
|
PPro's speed traps. My own tests show a speedup of around 10-20% at
|
||||||
|
the default compression level, and 20-30% using -9, against a version
|
||||||
|
compiled using gcc 2.7.2.3. Your mileage may vary.
|
||||||
|
|
||||||
|
Note that this code has been tailored for the PPro/PII in particular,
|
||||||
|
and will not perform particuarly well on a Pentium.
|
||||||
|
|
||||||
|
If you are using an assembler other than GNU as, you will have to
|
||||||
|
translate match.S to use your assembler's syntax. (Have fun.)
|
||||||
|
|
||||||
|
Brian Raiter
|
||||||
|
breadbox@muppetlabs.com
|
||||||
|
April, 1998
|
||||||
|
|
||||||
|
|
||||||
|
Added for zlib 1.1.3:
|
||||||
|
|
||||||
|
The patches come from
|
||||||
|
http://www.muppetlabs.com/~breadbox/software/assembly.html
|
||||||
|
|
||||||
|
To compile zlib with this asm file, copy match.S to the zlib directory
|
||||||
|
then do:
|
||||||
|
|
||||||
|
CFLAGS="-O3 -DASMV" ./configure
|
||||||
|
make OBJA=match.o
|
||||||
|
|
||||||
|
|
||||||
|
Update:
|
||||||
|
|
||||||
|
I've been ignoring these assembly routines for years, believing that
|
||||||
|
gcc's generated code had caught up with it sometime around gcc 2.95
|
||||||
|
and the major rearchitecting of the Pentium 4. However, I recently
|
||||||
|
learned that, despite what I believed, this code still has some life
|
||||||
|
in it. On the Pentium 4 and AMD64 chips, it continues to run about 8%
|
||||||
|
faster than the code produced by gcc 4.1.
|
||||||
|
|
||||||
|
In acknowledgement of its continuing usefulness, I've altered the
|
||||||
|
license to match that of the rest of zlib. Share and Enjoy!
|
||||||
|
|
||||||
|
Brian Raiter
|
||||||
|
breadbox@muppetlabs.com
|
||||||
|
April, 2007
|
||||||
357
contrib/asm686/match.S
Normal file
357
contrib/asm686/match.S
Normal file
@@ -0,0 +1,357 @@
|
|||||||
|
/* match.S -- x86 assembly version of the zlib longest_match() function.
|
||||||
|
* Optimized for the Intel 686 chips (PPro and later).
|
||||||
|
*
|
||||||
|
* Copyright (C) 1998, 2007 Brian Raiter <breadbox@muppetlabs.com>
|
||||||
|
*
|
||||||
|
* This software is provided 'as-is', without any express or implied
|
||||||
|
* warranty. In no event will the author be held liable for any damages
|
||||||
|
* arising from the use of this software.
|
||||||
|
*
|
||||||
|
* Permission is granted to anyone to use this software for any purpose,
|
||||||
|
* including commercial applications, and to alter it and redistribute it
|
||||||
|
* freely, subject to the following restrictions:
|
||||||
|
*
|
||||||
|
* 1. The origin of this software must not be misrepresented; you must not
|
||||||
|
* claim that you wrote the original software. If you use this software
|
||||||
|
* in a product, an acknowledgment in the product documentation would be
|
||||||
|
* appreciated but is not required.
|
||||||
|
* 2. Altered source versions must be plainly marked as such, and must not be
|
||||||
|
* misrepresented as being the original software.
|
||||||
|
* 3. This notice may not be removed or altered from any source distribution.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef NO_UNDERLINE
|
||||||
|
#define match_init _match_init
|
||||||
|
#define longest_match _longest_match
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define MAX_MATCH (258)
|
||||||
|
#define MIN_MATCH (3)
|
||||||
|
#define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
|
||||||
|
#define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7)
|
||||||
|
|
||||||
|
/* stack frame offsets */
|
||||||
|
|
||||||
|
#define chainlenwmask 0 /* high word: current chain len */
|
||||||
|
/* low word: s->wmask */
|
||||||
|
#define window 4 /* local copy of s->window */
|
||||||
|
#define windowbestlen 8 /* s->window + bestlen */
|
||||||
|
#define scanstart 16 /* first two bytes of string */
|
||||||
|
#define scanend 12 /* last two bytes of string */
|
||||||
|
#define scanalign 20 /* dword-misalignment of string */
|
||||||
|
#define nicematch 24 /* a good enough match size */
|
||||||
|
#define bestlen 28 /* size of best match so far */
|
||||||
|
#define scan 32 /* ptr to string wanting match */
|
||||||
|
|
||||||
|
#define LocalVarsSize (36)
|
||||||
|
/* saved ebx 36 */
|
||||||
|
/* saved edi 40 */
|
||||||
|
/* saved esi 44 */
|
||||||
|
/* saved ebp 48 */
|
||||||
|
/* return address 52 */
|
||||||
|
#define deflatestate 56 /* the function arguments */
|
||||||
|
#define curmatch 60
|
||||||
|
|
||||||
|
/* All the +zlib1222add offsets are due to the addition of fields
|
||||||
|
* in zlib in the deflate_state structure since the asm code was first written
|
||||||
|
* (if you compile with zlib 1.0.4 or older, use "zlib1222add equ (-4)").
|
||||||
|
* (if you compile with zlib between 1.0.5 and 1.2.2.1, use "zlib1222add equ 0").
|
||||||
|
* if you compile with zlib 1.2.2.2 or later , use "zlib1222add equ 8").
|
||||||
|
*/
|
||||||
|
|
||||||
|
#define zlib1222add (8)
|
||||||
|
|
||||||
|
#define dsWSize (36+zlib1222add)
|
||||||
|
#define dsWMask (44+zlib1222add)
|
||||||
|
#define dsWindow (48+zlib1222add)
|
||||||
|
#define dsPrev (56+zlib1222add)
|
||||||
|
#define dsMatchLen (88+zlib1222add)
|
||||||
|
#define dsPrevMatch (92+zlib1222add)
|
||||||
|
#define dsStrStart (100+zlib1222add)
|
||||||
|
#define dsMatchStart (104+zlib1222add)
|
||||||
|
#define dsLookahead (108+zlib1222add)
|
||||||
|
#define dsPrevLen (112+zlib1222add)
|
||||||
|
#define dsMaxChainLen (116+zlib1222add)
|
||||||
|
#define dsGoodMatch (132+zlib1222add)
|
||||||
|
#define dsNiceMatch (136+zlib1222add)
|
||||||
|
|
||||||
|
|
||||||
|
.file "match.S"
|
||||||
|
|
||||||
|
.globl match_init, longest_match
|
||||||
|
|
||||||
|
.text
|
||||||
|
|
||||||
|
/* uInt longest_match(deflate_state *deflatestate, IPos curmatch) */
|
||||||
|
.cfi_sections .debug_frame
|
||||||
|
|
||||||
|
longest_match:
|
||||||
|
|
||||||
|
.cfi_startproc
|
||||||
|
/* Save registers that the compiler may be using, and adjust %esp to */
|
||||||
|
/* make room for our stack frame. */
|
||||||
|
|
||||||
|
pushl %ebp
|
||||||
|
.cfi_def_cfa_offset 8
|
||||||
|
.cfi_offset ebp, -8
|
||||||
|
pushl %edi
|
||||||
|
.cfi_def_cfa_offset 12
|
||||||
|
pushl %esi
|
||||||
|
.cfi_def_cfa_offset 16
|
||||||
|
pushl %ebx
|
||||||
|
.cfi_def_cfa_offset 20
|
||||||
|
subl $LocalVarsSize, %esp
|
||||||
|
.cfi_def_cfa_offset LocalVarsSize+20
|
||||||
|
|
||||||
|
/* Retrieve the function arguments. %ecx will hold cur_match */
|
||||||
|
/* throughout the entire function. %edx will hold the pointer to the */
|
||||||
|
/* deflate_state structure during the function's setup (before */
|
||||||
|
/* entering the main loop). */
|
||||||
|
|
||||||
|
movl deflatestate(%esp), %edx
|
||||||
|
movl curmatch(%esp), %ecx
|
||||||
|
|
||||||
|
/* uInt wmask = s->w_mask; */
|
||||||
|
/* unsigned chain_length = s->max_chain_length; */
|
||||||
|
/* if (s->prev_length >= s->good_match) { */
|
||||||
|
/* chain_length >>= 2; */
|
||||||
|
/* } */
|
||||||
|
|
||||||
|
movl dsPrevLen(%edx), %eax
|
||||||
|
movl dsGoodMatch(%edx), %ebx
|
||||||
|
cmpl %ebx, %eax
|
||||||
|
movl dsWMask(%edx), %eax
|
||||||
|
movl dsMaxChainLen(%edx), %ebx
|
||||||
|
jl LastMatchGood
|
||||||
|
shrl $2, %ebx
|
||||||
|
LastMatchGood:
|
||||||
|
|
||||||
|
/* chainlen is decremented once beforehand so that the function can */
|
||||||
|
/* use the sign flag instead of the zero flag for the exit test. */
|
||||||
|
/* It is then shifted into the high word, to make room for the wmask */
|
||||||
|
/* value, which it will always accompany. */
|
||||||
|
|
||||||
|
decl %ebx
|
||||||
|
shll $16, %ebx
|
||||||
|
orl %eax, %ebx
|
||||||
|
movl %ebx, chainlenwmask(%esp)
|
||||||
|
|
||||||
|
/* if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead; */
|
||||||
|
|
||||||
|
movl dsNiceMatch(%edx), %eax
|
||||||
|
movl dsLookahead(%edx), %ebx
|
||||||
|
cmpl %eax, %ebx
|
||||||
|
jl LookaheadLess
|
||||||
|
movl %eax, %ebx
|
||||||
|
LookaheadLess: movl %ebx, nicematch(%esp)
|
||||||
|
|
||||||
|
/* register Bytef *scan = s->window + s->strstart; */
|
||||||
|
|
||||||
|
movl dsWindow(%edx), %esi
|
||||||
|
movl %esi, window(%esp)
|
||||||
|
movl dsStrStart(%edx), %ebp
|
||||||
|
lea (%esi,%ebp), %edi
|
||||||
|
movl %edi, scan(%esp)
|
||||||
|
|
||||||
|
/* Determine how many bytes the scan ptr is off from being */
|
||||||
|
/* dword-aligned. */
|
||||||
|
|
||||||
|
movl %edi, %eax
|
||||||
|
negl %eax
|
||||||
|
andl $3, %eax
|
||||||
|
movl %eax, scanalign(%esp)
|
||||||
|
|
||||||
|
/* IPos limit = s->strstart > (IPos)MAX_DIST(s) ? */
|
||||||
|
/* s->strstart - (IPos)MAX_DIST(s) : NIL; */
|
||||||
|
|
||||||
|
movl dsWSize(%edx), %eax
|
||||||
|
subl $MIN_LOOKAHEAD, %eax
|
||||||
|
subl %eax, %ebp
|
||||||
|
jg LimitPositive
|
||||||
|
xorl %ebp, %ebp
|
||||||
|
LimitPositive:
|
||||||
|
|
||||||
|
/* int best_len = s->prev_length; */
|
||||||
|
|
||||||
|
movl dsPrevLen(%edx), %eax
|
||||||
|
movl %eax, bestlen(%esp)
|
||||||
|
|
||||||
|
/* Store the sum of s->window + best_len in %esi locally, and in %esi. */
|
||||||
|
|
||||||
|
addl %eax, %esi
|
||||||
|
movl %esi, windowbestlen(%esp)
|
||||||
|
|
||||||
|
/* register ush scan_start = *(ushf*)scan; */
|
||||||
|
/* register ush scan_end = *(ushf*)(scan+best_len-1); */
|
||||||
|
/* Posf *prev = s->prev; */
|
||||||
|
|
||||||
|
movzwl (%edi), %ebx
|
||||||
|
movl %ebx, scanstart(%esp)
|
||||||
|
movzwl -1(%edi,%eax), %ebx
|
||||||
|
movl %ebx, scanend(%esp)
|
||||||
|
movl dsPrev(%edx), %edi
|
||||||
|
|
||||||
|
/* Jump into the main loop. */
|
||||||
|
|
||||||
|
movl chainlenwmask(%esp), %edx
|
||||||
|
jmp LoopEntry
|
||||||
|
|
||||||
|
.balign 16
|
||||||
|
|
||||||
|
/* do {
|
||||||
|
* match = s->window + cur_match;
|
||||||
|
* if (*(ushf*)(match+best_len-1) != scan_end ||
|
||||||
|
* *(ushf*)match != scan_start) continue;
|
||||||
|
* [...]
|
||||||
|
* } while ((cur_match = prev[cur_match & wmask]) > limit
|
||||||
|
* && --chain_length != 0);
|
||||||
|
*
|
||||||
|
* Here is the inner loop of the function. The function will spend the
|
||||||
|
* majority of its time in this loop, and majority of that time will
|
||||||
|
* be spent in the first ten instructions.
|
||||||
|
*
|
||||||
|
* Within this loop:
|
||||||
|
* %ebx = scanend
|
||||||
|
* %ecx = curmatch
|
||||||
|
* %edx = chainlenwmask - i.e., ((chainlen << 16) | wmask)
|
||||||
|
* %esi = windowbestlen - i.e., (window + bestlen)
|
||||||
|
* %edi = prev
|
||||||
|
* %ebp = limit
|
||||||
|
*/
|
||||||
|
LookupLoop:
|
||||||
|
andl %edx, %ecx
|
||||||
|
movzwl (%edi,%ecx,2), %ecx
|
||||||
|
cmpl %ebp, %ecx
|
||||||
|
jbe LeaveNow
|
||||||
|
subl $0x00010000, %edx
|
||||||
|
js LeaveNow
|
||||||
|
LoopEntry: movzwl -1(%esi,%ecx), %eax
|
||||||
|
cmpl %ebx, %eax
|
||||||
|
jnz LookupLoop
|
||||||
|
movl window(%esp), %eax
|
||||||
|
movzwl (%eax,%ecx), %eax
|
||||||
|
cmpl scanstart(%esp), %eax
|
||||||
|
jnz LookupLoop
|
||||||
|
|
||||||
|
/* Store the current value of chainlen. */
|
||||||
|
|
||||||
|
movl %edx, chainlenwmask(%esp)
|
||||||
|
|
||||||
|
/* Point %edi to the string under scrutiny, and %esi to the string we */
|
||||||
|
/* are hoping to match it up with. In actuality, %esi and %edi are */
|
||||||
|
/* both pointed (MAX_MATCH_8 - scanalign) bytes ahead, and %edx is */
|
||||||
|
/* initialized to -(MAX_MATCH_8 - scanalign). */
|
||||||
|
|
||||||
|
movl window(%esp), %esi
|
||||||
|
movl scan(%esp), %edi
|
||||||
|
addl %ecx, %esi
|
||||||
|
movl scanalign(%esp), %eax
|
||||||
|
movl $(-MAX_MATCH_8), %edx
|
||||||
|
lea MAX_MATCH_8(%edi,%eax), %edi
|
||||||
|
lea MAX_MATCH_8(%esi,%eax), %esi
|
||||||
|
|
||||||
|
/* Test the strings for equality, 8 bytes at a time. At the end,
|
||||||
|
* adjust %edx so that it is offset to the exact byte that mismatched.
|
||||||
|
*
|
||||||
|
* We already know at this point that the first three bytes of the
|
||||||
|
* strings match each other, and they can be safely passed over before
|
||||||
|
* starting the compare loop. So what this code does is skip over 0-3
|
||||||
|
* bytes, as much as necessary in order to dword-align the %edi
|
||||||
|
* pointer. (%esi will still be misaligned three times out of four.)
|
||||||
|
*
|
||||||
|
* It should be confessed that this loop usually does not represent
|
||||||
|
* much of the total running time. Replacing it with a more
|
||||||
|
* straightforward "rep cmpsb" would not drastically degrade
|
||||||
|
* performance.
|
||||||
|
*/
|
||||||
|
LoopCmps:
|
||||||
|
movl (%esi,%edx), %eax
|
||||||
|
xorl (%edi,%edx), %eax
|
||||||
|
jnz LeaveLoopCmps
|
||||||
|
movl 4(%esi,%edx), %eax
|
||||||
|
xorl 4(%edi,%edx), %eax
|
||||||
|
jnz LeaveLoopCmps4
|
||||||
|
addl $8, %edx
|
||||||
|
jnz LoopCmps
|
||||||
|
jmp LenMaximum
|
||||||
|
LeaveLoopCmps4: addl $4, %edx
|
||||||
|
LeaveLoopCmps: testl $0x0000FFFF, %eax
|
||||||
|
jnz LenLower
|
||||||
|
addl $2, %edx
|
||||||
|
shrl $16, %eax
|
||||||
|
LenLower: subb $1, %al
|
||||||
|
adcl $0, %edx
|
||||||
|
|
||||||
|
/* Calculate the length of the match. If it is longer than MAX_MATCH, */
|
||||||
|
/* then automatically accept it as the best possible match and leave. */
|
||||||
|
|
||||||
|
lea (%edi,%edx), %eax
|
||||||
|
movl scan(%esp), %edi
|
||||||
|
subl %edi, %eax
|
||||||
|
cmpl $MAX_MATCH, %eax
|
||||||
|
jge LenMaximum
|
||||||
|
|
||||||
|
/* If the length of the match is not longer than the best match we */
|
||||||
|
/* have so far, then forget it and return to the lookup loop. */
|
||||||
|
|
||||||
|
movl deflatestate(%esp), %edx
|
||||||
|
movl bestlen(%esp), %ebx
|
||||||
|
cmpl %ebx, %eax
|
||||||
|
jg LongerMatch
|
||||||
|
movl windowbestlen(%esp), %esi
|
||||||
|
movl dsPrev(%edx), %edi
|
||||||
|
movl scanend(%esp), %ebx
|
||||||
|
movl chainlenwmask(%esp), %edx
|
||||||
|
jmp LookupLoop
|
||||||
|
|
||||||
|
/* s->match_start = cur_match; */
|
||||||
|
/* best_len = len; */
|
||||||
|
/* if (len >= nice_match) break; */
|
||||||
|
/* scan_end = *(ushf*)(scan+best_len-1); */
|
||||||
|
|
||||||
|
LongerMatch: movl nicematch(%esp), %ebx
|
||||||
|
movl %eax, bestlen(%esp)
|
||||||
|
movl %ecx, dsMatchStart(%edx)
|
||||||
|
cmpl %ebx, %eax
|
||||||
|
jge LeaveNow
|
||||||
|
movl window(%esp), %esi
|
||||||
|
addl %eax, %esi
|
||||||
|
movl %esi, windowbestlen(%esp)
|
||||||
|
movzwl -1(%edi,%eax), %ebx
|
||||||
|
movl dsPrev(%edx), %edi
|
||||||
|
movl %ebx, scanend(%esp)
|
||||||
|
movl chainlenwmask(%esp), %edx
|
||||||
|
jmp LookupLoop
|
||||||
|
|
||||||
|
/* Accept the current string, with the maximum possible length. */
|
||||||
|
|
||||||
|
LenMaximum: movl deflatestate(%esp), %edx
|
||||||
|
movl $MAX_MATCH, bestlen(%esp)
|
||||||
|
movl %ecx, dsMatchStart(%edx)
|
||||||
|
|
||||||
|
/* if ((uInt)best_len <= s->lookahead) return (uInt)best_len; */
|
||||||
|
/* return s->lookahead; */
|
||||||
|
|
||||||
|
LeaveNow:
|
||||||
|
movl deflatestate(%esp), %edx
|
||||||
|
movl bestlen(%esp), %ebx
|
||||||
|
movl dsLookahead(%edx), %eax
|
||||||
|
cmpl %eax, %ebx
|
||||||
|
jg LookaheadRet
|
||||||
|
movl %ebx, %eax
|
||||||
|
LookaheadRet:
|
||||||
|
|
||||||
|
/* Restore the stack and return from whence we came. */
|
||||||
|
|
||||||
|
addl $LocalVarsSize, %esp
|
||||||
|
.cfi_def_cfa_offset 20
|
||||||
|
popl %ebx
|
||||||
|
.cfi_def_cfa_offset 16
|
||||||
|
popl %esi
|
||||||
|
.cfi_def_cfa_offset 12
|
||||||
|
popl %edi
|
||||||
|
.cfi_def_cfa_offset 8
|
||||||
|
popl %ebp
|
||||||
|
.cfi_def_cfa_offset 4
|
||||||
|
.cfi_endproc
|
||||||
|
match_init: ret
|
||||||
8
contrib/blast/Makefile
Normal file
8
contrib/blast/Makefile
Normal file
@@ -0,0 +1,8 @@
|
|||||||
|
blast: blast.c blast.h
|
||||||
|
cc -DTEST -o blast blast.c
|
||||||
|
|
||||||
|
test: blast
|
||||||
|
blast < test.pk | cmp - test.txt
|
||||||
|
|
||||||
|
clean:
|
||||||
|
rm -f blast blast.o
|
||||||
4
contrib/blast/README
Normal file
4
contrib/blast/README
Normal file
@@ -0,0 +1,4 @@
|
|||||||
|
Read blast.h for purpose and usage.
|
||||||
|
|
||||||
|
Mark Adler
|
||||||
|
madler@alumni.caltech.edu
|
||||||
466
contrib/blast/blast.c
Normal file
466
contrib/blast/blast.c
Normal file
@@ -0,0 +1,466 @@
|
|||||||
|
/* blast.c
|
||||||
|
* Copyright (C) 2003, 2012, 2013 Mark Adler
|
||||||
|
* For conditions of distribution and use, see copyright notice in blast.h
|
||||||
|
* version 1.3, 24 Aug 2013
|
||||||
|
*
|
||||||
|
* blast.c decompresses data compressed by the PKWare Compression Library.
|
||||||
|
* This function provides functionality similar to the explode() function of
|
||||||
|
* the PKWare library, hence the name "blast".
|
||||||
|
*
|
||||||
|
* This decompressor is based on the excellent format description provided by
|
||||||
|
* Ben Rudiak-Gould in comp.compression on August 13, 2001. Interestingly, the
|
||||||
|
* example Ben provided in the post is incorrect. The distance 110001 should
|
||||||
|
* instead be 111000. When corrected, the example byte stream becomes:
|
||||||
|
*
|
||||||
|
* 00 04 82 24 25 8f 80 7f
|
||||||
|
*
|
||||||
|
* which decompresses to "AIAIAIAIAIAIA" (without the quotes).
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Change history:
|
||||||
|
*
|
||||||
|
* 1.0 12 Feb 2003 - First version
|
||||||
|
* 1.1 16 Feb 2003 - Fixed distance check for > 4 GB uncompressed data
|
||||||
|
* 1.2 24 Oct 2012 - Add note about using binary mode in stdio
|
||||||
|
* - Fix comparisons of differently signed integers
|
||||||
|
* 1.3 24 Aug 2013 - Return unused input from blast()
|
||||||
|
* - Fix test code to correctly report unused input
|
||||||
|
* - Enable the provision of initial input to blast()
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stddef.h> /* for NULL */
|
||||||
|
#include <setjmp.h> /* for setjmp(), longjmp(), and jmp_buf */
|
||||||
|
#include "blast.h" /* prototype for blast() */
|
||||||
|
|
||||||
|
#define local static /* for local function definitions */
|
||||||
|
#define MAXBITS 13 /* maximum code length */
|
||||||
|
#define MAXWIN 4096 /* maximum window size */
|
||||||
|
|
||||||
|
/* input and output state */
|
||||||
|
struct state {
|
||||||
|
/* input state */
|
||||||
|
blast_in infun; /* input function provided by user */
|
||||||
|
void *inhow; /* opaque information passed to infun() */
|
||||||
|
unsigned char *in; /* next input location */
|
||||||
|
unsigned left; /* available input at in */
|
||||||
|
int bitbuf; /* bit buffer */
|
||||||
|
int bitcnt; /* number of bits in bit buffer */
|
||||||
|
|
||||||
|
/* input limit error return state for bits() and decode() */
|
||||||
|
jmp_buf env;
|
||||||
|
|
||||||
|
/* output state */
|
||||||
|
blast_out outfun; /* output function provided by user */
|
||||||
|
void *outhow; /* opaque information passed to outfun() */
|
||||||
|
unsigned next; /* index of next write location in out[] */
|
||||||
|
int first; /* true to check distances (for first 4K) */
|
||||||
|
unsigned char out[MAXWIN]; /* output buffer and sliding window */
|
||||||
|
};
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Return need bits from the input stream. This always leaves less than
|
||||||
|
* eight bits in the buffer. bits() works properly for need == 0.
|
||||||
|
*
|
||||||
|
* Format notes:
|
||||||
|
*
|
||||||
|
* - Bits are stored in bytes from the least significant bit to the most
|
||||||
|
* significant bit. Therefore bits are dropped from the bottom of the bit
|
||||||
|
* buffer, using shift right, and new bytes are appended to the top of the
|
||||||
|
* bit buffer, using shift left.
|
||||||
|
*/
|
||||||
|
local int bits(struct state *s, int need)
|
||||||
|
{
|
||||||
|
int val; /* bit accumulator */
|
||||||
|
|
||||||
|
/* load at least need bits into val */
|
||||||
|
val = s->bitbuf;
|
||||||
|
while (s->bitcnt < need) {
|
||||||
|
if (s->left == 0) {
|
||||||
|
s->left = s->infun(s->inhow, &(s->in));
|
||||||
|
if (s->left == 0) longjmp(s->env, 1); /* out of input */
|
||||||
|
}
|
||||||
|
val |= (int)(*(s->in)++) << s->bitcnt; /* load eight bits */
|
||||||
|
s->left--;
|
||||||
|
s->bitcnt += 8;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* drop need bits and update buffer, always zero to seven bits left */
|
||||||
|
s->bitbuf = val >> need;
|
||||||
|
s->bitcnt -= need;
|
||||||
|
|
||||||
|
/* return need bits, zeroing the bits above that */
|
||||||
|
return val & ((1 << need) - 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
|
||||||
|
* each length, which for a canonical code are stepped through in order.
|
||||||
|
* symbol[] are the symbol values in canonical order, where the number of
|
||||||
|
* entries is the sum of the counts in count[]. The decoding process can be
|
||||||
|
* seen in the function decode() below.
|
||||||
|
*/
|
||||||
|
struct huffman {
|
||||||
|
short *count; /* number of symbols of each length */
|
||||||
|
short *symbol; /* canonically ordered symbols */
|
||||||
|
};
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Decode a code from the stream s using huffman table h. Return the symbol or
|
||||||
|
* a negative value if there is an error. If all of the lengths are zero, i.e.
|
||||||
|
* an empty code, or if the code is incomplete and an invalid code is received,
|
||||||
|
* then -9 is returned after reading MAXBITS bits.
|
||||||
|
*
|
||||||
|
* Format notes:
|
||||||
|
*
|
||||||
|
* - The codes as stored in the compressed data are bit-reversed relative to
|
||||||
|
* a simple integer ordering of codes of the same lengths. Hence below the
|
||||||
|
* bits are pulled from the compressed data one at a time and used to
|
||||||
|
* build the code value reversed from what is in the stream in order to
|
||||||
|
* permit simple integer comparisons for decoding.
|
||||||
|
*
|
||||||
|
* - The first code for the shortest length is all ones. Subsequent codes of
|
||||||
|
* the same length are simply integer decrements of the previous code. When
|
||||||
|
* moving up a length, a one bit is appended to the code. For a complete
|
||||||
|
* code, the last code of the longest length will be all zeros. To support
|
||||||
|
* this ordering, the bits pulled during decoding are inverted to apply the
|
||||||
|
* more "natural" ordering starting with all zeros and incrementing.
|
||||||
|
*/
|
||||||
|
local int decode(struct state *s, struct huffman *h)
|
||||||
|
{
|
||||||
|
int len; /* current number of bits in code */
|
||||||
|
int code; /* len bits being decoded */
|
||||||
|
int first; /* first code of length len */
|
||||||
|
int count; /* number of codes of length len */
|
||||||
|
int index; /* index of first code of length len in symbol table */
|
||||||
|
int bitbuf; /* bits from stream */
|
||||||
|
int left; /* bits left in next or left to process */
|
||||||
|
short *next; /* next number of codes */
|
||||||
|
|
||||||
|
bitbuf = s->bitbuf;
|
||||||
|
left = s->bitcnt;
|
||||||
|
code = first = index = 0;
|
||||||
|
len = 1;
|
||||||
|
next = h->count + 1;
|
||||||
|
while (1) {
|
||||||
|
while (left--) {
|
||||||
|
code |= (bitbuf & 1) ^ 1; /* invert code */
|
||||||
|
bitbuf >>= 1;
|
||||||
|
count = *next++;
|
||||||
|
if (code < first + count) { /* if length len, return symbol */
|
||||||
|
s->bitbuf = bitbuf;
|
||||||
|
s->bitcnt = (s->bitcnt - len) & 7;
|
||||||
|
return h->symbol[index + (code - first)];
|
||||||
|
}
|
||||||
|
index += count; /* else update for next length */
|
||||||
|
first += count;
|
||||||
|
first <<= 1;
|
||||||
|
code <<= 1;
|
||||||
|
len++;
|
||||||
|
}
|
||||||
|
left = (MAXBITS+1) - len;
|
||||||
|
if (left == 0) break;
|
||||||
|
if (s->left == 0) {
|
||||||
|
s->left = s->infun(s->inhow, &(s->in));
|
||||||
|
if (s->left == 0) longjmp(s->env, 1); /* out of input */
|
||||||
|
}
|
||||||
|
bitbuf = *(s->in)++;
|
||||||
|
s->left--;
|
||||||
|
if (left > 8) left = 8;
|
||||||
|
}
|
||||||
|
return -9; /* ran out of codes */
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Given a list of repeated code lengths rep[0..n-1], where each byte is a
|
||||||
|
* count (high four bits + 1) and a code length (low four bits), generate the
|
||||||
|
* list of code lengths. This compaction reduces the size of the object code.
|
||||||
|
* Then given the list of code lengths length[0..n-1] representing a canonical
|
||||||
|
* Huffman code for n symbols, construct the tables required to decode those
|
||||||
|
* codes. Those tables are the number of codes of each length, and the symbols
|
||||||
|
* sorted by length, retaining their original order within each length. The
|
||||||
|
* return value is zero for a complete code set, negative for an over-
|
||||||
|
* subscribed code set, and positive for an incomplete code set. The tables
|
||||||
|
* can be used if the return value is zero or positive, but they cannot be used
|
||||||
|
* if the return value is negative. If the return value is zero, it is not
|
||||||
|
* possible for decode() using that table to return an error--any stream of
|
||||||
|
* enough bits will resolve to a symbol. If the return value is positive, then
|
||||||
|
* it is possible for decode() using that table to return an error for received
|
||||||
|
* codes past the end of the incomplete lengths.
|
||||||
|
*/
|
||||||
|
local int construct(struct huffman *h, const unsigned char *rep, int n)
|
||||||
|
{
|
||||||
|
int symbol; /* current symbol when stepping through length[] */
|
||||||
|
int len; /* current length when stepping through h->count[] */
|
||||||
|
int left; /* number of possible codes left of current length */
|
||||||
|
short offs[MAXBITS+1]; /* offsets in symbol table for each length */
|
||||||
|
short length[256]; /* code lengths */
|
||||||
|
|
||||||
|
/* convert compact repeat counts into symbol bit length list */
|
||||||
|
symbol = 0;
|
||||||
|
do {
|
||||||
|
len = *rep++;
|
||||||
|
left = (len >> 4) + 1;
|
||||||
|
len &= 15;
|
||||||
|
do {
|
||||||
|
length[symbol++] = len;
|
||||||
|
} while (--left);
|
||||||
|
} while (--n);
|
||||||
|
n = symbol;
|
||||||
|
|
||||||
|
/* count number of codes of each length */
|
||||||
|
for (len = 0; len <= MAXBITS; len++)
|
||||||
|
h->count[len] = 0;
|
||||||
|
for (symbol = 0; symbol < n; symbol++)
|
||||||
|
(h->count[length[symbol]])++; /* assumes lengths are within bounds */
|
||||||
|
if (h->count[0] == n) /* no codes! */
|
||||||
|
return 0; /* complete, but decode() will fail */
|
||||||
|
|
||||||
|
/* check for an over-subscribed or incomplete set of lengths */
|
||||||
|
left = 1; /* one possible code of zero length */
|
||||||
|
for (len = 1; len <= MAXBITS; len++) {
|
||||||
|
left <<= 1; /* one more bit, double codes left */
|
||||||
|
left -= h->count[len]; /* deduct count from possible codes */
|
||||||
|
if (left < 0) return left; /* over-subscribed--return negative */
|
||||||
|
} /* left > 0 means incomplete */
|
||||||
|
|
||||||
|
/* generate offsets into symbol table for each length for sorting */
|
||||||
|
offs[1] = 0;
|
||||||
|
for (len = 1; len < MAXBITS; len++)
|
||||||
|
offs[len + 1] = offs[len] + h->count[len];
|
||||||
|
|
||||||
|
/*
|
||||||
|
* put symbols in table sorted by length, by symbol order within each
|
||||||
|
* length
|
||||||
|
*/
|
||||||
|
for (symbol = 0; symbol < n; symbol++)
|
||||||
|
if (length[symbol] != 0)
|
||||||
|
h->symbol[offs[length[symbol]]++] = symbol;
|
||||||
|
|
||||||
|
/* return zero for complete set, positive for incomplete set */
|
||||||
|
return left;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Decode PKWare Compression Library stream.
|
||||||
|
*
|
||||||
|
* Format notes:
|
||||||
|
*
|
||||||
|
* - First byte is 0 if literals are uncoded or 1 if they are coded. Second
|
||||||
|
* byte is 4, 5, or 6 for the number of extra bits in the distance code.
|
||||||
|
* This is the base-2 logarithm of the dictionary size minus six.
|
||||||
|
*
|
||||||
|
* - Compressed data is a combination of literals and length/distance pairs
|
||||||
|
* terminated by an end code. Literals are either Huffman coded or
|
||||||
|
* uncoded bytes. A length/distance pair is a coded length followed by a
|
||||||
|
* coded distance to represent a string that occurs earlier in the
|
||||||
|
* uncompressed data that occurs again at the current location.
|
||||||
|
*
|
||||||
|
* - A bit preceding a literal or length/distance pair indicates which comes
|
||||||
|
* next, 0 for literals, 1 for length/distance.
|
||||||
|
*
|
||||||
|
* - If literals are uncoded, then the next eight bits are the literal, in the
|
||||||
|
* normal bit order in the stream, i.e. no bit-reversal is needed. Similarly,
|
||||||
|
* no bit reversal is needed for either the length extra bits or the distance
|
||||||
|
* extra bits.
|
||||||
|
*
|
||||||
|
* - Literal bytes are simply written to the output. A length/distance pair is
|
||||||
|
* an instruction to copy previously uncompressed bytes to the output. The
|
||||||
|
* copy is from distance bytes back in the output stream, copying for length
|
||||||
|
* bytes.
|
||||||
|
*
|
||||||
|
* - Distances pointing before the beginning of the output data are not
|
||||||
|
* permitted.
|
||||||
|
*
|
||||||
|
* - Overlapped copies, where the length is greater than the distance, are
|
||||||
|
* allowed and common. For example, a distance of one and a length of 518
|
||||||
|
* simply copies the last byte 518 times. A distance of four and a length of
|
||||||
|
* twelve copies the last four bytes three times. A simple forward copy
|
||||||
|
* ignoring whether the length is greater than the distance or not implements
|
||||||
|
* this correctly.
|
||||||
|
*/
|
||||||
|
local int decomp(struct state *s)
|
||||||
|
{
|
||||||
|
int lit; /* true if literals are coded */
|
||||||
|
int dict; /* log2(dictionary size) - 6 */
|
||||||
|
int symbol; /* decoded symbol, extra bits for distance */
|
||||||
|
int len; /* length for copy */
|
||||||
|
unsigned dist; /* distance for copy */
|
||||||
|
int copy; /* copy counter */
|
||||||
|
unsigned char *from, *to; /* copy pointers */
|
||||||
|
static int virgin = 1; /* build tables once */
|
||||||
|
static short litcnt[MAXBITS+1], litsym[256]; /* litcode memory */
|
||||||
|
static short lencnt[MAXBITS+1], lensym[16]; /* lencode memory */
|
||||||
|
static short distcnt[MAXBITS+1], distsym[64]; /* distcode memory */
|
||||||
|
static struct huffman litcode = {litcnt, litsym}; /* length code */
|
||||||
|
static struct huffman lencode = {lencnt, lensym}; /* length code */
|
||||||
|
static struct huffman distcode = {distcnt, distsym};/* distance code */
|
||||||
|
/* bit lengths of literal codes */
|
||||||
|
static const unsigned char litlen[] = {
|
||||||
|
11, 124, 8, 7, 28, 7, 188, 13, 76, 4, 10, 8, 12, 10, 12, 10, 8, 23, 8,
|
||||||
|
9, 7, 6, 7, 8, 7, 6, 55, 8, 23, 24, 12, 11, 7, 9, 11, 12, 6, 7, 22, 5,
|
||||||
|
7, 24, 6, 11, 9, 6, 7, 22, 7, 11, 38, 7, 9, 8, 25, 11, 8, 11, 9, 12,
|
||||||
|
8, 12, 5, 38, 5, 38, 5, 11, 7, 5, 6, 21, 6, 10, 53, 8, 7, 24, 10, 27,
|
||||||
|
44, 253, 253, 253, 252, 252, 252, 13, 12, 45, 12, 45, 12, 61, 12, 45,
|
||||||
|
44, 173};
|
||||||
|
/* bit lengths of length codes 0..15 */
|
||||||
|
static const unsigned char lenlen[] = {2, 35, 36, 53, 38, 23};
|
||||||
|
/* bit lengths of distance codes 0..63 */
|
||||||
|
static const unsigned char distlen[] = {2, 20, 53, 230, 247, 151, 248};
|
||||||
|
static const short base[16] = { /* base for length codes */
|
||||||
|
3, 2, 4, 5, 6, 7, 8, 9, 10, 12, 16, 24, 40, 72, 136, 264};
|
||||||
|
static const char extra[16] = { /* extra bits for length codes */
|
||||||
|
0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8};
|
||||||
|
|
||||||
|
/* set up decoding tables (once--might not be thread-safe) */
|
||||||
|
if (virgin) {
|
||||||
|
construct(&litcode, litlen, sizeof(litlen));
|
||||||
|
construct(&lencode, lenlen, sizeof(lenlen));
|
||||||
|
construct(&distcode, distlen, sizeof(distlen));
|
||||||
|
virgin = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* read header */
|
||||||
|
lit = bits(s, 8);
|
||||||
|
if (lit > 1) return -1;
|
||||||
|
dict = bits(s, 8);
|
||||||
|
if (dict < 4 || dict > 6) return -2;
|
||||||
|
|
||||||
|
/* decode literals and length/distance pairs */
|
||||||
|
do {
|
||||||
|
if (bits(s, 1)) {
|
||||||
|
/* get length */
|
||||||
|
symbol = decode(s, &lencode);
|
||||||
|
len = base[symbol] + bits(s, extra[symbol]);
|
||||||
|
if (len == 519) break; /* end code */
|
||||||
|
|
||||||
|
/* get distance */
|
||||||
|
symbol = len == 2 ? 2 : dict;
|
||||||
|
dist = decode(s, &distcode) << symbol;
|
||||||
|
dist += bits(s, symbol);
|
||||||
|
dist++;
|
||||||
|
if (s->first && dist > s->next)
|
||||||
|
return -3; /* distance too far back */
|
||||||
|
|
||||||
|
/* copy length bytes from distance bytes back */
|
||||||
|
do {
|
||||||
|
to = s->out + s->next;
|
||||||
|
from = to - dist;
|
||||||
|
copy = MAXWIN;
|
||||||
|
if (s->next < dist) {
|
||||||
|
from += copy;
|
||||||
|
copy = dist;
|
||||||
|
}
|
||||||
|
copy -= s->next;
|
||||||
|
if (copy > len) copy = len;
|
||||||
|
len -= copy;
|
||||||
|
s->next += copy;
|
||||||
|
do {
|
||||||
|
*to++ = *from++;
|
||||||
|
} while (--copy);
|
||||||
|
if (s->next == MAXWIN) {
|
||||||
|
if (s->outfun(s->outhow, s->out, s->next)) return 1;
|
||||||
|
s->next = 0;
|
||||||
|
s->first = 0;
|
||||||
|
}
|
||||||
|
} while (len != 0);
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
/* get literal and write it */
|
||||||
|
symbol = lit ? decode(s, &litcode) : bits(s, 8);
|
||||||
|
s->out[s->next++] = symbol;
|
||||||
|
if (s->next == MAXWIN) {
|
||||||
|
if (s->outfun(s->outhow, s->out, s->next)) return 1;
|
||||||
|
s->next = 0;
|
||||||
|
s->first = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} while (1);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* See comments in blast.h */
|
||||||
|
int blast(blast_in infun, void *inhow, blast_out outfun, void *outhow,
|
||||||
|
unsigned *left, unsigned char **in)
|
||||||
|
{
|
||||||
|
struct state s; /* input/output state */
|
||||||
|
int err; /* return value */
|
||||||
|
|
||||||
|
/* initialize input state */
|
||||||
|
s.infun = infun;
|
||||||
|
s.inhow = inhow;
|
||||||
|
if (left != NULL && *left) {
|
||||||
|
s.left = *left;
|
||||||
|
s.in = *in;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
s.left = 0;
|
||||||
|
s.bitbuf = 0;
|
||||||
|
s.bitcnt = 0;
|
||||||
|
|
||||||
|
/* initialize output state */
|
||||||
|
s.outfun = outfun;
|
||||||
|
s.outhow = outhow;
|
||||||
|
s.next = 0;
|
||||||
|
s.first = 1;
|
||||||
|
|
||||||
|
/* return if bits() or decode() tries to read past available input */
|
||||||
|
if (setjmp(s.env) != 0) /* if came back here via longjmp(), */
|
||||||
|
err = 2; /* then skip decomp(), return error */
|
||||||
|
else
|
||||||
|
err = decomp(&s); /* decompress */
|
||||||
|
|
||||||
|
/* return unused input */
|
||||||
|
if (left != NULL)
|
||||||
|
*left = s.left;
|
||||||
|
if (in != NULL)
|
||||||
|
*in = s.left ? s.in : NULL;
|
||||||
|
|
||||||
|
/* write any leftover output and update the error code if needed */
|
||||||
|
if (err != 1 && s.next && s.outfun(s.outhow, s.out, s.next) && err == 0)
|
||||||
|
err = 1;
|
||||||
|
return err;
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef TEST
|
||||||
|
/* Example of how to use blast() */
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
|
||||||
|
#define CHUNK 16384
|
||||||
|
|
||||||
|
local unsigned inf(void *how, unsigned char **buf)
|
||||||
|
{
|
||||||
|
static unsigned char hold[CHUNK];
|
||||||
|
|
||||||
|
*buf = hold;
|
||||||
|
return fread(hold, 1, CHUNK, (FILE *)how);
|
||||||
|
}
|
||||||
|
|
||||||
|
local int outf(void *how, unsigned char *buf, unsigned len)
|
||||||
|
{
|
||||||
|
return fwrite(buf, 1, len, (FILE *)how) != len;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Decompress a PKWare Compression Library stream from stdin to stdout */
|
||||||
|
int main(void)
|
||||||
|
{
|
||||||
|
int ret;
|
||||||
|
unsigned left;
|
||||||
|
|
||||||
|
/* decompress to stdout */
|
||||||
|
left = 0;
|
||||||
|
ret = blast(inf, stdin, outf, stdout, &left, NULL);
|
||||||
|
if (ret != 0)
|
||||||
|
fprintf(stderr, "blast error: %d\n", ret);
|
||||||
|
|
||||||
|
/* count any leftover bytes */
|
||||||
|
while (getchar() != EOF)
|
||||||
|
left++;
|
||||||
|
if (left)
|
||||||
|
fprintf(stderr, "blast warning: %u unused bytes of input\n", left);
|
||||||
|
|
||||||
|
/* return blast() error code */
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
83
contrib/blast/blast.h
Normal file
83
contrib/blast/blast.h
Normal file
@@ -0,0 +1,83 @@
|
|||||||
|
/* blast.h -- interface for blast.c
|
||||||
|
Copyright (C) 2003, 2012, 2013 Mark Adler
|
||||||
|
version 1.3, 24 Aug 2013
|
||||||
|
|
||||||
|
This software is provided 'as-is', without any express or implied
|
||||||
|
warranty. In no event will the author be held liable for any damages
|
||||||
|
arising from the use of this software.
|
||||||
|
|
||||||
|
Permission is granted to anyone to use this software for any purpose,
|
||||||
|
including commercial applications, and to alter it and redistribute it
|
||||||
|
freely, subject to the following restrictions:
|
||||||
|
|
||||||
|
1. The origin of this software must not be misrepresented; you must not
|
||||||
|
claim that you wrote the original software. If you use this software
|
||||||
|
in a product, an acknowledgment in the product documentation would be
|
||||||
|
appreciated but is not required.
|
||||||
|
2. Altered source versions must be plainly marked as such, and must not be
|
||||||
|
misrepresented as being the original software.
|
||||||
|
3. This notice may not be removed or altered from any source distribution.
|
||||||
|
|
||||||
|
Mark Adler madler@alumni.caltech.edu
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
* blast() decompresses the PKWare Data Compression Library (DCL) compressed
|
||||||
|
* format. It provides the same functionality as the explode() function in
|
||||||
|
* that library. (Note: PKWare overused the "implode" verb, and the format
|
||||||
|
* used by their library implode() function is completely different and
|
||||||
|
* incompatible with the implode compression method supported by PKZIP.)
|
||||||
|
*
|
||||||
|
* The binary mode for stdio functions should be used to assure that the
|
||||||
|
* compressed data is not corrupted when read or written. For example:
|
||||||
|
* fopen(..., "rb") and fopen(..., "wb").
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
typedef unsigned (*blast_in)(void *how, unsigned char **buf);
|
||||||
|
typedef int (*blast_out)(void *how, unsigned char *buf, unsigned len);
|
||||||
|
/* Definitions for input/output functions passed to blast(). See below for
|
||||||
|
* what the provided functions need to do.
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
int blast(blast_in infun, void *inhow, blast_out outfun, void *outhow,
|
||||||
|
unsigned *left, unsigned char **in);
|
||||||
|
/* Decompress input to output using the provided infun() and outfun() calls.
|
||||||
|
* On success, the return value of blast() is zero. If there is an error in
|
||||||
|
* the source data, i.e. it is not in the proper format, then a negative value
|
||||||
|
* is returned. If there is not enough input available or there is not enough
|
||||||
|
* output space, then a positive error is returned.
|
||||||
|
*
|
||||||
|
* The input function is invoked: len = infun(how, &buf), where buf is set by
|
||||||
|
* infun() to point to the input buffer, and infun() returns the number of
|
||||||
|
* available bytes there. If infun() returns zero, then blast() returns with
|
||||||
|
* an input error. (blast() only asks for input if it needs it.) inhow is for
|
||||||
|
* use by the application to pass an input descriptor to infun(), if desired.
|
||||||
|
*
|
||||||
|
* If left and in are not NULL and *left is not zero when blast() is called,
|
||||||
|
* then the *left bytes are *in are consumed for input before infun() is used.
|
||||||
|
*
|
||||||
|
* The output function is invoked: err = outfun(how, buf, len), where the bytes
|
||||||
|
* to be written are buf[0..len-1]. If err is not zero, then blast() returns
|
||||||
|
* with an output error. outfun() is always called with len <= 4096. outhow
|
||||||
|
* is for use by the application to pass an output descriptor to outfun(), if
|
||||||
|
* desired.
|
||||||
|
*
|
||||||
|
* If there is any unused input, *left is set to the number of bytes that were
|
||||||
|
* read and *in points to them. Otherwise *left is set to zero and *in is set
|
||||||
|
* to NULL. If left or in are NULL, then they are not set.
|
||||||
|
*
|
||||||
|
* The return codes are:
|
||||||
|
*
|
||||||
|
* 2: ran out of input before completing decompression
|
||||||
|
* 1: output error before completing decompression
|
||||||
|
* 0: successful decompression
|
||||||
|
* -1: literal flag not zero or one
|
||||||
|
* -2: dictionary size not in 4..6
|
||||||
|
* -3: distance is too far back
|
||||||
|
*
|
||||||
|
* At the bottom of blast.c is an example program that uses blast() that can be
|
||||||
|
* compiled to produce a command-line decompression filter by defining TEST.
|
||||||
|
*/
|
||||||
BIN
contrib/blast/test.pk
Normal file
BIN
contrib/blast/test.pk
Normal file
Binary file not shown.
1
contrib/blast/test.txt
Normal file
1
contrib/blast/test.txt
Normal file
@@ -0,0 +1 @@
|
|||||||
|
AIAIAIAIAIAIA
|
||||||
557
contrib/delphi/ZLib.pas
Normal file
557
contrib/delphi/ZLib.pas
Normal file
@@ -0,0 +1,557 @@
|
|||||||
|
{*******************************************************}
|
||||||
|
{ }
|
||||||
|
{ Borland Delphi Supplemental Components }
|
||||||
|
{ ZLIB Data Compression Interface Unit }
|
||||||
|
{ }
|
||||||
|
{ Copyright (c) 1997,99 Borland Corporation }
|
||||||
|
{ }
|
||||||
|
{*******************************************************}
|
||||||
|
|
||||||
|
{ Updated for zlib 1.2.x by Cosmin Truta <cosmint@cs.ubbcluj.ro> }
|
||||||
|
|
||||||
|
unit ZLib;
|
||||||
|
|
||||||
|
interface
|
||||||
|
|
||||||
|
uses SysUtils, Classes;
|
||||||
|
|
||||||
|
type
|
||||||
|
TAlloc = function (AppData: Pointer; Items, Size: Integer): Pointer; cdecl;
|
||||||
|
TFree = procedure (AppData, Block: Pointer); cdecl;
|
||||||
|
|
||||||
|
// Internal structure. Ignore.
|
||||||
|
TZStreamRec = packed record
|
||||||
|
next_in: PChar; // next input byte
|
||||||
|
avail_in: Integer; // number of bytes available at next_in
|
||||||
|
total_in: Longint; // total nb of input bytes read so far
|
||||||
|
|
||||||
|
next_out: PChar; // next output byte should be put here
|
||||||
|
avail_out: Integer; // remaining free space at next_out
|
||||||
|
total_out: Longint; // total nb of bytes output so far
|
||||||
|
|
||||||
|
msg: PChar; // last error message, NULL if no error
|
||||||
|
internal: Pointer; // not visible by applications
|
||||||
|
|
||||||
|
zalloc: TAlloc; // used to allocate the internal state
|
||||||
|
zfree: TFree; // used to free the internal state
|
||||||
|
AppData: Pointer; // private data object passed to zalloc and zfree
|
||||||
|
|
||||||
|
data_type: Integer; // best guess about the data type: ascii or binary
|
||||||
|
adler: Longint; // adler32 value of the uncompressed data
|
||||||
|
reserved: Longint; // reserved for future use
|
||||||
|
end;
|
||||||
|
|
||||||
|
// Abstract ancestor class
|
||||||
|
TCustomZlibStream = class(TStream)
|
||||||
|
private
|
||||||
|
FStrm: TStream;
|
||||||
|
FStrmPos: Integer;
|
||||||
|
FOnProgress: TNotifyEvent;
|
||||||
|
FZRec: TZStreamRec;
|
||||||
|
FBuffer: array [Word] of Char;
|
||||||
|
protected
|
||||||
|
procedure Progress(Sender: TObject); dynamic;
|
||||||
|
property OnProgress: TNotifyEvent read FOnProgress write FOnProgress;
|
||||||
|
constructor Create(Strm: TStream);
|
||||||
|
end;
|
||||||
|
|
||||||
|
{ TCompressionStream compresses data on the fly as data is written to it, and
|
||||||
|
stores the compressed data to another stream.
|
||||||
|
|
||||||
|
TCompressionStream is write-only and strictly sequential. Reading from the
|
||||||
|
stream will raise an exception. Using Seek to move the stream pointer
|
||||||
|
will raise an exception.
|
||||||
|
|
||||||
|
Output data is cached internally, written to the output stream only when
|
||||||
|
the internal output buffer is full. All pending output data is flushed
|
||||||
|
when the stream is destroyed.
|
||||||
|
|
||||||
|
The Position property returns the number of uncompressed bytes of
|
||||||
|
data that have been written to the stream so far.
|
||||||
|
|
||||||
|
CompressionRate returns the on-the-fly percentage by which the original
|
||||||
|
data has been compressed: (1 - (CompressedBytes / UncompressedBytes)) * 100
|
||||||
|
If raw data size = 100 and compressed data size = 25, the CompressionRate
|
||||||
|
is 75%
|
||||||
|
|
||||||
|
The OnProgress event is called each time the output buffer is filled and
|
||||||
|
written to the output stream. This is useful for updating a progress
|
||||||
|
indicator when you are writing a large chunk of data to the compression
|
||||||
|
stream in a single call.}
|
||||||
|
|
||||||
|
|
||||||
|
TCompressionLevel = (clNone, clFastest, clDefault, clMax);
|
||||||
|
|
||||||
|
TCompressionStream = class(TCustomZlibStream)
|
||||||
|
private
|
||||||
|
function GetCompressionRate: Single;
|
||||||
|
public
|
||||||
|
constructor Create(CompressionLevel: TCompressionLevel; Dest: TStream);
|
||||||
|
destructor Destroy; override;
|
||||||
|
function Read(var Buffer; Count: Longint): Longint; override;
|
||||||
|
function Write(const Buffer; Count: Longint): Longint; override;
|
||||||
|
function Seek(Offset: Longint; Origin: Word): Longint; override;
|
||||||
|
property CompressionRate: Single read GetCompressionRate;
|
||||||
|
property OnProgress;
|
||||||
|
end;
|
||||||
|
|
||||||
|
{ TDecompressionStream decompresses data on the fly as data is read from it.
|
||||||
|
|
||||||
|
Compressed data comes from a separate source stream. TDecompressionStream
|
||||||
|
is read-only and unidirectional; you can seek forward in the stream, but not
|
||||||
|
backwards. The special case of setting the stream position to zero is
|
||||||
|
allowed. Seeking forward decompresses data until the requested position in
|
||||||
|
the uncompressed data has been reached. Seeking backwards, seeking relative
|
||||||
|
to the end of the stream, requesting the size of the stream, and writing to
|
||||||
|
the stream will raise an exception.
|
||||||
|
|
||||||
|
The Position property returns the number of bytes of uncompressed data that
|
||||||
|
have been read from the stream so far.
|
||||||
|
|
||||||
|
The OnProgress event is called each time the internal input buffer of
|
||||||
|
compressed data is exhausted and the next block is read from the input stream.
|
||||||
|
This is useful for updating a progress indicator when you are reading a
|
||||||
|
large chunk of data from the decompression stream in a single call.}
|
||||||
|
|
||||||
|
TDecompressionStream = class(TCustomZlibStream)
|
||||||
|
public
|
||||||
|
constructor Create(Source: TStream);
|
||||||
|
destructor Destroy; override;
|
||||||
|
function Read(var Buffer; Count: Longint): Longint; override;
|
||||||
|
function Write(const Buffer; Count: Longint): Longint; override;
|
||||||
|
function Seek(Offset: Longint; Origin: Word): Longint; override;
|
||||||
|
property OnProgress;
|
||||||
|
end;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
{ CompressBuf compresses data, buffer to buffer, in one call.
|
||||||
|
In: InBuf = ptr to compressed data
|
||||||
|
InBytes = number of bytes in InBuf
|
||||||
|
Out: OutBuf = ptr to newly allocated buffer containing decompressed data
|
||||||
|
OutBytes = number of bytes in OutBuf }
|
||||||
|
procedure CompressBuf(const InBuf: Pointer; InBytes: Integer;
|
||||||
|
out OutBuf: Pointer; out OutBytes: Integer);
|
||||||
|
|
||||||
|
|
||||||
|
{ DecompressBuf decompresses data, buffer to buffer, in one call.
|
||||||
|
In: InBuf = ptr to compressed data
|
||||||
|
InBytes = number of bytes in InBuf
|
||||||
|
OutEstimate = zero, or est. size of the decompressed data
|
||||||
|
Out: OutBuf = ptr to newly allocated buffer containing decompressed data
|
||||||
|
OutBytes = number of bytes in OutBuf }
|
||||||
|
procedure DecompressBuf(const InBuf: Pointer; InBytes: Integer;
|
||||||
|
OutEstimate: Integer; out OutBuf: Pointer; out OutBytes: Integer);
|
||||||
|
|
||||||
|
{ DecompressToUserBuf decompresses data, buffer to buffer, in one call.
|
||||||
|
In: InBuf = ptr to compressed data
|
||||||
|
InBytes = number of bytes in InBuf
|
||||||
|
Out: OutBuf = ptr to user-allocated buffer to contain decompressed data
|
||||||
|
BufSize = number of bytes in OutBuf }
|
||||||
|
procedure DecompressToUserBuf(const InBuf: Pointer; InBytes: Integer;
|
||||||
|
const OutBuf: Pointer; BufSize: Integer);
|
||||||
|
|
||||||
|
const
|
||||||
|
zlib_version = '1.2.11';
|
||||||
|
|
||||||
|
type
|
||||||
|
EZlibError = class(Exception);
|
||||||
|
ECompressionError = class(EZlibError);
|
||||||
|
EDecompressionError = class(EZlibError);
|
||||||
|
|
||||||
|
implementation
|
||||||
|
|
||||||
|
uses ZLibConst;
|
||||||
|
|
||||||
|
const
|
||||||
|
Z_NO_FLUSH = 0;
|
||||||
|
Z_PARTIAL_FLUSH = 1;
|
||||||
|
Z_SYNC_FLUSH = 2;
|
||||||
|
Z_FULL_FLUSH = 3;
|
||||||
|
Z_FINISH = 4;
|
||||||
|
|
||||||
|
Z_OK = 0;
|
||||||
|
Z_STREAM_END = 1;
|
||||||
|
Z_NEED_DICT = 2;
|
||||||
|
Z_ERRNO = (-1);
|
||||||
|
Z_STREAM_ERROR = (-2);
|
||||||
|
Z_DATA_ERROR = (-3);
|
||||||
|
Z_MEM_ERROR = (-4);
|
||||||
|
Z_BUF_ERROR = (-5);
|
||||||
|
Z_VERSION_ERROR = (-6);
|
||||||
|
|
||||||
|
Z_NO_COMPRESSION = 0;
|
||||||
|
Z_BEST_SPEED = 1;
|
||||||
|
Z_BEST_COMPRESSION = 9;
|
||||||
|
Z_DEFAULT_COMPRESSION = (-1);
|
||||||
|
|
||||||
|
Z_FILTERED = 1;
|
||||||
|
Z_HUFFMAN_ONLY = 2;
|
||||||
|
Z_RLE = 3;
|
||||||
|
Z_DEFAULT_STRATEGY = 0;
|
||||||
|
|
||||||
|
Z_BINARY = 0;
|
||||||
|
Z_ASCII = 1;
|
||||||
|
Z_UNKNOWN = 2;
|
||||||
|
|
||||||
|
Z_DEFLATED = 8;
|
||||||
|
|
||||||
|
|
||||||
|
{$L adler32.obj}
|
||||||
|
{$L compress.obj}
|
||||||
|
{$L crc32.obj}
|
||||||
|
{$L deflate.obj}
|
||||||
|
{$L infback.obj}
|
||||||
|
{$L inffast.obj}
|
||||||
|
{$L inflate.obj}
|
||||||
|
{$L inftrees.obj}
|
||||||
|
{$L trees.obj}
|
||||||
|
{$L uncompr.obj}
|
||||||
|
{$L zutil.obj}
|
||||||
|
|
||||||
|
procedure adler32; external;
|
||||||
|
procedure compressBound; external;
|
||||||
|
procedure crc32; external;
|
||||||
|
procedure deflateInit2_; external;
|
||||||
|
procedure deflateParams; external;
|
||||||
|
|
||||||
|
function _malloc(Size: Integer): Pointer; cdecl;
|
||||||
|
begin
|
||||||
|
Result := AllocMem(Size);
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure _free(Block: Pointer); cdecl;
|
||||||
|
begin
|
||||||
|
FreeMem(Block);
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure _memset(P: Pointer; B: Byte; count: Integer); cdecl;
|
||||||
|
begin
|
||||||
|
FillChar(P^, count, B);
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure _memcpy(dest, source: Pointer; count: Integer); cdecl;
|
||||||
|
begin
|
||||||
|
Move(source^, dest^, count);
|
||||||
|
end;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
// deflate compresses data
|
||||||
|
function deflateInit_(var strm: TZStreamRec; level: Integer; version: PChar;
|
||||||
|
recsize: Integer): Integer; external;
|
||||||
|
function deflate(var strm: TZStreamRec; flush: Integer): Integer; external;
|
||||||
|
function deflateEnd(var strm: TZStreamRec): Integer; external;
|
||||||
|
|
||||||
|
// inflate decompresses data
|
||||||
|
function inflateInit_(var strm: TZStreamRec; version: PChar;
|
||||||
|
recsize: Integer): Integer; external;
|
||||||
|
function inflate(var strm: TZStreamRec; flush: Integer): Integer; external;
|
||||||
|
function inflateEnd(var strm: TZStreamRec): Integer; external;
|
||||||
|
function inflateReset(var strm: TZStreamRec): Integer; external;
|
||||||
|
|
||||||
|
|
||||||
|
function zlibAllocMem(AppData: Pointer; Items, Size: Integer): Pointer; cdecl;
|
||||||
|
begin
|
||||||
|
// GetMem(Result, Items*Size);
|
||||||
|
Result := AllocMem(Items * Size);
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure zlibFreeMem(AppData, Block: Pointer); cdecl;
|
||||||
|
begin
|
||||||
|
FreeMem(Block);
|
||||||
|
end;
|
||||||
|
|
||||||
|
{function zlibCheck(code: Integer): Integer;
|
||||||
|
begin
|
||||||
|
Result := code;
|
||||||
|
if code < 0 then
|
||||||
|
raise EZlibError.Create('error'); //!!
|
||||||
|
end;}
|
||||||
|
|
||||||
|
function CCheck(code: Integer): Integer;
|
||||||
|
begin
|
||||||
|
Result := code;
|
||||||
|
if code < 0 then
|
||||||
|
raise ECompressionError.Create('error'); //!!
|
||||||
|
end;
|
||||||
|
|
||||||
|
function DCheck(code: Integer): Integer;
|
||||||
|
begin
|
||||||
|
Result := code;
|
||||||
|
if code < 0 then
|
||||||
|
raise EDecompressionError.Create('error'); //!!
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure CompressBuf(const InBuf: Pointer; InBytes: Integer;
|
||||||
|
out OutBuf: Pointer; out OutBytes: Integer);
|
||||||
|
var
|
||||||
|
strm: TZStreamRec;
|
||||||
|
P: Pointer;
|
||||||
|
begin
|
||||||
|
FillChar(strm, sizeof(strm), 0);
|
||||||
|
strm.zalloc := zlibAllocMem;
|
||||||
|
strm.zfree := zlibFreeMem;
|
||||||
|
OutBytes := ((InBytes + (InBytes div 10) + 12) + 255) and not 255;
|
||||||
|
GetMem(OutBuf, OutBytes);
|
||||||
|
try
|
||||||
|
strm.next_in := InBuf;
|
||||||
|
strm.avail_in := InBytes;
|
||||||
|
strm.next_out := OutBuf;
|
||||||
|
strm.avail_out := OutBytes;
|
||||||
|
CCheck(deflateInit_(strm, Z_BEST_COMPRESSION, zlib_version, sizeof(strm)));
|
||||||
|
try
|
||||||
|
while CCheck(deflate(strm, Z_FINISH)) <> Z_STREAM_END do
|
||||||
|
begin
|
||||||
|
P := OutBuf;
|
||||||
|
Inc(OutBytes, 256);
|
||||||
|
ReallocMem(OutBuf, OutBytes);
|
||||||
|
strm.next_out := PChar(Integer(OutBuf) + (Integer(strm.next_out) - Integer(P)));
|
||||||
|
strm.avail_out := 256;
|
||||||
|
end;
|
||||||
|
finally
|
||||||
|
CCheck(deflateEnd(strm));
|
||||||
|
end;
|
||||||
|
ReallocMem(OutBuf, strm.total_out);
|
||||||
|
OutBytes := strm.total_out;
|
||||||
|
except
|
||||||
|
FreeMem(OutBuf);
|
||||||
|
raise
|
||||||
|
end;
|
||||||
|
end;
|
||||||
|
|
||||||
|
|
||||||
|
procedure DecompressBuf(const InBuf: Pointer; InBytes: Integer;
|
||||||
|
OutEstimate: Integer; out OutBuf: Pointer; out OutBytes: Integer);
|
||||||
|
var
|
||||||
|
strm: TZStreamRec;
|
||||||
|
P: Pointer;
|
||||||
|
BufInc: Integer;
|
||||||
|
begin
|
||||||
|
FillChar(strm, sizeof(strm), 0);
|
||||||
|
strm.zalloc := zlibAllocMem;
|
||||||
|
strm.zfree := zlibFreeMem;
|
||||||
|
BufInc := (InBytes + 255) and not 255;
|
||||||
|
if OutEstimate = 0 then
|
||||||
|
OutBytes := BufInc
|
||||||
|
else
|
||||||
|
OutBytes := OutEstimate;
|
||||||
|
GetMem(OutBuf, OutBytes);
|
||||||
|
try
|
||||||
|
strm.next_in := InBuf;
|
||||||
|
strm.avail_in := InBytes;
|
||||||
|
strm.next_out := OutBuf;
|
||||||
|
strm.avail_out := OutBytes;
|
||||||
|
DCheck(inflateInit_(strm, zlib_version, sizeof(strm)));
|
||||||
|
try
|
||||||
|
while DCheck(inflate(strm, Z_NO_FLUSH)) <> Z_STREAM_END do
|
||||||
|
begin
|
||||||
|
P := OutBuf;
|
||||||
|
Inc(OutBytes, BufInc);
|
||||||
|
ReallocMem(OutBuf, OutBytes);
|
||||||
|
strm.next_out := PChar(Integer(OutBuf) + (Integer(strm.next_out) - Integer(P)));
|
||||||
|
strm.avail_out := BufInc;
|
||||||
|
end;
|
||||||
|
finally
|
||||||
|
DCheck(inflateEnd(strm));
|
||||||
|
end;
|
||||||
|
ReallocMem(OutBuf, strm.total_out);
|
||||||
|
OutBytes := strm.total_out;
|
||||||
|
except
|
||||||
|
FreeMem(OutBuf);
|
||||||
|
raise
|
||||||
|
end;
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure DecompressToUserBuf(const InBuf: Pointer; InBytes: Integer;
|
||||||
|
const OutBuf: Pointer; BufSize: Integer);
|
||||||
|
var
|
||||||
|
strm: TZStreamRec;
|
||||||
|
begin
|
||||||
|
FillChar(strm, sizeof(strm), 0);
|
||||||
|
strm.zalloc := zlibAllocMem;
|
||||||
|
strm.zfree := zlibFreeMem;
|
||||||
|
strm.next_in := InBuf;
|
||||||
|
strm.avail_in := InBytes;
|
||||||
|
strm.next_out := OutBuf;
|
||||||
|
strm.avail_out := BufSize;
|
||||||
|
DCheck(inflateInit_(strm, zlib_version, sizeof(strm)));
|
||||||
|
try
|
||||||
|
if DCheck(inflate(strm, Z_FINISH)) <> Z_STREAM_END then
|
||||||
|
raise EZlibError.CreateRes(@sTargetBufferTooSmall);
|
||||||
|
finally
|
||||||
|
DCheck(inflateEnd(strm));
|
||||||
|
end;
|
||||||
|
end;
|
||||||
|
|
||||||
|
// TCustomZlibStream
|
||||||
|
|
||||||
|
constructor TCustomZLibStream.Create(Strm: TStream);
|
||||||
|
begin
|
||||||
|
inherited Create;
|
||||||
|
FStrm := Strm;
|
||||||
|
FStrmPos := Strm.Position;
|
||||||
|
FZRec.zalloc := zlibAllocMem;
|
||||||
|
FZRec.zfree := zlibFreeMem;
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure TCustomZLibStream.Progress(Sender: TObject);
|
||||||
|
begin
|
||||||
|
if Assigned(FOnProgress) then FOnProgress(Sender);
|
||||||
|
end;
|
||||||
|
|
||||||
|
|
||||||
|
// TCompressionStream
|
||||||
|
|
||||||
|
constructor TCompressionStream.Create(CompressionLevel: TCompressionLevel;
|
||||||
|
Dest: TStream);
|
||||||
|
const
|
||||||
|
Levels: array [TCompressionLevel] of ShortInt =
|
||||||
|
(Z_NO_COMPRESSION, Z_BEST_SPEED, Z_DEFAULT_COMPRESSION, Z_BEST_COMPRESSION);
|
||||||
|
begin
|
||||||
|
inherited Create(Dest);
|
||||||
|
FZRec.next_out := FBuffer;
|
||||||
|
FZRec.avail_out := sizeof(FBuffer);
|
||||||
|
CCheck(deflateInit_(FZRec, Levels[CompressionLevel], zlib_version, sizeof(FZRec)));
|
||||||
|
end;
|
||||||
|
|
||||||
|
destructor TCompressionStream.Destroy;
|
||||||
|
begin
|
||||||
|
FZRec.next_in := nil;
|
||||||
|
FZRec.avail_in := 0;
|
||||||
|
try
|
||||||
|
if FStrm.Position <> FStrmPos then FStrm.Position := FStrmPos;
|
||||||
|
while (CCheck(deflate(FZRec, Z_FINISH)) <> Z_STREAM_END)
|
||||||
|
and (FZRec.avail_out = 0) do
|
||||||
|
begin
|
||||||
|
FStrm.WriteBuffer(FBuffer, sizeof(FBuffer));
|
||||||
|
FZRec.next_out := FBuffer;
|
||||||
|
FZRec.avail_out := sizeof(FBuffer);
|
||||||
|
end;
|
||||||
|
if FZRec.avail_out < sizeof(FBuffer) then
|
||||||
|
FStrm.WriteBuffer(FBuffer, sizeof(FBuffer) - FZRec.avail_out);
|
||||||
|
finally
|
||||||
|
deflateEnd(FZRec);
|
||||||
|
end;
|
||||||
|
inherited Destroy;
|
||||||
|
end;
|
||||||
|
|
||||||
|
function TCompressionStream.Read(var Buffer; Count: Longint): Longint;
|
||||||
|
begin
|
||||||
|
raise ECompressionError.CreateRes(@sInvalidStreamOp);
|
||||||
|
end;
|
||||||
|
|
||||||
|
function TCompressionStream.Write(const Buffer; Count: Longint): Longint;
|
||||||
|
begin
|
||||||
|
FZRec.next_in := @Buffer;
|
||||||
|
FZRec.avail_in := Count;
|
||||||
|
if FStrm.Position <> FStrmPos then FStrm.Position := FStrmPos;
|
||||||
|
while (FZRec.avail_in > 0) do
|
||||||
|
begin
|
||||||
|
CCheck(deflate(FZRec, 0));
|
||||||
|
if FZRec.avail_out = 0 then
|
||||||
|
begin
|
||||||
|
FStrm.WriteBuffer(FBuffer, sizeof(FBuffer));
|
||||||
|
FZRec.next_out := FBuffer;
|
||||||
|
FZRec.avail_out := sizeof(FBuffer);
|
||||||
|
FStrmPos := FStrm.Position;
|
||||||
|
Progress(Self);
|
||||||
|
end;
|
||||||
|
end;
|
||||||
|
Result := Count;
|
||||||
|
end;
|
||||||
|
|
||||||
|
function TCompressionStream.Seek(Offset: Longint; Origin: Word): Longint;
|
||||||
|
begin
|
||||||
|
if (Offset = 0) and (Origin = soFromCurrent) then
|
||||||
|
Result := FZRec.total_in
|
||||||
|
else
|
||||||
|
raise ECompressionError.CreateRes(@sInvalidStreamOp);
|
||||||
|
end;
|
||||||
|
|
||||||
|
function TCompressionStream.GetCompressionRate: Single;
|
||||||
|
begin
|
||||||
|
if FZRec.total_in = 0 then
|
||||||
|
Result := 0
|
||||||
|
else
|
||||||
|
Result := (1.0 - (FZRec.total_out / FZRec.total_in)) * 100.0;
|
||||||
|
end;
|
||||||
|
|
||||||
|
|
||||||
|
// TDecompressionStream
|
||||||
|
|
||||||
|
constructor TDecompressionStream.Create(Source: TStream);
|
||||||
|
begin
|
||||||
|
inherited Create(Source);
|
||||||
|
FZRec.next_in := FBuffer;
|
||||||
|
FZRec.avail_in := 0;
|
||||||
|
DCheck(inflateInit_(FZRec, zlib_version, sizeof(FZRec)));
|
||||||
|
end;
|
||||||
|
|
||||||
|
destructor TDecompressionStream.Destroy;
|
||||||
|
begin
|
||||||
|
FStrm.Seek(-FZRec.avail_in, 1);
|
||||||
|
inflateEnd(FZRec);
|
||||||
|
inherited Destroy;
|
||||||
|
end;
|
||||||
|
|
||||||
|
function TDecompressionStream.Read(var Buffer; Count: Longint): Longint;
|
||||||
|
begin
|
||||||
|
FZRec.next_out := @Buffer;
|
||||||
|
FZRec.avail_out := Count;
|
||||||
|
if FStrm.Position <> FStrmPos then FStrm.Position := FStrmPos;
|
||||||
|
while (FZRec.avail_out > 0) do
|
||||||
|
begin
|
||||||
|
if FZRec.avail_in = 0 then
|
||||||
|
begin
|
||||||
|
FZRec.avail_in := FStrm.Read(FBuffer, sizeof(FBuffer));
|
||||||
|
if FZRec.avail_in = 0 then
|
||||||
|
begin
|
||||||
|
Result := Count - FZRec.avail_out;
|
||||||
|
Exit;
|
||||||
|
end;
|
||||||
|
FZRec.next_in := FBuffer;
|
||||||
|
FStrmPos := FStrm.Position;
|
||||||
|
Progress(Self);
|
||||||
|
end;
|
||||||
|
CCheck(inflate(FZRec, 0));
|
||||||
|
end;
|
||||||
|
Result := Count;
|
||||||
|
end;
|
||||||
|
|
||||||
|
function TDecompressionStream.Write(const Buffer; Count: Longint): Longint;
|
||||||
|
begin
|
||||||
|
raise EDecompressionError.CreateRes(@sInvalidStreamOp);
|
||||||
|
end;
|
||||||
|
|
||||||
|
function TDecompressionStream.Seek(Offset: Longint; Origin: Word): Longint;
|
||||||
|
var
|
||||||
|
I: Integer;
|
||||||
|
Buf: array [0..4095] of Char;
|
||||||
|
begin
|
||||||
|
if (Offset = 0) and (Origin = soFromBeginning) then
|
||||||
|
begin
|
||||||
|
DCheck(inflateReset(FZRec));
|
||||||
|
FZRec.next_in := FBuffer;
|
||||||
|
FZRec.avail_in := 0;
|
||||||
|
FStrm.Position := 0;
|
||||||
|
FStrmPos := 0;
|
||||||
|
end
|
||||||
|
else if ( (Offset >= 0) and (Origin = soFromCurrent)) or
|
||||||
|
( ((Offset - FZRec.total_out) > 0) and (Origin = soFromBeginning)) then
|
||||||
|
begin
|
||||||
|
if Origin = soFromBeginning then Dec(Offset, FZRec.total_out);
|
||||||
|
if Offset > 0 then
|
||||||
|
begin
|
||||||
|
for I := 1 to Offset div sizeof(Buf) do
|
||||||
|
ReadBuffer(Buf, sizeof(Buf));
|
||||||
|
ReadBuffer(Buf, Offset mod sizeof(Buf));
|
||||||
|
end;
|
||||||
|
end
|
||||||
|
else
|
||||||
|
raise EDecompressionError.CreateRes(@sInvalidStreamOp);
|
||||||
|
Result := FZRec.total_out;
|
||||||
|
end;
|
||||||
|
|
||||||
|
|
||||||
|
end.
|
||||||
11
contrib/delphi/ZLibConst.pas
Normal file
11
contrib/delphi/ZLibConst.pas
Normal file
@@ -0,0 +1,11 @@
|
|||||||
|
unit ZLibConst;
|
||||||
|
|
||||||
|
interface
|
||||||
|
|
||||||
|
resourcestring
|
||||||
|
sTargetBufferTooSmall = 'ZLib error: target buffer may be too small';
|
||||||
|
sInvalidStreamOp = 'Invalid stream operation';
|
||||||
|
|
||||||
|
implementation
|
||||||
|
|
||||||
|
end.
|
||||||
76
contrib/delphi/readme.txt
Normal file
76
contrib/delphi/readme.txt
Normal file
@@ -0,0 +1,76 @@
|
|||||||
|
|
||||||
|
Overview
|
||||||
|
========
|
||||||
|
|
||||||
|
This directory contains an update to the ZLib interface unit,
|
||||||
|
distributed by Borland as a Delphi supplemental component.
|
||||||
|
|
||||||
|
The original ZLib unit is Copyright (c) 1997,99 Borland Corp.,
|
||||||
|
and is based on zlib version 1.0.4. There are a series of bugs
|
||||||
|
and security problems associated with that old zlib version, and
|
||||||
|
we recommend the users to update their ZLib unit.
|
||||||
|
|
||||||
|
|
||||||
|
Summary of modifications
|
||||||
|
========================
|
||||||
|
|
||||||
|
- Improved makefile, adapted to zlib version 1.2.1.
|
||||||
|
|
||||||
|
- Some field types from TZStreamRec are changed from Integer to
|
||||||
|
Longint, for consistency with the zlib.h header, and for 64-bit
|
||||||
|
readiness.
|
||||||
|
|
||||||
|
- The zlib_version constant is updated.
|
||||||
|
|
||||||
|
- The new Z_RLE strategy has its corresponding symbolic constant.
|
||||||
|
|
||||||
|
- The allocation and deallocation functions and function types
|
||||||
|
(TAlloc, TFree, zlibAllocMem and zlibFreeMem) are now cdecl,
|
||||||
|
and _malloc and _free are added as C RTL stubs. As a result,
|
||||||
|
the original C sources of zlib can be compiled out of the box,
|
||||||
|
and linked to the ZLib unit.
|
||||||
|
|
||||||
|
|
||||||
|
Suggestions for improvements
|
||||||
|
============================
|
||||||
|
|
||||||
|
Currently, the ZLib unit provides only a limited wrapper around
|
||||||
|
the zlib library, and much of the original zlib functionality is
|
||||||
|
missing. Handling compressed file formats like ZIP/GZIP or PNG
|
||||||
|
cannot be implemented without having this functionality.
|
||||||
|
Applications that handle these formats are either using their own,
|
||||||
|
duplicated code, or not using the ZLib unit at all.
|
||||||
|
|
||||||
|
Here are a few suggestions:
|
||||||
|
|
||||||
|
- Checksum class wrappers around adler32() and crc32(), similar
|
||||||
|
to the Java classes that implement the java.util.zip.Checksum
|
||||||
|
interface.
|
||||||
|
|
||||||
|
- The ability to read and write raw deflate streams, without the
|
||||||
|
zlib stream header and trailer. Raw deflate streams are used
|
||||||
|
in the ZIP file format.
|
||||||
|
|
||||||
|
- The ability to read and write gzip streams, used in the GZIP
|
||||||
|
file format, and normally produced by the gzip program.
|
||||||
|
|
||||||
|
- The ability to select a different compression strategy, useful
|
||||||
|
to PNG and MNG image compression, and to multimedia compression
|
||||||
|
in general. Besides the compression level
|
||||||
|
|
||||||
|
TCompressionLevel = (clNone, clFastest, clDefault, clMax);
|
||||||
|
|
||||||
|
which, in fact, could have used the 'z' prefix and avoided
|
||||||
|
TColor-like symbols
|
||||||
|
|
||||||
|
TCompressionLevel = (zcNone, zcFastest, zcDefault, zcMax);
|
||||||
|
|
||||||
|
there could be a compression strategy
|
||||||
|
|
||||||
|
TCompressionStrategy = (zsDefault, zsFiltered, zsHuffmanOnly, zsRle);
|
||||||
|
|
||||||
|
- ZIP and GZIP stream handling via TStreams.
|
||||||
|
|
||||||
|
|
||||||
|
--
|
||||||
|
Cosmin Truta <cosmint@cs.ubbcluj.ro>
|
||||||
99
contrib/delphi/zlibd32.mak
Normal file
99
contrib/delphi/zlibd32.mak
Normal file
@@ -0,0 +1,99 @@
|
|||||||
|
# Makefile for zlib
|
||||||
|
# For use with Delphi and C++ Builder under Win32
|
||||||
|
# Updated for zlib 1.2.x by Cosmin Truta
|
||||||
|
|
||||||
|
# ------------ Borland C++ ------------
|
||||||
|
|
||||||
|
# This project uses the Delphi (fastcall/register) calling convention:
|
||||||
|
LOC = -DZEXPORT=__fastcall -DZEXPORTVA=__cdecl
|
||||||
|
|
||||||
|
CC = bcc32
|
||||||
|
LD = bcc32
|
||||||
|
AR = tlib
|
||||||
|
# do not use "-pr" in CFLAGS
|
||||||
|
CFLAGS = -a -d -k- -O2 $(LOC)
|
||||||
|
LDFLAGS =
|
||||||
|
|
||||||
|
|
||||||
|
# variables
|
||||||
|
ZLIB_LIB = zlib.lib
|
||||||
|
|
||||||
|
OBJ1 = adler32.obj compress.obj crc32.obj deflate.obj gzclose.obj gzlib.obj gzread.obj
|
||||||
|
OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
|
||||||
|
OBJP1 = +adler32.obj+compress.obj+crc32.obj+deflate.obj+gzclose.obj+gzlib.obj+gzread.obj
|
||||||
|
OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
|
||||||
|
|
||||||
|
|
||||||
|
# targets
|
||||||
|
all: $(ZLIB_LIB) example.exe minigzip.exe
|
||||||
|
|
||||||
|
.c.obj:
|
||||||
|
$(CC) -c $(CFLAGS) $*.c
|
||||||
|
|
||||||
|
adler32.obj: adler32.c zlib.h zconf.h
|
||||||
|
|
||||||
|
compress.obj: compress.c zlib.h zconf.h
|
||||||
|
|
||||||
|
crc32.obj: crc32.c zlib.h zconf.h crc32.h
|
||||||
|
|
||||||
|
deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
|
||||||
|
|
||||||
|
gzclose.obj: gzclose.c zlib.h zconf.h gzguts.h
|
||||||
|
|
||||||
|
gzlib.obj: gzlib.c zlib.h zconf.h gzguts.h
|
||||||
|
|
||||||
|
gzread.obj: gzread.c zlib.h zconf.h gzguts.h
|
||||||
|
|
||||||
|
gzwrite.obj: gzwrite.c zlib.h zconf.h gzguts.h
|
||||||
|
|
||||||
|
infback.obj: infback.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
|
||||||
|
inffast.h inffixed.h
|
||||||
|
|
||||||
|
inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
|
||||||
|
inffast.h
|
||||||
|
|
||||||
|
inflate.obj: inflate.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
|
||||||
|
inffast.h inffixed.h
|
||||||
|
|
||||||
|
inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
|
||||||
|
|
||||||
|
trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
||||||
|
|
||||||
|
uncompr.obj: uncompr.c zlib.h zconf.h
|
||||||
|
|
||||||
|
zutil.obj: zutil.c zutil.h zlib.h zconf.h
|
||||||
|
|
||||||
|
example.obj: test/example.c zlib.h zconf.h
|
||||||
|
|
||||||
|
minigzip.obj: test/minigzip.c zlib.h zconf.h
|
||||||
|
|
||||||
|
|
||||||
|
# For the sake of the old Borland make,
|
||||||
|
# the command line is cut to fit in the MS-DOS 128 byte limit:
|
||||||
|
$(ZLIB_LIB): $(OBJ1) $(OBJ2)
|
||||||
|
-del $(ZLIB_LIB)
|
||||||
|
$(AR) $(ZLIB_LIB) $(OBJP1)
|
||||||
|
$(AR) $(ZLIB_LIB) $(OBJP2)
|
||||||
|
|
||||||
|
|
||||||
|
# testing
|
||||||
|
test: example.exe minigzip.exe
|
||||||
|
example
|
||||||
|
echo hello world | minigzip | minigzip -d
|
||||||
|
|
||||||
|
example.exe: example.obj $(ZLIB_LIB)
|
||||||
|
$(LD) $(LDFLAGS) example.obj $(ZLIB_LIB)
|
||||||
|
|
||||||
|
minigzip.exe: minigzip.obj $(ZLIB_LIB)
|
||||||
|
$(LD) $(LDFLAGS) minigzip.obj $(ZLIB_LIB)
|
||||||
|
|
||||||
|
|
||||||
|
# cleanup
|
||||||
|
clean:
|
||||||
|
-del *.obj
|
||||||
|
-del *.exe
|
||||||
|
-del *.lib
|
||||||
|
-del *.tds
|
||||||
|
-del zlib.bak
|
||||||
|
-del foo.gz
|
||||||
|
|
||||||
33
contrib/dotzlib/DotZLib.build
Normal file
33
contrib/dotzlib/DotZLib.build
Normal file
@@ -0,0 +1,33 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8" ?>
|
||||||
|
<project name="DotZLib" default="build" basedir="./DotZLib">
|
||||||
|
<description>A .Net wrapper library around ZLib1.dll</description>
|
||||||
|
|
||||||
|
<property name="nunit.location" value="c:/program files/NUnit V2.1/bin" />
|
||||||
|
<property name="build.root" value="bin" />
|
||||||
|
|
||||||
|
<property name="debug" value="true" />
|
||||||
|
<property name="nunit" value="true" />
|
||||||
|
|
||||||
|
<property name="build.folder" value="${build.root}/debug/" if="${debug}" />
|
||||||
|
<property name="build.folder" value="${build.root}/release/" unless="${debug}" />
|
||||||
|
|
||||||
|
<target name="clean" description="Remove all generated files">
|
||||||
|
<delete dir="${build.root}" failonerror="false" />
|
||||||
|
</target>
|
||||||
|
|
||||||
|
<target name="build" description="compiles the source code">
|
||||||
|
|
||||||
|
<mkdir dir="${build.folder}" />
|
||||||
|
<csc target="library" output="${build.folder}DotZLib.dll" debug="${debug}">
|
||||||
|
<references basedir="${nunit.location}">
|
||||||
|
<includes if="${nunit}" name="nunit.framework.dll" />
|
||||||
|
</references>
|
||||||
|
<sources>
|
||||||
|
<includes name="*.cs" />
|
||||||
|
<excludes name="UnitTests.cs" unless="${nunit}" />
|
||||||
|
</sources>
|
||||||
|
<arg value="/d:nunit" if="${nunit}" />
|
||||||
|
</csc>
|
||||||
|
</target>
|
||||||
|
|
||||||
|
</project>
|
||||||
BIN
contrib/dotzlib/DotZLib.chm
Normal file
BIN
contrib/dotzlib/DotZLib.chm
Normal file
Binary file not shown.
21
contrib/dotzlib/DotZLib.sln
Normal file
21
contrib/dotzlib/DotZLib.sln
Normal file
@@ -0,0 +1,21 @@
|
|||||||
|
Microsoft Visual Studio Solution File, Format Version 8.00
|
||||||
|
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "DotZLib", "DotZLib\DotZLib.csproj", "{BB1EE0B1-1808-46CB-B786-949D91117FC5}"
|
||||||
|
ProjectSection(ProjectDependencies) = postProject
|
||||||
|
EndProjectSection
|
||||||
|
EndProject
|
||||||
|
Global
|
||||||
|
GlobalSection(SolutionConfiguration) = preSolution
|
||||||
|
Debug = Debug
|
||||||
|
Release = Release
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ProjectConfiguration) = postSolution
|
||||||
|
{BB1EE0B1-1808-46CB-B786-949D91117FC5}.Debug.ActiveCfg = Debug|.NET
|
||||||
|
{BB1EE0B1-1808-46CB-B786-949D91117FC5}.Debug.Build.0 = Debug|.NET
|
||||||
|
{BB1EE0B1-1808-46CB-B786-949D91117FC5}.Release.ActiveCfg = Release|.NET
|
||||||
|
{BB1EE0B1-1808-46CB-B786-949D91117FC5}.Release.Build.0 = Release|.NET
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ExtensibilityGlobals) = postSolution
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ExtensibilityAddIns) = postSolution
|
||||||
|
EndGlobalSection
|
||||||
|
EndGlobal
|
||||||
58
contrib/dotzlib/DotZLib/AssemblyInfo.cs
Normal file
58
contrib/dotzlib/DotZLib/AssemblyInfo.cs
Normal file
@@ -0,0 +1,58 @@
|
|||||||
|
using System.Reflection;
|
||||||
|
using System.Runtime.CompilerServices;
|
||||||
|
|
||||||
|
//
|
||||||
|
// General Information about an assembly is controlled through the following
|
||||||
|
// set of attributes. Change these attribute values to modify the information
|
||||||
|
// associated with an assembly.
|
||||||
|
//
|
||||||
|
[assembly: AssemblyTitle("DotZLib")]
|
||||||
|
[assembly: AssemblyDescription(".Net bindings for ZLib compression dll 1.2.x")]
|
||||||
|
[assembly: AssemblyConfiguration("")]
|
||||||
|
[assembly: AssemblyCompany("Henrik Ravn")]
|
||||||
|
[assembly: AssemblyProduct("")]
|
||||||
|
[assembly: AssemblyCopyright("(c) 2004 by Henrik Ravn")]
|
||||||
|
[assembly: AssemblyTrademark("")]
|
||||||
|
[assembly: AssemblyCulture("")]
|
||||||
|
|
||||||
|
//
|
||||||
|
// Version information for an assembly consists of the following four values:
|
||||||
|
//
|
||||||
|
// Major Version
|
||||||
|
// Minor Version
|
||||||
|
// Build Number
|
||||||
|
// Revision
|
||||||
|
//
|
||||||
|
// You can specify all the values or you can default the Revision and Build Numbers
|
||||||
|
// by using the '*' as shown below:
|
||||||
|
|
||||||
|
[assembly: AssemblyVersion("1.0.*")]
|
||||||
|
|
||||||
|
//
|
||||||
|
// In order to sign your assembly you must specify a key to use. Refer to the
|
||||||
|
// Microsoft .NET Framework documentation for more information on assembly signing.
|
||||||
|
//
|
||||||
|
// Use the attributes below to control which key is used for signing.
|
||||||
|
//
|
||||||
|
// Notes:
|
||||||
|
// (*) If no key is specified, the assembly is not signed.
|
||||||
|
// (*) KeyName refers to a key that has been installed in the Crypto Service
|
||||||
|
// Provider (CSP) on your machine. KeyFile refers to a file which contains
|
||||||
|
// a key.
|
||||||
|
// (*) If the KeyFile and the KeyName values are both specified, the
|
||||||
|
// following processing occurs:
|
||||||
|
// (1) If the KeyName can be found in the CSP, that key is used.
|
||||||
|
// (2) If the KeyName does not exist and the KeyFile does exist, the key
|
||||||
|
// in the KeyFile is installed into the CSP and used.
|
||||||
|
// (*) In order to create a KeyFile, you can use the sn.exe (Strong Name) utility.
|
||||||
|
// When specifying the KeyFile, the location of the KeyFile should be
|
||||||
|
// relative to the project output directory which is
|
||||||
|
// %Project Directory%\obj\<configuration>. For example, if your KeyFile is
|
||||||
|
// located in the project directory, you would specify the AssemblyKeyFile
|
||||||
|
// attribute as [assembly: AssemblyKeyFile("..\\..\\mykey.snk")]
|
||||||
|
// (*) Delay Signing is an advanced option - see the Microsoft .NET Framework
|
||||||
|
// documentation for more information on this.
|
||||||
|
//
|
||||||
|
[assembly: AssemblyDelaySign(false)]
|
||||||
|
[assembly: AssemblyKeyFile("")]
|
||||||
|
[assembly: AssemblyKeyName("")]
|
||||||
202
contrib/dotzlib/DotZLib/ChecksumImpl.cs
Normal file
202
contrib/dotzlib/DotZLib/ChecksumImpl.cs
Normal file
@@ -0,0 +1,202 @@
|
|||||||
|
//
|
||||||
|
// <20> Copyright Henrik Ravn 2004
|
||||||
|
//
|
||||||
|
// Use, modification and distribution are subject to the Boost Software License, Version 1.0.
|
||||||
|
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
using System;
|
||||||
|
using System.Runtime.InteropServices;
|
||||||
|
using System.Text;
|
||||||
|
|
||||||
|
|
||||||
|
namespace DotZLib
|
||||||
|
{
|
||||||
|
#region ChecksumGeneratorBase
|
||||||
|
/// <summary>
|
||||||
|
/// Implements the common functionality needed for all <see cref="ChecksumGenerator"/>s
|
||||||
|
/// </summary>
|
||||||
|
/// <example></example>
|
||||||
|
public abstract class ChecksumGeneratorBase : ChecksumGenerator
|
||||||
|
{
|
||||||
|
/// <summary>
|
||||||
|
/// The value of the current checksum
|
||||||
|
/// </summary>
|
||||||
|
protected uint _current;
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Initializes a new instance of the checksum generator base - the current checksum is
|
||||||
|
/// set to zero
|
||||||
|
/// </summary>
|
||||||
|
public ChecksumGeneratorBase()
|
||||||
|
{
|
||||||
|
_current = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Initializes a new instance of the checksum generator basewith a specified value
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="initialValue">The value to set the current checksum to</param>
|
||||||
|
public ChecksumGeneratorBase(uint initialValue)
|
||||||
|
{
|
||||||
|
_current = initialValue;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Resets the current checksum to zero
|
||||||
|
/// </summary>
|
||||||
|
public void Reset() { _current = 0; }
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the current checksum value
|
||||||
|
/// </summary>
|
||||||
|
public uint Value { get { return _current; } }
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with part of an array of bytes
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The data to update the checksum with</param>
|
||||||
|
/// <param name="offset">Where in <c>data</c> to start updating</param>
|
||||||
|
/// <param name="count">The number of bytes from <c>data</c> to use</param>
|
||||||
|
/// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
|
||||||
|
/// <exception cref="NullReferenceException"><c>data</c> is a null reference</exception>
|
||||||
|
/// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
|
||||||
|
/// <remarks>All the other <c>Update</c> methods are implmeneted in terms of this one.
|
||||||
|
/// This is therefore the only method a derived class has to implement</remarks>
|
||||||
|
public abstract void Update(byte[] data, int offset, int count);
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with an array of bytes.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The data to update the checksum with</param>
|
||||||
|
public void Update(byte[] data)
|
||||||
|
{
|
||||||
|
Update(data, 0, data.Length);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with the data from a string
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The string to update the checksum with</param>
|
||||||
|
/// <remarks>The characters in the string are converted by the UTF-8 encoding</remarks>
|
||||||
|
public void Update(string data)
|
||||||
|
{
|
||||||
|
Update(Encoding.UTF8.GetBytes(data));
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with the data from a string, using a specific encoding
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The string to update the checksum with</param>
|
||||||
|
/// <param name="encoding">The encoding to use</param>
|
||||||
|
public void Update(string data, Encoding encoding)
|
||||||
|
{
|
||||||
|
Update(encoding.GetBytes(data));
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region CRC32
|
||||||
|
/// <summary>
|
||||||
|
/// Implements a CRC32 checksum generator
|
||||||
|
/// </summary>
|
||||||
|
public sealed class CRC32Checksum : ChecksumGeneratorBase
|
||||||
|
{
|
||||||
|
#region DLL imports
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern uint crc32(uint crc, int data, uint length);
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Initializes a new instance of the CRC32 checksum generator
|
||||||
|
/// </summary>
|
||||||
|
public CRC32Checksum() : base() {}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Initializes a new instance of the CRC32 checksum generator with a specified value
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="initialValue">The value to set the current checksum to</param>
|
||||||
|
public CRC32Checksum(uint initialValue) : base(initialValue) {}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with part of an array of bytes
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The data to update the checksum with</param>
|
||||||
|
/// <param name="offset">Where in <c>data</c> to start updating</param>
|
||||||
|
/// <param name="count">The number of bytes from <c>data</c> to use</param>
|
||||||
|
/// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
|
||||||
|
/// <exception cref="NullReferenceException"><c>data</c> is a null reference</exception>
|
||||||
|
/// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
|
||||||
|
public override void Update(byte[] data, int offset, int count)
|
||||||
|
{
|
||||||
|
if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
|
||||||
|
if ((offset+count) > data.Length) throw new ArgumentException();
|
||||||
|
GCHandle hData = GCHandle.Alloc(data, GCHandleType.Pinned);
|
||||||
|
try
|
||||||
|
{
|
||||||
|
_current = crc32(_current, hData.AddrOfPinnedObject().ToInt32()+offset, (uint)count);
|
||||||
|
}
|
||||||
|
finally
|
||||||
|
{
|
||||||
|
hData.Free();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Adler
|
||||||
|
/// <summary>
|
||||||
|
/// Implements a checksum generator that computes the Adler checksum on data
|
||||||
|
/// </summary>
|
||||||
|
public sealed class AdlerChecksum : ChecksumGeneratorBase
|
||||||
|
{
|
||||||
|
#region DLL imports
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern uint adler32(uint adler, int data, uint length);
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Initializes a new instance of the Adler checksum generator
|
||||||
|
/// </summary>
|
||||||
|
public AdlerChecksum() : base() {}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Initializes a new instance of the Adler checksum generator with a specified value
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="initialValue">The value to set the current checksum to</param>
|
||||||
|
public AdlerChecksum(uint initialValue) : base(initialValue) {}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with part of an array of bytes
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The data to update the checksum with</param>
|
||||||
|
/// <param name="offset">Where in <c>data</c> to start updating</param>
|
||||||
|
/// <param name="count">The number of bytes from <c>data</c> to use</param>
|
||||||
|
/// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
|
||||||
|
/// <exception cref="NullReferenceException"><c>data</c> is a null reference</exception>
|
||||||
|
/// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
|
||||||
|
public override void Update(byte[] data, int offset, int count)
|
||||||
|
{
|
||||||
|
if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
|
||||||
|
if ((offset+count) > data.Length) throw new ArgumentException();
|
||||||
|
GCHandle hData = GCHandle.Alloc(data, GCHandleType.Pinned);
|
||||||
|
try
|
||||||
|
{
|
||||||
|
_current = adler32(_current, hData.AddrOfPinnedObject().ToInt32()+offset, (uint)count);
|
||||||
|
}
|
||||||
|
finally
|
||||||
|
{
|
||||||
|
hData.Free();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
}
|
||||||
83
contrib/dotzlib/DotZLib/CircularBuffer.cs
Normal file
83
contrib/dotzlib/DotZLib/CircularBuffer.cs
Normal file
@@ -0,0 +1,83 @@
|
|||||||
|
//
|
||||||
|
// <20> Copyright Henrik Ravn 2004
|
||||||
|
//
|
||||||
|
// Use, modification and distribution are subject to the Boost Software License, Version 1.0.
|
||||||
|
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
using System;
|
||||||
|
using System.Diagnostics;
|
||||||
|
|
||||||
|
namespace DotZLib
|
||||||
|
{
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// This class implements a circular buffer
|
||||||
|
/// </summary>
|
||||||
|
internal class CircularBuffer
|
||||||
|
{
|
||||||
|
#region Private data
|
||||||
|
private int _capacity;
|
||||||
|
private int _head;
|
||||||
|
private int _tail;
|
||||||
|
private int _size;
|
||||||
|
private byte[] _buffer;
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
public CircularBuffer(int capacity)
|
||||||
|
{
|
||||||
|
Debug.Assert( capacity > 0 );
|
||||||
|
_buffer = new byte[capacity];
|
||||||
|
_capacity = capacity;
|
||||||
|
_head = 0;
|
||||||
|
_tail = 0;
|
||||||
|
_size = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
public int Size { get { return _size; } }
|
||||||
|
|
||||||
|
public int Put(byte[] source, int offset, int count)
|
||||||
|
{
|
||||||
|
Debug.Assert( count > 0 );
|
||||||
|
int trueCount = Math.Min(count, _capacity - Size);
|
||||||
|
for (int i = 0; i < trueCount; ++i)
|
||||||
|
_buffer[(_tail+i) % _capacity] = source[offset+i];
|
||||||
|
_tail += trueCount;
|
||||||
|
_tail %= _capacity;
|
||||||
|
_size += trueCount;
|
||||||
|
return trueCount;
|
||||||
|
}
|
||||||
|
|
||||||
|
public bool Put(byte b)
|
||||||
|
{
|
||||||
|
if (Size == _capacity) // no room
|
||||||
|
return false;
|
||||||
|
_buffer[_tail++] = b;
|
||||||
|
_tail %= _capacity;
|
||||||
|
++_size;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
public int Get(byte[] destination, int offset, int count)
|
||||||
|
{
|
||||||
|
int trueCount = Math.Min(count,Size);
|
||||||
|
for (int i = 0; i < trueCount; ++i)
|
||||||
|
destination[offset + i] = _buffer[(_head+i) % _capacity];
|
||||||
|
_head += trueCount;
|
||||||
|
_head %= _capacity;
|
||||||
|
_size -= trueCount;
|
||||||
|
return trueCount;
|
||||||
|
}
|
||||||
|
|
||||||
|
public int Get()
|
||||||
|
{
|
||||||
|
if (Size == 0)
|
||||||
|
return -1;
|
||||||
|
|
||||||
|
int result = (int)_buffer[_head++ % _capacity];
|
||||||
|
--_size;
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
198
contrib/dotzlib/DotZLib/CodecBase.cs
Normal file
198
contrib/dotzlib/DotZLib/CodecBase.cs
Normal file
@@ -0,0 +1,198 @@
|
|||||||
|
//
|
||||||
|
// <20> Copyright Henrik Ravn 2004
|
||||||
|
//
|
||||||
|
// Use, modification and distribution are subject to the Boost Software License, Version 1.0.
|
||||||
|
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
using System;
|
||||||
|
using System.Runtime.InteropServices;
|
||||||
|
|
||||||
|
namespace DotZLib
|
||||||
|
{
|
||||||
|
/// <summary>
|
||||||
|
/// Implements the common functionality needed for all <see cref="Codec"/>s
|
||||||
|
/// </summary>
|
||||||
|
public abstract class CodecBase : Codec, IDisposable
|
||||||
|
{
|
||||||
|
|
||||||
|
#region Data members
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Instance of the internal zlib buffer structure that is
|
||||||
|
/// passed to all functions in the zlib dll
|
||||||
|
/// </summary>
|
||||||
|
internal ZStream _ztream = new ZStream();
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// True if the object instance has been disposed, false otherwise
|
||||||
|
/// </summary>
|
||||||
|
protected bool _isDisposed = false;
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// The size of the internal buffers
|
||||||
|
/// </summary>
|
||||||
|
protected const int kBufferSize = 16384;
|
||||||
|
|
||||||
|
private byte[] _outBuffer = new byte[kBufferSize];
|
||||||
|
private byte[] _inBuffer = new byte[kBufferSize];
|
||||||
|
|
||||||
|
private GCHandle _hInput;
|
||||||
|
private GCHandle _hOutput;
|
||||||
|
|
||||||
|
private uint _checksum = 0;
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Initializes a new instance of the <c>CodeBase</c> class.
|
||||||
|
/// </summary>
|
||||||
|
public CodecBase()
|
||||||
|
{
|
||||||
|
try
|
||||||
|
{
|
||||||
|
_hInput = GCHandle.Alloc(_inBuffer, GCHandleType.Pinned);
|
||||||
|
_hOutput = GCHandle.Alloc(_outBuffer, GCHandleType.Pinned);
|
||||||
|
}
|
||||||
|
catch (Exception)
|
||||||
|
{
|
||||||
|
CleanUp(false);
|
||||||
|
throw;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
#region Codec Members
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Occurs when more processed data are available.
|
||||||
|
/// </summary>
|
||||||
|
public event DataAvailableHandler DataAvailable;
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Fires the <see cref="DataAvailable"/> event
|
||||||
|
/// </summary>
|
||||||
|
protected void OnDataAvailable()
|
||||||
|
{
|
||||||
|
if (_ztream.total_out > 0)
|
||||||
|
{
|
||||||
|
if (DataAvailable != null)
|
||||||
|
DataAvailable( _outBuffer, 0, (int)_ztream.total_out);
|
||||||
|
resetOutput();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Adds more data to the codec to be processed.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">Byte array containing the data to be added to the codec</param>
|
||||||
|
/// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
|
||||||
|
public void Add(byte[] data)
|
||||||
|
{
|
||||||
|
Add(data,0,data.Length);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Adds more data to the codec to be processed.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">Byte array containing the data to be added to the codec</param>
|
||||||
|
/// <param name="offset">The index of the first byte to add from <c>data</c></param>
|
||||||
|
/// <param name="count">The number of bytes to add</param>
|
||||||
|
/// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
|
||||||
|
/// <remarks>This must be implemented by a derived class</remarks>
|
||||||
|
public abstract void Add(byte[] data, int offset, int count);
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Finishes up any pending data that needs to be processed and handled.
|
||||||
|
/// </summary>
|
||||||
|
/// <remarks>This must be implemented by a derived class</remarks>
|
||||||
|
public abstract void Finish();
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the checksum of the data that has been added so far
|
||||||
|
/// </summary>
|
||||||
|
public uint Checksum { get { return _checksum; } }
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Destructor & IDisposable stuff
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Destroys this instance
|
||||||
|
/// </summary>
|
||||||
|
~CodecBase()
|
||||||
|
{
|
||||||
|
CleanUp(false);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Releases any unmanaged resources and calls the <see cref="CleanUp()"/> method of the derived class
|
||||||
|
/// </summary>
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
CleanUp(true);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Performs any codec specific cleanup
|
||||||
|
/// </summary>
|
||||||
|
/// <remarks>This must be implemented by a derived class</remarks>
|
||||||
|
protected abstract void CleanUp();
|
||||||
|
|
||||||
|
// performs the release of the handles and calls the dereived CleanUp()
|
||||||
|
private void CleanUp(bool isDisposing)
|
||||||
|
{
|
||||||
|
if (!_isDisposed)
|
||||||
|
{
|
||||||
|
CleanUp();
|
||||||
|
if (_hInput.IsAllocated)
|
||||||
|
_hInput.Free();
|
||||||
|
if (_hOutput.IsAllocated)
|
||||||
|
_hOutput.Free();
|
||||||
|
|
||||||
|
_isDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Helper methods
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Copies a number of bytes to the internal codec buffer - ready for proccesing
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The byte array that contains the data to copy</param>
|
||||||
|
/// <param name="startIndex">The index of the first byte to copy</param>
|
||||||
|
/// <param name="count">The number of bytes to copy from <c>data</c></param>
|
||||||
|
protected void copyInput(byte[] data, int startIndex, int count)
|
||||||
|
{
|
||||||
|
Array.Copy(data, startIndex, _inBuffer,0, count);
|
||||||
|
_ztream.next_in = _hInput.AddrOfPinnedObject();
|
||||||
|
_ztream.total_in = 0;
|
||||||
|
_ztream.avail_in = (uint)count;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Resets the internal output buffers to a known state - ready for processing
|
||||||
|
/// </summary>
|
||||||
|
protected void resetOutput()
|
||||||
|
{
|
||||||
|
_ztream.total_out = 0;
|
||||||
|
_ztream.avail_out = kBufferSize;
|
||||||
|
_ztream.next_out = _hOutput.AddrOfPinnedObject();
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the running checksum property
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="newSum">The new checksum value</param>
|
||||||
|
protected void setChecksum(uint newSum)
|
||||||
|
{
|
||||||
|
_checksum = newSum;
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
106
contrib/dotzlib/DotZLib/Deflater.cs
Normal file
106
contrib/dotzlib/DotZLib/Deflater.cs
Normal file
@@ -0,0 +1,106 @@
|
|||||||
|
//
|
||||||
|
// <20> Copyright Henrik Ravn 2004
|
||||||
|
//
|
||||||
|
// Use, modification and distribution are subject to the Boost Software License, Version 1.0.
|
||||||
|
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
using System;
|
||||||
|
using System.Diagnostics;
|
||||||
|
using System.Runtime.InteropServices;
|
||||||
|
|
||||||
|
namespace DotZLib
|
||||||
|
{
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Implements a data compressor, using the deflate algorithm in the ZLib dll
|
||||||
|
/// </summary>
|
||||||
|
public sealed class Deflater : CodecBase
|
||||||
|
{
|
||||||
|
#region Dll imports
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl, CharSet=CharSet.Ansi)]
|
||||||
|
private static extern int deflateInit_(ref ZStream sz, int level, string vs, int size);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int deflate(ref ZStream sz, int flush);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int deflateReset(ref ZStream sz);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int deflateEnd(ref ZStream sz);
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Constructs an new instance of the <c>Deflater</c>
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="level">The compression level to use for this <c>Deflater</c></param>
|
||||||
|
public Deflater(CompressLevel level) : base()
|
||||||
|
{
|
||||||
|
int retval = deflateInit_(ref _ztream, (int)level, Info.Version, Marshal.SizeOf(_ztream));
|
||||||
|
if (retval != 0)
|
||||||
|
throw new ZLibException(retval, "Could not initialize deflater");
|
||||||
|
|
||||||
|
resetOutput();
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Adds more data to the codec to be processed.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">Byte array containing the data to be added to the codec</param>
|
||||||
|
/// <param name="offset">The index of the first byte to add from <c>data</c></param>
|
||||||
|
/// <param name="count">The number of bytes to add</param>
|
||||||
|
/// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
|
||||||
|
public override void Add(byte[] data, int offset, int count)
|
||||||
|
{
|
||||||
|
if (data == null) throw new ArgumentNullException();
|
||||||
|
if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
|
||||||
|
if ((offset+count) > data.Length) throw new ArgumentException();
|
||||||
|
|
||||||
|
int total = count;
|
||||||
|
int inputIndex = offset;
|
||||||
|
int err = 0;
|
||||||
|
|
||||||
|
while (err >= 0 && inputIndex < total)
|
||||||
|
{
|
||||||
|
copyInput(data, inputIndex, Math.Min(total - inputIndex, kBufferSize));
|
||||||
|
while (err >= 0 && _ztream.avail_in > 0)
|
||||||
|
{
|
||||||
|
err = deflate(ref _ztream, (int)FlushTypes.None);
|
||||||
|
if (err == 0)
|
||||||
|
while (_ztream.avail_out == 0)
|
||||||
|
{
|
||||||
|
OnDataAvailable();
|
||||||
|
err = deflate(ref _ztream, (int)FlushTypes.None);
|
||||||
|
}
|
||||||
|
inputIndex += (int)_ztream.total_in;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
setChecksum( _ztream.adler );
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Finishes up any pending data that needs to be processed and handled.
|
||||||
|
/// </summary>
|
||||||
|
public override void Finish()
|
||||||
|
{
|
||||||
|
int err;
|
||||||
|
do
|
||||||
|
{
|
||||||
|
err = deflate(ref _ztream, (int)FlushTypes.Finish);
|
||||||
|
OnDataAvailable();
|
||||||
|
}
|
||||||
|
while (err == 0);
|
||||||
|
setChecksum( _ztream.adler );
|
||||||
|
deflateReset(ref _ztream);
|
||||||
|
resetOutput();
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Closes the internal zlib deflate stream
|
||||||
|
/// </summary>
|
||||||
|
protected override void CleanUp() { deflateEnd(ref _ztream); }
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
288
contrib/dotzlib/DotZLib/DotZLib.cs
Normal file
288
contrib/dotzlib/DotZLib/DotZLib.cs
Normal file
@@ -0,0 +1,288 @@
|
|||||||
|
//
|
||||||
|
// <20> Copyright Henrik Ravn 2004
|
||||||
|
//
|
||||||
|
// Use, modification and distribution are subject to the Boost Software License, Version 1.0.
|
||||||
|
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
using System;
|
||||||
|
using System.IO;
|
||||||
|
using System.Runtime.InteropServices;
|
||||||
|
using System.Text;
|
||||||
|
|
||||||
|
|
||||||
|
namespace DotZLib
|
||||||
|
{
|
||||||
|
|
||||||
|
#region Internal types
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Defines constants for the various flush types used with zlib
|
||||||
|
/// </summary>
|
||||||
|
internal enum FlushTypes
|
||||||
|
{
|
||||||
|
None, Partial, Sync, Full, Finish, Block
|
||||||
|
}
|
||||||
|
|
||||||
|
#region ZStream structure
|
||||||
|
// internal mapping of the zlib zstream structure for marshalling
|
||||||
|
[StructLayoutAttribute(LayoutKind.Sequential, Pack=4, Size=0, CharSet=CharSet.Ansi)]
|
||||||
|
internal struct ZStream
|
||||||
|
{
|
||||||
|
public IntPtr next_in;
|
||||||
|
public uint avail_in;
|
||||||
|
public uint total_in;
|
||||||
|
|
||||||
|
public IntPtr next_out;
|
||||||
|
public uint avail_out;
|
||||||
|
public uint total_out;
|
||||||
|
|
||||||
|
[MarshalAs(UnmanagedType.LPStr)]
|
||||||
|
string msg;
|
||||||
|
uint state;
|
||||||
|
|
||||||
|
uint zalloc;
|
||||||
|
uint zfree;
|
||||||
|
uint opaque;
|
||||||
|
|
||||||
|
int data_type;
|
||||||
|
public uint adler;
|
||||||
|
uint reserved;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Public enums
|
||||||
|
/// <summary>
|
||||||
|
/// Defines constants for the available compression levels in zlib
|
||||||
|
/// </summary>
|
||||||
|
public enum CompressLevel : int
|
||||||
|
{
|
||||||
|
/// <summary>
|
||||||
|
/// The default compression level with a reasonable compromise between compression and speed
|
||||||
|
/// </summary>
|
||||||
|
Default = -1,
|
||||||
|
/// <summary>
|
||||||
|
/// No compression at all. The data are passed straight through.
|
||||||
|
/// </summary>
|
||||||
|
None = 0,
|
||||||
|
/// <summary>
|
||||||
|
/// The maximum compression rate available.
|
||||||
|
/// </summary>
|
||||||
|
Best = 9,
|
||||||
|
/// <summary>
|
||||||
|
/// The fastest available compression level.
|
||||||
|
/// </summary>
|
||||||
|
Fastest = 1
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Exception classes
|
||||||
|
/// <summary>
|
||||||
|
/// The exception that is thrown when an error occurs on the zlib dll
|
||||||
|
/// </summary>
|
||||||
|
public class ZLibException : ApplicationException
|
||||||
|
{
|
||||||
|
/// <summary>
|
||||||
|
/// Initializes a new instance of the <see cref="ZLibException"/> class with a specified
|
||||||
|
/// error message and error code
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="errorCode">The zlib error code that caused the exception</param>
|
||||||
|
/// <param name="msg">A message that (hopefully) describes the error</param>
|
||||||
|
public ZLibException(int errorCode, string msg) : base(String.Format("ZLib error {0} {1}", errorCode, msg))
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Initializes a new instance of the <see cref="ZLibException"/> class with a specified
|
||||||
|
/// error code
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="errorCode">The zlib error code that caused the exception</param>
|
||||||
|
public ZLibException(int errorCode) : base(String.Format("ZLib error {0}", errorCode))
|
||||||
|
{
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Interfaces
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Declares methods and properties that enables a running checksum to be calculated
|
||||||
|
/// </summary>
|
||||||
|
public interface ChecksumGenerator
|
||||||
|
{
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the current value of the checksum
|
||||||
|
/// </summary>
|
||||||
|
uint Value { get; }
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Clears the current checksum to 0
|
||||||
|
/// </summary>
|
||||||
|
void Reset();
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with an array of bytes
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The data to update the checksum with</param>
|
||||||
|
void Update(byte[] data);
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with part of an array of bytes
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The data to update the checksum with</param>
|
||||||
|
/// <param name="offset">Where in <c>data</c> to start updating</param>
|
||||||
|
/// <param name="count">The number of bytes from <c>data</c> to use</param>
|
||||||
|
/// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
|
||||||
|
/// <exception cref="ArgumentNullException"><c>data</c> is a null reference</exception>
|
||||||
|
/// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
|
||||||
|
void Update(byte[] data, int offset, int count);
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with the data from a string
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The string to update the checksum with</param>
|
||||||
|
/// <remarks>The characters in the string are converted by the UTF-8 encoding</remarks>
|
||||||
|
void Update(string data);
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Updates the current checksum with the data from a string, using a specific encoding
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">The string to update the checksum with</param>
|
||||||
|
/// <param name="encoding">The encoding to use</param>
|
||||||
|
void Update(string data, Encoding encoding);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Represents the method that will be called from a codec when new data
|
||||||
|
/// are available.
|
||||||
|
/// </summary>
|
||||||
|
/// <paramref name="data">The byte array containing the processed data</paramref>
|
||||||
|
/// <paramref name="startIndex">The index of the first processed byte in <c>data</c></paramref>
|
||||||
|
/// <paramref name="count">The number of processed bytes available</paramref>
|
||||||
|
/// <remarks>On return from this method, the data may be overwritten, so grab it while you can.
|
||||||
|
/// You cannot assume that startIndex will be zero.
|
||||||
|
/// </remarks>
|
||||||
|
public delegate void DataAvailableHandler(byte[] data, int startIndex, int count);
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Declares methods and events for implementing compressors/decompressors
|
||||||
|
/// </summary>
|
||||||
|
public interface Codec
|
||||||
|
{
|
||||||
|
/// <summary>
|
||||||
|
/// Occurs when more processed data are available.
|
||||||
|
/// </summary>
|
||||||
|
event DataAvailableHandler DataAvailable;
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Adds more data to the codec to be processed.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">Byte array containing the data to be added to the codec</param>
|
||||||
|
/// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
|
||||||
|
void Add(byte[] data);
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Adds more data to the codec to be processed.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">Byte array containing the data to be added to the codec</param>
|
||||||
|
/// <param name="offset">The index of the first byte to add from <c>data</c></param>
|
||||||
|
/// <param name="count">The number of bytes to add</param>
|
||||||
|
/// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
|
||||||
|
void Add(byte[] data, int offset, int count);
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Finishes up any pending data that needs to be processed and handled.
|
||||||
|
/// </summary>
|
||||||
|
void Finish();
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the checksum of the data that has been added so far
|
||||||
|
/// </summary>
|
||||||
|
uint Checksum { get; }
|
||||||
|
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Classes
|
||||||
|
/// <summary>
|
||||||
|
/// Encapsulates general information about the ZLib library
|
||||||
|
/// </summary>
|
||||||
|
public class Info
|
||||||
|
{
|
||||||
|
#region DLL imports
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern uint zlibCompileFlags();
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern string zlibVersion();
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Private stuff
|
||||||
|
private uint _flags;
|
||||||
|
|
||||||
|
// helper function that unpacks a bitsize mask
|
||||||
|
private static int bitSize(uint bits)
|
||||||
|
{
|
||||||
|
switch (bits)
|
||||||
|
{
|
||||||
|
case 0: return 16;
|
||||||
|
case 1: return 32;
|
||||||
|
case 2: return 64;
|
||||||
|
}
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Constructs an instance of the <c>Info</c> class.
|
||||||
|
/// </summary>
|
||||||
|
public Info()
|
||||||
|
{
|
||||||
|
_flags = zlibCompileFlags();
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// True if the library is compiled with debug info
|
||||||
|
/// </summary>
|
||||||
|
public bool HasDebugInfo { get { return 0 != (_flags & 0x100); } }
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// True if the library is compiled with assembly optimizations
|
||||||
|
/// </summary>
|
||||||
|
public bool UsesAssemblyCode { get { return 0 != (_flags & 0x200); } }
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the size of the unsigned int that was compiled into Zlib
|
||||||
|
/// </summary>
|
||||||
|
public int SizeOfUInt { get { return bitSize(_flags & 3); } }
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the size of the unsigned long that was compiled into Zlib
|
||||||
|
/// </summary>
|
||||||
|
public int SizeOfULong { get { return bitSize((_flags >> 2) & 3); } }
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the size of the pointers that were compiled into Zlib
|
||||||
|
/// </summary>
|
||||||
|
public int SizeOfPointer { get { return bitSize((_flags >> 4) & 3); } }
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the size of the z_off_t type that was compiled into Zlib
|
||||||
|
/// </summary>
|
||||||
|
public int SizeOfOffset { get { return bitSize((_flags >> 6) & 3); } }
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the version of ZLib as a string, e.g. "1.2.1"
|
||||||
|
/// </summary>
|
||||||
|
public static string Version { get { return zlibVersion(); } }
|
||||||
|
}
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
}
|
||||||
141
contrib/dotzlib/DotZLib/DotZLib.csproj
Normal file
141
contrib/dotzlib/DotZLib/DotZLib.csproj
Normal file
@@ -0,0 +1,141 @@
|
|||||||
|
<VisualStudioProject>
|
||||||
|
<CSHARP
|
||||||
|
ProjectType = "Local"
|
||||||
|
ProductVersion = "7.10.3077"
|
||||||
|
SchemaVersion = "2.0"
|
||||||
|
ProjectGuid = "{BB1EE0B1-1808-46CB-B786-949D91117FC5}"
|
||||||
|
>
|
||||||
|
<Build>
|
||||||
|
<Settings
|
||||||
|
ApplicationIcon = ""
|
||||||
|
AssemblyKeyContainerName = ""
|
||||||
|
AssemblyName = "DotZLib"
|
||||||
|
AssemblyOriginatorKeyFile = ""
|
||||||
|
DefaultClientScript = "JScript"
|
||||||
|
DefaultHTMLPageLayout = "Grid"
|
||||||
|
DefaultTargetSchema = "IE50"
|
||||||
|
DelaySign = "false"
|
||||||
|
OutputType = "Library"
|
||||||
|
PreBuildEvent = ""
|
||||||
|
PostBuildEvent = ""
|
||||||
|
RootNamespace = "DotZLib"
|
||||||
|
RunPostBuildEvent = "OnBuildSuccess"
|
||||||
|
StartupObject = ""
|
||||||
|
>
|
||||||
|
<Config
|
||||||
|
Name = "Debug"
|
||||||
|
AllowUnsafeBlocks = "false"
|
||||||
|
BaseAddress = "285212672"
|
||||||
|
CheckForOverflowUnderflow = "false"
|
||||||
|
ConfigurationOverrideFile = ""
|
||||||
|
DefineConstants = "DEBUG;TRACE"
|
||||||
|
DocumentationFile = "docs\DotZLib.xml"
|
||||||
|
DebugSymbols = "true"
|
||||||
|
FileAlignment = "4096"
|
||||||
|
IncrementalBuild = "false"
|
||||||
|
NoStdLib = "false"
|
||||||
|
NoWarn = "1591"
|
||||||
|
Optimize = "false"
|
||||||
|
OutputPath = "bin\Debug\"
|
||||||
|
RegisterForComInterop = "false"
|
||||||
|
RemoveIntegerChecks = "false"
|
||||||
|
TreatWarningsAsErrors = "false"
|
||||||
|
WarningLevel = "4"
|
||||||
|
/>
|
||||||
|
<Config
|
||||||
|
Name = "Release"
|
||||||
|
AllowUnsafeBlocks = "false"
|
||||||
|
BaseAddress = "285212672"
|
||||||
|
CheckForOverflowUnderflow = "false"
|
||||||
|
ConfigurationOverrideFile = ""
|
||||||
|
DefineConstants = "TRACE"
|
||||||
|
DocumentationFile = "docs\DotZLib.xml"
|
||||||
|
DebugSymbols = "false"
|
||||||
|
FileAlignment = "4096"
|
||||||
|
IncrementalBuild = "false"
|
||||||
|
NoStdLib = "false"
|
||||||
|
NoWarn = ""
|
||||||
|
Optimize = "true"
|
||||||
|
OutputPath = "bin\Release\"
|
||||||
|
RegisterForComInterop = "false"
|
||||||
|
RemoveIntegerChecks = "false"
|
||||||
|
TreatWarningsAsErrors = "false"
|
||||||
|
WarningLevel = "4"
|
||||||
|
/>
|
||||||
|
</Settings>
|
||||||
|
<References>
|
||||||
|
<Reference
|
||||||
|
Name = "System"
|
||||||
|
AssemblyName = "System"
|
||||||
|
HintPath = "C:\WINNT\Microsoft.NET\Framework\v1.1.4322\System.dll"
|
||||||
|
/>
|
||||||
|
<Reference
|
||||||
|
Name = "System.Data"
|
||||||
|
AssemblyName = "System.Data"
|
||||||
|
HintPath = "C:\WINNT\Microsoft.NET\Framework\v1.1.4322\System.Data.dll"
|
||||||
|
/>
|
||||||
|
<Reference
|
||||||
|
Name = "System.XML"
|
||||||
|
AssemblyName = "System.Xml"
|
||||||
|
HintPath = "C:\WINNT\Microsoft.NET\Framework\v1.1.4322\System.XML.dll"
|
||||||
|
/>
|
||||||
|
<Reference
|
||||||
|
Name = "nunit.framework"
|
||||||
|
AssemblyName = "nunit.framework"
|
||||||
|
HintPath = "E:\apps\NUnit V2.1\\bin\nunit.framework.dll"
|
||||||
|
AssemblyFolderKey = "hklm\dn\nunit.framework"
|
||||||
|
/>
|
||||||
|
</References>
|
||||||
|
</Build>
|
||||||
|
<Files>
|
||||||
|
<Include>
|
||||||
|
<File
|
||||||
|
RelPath = "AssemblyInfo.cs"
|
||||||
|
SubType = "Code"
|
||||||
|
BuildAction = "Compile"
|
||||||
|
/>
|
||||||
|
<File
|
||||||
|
RelPath = "ChecksumImpl.cs"
|
||||||
|
SubType = "Code"
|
||||||
|
BuildAction = "Compile"
|
||||||
|
/>
|
||||||
|
<File
|
||||||
|
RelPath = "CircularBuffer.cs"
|
||||||
|
SubType = "Code"
|
||||||
|
BuildAction = "Compile"
|
||||||
|
/>
|
||||||
|
<File
|
||||||
|
RelPath = "CodecBase.cs"
|
||||||
|
SubType = "Code"
|
||||||
|
BuildAction = "Compile"
|
||||||
|
/>
|
||||||
|
<File
|
||||||
|
RelPath = "Deflater.cs"
|
||||||
|
SubType = "Code"
|
||||||
|
BuildAction = "Compile"
|
||||||
|
/>
|
||||||
|
<File
|
||||||
|
RelPath = "DotZLib.cs"
|
||||||
|
SubType = "Code"
|
||||||
|
BuildAction = "Compile"
|
||||||
|
/>
|
||||||
|
<File
|
||||||
|
RelPath = "GZipStream.cs"
|
||||||
|
SubType = "Code"
|
||||||
|
BuildAction = "Compile"
|
||||||
|
/>
|
||||||
|
<File
|
||||||
|
RelPath = "Inflater.cs"
|
||||||
|
SubType = "Code"
|
||||||
|
BuildAction = "Compile"
|
||||||
|
/>
|
||||||
|
<File
|
||||||
|
RelPath = "UnitTests.cs"
|
||||||
|
SubType = "Code"
|
||||||
|
BuildAction = "Compile"
|
||||||
|
/>
|
||||||
|
</Include>
|
||||||
|
</Files>
|
||||||
|
</CSHARP>
|
||||||
|
</VisualStudioProject>
|
||||||
|
|
||||||
301
contrib/dotzlib/DotZLib/GZipStream.cs
Normal file
301
contrib/dotzlib/DotZLib/GZipStream.cs
Normal file
@@ -0,0 +1,301 @@
|
|||||||
|
//
|
||||||
|
// <20> Copyright Henrik Ravn 2004
|
||||||
|
//
|
||||||
|
// Use, modification and distribution are subject to the Boost Software License, Version 1.0.
|
||||||
|
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
using System;
|
||||||
|
using System.IO;
|
||||||
|
using System.Runtime.InteropServices;
|
||||||
|
|
||||||
|
namespace DotZLib
|
||||||
|
{
|
||||||
|
/// <summary>
|
||||||
|
/// Implements a compressed <see cref="Stream"/>, in GZip (.gz) format.
|
||||||
|
/// </summary>
|
||||||
|
public class GZipStream : Stream, IDisposable
|
||||||
|
{
|
||||||
|
#region Dll Imports
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl, CharSet=CharSet.Ansi)]
|
||||||
|
private static extern IntPtr gzopen(string name, string mode);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int gzclose(IntPtr gzFile);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int gzwrite(IntPtr gzFile, int data, int length);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int gzread(IntPtr gzFile, int data, int length);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int gzgetc(IntPtr gzFile);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int gzputc(IntPtr gzFile, int c);
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Private data
|
||||||
|
private IntPtr _gzFile;
|
||||||
|
private bool _isDisposed = false;
|
||||||
|
private bool _isWriting;
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Constructors
|
||||||
|
/// <summary>
|
||||||
|
/// Creates a new file as a writeable GZipStream
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="fileName">The name of the compressed file to create</param>
|
||||||
|
/// <param name="level">The compression level to use when adding data</param>
|
||||||
|
/// <exception cref="ZLibException">If an error occurred in the internal zlib function</exception>
|
||||||
|
public GZipStream(string fileName, CompressLevel level)
|
||||||
|
{
|
||||||
|
_isWriting = true;
|
||||||
|
_gzFile = gzopen(fileName, String.Format("wb{0}", (int)level));
|
||||||
|
if (_gzFile == IntPtr.Zero)
|
||||||
|
throw new ZLibException(-1, "Could not open " + fileName);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Opens an existing file as a readable GZipStream
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="fileName">The name of the file to open</param>
|
||||||
|
/// <exception cref="ZLibException">If an error occurred in the internal zlib function</exception>
|
||||||
|
public GZipStream(string fileName)
|
||||||
|
{
|
||||||
|
_isWriting = false;
|
||||||
|
_gzFile = gzopen(fileName, "rb");
|
||||||
|
if (_gzFile == IntPtr.Zero)
|
||||||
|
throw new ZLibException(-1, "Could not open " + fileName);
|
||||||
|
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Access properties
|
||||||
|
/// <summary>
|
||||||
|
/// Returns true of this stream can be read from, false otherwise
|
||||||
|
/// </summary>
|
||||||
|
public override bool CanRead
|
||||||
|
{
|
||||||
|
get
|
||||||
|
{
|
||||||
|
return !_isWriting;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns false.
|
||||||
|
/// </summary>
|
||||||
|
public override bool CanSeek
|
||||||
|
{
|
||||||
|
get
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns true if this tsream is writeable, false otherwise
|
||||||
|
/// </summary>
|
||||||
|
public override bool CanWrite
|
||||||
|
{
|
||||||
|
get
|
||||||
|
{
|
||||||
|
return _isWriting;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Destructor & IDispose stuff
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Destroys this instance
|
||||||
|
/// </summary>
|
||||||
|
~GZipStream()
|
||||||
|
{
|
||||||
|
cleanUp(false);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Closes the external file handle
|
||||||
|
/// </summary>
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
cleanUp(true);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Does the actual closing of the file handle.
|
||||||
|
private void cleanUp(bool isDisposing)
|
||||||
|
{
|
||||||
|
if (!_isDisposed)
|
||||||
|
{
|
||||||
|
gzclose(_gzFile);
|
||||||
|
_isDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Basic reading and writing
|
||||||
|
/// <summary>
|
||||||
|
/// Attempts to read a number of bytes from the stream.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="buffer">The destination data buffer</param>
|
||||||
|
/// <param name="offset">The index of the first destination byte in <c>buffer</c></param>
|
||||||
|
/// <param name="count">The number of bytes requested</param>
|
||||||
|
/// <returns>The number of bytes read</returns>
|
||||||
|
/// <exception cref="ArgumentNullException">If <c>buffer</c> is null</exception>
|
||||||
|
/// <exception cref="ArgumentOutOfRangeException">If <c>count</c> or <c>offset</c> are negative</exception>
|
||||||
|
/// <exception cref="ArgumentException">If <c>offset</c> + <c>count</c> is > buffer.Length</exception>
|
||||||
|
/// <exception cref="NotSupportedException">If this stream is not readable.</exception>
|
||||||
|
/// <exception cref="ObjectDisposedException">If this stream has been disposed.</exception>
|
||||||
|
public override int Read(byte[] buffer, int offset, int count)
|
||||||
|
{
|
||||||
|
if (!CanRead) throw new NotSupportedException();
|
||||||
|
if (buffer == null) throw new ArgumentNullException();
|
||||||
|
if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
|
||||||
|
if ((offset+count) > buffer.Length) throw new ArgumentException();
|
||||||
|
if (_isDisposed) throw new ObjectDisposedException("GZipStream");
|
||||||
|
|
||||||
|
GCHandle h = GCHandle.Alloc(buffer, GCHandleType.Pinned);
|
||||||
|
int result;
|
||||||
|
try
|
||||||
|
{
|
||||||
|
result = gzread(_gzFile, h.AddrOfPinnedObject().ToInt32() + offset, count);
|
||||||
|
if (result < 0)
|
||||||
|
throw new IOException();
|
||||||
|
}
|
||||||
|
finally
|
||||||
|
{
|
||||||
|
h.Free();
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Attempts to read a single byte from the stream.
|
||||||
|
/// </summary>
|
||||||
|
/// <returns>The byte that was read, or -1 in case of error or End-Of-File</returns>
|
||||||
|
public override int ReadByte()
|
||||||
|
{
|
||||||
|
if (!CanRead) throw new NotSupportedException();
|
||||||
|
if (_isDisposed) throw new ObjectDisposedException("GZipStream");
|
||||||
|
return gzgetc(_gzFile);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Writes a number of bytes to the stream
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="buffer"></param>
|
||||||
|
/// <param name="offset"></param>
|
||||||
|
/// <param name="count"></param>
|
||||||
|
/// <exception cref="ArgumentNullException">If <c>buffer</c> is null</exception>
|
||||||
|
/// <exception cref="ArgumentOutOfRangeException">If <c>count</c> or <c>offset</c> are negative</exception>
|
||||||
|
/// <exception cref="ArgumentException">If <c>offset</c> + <c>count</c> is > buffer.Length</exception>
|
||||||
|
/// <exception cref="NotSupportedException">If this stream is not writeable.</exception>
|
||||||
|
/// <exception cref="ObjectDisposedException">If this stream has been disposed.</exception>
|
||||||
|
public override void Write(byte[] buffer, int offset, int count)
|
||||||
|
{
|
||||||
|
if (!CanWrite) throw new NotSupportedException();
|
||||||
|
if (buffer == null) throw new ArgumentNullException();
|
||||||
|
if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
|
||||||
|
if ((offset+count) > buffer.Length) throw new ArgumentException();
|
||||||
|
if (_isDisposed) throw new ObjectDisposedException("GZipStream");
|
||||||
|
|
||||||
|
GCHandle h = GCHandle.Alloc(buffer, GCHandleType.Pinned);
|
||||||
|
try
|
||||||
|
{
|
||||||
|
int result = gzwrite(_gzFile, h.AddrOfPinnedObject().ToInt32() + offset, count);
|
||||||
|
if (result < 0)
|
||||||
|
throw new IOException();
|
||||||
|
}
|
||||||
|
finally
|
||||||
|
{
|
||||||
|
h.Free();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Writes a single byte to the stream
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="value">The byte to add to the stream.</param>
|
||||||
|
/// <exception cref="NotSupportedException">If this stream is not writeable.</exception>
|
||||||
|
/// <exception cref="ObjectDisposedException">If this stream has been disposed.</exception>
|
||||||
|
public override void WriteByte(byte value)
|
||||||
|
{
|
||||||
|
if (!CanWrite) throw new NotSupportedException();
|
||||||
|
if (_isDisposed) throw new ObjectDisposedException("GZipStream");
|
||||||
|
|
||||||
|
int result = gzputc(_gzFile, (int)value);
|
||||||
|
if (result < 0)
|
||||||
|
throw new IOException();
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Position & length stuff
|
||||||
|
/// <summary>
|
||||||
|
/// Not supported.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="value"></param>
|
||||||
|
/// <exception cref="NotSupportedException">Always thrown</exception>
|
||||||
|
public override void SetLength(long value)
|
||||||
|
{
|
||||||
|
throw new NotSupportedException();
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Not suppported.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="offset"></param>
|
||||||
|
/// <param name="origin"></param>
|
||||||
|
/// <returns></returns>
|
||||||
|
/// <exception cref="NotSupportedException">Always thrown</exception>
|
||||||
|
public override long Seek(long offset, SeekOrigin origin)
|
||||||
|
{
|
||||||
|
throw new NotSupportedException();
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Flushes the <c>GZipStream</c>.
|
||||||
|
/// </summary>
|
||||||
|
/// <remarks>In this implementation, this method does nothing. This is because excessive
|
||||||
|
/// flushing may degrade the achievable compression rates.</remarks>
|
||||||
|
public override void Flush()
|
||||||
|
{
|
||||||
|
// left empty on purpose
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets/sets the current position in the <c>GZipStream</c>. Not suppported.
|
||||||
|
/// </summary>
|
||||||
|
/// <remarks>In this implementation this property is not supported</remarks>
|
||||||
|
/// <exception cref="NotSupportedException">Always thrown</exception>
|
||||||
|
public override long Position
|
||||||
|
{
|
||||||
|
get
|
||||||
|
{
|
||||||
|
throw new NotSupportedException();
|
||||||
|
}
|
||||||
|
set
|
||||||
|
{
|
||||||
|
throw new NotSupportedException();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Gets the size of the stream. Not suppported.
|
||||||
|
/// </summary>
|
||||||
|
/// <remarks>In this implementation this property is not supported</remarks>
|
||||||
|
/// <exception cref="NotSupportedException">Always thrown</exception>
|
||||||
|
public override long Length
|
||||||
|
{
|
||||||
|
get
|
||||||
|
{
|
||||||
|
throw new NotSupportedException();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
}
|
||||||
|
}
|
||||||
105
contrib/dotzlib/DotZLib/Inflater.cs
Normal file
105
contrib/dotzlib/DotZLib/Inflater.cs
Normal file
@@ -0,0 +1,105 @@
|
|||||||
|
//
|
||||||
|
// <20> Copyright Henrik Ravn 2004
|
||||||
|
//
|
||||||
|
// Use, modification and distribution are subject to the Boost Software License, Version 1.0.
|
||||||
|
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
using System;
|
||||||
|
using System.Diagnostics;
|
||||||
|
using System.Runtime.InteropServices;
|
||||||
|
|
||||||
|
namespace DotZLib
|
||||||
|
{
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Implements a data decompressor, using the inflate algorithm in the ZLib dll
|
||||||
|
/// </summary>
|
||||||
|
public class Inflater : CodecBase
|
||||||
|
{
|
||||||
|
#region Dll imports
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl, CharSet=CharSet.Ansi)]
|
||||||
|
private static extern int inflateInit_(ref ZStream sz, string vs, int size);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int inflate(ref ZStream sz, int flush);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int inflateReset(ref ZStream sz);
|
||||||
|
|
||||||
|
[DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
|
||||||
|
private static extern int inflateEnd(ref ZStream sz);
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Constructs an new instance of the <c>Inflater</c>
|
||||||
|
/// </summary>
|
||||||
|
public Inflater() : base()
|
||||||
|
{
|
||||||
|
int retval = inflateInit_(ref _ztream, Info.Version, Marshal.SizeOf(_ztream));
|
||||||
|
if (retval != 0)
|
||||||
|
throw new ZLibException(retval, "Could not initialize inflater");
|
||||||
|
|
||||||
|
resetOutput();
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Adds more data to the codec to be processed.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="data">Byte array containing the data to be added to the codec</param>
|
||||||
|
/// <param name="offset">The index of the first byte to add from <c>data</c></param>
|
||||||
|
/// <param name="count">The number of bytes to add</param>
|
||||||
|
/// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
|
||||||
|
public override void Add(byte[] data, int offset, int count)
|
||||||
|
{
|
||||||
|
if (data == null) throw new ArgumentNullException();
|
||||||
|
if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
|
||||||
|
if ((offset+count) > data.Length) throw new ArgumentException();
|
||||||
|
|
||||||
|
int total = count;
|
||||||
|
int inputIndex = offset;
|
||||||
|
int err = 0;
|
||||||
|
|
||||||
|
while (err >= 0 && inputIndex < total)
|
||||||
|
{
|
||||||
|
copyInput(data, inputIndex, Math.Min(total - inputIndex, kBufferSize));
|
||||||
|
err = inflate(ref _ztream, (int)FlushTypes.None);
|
||||||
|
if (err == 0)
|
||||||
|
while (_ztream.avail_out == 0)
|
||||||
|
{
|
||||||
|
OnDataAvailable();
|
||||||
|
err = inflate(ref _ztream, (int)FlushTypes.None);
|
||||||
|
}
|
||||||
|
|
||||||
|
inputIndex += (int)_ztream.total_in;
|
||||||
|
}
|
||||||
|
setChecksum( _ztream.adler );
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Finishes up any pending data that needs to be processed and handled.
|
||||||
|
/// </summary>
|
||||||
|
public override void Finish()
|
||||||
|
{
|
||||||
|
int err;
|
||||||
|
do
|
||||||
|
{
|
||||||
|
err = inflate(ref _ztream, (int)FlushTypes.Finish);
|
||||||
|
OnDataAvailable();
|
||||||
|
}
|
||||||
|
while (err == 0);
|
||||||
|
setChecksum( _ztream.adler );
|
||||||
|
inflateReset(ref _ztream);
|
||||||
|
resetOutput();
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Closes the internal zlib inflate stream
|
||||||
|
/// </summary>
|
||||||
|
protected override void CleanUp() { inflateEnd(ref _ztream); }
|
||||||
|
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
274
contrib/dotzlib/DotZLib/UnitTests.cs
Normal file
274
contrib/dotzlib/DotZLib/UnitTests.cs
Normal file
@@ -0,0 +1,274 @@
|
|||||||
|
//
|
||||||
|
// © Copyright Henrik Ravn 2004
|
||||||
|
//
|
||||||
|
// Use, modification and distribution are subject to the Boost Software License, Version 1.0.
|
||||||
|
// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
//
|
||||||
|
|
||||||
|
using System;
|
||||||
|
using System.Collections;
|
||||||
|
using System.IO;
|
||||||
|
|
||||||
|
// uncomment the define below to include unit tests
|
||||||
|
//#define nunit
|
||||||
|
#if nunit
|
||||||
|
using NUnit.Framework;
|
||||||
|
|
||||||
|
// Unit tests for the DotZLib class library
|
||||||
|
// ----------------------------------------
|
||||||
|
//
|
||||||
|
// Use this with NUnit 2 from http://www.nunit.org
|
||||||
|
//
|
||||||
|
|
||||||
|
namespace DotZLibTests
|
||||||
|
{
|
||||||
|
using DotZLib;
|
||||||
|
|
||||||
|
// helper methods
|
||||||
|
internal class Utils
|
||||||
|
{
|
||||||
|
public static bool byteArrEqual( byte[] lhs, byte[] rhs )
|
||||||
|
{
|
||||||
|
if (lhs.Length != rhs.Length)
|
||||||
|
return false;
|
||||||
|
for (int i = lhs.Length-1; i >= 0; --i)
|
||||||
|
if (lhs[i] != rhs[i])
|
||||||
|
return false;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
[TestFixture]
|
||||||
|
public class CircBufferTests
|
||||||
|
{
|
||||||
|
#region Circular buffer tests
|
||||||
|
[Test]
|
||||||
|
public void SinglePutGet()
|
||||||
|
{
|
||||||
|
CircularBuffer buf = new CircularBuffer(10);
|
||||||
|
Assert.AreEqual( 0, buf.Size );
|
||||||
|
Assert.AreEqual( -1, buf.Get() );
|
||||||
|
|
||||||
|
Assert.IsTrue(buf.Put( 1 ));
|
||||||
|
Assert.AreEqual( 1, buf.Size );
|
||||||
|
Assert.AreEqual( 1, buf.Get() );
|
||||||
|
Assert.AreEqual( 0, buf.Size );
|
||||||
|
Assert.AreEqual( -1, buf.Get() );
|
||||||
|
}
|
||||||
|
|
||||||
|
[Test]
|
||||||
|
public void BlockPutGet()
|
||||||
|
{
|
||||||
|
CircularBuffer buf = new CircularBuffer(10);
|
||||||
|
byte[] arr = {1,2,3,4,5,6,7,8,9,10};
|
||||||
|
Assert.AreEqual( 10, buf.Put(arr,0,10) );
|
||||||
|
Assert.AreEqual( 10, buf.Size );
|
||||||
|
Assert.IsFalse( buf.Put(11) );
|
||||||
|
Assert.AreEqual( 1, buf.Get() );
|
||||||
|
Assert.IsTrue( buf.Put(11) );
|
||||||
|
|
||||||
|
byte[] arr2 = (byte[])arr.Clone();
|
||||||
|
Assert.AreEqual( 9, buf.Get(arr2,1,9) );
|
||||||
|
Assert.IsTrue( Utils.byteArrEqual(arr,arr2) );
|
||||||
|
}
|
||||||
|
|
||||||
|
#endregion
|
||||||
|
}
|
||||||
|
|
||||||
|
[TestFixture]
|
||||||
|
public class ChecksumTests
|
||||||
|
{
|
||||||
|
#region CRC32 Tests
|
||||||
|
[Test]
|
||||||
|
public void CRC32_Null()
|
||||||
|
{
|
||||||
|
CRC32Checksum crc32 = new CRC32Checksum();
|
||||||
|
Assert.AreEqual( 0, crc32.Value );
|
||||||
|
|
||||||
|
crc32 = new CRC32Checksum(1);
|
||||||
|
Assert.AreEqual( 1, crc32.Value );
|
||||||
|
|
||||||
|
crc32 = new CRC32Checksum(556);
|
||||||
|
Assert.AreEqual( 556, crc32.Value );
|
||||||
|
}
|
||||||
|
|
||||||
|
[Test]
|
||||||
|
public void CRC32_Data()
|
||||||
|
{
|
||||||
|
CRC32Checksum crc32 = new CRC32Checksum();
|
||||||
|
byte[] data = { 1,2,3,4,5,6,7 };
|
||||||
|
crc32.Update(data);
|
||||||
|
Assert.AreEqual( 0x70e46888, crc32.Value );
|
||||||
|
|
||||||
|
crc32 = new CRC32Checksum();
|
||||||
|
crc32.Update("penguin");
|
||||||
|
Assert.AreEqual( 0x0e5c1a120, crc32.Value );
|
||||||
|
|
||||||
|
crc32 = new CRC32Checksum(1);
|
||||||
|
crc32.Update("penguin");
|
||||||
|
Assert.AreEqual(0x43b6aa94, crc32.Value);
|
||||||
|
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Adler tests
|
||||||
|
|
||||||
|
[Test]
|
||||||
|
public void Adler_Null()
|
||||||
|
{
|
||||||
|
AdlerChecksum adler = new AdlerChecksum();
|
||||||
|
Assert.AreEqual(0, adler.Value);
|
||||||
|
|
||||||
|
adler = new AdlerChecksum(1);
|
||||||
|
Assert.AreEqual( 1, adler.Value );
|
||||||
|
|
||||||
|
adler = new AdlerChecksum(556);
|
||||||
|
Assert.AreEqual( 556, adler.Value );
|
||||||
|
}
|
||||||
|
|
||||||
|
[Test]
|
||||||
|
public void Adler_Data()
|
||||||
|
{
|
||||||
|
AdlerChecksum adler = new AdlerChecksum(1);
|
||||||
|
byte[] data = { 1,2,3,4,5,6,7 };
|
||||||
|
adler.Update(data);
|
||||||
|
Assert.AreEqual( 0x5b001d, adler.Value );
|
||||||
|
|
||||||
|
adler = new AdlerChecksum();
|
||||||
|
adler.Update("penguin");
|
||||||
|
Assert.AreEqual(0x0bcf02f6, adler.Value );
|
||||||
|
|
||||||
|
adler = new AdlerChecksum(1);
|
||||||
|
adler.Update("penguin");
|
||||||
|
Assert.AreEqual(0x0bd602f7, adler.Value);
|
||||||
|
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
}
|
||||||
|
|
||||||
|
[TestFixture]
|
||||||
|
public class InfoTests
|
||||||
|
{
|
||||||
|
#region Info tests
|
||||||
|
[Test]
|
||||||
|
public void Info_Version()
|
||||||
|
{
|
||||||
|
Info info = new Info();
|
||||||
|
Assert.AreEqual("1.2.11", Info.Version);
|
||||||
|
Assert.AreEqual(32, info.SizeOfUInt);
|
||||||
|
Assert.AreEqual(32, info.SizeOfULong);
|
||||||
|
Assert.AreEqual(32, info.SizeOfPointer);
|
||||||
|
Assert.AreEqual(32, info.SizeOfOffset);
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
}
|
||||||
|
|
||||||
|
[TestFixture]
|
||||||
|
public class DeflateInflateTests
|
||||||
|
{
|
||||||
|
#region Deflate tests
|
||||||
|
[Test]
|
||||||
|
public void Deflate_Init()
|
||||||
|
{
|
||||||
|
using (Deflater def = new Deflater(CompressLevel.Default))
|
||||||
|
{
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private ArrayList compressedData = new ArrayList();
|
||||||
|
private uint adler1;
|
||||||
|
|
||||||
|
private ArrayList uncompressedData = new ArrayList();
|
||||||
|
private uint adler2;
|
||||||
|
|
||||||
|
public void CDataAvail(byte[] data, int startIndex, int count)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < count; ++i)
|
||||||
|
compressedData.Add(data[i+startIndex]);
|
||||||
|
}
|
||||||
|
|
||||||
|
[Test]
|
||||||
|
public void Deflate_Compress()
|
||||||
|
{
|
||||||
|
compressedData.Clear();
|
||||||
|
|
||||||
|
byte[] testData = new byte[35000];
|
||||||
|
for (int i = 0; i < testData.Length; ++i)
|
||||||
|
testData[i] = 5;
|
||||||
|
|
||||||
|
using (Deflater def = new Deflater((CompressLevel)5))
|
||||||
|
{
|
||||||
|
def.DataAvailable += new DataAvailableHandler(CDataAvail);
|
||||||
|
def.Add(testData);
|
||||||
|
def.Finish();
|
||||||
|
adler1 = def.Checksum;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
|
||||||
|
#region Inflate tests
|
||||||
|
[Test]
|
||||||
|
public void Inflate_Init()
|
||||||
|
{
|
||||||
|
using (Inflater inf = new Inflater())
|
||||||
|
{
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private void DDataAvail(byte[] data, int startIndex, int count)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < count; ++i)
|
||||||
|
uncompressedData.Add(data[i+startIndex]);
|
||||||
|
}
|
||||||
|
|
||||||
|
[Test]
|
||||||
|
public void Inflate_Expand()
|
||||||
|
{
|
||||||
|
uncompressedData.Clear();
|
||||||
|
|
||||||
|
using (Inflater inf = new Inflater())
|
||||||
|
{
|
||||||
|
inf.DataAvailable += new DataAvailableHandler(DDataAvail);
|
||||||
|
inf.Add((byte[])compressedData.ToArray(typeof(byte)));
|
||||||
|
inf.Finish();
|
||||||
|
adler2 = inf.Checksum;
|
||||||
|
}
|
||||||
|
Assert.AreEqual( adler1, adler2 );
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
}
|
||||||
|
|
||||||
|
[TestFixture]
|
||||||
|
public class GZipStreamTests
|
||||||
|
{
|
||||||
|
#region GZipStream test
|
||||||
|
[Test]
|
||||||
|
public void GZipStream_WriteRead()
|
||||||
|
{
|
||||||
|
using (GZipStream gzOut = new GZipStream("gzstream.gz", CompressLevel.Best))
|
||||||
|
{
|
||||||
|
BinaryWriter writer = new BinaryWriter(gzOut);
|
||||||
|
writer.Write("hi there");
|
||||||
|
writer.Write(Math.PI);
|
||||||
|
writer.Write(42);
|
||||||
|
}
|
||||||
|
|
||||||
|
using (GZipStream gzIn = new GZipStream("gzstream.gz"))
|
||||||
|
{
|
||||||
|
BinaryReader reader = new BinaryReader(gzIn);
|
||||||
|
string s = reader.ReadString();
|
||||||
|
Assert.AreEqual("hi there",s);
|
||||||
|
double d = reader.ReadDouble();
|
||||||
|
Assert.AreEqual(Math.PI, d);
|
||||||
|
int i = reader.ReadInt32();
|
||||||
|
Assert.AreEqual(42,i);
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
#endregion
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
23
contrib/dotzlib/LICENSE_1_0.txt
Normal file
23
contrib/dotzlib/LICENSE_1_0.txt
Normal file
@@ -0,0 +1,23 @@
|
|||||||
|
Boost Software License - Version 1.0 - August 17th, 2003
|
||||||
|
|
||||||
|
Permission is hereby granted, free of charge, to any person or organization
|
||||||
|
obtaining a copy of the software and accompanying documentation covered by
|
||||||
|
this license (the "Software") to use, reproduce, display, distribute,
|
||||||
|
execute, and transmit the Software, and to prepare derivative works of the
|
||||||
|
Software, and to permit third-parties to whom the Software is furnished to
|
||||||
|
do so, all subject to the following:
|
||||||
|
|
||||||
|
The copyright notices in the Software and this entire statement, including
|
||||||
|
the above license grant, this restriction and the following disclaimer,
|
||||||
|
must be included in all copies of the Software, in whole or in part, and
|
||||||
|
all derivative works of the Software, unless such copies or derivative
|
||||||
|
works are solely in the form of machine-executable object code generated by
|
||||||
|
a source language processor.
|
||||||
|
|
||||||
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||||
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||||
|
FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
|
||||||
|
SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
|
||||||
|
FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
|
||||||
|
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
||||||
|
DEALINGS IN THE SOFTWARE.
|
||||||
58
contrib/dotzlib/readme.txt
Normal file
58
contrib/dotzlib/readme.txt
Normal file
@@ -0,0 +1,58 @@
|
|||||||
|
This directory contains a .Net wrapper class library for the ZLib1.dll
|
||||||
|
|
||||||
|
The wrapper includes support for inflating/deflating memory buffers,
|
||||||
|
.Net streaming wrappers for the gz streams part of zlib, and wrappers
|
||||||
|
for the checksum parts of zlib. See DotZLib/UnitTests.cs for examples.
|
||||||
|
|
||||||
|
Directory structure:
|
||||||
|
--------------------
|
||||||
|
|
||||||
|
LICENSE_1_0.txt - License file.
|
||||||
|
readme.txt - This file.
|
||||||
|
DotZLib.chm - Class library documentation
|
||||||
|
DotZLib.build - NAnt build file
|
||||||
|
DotZLib.sln - Microsoft Visual Studio 2003 solution file
|
||||||
|
|
||||||
|
DotZLib\*.cs - Source files for the class library
|
||||||
|
|
||||||
|
Unit tests:
|
||||||
|
-----------
|
||||||
|
The file DotZLib/UnitTests.cs contains unit tests for use with NUnit 2.1 or higher.
|
||||||
|
To include unit tests in the build, define nunit before building.
|
||||||
|
|
||||||
|
|
||||||
|
Build instructions:
|
||||||
|
-------------------
|
||||||
|
|
||||||
|
1. Using Visual Studio.Net 2003:
|
||||||
|
Open DotZLib.sln in VS.Net and build from there. Output file (DotZLib.dll)
|
||||||
|
will be found ./DotZLib/bin/release or ./DotZLib/bin/debug, depending on
|
||||||
|
you are building the release or debug version of the library. Check
|
||||||
|
DotZLib/UnitTests.cs for instructions on how to include unit tests in the
|
||||||
|
build.
|
||||||
|
|
||||||
|
2. Using NAnt:
|
||||||
|
Open a command prompt with access to the build environment and run nant
|
||||||
|
in the same directory as the DotZLib.build file.
|
||||||
|
You can define 2 properties on the nant command-line to control the build:
|
||||||
|
debug={true|false} to toggle between release/debug builds (default=true).
|
||||||
|
nunit={true|false} to include or esclude unit tests (default=true).
|
||||||
|
Also the target clean will remove binaries.
|
||||||
|
Output file (DotZLib.dll) will be found in either ./DotZLib/bin/release
|
||||||
|
or ./DotZLib/bin/debug, depending on whether you are building the release
|
||||||
|
or debug version of the library.
|
||||||
|
|
||||||
|
Examples:
|
||||||
|
nant -D:debug=false -D:nunit=false
|
||||||
|
will build a release mode version of the library without unit tests.
|
||||||
|
nant
|
||||||
|
will build a debug version of the library with unit tests
|
||||||
|
nant clean
|
||||||
|
will remove all previously built files.
|
||||||
|
|
||||||
|
|
||||||
|
---------------------------------
|
||||||
|
Copyright (c) Henrik Ravn 2004
|
||||||
|
|
||||||
|
Use, modification and distribution are subject to the Boost Software License, Version 1.0.
|
||||||
|
(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
574
contrib/gcc_gvmat64/gvmat64.S
Normal file
574
contrib/gcc_gvmat64/gvmat64.S
Normal file
@@ -0,0 +1,574 @@
|
|||||||
|
/*
|
||||||
|
;uInt longest_match_x64(
|
||||||
|
; deflate_state *s,
|
||||||
|
; IPos cur_match); // current match
|
||||||
|
|
||||||
|
; gvmat64.S -- Asm portion of the optimized longest_match for 32 bits x86_64
|
||||||
|
; (AMD64 on Athlon 64, Opteron, Phenom
|
||||||
|
; and Intel EM64T on Pentium 4 with EM64T, Pentium D, Core 2 Duo, Core I5/I7)
|
||||||
|
; this file is translation from gvmat64.asm to GCC 4.x (for Linux, Mac XCode)
|
||||||
|
; Copyright (C) 1995-2010 Jean-loup Gailly, Brian Raiter and Gilles Vollant.
|
||||||
|
;
|
||||||
|
; File written by Gilles Vollant, by converting to assembly the longest_match
|
||||||
|
; from Jean-loup Gailly in deflate.c of zLib and infoZip zip.
|
||||||
|
; and by taking inspiration on asm686 with masm, optimised assembly code
|
||||||
|
; from Brian Raiter, written 1998
|
||||||
|
;
|
||||||
|
; 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.
|
||||||
|
;
|
||||||
|
; http://www.zlib.net
|
||||||
|
; http://www.winimage.com/zLibDll
|
||||||
|
; http://www.muppetlabs.com/~breadbox/software/assembly.html
|
||||||
|
;
|
||||||
|
; to compile this file for zLib, I use option:
|
||||||
|
; gcc -c -arch x86_64 gvmat64.S
|
||||||
|
|
||||||
|
|
||||||
|
;uInt longest_match(s, cur_match)
|
||||||
|
; deflate_state *s;
|
||||||
|
; IPos cur_match; // current match /
|
||||||
|
;
|
||||||
|
; with XCode for Mac, I had strange error with some jump on intel syntax
|
||||||
|
; this is why BEFORE_JMP and AFTER_JMP are used
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
#define BEFORE_JMP .att_syntax
|
||||||
|
#define AFTER_JMP .intel_syntax noprefix
|
||||||
|
|
||||||
|
#ifndef NO_UNDERLINE
|
||||||
|
# define match_init _match_init
|
||||||
|
# define longest_match _longest_match
|
||||||
|
#endif
|
||||||
|
|
||||||
|
.intel_syntax noprefix
|
||||||
|
|
||||||
|
.globl match_init, longest_match
|
||||||
|
.text
|
||||||
|
longest_match:
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#define LocalVarsSize 96
|
||||||
|
/*
|
||||||
|
; register used : rax,rbx,rcx,rdx,rsi,rdi,r8,r9,r10,r11,r12
|
||||||
|
; free register : r14,r15
|
||||||
|
; register can be saved : rsp
|
||||||
|
*/
|
||||||
|
|
||||||
|
#define chainlenwmask (rsp + 8 - LocalVarsSize)
|
||||||
|
#define nicematch (rsp + 16 - LocalVarsSize)
|
||||||
|
|
||||||
|
#define save_rdi (rsp + 24 - LocalVarsSize)
|
||||||
|
#define save_rsi (rsp + 32 - LocalVarsSize)
|
||||||
|
#define save_rbx (rsp + 40 - LocalVarsSize)
|
||||||
|
#define save_rbp (rsp + 48 - LocalVarsSize)
|
||||||
|
#define save_r12 (rsp + 56 - LocalVarsSize)
|
||||||
|
#define save_r13 (rsp + 64 - LocalVarsSize)
|
||||||
|
#define save_r14 (rsp + 72 - LocalVarsSize)
|
||||||
|
#define save_r15 (rsp + 80 - LocalVarsSize)
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
; all the +4 offsets are due to the addition of pending_buf_size (in zlib
|
||||||
|
; in the deflate_state structure since the asm code was first written
|
||||||
|
; (if you compile with zlib 1.0.4 or older, remove the +4).
|
||||||
|
; Note : these value are good with a 8 bytes boundary pack structure
|
||||||
|
*/
|
||||||
|
|
||||||
|
#define MAX_MATCH 258
|
||||||
|
#define MIN_MATCH 3
|
||||||
|
#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
|
||||||
|
|
||||||
|
/*
|
||||||
|
;;; Offsets for fields in the deflate_state structure. These numbers
|
||||||
|
;;; are calculated from the definition of deflate_state, with the
|
||||||
|
;;; assumption that the compiler will dword-align the fields. (Thus,
|
||||||
|
;;; changing the definition of deflate_state could easily cause this
|
||||||
|
;;; program to crash horribly, without so much as a warning at
|
||||||
|
;;; compile time. Sigh.)
|
||||||
|
|
||||||
|
; all the +zlib1222add offsets are due to the addition of fields
|
||||||
|
; in zlib in the deflate_state structure since the asm code was first written
|
||||||
|
; (if you compile with zlib 1.0.4 or older, use "zlib1222add equ (-4)").
|
||||||
|
; (if you compile with zlib between 1.0.5 and 1.2.2.1, use "zlib1222add equ 0").
|
||||||
|
; if you compile with zlib 1.2.2.2 or later , use "zlib1222add equ 8").
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* you can check the structure offset by running
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include "deflate.h"
|
||||||
|
|
||||||
|
void print_depl()
|
||||||
|
{
|
||||||
|
deflate_state ds;
|
||||||
|
deflate_state *s=&ds;
|
||||||
|
printf("size pointer=%u\n",(int)sizeof(void*));
|
||||||
|
|
||||||
|
printf("#define dsWSize %u\n",(int)(((char*)&(s->w_size))-((char*)s)));
|
||||||
|
printf("#define dsWMask %u\n",(int)(((char*)&(s->w_mask))-((char*)s)));
|
||||||
|
printf("#define dsWindow %u\n",(int)(((char*)&(s->window))-((char*)s)));
|
||||||
|
printf("#define dsPrev %u\n",(int)(((char*)&(s->prev))-((char*)s)));
|
||||||
|
printf("#define dsMatchLen %u\n",(int)(((char*)&(s->match_length))-((char*)s)));
|
||||||
|
printf("#define dsPrevMatch %u\n",(int)(((char*)&(s->prev_match))-((char*)s)));
|
||||||
|
printf("#define dsStrStart %u\n",(int)(((char*)&(s->strstart))-((char*)s)));
|
||||||
|
printf("#define dsMatchStart %u\n",(int)(((char*)&(s->match_start))-((char*)s)));
|
||||||
|
printf("#define dsLookahead %u\n",(int)(((char*)&(s->lookahead))-((char*)s)));
|
||||||
|
printf("#define dsPrevLen %u\n",(int)(((char*)&(s->prev_length))-((char*)s)));
|
||||||
|
printf("#define dsMaxChainLen %u\n",(int)(((char*)&(s->max_chain_length))-((char*)s)));
|
||||||
|
printf("#define dsGoodMatch %u\n",(int)(((char*)&(s->good_match))-((char*)s)));
|
||||||
|
printf("#define dsNiceMatch %u\n",(int)(((char*)&(s->nice_match))-((char*)s)));
|
||||||
|
}
|
||||||
|
*/
|
||||||
|
|
||||||
|
#define dsWSize 68
|
||||||
|
#define dsWMask 76
|
||||||
|
#define dsWindow 80
|
||||||
|
#define dsPrev 96
|
||||||
|
#define dsMatchLen 144
|
||||||
|
#define dsPrevMatch 148
|
||||||
|
#define dsStrStart 156
|
||||||
|
#define dsMatchStart 160
|
||||||
|
#define dsLookahead 164
|
||||||
|
#define dsPrevLen 168
|
||||||
|
#define dsMaxChainLen 172
|
||||||
|
#define dsGoodMatch 188
|
||||||
|
#define dsNiceMatch 192
|
||||||
|
|
||||||
|
#define window_size [ rcx + dsWSize]
|
||||||
|
#define WMask [ rcx + dsWMask]
|
||||||
|
#define window_ad [ rcx + dsWindow]
|
||||||
|
#define prev_ad [ rcx + dsPrev]
|
||||||
|
#define strstart [ rcx + dsStrStart]
|
||||||
|
#define match_start [ rcx + dsMatchStart]
|
||||||
|
#define Lookahead [ rcx + dsLookahead] //; 0ffffffffh on infozip
|
||||||
|
#define prev_length [ rcx + dsPrevLen]
|
||||||
|
#define max_chain_length [ rcx + dsMaxChainLen]
|
||||||
|
#define good_match [ rcx + dsGoodMatch]
|
||||||
|
#define nice_match [ rcx + dsNiceMatch]
|
||||||
|
|
||||||
|
/*
|
||||||
|
; windows:
|
||||||
|
; parameter 1 in rcx(deflate state s), param 2 in rdx (cur match)
|
||||||
|
|
||||||
|
; see http://weblogs.asp.net/oldnewthing/archive/2004/01/14/58579.aspx and
|
||||||
|
; http://msdn.microsoft.com/library/en-us/kmarch/hh/kmarch/64bitAMD_8e951dd2-ee77-4728-8702-55ce4b5dd24a.xml.asp
|
||||||
|
;
|
||||||
|
; All registers must be preserved across the call, except for
|
||||||
|
; rax, rcx, rdx, r8, r9, r10, and r11, which are scratch.
|
||||||
|
|
||||||
|
;
|
||||||
|
; gcc on macosx-linux:
|
||||||
|
; see http://www.x86-64.org/documentation/abi-0.99.pdf
|
||||||
|
; param 1 in rdi, param 2 in rsi
|
||||||
|
; rbx, rsp, rbp, r12 to r15 must be preserved
|
||||||
|
|
||||||
|
;;; Save registers that the compiler may be using, and adjust esp to
|
||||||
|
;;; make room for our stack frame.
|
||||||
|
|
||||||
|
|
||||||
|
;;; Retrieve the function arguments. r8d will hold cur_match
|
||||||
|
;;; throughout the entire function. edx will hold the pointer to the
|
||||||
|
;;; deflate_state structure during the function's setup (before
|
||||||
|
;;; entering the main loop.
|
||||||
|
|
||||||
|
; ms: parameter 1 in rcx (deflate_state* s), param 2 in edx -> r8 (cur match)
|
||||||
|
; mac: param 1 in rdi, param 2 rsi
|
||||||
|
; this clear high 32 bits of r8, which can be garbage in both r8 and rdx
|
||||||
|
*/
|
||||||
|
mov [save_rbx],rbx
|
||||||
|
mov [save_rbp],rbp
|
||||||
|
|
||||||
|
|
||||||
|
mov rcx,rdi
|
||||||
|
|
||||||
|
mov r8d,esi
|
||||||
|
|
||||||
|
|
||||||
|
mov [save_r12],r12
|
||||||
|
mov [save_r13],r13
|
||||||
|
mov [save_r14],r14
|
||||||
|
mov [save_r15],r15
|
||||||
|
|
||||||
|
|
||||||
|
//;;; uInt wmask = s->w_mask;
|
||||||
|
//;;; unsigned chain_length = s->max_chain_length;
|
||||||
|
//;;; if (s->prev_length >= s->good_match) {
|
||||||
|
//;;; chain_length >>= 2;
|
||||||
|
//;;; }
|
||||||
|
|
||||||
|
|
||||||
|
mov edi, prev_length
|
||||||
|
mov esi, good_match
|
||||||
|
mov eax, WMask
|
||||||
|
mov ebx, max_chain_length
|
||||||
|
cmp edi, esi
|
||||||
|
jl LastMatchGood
|
||||||
|
shr ebx, 2
|
||||||
|
LastMatchGood:
|
||||||
|
|
||||||
|
//;;; chainlen is decremented once beforehand so that the function can
|
||||||
|
//;;; use the sign flag instead of the zero flag for the exit test.
|
||||||
|
//;;; It is then shifted into the high word, to make room for the wmask
|
||||||
|
//;;; value, which it will always accompany.
|
||||||
|
|
||||||
|
dec ebx
|
||||||
|
shl ebx, 16
|
||||||
|
or ebx, eax
|
||||||
|
|
||||||
|
//;;; on zlib only
|
||||||
|
//;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
mov eax, nice_match
|
||||||
|
mov [chainlenwmask], ebx
|
||||||
|
mov r10d, Lookahead
|
||||||
|
cmp r10d, eax
|
||||||
|
cmovnl r10d, eax
|
||||||
|
mov [nicematch],r10d
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
//;;; register Bytef *scan = s->window + s->strstart;
|
||||||
|
mov r10, window_ad
|
||||||
|
mov ebp, strstart
|
||||||
|
lea r13, [r10 + rbp]
|
||||||
|
|
||||||
|
//;;; Determine how many bytes the scan ptr is off from being
|
||||||
|
//;;; dword-aligned.
|
||||||
|
|
||||||
|
mov r9,r13
|
||||||
|
neg r13
|
||||||
|
and r13,3
|
||||||
|
|
||||||
|
//;;; IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
|
||||||
|
//;;; s->strstart - (IPos)MAX_DIST(s) : NIL;
|
||||||
|
|
||||||
|
|
||||||
|
mov eax, window_size
|
||||||
|
sub eax, MIN_LOOKAHEAD
|
||||||
|
|
||||||
|
|
||||||
|
xor edi,edi
|
||||||
|
sub ebp, eax
|
||||||
|
|
||||||
|
mov r11d, prev_length
|
||||||
|
|
||||||
|
cmovng ebp,edi
|
||||||
|
|
||||||
|
//;;; int best_len = s->prev_length;
|
||||||
|
|
||||||
|
|
||||||
|
//;;; Store the sum of s->window + best_len in esi locally, and in esi.
|
||||||
|
|
||||||
|
lea rsi,[r10+r11]
|
||||||
|
|
||||||
|
//;;; register ush scan_start = *(ushf*)scan;
|
||||||
|
//;;; register ush scan_end = *(ushf*)(scan+best_len-1);
|
||||||
|
//;;; Posf *prev = s->prev;
|
||||||
|
|
||||||
|
movzx r12d,word ptr [r9]
|
||||||
|
movzx ebx, word ptr [r9 + r11 - 1]
|
||||||
|
|
||||||
|
mov rdi, prev_ad
|
||||||
|
|
||||||
|
//;;; Jump into the main loop.
|
||||||
|
|
||||||
|
mov edx, [chainlenwmask]
|
||||||
|
|
||||||
|
cmp bx,word ptr [rsi + r8 - 1]
|
||||||
|
jz LookupLoopIsZero
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
LookupLoop1:
|
||||||
|
and r8d, edx
|
||||||
|
|
||||||
|
movzx r8d, word ptr [rdi + r8*2]
|
||||||
|
cmp r8d, ebp
|
||||||
|
jbe LeaveNow
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
sub edx, 0x00010000
|
||||||
|
BEFORE_JMP
|
||||||
|
js LeaveNow
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
LoopEntry1:
|
||||||
|
cmp bx,word ptr [rsi + r8 - 1]
|
||||||
|
BEFORE_JMP
|
||||||
|
jz LookupLoopIsZero
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
LookupLoop2:
|
||||||
|
and r8d, edx
|
||||||
|
|
||||||
|
movzx r8d, word ptr [rdi + r8*2]
|
||||||
|
cmp r8d, ebp
|
||||||
|
BEFORE_JMP
|
||||||
|
jbe LeaveNow
|
||||||
|
AFTER_JMP
|
||||||
|
sub edx, 0x00010000
|
||||||
|
BEFORE_JMP
|
||||||
|
js LeaveNow
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
LoopEntry2:
|
||||||
|
cmp bx,word ptr [rsi + r8 - 1]
|
||||||
|
BEFORE_JMP
|
||||||
|
jz LookupLoopIsZero
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
LookupLoop4:
|
||||||
|
and r8d, edx
|
||||||
|
|
||||||
|
movzx r8d, word ptr [rdi + r8*2]
|
||||||
|
cmp r8d, ebp
|
||||||
|
BEFORE_JMP
|
||||||
|
jbe LeaveNow
|
||||||
|
AFTER_JMP
|
||||||
|
sub edx, 0x00010000
|
||||||
|
BEFORE_JMP
|
||||||
|
js LeaveNow
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
LoopEntry4:
|
||||||
|
|
||||||
|
cmp bx,word ptr [rsi + r8 - 1]
|
||||||
|
BEFORE_JMP
|
||||||
|
jnz LookupLoop1
|
||||||
|
jmp LookupLoopIsZero
|
||||||
|
AFTER_JMP
|
||||||
|
/*
|
||||||
|
;;; do {
|
||||||
|
;;; match = s->window + cur_match;
|
||||||
|
;;; if (*(ushf*)(match+best_len-1) != scan_end ||
|
||||||
|
;;; *(ushf*)match != scan_start) continue;
|
||||||
|
;;; [...]
|
||||||
|
;;; } while ((cur_match = prev[cur_match & wmask]) > limit
|
||||||
|
;;; && --chain_length != 0);
|
||||||
|
;;;
|
||||||
|
;;; Here is the inner loop of the function. The function will spend the
|
||||||
|
;;; majority of its time in this loop, and majority of that time will
|
||||||
|
;;; be spent in the first ten instructions.
|
||||||
|
;;;
|
||||||
|
;;; Within this loop:
|
||||||
|
;;; ebx = scanend
|
||||||
|
;;; r8d = curmatch
|
||||||
|
;;; edx = chainlenwmask - i.e., ((chainlen << 16) | wmask)
|
||||||
|
;;; esi = windowbestlen - i.e., (window + bestlen)
|
||||||
|
;;; edi = prev
|
||||||
|
;;; ebp = limit
|
||||||
|
*/
|
||||||
|
.balign 16
|
||||||
|
LookupLoop:
|
||||||
|
and r8d, edx
|
||||||
|
|
||||||
|
movzx r8d, word ptr [rdi + r8*2]
|
||||||
|
cmp r8d, ebp
|
||||||
|
BEFORE_JMP
|
||||||
|
jbe LeaveNow
|
||||||
|
AFTER_JMP
|
||||||
|
sub edx, 0x00010000
|
||||||
|
BEFORE_JMP
|
||||||
|
js LeaveNow
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
LoopEntry:
|
||||||
|
|
||||||
|
cmp bx,word ptr [rsi + r8 - 1]
|
||||||
|
BEFORE_JMP
|
||||||
|
jnz LookupLoop1
|
||||||
|
AFTER_JMP
|
||||||
|
LookupLoopIsZero:
|
||||||
|
cmp r12w, word ptr [r10 + r8]
|
||||||
|
BEFORE_JMP
|
||||||
|
jnz LookupLoop1
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
|
||||||
|
//;;; Store the current value of chainlen.
|
||||||
|
mov [chainlenwmask], edx
|
||||||
|
/*
|
||||||
|
;;; Point edi to the string under scrutiny, and esi to the string we
|
||||||
|
;;; are hoping to match it up with. In actuality, esi and edi are
|
||||||
|
;;; both pointed (MAX_MATCH_8 - scanalign) bytes ahead, and edx is
|
||||||
|
;;; initialized to -(MAX_MATCH_8 - scanalign).
|
||||||
|
*/
|
||||||
|
lea rsi,[r8+r10]
|
||||||
|
mov rdx, 0xfffffffffffffef8 //; -(MAX_MATCH_8)
|
||||||
|
lea rsi, [rsi + r13 + 0x0108] //;MAX_MATCH_8]
|
||||||
|
lea rdi, [r9 + r13 + 0x0108] //;MAX_MATCH_8]
|
||||||
|
|
||||||
|
prefetcht1 [rsi+rdx]
|
||||||
|
prefetcht1 [rdi+rdx]
|
||||||
|
|
||||||
|
/*
|
||||||
|
;;; Test the strings for equality, 8 bytes at a time. At the end,
|
||||||
|
;;; adjust rdx so that it is offset to the exact byte that mismatched.
|
||||||
|
;;;
|
||||||
|
;;; We already know at this point that the first three bytes of the
|
||||||
|
;;; strings match each other, and they can be safely passed over before
|
||||||
|
;;; starting the compare loop. So what this code does is skip over 0-3
|
||||||
|
;;; bytes, as much as necessary in order to dword-align the edi
|
||||||
|
;;; pointer. (rsi will still be misaligned three times out of four.)
|
||||||
|
;;;
|
||||||
|
;;; It should be confessed that this loop usually does not represent
|
||||||
|
;;; much of the total running time. Replacing it with a more
|
||||||
|
;;; straightforward "rep cmpsb" would not drastically degrade
|
||||||
|
;;; performance.
|
||||||
|
*/
|
||||||
|
|
||||||
|
LoopCmps:
|
||||||
|
mov rax, [rsi + rdx]
|
||||||
|
xor rax, [rdi + rdx]
|
||||||
|
jnz LeaveLoopCmps
|
||||||
|
|
||||||
|
mov rax, [rsi + rdx + 8]
|
||||||
|
xor rax, [rdi + rdx + 8]
|
||||||
|
jnz LeaveLoopCmps8
|
||||||
|
|
||||||
|
|
||||||
|
mov rax, [rsi + rdx + 8+8]
|
||||||
|
xor rax, [rdi + rdx + 8+8]
|
||||||
|
jnz LeaveLoopCmps16
|
||||||
|
|
||||||
|
add rdx,8+8+8
|
||||||
|
|
||||||
|
BEFORE_JMP
|
||||||
|
jnz LoopCmps
|
||||||
|
jmp LenMaximum
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
LeaveLoopCmps16: add rdx,8
|
||||||
|
LeaveLoopCmps8: add rdx,8
|
||||||
|
LeaveLoopCmps:
|
||||||
|
|
||||||
|
test eax, 0x0000FFFF
|
||||||
|
jnz LenLower
|
||||||
|
|
||||||
|
test eax,0xffffffff
|
||||||
|
|
||||||
|
jnz LenLower32
|
||||||
|
|
||||||
|
add rdx,4
|
||||||
|
shr rax,32
|
||||||
|
or ax,ax
|
||||||
|
BEFORE_JMP
|
||||||
|
jnz LenLower
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
LenLower32:
|
||||||
|
shr eax,16
|
||||||
|
add rdx,2
|
||||||
|
|
||||||
|
LenLower:
|
||||||
|
sub al, 1
|
||||||
|
adc rdx, 0
|
||||||
|
//;;; Calculate the length of the match. If it is longer than MAX_MATCH,
|
||||||
|
//;;; then automatically accept it as the best possible match and leave.
|
||||||
|
|
||||||
|
lea rax, [rdi + rdx]
|
||||||
|
sub rax, r9
|
||||||
|
cmp eax, MAX_MATCH
|
||||||
|
BEFORE_JMP
|
||||||
|
jge LenMaximum
|
||||||
|
AFTER_JMP
|
||||||
|
/*
|
||||||
|
;;; If the length of the match is not longer than the best match we
|
||||||
|
;;; have so far, then forget it and return to the lookup loop.
|
||||||
|
;///////////////////////////////////
|
||||||
|
*/
|
||||||
|
cmp eax, r11d
|
||||||
|
jg LongerMatch
|
||||||
|
|
||||||
|
lea rsi,[r10+r11]
|
||||||
|
|
||||||
|
mov rdi, prev_ad
|
||||||
|
mov edx, [chainlenwmask]
|
||||||
|
BEFORE_JMP
|
||||||
|
jmp LookupLoop
|
||||||
|
AFTER_JMP
|
||||||
|
/*
|
||||||
|
;;; s->match_start = cur_match;
|
||||||
|
;;; best_len = len;
|
||||||
|
;;; if (len >= nice_match) break;
|
||||||
|
;;; scan_end = *(ushf*)(scan+best_len-1);
|
||||||
|
*/
|
||||||
|
LongerMatch:
|
||||||
|
mov r11d, eax
|
||||||
|
mov match_start, r8d
|
||||||
|
cmp eax, [nicematch]
|
||||||
|
BEFORE_JMP
|
||||||
|
jge LeaveNow
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
lea rsi,[r10+rax]
|
||||||
|
|
||||||
|
movzx ebx, word ptr [r9 + rax - 1]
|
||||||
|
mov rdi, prev_ad
|
||||||
|
mov edx, [chainlenwmask]
|
||||||
|
BEFORE_JMP
|
||||||
|
jmp LookupLoop
|
||||||
|
AFTER_JMP
|
||||||
|
|
||||||
|
//;;; Accept the current string, with the maximum possible length.
|
||||||
|
|
||||||
|
LenMaximum:
|
||||||
|
mov r11d,MAX_MATCH
|
||||||
|
mov match_start, r8d
|
||||||
|
|
||||||
|
//;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
|
||||||
|
//;;; return s->lookahead;
|
||||||
|
|
||||||
|
LeaveNow:
|
||||||
|
mov eax, Lookahead
|
||||||
|
cmp r11d, eax
|
||||||
|
cmovng eax, r11d
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
//;;; Restore the stack and return from whence we came.
|
||||||
|
|
||||||
|
|
||||||
|
// mov rsi,[save_rsi]
|
||||||
|
// mov rdi,[save_rdi]
|
||||||
|
mov rbx,[save_rbx]
|
||||||
|
mov rbp,[save_rbp]
|
||||||
|
mov r12,[save_r12]
|
||||||
|
mov r13,[save_r13]
|
||||||
|
mov r14,[save_r14]
|
||||||
|
mov r15,[save_r15]
|
||||||
|
|
||||||
|
|
||||||
|
ret 0
|
||||||
|
//; please don't remove this string !
|
||||||
|
//; Your can freely use gvmat64 in any free or commercial app
|
||||||
|
//; but it is far better don't remove the string in the binary!
|
||||||
|
// db 0dh,0ah,"asm686 with masm, optimised assembly code from Brian Raiter, written 1998, converted to amd 64 by Gilles Vollant 2005",0dh,0ah,0
|
||||||
|
|
||||||
|
|
||||||
|
match_init:
|
||||||
|
ret 0
|
||||||
|
|
||||||
|
|
||||||
1
contrib/infback9/README
Normal file
1
contrib/infback9/README
Normal file
@@ -0,0 +1 @@
|
|||||||
|
See infback9.h for what this is and how to use it.
|
||||||
615
contrib/infback9/infback9.c
Normal file
615
contrib/infback9/infback9.c
Normal file
@@ -0,0 +1,615 @@
|
|||||||
|
/* infback9.c -- inflate deflate64 data using a call-back interface
|
||||||
|
* Copyright (C) 1995-2008 Mark Adler
|
||||||
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "zutil.h"
|
||||||
|
#include "infback9.h"
|
||||||
|
#include "inftree9.h"
|
||||||
|
#include "inflate9.h"
|
||||||
|
|
||||||
|
#define WSIZE 65536UL
|
||||||
|
|
||||||
|
/*
|
||||||
|
strm provides memory allocation functions in zalloc and zfree, or
|
||||||
|
Z_NULL to use the library memory allocation functions.
|
||||||
|
|
||||||
|
window is a user-supplied window and output buffer that is 64K bytes.
|
||||||
|
*/
|
||||||
|
int ZEXPORT inflateBack9Init_(strm, window, version, stream_size)
|
||||||
|
z_stream FAR *strm;
|
||||||
|
unsigned char FAR *window;
|
||||||
|
const char *version;
|
||||||
|
int stream_size;
|
||||||
|
{
|
||||||
|
struct inflate_state FAR *state;
|
||||||
|
|
||||||
|
if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
|
||||||
|
stream_size != (int)(sizeof(z_stream)))
|
||||||
|
return Z_VERSION_ERROR;
|
||||||
|
if (strm == Z_NULL || window == Z_NULL)
|
||||||
|
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 = (voidpf)state;
|
||||||
|
state->window = window;
|
||||||
|
return Z_OK;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
Build and output length and distance decoding tables for fixed code
|
||||||
|
decoding.
|
||||||
|
*/
|
||||||
|
#ifdef MAKEFIXED
|
||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
void makefixed9(void)
|
||||||
|
{
|
||||||
|
unsigned sym, bits, low, size;
|
||||||
|
code *next, *lenfix, *distfix;
|
||||||
|
struct inflate_state state;
|
||||||
|
code fixed[544];
|
||||||
|
|
||||||
|
/* 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_table9(LENS, state.lens, 288, &(next), &(bits), state.work);
|
||||||
|
|
||||||
|
/* distance table */
|
||||||
|
sym = 0;
|
||||||
|
while (sym < 32) state.lens[sym++] = 5;
|
||||||
|
distfix = next;
|
||||||
|
bits = 5;
|
||||||
|
inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work);
|
||||||
|
|
||||||
|
/* write tables */
|
||||||
|
puts(" /* inffix9.h -- table for decoding deflate64 fixed codes");
|
||||||
|
puts(" * Generated automatically by makefixed9().");
|
||||||
|
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 % 6) == 0) printf("\n ");
|
||||||
|
printf("{%u,%u,%d}", lenfix[low].op, lenfix[low].bits,
|
||||||
|
lenfix[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 % 5) == 0) printf("\n ");
|
||||||
|
printf("{%u,%u,%d}", distfix[low].op, distfix[low].bits,
|
||||||
|
distfix[low].val);
|
||||||
|
if (++low == size) break;
|
||||||
|
putchar(',');
|
||||||
|
}
|
||||||
|
puts("\n };");
|
||||||
|
}
|
||||||
|
#endif /* MAKEFIXED */
|
||||||
|
|
||||||
|
/* Macros for inflateBack(): */
|
||||||
|
|
||||||
|
/* Clear the input bit accumulator */
|
||||||
|
#define INITBITS() \
|
||||||
|
do { \
|
||||||
|
hold = 0; \
|
||||||
|
bits = 0; \
|
||||||
|
} while (0)
|
||||||
|
|
||||||
|
/* Assure that some input is available. If input is requested, but denied,
|
||||||
|
then return a Z_BUF_ERROR from inflateBack(). */
|
||||||
|
#define PULL() \
|
||||||
|
do { \
|
||||||
|
if (have == 0) { \
|
||||||
|
have = in(in_desc, &next); \
|
||||||
|
if (have == 0) { \
|
||||||
|
next = Z_NULL; \
|
||||||
|
ret = Z_BUF_ERROR; \
|
||||||
|
goto inf_leave; \
|
||||||
|
} \
|
||||||
|
} \
|
||||||
|
} while (0)
|
||||||
|
|
||||||
|
/* Get a byte of input into the bit accumulator, or return from inflateBack()
|
||||||
|
with an error if there is no input available. */
|
||||||
|
#define PULLBYTE() \
|
||||||
|
do { \
|
||||||
|
PULL(); \
|
||||||
|
have--; \
|
||||||
|
hold += (unsigned long)(*next++) << bits; \
|
||||||
|
bits += 8; \
|
||||||
|
} while (0)
|
||||||
|
|
||||||
|
/* Assure that there are at least n bits in the bit accumulator. If there is
|
||||||
|
not enough available input to do that, then return from inflateBack() with
|
||||||
|
an error. */
|
||||||
|
#define NEEDBITS(n) \
|
||||||
|
do { \
|
||||||
|
while (bits < (unsigned)(n)) \
|
||||||
|
PULLBYTE(); \
|
||||||
|
} while (0)
|
||||||
|
|
||||||
|
/* Return the low n bits of the bit accumulator (n <= 16) */
|
||||||
|
#define BITS(n) \
|
||||||
|
((unsigned)hold & ((1U << (n)) - 1))
|
||||||
|
|
||||||
|
/* Remove n bits from the bit accumulator */
|
||||||
|
#define DROPBITS(n) \
|
||||||
|
do { \
|
||||||
|
hold >>= (n); \
|
||||||
|
bits -= (unsigned)(n); \
|
||||||
|
} while (0)
|
||||||
|
|
||||||
|
/* Remove zero to seven bits as needed to go to a byte boundary */
|
||||||
|
#define BYTEBITS() \
|
||||||
|
do { \
|
||||||
|
hold >>= bits & 7; \
|
||||||
|
bits -= bits & 7; \
|
||||||
|
} while (0)
|
||||||
|
|
||||||
|
/* Assure that some output space is available, by writing out the window
|
||||||
|
if it's full. If the write fails, return from inflateBack() with a
|
||||||
|
Z_BUF_ERROR. */
|
||||||
|
#define ROOM() \
|
||||||
|
do { \
|
||||||
|
if (left == 0) { \
|
||||||
|
put = window; \
|
||||||
|
left = WSIZE; \
|
||||||
|
wrap = 1; \
|
||||||
|
if (out(out_desc, put, (unsigned)left)) { \
|
||||||
|
ret = Z_BUF_ERROR; \
|
||||||
|
goto inf_leave; \
|
||||||
|
} \
|
||||||
|
} \
|
||||||
|
} while (0)
|
||||||
|
|
||||||
|
/*
|
||||||
|
strm provides the memory allocation functions and window buffer on input,
|
||||||
|
and provides information on the unused input on return. For Z_DATA_ERROR
|
||||||
|
returns, strm will also provide an error message.
|
||||||
|
|
||||||
|
in() and out() are the call-back input and output functions. When
|
||||||
|
inflateBack() needs more input, it calls in(). When inflateBack() has
|
||||||
|
filled the window with output, or when it completes with data in the
|
||||||
|
window, it calls out() to write out the data. The application must not
|
||||||
|
change the provided input until in() is called again or inflateBack()
|
||||||
|
returns. The application must not change the window/output buffer until
|
||||||
|
inflateBack() returns.
|
||||||
|
|
||||||
|
in() and out() are called with a descriptor parameter provided in the
|
||||||
|
inflateBack() call. This parameter can be a structure that provides the
|
||||||
|
information required to do the read or write, as well as accumulated
|
||||||
|
information on the input and output such as totals and check values.
|
||||||
|
|
||||||
|
in() should return zero on failure. out() should return non-zero on
|
||||||
|
failure. If either in() or out() fails, than inflateBack() returns a
|
||||||
|
Z_BUF_ERROR. strm->next_in can be checked for Z_NULL to see whether it
|
||||||
|
was in() or out() that caused in the error. Otherwise, inflateBack()
|
||||||
|
returns Z_STREAM_END on success, Z_DATA_ERROR for an deflate format
|
||||||
|
error, or Z_MEM_ERROR if it could not allocate memory for the state.
|
||||||
|
inflateBack() can also return Z_STREAM_ERROR if the input parameters
|
||||||
|
are not correct, i.e. strm is Z_NULL or the state was not initialized.
|
||||||
|
*/
|
||||||
|
int ZEXPORT inflateBack9(strm, in, in_desc, out, out_desc)
|
||||||
|
z_stream FAR *strm;
|
||||||
|
in_func in;
|
||||||
|
void FAR *in_desc;
|
||||||
|
out_func out;
|
||||||
|
void FAR *out_desc;
|
||||||
|
{
|
||||||
|
struct inflate_state FAR *state;
|
||||||
|
z_const unsigned char FAR *next; /* next input */
|
||||||
|
unsigned char FAR *put; /* next output */
|
||||||
|
unsigned have; /* available input */
|
||||||
|
unsigned long left; /* available output */
|
||||||
|
inflate_mode mode; /* current inflate mode */
|
||||||
|
int lastblock; /* true if processing last block */
|
||||||
|
int wrap; /* true if the window has wrapped */
|
||||||
|
unsigned char FAR *window; /* allocated sliding window, if needed */
|
||||||
|
unsigned long hold; /* bit buffer */
|
||||||
|
unsigned bits; /* bits in bit buffer */
|
||||||
|
unsigned extra; /* extra bits needed */
|
||||||
|
unsigned long length; /* literal or length of data to copy */
|
||||||
|
unsigned long offset; /* distance back to copy string from */
|
||||||
|
unsigned long copy; /* number of stored or match bytes to copy */
|
||||||
|
unsigned char FAR *from; /* where to copy match bytes from */
|
||||||
|
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 */
|
||||||
|
code here; /* current decoding table entry */
|
||||||
|
code last; /* parent table entry */
|
||||||
|
unsigned len; /* length to copy for repeats, bits to drop */
|
||||||
|
int ret; /* return code */
|
||||||
|
static const unsigned short order[19] = /* permutation of code lengths */
|
||||||
|
{16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
|
||||||
|
#include "inffix9.h"
|
||||||
|
|
||||||
|
/* Check that the strm exists and that the state was initialized */
|
||||||
|
if (strm == Z_NULL || strm->state == Z_NULL)
|
||||||
|
return Z_STREAM_ERROR;
|
||||||
|
state = (struct inflate_state FAR *)strm->state;
|
||||||
|
|
||||||
|
/* Reset the state */
|
||||||
|
strm->msg = Z_NULL;
|
||||||
|
mode = TYPE;
|
||||||
|
lastblock = 0;
|
||||||
|
wrap = 0;
|
||||||
|
window = state->window;
|
||||||
|
next = strm->next_in;
|
||||||
|
have = next != Z_NULL ? strm->avail_in : 0;
|
||||||
|
hold = 0;
|
||||||
|
bits = 0;
|
||||||
|
put = window;
|
||||||
|
left = WSIZE;
|
||||||
|
lencode = Z_NULL;
|
||||||
|
distcode = Z_NULL;
|
||||||
|
|
||||||
|
/* Inflate until end of block marked as last */
|
||||||
|
for (;;)
|
||||||
|
switch (mode) {
|
||||||
|
case TYPE:
|
||||||
|
/* determine and dispatch block type */
|
||||||
|
if (lastblock) {
|
||||||
|
BYTEBITS();
|
||||||
|
mode = DONE;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
NEEDBITS(3);
|
||||||
|
lastblock = BITS(1);
|
||||||
|
DROPBITS(1);
|
||||||
|
switch (BITS(2)) {
|
||||||
|
case 0: /* stored block */
|
||||||
|
Tracev((stderr, "inflate: stored block%s\n",
|
||||||
|
lastblock ? " (last)" : ""));
|
||||||
|
mode = STORED;
|
||||||
|
break;
|
||||||
|
case 1: /* fixed block */
|
||||||
|
lencode = lenfix;
|
||||||
|
lenbits = 9;
|
||||||
|
distcode = distfix;
|
||||||
|
distbits = 5;
|
||||||
|
Tracev((stderr, "inflate: fixed codes block%s\n",
|
||||||
|
lastblock ? " (last)" : ""));
|
||||||
|
mode = LEN; /* decode codes */
|
||||||
|
break;
|
||||||
|
case 2: /* dynamic block */
|
||||||
|
Tracev((stderr, "inflate: dynamic codes block%s\n",
|
||||||
|
lastblock ? " (last)" : ""));
|
||||||
|
mode = TABLE;
|
||||||
|
break;
|
||||||
|
case 3:
|
||||||
|
strm->msg = (char *)"invalid block type";
|
||||||
|
mode = BAD;
|
||||||
|
}
|
||||||
|
DROPBITS(2);
|
||||||
|
break;
|
||||||
|
|
||||||
|
case STORED:
|
||||||
|
/* get and verify stored block length */
|
||||||
|
BYTEBITS(); /* go to byte boundary */
|
||||||
|
NEEDBITS(32);
|
||||||
|
if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
|
||||||
|
strm->msg = (char *)"invalid stored block lengths";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
length = (unsigned)hold & 0xffff;
|
||||||
|
Tracev((stderr, "inflate: stored length %lu\n",
|
||||||
|
length));
|
||||||
|
INITBITS();
|
||||||
|
|
||||||
|
/* copy stored block from input to output */
|
||||||
|
while (length != 0) {
|
||||||
|
copy = length;
|
||||||
|
PULL();
|
||||||
|
ROOM();
|
||||||
|
if (copy > have) copy = have;
|
||||||
|
if (copy > left) copy = left;
|
||||||
|
zmemcpy(put, next, copy);
|
||||||
|
have -= copy;
|
||||||
|
next += copy;
|
||||||
|
left -= copy;
|
||||||
|
put += copy;
|
||||||
|
length -= copy;
|
||||||
|
}
|
||||||
|
Tracev((stderr, "inflate: stored end\n"));
|
||||||
|
mode = TYPE;
|
||||||
|
break;
|
||||||
|
|
||||||
|
case TABLE:
|
||||||
|
/* get dynamic table entries descriptor */
|
||||||
|
NEEDBITS(14);
|
||||||
|
state->nlen = BITS(5) + 257;
|
||||||
|
DROPBITS(5);
|
||||||
|
state->ndist = BITS(5) + 1;
|
||||||
|
DROPBITS(5);
|
||||||
|
state->ncode = BITS(4) + 4;
|
||||||
|
DROPBITS(4);
|
||||||
|
if (state->nlen > 286) {
|
||||||
|
strm->msg = (char *)"too many length symbols";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
Tracev((stderr, "inflate: table sizes ok\n"));
|
||||||
|
|
||||||
|
/* get code length code lengths (not a typo) */
|
||||||
|
state->have = 0;
|
||||||
|
while (state->have < state->ncode) {
|
||||||
|
NEEDBITS(3);
|
||||||
|
state->lens[order[state->have++]] = (unsigned short)BITS(3);
|
||||||
|
DROPBITS(3);
|
||||||
|
}
|
||||||
|
while (state->have < 19)
|
||||||
|
state->lens[order[state->have++]] = 0;
|
||||||
|
state->next = state->codes;
|
||||||
|
lencode = (code const FAR *)(state->next);
|
||||||
|
lenbits = 7;
|
||||||
|
ret = inflate_table9(CODES, state->lens, 19, &(state->next),
|
||||||
|
&(lenbits), state->work);
|
||||||
|
if (ret) {
|
||||||
|
strm->msg = (char *)"invalid code lengths set";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
Tracev((stderr, "inflate: code lengths ok\n"));
|
||||||
|
|
||||||
|
/* get length and distance code code lengths */
|
||||||
|
state->have = 0;
|
||||||
|
while (state->have < state->nlen + state->ndist) {
|
||||||
|
for (;;) {
|
||||||
|
here = lencode[BITS(lenbits)];
|
||||||
|
if ((unsigned)(here.bits) <= bits) break;
|
||||||
|
PULLBYTE();
|
||||||
|
}
|
||||||
|
if (here.val < 16) {
|
||||||
|
NEEDBITS(here.bits);
|
||||||
|
DROPBITS(here.bits);
|
||||||
|
state->lens[state->have++] = here.val;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
if (here.val == 16) {
|
||||||
|
NEEDBITS(here.bits + 2);
|
||||||
|
DROPBITS(here.bits);
|
||||||
|
if (state->have == 0) {
|
||||||
|
strm->msg = (char *)"invalid bit length repeat";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
len = (unsigned)(state->lens[state->have - 1]);
|
||||||
|
copy = 3 + BITS(2);
|
||||||
|
DROPBITS(2);
|
||||||
|
}
|
||||||
|
else if (here.val == 17) {
|
||||||
|
NEEDBITS(here.bits + 3);
|
||||||
|
DROPBITS(here.bits);
|
||||||
|
len = 0;
|
||||||
|
copy = 3 + BITS(3);
|
||||||
|
DROPBITS(3);
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
NEEDBITS(here.bits + 7);
|
||||||
|
DROPBITS(here.bits);
|
||||||
|
len = 0;
|
||||||
|
copy = 11 + BITS(7);
|
||||||
|
DROPBITS(7);
|
||||||
|
}
|
||||||
|
if (state->have + copy > state->nlen + state->ndist) {
|
||||||
|
strm->msg = (char *)"invalid bit length repeat";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
while (copy--)
|
||||||
|
state->lens[state->have++] = (unsigned short)len;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* handle error breaks in while */
|
||||||
|
if (mode == BAD) break;
|
||||||
|
|
||||||
|
/* check for end-of-block code (better have one) */
|
||||||
|
if (state->lens[256] == 0) {
|
||||||
|
strm->msg = (char *)"invalid code -- missing end-of-block";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* build code tables -- note: do not change the lenbits or distbits
|
||||||
|
values here (9 and 6) without reading the comments in inftree9.h
|
||||||
|
concerning the ENOUGH constants, which depend on those values */
|
||||||
|
state->next = state->codes;
|
||||||
|
lencode = (code const FAR *)(state->next);
|
||||||
|
lenbits = 9;
|
||||||
|
ret = inflate_table9(LENS, state->lens, state->nlen,
|
||||||
|
&(state->next), &(lenbits), state->work);
|
||||||
|
if (ret) {
|
||||||
|
strm->msg = (char *)"invalid literal/lengths set";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
distcode = (code const FAR *)(state->next);
|
||||||
|
distbits = 6;
|
||||||
|
ret = inflate_table9(DISTS, state->lens + state->nlen,
|
||||||
|
state->ndist, &(state->next), &(distbits),
|
||||||
|
state->work);
|
||||||
|
if (ret) {
|
||||||
|
strm->msg = (char *)"invalid distances set";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
Tracev((stderr, "inflate: codes ok\n"));
|
||||||
|
mode = LEN;
|
||||||
|
|
||||||
|
case LEN:
|
||||||
|
/* get a literal, length, or end-of-block code */
|
||||||
|
for (;;) {
|
||||||
|
here = lencode[BITS(lenbits)];
|
||||||
|
if ((unsigned)(here.bits) <= bits) break;
|
||||||
|
PULLBYTE();
|
||||||
|
}
|
||||||
|
if (here.op && (here.op & 0xf0) == 0) {
|
||||||
|
last = here;
|
||||||
|
for (;;) {
|
||||||
|
here = lencode[last.val +
|
||||||
|
(BITS(last.bits + last.op) >> last.bits)];
|
||||||
|
if ((unsigned)(last.bits + here.bits) <= bits) break;
|
||||||
|
PULLBYTE();
|
||||||
|
}
|
||||||
|
DROPBITS(last.bits);
|
||||||
|
}
|
||||||
|
DROPBITS(here.bits);
|
||||||
|
length = (unsigned)here.val;
|
||||||
|
|
||||||
|
/* process literal */
|
||||||
|
if (here.op == 0) {
|
||||||
|
Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
|
||||||
|
"inflate: literal '%c'\n" :
|
||||||
|
"inflate: literal 0x%02x\n", here.val));
|
||||||
|
ROOM();
|
||||||
|
*put++ = (unsigned char)(length);
|
||||||
|
left--;
|
||||||
|
mode = LEN;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* process end of block */
|
||||||
|
if (here.op & 32) {
|
||||||
|
Tracevv((stderr, "inflate: end of block\n"));
|
||||||
|
mode = TYPE;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* invalid code */
|
||||||
|
if (here.op & 64) {
|
||||||
|
strm->msg = (char *)"invalid literal/length code";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* length code -- get extra bits, if any */
|
||||||
|
extra = (unsigned)(here.op) & 31;
|
||||||
|
if (extra != 0) {
|
||||||
|
NEEDBITS(extra);
|
||||||
|
length += BITS(extra);
|
||||||
|
DROPBITS(extra);
|
||||||
|
}
|
||||||
|
Tracevv((stderr, "inflate: length %lu\n", length));
|
||||||
|
|
||||||
|
/* get distance code */
|
||||||
|
for (;;) {
|
||||||
|
here = distcode[BITS(distbits)];
|
||||||
|
if ((unsigned)(here.bits) <= bits) break;
|
||||||
|
PULLBYTE();
|
||||||
|
}
|
||||||
|
if ((here.op & 0xf0) == 0) {
|
||||||
|
last = here;
|
||||||
|
for (;;) {
|
||||||
|
here = distcode[last.val +
|
||||||
|
(BITS(last.bits + last.op) >> last.bits)];
|
||||||
|
if ((unsigned)(last.bits + here.bits) <= bits) break;
|
||||||
|
PULLBYTE();
|
||||||
|
}
|
||||||
|
DROPBITS(last.bits);
|
||||||
|
}
|
||||||
|
DROPBITS(here.bits);
|
||||||
|
if (here.op & 64) {
|
||||||
|
strm->msg = (char *)"invalid distance code";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
offset = (unsigned)here.val;
|
||||||
|
|
||||||
|
/* get distance extra bits, if any */
|
||||||
|
extra = (unsigned)(here.op) & 15;
|
||||||
|
if (extra != 0) {
|
||||||
|
NEEDBITS(extra);
|
||||||
|
offset += BITS(extra);
|
||||||
|
DROPBITS(extra);
|
||||||
|
}
|
||||||
|
if (offset > WSIZE - (wrap ? 0: left)) {
|
||||||
|
strm->msg = (char *)"invalid distance too far back";
|
||||||
|
mode = BAD;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
Tracevv((stderr, "inflate: distance %lu\n", offset));
|
||||||
|
|
||||||
|
/* copy match from window to output */
|
||||||
|
do {
|
||||||
|
ROOM();
|
||||||
|
copy = WSIZE - offset;
|
||||||
|
if (copy < left) {
|
||||||
|
from = put + copy;
|
||||||
|
copy = left - copy;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
from = put - offset;
|
||||||
|
copy = left;
|
||||||
|
}
|
||||||
|
if (copy > length) copy = length;
|
||||||
|
length -= copy;
|
||||||
|
left -= copy;
|
||||||
|
do {
|
||||||
|
*put++ = *from++;
|
||||||
|
} while (--copy);
|
||||||
|
} while (length != 0);
|
||||||
|
break;
|
||||||
|
|
||||||
|
case DONE:
|
||||||
|
/* inflate stream terminated properly -- write leftover output */
|
||||||
|
ret = Z_STREAM_END;
|
||||||
|
if (left < WSIZE) {
|
||||||
|
if (out(out_desc, window, (unsigned)(WSIZE - left)))
|
||||||
|
ret = Z_BUF_ERROR;
|
||||||
|
}
|
||||||
|
goto inf_leave;
|
||||||
|
|
||||||
|
case BAD:
|
||||||
|
ret = Z_DATA_ERROR;
|
||||||
|
goto inf_leave;
|
||||||
|
|
||||||
|
default: /* can't happen, but makes compilers happy */
|
||||||
|
ret = Z_STREAM_ERROR;
|
||||||
|
goto inf_leave;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Return unused input */
|
||||||
|
inf_leave:
|
||||||
|
strm->next_in = next;
|
||||||
|
strm->avail_in = have;
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ZEXPORT inflateBack9End(strm)
|
||||||
|
z_stream FAR *strm;
|
||||||
|
{
|
||||||
|
if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
|
||||||
|
return Z_STREAM_ERROR;
|
||||||
|
ZFREE(strm, strm->state);
|
||||||
|
strm->state = Z_NULL;
|
||||||
|
Tracev((stderr, "inflate: end\n"));
|
||||||
|
return Z_OK;
|
||||||
|
}
|
||||||
37
contrib/infback9/infback9.h
Normal file
37
contrib/infback9/infback9.h
Normal file
@@ -0,0 +1,37 @@
|
|||||||
|
/* infback9.h -- header for using inflateBack9 functions
|
||||||
|
* Copyright (C) 2003 Mark Adler
|
||||||
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This header file and associated patches provide a decoder for PKWare's
|
||||||
|
* undocumented deflate64 compression method (method 9). Use with infback9.c,
|
||||||
|
* inftree9.h, inftree9.c, and inffix9.h. These patches are not supported.
|
||||||
|
* This should be compiled with zlib, since it uses zutil.h and zutil.o.
|
||||||
|
* This code has not yet been tested on 16-bit architectures. See the
|
||||||
|
* comments in zlib.h for inflateBack() usage. These functions are used
|
||||||
|
* identically, except that there is no windowBits parameter, and a 64K
|
||||||
|
* window must be provided. Also if int's are 16 bits, then a zero for
|
||||||
|
* the third parameter of the "out" function actually means 65536UL.
|
||||||
|
* zlib.h must be included before this header file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
extern "C" {
|
||||||
|
#endif
|
||||||
|
|
||||||
|
ZEXTERN int ZEXPORT inflateBack9 OF((z_stream FAR *strm,
|
||||||
|
in_func in, void FAR *in_desc,
|
||||||
|
out_func out, void FAR *out_desc));
|
||||||
|
ZEXTERN int ZEXPORT inflateBack9End OF((z_stream FAR *strm));
|
||||||
|
ZEXTERN int ZEXPORT inflateBack9Init_ OF((z_stream FAR *strm,
|
||||||
|
unsigned char FAR *window,
|
||||||
|
const char *version,
|
||||||
|
int stream_size));
|
||||||
|
#define inflateBack9Init(strm, window) \
|
||||||
|
inflateBack9Init_((strm), (window), \
|
||||||
|
ZLIB_VERSION, sizeof(z_stream))
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
}
|
||||||
|
#endif
|
||||||
107
contrib/infback9/inffix9.h
Normal file
107
contrib/infback9/inffix9.h
Normal file
@@ -0,0 +1,107 @@
|
|||||||
|
/* inffix9.h -- table for decoding deflate64 fixed codes
|
||||||
|
* Generated automatically by makefixed9().
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* WARNING: this file should *not* be used by applications.
|
||||||
|
It is part of the implementation of this 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},{132,8,115},{130,7,31},{0,8,112},
|
||||||
|
{0,8,48},{0,9,192},{128,7,10},{0,8,96},{0,8,32},{0,9,160},
|
||||||
|
{0,8,0},{0,8,128},{0,8,64},{0,9,224},{128,7,6},{0,8,88},
|
||||||
|
{0,8,24},{0,9,144},{131,7,59},{0,8,120},{0,8,56},{0,9,208},
|
||||||
|
{129,7,17},{0,8,104},{0,8,40},{0,9,176},{0,8,8},{0,8,136},
|
||||||
|
{0,8,72},{0,9,240},{128,7,4},{0,8,84},{0,8,20},{133,8,227},
|
||||||
|
{131,7,43},{0,8,116},{0,8,52},{0,9,200},{129,7,13},{0,8,100},
|
||||||
|
{0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},
|
||||||
|
{128,7,8},{0,8,92},{0,8,28},{0,9,152},{132,7,83},{0,8,124},
|
||||||
|
{0,8,60},{0,9,216},{130,7,23},{0,8,108},{0,8,44},{0,9,184},
|
||||||
|
{0,8,12},{0,8,140},{0,8,76},{0,9,248},{128,7,3},{0,8,82},
|
||||||
|
{0,8,18},{133,8,163},{131,7,35},{0,8,114},{0,8,50},{0,9,196},
|
||||||
|
{129,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},{0,8,130},
|
||||||
|
{0,8,66},{0,9,228},{128,7,7},{0,8,90},{0,8,26},{0,9,148},
|
||||||
|
{132,7,67},{0,8,122},{0,8,58},{0,9,212},{130,7,19},{0,8,106},
|
||||||
|
{0,8,42},{0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},
|
||||||
|
{128,7,5},{0,8,86},{0,8,22},{65,8,0},{131,7,51},{0,8,118},
|
||||||
|
{0,8,54},{0,9,204},{129,7,15},{0,8,102},{0,8,38},{0,9,172},
|
||||||
|
{0,8,6},{0,8,134},{0,8,70},{0,9,236},{128,7,9},{0,8,94},
|
||||||
|
{0,8,30},{0,9,156},{132,7,99},{0,8,126},{0,8,62},{0,9,220},
|
||||||
|
{130,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},{133,8,131},
|
||||||
|
{130,7,31},{0,8,113},{0,8,49},{0,9,194},{128,7,10},{0,8,97},
|
||||||
|
{0,8,33},{0,9,162},{0,8,1},{0,8,129},{0,8,65},{0,9,226},
|
||||||
|
{128,7,6},{0,8,89},{0,8,25},{0,9,146},{131,7,59},{0,8,121},
|
||||||
|
{0,8,57},{0,9,210},{129,7,17},{0,8,105},{0,8,41},{0,9,178},
|
||||||
|
{0,8,9},{0,8,137},{0,8,73},{0,9,242},{128,7,4},{0,8,85},
|
||||||
|
{0,8,21},{144,8,3},{131,7,43},{0,8,117},{0,8,53},{0,9,202},
|
||||||
|
{129,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},
|
||||||
|
{0,8,69},{0,9,234},{128,7,8},{0,8,93},{0,8,29},{0,9,154},
|
||||||
|
{132,7,83},{0,8,125},{0,8,61},{0,9,218},{130,7,23},{0,8,109},
|
||||||
|
{0,8,45},{0,9,186},{0,8,13},{0,8,141},{0,8,77},{0,9,250},
|
||||||
|
{128,7,3},{0,8,83},{0,8,19},{133,8,195},{131,7,35},{0,8,115},
|
||||||
|
{0,8,51},{0,9,198},{129,7,11},{0,8,99},{0,8,35},{0,9,166},
|
||||||
|
{0,8,3},{0,8,131},{0,8,67},{0,9,230},{128,7,7},{0,8,91},
|
||||||
|
{0,8,27},{0,9,150},{132,7,67},{0,8,123},{0,8,59},{0,9,214},
|
||||||
|
{130,7,19},{0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},
|
||||||
|
{0,8,75},{0,9,246},{128,7,5},{0,8,87},{0,8,23},{77,8,0},
|
||||||
|
{131,7,51},{0,8,119},{0,8,55},{0,9,206},{129,7,15},{0,8,103},
|
||||||
|
{0,8,39},{0,9,174},{0,8,7},{0,8,135},{0,8,71},{0,9,238},
|
||||||
|
{128,7,9},{0,8,95},{0,8,31},{0,9,158},{132,7,99},{0,8,127},
|
||||||
|
{0,8,63},{0,9,222},{130,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},{132,8,115},{130,7,31},{0,8,112},{0,8,48},{0,9,193},
|
||||||
|
{128,7,10},{0,8,96},{0,8,32},{0,9,161},{0,8,0},{0,8,128},
|
||||||
|
{0,8,64},{0,9,225},{128,7,6},{0,8,88},{0,8,24},{0,9,145},
|
||||||
|
{131,7,59},{0,8,120},{0,8,56},{0,9,209},{129,7,17},{0,8,104},
|
||||||
|
{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},{0,9,241},
|
||||||
|
{128,7,4},{0,8,84},{0,8,20},{133,8,227},{131,7,43},{0,8,116},
|
||||||
|
{0,8,52},{0,9,201},{129,7,13},{0,8,100},{0,8,36},{0,9,169},
|
||||||
|
{0,8,4},{0,8,132},{0,8,68},{0,9,233},{128,7,8},{0,8,92},
|
||||||
|
{0,8,28},{0,9,153},{132,7,83},{0,8,124},{0,8,60},{0,9,217},
|
||||||
|
{130,7,23},{0,8,108},{0,8,44},{0,9,185},{0,8,12},{0,8,140},
|
||||||
|
{0,8,76},{0,9,249},{128,7,3},{0,8,82},{0,8,18},{133,8,163},
|
||||||
|
{131,7,35},{0,8,114},{0,8,50},{0,9,197},{129,7,11},{0,8,98},
|
||||||
|
{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},
|
||||||
|
{128,7,7},{0,8,90},{0,8,26},{0,9,149},{132,7,67},{0,8,122},
|
||||||
|
{0,8,58},{0,9,213},{130,7,19},{0,8,106},{0,8,42},{0,9,181},
|
||||||
|
{0,8,10},{0,8,138},{0,8,74},{0,9,245},{128,7,5},{0,8,86},
|
||||||
|
{0,8,22},{65,8,0},{131,7,51},{0,8,118},{0,8,54},{0,9,205},
|
||||||
|
{129,7,15},{0,8,102},{0,8,38},{0,9,173},{0,8,6},{0,8,134},
|
||||||
|
{0,8,70},{0,9,237},{128,7,9},{0,8,94},{0,8,30},{0,9,157},
|
||||||
|
{132,7,99},{0,8,126},{0,8,62},{0,9,221},{130,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},{133,8,131},{130,7,31},{0,8,113},
|
||||||
|
{0,8,49},{0,9,195},{128,7,10},{0,8,97},{0,8,33},{0,9,163},
|
||||||
|
{0,8,1},{0,8,129},{0,8,65},{0,9,227},{128,7,6},{0,8,89},
|
||||||
|
{0,8,25},{0,9,147},{131,7,59},{0,8,121},{0,8,57},{0,9,211},
|
||||||
|
{129,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},{0,8,137},
|
||||||
|
{0,8,73},{0,9,243},{128,7,4},{0,8,85},{0,8,21},{144,8,3},
|
||||||
|
{131,7,43},{0,8,117},{0,8,53},{0,9,203},{129,7,13},{0,8,101},
|
||||||
|
{0,8,37},{0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},
|
||||||
|
{128,7,8},{0,8,93},{0,8,29},{0,9,155},{132,7,83},{0,8,125},
|
||||||
|
{0,8,61},{0,9,219},{130,7,23},{0,8,109},{0,8,45},{0,9,187},
|
||||||
|
{0,8,13},{0,8,141},{0,8,77},{0,9,251},{128,7,3},{0,8,83},
|
||||||
|
{0,8,19},{133,8,195},{131,7,35},{0,8,115},{0,8,51},{0,9,199},
|
||||||
|
{129,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},
|
||||||
|
{0,8,67},{0,9,231},{128,7,7},{0,8,91},{0,8,27},{0,9,151},
|
||||||
|
{132,7,67},{0,8,123},{0,8,59},{0,9,215},{130,7,19},{0,8,107},
|
||||||
|
{0,8,43},{0,9,183},{0,8,11},{0,8,139},{0,8,75},{0,9,247},
|
||||||
|
{128,7,5},{0,8,87},{0,8,23},{77,8,0},{131,7,51},{0,8,119},
|
||||||
|
{0,8,55},{0,9,207},{129,7,15},{0,8,103},{0,8,39},{0,9,175},
|
||||||
|
{0,8,7},{0,8,135},{0,8,71},{0,9,239},{128,7,9},{0,8,95},
|
||||||
|
{0,8,31},{0,9,159},{132,7,99},{0,8,127},{0,8,63},{0,9,223},
|
||||||
|
{130,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] = {
|
||||||
|
{128,5,1},{135,5,257},{131,5,17},{139,5,4097},{129,5,5},
|
||||||
|
{137,5,1025},{133,5,65},{141,5,16385},{128,5,3},{136,5,513},
|
||||||
|
{132,5,33},{140,5,8193},{130,5,9},{138,5,2049},{134,5,129},
|
||||||
|
{142,5,32769},{128,5,2},{135,5,385},{131,5,25},{139,5,6145},
|
||||||
|
{129,5,7},{137,5,1537},{133,5,97},{141,5,24577},{128,5,4},
|
||||||
|
{136,5,769},{132,5,49},{140,5,12289},{130,5,13},{138,5,3073},
|
||||||
|
{134,5,193},{142,5,49153}
|
||||||
|
};
|
||||||
47
contrib/infback9/inflate9.h
Normal file
47
contrib/infback9/inflate9.h
Normal file
@@ -0,0 +1,47 @@
|
|||||||
|
/* inflate9.h -- internal inflate state definition
|
||||||
|
* Copyright (C) 1995-2003 Mark Adler
|
||||||
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* WARNING: this file should *not* be used by applications. It is
|
||||||
|
part of the implementation of the compression library and is
|
||||||
|
subject to change. Applications should only use zlib.h.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* Possible inflate modes between inflate() calls */
|
||||||
|
typedef enum {
|
||||||
|
TYPE, /* i: waiting for type bits, including last-flag bit */
|
||||||
|
STORED, /* i: waiting for stored size (length and complement) */
|
||||||
|
TABLE, /* i: waiting for dynamic block table lengths */
|
||||||
|
LEN, /* i: waiting for length/lit code */
|
||||||
|
DONE, /* finished check, done -- remain here until reset */
|
||||||
|
BAD /* got a data error -- remain here until reset */
|
||||||
|
} inflate_mode;
|
||||||
|
|
||||||
|
/*
|
||||||
|
State transitions between above modes -
|
||||||
|
|
||||||
|
(most modes can go to the BAD mode -- not shown for clarity)
|
||||||
|
|
||||||
|
Read deflate blocks:
|
||||||
|
TYPE -> STORED or TABLE or LEN or DONE
|
||||||
|
STORED -> TYPE
|
||||||
|
TABLE -> LENLENS -> CODELENS -> LEN
|
||||||
|
Read deflate codes:
|
||||||
|
LEN -> LEN or TYPE
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* state maintained between inflate() calls. Approximately 7K bytes. */
|
||||||
|
struct inflate_state {
|
||||||
|
/* sliding window */
|
||||||
|
unsigned char FAR *window; /* allocated sliding window, if needed */
|
||||||
|
/* 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 */
|
||||||
|
};
|
||||||
324
contrib/infback9/inftree9.c
Normal file
324
contrib/infback9/inftree9.c
Normal file
@@ -0,0 +1,324 @@
|
|||||||
|
/* inftree9.c -- generate Huffman trees for efficient decoding
|
||||||
|
* Copyright (C) 1995-2017 Mark Adler
|
||||||
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "zutil.h"
|
||||||
|
#include "inftree9.h"
|
||||||
|
|
||||||
|
#define MAXBITS 15
|
||||||
|
|
||||||
|
const char inflate9_copyright[] =
|
||||||
|
" inflate9 1.2.11 Copyright 1995-2017 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_table9(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, 3, 0, 0};
|
||||||
|
static const unsigned short lext[31] = { /* Length codes 257..285 extra */
|
||||||
|
128, 128, 128, 128, 128, 128, 128, 128, 129, 129, 129, 129,
|
||||||
|
130, 130, 130, 130, 131, 131, 131, 131, 132, 132, 132, 132,
|
||||||
|
133, 133, 133, 133, 144, 77, 202};
|
||||||
|
static const unsigned short dbase[32] = { /* Distance codes 0..31 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, 32769, 49153};
|
||||||
|
static const unsigned short dext[32] = { /* Distance codes 0..31 extra */
|
||||||
|
128, 128, 128, 128, 129, 129, 130, 130, 131, 131, 132, 132,
|
||||||
|
133, 133, 134, 134, 135, 135, 136, 136, 137, 137, 138, 138,
|
||||||
|
139, 139, 140, 140, 141, 141, 142, 142};
|
||||||
|
|
||||||
|
/*
|
||||||
|
Process a set of code lengths to create a canonical Huffman code. The
|
||||||
|
code lengths are lens[0..codes-1]. Each length corresponds to the
|
||||||
|
symbols 0..codes-1. The Huffman code is generated by first sorting the
|
||||||
|
symbols by length from short to long, and retaining the symbol order
|
||||||
|
for codes with equal lengths. Then the code starts with all zero bits
|
||||||
|
for the first code of the shortest length, and the codes are integer
|
||||||
|
increments for the same length, and zeros are appended as the length
|
||||||
|
increases. For the deflate format, these bits are stored backwards
|
||||||
|
from their more natural integer increment ordering, and so when the
|
||||||
|
decoding tables are built in the large loop below, the integer codes
|
||||||
|
are incremented backwards.
|
||||||
|
|
||||||
|
This routine assumes, but does not check, that all of the entries in
|
||||||
|
lens[] are in the range 0..MAXBITS. The caller must assure this.
|
||||||
|
1..MAXBITS is interpreted as that code length. zero means that that
|
||||||
|
symbol does not occur in this code.
|
||||||
|
|
||||||
|
The codes are sorted by computing a count of codes for each length,
|
||||||
|
creating from that a table of starting indices for each length in the
|
||||||
|
sorted table, and then entering the symbols in order in the sorted
|
||||||
|
table. The sorted table is work[], with that space being provided by
|
||||||
|
the caller.
|
||||||
|
|
||||||
|
The length counts are used for other purposes as well, i.e. finding
|
||||||
|
the minimum and maximum length codes, determining if there are any
|
||||||
|
codes at all, checking for a valid set of lengths, and looking ahead
|
||||||
|
at length counts to determine sub-table sizes when building the
|
||||||
|
decoding tables.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
|
||||||
|
for (len = 0; len <= MAXBITS; len++)
|
||||||
|
count[len] = 0;
|
||||||
|
for (sym = 0; sym < codes; sym++)
|
||||||
|
count[lens[sym]]++;
|
||||||
|
|
||||||
|
/* bound code lengths, force root to be within code lengths */
|
||||||
|
root = *bits;
|
||||||
|
for (max = MAXBITS; max >= 1; max--)
|
||||||
|
if (count[max] != 0) break;
|
||||||
|
if (root > max) root = max;
|
||||||
|
if (max == 0) return -1; /* no codes! */
|
||||||
|
for (min = 1; min <= MAXBITS; min++)
|
||||||
|
if (count[min] != 0) break;
|
||||||
|
if (root < min) root = min;
|
||||||
|
|
||||||
|
/* check for an over-subscribed or incomplete set of lengths */
|
||||||
|
left = 1;
|
||||||
|
for (len = 1; len <= MAXBITS; len++) {
|
||||||
|
left <<= 1;
|
||||||
|
left -= count[len];
|
||||||
|
if (left < 0) return -1; /* over-subscribed */
|
||||||
|
}
|
||||||
|
if (left > 0 && (type == CODES || 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 for LENS and DIST tables against
|
||||||
|
the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
|
||||||
|
the initial root table size constants. See the comments in inftree9.h
|
||||||
|
for more information.
|
||||||
|
|
||||||
|
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_LENS) ||
|
||||||
|
(type == DISTS && used >= ENOUGH_DISTS))
|
||||||
|
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;
|
||||||
|
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 += 1U << curr;
|
||||||
|
|
||||||
|
/* determine length of next table */
|
||||||
|
curr = len - drop;
|
||||||
|
left = (int)(1 << curr);
|
||||||
|
while (curr + drop < max) {
|
||||||
|
left -= count[curr + drop];
|
||||||
|
if (left <= 0) break;
|
||||||
|
curr++;
|
||||||
|
left <<= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* check for enough space */
|
||||||
|
used += 1U << curr;
|
||||||
|
if ((type == LENS && used >= ENOUGH_LENS) ||
|
||||||
|
(type == DISTS && used >= ENOUGH_DISTS))
|
||||||
|
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;
|
||||||
|
curr = root;
|
||||||
|
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;
|
||||||
|
}
|
||||||
61
contrib/infback9/inftree9.h
Normal file
61
contrib/infback9/inftree9.h
Normal file
@@ -0,0 +1,61 @@
|
|||||||
|
/* inftree9.h -- header to use inftree9.c
|
||||||
|
* Copyright (C) 1995-2008 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
|
||||||
|
100eeeee - length or distance, eeee is the number of extra bits
|
||||||
|
01100000 - end of block
|
||||||
|
01000000 - invalid code
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* Maximum size of the dynamic table. The maximum number of code structures is
|
||||||
|
1446, which is the sum of 852 for literal/length codes and 594 for distance
|
||||||
|
codes. These values were found by exhaustive searches using the program
|
||||||
|
examples/enough.c found in the zlib distribtution. The arguments to that
|
||||||
|
program are the number of symbols, the initial root table size, and the
|
||||||
|
maximum bit length of a code. "enough 286 9 15" for literal/length codes
|
||||||
|
returns returns 852, and "enough 32 6 15" for distance codes returns 594.
|
||||||
|
The initial root table size (9 or 6) is found in the fifth argument of the
|
||||||
|
inflate_table() calls in infback9.c. If the root table size is changed,
|
||||||
|
then these maximum sizes would be need to be recalculated and updated. */
|
||||||
|
#define ENOUGH_LENS 852
|
||||||
|
#define ENOUGH_DISTS 594
|
||||||
|
#define ENOUGH (ENOUGH_LENS+ENOUGH_DISTS)
|
||||||
|
|
||||||
|
/* Type of code to build for inflate_table9() */
|
||||||
|
typedef enum {
|
||||||
|
CODES,
|
||||||
|
LENS,
|
||||||
|
DISTS
|
||||||
|
} codetype;
|
||||||
|
|
||||||
|
extern int inflate_table9 OF((codetype type, unsigned short FAR *lens,
|
||||||
|
unsigned codes, code FAR * FAR *table,
|
||||||
|
unsigned FAR *bits, unsigned short FAR *work));
|
||||||
1157
contrib/inflate86/inffas86.c
Normal file
1157
contrib/inflate86/inffas86.c
Normal file
File diff suppressed because it is too large
Load Diff
1368
contrib/inflate86/inffast.S
Normal file
1368
contrib/inflate86/inffast.S
Normal file
File diff suppressed because it is too large
Load Diff
24
contrib/iostream/test.cpp
Normal file
24
contrib/iostream/test.cpp
Normal file
@@ -0,0 +1,24 @@
|
|||||||
|
|
||||||
|
#include "zfstream.h"
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
|
||||||
|
// Construct a stream object with this filebuffer. Anything sent
|
||||||
|
// to this stream will go to standard out.
|
||||||
|
gzofstream os( 1, ios::out );
|
||||||
|
|
||||||
|
// This text is getting compressed and sent to stdout.
|
||||||
|
// To prove this, run 'test | zcat'.
|
||||||
|
os << "Hello, Mommy" << endl;
|
||||||
|
|
||||||
|
os << setcompressionlevel( Z_NO_COMPRESSION );
|
||||||
|
os << "hello, hello, hi, ho!" << endl;
|
||||||
|
|
||||||
|
setcompressionlevel( os, Z_DEFAULT_COMPRESSION )
|
||||||
|
<< "I'm compressing again" << endl;
|
||||||
|
|
||||||
|
os.close();
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
}
|
||||||
329
contrib/iostream/zfstream.cpp
Normal file
329
contrib/iostream/zfstream.cpp
Normal file
@@ -0,0 +1,329 @@
|
|||||||
|
|
||||||
|
#include "zfstream.h"
|
||||||
|
|
||||||
|
gzfilebuf::gzfilebuf() :
|
||||||
|
file(NULL),
|
||||||
|
mode(0),
|
||||||
|
own_file_descriptor(0)
|
||||||
|
{ }
|
||||||
|
|
||||||
|
gzfilebuf::~gzfilebuf() {
|
||||||
|
|
||||||
|
sync();
|
||||||
|
if ( own_file_descriptor )
|
||||||
|
close();
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
gzfilebuf *gzfilebuf::open( const char *name,
|
||||||
|
int io_mode ) {
|
||||||
|
|
||||||
|
if ( is_open() )
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
char char_mode[10];
|
||||||
|
char *p = char_mode;
|
||||||
|
|
||||||
|
if ( io_mode & ios::in ) {
|
||||||
|
mode = ios::in;
|
||||||
|
*p++ = 'r';
|
||||||
|
} else if ( io_mode & ios::app ) {
|
||||||
|
mode = ios::app;
|
||||||
|
*p++ = 'a';
|
||||||
|
} else {
|
||||||
|
mode = ios::out;
|
||||||
|
*p++ = 'w';
|
||||||
|
}
|
||||||
|
|
||||||
|
if ( io_mode & ios::binary ) {
|
||||||
|
mode |= ios::binary;
|
||||||
|
*p++ = 'b';
|
||||||
|
}
|
||||||
|
|
||||||
|
// Hard code the compression level
|
||||||
|
if ( io_mode & (ios::out|ios::app )) {
|
||||||
|
*p++ = '9';
|
||||||
|
}
|
||||||
|
|
||||||
|
// Put the end-of-string indicator
|
||||||
|
*p = '\0';
|
||||||
|
|
||||||
|
if ( (file = gzopen(name, char_mode)) == NULL )
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
own_file_descriptor = 1;
|
||||||
|
|
||||||
|
return this;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
gzfilebuf *gzfilebuf::attach( int file_descriptor,
|
||||||
|
int io_mode ) {
|
||||||
|
|
||||||
|
if ( is_open() )
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
char char_mode[10];
|
||||||
|
char *p = char_mode;
|
||||||
|
|
||||||
|
if ( io_mode & ios::in ) {
|
||||||
|
mode = ios::in;
|
||||||
|
*p++ = 'r';
|
||||||
|
} else if ( io_mode & ios::app ) {
|
||||||
|
mode = ios::app;
|
||||||
|
*p++ = 'a';
|
||||||
|
} else {
|
||||||
|
mode = ios::out;
|
||||||
|
*p++ = 'w';
|
||||||
|
}
|
||||||
|
|
||||||
|
if ( io_mode & ios::binary ) {
|
||||||
|
mode |= ios::binary;
|
||||||
|
*p++ = 'b';
|
||||||
|
}
|
||||||
|
|
||||||
|
// Hard code the compression level
|
||||||
|
if ( io_mode & (ios::out|ios::app )) {
|
||||||
|
*p++ = '9';
|
||||||
|
}
|
||||||
|
|
||||||
|
// Put the end-of-string indicator
|
||||||
|
*p = '\0';
|
||||||
|
|
||||||
|
if ( (file = gzdopen(file_descriptor, char_mode)) == NULL )
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
own_file_descriptor = 0;
|
||||||
|
|
||||||
|
return this;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
gzfilebuf *gzfilebuf::close() {
|
||||||
|
|
||||||
|
if ( is_open() ) {
|
||||||
|
|
||||||
|
sync();
|
||||||
|
gzclose( file );
|
||||||
|
file = NULL;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
return this;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
int gzfilebuf::setcompressionlevel( int comp_level ) {
|
||||||
|
|
||||||
|
return gzsetparams(file, comp_level, -2);
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
int gzfilebuf::setcompressionstrategy( int comp_strategy ) {
|
||||||
|
|
||||||
|
return gzsetparams(file, -2, comp_strategy);
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
streampos gzfilebuf::seekoff( streamoff off, ios::seek_dir dir, int which ) {
|
||||||
|
|
||||||
|
return streampos(EOF);
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
int gzfilebuf::underflow() {
|
||||||
|
|
||||||
|
// If the file hasn't been opened for reading, error.
|
||||||
|
if ( !is_open() || !(mode & ios::in) )
|
||||||
|
return EOF;
|
||||||
|
|
||||||
|
// if a buffer doesn't exists, allocate one.
|
||||||
|
if ( !base() ) {
|
||||||
|
|
||||||
|
if ( (allocate()) == EOF )
|
||||||
|
return EOF;
|
||||||
|
setp(0,0);
|
||||||
|
|
||||||
|
} else {
|
||||||
|
|
||||||
|
if ( in_avail() )
|
||||||
|
return (unsigned char) *gptr();
|
||||||
|
|
||||||
|
if ( out_waiting() ) {
|
||||||
|
if ( flushbuf() == EOF )
|
||||||
|
return EOF;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
// Attempt to fill the buffer.
|
||||||
|
|
||||||
|
int result = fillbuf();
|
||||||
|
if ( result == EOF ) {
|
||||||
|
// disable get area
|
||||||
|
setg(0,0,0);
|
||||||
|
return EOF;
|
||||||
|
}
|
||||||
|
|
||||||
|
return (unsigned char) *gptr();
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
int gzfilebuf::overflow( int c ) {
|
||||||
|
|
||||||
|
if ( !is_open() || !(mode & ios::out) )
|
||||||
|
return EOF;
|
||||||
|
|
||||||
|
if ( !base() ) {
|
||||||
|
if ( allocate() == EOF )
|
||||||
|
return EOF;
|
||||||
|
setg(0,0,0);
|
||||||
|
} else {
|
||||||
|
if (in_avail()) {
|
||||||
|
return EOF;
|
||||||
|
}
|
||||||
|
if (out_waiting()) {
|
||||||
|
if (flushbuf() == EOF)
|
||||||
|
return EOF;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int bl = blen();
|
||||||
|
setp( base(), base() + bl);
|
||||||
|
|
||||||
|
if ( c != EOF ) {
|
||||||
|
|
||||||
|
*pptr() = c;
|
||||||
|
pbump(1);
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
int gzfilebuf::sync() {
|
||||||
|
|
||||||
|
if ( !is_open() )
|
||||||
|
return EOF;
|
||||||
|
|
||||||
|
if ( out_waiting() )
|
||||||
|
return flushbuf();
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
int gzfilebuf::flushbuf() {
|
||||||
|
|
||||||
|
int n;
|
||||||
|
char *q;
|
||||||
|
|
||||||
|
q = pbase();
|
||||||
|
n = pptr() - q;
|
||||||
|
|
||||||
|
if ( gzwrite( file, q, n) < n )
|
||||||
|
return EOF;
|
||||||
|
|
||||||
|
setp(0,0);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
int gzfilebuf::fillbuf() {
|
||||||
|
|
||||||
|
int required;
|
||||||
|
char *p;
|
||||||
|
|
||||||
|
p = base();
|
||||||
|
|
||||||
|
required = blen();
|
||||||
|
|
||||||
|
int t = gzread( file, p, required );
|
||||||
|
|
||||||
|
if ( t <= 0) return EOF;
|
||||||
|
|
||||||
|
setg( base(), base(), base()+t);
|
||||||
|
|
||||||
|
return t;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
gzfilestream_common::gzfilestream_common() :
|
||||||
|
ios( gzfilestream_common::rdbuf() )
|
||||||
|
{ }
|
||||||
|
|
||||||
|
gzfilestream_common::~gzfilestream_common()
|
||||||
|
{ }
|
||||||
|
|
||||||
|
void gzfilestream_common::attach( int fd, int io_mode ) {
|
||||||
|
|
||||||
|
if ( !buffer.attach( fd, io_mode) )
|
||||||
|
clear( ios::failbit | ios::badbit );
|
||||||
|
else
|
||||||
|
clear();
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
void gzfilestream_common::open( const char *name, int io_mode ) {
|
||||||
|
|
||||||
|
if ( !buffer.open( name, io_mode ) )
|
||||||
|
clear( ios::failbit | ios::badbit );
|
||||||
|
else
|
||||||
|
clear();
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
void gzfilestream_common::close() {
|
||||||
|
|
||||||
|
if ( !buffer.close() )
|
||||||
|
clear( ios::failbit | ios::badbit );
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
gzfilebuf *gzfilestream_common::rdbuf()
|
||||||
|
{
|
||||||
|
return &buffer;
|
||||||
|
}
|
||||||
|
|
||||||
|
gzifstream::gzifstream() :
|
||||||
|
ios( gzfilestream_common::rdbuf() )
|
||||||
|
{
|
||||||
|
clear( ios::badbit );
|
||||||
|
}
|
||||||
|
|
||||||
|
gzifstream::gzifstream( const char *name, int io_mode ) :
|
||||||
|
ios( gzfilestream_common::rdbuf() )
|
||||||
|
{
|
||||||
|
gzfilestream_common::open( name, io_mode );
|
||||||
|
}
|
||||||
|
|
||||||
|
gzifstream::gzifstream( int fd, int io_mode ) :
|
||||||
|
ios( gzfilestream_common::rdbuf() )
|
||||||
|
{
|
||||||
|
gzfilestream_common::attach( fd, io_mode );
|
||||||
|
}
|
||||||
|
|
||||||
|
gzifstream::~gzifstream() { }
|
||||||
|
|
||||||
|
gzofstream::gzofstream() :
|
||||||
|
ios( gzfilestream_common::rdbuf() )
|
||||||
|
{
|
||||||
|
clear( ios::badbit );
|
||||||
|
}
|
||||||
|
|
||||||
|
gzofstream::gzofstream( const char *name, int io_mode ) :
|
||||||
|
ios( gzfilestream_common::rdbuf() )
|
||||||
|
{
|
||||||
|
gzfilestream_common::open( name, io_mode );
|
||||||
|
}
|
||||||
|
|
||||||
|
gzofstream::gzofstream( int fd, int io_mode ) :
|
||||||
|
ios( gzfilestream_common::rdbuf() )
|
||||||
|
{
|
||||||
|
gzfilestream_common::attach( fd, io_mode );
|
||||||
|
}
|
||||||
|
|
||||||
|
gzofstream::~gzofstream() { }
|
||||||
128
contrib/iostream/zfstream.h
Normal file
128
contrib/iostream/zfstream.h
Normal file
@@ -0,0 +1,128 @@
|
|||||||
|
|
||||||
|
#ifndef zfstream_h
|
||||||
|
#define zfstream_h
|
||||||
|
|
||||||
|
#include <fstream.h>
|
||||||
|
#include "zlib.h"
|
||||||
|
|
||||||
|
class gzfilebuf : public streambuf {
|
||||||
|
|
||||||
|
public:
|
||||||
|
|
||||||
|
gzfilebuf( );
|
||||||
|
virtual ~gzfilebuf();
|
||||||
|
|
||||||
|
gzfilebuf *open( const char *name, int io_mode );
|
||||||
|
gzfilebuf *attach( int file_descriptor, int io_mode );
|
||||||
|
gzfilebuf *close();
|
||||||
|
|
||||||
|
int setcompressionlevel( int comp_level );
|
||||||
|
int setcompressionstrategy( int comp_strategy );
|
||||||
|
|
||||||
|
inline int is_open() const { return (file !=NULL); }
|
||||||
|
|
||||||
|
virtual streampos seekoff( streamoff, ios::seek_dir, int );
|
||||||
|
|
||||||
|
virtual int sync();
|
||||||
|
|
||||||
|
protected:
|
||||||
|
|
||||||
|
virtual int underflow();
|
||||||
|
virtual int overflow( int = EOF );
|
||||||
|
|
||||||
|
private:
|
||||||
|
|
||||||
|
gzFile file;
|
||||||
|
short mode;
|
||||||
|
short own_file_descriptor;
|
||||||
|
|
||||||
|
int flushbuf();
|
||||||
|
int fillbuf();
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
class gzfilestream_common : virtual public ios {
|
||||||
|
|
||||||
|
friend class gzifstream;
|
||||||
|
friend class gzofstream;
|
||||||
|
friend gzofstream &setcompressionlevel( gzofstream &, int );
|
||||||
|
friend gzofstream &setcompressionstrategy( gzofstream &, int );
|
||||||
|
|
||||||
|
public:
|
||||||
|
virtual ~gzfilestream_common();
|
||||||
|
|
||||||
|
void attach( int fd, int io_mode );
|
||||||
|
void open( const char *name, int io_mode );
|
||||||
|
void close();
|
||||||
|
|
||||||
|
protected:
|
||||||
|
gzfilestream_common();
|
||||||
|
|
||||||
|
private:
|
||||||
|
gzfilebuf *rdbuf();
|
||||||
|
|
||||||
|
gzfilebuf buffer;
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
class gzifstream : public gzfilestream_common, public istream {
|
||||||
|
|
||||||
|
public:
|
||||||
|
|
||||||
|
gzifstream();
|
||||||
|
gzifstream( const char *name, int io_mode = ios::in );
|
||||||
|
gzifstream( int fd, int io_mode = ios::in );
|
||||||
|
|
||||||
|
virtual ~gzifstream();
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
class gzofstream : public gzfilestream_common, public ostream {
|
||||||
|
|
||||||
|
public:
|
||||||
|
|
||||||
|
gzofstream();
|
||||||
|
gzofstream( const char *name, int io_mode = ios::out );
|
||||||
|
gzofstream( int fd, int io_mode = ios::out );
|
||||||
|
|
||||||
|
virtual ~gzofstream();
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
template<class T> class gzomanip {
|
||||||
|
friend gzofstream &operator<<(gzofstream &, const gzomanip<T> &);
|
||||||
|
public:
|
||||||
|
gzomanip(gzofstream &(*f)(gzofstream &, T), T v) : func(f), val(v) { }
|
||||||
|
private:
|
||||||
|
gzofstream &(*func)(gzofstream &, T);
|
||||||
|
T val;
|
||||||
|
};
|
||||||
|
|
||||||
|
template<class T> gzofstream &operator<<(gzofstream &s, const gzomanip<T> &m)
|
||||||
|
{
|
||||||
|
return (*m.func)(s, m.val);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline gzofstream &setcompressionlevel( gzofstream &s, int l )
|
||||||
|
{
|
||||||
|
(s.rdbuf())->setcompressionlevel(l);
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline gzofstream &setcompressionstrategy( gzofstream &s, int l )
|
||||||
|
{
|
||||||
|
(s.rdbuf())->setcompressionstrategy(l);
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline gzomanip<int> setcompressionlevel(int l)
|
||||||
|
{
|
||||||
|
return gzomanip<int>(&setcompressionlevel,l);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline gzomanip<int> setcompressionstrategy(int l)
|
||||||
|
{
|
||||||
|
return gzomanip<int>(&setcompressionstrategy,l);
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
307
contrib/iostream2/zstream.h
Normal file
307
contrib/iostream2/zstream.h
Normal file
@@ -0,0 +1,307 @@
|
|||||||
|
/*
|
||||||
|
*
|
||||||
|
* Copyright (c) 1997
|
||||||
|
* Christian Michelsen Research AS
|
||||||
|
* Advanced Computing
|
||||||
|
* Fantoftvegen 38, 5036 BERGEN, Norway
|
||||||
|
* http://www.cmr.no
|
||||||
|
*
|
||||||
|
* Permission to use, copy, modify, distribute and sell this software
|
||||||
|
* and its documentation for any purpose is hereby granted without fee,
|
||||||
|
* provided that the above copyright notice appear in all copies and
|
||||||
|
* that both that copyright notice and this permission notice appear
|
||||||
|
* in supporting documentation. Christian Michelsen Research AS makes no
|
||||||
|
* representations about the suitability of this software for any
|
||||||
|
* purpose. It is provided "as is" without express or implied warranty.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef ZSTREAM__H
|
||||||
|
#define ZSTREAM__H
|
||||||
|
|
||||||
|
/*
|
||||||
|
* zstream.h - C++ interface to the 'zlib' general purpose compression library
|
||||||
|
* $Id: zstream.h 1.1 1997-06-25 12:00:56+02 tyge Exp tyge $
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <strstream.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include "zlib.h"
|
||||||
|
|
||||||
|
#if defined(_WIN32)
|
||||||
|
# include <fcntl.h>
|
||||||
|
# include <io.h>
|
||||||
|
# define SET_BINARY_MODE(file) setmode(fileno(file), O_BINARY)
|
||||||
|
#else
|
||||||
|
# define SET_BINARY_MODE(file)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
class zstringlen {
|
||||||
|
public:
|
||||||
|
zstringlen(class izstream&);
|
||||||
|
zstringlen(class ozstream&, const char*);
|
||||||
|
size_t value() const { return val.word; }
|
||||||
|
private:
|
||||||
|
struct Val { unsigned char byte; size_t word; } val;
|
||||||
|
};
|
||||||
|
|
||||||
|
// ----------------------------- izstream -----------------------------
|
||||||
|
|
||||||
|
class izstream
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
izstream() : m_fp(0) {}
|
||||||
|
izstream(FILE* fp) : m_fp(0) { open(fp); }
|
||||||
|
izstream(const char* name) : m_fp(0) { open(name); }
|
||||||
|
~izstream() { close(); }
|
||||||
|
|
||||||
|
/* Opens a gzip (.gz) file for reading.
|
||||||
|
* open() can be used to read a file which is not in gzip format;
|
||||||
|
* in this case read() will directly read from the file without
|
||||||
|
* decompression. errno can be checked to distinguish two error
|
||||||
|
* cases (if errno is zero, the zlib error is Z_MEM_ERROR).
|
||||||
|
*/
|
||||||
|
void open(const char* name) {
|
||||||
|
if (m_fp) close();
|
||||||
|
m_fp = ::gzopen(name, "rb");
|
||||||
|
}
|
||||||
|
|
||||||
|
void open(FILE* fp) {
|
||||||
|
SET_BINARY_MODE(fp);
|
||||||
|
if (m_fp) close();
|
||||||
|
m_fp = ::gzdopen(fileno(fp), "rb");
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Flushes all pending input if necessary, closes the compressed file
|
||||||
|
* and deallocates all the (de)compression state. The return value is
|
||||||
|
* the zlib error number (see function error() below).
|
||||||
|
*/
|
||||||
|
int close() {
|
||||||
|
int r = ::gzclose(m_fp);
|
||||||
|
m_fp = 0; return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Binary read the given number of bytes from the compressed file.
|
||||||
|
*/
|
||||||
|
int read(void* buf, size_t len) {
|
||||||
|
return ::gzread(m_fp, buf, len);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* 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.
|
||||||
|
*/
|
||||||
|
const char* error(int* errnum) {
|
||||||
|
return ::gzerror(m_fp, errnum);
|
||||||
|
}
|
||||||
|
|
||||||
|
gzFile fp() { return m_fp; }
|
||||||
|
|
||||||
|
private:
|
||||||
|
gzFile m_fp;
|
||||||
|
};
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Binary read the given (array of) object(s) from the compressed file.
|
||||||
|
* If the input file was not in gzip format, read() copies the objects number
|
||||||
|
* of bytes into the buffer.
|
||||||
|
* returns the number of uncompressed bytes actually read
|
||||||
|
* (0 for end of file, -1 for error).
|
||||||
|
*/
|
||||||
|
template <class T, class Items>
|
||||||
|
inline int read(izstream& zs, T* x, Items items) {
|
||||||
|
return ::gzread(zs.fp(), x, items*sizeof(T));
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Binary input with the '>' operator.
|
||||||
|
*/
|
||||||
|
template <class T>
|
||||||
|
inline izstream& operator>(izstream& zs, T& x) {
|
||||||
|
::gzread(zs.fp(), &x, sizeof(T));
|
||||||
|
return zs;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
inline zstringlen::zstringlen(izstream& zs) {
|
||||||
|
zs > val.byte;
|
||||||
|
if (val.byte == 255) zs > val.word;
|
||||||
|
else val.word = val.byte;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Read length of string + the string with the '>' operator.
|
||||||
|
*/
|
||||||
|
inline izstream& operator>(izstream& zs, char* x) {
|
||||||
|
zstringlen len(zs);
|
||||||
|
::gzread(zs.fp(), x, len.value());
|
||||||
|
x[len.value()] = '\0';
|
||||||
|
return zs;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline char* read_string(izstream& zs) {
|
||||||
|
zstringlen len(zs);
|
||||||
|
char* x = new char[len.value()+1];
|
||||||
|
::gzread(zs.fp(), x, len.value());
|
||||||
|
x[len.value()] = '\0';
|
||||||
|
return x;
|
||||||
|
}
|
||||||
|
|
||||||
|
// ----------------------------- ozstream -----------------------------
|
||||||
|
|
||||||
|
class ozstream
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
ozstream() : m_fp(0), m_os(0) {
|
||||||
|
}
|
||||||
|
ozstream(FILE* fp, int level = Z_DEFAULT_COMPRESSION)
|
||||||
|
: m_fp(0), m_os(0) {
|
||||||
|
open(fp, level);
|
||||||
|
}
|
||||||
|
ozstream(const char* name, int level = Z_DEFAULT_COMPRESSION)
|
||||||
|
: m_fp(0), m_os(0) {
|
||||||
|
open(name, level);
|
||||||
|
}
|
||||||
|
~ozstream() {
|
||||||
|
close();
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Opens a gzip (.gz) file for writing.
|
||||||
|
* The compression level parameter should be in 0..9
|
||||||
|
* errno can be checked to distinguish two error cases
|
||||||
|
* (if errno is zero, the zlib error is Z_MEM_ERROR).
|
||||||
|
*/
|
||||||
|
void open(const char* name, int level = Z_DEFAULT_COMPRESSION) {
|
||||||
|
char mode[4] = "wb\0";
|
||||||
|
if (level != Z_DEFAULT_COMPRESSION) mode[2] = '0'+level;
|
||||||
|
if (m_fp) close();
|
||||||
|
m_fp = ::gzopen(name, mode);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* open from a FILE pointer.
|
||||||
|
*/
|
||||||
|
void open(FILE* fp, int level = Z_DEFAULT_COMPRESSION) {
|
||||||
|
SET_BINARY_MODE(fp);
|
||||||
|
char mode[4] = "wb\0";
|
||||||
|
if (level != Z_DEFAULT_COMPRESSION) mode[2] = '0'+level;
|
||||||
|
if (m_fp) close();
|
||||||
|
m_fp = ::gzdopen(fileno(fp), mode);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* 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 error() below).
|
||||||
|
*/
|
||||||
|
int close() {
|
||||||
|
if (m_os) {
|
||||||
|
::gzwrite(m_fp, m_os->str(), m_os->pcount());
|
||||||
|
delete[] m_os->str(); delete m_os; m_os = 0;
|
||||||
|
}
|
||||||
|
int r = ::gzclose(m_fp); m_fp = 0; return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Binary write the given number of bytes into the compressed file.
|
||||||
|
*/
|
||||||
|
int write(const void* buf, size_t len) {
|
||||||
|
return ::gzwrite(m_fp, (voidp) buf, len);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* 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). flush() returns Z_OK if
|
||||||
|
* the flush_ parameter is Z_FINISH and all output could be flushed.
|
||||||
|
* flush() should be called only when strictly necessary because it can
|
||||||
|
* degrade compression.
|
||||||
|
*/
|
||||||
|
int flush(int _flush) {
|
||||||
|
os_flush();
|
||||||
|
return ::gzflush(m_fp, _flush);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* 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.
|
||||||
|
*/
|
||||||
|
const char* error(int* errnum) {
|
||||||
|
return ::gzerror(m_fp, errnum);
|
||||||
|
}
|
||||||
|
|
||||||
|
gzFile fp() { return m_fp; }
|
||||||
|
|
||||||
|
ostream& os() {
|
||||||
|
if (m_os == 0) m_os = new ostrstream;
|
||||||
|
return *m_os;
|
||||||
|
}
|
||||||
|
|
||||||
|
void os_flush() {
|
||||||
|
if (m_os && m_os->pcount()>0) {
|
||||||
|
ostrstream* oss = new ostrstream;
|
||||||
|
oss->fill(m_os->fill());
|
||||||
|
oss->flags(m_os->flags());
|
||||||
|
oss->precision(m_os->precision());
|
||||||
|
oss->width(m_os->width());
|
||||||
|
::gzwrite(m_fp, m_os->str(), m_os->pcount());
|
||||||
|
delete[] m_os->str(); delete m_os; m_os = oss;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
gzFile m_fp;
|
||||||
|
ostrstream* m_os;
|
||||||
|
};
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Binary write the given (array of) object(s) into the compressed file.
|
||||||
|
* returns the number of uncompressed bytes actually written
|
||||||
|
* (0 in case of error).
|
||||||
|
*/
|
||||||
|
template <class T, class Items>
|
||||||
|
inline int write(ozstream& zs, const T* x, Items items) {
|
||||||
|
return ::gzwrite(zs.fp(), (voidp) x, items*sizeof(T));
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Binary output with the '<' operator.
|
||||||
|
*/
|
||||||
|
template <class T>
|
||||||
|
inline ozstream& operator<(ozstream& zs, const T& x) {
|
||||||
|
::gzwrite(zs.fp(), (voidp) &x, sizeof(T));
|
||||||
|
return zs;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline zstringlen::zstringlen(ozstream& zs, const char* x) {
|
||||||
|
val.byte = 255; val.word = ::strlen(x);
|
||||||
|
if (val.word < 255) zs < (val.byte = val.word);
|
||||||
|
else zs < val;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Write length of string + the string with the '<' operator.
|
||||||
|
*/
|
||||||
|
inline ozstream& operator<(ozstream& zs, const char* x) {
|
||||||
|
zstringlen len(zs, x);
|
||||||
|
::gzwrite(zs.fp(), (voidp) x, len.value());
|
||||||
|
return zs;
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef _MSC_VER
|
||||||
|
inline ozstream& operator<(ozstream& zs, char* const& x) {
|
||||||
|
return zs < (const char*) x;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Ascii write with the << operator;
|
||||||
|
*/
|
||||||
|
template <class T>
|
||||||
|
inline ostream& operator<<(ozstream& zs, const T& x) {
|
||||||
|
zs.os_flush();
|
||||||
|
return zs.os() << x;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
25
contrib/iostream2/zstream_test.cpp
Normal file
25
contrib/iostream2/zstream_test.cpp
Normal file
@@ -0,0 +1,25 @@
|
|||||||
|
#include "zstream.h"
|
||||||
|
#include <math.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <iomanip.h>
|
||||||
|
|
||||||
|
void main() {
|
||||||
|
char h[256] = "Hello";
|
||||||
|
char* g = "Goodbye";
|
||||||
|
ozstream out("temp.gz");
|
||||||
|
out < "This works well" < h < g;
|
||||||
|
out.close();
|
||||||
|
|
||||||
|
izstream in("temp.gz"); // read it back
|
||||||
|
char *x = read_string(in), *y = new char[256], z[256];
|
||||||
|
in > y > z;
|
||||||
|
in.close();
|
||||||
|
cout << x << endl << y << endl << z << endl;
|
||||||
|
|
||||||
|
out.open("temp.gz"); // try ascii output; zcat temp.gz to see the results
|
||||||
|
out << setw(50) << setfill('#') << setprecision(20) << x << endl << y << endl << z << endl;
|
||||||
|
out << z << endl << y << endl << x << endl;
|
||||||
|
out << 1.1234567890123456789 << endl;
|
||||||
|
|
||||||
|
delete[] x; delete[] y;
|
||||||
|
}
|
||||||
35
contrib/iostream3/README
Normal file
35
contrib/iostream3/README
Normal file
@@ -0,0 +1,35 @@
|
|||||||
|
These classes provide a C++ stream interface to the zlib library. It allows you
|
||||||
|
to do things like:
|
||||||
|
|
||||||
|
gzofstream outf("blah.gz");
|
||||||
|
outf << "These go into the gzip file " << 123 << endl;
|
||||||
|
|
||||||
|
It does this by deriving a specialized stream buffer for gzipped files, which is
|
||||||
|
the way Stroustrup would have done it. :->
|
||||||
|
|
||||||
|
The gzifstream and gzofstream classes were originally written by Kevin Ruland
|
||||||
|
and made available in the zlib contrib/iostream directory. The older version still
|
||||||
|
compiles under gcc 2.xx, but not under gcc 3.xx, which sparked the development of
|
||||||
|
this version.
|
||||||
|
|
||||||
|
The new classes are as standard-compliant as possible, closely following the
|
||||||
|
approach of the standard library's fstream classes. It compiles under gcc versions
|
||||||
|
3.2 and 3.3, but not under gcc 2.xx. This is mainly due to changes in the standard
|
||||||
|
library naming scheme. The new version of gzifstream/gzofstream/gzfilebuf differs
|
||||||
|
from the previous one in the following respects:
|
||||||
|
- added showmanyc
|
||||||
|
- added setbuf, with support for unbuffered output via setbuf(0,0)
|
||||||
|
- a few bug fixes of stream behavior
|
||||||
|
- gzipped output file opened with default compression level instead of maximum level
|
||||||
|
- setcompressionlevel()/strategy() members replaced by single setcompression()
|
||||||
|
|
||||||
|
The code is provided "as is", with the permission to use, copy, modify, distribute
|
||||||
|
and sell it for any purpose without fee.
|
||||||
|
|
||||||
|
Ludwig Schwardt
|
||||||
|
<schwardt@sun.ac.za>
|
||||||
|
|
||||||
|
DSP Lab
|
||||||
|
Electrical & Electronic Engineering Department
|
||||||
|
University of Stellenbosch
|
||||||
|
South Africa
|
||||||
17
contrib/iostream3/TODO
Normal file
17
contrib/iostream3/TODO
Normal file
@@ -0,0 +1,17 @@
|
|||||||
|
Possible upgrades to gzfilebuf:
|
||||||
|
|
||||||
|
- The ability to do putback (e.g. putbackfail)
|
||||||
|
|
||||||
|
- The ability to seek (zlib supports this, but could be slow/tricky)
|
||||||
|
|
||||||
|
- Simultaneous read/write access (does it make sense?)
|
||||||
|
|
||||||
|
- Support for ios_base::ate open mode
|
||||||
|
|
||||||
|
- Locale support?
|
||||||
|
|
||||||
|
- Check public interface to see which calls give problems
|
||||||
|
(due to dependence on library internals)
|
||||||
|
|
||||||
|
- Override operator<<(ostream&, gzfilebuf*) to allow direct copying
|
||||||
|
of stream buffer to stream ( i.e. os << is.rdbuf(); )
|
||||||
50
contrib/iostream3/test.cc
Normal file
50
contrib/iostream3/test.cc
Normal file
@@ -0,0 +1,50 @@
|
|||||||
|
/*
|
||||||
|
* Test program for gzifstream and gzofstream
|
||||||
|
*
|
||||||
|
* by Ludwig Schwardt <schwardt@sun.ac.za>
|
||||||
|
* original version by Kevin Ruland <kevin@rodin.wustl.edu>
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "zfstream.h"
|
||||||
|
#include <iostream> // for cout
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
|
||||||
|
gzofstream outf;
|
||||||
|
gzifstream inf;
|
||||||
|
char buf[80];
|
||||||
|
|
||||||
|
outf.open("test1.txt.gz");
|
||||||
|
outf << "The quick brown fox sidestepped the lazy canine\n"
|
||||||
|
<< 1.3 << "\nPlan " << 9 << std::endl;
|
||||||
|
outf.close();
|
||||||
|
std::cout << "Wrote the following message to 'test1.txt.gz' (check with zcat or zless):\n"
|
||||||
|
<< "The quick brown fox sidestepped the lazy canine\n"
|
||||||
|
<< 1.3 << "\nPlan " << 9 << std::endl;
|
||||||
|
|
||||||
|
std::cout << "\nReading 'test1.txt.gz' (buffered) produces:\n";
|
||||||
|
inf.open("test1.txt.gz");
|
||||||
|
while (inf.getline(buf,80,'\n')) {
|
||||||
|
std::cout << buf << "\t(" << inf.rdbuf()->in_avail() << " chars left in buffer)\n";
|
||||||
|
}
|
||||||
|
inf.close();
|
||||||
|
|
||||||
|
outf.rdbuf()->pubsetbuf(0,0);
|
||||||
|
outf.open("test2.txt.gz");
|
||||||
|
outf << setcompression(Z_NO_COMPRESSION)
|
||||||
|
<< "The quick brown fox sidestepped the lazy canine\n"
|
||||||
|
<< 1.3 << "\nPlan " << 9 << std::endl;
|
||||||
|
outf.close();
|
||||||
|
std::cout << "\nWrote the same message to 'test2.txt.gz' in uncompressed form";
|
||||||
|
|
||||||
|
std::cout << "\nReading 'test2.txt.gz' (unbuffered) produces:\n";
|
||||||
|
inf.rdbuf()->pubsetbuf(0,0);
|
||||||
|
inf.open("test2.txt.gz");
|
||||||
|
while (inf.getline(buf,80,'\n')) {
|
||||||
|
std::cout << buf << "\t(" << inf.rdbuf()->in_avail() << " chars left in buffer)\n";
|
||||||
|
}
|
||||||
|
inf.close();
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
}
|
||||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user