gosu 0.7.15 → 0.7.16
Sign up to get free protection for your applications and to get access to all the features.
- data/Gosu/Audio.hpp +18 -29
- data/Gosu/Bitmap.hpp +1 -1
- data/Gosu/Color.hpp +16 -1
- data/Gosu/Font.hpp +3 -3
- data/Gosu/Graphics.hpp +7 -1
- data/Gosu/Image.hpp +4 -4
- data/Gosu/TextInput.hpp +10 -2
- data/Gosu/Version.hpp +2 -2
- data/Gosu/Window.hpp +4 -3
- data/GosuImpl/Audio/AudioOpenAL.mm +46 -29
- data/GosuImpl/AudioFmod.cpp +58 -61
- data/GosuImpl/AudioSDL.cpp +47 -32
- data/GosuImpl/Graphics/BitmapColorKey.cpp +1 -1
- data/GosuImpl/Graphics/BitmapUtils.cpp +2 -2
- data/GosuImpl/Graphics/Color.cpp +12 -0
- data/GosuImpl/Graphics/Font.cpp +1 -1
- data/GosuImpl/Graphics/Text.cpp +2 -2
- data/GosuImpl/Graphics/Texture.cpp +3 -0
- data/GosuImpl/ObjGosu/ObjGosu.mm +36 -0
- data/GosuImpl/ObjGosu/ObjGosuColor.mm +84 -0
- data/GosuImpl/ObjGosu/ObjGosuFont.mm +42 -0
- data/GosuImpl/ObjGosu/ObjGosuImage.h +7 -0
- data/GosuImpl/ObjGosu/ObjGosuImage.mm +65 -0
- data/GosuImpl/ObjGosu/ObjGosuSample.mm +32 -0
- data/GosuImpl/ObjGosu/ObjGosuSong.mm +43 -0
- data/GosuImpl/ObjGosu/ObjGosuWindow.h +32 -0
- data/GosuImpl/ObjGosu/ObjGosuWindow.mm +155 -0
- data/GosuImpl/RubyGosu.swg +48 -21
- data/GosuImpl/RubyGosuStub.mm +6 -0
- data/GosuImpl/RubyGosu_wrap.cxx +358 -195
- data/GosuImpl/RubyGosu_wrap.h +9 -0
- data/GosuImpl/TextInputMac.mm +10 -4
- data/GosuImpl/TextInputWin.cpp +4 -2
- data/GosuImpl/TextInputX.cpp +16 -14
- data/GosuImpl/WindowMac.mm +33 -23
- data/GosuImpl/WindowWin.cpp +22 -16
- data/GosuImpl/WindowX.cpp +17 -16
- data/Rakefile +38 -12
- data/dependencies/libogg/AUTHORS +4 -0
- data/dependencies/libogg/CHANGES +33 -0
- data/dependencies/libogg/COPYING +28 -0
- data/dependencies/libogg/Makefile.am +32 -0
- data/dependencies/libogg/Makefile.in +713 -0
- data/dependencies/libogg/README +103 -0
- data/dependencies/libogg/aclocal.m4 +6807 -0
- data/dependencies/libogg/compile +142 -0
- data/dependencies/libogg/config.guess +1465 -0
- data/dependencies/libogg/config.h.in +70 -0
- data/dependencies/libogg/config.sub +1569 -0
- data/dependencies/libogg/configure +23018 -0
- data/dependencies/libogg/configure.in +301 -0
- data/dependencies/libogg/debian/changelog +68 -0
- data/dependencies/libogg/debian/control +22 -0
- data/dependencies/libogg/debian/copyright +37 -0
- data/dependencies/libogg/debian/libogg-dev.docs +1 -0
- data/dependencies/libogg/debian/libogg-dev.install +8 -0
- data/dependencies/libogg/debian/libogg0.README.Debian +6 -0
- data/dependencies/libogg/debian/libogg0.install +1 -0
- data/dependencies/libogg/debian/rules +154 -0
- data/dependencies/libogg/debian/watch +3 -0
- data/dependencies/libogg/depcomp +529 -0
- data/dependencies/libogg/doc/Makefile.am +11 -0
- data/dependencies/libogg/doc/Makefile.in +518 -0
- data/dependencies/libogg/doc/framing.html +431 -0
- data/dependencies/libogg/doc/index.html +104 -0
- data/dependencies/libogg/doc/libogg/Makefile.am +28 -0
- data/dependencies/libogg/doc/libogg/Makefile.in +378 -0
- data/dependencies/libogg/doc/libogg/bitpacking.html +99 -0
- data/dependencies/libogg/doc/libogg/datastructures.html +59 -0
- data/dependencies/libogg/doc/libogg/decoding.html +100 -0
- data/dependencies/libogg/doc/libogg/encoding.html +64 -0
- data/dependencies/libogg/doc/libogg/general.html +105 -0
- data/dependencies/libogg/doc/libogg/index.html +39 -0
- data/dependencies/libogg/doc/libogg/ogg_packet.html +75 -0
- data/dependencies/libogg/doc/libogg/ogg_packet_clear.html +62 -0
- data/dependencies/libogg/doc/libogg/ogg_page.html +74 -0
- data/dependencies/libogg/doc/libogg/ogg_page_bos.html +65 -0
- data/dependencies/libogg/doc/libogg/ogg_page_checksum_set.html +62 -0
- data/dependencies/libogg/doc/libogg/ogg_page_continued.html +64 -0
- data/dependencies/libogg/doc/libogg/ogg_page_eos.html +65 -0
- data/dependencies/libogg/doc/libogg/ogg_page_granulepos.html +65 -0
- data/dependencies/libogg/doc/libogg/ogg_page_packets.html +75 -0
- data/dependencies/libogg/doc/libogg/ogg_page_pageno.html +63 -0
- data/dependencies/libogg/doc/libogg/ogg_page_serialno.html +63 -0
- data/dependencies/libogg/doc/libogg/ogg_page_version.html +63 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_clear.html +61 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_destroy.html +62 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_eos.html +62 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_flush.html +67 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_init.html +66 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_packetin.html +65 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_packetout.html +71 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_packetpeek.html +85 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_pagein.html +67 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_pageout.html +66 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_reset.html +61 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_reset_serialno.html +67 -0
- data/dependencies/libogg/doc/libogg/ogg_stream_state.html +121 -0
- data/dependencies/libogg/doc/libogg/ogg_sync_buffer.html +67 -0
- data/dependencies/libogg/doc/libogg/ogg_sync_clear.html +62 -0
- data/dependencies/libogg/doc/libogg/ogg_sync_destroy.html +62 -0
- data/dependencies/libogg/doc/libogg/ogg_sync_init.html +63 -0
- data/dependencies/libogg/doc/libogg/ogg_sync_pageout.html +79 -0
- data/dependencies/libogg/doc/libogg/ogg_sync_pageseek.html +68 -0
- data/dependencies/libogg/doc/libogg/ogg_sync_reset.html +63 -0
- data/dependencies/libogg/doc/libogg/ogg_sync_state.html +67 -0
- data/dependencies/libogg/doc/libogg/ogg_sync_wrote.html +73 -0
- data/dependencies/libogg/doc/libogg/oggpack_adv.html +64 -0
- data/dependencies/libogg/doc/libogg/oggpack_adv1.html +62 -0
- data/dependencies/libogg/doc/libogg/oggpack_bits.html +62 -0
- data/dependencies/libogg/doc/libogg/oggpack_buffer.html +66 -0
- data/dependencies/libogg/doc/libogg/oggpack_bytes.html +62 -0
- data/dependencies/libogg/doc/libogg/oggpack_get_buffer.html +62 -0
- data/dependencies/libogg/doc/libogg/oggpack_look.html +66 -0
- data/dependencies/libogg/doc/libogg/oggpack_look1.html +63 -0
- data/dependencies/libogg/doc/libogg/oggpack_read.html +65 -0
- data/dependencies/libogg/doc/libogg/oggpack_read1.html +63 -0
- data/dependencies/libogg/doc/libogg/oggpack_readinit.html +64 -0
- data/dependencies/libogg/doc/libogg/oggpack_reset.html +62 -0
- data/dependencies/libogg/doc/libogg/oggpack_write.html +68 -0
- data/dependencies/libogg/doc/libogg/oggpack_writealign.html +65 -0
- data/dependencies/libogg/doc/libogg/oggpack_writeclear.html +62 -0
- data/dependencies/libogg/doc/libogg/oggpack_writecopy.html +69 -0
- data/dependencies/libogg/doc/libogg/oggpack_writeinit.html +62 -0
- data/dependencies/libogg/doc/libogg/oggpack_writetrunc.html +65 -0
- data/dependencies/libogg/doc/libogg/overview.html +44 -0
- data/dependencies/libogg/doc/libogg/reference.html +93 -0
- data/dependencies/libogg/doc/libogg/style.css +7 -0
- data/dependencies/libogg/doc/libogg/vorbis_comment.html +70 -0
- data/dependencies/libogg/doc/libogg/vorbis_info.html +80 -0
- data/dependencies/libogg/doc/ogg-multiplex.html +445 -0
- data/dependencies/libogg/doc/oggstream.html +234 -0
- data/dependencies/libogg/doc/rfc3533.txt +843 -0
- data/dependencies/libogg/doc/rfc3534.txt +339 -0
- data/dependencies/libogg/doc/stream.png +0 -0
- data/dependencies/libogg/doc/vorbisword2.png +0 -0
- data/dependencies/libogg/doc/white-ogg.png +0 -0
- data/dependencies/libogg/doc/white-xifish.png +0 -0
- data/dependencies/libogg/include/Makefile.am +3 -0
- data/dependencies/libogg/include/Makefile.in +481 -0
- data/dependencies/libogg/include/ogg/Makefile.am +6 -0
- data/dependencies/libogg/include/ogg/Makefile.in +428 -0
- data/dependencies/libogg/include/ogg/config_types.h.in +11 -0
- data/dependencies/libogg/include/ogg/ogg.h +202 -0
- data/dependencies/libogg/include/ogg/os_types.h +127 -0
- data/dependencies/libogg/install-sh +323 -0
- data/dependencies/libogg/libogg.spec +106 -0
- data/dependencies/libogg/libogg.spec.in +106 -0
- data/dependencies/libogg/ltmain.sh +6426 -0
- data/dependencies/libogg/macos/compat/strdup.c +21 -0
- data/dependencies/libogg/macos/compat/sys/types.h +1 -0
- data/dependencies/libogg/macos/libogg.mcp +0 -0
- data/dependencies/libogg/macos/libogg.mcp.exp +64 -0
- data/dependencies/libogg/macosx/English.lproj/InfoPlist.strings +0 -0
- data/dependencies/libogg/macosx/Info.plist +30 -0
- data/dependencies/libogg/macosx/Ogg.xcodeproj/project.pbxproj +303 -0
- data/dependencies/libogg/macosx/Ogg_Prefix.pch +5 -0
- data/dependencies/libogg/missing +357 -0
- data/dependencies/libogg/ogg-uninstalled.pc.in +14 -0
- data/dependencies/libogg/ogg.m4 +102 -0
- data/dependencies/libogg/ogg.pc.in +14 -0
- data/dependencies/libogg/src/Makefile.am +28 -0
- data/dependencies/libogg/src/Makefile.in +536 -0
- data/dependencies/libogg/src/bitwise.c +784 -0
- data/dependencies/libogg/src/framing.c +1800 -0
- data/dependencies/libogg/win32/Makefile.am +5 -0
- data/dependencies/libogg/win32/Makefile.in +327 -0
- data/dependencies/libogg/win32/build_ogg_dynamic.bat +18 -0
- data/dependencies/libogg/win32/build_ogg_dynamic_debug.bat +18 -0
- data/dependencies/libogg/win32/build_ogg_static.bat +18 -0
- data/dependencies/libogg/win32/build_ogg_static_debug.bat +18 -0
- data/dependencies/libogg/win32/ogg.def +78 -0
- data/dependencies/libogg/win32/ogg.dsw +41 -0
- data/dependencies/libogg/win32/ogg_dynamic.dsp +128 -0
- data/dependencies/libogg/win32/ogg_static.dsp +108 -0
- data/dependencies/libpng/ANNOUNCE +61 -0
- data/dependencies/libpng/CHANGES +2173 -0
- data/dependencies/libpng/INSTALL +199 -0
- data/dependencies/libpng/KNOWNBUG +22 -0
- data/dependencies/libpng/LICENSE +109 -0
- data/dependencies/libpng/README +264 -0
- data/dependencies/libpng/TODO +24 -0
- data/dependencies/libpng/Y2KINFO +55 -0
- data/dependencies/libpng/configure +13 -0
- data/dependencies/libpng/contrib/gregbook/COPYING +340 -0
- data/dependencies/libpng/contrib/gregbook/LICENSE +50 -0
- data/dependencies/libpng/contrib/gregbook/Makefile.mingw32 +130 -0
- data/dependencies/libpng/contrib/gregbook/Makefile.sgi +104 -0
- data/dependencies/libpng/contrib/gregbook/Makefile.unx +132 -0
- data/dependencies/libpng/contrib/gregbook/Makefile.w32 +113 -0
- data/dependencies/libpng/contrib/gregbook/README +186 -0
- data/dependencies/libpng/contrib/gregbook/makevms.com +132 -0
- data/dependencies/libpng/contrib/gregbook/readpng.c +304 -0
- data/dependencies/libpng/contrib/gregbook/readpng.h +88 -0
- data/dependencies/libpng/contrib/gregbook/readpng2.c +645 -0
- data/dependencies/libpng/contrib/gregbook/readpng2.h +121 -0
- data/dependencies/libpng/contrib/gregbook/readppm.c +179 -0
- data/dependencies/libpng/contrib/gregbook/rpng-win.c +684 -0
- data/dependencies/libpng/contrib/gregbook/rpng-x.c +904 -0
- data/dependencies/libpng/contrib/gregbook/rpng2-win.c +1225 -0
- data/dependencies/libpng/contrib/gregbook/rpng2-x.c +2127 -0
- data/dependencies/libpng/contrib/gregbook/toucan.png +0 -0
- data/dependencies/libpng/contrib/gregbook/wpng.c +853 -0
- data/dependencies/libpng/contrib/gregbook/writepng.c +392 -0
- data/dependencies/libpng/contrib/gregbook/writepng.h +133 -0
- data/dependencies/libpng/contrib/pngminim/decoder/README +6 -0
- data/dependencies/libpng/contrib/pngminim/decoder/gather.sh +8 -0
- data/dependencies/libpng/contrib/pngminim/decoder/makefile.std +44 -0
- data/dependencies/libpng/contrib/pngminim/decoder/pngusr.h +67 -0
- data/dependencies/libpng/contrib/pngminim/encoder/README +6 -0
- data/dependencies/libpng/contrib/pngminim/encoder/dummy_inflate.c +27 -0
- data/dependencies/libpng/contrib/pngminim/encoder/gather.sh +9 -0
- data/dependencies/libpng/contrib/pngminim/encoder/makefile.std +43 -0
- data/dependencies/libpng/contrib/pngminim/encoder/pngusr.h +66 -0
- data/dependencies/libpng/contrib/pngminus/README +153 -0
- data/dependencies/libpng/contrib/pngminus/makefile.std +65 -0
- data/dependencies/libpng/contrib/pngminus/makefile.tc3 +38 -0
- data/dependencies/libpng/contrib/pngminus/makevms.com +92 -0
- data/dependencies/libpng/contrib/pngminus/png2pnm.bat +41 -0
- data/dependencies/libpng/contrib/pngminus/png2pnm.c +430 -0
- data/dependencies/libpng/contrib/pngminus/png2pnm.sh +42 -0
- data/dependencies/libpng/contrib/pngminus/pngminus.bat +4 -0
- data/dependencies/libpng/contrib/pngminus/pngminus.sh +5 -0
- data/dependencies/libpng/contrib/pngminus/pnm2png.bat +41 -0
- data/dependencies/libpng/contrib/pngminus/pnm2png.c +533 -0
- data/dependencies/libpng/contrib/pngminus/pnm2png.sh +42 -0
- data/dependencies/libpng/contrib/pngsuite/basn0g01.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn0g02.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn0g04.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn0g08.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn0g16.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn2c08.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn2c16.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn3p01.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn3p02.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn3p04.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn3p08.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn4a08.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn4a16.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn6a08.png +0 -0
- data/dependencies/libpng/contrib/pngsuite/basn6a16.png +0 -0
- data/dependencies/libpng/contrib/visupng/PngFile.c +439 -0
- data/dependencies/libpng/contrib/visupng/PngFile.h +27 -0
- data/dependencies/libpng/contrib/visupng/README.txt +58 -0
- data/dependencies/libpng/contrib/visupng/VisualPng.c +961 -0
- data/dependencies/libpng/contrib/visupng/VisualPng.dsp +147 -0
- data/dependencies/libpng/contrib/visupng/VisualPng.dsw +29 -0
- data/dependencies/libpng/contrib/visupng/VisualPng.ico +0 -0
- data/dependencies/libpng/contrib/visupng/VisualPng.png +0 -0
- data/dependencies/libpng/contrib/visupng/VisualPng.rc +152 -0
- data/dependencies/libpng/contrib/visupng/cexcept.h +243 -0
- data/dependencies/libpng/contrib/visupng/resource.h +23 -0
- data/dependencies/libpng/example.c +814 -0
- data/dependencies/libpng/libpng-1.2.29.txt +2906 -0
- data/dependencies/libpng/libpng.3 +3680 -0
- data/dependencies/libpng/libpngpf.3 +274 -0
- data/dependencies/libpng/png.5 +74 -0
- data/dependencies/libpng/png.c +798 -0
- data/dependencies/libpng/png.h +3569 -0
- data/dependencies/libpng/pngbar.jpg +0 -0
- data/dependencies/libpng/pngbar.png +0 -0
- data/dependencies/libpng/pngconf.h +1481 -0
- data/dependencies/libpng/pngerror.c +343 -0
- data/dependencies/libpng/pnggccrd.c +103 -0
- data/dependencies/libpng/pngget.c +901 -0
- data/dependencies/libpng/pngmem.c +608 -0
- data/dependencies/libpng/pngnow.png +0 -0
- data/dependencies/libpng/pngpread.c +1598 -0
- data/dependencies/libpng/pngread.c +1479 -0
- data/dependencies/libpng/pngrio.c +167 -0
- data/dependencies/libpng/pngrtran.c +4292 -0
- data/dependencies/libpng/pngrutil.c +3183 -0
- data/dependencies/libpng/pngset.c +1268 -0
- data/dependencies/libpng/pngtest.c +1563 -0
- data/dependencies/libpng/pngtest.png +0 -0
- data/dependencies/libpng/pngtrans.c +662 -0
- data/dependencies/libpng/pngvcrd.c +1 -0
- data/dependencies/libpng/pngwio.c +234 -0
- data/dependencies/libpng/pngwrite.c +1532 -0
- data/dependencies/libpng/pngwtran.c +572 -0
- data/dependencies/libpng/pngwutil.c +2802 -0
- data/dependencies/libpng/projects/beos/x86-shared.proj +0 -0
- data/dependencies/libpng/projects/beos/x86-shared.txt +22 -0
- data/dependencies/libpng/projects/beos/x86-static.proj +0 -0
- data/dependencies/libpng/projects/beos/x86-static.txt +22 -0
- data/dependencies/libpng/projects/cbuilder5/libpng.bpf +22 -0
- data/dependencies/libpng/projects/cbuilder5/libpng.bpg +25 -0
- data/dependencies/libpng/projects/cbuilder5/libpng.bpr +157 -0
- data/dependencies/libpng/projects/cbuilder5/libpng.cpp +29 -0
- data/dependencies/libpng/projects/cbuilder5/libpng.readme.txt +25 -0
- data/dependencies/libpng/projects/cbuilder5/libpngstat.bpf +22 -0
- data/dependencies/libpng/projects/cbuilder5/libpngstat.bpr +109 -0
- data/dependencies/libpng/projects/cbuilder5/zlib.readme.txt +14 -0
- data/dependencies/libpng/projects/netware.txt +6 -0
- data/dependencies/libpng/projects/visualc6/README.txt +57 -0
- data/dependencies/libpng/projects/visualc6/libpng.dsp +472 -0
- data/dependencies/libpng/projects/visualc6/libpng.dsw +59 -0
- data/dependencies/libpng/projects/visualc6/pngtest.dsp +314 -0
- data/dependencies/libpng/projects/visualc71/PRJ0041.mak +21 -0
- data/dependencies/libpng/projects/visualc71/README.txt +57 -0
- data/dependencies/libpng/projects/visualc71/README_zlib.txt +44 -0
- data/dependencies/libpng/projects/visualc71/libpng.sln +88 -0
- data/dependencies/libpng/projects/visualc71/libpng.vcproj +702 -0
- data/dependencies/libpng/projects/visualc71/pngtest.vcproj +459 -0
- data/dependencies/libpng/projects/visualc71/zlib.vcproj +670 -0
- data/dependencies/libpng/projects/wince.txt +6 -0
- data/dependencies/libpng/scripts/CMakeLists.txt +210 -0
- data/dependencies/libpng/scripts/SCOPTIONS.ppc +7 -0
- data/dependencies/libpng/scripts/descrip.mms +52 -0
- data/dependencies/libpng/scripts/libpng-config-body.in +96 -0
- data/dependencies/libpng/scripts/libpng-config-head.in +21 -0
- data/dependencies/libpng/scripts/libpng-config.in +124 -0
- data/dependencies/libpng/scripts/libpng.icc +44 -0
- data/dependencies/libpng/scripts/libpng.pc-configure.in +10 -0
- data/dependencies/libpng/scripts/libpng.pc.in +10 -0
- data/dependencies/libpng/scripts/makefile.32sunu +254 -0
- data/dependencies/libpng/scripts/makefile.64sunu +254 -0
- data/dependencies/libpng/scripts/makefile.acorn +51 -0
- data/dependencies/libpng/scripts/makefile.aix +113 -0
- data/dependencies/libpng/scripts/makefile.amiga +48 -0
- data/dependencies/libpng/scripts/makefile.atari +51 -0
- data/dependencies/libpng/scripts/makefile.bc32 +152 -0
- data/dependencies/libpng/scripts/makefile.beos +226 -0
- data/dependencies/libpng/scripts/makefile.bor +162 -0
- data/dependencies/libpng/scripts/makefile.cygwin +299 -0
- data/dependencies/libpng/scripts/makefile.darwin +234 -0
- data/dependencies/libpng/scripts/makefile.dec +214 -0
- data/dependencies/libpng/scripts/makefile.dj2 +55 -0
- data/dependencies/libpng/scripts/makefile.elf +275 -0
- data/dependencies/libpng/scripts/makefile.freebsd +48 -0
- data/dependencies/libpng/scripts/makefile.gcc +79 -0
- data/dependencies/libpng/scripts/makefile.gcmmx +271 -0
- data/dependencies/libpng/scripts/makefile.hp64 +235 -0
- data/dependencies/libpng/scripts/makefile.hpgcc +245 -0
- data/dependencies/libpng/scripts/makefile.hpux +232 -0
- data/dependencies/libpng/scripts/makefile.ibmc +71 -0
- data/dependencies/libpng/scripts/makefile.intel +102 -0
- data/dependencies/libpng/scripts/makefile.knr +99 -0
- data/dependencies/libpng/scripts/makefile.linux +249 -0
- data/dependencies/libpng/scripts/makefile.mingw +289 -0
- data/dependencies/libpng/scripts/makefile.mips +83 -0
- data/dependencies/libpng/scripts/makefile.msc +86 -0
- data/dependencies/libpng/scripts/makefile.ne12bsd +45 -0
- data/dependencies/libpng/scripts/makefile.netbsd +45 -0
- data/dependencies/libpng/scripts/makefile.nommx +252 -0
- data/dependencies/libpng/scripts/makefile.openbsd +73 -0
- data/dependencies/libpng/scripts/makefile.os2 +69 -0
- data/dependencies/libpng/scripts/makefile.sco +229 -0
- data/dependencies/libpng/scripts/makefile.sggcc +242 -0
- data/dependencies/libpng/scripts/makefile.sgi +245 -0
- data/dependencies/libpng/scripts/makefile.so9 +251 -0
- data/dependencies/libpng/scripts/makefile.solaris +249 -0
- data/dependencies/libpng/scripts/makefile.solaris-x86 +248 -0
- data/dependencies/libpng/scripts/makefile.std +92 -0
- data/dependencies/libpng/scripts/makefile.sunos +97 -0
- data/dependencies/libpng/scripts/makefile.tc3 +89 -0
- data/dependencies/libpng/scripts/makefile.vcawin32 +99 -0
- data/dependencies/libpng/scripts/makefile.vcwin32 +99 -0
- data/dependencies/libpng/scripts/makefile.watcom +109 -0
- data/dependencies/libpng/scripts/makevms.com +144 -0
- data/dependencies/libpng/scripts/pngos2.def +257 -0
- data/dependencies/libpng/scripts/pngw32.def +238 -0
- data/dependencies/libpng/scripts/pngw32.rc +112 -0
- data/dependencies/libpng/scripts/smakefile.ppc +30 -0
- data/dependencies/libvorbis/AUTHORS +3 -0
- data/dependencies/libvorbis/CHANGES +48 -0
- data/dependencies/libvorbis/COPYING +28 -0
- data/dependencies/libvorbis/Makefile.am +41 -0
- data/dependencies/libvorbis/Makefile.in +759 -0
- data/dependencies/libvorbis/README +132 -0
- data/dependencies/libvorbis/acinclude.m4 +161 -0
- data/dependencies/libvorbis/aclocal.m4 +7273 -0
- data/dependencies/libvorbis/autogen.sh +127 -0
- data/dependencies/libvorbis/config.guess +1500 -0
- data/dependencies/libvorbis/config.h.in +78 -0
- data/dependencies/libvorbis/config.sub +1616 -0
- data/dependencies/libvorbis/configure +22114 -0
- data/dependencies/libvorbis/configure.in +246 -0
- data/dependencies/libvorbis/depcomp +584 -0
- data/dependencies/libvorbis/doc/Makefile +665 -0
- data/dependencies/libvorbis/doc/Makefile.am +137 -0
- data/dependencies/libvorbis/doc/Makefile.in +665 -0
- data/dependencies/libvorbis/doc/Vorbis_I_spec.html +2292 -0
- data/dependencies/libvorbis/doc/Vorbis_I_spec.pdf +0 -0
- data/dependencies/libvorbis/doc/components.png +0 -0
- data/dependencies/libvorbis/doc/draft-ietf-avt-rtp-vorbis-06.txt +1401 -0
- data/dependencies/libvorbis/doc/draft-ietf-avt-rtp-vorbis-06.xml +1388 -0
- data/dependencies/libvorbis/doc/eightphase.png +0 -0
- data/dependencies/libvorbis/doc/evenlsp.png +0 -0
- data/dependencies/libvorbis/doc/fish_xiph_org.png +0 -0
- data/dependencies/libvorbis/doc/floor1-1.png +0 -0
- data/dependencies/libvorbis/doc/floor1-2.png +0 -0
- data/dependencies/libvorbis/doc/floor1-3.png +0 -0
- data/dependencies/libvorbis/doc/floor1-4.png +0 -0
- data/dependencies/libvorbis/doc/floor1_inverse_dB_table.html +154 -0
- data/dependencies/libvorbis/doc/floorval.png +0 -0
- data/dependencies/libvorbis/doc/fourphase.png +0 -0
- data/dependencies/libvorbis/doc/framing.html +431 -0
- data/dependencies/libvorbis/doc/helper.html +239 -0
- data/dependencies/libvorbis/doc/hufftree-under.png +0 -0
- data/dependencies/libvorbis/doc/hufftree.png +0 -0
- data/dependencies/libvorbis/doc/index.html +114 -0
- data/dependencies/libvorbis/doc/lspmap.png +0 -0
- data/dependencies/libvorbis/doc/oddlsp.png +0 -0
- data/dependencies/libvorbis/doc/oggstream.html +234 -0
- data/dependencies/libvorbis/doc/programming.html +554 -0
- data/dependencies/libvorbis/doc/residue-pack.png +0 -0
- data/dependencies/libvorbis/doc/residue2.png +0 -0
- data/dependencies/libvorbis/doc/squarepolar.png +0 -0
- data/dependencies/libvorbis/doc/stereo.html +418 -0
- data/dependencies/libvorbis/doc/stream.png +0 -0
- data/dependencies/libvorbis/doc/v-comment.html +285 -0
- data/dependencies/libvorbis/doc/vorbis-clip.txt +139 -0
- data/dependencies/libvorbis/doc/vorbis-errors.txt +103 -0
- data/dependencies/libvorbis/doc/vorbis-fidelity.html +180 -0
- data/dependencies/libvorbis/doc/vorbis.html +234 -0
- data/dependencies/libvorbis/doc/vorbisenc/Makefile +382 -0
- data/dependencies/libvorbis/doc/vorbisenc/Makefile.am +9 -0
- data/dependencies/libvorbis/doc/vorbisenc/Makefile.in +382 -0
- data/dependencies/libvorbis/doc/vorbisenc/changes.html +104 -0
- data/dependencies/libvorbis/doc/vorbisenc/examples.html +133 -0
- data/dependencies/libvorbis/doc/vorbisenc/index.html +40 -0
- data/dependencies/libvorbis/doc/vorbisenc/ov_ectl_ratemanage2_arg.html +92 -0
- data/dependencies/libvorbis/doc/vorbisenc/ov_ectl_ratemanage_arg.html +92 -0
- data/dependencies/libvorbis/doc/vorbisenc/overview.html +382 -0
- data/dependencies/libvorbis/doc/vorbisenc/reference.html +48 -0
- data/dependencies/libvorbis/doc/vorbisenc/style.css +7 -0
- data/dependencies/libvorbis/doc/vorbisenc/vorbis_encode_ctl.html +169 -0
- data/dependencies/libvorbis/doc/vorbisenc/vorbis_encode_init.html +88 -0
- data/dependencies/libvorbis/doc/vorbisenc/vorbis_encode_init_vbr.html +81 -0
- data/dependencies/libvorbis/doc/vorbisenc/vorbis_encode_setup_init.html +88 -0
- data/dependencies/libvorbis/doc/vorbisenc/vorbis_encode_setup_managed.html +102 -0
- data/dependencies/libvorbis/doc/vorbisenc/vorbis_encode_setup_vbr.html +90 -0
- data/dependencies/libvorbis/doc/vorbisenc/vorbis_info.html +81 -0
- data/dependencies/libvorbis/doc/vorbisfile/Makefile +396 -0
- data/dependencies/libvorbis/doc/vorbisfile/Makefile.am +23 -0
- data/dependencies/libvorbis/doc/vorbisfile/Makefile.in +396 -0
- data/dependencies/libvorbis/doc/vorbisfile/OggVorbis_File.html +137 -0
- data/dependencies/libvorbis/doc/vorbisfile/callbacks.html +121 -0
- data/dependencies/libvorbis/doc/vorbisfile/chaining_example_c.html +90 -0
- data/dependencies/libvorbis/doc/vorbisfile/chainingexample.html +175 -0
- data/dependencies/libvorbis/doc/vorbisfile/crosslap.html +121 -0
- data/dependencies/libvorbis/doc/vorbisfile/datastructures.html +61 -0
- data/dependencies/libvorbis/doc/vorbisfile/decoding.html +87 -0
- data/dependencies/libvorbis/doc/vorbisfile/example.html +208 -0
- data/dependencies/libvorbis/doc/vorbisfile/exampleindex.html +39 -0
- data/dependencies/libvorbis/doc/vorbisfile/fileinfo.html +95 -0
- data/dependencies/libvorbis/doc/vorbisfile/index.html +49 -0
- data/dependencies/libvorbis/doc/vorbisfile/initialization.html +118 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_bitrate.html +72 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_bitrate_instant.html +65 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_callbacks.html +117 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_clear.html +64 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_comment.html +66 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_crosslap.html +100 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_fopen.html +124 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_info.html +64 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_open.html +183 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_open_callbacks.html +147 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_pcm_seek.html +83 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_pcm_seek_lap.html +103 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_pcm_seek_page.html +84 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_pcm_seek_page_lap.html +112 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_pcm_tell.html +63 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_pcm_total.html +67 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_raw_seek.html +83 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_raw_seek_lap.html +110 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_raw_tell.html +65 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_raw_total.html +68 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_read.html +123 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_read_float.html +101 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_seekable.html +63 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_serialnumber.html +67 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_streams.html +64 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_test.html +101 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_test_callbacks.html +111 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_test_open.html +82 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_time_seek.html +82 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_time_seek_lap.html +105 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_time_seek_page.html +83 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_time_seek_page_lap.html +112 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_time_tell.html +63 -0
- data/dependencies/libvorbis/doc/vorbisfile/ov_time_total.html +67 -0
- data/dependencies/libvorbis/doc/vorbisfile/overview.html +61 -0
- data/dependencies/libvorbis/doc/vorbisfile/reference.html +83 -0
- data/dependencies/libvorbis/doc/vorbisfile/return.html +77 -0
- data/dependencies/libvorbis/doc/vorbisfile/seekexample.html +152 -0
- data/dependencies/libvorbis/doc/vorbisfile/seeking.html +107 -0
- data/dependencies/libvorbis/doc/vorbisfile/seeking_example_c.html +86 -0
- data/dependencies/libvorbis/doc/vorbisfile/seeking_test_c.html +86 -0
- data/dependencies/libvorbis/doc/vorbisfile/seekingexample.html +203 -0
- data/dependencies/libvorbis/doc/vorbisfile/style.css +7 -0
- data/dependencies/libvorbis/doc/vorbisfile/threads.html +50 -0
- data/dependencies/libvorbis/doc/vorbisfile/vorbis_comment.html +70 -0
- data/dependencies/libvorbis/doc/vorbisfile/vorbis_info.html +80 -0
- data/dependencies/libvorbis/doc/vorbisfile/vorbisfile_example_c.html +106 -0
- data/dependencies/libvorbis/doc/vorbisword2.png +0 -0
- data/dependencies/libvorbis/doc/wait.png +0 -0
- data/dependencies/libvorbis/doc/white-ogg.png +0 -0
- data/dependencies/libvorbis/doc/white-xifish.png +0 -0
- data/dependencies/libvorbis/doc/window1.png +0 -0
- data/dependencies/libvorbis/doc/window2.png +0 -0
- data/dependencies/libvorbis/doc/xifish.pdf +0 -0
- data/dependencies/libvorbis/doc/xml/01-introduction.xml +665 -0
- data/dependencies/libvorbis/doc/xml/02-bitpacking.xml +280 -0
- data/dependencies/libvorbis/doc/xml/03-codebook.xml +458 -0
- data/dependencies/libvorbis/doc/xml/04-codec.xml +711 -0
- data/dependencies/libvorbis/doc/xml/05-comment.xml +284 -0
- data/dependencies/libvorbis/doc/xml/06-floor0.xml +257 -0
- data/dependencies/libvorbis/doc/xml/07-floor1.xml +450 -0
- data/dependencies/libvorbis/doc/xml/08-residue.xml +492 -0
- data/dependencies/libvorbis/doc/xml/09-helper.xml +211 -0
- data/dependencies/libvorbis/doc/xml/10-tables.xml +94 -0
- data/dependencies/libvorbis/doc/xml/TODO +28 -0
- data/dependencies/libvorbis/doc/xml/Vorbis_I_spec.xml +30 -0
- data/dependencies/libvorbis/doc/xml/a1-encapsulation_ogg.xml +201 -0
- data/dependencies/libvorbis/doc/xml/a2-encapsulation_rtp.xml +31 -0
- data/dependencies/libvorbis/doc/xml/footer.xml +60 -0
- data/dependencies/libvorbis/doc/xml/spec-common.xsl +24 -0
- data/dependencies/libvorbis/doc/xml/spec-fo.xsl +16 -0
- data/dependencies/libvorbis/doc/xml/spec-html.xsl +5 -0
- data/dependencies/libvorbis/examples/Makefile +515 -0
- data/dependencies/libvorbis/examples/Makefile.am +28 -0
- data/dependencies/libvorbis/examples/Makefile.in +515 -0
- data/dependencies/libvorbis/examples/chaining_example.c +72 -0
- data/dependencies/libvorbis/examples/decoder_example.c +307 -0
- data/dependencies/libvorbis/examples/encoder_example.c +253 -0
- data/dependencies/libvorbis/examples/frameview.pl +630 -0
- data/dependencies/libvorbis/examples/seeking_example.c +256 -0
- data/dependencies/libvorbis/examples/vorbisfile_example.c +87 -0
- data/dependencies/libvorbis/include/Makefile.am +3 -0
- data/dependencies/libvorbis/include/Makefile.in +506 -0
- data/dependencies/libvorbis/include/vorbis/Makefile.am +7 -0
- data/dependencies/libvorbis/include/vorbis/Makefile.in +426 -0
- data/dependencies/libvorbis/include/vorbis/codec.h +241 -0
- data/dependencies/libvorbis/include/vorbis/vorbisenc.h +112 -0
- data/dependencies/libvorbis/include/vorbis/vorbisfile.h +183 -0
- data/dependencies/libvorbis/install-sh +507 -0
- data/dependencies/libvorbis/lib/Makefile.am +44 -0
- data/dependencies/libvorbis/lib/Makefile.in +706 -0
- data/dependencies/libvorbis/lib/analysis.c +121 -0
- data/dependencies/libvorbis/lib/backends.h +146 -0
- data/dependencies/libvorbis/lib/barkmel.c +64 -0
- data/dependencies/libvorbis/lib/bitrate.c +253 -0
- data/dependencies/libvorbis/lib/bitrate.h +59 -0
- data/dependencies/libvorbis/lib/block.c +993 -0
- data/dependencies/libvorbis/lib/books/Makefile.am +3 -0
- data/dependencies/libvorbis/lib/books/Makefile.in +506 -0
- data/dependencies/libvorbis/lib/books/coupled/Makefile.am +3 -0
- data/dependencies/libvorbis/lib/books/coupled/Makefile.in +347 -0
- data/dependencies/libvorbis/lib/books/coupled/res_books_stereo.h +20681 -0
- data/dependencies/libvorbis/lib/books/floor/Makefile.am +3 -0
- data/dependencies/libvorbis/lib/books/floor/Makefile.in +347 -0
- data/dependencies/libvorbis/lib/books/floor/floor_books.h +1838 -0
- data/dependencies/libvorbis/lib/books/uncoupled/Makefile.am +3 -0
- data/dependencies/libvorbis/lib/books/uncoupled/Makefile.in +347 -0
- data/dependencies/libvorbis/lib/books/uncoupled/res_books_uncoupled.h +11517 -0
- data/dependencies/libvorbis/lib/codebook.c +634 -0
- data/dependencies/libvorbis/lib/codebook.h +160 -0
- data/dependencies/libvorbis/lib/codec_internal.h +137 -0
- data/dependencies/libvorbis/lib/envelope.c +382 -0
- data/dependencies/libvorbis/lib/envelope.h +81 -0
- data/dependencies/libvorbis/lib/floor0.c +223 -0
- data/dependencies/libvorbis/lib/floor1.c +1094 -0
- data/dependencies/libvorbis/lib/highlevel.h +57 -0
- data/dependencies/libvorbis/lib/info.c +644 -0
- data/dependencies/libvorbis/lib/lookup.c +94 -0
- data/dependencies/libvorbis/lib/lookup.h +32 -0
- data/dependencies/libvorbis/lib/lookup_data.h +189 -0
- data/dependencies/libvorbis/lib/lookups.pl +142 -0
- data/dependencies/libvorbis/lib/lpc.c +149 -0
- data/dependencies/libvorbis/lib/lpc.h +29 -0
- data/dependencies/libvorbis/lib/lsp.c +455 -0
- data/dependencies/libvorbis/lib/lsp.h +28 -0
- data/dependencies/libvorbis/lib/mapping0.c +844 -0
- data/dependencies/libvorbis/lib/masking.h +785 -0
- data/dependencies/libvorbis/lib/mdct.c +564 -0
- data/dependencies/libvorbis/lib/mdct.h +83 -0
- data/dependencies/libvorbis/lib/misc.h +52 -0
- data/dependencies/libvorbis/lib/modes/Makefile.am +6 -0
- data/dependencies/libvorbis/lib/modes/Makefile.in +351 -0
- data/dependencies/libvorbis/lib/modes/floor_all.h +248 -0
- data/dependencies/libvorbis/lib/modes/psych_11.h +51 -0
- data/dependencies/libvorbis/lib/modes/psych_16.h +136 -0
- data/dependencies/libvorbis/lib/modes/psych_44.h +666 -0
- data/dependencies/libvorbis/lib/modes/psych_8.h +102 -0
- data/dependencies/libvorbis/lib/modes/residue_16.h +163 -0
- data/dependencies/libvorbis/lib/modes/residue_44.h +294 -0
- data/dependencies/libvorbis/lib/modes/residue_44u.h +318 -0
- data/dependencies/libvorbis/lib/modes/residue_8.h +109 -0
- data/dependencies/libvorbis/lib/modes/setup_11.h +141 -0
- data/dependencies/libvorbis/lib/modes/setup_16.h +149 -0
- data/dependencies/libvorbis/lib/modes/setup_22.h +128 -0
- data/dependencies/libvorbis/lib/modes/setup_32.h +132 -0
- data/dependencies/libvorbis/lib/modes/setup_44.h +107 -0
- data/dependencies/libvorbis/lib/modes/setup_44u.h +74 -0
- data/dependencies/libvorbis/lib/modes/setup_8.h +146 -0
- data/dependencies/libvorbis/lib/modes/setup_X.h +226 -0
- data/dependencies/libvorbis/lib/os.h +156 -0
- data/dependencies/libvorbis/lib/psy.c +1227 -0
- data/dependencies/libvorbis/lib/psy.h +186 -0
- data/dependencies/libvorbis/lib/psytune.c +524 -0
- data/dependencies/libvorbis/lib/registry.c +46 -0
- data/dependencies/libvorbis/lib/registry.h +32 -0
- data/dependencies/libvorbis/lib/res0.c +919 -0
- data/dependencies/libvorbis/lib/scales.h +86 -0
- data/dependencies/libvorbis/lib/sharedbook.c +735 -0
- data/dependencies/libvorbis/lib/smallft.c +1255 -0
- data/dependencies/libvorbis/lib/smallft.h +34 -0
- data/dependencies/libvorbis/lib/synthesis.c +170 -0
- data/dependencies/libvorbis/lib/tone.c +54 -0
- data/dependencies/libvorbis/lib/vorbisenc.c +1184 -0
- data/dependencies/libvorbis/lib/vorbisfile.c +2194 -0
- data/dependencies/libvorbis/lib/window.c +2136 -0
- data/dependencies/libvorbis/lib/window.h +26 -0
- data/dependencies/libvorbis/libvorbis.spec +118 -0
- data/dependencies/libvorbis/libvorbis.spec.in +118 -0
- data/dependencies/libvorbis/ltmain.sh +6871 -0
- data/dependencies/libvorbis/macos/compat/strdup.c +21 -0
- data/dependencies/libvorbis/macos/compat/sys/types.h +1 -0
- data/dependencies/libvorbis/macos/decoder_example.mcp +0 -0
- data/dependencies/libvorbis/macos/encoder_example.mcp +0 -0
- data/dependencies/libvorbis/macos/libvorbis.mcp +0 -0
- data/dependencies/libvorbis/macos/libvorbis.mcp.exp +45 -0
- data/dependencies/libvorbis/macos/libvorbisenc.mcp +0 -0
- data/dependencies/libvorbis/macos/libvorbisenc.mcp.exp +8 -0
- data/dependencies/libvorbis/macos/libvorbisfile.mcp +0 -0
- data/dependencies/libvorbis/macos/libvorbisfile.mcp.exp +45 -0
- data/dependencies/libvorbis/macos/vorbis.mcp +0 -0
- data/dependencies/libvorbis/macosx/English.lproj/InfoPlist.strings +0 -0
- data/dependencies/libvorbis/macosx/Info.plist +30 -0
- data/dependencies/libvorbis/macosx/Vorbis.xcodeproj/project.pbxproj +893 -0
- data/dependencies/libvorbis/missing +367 -0
- data/dependencies/libvorbis/symbian/bld.inf +35 -0
- data/dependencies/libvorbis/symbian/config.h +54 -0
- data/dependencies/libvorbis/symbian/vorbis.mmp +43 -0
- data/dependencies/libvorbis/todo.txt +22 -0
- data/dependencies/libvorbis/vorbis-uninstalled.pc.in +14 -0
- data/dependencies/libvorbis/vorbis.m4 +122 -0
- data/dependencies/libvorbis/vorbis.pc.in +14 -0
- data/dependencies/libvorbis/vorbisenc-uninstalled.pc.in +14 -0
- data/dependencies/libvorbis/vorbisenc.pc.in +14 -0
- data/dependencies/libvorbis/vorbisfile-uninstalled.pc.in +14 -0
- data/dependencies/libvorbis/vorbisfile.pc.in +14 -0
- data/dependencies/libvorbis/vq/16.vqs +77 -0
- data/dependencies/libvorbis/vq/16u.vqs +71 -0
- data/dependencies/libvorbis/vq/44c-1.vqs +63 -0
- data/dependencies/libvorbis/vq/44c0.vqs +65 -0
- data/dependencies/libvorbis/vq/44c1.vqs +66 -0
- data/dependencies/libvorbis/vq/44c2.vqs +37 -0
- data/dependencies/libvorbis/vq/44c3.vqs +36 -0
- data/dependencies/libvorbis/vq/44c4.vqs +36 -0
- data/dependencies/libvorbis/vq/44c5.vqs +37 -0
- data/dependencies/libvorbis/vq/44c6.vqs +37 -0
- data/dependencies/libvorbis/vq/44c7.vqs +38 -0
- data/dependencies/libvorbis/vq/44c8.vqs +39 -0
- data/dependencies/libvorbis/vq/44c9.vqs +37 -0
- data/dependencies/libvorbis/vq/44u0.vqs +33 -0
- data/dependencies/libvorbis/vq/44u1.vqs +33 -0
- data/dependencies/libvorbis/vq/44u2.vqs +32 -0
- data/dependencies/libvorbis/vq/44u3.vqs +33 -0
- data/dependencies/libvorbis/vq/44u4.vqs +33 -0
- data/dependencies/libvorbis/vq/44u5.vqs +35 -0
- data/dependencies/libvorbis/vq/44u6.vqs +35 -0
- data/dependencies/libvorbis/vq/44u7.vqs +34 -0
- data/dependencies/libvorbis/vq/44u8.vqs +35 -0
- data/dependencies/libvorbis/vq/44u9.vqs +36 -0
- data/dependencies/libvorbis/vq/8.vqs +43 -0
- data/dependencies/libvorbis/vq/8u.vqs +41 -0
- data/dependencies/libvorbis/vq/Makefile +532 -0
- data/dependencies/libvorbis/vq/Makefile.am +34 -0
- data/dependencies/libvorbis/vq/Makefile.in +532 -0
- data/dependencies/libvorbis/vq/auxpartition.pl +71 -0
- data/dependencies/libvorbis/vq/bookutil.c +717 -0
- data/dependencies/libvorbis/vq/bookutil.h +43 -0
- data/dependencies/libvorbis/vq/build.c +195 -0
- data/dependencies/libvorbis/vq/cascade.c +91 -0
- data/dependencies/libvorbis/vq/distribution.c +248 -0
- data/dependencies/libvorbis/vq/floor_11.vqs +10 -0
- data/dependencies/libvorbis/vq/floor_22.vqs +27 -0
- data/dependencies/libvorbis/vq/floor_44.vqs +83 -0
- data/dependencies/libvorbis/vq/genericdata.c +61 -0
- data/dependencies/libvorbis/vq/huffbuild.c +201 -0
- data/dependencies/libvorbis/vq/latticebuild.c +177 -0
- data/dependencies/libvorbis/vq/latticehint.c +430 -0
- data/dependencies/libvorbis/vq/latticepare.c +595 -0
- data/dependencies/libvorbis/vq/latticetune.c +164 -0
- data/dependencies/libvorbis/vq/localcodebook.h +160 -0
- data/dependencies/libvorbis/vq/lspdata.c +157 -0
- data/dependencies/libvorbis/vq/make_floor_books.pl +108 -0
- data/dependencies/libvorbis/vq/make_residue_books.pl +187 -0
- data/dependencies/libvorbis/vq/metrics.c +295 -0
- data/dependencies/libvorbis/vq/residue_entropy +58 -0
- data/dependencies/libvorbis/vq/residuedata.c +160 -0
- data/dependencies/libvorbis/vq/residuesplit.c +282 -0
- data/dependencies/libvorbis/vq/run.c +216 -0
- data/dependencies/libvorbis/vq/train.c +364 -0
- data/dependencies/libvorbis/vq/vqext.h +34 -0
- data/dependencies/libvorbis/vq/vqgen.c +567 -0
- data/dependencies/libvorbis/vq/vqgen.h +85 -0
- data/dependencies/libvorbis/vq/vqsplit.c +612 -0
- data/dependencies/libvorbis/vq/vqsplit.h +37 -0
- data/dependencies/libvorbis/win32/VS2003/libvorbis/libvorbis.vcproj +467 -0
- data/dependencies/libvorbis/win32/VS2003/libvorbisfile/libvorbisfile.def +47 -0
- data/dependencies/libvorbis/win32/VS2003/libvorbisfile/libvorbisfile.vcproj +147 -0
- data/dependencies/libvorbis/win32/VS2003/vorbisdec/vorbisdec.vcproj +268 -0
- data/dependencies/libvorbis/win32/VS2003/vorbisenc/vorbisenc.vcproj +268 -0
- data/dependencies/libvorbis/win32/VS2005/libvorbis/libvorbis.vcproj +653 -0
- data/dependencies/libvorbis/win32/VS2005/libvorbisfile/libvorbisfile.def +47 -0
- data/dependencies/libvorbis/win32/VS2005/libvorbisfile/libvorbisfile.vcproj +219 -0
- data/dependencies/libvorbis/win32/VS2005/vorbisdec/vorbisdec.vcproj +389 -0
- data/dependencies/libvorbis/win32/VS2005/vorbisenc/vorbisenc.vcproj +390 -0
- data/dependencies/libvorbis/win32/build_vorbis_dynamic.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbis_dynamic_debug.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbis_static.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbis_static_debug.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbisenc_dynamic.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbisenc_dynamic_debug.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbisenc_static.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbisenc_static_debug.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbisfile_dynamic.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbisfile_dynamic_debug.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbisfile_static.bat +19 -0
- data/dependencies/libvorbis/win32/build_vorbisfile_static_debug.bat +19 -0
- data/dependencies/libvorbis/win32/vorbis.def +57 -0
- data/dependencies/libvorbis/win32/vorbis.dsw +101 -0
- data/dependencies/libvorbis/win32/vorbis_dynamic.dsp +281 -0
- data/dependencies/libvorbis/win32/vorbis_static.dsp +257 -0
- data/dependencies/libvorbis/win32/vorbisenc.def +13 -0
- data/dependencies/libvorbis/win32/vorbisenc_dynamic.dsp +121 -0
- data/dependencies/libvorbis/win32/vorbisenc_static.dsp +100 -0
- data/dependencies/libvorbis/win32/vorbisfile.def +41 -0
- data/dependencies/libvorbis/win32/vorbisfile_dynamic.dsp +119 -0
- data/dependencies/libvorbis/win32/vorbisfile_static.dsp +100 -0
- data/dependencies/zlib/ChangeLog +855 -0
- data/dependencies/zlib/FAQ +339 -0
- data/dependencies/zlib/INDEX +51 -0
- data/dependencies/zlib/Makefile +154 -0
- data/dependencies/zlib/Makefile.in +154 -0
- data/dependencies/zlib/README +125 -0
- data/dependencies/zlib/adler32.c +149 -0
- data/dependencies/zlib/algorithm.txt +209 -0
- data/dependencies/zlib/amiga/Makefile.pup +66 -0
- data/dependencies/zlib/amiga/Makefile.sas +65 -0
- data/dependencies/zlib/as400/bndsrc +132 -0
- data/dependencies/zlib/as400/compile.clp +123 -0
- data/dependencies/zlib/as400/readme.txt +111 -0
- data/dependencies/zlib/as400/zlib.inc +331 -0
- data/dependencies/zlib/compress.c +79 -0
- data/dependencies/zlib/configure +459 -0
- data/dependencies/zlib/contrib/README.contrib +71 -0
- data/dependencies/zlib/contrib/ada/buffer_demo.adb +106 -0
- data/dependencies/zlib/contrib/ada/mtest.adb +156 -0
- data/dependencies/zlib/contrib/ada/read.adb +156 -0
- data/dependencies/zlib/contrib/ada/readme.txt +65 -0
- data/dependencies/zlib/contrib/ada/test.adb +463 -0
- data/dependencies/zlib/contrib/ada/zlib-streams.adb +225 -0
- data/dependencies/zlib/contrib/ada/zlib-streams.ads +114 -0
- data/dependencies/zlib/contrib/ada/zlib-thin.adb +141 -0
- data/dependencies/zlib/contrib/ada/zlib-thin.ads +450 -0
- data/dependencies/zlib/contrib/ada/zlib.adb +701 -0
- data/dependencies/zlib/contrib/ada/zlib.ads +328 -0
- data/dependencies/zlib/contrib/ada/zlib.gpr +20 -0
- data/dependencies/zlib/contrib/asm586/README.586 +43 -0
- data/dependencies/zlib/contrib/asm586/match.S +364 -0
- data/dependencies/zlib/contrib/asm686/README.686 +34 -0
- data/dependencies/zlib/contrib/asm686/match.S +329 -0
- data/dependencies/zlib/contrib/blast/Makefile +8 -0
- data/dependencies/zlib/contrib/blast/README +4 -0
- data/dependencies/zlib/contrib/blast/blast.c +444 -0
- data/dependencies/zlib/contrib/blast/blast.h +71 -0
- data/dependencies/zlib/contrib/blast/test.pk +0 -0
- data/dependencies/zlib/contrib/blast/test.txt +1 -0
- data/dependencies/zlib/contrib/delphi/ZLib.pas +557 -0
- data/dependencies/zlib/contrib/delphi/ZLibConst.pas +11 -0
- data/dependencies/zlib/contrib/delphi/readme.txt +76 -0
- data/dependencies/zlib/contrib/delphi/zlibd32.mak +93 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib.build +33 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib.chm +0 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib.sln +21 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/AssemblyInfo.cs +58 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/ChecksumImpl.cs +202 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs +83 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/CodecBase.cs +198 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/Deflater.cs +106 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/DotZLib.cs +288 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/DotZLib.csproj +141 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/GZipStream.cs +301 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/Inflater.cs +105 -0
- data/dependencies/zlib/contrib/dotzlib/DotZLib/UnitTests.cs +274 -0
- data/dependencies/zlib/contrib/dotzlib/LICENSE_1_0.txt +23 -0
- data/dependencies/zlib/contrib/dotzlib/readme.txt +58 -0
- data/dependencies/zlib/contrib/infback9/README +1 -0
- data/dependencies/zlib/contrib/infback9/infback9.c +608 -0
- data/dependencies/zlib/contrib/infback9/infback9.h +37 -0
- data/dependencies/zlib/contrib/infback9/inffix9.h +107 -0
- data/dependencies/zlib/contrib/infback9/inflate9.h +47 -0
- data/dependencies/zlib/contrib/infback9/inftree9.c +323 -0
- data/dependencies/zlib/contrib/infback9/inftree9.h +55 -0
- data/dependencies/zlib/contrib/inflate86/inffas86.c +1157 -0
- data/dependencies/zlib/contrib/inflate86/inffast.S +1368 -0
- data/dependencies/zlib/contrib/iostream/test.cpp +24 -0
- data/dependencies/zlib/contrib/iostream/zfstream.cpp +329 -0
- data/dependencies/zlib/contrib/iostream/zfstream.h +128 -0
- data/dependencies/zlib/contrib/iostream2/zstream.h +307 -0
- data/dependencies/zlib/contrib/iostream2/zstream_test.cpp +25 -0
- data/dependencies/zlib/contrib/iostream3/README +35 -0
- data/dependencies/zlib/contrib/iostream3/TODO +17 -0
- data/dependencies/zlib/contrib/iostream3/test.cc +50 -0
- data/dependencies/zlib/contrib/iostream3/zfstream.cc +479 -0
- data/dependencies/zlib/contrib/iostream3/zfstream.h +466 -0
- data/dependencies/zlib/contrib/masm686/match.asm +413 -0
- data/dependencies/zlib/contrib/masmx64/bld_ml64.bat +2 -0
- data/dependencies/zlib/contrib/masmx64/gvmat64.asm +513 -0
- data/dependencies/zlib/contrib/masmx64/gvmat64.obj +0 -0
- data/dependencies/zlib/contrib/masmx64/inffas8664.c +186 -0
- data/dependencies/zlib/contrib/masmx64/inffasx64.asm +392 -0
- data/dependencies/zlib/contrib/masmx64/inffasx64.obj +0 -0
- data/dependencies/zlib/contrib/masmx64/readme.txt +28 -0
- data/dependencies/zlib/contrib/masmx86/bld_ml32.bat +2 -0
- data/dependencies/zlib/contrib/masmx86/gvmat32.asm +972 -0
- data/dependencies/zlib/contrib/masmx86/gvmat32.obj +0 -0
- data/dependencies/zlib/contrib/masmx86/gvmat32c.c +62 -0
- data/dependencies/zlib/contrib/masmx86/inffas32.asm +1083 -0
- data/dependencies/zlib/contrib/masmx86/inffas32.obj +0 -0
- data/dependencies/zlib/contrib/masmx86/mkasm.bat +3 -0
- data/dependencies/zlib/contrib/masmx86/readme.txt +21 -0
- data/dependencies/zlib/contrib/minizip/ChangeLogUnzip +67 -0
- data/dependencies/zlib/contrib/minizip/Makefile +25 -0
- data/dependencies/zlib/contrib/minizip/crypt.h +132 -0
- data/dependencies/zlib/contrib/minizip/ioapi.c +177 -0
- data/dependencies/zlib/contrib/minizip/ioapi.h +75 -0
- data/dependencies/zlib/contrib/minizip/iowin32.c +270 -0
- data/dependencies/zlib/contrib/minizip/iowin32.h +21 -0
- data/dependencies/zlib/contrib/minizip/miniunz.c +585 -0
- data/dependencies/zlib/contrib/minizip/minizip.c +420 -0
- data/dependencies/zlib/contrib/minizip/mztools.c +281 -0
- data/dependencies/zlib/contrib/minizip/mztools.h +31 -0
- data/dependencies/zlib/contrib/minizip/unzip.c +1598 -0
- data/dependencies/zlib/contrib/minizip/unzip.h +354 -0
- data/dependencies/zlib/contrib/minizip/zip.c +1219 -0
- data/dependencies/zlib/contrib/minizip/zip.h +235 -0
- data/dependencies/zlib/contrib/pascal/example.pas +599 -0
- data/dependencies/zlib/contrib/pascal/readme.txt +76 -0
- data/dependencies/zlib/contrib/pascal/zlibd32.mak +93 -0
- data/dependencies/zlib/contrib/pascal/zlibpas.pas +236 -0
- data/dependencies/zlib/contrib/puff/Makefile +8 -0
- data/dependencies/zlib/contrib/puff/README +63 -0
- data/dependencies/zlib/contrib/puff/puff.c +837 -0
- data/dependencies/zlib/contrib/puff/puff.h +31 -0
- data/dependencies/zlib/contrib/puff/zeros.raw +0 -0
- data/dependencies/zlib/contrib/testzlib/testzlib.c +275 -0
- data/dependencies/zlib/contrib/testzlib/testzlib.txt +10 -0
- data/dependencies/zlib/contrib/untgz/Makefile +14 -0
- data/dependencies/zlib/contrib/untgz/Makefile.msc +17 -0
- data/dependencies/zlib/contrib/untgz/untgz.c +674 -0
- data/dependencies/zlib/contrib/vstudio/readme.txt +73 -0
- data/dependencies/zlib/contrib/vstudio/vc7/miniunz.vcproj +126 -0
- data/dependencies/zlib/contrib/vstudio/vc7/minizip.vcproj +126 -0
- data/dependencies/zlib/contrib/vstudio/vc7/testzlib.vcproj +126 -0
- data/dependencies/zlib/contrib/vstudio/vc7/zlib.rc +32 -0
- data/dependencies/zlib/contrib/vstudio/vc7/zlibstat.vcproj +246 -0
- data/dependencies/zlib/contrib/vstudio/vc7/zlibvc.def +92 -0
- data/dependencies/zlib/contrib/vstudio/vc7/zlibvc.sln +78 -0
- data/dependencies/zlib/contrib/vstudio/vc7/zlibvc.vcproj +445 -0
- data/dependencies/zlib/contrib/vstudio/vc8/miniunz.vcproj +566 -0
- data/dependencies/zlib/contrib/vstudio/vc8/minizip.vcproj +563 -0
- data/dependencies/zlib/contrib/vstudio/vc8/testzlib.vcproj +948 -0
- data/dependencies/zlib/contrib/vstudio/vc8/testzlibdll.vcproj +567 -0
- data/dependencies/zlib/contrib/vstudio/vc8/zlib.rc +32 -0
- data/dependencies/zlib/contrib/vstudio/vc8/zlibstat.vcproj +870 -0
- data/dependencies/zlib/contrib/vstudio/vc8/zlibvc.def +92 -0
- data/dependencies/zlib/contrib/vstudio/vc8/zlibvc.sln +144 -0
- data/dependencies/zlib/contrib/vstudio/vc8/zlibvc.vcproj +1219 -0
- data/dependencies/zlib/crc32.c +423 -0
- data/dependencies/zlib/crc32.h +441 -0
- data/dependencies/zlib/deflate.c +1736 -0
- data/dependencies/zlib/deflate.h +331 -0
- data/dependencies/zlib/example.c +565 -0
- data/dependencies/zlib/examples/README.examples +42 -0
- data/dependencies/zlib/examples/fitblk.c +233 -0
- data/dependencies/zlib/examples/gun.c +693 -0
- data/dependencies/zlib/examples/gzappend.c +500 -0
- data/dependencies/zlib/examples/gzjoin.c +448 -0
- data/dependencies/zlib/examples/gzlog.c +413 -0
- data/dependencies/zlib/examples/gzlog.h +58 -0
- data/dependencies/zlib/examples/zlib_how.html +523 -0
- data/dependencies/zlib/examples/zpipe.c +191 -0
- data/dependencies/zlib/examples/zran.c +404 -0
- data/dependencies/zlib/gzio.c +1026 -0
- data/dependencies/zlib/infback.c +623 -0
- data/dependencies/zlib/inffast.c +318 -0
- data/dependencies/zlib/inffast.h +11 -0
- data/dependencies/zlib/inffixed.h +94 -0
- data/dependencies/zlib/inflate.c +1368 -0
- data/dependencies/zlib/inflate.h +115 -0
- data/dependencies/zlib/inftrees.c +329 -0
- data/dependencies/zlib/inftrees.h +55 -0
- data/dependencies/zlib/make_vms.com +461 -0
- data/dependencies/zlib/minigzip.c +322 -0
- data/dependencies/zlib/msdos/Makefile.bor +109 -0
- data/dependencies/zlib/msdos/Makefile.dj2 +104 -0
- data/dependencies/zlib/msdos/Makefile.emx +69 -0
- data/dependencies/zlib/msdos/Makefile.msc +106 -0
- data/dependencies/zlib/msdos/Makefile.tc +94 -0
- data/dependencies/zlib/old/Makefile.riscos +151 -0
- data/dependencies/zlib/old/README +3 -0
- data/dependencies/zlib/old/descrip.mms +48 -0
- data/dependencies/zlib/old/os2/Makefile.os2 +136 -0
- data/dependencies/zlib/old/os2/zlib.def +51 -0
- data/dependencies/zlib/old/visual-basic.txt +160 -0
- data/dependencies/zlib/old/zlib.html +971 -0
- data/dependencies/zlib/projects/README.projects +41 -0
- data/dependencies/zlib/projects/visualc6/README.txt +73 -0
- data/dependencies/zlib/projects/visualc6/example.dsp +278 -0
- data/dependencies/zlib/projects/visualc6/minigzip.dsp +278 -0
- data/dependencies/zlib/projects/visualc6/zlib.dsp +609 -0
- data/dependencies/zlib/projects/visualc6/zlib.dsw +59 -0
- data/dependencies/zlib/qnx/package.qpg +141 -0
- data/dependencies/zlib/trees.c +1219 -0
- data/dependencies/zlib/trees.h +128 -0
- data/dependencies/zlib/uncompr.c +61 -0
- data/dependencies/zlib/win32/DLL_FAQ.txt +397 -0
- data/dependencies/zlib/win32/Makefile.bor +107 -0
- data/dependencies/zlib/win32/Makefile.emx +69 -0
- data/dependencies/zlib/win32/Makefile.gcc +141 -0
- data/dependencies/zlib/win32/Makefile.msc +126 -0
- data/dependencies/zlib/win32/VisualC.txt +3 -0
- data/dependencies/zlib/win32/zlib.def +60 -0
- data/dependencies/zlib/win32/zlib1.rc +39 -0
- data/dependencies/zlib/zconf.h +332 -0
- data/dependencies/zlib/zconf.in.h +332 -0
- data/dependencies/zlib/zlib.3 +159 -0
- data/dependencies/zlib/zlib.h +1357 -0
- data/dependencies/zlib/zutil.c +318 -0
- data/dependencies/zlib/zutil.h +269 -0
- data/examples/ChipmunkIntegration.rb +7 -7
- data/examples/CptnRuby.rb +5 -5
- data/examples/OpenGLIntegration.rb +6 -6
- data/examples/RMagickIntegration.rb +1 -1
- data/examples/TextInput.cpp +23 -1
- data/examples/TextInput.rb +7 -1
- data/examples/Tutorial.cpp +2 -2
- data/examples/Tutorial.rb +5 -5
- data/lib/gosu/patches.rb +53 -0
- data/linux/Makefile.in +3 -2
- data/mac/Gosu.xcodeproj/jlnr.pbxuser +461 -349
- data/mac/Gosu.xcodeproj/jlnr.perspectivev3 +82 -50
- data/mac/Gosu.xcodeproj/project.pbxproj +503 -0
- data/reference/cpp/_audio_8hpp.html +0 -3
- data/reference/cpp/_audio_8hpp_source.html +95 -103
- data/reference/cpp/_bitmap_8hpp_source.html +1 -1
- data/reference/cpp/_color_8hpp.html +2 -3
- data/reference/cpp/_color_8hpp_source.html +54 -38
- data/reference/cpp/_font_8hpp_source.html +6 -6
- data/reference/cpp/_graphics_8hpp_source.html +55 -49
- data/reference/cpp/_image_8hpp_source.html +7 -7
- data/reference/cpp/_text_input_8hpp_source.html +11 -6
- data/reference/cpp/_version_8hpp.html +4 -4
- data/reference/cpp/_version_8hpp_source.html +2 -2
- data/reference/cpp/_window_8hpp_source.html +37 -36
- data/reference/cpp/annotated.html +0 -1
- data/reference/cpp/class_gosu_1_1_bitmap-members.html +1 -1
- data/reference/cpp/class_gosu_1_1_bitmap.html +3 -3
- data/reference/cpp/class_gosu_1_1_color-members.html +11 -0
- data/reference/cpp/class_gosu_1_1_color.html +212 -1
- data/reference/cpp/class_gosu_1_1_font-members.html +3 -3
- data/reference/cpp/class_gosu_1_1_font.html +12 -12
- data/reference/cpp/class_gosu_1_1_graphics-members.html +1 -1
- data/reference/cpp/class_gosu_1_1_graphics.html +5 -5
- data/reference/cpp/class_gosu_1_1_image-members.html +3 -3
- data/reference/cpp/class_gosu_1_1_image.html +13 -13
- data/reference/cpp/class_gosu_1_1_sample-members.html +2 -0
- data/reference/cpp/class_gosu_1_1_sample.html +70 -26
- data/reference/cpp/class_gosu_1_1_sample_instance.html +1 -1
- data/reference/cpp/class_gosu_1_1_song-members.html +3 -0
- data/reference/cpp/class_gosu_1_1_song.html +103 -26
- data/reference/cpp/class_gosu_1_1_text_input-members.html +2 -1
- data/reference/cpp/class_gosu_1_1_text_input.html +31 -4
- data/reference/cpp/class_gosu_1_1_window.html +6 -6
- data/reference/cpp/classes.html +12 -13
- data/reference/cpp/functions.html +3 -3
- data/reference/cpp/functions_0x62.html +7 -3
- data/reference/cpp/functions_0x63.html +4 -2
- data/reference/cpp/functions_0x64.html +6 -6
- data/reference/cpp/functions_0x66.html +4 -0
- data/reference/cpp/functions_0x67.html +4 -0
- data/reference/cpp/functions_0x6e.html +2 -0
- data/reference/cpp/functions_0x72.html +4 -2
- data/reference/cpp/functions_0x73.html +6 -6
- data/reference/cpp/functions_0x75.html +1 -1
- data/reference/cpp/functions_0x77.html +5 -3
- data/reference/cpp/functions_0x79.html +2 -0
- data/reference/cpp/functions_0x7e.html +1 -3
- data/reference/cpp/functions_func.html +0 -2
- data/reference/cpp/functions_func_0x62.html +1 -1
- data/reference/cpp/functions_func_0x64.html +6 -6
- data/reference/cpp/functions_func_0x66.html +2 -0
- data/reference/cpp/functions_func_0x72.html +1 -1
- data/reference/cpp/functions_func_0x73.html +8 -8
- data/reference/cpp/functions_func_0x75.html +1 -1
- data/reference/cpp/functions_func_0x7e.html +1 -3
- data/reference/cpp/functions_vars.html +22 -0
- data/reference/cpp/hierarchy.html +0 -1
- data/reference/cpp/namespace_gosu.html +2 -8
- data/reference/cpp/namespace_gosu_1_1_colors.html +30 -17
- data/reference/cpp/namespacemembers.html +2 -0
- data/reference/cpp/namespacemembers_vars.html +2 -0
- data/reference/cpp/namespaces.html +1 -1
- data/reference/rdoc/classes/Gosu.html +23 -3
- data/reference/rdoc/classes/Gosu/Color.html +127 -29
- data/reference/rdoc/classes/Gosu/Font.html +31 -21
- data/reference/rdoc/classes/Gosu/GLTexInfo.html +3 -3
- data/reference/rdoc/classes/Gosu/Image.html +52 -37
- data/reference/rdoc/classes/Gosu/Sample.html +19 -13
- data/reference/rdoc/classes/Gosu/SampleInstance.html +29 -19
- data/reference/rdoc/classes/Gosu/Song.html +41 -27
- data/reference/rdoc/classes/Gosu/TextInput.html +42 -3
- data/reference/rdoc/classes/Gosu/Window.html +102 -69
- data/reference/rdoc/classes/Numeric.html +7 -3
- data/reference/rdoc/created.rid +1 -1
- data/reference/rdoc/files/COPYING_txt.html +3 -3
- data/reference/rdoc/files/README_txt.html +3 -3
- data/reference/rdoc/files/reference/Deployment on OS X_rdoc.html +4 -19
- data/reference/rdoc/files/reference/Deployment on Windows_rdoc.html +18 -31
- data/reference/rdoc/files/reference/Drawing with Colors_rdoc.html +3 -3
- data/reference/rdoc/files/reference/Order of Corners_rdoc.html +3 -3
- data/reference/rdoc/files/reference/Tileability_rdoc.html +3 -3
- data/reference/rdoc/files/reference/Z Ordering_rdoc.html +3 -3
- data/reference/rdoc/files/reference/gosu_rb.html +3 -3
- data/reference/rdoc/fr_method_index.html +49 -48
- data/reference/rdoc/index.html +1 -1
- metadata +912 -66
- data/reference/rdoc/classes/Gosu.src/M000003.html +0 -0
- data/reference/rdoc/classes/Gosu.src/M000004.html +0 -0
- data/reference/rdoc/classes/Gosu.src/M000005.html +0 -0
- data/reference/rdoc/classes/Gosu.src/M000006.html +0 -0
- data/reference/rdoc/classes/Gosu.src/M000007.html +0 -0
- data/reference/rdoc/classes/Gosu.src/M000008.html +0 -0
- data/reference/rdoc/classes/Gosu.src/M000009.html +0 -0
- data/reference/rdoc/classes/Gosu.src/M000010.html +0 -0
- data/reference/rdoc/classes/Gosu.src/M000011.html +0 -0
- data/reference/rdoc/classes/Gosu.src/M000012.html +0 -0
- data/reference/rdoc/classes/Gosu/Color.src/M000016.html +0 -0
- data/reference/rdoc/classes/Gosu/Color.src/M000017.html +0 -0
- data/reference/rdoc/classes/Gosu/Color.src/M000018.html +0 -0
- data/reference/rdoc/classes/Gosu/Color.src/M000019.html +0 -0
- data/reference/rdoc/classes/Gosu/Font.src/M000029.html +0 -0
- data/reference/rdoc/classes/Gosu/Font.src/M000030.html +0 -0
- data/reference/rdoc/classes/Gosu/Font.src/M000031.html +0 -0
- data/reference/rdoc/classes/Gosu/Font.src/M000032.html +0 -0
- data/reference/rdoc/classes/Gosu/Font.src/M000033.html +0 -0
- data/reference/rdoc/classes/Gosu/Image.src/M000020.html +0 -0
- data/reference/rdoc/classes/Gosu/Image.src/M000021.html +0 -0
- data/reference/rdoc/classes/Gosu/Image.src/M000022.html +0 -0
- data/reference/rdoc/classes/Gosu/Image.src/M000023.html +0 -0
- data/reference/rdoc/classes/Gosu/Image.src/M000024.html +0 -0
- data/reference/rdoc/classes/Gosu/Image.src/M000025.html +0 -0
- data/reference/rdoc/classes/Gosu/Image.src/M000026.html +0 -0
- data/reference/rdoc/classes/Gosu/Image.src/M000027.html +0 -0
- data/reference/rdoc/classes/Gosu/Image.src/M000028.html +0 -0
- data/reference/rdoc/classes/Gosu/Sample.src/M000013.html +0 -0
- data/reference/rdoc/classes/Gosu/Sample.src/M000014.html +0 -0
- data/reference/rdoc/classes/Gosu/Sample.src/M000015.html +0 -0
- data/reference/rdoc/classes/Gosu/SampleInstance.src/M000051.html +0 -0
- data/reference/rdoc/classes/Gosu/SampleInstance.src/M000052.html +0 -0
- data/reference/rdoc/classes/Gosu/SampleInstance.src/M000053.html +0 -0
- data/reference/rdoc/classes/Gosu/SampleInstance.src/M000054.html +0 -0
- data/reference/rdoc/classes/Gosu/SampleInstance.src/M000055.html +0 -0
- data/reference/rdoc/classes/Gosu/Song.src/M000056.html +0 -0
- data/reference/rdoc/classes/Gosu/Song.src/M000057.html +0 -0
- data/reference/rdoc/classes/Gosu/Song.src/M000058.html +0 -0
- data/reference/rdoc/classes/Gosu/Song.src/M000059.html +0 -0
- data/reference/rdoc/classes/Gosu/Song.src/M000060.html +0 -0
- data/reference/rdoc/classes/Gosu/Song.src/M000061.html +0 -0
- data/reference/rdoc/classes/Gosu/Song.src/M000062.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000034.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000035.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000036.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000037.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000038.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000039.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000040.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000041.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000042.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000043.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000044.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000045.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000046.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000047.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000048.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000049.html +0 -0
- data/reference/rdoc/classes/Gosu/Window.src/M000050.html +0 -0
- data/reference/rdoc/classes/Numeric.src/M000001.html +0 -0
- data/reference/rdoc/classes/Numeric.src/M000002.html +0 -0
@@ -0,0 +1,59 @@
|
|
1
|
+
Microsoft Developer Studio Workspace File, Format Version 6.00
|
2
|
+
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
|
3
|
+
|
4
|
+
###############################################################################
|
5
|
+
|
6
|
+
Project: "example"=.\example.dsp - Package Owner=<4>
|
7
|
+
|
8
|
+
Package=<5>
|
9
|
+
{{{
|
10
|
+
}}}
|
11
|
+
|
12
|
+
Package=<4>
|
13
|
+
{{{
|
14
|
+
Begin Project Dependency
|
15
|
+
Project_Dep_Name zlib
|
16
|
+
End Project Dependency
|
17
|
+
}}}
|
18
|
+
|
19
|
+
###############################################################################
|
20
|
+
|
21
|
+
Project: "minigzip"=.\minigzip.dsp - Package Owner=<4>
|
22
|
+
|
23
|
+
Package=<5>
|
24
|
+
{{{
|
25
|
+
}}}
|
26
|
+
|
27
|
+
Package=<4>
|
28
|
+
{{{
|
29
|
+
Begin Project Dependency
|
30
|
+
Project_Dep_Name zlib
|
31
|
+
End Project Dependency
|
32
|
+
}}}
|
33
|
+
|
34
|
+
###############################################################################
|
35
|
+
|
36
|
+
Project: "zlib"=.\zlib.dsp - Package Owner=<4>
|
37
|
+
|
38
|
+
Package=<5>
|
39
|
+
{{{
|
40
|
+
}}}
|
41
|
+
|
42
|
+
Package=<4>
|
43
|
+
{{{
|
44
|
+
}}}
|
45
|
+
|
46
|
+
###############################################################################
|
47
|
+
|
48
|
+
Global:
|
49
|
+
|
50
|
+
Package=<5>
|
51
|
+
{{{
|
52
|
+
}}}
|
53
|
+
|
54
|
+
Package=<3>
|
55
|
+
{{{
|
56
|
+
}}}
|
57
|
+
|
58
|
+
###############################################################################
|
59
|
+
|
@@ -0,0 +1,141 @@
|
|
1
|
+
<QPG:Generation>
|
2
|
+
<QPG:Options>
|
3
|
+
<QPG:User unattended="no" verbosity="2" listfiles="yes"/>
|
4
|
+
<QPG:Defaults type="qnx_package"/>
|
5
|
+
<QPG:Source></QPG:Source>
|
6
|
+
<QPG:Release number="+"/>
|
7
|
+
<QPG:Build></QPG:Build>
|
8
|
+
<QPG:FileSorting strip="yes"/>
|
9
|
+
<QPG:Package targets="combine"/>
|
10
|
+
<QPG:Repository generate="yes"/>
|
11
|
+
<QPG:FinalDir></QPG:FinalDir>
|
12
|
+
<QPG:Cleanup></QPG:Cleanup>
|
13
|
+
</QPG:Options>
|
14
|
+
|
15
|
+
<QPG:Responsible>
|
16
|
+
<QPG:Company></QPG:Company>
|
17
|
+
<QPG:Department></QPG:Department>
|
18
|
+
<QPG:Group></QPG:Group>
|
19
|
+
<QPG:Team></QPG:Team>
|
20
|
+
<QPG:Employee></QPG:Employee>
|
21
|
+
<QPG:EmailAddress></QPG:EmailAddress>
|
22
|
+
</QPG:Responsible>
|
23
|
+
|
24
|
+
<QPG:Values>
|
25
|
+
<QPG:Files>
|
26
|
+
<QPG:Add file="../zconf.h" install="/opt/include/" user="root:sys" permission="644"/>
|
27
|
+
<QPG:Add file="../zlib.h" install="/opt/include/" user="root:sys" permission="644"/>
|
28
|
+
<QPG:Add file="../libz.so.1.2.3" install="/opt/lib/" user="root:bin" permission="644"/>
|
29
|
+
<QPG:Add file="libz.so" install="/opt/lib/" component="dev" filetype="symlink" linkto="libz.so.1.2.3"/>
|
30
|
+
<QPG:Add file="libz.so.1" install="/opt/lib/" filetype="symlink" linkto="libz.so.1.2.3"/>
|
31
|
+
<QPG:Add file="../libz.so.1.2.3" install="/opt/lib/" component="slib"/>
|
32
|
+
</QPG:Files>
|
33
|
+
|
34
|
+
<QPG:PackageFilter>
|
35
|
+
<QPM:PackageManifest>
|
36
|
+
<QPM:PackageDescription>
|
37
|
+
<QPM:PackageType>Library</QPM:PackageType>
|
38
|
+
<QPM:PackageReleaseNotes></QPM:PackageReleaseNotes>
|
39
|
+
<QPM:PackageReleaseUrgency>Medium</QPM:PackageReleaseUrgency>
|
40
|
+
<QPM:PackageRepository></QPM:PackageRepository>
|
41
|
+
<QPM:FileVersion>2.0</QPM:FileVersion>
|
42
|
+
</QPM:PackageDescription>
|
43
|
+
|
44
|
+
<QPM:ProductDescription>
|
45
|
+
<QPM:ProductName>zlib</QPM:ProductName>
|
46
|
+
<QPM:ProductIdentifier>zlib</QPM:ProductIdentifier>
|
47
|
+
<QPM:ProductEmail>alain.bonnefoy@icbt.com</QPM:ProductEmail>
|
48
|
+
<QPM:VendorName>Public</QPM:VendorName>
|
49
|
+
<QPM:VendorInstallName>public</QPM:VendorInstallName>
|
50
|
+
<QPM:VendorURL>www.gzip.org/zlib</QPM:VendorURL>
|
51
|
+
<QPM:VendorEmbedURL></QPM:VendorEmbedURL>
|
52
|
+
<QPM:VendorEmail></QPM:VendorEmail>
|
53
|
+
<QPM:AuthorName>Jean-Loup Gailly,Mark Adler</QPM:AuthorName>
|
54
|
+
<QPM:AuthorURL>www.gzip.org/zlib</QPM:AuthorURL>
|
55
|
+
<QPM:AuthorEmbedURL></QPM:AuthorEmbedURL>
|
56
|
+
<QPM:AuthorEmail>zlib@gzip.org</QPM:AuthorEmail>
|
57
|
+
<QPM:ProductIconSmall></QPM:ProductIconSmall>
|
58
|
+
<QPM:ProductIconLarge></QPM:ProductIconLarge>
|
59
|
+
<QPM:ProductDescriptionShort>A massively spiffy yet delicately unobtrusive compression library.</QPM:ProductDescriptionShort>
|
60
|
+
<QPM:ProductDescriptionLong>zlib is designed to be a free, general-purpose, legally unencumbered, lossless data compression library for use on virtually any computer hardware and operating system.</QPM:ProductDescriptionLong>
|
61
|
+
<QPM:ProductDescriptionURL>http://www.gzip.org/zlib</QPM:ProductDescriptionURL>
|
62
|
+
<QPM:ProductDescriptionEmbedURL></QPM:ProductDescriptionEmbedURL>
|
63
|
+
</QPM:ProductDescription>
|
64
|
+
|
65
|
+
<QPM:ReleaseDescription>
|
66
|
+
<QPM:ReleaseVersion>1.2.3</QPM:ReleaseVersion>
|
67
|
+
<QPM:ReleaseUrgency>Medium</QPM:ReleaseUrgency>
|
68
|
+
<QPM:ReleaseStability>Stable</QPM:ReleaseStability>
|
69
|
+
<QPM:ReleaseNoteMinor></QPM:ReleaseNoteMinor>
|
70
|
+
<QPM:ReleaseNoteMajor></QPM:ReleaseNoteMajor>
|
71
|
+
<QPM:ExcludeCountries>
|
72
|
+
<QPM:Country></QPM:Country>
|
73
|
+
</QPM:ExcludeCountries>
|
74
|
+
|
75
|
+
<QPM:ReleaseCopyright>No License</QPM:ReleaseCopyright>
|
76
|
+
</QPM:ReleaseDescription>
|
77
|
+
|
78
|
+
<QPM:ContentDescription>
|
79
|
+
<QPM:ContentTopic xmlmultiple="true">Software Development/Libraries and Extensions/C Libraries</QPM:ContentTopic>
|
80
|
+
<QPM:ContentKeyword>zlib,compression</QPM:ContentKeyword>
|
81
|
+
<QPM:TargetOS>qnx6</QPM:TargetOS>
|
82
|
+
<QPM:HostOS>qnx6</QPM:HostOS>
|
83
|
+
<QPM:DisplayEnvironment xmlmultiple="true">None</QPM:DisplayEnvironment>
|
84
|
+
<QPM:TargetAudience xmlmultiple="true">Developer</QPM:TargetAudience>
|
85
|
+
</QPM:ContentDescription>
|
86
|
+
</QPM:PackageManifest>
|
87
|
+
</QPG:PackageFilter>
|
88
|
+
|
89
|
+
<QPG:PackageFilter proc="none" target="none">
|
90
|
+
<QPM:PackageManifest>
|
91
|
+
<QPM:ProductInstallationDependencies>
|
92
|
+
<QPM:ProductRequirements></QPM:ProductRequirements>
|
93
|
+
</QPM:ProductInstallationDependencies>
|
94
|
+
|
95
|
+
<QPM:ProductInstallationProcedure>
|
96
|
+
<QPM:Script xmlmultiple="true">
|
97
|
+
<QPM:ScriptName></QPM:ScriptName>
|
98
|
+
<QPM:ScriptType>Install</QPM:ScriptType>
|
99
|
+
<QPM:ScriptTiming>Post</QPM:ScriptTiming>
|
100
|
+
<QPM:ScriptBlocking>No</QPM:ScriptBlocking>
|
101
|
+
<QPM:ScriptResult>Ignore</QPM:ScriptResult>
|
102
|
+
<QPM:ShortDescription></QPM:ShortDescription>
|
103
|
+
<QPM:UseBinaries>No</QPM:UseBinaries>
|
104
|
+
<QPM:Priority>Optional</QPM:Priority>
|
105
|
+
</QPM:Script>
|
106
|
+
</QPM:ProductInstallationProcedure>
|
107
|
+
</QPM:PackageManifest>
|
108
|
+
|
109
|
+
<QPM:Launch>
|
110
|
+
</QPM:Launch>
|
111
|
+
</QPG:PackageFilter>
|
112
|
+
|
113
|
+
<QPG:PackageFilter type="core" component="none">
|
114
|
+
<QPM:PackageManifest>
|
115
|
+
<QPM:ProductInstallationProcedure>
|
116
|
+
<QPM:OrderDependency xmlmultiple="true">
|
117
|
+
<QPM:Order>InstallOver</QPM:Order>
|
118
|
+
<QPM:Product>zlib</QPM:Product>
|
119
|
+
</QPM:OrderDependency>
|
120
|
+
</QPM:ProductInstallationProcedure>
|
121
|
+
</QPM:PackageManifest>
|
122
|
+
|
123
|
+
<QPM:Launch>
|
124
|
+
</QPM:Launch>
|
125
|
+
</QPG:PackageFilter>
|
126
|
+
|
127
|
+
<QPG:PackageFilter type="core" component="dev">
|
128
|
+
<QPM:PackageManifest>
|
129
|
+
<QPM:ProductInstallationProcedure>
|
130
|
+
<QPM:OrderDependency xmlmultiple="true">
|
131
|
+
<QPM:Order>InstallOver</QPM:Order>
|
132
|
+
<QPM:Product>zlib-dev</QPM:Product>
|
133
|
+
</QPM:OrderDependency>
|
134
|
+
</QPM:ProductInstallationProcedure>
|
135
|
+
</QPM:PackageManifest>
|
136
|
+
|
137
|
+
<QPM:Launch>
|
138
|
+
</QPM:Launch>
|
139
|
+
</QPG:PackageFilter>
|
140
|
+
</QPG:Values>
|
141
|
+
</QPG:Generation>
|
@@ -0,0 +1,1219 @@
|
|
1
|
+
/* trees.c -- output deflated data using Huffman coding
|
2
|
+
* Copyright (C) 1995-2005 Jean-loup Gailly
|
3
|
+
* For conditions of distribution and use, see copyright notice in zlib.h
|
4
|
+
*/
|
5
|
+
|
6
|
+
/*
|
7
|
+
* ALGORITHM
|
8
|
+
*
|
9
|
+
* The "deflation" process uses several Huffman trees. The more
|
10
|
+
* common source values are represented by shorter bit sequences.
|
11
|
+
*
|
12
|
+
* Each code tree is stored in a compressed form which is itself
|
13
|
+
* a Huffman encoding of the lengths of all the code strings (in
|
14
|
+
* ascending order by source values). The actual code strings are
|
15
|
+
* reconstructed from the lengths in the inflate process, as described
|
16
|
+
* in the deflate specification.
|
17
|
+
*
|
18
|
+
* REFERENCES
|
19
|
+
*
|
20
|
+
* Deutsch, L.P.,"'Deflate' Compressed Data Format Specification".
|
21
|
+
* Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc
|
22
|
+
*
|
23
|
+
* Storer, James A.
|
24
|
+
* Data Compression: Methods and Theory, pp. 49-50.
|
25
|
+
* Computer Science Press, 1988. ISBN 0-7167-8156-5.
|
26
|
+
*
|
27
|
+
* Sedgewick, R.
|
28
|
+
* Algorithms, p290.
|
29
|
+
* Addison-Wesley, 1983. ISBN 0-201-06672-6.
|
30
|
+
*/
|
31
|
+
|
32
|
+
/* @(#) $Id$ */
|
33
|
+
|
34
|
+
/* #define GEN_TREES_H */
|
35
|
+
|
36
|
+
#include "deflate.h"
|
37
|
+
|
38
|
+
#ifdef DEBUG
|
39
|
+
# include <ctype.h>
|
40
|
+
#endif
|
41
|
+
|
42
|
+
/* ===========================================================================
|
43
|
+
* Constants
|
44
|
+
*/
|
45
|
+
|
46
|
+
#define MAX_BL_BITS 7
|
47
|
+
/* Bit length codes must not exceed MAX_BL_BITS bits */
|
48
|
+
|
49
|
+
#define END_BLOCK 256
|
50
|
+
/* end of block literal code */
|
51
|
+
|
52
|
+
#define REP_3_6 16
|
53
|
+
/* repeat previous bit length 3-6 times (2 bits of repeat count) */
|
54
|
+
|
55
|
+
#define REPZ_3_10 17
|
56
|
+
/* repeat a zero length 3-10 times (3 bits of repeat count) */
|
57
|
+
|
58
|
+
#define REPZ_11_138 18
|
59
|
+
/* repeat a zero length 11-138 times (7 bits of repeat count) */
|
60
|
+
|
61
|
+
local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
|
62
|
+
= {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0};
|
63
|
+
|
64
|
+
local const int extra_dbits[D_CODES] /* extra bits for each distance code */
|
65
|
+
= {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13};
|
66
|
+
|
67
|
+
local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
|
68
|
+
= {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7};
|
69
|
+
|
70
|
+
local const uch bl_order[BL_CODES]
|
71
|
+
= {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15};
|
72
|
+
/* The lengths of the bit length codes are sent in order of decreasing
|
73
|
+
* probability, to avoid transmitting the lengths for unused bit length codes.
|
74
|
+
*/
|
75
|
+
|
76
|
+
#define Buf_size (8 * 2*sizeof(char))
|
77
|
+
/* Number of bits used within bi_buf. (bi_buf might be implemented on
|
78
|
+
* more than 16 bits on some systems.)
|
79
|
+
*/
|
80
|
+
|
81
|
+
/* ===========================================================================
|
82
|
+
* Local data. These are initialized only once.
|
83
|
+
*/
|
84
|
+
|
85
|
+
#define DIST_CODE_LEN 512 /* see definition of array dist_code below */
|
86
|
+
|
87
|
+
#if defined(GEN_TREES_H) || !defined(STDC)
|
88
|
+
/* non ANSI compilers may not accept trees.h */
|
89
|
+
|
90
|
+
local ct_data static_ltree[L_CODES+2];
|
91
|
+
/* The static literal tree. Since the bit lengths are imposed, there is no
|
92
|
+
* need for the L_CODES extra codes used during heap construction. However
|
93
|
+
* The codes 286 and 287 are needed to build a canonical tree (see _tr_init
|
94
|
+
* below).
|
95
|
+
*/
|
96
|
+
|
97
|
+
local ct_data static_dtree[D_CODES];
|
98
|
+
/* The static distance tree. (Actually a trivial tree since all codes use
|
99
|
+
* 5 bits.)
|
100
|
+
*/
|
101
|
+
|
102
|
+
uch _dist_code[DIST_CODE_LEN];
|
103
|
+
/* Distance codes. The first 256 values correspond to the distances
|
104
|
+
* 3 .. 258, the last 256 values correspond to the top 8 bits of
|
105
|
+
* the 15 bit distances.
|
106
|
+
*/
|
107
|
+
|
108
|
+
uch _length_code[MAX_MATCH-MIN_MATCH+1];
|
109
|
+
/* length code for each normalized match length (0 == MIN_MATCH) */
|
110
|
+
|
111
|
+
local int base_length[LENGTH_CODES];
|
112
|
+
/* First normalized length for each code (0 = MIN_MATCH) */
|
113
|
+
|
114
|
+
local int base_dist[D_CODES];
|
115
|
+
/* First normalized distance for each code (0 = distance of 1) */
|
116
|
+
|
117
|
+
#else
|
118
|
+
# include "trees.h"
|
119
|
+
#endif /* GEN_TREES_H */
|
120
|
+
|
121
|
+
struct static_tree_desc_s {
|
122
|
+
const ct_data *static_tree; /* static tree or NULL */
|
123
|
+
const intf *extra_bits; /* extra bits for each code or NULL */
|
124
|
+
int extra_base; /* base index for extra_bits */
|
125
|
+
int elems; /* max number of elements in the tree */
|
126
|
+
int max_length; /* max bit length for the codes */
|
127
|
+
};
|
128
|
+
|
129
|
+
local static_tree_desc static_l_desc =
|
130
|
+
{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
|
131
|
+
|
132
|
+
local static_tree_desc static_d_desc =
|
133
|
+
{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
|
134
|
+
|
135
|
+
local static_tree_desc static_bl_desc =
|
136
|
+
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
|
137
|
+
|
138
|
+
/* ===========================================================================
|
139
|
+
* Local (static) routines in this file.
|
140
|
+
*/
|
141
|
+
|
142
|
+
local void tr_static_init OF((void));
|
143
|
+
local void init_block OF((deflate_state *s));
|
144
|
+
local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
|
145
|
+
local void gen_bitlen OF((deflate_state *s, tree_desc *desc));
|
146
|
+
local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
|
147
|
+
local void build_tree OF((deflate_state *s, tree_desc *desc));
|
148
|
+
local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
|
149
|
+
local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
|
150
|
+
local int build_bl_tree OF((deflate_state *s));
|
151
|
+
local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
|
152
|
+
int blcodes));
|
153
|
+
local void compress_block OF((deflate_state *s, ct_data *ltree,
|
154
|
+
ct_data *dtree));
|
155
|
+
local void set_data_type OF((deflate_state *s));
|
156
|
+
local unsigned bi_reverse OF((unsigned value, int length));
|
157
|
+
local void bi_windup OF((deflate_state *s));
|
158
|
+
local void bi_flush OF((deflate_state *s));
|
159
|
+
local void copy_block OF((deflate_state *s, charf *buf, unsigned len,
|
160
|
+
int header));
|
161
|
+
|
162
|
+
#ifdef GEN_TREES_H
|
163
|
+
local void gen_trees_header OF((void));
|
164
|
+
#endif
|
165
|
+
|
166
|
+
#ifndef DEBUG
|
167
|
+
# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
|
168
|
+
/* Send a code of the given tree. c and tree must not have side effects */
|
169
|
+
|
170
|
+
#else /* DEBUG */
|
171
|
+
# define send_code(s, c, tree) \
|
172
|
+
{ if (z_verbose>2) fprintf(stderr,"\ncd %3d ",(c)); \
|
173
|
+
send_bits(s, tree[c].Code, tree[c].Len); }
|
174
|
+
#endif
|
175
|
+
|
176
|
+
/* ===========================================================================
|
177
|
+
* Output a short LSB first on the stream.
|
178
|
+
* IN assertion: there is enough room in pendingBuf.
|
179
|
+
*/
|
180
|
+
#define put_short(s, w) { \
|
181
|
+
put_byte(s, (uch)((w) & 0xff)); \
|
182
|
+
put_byte(s, (uch)((ush)(w) >> 8)); \
|
183
|
+
}
|
184
|
+
|
185
|
+
/* ===========================================================================
|
186
|
+
* Send a value on a given number of bits.
|
187
|
+
* IN assertion: length <= 16 and value fits in length bits.
|
188
|
+
*/
|
189
|
+
#ifdef DEBUG
|
190
|
+
local void send_bits OF((deflate_state *s, int value, int length));
|
191
|
+
|
192
|
+
local void send_bits(s, value, length)
|
193
|
+
deflate_state *s;
|
194
|
+
int value; /* value to send */
|
195
|
+
int length; /* number of bits */
|
196
|
+
{
|
197
|
+
Tracevv((stderr," l %2d v %4x ", length, value));
|
198
|
+
Assert(length > 0 && length <= 15, "invalid length");
|
199
|
+
s->bits_sent += (ulg)length;
|
200
|
+
|
201
|
+
/* If not enough room in bi_buf, use (valid) bits from bi_buf and
|
202
|
+
* (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
|
203
|
+
* unused bits in value.
|
204
|
+
*/
|
205
|
+
if (s->bi_valid > (int)Buf_size - length) {
|
206
|
+
s->bi_buf |= (value << s->bi_valid);
|
207
|
+
put_short(s, s->bi_buf);
|
208
|
+
s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
|
209
|
+
s->bi_valid += length - Buf_size;
|
210
|
+
} else {
|
211
|
+
s->bi_buf |= value << s->bi_valid;
|
212
|
+
s->bi_valid += length;
|
213
|
+
}
|
214
|
+
}
|
215
|
+
#else /* !DEBUG */
|
216
|
+
|
217
|
+
#define send_bits(s, value, length) \
|
218
|
+
{ int len = length;\
|
219
|
+
if (s->bi_valid > (int)Buf_size - len) {\
|
220
|
+
int val = value;\
|
221
|
+
s->bi_buf |= (val << s->bi_valid);\
|
222
|
+
put_short(s, s->bi_buf);\
|
223
|
+
s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
|
224
|
+
s->bi_valid += len - Buf_size;\
|
225
|
+
} else {\
|
226
|
+
s->bi_buf |= (value) << s->bi_valid;\
|
227
|
+
s->bi_valid += len;\
|
228
|
+
}\
|
229
|
+
}
|
230
|
+
#endif /* DEBUG */
|
231
|
+
|
232
|
+
|
233
|
+
/* the arguments must not have side effects */
|
234
|
+
|
235
|
+
/* ===========================================================================
|
236
|
+
* Initialize the various 'constant' tables.
|
237
|
+
*/
|
238
|
+
local void tr_static_init()
|
239
|
+
{
|
240
|
+
#if defined(GEN_TREES_H) || !defined(STDC)
|
241
|
+
static int static_init_done = 0;
|
242
|
+
int n; /* iterates over tree elements */
|
243
|
+
int bits; /* bit counter */
|
244
|
+
int length; /* length value */
|
245
|
+
int code; /* code value */
|
246
|
+
int dist; /* distance index */
|
247
|
+
ush bl_count[MAX_BITS+1];
|
248
|
+
/* number of codes at each bit length for an optimal tree */
|
249
|
+
|
250
|
+
if (static_init_done) return;
|
251
|
+
|
252
|
+
/* For some embedded targets, global variables are not initialized: */
|
253
|
+
static_l_desc.static_tree = static_ltree;
|
254
|
+
static_l_desc.extra_bits = extra_lbits;
|
255
|
+
static_d_desc.static_tree = static_dtree;
|
256
|
+
static_d_desc.extra_bits = extra_dbits;
|
257
|
+
static_bl_desc.extra_bits = extra_blbits;
|
258
|
+
|
259
|
+
/* Initialize the mapping length (0..255) -> length code (0..28) */
|
260
|
+
length = 0;
|
261
|
+
for (code = 0; code < LENGTH_CODES-1; code++) {
|
262
|
+
base_length[code] = length;
|
263
|
+
for (n = 0; n < (1<<extra_lbits[code]); n++) {
|
264
|
+
_length_code[length++] = (uch)code;
|
265
|
+
}
|
266
|
+
}
|
267
|
+
Assert (length == 256, "tr_static_init: length != 256");
|
268
|
+
/* Note that the length 255 (match length 258) can be represented
|
269
|
+
* in two different ways: code 284 + 5 bits or code 285, so we
|
270
|
+
* overwrite length_code[255] to use the best encoding:
|
271
|
+
*/
|
272
|
+
_length_code[length-1] = (uch)code;
|
273
|
+
|
274
|
+
/* Initialize the mapping dist (0..32K) -> dist code (0..29) */
|
275
|
+
dist = 0;
|
276
|
+
for (code = 0 ; code < 16; code++) {
|
277
|
+
base_dist[code] = dist;
|
278
|
+
for (n = 0; n < (1<<extra_dbits[code]); n++) {
|
279
|
+
_dist_code[dist++] = (uch)code;
|
280
|
+
}
|
281
|
+
}
|
282
|
+
Assert (dist == 256, "tr_static_init: dist != 256");
|
283
|
+
dist >>= 7; /* from now on, all distances are divided by 128 */
|
284
|
+
for ( ; code < D_CODES; code++) {
|
285
|
+
base_dist[code] = dist << 7;
|
286
|
+
for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
|
287
|
+
_dist_code[256 + dist++] = (uch)code;
|
288
|
+
}
|
289
|
+
}
|
290
|
+
Assert (dist == 256, "tr_static_init: 256+dist != 512");
|
291
|
+
|
292
|
+
/* Construct the codes of the static literal tree */
|
293
|
+
for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
|
294
|
+
n = 0;
|
295
|
+
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
|
296
|
+
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
|
297
|
+
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
|
298
|
+
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
|
299
|
+
/* Codes 286 and 287 do not exist, but we must include them in the
|
300
|
+
* tree construction to get a canonical Huffman tree (longest code
|
301
|
+
* all ones)
|
302
|
+
*/
|
303
|
+
gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
|
304
|
+
|
305
|
+
/* The static distance tree is trivial: */
|
306
|
+
for (n = 0; n < D_CODES; n++) {
|
307
|
+
static_dtree[n].Len = 5;
|
308
|
+
static_dtree[n].Code = bi_reverse((unsigned)n, 5);
|
309
|
+
}
|
310
|
+
static_init_done = 1;
|
311
|
+
|
312
|
+
# ifdef GEN_TREES_H
|
313
|
+
gen_trees_header();
|
314
|
+
# endif
|
315
|
+
#endif /* defined(GEN_TREES_H) || !defined(STDC) */
|
316
|
+
}
|
317
|
+
|
318
|
+
/* ===========================================================================
|
319
|
+
* Genererate the file trees.h describing the static trees.
|
320
|
+
*/
|
321
|
+
#ifdef GEN_TREES_H
|
322
|
+
# ifndef DEBUG
|
323
|
+
# include <stdio.h>
|
324
|
+
# endif
|
325
|
+
|
326
|
+
# define SEPARATOR(i, last, width) \
|
327
|
+
((i) == (last)? "\n};\n\n" : \
|
328
|
+
((i) % (width) == (width)-1 ? ",\n" : ", "))
|
329
|
+
|
330
|
+
void gen_trees_header()
|
331
|
+
{
|
332
|
+
FILE *header = fopen("trees.h", "w");
|
333
|
+
int i;
|
334
|
+
|
335
|
+
Assert (header != NULL, "Can't open trees.h");
|
336
|
+
fprintf(header,
|
337
|
+
"/* header created automatically with -DGEN_TREES_H */\n\n");
|
338
|
+
|
339
|
+
fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
|
340
|
+
for (i = 0; i < L_CODES+2; i++) {
|
341
|
+
fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,
|
342
|
+
static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
|
343
|
+
}
|
344
|
+
|
345
|
+
fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
|
346
|
+
for (i = 0; i < D_CODES; i++) {
|
347
|
+
fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,
|
348
|
+
static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
|
349
|
+
}
|
350
|
+
|
351
|
+
fprintf(header, "const uch _dist_code[DIST_CODE_LEN] = {\n");
|
352
|
+
for (i = 0; i < DIST_CODE_LEN; i++) {
|
353
|
+
fprintf(header, "%2u%s", _dist_code[i],
|
354
|
+
SEPARATOR(i, DIST_CODE_LEN-1, 20));
|
355
|
+
}
|
356
|
+
|
357
|
+
fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
|
358
|
+
for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
|
359
|
+
fprintf(header, "%2u%s", _length_code[i],
|
360
|
+
SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
|
361
|
+
}
|
362
|
+
|
363
|
+
fprintf(header, "local const int base_length[LENGTH_CODES] = {\n");
|
364
|
+
for (i = 0; i < LENGTH_CODES; i++) {
|
365
|
+
fprintf(header, "%1u%s", base_length[i],
|
366
|
+
SEPARATOR(i, LENGTH_CODES-1, 20));
|
367
|
+
}
|
368
|
+
|
369
|
+
fprintf(header, "local const int base_dist[D_CODES] = {\n");
|
370
|
+
for (i = 0; i < D_CODES; i++) {
|
371
|
+
fprintf(header, "%5u%s", base_dist[i],
|
372
|
+
SEPARATOR(i, D_CODES-1, 10));
|
373
|
+
}
|
374
|
+
|
375
|
+
fclose(header);
|
376
|
+
}
|
377
|
+
#endif /* GEN_TREES_H */
|
378
|
+
|
379
|
+
/* ===========================================================================
|
380
|
+
* Initialize the tree data structures for a new zlib stream.
|
381
|
+
*/
|
382
|
+
void _tr_init(s)
|
383
|
+
deflate_state *s;
|
384
|
+
{
|
385
|
+
tr_static_init();
|
386
|
+
|
387
|
+
s->l_desc.dyn_tree = s->dyn_ltree;
|
388
|
+
s->l_desc.stat_desc = &static_l_desc;
|
389
|
+
|
390
|
+
s->d_desc.dyn_tree = s->dyn_dtree;
|
391
|
+
s->d_desc.stat_desc = &static_d_desc;
|
392
|
+
|
393
|
+
s->bl_desc.dyn_tree = s->bl_tree;
|
394
|
+
s->bl_desc.stat_desc = &static_bl_desc;
|
395
|
+
|
396
|
+
s->bi_buf = 0;
|
397
|
+
s->bi_valid = 0;
|
398
|
+
s->last_eob_len = 8; /* enough lookahead for inflate */
|
399
|
+
#ifdef DEBUG
|
400
|
+
s->compressed_len = 0L;
|
401
|
+
s->bits_sent = 0L;
|
402
|
+
#endif
|
403
|
+
|
404
|
+
/* Initialize the first block of the first file: */
|
405
|
+
init_block(s);
|
406
|
+
}
|
407
|
+
|
408
|
+
/* ===========================================================================
|
409
|
+
* Initialize a new block.
|
410
|
+
*/
|
411
|
+
local void init_block(s)
|
412
|
+
deflate_state *s;
|
413
|
+
{
|
414
|
+
int n; /* iterates over tree elements */
|
415
|
+
|
416
|
+
/* Initialize the trees. */
|
417
|
+
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
|
418
|
+
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
|
419
|
+
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
|
420
|
+
|
421
|
+
s->dyn_ltree[END_BLOCK].Freq = 1;
|
422
|
+
s->opt_len = s->static_len = 0L;
|
423
|
+
s->last_lit = s->matches = 0;
|
424
|
+
}
|
425
|
+
|
426
|
+
#define SMALLEST 1
|
427
|
+
/* Index within the heap array of least frequent node in the Huffman tree */
|
428
|
+
|
429
|
+
|
430
|
+
/* ===========================================================================
|
431
|
+
* Remove the smallest element from the heap and recreate the heap with
|
432
|
+
* one less element. Updates heap and heap_len.
|
433
|
+
*/
|
434
|
+
#define pqremove(s, tree, top) \
|
435
|
+
{\
|
436
|
+
top = s->heap[SMALLEST]; \
|
437
|
+
s->heap[SMALLEST] = s->heap[s->heap_len--]; \
|
438
|
+
pqdownheap(s, tree, SMALLEST); \
|
439
|
+
}
|
440
|
+
|
441
|
+
/* ===========================================================================
|
442
|
+
* Compares to subtrees, using the tree depth as tie breaker when
|
443
|
+
* the subtrees have equal frequency. This minimizes the worst case length.
|
444
|
+
*/
|
445
|
+
#define smaller(tree, n, m, depth) \
|
446
|
+
(tree[n].Freq < tree[m].Freq || \
|
447
|
+
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
|
448
|
+
|
449
|
+
/* ===========================================================================
|
450
|
+
* Restore the heap property by moving down the tree starting at node k,
|
451
|
+
* exchanging a node with the smallest of its two sons if necessary, stopping
|
452
|
+
* when the heap property is re-established (each father smaller than its
|
453
|
+
* two sons).
|
454
|
+
*/
|
455
|
+
local void pqdownheap(s, tree, k)
|
456
|
+
deflate_state *s;
|
457
|
+
ct_data *tree; /* the tree to restore */
|
458
|
+
int k; /* node to move down */
|
459
|
+
{
|
460
|
+
int v = s->heap[k];
|
461
|
+
int j = k << 1; /* left son of k */
|
462
|
+
while (j <= s->heap_len) {
|
463
|
+
/* Set j to the smallest of the two sons: */
|
464
|
+
if (j < s->heap_len &&
|
465
|
+
smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
|
466
|
+
j++;
|
467
|
+
}
|
468
|
+
/* Exit if v is smaller than both sons */
|
469
|
+
if (smaller(tree, v, s->heap[j], s->depth)) break;
|
470
|
+
|
471
|
+
/* Exchange v with the smallest son */
|
472
|
+
s->heap[k] = s->heap[j]; k = j;
|
473
|
+
|
474
|
+
/* And continue down the tree, setting j to the left son of k */
|
475
|
+
j <<= 1;
|
476
|
+
}
|
477
|
+
s->heap[k] = v;
|
478
|
+
}
|
479
|
+
|
480
|
+
/* ===========================================================================
|
481
|
+
* Compute the optimal bit lengths for a tree and update the total bit length
|
482
|
+
* for the current block.
|
483
|
+
* IN assertion: the fields freq and dad are set, heap[heap_max] and
|
484
|
+
* above are the tree nodes sorted by increasing frequency.
|
485
|
+
* OUT assertions: the field len is set to the optimal bit length, the
|
486
|
+
* array bl_count contains the frequencies for each bit length.
|
487
|
+
* The length opt_len is updated; static_len is also updated if stree is
|
488
|
+
* not null.
|
489
|
+
*/
|
490
|
+
local void gen_bitlen(s, desc)
|
491
|
+
deflate_state *s;
|
492
|
+
tree_desc *desc; /* the tree descriptor */
|
493
|
+
{
|
494
|
+
ct_data *tree = desc->dyn_tree;
|
495
|
+
int max_code = desc->max_code;
|
496
|
+
const ct_data *stree = desc->stat_desc->static_tree;
|
497
|
+
const intf *extra = desc->stat_desc->extra_bits;
|
498
|
+
int base = desc->stat_desc->extra_base;
|
499
|
+
int max_length = desc->stat_desc->max_length;
|
500
|
+
int h; /* heap index */
|
501
|
+
int n, m; /* iterate over the tree elements */
|
502
|
+
int bits; /* bit length */
|
503
|
+
int xbits; /* extra bits */
|
504
|
+
ush f; /* frequency */
|
505
|
+
int overflow = 0; /* number of elements with bit length too large */
|
506
|
+
|
507
|
+
for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
|
508
|
+
|
509
|
+
/* In a first pass, compute the optimal bit lengths (which may
|
510
|
+
* overflow in the case of the bit length tree).
|
511
|
+
*/
|
512
|
+
tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
|
513
|
+
|
514
|
+
for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
|
515
|
+
n = s->heap[h];
|
516
|
+
bits = tree[tree[n].Dad].Len + 1;
|
517
|
+
if (bits > max_length) bits = max_length, overflow++;
|
518
|
+
tree[n].Len = (ush)bits;
|
519
|
+
/* We overwrite tree[n].Dad which is no longer needed */
|
520
|
+
|
521
|
+
if (n > max_code) continue; /* not a leaf node */
|
522
|
+
|
523
|
+
s->bl_count[bits]++;
|
524
|
+
xbits = 0;
|
525
|
+
if (n >= base) xbits = extra[n-base];
|
526
|
+
f = tree[n].Freq;
|
527
|
+
s->opt_len += (ulg)f * (bits + xbits);
|
528
|
+
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
|
529
|
+
}
|
530
|
+
if (overflow == 0) return;
|
531
|
+
|
532
|
+
Trace((stderr,"\nbit length overflow\n"));
|
533
|
+
/* This happens for example on obj2 and pic of the Calgary corpus */
|
534
|
+
|
535
|
+
/* Find the first bit length which could increase: */
|
536
|
+
do {
|
537
|
+
bits = max_length-1;
|
538
|
+
while (s->bl_count[bits] == 0) bits--;
|
539
|
+
s->bl_count[bits]--; /* move one leaf down the tree */
|
540
|
+
s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
|
541
|
+
s->bl_count[max_length]--;
|
542
|
+
/* The brother of the overflow item also moves one step up,
|
543
|
+
* but this does not affect bl_count[max_length]
|
544
|
+
*/
|
545
|
+
overflow -= 2;
|
546
|
+
} while (overflow > 0);
|
547
|
+
|
548
|
+
/* Now recompute all bit lengths, scanning in increasing frequency.
|
549
|
+
* h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
|
550
|
+
* lengths instead of fixing only the wrong ones. This idea is taken
|
551
|
+
* from 'ar' written by Haruhiko Okumura.)
|
552
|
+
*/
|
553
|
+
for (bits = max_length; bits != 0; bits--) {
|
554
|
+
n = s->bl_count[bits];
|
555
|
+
while (n != 0) {
|
556
|
+
m = s->heap[--h];
|
557
|
+
if (m > max_code) continue;
|
558
|
+
if ((unsigned) tree[m].Len != (unsigned) bits) {
|
559
|
+
Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
|
560
|
+
s->opt_len += ((long)bits - (long)tree[m].Len)
|
561
|
+
*(long)tree[m].Freq;
|
562
|
+
tree[m].Len = (ush)bits;
|
563
|
+
}
|
564
|
+
n--;
|
565
|
+
}
|
566
|
+
}
|
567
|
+
}
|
568
|
+
|
569
|
+
/* ===========================================================================
|
570
|
+
* Generate the codes for a given tree and bit counts (which need not be
|
571
|
+
* optimal).
|
572
|
+
* IN assertion: the array bl_count contains the bit length statistics for
|
573
|
+
* the given tree and the field len is set for all tree elements.
|
574
|
+
* OUT assertion: the field code is set for all tree elements of non
|
575
|
+
* zero code length.
|
576
|
+
*/
|
577
|
+
local void gen_codes (tree, max_code, bl_count)
|
578
|
+
ct_data *tree; /* the tree to decorate */
|
579
|
+
int max_code; /* largest code with non zero frequency */
|
580
|
+
ushf *bl_count; /* number of codes at each bit length */
|
581
|
+
{
|
582
|
+
ush next_code[MAX_BITS+1]; /* next code value for each bit length */
|
583
|
+
ush code = 0; /* running code value */
|
584
|
+
int bits; /* bit index */
|
585
|
+
int n; /* code index */
|
586
|
+
|
587
|
+
/* The distribution counts are first used to generate the code values
|
588
|
+
* without bit reversal.
|
589
|
+
*/
|
590
|
+
for (bits = 1; bits <= MAX_BITS; bits++) {
|
591
|
+
next_code[bits] = code = (code + bl_count[bits-1]) << 1;
|
592
|
+
}
|
593
|
+
/* Check that the bit counts in bl_count are consistent. The last code
|
594
|
+
* must be all ones.
|
595
|
+
*/
|
596
|
+
Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
|
597
|
+
"inconsistent bit counts");
|
598
|
+
Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
|
599
|
+
|
600
|
+
for (n = 0; n <= max_code; n++) {
|
601
|
+
int len = tree[n].Len;
|
602
|
+
if (len == 0) continue;
|
603
|
+
/* Now reverse the bits */
|
604
|
+
tree[n].Code = bi_reverse(next_code[len]++, len);
|
605
|
+
|
606
|
+
Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
|
607
|
+
n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
608
|
+
}
|
609
|
+
}
|
610
|
+
|
611
|
+
/* ===========================================================================
|
612
|
+
* Construct one Huffman tree and assigns the code bit strings and lengths.
|
613
|
+
* Update the total bit length for the current block.
|
614
|
+
* IN assertion: the field freq is set for all tree elements.
|
615
|
+
* OUT assertions: the fields len and code are set to the optimal bit length
|
616
|
+
* and corresponding code. The length opt_len is updated; static_len is
|
617
|
+
* also updated if stree is not null. The field max_code is set.
|
618
|
+
*/
|
619
|
+
local void build_tree(s, desc)
|
620
|
+
deflate_state *s;
|
621
|
+
tree_desc *desc; /* the tree descriptor */
|
622
|
+
{
|
623
|
+
ct_data *tree = desc->dyn_tree;
|
624
|
+
const ct_data *stree = desc->stat_desc->static_tree;
|
625
|
+
int elems = desc->stat_desc->elems;
|
626
|
+
int n, m; /* iterate over heap elements */
|
627
|
+
int max_code = -1; /* largest code with non zero frequency */
|
628
|
+
int node; /* new node being created */
|
629
|
+
|
630
|
+
/* Construct the initial heap, with least frequent element in
|
631
|
+
* heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
|
632
|
+
* heap[0] is not used.
|
633
|
+
*/
|
634
|
+
s->heap_len = 0, s->heap_max = HEAP_SIZE;
|
635
|
+
|
636
|
+
for (n = 0; n < elems; n++) {
|
637
|
+
if (tree[n].Freq != 0) {
|
638
|
+
s->heap[++(s->heap_len)] = max_code = n;
|
639
|
+
s->depth[n] = 0;
|
640
|
+
} else {
|
641
|
+
tree[n].Len = 0;
|
642
|
+
}
|
643
|
+
}
|
644
|
+
|
645
|
+
/* The pkzip format requires that at least one distance code exists,
|
646
|
+
* and that at least one bit should be sent even if there is only one
|
647
|
+
* possible code. So to avoid special checks later on we force at least
|
648
|
+
* two codes of non zero frequency.
|
649
|
+
*/
|
650
|
+
while (s->heap_len < 2) {
|
651
|
+
node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
|
652
|
+
tree[node].Freq = 1;
|
653
|
+
s->depth[node] = 0;
|
654
|
+
s->opt_len--; if (stree) s->static_len -= stree[node].Len;
|
655
|
+
/* node is 0 or 1 so it does not have extra bits */
|
656
|
+
}
|
657
|
+
desc->max_code = max_code;
|
658
|
+
|
659
|
+
/* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
|
660
|
+
* establish sub-heaps of increasing lengths:
|
661
|
+
*/
|
662
|
+
for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
|
663
|
+
|
664
|
+
/* Construct the Huffman tree by repeatedly combining the least two
|
665
|
+
* frequent nodes.
|
666
|
+
*/
|
667
|
+
node = elems; /* next internal node of the tree */
|
668
|
+
do {
|
669
|
+
pqremove(s, tree, n); /* n = node of least frequency */
|
670
|
+
m = s->heap[SMALLEST]; /* m = node of next least frequency */
|
671
|
+
|
672
|
+
s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
|
673
|
+
s->heap[--(s->heap_max)] = m;
|
674
|
+
|
675
|
+
/* Create a new node father of n and m */
|
676
|
+
tree[node].Freq = tree[n].Freq + tree[m].Freq;
|
677
|
+
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
|
678
|
+
s->depth[n] : s->depth[m]) + 1);
|
679
|
+
tree[n].Dad = tree[m].Dad = (ush)node;
|
680
|
+
#ifdef DUMP_BL_TREE
|
681
|
+
if (tree == s->bl_tree) {
|
682
|
+
fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)",
|
683
|
+
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
|
684
|
+
}
|
685
|
+
#endif
|
686
|
+
/* and insert the new node in the heap */
|
687
|
+
s->heap[SMALLEST] = node++;
|
688
|
+
pqdownheap(s, tree, SMALLEST);
|
689
|
+
|
690
|
+
} while (s->heap_len >= 2);
|
691
|
+
|
692
|
+
s->heap[--(s->heap_max)] = s->heap[SMALLEST];
|
693
|
+
|
694
|
+
/* At this point, the fields freq and dad are set. We can now
|
695
|
+
* generate the bit lengths.
|
696
|
+
*/
|
697
|
+
gen_bitlen(s, (tree_desc *)desc);
|
698
|
+
|
699
|
+
/* The field len is now set, we can generate the bit codes */
|
700
|
+
gen_codes ((ct_data *)tree, max_code, s->bl_count);
|
701
|
+
}
|
702
|
+
|
703
|
+
/* ===========================================================================
|
704
|
+
* Scan a literal or distance tree to determine the frequencies of the codes
|
705
|
+
* in the bit length tree.
|
706
|
+
*/
|
707
|
+
local void scan_tree (s, tree, max_code)
|
708
|
+
deflate_state *s;
|
709
|
+
ct_data *tree; /* the tree to be scanned */
|
710
|
+
int max_code; /* and its largest code of non zero frequency */
|
711
|
+
{
|
712
|
+
int n; /* iterates over all tree elements */
|
713
|
+
int prevlen = -1; /* last emitted length */
|
714
|
+
int curlen; /* length of current code */
|
715
|
+
int nextlen = tree[0].Len; /* length of next code */
|
716
|
+
int count = 0; /* repeat count of the current code */
|
717
|
+
int max_count = 7; /* max repeat count */
|
718
|
+
int min_count = 4; /* min repeat count */
|
719
|
+
|
720
|
+
if (nextlen == 0) max_count = 138, min_count = 3;
|
721
|
+
tree[max_code+1].Len = (ush)0xffff; /* guard */
|
722
|
+
|
723
|
+
for (n = 0; n <= max_code; n++) {
|
724
|
+
curlen = nextlen; nextlen = tree[n+1].Len;
|
725
|
+
if (++count < max_count && curlen == nextlen) {
|
726
|
+
continue;
|
727
|
+
} else if (count < min_count) {
|
728
|
+
s->bl_tree[curlen].Freq += count;
|
729
|
+
} else if (curlen != 0) {
|
730
|
+
if (curlen != prevlen) s->bl_tree[curlen].Freq++;
|
731
|
+
s->bl_tree[REP_3_6].Freq++;
|
732
|
+
} else if (count <= 10) {
|
733
|
+
s->bl_tree[REPZ_3_10].Freq++;
|
734
|
+
} else {
|
735
|
+
s->bl_tree[REPZ_11_138].Freq++;
|
736
|
+
}
|
737
|
+
count = 0; prevlen = curlen;
|
738
|
+
if (nextlen == 0) {
|
739
|
+
max_count = 138, min_count = 3;
|
740
|
+
} else if (curlen == nextlen) {
|
741
|
+
max_count = 6, min_count = 3;
|
742
|
+
} else {
|
743
|
+
max_count = 7, min_count = 4;
|
744
|
+
}
|
745
|
+
}
|
746
|
+
}
|
747
|
+
|
748
|
+
/* ===========================================================================
|
749
|
+
* Send a literal or distance tree in compressed form, using the codes in
|
750
|
+
* bl_tree.
|
751
|
+
*/
|
752
|
+
local void send_tree (s, tree, max_code)
|
753
|
+
deflate_state *s;
|
754
|
+
ct_data *tree; /* the tree to be scanned */
|
755
|
+
int max_code; /* and its largest code of non zero frequency */
|
756
|
+
{
|
757
|
+
int n; /* iterates over all tree elements */
|
758
|
+
int prevlen = -1; /* last emitted length */
|
759
|
+
int curlen; /* length of current code */
|
760
|
+
int nextlen = tree[0].Len; /* length of next code */
|
761
|
+
int count = 0; /* repeat count of the current code */
|
762
|
+
int max_count = 7; /* max repeat count */
|
763
|
+
int min_count = 4; /* min repeat count */
|
764
|
+
|
765
|
+
/* tree[max_code+1].Len = -1; */ /* guard already set */
|
766
|
+
if (nextlen == 0) max_count = 138, min_count = 3;
|
767
|
+
|
768
|
+
for (n = 0; n <= max_code; n++) {
|
769
|
+
curlen = nextlen; nextlen = tree[n+1].Len;
|
770
|
+
if (++count < max_count && curlen == nextlen) {
|
771
|
+
continue;
|
772
|
+
} else if (count < min_count) {
|
773
|
+
do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
|
774
|
+
|
775
|
+
} else if (curlen != 0) {
|
776
|
+
if (curlen != prevlen) {
|
777
|
+
send_code(s, curlen, s->bl_tree); count--;
|
778
|
+
}
|
779
|
+
Assert(count >= 3 && count <= 6, " 3_6?");
|
780
|
+
send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
|
781
|
+
|
782
|
+
} else if (count <= 10) {
|
783
|
+
send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
|
784
|
+
|
785
|
+
} else {
|
786
|
+
send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
|
787
|
+
}
|
788
|
+
count = 0; prevlen = curlen;
|
789
|
+
if (nextlen == 0) {
|
790
|
+
max_count = 138, min_count = 3;
|
791
|
+
} else if (curlen == nextlen) {
|
792
|
+
max_count = 6, min_count = 3;
|
793
|
+
} else {
|
794
|
+
max_count = 7, min_count = 4;
|
795
|
+
}
|
796
|
+
}
|
797
|
+
}
|
798
|
+
|
799
|
+
/* ===========================================================================
|
800
|
+
* Construct the Huffman tree for the bit lengths and return the index in
|
801
|
+
* bl_order of the last bit length code to send.
|
802
|
+
*/
|
803
|
+
local int build_bl_tree(s)
|
804
|
+
deflate_state *s;
|
805
|
+
{
|
806
|
+
int max_blindex; /* index of last bit length code of non zero freq */
|
807
|
+
|
808
|
+
/* Determine the bit length frequencies for literal and distance trees */
|
809
|
+
scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
|
810
|
+
scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
|
811
|
+
|
812
|
+
/* Build the bit length tree: */
|
813
|
+
build_tree(s, (tree_desc *)(&(s->bl_desc)));
|
814
|
+
/* opt_len now includes the length of the tree representations, except
|
815
|
+
* the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
|
816
|
+
*/
|
817
|
+
|
818
|
+
/* Determine the number of bit length codes to send. The pkzip format
|
819
|
+
* requires that at least 4 bit length codes be sent. (appnote.txt says
|
820
|
+
* 3 but the actual value used is 4.)
|
821
|
+
*/
|
822
|
+
for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
|
823
|
+
if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
|
824
|
+
}
|
825
|
+
/* Update opt_len to include the bit length tree and counts */
|
826
|
+
s->opt_len += 3*(max_blindex+1) + 5+5+4;
|
827
|
+
Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
|
828
|
+
s->opt_len, s->static_len));
|
829
|
+
|
830
|
+
return max_blindex;
|
831
|
+
}
|
832
|
+
|
833
|
+
/* ===========================================================================
|
834
|
+
* Send the header for a block using dynamic Huffman trees: the counts, the
|
835
|
+
* lengths of the bit length codes, the literal tree and the distance tree.
|
836
|
+
* IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
|
837
|
+
*/
|
838
|
+
local void send_all_trees(s, lcodes, dcodes, blcodes)
|
839
|
+
deflate_state *s;
|
840
|
+
int lcodes, dcodes, blcodes; /* number of codes for each tree */
|
841
|
+
{
|
842
|
+
int rank; /* index in bl_order */
|
843
|
+
|
844
|
+
Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
|
845
|
+
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
846
|
+
"too many codes");
|
847
|
+
Tracev((stderr, "\nbl counts: "));
|
848
|
+
send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */
|
849
|
+
send_bits(s, dcodes-1, 5);
|
850
|
+
send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
|
851
|
+
for (rank = 0; rank < blcodes; rank++) {
|
852
|
+
Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
|
853
|
+
send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
|
854
|
+
}
|
855
|
+
Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));
|
856
|
+
|
857
|
+
send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
|
858
|
+
Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));
|
859
|
+
|
860
|
+
send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
|
861
|
+
Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
|
862
|
+
}
|
863
|
+
|
864
|
+
/* ===========================================================================
|
865
|
+
* Send a stored block
|
866
|
+
*/
|
867
|
+
void _tr_stored_block(s, buf, stored_len, eof)
|
868
|
+
deflate_state *s;
|
869
|
+
charf *buf; /* input block */
|
870
|
+
ulg stored_len; /* length of input block */
|
871
|
+
int eof; /* true if this is the last block for a file */
|
872
|
+
{
|
873
|
+
send_bits(s, (STORED_BLOCK<<1)+eof, 3); /* send block type */
|
874
|
+
#ifdef DEBUG
|
875
|
+
s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
|
876
|
+
s->compressed_len += (stored_len + 4) << 3;
|
877
|
+
#endif
|
878
|
+
copy_block(s, buf, (unsigned)stored_len, 1); /* with header */
|
879
|
+
}
|
880
|
+
|
881
|
+
/* ===========================================================================
|
882
|
+
* Send one empty static block to give enough lookahead for inflate.
|
883
|
+
* This takes 10 bits, of which 7 may remain in the bit buffer.
|
884
|
+
* The current inflate code requires 9 bits of lookahead. If the
|
885
|
+
* last two codes for the previous block (real code plus EOB) were coded
|
886
|
+
* on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
|
887
|
+
* the last real code. In this case we send two empty static blocks instead
|
888
|
+
* of one. (There are no problems if the previous block is stored or fixed.)
|
889
|
+
* To simplify the code, we assume the worst case of last real code encoded
|
890
|
+
* on one bit only.
|
891
|
+
*/
|
892
|
+
void _tr_align(s)
|
893
|
+
deflate_state *s;
|
894
|
+
{
|
895
|
+
send_bits(s, STATIC_TREES<<1, 3);
|
896
|
+
send_code(s, END_BLOCK, static_ltree);
|
897
|
+
#ifdef DEBUG
|
898
|
+
s->compressed_len += 10L; /* 3 for block type, 7 for EOB */
|
899
|
+
#endif
|
900
|
+
bi_flush(s);
|
901
|
+
/* Of the 10 bits for the empty block, we have already sent
|
902
|
+
* (10 - bi_valid) bits. The lookahead for the last real code (before
|
903
|
+
* the EOB of the previous block) was thus at least one plus the length
|
904
|
+
* of the EOB plus what we have just sent of the empty static block.
|
905
|
+
*/
|
906
|
+
if (1 + s->last_eob_len + 10 - s->bi_valid < 9) {
|
907
|
+
send_bits(s, STATIC_TREES<<1, 3);
|
908
|
+
send_code(s, END_BLOCK, static_ltree);
|
909
|
+
#ifdef DEBUG
|
910
|
+
s->compressed_len += 10L;
|
911
|
+
#endif
|
912
|
+
bi_flush(s);
|
913
|
+
}
|
914
|
+
s->last_eob_len = 7;
|
915
|
+
}
|
916
|
+
|
917
|
+
/* ===========================================================================
|
918
|
+
* Determine the best encoding for the current block: dynamic trees, static
|
919
|
+
* trees or store, and output the encoded block to the zip file.
|
920
|
+
*/
|
921
|
+
void _tr_flush_block(s, buf, stored_len, eof)
|
922
|
+
deflate_state *s;
|
923
|
+
charf *buf; /* input block, or NULL if too old */
|
924
|
+
ulg stored_len; /* length of input block */
|
925
|
+
int eof; /* true if this is the last block for a file */
|
926
|
+
{
|
927
|
+
ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
|
928
|
+
int max_blindex = 0; /* index of last bit length code of non zero freq */
|
929
|
+
|
930
|
+
/* Build the Huffman trees unless a stored block is forced */
|
931
|
+
if (s->level > 0) {
|
932
|
+
|
933
|
+
/* Check if the file is binary or text */
|
934
|
+
if (stored_len > 0 && s->strm->data_type == Z_UNKNOWN)
|
935
|
+
set_data_type(s);
|
936
|
+
|
937
|
+
/* Construct the literal and distance trees */
|
938
|
+
build_tree(s, (tree_desc *)(&(s->l_desc)));
|
939
|
+
Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,
|
940
|
+
s->static_len));
|
941
|
+
|
942
|
+
build_tree(s, (tree_desc *)(&(s->d_desc)));
|
943
|
+
Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,
|
944
|
+
s->static_len));
|
945
|
+
/* At this point, opt_len and static_len are the total bit lengths of
|
946
|
+
* the compressed block data, excluding the tree representations.
|
947
|
+
*/
|
948
|
+
|
949
|
+
/* Build the bit length tree for the above two trees, and get the index
|
950
|
+
* in bl_order of the last bit length code to send.
|
951
|
+
*/
|
952
|
+
max_blindex = build_bl_tree(s);
|
953
|
+
|
954
|
+
/* Determine the best encoding. Compute the block lengths in bytes. */
|
955
|
+
opt_lenb = (s->opt_len+3+7)>>3;
|
956
|
+
static_lenb = (s->static_len+3+7)>>3;
|
957
|
+
|
958
|
+
Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",
|
959
|
+
opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,
|
960
|
+
s->last_lit));
|
961
|
+
|
962
|
+
if (static_lenb <= opt_lenb) opt_lenb = static_lenb;
|
963
|
+
|
964
|
+
} else {
|
965
|
+
Assert(buf != (char*)0, "lost buf");
|
966
|
+
opt_lenb = static_lenb = stored_len + 5; /* force a stored block */
|
967
|
+
}
|
968
|
+
|
969
|
+
#ifdef FORCE_STORED
|
970
|
+
if (buf != (char*)0) { /* force stored block */
|
971
|
+
#else
|
972
|
+
if (stored_len+4 <= opt_lenb && buf != (char*)0) {
|
973
|
+
/* 4: two words for the lengths */
|
974
|
+
#endif
|
975
|
+
/* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
|
976
|
+
* Otherwise we can't have processed more than WSIZE input bytes since
|
977
|
+
* the last block flush, because compression would have been
|
978
|
+
* successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
|
979
|
+
* transform a block into a stored block.
|
980
|
+
*/
|
981
|
+
_tr_stored_block(s, buf, stored_len, eof);
|
982
|
+
|
983
|
+
#ifdef FORCE_STATIC
|
984
|
+
} else if (static_lenb >= 0) { /* force static trees */
|
985
|
+
#else
|
986
|
+
} else if (s->strategy == Z_FIXED || static_lenb == opt_lenb) {
|
987
|
+
#endif
|
988
|
+
send_bits(s, (STATIC_TREES<<1)+eof, 3);
|
989
|
+
compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
|
990
|
+
#ifdef DEBUG
|
991
|
+
s->compressed_len += 3 + s->static_len;
|
992
|
+
#endif
|
993
|
+
} else {
|
994
|
+
send_bits(s, (DYN_TREES<<1)+eof, 3);
|
995
|
+
send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,
|
996
|
+
max_blindex+1);
|
997
|
+
compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
|
998
|
+
#ifdef DEBUG
|
999
|
+
s->compressed_len += 3 + s->opt_len;
|
1000
|
+
#endif
|
1001
|
+
}
|
1002
|
+
Assert (s->compressed_len == s->bits_sent, "bad compressed size");
|
1003
|
+
/* The above check is made mod 2^32, for files larger than 512 MB
|
1004
|
+
* and uLong implemented on 32 bits.
|
1005
|
+
*/
|
1006
|
+
init_block(s);
|
1007
|
+
|
1008
|
+
if (eof) {
|
1009
|
+
bi_windup(s);
|
1010
|
+
#ifdef DEBUG
|
1011
|
+
s->compressed_len += 7; /* align on byte boundary */
|
1012
|
+
#endif
|
1013
|
+
}
|
1014
|
+
Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,
|
1015
|
+
s->compressed_len-7*eof));
|
1016
|
+
}
|
1017
|
+
|
1018
|
+
/* ===========================================================================
|
1019
|
+
* Save the match info and tally the frequency counts. Return true if
|
1020
|
+
* the current block must be flushed.
|
1021
|
+
*/
|
1022
|
+
int _tr_tally (s, dist, lc)
|
1023
|
+
deflate_state *s;
|
1024
|
+
unsigned dist; /* distance of matched string */
|
1025
|
+
unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
|
1026
|
+
{
|
1027
|
+
s->d_buf[s->last_lit] = (ush)dist;
|
1028
|
+
s->l_buf[s->last_lit++] = (uch)lc;
|
1029
|
+
if (dist == 0) {
|
1030
|
+
/* lc is the unmatched char */
|
1031
|
+
s->dyn_ltree[lc].Freq++;
|
1032
|
+
} else {
|
1033
|
+
s->matches++;
|
1034
|
+
/* Here, lc is the match length - MIN_MATCH */
|
1035
|
+
dist--; /* dist = match distance - 1 */
|
1036
|
+
Assert((ush)dist < (ush)MAX_DIST(s) &&
|
1037
|
+
(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
|
1038
|
+
(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
|
1039
|
+
|
1040
|
+
s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
|
1041
|
+
s->dyn_dtree[d_code(dist)].Freq++;
|
1042
|
+
}
|
1043
|
+
|
1044
|
+
#ifdef TRUNCATE_BLOCK
|
1045
|
+
/* Try to guess if it is profitable to stop the current block here */
|
1046
|
+
if ((s->last_lit & 0x1fff) == 0 && s->level > 2) {
|
1047
|
+
/* Compute an upper bound for the compressed length */
|
1048
|
+
ulg out_length = (ulg)s->last_lit*8L;
|
1049
|
+
ulg in_length = (ulg)((long)s->strstart - s->block_start);
|
1050
|
+
int dcode;
|
1051
|
+
for (dcode = 0; dcode < D_CODES; dcode++) {
|
1052
|
+
out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
1053
|
+
(5L+extra_dbits[dcode]);
|
1054
|
+
}
|
1055
|
+
out_length >>= 3;
|
1056
|
+
Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",
|
1057
|
+
s->last_lit, in_length, out_length,
|
1058
|
+
100L - out_length*100L/in_length));
|
1059
|
+
if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1;
|
1060
|
+
}
|
1061
|
+
#endif
|
1062
|
+
return (s->last_lit == s->lit_bufsize-1);
|
1063
|
+
/* We avoid equality with lit_bufsize because of wraparound at 64K
|
1064
|
+
* on 16 bit machines and because stored blocks are restricted to
|
1065
|
+
* 64K-1 bytes.
|
1066
|
+
*/
|
1067
|
+
}
|
1068
|
+
|
1069
|
+
/* ===========================================================================
|
1070
|
+
* Send the block data compressed using the given Huffman trees
|
1071
|
+
*/
|
1072
|
+
local void compress_block(s, ltree, dtree)
|
1073
|
+
deflate_state *s;
|
1074
|
+
ct_data *ltree; /* literal tree */
|
1075
|
+
ct_data *dtree; /* distance tree */
|
1076
|
+
{
|
1077
|
+
unsigned dist; /* distance of matched string */
|
1078
|
+
int lc; /* match length or unmatched char (if dist == 0) */
|
1079
|
+
unsigned lx = 0; /* running index in l_buf */
|
1080
|
+
unsigned code; /* the code to send */
|
1081
|
+
int extra; /* number of extra bits to send */
|
1082
|
+
|
1083
|
+
if (s->last_lit != 0) do {
|
1084
|
+
dist = s->d_buf[lx];
|
1085
|
+
lc = s->l_buf[lx++];
|
1086
|
+
if (dist == 0) {
|
1087
|
+
send_code(s, lc, ltree); /* send a literal byte */
|
1088
|
+
Tracecv(isgraph(lc), (stderr," '%c' ", lc));
|
1089
|
+
} else {
|
1090
|
+
/* Here, lc is the match length - MIN_MATCH */
|
1091
|
+
code = _length_code[lc];
|
1092
|
+
send_code(s, code+LITERALS+1, ltree); /* send the length code */
|
1093
|
+
extra = extra_lbits[code];
|
1094
|
+
if (extra != 0) {
|
1095
|
+
lc -= base_length[code];
|
1096
|
+
send_bits(s, lc, extra); /* send the extra length bits */
|
1097
|
+
}
|
1098
|
+
dist--; /* dist is now the match distance - 1 */
|
1099
|
+
code = d_code(dist);
|
1100
|
+
Assert (code < D_CODES, "bad d_code");
|
1101
|
+
|
1102
|
+
send_code(s, code, dtree); /* send the distance code */
|
1103
|
+
extra = extra_dbits[code];
|
1104
|
+
if (extra != 0) {
|
1105
|
+
dist -= base_dist[code];
|
1106
|
+
send_bits(s, dist, extra); /* send the extra distance bits */
|
1107
|
+
}
|
1108
|
+
} /* literal or match pair ? */
|
1109
|
+
|
1110
|
+
/* Check that the overlay between pending_buf and d_buf+l_buf is ok: */
|
1111
|
+
Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,
|
1112
|
+
"pendingBuf overflow");
|
1113
|
+
|
1114
|
+
} while (lx < s->last_lit);
|
1115
|
+
|
1116
|
+
send_code(s, END_BLOCK, ltree);
|
1117
|
+
s->last_eob_len = ltree[END_BLOCK].Len;
|
1118
|
+
}
|
1119
|
+
|
1120
|
+
/* ===========================================================================
|
1121
|
+
* Set the data type to BINARY or TEXT, using a crude approximation:
|
1122
|
+
* set it to Z_TEXT if all symbols are either printable characters (33 to 255)
|
1123
|
+
* or white spaces (9 to 13, or 32); or set it to Z_BINARY otherwise.
|
1124
|
+
* IN assertion: the fields Freq of dyn_ltree are set.
|
1125
|
+
*/
|
1126
|
+
local void set_data_type(s)
|
1127
|
+
deflate_state *s;
|
1128
|
+
{
|
1129
|
+
int n;
|
1130
|
+
|
1131
|
+
for (n = 0; n < 9; n++)
|
1132
|
+
if (s->dyn_ltree[n].Freq != 0)
|
1133
|
+
break;
|
1134
|
+
if (n == 9)
|
1135
|
+
for (n = 14; n < 32; n++)
|
1136
|
+
if (s->dyn_ltree[n].Freq != 0)
|
1137
|
+
break;
|
1138
|
+
s->strm->data_type = (n == 32) ? Z_TEXT : Z_BINARY;
|
1139
|
+
}
|
1140
|
+
|
1141
|
+
/* ===========================================================================
|
1142
|
+
* Reverse the first len bits of a code, using straightforward code (a faster
|
1143
|
+
* method would use a table)
|
1144
|
+
* IN assertion: 1 <= len <= 15
|
1145
|
+
*/
|
1146
|
+
local unsigned bi_reverse(code, len)
|
1147
|
+
unsigned code; /* the value to invert */
|
1148
|
+
int len; /* its bit length */
|
1149
|
+
{
|
1150
|
+
register unsigned res = 0;
|
1151
|
+
do {
|
1152
|
+
res |= code & 1;
|
1153
|
+
code >>= 1, res <<= 1;
|
1154
|
+
} while (--len > 0);
|
1155
|
+
return res >> 1;
|
1156
|
+
}
|
1157
|
+
|
1158
|
+
/* ===========================================================================
|
1159
|
+
* Flush the bit buffer, keeping at most 7 bits in it.
|
1160
|
+
*/
|
1161
|
+
local void bi_flush(s)
|
1162
|
+
deflate_state *s;
|
1163
|
+
{
|
1164
|
+
if (s->bi_valid == 16) {
|
1165
|
+
put_short(s, s->bi_buf);
|
1166
|
+
s->bi_buf = 0;
|
1167
|
+
s->bi_valid = 0;
|
1168
|
+
} else if (s->bi_valid >= 8) {
|
1169
|
+
put_byte(s, (Byte)s->bi_buf);
|
1170
|
+
s->bi_buf >>= 8;
|
1171
|
+
s->bi_valid -= 8;
|
1172
|
+
}
|
1173
|
+
}
|
1174
|
+
|
1175
|
+
/* ===========================================================================
|
1176
|
+
* Flush the bit buffer and align the output on a byte boundary
|
1177
|
+
*/
|
1178
|
+
local void bi_windup(s)
|
1179
|
+
deflate_state *s;
|
1180
|
+
{
|
1181
|
+
if (s->bi_valid > 8) {
|
1182
|
+
put_short(s, s->bi_buf);
|
1183
|
+
} else if (s->bi_valid > 0) {
|
1184
|
+
put_byte(s, (Byte)s->bi_buf);
|
1185
|
+
}
|
1186
|
+
s->bi_buf = 0;
|
1187
|
+
s->bi_valid = 0;
|
1188
|
+
#ifdef DEBUG
|
1189
|
+
s->bits_sent = (s->bits_sent+7) & ~7;
|
1190
|
+
#endif
|
1191
|
+
}
|
1192
|
+
|
1193
|
+
/* ===========================================================================
|
1194
|
+
* Copy a stored block, storing first the length and its
|
1195
|
+
* one's complement if requested.
|
1196
|
+
*/
|
1197
|
+
local void copy_block(s, buf, len, header)
|
1198
|
+
deflate_state *s;
|
1199
|
+
charf *buf; /* the input data */
|
1200
|
+
unsigned len; /* its length */
|
1201
|
+
int header; /* true if block header must be written */
|
1202
|
+
{
|
1203
|
+
bi_windup(s); /* align on byte boundary */
|
1204
|
+
s->last_eob_len = 8; /* enough lookahead for inflate */
|
1205
|
+
|
1206
|
+
if (header) {
|
1207
|
+
put_short(s, (ush)len);
|
1208
|
+
put_short(s, (ush)~len);
|
1209
|
+
#ifdef DEBUG
|
1210
|
+
s->bits_sent += 2*16;
|
1211
|
+
#endif
|
1212
|
+
}
|
1213
|
+
#ifdef DEBUG
|
1214
|
+
s->bits_sent += (ulg)len<<3;
|
1215
|
+
#endif
|
1216
|
+
while (len--) {
|
1217
|
+
put_byte(s, *buf++);
|
1218
|
+
}
|
1219
|
+
}
|